v8/test/cctest/interpreter/bytecode_expectations/UnaryOperators.golden
oth e43fbde72b [Interpreter] Preserve source positions in peephole optimizer.
The original peephole optimizer logic in the BytecodeArrayBuilder did
not respect source positions as it was written before there were
bytecode source positions. This led to some minor differences to
FCG and was problematic when combined with pending bytecode
optimizations. This change makes the new peephole optimizer fully
respect source positions.

BUG=v8:4280
LOG=N

Review-Url: https://codereview.chromium.org/1998203002
Cr-Commit-Position: refs/heads/master@{#36439}
2016-05-23 13:33:20 +00:00

196 lines
3.6 KiB
Plaintext

#
# Autogenerated by generate-bytecode-expectations.
#
---
pool type: number
execute: yes
wrap: yes
---
snippet: "
var x = 0;
while (x != 10) {
x = x + 10;
}
return x;
"
frame size: 2
parameter count: 1
bytecode array length: 31
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaZero),
/* 42 E> */ B(Star), R(0),
/* 54 S> */ B(Ldar), R(0),
B(Star), R(1),
B(LdaSmi), U8(10),
/* 54 E> */ B(TestEqual), R(1),
B(LogicalNot),
B(JumpIfFalse), U8(15),
/* 45 E> */ B(StackCheck),
/* 65 S> */ B(Ldar), R(0),
B(Star), R(1),
B(LdaSmi), U8(10),
B(Add), R(1),
/* 67 E> */ B(Star), R(0),
B(Jump), U8(-22),
/* 79 S> */ B(Ldar), R(0),
/* 89 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = false;
do {
x = !x;
} while(x == false);
return x;
"
frame size: 2
parameter count: 1
bytecode array length: 22
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaFalse),
/* 42 E> */ B(Star), R(0),
/* 49 E> */ B(StackCheck),
/* 56 S> */ B(Ldar), R(0),
B(ToBooleanLogicalNot),
/* 58 E> */ B(Star), R(0),
/* 74 S> */ B(Ldar), R(0),
B(Star), R(1),
B(LdaFalse),
/* 74 E> */ B(TestEqual), R(1),
B(JumpIfTrue), U8(-13),
/* 85 S> */ B(Ldar), R(0),
/* 95 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 101;
return void(x * 3);
"
frame size: 2
parameter count: 1
bytecode array length: 13
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaSmi), U8(101),
B(Star), R(0),
/* 47 S> */ B(Star), R(1),
B(LdaSmi), U8(3),
B(Mul), R(1),
B(LdaUndefined),
/* 67 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 1234;
var y = void (x * x - 1);
return y;
"
frame size: 4
parameter count: 1
bytecode array length: 24
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(Wide), B(LdaSmi), U16(1234),
B(Star), R(0),
/* 56 S> */ B(Star), R(2),
/* 66 E> */ B(Ldar), R(0),
B(Mul), R(2),
B(Star), R(3),
B(LdaSmi), U8(1),
B(Sub), R(3),
B(LdaUndefined),
B(Star), R(1),
/* 74 S> */ B(Nop),
/* 84 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 13;
return ~x;
"
frame size: 2
parameter count: 1
bytecode array length: 12
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaSmi), U8(13),
B(Star), R(0),
/* 46 S> */ B(Star), R(1),
B(LdaSmi), U8(-1),
B(BitwiseXor), R(1),
/* 57 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 13;
return +x;
"
frame size: 2
parameter count: 1
bytecode array length: 12
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaSmi), U8(13),
B(Star), R(0),
/* 46 S> */ B(Star), R(1),
B(LdaSmi), U8(1),
B(Mul), R(1),
/* 57 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 13;
return -x;
"
frame size: 2
parameter count: 1
bytecode array length: 12
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaSmi), U8(13),
B(Star), R(0),
/* 46 S> */ B(Star), R(1),
B(LdaSmi), U8(-1),
B(Mul), R(1),
/* 57 S> */ B(Return),
]
constant pool: [
]
handlers: [
]