| 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 --- |
| 11 snippet: " | 11 snippet: " |
| 12 var ld_a = 1; | 12 var ld_a = 1; |
| 13 while(true) { | 13 while(true) { |
| 14 ld_a = ld_a + ld_a; | 14 ld_a = ld_a + ld_a; |
| 15 if (ld_a > 10) break; | 15 if (ld_a > 10) break; |
| 16 } | 16 } |
| 17 return ld_a; | 17 return ld_a; |
| 18 " | 18 " |
| 19 frame size: 1 | 19 frame size: 1 |
| 20 parameter count: 1 | 20 parameter count: 1 |
| 21 bytecode array length: 26 | 21 bytecode array length: 25 |
| 22 bytecodes: [ | 22 bytecodes: [ |
| 23 /* 30 E> */ B(StackCheck), | 23 /* 30 E> */ B(StackCheck), |
| 24 /* 45 S> */ B(LdaSmi), U8(1), | 24 /* 45 S> */ B(LdaSmi), U8(1), |
| 25 /* 45 E> */ B(Star), R(0), | 25 B(Star), R(0), |
| 26 /* 48 E> */ B(StackCheck), | 26 /* 48 E> */ B(StackCheck), |
| 27 /* 64 S> */ B(Nop), | 27 /* 64 S> */ B(Ldar), R(0), |
| 28 /* 78 E> */ B(Ldar), R(0), | 28 /* 78 E> */ B(Add), R(0), |
| 29 B(Add), R(0), | |
| 30 B(Star), R(0), | 29 B(Star), R(0), |
| 31 /* 86 S> */ B(LdaSmi), U8(10), | 30 /* 86 S> */ B(LdaSmi), U8(10), |
| 32 /* 95 E> */ B(TestGreaterThan), R(0), | 31 /* 95 E> */ B(TestGreaterThan), R(0), |
| 33 B(JumpIfFalse), U8(4), | 32 B(JumpIfFalse), U8(4), |
| 34 /* 101 S> */ B(Jump), U8(4), | 33 /* 101 S> */ B(Jump), U8(4), |
| 35 B(Jump), U8(-16), | 34 B(Jump), U8(-15), |
| 36 /* 110 S> */ B(Ldar), R(0), | 35 /* 110 S> */ B(Ldar), R(0), |
| 37 /* 123 S> */ B(Return), | 36 /* 123 S> */ B(Return), |
| 38 ] | 37 ] |
| 39 constant pool: [ | 38 constant pool: [ |
| 40 ] | 39 ] |
| 41 handlers: [ | 40 handlers: [ |
| 42 ] | 41 ] |
| 43 | 42 |
| 44 --- | 43 --- |
| 45 snippet: " | 44 snippet: " |
| 46 var ld_a = 1; | 45 var ld_a = 1; |
| 47 do { | 46 do { |
| 48 ld_a = ld_a + ld_a; | 47 ld_a = ld_a + ld_a; |
| 49 if (ld_a > 10) continue; | 48 if (ld_a > 10) continue; |
| 50 } while(false); | 49 } while(false); |
| 51 return ld_a; | 50 return ld_a; |
| 52 " | 51 " |
| 53 frame size: 1 | 52 frame size: 1 |
| 54 parameter count: 1 | 53 parameter count: 1 |
| 55 bytecode array length: 24 | 54 bytecode array length: 23 |
| 56 bytecodes: [ | 55 bytecodes: [ |
| 57 /* 30 E> */ B(StackCheck), | 56 /* 30 E> */ B(StackCheck), |
| 58 /* 45 S> */ B(LdaSmi), U8(1), | 57 /* 45 S> */ B(LdaSmi), U8(1), |
| 59 /* 45 E> */ B(Star), R(0), | 58 B(Star), R(0), |
| 60 /* 48 E> */ B(StackCheck), | 59 /* 48 E> */ B(StackCheck), |
| 61 /* 55 S> */ B(Nop), | 60 /* 55 S> */ B(Ldar), R(0), |
| 62 /* 69 E> */ B(Ldar), R(0), | 61 /* 69 E> */ B(Add), R(0), |
| 63 B(Add), R(0), | |
| 64 B(Star), R(0), | 62 B(Star), R(0), |
| 65 /* 77 S> */ B(LdaSmi), U8(10), | 63 /* 77 S> */ B(LdaSmi), U8(10), |
| 66 /* 86 E> */ B(TestGreaterThan), R(0), | 64 /* 86 E> */ B(TestGreaterThan), R(0), |
| 67 B(JumpIfFalse), U8(4), | 65 B(JumpIfFalse), U8(4), |
| 68 /* 92 S> */ B(Jump), U8(2), | 66 /* 92 S> */ B(Jump), U8(2), |
| 69 /* 118 S> */ B(Ldar), R(0), | 67 /* 118 S> */ B(Ldar), R(0), |
| 70 /* 131 S> */ B(Return), | 68 /* 131 S> */ B(Return), |
| 71 ] | 69 ] |
| 72 constant pool: [ | 70 constant pool: [ |
| 73 ] | 71 ] |
| (...skipping 17 matching lines...) Expand all Loading... |
| 91 /* 64 E> */ B(Add), R(0), | 89 /* 64 E> */ B(Add), R(0), |
| 92 B(Star), R(0), | 90 B(Star), R(0), |
| 93 /* 72 S> */ B(Nop), | 91 /* 72 S> */ B(Nop), |
| 94 /* 85 S> */ B(Return), | 92 /* 85 S> */ B(Return), |
| 95 ] | 93 ] |
| 96 constant pool: [ | 94 constant pool: [ |
| 97 ] | 95 ] |
| 98 handlers: [ | 96 handlers: [ |
| 99 ] | 97 ] |
| 100 | 98 |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 2038323002:
[interpreter] Filter expression positions at source. (Closed)
Base URL: https://chromium.googlesource.com/v8/v8.git@oth-0060-source-position-testing