7bedd1111d
Move the ToBoolean elision in the BytecodeGenerator instead of the peephole optimizer. Adds a TypeHint mechanism to the ExpressionResult to enable passing of type hints through the ast visitor. BUG=v8:6194 Change-Id: Ic55506ba11b213f7459250004d3f18cab04ee9b3 Reviewed-on: https://chromium-review.googlesource.com/467208 Commit-Queue: Ross McIlroy <rmcilroy@chromium.org> Reviewed-by: Yang Guo <yangguo@chromium.org> Reviewed-by: Leszek Swirski <leszeks@chromium.org> Cr-Commit-Position: refs/heads/master@{#44415}
290 lines
5.0 KiB
Plaintext
290 lines
5.0 KiB
Plaintext
#
|
|
# Autogenerated by generate-bytecode-expectations.
|
|
#
|
|
|
|
---
|
|
wrap: yes
|
|
|
|
---
|
|
snippet: "
|
|
var a = 1;
|
|
return a === null;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 7
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(TestNull),
|
|
/* 64 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = undefined;
|
|
return undefined === a;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 6
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaUndefined),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(TestUndefined),
|
|
/* 77 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = undefined;
|
|
return undefined !== a;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 7
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaUndefined),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(TestUndefined),
|
|
/* 70 E> */ B(LogicalNot),
|
|
/* 77 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 2;
|
|
return a != null;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 8
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(2),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(TestUndetectable),
|
|
/* 54 E> */ B(LogicalNot),
|
|
/* 63 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = undefined;
|
|
return undefined == a;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 6
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaUndefined),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(TestUndetectable),
|
|
/* 76 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = undefined;
|
|
return undefined === a ? 1 : 2;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 13
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaUndefined),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(JumpIfNotUndefined), U8(6),
|
|
B(LdaSmi), I8(1),
|
|
B(Jump), U8(4),
|
|
B(LdaSmi), I8(2),
|
|
/* 85 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 0;
|
|
return null == a ? 1 : 2;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 14
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaZero),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(TestUndetectable),
|
|
B(JumpIfFalse), U8(6),
|
|
B(LdaSmi), I8(1),
|
|
B(Jump), U8(4),
|
|
B(LdaSmi), I8(2),
|
|
/* 71 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 0;
|
|
return undefined !== a ? 1 : 2;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 13
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaZero),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(JumpIfUndefined), U8(6),
|
|
B(LdaSmi), I8(1),
|
|
B(Jump), U8(4),
|
|
B(LdaSmi), I8(2),
|
|
/* 77 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 0;
|
|
return a === null ? 1 : 2;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 13
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaZero),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(JumpIfNotNull), U8(6),
|
|
B(LdaSmi), I8(1),
|
|
B(Jump), U8(4),
|
|
B(LdaSmi), I8(2),
|
|
/* 72 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 0;
|
|
if (a === null) {
|
|
return 1;
|
|
} else {
|
|
return 2;
|
|
}
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 14
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaZero),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(JumpIfNotNull), U8(5),
|
|
/* 65 S> */ B(LdaSmi), I8(1),
|
|
/* 98 S> */ B(Return),
|
|
/* 86 S> */ B(LdaSmi), I8(2),
|
|
/* 98 S> */ B(Return),
|
|
B(LdaUndefined),
|
|
/* 98 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 0;
|
|
if (a != undefined) {
|
|
return 1;
|
|
}
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 12
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaZero),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(TestUndetectable),
|
|
B(JumpIfTrue), U8(5),
|
|
/* 69 S> */ B(LdaSmi), I8(1),
|
|
/* 81 S> */ B(Return),
|
|
B(LdaUndefined),
|
|
/* 81 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = undefined;
|
|
var b = 0;
|
|
while (a !== undefined) {
|
|
b++;
|
|
}
|
|
"
|
|
frame size: 2
|
|
parameter count: 1
|
|
bytecode array length: 23
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaUndefined),
|
|
B(Star), R(0),
|
|
/* 61 S> */ B(LdaZero),
|
|
B(Star), R(1),
|
|
/* 73 S> */ B(Ldar), R(0),
|
|
B(JumpIfUndefined), U8(12),
|
|
/* 64 E> */ B(StackCheck),
|
|
/* 92 S> */ B(Ldar), R(1),
|
|
B(Inc), U8(5),
|
|
B(Star), R(1),
|
|
B(JumpLoop), U8(11), I8(0),
|
|
B(LdaUndefined),
|
|
/* 99 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|