1 //===-- llvm-stress.cpp - Generate random LL files to stress-test LLVM ----===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This program is a utility that generates random .ll files to stress-test
11 // different components in LLVM.
13 //===----------------------------------------------------------------------===//
14 #include "llvm/IR/LLVMContext.h"
15 #include "llvm/ADT/OwningPtr.h"
16 #include "llvm/Analysis/CallGraphSCCPass.h"
17 #include "llvm/Analysis/Verifier.h"
18 #include "llvm/Assembly/PrintModulePass.h"
19 #include "llvm/IR/Constants.h"
20 #include "llvm/IR/Instruction.h"
21 #include "llvm/IR/Module.h"
22 #include "llvm/PassManager.h"
23 #include "llvm/Support/Debug.h"
24 #include "llvm/Support/ManagedStatic.h"
25 #include "llvm/Support/PassNameParser.h"
26 #include "llvm/Support/PluginLoader.h"
27 #include "llvm/Support/PrettyStackTrace.h"
28 #include "llvm/Support/ToolOutputFile.h"
35 static cl::opt<unsigned> SeedCL("seed",
36 cl::desc("Seed used for randomness"), cl::init(0));
37 static cl::opt<unsigned> SizeCL("size",
38 cl::desc("The estimated size of the generated function (# of instrs)"),
40 static cl::opt<std::string>
41 OutputFilename("o", cl::desc("Override output filename"),
42 cl::value_desc("filename"));
44 static cl::opt<bool> GenHalfFloat("generate-half-float",
45 cl::desc("Generate half-length floating-point values"), cl::init(false));
46 static cl::opt<bool> GenX86FP80("generate-x86-fp80",
47 cl::desc("Generate 80-bit X86 floating-point values"), cl::init(false));
48 static cl::opt<bool> GenFP128("generate-fp128",
49 cl::desc("Generate 128-bit floating-point values"), cl::init(false));
50 static cl::opt<bool> GenPPCFP128("generate-ppc-fp128",
51 cl::desc("Generate 128-bit PPC floating-point values"), cl::init(false));
52 static cl::opt<bool> GenX86MMX("generate-x86-mmx",
53 cl::desc("Generate X86 MMX floating-point values"), cl::init(false));
55 /// A utility class to provide a pseudo-random number generator which is
56 /// the same across all platforms. This is somewhat close to the libc
57 /// implementation. Note: This is not a cryptographically secure pseudorandom
62 Random(unsigned _seed):Seed(_seed) {}
64 /// Return a random integer, up to a
65 /// maximum of 2**19 - 1.
67 uint32_t Val = Seed + 0x000b07a1;
68 Seed = (Val * 0x3c7c0ac1);
69 // Only lowest 19 bits are random-ish.
70 return Seed & 0x7ffff;
73 /// Return a random 32 bit integer.
75 uint32_t Val = Rand();
77 return Val | (Rand() << 16);
80 /// Return a random 64 bit integer.
82 uint64_t Val = Rand32();
83 return Val | (uint64_t(Rand32()) << 32);
86 /// Rand operator for STL algorithms.
87 ptrdiff_t operator()(ptrdiff_t y) {
95 /// Generate an empty function with a default argument list.
96 Function *GenEmptyFunction(Module *M) {
98 std::vector<Type*> ArgsTy;
99 // Define a few arguments
100 LLVMContext &Context = M->getContext();
101 ArgsTy.push_back(PointerType::get(IntegerType::getInt8Ty(Context), 0));
102 ArgsTy.push_back(PointerType::get(IntegerType::getInt32Ty(Context), 0));
103 ArgsTy.push_back(PointerType::get(IntegerType::getInt64Ty(Context), 0));
104 ArgsTy.push_back(IntegerType::getInt32Ty(Context));
105 ArgsTy.push_back(IntegerType::getInt64Ty(Context));
106 ArgsTy.push_back(IntegerType::getInt8Ty(Context));
108 FunctionType *FuncTy = FunctionType::get(Type::getVoidTy(Context), ArgsTy, 0);
109 // Pick a unique name to describe the input parameters
110 std::stringstream ss;
111 ss<<"autogen_SD"<<SeedCL;
112 Function *Func = Function::Create(FuncTy, GlobalValue::ExternalLinkage,
115 Func->setCallingConv(CallingConv::C);
119 /// A base class, implementing utilities needed for
120 /// modifying and adding new random instructions.
122 /// Used to store the randomly generated values.
123 typedef std::vector<Value*> PieceTable;
127 Modifier(BasicBlock *Block, PieceTable *PT, Random *R):
128 BB(Block),PT(PT),Ran(R),Context(BB->getContext()) {}
130 /// virtual D'tor to silence warnings.
133 /// Add a new instruction.
134 virtual void Act() = 0;
135 /// Add N new instructions,
136 virtual void ActN(unsigned n) {
137 for (unsigned i=0; i<n; ++i)
142 /// Return a random value from the list of known values.
143 Value *getRandomVal() {
145 return PT->at(Ran->Rand() % PT->size());
148 Constant *getRandomConstant(Type *Tp) {
149 if (Tp->isIntegerTy()) {
151 return ConstantInt::getAllOnesValue(Tp);
152 return ConstantInt::getNullValue(Tp);
153 } else if (Tp->isFloatingPointTy()) {
155 return ConstantFP::getAllOnesValue(Tp);
156 return ConstantFP::getNullValue(Tp);
158 return UndefValue::get(Tp);
161 /// Return a random value with a known type.
162 Value *getRandomValue(Type *Tp) {
163 unsigned index = Ran->Rand();
164 for (unsigned i=0; i<PT->size(); ++i) {
165 Value *V = PT->at((index + i) % PT->size());
166 if (V->getType() == Tp)
170 // If the requested type was not found, generate a constant value.
171 if (Tp->isIntegerTy()) {
173 return ConstantInt::getAllOnesValue(Tp);
174 return ConstantInt::getNullValue(Tp);
175 } else if (Tp->isFloatingPointTy()) {
177 return ConstantFP::getAllOnesValue(Tp);
178 return ConstantFP::getNullValue(Tp);
179 } else if (Tp->isVectorTy()) {
180 VectorType *VTp = cast<VectorType>(Tp);
182 std::vector<Constant*> TempValues;
183 TempValues.reserve(VTp->getNumElements());
184 for (unsigned i = 0; i < VTp->getNumElements(); ++i)
185 TempValues.push_back(getRandomConstant(VTp->getScalarType()));
187 ArrayRef<Constant*> VectorValue(TempValues);
188 return ConstantVector::get(VectorValue);
191 return UndefValue::get(Tp);
194 /// Return a random value of any pointer type.
195 Value *getRandomPointerValue() {
196 unsigned index = Ran->Rand();
197 for (unsigned i=0; i<PT->size(); ++i) {
198 Value *V = PT->at((index + i) % PT->size());
199 if (V->getType()->isPointerTy())
202 return UndefValue::get(pickPointerType());
205 /// Return a random value of any vector type.
206 Value *getRandomVectorValue() {
207 unsigned index = Ran->Rand();
208 for (unsigned i=0; i<PT->size(); ++i) {
209 Value *V = PT->at((index + i) % PT->size());
210 if (V->getType()->isVectorTy())
213 return UndefValue::get(pickVectorType());
216 /// Pick a random type.
218 return (Ran->Rand() & 1 ? pickVectorType() : pickScalarType());
221 /// Pick a random pointer type.
222 Type *pickPointerType() {
223 Type *Ty = pickType();
224 return PointerType::get(Ty, 0);
227 /// Pick a random vector type.
228 Type *pickVectorType(unsigned len = (unsigned)-1) {
229 // Pick a random vector width in the range 2**0 to 2**4.
230 // by adding two randoms we are generating a normal-like distribution
232 unsigned width = 1<<((Ran->Rand() % 3) + (Ran->Rand() % 3));
235 // Vectors of x86mmx are illegal; keep trying till we get something else.
237 Ty = pickScalarType();
238 } while (Ty->isX86_MMXTy());
240 if (len != (unsigned)-1)
242 return VectorType::get(Ty, width);
245 /// Pick a random scalar type.
246 Type *pickScalarType() {
249 switch (Ran->Rand() % 30) {
250 case 0: t = Type::getInt1Ty(Context); break;
251 case 1: t = Type::getInt8Ty(Context); break;
252 case 2: t = Type::getInt16Ty(Context); break;
254 case 5: t = Type::getFloatTy(Context); break;
256 case 8: t = Type::getDoubleTy(Context); break;
258 case 11: t = Type::getInt32Ty(Context); break;
260 case 14: t = Type::getInt64Ty(Context); break;
262 case 17: if (GenHalfFloat) t = Type::getHalfTy(Context); break;
264 case 20: if (GenX86FP80) t = Type::getX86_FP80Ty(Context); break;
266 case 23: if (GenFP128) t = Type::getFP128Ty(Context); break;
268 case 26: if (GenPPCFP128) t = Type::getPPC_FP128Ty(Context); break;
270 case 29: if (GenX86MMX) t = Type::getX86_MMXTy(Context); break;
271 default: llvm_unreachable("Invalid scalar value");
278 /// Basic block to populate
282 /// Random number generator
285 LLVMContext &Context;
288 struct LoadModifier: public Modifier {
289 LoadModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {}
290 virtual ~LoadModifier();
292 // Try to use predefined pointers. If non exist, use undef pointer value;
293 Value *Ptr = getRandomPointerValue();
294 Value *V = new LoadInst(Ptr, "L", BB->getTerminator());
299 struct StoreModifier: public Modifier {
300 StoreModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {}
301 virtual ~StoreModifier();
303 // Try to use predefined pointers. If non exist, use undef pointer value;
304 Value *Ptr = getRandomPointerValue();
305 Type *Tp = Ptr->getType();
306 Value *Val = getRandomValue(Tp->getContainedType(0));
307 Type *ValTy = Val->getType();
309 // Do not store vectors of i1s because they are unsupported
311 if (ValTy->isVectorTy() && ValTy->getScalarSizeInBits() == 1)
314 new StoreInst(Val, Ptr, BB->getTerminator());
318 struct BinModifier: public Modifier {
319 BinModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {}
320 virtual ~BinModifier();
323 Value *Val0 = getRandomVal();
324 Value *Val1 = getRandomValue(Val0->getType());
326 // Don't handle pointer types.
327 if (Val0->getType()->isPointerTy() ||
328 Val1->getType()->isPointerTy())
331 // Don't handle i1 types.
332 if (Val0->getType()->getScalarSizeInBits() == 1)
336 bool isFloat = Val0->getType()->getScalarType()->isFloatingPointTy();
337 Instruction* Term = BB->getTerminator();
338 unsigned R = Ran->Rand() % (isFloat ? 7 : 13);
339 Instruction::BinaryOps Op;
342 default: llvm_unreachable("Invalid BinOp");
343 case 0:{Op = (isFloat?Instruction::FAdd : Instruction::Add); break; }
344 case 1:{Op = (isFloat?Instruction::FSub : Instruction::Sub); break; }
345 case 2:{Op = (isFloat?Instruction::FMul : Instruction::Mul); break; }
346 case 3:{Op = (isFloat?Instruction::FDiv : Instruction::SDiv); break; }
347 case 4:{Op = (isFloat?Instruction::FDiv : Instruction::UDiv); break; }
348 case 5:{Op = (isFloat?Instruction::FRem : Instruction::SRem); break; }
349 case 6:{Op = (isFloat?Instruction::FRem : Instruction::URem); break; }
350 case 7: {Op = Instruction::Shl; break; }
351 case 8: {Op = Instruction::LShr; break; }
352 case 9: {Op = Instruction::AShr; break; }
353 case 10:{Op = Instruction::And; break; }
354 case 11:{Op = Instruction::Or; break; }
355 case 12:{Op = Instruction::Xor; break; }
358 PT->push_back(BinaryOperator::Create(Op, Val0, Val1, "B", Term));
362 /// Generate constant values.
363 struct ConstModifier: public Modifier {
364 ConstModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {}
365 virtual ~ConstModifier();
368 Type *Ty = pickType();
370 if (Ty->isVectorTy()) {
371 switch (Ran->Rand() % 2) {
372 case 0: if (Ty->getScalarType()->isIntegerTy())
373 return PT->push_back(ConstantVector::getAllOnesValue(Ty));
374 case 1: if (Ty->getScalarType()->isIntegerTy())
375 return PT->push_back(ConstantVector::getNullValue(Ty));
379 if (Ty->isFloatingPointTy()) {
380 // Generate 128 random bits, the size of the (currently)
381 // largest floating-point types.
382 uint64_t RandomBits[2];
383 for (unsigned i = 0; i < 2; ++i)
384 RandomBits[i] = Ran->Rand64();
386 APInt RandomInt(Ty->getPrimitiveSizeInBits(), makeArrayRef(RandomBits));
387 APFloat RandomFloat(Ty->getFltSemantics(), RandomInt);
390 return PT->push_back(ConstantFP::getNullValue(Ty));
391 return PT->push_back(ConstantFP::get(Ty->getContext(), RandomFloat));
394 if (Ty->isIntegerTy()) {
395 switch (Ran->Rand() % 7) {
396 case 0: if (Ty->isIntegerTy())
397 return PT->push_back(ConstantInt::get(Ty,
398 APInt::getAllOnesValue(Ty->getPrimitiveSizeInBits())));
399 case 1: if (Ty->isIntegerTy())
400 return PT->push_back(ConstantInt::get(Ty,
401 APInt::getNullValue(Ty->getPrimitiveSizeInBits())));
402 case 2: case 3: case 4: case 5:
403 case 6: if (Ty->isIntegerTy())
404 PT->push_back(ConstantInt::get(Ty, Ran->Rand()));
411 struct AllocaModifier: public Modifier {
412 AllocaModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R){}
413 virtual ~AllocaModifier();
416 Type *Tp = pickType();
417 PT->push_back(new AllocaInst(Tp, "A", BB->getFirstNonPHI()));
421 struct ExtractElementModifier: public Modifier {
422 ExtractElementModifier(BasicBlock *BB, PieceTable *PT, Random *R):
423 Modifier(BB, PT, R) {}
424 virtual ~ExtractElementModifier();
427 Value *Val0 = getRandomVectorValue();
428 Value *V = ExtractElementInst::Create(Val0,
429 ConstantInt::get(Type::getInt32Ty(BB->getContext()),
430 Ran->Rand() % cast<VectorType>(Val0->getType())->getNumElements()),
431 "E", BB->getTerminator());
432 return PT->push_back(V);
436 struct ShuffModifier: public Modifier {
437 ShuffModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {}
438 virtual ~ShuffModifier();
442 Value *Val0 = getRandomVectorValue();
443 Value *Val1 = getRandomValue(Val0->getType());
445 unsigned Width = cast<VectorType>(Val0->getType())->getNumElements();
446 std::vector<Constant*> Idxs;
448 Type *I32 = Type::getInt32Ty(BB->getContext());
449 for (unsigned i=0; i<Width; ++i) {
450 Constant *CI = ConstantInt::get(I32, Ran->Rand() % (Width*2));
451 // Pick some undef values.
452 if (!(Ran->Rand() % 5))
453 CI = UndefValue::get(I32);
457 Constant *Mask = ConstantVector::get(Idxs);
459 Value *V = new ShuffleVectorInst(Val0, Val1, Mask, "Shuff",
460 BB->getTerminator());
465 struct InsertElementModifier: public Modifier {
466 InsertElementModifier(BasicBlock *BB, PieceTable *PT, Random *R):
467 Modifier(BB, PT, R) {}
468 virtual ~InsertElementModifier();
471 Value *Val0 = getRandomVectorValue();
472 Value *Val1 = getRandomValue(Val0->getType()->getScalarType());
474 Value *V = InsertElementInst::Create(Val0, Val1,
475 ConstantInt::get(Type::getInt32Ty(BB->getContext()),
476 Ran->Rand() % cast<VectorType>(Val0->getType())->getNumElements()),
477 "I", BB->getTerminator());
478 return PT->push_back(V);
483 struct CastModifier: public Modifier {
484 CastModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {}
485 virtual ~CastModifier();
489 Value *V = getRandomVal();
490 Type *VTy = V->getType();
491 Type *DestTy = pickScalarType();
493 // Handle vector casts vectors.
494 if (VTy->isVectorTy()) {
495 VectorType *VecTy = cast<VectorType>(VTy);
496 DestTy = pickVectorType(VecTy->getNumElements());
500 if (VTy == DestTy) return;
503 if (VTy->isPointerTy()) {
504 if (!DestTy->isPointerTy())
505 DestTy = PointerType::get(DestTy, 0);
506 return PT->push_back(
507 new BitCastInst(V, DestTy, "PC", BB->getTerminator()));
510 unsigned VSize = VTy->getScalarType()->getPrimitiveSizeInBits();
511 unsigned DestSize = DestTy->getScalarType()->getPrimitiveSizeInBits();
513 // Generate lots of bitcasts.
514 if ((Ran->Rand() & 1) && VSize == DestSize) {
515 return PT->push_back(
516 new BitCastInst(V, DestTy, "BC", BB->getTerminator()));
519 // Both types are integers:
520 if (VTy->getScalarType()->isIntegerTy() &&
521 DestTy->getScalarType()->isIntegerTy()) {
522 if (VSize > DestSize) {
523 return PT->push_back(
524 new TruncInst(V, DestTy, "Tr", BB->getTerminator()));
526 assert(VSize < DestSize && "Different int types with the same size?");
528 return PT->push_back(
529 new ZExtInst(V, DestTy, "ZE", BB->getTerminator()));
530 return PT->push_back(new SExtInst(V, DestTy, "Se", BB->getTerminator()));
535 if (VTy->getScalarType()->isFloatingPointTy() &&
536 DestTy->getScalarType()->isIntegerTy()) {
538 return PT->push_back(
539 new FPToSIInst(V, DestTy, "FC", BB->getTerminator()));
540 return PT->push_back(new FPToUIInst(V, DestTy, "FC", BB->getTerminator()));
544 if (VTy->getScalarType()->isIntegerTy() &&
545 DestTy->getScalarType()->isFloatingPointTy()) {
547 return PT->push_back(
548 new SIToFPInst(V, DestTy, "FC", BB->getTerminator()));
549 return PT->push_back(new UIToFPInst(V, DestTy, "FC", BB->getTerminator()));
554 if (VTy->getScalarType()->isFloatingPointTy() &&
555 DestTy->getScalarType()->isFloatingPointTy()) {
556 if (VSize > DestSize) {
557 return PT->push_back(
558 new FPTruncInst(V, DestTy, "Tr", BB->getTerminator()));
559 } else if (VSize < DestSize) {
560 return PT->push_back(
561 new FPExtInst(V, DestTy, "ZE", BB->getTerminator()));
563 // If VSize == DestSize, then the two types must be fp128 and ppc_fp128,
564 // for which there is no defined conversion. So do nothing.
570 struct SelectModifier: public Modifier {
571 SelectModifier(BasicBlock *BB, PieceTable *PT, Random *R):
572 Modifier(BB, PT, R) {}
573 virtual ~SelectModifier();
576 // Try a bunch of different select configuration until a valid one is found.
577 Value *Val0 = getRandomVal();
578 Value *Val1 = getRandomValue(Val0->getType());
580 Type *CondTy = Type::getInt1Ty(Context);
582 // If the value type is a vector, and we allow vector select, then in 50%
583 // of the cases generate a vector select.
584 if (Val0->getType()->isVectorTy() && (Ran->Rand() % 1)) {
585 unsigned NumElem = cast<VectorType>(Val0->getType())->getNumElements();
586 CondTy = VectorType::get(CondTy, NumElem);
589 Value *Cond = getRandomValue(CondTy);
590 Value *V = SelectInst::Create(Cond, Val0, Val1, "Sl", BB->getTerminator());
591 return PT->push_back(V);
596 struct CmpModifier: public Modifier {
597 CmpModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {}
598 virtual ~CmpModifier();
602 Value *Val0 = getRandomVal();
603 Value *Val1 = getRandomValue(Val0->getType());
605 if (Val0->getType()->isPointerTy()) return;
606 bool fp = Val0->getType()->getScalarType()->isFloatingPointTy();
611 (CmpInst::LAST_FCMP_PREDICATE - CmpInst::FIRST_FCMP_PREDICATE) +
612 CmpInst::FIRST_FCMP_PREDICATE;
615 (CmpInst::LAST_ICMP_PREDICATE - CmpInst::FIRST_ICMP_PREDICATE) +
616 CmpInst::FIRST_ICMP_PREDICATE;
619 Value *V = CmpInst::Create(fp ? Instruction::FCmp : Instruction::ICmp,
620 op, Val0, Val1, "Cmp", BB->getTerminator());
621 return PT->push_back(V);
625 // Use out-of-line definitions to prevent weak vtables.
626 Modifier::~Modifier() {}
627 LoadModifier::~LoadModifier() {}
628 StoreModifier::~StoreModifier() {}
629 BinModifier::~BinModifier() {}
630 ConstModifier::~ConstModifier() {}
631 AllocaModifier::~AllocaModifier() {}
632 ExtractElementModifier::~ExtractElementModifier() {}
633 ShuffModifier::~ShuffModifier() {}
634 InsertElementModifier::~InsertElementModifier() {}
635 CastModifier::~CastModifier() {}
636 SelectModifier::~SelectModifier() {}
637 CmpModifier::~CmpModifier() {}
639 void FillFunction(Function *F, Random &R) {
640 // Create a legal entry block.
641 BasicBlock *BB = BasicBlock::Create(F->getContext(), "BB", F);
642 ReturnInst::Create(F->getContext(), BB);
644 // Create the value table.
645 Modifier::PieceTable PT;
647 // Consider arguments as legal values.
648 for (Function::arg_iterator it = F->arg_begin(), e = F->arg_end();
652 // List of modifiers which add new random instructions.
653 std::vector<Modifier*> Modifiers;
654 OwningPtr<Modifier> LM(new LoadModifier(BB, &PT, &R));
655 OwningPtr<Modifier> SM(new StoreModifier(BB, &PT, &R));
656 OwningPtr<Modifier> EE(new ExtractElementModifier(BB, &PT, &R));
657 OwningPtr<Modifier> SHM(new ShuffModifier(BB, &PT, &R));
658 OwningPtr<Modifier> IE(new InsertElementModifier(BB, &PT, &R));
659 OwningPtr<Modifier> BM(new BinModifier(BB, &PT, &R));
660 OwningPtr<Modifier> CM(new CastModifier(BB, &PT, &R));
661 OwningPtr<Modifier> SLM(new SelectModifier(BB, &PT, &R));
662 OwningPtr<Modifier> PM(new CmpModifier(BB, &PT, &R));
663 Modifiers.push_back(LM.get());
664 Modifiers.push_back(SM.get());
665 Modifiers.push_back(EE.get());
666 Modifiers.push_back(SHM.get());
667 Modifiers.push_back(IE.get());
668 Modifiers.push_back(BM.get());
669 Modifiers.push_back(CM.get());
670 Modifiers.push_back(SLM.get());
671 Modifiers.push_back(PM.get());
673 // Generate the random instructions
674 AllocaModifier AM(BB, &PT, &R); AM.ActN(5); // Throw in a few allocas
675 ConstModifier COM(BB, &PT, &R); COM.ActN(40); // Throw in a few constants
677 for (unsigned i=0; i< SizeCL / Modifiers.size(); ++i)
678 for (std::vector<Modifier*>::iterator it = Modifiers.begin(),
679 e = Modifiers.end(); it != e; ++it) {
683 SM->ActN(5); // Throw in a few stores.
686 void IntroduceControlFlow(Function *F, Random &R) {
687 std::vector<Instruction*> BoolInst;
688 for (BasicBlock::iterator it = F->begin()->begin(),
689 e = F->begin()->end(); it != e; ++it) {
690 if (it->getType() == IntegerType::getInt1Ty(F->getContext()))
691 BoolInst.push_back(it);
694 std::random_shuffle(BoolInst.begin(), BoolInst.end(), R);
696 for (std::vector<Instruction*>::iterator it = BoolInst.begin(),
697 e = BoolInst.end(); it != e; ++it) {
698 Instruction *Instr = *it;
699 BasicBlock *Curr = Instr->getParent();
700 BasicBlock::iterator Loc= Instr;
701 BasicBlock *Next = Curr->splitBasicBlock(Loc, "CF");
702 Instr->moveBefore(Curr->getTerminator());
703 if (Curr != &F->getEntryBlock()) {
704 BranchInst::Create(Curr, Next, Instr, Curr->getTerminator());
705 Curr->getTerminator()->eraseFromParent();
710 int main(int argc, char **argv) {
711 // Init LLVM, call llvm_shutdown() on exit, parse args, etc.
712 llvm::PrettyStackTraceProgram X(argc, argv);
713 cl::ParseCommandLineOptions(argc, argv, "llvm codegen stress-tester\n");
716 OwningPtr<Module> M(new Module("/tmp/autogen.bc", getGlobalContext()));
717 Function *F = GenEmptyFunction(M.get());
719 // Pick an initial seed value
721 // Generate lots of random instructions inside a single basic block.
723 // Break the basic block into many loops.
724 IntroduceControlFlow(F, R);
726 // Figure out what stream we are supposed to write to...
727 OwningPtr<tool_output_file> Out;
728 // Default to standard output.
729 if (OutputFilename.empty())
730 OutputFilename = "-";
732 std::string ErrorInfo;
733 Out.reset(new tool_output_file(OutputFilename.c_str(), ErrorInfo,
735 if (!ErrorInfo.empty()) {
736 errs() << ErrorInfo << '\n';
741 Passes.add(createVerifierPass());
742 Passes.add(createPrintModulePass(&Out->os()));
743 Passes.run(*M.get());