mirror of
https://github.com/facebook/sapling.git
synced 2024-10-09 16:31:02 +03:00
53d3f1e6cd
Summary: We would like to use a limited size LRU cache fore trees as well as blobs, so I am templatizing this to allow us to use this cache for trees. Trees will not need to use Interest handles, but in the future we could use this cache for blob metadata, which might want to use interest handles. Additionally if we at somepoint change the inode tree scheme that would remove the tree content from the inodes itself, interest handle might be useful for trees. We could also use this cache proxy hashes which may or may not use interest handles. Since some caches may want interest handles and others will not I am creating get/insert functions that work with and without interest handles. Reviewed By: chadaustin Differential Revision: D27797025 fbshipit-source-id: 6db3e6ade56a9f65f851c01eeea5de734371d8f0 |
||
|---|---|---|
| .. | ||
| CheckoutTest.cpp | ||
| CMakeLists.txt | ||
| DiffTest.cpp | ||
| EdenDispatcherTest.cpp | ||
| EdenMountTest.cpp | ||
| FileInodeTest.cpp | ||
| FuseTest.cpp | ||
| GlobNodeTest.cpp | ||
| InodeBaseTest.cpp | ||
| InodeLoaderTest.cpp | ||
| InodeMapTest.cpp | ||
| InodePtrTest.cpp | ||
| InodeTableTest.cpp | ||
| InodeTimestampsTest.cpp | ||
| JournalUpdateTest.cpp | ||
| main.cpp | ||
| make_gold_master_overlay.cpp | ||
| OverlayBenchmark.cpp | ||
| OverlayTest.cpp | ||
| RemoveTest.cpp | ||
| RenameTest.cpp | ||
| SymlinkTest.cpp | ||
| TraverseTest.cpp | ||
| TreeInodeTest.cpp | ||
| UnloadTest.cpp | ||