candidate 1432 lib/common/xml.c xmlNode *candidate = pcmk__xml_copy(new_parent, old_child); candidate 1435 lib/common/xml.c pcmk__xml_tree_foreach(candidate, reset_xml_node_flags, NULL); candidate 1438 lib/common/xml.c pcmk__apply_acl(xmlDocGetRootElement(candidate->doc)); candidate 1441 lib/common/xml.c free_xml_with_position(candidate, candidate 1192 lib/pengine/pe_actions.c pcmk_resource_t *candidate = gIter->data; candidate 1194 lib/pengine/pe_actions.c if (candidate->children != NULL) { candidate 1195 lib/pengine/pe_actions.c matches = find_unfencing_devices(candidate->children, matches); candidate 1197 lib/pengine/pe_actions.c } else if (!pcmk_is_set(candidate->flags, pcmk_rsc_fence_device)) { candidate 1200 lib/pengine/pe_actions.c } else if (pcmk_is_set(candidate->flags, pcmk_rsc_needs_unfencing)) { candidate 1201 lib/pengine/pe_actions.c matches = g_list_prepend(matches, candidate); candidate 1203 lib/pengine/pe_actions.c } else if (pcmk__str_eq(g_hash_table_lookup(candidate->meta, candidate 1206 lib/pengine/pe_actions.c matches = g_list_prepend(matches, candidate); candidate 396 maint/gnulib/lib/hash.c is_prime (size_t candidate) candidate 401 maint/gnulib/lib/hash.c while (square < candidate && (candidate % divisor)) candidate 408 maint/gnulib/lib/hash.c return (candidate % divisor ? true : false); candidate 415 maint/gnulib/lib/hash.c next_prime (size_t candidate) candidate 418 maint/gnulib/lib/hash.c if (candidate < 10) candidate 419 maint/gnulib/lib/hash.c candidate = 10; candidate 422 maint/gnulib/lib/hash.c candidate |= 1; candidate 424 maint/gnulib/lib/hash.c while (SIZE_MAX != candidate && !is_prime (candidate)) candidate 425 maint/gnulib/lib/hash.c candidate += 2; candidate 427 maint/gnulib/lib/hash.c return candidate; candidate 496 maint/gnulib/lib/hash.c compute_bucket_size (size_t candidate, const Hash_tuning *tuning) candidate 500 maint/gnulib/lib/hash.c float new_candidate = candidate / tuning->growth_threshold; candidate 503 maint/gnulib/lib/hash.c candidate = new_candidate; candidate 505 maint/gnulib/lib/hash.c candidate = next_prime (candidate); candidate 506 maint/gnulib/lib/hash.c if (xalloc_oversized (candidate, sizeof (struct hash_entry *))) candidate 508 maint/gnulib/lib/hash.c return candidate; candidate 512 maint/gnulib/lib/hash.c hash_initialize (size_t candidate, const Hash_tuning *tuning, candidate 540 maint/gnulib/lib/hash.c table->n_buckets = compute_bucket_size (candidate, tuning); candidate 844 maint/gnulib/lib/hash.c hash_rehash (Hash_table *table, size_t candidate) candidate 848 maint/gnulib/lib/hash.c size_t new_size = compute_bucket_size (candidate, table->tuning); candidate 958 maint/gnulib/lib/hash.c float candidate = candidate 964 maint/gnulib/lib/hash.c if ((float) SIZE_MAX <= candidate) candidate 968 maint/gnulib/lib/hash.c if (!hash_rehash (table, candidate)) candidate 1042 maint/gnulib/lib/hash.c size_t candidate = candidate 1048 maint/gnulib/lib/hash.c if (!hash_rehash (table, candidate)) candidate 182 maint/gnulib/lib/hash.h extern Hash_table *hash_initialize (size_t candidate, candidate 192 maint/gnulib/lib/hash.h extern Hash_table *hash_xinitialize (size_t candidate, candidate 217 maint/gnulib/lib/hash.h extern bool hash_rehash (Hash_table *table, size_t candidate); candidate 1221 maint/gnulib/lib/regexec.c Idx candidate = edests->elems[i]; candidate 1222 maint/gnulib/lib/regexec.c if (!re_node_set_contains (cur_nodes, candidate)) candidate 1225 maint/gnulib/lib/regexec.c dest_node = candidate; candidate 1232 maint/gnulib/lib/regexec.c return candidate; candidate 1236 maint/gnulib/lib/regexec.c && push_fail_stack (fs, *pidx, candidate, nregs, regs, candidate 26 maint/gnulib/lib/xhash.c hash_xinitialize (size_t candidate, const Hash_tuning *tuning, candidate 31 maint/gnulib/lib/xhash.c hash_initialize (candidate, tuning, hasher, comparator, data_freer);