Lines Matching full:large
100 for small allocations and space-efficient for large allocations.
115 Some of them handle large blocks,
305 yet, if properly designed, they need not be large.
357 Large allocations occur infrequently,
378 To ensure that the allocator is always called for large requests,
379 the lists corresponding to large allocations are always empty.
386 considered to be a large allocation.
392 for large allocations,
400 Additionally the allocation method for large blocks is based on allocating
407 pages while the large block algorithm that allocates in multiples
413 four pages while the large block algorithm will use three pages.
418 Large allocations are first rounded up to be a multiple of the page size.
424 When a large piece of memory is freed,
564 particularly for large allocations where a process may use
568 memory can be shuffled between large requests so that large blocks
573 that size would acquire a large amount of memory
576 In practice, we do not find that the free lists become too large.