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/DerivedTypes.h"
17 #include "llvm/Function.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/CodeGen/MachineConstantPool.h"
20 #include "llvm/CodeGen/MachineFunction.h"
21 #include "llvm/CodeGen/MachineFunctionPass.h"
22 #include "llvm/CodeGen/MachineFrameInfo.h"
23 #include "llvm/CodeGen/MachineInstr.h"
24 #include "llvm/CodeGen/MachineJumpTableInfo.h"
25 #include "llvm/CodeGen/MachineModuleInfo.h"
26 #include "llvm/CodeGen/MachineRegisterInfo.h"
27 #include "llvm/CodeGen/Passes.h"
28 #include "llvm/MC/MCAsmInfo.h"
29 #include "llvm/MC/MCContext.h"
30 #include "llvm/Analysis/DebugInfo.h"
31 #include "llvm/Support/Debug.h"
32 #include "llvm/Target/TargetData.h"
33 #include "llvm/Target/TargetLowering.h"
34 #include "llvm/Target/TargetMachine.h"
35 #include "llvm/Target/TargetFrameLowering.h"
36 #include "llvm/ADT/SmallString.h"
37 #include "llvm/ADT/STLExtras.h"
38 #include "llvm/Support/GraphWriter.h"
39 #include "llvm/Support/raw_ostream.h"
42 //===----------------------------------------------------------------------===//
43 // MachineFunction implementation
44 //===----------------------------------------------------------------------===//
46 // Out of line virtual method.
47 MachineFunctionInfo::~MachineFunctionInfo() {}
49 void ilist_traits<MachineBasicBlock>::deleteNode(MachineBasicBlock *MBB) {
50 MBB->getParent()->DeleteMachineBasicBlock(MBB);
53 MachineFunction::MachineFunction(const Function *F, const TargetMachine &TM,
54 unsigned FunctionNum, MachineModuleInfo &mmi,
56 : Fn(F), Target(TM), Ctx(mmi.getContext()), MMI(mmi), GMI(gmi) {
57 if (TM.getRegisterInfo())
58 RegInfo = new (Allocator) MachineRegisterInfo(*TM.getRegisterInfo());
62 FrameInfo = new (Allocator) MachineFrameInfo(*TM.getFrameLowering());
63 if (Fn->hasFnAttr(Attribute::StackAlignment))
64 FrameInfo->setMaxAlignment(Attribute::getStackAlignmentFromAttrs(
65 Fn->getAttributes().getFnAttributes()));
66 ConstantPool = new (Allocator) MachineConstantPool(TM.getTargetData());
67 Alignment = TM.getTargetLowering()->getMinFunctionAlignment();
68 // FIXME: Shouldn't use pref alignment if explicit alignment is set on Fn.
69 if (!Fn->hasFnAttr(Attribute::OptimizeForSize))
70 Alignment = std::max(Alignment,
71 TM.getTargetLowering()->getPrefFunctionAlignment());
72 FunctionNumber = FunctionNum;
76 MachineFunction::~MachineFunction() {
78 InstructionRecycler.clear(Allocator);
79 BasicBlockRecycler.clear(Allocator);
81 RegInfo->~MachineRegisterInfo();
82 Allocator.Deallocate(RegInfo);
85 MFInfo->~MachineFunctionInfo();
86 Allocator.Deallocate(MFInfo);
88 FrameInfo->~MachineFrameInfo(); Allocator.Deallocate(FrameInfo);
89 ConstantPool->~MachineConstantPool(); Allocator.Deallocate(ConstantPool);
92 JumpTableInfo->~MachineJumpTableInfo();
93 Allocator.Deallocate(JumpTableInfo);
97 /// getOrCreateJumpTableInfo - Get the JumpTableInfo for this function, if it
98 /// does already exist, allocate one.
99 MachineJumpTableInfo *MachineFunction::
100 getOrCreateJumpTableInfo(unsigned EntryKind) {
101 if (JumpTableInfo) return JumpTableInfo;
103 JumpTableInfo = new (Allocator)
104 MachineJumpTableInfo((MachineJumpTableInfo::JTEntryKind)EntryKind);
105 return JumpTableInfo;
108 /// RenumberBlocks - This discards all of the MachineBasicBlock numbers and
109 /// recomputes them. This guarantees that the MBB numbers are sequential,
110 /// dense, and match the ordering of the blocks within the function. If a
111 /// specific MachineBasicBlock is specified, only that block and those after
112 /// it are renumbered.
113 void MachineFunction::RenumberBlocks(MachineBasicBlock *MBB) {
114 if (empty()) { MBBNumbering.clear(); return; }
115 MachineFunction::iterator MBBI, E = end();
121 // Figure out the block number this should have.
122 unsigned BlockNo = 0;
124 BlockNo = prior(MBBI)->getNumber()+1;
126 for (; MBBI != E; ++MBBI, ++BlockNo) {
127 if (MBBI->getNumber() != (int)BlockNo) {
128 // Remove use of the old number.
129 if (MBBI->getNumber() != -1) {
130 assert(MBBNumbering[MBBI->getNumber()] == &*MBBI &&
131 "MBB number mismatch!");
132 MBBNumbering[MBBI->getNumber()] = 0;
135 // If BlockNo is already taken, set that block's number to -1.
136 if (MBBNumbering[BlockNo])
137 MBBNumbering[BlockNo]->setNumber(-1);
139 MBBNumbering[BlockNo] = MBBI;
140 MBBI->setNumber(BlockNo);
144 // Okay, all the blocks are renumbered. If we have compactified the block
145 // numbering, shrink MBBNumbering now.
146 assert(BlockNo <= MBBNumbering.size() && "Mismatch!");
147 MBBNumbering.resize(BlockNo);
150 /// CreateMachineInstr - Allocate a new MachineInstr. Use this instead
151 /// of `new MachineInstr'.
154 MachineFunction::CreateMachineInstr(const MCInstrDesc &MCID,
155 DebugLoc DL, bool NoImp) {
156 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
157 MachineInstr(MCID, DL, NoImp);
160 /// CloneMachineInstr - Create a new MachineInstr which is a copy of the
161 /// 'Orig' instruction, identical in all ways except the instruction
162 /// has no parent, prev, or next.
165 MachineFunction::CloneMachineInstr(const MachineInstr *Orig) {
166 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
167 MachineInstr(*this, *Orig);
170 /// DeleteMachineInstr - Delete the given MachineInstr.
173 MachineFunction::DeleteMachineInstr(MachineInstr *MI) {
175 InstructionRecycler.Deallocate(Allocator, MI);
178 /// CreateMachineBasicBlock - Allocate a new MachineBasicBlock. Use this
179 /// instead of `new MachineBasicBlock'.
182 MachineFunction::CreateMachineBasicBlock(const BasicBlock *bb) {
183 return new (BasicBlockRecycler.Allocate<MachineBasicBlock>(Allocator))
184 MachineBasicBlock(*this, bb);
187 /// DeleteMachineBasicBlock - Delete the given MachineBasicBlock.
190 MachineFunction::DeleteMachineBasicBlock(MachineBasicBlock *MBB) {
191 assert(MBB->getParent() == this && "MBB parent mismatch!");
192 MBB->~MachineBasicBlock();
193 BasicBlockRecycler.Deallocate(Allocator, MBB);
197 MachineFunction::getMachineMemOperand(MachinePointerInfo PtrInfo, unsigned f,
198 uint64_t s, unsigned base_alignment,
199 const MDNode *TBAAInfo) {
200 return new (Allocator) MachineMemOperand(PtrInfo, f, s, base_alignment,
205 MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO,
206 int64_t Offset, uint64_t Size) {
207 return new (Allocator)
208 MachineMemOperand(MachinePointerInfo(MMO->getValue(),
209 MMO->getOffset()+Offset),
210 MMO->getFlags(), Size,
211 MMO->getBaseAlignment(), 0);
214 MachineInstr::mmo_iterator
215 MachineFunction::allocateMemRefsArray(unsigned long Num) {
216 return Allocator.Allocate<MachineMemOperand *>(Num);
219 std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
220 MachineFunction::extractLoadMemRefs(MachineInstr::mmo_iterator Begin,
221 MachineInstr::mmo_iterator End) {
222 // Count the number of load mem refs.
224 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
228 // Allocate a new array and populate it with the load information.
229 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
231 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
232 if ((*I)->isLoad()) {
233 if (!(*I)->isStore())
237 // Clone the MMO and unset the store flag.
238 MachineMemOperand *JustLoad =
239 getMachineMemOperand((*I)->getPointerInfo(),
240 (*I)->getFlags() & ~MachineMemOperand::MOStore,
241 (*I)->getSize(), (*I)->getBaseAlignment(),
242 (*I)->getTBAAInfo());
243 Result[Index] = JustLoad;
248 return std::make_pair(Result, Result + Num);
251 std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
252 MachineFunction::extractStoreMemRefs(MachineInstr::mmo_iterator Begin,
253 MachineInstr::mmo_iterator End) {
254 // Count the number of load mem refs.
256 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
260 // Allocate a new array and populate it with the store information.
261 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
263 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
264 if ((*I)->isStore()) {
269 // Clone the MMO and unset the load flag.
270 MachineMemOperand *JustStore =
271 getMachineMemOperand((*I)->getPointerInfo(),
272 (*I)->getFlags() & ~MachineMemOperand::MOLoad,
273 (*I)->getSize(), (*I)->getBaseAlignment(),
274 (*I)->getTBAAInfo());
275 Result[Index] = JustStore;
280 return std::make_pair(Result, Result + Num);
283 void MachineFunction::dump() const {
287 void MachineFunction::print(raw_ostream &OS, SlotIndexes *Indexes) const {
288 OS << "# Machine code for function " << Fn->getName() << ":\n";
290 // Print Frame Information
291 FrameInfo->print(*this, OS);
293 // Print JumpTable Information
295 JumpTableInfo->print(OS);
297 // Print Constant Pool
298 ConstantPool->print(OS);
300 const TargetRegisterInfo *TRI = getTarget().getRegisterInfo();
302 if (RegInfo && !RegInfo->livein_empty()) {
303 OS << "Function Live Ins: ";
304 for (MachineRegisterInfo::livein_iterator
305 I = RegInfo->livein_begin(), E = RegInfo->livein_end(); I != E; ++I) {
306 OS << PrintReg(I->first, TRI);
308 OS << " in " << PrintReg(I->second, TRI);
309 if (llvm::next(I) != E)
314 if (RegInfo && !RegInfo->liveout_empty()) {
315 OS << "Function Live Outs:";
316 for (MachineRegisterInfo::liveout_iterator
317 I = RegInfo->liveout_begin(), E = RegInfo->liveout_end(); I != E; ++I)
318 OS << ' ' << PrintReg(*I, TRI);
322 for (const_iterator BB = begin(), E = end(); BB != E; ++BB) {
324 BB->print(OS, Indexes);
327 OS << "\n# End machine code for function " << Fn->getName() << ".\n\n";
332 struct DOTGraphTraits<const MachineFunction*> : public DefaultDOTGraphTraits {
334 DOTGraphTraits (bool isSimple=false) : DefaultDOTGraphTraits(isSimple) {}
336 static std::string getGraphName(const MachineFunction *F) {
337 return "CFG for '" + F->getFunction()->getName().str() + "' function";
340 std::string getNodeLabel(const MachineBasicBlock *Node,
341 const MachineFunction *Graph) {
344 raw_string_ostream OSS(OutStr);
347 OSS << "BB#" << Node->getNumber();
348 if (const BasicBlock *BB = Node->getBasicBlock())
349 OSS << ": " << BB->getName();
354 if (OutStr[0] == '\n') OutStr.erase(OutStr.begin());
356 // Process string output to make it nicer...
357 for (unsigned i = 0; i != OutStr.length(); ++i)
358 if (OutStr[i] == '\n') { // Left justify
360 OutStr.insert(OutStr.begin()+i+1, 'l');
367 void MachineFunction::viewCFG() const
370 ViewGraph(this, "mf" + getFunction()->getName());
372 errs() << "MachineFunction::viewCFG is only available in debug builds on "
373 << "systems with Graphviz or gv!\n";
377 void MachineFunction::viewCFGOnly() const
380 ViewGraph(this, "mf" + getFunction()->getName(), true);
382 errs() << "MachineFunction::viewCFGOnly is only available in debug builds on "
383 << "systems with Graphviz or gv!\n";
387 /// addLiveIn - Add the specified physical register as a live-in value and
388 /// create a corresponding virtual register for it.
389 unsigned MachineFunction::addLiveIn(unsigned PReg,
390 const TargetRegisterClass *RC) {
391 MachineRegisterInfo &MRI = getRegInfo();
392 unsigned VReg = MRI.getLiveInVirtReg(PReg);
394 assert(MRI.getRegClass(VReg) == RC && "Register class mismatch!");
397 VReg = MRI.createVirtualRegister(RC);
398 MRI.addLiveIn(PReg, VReg);
402 /// getJTISymbol - Return the MCSymbol for the specified non-empty jump table.
403 /// If isLinkerPrivate is specified, an 'l' label is returned, otherwise a
404 /// normal 'L' label is returned.
405 MCSymbol *MachineFunction::getJTISymbol(unsigned JTI, MCContext &Ctx,
406 bool isLinkerPrivate) const {
407 assert(JumpTableInfo && "No jump tables");
409 assert(JTI < JumpTableInfo->getJumpTables().size() && "Invalid JTI!");
410 const MCAsmInfo &MAI = *getTarget().getMCAsmInfo();
412 const char *Prefix = isLinkerPrivate ? MAI.getLinkerPrivateGlobalPrefix() :
413 MAI.getPrivateGlobalPrefix();
414 SmallString<60> Name;
415 raw_svector_ostream(Name)
416 << Prefix << "JTI" << getFunctionNumber() << '_' << JTI;
417 return Ctx.GetOrCreateSymbol(Name.str());
420 /// getPICBaseSymbol - Return a function-local symbol to represent the PIC
422 MCSymbol *MachineFunction::getPICBaseSymbol() const {
423 const MCAsmInfo &MAI = *Target.getMCAsmInfo();
424 return Ctx.GetOrCreateSymbol(Twine(MAI.getPrivateGlobalPrefix())+
425 Twine(getFunctionNumber())+"$pb");
428 //===----------------------------------------------------------------------===//
429 // MachineFrameInfo implementation
430 //===----------------------------------------------------------------------===//
432 /// CreateFixedObject - Create a new object at a fixed location on the stack.
433 /// All fixed objects should be created before other objects are created for
434 /// efficiency. By default, fixed objects are immutable. This returns an
435 /// index with a negative value.
437 int MachineFrameInfo::CreateFixedObject(uint64_t Size, int64_t SPOffset,
439 assert(Size != 0 && "Cannot allocate zero size fixed stack objects!");
440 // The alignment of the frame index can be determined from its offset from
441 // the incoming frame position. If the frame object is at offset 32 and
442 // the stack is guaranteed to be 16-byte aligned, then we know that the
443 // object is 16-byte aligned.
444 unsigned StackAlign = TFI.getStackAlignment();
445 unsigned Align = MinAlign(SPOffset, StackAlign);
446 Objects.insert(Objects.begin(), StackObject(Size, Align, SPOffset, Immutable,
447 /*isSS*/false, false));
448 return -++NumFixedObjects;
453 MachineFrameInfo::getPristineRegs(const MachineBasicBlock *MBB) const {
454 assert(MBB && "MBB must be valid");
455 const MachineFunction *MF = MBB->getParent();
456 assert(MF && "MBB must be part of a MachineFunction");
457 const TargetMachine &TM = MF->getTarget();
458 const TargetRegisterInfo *TRI = TM.getRegisterInfo();
459 BitVector BV(TRI->getNumRegs());
461 // Before CSI is calculated, no registers are considered pristine. They can be
462 // freely used and PEI will make sure they are saved.
463 if (!isCalleeSavedInfoValid())
466 for (const unsigned *CSR = TRI->getCalleeSavedRegs(MF); CSR && *CSR; ++CSR)
469 // The entry MBB always has all CSRs pristine.
470 if (MBB == &MF->front())
473 // On other MBBs the saved CSRs are not pristine.
474 const std::vector<CalleeSavedInfo> &CSI = getCalleeSavedInfo();
475 for (std::vector<CalleeSavedInfo>::const_iterator I = CSI.begin(),
476 E = CSI.end(); I != E; ++I)
477 BV.reset(I->getReg());
483 void MachineFrameInfo::print(const MachineFunction &MF, raw_ostream &OS) const{
484 if (Objects.empty()) return;
486 const TargetFrameLowering *FI = MF.getTarget().getFrameLowering();
487 int ValOffset = (FI ? FI->getOffsetOfLocalArea() : 0);
489 OS << "Frame Objects:\n";
491 for (unsigned i = 0, e = Objects.size(); i != e; ++i) {
492 const StackObject &SO = Objects[i];
493 OS << " fi#" << (int)(i-NumFixedObjects) << ": ";
494 if (SO.Size == ~0ULL) {
499 OS << "variable sized";
501 OS << "size=" << SO.Size;
502 OS << ", align=" << SO.Alignment;
504 if (i < NumFixedObjects)
506 if (i < NumFixedObjects || SO.SPOffset != -1) {
507 int64_t Off = SO.SPOffset - ValOffset;
508 OS << ", at location [SP";
519 void MachineFrameInfo::dump(const MachineFunction &MF) const {
523 //===----------------------------------------------------------------------===//
524 // MachineJumpTableInfo implementation
525 //===----------------------------------------------------------------------===//
527 /// getEntrySize - Return the size of each entry in the jump table.
528 unsigned MachineJumpTableInfo::getEntrySize(const TargetData &TD) const {
529 // The size of a jump table entry is 4 bytes unless the entry is just the
530 // address of a block, in which case it is the pointer size.
531 switch (getEntryKind()) {
532 case MachineJumpTableInfo::EK_BlockAddress:
533 return TD.getPointerSize();
534 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
535 case MachineJumpTableInfo::EK_LabelDifference32:
536 case MachineJumpTableInfo::EK_Custom32:
538 case MachineJumpTableInfo::EK_Inline:
541 assert(0 && "Unknown jump table encoding!");
545 /// getEntryAlignment - Return the alignment of each entry in the jump table.
546 unsigned MachineJumpTableInfo::getEntryAlignment(const TargetData &TD) const {
547 // The alignment of a jump table entry is the alignment of int32 unless the
548 // entry is just the address of a block, in which case it is the pointer
550 switch (getEntryKind()) {
551 case MachineJumpTableInfo::EK_BlockAddress:
552 return TD.getPointerABIAlignment();
553 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
554 case MachineJumpTableInfo::EK_LabelDifference32:
555 case MachineJumpTableInfo::EK_Custom32:
556 return TD.getABIIntegerTypeAlignment(32);
557 case MachineJumpTableInfo::EK_Inline:
560 assert(0 && "Unknown jump table encoding!");
564 /// createJumpTableIndex - Create a new jump table entry in the jump table info.
566 unsigned MachineJumpTableInfo::createJumpTableIndex(
567 const std::vector<MachineBasicBlock*> &DestBBs) {
568 assert(!DestBBs.empty() && "Cannot create an empty jump table!");
569 JumpTables.push_back(MachineJumpTableEntry(DestBBs));
570 return JumpTables.size()-1;
573 /// ReplaceMBBInJumpTables - If Old is the target of any jump tables, update
574 /// the jump tables to branch to New instead.
575 bool MachineJumpTableInfo::ReplaceMBBInJumpTables(MachineBasicBlock *Old,
576 MachineBasicBlock *New) {
577 assert(Old != New && "Not making a change?");
578 bool MadeChange = false;
579 for (size_t i = 0, e = JumpTables.size(); i != e; ++i)
580 ReplaceMBBInJumpTable(i, Old, New);
584 /// ReplaceMBBInJumpTable - If Old is a target of the jump tables, update
585 /// the jump table to branch to New instead.
586 bool MachineJumpTableInfo::ReplaceMBBInJumpTable(unsigned Idx,
587 MachineBasicBlock *Old,
588 MachineBasicBlock *New) {
589 assert(Old != New && "Not making a change?");
590 bool MadeChange = false;
591 MachineJumpTableEntry &JTE = JumpTables[Idx];
592 for (size_t j = 0, e = JTE.MBBs.size(); j != e; ++j)
593 if (JTE.MBBs[j] == Old) {
600 void MachineJumpTableInfo::print(raw_ostream &OS) const {
601 if (JumpTables.empty()) return;
603 OS << "Jump Tables:\n";
605 for (unsigned i = 0, e = JumpTables.size(); i != e; ++i) {
606 OS << " jt#" << i << ": ";
607 for (unsigned j = 0, f = JumpTables[i].MBBs.size(); j != f; ++j)
608 OS << " BB#" << JumpTables[i].MBBs[j]->getNumber();
614 void MachineJumpTableInfo::dump() const { print(dbgs()); }
617 //===----------------------------------------------------------------------===//
618 // MachineConstantPool implementation
619 //===----------------------------------------------------------------------===//
621 void MachineConstantPoolValue::anchor() { }
623 Type *MachineConstantPoolEntry::getType() const {
624 if (isMachineConstantPoolEntry())
625 return Val.MachineCPVal->getType();
626 return Val.ConstVal->getType();
630 unsigned MachineConstantPoolEntry::getRelocationInfo() const {
631 if (isMachineConstantPoolEntry())
632 return Val.MachineCPVal->getRelocationInfo();
633 return Val.ConstVal->getRelocationInfo();
636 MachineConstantPool::~MachineConstantPool() {
637 for (unsigned i = 0, e = Constants.size(); i != e; ++i)
638 if (Constants[i].isMachineConstantPoolEntry())
639 delete Constants[i].Val.MachineCPVal;
640 for (DenseSet<MachineConstantPoolValue*>::iterator I =
641 MachineCPVsSharingEntries.begin(), E = MachineCPVsSharingEntries.end();
646 /// CanShareConstantPoolEntry - Test whether the given two constants
647 /// can be allocated the same constant pool entry.
648 static bool CanShareConstantPoolEntry(const Constant *A, const Constant *B,
649 const TargetData *TD) {
650 // Handle the trivial case quickly.
651 if (A == B) return true;
653 // If they have the same type but weren't the same constant, quickly
655 if (A->getType() == B->getType()) return false;
657 // For now, only support constants with the same size.
658 if (TD->getTypeStoreSize(A->getType()) != TD->getTypeStoreSize(B->getType()))
661 // If a floating-point value and an integer value have the same encoding,
662 // they can share a constant-pool entry.
663 if (const ConstantFP *AFP = dyn_cast<ConstantFP>(A))
664 if (const ConstantInt *BI = dyn_cast<ConstantInt>(B))
665 return AFP->getValueAPF().bitcastToAPInt() == BI->getValue();
666 if (const ConstantFP *BFP = dyn_cast<ConstantFP>(B))
667 if (const ConstantInt *AI = dyn_cast<ConstantInt>(A))
668 return BFP->getValueAPF().bitcastToAPInt() == AI->getValue();
670 // Two vectors can share an entry if each pair of corresponding
672 if (const ConstantVector *AV = dyn_cast<ConstantVector>(A))
673 if (const ConstantVector *BV = dyn_cast<ConstantVector>(B)) {
674 if (AV->getType()->getNumElements() != BV->getType()->getNumElements())
676 for (unsigned i = 0, e = AV->getType()->getNumElements(); i != e; ++i)
677 if (!CanShareConstantPoolEntry(AV->getOperand(i),
678 BV->getOperand(i), TD))
683 // TODO: Handle other cases.
688 /// getConstantPoolIndex - Create a new entry in the constant pool or return
689 /// an existing one. User must specify the log2 of the minimum required
690 /// alignment for the object.
692 unsigned MachineConstantPool::getConstantPoolIndex(const Constant *C,
693 unsigned Alignment) {
694 assert(Alignment && "Alignment must be specified!");
695 if (Alignment > PoolAlignment) PoolAlignment = Alignment;
697 // Check to see if we already have this constant.
699 // FIXME, this could be made much more efficient for large constant pools.
700 for (unsigned i = 0, e = Constants.size(); i != e; ++i)
701 if (!Constants[i].isMachineConstantPoolEntry() &&
702 CanShareConstantPoolEntry(Constants[i].Val.ConstVal, C, TD)) {
703 if ((unsigned)Constants[i].getAlignment() < Alignment)
704 Constants[i].Alignment = Alignment;
708 Constants.push_back(MachineConstantPoolEntry(C, Alignment));
709 return Constants.size()-1;
712 unsigned MachineConstantPool::getConstantPoolIndex(MachineConstantPoolValue *V,
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 int Idx = V->getExistingMachineCPValue(this, Alignment);
722 MachineCPVsSharingEntries.insert(V);
723 return (unsigned)Idx;
726 Constants.push_back(MachineConstantPoolEntry(V, Alignment));
727 return Constants.size()-1;
730 void MachineConstantPool::print(raw_ostream &OS) const {
731 if (Constants.empty()) return;
733 OS << "Constant Pool:\n";
734 for (unsigned i = 0, e = Constants.size(); i != e; ++i) {
735 OS << " cp#" << i << ": ";
736 if (Constants[i].isMachineConstantPoolEntry())
737 Constants[i].Val.MachineCPVal->print(OS);
739 OS << *(Value*)Constants[i].Val.ConstVal;
740 OS << ", align=" << Constants[i].getAlignment();
745 void MachineConstantPool::dump() const { print(dbgs()); }