test/cctest/interpreter/bytecode_expectations/UnaryOperators.golden - Issue 1985033002: [Interpreter] Change LogicalNot to ToBooleanLogicalNot and add non-ToBoolean version.

Side by Side Diff

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Keyboard Shortcuts

	File
u :	up to issue
j / k :	jump to file after / before current file
J / K :	jump to next file with a comment after / before current file
	Side-by-side diff
i :	toggle intra-line diffs
e :	expand all comments
c :	collapse all comments
s :	toggle showing all comments
n / p :	next / previous diff chunk or comment
N / P :	next / previous comment
<Up> / <Down> :	next / previous line

	Issue
u :	up to list of issues
j / k :	jump to patch after / before current patch
o / <Enter> :	open current patch in side-by-side view
i :	open current patch in unified diff view

	Issue List
j / k :	jump to issue after / before current issue
o / <Enter> :	open current issue

Side by Side Diff: test/cctest/interpreter/bytecode_expectations/UnaryOperators.golden

Issue 1985033002: [Interpreter] Change LogicalNot to ToBooleanLogicalNot and add non-ToBoolean version. (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@master

Patch Set: Rebase Created 4 years, 7 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch

« no previous file with comments | « test/cctest/interpreter/bytecode_expectations/Generators.golden ('k') | test/unittests/interpreter/bytecode-array-builder-unittest.cc » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Hide Comments ('s')

OLD	NEW
1 #	1 #

2 # Autogenerated by generate-bytecode-expectations.	2 # Autogenerated by generate-bytecode-expectations.

3 #	3 #

4	4

5 ---	5 ---

6 pool type: number	6 pool type: number

7 execute: yes	7 execute: yes

8 wrap: yes	8 wrap: yes

9	9

10 ---	10 ---

(...skipping 42 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
53 "	53 "

54 frame size: 2	54 frame size: 2

55 parameter count: 1	55 parameter count: 1

56 bytecode array length: 22	56 bytecode array length: 22

57 bytecodes: [	57 bytecodes: [

58 /* 30 E> */ B(StackCheck),	58 /* 30 E> */ B(StackCheck),

59 /* 42 S> */ B(LdaFalse),	59 /* 42 S> */ B(LdaFalse),

60 /* 42 E> */ B(Star), R(0),	60 /* 42 E> */ B(Star), R(0),

61 /* 49 E> */ B(StackCheck),	61 /* 49 E> */ B(StackCheck),

62 /* 56 S> */ B(Ldar), R(0),	62 /* 56 S> */ B(Ldar), R(0),

63 B(LogicalNot),	63 B(ToBooleanLogicalNot),

64 /* 58 E> */ B(Star), R(0),	64 /* 58 E> */ B(Star), R(0),

65 /* 74 S> */ B(Ldar), R(0),	65 /* 74 S> */ B(Ldar), R(0),

66 B(Star), R(1),	66 B(Star), R(1),

67 B(LdaFalse),	67 B(LdaFalse),

68 /* 74 E> */ B(TestEqual), R(1),	68 /* 74 E> */ B(TestEqual), R(1),

69 B(JumpIfTrue), U8(-13),	69 B(JumpIfTrue), U8(-13),

70 /* 85 S> */ B(Ldar), R(0),	70 /* 85 S> */ B(Ldar), R(0),

71 /* 95 S> */ B(Return),	71 /* 95 S> */ B(Return),

72 ]	72 ]

73 constant pool: [	73 constant pool: [

(...skipping 111 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
185 /* 46 S> */ B(Star), R(1),	185 /* 46 S> */ B(Star), R(1),

186 B(LdaSmi), U8(-1),	186 B(LdaSmi), U8(-1),

187 B(Mul), R(1),	187 B(Mul), R(1),

188 /* 57 S> */ B(Return),	188 /* 57 S> */ B(Return),

189 ]	189 ]

190 constant pool: [	190 constant pool: [

191 ]	191 ]

192 handlers: [	192 handlers: [

193 ]	193 ]

194	194

OLD	NEW