candidate          20 lib/common/lists.c         GList *candidate = NULL;
candidate          22 lib/common/lists.c         for (candidate = from; candidate != NULL; candidate = candidate->next) {
candidate          23 lib/common/lists.c             if(cmp(candidate->data, item->data) == 0) {
candidate          24 lib/common/lists.c                 result = g_list_remove(result, candidate->data);
candidate        2264 lib/common/xml.c     xmlNode *candidate = add_node_copy(new_parent, old_child);
candidate        2267 lib/common/xml.c     reset_xml_node_flags(candidate);
candidate        2270 lib/common/xml.c     pcmk__apply_acl(xmlDocGetRootElement(candidate->doc));
candidate        2273 lib/common/xml.c     free_xml_with_position(candidate,
candidate         350 lib/pacemaker/pcmk_sched_bundle.c compatible_replica_for_node(pe_resource_t *rsc_lh, pe_node_t *candidate,
candidate         356 lib/pacemaker/pcmk_sched_bundle.c     CRM_CHECK(candidate != NULL, return NULL);
candidate         360 lib/pacemaker/pcmk_sched_bundle.c               rsc_lh->id, rsc->id, candidate->details->uname);
candidate         366 lib/pacemaker/pcmk_sched_bundle.c         if (is_child_compatible(replica->container, candidate, filter, current)) {
candidate         369 lib/pacemaker/pcmk_sched_bundle.c                       candidate->details->uname);
candidate        2050 lib/pengine/utils.c         pe_resource_t *candidate = gIter->data;
candidate        2051 lib/pengine/utils.c         const char *provides = g_hash_table_lookup(candidate->meta,
candidate        2053 lib/pengine/utils.c         const char *requires = g_hash_table_lookup(candidate->meta, XML_RSC_ATTR_REQUIRES);
candidate        2055 lib/pengine/utils.c         if(candidate->children) {
candidate        2056 lib/pengine/utils.c             matches = find_unfencing_devices(candidate->children, matches);
candidate        2057 lib/pengine/utils.c         } else if (!pcmk_is_set(candidate->flags, pe_rsc_fence_device)) {
candidate        2061 lib/pengine/utils.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        1235 maint/gnulib/lib/regexec.c 	  Idx candidate = edests->elems[i];
candidate        1236 maint/gnulib/lib/regexec.c 	  if (!re_node_set_contains (cur_nodes, candidate))
candidate        1239 maint/gnulib/lib/regexec.c 	    dest_node = candidate;
candidate        1246 maint/gnulib/lib/regexec.c 		return candidate;
candidate        1250 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);