Messages in this thread | | | From | yodaiken@chelm ... | Subject | Re: MM deadlock [was: Re: arca-vm-8...] | Date | Wed, 27 Jan 1999 03:31:17 -0700 (MST) |
| |
> i dont think it's correct to say: 'anything that cannot be segmented in > the physical memory space with page granularity, is considered to be > broken in this regard and is not guaranteed to be 100% supported by the > Linux architecture'.
Sure. But let's keep in mind that paging is designed to avoid memory fragmentation, and big chunks mean you don't care about some minor loss of usable memory. If you have a 4G phys memory and need big linear pieces, it is far better to waste 3.9 meg by aligning end of data, then to complicate all memory allocation techniques in kernel so you don't waste it. In fact you'd probably want a simplified slab kmalloc: if size is 4meg allocate a 4meg chunk from 4meg list else if size< 4 meg either allocate a new 4 meg chunk and take space from it or find partially used 4 meg chunk with enough space in it.
so you might have a list of partially used 4meg chunks lying about wasting some space, but ...
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
| |