Lines Matching defs:least
559 Candidate* least = NULL;
613 if (least == NULL) {
615 if (least == NULL ||
616 candidates[i].fragmentation() < least->fragmentation()) {
617 least = candidates + i;
621 if (least->fragmentation() < fragmentation) {
622 *least = Candidate(fragmentation, p);
623 least = NULL;
3457 // Since objects are at least 2 words large we don't have entries for two
3458 // consecutive 1 bits. All entries after 170 have at least 2 consecutive bits.
