[lkml]   [2007]   [May]   [21]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: that page count overflow thing
    From: William Lee Irwin III <>
    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
    More majordomo info at
    Please read the FAQ at

     \ /
      Last update: 2007-05-21 13:53    [W:0.018 / U:16.980 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site