recursion.c.169t.optimized
864 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
;; Function multiplication (multiplication, funcdef_no=11, decl_uid=2235, symbol_order=11)
Removing basic block 5
multiplication (int a, int b)
{
int add_acc_7;
int add_acc_9;
<bb 2>:
if (b_11(D) == 0)
goto <bb 4>;
else
goto <bb 3>;
<bb 3>:
add_acc_9 = a_4(D) * b_11(D);
<bb 4>:
# add_acc_7 = PHI <add_acc_9(3), 0(2)>
return add_acc_7;
}
;; Function main (main, funcdef_no=12, decl_uid=2238, symbol_order=12) (executed once)
Removing basic block 5
main ()
{
int a;
int b;
int b;
int a;
int add_acc_12;
int add_acc_13;
<bb 2>:
scanf ("%d %d", &a, &b);
b_3 = b;
a_4 = a;
if (b_3 == 0)
goto <bb 4>;
else
goto <bb 3>;
<bb 3>:
add_acc_12 = b_3 * a_4;
<bb 4>:
# add_acc_13 = PHI <add_acc_12(3), 0(2)>
printf ("%d\n", add_acc_13);
a ={v} {CLOBBER};
b ={v} {CLOBBER};
return 0;
}