summaryrefslogtreecommitdiff
path: root/src/ask-password/Makefile
diff options
context:
space:
mode:
authorLennart Poettering <lennart@poettering.net>2012-10-26 03:24:03 +0200
committerLennart Poettering <lennart@poettering.net>2012-10-26 03:24:03 +0200
commita4bcff5ba36115495994e9f9ba66074471de76ab (patch)
tree16929d0178f57cfe21b6da81ae3e8488ed289b50 /src/ask-password/Makefile
parent7fb4d896e1ff018d91498f0e83b02e2534644907 (diff)
journal: introduce entry array chain cache
When traversing entry array chains for a bisection or for retrieving an item by index we previously always started at the beginning of the chain. Since we tend to look at the same chains repeatedly, let's cache where we have been the last time, and maybe we can skip ahead with this the next time. This turns most bisections and index lookups from O(log(n)*log(n)) into O(log(n)). More importantly however, we seek around on disk much less, which is good to reduce buffer cache and seek times on rotational disks.
Diffstat (limited to 'src/ask-password/Makefile')
0 files changed, 0 insertions, 0 deletions