best               37 lib/pacemaker/pcmk_resource.c     xmlNode *best = NULL;
best               71 lib/pacemaker/pcmk_resource.c         if (best == NULL) {
best               98 lib/pacemaker/pcmk_resource.c         if (pe__is_newer_op(best, lrm_rsc_op) > 0) {
best              103 lib/pacemaker/pcmk_resource.c          best = lrm_rsc_op;
best              109 lib/pacemaker/pcmk_resource.c     return best;
best              171 lib/pacemaker/pcmk_sched_primitive.c     pcmk_node_t *best = NULL;
best              186 lib/pacemaker/pcmk_sched_primitive.c         best = (pcmk_node_t *) nodes->data; // First node has best score
best              204 lib/pacemaker/pcmk_sched_primitive.c         } else if (chosen->assign->score < best->assign->score) {
best              223 lib/pacemaker/pcmk_sched_primitive.c     if ((chosen == NULL) && (best != NULL)) {
best              228 lib/pacemaker/pcmk_sched_primitive.c         chosen = best;