aboutsummaryrefslogtreecommitdiff
path: root/src/nix/nar.cc
diff options
context:
space:
mode:
authorpennae <github@quasiparticle.net>2022-03-05 14:40:24 +0100
committerpennae <github@quasiparticle.net>2022-04-21 21:56:31 +0200
commit8775be33931ec3b1cad97035ff3d5370a97178a1 (patch)
tree0855d6b35e24153092738315176ea19aa72b9530 /src/nix/nar.cc
parent00a32802328b58daa7af48ccac60f6154ef05639 (diff)
store Symbols in a table as well, like positions
this slightly increases the amount of memory used for any given symbol, but this increase is more than made up for if the symbol is referenced more than once in the EvalState that holds it. on average every symbol should be referenced at least twice (once to introduce a binding, once to use it), so we expect no increase in memory on average. symbol tables are limited to 2³² entries like position tables, and similar arguments apply to why overflow is not likely: 2³² symbols would require as many string instances (at 24 bytes each) and map entries (at 24 bytes or more each, assuming that the map holds on average at most one item per bucket as the docs say). a full symbol table would require at least 192GB of memory just for symbols, which is well out of reach. (an ofborg eval of nixpks today creates less than a million symbols!)
Diffstat (limited to 'src/nix/nar.cc')
0 files changed, 0 insertions, 0 deletions