Unified getcwd() implementation

From: Bruce M Simpson (bms_at_spc.org)
Date: 08/14/03

  • Next message: Nicolas Souchu: "Loadable VM pager" 
    Date: Thu, 14 Aug 2003 20:49:29 +0100
To: freebsd-arch@freebsd.org

    Hello all,

    I've had the attached patch in my tree for a 1 month period without
    any panics or other adverse effects that I could see.
    This is from one of phk's JKH todo list items.

    It merges the Linux in-kernel scanning-based getcwd() with our namei
    cache based implementation, in a way which tries to use the cache
    efficiently, but will use directory scanning upon a cache miss.
    This also has the advantage that scandir() games are no longer needed in libc.
                                                                                  
    Please let me know your thoughts on this. This is my first real bit of vfs
    related work, so I have no immediate plans to commit it until I can get
    concrete review going forward.

    Kind regards
    BMS

    _______________________________________________
    freebsd-arch@freebsd.org mailing list
    http://lists.freebsd.org/mailman/listinfo/freebsd-arch
    To unsubscribe, send any mail to "freebsd-arch-unsubscribe@freebsd.org"

  • Next message: Nicolas Souchu: "Loadable VM pager"

    Relevant Pages

    • [PATCH 12/12] FS-Cache: CacheFS: Add Documentation
      ... The attached patch adds documentation for CacheFS. ... +CacheFS is a backend for the general filesystem cache facility. ... +CacheFS is based on a wandering tree approach. ...
      (Linux-Kernel)
    • Re: If not readdir() then what?
      ... You are storing an internal tree representation of part of the ... reorganized when the directory's hash tree gets reorg'ed. ... a very mature cache seems to make a lot of sense. ... collision chain". ...
      (Linux-Kernel)
    • Re: Sort benchmark and a classic paper by Gray
      ... I.e. each time I retrieve a value from that merge tree to write it to the output buffer, I also retrieve the next valuefrom the corresponding bucket. ... Yes, your proposed enhancement should help a little, by eliminating a few cache misses and perhaps save an instruction or two in the comparison routines. ... Clearly most of the cache misses come from the final step of going through the sorted and merged array of key prefix, pointer pairs and moving each full record into the output buffer. ...
      (comp.arch)
    • Re: [PATCH] MIPS: Fixups of ALSA memory maps
      ... The patches can be found in test/dma-fix branch of sound GIT tree. ... cache coherency logic will notice that cache, ... maybe somehow need to convince James in the end (and ask Paul to ...
      (Linux-Kernel)
    • Re: [QUICKLIST 0/4] Arch independent quicklists V2
      ... layer of the tree into cache to find all the pages in the address ... every time you set a PTE, set the corresponding bit in the mask ... Thus, you avoid visiting most of a PMD page in the sparse case, ... should be in cache with the appropriate bits of the mm already locked, ...
      (Linux-Kernel)
    • Quantcast