Date: Mon, 21 May 2007 04:50:31 -0700 (PDT)
Message-Id: <20070521.045031.45180781.davem@davemloft.net>
To: wli@holomorphy.com
Cc: akpm@linux-foundation.org, linux-kernel@vger.kernel.org
Subject: Re: that page count overflow thing
From: David Miller <davem@davemloft.net>
In-Reply-To: <20070521113747.GK19966@holomorphy.com>
References: <20070519.152649.102577495.davem@davemloft.net>
	<20070521113747.GK19966@holomorphy.com>
Mime-Version: 1.0
Content-Type: Text/Plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: linux-kernel-owner@vger.kernel.org
Content-Length: 788
Lines: 21

From: William Lee Irwin III <wli@holomorphy.com>
Date: Mon, 21 May 2007 04:37:47 -0700

> This could be awkward with allocation requirements. How about an
> open-addressed hash table? It can be made so large as to never
> need to expand in advance with a very small constant factor space
> overhead.

I was just thinking of a normal hash table with entries that
looked simply like:

struct page_big_count_hash {
       struct page_big_count_hash *next; /* or list_head or hlist_head etc. */
       struct page *key;
       atomic64_t count;
};
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/