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

More documents

Recommendations

Info

References [1] Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design patterns: elements of reusable object-oriented software. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1995. 20
Chapter 3 Dataow Analysis Dataow Analyses can be used to calculate an abstraction of the program state at each program location. Dataow analysis is a ow-sensitive analysis, meaning that, unlike ow-insensitive analysis, the order of the statements in the program is taken into account when calculating the abstraction of the state. Traditionally, compiler writers use dataow analyses extensively in performing compiler optimizations. For example, an available expressions dataow analysis can eliminate redundant computation. Most compiler textbooks discuss dataow analysis in detail [2, 3]. A more formal treatment can be found in the textbook by Nielson et al. [4]. CIL has a number of useful dataow analyses built-in, which you can nd in the directory cil/src/ext. They include a liveness analysis, an available expressions analysis, a reaching denitions analysis, and others. The utility of even a simple liveness analysis cannot be underestimated. Consider the following code snippet: int *x = calloc(n, sizeof int); f(x); // x is never mentioned again Since x does not escape the function, and since it is not live after the call to f, even a simple liveness analysis can conclude that f is taking ownership of the memory allocated on the rst line. In this tutorial we explore CIL's dataow analysis features. In particular, we employ the following functor from CIL's Dataflow module found in cil/src/ext/dataflow.ml: module ForwardsDataFlow (T : ForwardsTransfer) = struct ..., which yields a module containing only a function called compute, which performs the dataow analysis using the standard worklist algorithm. The functor is documented in detail in cil/src/ext/dataflow.mli and in the CIL documentation. In order to use this functor, we must create an OCaml module implementing the ForwardsTransfer signature, which denes operations over the abstract state along with the transfer functions for the 21
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: CHAPTER 2. VISITING THE AST 19 $ ci
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 77 and 78:
Page 79 and 80:
Page 81 and 82:
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 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Chapter 11 Program Verication In th
Page 95 and 96:
CHAPTER 11. PROGRAM VERIFICATION 93
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
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 and 114:
CHAPTER 13. WHOLE-PROGRAM ANALYSIS
Page 115 and 116:
CHAPTER 13. WHOLE-PROGRAM ANALYSIS
Page 117 and 118:
CHAPTER 14. IMPLEMENTING A SIMPLE D
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Chapter 15 Automated Test Generatio
Page 129 and 130:
CHAPTER 15. AUTOMATED TEST GENERATI
Page 131 and 132:
Page 133 and 134:
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?