poanetwork
/
quorum
mirror of https://github.com/poanetwork/quorum.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

core/vm: make jumpdest code nicer

This commit is contained in:
Felix Lange 2017-08-24 13:09:53 +02:00 committed by GitHub
parent 967e097faa
commit 54b1de67e2
1 changed files with 1 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
core/vm/analysis.go
View File

@ -42,7 +42,6 @@ func (d destinations) has(codehash common.Hash, code []byte, dest *big.Int) bool
d[codehash] = m d[codehash] = m
} }
return OpCode(code[udest]) == JUMPDEST && m.codeSegment(udest) return OpCode(code[udest]) == JUMPDEST && m.codeSegment(udest)
// return (m[udest/8] & (1 << (udest % 8))) != 0
} }
// bitvec is a bit vector which maps bytes in a program // bitvec is a bit vector which maps bytes in a program
@ -68,8 +67,7 @@ func jumpdests(code []byte) []byte {
//The map is 4 bytes longer than necessary, in case the code //The map is 4 bytes longer than necessary, in case the code
// ends with a PUSH32, the algorithm will push zeroes onto the // ends with a PUSH32, the algorithm will push zeroes onto the
// bitvector outside the bounds of the actual code. // bitvector outside the bounds of the actual code.
m := make([]byte, len(code)/8+1+4) bits := make(bitvec, len(code)/8+1+4)
bits := bitvec(m)
for pc := uint64(0); pc < uint64(len(code)); { for pc := uint64(0); pc < uint64(len(code)); {
op := OpCode(code[pc]) op := OpCode(code[pc])