1. 22 Feb, 2019 9 commits
  2. 21 Feb, 2019 12 commits
  3. 20 Feb, 2019 4 commits
  4. 17 Feb, 2019 8 commits
  5. 16 Feb, 2019 1 commit
  6. 15 Feb, 2019 6 commits
    • idxmap: remove legacy low-level interface · df42f368
      Remove the low-level interface that was exposing implementation details of
      `git_idxmap` to callers. From now on, only the high-level functions shall be
      used to retrieve or modify values of a map. Adjust remaining existing callers.
      Patrick Steinhardt committed
    • oidmap: remove legacy low-level interface · bd66925a
      Remove the low-level interface that was exposing implementation details of
      `git_oidmap` to callers. From now on, only the high-level functions shall be
      used to retrieve or modify values of a map. Adjust remaining existing callers.
      Patrick Steinhardt committed
    • offmap: remove legacy low-level interface · 4713e7c8
      Remove the low-level interface that was exposing implementation details of
      `git_offmap` to callers. From now on, only the high-level functions shall be
      used to retrieve or modify values of a map. Adjust remaining existing callers.
      Patrick Steinhardt committed
    • strmap: remove legacy low-level interface · fdfabdc4
      Remove the low-level interface that was exposing implementation details of
      `git_strmap` to callers. From now on, only the high-level functions shall be
      used to retrieve or modify values of a map. Adjust remaining existing callers.
      Patrick Steinhardt committed
    • cache: use iteration interface for cache eviction · 6a9117f5
      To relieve us from memory pressure, we may regularly call `cache_evict_entries`
      to remove some entries from it. Unfortunately, our cache does not support a
      least-recently-used mode or something similar, which is why we evict entries
      completeley at random right now. Thing is, this is only possible due to the map
      interfaces exposing the entry indices, and we intend to completely remove those
      to decouple map users from map implementations. As soon as that is done, we are
      unable to do this random eviction anymore.
      
      Convert this to make use of an iterator for now. Obviously, there is no random
      eviction possible like that anymore, but we'll always start by evicting from the
      beginning of the map. Due to hashing, one may hope that the selected buckets
      will be evicted at least in some way unpredictably. But more likely than not,
      this will not be the case. But let's see what happens and if any users complain
      about degraded performance. If so, we might come up with a different scheme than
      random removal, e.g. by using an LRU cache.
      Patrick Steinhardt committed
    • indexer: use map iterator to delete expected OIDs · c976b4f9
      To compute whether there are objects missing in a packfile, the indexer keeps
      around a map of OIDs that it still expects to see. This map does not store any
      values at all, but in fact the keys are owned by the map itself. Right now, we
      free these keys by iterating over the map and freeing the key itself, which is
      kind of awkward as keys are expected to be constant.
      
      We can make this a bit prettier by inserting the OID as value, too. As we
      already store the `NULL` pointer either way, this does not increase memory
      usage, but makes the code a tad more clear. Furthermore, we convert the
      previously existing map iteration via indices to make use of an iterator,
      instead.
      Patrick Steinhardt committed