Lines Matching full:allocations

100 for small allocations and space-efficient for large allocations.
118 Often the allocations are for small pieces of memory that are only
190 a set of allocations at any point in time.
352 the ``Requests'' field is the number of allocations since system startup;
356 allocations are for small objects.
357 Large allocations occur infrequently, 
371 Small allocations are done using the 4.2BSD power-of-two list strategy;
379 the lists corresponding to large allocations are always empty.
392 for large allocations,
393 a different strategy is used for allocations larger than two kilobytes.
396 that showed that 95 to 98% of allocations are of size one kilobyte or less.
409 Thus for allocations of sizes between one and two pages
411 it is not until allocations of sizes between two and three pages
418 Large allocations are first rounded up to be a multiple of the page size.
420 kernel address arena set aside for dynamic allocations.
431 is to cluster same-sized small allocations on a page.
434 This strategy speeds future allocations as several pieces of memory
444 However, this strategy doubles the memory requirement for allocations that
455 The reason is that many allocations in the kernel are for blocks of 
564 particularly for large allocations where a process may use
589 most allocations are short-lived, lasting only for the duration of
591 As new allocations would be made from the page sorted to