-
Russ Cox authored
Also change the span-dependent jump algorithm to use fewer iterations: * resolve forward jumps at their targets (comefrom list) * mark jumps as small or big and only do small->big * record whether a jump failed to be encodable These changes mean that a function with only small jumps can be laid out in a single iteration, and the vast majority of functions take just two iterations. I was seeing a maximum of 5 iterations before; the max now is 3 and there are fewer that get even that far. R=ken2 CC=golang-dev https://golang.org/cl/2537041
9c204852
Name |
Last commit
|
Last update |
---|---|---|
.. | ||
cmd | ||
lib9 | ||
libbio | ||
libcgo | ||
libmach | ||
pkg | ||
Make.ccmd | ||
Make.clib | ||
Make.cmd | ||
Make.common | ||
Make.inc | ||
Make.pkg | ||
all-arm.bash | ||
all-nacl.bash | ||
all.bash | ||
clean.bash | ||
env.bash | ||
make.bash | ||
quietgcc.bash | ||
run.bash | ||
sudo.bash | ||
version.bash |