mirror of
https://github.com/golang/go
synced 2024-10-05 06:21:24 -06:00
d4cc557b0d
Old code was using recursion to traverse object graph. New code uses an explicit stack, cutting the per-pointer footprint to two words during the recursion and avoiding the standard allocator and stack splitting code. in test/garbage: Reduces parser runtime by 2-3% Reduces Peano runtime by 40% Increases tree runtime by 4-5% R=r CC=golang-dev https://golang.org/cl/2150042 |
||
---|---|---|
.. | ||
386 | ||
defs.c | ||
mem.c | ||
os.h | ||
signals.h | ||
thread.c |