1 //===-- MachineFunction.cpp -----------------------------------------------===//
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 // Collect native machine code information for a function. This allows
11 // target-specific information about the generated code to be stored with each
14 //===----------------------------------------------------------------------===//
16 #include "llvm/CodeGen/MachineFunction.h"
17 #include "llvm/Function.h"
18 #include "llvm/CodeGen/MachineConstantPool.h"
19 #include "llvm/CodeGen/MachineFunctionPass.h"
20 #include "llvm/CodeGen/MachineFrameInfo.h"
21 #include "llvm/CodeGen/MachineInstr.h"
22 #include "llvm/CodeGen/MachineJumpTableInfo.h"
23 #include "llvm/CodeGen/MachineModuleInfo.h"
24 #include "llvm/CodeGen/MachineRegisterInfo.h"
25 #include "llvm/CodeGen/Passes.h"
26 #include "llvm/MC/MCAsmInfo.h"
27 #include "llvm/MC/MCContext.h"
28 #include "llvm/Analysis/ConstantFolding.h"
29 #include "llvm/Analysis/DebugInfo.h"
30 #include "llvm/Support/Debug.h"
31 #include "llvm/Target/TargetData.h"
32 #include "llvm/Target/TargetLowering.h"
33 #include "llvm/Target/TargetMachine.h"
34 #include "llvm/Target/TargetFrameLowering.h"
35 #include "llvm/ADT/SmallString.h"
36 #include "llvm/ADT/STLExtras.h"
37 #include "llvm/Support/GraphWriter.h"
38 #include "llvm/Support/raw_ostream.h"
41 //===----------------------------------------------------------------------===//
42 // MachineFunction implementation
43 //===----------------------------------------------------------------------===//
45 // Out of line virtual method.
46 MachineFunctionInfo::~MachineFunctionInfo() {}
48 void ilist_traits<MachineBasicBlock>::deleteNode(MachineBasicBlock *MBB) {
49 MBB->getParent()->DeleteMachineBasicBlock(MBB);
52 MachineFunction::MachineFunction(const Function *F, const TargetMachine &TM,
53 unsigned FunctionNum, MachineModuleInfo &mmi,
55 : Fn(F), Target(TM), Ctx(mmi.getContext()), MMI(mmi), GMI(gmi) {
56 if (TM.getRegisterInfo())
57 RegInfo = new (Allocator) MachineRegisterInfo(*TM.getRegisterInfo());
61 FrameInfo = new (Allocator) MachineFrameInfo(*TM.getFrameLowering());
62 if (Fn->hasFnAttr(Attribute::StackAlignment))
63 FrameInfo->setMaxAlignment(Attribute::getStackAlignmentFromAttrs(
64 Fn->getAttributes().getFnAttributes()));
65 ConstantPool = new (Allocator) MachineConstantPool(TM.getTargetData());
66 Alignment = TM.getTargetLowering()->getMinFunctionAlignment();
67 // FIXME: Shouldn't use pref alignment if explicit alignment is set on Fn.
68 if (!Fn->hasFnAttr(Attribute::OptimizeForSize))
69 Alignment = std::max(Alignment,
70 TM.getTargetLowering()->getPrefFunctionAlignment());
71 FunctionNumber = FunctionNum;
75 MachineFunction::~MachineFunction() {
77 InstructionRecycler.clear(Allocator);
78 BasicBlockRecycler.clear(Allocator);
80 RegInfo->~MachineRegisterInfo();
81 Allocator.Deallocate(RegInfo);
84 MFInfo->~MachineFunctionInfo();
85 Allocator.Deallocate(MFInfo);
87 FrameInfo->~MachineFrameInfo(); Allocator.Deallocate(FrameInfo);
88 ConstantPool->~MachineConstantPool(); Allocator.Deallocate(ConstantPool);
91 JumpTableInfo->~MachineJumpTableInfo();
92 Allocator.Deallocate(JumpTableInfo);
96 /// getOrCreateJumpTableInfo - Get the JumpTableInfo for this function, if it
97 /// does already exist, allocate one.
98 MachineJumpTableInfo *MachineFunction::
99 getOrCreateJumpTableInfo(unsigned EntryKind) {
100 if (JumpTableInfo) return JumpTableInfo;
102 JumpTableInfo = new (Allocator)
103 MachineJumpTableInfo((MachineJumpTableInfo::JTEntryKind)EntryKind);
104 return JumpTableInfo;
107 /// RenumberBlocks - This discards all of the MachineBasicBlock numbers and
108 /// recomputes them. This guarantees that the MBB numbers are sequential,
109 /// dense, and match the ordering of the blocks within the function. If a
110 /// specific MachineBasicBlock is specified, only that block and those after
111 /// it are renumbered.
112 void MachineFunction::RenumberBlocks(MachineBasicBlock *MBB) {
113 if (empty()) { MBBNumbering.clear(); return; }
114 MachineFunction::iterator MBBI, E = end();
120 // Figure out the block number this should have.
121 unsigned BlockNo = 0;
123 BlockNo = prior(MBBI)->getNumber()+1;
125 for (; MBBI != E; ++MBBI, ++BlockNo) {
126 if (MBBI->getNumber() != (int)BlockNo) {
127 // Remove use of the old number.
128 if (MBBI->getNumber() != -1) {
129 assert(MBBNumbering[MBBI->getNumber()] == &*MBBI &&
130 "MBB number mismatch!");
131 MBBNumbering[MBBI->getNumber()] = 0;
134 // If BlockNo is already taken, set that block's number to -1.
135 if (MBBNumbering[BlockNo])
136 MBBNumbering[BlockNo]->setNumber(-1);
138 MBBNumbering[BlockNo] = MBBI;
139 MBBI->setNumber(BlockNo);
143 // Okay, all the blocks are renumbered. If we have compactified the block
144 // numbering, shrink MBBNumbering now.
145 assert(BlockNo <= MBBNumbering.size() && "Mismatch!");
146 MBBNumbering.resize(BlockNo);
149 /// CreateMachineInstr - Allocate a new MachineInstr. Use this instead
150 /// of `new MachineInstr'.
153 MachineFunction::CreateMachineInstr(const MCInstrDesc &MCID,
154 DebugLoc DL, bool NoImp) {
155 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
156 MachineInstr(MCID, DL, NoImp);
159 /// CloneMachineInstr - Create a new MachineInstr which is a copy of the
160 /// 'Orig' instruction, identical in all ways except the instruction
161 /// has no parent, prev, or next.
164 MachineFunction::CloneMachineInstr(const MachineInstr *Orig) {
165 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
166 MachineInstr(*this, *Orig);
169 /// DeleteMachineInstr - Delete the given MachineInstr.
172 MachineFunction::DeleteMachineInstr(MachineInstr *MI) {
174 InstructionRecycler.Deallocate(Allocator, MI);
177 /// CreateMachineBasicBlock - Allocate a new MachineBasicBlock. Use this
178 /// instead of `new MachineBasicBlock'.
181 MachineFunction::CreateMachineBasicBlock(const BasicBlock *bb) {
182 return new (BasicBlockRecycler.Allocate<MachineBasicBlock>(Allocator))
183 MachineBasicBlock(*this, bb);
186 /// DeleteMachineBasicBlock - Delete the given MachineBasicBlock.
189 MachineFunction::DeleteMachineBasicBlock(MachineBasicBlock *MBB) {
190 assert(MBB->getParent() == this && "MBB parent mismatch!");
191 MBB->~MachineBasicBlock();
192 BasicBlockRecycler.Deallocate(Allocator, MBB);
196 MachineFunction::getMachineMemOperand(MachinePointerInfo PtrInfo, unsigned f,
197 uint64_t s, unsigned base_alignment,
198 const MDNode *TBAAInfo) {
199 return new (Allocator) MachineMemOperand(PtrInfo, f, s, base_alignment,
204 MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO,
205 int64_t Offset, uint64_t Size) {
206 return new (Allocator)
207 MachineMemOperand(MachinePointerInfo(MMO->getValue(),
208 MMO->getOffset()+Offset),
209 MMO->getFlags(), Size,
210 MMO->getBaseAlignment(), 0);
213 MachineInstr::mmo_iterator
214 MachineFunction::allocateMemRefsArray(unsigned long Num) {
215 return Allocator.Allocate<MachineMemOperand *>(Num);
218 std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
219 MachineFunction::extractLoadMemRefs(MachineInstr::mmo_iterator Begin,
220 MachineInstr::mmo_iterator End) {
221 // Count the number of load mem refs.
223 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
227 // Allocate a new array and populate it with the load information.
228 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
230 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
231 if ((*I)->isLoad()) {
232 if (!(*I)->isStore())
236 // Clone the MMO and unset the store flag.
237 MachineMemOperand *JustLoad =
238 getMachineMemOperand((*I)->getPointerInfo(),
239 (*I)->getFlags() & ~MachineMemOperand::MOStore,
240 (*I)->getSize(), (*I)->getBaseAlignment(),
241 (*I)->getTBAAInfo());
242 Result[Index] = JustLoad;
247 return std::make_pair(Result, Result + Num);
250 std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
251 MachineFunction::extractStoreMemRefs(MachineInstr::mmo_iterator Begin,
252 MachineInstr::mmo_iterator End) {
253 // Count the number of load mem refs.
255 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
259 // Allocate a new array and populate it with the store information.
260 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
262 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
263 if ((*I)->isStore()) {
268 // Clone the MMO and unset the load flag.
269 MachineMemOperand *JustStore =
270 getMachineMemOperand((*I)->getPointerInfo(),
271 (*I)->getFlags() & ~MachineMemOperand::MOLoad,
272 (*I)->getSize(), (*I)->getBaseAlignment(),
273 (*I)->getTBAAInfo());
274 Result[Index] = JustStore;
279 return std::make_pair(Result, Result + Num);
282 void MachineFunction::dump() const {
286 void MachineFunction::print(raw_ostream &OS, SlotIndexes *Indexes) const {
287 OS << "# Machine code for function " << Fn->getName() << ": ";
289 OS << (RegInfo->isSSA() ? "SSA" : "Post SSA");
290 if (!RegInfo->tracksLiveness())
291 OS << ", not tracking liveness";
295 // Print Frame Information
296 FrameInfo->print(*this, OS);
298 // Print JumpTable Information
300 JumpTableInfo->print(OS);
302 // Print Constant Pool
303 ConstantPool->print(OS);
305 const TargetRegisterInfo *TRI = getTarget().getRegisterInfo();
307 if (RegInfo && !RegInfo->livein_empty()) {
308 OS << "Function Live Ins: ";
309 for (MachineRegisterInfo::livein_iterator
310 I = RegInfo->livein_begin(), E = RegInfo->livein_end(); I != E; ++I) {
311 OS << PrintReg(I->first, TRI);
313 OS << " in " << PrintReg(I->second, TRI);
314 if (llvm::next(I) != E)
319 if (RegInfo && !RegInfo->liveout_empty()) {
320 OS << "Function Live Outs:";
321 for (MachineRegisterInfo::liveout_iterator
322 I = RegInfo->liveout_begin(), E = RegInfo->liveout_end(); I != E; ++I)
323 OS << ' ' << PrintReg(*I, TRI);
327 for (const_iterator BB = begin(), E = end(); BB != E; ++BB) {
329 BB->print(OS, Indexes);
332 OS << "\n# End machine code for function " << Fn->getName() << ".\n\n";
337 struct DOTGraphTraits<const MachineFunction*> : public DefaultDOTGraphTraits {
339 DOTGraphTraits (bool isSimple=false) : DefaultDOTGraphTraits(isSimple) {}
341 static std::string getGraphName(const MachineFunction *F) {
342 return "CFG for '" + F->getFunction()->getName().str() + "' function";
345 std::string getNodeLabel(const MachineBasicBlock *Node,
346 const MachineFunction *Graph) {
349 raw_string_ostream OSS(OutStr);
352 OSS << "BB#" << Node->getNumber();
353 if (const BasicBlock *BB = Node->getBasicBlock())
354 OSS << ": " << BB->getName();
359 if (OutStr[0] == '\n') OutStr.erase(OutStr.begin());
361 // Process string output to make it nicer...
362 for (unsigned i = 0; i != OutStr.length(); ++i)
363 if (OutStr[i] == '\n') { // Left justify
365 OutStr.insert(OutStr.begin()+i+1, 'l');
372 void MachineFunction::viewCFG() const
375 ViewGraph(this, "mf" + getFunction()->getName());
377 errs() << "MachineFunction::viewCFG is only available in debug builds on "
378 << "systems with Graphviz or gv!\n";
382 void MachineFunction::viewCFGOnly() const
385 ViewGraph(this, "mf" + getFunction()->getName(), true);
387 errs() << "MachineFunction::viewCFGOnly is only available in debug builds on "
388 << "systems with Graphviz or gv!\n";
392 /// addLiveIn - Add the specified physical register as a live-in value and
393 /// create a corresponding virtual register for it.
394 unsigned MachineFunction::addLiveIn(unsigned PReg,
395 const TargetRegisterClass *RC) {
396 MachineRegisterInfo &MRI = getRegInfo();
397 unsigned VReg = MRI.getLiveInVirtReg(PReg);
399 assert(MRI.getRegClass(VReg) == RC && "Register class mismatch!");
402 VReg = MRI.createVirtualRegister(RC);
403 MRI.addLiveIn(PReg, VReg);
407 /// getJTISymbol - Return the MCSymbol for the specified non-empty jump table.
408 /// If isLinkerPrivate is specified, an 'l' label is returned, otherwise a
409 /// normal 'L' label is returned.
410 MCSymbol *MachineFunction::getJTISymbol(unsigned JTI, MCContext &Ctx,
411 bool isLinkerPrivate) const {
412 assert(JumpTableInfo && "No jump tables");
414 assert(JTI < JumpTableInfo->getJumpTables().size() && "Invalid JTI!");
415 const MCAsmInfo &MAI = *getTarget().getMCAsmInfo();
417 const char *Prefix = isLinkerPrivate ? MAI.getLinkerPrivateGlobalPrefix() :
418 MAI.getPrivateGlobalPrefix();
419 SmallString<60> Name;
420 raw_svector_ostream(Name)
421 << Prefix << "JTI" << getFunctionNumber() << '_' << JTI;
422 return Ctx.GetOrCreateSymbol(Name.str());
425 /// getPICBaseSymbol - Return a function-local symbol to represent the PIC
427 MCSymbol *MachineFunction::getPICBaseSymbol() const {
428 const MCAsmInfo &MAI = *Target.getMCAsmInfo();
429 return Ctx.GetOrCreateSymbol(Twine(MAI.getPrivateGlobalPrefix())+
430 Twine(getFunctionNumber())+"$pb");
433 //===----------------------------------------------------------------------===//
434 // MachineFrameInfo implementation
435 //===----------------------------------------------------------------------===//
437 /// CreateFixedObject - Create a new object at a fixed location on the stack.
438 /// All fixed objects should be created before other objects are created for
439 /// efficiency. By default, fixed objects are immutable. This returns an
440 /// index with a negative value.
442 int MachineFrameInfo::CreateFixedObject(uint64_t Size, int64_t SPOffset,
444 assert(Size != 0 && "Cannot allocate zero size fixed stack objects!");
445 // The alignment of the frame index can be determined from its offset from
446 // the incoming frame position. If the frame object is at offset 32 and
447 // the stack is guaranteed to be 16-byte aligned, then we know that the
448 // object is 16-byte aligned.
449 unsigned StackAlign = TFI.getStackAlignment();
450 unsigned Align = MinAlign(SPOffset, StackAlign);
451 Objects.insert(Objects.begin(), StackObject(Size, Align, SPOffset, Immutable,
452 /*isSS*/false, false));
453 return -++NumFixedObjects;
458 MachineFrameInfo::getPristineRegs(const MachineBasicBlock *MBB) const {
459 assert(MBB && "MBB must be valid");
460 const MachineFunction *MF = MBB->getParent();
461 assert(MF && "MBB must be part of a MachineFunction");
462 const TargetMachine &TM = MF->getTarget();
463 const TargetRegisterInfo *TRI = TM.getRegisterInfo();
464 BitVector BV(TRI->getNumRegs());
466 // Before CSI is calculated, no registers are considered pristine. They can be
467 // freely used and PEI will make sure they are saved.
468 if (!isCalleeSavedInfoValid())
471 for (const uint16_t *CSR = TRI->getCalleeSavedRegs(MF); CSR && *CSR; ++CSR)
474 // The entry MBB always has all CSRs pristine.
475 if (MBB == &MF->front())
478 // On other MBBs the saved CSRs are not pristine.
479 const std::vector<CalleeSavedInfo> &CSI = getCalleeSavedInfo();
480 for (std::vector<CalleeSavedInfo>::const_iterator I = CSI.begin(),
481 E = CSI.end(); I != E; ++I)
482 BV.reset(I->getReg());
488 void MachineFrameInfo::print(const MachineFunction &MF, raw_ostream &OS) const{
489 if (Objects.empty()) return;
491 const TargetFrameLowering *FI = MF.getTarget().getFrameLowering();
492 int ValOffset = (FI ? FI->getOffsetOfLocalArea() : 0);
494 OS << "Frame Objects:\n";
496 for (unsigned i = 0, e = Objects.size(); i != e; ++i) {
497 const StackObject &SO = Objects[i];
498 OS << " fi#" << (int)(i-NumFixedObjects) << ": ";
499 if (SO.Size == ~0ULL) {
504 OS << "variable sized";
506 OS << "size=" << SO.Size;
507 OS << ", align=" << SO.Alignment;
509 if (i < NumFixedObjects)
511 if (i < NumFixedObjects || SO.SPOffset != -1) {
512 int64_t Off = SO.SPOffset - ValOffset;
513 OS << ", at location [SP";
524 void MachineFrameInfo::dump(const MachineFunction &MF) const {
528 //===----------------------------------------------------------------------===//
529 // MachineJumpTableInfo implementation
530 //===----------------------------------------------------------------------===//
532 /// getEntrySize - Return the size of each entry in the jump table.
533 unsigned MachineJumpTableInfo::getEntrySize(const TargetData &TD) const {
534 // The size of a jump table entry is 4 bytes unless the entry is just the
535 // address of a block, in which case it is the pointer size.
536 switch (getEntryKind()) {
537 case MachineJumpTableInfo::EK_BlockAddress:
538 return TD.getPointerSize();
539 case MachineJumpTableInfo::EK_GPRel64BlockAddress:
541 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
542 case MachineJumpTableInfo::EK_LabelDifference32:
543 case MachineJumpTableInfo::EK_Custom32:
545 case MachineJumpTableInfo::EK_Inline:
548 llvm_unreachable("Unknown jump table encoding!");
551 /// getEntryAlignment - Return the alignment of each entry in the jump table.
552 unsigned MachineJumpTableInfo::getEntryAlignment(const TargetData &TD) const {
553 // The alignment of a jump table entry is the alignment of int32 unless the
554 // entry is just the address of a block, in which case it is the pointer
556 switch (getEntryKind()) {
557 case MachineJumpTableInfo::EK_BlockAddress:
558 return TD.getPointerABIAlignment();
559 case MachineJumpTableInfo::EK_GPRel64BlockAddress:
560 return TD.getABIIntegerTypeAlignment(64);
561 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
562 case MachineJumpTableInfo::EK_LabelDifference32:
563 case MachineJumpTableInfo::EK_Custom32:
564 return TD.getABIIntegerTypeAlignment(32);
565 case MachineJumpTableInfo::EK_Inline:
568 llvm_unreachable("Unknown jump table encoding!");
571 /// createJumpTableIndex - Create a new jump table entry in the jump table info.
573 unsigned MachineJumpTableInfo::createJumpTableIndex(
574 const std::vector<MachineBasicBlock*> &DestBBs) {
575 assert(!DestBBs.empty() && "Cannot create an empty jump table!");
576 JumpTables.push_back(MachineJumpTableEntry(DestBBs));
577 return JumpTables.size()-1;
580 /// ReplaceMBBInJumpTables - If Old is the target of any jump tables, update
581 /// the jump tables to branch to New instead.
582 bool MachineJumpTableInfo::ReplaceMBBInJumpTables(MachineBasicBlock *Old,
583 MachineBasicBlock *New) {
584 assert(Old != New && "Not making a change?");
585 bool MadeChange = false;
586 for (size_t i = 0, e = JumpTables.size(); i != e; ++i)
587 ReplaceMBBInJumpTable(i, Old, New);
591 /// ReplaceMBBInJumpTable - If Old is a target of the jump tables, update
592 /// the jump table to branch to New instead.
593 bool MachineJumpTableInfo::ReplaceMBBInJumpTable(unsigned Idx,
594 MachineBasicBlock *Old,
595 MachineBasicBlock *New) {
596 assert(Old != New && "Not making a change?");
597 bool MadeChange = false;
598 MachineJumpTableEntry &JTE = JumpTables[Idx];
599 for (size_t j = 0, e = JTE.MBBs.size(); j != e; ++j)
600 if (JTE.MBBs[j] == Old) {
607 void MachineJumpTableInfo::print(raw_ostream &OS) const {
608 if (JumpTables.empty()) return;
610 OS << "Jump Tables:\n";
612 for (unsigned i = 0, e = JumpTables.size(); i != e; ++i) {
613 OS << " jt#" << i << ": ";
614 for (unsigned j = 0, f = JumpTables[i].MBBs.size(); j != f; ++j)
615 OS << " BB#" << JumpTables[i].MBBs[j]->getNumber();
621 void MachineJumpTableInfo::dump() const { print(dbgs()); }
624 //===----------------------------------------------------------------------===//
625 // MachineConstantPool implementation
626 //===----------------------------------------------------------------------===//
628 void MachineConstantPoolValue::anchor() { }
630 Type *MachineConstantPoolEntry::getType() const {
631 if (isMachineConstantPoolEntry())
632 return Val.MachineCPVal->getType();
633 return Val.ConstVal->getType();
637 unsigned MachineConstantPoolEntry::getRelocationInfo() const {
638 if (isMachineConstantPoolEntry())
639 return Val.MachineCPVal->getRelocationInfo();
640 return Val.ConstVal->getRelocationInfo();
643 MachineConstantPool::~MachineConstantPool() {
644 for (unsigned i = 0, e = Constants.size(); i != e; ++i)
645 if (Constants[i].isMachineConstantPoolEntry())
646 delete Constants[i].Val.MachineCPVal;
647 for (DenseSet<MachineConstantPoolValue*>::iterator I =
648 MachineCPVsSharingEntries.begin(), E = MachineCPVsSharingEntries.end();
653 /// CanShareConstantPoolEntry - Test whether the given two constants
654 /// can be allocated the same constant pool entry.
655 static bool CanShareConstantPoolEntry(const Constant *A, const Constant *B,
656 const TargetData *TD) {
657 // Handle the trivial case quickly.
658 if (A == B) return true;
660 // If they have the same type but weren't the same constant, quickly
662 if (A->getType() == B->getType()) return false;
664 // We can't handle structs or arrays.
665 if (isa<StructType>(A->getType()) || isa<ArrayType>(A->getType()) ||
666 isa<StructType>(B->getType()) || isa<ArrayType>(B->getType()))
669 // For now, only support constants with the same size.
670 uint64_t StoreSize = TD->getTypeStoreSize(A->getType());
671 if (StoreSize != TD->getTypeStoreSize(B->getType()) ||
675 Type *IntTy = IntegerType::get(A->getContext(), StoreSize*8);
677 // Try constant folding a bitcast of both instructions to an integer. If we
678 // get two identical ConstantInt's, then we are good to share them. We use
679 // the constant folding APIs to do this so that we get the benefit of
681 if (isa<PointerType>(A->getType()))
682 A = ConstantFoldInstOperands(Instruction::PtrToInt, IntTy,
683 const_cast<Constant*>(A), TD);
684 else if (A->getType() != IntTy)
685 A = ConstantFoldInstOperands(Instruction::BitCast, IntTy,
686 const_cast<Constant*>(A), TD);
687 if (isa<PointerType>(B->getType()))
688 B = ConstantFoldInstOperands(Instruction::PtrToInt, IntTy,
689 const_cast<Constant*>(B), TD);
690 else if (B->getType() != IntTy)
691 B = ConstantFoldInstOperands(Instruction::BitCast, IntTy,
692 const_cast<Constant*>(B), TD);
697 /// getConstantPoolIndex - Create a new entry in the constant pool or return
698 /// an existing one. User must specify the log2 of the minimum required
699 /// alignment for the object.
701 unsigned MachineConstantPool::getConstantPoolIndex(const Constant *C,
702 unsigned Alignment) {
703 assert(Alignment && "Alignment must be specified!");
704 if (Alignment > PoolAlignment) PoolAlignment = Alignment;
706 // Check to see if we already have this constant.
708 // FIXME, this could be made much more efficient for large constant pools.
709 for (unsigned i = 0, e = Constants.size(); i != e; ++i)
710 if (!Constants[i].isMachineConstantPoolEntry() &&
711 CanShareConstantPoolEntry(Constants[i].Val.ConstVal, C, TD)) {
712 if ((unsigned)Constants[i].getAlignment() < Alignment)
713 Constants[i].Alignment = Alignment;
717 Constants.push_back(MachineConstantPoolEntry(C, Alignment));
718 return Constants.size()-1;
721 unsigned MachineConstantPool::getConstantPoolIndex(MachineConstantPoolValue *V,
722 unsigned Alignment) {
723 assert(Alignment && "Alignment must be specified!");
724 if (Alignment > PoolAlignment) PoolAlignment = Alignment;
726 // Check to see if we already have this constant.
728 // FIXME, this could be made much more efficient for large constant pools.
729 int Idx = V->getExistingMachineCPValue(this, Alignment);
731 MachineCPVsSharingEntries.insert(V);
732 return (unsigned)Idx;
735 Constants.push_back(MachineConstantPoolEntry(V, Alignment));
736 return Constants.size()-1;
739 void MachineConstantPool::print(raw_ostream &OS) const {
740 if (Constants.empty()) return;
742 OS << "Constant Pool:\n";
743 for (unsigned i = 0, e = Constants.size(); i != e; ++i) {
744 OS << " cp#" << i << ": ";
745 if (Constants[i].isMachineConstantPoolEntry())
746 Constants[i].Val.MachineCPVal->print(OS);
748 OS << *(Value*)Constants[i].Val.ConstVal;
749 OS << ", align=" << Constants[i].getAlignment();
754 void MachineConstantPool::dump() const { print(dbgs()); }