From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1755056AbcH3WjZ (ORCPT ); Tue, 30 Aug 2016 18:39:25 -0400 Received: from mga09.intel.com ([134.134.136.24]:59997 "EHLO mga09.intel.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1750798AbcH3WjW (ORCPT ); Tue, 30 Aug 2016 18:39:22 -0400 X-ExtLoop1: 1 X-IronPort-AV: E=Sophos;i="5.30,259,1470726000"; d="scan'208";a="1049398640" Date: Tue, 30 Aug 2016 16:39:20 -0600 From: Ross Zwisler To: Konstantin Khlebnikov Cc: linux-mm@kvack.org, Andrew Morton , linux-kernel@vger.kernel.org, "Kirill A. Shutemov" , Ross Zwisler Subject: Re: [PATCH RFC 1/4] lib/radix: add universal radix_tree_fill_range Message-ID: <20160830223920.GA7999@linux.intel.com> References: <147230727479.9957.1087787722571077339.stgit@zurg> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <147230727479.9957.1087787722571077339.stgit@zurg> User-Agent: Mutt/1.7.0 (2016-08-17) Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org On Sat, Aug 27, 2016 at 05:14:34PM +0300, Konstantin Khlebnikov wrote: > Tags should be set only for last index of THP range: this way iterator > will find them regardless of starting index. I don't think this works well for DAX. We really want to to have the tags be consistent for all indices within a multi-order range. Meaning, if I fault in an order-9 fault, and then I get a PTE write fault to anywhere within that range, I want to be able to do a lookup, find the one canonical entry that has my dirty tags, flush, and eventually I want to be able to clear that one tag. I agree that it's *possible* to do all of this with your code, but it puts a lot of onus on the user. I now have to have two paths, one for order-0 entries, and one for multi-order entries where I know to use a specific entry as my canonical entry where I can count on the log bit, on tags, etc. This was actually the way that it was done with the old PMD code. We used the first aligned index for the PMD to be the one source of truth. On every fault I would first check to see if there was a PMD aligned entry, and then if not I would treat it like a normal 4k fault. The multi-order radix tree with sibling entries was a huge step forward. I guess my question is the same as Matthew's: what is the problem you need to solve with this code, and why can't the current code be made to solve it?