| OLD | NEW |
|---|
| (Empty) | |
| 1 # |
| 2 # Autogenerated by generate-bytecode-expectations. |
| 3 # |
| 4 |
| 5 --- |
| 6 pool type: number |
| 7 execute: yes |
| 8 wrap: yes |
| 9 |
| 10 --- |
| 11 snippet: " |
| 12 var x = 0; |
| 13 while (x != 10) { |
| 14 x = x + 10; |
| 15 } |
| 16 return x; |
| 17 " |
| 18 frame size: 2 |
| 19 parameter count: 1 |
| 20 bytecode array length: 31 |
| 21 bytecodes: [ |
| 22 B(StackCheck), |
| 23 B(LdaZero), |
| 24 B(Star), R(0), |
| 25 B(Ldar), R(0), |
| 26 B(Star), R(1), |
| 27 B(LdaSmi8), U8(10), |
| 28 B(TestEqual), R(1), |
| 29 B(LogicalNot), |
| 30 B(JumpIfFalse), U8(15), |
| 31 B(StackCheck), |
| 32 B(Ldar), R(0), |
| 33 B(Star), R(1), |
| 34 B(LdaSmi8), U8(10), |
| 35 B(Add), R(1), |
| 36 B(Star), R(0), |
| 37 B(Jump), U8(-22), |
| 38 B(Ldar), R(0), |
| 39 B(Return), |
| 40 ] |
| 41 constant pool: [ |
| 42 ] |
| 43 handlers: [ |
| 44 ] |
| 45 |
| 46 --- |
| 47 snippet: " |
| 48 var x = false; |
| 49 do { |
| 50 x = !x; |
| 51 } while(x == false); |
| 52 return x; |
| 53 " |
| 54 frame size: 2 |
| 55 parameter count: 1 |
| 56 bytecode array length: 22 |
| 57 bytecodes: [ |
| 58 B(StackCheck), |
| 59 B(LdaFalse), |
| 60 B(Star), R(0), |
| 61 B(StackCheck), |
| 62 B(Ldar), R(0), |
| 63 B(LogicalNot), |
| 64 B(Star), R(0), |
| 65 B(Ldar), R(0), |
| 66 B(Star), R(1), |
| 67 B(LdaFalse), |
| 68 B(TestEqual), R(1), |
| 69 B(JumpIfTrue), U8(-13), |
| 70 B(Ldar), R(0), |
| 71 B(Return), |
| 72 ] |
| 73 constant pool: [ |
| 74 ] |
| 75 handlers: [ |
| 76 ] |
| 77 |
| 78 --- |
| 79 snippet: " |
| 80 var x = 101; |
| 81 return void(x * 3); |
| 82 " |
| 83 frame size: 2 |
| 84 parameter count: 1 |
| 85 bytecode array length: 13 |
| 86 bytecodes: [ |
| 87 B(StackCheck), |
| 88 B(LdaSmi8), U8(101), |
| 89 B(Star), R(0), |
| 90 B(Star), R(1), |
| 91 B(LdaSmi8), U8(3), |
| 92 B(Mul), R(1), |
| 93 B(LdaUndefined), |
| 94 B(Return), |
| 95 ] |
| 96 constant pool: [ |
| 97 ] |
| 98 handlers: [ |
| 99 ] |
| 100 |
| 101 --- |
| 102 snippet: " |
| 103 var x = 1234; |
| 104 var y = void (x * x - 1); |
| 105 return y; |
| 106 " |
| 107 frame size: 4 |
| 108 parameter count: 1 |
| 109 bytecode array length: 21 |
| 110 bytecodes: [ |
| 111 B(StackCheck), |
| 112 B(LdaConstant), U8(0), |
| 113 B(Star), R(0), |
| 114 B(Star), R(2), |
| 115 B(Ldar), R(0), |
| 116 B(Mul), R(2), |
| 117 B(Star), R(3), |
| 118 B(LdaSmi8), U8(1), |
| 119 B(Sub), R(3), |
| 120 B(LdaUndefined), |
| 121 B(Star), R(1), |
| 122 B(Return), |
| 123 ] |
| 124 constant pool: [ |
| 125 1234, |
| 126 ] |
| 127 handlers: [ |
| 128 ] |
| 129 |
| 130 --- |
| 131 snippet: " |
| 132 var x = 13; |
| 133 return ~x; |
| 134 " |
| 135 frame size: 2 |
| 136 parameter count: 1 |
| 137 bytecode array length: 12 |
| 138 bytecodes: [ |
| 139 B(StackCheck), |
| 140 B(LdaSmi8), U8(13), |
| 141 B(Star), R(0), |
| 142 B(Star), R(1), |
| 143 B(LdaSmi8), U8(-1), |
| 144 B(BitwiseXor), R(1), |
| 145 B(Return), |
| 146 ] |
| 147 constant pool: [ |
| 148 ] |
| 149 handlers: [ |
| 150 ] |
| 151 |
| 152 --- |
| 153 snippet: " |
| 154 var x = 13; |
| 155 return +x; |
| 156 " |
| 157 frame size: 2 |
| 158 parameter count: 1 |
| 159 bytecode array length: 12 |
| 160 bytecodes: [ |
| 161 B(StackCheck), |
| 162 B(LdaSmi8), U8(13), |
| 163 B(Star), R(0), |
| 164 B(Star), R(1), |
| 165 B(LdaSmi8), U8(1), |
| 166 B(Mul), R(1), |
| 167 B(Return), |
| 168 ] |
| 169 constant pool: [ |
| 170 ] |
| 171 handlers: [ |
| 172 ] |
| 173 |
| 174 --- |
| 175 snippet: " |
| 176 var x = 13; |
| 177 return -x; |
| 178 " |
| 179 frame size: 2 |
| 180 parameter count: 1 |
| 181 bytecode array length: 12 |
| 182 bytecodes: [ |
| 183 B(StackCheck), |
| 184 B(LdaSmi8), U8(13), |
| 185 B(Star), R(0), |
| 186 B(Star), R(1), |
| 187 B(LdaSmi8), U8(-1), |
| 188 B(Mul), R(1), |
| 189 B(Return), |
| 190 ] |
| 191 constant pool: [ |
| 192 ] |
| 193 handlers: [ |
| 194 ] |
| 195 |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 1717293002:
[Interpreter] Refactor bytecode generator test suite. (Closed)
Base URL: https://chromium.googlesource.com/v8/v8.git@master