1 //===- ExprTypeConvert.cpp - Code to change an LLVM Expr Type ---------------=//
3 // This file implements the part of level raising that checks to see if it is
4 // possible to coerce an entire expression tree into a different type. If
5 // convertable, other routines from this file will do the conversion.
7 //===----------------------------------------------------------------------===//
9 #include "TransformInternals.h"
10 #include "llvm/Method.h"
11 #include "llvm/iOther.h"
12 #include "llvm/iMemory.h"
13 #include "llvm/ConstPoolVals.h"
14 #include "llvm/Optimizations/ConstantHandling.h"
15 #include "llvm/Optimizations/DCE.h"
16 #include "llvm/Analysis/Expressions.h"
17 #include "Support/STLExtras.h"
21 #include "llvm/Assembly/Writer.h"
23 //#define DEBUG_EXPR_CONVERT 1
25 static bool OperandConvertableToType(User *U, Value *V, const Type *Ty,
26 ValueTypeCache &ConvertedTypes);
28 static void ConvertOperandToType(User *U, Value *OldVal, Value *NewVal,
31 // AllIndicesZero - Return true if all of the indices of the specified memory
32 // access instruction are zero, indicating an effectively nil offset to the
35 static bool AllIndicesZero(const MemAccessInst *MAI) {
36 for (User::op_const_iterator S = MAI->idx_begin(), E = MAI->idx_end();
38 if (!isa<ConstPoolVal>(*S) || !cast<ConstPoolVal>(*S)->isNullValue())
43 static unsigned getBaseTypeSize(const Type *Ty) {
44 if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty))
46 return getBaseTypeSize(ATy->getElementType());
47 return TD.getTypeSize(Ty);
51 // Peephole Malloc instructions: we take a look at the use chain of the
52 // malloc instruction, and try to find out if the following conditions hold:
53 // 1. The malloc is of the form: 'malloc [sbyte], uint <constant>'
54 // 2. The only users of the malloc are cast & add instructions
55 // 3. Of the cast instructions, there is only one destination pointer type
56 // [RTy] where the size of the pointed to object is equal to the number
57 // of bytes allocated.
59 // If these conditions hold, we convert the malloc to allocate an [RTy]
60 // element. TODO: This comment is out of date WRT arrays
62 static bool MallocConvertableToType(MallocInst *MI, const Type *Ty,
63 ValueTypeCache &CTMap) {
64 if (!MI->isArrayAllocation() || // No array allocation?
65 !isa<PointerType>(Ty)) return false; // Malloc always returns pointers
67 // Deal with the type to allocate, not the pointer type...
68 Ty = cast<PointerType>(Ty)->getValueType();
70 // Analyze the number of bytes allocated...
71 analysis::ExprType Expr = analysis::ClassifyExpression(MI->getArraySize());
73 // Must have a scale or offset to analyze it...
74 if (!Expr.Offset && !Expr.Scale) return false;
76 if (Expr.Offset && (Expr.Scale || Expr.Var)) {
77 // This is wierd, shouldn't happen, but if it does, I wanna know about it!
78 cerr << "LevelRaise.cpp: Crazy allocation detected!\n";
82 // Get the number of bytes allocated...
83 int SizeVal = getConstantValue(Expr.Offset ? Expr.Offset : Expr.Scale);
85 cerr << "malloc of a negative number???\n";
88 unsigned Size = (unsigned)SizeVal;
89 unsigned ReqTypeSize = getBaseTypeSize(Ty);
91 // Does the size of the allocated type match the number of bytes
94 if (ReqTypeSize == Size)
97 // If not, it's possible that an array of constant size is being allocated.
98 // In this case, the Size will be a multiple of the data size.
100 if (!Expr.Offset) return false; // Offset must be set, not scale...
104 #else // THIS CAN ONLY BE RUN VERY LATE, after several passes to make sure
105 // things are adequately raised!
106 // See if the allocated amount is a multiple of the type size...
107 if (Size/ReqTypeSize*ReqTypeSize != Size)
108 return false; // Nope.
110 // Unfortunately things tend to be powers of two, so there may be
111 // many false hits. We don't want to optimistically assume that we
112 // have the right type on the first try, so scan the use list of the
113 // malloc instruction, looking for the cast to the biggest type...
115 for (Value::use_iterator I = MI->use_begin(), E = MI->use_end(); I != E; ++I)
116 if (CastInst *CI = dyn_cast<CastInst>(*I))
117 if (const PointerType *PT =
118 dyn_cast<PointerType>(CI->getOperand(0)->getType()))
119 if (getBaseTypeSize(PT->getValueType()) > ReqTypeSize)
120 return false; // We found a type bigger than this one!
126 static Instruction *ConvertMallocToType(MallocInst *MI, const Type *Ty,
127 const string &Name, ValueMapCache &VMC){
128 BasicBlock *BB = MI->getParent();
129 BasicBlock::iterator It = BB->end();
131 // Analyze the number of bytes allocated...
132 analysis::ExprType Expr = analysis::ClassifyExpression(MI->getArraySize());
134 const PointerType *AllocTy = cast<PointerType>(Ty);
135 const Type *ElType = AllocTy->getValueType();
137 if (Expr.Var && !isa<ArrayType>(ElType)) {
138 ElType = ArrayType::get(AllocTy->getValueType());
139 AllocTy = PointerType::get(ElType);
142 // If the array size specifier is not an unsigned integer, insert a cast now.
143 if (Expr.Var && Expr.Var->getType() != Type::UIntTy) {
144 It = find(BB->getInstList().begin(), BB->getInstList().end(), MI);
145 CastInst *SizeCast = new CastInst(Expr.Var, Type::UIntTy);
146 It = BB->getInstList().insert(It, SizeCast)+1;
150 // Check to see if they are allocating a constant sized array of a type...
151 #if 0 // THIS CAN ONLY BE RUN VERY LATE
153 unsigned OffsetAmount = (unsigned)getConstantValue(Expr.Offset);
154 unsigned DataSize = TD.getTypeSize(ElType);
156 if (OffsetAmount > DataSize) // Allocate a sized array amount...
157 Expr.Var = ConstPoolUInt::get(Type::UIntTy, OffsetAmount/DataSize);
161 Instruction *NewI = new MallocInst(AllocTy, Expr.Var, Name);
163 if (AllocTy != Ty) { // Create a cast instruction to cast it to the correct ty
165 It = find(BB->getInstList().begin(), BB->getInstList().end(), MI);
167 // Insert the new malloc directly into the code ourselves
168 assert(It != BB->getInstList().end());
169 It = BB->getInstList().insert(It, NewI)+1;
171 // Return the cast as the value to use...
172 NewI = new CastInst(NewI, Ty);
179 // ExpressionConvertableToType - Return true if it is possible
180 bool ExpressionConvertableToType(Value *V, const Type *Ty,
181 ValueTypeCache &CTMap) {
182 if (V->getType() == Ty) return true; // Expression already correct type!
184 // Expression type must be holdable in a register.
185 if (!isFirstClassType(Ty))
188 ValueTypeCache::iterator CTMI = CTMap.find(V);
189 if (CTMI != CTMap.end()) return CTMI->second == Ty;
193 Instruction *I = dyn_cast<Instruction>(V);
195 // It's not an instruction, check to see if it's a constant... all constants
196 // can be converted to an equivalent value (except pointers, they can't be
197 // const prop'd in general). We just ask the constant propogator to see if
198 // it can convert the value...
200 if (ConstPoolVal *CPV = dyn_cast<ConstPoolVal>(V))
201 if (opt::ConstantFoldCastInstruction(CPV, Ty))
202 return true; // Don't worry about deallocating, it's a constant.
204 return false; // Otherwise, we can't convert!
207 switch (I->getOpcode()) {
208 case Instruction::Cast:
209 // We can convert the expr if the cast destination type is losslessly
210 // convertable to the requested type.
211 if (!Ty->isLosslesslyConvertableTo(I->getType())) return false;
213 // We also do not allow conversion of a cast that casts from a ptr to array
214 // of X to a *X. For example: cast [4 x %List *] * %val to %List * *
216 if (PointerType *SPT = dyn_cast<PointerType>(I->getOperand(0)->getType()))
217 if (PointerType *DPT = dyn_cast<PointerType>(I->getType()))
218 if (ArrayType *AT = dyn_cast<ArrayType>(SPT->getValueType()))
219 if (AT->getElementType() == DPT->getValueType())
224 case Instruction::Add:
225 case Instruction::Sub:
226 if (!ExpressionConvertableToType(I->getOperand(0), Ty, CTMap) ||
227 !ExpressionConvertableToType(I->getOperand(1), Ty, CTMap))
230 case Instruction::Shr:
231 if (Ty->isSigned() != V->getType()->isSigned()) return false;
233 case Instruction::Shl:
234 if (!ExpressionConvertableToType(I->getOperand(0), Ty, CTMap))
238 case Instruction::Load: {
239 LoadInst *LI = cast<LoadInst>(I);
240 if (LI->hasIndices() && !AllIndicesZero(LI)) {
241 // We can't convert a load expression if it has indices... unless they are
246 if (!ExpressionConvertableToType(LI->getPointerOperand(),
247 PointerType::get(Ty), CTMap))
251 case Instruction::PHINode: {
252 PHINode *PN = cast<PHINode>(I);
253 for (unsigned i = 0; i < PN->getNumIncomingValues(); ++i)
254 if (!ExpressionConvertableToType(PN->getIncomingValue(i), Ty, CTMap))
259 case Instruction::Malloc:
260 if (!MallocConvertableToType(cast<MallocInst>(I), Ty, CTMap))
265 case Instruction::GetElementPtr: {
266 // GetElementPtr's are directly convertable to a pointer type if they have
267 // a number of zeros at the end. Because removing these values does not
268 // change the logical offset of the GEP, it is okay and fair to remove them.
269 // This can change this:
270 // %t1 = getelementptr %Hosp * %hosp, ubyte 4, ubyte 0 ; <%List **>
271 // %t2 = cast %List * * %t1 to %List *
273 // %t2 = getelementptr %Hosp * %hosp, ubyte 4 ; <%List *>
275 GetElementPtrInst *GEP = cast<GetElementPtrInst>(I);
276 const PointerType *PTy = dyn_cast<PointerType>(Ty);
277 if (!PTy) return false;
279 // Check to see if there are zero elements that we can remove from the
280 // index array. If there are, check to see if removing them causes us to
281 // get to the right type...
283 vector<Value*> Indices = GEP->copyIndices();
284 const Type *BaseType = GEP->getPointerOperand()->getType();
285 const Type *ElTy = 0;
287 while (!Indices.empty() && isa<ConstPoolUInt>(Indices.back()) &&
288 cast<ConstPoolUInt>(Indices.back())->getValue() == 0) {
290 ElTy = GetElementPtrInst::getIndexedType(BaseType, Indices,
292 if (ElTy == PTy->getValueType())
293 break; // Found a match!!
298 return false; // No match, maybe next time.
306 // Expressions are only convertable if all of the users of the expression can
307 // have this value converted. This makes use of the map to avoid infinite
310 for (Value::use_iterator It = I->use_begin(), E = I->use_end(); It != E; ++It)
311 if (!OperandConvertableToType(*It, I, Ty, CTMap))
318 Value *ConvertExpressionToType(Value *V, const Type *Ty, ValueMapCache &VMC) {
319 ValueMapCache::ExprMapTy::iterator VMCI = VMC.ExprMap.find(V);
320 if (VMCI != VMC.ExprMap.end()) {
321 assert(VMCI->second->getType() == Ty);
325 #ifdef DEBUG_EXPR_CONVERT
326 cerr << "CETT: " << (void*)V << " " << V;
329 Instruction *I = dyn_cast<Instruction>(V);
331 if (ConstPoolVal *CPV = cast<ConstPoolVal>(V)) {
332 // Constants are converted by constant folding the cast that is required.
333 // We assume here that all casts are implemented for constant prop.
334 Value *Result = opt::ConstantFoldCastInstruction(CPV, Ty);
335 assert(Result && "ConstantFoldCastInstruction Failed!!!");
336 assert(Result->getType() == Ty && "Const prop of cast failed!");
338 // Add the instruction to the expression map
339 VMC.ExprMap[V] = Result;
344 BasicBlock *BB = I->getParent();
345 BasicBlock::InstListType &BIL = BB->getInstList();
346 string Name = I->getName(); if (!Name.empty()) I->setName("");
347 Instruction *Res; // Result of conversion
349 ValueHandle IHandle(VMC, I); // Prevent I from being removed!
351 ConstPoolVal *Dummy = ConstPoolVal::getNullConstant(Ty);
353 //cerr << endl << endl << "Type:\t" << Ty << "\nInst: " << I << "BB Before: " << BB << endl;
355 switch (I->getOpcode()) {
356 case Instruction::Cast:
357 Res = new CastInst(I->getOperand(0), Ty, Name);
360 case Instruction::Add:
361 case Instruction::Sub:
362 Res = BinaryOperator::create(cast<BinaryOperator>(I)->getOpcode(),
364 VMC.ExprMap[I] = Res; // Add node to expression eagerly
366 Res->setOperand(0, ConvertExpressionToType(I->getOperand(0), Ty, VMC));
367 Res->setOperand(1, ConvertExpressionToType(I->getOperand(1), Ty, VMC));
370 case Instruction::Shl:
371 case Instruction::Shr:
372 Res = new ShiftInst(cast<ShiftInst>(I)->getOpcode(), Dummy,
373 I->getOperand(1), Name);
374 VMC.ExprMap[I] = Res;
375 Res->setOperand(0, ConvertExpressionToType(I->getOperand(0), Ty, VMC));
378 case Instruction::Load: {
379 LoadInst *LI = cast<LoadInst>(I);
380 assert(!LI->hasIndices() || AllIndicesZero(LI));
382 Res = new LoadInst(ConstPoolVal::getNullConstant(PointerType::get(Ty)),
384 VMC.ExprMap[I] = Res;
385 Res->setOperand(0, ConvertExpressionToType(LI->getPointerOperand(),
386 PointerType::get(Ty), VMC));
387 assert(Res->getOperand(0)->getType() == PointerType::get(Ty));
388 assert(Ty == Res->getType());
389 assert(isFirstClassType(Res->getType()) && "Load of structure or array!");
393 case Instruction::PHINode: {
394 PHINode *OldPN = cast<PHINode>(I);
395 PHINode *NewPN = new PHINode(Ty, Name);
397 VMC.ExprMap[I] = NewPN; // Add node to expression eagerly
398 while (OldPN->getNumOperands()) {
399 BasicBlock *BB = OldPN->getIncomingBlock(0);
400 Value *OldVal = OldPN->getIncomingValue(0);
401 ValueHandle OldValHandle(VMC, OldVal);
402 OldPN->removeIncomingValue(BB);
403 Value *V = ConvertExpressionToType(OldVal, Ty, VMC);
404 NewPN->addIncoming(V, BB);
410 case Instruction::Malloc: {
411 Res = ConvertMallocToType(cast<MallocInst>(I), Ty, Name, VMC);
415 case Instruction::GetElementPtr: {
416 // GetElementPtr's are directly convertable to a pointer type if they have
417 // a number of zeros at the end. Because removing these values does not
418 // change the logical offset of the GEP, it is okay and fair to remove them.
419 // This can change this:
420 // %t1 = getelementptr %Hosp * %hosp, ubyte 4, ubyte 0 ; <%List **>
421 // %t2 = cast %List * * %t1 to %List *
423 // %t2 = getelementptr %Hosp * %hosp, ubyte 4 ; <%List *>
425 GetElementPtrInst *GEP = cast<GetElementPtrInst>(I);
427 // Check to see if there are zero elements that we can remove from the
428 // index array. If there are, check to see if removing them causes us to
429 // get to the right type...
431 vector<Value*> Indices = GEP->copyIndices();
432 const Type *BaseType = GEP->getPointerOperand()->getType();
433 const Type *PVTy = cast<PointerType>(Ty)->getValueType();
435 while (!Indices.empty() && isa<ConstPoolUInt>(Indices.back()) &&
436 cast<ConstPoolUInt>(Indices.back())->getValue() == 0) {
438 if (GetElementPtrInst::getIndexedType(BaseType, Indices, true) == PVTy) {
439 if (Indices.size() == 0) {
440 Res = new CastInst(GEP->getPointerOperand(), BaseType); // NOOP
442 Res = new GetElementPtrInst(GEP->getPointerOperand(), Indices, Name);
447 assert(Res && "Didn't find match!");
448 break; // No match, maybe next time.
452 assert(0 && "Expression convertable, but don't know how to convert?");
456 assert(Res->getType() == Ty && "Didn't convert expr to correct type!");
458 BasicBlock::iterator It = find(BIL.begin(), BIL.end(), I);
459 assert(It != BIL.end() && "Instruction not in own basic block??");
462 // Add the instruction to the expression map
463 VMC.ExprMap[I] = Res;
465 // Expressions are only convertable if all of the users of the expression can
466 // have this value converted. This makes use of the map to avoid infinite
469 unsigned NumUses = I->use_size();
470 for (unsigned It = 0; It < NumUses; ) {
471 unsigned OldSize = NumUses;
472 ConvertOperandToType(*(I->use_begin()+It), I, Res, VMC);
473 NumUses = I->use_size();
474 if (NumUses == OldSize) ++It;
477 #ifdef DEBUG_EXPR_CONVERT
478 cerr << "ExpIn: " << (void*)I << " " << I
479 << "ExpOut: " << (void*)Res << " " << Res;
480 cerr << "ExpCREATED: " << (void*)Res << " " << Res;
483 if (I->use_empty()) {
484 #ifdef DEBUG_EXPR_CONVERT
485 cerr << "EXPR DELETING: " << (void*)I << " " << I;
488 VMC.OperandsMapped.erase(I);
489 VMC.ExprMap.erase(I);
498 // ValueConvertableToType - Return true if it is possible
499 bool ValueConvertableToType(Value *V, const Type *Ty,
500 ValueTypeCache &ConvertedTypes) {
501 ValueTypeCache::iterator I = ConvertedTypes.find(V);
502 if (I != ConvertedTypes.end()) return I->second == Ty;
503 ConvertedTypes[V] = Ty;
505 // It is safe to convert the specified value to the specified type IFF all of
506 // the uses of the value can be converted to accept the new typed value.
508 for (Value::use_iterator I = V->use_begin(), E = V->use_end(); I != E; ++I)
509 if (!OperandConvertableToType(*I, V, Ty, ConvertedTypes))
519 // OperandConvertableToType - Return true if it is possible to convert operand
520 // V of User (instruction) U to the specified type. This is true iff it is
521 // possible to change the specified instruction to accept this. CTMap is a map
522 // of converted types, so that circular definitions will see the future type of
523 // the expression, not the static current type.
525 static bool OperandConvertableToType(User *U, Value *V, const Type *Ty,
526 ValueTypeCache &CTMap) {
527 if (V->getType() == Ty) return true; // Operand already the right type?
529 // Expression type must be holdable in a register.
530 if (!isFirstClassType(Ty))
533 Instruction *I = dyn_cast<Instruction>(U);
534 if (I == 0) return false; // We can't convert!
536 switch (I->getOpcode()) {
537 case Instruction::Cast:
538 assert(I->getOperand(0) == V);
539 // We can convert the expr if the cast destination type is losslessly
540 // convertable to the requested type.
541 if (!Ty->isLosslesslyConvertableTo(I->getOperand(0)->getType()))
544 // We also do not allow conversion of a cast that casts from a ptr to array
545 // of X to a *X. For example: cast [4 x %List *] * %val to %List * *
547 if (PointerType *SPT = dyn_cast<PointerType>(I->getOperand(0)->getType()))
548 if (PointerType *DPT = dyn_cast<PointerType>(I->getType()))
549 if (ArrayType *AT = dyn_cast<ArrayType>(SPT->getValueType()))
550 if (AT->getElementType() == DPT->getValueType())
555 case Instruction::Add:
556 if (V == I->getOperand(0) && isa<CastInst>(I->getOperand(1)) &&
557 isa<PointerType>(Ty)) {
558 Value *IndexVal = cast<CastInst>(I->getOperand(1))->getOperand(0);
559 vector<Value*> Indices;
560 if (const Type *ETy = ConvertableToGEP(Ty, IndexVal, Indices)) {
561 const Type *RetTy = PointerType::get(ETy);
563 // Only successful if we can convert this type to the required type
564 if (ValueConvertableToType(I, RetTy, CTMap)) {
571 case Instruction::Sub: {
572 Value *OtherOp = I->getOperand((V == I->getOperand(0)) ? 1 : 0);
573 return ValueConvertableToType(I, Ty, CTMap) &&
574 ExpressionConvertableToType(OtherOp, Ty, CTMap);
576 case Instruction::SetEQ:
577 case Instruction::SetNE: {
578 Value *OtherOp = I->getOperand((V == I->getOperand(0)) ? 1 : 0);
579 return ExpressionConvertableToType(OtherOp, Ty, CTMap);
581 case Instruction::Shr:
582 if (Ty->isSigned() != V->getType()->isSigned()) return false;
584 case Instruction::Shl:
585 assert(I->getOperand(0) == V);
586 return ValueConvertableToType(I, Ty, CTMap);
588 case Instruction::Load:
589 // Cannot convert the types of any subscripts...
590 if (I->getOperand(0) != V) return false;
592 if (const PointerType *PT = dyn_cast<PointerType>(Ty)) {
593 LoadInst *LI = cast<LoadInst>(I);
595 if (LI->hasIndices() && !AllIndicesZero(LI))
598 const Type *LoadedTy = PT->getValueType();
600 // They could be loading the first element of a composite type...
601 if (const CompositeType *CT = dyn_cast<CompositeType>(LoadedTy)) {
602 unsigned Offset = 0; // No offset, get first leaf.
603 vector<Value*> Indices; // Discarded...
604 LoadedTy = getStructOffsetType(CT, Offset, Indices, false);
605 assert(Offset == 0 && "Offset changed from zero???");
608 if (!isFirstClassType(LoadedTy))
611 if (TD.getTypeSize(LoadedTy) != TD.getTypeSize(LI->getType()))
614 return ValueConvertableToType(LI, LoadedTy, CTMap);
618 case Instruction::Store: {
619 StoreInst *SI = cast<StoreInst>(I);
620 if (SI->hasIndices()) return false;
622 if (V == I->getOperand(0)) {
623 // Can convert the store if we can convert the pointer operand to match
624 // the new value type...
625 return ExpressionConvertableToType(I->getOperand(1), PointerType::get(Ty),
627 } else if (const PointerType *PT = dyn_cast<PointerType>(Ty)) {
628 if (isa<ArrayType>(PT->getValueType()))
629 return false; // Avoid getDataSize on unsized array type!
630 assert(V == I->getOperand(1));
632 // Must move the same amount of data...
633 if (TD.getTypeSize(PT->getValueType()) !=
634 TD.getTypeSize(I->getOperand(0)->getType())) return false;
636 // Can convert store if the incoming value is convertable...
637 return ExpressionConvertableToType(I->getOperand(0), PT->getValueType(),
643 case Instruction::GetElementPtr:
644 // Convert a getelementptr [sbyte] * %reg111, uint 16 freely back to
645 // anything that is a pointer type...
647 if (I->getType() != PointerType::get(Type::SByteTy) ||
648 I->getNumOperands() != 2 || V != I->getOperand(0) ||
649 I->getOperand(1)->getType() != Type::UIntTy || !isa<PointerType>(Ty))
653 case Instruction::PHINode: {
654 PHINode *PN = cast<PHINode>(I);
655 for (unsigned i = 0; i < PN->getNumIncomingValues(); ++i)
656 if (!ExpressionConvertableToType(PN->getIncomingValue(i), Ty, CTMap))
658 return ValueConvertableToType(PN, Ty, CTMap);
661 case Instruction::Call: {
662 User::op_iterator OI = find(I->op_begin(), I->op_end(), V);
663 assert (OI != I->op_end() && "Not using value!");
664 unsigned OpNum = OI - I->op_begin();
667 return false; // Can't convert method pointer type yet. FIXME
669 const PointerType *MPtr = cast<PointerType>(I->getOperand(0)->getType());
670 const MethodType *MTy = cast<MethodType>(MPtr->getValueType());
671 if (!MTy->isVarArg()) return false;
673 if ((OpNum-1) < MTy->getParamTypes().size())
674 return false; // It's not in the varargs section...
676 // If we get this far, we know the value is in the varargs section of the
677 // method! We can convert if we don't reinterpret the value...
679 return Ty->isLosslesslyConvertableTo(V->getType());
686 void ConvertValueToNewType(Value *V, Value *NewVal, ValueMapCache &VMC) {
687 ValueHandle VH(VMC, V);
689 unsigned NumUses = V->use_size();
690 for (unsigned It = 0; It < NumUses; ) {
691 unsigned OldSize = NumUses;
692 ConvertOperandToType(*(V->use_begin()+It), V, NewVal, VMC);
693 NumUses = V->use_size();
694 if (NumUses == OldSize) ++It;
700 static void ConvertOperandToType(User *U, Value *OldVal, Value *NewVal,
701 ValueMapCache &VMC) {
702 if (isa<ValueHandle>(U)) return; // Valuehandles don't let go of operands...
704 if (VMC.OperandsMapped.count(U)) return;
705 VMC.OperandsMapped.insert(U);
707 ValueMapCache::ExprMapTy::iterator VMCI = VMC.ExprMap.find(U);
708 if (VMCI != VMC.ExprMap.end())
712 Instruction *I = cast<Instruction>(U); // Only Instructions convertable
714 BasicBlock *BB = I->getParent();
715 BasicBlock::InstListType &BIL = BB->getInstList();
716 string Name = I->getName(); if (!Name.empty()) I->setName("");
717 Instruction *Res; // Result of conversion
719 //cerr << endl << endl << "Type:\t" << Ty << "\nInst: " << I << "BB Before: " << BB << endl;
721 // Prevent I from being removed...
722 ValueHandle IHandle(VMC, I);
724 const Type *NewTy = NewVal->getType();
725 ConstPoolVal *Dummy = (NewTy != Type::VoidTy) ?
726 ConstPoolVal::getNullConstant(NewTy) : 0;
728 switch (I->getOpcode()) {
729 case Instruction::Cast:
730 assert(I->getOperand(0) == OldVal);
731 Res = new CastInst(NewVal, I->getType(), Name);
734 case Instruction::Add:
735 if (OldVal == I->getOperand(0) && isa<CastInst>(I->getOperand(1)) &&
736 isa<PointerType>(NewTy)) {
737 Value *IndexVal = cast<CastInst>(I->getOperand(1))->getOperand(0);
738 vector<Value*> Indices;
739 BasicBlock::iterator It = find(BIL.begin(), BIL.end(), I);
741 if (const Type *ETy = ConvertableToGEP(NewTy, IndexVal, Indices, &It)) {
742 // If successful, convert the add to a GEP
743 const Type *RetTy = PointerType::get(ETy);
744 // First operand is actually the given pointer...
745 Res = new GetElementPtrInst(NewVal, Indices);
746 assert(cast<PointerType>(Res->getType())->getValueType() == ETy &&
747 "ConvertableToGEP broken!");
753 case Instruction::Sub:
754 case Instruction::SetEQ:
755 case Instruction::SetNE: {
756 Res = BinaryOperator::create(cast<BinaryOperator>(I)->getOpcode(),
758 VMC.ExprMap[I] = Res; // Add node to expression eagerly
760 unsigned OtherIdx = (OldVal == I->getOperand(0)) ? 1 : 0;
761 Value *OtherOp = I->getOperand(OtherIdx);
762 Value *NewOther = ConvertExpressionToType(OtherOp, NewTy, VMC);
764 Res->setOperand(OtherIdx, NewOther);
765 Res->setOperand(!OtherIdx, NewVal);
768 case Instruction::Shl:
769 case Instruction::Shr:
770 assert(I->getOperand(0) == OldVal);
771 Res = new ShiftInst(cast<ShiftInst>(I)->getOpcode(), NewVal,
772 I->getOperand(1), Name);
775 case Instruction::Load: {
776 assert(I->getOperand(0) == OldVal && isa<PointerType>(NewVal->getType()));
777 const Type *LoadedTy = cast<PointerType>(NewVal->getType())->getValueType();
779 vector<Value*> Indices;
781 if (const CompositeType *CT = dyn_cast<CompositeType>(LoadedTy)) {
782 unsigned Offset = 0; // No offset, get first leaf.
783 LoadedTy = getStructOffsetType(CT, Offset, Indices, false);
785 assert(isFirstClassType(LoadedTy));
787 Res = new LoadInst(NewVal, Indices, Name);
788 assert(isFirstClassType(Res->getType()) && "Load of structure or array!");
792 case Instruction::Store: {
793 if (I->getOperand(0) == OldVal) { // Replace the source value
794 const PointerType *NewPT = PointerType::get(NewTy);
795 Res = new StoreInst(NewVal, ConstPoolVal::getNullConstant(NewPT));
796 VMC.ExprMap[I] = Res;
797 Res->setOperand(1, ConvertExpressionToType(I->getOperand(1), NewPT, VMC));
798 } else { // Replace the source pointer
799 const Type *ValTy = cast<PointerType>(NewTy)->getValueType();
800 Res = new StoreInst(ConstPoolVal::getNullConstant(ValTy), NewVal);
801 VMC.ExprMap[I] = Res;
802 Res->setOperand(0, ConvertExpressionToType(I->getOperand(0), ValTy, VMC));
808 case Instruction::GetElementPtr: {
809 // Convert a getelementptr [sbyte] * %reg111, uint 16 freely back to
810 // anything that is a pointer type...
812 BasicBlock::iterator It = find(BIL.begin(), BIL.end(), I);
814 // Insert a cast right before this instruction of the index value...
815 CastInst *CIdx = new CastInst(I->getOperand(1), NewTy);
816 It = BIL.insert(It, CIdx)+1;
818 // Insert an add right before this instruction
819 Instruction *AddInst = BinaryOperator::create(Instruction::Add, NewVal,
821 It = BIL.insert(It, AddInst)+1;
823 // Finally, cast the result back to our previous type...
824 Res = new CastInst(AddInst, I->getType());
828 case Instruction::PHINode: {
829 PHINode *OldPN = cast<PHINode>(I);
830 PHINode *NewPN = new PHINode(NewTy, Name);
831 VMC.ExprMap[I] = NewPN;
833 while (OldPN->getNumOperands()) {
834 BasicBlock *BB = OldPN->getIncomingBlock(0);
835 Value *OldVal = OldPN->getIncomingValue(0);
836 OldPN->removeIncomingValue(BB);
837 Value *V = ConvertExpressionToType(OldVal, NewTy, VMC);
838 NewPN->addIncoming(V, BB);
844 case Instruction::Call: {
845 Value *Meth = I->getOperand(0);
846 vector<Value*> Params(I->op_begin()+1, I->op_end());
848 vector<Value*>::iterator OI = find(Params.begin(), Params.end(), OldVal);
849 assert (OI != Params.end() && "Not using value!");
852 Res = new CallInst(Meth, Params, Name);
856 assert(0 && "Expression convertable, but don't know how to convert?");
860 BasicBlock::iterator It = find(BIL.begin(), BIL.end(), I);
861 assert(It != BIL.end() && "Instruction not in own basic block??");
862 BIL.insert(It, Res); // Keep It pointing to old instruction
864 #ifdef DEBUG_EXPR_CONVERT
865 cerr << "COT CREATED: " << (void*)Res << " " << Res;
866 cerr << "In: " << (void*)I << " " << I << "Out: " << (void*)Res << " " << Res;
869 // Add the instruction to the expression map
870 VMC.ExprMap[I] = Res;
872 if (I->getType() != Res->getType())
873 ConvertValueToNewType(I, Res, VMC);
875 for (unsigned It = 0; It < I->use_size(); ) {
876 User *Use = *(I->use_begin()+It);
877 if (isa<ValueHandle>(Use)) // Don't remove ValueHandles!
880 Use->replaceUsesOfWith(I, Res);
883 if (I->use_empty()) {
884 // Now we just need to remove the old instruction so we don't get infinite
885 // loops. Note that we cannot use DCE because DCE won't remove a store
886 // instruction, for example.
888 #ifdef DEBUG_EXPR_CONVERT
889 cerr << "DELETING: " << (void*)I << " " << I;
892 VMC.OperandsMapped.erase(I);
893 VMC.ExprMap.erase(I);
896 for (Value::use_iterator UI = I->use_begin(), UE = I->use_end();
898 assert(isa<ValueHandle>((Value*)*UI) &&"Uses of Instruction remain!!!");
904 ValueHandle::ValueHandle(ValueMapCache &VMC, Value *V)
905 : Instruction(Type::VoidTy, UserOp1, ""), Cache(VMC) {
906 #ifdef DEBUG_EXPR_CONVERT
907 cerr << "VH AQUIRING: " << (void*)V << " " << V;
909 Operands.push_back(Use(V, this));
912 static void RecursiveDelete(ValueMapCache &Cache, Instruction *I) {
913 if (!I || !I->use_empty()) return;
915 assert(I->getParent() && "Inst not in basic block!");
917 #ifdef DEBUG_EXPR_CONVERT
918 cerr << "VH DELETING: " << (void*)I << " " << I;
921 for (User::op_iterator OI = I->op_begin(), OE = I->op_end();
923 Instruction *U = dyn_cast<Instruction>(*OI);
926 RecursiveDelete(Cache, dyn_cast<Instruction>(U));
930 I->getParent()->getInstList().remove(I);
932 Cache.OperandsMapped.erase(I);
933 Cache.ExprMap.erase(I);
937 ValueHandle::~ValueHandle() {
938 if (Operands[0]->use_size() == 1) {
939 Value *V = Operands[0];
940 Operands[0] = 0; // Drop use!
942 // Now we just need to remove the old instruction so we don't get infinite
943 // loops. Note that we cannot use DCE because DCE won't remove a store
944 // instruction, for example.
946 RecursiveDelete(Cache, dyn_cast<Instruction>(V));
948 #ifdef DEBUG_EXPR_CONVERT
949 cerr << "VH RELEASING: " << (void*)Operands[0].get() << " " << Operands[0]->use_size() << " " << Operands[0];