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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
//===-- Passes.h ------------------------------------------------*- C++ -*-===//
//
// The KLEE Symbolic Virtual Machine
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#ifndef KLEE_PASSES_H
#define KLEE_PASSES_H
#include "llvm/Constants.h"
#include "llvm/Instructions.h"
#include "llvm/Module.h"
#include "llvm/Pass.h"
#include "llvm/CodeGen/IntrinsicLowering.h"
namespace llvm {
class Function;
class Instruction;
class Module;
class TargetData;
class Type;
}
namespace klee {
/// RaiseAsmPass - This pass raises some common occurences of inline
/// asm which are used by glibc into normal LLVM IR.
class RaiseAsmPass : public llvm::ModulePass {
static char ID;
llvm::Function *getIntrinsic(llvm::Module &M,
unsigned IID,
const llvm::Type **Tys,
unsigned NumTys);
llvm::Function *getIntrinsic(llvm::Module &M,
unsigned IID,
const llvm::Type *Ty0) {
return getIntrinsic(M, IID, &Ty0, 1);
}
bool runOnInstruction(llvm::Module &M, llvm::Instruction *I);
public:
RaiseAsmPass() : llvm::ModulePass((intptr_t) &ID) {}
virtual bool runOnModule(llvm::Module &M);
};
// This is a module pass because it can add and delete module
// variables (via intrinsic lowering).
class IntrinsicCleanerPass : public llvm::ModulePass {
static char ID;
const llvm::TargetData &TargetData;
llvm::IntrinsicLowering *IL;
bool LowerIntrinsics;
bool runOnBasicBlock(llvm::BasicBlock &b);
public:
IntrinsicCleanerPass(const llvm::TargetData &TD,
bool LI=true)
: llvm::ModulePass((intptr_t) &ID),
TargetData(TD),
IL(new llvm::IntrinsicLowering(TD)),
LowerIntrinsics(LI) {}
~IntrinsicCleanerPass() { delete IL; }
virtual bool runOnModule(llvm::Module &M);
};
// performs two transformations which make interpretation
// easier and faster.
//
// 1) Ensure that all the PHI nodes in a basic block have
// the incoming block list in the same order. Thus the
// incoming block index only needs to be computed once
// for each transfer.
//
// 2) Ensure that no PHI node result is used as an argument to
// a subsequent PHI node in the same basic block. This allows
// the transfer to execute the instructions in order instead
// of in two passes.
class PhiCleanerPass : public llvm::FunctionPass {
static char ID;
public:
PhiCleanerPass() : llvm::FunctionPass((intptr_t) &ID) {}
virtual bool runOnFunction(llvm::Function &f);
};
class DivCheckPass : public llvm::ModulePass {
static char ID;
public:
DivCheckPass(): ModulePass((intptr_t) &ID) {}
virtual bool runOnModule(llvm::Module &M);
};
/// LowerSwitchPass - Replace all SwitchInst instructions with chained branch
/// instructions. Note that this cannot be a BasicBlock pass because it
/// modifies the CFG!
class LowerSwitchPass : public llvm::FunctionPass {
public:
static char ID; // Pass identification, replacement for typeid
LowerSwitchPass() : FunctionPass((intptr_t) &ID) {}
virtual bool runOnFunction(llvm::Function &F);
struct SwitchCase {
llvm ::Constant *value;
llvm::BasicBlock *block;
SwitchCase() : value(0), block(0) { }
SwitchCase(llvm::Constant *v, llvm::BasicBlock *b) :
value(v), block(b) { }
};
typedef std::vector<SwitchCase> CaseVector;
typedef std::vector<SwitchCase>::iterator CaseItr;
private:
void processSwitchInst(llvm::SwitchInst *SI);
void switchConvert(CaseItr begin,
CaseItr end,
llvm::Value *value,
llvm::BasicBlock *origBlock,
llvm::BasicBlock *defaultBlock);
};
}
#endif
|
