7be64db45f
This is a reland of cf93071c91
Original change's description:
> [interpreter] Short Star bytecode
>
> Design doc:
> https://docs.google.com/document/d/1g_NExMT78II_KnIYNa9MvyPYIj23qAiFUEsyemY5KRk/edit
>
> This change adds 16 new interpreter opcodes, kStar0 through kStar15, so
> that we can use a single byte to represent the common operation of
> storing to a low-numbered register. This generally reduces the quantity
> of bytecode generated on web sites by 8-9%.
>
> In order to not degrade speed, a couple of other changes are required:
>
> The existing lookahead logic to check for Star after certain other
> bytecode handlers is updated to check for these new short Star codes
> instead. Furthermore, that lookahead logic is updated to contain its own
> copy of the dispatch jump rather than merging control flow with the
> lookahead-failed case, to improve branch prediction.
>
> A bunch of constants use bytecode size in bytes as a proxy for the size
> or complexity of a function, and are adjusted downward proportionally to
> the decrease in generated bytecode size.
>
> Other small drive-by fix: update generate-bytecode-expectations to emit
> \n instead of \r\n on Windows.
>
> Change-Id: I6307c2b0f5794a3a1088bb0fb94f6e1615441ed5
> Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/2641180
> Reviewed-by: Ross McIlroy <rmcilroy@chromium.org>
> Commit-Queue: Seth Brenith <seth.brenith@microsoft.com>
> Cr-Commit-Position: refs/heads/master@{#72773}
Change-Id: I1afb670c25694498b3989de615858f984a8c7f6f
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/2698057
Commit-Queue: Seth Brenith <seth.brenith@microsoft.com>
Reviewed-by: Ross McIlroy <rmcilroy@chromium.org>
Reviewed-by: Mythri Alle <mythria@chromium.org>
Cr-Commit-Position: refs/heads/master@{#72821}
176 lines
3.9 KiB
Plaintext
176 lines
3.9 KiB
Plaintext
#
|
|
# Autogenerated by generate-bytecode-expectations.
|
|
#
|
|
|
|
---
|
|
wrap: yes
|
|
|
|
---
|
|
snippet: "
|
|
var x = 0;
|
|
label: {
|
|
x = x + 1;
|
|
break label;
|
|
x = x + 1;
|
|
}
|
|
return x;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 11
|
|
bytecodes: [
|
|
/* 42 S> */ B(LdaZero),
|
|
B(Star0),
|
|
/* 62 S> */ B(AddSmi), I8(1), U8(0),
|
|
B(Star0),
|
|
/* 69 S> */ B(Jump), U8(2),
|
|
/* 97 S> */ B(Ldar), R(0),
|
|
/* 106 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var sum = 0;
|
|
outer: {
|
|
for (var x = 0; x < 10; ++x) {
|
|
for (var y = 0; y < 3; ++y) {
|
|
++sum;
|
|
if (x + y == 12) { break outer; }
|
|
}
|
|
}
|
|
}
|
|
return sum;
|
|
"
|
|
frame size: 4
|
|
parameter count: 1
|
|
bytecode array length: 59
|
|
bytecodes: [
|
|
/* 44 S> */ B(LdaZero),
|
|
B(Star0),
|
|
/* 71 S> */ B(LdaZero),
|
|
B(Star1),
|
|
/* 76 S> */ B(LdaSmi), I8(10),
|
|
/* 76 E> */ B(TestLessThan), R(1), U8(0),
|
|
B(JumpIfFalse), U8(47),
|
|
/* 106 S> */ B(LdaZero),
|
|
B(Star2),
|
|
/* 111 S> */ B(LdaSmi), I8(3),
|
|
/* 111 E> */ B(TestLessThan), R(2), U8(1),
|
|
B(JumpIfFalse), U8(30),
|
|
/* 129 S> */ B(Ldar), R(0),
|
|
B(Inc), U8(2),
|
|
B(Star0),
|
|
/* 142 S> */ B(Ldar), R(2),
|
|
/* 148 E> */ B(Add), R(1), U8(3),
|
|
B(Star3),
|
|
B(LdaSmi), I8(12),
|
|
/* 152 E> */ B(TestEqual), R(3), U8(4),
|
|
B(JumpIfFalse), U8(4),
|
|
/* 161 S> */ B(Jump), U8(18),
|
|
/* 118 S> */ B(Ldar), R(2),
|
|
B(Inc), U8(5),
|
|
B(Star2),
|
|
/* 93 E> */ B(JumpLoop), U8(32), I8(1),
|
|
/* 84 S> */ B(Ldar), R(1),
|
|
B(Inc), U8(6),
|
|
B(Star1),
|
|
/* 58 E> */ B(JumpLoop), U8(49), I8(0),
|
|
/* 188 S> */ B(Ldar), R(0),
|
|
/* 199 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
outer: {
|
|
let y = 10;
|
|
function f() { return y; }
|
|
break outer;
|
|
}
|
|
"
|
|
frame size: 3
|
|
parameter count: 1
|
|
bytecode array length: 27
|
|
bytecodes: [
|
|
/* 30 E> */ B(CreateBlockContext), U8(0),
|
|
B(PushContext), R(2),
|
|
B(LdaTheHole),
|
|
B(StaCurrentContextSlot), U8(2),
|
|
B(CreateClosure), U8(1), U8(0), U8(2),
|
|
B(Star1),
|
|
/* 53 S> */ B(LdaSmi), I8(10),
|
|
/* 53 E> */ B(StaCurrentContextSlot), U8(2),
|
|
/* 85 S> */ B(Mov), R(1), R(0),
|
|
B(Ldar), R(1),
|
|
/* 88 S> */ B(Jump), U8(2),
|
|
B(PopContext), R(2),
|
|
B(LdaUndefined),
|
|
/* 103 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
SCOPE_INFO_TYPE,
|
|
SHARED_FUNCTION_INFO_TYPE,
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
let x = 1;
|
|
outer: {
|
|
inner: {
|
|
let y = 2;
|
|
function f() { return x + y; }
|
|
if (y) break outer;
|
|
y = 3;
|
|
}
|
|
}
|
|
x = 4;
|
|
"
|
|
frame size: 4
|
|
parameter count: 1
|
|
bytecode array length: 51
|
|
bytecodes: [
|
|
/* 30 E> */ B(CreateFunctionContext), U8(0), U8(1),
|
|
B(PushContext), R(2),
|
|
B(LdaTheHole),
|
|
B(StaCurrentContextSlot), U8(2),
|
|
/* 42 S> */ B(LdaSmi), I8(1),
|
|
/* 42 E> */ B(StaCurrentContextSlot), U8(2),
|
|
B(CreateBlockContext), U8(1),
|
|
B(PushContext), R(3),
|
|
B(LdaTheHole),
|
|
B(StaCurrentContextSlot), U8(2),
|
|
B(CreateClosure), U8(2), U8(0), U8(2),
|
|
B(Star1),
|
|
/* 76 S> */ B(LdaSmi), I8(2),
|
|
/* 76 E> */ B(StaCurrentContextSlot), U8(2),
|
|
/* 113 S> */ B(Mov), R(1), R(0),
|
|
/* 118 S> */ B(LdaCurrentContextSlot), U8(2),
|
|
B(JumpIfToBooleanFalse), U8(6),
|
|
/* 125 S> */ B(PopContext), R(3),
|
|
B(Jump), U8(8),
|
|
/* 142 S> */ B(LdaSmi), I8(3),
|
|
/* 144 E> */ B(StaCurrentContextSlot), U8(2),
|
|
B(PopContext), R(3),
|
|
/* 155 S> */ B(LdaSmi), I8(4),
|
|
/* 157 E> */ B(StaCurrentContextSlot), U8(2),
|
|
B(LdaUndefined),
|
|
/* 162 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
SCOPE_INFO_TYPE,
|
|
SCOPE_INFO_TYPE,
|
|
SHARED_FUNCTION_INFO_TYPE,
|
|
]
|
|
handlers: [
|
|
]
|
|
|