Re: [PATCH] z3fold: the 3-fold allocator for compressed pages
From: Seth Jennings
Date: Thu Apr 14 2016 - 11:53:54 EST
On Thu, Apr 14, 2016 at 4:06 AM, Vitaly Wool <vitalywool@xxxxxxxxx> wrote:
>
>
> On Thu, Apr 14, 2016 at 10:48 AM, Vlastimil Babka <vbabka@xxxxxxx> wrote:
>>
>> On 04/14/2016 10:05 AM, Vitaly Wool wrote:
>>>
>>> This patch introduces z3fold, a special purpose allocator for storing
>>> compressed pages. It is designed to store up to three compressed pages
>>> per
>>> physical page. It is a ZBUD derivative which allows for higher
>>> compression
>>> ratio keeping the simplicity and determinism of its predecessor.
>>
>>
>> So the obvious question is, why a separate allocator and not extend zbud?
>
>
> Well, as far as I recall Seth was very much for keeping zbud as simple as
> possible. I am fine either way but if we have zpool API, why not have
> another zpool API user?
>
>>
>> I didn't study the code, nor notice a design/algorithm overview doc, but
>> it seems z3fold keeps the idea of one compressed page at the beginning, one
>> at the end of page frame, but it adds another one in the middle? Also how is
>> the buddy-matching done?
Yes, as soon as you introduce a 3rd object in the page, zpage
fragmentation becomes an issue. Having a middle object partitions
that zpage, blocking allocations that are larger than either
partition, even though the combined size of the partitions could have
accommodated the object.
This also means that the unbuddied list is broken in this
implementation. num_free_chunks() is calculating the _total_ free
space in the page. But that is not that the _usable_ free space by a
single object, if the middle object has partitioned that free space.
Seth
>
>
> Basically yes. There is 'start_middle' variable which point to the start of
> the middle page, if any. The matching is done basing on the buddy number.
>
> ~vitaly