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/DebugInfo.h"
18 #include "llvm/Function.h"
19 #include "llvm/CodeGen/MachineConstantPool.h"
20 #include "llvm/CodeGen/MachineFunctionPass.h"
21 #include "llvm/CodeGen/MachineFrameInfo.h"
22 #include "llvm/CodeGen/MachineInstr.h"
23 #include "llvm/CodeGen/MachineJumpTableInfo.h"
24 #include "llvm/CodeGen/MachineModuleInfo.h"
25 #include "llvm/CodeGen/MachineRegisterInfo.h"
26 #include "llvm/CodeGen/Passes.h"
27 #include "llvm/MC/MCAsmInfo.h"
28 #include "llvm/MC/MCContext.h"
29 #include "llvm/Analysis/ConstantFolding.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->ensureMaxAlignment(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);
88 FrameInfo->~MachineFrameInfo();
89 Allocator.Deallocate(FrameInfo);
91 ConstantPool->~MachineConstantPool();
92 Allocator.Deallocate(ConstantPool);
95 JumpTableInfo->~MachineJumpTableInfo();
96 Allocator.Deallocate(JumpTableInfo);
100 /// getOrCreateJumpTableInfo - Get the JumpTableInfo for this function, if it
101 /// does already exist, allocate one.
102 MachineJumpTableInfo *MachineFunction::
103 getOrCreateJumpTableInfo(unsigned EntryKind) {
104 if (JumpTableInfo) return JumpTableInfo;
106 JumpTableInfo = new (Allocator)
107 MachineJumpTableInfo((MachineJumpTableInfo::JTEntryKind)EntryKind);
108 return JumpTableInfo;
111 /// RenumberBlocks - This discards all of the MachineBasicBlock numbers and
112 /// recomputes them. This guarantees that the MBB numbers are sequential,
113 /// dense, and match the ordering of the blocks within the function. If a
114 /// specific MachineBasicBlock is specified, only that block and those after
115 /// it are renumbered.
116 void MachineFunction::RenumberBlocks(MachineBasicBlock *MBB) {
117 if (empty()) { MBBNumbering.clear(); return; }
118 MachineFunction::iterator MBBI, E = end();
124 // Figure out the block number this should have.
125 unsigned BlockNo = 0;
127 BlockNo = prior(MBBI)->getNumber()+1;
129 for (; MBBI != E; ++MBBI, ++BlockNo) {
130 if (MBBI->getNumber() != (int)BlockNo) {
131 // Remove use of the old number.
132 if (MBBI->getNumber() != -1) {
133 assert(MBBNumbering[MBBI->getNumber()] == &*MBBI &&
134 "MBB number mismatch!");
135 MBBNumbering[MBBI->getNumber()] = 0;
138 // If BlockNo is already taken, set that block's number to -1.
139 if (MBBNumbering[BlockNo])
140 MBBNumbering[BlockNo]->setNumber(-1);
142 MBBNumbering[BlockNo] = MBBI;
143 MBBI->setNumber(BlockNo);
147 // Okay, all the blocks are renumbered. If we have compactified the block
148 // numbering, shrink MBBNumbering now.
149 assert(BlockNo <= MBBNumbering.size() && "Mismatch!");
150 MBBNumbering.resize(BlockNo);
153 /// CreateMachineInstr - Allocate a new MachineInstr. Use this instead
154 /// of `new MachineInstr'.
157 MachineFunction::CreateMachineInstr(const MCInstrDesc &MCID,
158 DebugLoc DL, bool NoImp) {
159 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
160 MachineInstr(MCID, DL, NoImp);
163 /// CloneMachineInstr - Create a new MachineInstr which is a copy of the
164 /// 'Orig' instruction, identical in all ways except the instruction
165 /// has no parent, prev, or next.
168 MachineFunction::CloneMachineInstr(const MachineInstr *Orig) {
169 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
170 MachineInstr(*this, *Orig);
173 /// DeleteMachineInstr - Delete the given MachineInstr.
176 MachineFunction::DeleteMachineInstr(MachineInstr *MI) {
178 InstructionRecycler.Deallocate(Allocator, MI);
181 /// CreateMachineBasicBlock - Allocate a new MachineBasicBlock. Use this
182 /// instead of `new MachineBasicBlock'.
185 MachineFunction::CreateMachineBasicBlock(const BasicBlock *bb) {
186 return new (BasicBlockRecycler.Allocate<MachineBasicBlock>(Allocator))
187 MachineBasicBlock(*this, bb);
190 /// DeleteMachineBasicBlock - Delete the given MachineBasicBlock.
193 MachineFunction::DeleteMachineBasicBlock(MachineBasicBlock *MBB) {
194 assert(MBB->getParent() == this && "MBB parent mismatch!");
195 MBB->~MachineBasicBlock();
196 BasicBlockRecycler.Deallocate(Allocator, MBB);
200 MachineFunction::getMachineMemOperand(MachinePointerInfo PtrInfo, unsigned f,
201 uint64_t s, unsigned base_alignment,
202 const MDNode *TBAAInfo,
203 const MDNode *Ranges) {
204 return new (Allocator) MachineMemOperand(PtrInfo, f, s, base_alignment,
209 MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO,
210 int64_t Offset, uint64_t Size) {
211 return new (Allocator)
212 MachineMemOperand(MachinePointerInfo(MMO->getValue(),
213 MMO->getOffset()+Offset),
214 MMO->getFlags(), Size,
215 MMO->getBaseAlignment(), 0);
218 MachineInstr::mmo_iterator
219 MachineFunction::allocateMemRefsArray(unsigned long Num) {
220 return Allocator.Allocate<MachineMemOperand *>(Num);
223 std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
224 MachineFunction::extractLoadMemRefs(MachineInstr::mmo_iterator Begin,
225 MachineInstr::mmo_iterator End) {
226 // Count the number of load mem refs.
228 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
232 // Allocate a new array and populate it with the load information.
233 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
235 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
236 if ((*I)->isLoad()) {
237 if (!(*I)->isStore())
241 // Clone the MMO and unset the store flag.
242 MachineMemOperand *JustLoad =
243 getMachineMemOperand((*I)->getPointerInfo(),
244 (*I)->getFlags() & ~MachineMemOperand::MOStore,
245 (*I)->getSize(), (*I)->getBaseAlignment(),
246 (*I)->getTBAAInfo());
247 Result[Index] = JustLoad;
252 return std::make_pair(Result, Result + Num);
255 std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
256 MachineFunction::extractStoreMemRefs(MachineInstr::mmo_iterator Begin,
257 MachineInstr::mmo_iterator End) {
258 // Count the number of load mem refs.
260 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
264 // Allocate a new array and populate it with the store information.
265 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
267 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
268 if ((*I)->isStore()) {
273 // Clone the MMO and unset the load flag.
274 MachineMemOperand *JustStore =
275 getMachineMemOperand((*I)->getPointerInfo(),
276 (*I)->getFlags() & ~MachineMemOperand::MOLoad,
277 (*I)->getSize(), (*I)->getBaseAlignment(),
278 (*I)->getTBAAInfo());
279 Result[Index] = JustStore;
284 return std::make_pair(Result, Result + Num);
287 void MachineFunction::dump() const {
291 StringRef MachineFunction::getName() const {
292 assert(getFunction() && "No function!");
293 return getFunction()->getName();
296 void MachineFunction::print(raw_ostream &OS, SlotIndexes *Indexes) const {
297 OS << "# Machine code for function " << getName() << ": ";
299 OS << (RegInfo->isSSA() ? "SSA" : "Post SSA");
300 if (!RegInfo->tracksLiveness())
301 OS << ", not tracking liveness";
305 // Print Frame Information
306 FrameInfo->print(*this, OS);
308 // Print JumpTable Information
310 JumpTableInfo->print(OS);
312 // Print Constant Pool
313 ConstantPool->print(OS);
315 const TargetRegisterInfo *TRI = getTarget().getRegisterInfo();
317 if (RegInfo && !RegInfo->livein_empty()) {
318 OS << "Function Live Ins: ";
319 for (MachineRegisterInfo::livein_iterator
320 I = RegInfo->livein_begin(), E = RegInfo->livein_end(); I != E; ++I) {
321 OS << PrintReg(I->first, TRI);
323 OS << " in " << PrintReg(I->second, TRI);
324 if (llvm::next(I) != E)
329 if (RegInfo && !RegInfo->liveout_empty()) {
330 OS << "Function Live Outs:";
331 for (MachineRegisterInfo::liveout_iterator
332 I = RegInfo->liveout_begin(), E = RegInfo->liveout_end(); I != E; ++I)
333 OS << ' ' << PrintReg(*I, TRI);
337 for (const_iterator BB = begin(), E = end(); BB != E; ++BB) {
339 BB->print(OS, Indexes);
342 OS << "\n# End machine code for function " << getName() << ".\n\n";
347 struct DOTGraphTraits<const MachineFunction*> : public DefaultDOTGraphTraits {
349 DOTGraphTraits (bool isSimple=false) : DefaultDOTGraphTraits(isSimple) {}
351 static std::string getGraphName(const MachineFunction *F) {
352 return "CFG for '" + F->getName().str() + "' function";
355 std::string getNodeLabel(const MachineBasicBlock *Node,
356 const MachineFunction *Graph) {
359 raw_string_ostream OSS(OutStr);
362 OSS << "BB#" << Node->getNumber();
363 if (const BasicBlock *BB = Node->getBasicBlock())
364 OSS << ": " << BB->getName();
369 if (OutStr[0] == '\n') OutStr.erase(OutStr.begin());
371 // Process string output to make it nicer...
372 for (unsigned i = 0; i != OutStr.length(); ++i)
373 if (OutStr[i] == '\n') { // Left justify
375 OutStr.insert(OutStr.begin()+i+1, 'l');
382 void MachineFunction::viewCFG() const
385 ViewGraph(this, "mf" + getName());
387 errs() << "MachineFunction::viewCFG is only available in debug builds on "
388 << "systems with Graphviz or gv!\n";
392 void MachineFunction::viewCFGOnly() const
395 ViewGraph(this, "mf" + getName(), true);
397 errs() << "MachineFunction::viewCFGOnly is only available in debug builds on "
398 << "systems with Graphviz or gv!\n";
402 /// addLiveIn - Add the specified physical register as a live-in value and
403 /// create a corresponding virtual register for it.
404 unsigned MachineFunction::addLiveIn(unsigned PReg,
405 const TargetRegisterClass *RC) {
406 MachineRegisterInfo &MRI = getRegInfo();
407 unsigned VReg = MRI.getLiveInVirtReg(PReg);
409 assert(MRI.getRegClass(VReg) == RC && "Register class mismatch!");
412 VReg = MRI.createVirtualRegister(RC);
413 MRI.addLiveIn(PReg, VReg);
417 /// getJTISymbol - Return the MCSymbol for the specified non-empty jump table.
418 /// If isLinkerPrivate is specified, an 'l' label is returned, otherwise a
419 /// normal 'L' label is returned.
420 MCSymbol *MachineFunction::getJTISymbol(unsigned JTI, MCContext &Ctx,
421 bool isLinkerPrivate) const {
422 assert(JumpTableInfo && "No jump tables");
423 assert(JTI < JumpTableInfo->getJumpTables().size() && "Invalid JTI!");
424 const MCAsmInfo &MAI = *getTarget().getMCAsmInfo();
426 const char *Prefix = isLinkerPrivate ? MAI.getLinkerPrivateGlobalPrefix() :
427 MAI.getPrivateGlobalPrefix();
428 SmallString<60> Name;
429 raw_svector_ostream(Name)
430 << Prefix << "JTI" << getFunctionNumber() << '_' << JTI;
431 return Ctx.GetOrCreateSymbol(Name.str());
434 /// getPICBaseSymbol - Return a function-local symbol to represent the PIC
436 MCSymbol *MachineFunction::getPICBaseSymbol() const {
437 const MCAsmInfo &MAI = *Target.getMCAsmInfo();
438 return Ctx.GetOrCreateSymbol(Twine(MAI.getPrivateGlobalPrefix())+
439 Twine(getFunctionNumber())+"$pb");
442 //===----------------------------------------------------------------------===//
443 // MachineFrameInfo implementation
444 //===----------------------------------------------------------------------===//
446 /// CreateFixedObject - Create a new object at a fixed location on the stack.
447 /// All fixed objects should be created before other objects are created for
448 /// efficiency. By default, fixed objects are immutable. This returns an
449 /// index with a negative value.
451 int MachineFrameInfo::CreateFixedObject(uint64_t Size, int64_t SPOffset,
453 assert(Size != 0 && "Cannot allocate zero size fixed stack objects!");
454 // The alignment of the frame index can be determined from its offset from
455 // the incoming frame position. If the frame object is at offset 32 and
456 // the stack is guaranteed to be 16-byte aligned, then we know that the
457 // object is 16-byte aligned.
458 unsigned StackAlign = TFI.getStackAlignment();
459 unsigned Align = MinAlign(SPOffset, StackAlign);
460 Objects.insert(Objects.begin(), StackObject(Size, Align, SPOffset, Immutable,
464 return -++NumFixedObjects;
469 MachineFrameInfo::getPristineRegs(const MachineBasicBlock *MBB) const {
470 assert(MBB && "MBB must be valid");
471 const MachineFunction *MF = MBB->getParent();
472 assert(MF && "MBB must be part of a MachineFunction");
473 const TargetMachine &TM = MF->getTarget();
474 const TargetRegisterInfo *TRI = TM.getRegisterInfo();
475 BitVector BV(TRI->getNumRegs());
477 // Before CSI is calculated, no registers are considered pristine. They can be
478 // freely used and PEI will make sure they are saved.
479 if (!isCalleeSavedInfoValid())
482 for (const uint16_t *CSR = TRI->getCalleeSavedRegs(MF); CSR && *CSR; ++CSR)
485 // The entry MBB always has all CSRs pristine.
486 if (MBB == &MF->front())
489 // On other MBBs the saved CSRs are not pristine.
490 const std::vector<CalleeSavedInfo> &CSI = getCalleeSavedInfo();
491 for (std::vector<CalleeSavedInfo>::const_iterator I = CSI.begin(),
492 E = CSI.end(); I != E; ++I)
493 BV.reset(I->getReg());
499 void MachineFrameInfo::print(const MachineFunction &MF, raw_ostream &OS) const{
500 if (Objects.empty()) return;
502 const TargetFrameLowering *FI = MF.getTarget().getFrameLowering();
503 int ValOffset = (FI ? FI->getOffsetOfLocalArea() : 0);
505 OS << "Frame Objects:\n";
507 for (unsigned i = 0, e = Objects.size(); i != e; ++i) {
508 const StackObject &SO = Objects[i];
509 OS << " fi#" << (int)(i-NumFixedObjects) << ": ";
510 if (SO.Size == ~0ULL) {
515 OS << "variable sized";
517 OS << "size=" << SO.Size;
518 OS << ", align=" << SO.Alignment;
520 if (i < NumFixedObjects)
522 if (i < NumFixedObjects || SO.SPOffset != -1) {
523 int64_t Off = SO.SPOffset - ValOffset;
524 OS << ", at location [SP";
535 void MachineFrameInfo::dump(const MachineFunction &MF) const {
539 //===----------------------------------------------------------------------===//
540 // MachineJumpTableInfo implementation
541 //===----------------------------------------------------------------------===//
543 /// getEntrySize - Return the size of each entry in the jump table.
544 unsigned MachineJumpTableInfo::getEntrySize(const TargetData &TD) const {
545 // The size of a jump table entry is 4 bytes unless the entry is just the
546 // address of a block, in which case it is the pointer size.
547 switch (getEntryKind()) {
548 case MachineJumpTableInfo::EK_BlockAddress:
549 return TD.getPointerSize();
550 case MachineJumpTableInfo::EK_GPRel64BlockAddress:
552 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
553 case MachineJumpTableInfo::EK_LabelDifference32:
554 case MachineJumpTableInfo::EK_Custom32:
556 case MachineJumpTableInfo::EK_Inline:
559 llvm_unreachable("Unknown jump table encoding!");
562 /// getEntryAlignment - Return the alignment of each entry in the jump table.
563 unsigned MachineJumpTableInfo::getEntryAlignment(const TargetData &TD) const {
564 // The alignment of a jump table entry is the alignment of int32 unless the
565 // entry is just the address of a block, in which case it is the pointer
567 switch (getEntryKind()) {
568 case MachineJumpTableInfo::EK_BlockAddress:
569 return TD.getPointerABIAlignment();
570 case MachineJumpTableInfo::EK_GPRel64BlockAddress:
571 return TD.getABIIntegerTypeAlignment(64);
572 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
573 case MachineJumpTableInfo::EK_LabelDifference32:
574 case MachineJumpTableInfo::EK_Custom32:
575 return TD.getABIIntegerTypeAlignment(32);
576 case MachineJumpTableInfo::EK_Inline:
579 llvm_unreachable("Unknown jump table encoding!");
582 /// createJumpTableIndex - Create a new jump table entry in the jump table info.
584 unsigned MachineJumpTableInfo::createJumpTableIndex(
585 const std::vector<MachineBasicBlock*> &DestBBs) {
586 assert(!DestBBs.empty() && "Cannot create an empty jump table!");
587 JumpTables.push_back(MachineJumpTableEntry(DestBBs));
588 return JumpTables.size()-1;
591 /// ReplaceMBBInJumpTables - If Old is the target of any jump tables, update
592 /// the jump tables to branch to New instead.
593 bool MachineJumpTableInfo::ReplaceMBBInJumpTables(MachineBasicBlock *Old,
594 MachineBasicBlock *New) {
595 assert(Old != New && "Not making a change?");
596 bool MadeChange = false;
597 for (size_t i = 0, e = JumpTables.size(); i != e; ++i)
598 ReplaceMBBInJumpTable(i, Old, New);
602 /// ReplaceMBBInJumpTable - If Old is a target of the jump tables, update
603 /// the jump table to branch to New instead.
604 bool MachineJumpTableInfo::ReplaceMBBInJumpTable(unsigned Idx,
605 MachineBasicBlock *Old,
606 MachineBasicBlock *New) {
607 assert(Old != New && "Not making a change?");
608 bool MadeChange = false;
609 MachineJumpTableEntry &JTE = JumpTables[Idx];
610 for (size_t j = 0, e = JTE.MBBs.size(); j != e; ++j)
611 if (JTE.MBBs[j] == Old) {
618 void MachineJumpTableInfo::print(raw_ostream &OS) const {
619 if (JumpTables.empty()) return;
621 OS << "Jump Tables:\n";
623 for (unsigned i = 0, e = JumpTables.size(); i != e; ++i) {
624 OS << " jt#" << i << ": ";
625 for (unsigned j = 0, f = JumpTables[i].MBBs.size(); j != f; ++j)
626 OS << " BB#" << JumpTables[i].MBBs[j]->getNumber();
632 void MachineJumpTableInfo::dump() const { print(dbgs()); }
635 //===----------------------------------------------------------------------===//
636 // MachineConstantPool implementation
637 //===----------------------------------------------------------------------===//
639 void MachineConstantPoolValue::anchor() { }
641 Type *MachineConstantPoolEntry::getType() const {
642 if (isMachineConstantPoolEntry())
643 return Val.MachineCPVal->getType();
644 return Val.ConstVal->getType();
648 unsigned MachineConstantPoolEntry::getRelocationInfo() const {
649 if (isMachineConstantPoolEntry())
650 return Val.MachineCPVal->getRelocationInfo();
651 return Val.ConstVal->getRelocationInfo();
654 MachineConstantPool::~MachineConstantPool() {
655 for (unsigned i = 0, e = Constants.size(); i != e; ++i)
656 if (Constants[i].isMachineConstantPoolEntry())
657 delete Constants[i].Val.MachineCPVal;
658 for (DenseSet<MachineConstantPoolValue*>::iterator I =
659 MachineCPVsSharingEntries.begin(), E = MachineCPVsSharingEntries.end();
664 /// CanShareConstantPoolEntry - Test whether the given two constants
665 /// can be allocated the same constant pool entry.
666 static bool CanShareConstantPoolEntry(const Constant *A, const Constant *B,
667 const TargetData *TD) {
668 // Handle the trivial case quickly.
669 if (A == B) return true;
671 // If they have the same type but weren't the same constant, quickly
673 if (A->getType() == B->getType()) return false;
675 // We can't handle structs or arrays.
676 if (isa<StructType>(A->getType()) || isa<ArrayType>(A->getType()) ||
677 isa<StructType>(B->getType()) || isa<ArrayType>(B->getType()))
680 // For now, only support constants with the same size.
681 uint64_t StoreSize = TD->getTypeStoreSize(A->getType());
682 if (StoreSize != TD->getTypeStoreSize(B->getType()) ||
686 Type *IntTy = IntegerType::get(A->getContext(), StoreSize*8);
688 // Try constant folding a bitcast of both instructions to an integer. If we
689 // get two identical ConstantInt's, then we are good to share them. We use
690 // the constant folding APIs to do this so that we get the benefit of
692 if (isa<PointerType>(A->getType()))
693 A = ConstantFoldInstOperands(Instruction::PtrToInt, IntTy,
694 const_cast<Constant*>(A), TD);
695 else if (A->getType() != IntTy)
696 A = ConstantFoldInstOperands(Instruction::BitCast, IntTy,
697 const_cast<Constant*>(A), TD);
698 if (isa<PointerType>(B->getType()))
699 B = ConstantFoldInstOperands(Instruction::PtrToInt, IntTy,
700 const_cast<Constant*>(B), TD);
701 else if (B->getType() != IntTy)
702 B = ConstantFoldInstOperands(Instruction::BitCast, IntTy,
703 const_cast<Constant*>(B), TD);
708 /// getConstantPoolIndex - Create a new entry in the constant pool or return
709 /// an existing one. User must specify the log2 of the minimum required
710 /// alignment for the object.
712 unsigned MachineConstantPool::getConstantPoolIndex(const Constant *C,
713 unsigned Alignment) {
714 assert(Alignment && "Alignment must be specified!");
715 if (Alignment > PoolAlignment) PoolAlignment = Alignment;
717 // Check to see if we already have this constant.
719 // FIXME, this could be made much more efficient for large constant pools.
720 for (unsigned i = 0, e = Constants.size(); i != e; ++i)
721 if (!Constants[i].isMachineConstantPoolEntry() &&
722 CanShareConstantPoolEntry(Constants[i].Val.ConstVal, C, TD)) {
723 if ((unsigned)Constants[i].getAlignment() < Alignment)
724 Constants[i].Alignment = Alignment;
728 Constants.push_back(MachineConstantPoolEntry(C, Alignment));
729 return Constants.size()-1;
732 unsigned MachineConstantPool::getConstantPoolIndex(MachineConstantPoolValue *V,
733 unsigned Alignment) {
734 assert(Alignment && "Alignment must be specified!");
735 if (Alignment > PoolAlignment) PoolAlignment = Alignment;
737 // Check to see if we already have this constant.
739 // FIXME, this could be made much more efficient for large constant pools.
740 int Idx = V->getExistingMachineCPValue(this, Alignment);
742 MachineCPVsSharingEntries.insert(V);
743 return (unsigned)Idx;
746 Constants.push_back(MachineConstantPoolEntry(V, Alignment));
747 return Constants.size()-1;
750 void MachineConstantPool::print(raw_ostream &OS) const {
751 if (Constants.empty()) return;
753 OS << "Constant Pool:\n";
754 for (unsigned i = 0, e = Constants.size(); i != e; ++i) {
755 OS << " cp#" << i << ": ";
756 if (Constants[i].isMachineConstantPoolEntry())
757 Constants[i].Val.MachineCPVal->print(OS);
759 OS << *(const Value*)Constants[i].Val.ConstVal;
760 OS << ", align=" << Constants[i].getAlignment();
765 void MachineConstantPool::dump() const { print(dbgs()); }