662aa425ba
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 TBR=yangguo@chromium.org,ulan@chromium.org Change-Id: Ic83e4011148164ef080c63215a0c77f1dfb7f327 Reviewed-on: https://chromium-review.googlesource.com/494487 Reviewed-by: Jaroslav Sevcik <jarin@chromium.org> Commit-Queue: Ross McIlroy <rmcilroy@chromium.org> Cr-Commit-Position: refs/heads/master@{#45084}
120 lines
2.6 KiB
Plaintext
120 lines
2.6 KiB
Plaintext
#
|
|
# Autogenerated by generate-bytecode-expectations.
|
|
#
|
|
|
|
---
|
|
wrap: yes
|
|
|
|
---
|
|
snippet: "
|
|
return [ 1, 2 ];
|
|
"
|
|
frame size: 0
|
|
parameter count: 1
|
|
bytecode array length: 6
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 34 S> */ B(CreateArrayLiteral), U8(0), U8(3), U8(17),
|
|
/* 51 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
TUPLE2_TYPE,
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 1; return [ a, a + 1 ];
|
|
"
|
|
frame size: 3
|
|
parameter count: 1
|
|
bytecode array length: 36
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(CreateArrayLiteral), U8(0), U8(4), U8(17),
|
|
B(Star), R(2),
|
|
B(LdaZero),
|
|
B(Star), R(1),
|
|
B(Ldar), R(0),
|
|
/* 54 E> */ B(StaKeyedPropertySloppy), R(2), R(1), U8(5),
|
|
B(LdaSmi), I8(1),
|
|
B(Star), R(1),
|
|
B(Ldar), R(0),
|
|
/* 59 E> */ B(AddSmi), I8(1), U8(3),
|
|
B(StaKeyedPropertySloppy), R(2), R(1), U8(5),
|
|
B(Ldar), R(2),
|
|
/* 66 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
TUPLE2_TYPE,
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
return [ [ 1, 2 ], [ 3 ] ];
|
|
"
|
|
frame size: 0
|
|
parameter count: 1
|
|
bytecode array length: 6
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 34 S> */ B(CreateArrayLiteral), U8(0), U8(5), U8(0),
|
|
/* 62 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
TUPLE2_TYPE,
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 1; return [ [ a, 2 ], [ a + 2 ] ];
|
|
"
|
|
frame size: 5
|
|
parameter count: 1
|
|
bytecode array length: 66
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(CreateArrayLiteral), U8(0), U8(10), U8(0),
|
|
B(Star), R(2),
|
|
B(LdaZero),
|
|
B(Star), R(1),
|
|
B(CreateArrayLiteral), U8(1), U8(3), U8(17),
|
|
B(Star), R(4),
|
|
B(LdaZero),
|
|
B(Star), R(3),
|
|
B(Ldar), R(0),
|
|
/* 56 E> */ B(StaKeyedPropertySloppy), R(4), R(3), U8(4),
|
|
B(Ldar), R(4),
|
|
B(StaKeyedPropertySloppy), R(2), R(1), U8(11),
|
|
B(LdaSmi), I8(1),
|
|
B(Star), R(1),
|
|
B(CreateArrayLiteral), U8(2), U8(7), U8(17),
|
|
B(Star), R(4),
|
|
B(LdaZero),
|
|
B(Star), R(3),
|
|
B(Ldar), R(0),
|
|
/* 68 E> */ B(AddSmi), I8(2), U8(6),
|
|
B(StaKeyedPropertySloppy), R(4), R(3), U8(8),
|
|
B(Ldar), R(4),
|
|
B(StaKeyedPropertySloppy), R(2), R(1), U8(11),
|
|
B(Ldar), R(2),
|
|
/* 77 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
TUPLE2_TYPE,
|
|
TUPLE2_TYPE,
|
|
TUPLE2_TYPE,
|
|
]
|
|
handlers: [
|
|
]
|
|
|