Lines Matching defs:best
110 // find the best span (closest to n in size).
111 // The following loops implements address-ordered best-fit.
112 Span *best = NULL;
119 if ((best == NULL)
120 || (span->length < best->length)
121 || ((span->length == best->length) && (span->start < best->start))) {
122 best = span;
123 ASSERT(best->location == Span::ON_NORMAL_FREELIST);
133 if ((best == NULL)
134 || (span->length < best->length)
135 || ((span->length == best->length) && (span->start < best->start))) {
136 best = span;
137 ASSERT(best->location == Span::ON_RETURNED_FREELIST);
142 return best == NULL ? NULL : Carve(best, n);
