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}
85 lines
1.7 KiB
Plaintext
85 lines
1.7 KiB
Plaintext
#
|
|
# Autogenerated by generate-bytecode-expectations.
|
|
#
|
|
|
|
---
|
|
wrap: yes
|
|
|
|
---
|
|
snippet: "
|
|
var a = 1; if (a || a < 0) { return 1; }
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 18
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(JumpIfToBooleanTrue), U8(8),
|
|
B(LdaZero),
|
|
/* 56 E> */ B(TestLessThan), R(0), U8(3),
|
|
B(JumpIfFalse), U8(5),
|
|
/* 63 S> */ B(LdaSmi), I8(1),
|
|
/* 75 S> */ B(Return),
|
|
B(LdaUndefined),
|
|
/* 75 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 1; if (a && a < 0) { return 1; }
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 18
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(JumpIfToBooleanFalse), U8(11),
|
|
B(LdaZero),
|
|
/* 56 E> */ B(TestLessThan), R(0), U8(3),
|
|
B(JumpIfFalse), U8(5),
|
|
/* 63 S> */ B(LdaSmi), I8(1),
|
|
/* 75 S> */ B(Return),
|
|
B(LdaUndefined),
|
|
/* 75 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|
|
---
|
|
snippet: "
|
|
var a = 1; a = (a || a < 0) ? 2 : 3;
|
|
"
|
|
frame size: 1
|
|
parameter count: 1
|
|
bytecode array length: 23
|
|
bytecodes: [
|
|
/* 30 E> */ B(StackCheck),
|
|
/* 42 S> */ B(LdaSmi), I8(1),
|
|
B(Star), R(0),
|
|
/* 45 S> */ B(JumpIfToBooleanTrue), U8(8),
|
|
B(LdaZero),
|
|
/* 57 E> */ B(TestLessThan), R(0), U8(3),
|
|
B(JumpIfFalse), U8(6),
|
|
B(LdaSmi), I8(2),
|
|
B(Jump), U8(4),
|
|
B(LdaSmi), I8(3),
|
|
B(Star), R(0),
|
|
B(LdaUndefined),
|
|
/* 71 S> */ B(Return),
|
|
]
|
|
constant pool: [
|
|
]
|
|
handlers: [
|
|
]
|
|
|