Lines Matching +full:main +full:- +full:storage

2 .\" ----------------------------------------------------------------------------
3 .\" "THE BEER-WARE LICENSE" (Revision 42):
6 .\" this stuff is worth it, you can buy me a beer in return.   Poul-Henning Kamp
7 .\" ----------------------------------------------------------------------------
19 The main data structure is the
20 .I page-directory
36 This is the first page in a (multi-)page allocation.
39 This is a subsequent page in a multi-page allocation.
53 When a request for storage comes in, it will be treated as a ``page''
60 status in the page-directory.
63 the pages will get added to the page-directory with status
68 page directory to MALLOC_FREE, and then traversing the free-pages list to
78 These sub-page allocations are served from pages which are split up
89 For each size of sub-page allocation, the pginfo structures for the
108 To be 100% correct performance-wise these lists should be ordered
111 of the list on every memory reference to keep it up-to-date.
114 thing performance-wise.
120 The side effect of this compromise is that it also uses less storage,
137 brk(2) is actually not a very fast system call when you ask for storage.
143 and don't affect anything but swap-space usage.
168 If malloc fails to allocate storage, core-dump the process with
181 page heavily by eliminating unnecessary page-ins and page-outs of
191 the same size-class.
212 time-overhead of the malloc, further improvements will have to
221 Malloc/Free can be a significant point of contention in multi-threaded
222 programs.  Low-grain locking of the data-structures inside the 
223 implementation should be implemented to avoid excessive spin-waiting.