CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript....
Transcript of CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript....
![Page 1: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/1.jpg)
CSC2/455 Software Analysis and ImprovementDead Code Elimination
Sreepathi Pai
URCS
February 20, 2019
![Page 2: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/2.jpg)
Outline
Review
Dead Code Elimination
Postscript
![Page 3: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/3.jpg)
Outline
Review
Dead Code Elimination
Postscript
![Page 4: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/4.jpg)
So far
I Source code
I Three-address form
I Control-flow graphs
I SSA form
I Data flow analyses
![Page 5: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/5.jpg)
Outline
Review
Dead Code Elimination
Postscript
![Page 6: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/6.jpg)
Definitions
I Dead codeI Useless operation: Not externally visibleI Unreachable code: Cannot be executed
I Critical operation: (Direct) “Useful operation”I Operation that computes return valueI Operation that stores to memory (i.e. is externally visible)I Operation that performs I/OI ...
![Page 7: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/7.jpg)
Two Steps: Step 1
I Find all directly useful operations and mark themI Find all indirectly useful operations and mark them
I I.e. those that feed into directly useful operations
I Iterate until all operations that ultimately feed into directlyuseful operations have been found and marked
![Page 8: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/8.jpg)
Two Steps: Step 2
I Remove all operations that remain unmarked
![Page 9: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/9.jpg)
Example #1
void swap(int *x, int *y) {int t;
t = *x;*x = *y;*y = t;
}
![Page 10: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/10.jpg)
Example #2
int min(int x, int y) {int r;
if (x > y) {r = y;
} else {r = x;
}
return r;}
![Page 11: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/11.jpg)
Example #2: 3AC
int min(int x, int y) {int r;int t;
t = x > y;if(t == 0) goto L1;
r = y;goto L2;
L1:r = x;
L2:return r;
}
![Page 12: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/12.jpg)
Example #2: With useless operations removed
int min(int x, int y) {int r;
r = y;r = x;
return r;}
I Marking and removing useless operations uses only dataflowinformation
I Must also preserve control flow (i.e. control dependences)I How to identify useful branches?
![Page 13: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/13.jpg)
Handling Control Flow
I Assume all “jumps” (unconditional branches) are usefulI i.e. goto Lx
I What about conditional branches?
![Page 14: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/14.jpg)
Conditional Branches: Example
int first_N_sum(int N) {int s = 0;
for(int i = 1; i <= N; i++)s = s + i;
return N * (N + 1) / 2;}
![Page 15: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/15.jpg)
3AC code for conditional branches
int first_N_sum(int N) {int s = 0;int i, t;
i = 1;L1:
t = i <= N;if(t == 0) goto L2;
s = s + i;i++;goto L1;
L2:return N * (N + 1) / 2;
}
How do we recognize that the conditional branch is useless in thiscase?
![Page 16: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/16.jpg)
GCC 8.2 for x86-64 (-O0)first_N_sum(int):
push rbpmov rbp, rspmov DWORD PTR [rbp-20], edimov DWORD PTR [rbp-4], 0 ; s = 0mov DWORD PTR [rbp-8], 1 ; i = 1
.L3:mov eax, DWORD PTR [rbp-8]cmp eax, DWORD PTR [rbp-20]jg .L2; s = s + imov eax, DWORD PTR [rbp-8]add DWORD PTR [rbp-4], eaxadd DWORD PTR [rbp-8], 1jmp .L3
.L2:mov eax, DWORD PTR [rbp-20]add eax, 1imul eax, DWORD PTR [rbp-20]mov edx, eaxshr edx, 31add eax, edxsar eaxpop rbpret
![Page 17: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/17.jpg)
GCC 8.2 for x86-64 (-O1)
first_N_sum(int):test edi, edijle .L2lea edx, [rdi+1]mov eax, 1 ; i = 1
.L3:add eax, 1 ; i = i + 1cmp eax, edxjne .L3
.L2:lea eax, [rdi+1]imul edi, eaxmov eax, edishr eax, 31add eax, edisar eaxret
![Page 18: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/18.jpg)
GCC 8.2 for x86-64 (-O2)
first_N_sum(int):lea eax, [rdi+1]imul edi, eaxmov eax, edishr eax, 31add eax, edisar eaxret
All compiler output examples obtained using the Compiler Explorer.
![Page 19: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/19.jpg)
Conditional Branches
I A conditional branch is useful only if:I A useful operation depends on it
I Control dependenceI (informal) an operation O is dependent on a branch B if the
direction of the branch B affects if O is executedI CFG property
![Page 20: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/20.jpg)
Example of control dependence
t = x > yif(t == 0) goto L1
r = y;goto L2;
L1:r = x;
L2:return r;
The assignments to r are dependent on if(t == 0), but returnr is not
![Page 21: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/21.jpg)
Control dependence in the CFG
ENTRY
t = x > y
EXIT
r = y r = x
return r
![Page 22: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/22.jpg)
Control Dependence: Formal Definition
I PostdominanceI A node n postdominates m if it occurs on all paths from m to
EXIT
I A node k is control dependent on i if:I For a path i → j0 → j1 → ... → k , k postdominates all jxI k does not strictly postdominate i
![Page 23: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/23.jpg)
Marking unconditional branches useful
I If node k contains useful operations,
I And if k is control-dependent on node i ,
I Then the (conditional) branch in i is useful.I Operationalized as:
I If block k contains useful operationsI Mark all branches in k ’s reverse dominance frontier RDF(k)
as usefulI RDF computed as DF on edge-reversed CFG
![Page 24: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/24.jpg)
Dead Code Elimination: High-level algorithm
I Mark all directly useful operationsI Repeat until convergence
I Mark all indirectly useful operationsI Mark all unconditional branches in RDFs of useful operations
as useful
I Remove all unmarked operations
I Remove empty nodes in CFG / remove all useless control flowSee algorithms in Figure 10.1 and 10.2 in Turczon and Cooper.
![Page 25: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/25.jpg)
Outline
Review
Dead Code Elimination
Postscript
![Page 26: CSC2/455 Software Analysis and Improvement Dead Code ... · Dead Code Elimination Postscript. References I Chapter 10 of Torczon and Cooper I Section 10.2. Created Date: 2/20/2019](https://reader035.fdocuments.net/reader035/viewer/2022071004/5fc0cbd93c807626a05b528e/html5/thumbnails/26.jpg)
References
I Chapter 10 of Torczon and CooperI Section 10.2