best 238 include/crm/common/xml.h int update_validation(xmlNode **xml_blob, int *best, int max, best 94 lib/common/schemas.c static int best = 0; best 95 lib/common/schemas.c if (best == 0) { best 98 lib/common/schemas.c best = xml_latest_schema_index(); best 99 lib/common/schemas.c for (lpc = best; lpc > 0; lpc--) { best 101 lib/common/schemas.c < known_schemas[best].version.v[0]) { best 102 lib/common/schemas.c return best; best 104 lib/common/schemas.c best = lpc; best 107 lib/common/schemas.c best = xml_latest_schema_index(); best 109 lib/common/schemas.c return best; best 1050 lib/common/schemas.c update_validation(xmlNode **xml_blob, int *best, int max, gboolean transform, best 1059 lib/common/schemas.c CRM_CHECK(best != NULL, return -EINVAL); best 1060 lib/common/schemas.c *best = 0; best 1073 lib/common/schemas.c *best = lpc++; best 1084 lib/common/schemas.c *best = match; best 1102 lib/common/schemas.c if (*best) { best 1118 lib/common/schemas.c *best = lpc; best 1162 lib/common/schemas.c *best = next; best 1184 lib/common/schemas.c if (*best > match && *best) { best 1187 lib/common/schemas.c value ? value : "<none>", known_schemas[*best].name); best 1188 lib/common/schemas.c crm_xml_add(xml, XML_ATTR_VALIDATION, known_schemas[*best].name); best 36 lib/pacemaker/pcmk_resource.c xmlNode *best = NULL; best 65 lib/pacemaker/pcmk_resource.c if (best == NULL) { best 92 lib/pacemaker/pcmk_resource.c if (pe__is_newer_op(best, lrm_rsc_op, true) > 0) { best 97 lib/pacemaker/pcmk_resource.c best = lrm_rsc_op; best 103 lib/pacemaker/pcmk_resource.c return best; best 154 lib/pacemaker/pcmk_sched_primitive.c pe_node_t *best = NULL; best 170 lib/pacemaker/pcmk_sched_primitive.c best = (pe_node_t *) nodes->data; // First node has best score best 187 lib/pacemaker/pcmk_sched_primitive.c } else if (chosen->weight < best->weight) { best 204 lib/pacemaker/pcmk_sched_primitive.c if ((chosen == NULL) && (best != NULL)) { best 209 lib/pacemaker/pcmk_sched_primitive.c chosen = best; best 298 maint/gnulib/lib/diffseq.h OFFSET best = 0; best 309 maint/gnulib/lib/diffseq.h if (v > best best 320 maint/gnulib/lib/diffseq.h best = v; best 328 maint/gnulib/lib/diffseq.h if (best > 0) best 337 maint/gnulib/lib/diffseq.h OFFSET best = 0; best 348 maint/gnulib/lib/diffseq.h if (v > best best 359 maint/gnulib/lib/diffseq.h best = v; best 367 maint/gnulib/lib/diffseq.h if (best > 0) best 165 maint/gnulib/lib/inet_ntop.c } best, cur; best 177 maint/gnulib/lib/inet_ntop.c best.base = -1; best 179 maint/gnulib/lib/inet_ntop.c IF_LINT(best.len = 0); best 194 maint/gnulib/lib/inet_ntop.c if (best.base == -1 || cur.len > best.len) best 195 maint/gnulib/lib/inet_ntop.c best = cur; best 202 maint/gnulib/lib/inet_ntop.c if (best.base == -1 || cur.len > best.len) best 203 maint/gnulib/lib/inet_ntop.c best = cur; best 205 maint/gnulib/lib/inet_ntop.c if (best.base != -1 && best.len < 2) best 206 maint/gnulib/lib/inet_ntop.c best.base = -1; best 215 maint/gnulib/lib/inet_ntop.c if (best.base != -1 && i >= best.base && i < (best.base + best.len)) best 217 maint/gnulib/lib/inet_ntop.c if (i == best.base) best 225 maint/gnulib/lib/inet_ntop.c if (i == 6 && best.base == 0 && best 226 maint/gnulib/lib/inet_ntop.c (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) best 241 maint/gnulib/lib/inet_ntop.c if (best.base != -1 && (best.base + best.len) ==