a447a44f31
Since now the IterationBody StackChecks are implicit within JumpLoops, we are able to eagerly deopt in them. If we do that, whenever we advance to the next bytecode we don't have to advance to the next literal bytecode, but instead "advance" in the sense of doing the JumpLoop. Adding tests that test this advancing for wide and extra wide JumpLoops. Also, marking JumpLoop as needing source positions since now it has the ability of causing an interrupt. Bug: v8:10149, v8:9960 Fixes: v8:10149 Change-Id: Ib0d9efdfb379e0dfbba7a7f67cba9262668813b0 Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/2064226 Reviewed-by: Ross McIlroy <rmcilroy@chromium.org> Reviewed-by: Jakob Gruber <jgruber@chromium.org> Commit-Queue: Santiago Aboy Solanes <solanes@chromium.org> Cr-Commit-Position: refs/heads/master@{#66809}
275 lines
4.6 KiB
Plaintext
275 lines
4.6 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: 6
|
|
bytecodes: [
|
|
/* 42 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(TestNull),
|
|
/* 63 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = undefined;
|
|
return undefined === a;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 5
|
|
bytecodes: [
|
|
/* 42 S> */ B(LdaUndefined),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(TestUndefined),
|
|
/* 76 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = undefined;
|
|
return undefined !== a;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 6
|
|
bytecodes: [
|
|
/* 42 S> */ B(LdaUndefined),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(TestUndefined),
|
|
/* 70 E> */ B(LogicalNot),
|
|
/* 76 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 2;
|
|
return a != null;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 7
|
|
bytecodes: [
|
|
/* 42 S> */ B(LdaSmi), I8(2),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(TestUndetectable),
|
|
/* 54 E> */ B(LogicalNot),
|
|
/* 62 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = undefined;
|
|
return undefined == a;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 5
|
|
bytecodes: [
|
|
/* 42 S> */ B(LdaUndefined),
|
|
B(Star), R(0),
|
|
/* 53 S> */ B(TestUndetectable),
|
|
/* 75 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = undefined;
|
|
return undefined === a ? 1 : 2;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 12
|
|
bytecodes: [
|
|
/* 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),
|
|
/* 84 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 0;
|
|
return null == a ? 1 : 2;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 13
|
|
bytecodes: [
|
|
/* 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),
|
|
/* 70 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 0;
|
|
return undefined !== a ? 1 : 2;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 12
|
|
bytecodes: [
|
|
/* 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),
|
|
/* 76 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 0;
|
|
return a === null ? 1 : 2;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 12
|
|
bytecodes: [
|
|
/* 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),
|
|
/* 71 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: 11
|
|
bytecodes: [
|
|
/* 42 S> */ B(LdaZero),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(JumpIfNotNull), U8(5),
|
|
/* 65 S> */ B(LdaSmi), I8(1),
|
|
/* 74 S> */ B(Return),
|
|
/* 86 S> */ B(LdaSmi), I8(2),
|
|
/* 95 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 0;
|
|
if (a != undefined) {
|
|
return 1;
|
|
}
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 11
|
|
bytecodes: [
|
|
/* 42 S> */ B(LdaZero),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(TestUndetectable),
|
|
B(JumpIfTrue), U8(5),
|
|
/* 69 S> */ B(LdaSmi), I8(1),
|
|
/* 78 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: 21
|
|
bytecodes: [
|
|
/* 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(11),
|
|
/* 92 S> */ B(Ldar), R(1),
|
|
B(Inc), U8(0),
|
|
B(Star), R(1),
|
|
/* 64 E> */ B(JumpLoop), U8(10), I8(0),
|
|
B(LdaUndefined),
|
|
/* 99 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|