1 //===- MergeFunctions.cpp - Merge identical functions ---------------------===//
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 pass looks for equivalent functions that are mergable and folds them.
12 // A hash is computed from the function, based on its type and number of
15 // Once all hashes are computed, we perform an expensive equality comparison
16 // on each function pair. This takes n^2/2 comparisons per bucket, so it's
17 // important that the hash function be high quality. The equality comparison
18 // iterates through each instruction in each basic block.
20 // When a match is found the functions are folded. If both functions are
21 // overridable, we move the functionality into a new internal function and
22 // leave two overridable thunks to it.
24 //===----------------------------------------------------------------------===//
28 // * virtual functions.
30 // Many functions have their address taken by the virtual function table for
31 // the object they belong to. However, as long as it's only used for a lookup
32 // and call, this is irrelevant, and we'd like to fold such functions.
34 // * switch from n^2 pair-wise comparisons to an n-way comparison for each
37 // * be smarter about bitcasts.
39 // In order to fold functions, we will sometimes add either bitcast instructions
40 // or bitcast constant expressions. Unfortunately, this can confound further
41 // analysis since the two functions differ where one has a bitcast and the
42 // other doesn't. We should learn to look through bitcasts.
44 //===----------------------------------------------------------------------===//
46 #include "llvm/Transforms/IPO.h"
47 #include "llvm/ADT/DenseSet.h"
48 #include "llvm/ADT/FoldingSet.h"
49 #include "llvm/ADT/STLExtras.h"
50 #include "llvm/ADT/SmallSet.h"
51 #include "llvm/ADT/Statistic.h"
52 #include "llvm/IR/CallSite.h"
53 #include "llvm/IR/Constants.h"
54 #include "llvm/IR/DataLayout.h"
55 #include "llvm/IR/IRBuilder.h"
56 #include "llvm/IR/InlineAsm.h"
57 #include "llvm/IR/Instructions.h"
58 #include "llvm/IR/LLVMContext.h"
59 #include "llvm/IR/Module.h"
60 #include "llvm/IR/Operator.h"
61 #include "llvm/IR/ValueHandle.h"
62 #include "llvm/Pass.h"
63 #include "llvm/Support/Debug.h"
64 #include "llvm/Support/ErrorHandling.h"
65 #include "llvm/Support/raw_ostream.h"
69 #define DEBUG_TYPE "mergefunc"
71 STATISTIC(NumFunctionsMerged, "Number of functions merged");
72 STATISTIC(NumThunksWritten, "Number of thunks generated");
73 STATISTIC(NumAliasesWritten, "Number of aliases generated");
74 STATISTIC(NumDoubleWeak, "Number of new functions created");
76 /// Returns the type id for a type to be hashed. We turn pointer types into
77 /// integers here because the actual compare logic below considers pointers and
78 /// integers of the same size as equal.
79 static Type::TypeID getTypeIDForHash(Type *Ty) {
80 if (Ty->isPointerTy())
81 return Type::IntegerTyID;
82 return Ty->getTypeID();
85 /// Creates a hash-code for the function which is the same for any two
86 /// functions that will compare equal, without looking at the instructions
87 /// inside the function.
88 static unsigned profileFunction(const Function *F) {
89 FunctionType *FTy = F->getFunctionType();
92 ID.AddInteger(F->size());
93 ID.AddInteger(F->getCallingConv());
94 ID.AddBoolean(F->hasGC());
95 ID.AddBoolean(FTy->isVarArg());
96 ID.AddInteger(getTypeIDForHash(FTy->getReturnType()));
97 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
98 ID.AddInteger(getTypeIDForHash(FTy->getParamType(i)));
99 return ID.ComputeHash();
104 /// ComparableFunction - A struct that pairs together functions with a
105 /// DataLayout so that we can keep them together as elements in the DenseSet.
106 class ComparableFunction {
108 static const ComparableFunction EmptyKey;
109 static const ComparableFunction TombstoneKey;
110 static DataLayout * const LookupOnly;
112 ComparableFunction(Function *Func, const DataLayout *DL)
113 : Func(Func), Hash(profileFunction(Func)), DL(DL) {}
115 Function *getFunc() const { return Func; }
116 unsigned getHash() const { return Hash; }
117 const DataLayout *getDataLayout() const { return DL; }
119 // Drops AssertingVH reference to the function. Outside of debug mode, this
123 "Attempted to release function twice, or release empty/tombstone!");
128 explicit ComparableFunction(unsigned Hash)
129 : Func(nullptr), Hash(Hash), DL(nullptr) {}
131 AssertingVH<Function> Func;
133 const DataLayout *DL;
136 const ComparableFunction ComparableFunction::EmptyKey = ComparableFunction(0);
137 const ComparableFunction ComparableFunction::TombstoneKey =
138 ComparableFunction(1);
139 DataLayout *const ComparableFunction::LookupOnly = (DataLayout*)(-1);
145 struct DenseMapInfo<ComparableFunction> {
146 static ComparableFunction getEmptyKey() {
147 return ComparableFunction::EmptyKey;
149 static ComparableFunction getTombstoneKey() {
150 return ComparableFunction::TombstoneKey;
152 static unsigned getHashValue(const ComparableFunction &CF) {
155 static bool isEqual(const ComparableFunction &LHS,
156 const ComparableFunction &RHS);
162 /// FunctionComparator - Compares two functions to determine whether or not
163 /// they will generate machine code with the same behaviour. DataLayout is
164 /// used if available. The comparator always fails conservatively (erring on the
165 /// side of claiming that two functions are different).
166 class FunctionComparator {
168 FunctionComparator(const DataLayout *DL, const Function *F1,
170 : F1(F1), F2(F2), DL(DL) {}
172 /// Test whether the two functions have equivalent behaviour.
176 /// Test whether two basic blocks have equivalent behaviour.
177 bool compare(const BasicBlock *BB1, const BasicBlock *BB2);
179 /// Constants comparison.
180 /// Its analog to lexicographical comparison between hypothetical numbers
182 /// <bitcastability-trait><raw-bit-contents>
184 /// 1. Bitcastability.
185 /// Check whether L's type could be losslessly bitcasted to R's type.
186 /// On this stage method, in case when lossless bitcast is not possible
187 /// method returns -1 or 1, thus also defining which type is greater in
188 /// context of bitcastability.
189 /// Stage 0: If types are equal in terms of cmpTypes, then we can go straight
190 /// to the contents comparison.
191 /// If types differ, remember types comparison result and check
192 /// whether we still can bitcast types.
193 /// Stage 1: Types that satisfies isFirstClassType conditions are always
194 /// greater then others.
195 /// Stage 2: Vector is greater then non-vector.
196 /// If both types are vectors, then vector with greater bitwidth is
198 /// If both types are vectors with the same bitwidth, then types
199 /// are bitcastable, and we can skip other stages, and go to contents
201 /// Stage 3: Pointer types are greater than non-pointers. If both types are
202 /// pointers of the same address space - go to contents comparison.
203 /// Different address spaces: pointer with greater address space is
205 /// Stage 4: Types are neither vectors, nor pointers. And they differ.
206 /// We don't know how to bitcast them. So, we better don't do it,
207 /// and return types comparison result (so it determines the
208 /// relationship among constants we don't know how to bitcast).
210 /// Just for clearance, let's see how the set of constants could look
211 /// on single dimension axis:
213 /// [NFCT], [FCT, "others"], [FCT, pointers], [FCT, vectors]
214 /// Where: NFCT - Not a FirstClassType
215 /// FCT - FirstClassTyp:
217 /// 2. Compare raw contents.
218 /// It ignores types on this stage and only compares bits from L and R.
219 /// Returns 0, if L and R has equivalent contents.
220 /// -1 or 1 if values are different.
222 /// 2.1. If contents are numbers, compare numbers.
223 /// Ints with greater bitwidth are greater. Ints with same bitwidths
224 /// compared by their contents.
225 /// 2.2. "And so on". Just to avoid discrepancies with comments
226 /// perhaps it would be better to read the implementation itself.
227 /// 3. And again about overall picture. Let's look back at how the ordered set
228 /// of constants will look like:
229 /// [NFCT], [FCT, "others"], [FCT, pointers], [FCT, vectors]
231 /// Now look, what could be inside [FCT, "others"], for example:
232 /// [FCT, "others"] =
234 /// [double 0.1], [double 1.23],
235 /// [i32 1], [i32 2],
236 /// { double 1.0 }, ; StructTyID, NumElements = 1
237 /// { i32 1 }, ; StructTyID, NumElements = 1
238 /// { double 1, i32 1 }, ; StructTyID, NumElements = 2
239 /// { i32 1, double 1 } ; StructTyID, NumElements = 2
242 /// Let's explain the order. Float numbers will be less than integers, just
243 /// because of cmpType terms: FloatTyID < IntegerTyID.
244 /// Floats (with same fltSemantics) are sorted according to their value.
245 /// Then you can see integers, and they are, like a floats,
246 /// could be easy sorted among each others.
247 /// The structures. Structures are grouped at the tail, again because of their
248 /// TypeID: StructTyID > IntegerTyID > FloatTyID.
249 /// Structures with greater number of elements are greater. Structures with
250 /// greater elements going first are greater.
251 /// The same logic with vectors, arrays and other possible complex types.
253 /// Bitcastable constants.
254 /// Let's assume, that some constant, belongs to some group of
255 /// "so-called-equal" values with different types, and at the same time
256 /// belongs to another group of constants with equal types
257 /// and "really" equal values.
259 /// Now, prove that this is impossible:
261 /// If constant A with type TyA is bitcastable to B with type TyB, then:
262 /// 1. All constants with equal types to TyA, are bitcastable to B. Since
263 /// those should be vectors (if TyA is vector), pointers
264 /// (if TyA is pointer), or else (if TyA equal to TyB), those types should
266 /// 2. All constants with non-equal, but bitcastable types to TyA, are
267 /// bitcastable to B.
268 /// Once again, just because we allow it to vectors and pointers only.
269 /// This statement could be expanded as below:
270 /// 2.1. All vectors with equal bitwidth to vector A, has equal bitwidth to
271 /// vector B, and thus bitcastable to B as well.
272 /// 2.2. All pointers of the same address space, no matter what they point to,
273 /// bitcastable. So if C is pointer, it could be bitcasted to A and to B.
274 /// So any constant equal or bitcastable to A is equal or bitcastable to B.
277 /// In another words, for pointers and vectors, we ignore top-level type and
278 /// look at their particular properties (bit-width for vectors, and
279 /// address space for pointers).
280 /// If these properties are equal - compare their contents.
281 int cmpConstants(const Constant *L, const Constant *R);
283 /// Assign or look up previously assigned numbers for the two values, and
284 /// return whether the numbers are equal. Numbers are assigned in the order
286 /// Comparison order:
287 /// Stage 0: Value that is function itself is always greater then others.
288 /// If left and right values are references to their functions, then
290 /// Stage 1: Constants are greater than non-constants.
291 /// If both left and right are constants, then the result of
292 /// cmpConstants is used as cmpValues result.
293 /// Stage 2: InlineAsm instances are greater than others. If both left and
294 /// right are InlineAsm instances, InlineAsm* pointers casted to
295 /// integers and compared as numbers.
296 /// Stage 3: For all other cases we compare order we meet these values in
297 /// their functions. If right value was met first during scanning,
298 /// then left value is greater.
299 /// In another words, we compare serial numbers, for more details
300 /// see comments for sn_mapL and sn_mapR.
301 int cmpValues(const Value *L, const Value *R);
303 bool enumerate(const Value *V1, const Value *V2) {
304 return cmpValues(V1, V2) == 0;
307 /// Compare two Instructions for equivalence, similar to
308 /// Instruction::isSameOperationAs but with modifications to the type
310 bool isEquivalentOperation(const Instruction *I1,
311 const Instruction *I2) const;
313 /// Compare two GEPs for equivalent pointer arithmetic.
314 bool isEquivalentGEP(const GEPOperator *GEP1, const GEPOperator *GEP2);
315 bool isEquivalentGEP(const GetElementPtrInst *GEP1,
316 const GetElementPtrInst *GEP2) {
317 return isEquivalentGEP(cast<GEPOperator>(GEP1), cast<GEPOperator>(GEP2));
320 /// cmpType - compares two types,
321 /// defines total ordering among the types set.
324 /// 0 if types are equal,
325 /// -1 if Left is less than Right,
326 /// +1 if Left is greater than Right.
329 /// Comparison is broken onto stages. Like in lexicographical comparison
330 /// stage coming first has higher priority.
331 /// On each explanation stage keep in mind total ordering properties.
333 /// 0. Before comparison we coerce pointer types of 0 address space to
335 /// We also don't bother with same type at left and right, so
336 /// just return 0 in this case.
338 /// 1. If types are of different kind (different type IDs).
339 /// Return result of type IDs comparison, treating them as numbers.
340 /// 2. If types are vectors or integers, compare Type* values as numbers.
341 /// 3. Types has same ID, so check whether they belongs to the next group:
350 /// If so - return 0, yes - we can treat these types as equal only because
351 /// their IDs are same.
352 /// 4. If Left and Right are pointers, return result of address space
353 /// comparison (numbers comparison). We can treat pointer types of same
354 /// address space as equal.
355 /// 5. If types are complex.
356 /// Then both Left and Right are to be expanded and their element types will
357 /// be checked with the same way. If we get Res != 0 on some stage, return it.
358 /// Otherwise return 0.
359 /// 6. For all other cases put llvm_unreachable.
360 int cmpType(Type *TyL, Type *TyR) const;
362 bool isEquivalentType(Type *Ty1, Type *Ty2) const {
363 return cmpType(Ty1, Ty2) == 0;
366 int cmpNumbers(uint64_t L, uint64_t R) const;
368 int cmpAPInt(const APInt &L, const APInt &R) const;
369 int cmpAPFloat(const APFloat &L, const APFloat &R) const;
370 int cmpStrings(StringRef L, StringRef R) const;
371 int cmpAttrs(const AttributeSet L, const AttributeSet R) const;
373 // The two functions undergoing comparison.
374 const Function *F1, *F2;
376 const DataLayout *DL;
378 /// Assign serial numbers to values from left function, and values from
381 /// Being comparing functions we need to compare values we meet at left and
383 /// Its easy to sort things out for external values. It just should be
384 /// the same value at left and right.
385 /// But for local values (those were introduced inside function body)
386 /// we have to ensure they were introduced at exactly the same place,
387 /// and plays the same role.
388 /// Let's assign serial number to each value when we meet it first time.
389 /// Values that were met at same place will be with same serial numbers.
390 /// In this case it would be good to explain few points about values assigned
391 /// to BBs and other ways of implementation (see below).
393 /// 1. Safety of BB reordering.
394 /// It's safe to change the order of BasicBlocks in function.
395 /// Relationship with other functions and serial numbering will not be
396 /// changed in this case.
397 /// As follows from FunctionComparator::compare(), we do CFG walk: we start
398 /// from the entry, and then take each terminator. So it doesn't matter how in
399 /// fact BBs are ordered in function. And since cmpValues are called during
400 /// this walk, the numbering depends only on how BBs located inside the CFG.
401 /// So the answer is - yes. We will get the same numbering.
403 /// 2. Impossibility to use dominance properties of values.
404 /// If we compare two instruction operands: first is usage of local
405 /// variable AL from function FL, and second is usage of local variable AR
406 /// from FR, we could compare their origins and check whether they are
407 /// defined at the same place.
408 /// But, we are still not able to compare operands of PHI nodes, since those
409 /// could be operands from further BBs we didn't scan yet.
410 /// So it's impossible to use dominance properties in general.
411 DenseMap<const Value*, int> sn_mapL, sn_mapR;
416 int FunctionComparator::cmpNumbers(uint64_t L, uint64_t R) const {
417 if (L < R) return -1;
422 int FunctionComparator::cmpAPInt(const APInt &L, const APInt &R) const {
423 if (int Res = cmpNumbers(L.getBitWidth(), R.getBitWidth()))
425 if (L.ugt(R)) return 1;
426 if (R.ugt(L)) return -1;
430 int FunctionComparator::cmpAPFloat(const APFloat &L, const APFloat &R) const {
431 if (int Res = cmpNumbers((uint64_t)&L.getSemantics(),
432 (uint64_t)&R.getSemantics()))
434 return cmpAPInt(L.bitcastToAPInt(), R.bitcastToAPInt());
437 int FunctionComparator::cmpStrings(StringRef L, StringRef R) const {
438 // Prevent heavy comparison, compare sizes first.
439 if (int Res = cmpNumbers(L.size(), R.size()))
442 // Compare strings lexicographically only when it is necessary: only when
443 // strings are equal in size.
447 int FunctionComparator::cmpAttrs(const AttributeSet L,
448 const AttributeSet R) const {
449 if (int Res = cmpNumbers(L.getNumSlots(), R.getNumSlots()))
452 for (unsigned i = 0, e = L.getNumSlots(); i != e; ++i) {
453 AttributeSet::iterator LI = L.begin(i), LE = L.end(i), RI = R.begin(i),
455 for (; LI != LE && RI != RE; ++LI, ++RI) {
471 /// Constants comparison:
472 /// 1. Check whether type of L constant could be losslessly bitcasted to R
474 /// 2. Compare constant contents.
475 /// For more details see declaration comments.
476 int FunctionComparator::cmpConstants(const Constant *L, const Constant *R) {
478 Type *TyL = L->getType();
479 Type *TyR = R->getType();
481 // Check whether types are bitcastable. This part is just re-factored
482 // Type::canLosslesslyBitCastTo method, but instead of returning true/false,
483 // we also pack into result which type is "less" for us.
484 int TypesRes = cmpType(TyL, TyR);
486 // Types are different, but check whether we can bitcast them.
487 if (!TyL->isFirstClassType()) {
488 if (TyR->isFirstClassType())
490 // Neither TyL nor TyR are values of first class type. Return the result
491 // of comparing the types
494 if (!TyR->isFirstClassType()) {
495 if (TyL->isFirstClassType())
500 // Vector -> Vector conversions are always lossless if the two vector types
501 // have the same size, otherwise not.
502 unsigned TyLWidth = 0;
503 unsigned TyRWidth = 0;
505 if (const VectorType *VecTyL = dyn_cast<VectorType>(TyL))
506 TyLWidth = VecTyL->getBitWidth();
507 if (const VectorType *VecTyR = dyn_cast<VectorType>(TyR))
508 TyRWidth = VecTyR->getBitWidth();
510 if (TyLWidth != TyRWidth)
511 return cmpNumbers(TyLWidth, TyRWidth);
513 // Zero bit-width means neither TyL nor TyR are vectors.
515 PointerType *PTyL = dyn_cast<PointerType>(TyL);
516 PointerType *PTyR = dyn_cast<PointerType>(TyR);
518 unsigned AddrSpaceL = PTyL->getAddressSpace();
519 unsigned AddrSpaceR = PTyR->getAddressSpace();
520 if (int Res = cmpNumbers(AddrSpaceL, AddrSpaceR))
528 // TyL and TyR aren't vectors, nor pointers. We don't know how to
534 // OK, types are bitcastable, now check constant contents.
536 if (L->isNullValue() && R->isNullValue())
538 if (L->isNullValue() && !R->isNullValue())
540 if (!L->isNullValue() && R->isNullValue())
543 if (int Res = cmpNumbers(L->getValueID(), R->getValueID()))
546 switch (L->getValueID()) {
547 case Value::UndefValueVal: return TypesRes;
548 case Value::ConstantIntVal: {
549 const APInt &LInt = cast<ConstantInt>(L)->getValue();
550 const APInt &RInt = cast<ConstantInt>(R)->getValue();
551 return cmpAPInt(LInt, RInt);
553 case Value::ConstantFPVal: {
554 const APFloat &LAPF = cast<ConstantFP>(L)->getValueAPF();
555 const APFloat &RAPF = cast<ConstantFP>(R)->getValueAPF();
556 return cmpAPFloat(LAPF, RAPF);
558 case Value::ConstantArrayVal: {
559 const ConstantArray *LA = cast<ConstantArray>(L);
560 const ConstantArray *RA = cast<ConstantArray>(R);
561 uint64_t NumElementsL = cast<ArrayType>(TyL)->getNumElements();
562 uint64_t NumElementsR = cast<ArrayType>(TyR)->getNumElements();
563 if (int Res = cmpNumbers(NumElementsL, NumElementsR))
565 for (uint64_t i = 0; i < NumElementsL; ++i) {
566 if (int Res = cmpConstants(cast<Constant>(LA->getOperand(i)),
567 cast<Constant>(RA->getOperand(i))))
572 case Value::ConstantStructVal: {
573 const ConstantStruct *LS = cast<ConstantStruct>(L);
574 const ConstantStruct *RS = cast<ConstantStruct>(R);
575 unsigned NumElementsL = cast<StructType>(TyL)->getNumElements();
576 unsigned NumElementsR = cast<StructType>(TyR)->getNumElements();
577 if (int Res = cmpNumbers(NumElementsL, NumElementsR))
579 for (unsigned i = 0; i != NumElementsL; ++i) {
580 if (int Res = cmpConstants(cast<Constant>(LS->getOperand(i)),
581 cast<Constant>(RS->getOperand(i))))
586 case Value::ConstantVectorVal: {
587 const ConstantVector *LV = cast<ConstantVector>(L);
588 const ConstantVector *RV = cast<ConstantVector>(R);
589 unsigned NumElementsL = cast<VectorType>(TyL)->getNumElements();
590 unsigned NumElementsR = cast<VectorType>(TyR)->getNumElements();
591 if (int Res = cmpNumbers(NumElementsL, NumElementsR))
593 for (uint64_t i = 0; i < NumElementsL; ++i) {
594 if (int Res = cmpConstants(cast<Constant>(LV->getOperand(i)),
595 cast<Constant>(RV->getOperand(i))))
600 case Value::ConstantExprVal: {
601 const ConstantExpr *LE = cast<ConstantExpr>(L);
602 const ConstantExpr *RE = cast<ConstantExpr>(R);
603 unsigned NumOperandsL = LE->getNumOperands();
604 unsigned NumOperandsR = RE->getNumOperands();
605 if (int Res = cmpNumbers(NumOperandsL, NumOperandsR))
607 for (unsigned i = 0; i < NumOperandsL; ++i) {
608 if (int Res = cmpConstants(cast<Constant>(LE->getOperand(i)),
609 cast<Constant>(RE->getOperand(i))))
614 case Value::FunctionVal:
615 case Value::GlobalVariableVal:
616 case Value::GlobalAliasVal:
617 default: // Unknown constant, cast L and R pointers to numbers and compare.
618 return cmpNumbers((uint64_t)L, (uint64_t)R);
622 /// cmpType - compares two types,
623 /// defines total ordering among the types set.
624 /// See method declaration comments for more details.
625 int FunctionComparator::cmpType(Type *TyL, Type *TyR) const {
627 PointerType *PTyL = dyn_cast<PointerType>(TyL);
628 PointerType *PTyR = dyn_cast<PointerType>(TyR);
631 if (PTyL && PTyL->getAddressSpace() == 0) TyL = DL->getIntPtrType(TyL);
632 if (PTyR && PTyR->getAddressSpace() == 0) TyR = DL->getIntPtrType(TyR);
638 if (int Res = cmpNumbers(TyL->getTypeID(), TyR->getTypeID()))
641 switch (TyL->getTypeID()) {
643 llvm_unreachable("Unknown type!");
644 // Fall through in Release mode.
645 case Type::IntegerTyID:
646 case Type::VectorTyID:
647 // TyL == TyR would have returned true earlier.
648 return cmpNumbers((uint64_t)TyL, (uint64_t)TyR);
651 case Type::FloatTyID:
652 case Type::DoubleTyID:
653 case Type::X86_FP80TyID:
654 case Type::FP128TyID:
655 case Type::PPC_FP128TyID:
656 case Type::LabelTyID:
657 case Type::MetadataTyID:
660 case Type::PointerTyID: {
661 assert(PTyL && PTyR && "Both types must be pointers here.");
662 return cmpNumbers(PTyL->getAddressSpace(), PTyR->getAddressSpace());
665 case Type::StructTyID: {
666 StructType *STyL = cast<StructType>(TyL);
667 StructType *STyR = cast<StructType>(TyR);
668 if (STyL->getNumElements() != STyR->getNumElements())
669 return cmpNumbers(STyL->getNumElements(), STyR->getNumElements());
671 if (STyL->isPacked() != STyR->isPacked())
672 return cmpNumbers(STyL->isPacked(), STyR->isPacked());
674 for (unsigned i = 0, e = STyL->getNumElements(); i != e; ++i) {
675 if (int Res = cmpType(STyL->getElementType(i),
676 STyR->getElementType(i)))
682 case Type::FunctionTyID: {
683 FunctionType *FTyL = cast<FunctionType>(TyL);
684 FunctionType *FTyR = cast<FunctionType>(TyR);
685 if (FTyL->getNumParams() != FTyR->getNumParams())
686 return cmpNumbers(FTyL->getNumParams(), FTyR->getNumParams());
688 if (FTyL->isVarArg() != FTyR->isVarArg())
689 return cmpNumbers(FTyL->isVarArg(), FTyR->isVarArg());
691 if (int Res = cmpType(FTyL->getReturnType(), FTyR->getReturnType()))
694 for (unsigned i = 0, e = FTyL->getNumParams(); i != e; ++i) {
695 if (int Res = cmpType(FTyL->getParamType(i), FTyR->getParamType(i)))
701 case Type::ArrayTyID: {
702 ArrayType *ATyL = cast<ArrayType>(TyL);
703 ArrayType *ATyR = cast<ArrayType>(TyR);
704 if (ATyL->getNumElements() != ATyR->getNumElements())
705 return cmpNumbers(ATyL->getNumElements(), ATyR->getNumElements());
706 return cmpType(ATyL->getElementType(), ATyR->getElementType());
711 // Determine whether the two operations are the same except that pointer-to-A
712 // and pointer-to-B are equivalent. This should be kept in sync with
713 // Instruction::isSameOperationAs.
714 bool FunctionComparator::isEquivalentOperation(const Instruction *I1,
715 const Instruction *I2) const {
716 // Differences from Instruction::isSameOperationAs:
717 // * replace type comparison with calls to isEquivalentType.
718 // * we test for I->hasSameSubclassOptionalData (nuw/nsw/tail) at the top
719 // * because of the above, we don't test for the tail bit on calls later on
720 if (I1->getOpcode() != I2->getOpcode() ||
721 I1->getNumOperands() != I2->getNumOperands() ||
722 !isEquivalentType(I1->getType(), I2->getType()) ||
723 !I1->hasSameSubclassOptionalData(I2))
726 // We have two instructions of identical opcode and #operands. Check to see
727 // if all operands are the same type
728 for (unsigned i = 0, e = I1->getNumOperands(); i != e; ++i)
729 if (!isEquivalentType(I1->getOperand(i)->getType(),
730 I2->getOperand(i)->getType()))
733 // Check special state that is a part of some instructions.
734 if (const LoadInst *LI = dyn_cast<LoadInst>(I1))
735 return LI->isVolatile() == cast<LoadInst>(I2)->isVolatile() &&
736 LI->getAlignment() == cast<LoadInst>(I2)->getAlignment() &&
737 LI->getOrdering() == cast<LoadInst>(I2)->getOrdering() &&
738 LI->getSynchScope() == cast<LoadInst>(I2)->getSynchScope();
739 if (const StoreInst *SI = dyn_cast<StoreInst>(I1))
740 return SI->isVolatile() == cast<StoreInst>(I2)->isVolatile() &&
741 SI->getAlignment() == cast<StoreInst>(I2)->getAlignment() &&
742 SI->getOrdering() == cast<StoreInst>(I2)->getOrdering() &&
743 SI->getSynchScope() == cast<StoreInst>(I2)->getSynchScope();
744 if (const CmpInst *CI = dyn_cast<CmpInst>(I1))
745 return CI->getPredicate() == cast<CmpInst>(I2)->getPredicate();
746 if (const CallInst *CI = dyn_cast<CallInst>(I1))
747 return CI->getCallingConv() == cast<CallInst>(I2)->getCallingConv() &&
748 CI->getAttributes() == cast<CallInst>(I2)->getAttributes();
749 if (const InvokeInst *CI = dyn_cast<InvokeInst>(I1))
750 return CI->getCallingConv() == cast<InvokeInst>(I2)->getCallingConv() &&
751 CI->getAttributes() == cast<InvokeInst>(I2)->getAttributes();
752 if (const InsertValueInst *IVI = dyn_cast<InsertValueInst>(I1))
753 return IVI->getIndices() == cast<InsertValueInst>(I2)->getIndices();
754 if (const ExtractValueInst *EVI = dyn_cast<ExtractValueInst>(I1))
755 return EVI->getIndices() == cast<ExtractValueInst>(I2)->getIndices();
756 if (const FenceInst *FI = dyn_cast<FenceInst>(I1))
757 return FI->getOrdering() == cast<FenceInst>(I2)->getOrdering() &&
758 FI->getSynchScope() == cast<FenceInst>(I2)->getSynchScope();
759 if (const AtomicCmpXchgInst *CXI = dyn_cast<AtomicCmpXchgInst>(I1))
760 return CXI->isVolatile() == cast<AtomicCmpXchgInst>(I2)->isVolatile() &&
761 CXI->getSuccessOrdering() ==
762 cast<AtomicCmpXchgInst>(I2)->getSuccessOrdering() &&
763 CXI->getFailureOrdering() ==
764 cast<AtomicCmpXchgInst>(I2)->getFailureOrdering() &&
765 CXI->getSynchScope() == cast<AtomicCmpXchgInst>(I2)->getSynchScope();
766 if (const AtomicRMWInst *RMWI = dyn_cast<AtomicRMWInst>(I1))
767 return RMWI->getOperation() == cast<AtomicRMWInst>(I2)->getOperation() &&
768 RMWI->isVolatile() == cast<AtomicRMWInst>(I2)->isVolatile() &&
769 RMWI->getOrdering() == cast<AtomicRMWInst>(I2)->getOrdering() &&
770 RMWI->getSynchScope() == cast<AtomicRMWInst>(I2)->getSynchScope();
775 // Determine whether two GEP operations perform the same underlying arithmetic.
776 bool FunctionComparator::isEquivalentGEP(const GEPOperator *GEP1,
777 const GEPOperator *GEP2) {
778 unsigned AS = GEP1->getPointerAddressSpace();
779 if (AS != GEP2->getPointerAddressSpace())
783 // When we have target data, we can reduce the GEP down to the value in bytes
784 // added to the address.
785 unsigned BitWidth = DL ? DL->getPointerSizeInBits(AS) : 1;
786 APInt Offset1(BitWidth, 0), Offset2(BitWidth, 0);
787 if (GEP1->accumulateConstantOffset(*DL, Offset1) &&
788 GEP2->accumulateConstantOffset(*DL, Offset2)) {
789 return Offset1 == Offset2;
793 if (GEP1->getPointerOperand()->getType() !=
794 GEP2->getPointerOperand()->getType())
797 if (GEP1->getNumOperands() != GEP2->getNumOperands())
800 for (unsigned i = 0, e = GEP1->getNumOperands(); i != e; ++i) {
801 if (!enumerate(GEP1->getOperand(i), GEP2->getOperand(i)))
808 /// Compare two values used by the two functions under pair-wise comparison. If
809 /// this is the first time the values are seen, they're added to the mapping so
810 /// that we will detect mismatches on next use.
811 /// See comments in declaration for more details.
812 int FunctionComparator::cmpValues(const Value *L, const Value *R) {
813 // Catch self-reference case.
825 const Constant *ConstL = dyn_cast<Constant>(L);
826 const Constant *ConstR = dyn_cast<Constant>(R);
827 if (ConstL && ConstR) {
830 return cmpConstants(ConstL, ConstR);
838 const InlineAsm *InlineAsmL = dyn_cast<InlineAsm>(L);
839 const InlineAsm *InlineAsmR = dyn_cast<InlineAsm>(R);
841 if (InlineAsmL && InlineAsmR)
842 return cmpNumbers((uint64_t)L, (uint64_t)R);
848 auto LeftSN = sn_mapL.insert(std::make_pair(L, sn_mapL.size())),
849 RightSN = sn_mapR.insert(std::make_pair(R, sn_mapR.size()));
851 return cmpNumbers(LeftSN.first->second, RightSN.first->second);
853 // Test whether two basic blocks have equivalent behaviour.
854 bool FunctionComparator::compare(const BasicBlock *BB1, const BasicBlock *BB2) {
855 BasicBlock::const_iterator F1I = BB1->begin(), F1E = BB1->end();
856 BasicBlock::const_iterator F2I = BB2->begin(), F2E = BB2->end();
859 if (!enumerate(F1I, F2I))
862 if (const GetElementPtrInst *GEP1 = dyn_cast<GetElementPtrInst>(F1I)) {
863 const GetElementPtrInst *GEP2 = dyn_cast<GetElementPtrInst>(F2I);
867 if (!enumerate(GEP1->getPointerOperand(), GEP2->getPointerOperand()))
870 if (!isEquivalentGEP(GEP1, GEP2))
873 if (!isEquivalentOperation(F1I, F2I))
876 assert(F1I->getNumOperands() == F2I->getNumOperands());
877 for (unsigned i = 0, e = F1I->getNumOperands(); i != e; ++i) {
878 Value *OpF1 = F1I->getOperand(i);
879 Value *OpF2 = F2I->getOperand(i);
881 if (!enumerate(OpF1, OpF2))
884 if (OpF1->getValueID() != OpF2->getValueID() ||
885 !isEquivalentType(OpF1->getType(), OpF2->getType()))
891 } while (F1I != F1E && F2I != F2E);
893 return F1I == F1E && F2I == F2E;
896 // Test whether the two functions have equivalent behaviour.
897 bool FunctionComparator::compare() {
898 // We need to recheck everything, but check the things that weren't included
899 // in the hash first.
904 if (F1->getAttributes() != F2->getAttributes())
907 if (F1->hasGC() != F2->hasGC())
910 if (F1->hasGC() && F1->getGC() != F2->getGC())
913 if (F1->hasSection() != F2->hasSection())
916 if (F1->hasSection() && F1->getSection() != F2->getSection())
919 if (F1->isVarArg() != F2->isVarArg())
922 // TODO: if it's internal and only used in direct calls, we could handle this
924 if (F1->getCallingConv() != F2->getCallingConv())
927 if (!isEquivalentType(F1->getFunctionType(), F2->getFunctionType()))
930 assert(F1->arg_size() == F2->arg_size() &&
931 "Identically typed functions have different numbers of args!");
933 // Visit the arguments so that they get enumerated in the order they're
935 for (Function::const_arg_iterator f1i = F1->arg_begin(),
936 f2i = F2->arg_begin(), f1e = F1->arg_end(); f1i != f1e; ++f1i, ++f2i) {
937 if (!enumerate(f1i, f2i))
938 llvm_unreachable("Arguments repeat!");
941 // We do a CFG-ordered walk since the actual ordering of the blocks in the
942 // linked list is immaterial. Our walk starts at the entry block for both
943 // functions, then takes each block from each terminator in order. As an
944 // artifact, this also means that unreachable blocks are ignored.
945 SmallVector<const BasicBlock *, 8> F1BBs, F2BBs;
946 SmallSet<const BasicBlock *, 128> VisitedBBs; // in terms of F1.
948 F1BBs.push_back(&F1->getEntryBlock());
949 F2BBs.push_back(&F2->getEntryBlock());
951 VisitedBBs.insert(F1BBs[0]);
952 while (!F1BBs.empty()) {
953 const BasicBlock *F1BB = F1BBs.pop_back_val();
954 const BasicBlock *F2BB = F2BBs.pop_back_val();
956 if (!enumerate(F1BB, F2BB) || !compare(F1BB, F2BB))
959 const TerminatorInst *F1TI = F1BB->getTerminator();
960 const TerminatorInst *F2TI = F2BB->getTerminator();
962 assert(F1TI->getNumSuccessors() == F2TI->getNumSuccessors());
963 for (unsigned i = 0, e = F1TI->getNumSuccessors(); i != e; ++i) {
964 if (!VisitedBBs.insert(F1TI->getSuccessor(i)))
967 F1BBs.push_back(F1TI->getSuccessor(i));
968 F2BBs.push_back(F2TI->getSuccessor(i));
976 /// MergeFunctions finds functions which will generate identical machine code,
977 /// by considering all pointer types to be equivalent. Once identified,
978 /// MergeFunctions will fold them by replacing a call to one to a call to a
979 /// bitcast of the other.
981 class MergeFunctions : public ModulePass {
985 : ModulePass(ID), HasGlobalAliases(false) {
986 initializeMergeFunctionsPass(*PassRegistry::getPassRegistry());
989 bool runOnModule(Module &M) override;
992 typedef DenseSet<ComparableFunction> FnSetType;
994 /// A work queue of functions that may have been modified and should be
996 std::vector<WeakVH> Deferred;
998 /// Insert a ComparableFunction into the FnSet, or merge it away if it's
999 /// equal to one that's already present.
1000 bool insert(ComparableFunction &NewF);
1002 /// Remove a Function from the FnSet and queue it up for a second sweep of
1004 void remove(Function *F);
1006 /// Find the functions that use this Value and remove them from FnSet and
1007 /// queue the functions.
1008 void removeUsers(Value *V);
1010 /// Replace all direct calls of Old with calls of New. Will bitcast New if
1011 /// necessary to make types match.
1012 void replaceDirectCallers(Function *Old, Function *New);
1014 /// Merge two equivalent functions. Upon completion, G may be deleted, or may
1015 /// be converted into a thunk. In either case, it should never be visited
1017 void mergeTwoFunctions(Function *F, Function *G);
1019 /// Replace G with a thunk or an alias to F. Deletes G.
1020 void writeThunkOrAlias(Function *F, Function *G);
1022 /// Replace G with a simple tail call to bitcast(F). Also replace direct uses
1023 /// of G with bitcast(F). Deletes G.
1024 void writeThunk(Function *F, Function *G);
1026 /// Replace G with an alias to F. Deletes G.
1027 void writeAlias(Function *F, Function *G);
1029 /// The set of all distinct functions. Use the insert() and remove() methods
1033 /// DataLayout for more accurate GEP comparisons. May be NULL.
1034 const DataLayout *DL;
1036 /// Whether or not the target supports global aliases.
1037 bool HasGlobalAliases;
1040 } // end anonymous namespace
1042 char MergeFunctions::ID = 0;
1043 INITIALIZE_PASS(MergeFunctions, "mergefunc", "Merge Functions", false, false)
1045 ModulePass *llvm::createMergeFunctionsPass() {
1046 return new MergeFunctions();
1049 bool MergeFunctions::runOnModule(Module &M) {
1050 bool Changed = false;
1051 DataLayoutPass *DLP = getAnalysisIfAvailable<DataLayoutPass>();
1052 DL = DLP ? &DLP->getDataLayout() : nullptr;
1054 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1055 if (!I->isDeclaration() && !I->hasAvailableExternallyLinkage())
1056 Deferred.push_back(WeakVH(I));
1058 FnSet.resize(Deferred.size());
1061 std::vector<WeakVH> Worklist;
1062 Deferred.swap(Worklist);
1064 DEBUG(dbgs() << "size of module: " << M.size() << '\n');
1065 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n');
1067 // Insert only strong functions and merge them. Strong function merging
1068 // always deletes one of them.
1069 for (std::vector<WeakVH>::iterator I = Worklist.begin(),
1070 E = Worklist.end(); I != E; ++I) {
1072 Function *F = cast<Function>(*I);
1073 if (!F->isDeclaration() && !F->hasAvailableExternallyLinkage() &&
1074 !F->mayBeOverridden()) {
1075 ComparableFunction CF = ComparableFunction(F, DL);
1076 Changed |= insert(CF);
1080 // Insert only weak functions and merge them. By doing these second we
1081 // create thunks to the strong function when possible. When two weak
1082 // functions are identical, we create a new strong function with two weak
1083 // weak thunks to it which are identical but not mergable.
1084 for (std::vector<WeakVH>::iterator I = Worklist.begin(),
1085 E = Worklist.end(); I != E; ++I) {
1087 Function *F = cast<Function>(*I);
1088 if (!F->isDeclaration() && !F->hasAvailableExternallyLinkage() &&
1089 F->mayBeOverridden()) {
1090 ComparableFunction CF = ComparableFunction(F, DL);
1091 Changed |= insert(CF);
1094 DEBUG(dbgs() << "size of FnSet: " << FnSet.size() << '\n');
1095 } while (!Deferred.empty());
1102 bool DenseMapInfo<ComparableFunction>::isEqual(const ComparableFunction &LHS,
1103 const ComparableFunction &RHS) {
1104 if (LHS.getFunc() == RHS.getFunc() &&
1105 LHS.getHash() == RHS.getHash())
1107 if (!LHS.getFunc() || !RHS.getFunc())
1110 // One of these is a special "underlying pointer comparison only" object.
1111 if (LHS.getDataLayout() == ComparableFunction::LookupOnly ||
1112 RHS.getDataLayout() == ComparableFunction::LookupOnly)
1115 assert(LHS.getDataLayout() == RHS.getDataLayout() &&
1116 "Comparing functions for different targets");
1118 return FunctionComparator(LHS.getDataLayout(), LHS.getFunc(),
1119 RHS.getFunc()).compare();
1122 // Replace direct callers of Old with New.
1123 void MergeFunctions::replaceDirectCallers(Function *Old, Function *New) {
1124 Constant *BitcastNew = ConstantExpr::getBitCast(New, Old->getType());
1125 for (auto UI = Old->use_begin(), UE = Old->use_end(); UI != UE;) {
1128 CallSite CS(U->getUser());
1129 if (CS && CS.isCallee(U)) {
1130 remove(CS.getInstruction()->getParent()->getParent());
1136 // Replace G with an alias to F if possible, or else a thunk to F. Deletes G.
1137 void MergeFunctions::writeThunkOrAlias(Function *F, Function *G) {
1138 if (HasGlobalAliases && G->hasUnnamedAddr()) {
1139 if (G->hasExternalLinkage() || G->hasLocalLinkage() ||
1140 G->hasWeakLinkage()) {
1149 // Helper for writeThunk,
1150 // Selects proper bitcast operation,
1151 // but a bit simpler then CastInst::getCastOpcode.
1152 static Value *createCast(IRBuilder<false> &Builder, Value *V, Type *DestTy) {
1153 Type *SrcTy = V->getType();
1154 if (SrcTy->isStructTy()) {
1155 assert(DestTy->isStructTy());
1156 assert(SrcTy->getStructNumElements() == DestTy->getStructNumElements());
1157 Value *Result = UndefValue::get(DestTy);
1158 for (unsigned int I = 0, E = SrcTy->getStructNumElements(); I < E; ++I) {
1159 Value *Element = createCast(
1160 Builder, Builder.CreateExtractValue(V, ArrayRef<unsigned int>(I)),
1161 DestTy->getStructElementType(I));
1164 Builder.CreateInsertValue(Result, Element, ArrayRef<unsigned int>(I));
1168 assert(!DestTy->isStructTy());
1169 if (SrcTy->isIntegerTy() && DestTy->isPointerTy())
1170 return Builder.CreateIntToPtr(V, DestTy);
1171 else if (SrcTy->isPointerTy() && DestTy->isIntegerTy())
1172 return Builder.CreatePtrToInt(V, DestTy);
1174 return Builder.CreateBitCast(V, DestTy);
1177 // Replace G with a simple tail call to bitcast(F). Also replace direct uses
1178 // of G with bitcast(F). Deletes G.
1179 void MergeFunctions::writeThunk(Function *F, Function *G) {
1180 if (!G->mayBeOverridden()) {
1181 // Redirect direct callers of G to F.
1182 replaceDirectCallers(G, F);
1185 // If G was internal then we may have replaced all uses of G with F. If so,
1186 // stop here and delete G. There's no need for a thunk.
1187 if (G->hasLocalLinkage() && G->use_empty()) {
1188 G->eraseFromParent();
1192 Function *NewG = Function::Create(G->getFunctionType(), G->getLinkage(), "",
1194 BasicBlock *BB = BasicBlock::Create(F->getContext(), "", NewG);
1195 IRBuilder<false> Builder(BB);
1197 SmallVector<Value *, 16> Args;
1199 FunctionType *FFTy = F->getFunctionType();
1200 for (Function::arg_iterator AI = NewG->arg_begin(), AE = NewG->arg_end();
1202 Args.push_back(createCast(Builder, (Value*)AI, FFTy->getParamType(i)));
1206 CallInst *CI = Builder.CreateCall(F, Args);
1208 CI->setCallingConv(F->getCallingConv());
1209 if (NewG->getReturnType()->isVoidTy()) {
1210 Builder.CreateRetVoid();
1212 Builder.CreateRet(createCast(Builder, CI, NewG->getReturnType()));
1215 NewG->copyAttributesFrom(G);
1218 G->replaceAllUsesWith(NewG);
1219 G->eraseFromParent();
1221 DEBUG(dbgs() << "writeThunk: " << NewG->getName() << '\n');
1225 // Replace G with an alias to F and delete G.
1226 void MergeFunctions::writeAlias(Function *F, Function *G) {
1227 Constant *BitcastF = ConstantExpr::getBitCast(F, G->getType());
1228 GlobalAlias *GA = new GlobalAlias(G->getType(), G->getLinkage(), "",
1229 BitcastF, G->getParent());
1230 F->setAlignment(std::max(F->getAlignment(), G->getAlignment()));
1232 GA->setVisibility(G->getVisibility());
1234 G->replaceAllUsesWith(GA);
1235 G->eraseFromParent();
1237 DEBUG(dbgs() << "writeAlias: " << GA->getName() << '\n');
1238 ++NumAliasesWritten;
1241 // Merge two equivalent functions. Upon completion, Function G is deleted.
1242 void MergeFunctions::mergeTwoFunctions(Function *F, Function *G) {
1243 if (F->mayBeOverridden()) {
1244 assert(G->mayBeOverridden());
1246 if (HasGlobalAliases) {
1247 // Make them both thunks to the same internal function.
1248 Function *H = Function::Create(F->getFunctionType(), F->getLinkage(), "",
1250 H->copyAttributesFrom(F);
1253 F->replaceAllUsesWith(H);
1255 unsigned MaxAlignment = std::max(G->getAlignment(), H->getAlignment());
1260 F->setAlignment(MaxAlignment);
1261 F->setLinkage(GlobalValue::PrivateLinkage);
1263 // We can't merge them. Instead, pick one and update all direct callers
1264 // to call it and hope that we improve the instruction cache hit rate.
1265 replaceDirectCallers(G, F);
1270 writeThunkOrAlias(F, G);
1273 ++NumFunctionsMerged;
1276 // Insert a ComparableFunction into the FnSet, or merge it away if equal to one
1277 // that was already inserted.
1278 bool MergeFunctions::insert(ComparableFunction &NewF) {
1279 std::pair<FnSetType::iterator, bool> Result = FnSet.insert(NewF);
1280 if (Result.second) {
1281 DEBUG(dbgs() << "Inserting as unique: " << NewF.getFunc()->getName() << '\n');
1285 const ComparableFunction &OldF = *Result.first;
1287 // Don't merge tiny functions, since it can just end up making the function
1289 // FIXME: Should still merge them if they are unnamed_addr and produce an
1291 if (NewF.getFunc()->size() == 1) {
1292 if (NewF.getFunc()->front().size() <= 2) {
1293 DEBUG(dbgs() << NewF.getFunc()->getName()
1294 << " is to small to bother merging\n");
1299 // Never thunk a strong function to a weak function.
1300 assert(!OldF.getFunc()->mayBeOverridden() ||
1301 NewF.getFunc()->mayBeOverridden());
1303 DEBUG(dbgs() << " " << OldF.getFunc()->getName() << " == "
1304 << NewF.getFunc()->getName() << '\n');
1306 Function *DeleteF = NewF.getFunc();
1308 mergeTwoFunctions(OldF.getFunc(), DeleteF);
1312 // Remove a function from FnSet. If it was already in FnSet, add it to Deferred
1313 // so that we'll look at it in the next round.
1314 void MergeFunctions::remove(Function *F) {
1315 // We need to make sure we remove F, not a function "equal" to F per the
1316 // function equality comparator.
1318 // The special "lookup only" ComparableFunction bypasses the expensive
1319 // function comparison in favour of a pointer comparison on the underlying
1321 ComparableFunction CF = ComparableFunction(F, ComparableFunction::LookupOnly);
1322 if (FnSet.erase(CF)) {
1323 DEBUG(dbgs() << "Removed " << F->getName() << " from set and deferred it.\n");
1324 Deferred.push_back(F);
1328 // For each instruction used by the value, remove() the function that contains
1329 // the instruction. This should happen right before a call to RAUW.
1330 void MergeFunctions::removeUsers(Value *V) {
1331 std::vector<Value *> Worklist;
1332 Worklist.push_back(V);
1333 while (!Worklist.empty()) {
1334 Value *V = Worklist.back();
1335 Worklist.pop_back();
1337 for (User *U : V->users()) {
1338 if (Instruction *I = dyn_cast<Instruction>(U)) {
1339 remove(I->getParent()->getParent());
1340 } else if (isa<GlobalValue>(U)) {
1342 } else if (Constant *C = dyn_cast<Constant>(U)) {
1343 for (User *UU : C->users())
1344 Worklist.push_back(UU);