On Mon, 19 Mar 2007, Nicolas Pitre wrote: > And because we usually walk objects from newest to oldest, and because > deltas are usually oriented in the same direction, we only need to tweak > the current eviction loop a bit so on average the oldest objects are > evicted first so next time around the current base will still be there > for the next delta depth. Given the nature of the hash containing the > object's offset that means starting the loop at the next entry index > instead of zero which should do the trick pretty well. OK. Two flaws above: to be clear it is the newest objects in terms of absolute age should be evicted first, which means the oldest to have been cached. Then the hash cannot be representative of the object ordering because it is reduced to 8 bits and objects are often enough more than 256 bytes apart to make this hash based ordering completely random. A simple LRU might be quite effective instead. Nicolas - To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html