test/cctest/interpreter/bytecode_expectations/RemoveRedundantLdar.golden - Issue 2337123003: [turbofan] Collect invocation counts and compute relative call frequencies.

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

Issue 2337123003: [turbofan] Collect invocation counts and compute relative call frequencies. (Closed)

Patch Set: Address feedback. Created 4 years, 3 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:

« no previous file with comments | « test/cctest/interpreter/bytecode_expectations/RegExpLiterals.golden ('k') | test/cctest/interpreter/bytecode_expectations/StoreGlobal.golden » ('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 execute: yes	6 execute: yes

7 wrap: yes	7 wrap: yes

8	8

9 ---	9 ---

10 snippet: "	10 snippet: "

11 var ld_a = 1;	11 var ld_a = 1;

12 while(true) {	12 while(true) {

13 ld_a = ld_a + ld_a;	13 ld_a = ld_a + ld_a;

14 if (ld_a > 10) break;	14 if (ld_a > 10) break;

15 }	15 }

16 return ld_a;	16 return ld_a;

17 "	17 "

18 frame size: 1	18 frame size: 1

19 parameter count: 1	19 parameter count: 1

20 bytecode array length: 28	20 bytecode array length: 28

21 bytecodes: [	21 bytecodes: [

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

23 /* 45 S> */ B(LdaSmi), U8(1),	23 /* 45 S> */ B(LdaSmi), U8(1),

24 B(Star), R(0),	24 B(Star), R(0),

25 /* 48 E> */ B(StackCheck),	25 /* 48 E> */ B(StackCheck),

26 /* 64 S> */ B(Ldar), R(0),	26 /* 64 S> */ B(Ldar), R(0),

27 /* 78 E> */ B(Add), R(0), U8(1),	27 /* 78 E> */ B(Add), R(0), U8(2),

28 B(Star), R(0),	28 B(Star), R(0),

29 /* 86 S> */ B(LdaSmi), U8(10),	29 /* 86 S> */ B(LdaSmi), U8(10),

30 /* 95 E> */ B(TestGreaterThan), R(0), U8(2),	30 /* 95 E> */ B(TestGreaterThan), R(0), U8(3),

31 B(JumpIfFalse), U8(4),	31 B(JumpIfFalse), U8(4),

32 /* 101 S> */ B(Jump), U8(5),	32 /* 101 S> */ B(Jump), U8(5),

33 B(JumpLoop), U8(-17), U8(0),	33 B(JumpLoop), U8(-17), U8(0),

34 /* 110 S> */ B(Ldar), R(0),	34 /* 110 S> */ B(Ldar), R(0),

35 /* 123 S> */ B(Return),	35 /* 123 S> */ B(Return),

36 ]	36 ]

37 constant pool: [	37 constant pool: [

38 ]	38 ]

39 handlers: [	39 handlers: [

40 ]	40 ]

41	41

42 ---	42 ---

43 snippet: "	43 snippet: "

44 var ld_a = 1;	44 var ld_a = 1;

45 do {	45 do {

46 ld_a = ld_a + ld_a;	46 ld_a = ld_a + ld_a;

47 if (ld_a > 10) continue;	47 if (ld_a > 10) continue;

48 } while(false);	48 } while(false);

49 return ld_a;	49 return ld_a;

50 "	50 "

51 frame size: 1	51 frame size: 1

52 parameter count: 1	52 parameter count: 1

53 bytecode array length: 24	53 bytecode array length: 24

54 bytecodes: [	54 bytecodes: [

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

56 /* 45 S> */ B(LdaSmi), U8(1),	56 /* 45 S> */ B(LdaSmi), U8(1),

57 B(Star), R(0),	57 B(Star), R(0),

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

59 /* 55 S> */ B(Nop),	59 /* 55 S> */ B(Nop),

60 /* 69 E> */ B(Add), R(0), U8(1),	60 /* 69 E> */ B(Add), R(0), U8(2),

61 B(Star), R(0),	61 B(Star), R(0),

62 /* 77 S> */ B(LdaSmi), U8(10),	62 /* 77 S> */ B(LdaSmi), U8(10),

63 /* 86 E> */ B(TestGreaterThan), R(0), U8(2),	63 /* 86 E> */ B(TestGreaterThan), R(0), U8(3),

64 B(JumpIfFalse), U8(4),	64 B(JumpIfFalse), U8(4),

65 /* 92 S> */ B(Jump), U8(2),	65 /* 92 S> */ B(Jump), U8(2),

66 /* 118 S> */ B(Ldar), R(0),	66 /* 118 S> */ B(Ldar), R(0),

67 /* 131 S> */ B(Return),	67 /* 131 S> */ B(Return),

68 ]	68 ]

69 constant pool: [	69 constant pool: [

70 ]	70 ]

71 handlers: [	71 handlers: [

72 ]	72 ]

73	73

74 ---	74 ---

75 snippet: "	75 snippet: "

76 var ld_a = 1;	76 var ld_a = 1;

77 ld_a = ld_a + ld_a;	77 ld_a = ld_a + ld_a;

78 return ld_a;	78 return ld_a;

79 "	79 "

80 frame size: 1	80 frame size: 1

81 parameter count: 1	81 parameter count: 1

82 bytecode array length: 13	82 bytecode array length: 13

83 bytecodes: [	83 bytecodes: [

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

85 /* 45 S> */ B(LdaSmi), U8(1),	85 /* 45 S> */ B(LdaSmi), U8(1),

86 B(Star), R(0),	86 B(Star), R(0),

87 /* 50 S> */ B(Nop),	87 /* 50 S> */ B(Nop),

88 /* 64 E> */ B(Add), R(0), U8(1),	88 /* 64 E> */ B(Add), R(0), U8(2),

89 B(Star), R(0),	89 B(Star), R(0),

90 /* 72 S> */ B(Nop),	90 /* 72 S> */ B(Nop),

91 /* 85 S> */ B(Return),	91 /* 85 S> */ B(Return),

92 ]	92 ]

93 constant pool: [	93 constant pool: [

94 ]	94 ]

95 handlers: [	95 handlers: [

96 ]	96 ]

97	97

OLD	NEW