Newer
Older
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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
//===-- StackProtector.cpp - Stack Protector Insertion --------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This pass inserts stack protectors into functions which need them. The stack
// protectors this uses are the type that ProPolice used. A variable with a
// random value in it is stored onto the stack before the local variables are
// allocated. Upon exitting the block, the stored value is checked. If it's
// changed, then there was some sort of violation and the program aborts.
//
//===----------------------------------------------------------------------===//
#define DEBUG_TYPE "stack-protector"
#include "llvm/CodeGen/Passes.h"
#include "llvm/Constants.h"
#include "llvm/DerivedTypes.h"
#include "llvm/Function.h"
#include "llvm/Instructions.h"
#include "llvm/Module.h"
#include "llvm/Pass.h"
#include "llvm/ADT/APInt.h"
#include "llvm/Support/CommandLine.h"
using namespace llvm;
// Enable stack protectors.
static cl::opt<unsigned>
SSPBufferSize("ssp-buffer-size", cl::init(8),
cl::desc("The lower bound for a buffer to be considered for "
"stack smashing protection."));
namespace {
class VISIBILITY_HIDDEN StackProtector : public FunctionPass {
// Level == 0 -- Stack protectors are off.
// Level == 1 -- Stack protectors are on only for some functions.
// Level == 2 -- Stack protectors are on for all functions.
int Level;
/// FailBB - Holds the basic block to jump to when the stack protector check
/// fails.
BasicBlock *FailBB;
/// StackProtFrameSlot - The place on the stack that the stack protector
/// guard is kept.
AllocaInst *StackProtFrameSlot;
/// StackGuardVar - The global variable for the stack guard.
GlobalVariable *StackGuardVar;
Function *F;
Module *M;
/// InsertStackProtectorPrologue - Insert code into the entry block that
/// stores the __stack_chk_guard variable onto the stack.
void InsertStackProtectorPrologue();
/// InsertStackProtectorEpilogue - Insert code before the return
/// instructions checking the stack value that was stored in the
/// prologue. If it isn't the same as the original value, then call a
/// "failure" function.
void InsertStackProtectorEpilogue();
/// CreateFailBB - Create a basic block to jump to when the stack protector
/// check fails.
void CreateFailBB();
/// RequiresStackProtector - Check whether or not this function needs a
/// stack protector based upon the stack protector level.
bool RequiresStackProtector();
public:
static char ID; // Pass identification, replacement for typeid.
StackProtector(int lvl = 0) : FunctionPass(&ID), Level(lvl), FailBB(0) {}
virtual bool runOnFunction(Function &Fn);
};
} // end anonymous namespace
char StackProtector::ID = 0;
static RegisterPass<StackProtector>
X("stack-protector", "Insert stack protectors");
FunctionPass *llvm::createStackProtectorPass(int lvl) {
return new StackProtector(lvl);
}
bool StackProtector::runOnFunction(Function &Fn) {
F = &Fn;
M = F->getParent();
if (!RequiresStackProtector()) return false;
InsertStackProtectorPrologue();
InsertStackProtectorEpilogue();
// Cleanup.
FailBB = 0;
StackProtFrameSlot = 0;
StackGuardVar = 0;
return true;
}
/// InsertStackProtectorPrologue - Insert code into the entry block that stores
/// the __stack_chk_guard variable onto the stack.
void StackProtector::InsertStackProtectorPrologue() {
BasicBlock &Entry = F->getEntryBlock();
Instruction &InsertPt = Entry.front();
const char *StackGuardStr = "__stack_chk_guard";
StackGuardVar = M->getNamedGlobal(StackGuardStr);
if (!StackGuardVar)
StackGuardVar = new GlobalVariable(PointerType::getUnqual(Type::Int8Ty),
false, GlobalValue::ExternalLinkage,
0, StackGuardStr, M);
StackProtFrameSlot = new AllocaInst(PointerType::getUnqual(Type::Int8Ty),
"StackProt_Frame", &InsertPt);
LoadInst *LI = new LoadInst(StackGuardVar, "StackGuard", true, &InsertPt);
new StoreInst(LI, StackProtFrameSlot, true, &InsertPt);
}
/// InsertStackProtectorEpilogue - Insert code before the return instructions
/// checking the stack value that was stored in the prologue. If it isn't the
/// same as the original value, then call a "failure" function.
void StackProtector::InsertStackProtectorEpilogue() {
// Create the basic block to jump to when the guard check fails.
CreateFailBB();
Function::iterator I = F->begin(), E = F->end();
std::vector<BasicBlock*> ReturnBBs;
ReturnBBs.reserve(F->size());
for (; I != E; ++I)
if (isa<ReturnInst>((*I).getTerminator()))
ReturnBBs.push_back(I);
if (ReturnBBs.empty()) return; // Odd, but could happen. . .
// Loop through the basic blocks that have return instructions. Convert this:
//
// return:
// ...
// ret ...
//
// into this:
//
// return:
// ...
// %1 = load __stack_chk_guard
// %2 = load <stored stack guard>
// %3 = cmp i1 %1, %2
// br i1 %3, label %SPRet, label %CallStackCheckFailBlk
//
// SPRet:
// ret ...
//
// CallStackCheckFailBlk:
// call void @__stack_chk_fail()
// unreachable
//
for (std::vector<BasicBlock*>::iterator
II = ReturnBBs.begin(), IE = ReturnBBs.end(); II != IE; ++II) {
BasicBlock *BB = *II;
ReturnInst *RI = cast<ReturnInst>(BB->getTerminator());
Function::iterator InsPt = BB; ++InsPt; // Insertion point for new BB.
BasicBlock *NewBB = BasicBlock::Create("SPRet", F, InsPt);
// Move the return instruction into the new basic block.
RI->removeFromParent();
NewBB->getInstList().insert(NewBB->begin(), RI);
LoadInst *LI2 = new LoadInst(StackGuardVar, "", false, BB);
LoadInst *LI1 = new LoadInst(StackProtFrameSlot, "", true, BB);
ICmpInst *Cmp = new ICmpInst(CmpInst::ICMP_EQ, LI1, LI2, "", BB);
BranchInst::Create(NewBB, FailBB, Cmp, BB);
}
}
/// CreateFailBB - Create a basic block to jump to when the stack protector
/// check fails.
void StackProtector::CreateFailBB() {
assert(!FailBB && "Failure basic block already created?!");
FailBB = BasicBlock::Create("CallStackCheckFailBlk", F);
std::vector<const Type*> Params;
Constant *StackChkFail =
M->getOrInsertFunction("__stack_chk_fail",
FunctionType::get(Type::VoidTy, Params, false));
CallInst::Create(StackChkFail, "", FailBB);
new UnreachableInst(FailBB);
}
/// RequiresStackProtector - Check whether or not this function needs a stack
/// protector based upon the stack protector level.
bool StackProtector::RequiresStackProtector() {
switch (Level) {
default: return false;
case 2: return true;
case 1: {
// If the size of the local variables allocated on the stack is greater than
// SSPBufferSize, then we require a stack protector.
uint64_t StackSize = 0;
for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I) {
BasicBlock *BB = I;
for (BasicBlock::iterator
II = BB->begin(), IE = BB->end(); II != IE; ++II)
if (AllocaInst *AI = dyn_cast<AllocaInst>(II))
if (ConstantInt *CI = dyn_cast<ConstantInt>(AI->getArraySize())) {
const APInt &Size = CI->getValue();
StackSize += Size.getZExtValue() * 8;
}
}
if (SSPBufferSize <= StackSize)
return true;
return false;
}
}
}
// [EOF] StackProtector.cpp