c9efff3fcd
This continues to move the "desugaring" of unary operators further down the pipeline, in this case into the bytecode handlers for new bytecodes `Negate` and `BitwiseNot` and the corresponding TF code in BytecodeGraphBuilder. Bug: v8:6971 Tbr: yangguo@chromium.org Change-Id: If6b5d6b239a09ef8b4dbde49321614503c0f5beb Reviewed-on: https://chromium-review.googlesource.com/661146 Commit-Queue: Adam Klein <adamk@chromium.org> Reviewed-by: Jakob Kummerow <jkummerow@chromium.org> Reviewed-by: Georg Neis <neis@chromium.org> Reviewed-by: Ross McIlroy <rmcilroy@chromium.org> Cr-Commit-Position: refs/heads/master@{#47980}
175 lines
3.0 KiB
Plaintext
175 lines
3.0 KiB
Plaintext
#
|
|
# Autogenerated by generate-bytecode-expectations.
|
|
#
|
|
|
|
---
|
|
wrap: yes
|
|
|
|
---
|
|
snippet: "
|
|
var x = 0;
|
|
while (x != 10) {
|
|
x = x + 10;
|
|
}
|
|
return x;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 25
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaZero),
|
|
B(Star), R(0),
|
|
/* 54 S> */ B(LdaSmi), I8(10),
|
|
/* 54 E> */ B(TestEqual), R(0), U8(0),
|
|
B(JumpIfTrue), U8(13),
|
|
/* 45 E> */ B(StackCheck),
|
|
/* 65 S> */ B(Ldar), R(0),
|
|
/* 71 E> */ B(AddSmi), I8(10), U8(1),
|
|
B(Star), R(0),
|
|
B(JumpLoop), U8(15), I8(0),
|
|
/* 79 S> */ B(Ldar), R(0),
|
|
/* 88 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var x = false;
|
|
do {
|
|
x = !x;
|
|
} while(x == false);
|
|
return x;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 22
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaFalse),
|
|
B(Star), R(0),
|
|
/* 49 E> */ B(StackCheck),
|
|
/* 56 S> */ B(Ldar), R(0),
|
|
B(ToBooleanLogicalNot),
|
|
B(Star), R(0),
|
|
/* 74 S> */ B(LdaFalse),
|
|
/* 74 E> */ B(TestEqual), R(0), U8(0),
|
|
B(JumpIfFalse), U8(5),
|
|
B(JumpLoop), U8(12), I8(0),
|
|
/* 85 S> */ B(Ldar), R(0),
|
|
/* 94 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var x = 101;
|
|
return void(x * 3);
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 10
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(101),
|
|
B(Star), R(0),
|
|
/* 61 S> */ B(MulSmi), I8(3), U8(0),
|
|
B(LdaUndefined),
|
|
/* 66 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var x = 1234;
|
|
var y = void (x * x - 1);
|
|
return y;
|
|
"
|
|
frame size: 2
|
|
parameter count: 1
|
|
bytecode array length: 17
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(Wide), B(LdaSmi), I16(1234),
|
|
B(Star), R(0),
|
|
/* 64 S> */ B(Mul), R(0), U8(0),
|
|
/* 68 E> */ B(SubSmi), I8(1), U8(1),
|
|
B(LdaUndefined),
|
|
B(Star), R(1),
|
|
/* 83 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var x = 13;
|
|
return ~x;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 8
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(13),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(BitwiseNot), U8(0),
|
|
/* 56 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var x = 13;
|
|
return +x;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 8
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(13),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(ToNumber), U8(0),
|
|
/* 56 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var x = 13;
|
|
return -x;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 8
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(13),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(Negate), U8(0),
|
|
/* 56 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|