v8/test/cctest/interpreter/bytecode_expectations/LogicalExpressions.golden

942 lines
24 KiB
Plaintext
Raw Normal View History

#
# Autogenerated by generate-bytecode-expectations.
#
---
wrap: yes
---
snippet: "
var x = 0; return x || 3;
"
frame size: 1
parameter count: 1
bytecode array length: 9
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaZero),
B(Star), R(0),
/* 45 S> */ B(JumpIfToBooleanTrue), U8(4),
B(LdaSmi), I8(3),
/* 60 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 0; return (x == 1) || 3;
"
frame size: 1
parameter count: 1
bytecode array length: 14
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaZero),
B(Star), R(0),
/* 45 S> */ B(LdaSmi), I8(1),
Revert "[TypeFeedbackVector] Store optimized code in the vector" This reverts commit c5ad9c6d8e6bdc10753d04f869180b3e517e9591. Reason for revert: Fails on gc stress: https://build.chromium.org/p/client.v8/builders/V8%20Linux64%20GC%20Stress%20-%20custom%20snapshot/builds/12661 Original change's description: > [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 > > Change-Id: I60ff8c408c3001bc272b4b198c9cbaea2872a9e5 > Reviewed-on: https://chromium-review.googlesource.com/476891 > Commit-Queue: Ross McIlroy <rmcilroy@chromium.org> > Reviewed-by: Michael Stanton <mvstanton@chromium.org> > Reviewed-by: Yang Guo <yangguo@chromium.org> > Reviewed-by: Jaroslav Sevcik <jarin@chromium.org> > Reviewed-by: Ulan Degenbaev <ulan@chromium.org> > Cr-Commit-Position: refs/heads/master@{#45022} TBR=ulan@chromium.org,rmcilroy@chromium.org,yangguo@chromium.org,mvstanton@chromium.org,jarin@chromium.org NOPRESUBMIT=true NOTREECHECKS=true NOTRY=true BUG=v8:6246 Change-Id: I9cd5735b03898cae6ae7adea0f19d32fceb31619 Reviewed-on: https://chromium-review.googlesource.com/493287 Reviewed-by: Michael Achenbach <machenbach@chromium.org> Commit-Queue: Michael Achenbach <machenbach@chromium.org> Cr-Commit-Position: refs/heads/master@{#45027}
2017-05-02 11:50:53 +00:00
/* 55 E> */ B(TestEqual), R(0), U8(2),
B(JumpIfTrue), U8(4),
B(LdaSmi), I8(3),
/* 67 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 0; return x && 3;
"
frame size: 1
parameter count: 1
bytecode array length: 9
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaZero),
B(Star), R(0),
/* 45 S> */ B(JumpIfToBooleanFalse), U8(4),
B(LdaSmi), I8(3),
/* 60 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 0; return (x == 0) && 3;
"
frame size: 1
parameter count: 1
bytecode array length: 13
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaZero),
B(Star), R(0),
/* 45 S> */ B(LdaZero),
Revert "[TypeFeedbackVector] Store optimized code in the vector" This reverts commit c5ad9c6d8e6bdc10753d04f869180b3e517e9591. Reason for revert: Fails on gc stress: https://build.chromium.org/p/client.v8/builders/V8%20Linux64%20GC%20Stress%20-%20custom%20snapshot/builds/12661 Original change's description: > [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 > > Change-Id: I60ff8c408c3001bc272b4b198c9cbaea2872a9e5 > Reviewed-on: https://chromium-review.googlesource.com/476891 > Commit-Queue: Ross McIlroy <rmcilroy@chromium.org> > Reviewed-by: Michael Stanton <mvstanton@chromium.org> > Reviewed-by: Yang Guo <yangguo@chromium.org> > Reviewed-by: Jaroslav Sevcik <jarin@chromium.org> > Reviewed-by: Ulan Degenbaev <ulan@chromium.org> > Cr-Commit-Position: refs/heads/master@{#45022} TBR=ulan@chromium.org,rmcilroy@chromium.org,yangguo@chromium.org,mvstanton@chromium.org,jarin@chromium.org NOPRESUBMIT=true NOTREECHECKS=true NOTRY=true BUG=v8:6246 Change-Id: I9cd5735b03898cae6ae7adea0f19d32fceb31619 Reviewed-on: https://chromium-review.googlesource.com/493287 Reviewed-by: Michael Achenbach <machenbach@chromium.org> Commit-Queue: Michael Achenbach <machenbach@chromium.org> Cr-Commit-Position: refs/heads/master@{#45027}
2017-05-02 11:50:53 +00:00
/* 55 E> */ B(TestEqual), R(0), U8(2),
B(JumpIfFalse), U8(4),
B(LdaSmi), I8(3),
/* 67 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 0; return x || (1, 2, 3);
"
frame size: 1
parameter count: 1
bytecode array length: 9
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaZero),
B(Star), R(0),
/* 45 S> */ B(JumpIfToBooleanTrue), U8(4),
B(LdaSmi), I8(3),
/* 68 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var a = 2, b = 3, c = 4; return a || (a, b, a, b, c = 5, 3);
"
frame size: 3
parameter count: 1
bytecode array length: 24
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaSmi), I8(2),
B(Star), R(0),
/* 49 S> */ B(LdaSmi), I8(3),
B(Star), R(1),
/* 56 S> */ B(LdaSmi), I8(4),
B(Star), R(2),
/* 59 S> */ B(Ldar), R(0),
B(JumpIfToBooleanTrue), U8(8),
B(LdaSmi), I8(5),
B(Star), R(2),
B(LdaSmi), I8(3),
/* 95 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 1; var a = 2, b = 3; return x || (
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2, 3);
"
frame size: 3
parameter count: 1
bytecode array length: 276
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaSmi), I8(1),
B(Star), R(0),
/* 53 S> */ B(LdaSmi), I8(2),
B(Star), R(1),
/* 60 S> */ B(LdaSmi), I8(3),
B(Star), R(2),
/* 63 S> */ B(Ldar), R(0),
B(JumpIfToBooleanTrueConstant), U8(0),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(3),
/* 624 S> */ B(Return),
]
constant pool: [
Smi [260],
]
handlers: [
]
---
snippet: "
var x = 0; var a = 2, b = 3; return x && (
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2, 3);
"
frame size: 3
parameter count: 1
bytecode array length: 275
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaZero),
B(Star), R(0),
/* 53 S> */ B(LdaSmi), I8(2),
B(Star), R(1),
/* 60 S> */ B(LdaSmi), I8(3),
B(Star), R(2),
/* 63 S> */ B(Ldar), R(0),
B(JumpIfToBooleanFalseConstant), U8(0),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(3),
/* 624 S> */ B(Return),
]
constant pool: [
Smi [260],
]
handlers: [
]
---
snippet: "
var x = 1; var a = 2, b = 3; return (x > 3) || (
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2, 3);
"
frame size: 3
parameter count: 1
bytecode array length: 279
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaSmi), I8(1),
B(Star), R(0),
/* 53 S> */ B(LdaSmi), I8(2),
B(Star), R(1),
/* 60 S> */ B(LdaSmi), I8(3),
B(Star), R(2),
/* 63 S> */ B(LdaSmi), I8(3),
Revert "[TypeFeedbackVector] Store optimized code in the vector" This reverts commit c5ad9c6d8e6bdc10753d04f869180b3e517e9591. Reason for revert: Fails on gc stress: https://build.chromium.org/p/client.v8/builders/V8%20Linux64%20GC%20Stress%20-%20custom%20snapshot/builds/12661 Original change's description: > [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 > > Change-Id: I60ff8c408c3001bc272b4b198c9cbaea2872a9e5 > Reviewed-on: https://chromium-review.googlesource.com/476891 > Commit-Queue: Ross McIlroy <rmcilroy@chromium.org> > Reviewed-by: Michael Stanton <mvstanton@chromium.org> > Reviewed-by: Yang Guo <yangguo@chromium.org> > Reviewed-by: Jaroslav Sevcik <jarin@chromium.org> > Reviewed-by: Ulan Degenbaev <ulan@chromium.org> > Cr-Commit-Position: refs/heads/master@{#45022} TBR=ulan@chromium.org,rmcilroy@chromium.org,yangguo@chromium.org,mvstanton@chromium.org,jarin@chromium.org NOPRESUBMIT=true NOTREECHECKS=true NOTRY=true BUG=v8:6246 Change-Id: I9cd5735b03898cae6ae7adea0f19d32fceb31619 Reviewed-on: https://chromium-review.googlesource.com/493287 Reviewed-by: Michael Achenbach <machenbach@chromium.org> Commit-Queue: Michael Achenbach <machenbach@chromium.org> Cr-Commit-Position: refs/heads/master@{#45027}
2017-05-02 11:50:53 +00:00
/* 73 E> */ B(TestGreaterThan), R(0), U8(2),
B(JumpIfTrueConstant), U8(0),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(3),
/* 630 S> */ B(Return),
]
constant pool: [
Smi [260],
]
handlers: [
]
---
snippet: "
var x = 0; var a = 2, b = 3; return (x < 5) && (
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2,
a = 1, b = 2, 3);
"
frame size: 3
parameter count: 1
bytecode array length: 278
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaZero),
B(Star), R(0),
/* 53 S> */ B(LdaSmi), I8(2),
B(Star), R(1),
/* 60 S> */ B(LdaSmi), I8(3),
B(Star), R(2),
/* 63 S> */ B(LdaSmi), I8(5),
Revert "[TypeFeedbackVector] Store optimized code in the vector" This reverts commit c5ad9c6d8e6bdc10753d04f869180b3e517e9591. Reason for revert: Fails on gc stress: https://build.chromium.org/p/client.v8/builders/V8%20Linux64%20GC%20Stress%20-%20custom%20snapshot/builds/12661 Original change's description: > [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 > > Change-Id: I60ff8c408c3001bc272b4b198c9cbaea2872a9e5 > Reviewed-on: https://chromium-review.googlesource.com/476891 > Commit-Queue: Ross McIlroy <rmcilroy@chromium.org> > Reviewed-by: Michael Stanton <mvstanton@chromium.org> > Reviewed-by: Yang Guo <yangguo@chromium.org> > Reviewed-by: Jaroslav Sevcik <jarin@chromium.org> > Reviewed-by: Ulan Degenbaev <ulan@chromium.org> > Cr-Commit-Position: refs/heads/master@{#45022} TBR=ulan@chromium.org,rmcilroy@chromium.org,yangguo@chromium.org,mvstanton@chromium.org,jarin@chromium.org NOPRESUBMIT=true NOTREECHECKS=true NOTRY=true BUG=v8:6246 Change-Id: I9cd5735b03898cae6ae7adea0f19d32fceb31619 Reviewed-on: https://chromium-review.googlesource.com/493287 Reviewed-by: Michael Achenbach <machenbach@chromium.org> Commit-Queue: Michael Achenbach <machenbach@chromium.org> Cr-Commit-Position: refs/heads/master@{#45027}
2017-05-02 11:50:53 +00:00
/* 73 E> */ B(TestLessThan), R(0), U8(2),
B(JumpIfFalseConstant), U8(0),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(1),
B(Star), R(1),
B(LdaSmi), I8(2),
B(Star), R(2),
B(LdaSmi), I8(3),
/* 630 S> */ B(Return),
]
constant pool: [
Smi [260],
]
handlers: [
]
---
snippet: "
return 0 && 3;
"
frame size: 0
parameter count: 1
bytecode array length: 3
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 34 S> */ B(LdaZero),
/* 49 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
return 1 || 3;
"
frame size: 0
parameter count: 1
bytecode array length: 4
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 34 S> */ B(LdaSmi), I8(1),
/* 49 S> */ B(Return),
]
constant pool: [
]
handlers: [
]
---
snippet: "
var x = 1; return x && 3 || 0, 1;
"
frame size: 1
parameter count: 1
bytecode array length: 15
bytecodes: [
/* 30 E> */ B(StackCheck),
/* 42 S> */ B(LdaSmi), I8(1),
B(Star), R(0),
/* 45 S> */ B(JumpIfToBooleanFalse), U8(4),
B(LdaSmi), I8(3),
B(JumpIfToBooleanTrue), U8(3),
B(LdaZero),
B(LdaSmi), I8(1),
/* 68 S> */ B(Return),
]
constant pool: [
]
handlers: [
]