plugeth/core/vm/analysis.go

63 lines
1.9 KiB
Go
Raw Normal View History

2015-07-07 00:54:22 +00:00
// Copyright 2014 The go-ethereum Authors
// This file is part of the go-ethereum library.
2015-07-07 00:54:22 +00:00
//
// The go-ethereum library is free software: you can redistribute it and/or modify
2015-07-07 00:54:22 +00:00
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The go-ethereum library is distributed in the hope that it will be useful,
2015-07-07 00:54:22 +00:00
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
2015-07-07 00:54:22 +00:00
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
2015-07-07 00:54:22 +00:00
2014-11-04 17:17:38 +00:00
package vm
2017-09-10 19:04:36 +00:00
// bitvec is a bit vector which maps bytes in a program.
// An unset bit means the byte is an opcode, a set bit means
// it's data (i.e. argument of PUSHxx).
2017-08-14 08:57:54 +00:00
type bitvec []byte
2017-06-03 17:01:22 +00:00
2017-08-14 08:57:54 +00:00
func (bits *bitvec) set(pos uint64) {
(*bits)[pos/8] |= 0x80 >> (pos % 8)
}
func (bits *bitvec) set8(pos uint64) {
(*bits)[pos/8] |= 0xFF >> (pos % 8)
(*bits)[pos/8+1] |= ^(0xFF >> (pos % 8))
2017-06-03 17:01:22 +00:00
}
2017-08-14 08:57:54 +00:00
2017-09-10 19:04:36 +00:00
// codeSegment checks if the position is in a code segment.
2017-08-14 08:57:54 +00:00
func (bits *bitvec) codeSegment(pos uint64) bool {
return ((*bits)[pos/8] & (0x80 >> (pos % 8))) == 0
}
2017-09-10 19:04:36 +00:00
// codeBitmap collects data locations in code.
func codeBitmap(code []byte) bitvec {
// The bitmap is 4 bytes longer than necessary, in case the code
2017-06-03 17:01:22 +00:00
// ends with a PUSH32, the algorithm will push zeroes onto the
// bitvector outside the bounds of the actual code.
2017-08-24 11:09:53 +00:00
bits := make(bitvec, len(code)/8+1+4)
2017-06-03 17:01:22 +00:00
for pc := uint64(0); pc < uint64(len(code)); {
op := OpCode(code[pc])
2017-06-03 17:01:22 +00:00
if op >= PUSH1 && op <= PUSH32 {
numbits := op - PUSH1 + 1
pc++
for ; numbits >= 8; numbits -= 8 {
2017-08-14 08:57:54 +00:00
bits.set8(pc) // 8
2017-06-03 17:01:22 +00:00
pc += 8
}
for ; numbits > 0; numbits-- {
2017-08-14 08:57:54 +00:00
bits.set(pc)
2017-06-03 17:01:22 +00:00
pc++
}
} else {
pc++
2014-11-04 17:17:38 +00:00
}
}
2017-08-14 08:57:54 +00:00
return bits
2014-11-04 17:17:38 +00:00
}