Lines Matching defs:least
846 Candidate* least = NULL;
900 if (least == NULL) {
902 if (least == NULL ||
903 candidates[i].fragmentation() < least->fragmentation()) {
904 least = candidates + i;
908 if (least->fragmentation() < fragmentation) {
909 *least = Candidate(fragmentation, p);
910 least = NULL;
3651 // Since objects are at least 2 words large we don't have entries for two
3652 // consecutive 1 bits. All entries after 170 have at least 2 consecutive bits.