Searched refs:candidate (Results 1 – 3 of 3) sorted by relevance
1169 struct node *candidate = NULL; in sparsebit_next_set() local1182 candidate = nodep; in sparsebit_next_set()1183 if (candidate->idx <= lowest_possible) { in sparsebit_next_set()1192 if (!candidate) in sparsebit_next_set()1195 assert(candidate->mask != 0); in sparsebit_next_set()1204 assert(candidate->idx > lowest_possible); in sparsebit_next_set()1206 return node_first_set(candidate, 0); in sparsebit_next_set()1217 start = lowest_possible - candidate->idx; in sparsebit_next_set()1219 if (start < MASK_BITS && candidate->mask >= (1 << start)) in sparsebit_next_set()1220 return node_first_set(candidate, start); in sparsebit_next_set()[all …]
774 candidate = os.path.abspath(os.path.join(root, filename))775 if candidate not in testdirs:776 flist.append(candidate)
2580 race-candidate access by a fence. At first glance this may seem2619 race-candidate stores W and W', where W ->co W', the LKMM says the2632 sequence. For race-candidate load R and store W, the LKMM says the