Subject: Re: [PATCH] z3fold: the 3-fold allocator for compressed pages
To: Vitaly Wool <vitalywool@gmail.com>, linux-mm@kvack.org,
        linux-kernel@vger.kernel.org
References: <570F4F5F.6070209@gmail.com>
Cc: Seth Jennings <sjenning@redhat.com>,
        Andrew Morton <akpm@linux-foundation.org>,
        Dan Streetman <ddstreet@ieee.org>
From: Vlastimil Babka <vbabka@suse.cz>
Message-ID: <570F5973.40809@suse.cz>
Date: Thu, 14 Apr 2016 10:48:51 +0200
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:38.0) Gecko/20100101
 Thunderbird/38.7.1
MIME-Version: 1.0
In-Reply-To: <570F4F5F.6070209@gmail.com>
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 7bit
Sender: linux-kernel-owner@vger.kernel.org
Content-Length: 684
Lines: 14

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?
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?

Thanks,
Vlastimil