11a211ff1b
Since the feedback vector is itself a native context structure, why not store optimized code for a function in there rather than in a map from native context to code? This allows us to get rid of the optimized code map in the SharedFunctionInfo, saving a pointer, and making lookup of any optimized code quicker. Original patch by Michael Stanton <mvstanton@chromium.org> BUG=v8:6246,chromium:718891 TBR=yangguo@chromium.org,ulan@chromium.org Change-Id: I3bb9ec0cfff32e667cca0e1403f964f33a6958a6 Reviewed-on: https://chromium-review.googlesource.com/500134 Reviewed-by: Ross McIlroy <rmcilroy@chromium.org> Reviewed-by: Jaroslav Sevcik <jarin@chromium.org> Reviewed-by: Ulan Degenbaev <ulan@chromium.org> Commit-Queue: Ross McIlroy <rmcilroy@chromium.org> Cr-Commit-Position: refs/heads/master@{#45234}
97 lines
1.8 KiB
Plaintext
97 lines
1.8 KiB
Plaintext
#
|
|
# Autogenerated by generate-bytecode-expectations.
|
|
#
|
|
|
|
---
|
|
wrap: yes
|
|
|
|
---
|
|
snippet: "
|
|
var ld_a = 1;
|
|
while(true) {
|
|
ld_a = ld_a + ld_a;
|
|
if (ld_a > 10) break;
|
|
}
|
|
return ld_a;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 28
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 45 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 48 E> */ B(StackCheck),
|
|
/* 64 S> */ B(Ldar), R(0),
|
|
/* 76 E> */ B(Add), R(0), U8(3),
|
|
B(Star), R(0),
|
|
/* 86 S> */ B(LdaSmi), I8(10),
|
|
/* 95 E> */ B(TestGreaterThan), R(0), U8(4),
|
|
B(JumpIfFalse), U8(4),
|
|
/* 101 S> */ B(Jump), U8(5),
|
|
B(JumpLoop), U8(17), I8(0),
|
|
/* 110 S> */ B(Ldar), R(0),
|
|
/* 123 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var ld_a = 1;
|
|
do {
|
|
ld_a = ld_a + ld_a;
|
|
if (ld_a > 10) continue;
|
|
} while(false);
|
|
return ld_a;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 24
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 45 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 48 E> */ B(StackCheck),
|
|
/* 55 S> */ B(Nop),
|
|
/* 67 E> */ B(Add), R(0), U8(3),
|
|
B(Star), R(0),
|
|
/* 77 S> */ B(LdaSmi), I8(10),
|
|
/* 86 E> */ B(TestGreaterThan), R(0), U8(4),
|
|
B(JumpIfFalse), U8(4),
|
|
/* 92 S> */ B(Jump), U8(2),
|
|
/* 118 S> */ B(Ldar), R(0),
|
|
/* 131 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var ld_a = 1;
|
|
ld_a = ld_a + ld_a;
|
|
return ld_a;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 13
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 45 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 50 S> */ B(Nop),
|
|
/* 62 E> */ B(Add), R(0), U8(3),
|
|
B(Star), R(0),
|
|
/* 72 S> */ B(Nop),
|
|
/* 85 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|