best              232 include/crm/common/xml.h int update_validation(xmlNode **xml_blob, int *best, int max,
best               96 lib/common/schemas.c     static int best = 0;
best               97 lib/common/schemas.c     if (best == 0) {
best              100 lib/common/schemas.c         best = xml_latest_schema_index();
best              101 lib/common/schemas.c         for (lpc = best; lpc > 0; lpc--) {
best              103 lib/common/schemas.c                 < known_schemas[best].version.v[0]) {
best              104 lib/common/schemas.c                 return best;
best              106 lib/common/schemas.c                 best = lpc;
best              109 lib/common/schemas.c         best = xml_latest_schema_index();
best              111 lib/common/schemas.c     return best;
best             1047 lib/common/schemas.c update_validation(xmlNode **xml_blob, int *best, int max, gboolean transform,
best             1056 lib/common/schemas.c     CRM_CHECK(best != NULL, return -EINVAL);
best             1057 lib/common/schemas.c     *best = 0;
best             1070 lib/common/schemas.c             *best = lpc++;
best             1081 lib/common/schemas.c         *best = match;
best             1099 lib/common/schemas.c             if (*best) {
best             1115 lib/common/schemas.c             *best = lpc;
best             1161 lib/common/schemas.c                     *best = next;
best             1183 lib/common/schemas.c     if (*best > match && *best) {
best             1186 lib/common/schemas.c                    value ? value : "<none>", known_schemas[*best].name);
best             1187 lib/common/schemas.c         crm_xml_add(xml, XML_ATTR_VALIDATION, known_schemas[*best].name);
best               35 lib/pacemaker/pcmk_resource.c     xmlNode *best = NULL;
best               56 lib/pacemaker/pcmk_resource.c             if (best == NULL) {
best               57 lib/pacemaker/pcmk_resource.c                 best = lrm_rsc_op;
best               62 lib/pacemaker/pcmk_resource.c         best = lrm_rsc_op;
best               68 lib/pacemaker/pcmk_resource.c     return best;
best               91 lib/pacemaker/pcmk_sched_native.c     pe_node_t *best = NULL;
best              111 lib/pacemaker/pcmk_sched_native.c         best = g_list_nth_data(nodes, 0);
best              127 lib/pacemaker/pcmk_sched_native.c         } else if ((chosen->weight < 0) || (chosen->weight < best->weight)) {
best              149 lib/pacemaker/pcmk_sched_native.c         chosen = best;