A CIL Tutorial - Department of Computer Science - ETH ZÃ¼rich

More documents

Recommendations

Info

CHAPTER 13. WHOLE-PROGRAM ANALYSIS 112 extern int foo(int x); ../test/tut13b.c int bar(int x) { return foo(x); } int main() { bar(1); return 0; } Now we can build this program with the whole program analysis by executing the following commands: $ ciltutcc --merge -o tut13a.o -c test/tut13a.c $ ciltutcc --merge -o tut13b.o -c test/tut13b.c $ ciltutcc --merge --enable-tut13 --tut13-out tut13.dot -o tut13 tut13a.o tut13b.o Then, we can generate a graph from the .dot le as follows: $ dot -Tpdf tut13.dot -o tut13.pdf to produce the graph in Figure 13.1. Which is the call-graph for the whole program. When doing whole program analysis, it is also necessary to override ar. For example, the command: $ ar r tut13.a tut13a.o Should be replaced with the command: $ ciltutcc --merge --mode=AR r tut13.a tut13a.o
CHAPTER 13. WHOLE-PROGRAM ANALYSIS 113 foo main bar Figure 13.1: The call-graph for tut13a.c and tut13b.c 13.3 Exercises 1. Extend CIL's call-graph analysis to correctly handle function pointers by using the Ptranal module dened in cil/src/ext/pta/ptranal.ml. Note the function Ptranal.resolve funptr. 13.4 Further Reading The Capriccio [?] project uses a whole-program call-graph analysis to estimate the amount of stack space needed by threads in C programs. Then, in server programs that use multithreading to hide IO latency, lightweight user-level threads can be used to concurrently process a massive number of incoming client requests. The threads can be very lightweight thanks to the call-graph analysis putting an upper bound on the amount of stack space required.
Page 1 and 2:
A CIL Tutorial Using CIL for langua
Page 3 and 4:
Contents Preface 4 Introduction 5 0
Page 5 and 6:
CONTENTS 3 13 Whole-program Analysi
Page 7 and 8:
Introduction The C Intermediate Lan
Page 9 and 10:
References [1] clang: a C language
Page 11 and 12:
CHAPTER 0. OVERVIEW AND ORGANIZATIO
Page 13 and 14:
Chapter 1 The AST The Concrete Synt
Page 15 and 16:
CHAPTER 1. THE AST 13 1.2 Printing
Page 17 and 18:
References [1] Andrew W. Appel. Mod
Page 19 and 20:
CHAPTER 2. VISITING THE AST 17 open
Page 21 and 22:
CHAPTER 2. VISITING THE AST 19 $ ci
Page 23 and 24:
Chapter 3 Dataow Analysis Dataow An
Page 25 and 26:
CHAPTER 3. DATAFLOW ANALYSIS 23 Cod
Page 27 and 28:
CHAPTER 3. DATAFLOW ANALYSIS 25 let
Page 29 and 30:
CHAPTER 3. DATAFLOW ANALYSIS 27 and
Page 31 and 32:
CHAPTER 3. DATAFLOW ANALYSIS 29 let
Page 33 and 34:
CHAPTER 3. DATAFLOW ANALYSIS 31 DoC
Page 35 and 36:
CHAPTER 3. DATAFLOW ANALYSIS 33 tes
Page 37 and 38:
References [1] Aws Albarghouthi, Ra
Page 39 and 40:
CHAPTER 4. INSTRUMENTATION 37 type
Page 41 and 42:
CHAPTER 4. INSTRUMENTATION 39 metho
Page 43 and 44:
CHAPTER 4. INSTRUMENTATION 41 $ cil
Page 45 and 46:
CHAPTER 5. INTERPRETED CONSTRUCTORS
Page 47 and 48:
CHAPTER 5. INTERPRETED CONSTRUCTORS
Page 49 and 50:
Chapter 6 Overriding Functions When
Page 51 and 52:
CHAPTER 6. OVERRIDING FUNCTIONS 49
Page 53 and 54:
References [1] Kumar Avijit, Pratee
Page 55 and 56:
CHAPTER 7. TYPE QUALIFIERS 53 let c
Page 57 and 58:
CHAPTER 7. TYPE QUALIFIERS 55 let w
Page 59 and 60:
CHAPTER 7. TYPE QUALIFIERS 57 $ cil
Page 61 and 62:
Chapter 8 Dependant Type Qualiers O
Page 63 and 64: CHAPTER 8. DEPENDANT TYPE QUALIFIER
Page 73 and 74: Chapter 9 Type Qualier Inference In
Page 75 and 76: CHAPTER 9. TYPE QUALIFIER INFERENCE
Page 83 and 84: Chapter 10 Adding a New Kind of Sta
Page 85 and 86: CHAPTER 10. ADDING A NEW KIND OF ST
Page 93 and 94: Chapter 11 Program Verication In th
Page 95 and 96: CHAPTER 11. PROGRAM VERIFICATION 93
Page 107 and 108: Chapter 12 Comments CIL has a very
Page 109 and 110: CHAPTER 12. COMMENTS 107 let printC
Page 111 and 112: References [1] Lin Tan, Ding Yuan,
Page 113: CHAPTER 13. WHOLE-PROGRAM ANALYSIS
Page 117 and 118: CHAPTER 14. IMPLEMENTING A SIMPLE D
Page 127 and 128: Chapter 15 Automated Test Generatio
Page 129 and 130: CHAPTER 15. AUTOMATED TEST GENERATI
Page 135 and 136: Index A (module), 10, 13, 15, 10, 1
Page 137 and 138: INDEX 135 isCacheReportType, 11, 11
show all

A CIL Tutorial - Department of Computer Science - ETH ZÃ¼rich

Create successful ePaper yourself

Delete template?

Save as template?