v8/test/cctest/interpreter/bytecode_expectations/CallRuntime.golden
Ross McIlroy 11a211ff1b Reland: [TypeFeedbackVector] Store optimized code in the vector
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}
2017-05-10 15:04:35 +00:00

91 lines
1.6 KiB
Plaintext

#
# Autogenerated by generate-bytecode-expectations.
#
---
wrap: no
test function name: f
---
snippet: "
function f() { %TheHole() }
f();
"
frame size: 0
parameter count: 1
bytecode array length: 8
bytecodes: [
/* 10 E> */ B(StackCheck),
/* 15 S> */ B(CallRuntime), U16(Runtime::kTheHole), R(0), U8(0),
B(LdaUndefined),
/* 26 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
function f(a) { return %IsArray(a) }
f(undefined);
"
frame size: 0
parameter count: 2
bytecode array length: 7
bytecodes: [
/* 10 E> */ B(StackCheck),
/* 16 S> */ B(CallRuntime), U16(Runtime::kIsArray), R(arg0), U8(1),
/* 35 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
function f() { return %Add(1, 2) }
f();
"
frame size: 2
parameter count: 1
bytecode array length: 15
bytecodes: [
/* 10 E> */ B(StackCheck),
/* 15 S> */ B(LdaSmi), I8(1),
B(Star), R(0),
B(LdaSmi), I8(2),
B(Star), R(1),
B(CallRuntime), U16(Runtime::kAdd), R(0), U8(2),
/* 33 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
function f() { return %spread_iterable([1]) }
f();
"
frame size: 2
parameter count: 1
bytecode array length: 15
bytecodes: [
/* 10 E> */ B(StackCheck),
/* 15 S> */ B(LdaUndefined),
B(Star), R(0),
B(CreateArrayLiteral), U8(0), U8(3), U8(17),
B(Star), R(1),
B(CallJSRuntime), U8(%spread_iterable), R(0), U8(2),
/* 44 S> */ B(Return),
]
constant pool: [
TUPLE2_TYPE,
]
handlers: [
]