Lines Matching defs:contig
354 /* handles contig area across blocks */
366 * right contig hint. In the last case, it spills over into
367 * the next block and should be handled by the contig area
396 * within the block to see if the request can be fulfilled prior to the contig
409 /* handles contig area across blocks */
584 * the best starting offset if the contig hints are equal.
588 int contig = end - start;
592 block->left_free = contig;
595 block->right_free = contig;
597 if (contig > block->contig_hint) {
607 * new contig is larger so hold the invariant
616 block->contig_hint = contig;
617 } else if (contig == block->contig_hint) {
629 * Knowing contig == contig_hint, update the scan_hint
634 block->scan_hint = contig;
643 (contig > block->scan_hint ||
644 (contig == block->scan_hint &&
647 block->scan_hint = contig;
694 * Iterates over the metadata blocks to find the largest contig area.
749 /* iterate over free areas and update the contig hints */
762 * refreshed by a full scan iff the chunk's contig hint is broken. Block level
763 * scans are required if the block's contig hint is broken.
814 /* block contig hint is broken - scan to fix it */
819 /* update left and right contig manually */
852 /* contig hint is broken - scan to fix it */
883 * contig hint is broken. Otherwise, it means a smaller space
884 * was used and therefore the chunk contig hint is still correct.
901 * refresh by making use of the block contig hints. If this fails, it scans
909 * than the available space. If the contig hint is contained in one block, it
1049 * not quite first fit as if the allocation does not fit in the contig hint
1065 * Check to see if the allocation can fit in the chunk's contig hint.
1157 * the allocation map because if it fits within the block's contig hint,
1159 * allocation prior to breaking the contig hint. The allocation and