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/Config/config.h"
20 #include "llvm/CodeGen/MachineConstantPool.h"
21 #include "llvm/CodeGen/MachineFunction.h"
22 #include "llvm/CodeGen/MachineFunctionPass.h"
23 #include "llvm/CodeGen/MachineFrameInfo.h"
24 #include "llvm/CodeGen/MachineInstr.h"
25 #include "llvm/CodeGen/MachineJumpTableInfo.h"
26 #include "llvm/CodeGen/MachineModuleInfo.h"
27 #include "llvm/CodeGen/MachineRegisterInfo.h"
28 #include "llvm/CodeGen/Passes.h"
29 #include "llvm/MC/MCAsmInfo.h"
30 #include "llvm/MC/MCContext.h"
31 #include "llvm/Analysis/DebugInfo.h"
32 #include "llvm/Support/Debug.h"
33 #include "llvm/Target/TargetData.h"
34 #include "llvm/Target/TargetLowering.h"
35 #include "llvm/Target/TargetMachine.h"
36 #include "llvm/Target/TargetFrameInfo.h"
37 #include "llvm/ADT/SmallString.h"
38 #include "llvm/ADT/STLExtras.h"
39 #include "llvm/Support/GraphWriter.h"
40 #include "llvm/Support/raw_ostream.h"
43 //===----------------------------------------------------------------------===//
44 // MachineFunction implementation
45 //===----------------------------------------------------------------------===//
47 // Out of line virtual method.
48 MachineFunctionInfo::~MachineFunctionInfo() {}
50 void ilist_traits<MachineBasicBlock>::deleteNode(MachineBasicBlock *MBB) {
51 MBB->getParent()->DeleteMachineBasicBlock(MBB);
54 MachineFunction::MachineFunction(const Function *F, const TargetMachine &TM,
55 unsigned FunctionNum, MachineModuleInfo &mmi)
56 : Fn(F), Target(TM), Ctx(mmi.getContext()), MMI(mmi) {
57 if (TM.getRegisterInfo())
58 RegInfo = new (Allocator) MachineRegisterInfo(*TM.getRegisterInfo());
62 FrameInfo = new (Allocator) MachineFrameInfo(*TM.getFrameInfo());
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()->getFunctionAlignment(F);
68 FunctionNumber = FunctionNum;
72 MachineFunction::~MachineFunction() {
74 InstructionRecycler.clear(Allocator);
75 BasicBlockRecycler.clear(Allocator);
77 RegInfo->~MachineRegisterInfo();
78 Allocator.Deallocate(RegInfo);
81 MFInfo->~MachineFunctionInfo();
82 Allocator.Deallocate(MFInfo);
84 FrameInfo->~MachineFrameInfo(); Allocator.Deallocate(FrameInfo);
85 ConstantPool->~MachineConstantPool(); Allocator.Deallocate(ConstantPool);
88 JumpTableInfo->~MachineJumpTableInfo();
89 Allocator.Deallocate(JumpTableInfo);
93 /// getOrCreateJumpTableInfo - Get the JumpTableInfo for this function, if it
94 /// does already exist, allocate one.
95 MachineJumpTableInfo *MachineFunction::
96 getOrCreateJumpTableInfo(unsigned EntryKind) {
97 if (JumpTableInfo) return JumpTableInfo;
99 JumpTableInfo = new (Allocator)
100 MachineJumpTableInfo((MachineJumpTableInfo::JTEntryKind)EntryKind);
101 return JumpTableInfo;
104 /// RenumberBlocks - This discards all of the MachineBasicBlock numbers and
105 /// recomputes them. This guarantees that the MBB numbers are sequential,
106 /// dense, and match the ordering of the blocks within the function. If a
107 /// specific MachineBasicBlock is specified, only that block and those after
108 /// it are renumbered.
109 void MachineFunction::RenumberBlocks(MachineBasicBlock *MBB) {
110 if (empty()) { MBBNumbering.clear(); return; }
111 MachineFunction::iterator MBBI, E = end();
117 // Figure out the block number this should have.
118 unsigned BlockNo = 0;
120 BlockNo = prior(MBBI)->getNumber()+1;
122 for (; MBBI != E; ++MBBI, ++BlockNo) {
123 if (MBBI->getNumber() != (int)BlockNo) {
124 // Remove use of the old number.
125 if (MBBI->getNumber() != -1) {
126 assert(MBBNumbering[MBBI->getNumber()] == &*MBBI &&
127 "MBB number mismatch!");
128 MBBNumbering[MBBI->getNumber()] = 0;
131 // If BlockNo is already taken, set that block's number to -1.
132 if (MBBNumbering[BlockNo])
133 MBBNumbering[BlockNo]->setNumber(-1);
135 MBBNumbering[BlockNo] = MBBI;
136 MBBI->setNumber(BlockNo);
140 // Okay, all the blocks are renumbered. If we have compactified the block
141 // numbering, shrink MBBNumbering now.
142 assert(BlockNo <= MBBNumbering.size() && "Mismatch!");
143 MBBNumbering.resize(BlockNo);
146 /// CreateMachineInstr - Allocate a new MachineInstr. Use this instead
147 /// of `new MachineInstr'.
150 MachineFunction::CreateMachineInstr(const TargetInstrDesc &TID,
151 DebugLoc DL, bool NoImp) {
152 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
153 MachineInstr(TID, DL, NoImp);
156 /// CloneMachineInstr - Create a new MachineInstr which is a copy of the
157 /// 'Orig' instruction, identical in all ways except the instruction
158 /// has no parent, prev, or next.
161 MachineFunction::CloneMachineInstr(const MachineInstr *Orig) {
162 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
163 MachineInstr(*this, *Orig);
166 /// DeleteMachineInstr - Delete the given MachineInstr.
169 MachineFunction::DeleteMachineInstr(MachineInstr *MI) {
171 InstructionRecycler.Deallocate(Allocator, MI);
174 /// CreateMachineBasicBlock - Allocate a new MachineBasicBlock. Use this
175 /// instead of `new MachineBasicBlock'.
178 MachineFunction::CreateMachineBasicBlock(const BasicBlock *bb) {
179 return new (BasicBlockRecycler.Allocate<MachineBasicBlock>(Allocator))
180 MachineBasicBlock(*this, bb);
183 /// DeleteMachineBasicBlock - Delete the given MachineBasicBlock.
186 MachineFunction::DeleteMachineBasicBlock(MachineBasicBlock *MBB) {
187 assert(MBB->getParent() == this && "MBB parent mismatch!");
188 MBB->~MachineBasicBlock();
189 BasicBlockRecycler.Deallocate(Allocator, MBB);
193 MachineFunction::getMachineMemOperand(MachinePointerInfo PtrInfo, unsigned f,
194 uint64_t s, unsigned base_alignment) {
195 return new (Allocator) MachineMemOperand(PtrInfo, f, s, base_alignment);
199 MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO,
200 int64_t Offset, uint64_t Size) {
201 return new (Allocator)
202 MachineMemOperand(MachinePointerInfo(MMO->getValue(),
203 MMO->getOffset()+Offset),
204 MMO->getFlags(), Size, MMO->getBaseAlignment());
207 MachineInstr::mmo_iterator
208 MachineFunction::allocateMemRefsArray(unsigned long Num) {
209 return Allocator.Allocate<MachineMemOperand *>(Num);
212 std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
213 MachineFunction::extractLoadMemRefs(MachineInstr::mmo_iterator Begin,
214 MachineInstr::mmo_iterator End) {
215 // Count the number of load mem refs.
217 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
221 // Allocate a new array and populate it with the load information.
222 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
224 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
225 if ((*I)->isLoad()) {
226 if (!(*I)->isStore())
230 // Clone the MMO and unset the store flag.
231 MachineMemOperand *JustLoad =
232 getMachineMemOperand((*I)->getPointerInfo(),
233 (*I)->getFlags() & ~MachineMemOperand::MOStore,
234 (*I)->getSize(), (*I)->getBaseAlignment());
235 Result[Index] = JustLoad;
240 return std::make_pair(Result, Result + Num);
243 std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
244 MachineFunction::extractStoreMemRefs(MachineInstr::mmo_iterator Begin,
245 MachineInstr::mmo_iterator End) {
246 // Count the number of load mem refs.
248 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
252 // Allocate a new array and populate it with the store information.
253 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
255 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
256 if ((*I)->isStore()) {
261 // Clone the MMO and unset the load flag.
262 MachineMemOperand *JustStore =
263 getMachineMemOperand((*I)->getPointerInfo(),
264 (*I)->getFlags() & ~MachineMemOperand::MOLoad,
265 (*I)->getSize(), (*I)->getBaseAlignment());
266 Result[Index] = JustStore;
271 return std::make_pair(Result, Result + Num);
274 void MachineFunction::dump() const {
278 void MachineFunction::print(raw_ostream &OS) const {
279 OS << "# Machine code for function " << Fn->getName() << ":\n";
281 // Print Frame Information
282 FrameInfo->print(*this, OS);
284 // Print JumpTable Information
286 JumpTableInfo->print(OS);
288 // Print Constant Pool
289 ConstantPool->print(OS);
291 const TargetRegisterInfo *TRI = getTarget().getRegisterInfo();
293 if (RegInfo && !RegInfo->livein_empty()) {
294 OS << "Function Live Ins: ";
295 for (MachineRegisterInfo::livein_iterator
296 I = RegInfo->livein_begin(), E = RegInfo->livein_end(); I != E; ++I) {
298 OS << "%" << TRI->getName(I->first);
300 OS << " %physreg" << I->first;
303 OS << " in reg%" << I->second;
305 if (llvm::next(I) != E)
310 if (RegInfo && !RegInfo->liveout_empty()) {
311 OS << "Function Live Outs: ";
312 for (MachineRegisterInfo::liveout_iterator
313 I = RegInfo->liveout_begin(), E = RegInfo->liveout_end(); I != E; ++I){
315 OS << '%' << TRI->getName(*I);
317 OS << "%physreg" << *I;
319 if (llvm::next(I) != E)
325 for (const_iterator BB = begin(), E = end(); BB != E; ++BB) {
330 OS << "\n# End machine code for function " << Fn->getName() << ".\n\n";
335 struct DOTGraphTraits<const MachineFunction*> : public DefaultDOTGraphTraits {
337 DOTGraphTraits (bool isSimple=false) : DefaultDOTGraphTraits(isSimple) {}
339 static std::string getGraphName(const MachineFunction *F) {
340 return "CFG for '" + F->getFunction()->getNameStr() + "' function";
343 std::string getNodeLabel(const MachineBasicBlock *Node,
344 const MachineFunction *Graph) {
345 if (isSimple () && Node->getBasicBlock() &&
346 !Node->getBasicBlock()->getName().empty())
347 return Node->getBasicBlock()->getNameStr() + ":";
351 raw_string_ostream OSS(OutStr);
354 OSS << Node->getNumber() << ':';
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()->getNameStr());
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()->getNameStr(), 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());
426 //===----------------------------------------------------------------------===//
427 // MachineFrameInfo implementation
428 //===----------------------------------------------------------------------===//
430 /// CreateFixedObject - Create a new object at a fixed location on the stack.
431 /// All fixed objects should be created before other objects are created for
432 /// efficiency. By default, fixed objects are immutable. This returns an
433 /// index with a negative value.
435 int MachineFrameInfo::CreateFixedObject(uint64_t Size, int64_t SPOffset,
437 assert(Size != 0 && "Cannot allocate zero size fixed stack objects!");
438 // The alignment of the frame index can be determined from its offset from
439 // the incoming frame position. If the frame object is at offset 32 and
440 // the stack is guaranteed to be 16-byte aligned, then we know that the
441 // object is 16-byte aligned.
442 unsigned StackAlign = TFI.getStackAlignment();
443 unsigned Align = MinAlign(SPOffset, StackAlign);
444 Objects.insert(Objects.begin(), StackObject(Size, Align, SPOffset, Immutable,
445 /*isSS*/false, false));
446 return -++NumFixedObjects;
451 MachineFrameInfo::getPristineRegs(const MachineBasicBlock *MBB) const {
452 assert(MBB && "MBB must be valid");
453 const MachineFunction *MF = MBB->getParent();
454 assert(MF && "MBB must be part of a MachineFunction");
455 const TargetMachine &TM = MF->getTarget();
456 const TargetRegisterInfo *TRI = TM.getRegisterInfo();
457 BitVector BV(TRI->getNumRegs());
459 // Before CSI is calculated, no registers are considered pristine. They can be
460 // freely used and PEI will make sure they are saved.
461 if (!isCalleeSavedInfoValid())
464 for (const unsigned *CSR = TRI->getCalleeSavedRegs(MF); CSR && *CSR; ++CSR)
467 // The entry MBB always has all CSRs pristine.
468 if (MBB == &MF->front())
471 // On other MBBs the saved CSRs are not pristine.
472 const std::vector<CalleeSavedInfo> &CSI = getCalleeSavedInfo();
473 for (std::vector<CalleeSavedInfo>::const_iterator I = CSI.begin(),
474 E = CSI.end(); I != E; ++I)
475 BV.reset(I->getReg());
481 void MachineFrameInfo::print(const MachineFunction &MF, raw_ostream &OS) const{
482 if (Objects.empty()) return;
484 const TargetFrameInfo *FI = MF.getTarget().getFrameInfo();
485 int ValOffset = (FI ? FI->getOffsetOfLocalArea() : 0);
487 OS << "Frame Objects:\n";
489 for (unsigned i = 0, e = Objects.size(); i != e; ++i) {
490 const StackObject &SO = Objects[i];
491 OS << " fi#" << (int)(i-NumFixedObjects) << ": ";
492 if (SO.Size == ~0ULL) {
497 OS << "variable sized";
499 OS << "size=" << SO.Size;
500 OS << ", align=" << SO.Alignment;
502 if (i < NumFixedObjects)
504 if (i < NumFixedObjects || SO.SPOffset != -1) {
505 int64_t Off = SO.SPOffset - ValOffset;
506 OS << ", at location [SP";
517 void MachineFrameInfo::dump(const MachineFunction &MF) const {
521 //===----------------------------------------------------------------------===//
522 // MachineJumpTableInfo implementation
523 //===----------------------------------------------------------------------===//
525 /// getEntrySize - Return the size of each entry in the jump table.
526 unsigned MachineJumpTableInfo::getEntrySize(const TargetData &TD) const {
527 // The size of a jump table entry is 4 bytes unless the entry is just the
528 // address of a block, in which case it is the pointer size.
529 switch (getEntryKind()) {
530 case MachineJumpTableInfo::EK_BlockAddress:
531 return TD.getPointerSize();
532 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
533 case MachineJumpTableInfo::EK_LabelDifference32:
534 case MachineJumpTableInfo::EK_Custom32:
536 case MachineJumpTableInfo::EK_Inline:
539 assert(0 && "Unknown jump table encoding!");
543 /// getEntryAlignment - Return the alignment of each entry in the jump table.
544 unsigned MachineJumpTableInfo::getEntryAlignment(const TargetData &TD) const {
545 // The alignment of a jump table entry is the alignment of int32 unless the
546 // entry is just the address of a block, in which case it is the pointer
548 switch (getEntryKind()) {
549 case MachineJumpTableInfo::EK_BlockAddress:
550 return TD.getPointerABIAlignment();
551 case MachineJumpTableInfo::EK_GPRel32BlockAddress:
552 case MachineJumpTableInfo::EK_LabelDifference32:
553 case MachineJumpTableInfo::EK_Custom32:
554 return TD.getABIIntegerTypeAlignment(32);
555 case MachineJumpTableInfo::EK_Inline:
558 assert(0 && "Unknown jump table encoding!");
562 /// createJumpTableIndex - Create a new jump table entry in the jump table info.
564 unsigned MachineJumpTableInfo::createJumpTableIndex(
565 const std::vector<MachineBasicBlock*> &DestBBs) {
566 assert(!DestBBs.empty() && "Cannot create an empty jump table!");
567 JumpTables.push_back(MachineJumpTableEntry(DestBBs));
568 return JumpTables.size()-1;
571 /// ReplaceMBBInJumpTables - If Old is the target of any jump tables, update
572 /// the jump tables to branch to New instead.
573 bool MachineJumpTableInfo::ReplaceMBBInJumpTables(MachineBasicBlock *Old,
574 MachineBasicBlock *New) {
575 assert(Old != New && "Not making a change?");
576 bool MadeChange = false;
577 for (size_t i = 0, e = JumpTables.size(); i != e; ++i)
578 ReplaceMBBInJumpTable(i, Old, New);
582 /// ReplaceMBBInJumpTable - If Old is a target of the jump tables, update
583 /// the jump table to branch to New instead.
584 bool MachineJumpTableInfo::ReplaceMBBInJumpTable(unsigned Idx,
585 MachineBasicBlock *Old,
586 MachineBasicBlock *New) {
587 assert(Old != New && "Not making a change?");
588 bool MadeChange = false;
589 MachineJumpTableEntry &JTE = JumpTables[Idx];
590 for (size_t j = 0, e = JTE.MBBs.size(); j != e; ++j)
591 if (JTE.MBBs[j] == Old) {
598 void MachineJumpTableInfo::print(raw_ostream &OS) const {
599 if (JumpTables.empty()) return;
601 OS << "Jump Tables:\n";
603 for (unsigned i = 0, e = JumpTables.size(); i != e; ++i) {
604 OS << " jt#" << i << ": ";
605 for (unsigned j = 0, f = JumpTables[i].MBBs.size(); j != f; ++j)
606 OS << " BB#" << JumpTables[i].MBBs[j]->getNumber();
612 void MachineJumpTableInfo::dump() const { print(dbgs()); }
615 //===----------------------------------------------------------------------===//
616 // MachineConstantPool implementation
617 //===----------------------------------------------------------------------===//
619 const Type *MachineConstantPoolEntry::getType() const {
620 if (isMachineConstantPoolEntry())
621 return Val.MachineCPVal->getType();
622 return Val.ConstVal->getType();
626 unsigned MachineConstantPoolEntry::getRelocationInfo() const {
627 if (isMachineConstantPoolEntry())
628 return Val.MachineCPVal->getRelocationInfo();
629 return Val.ConstVal->getRelocationInfo();
632 MachineConstantPool::~MachineConstantPool() {
633 for (unsigned i = 0, e = Constants.size(); i != e; ++i)
634 if (Constants[i].isMachineConstantPoolEntry())
635 delete Constants[i].Val.MachineCPVal;
638 /// CanShareConstantPoolEntry - Test whether the given two constants
639 /// can be allocated the same constant pool entry.
640 static bool CanShareConstantPoolEntry(const Constant *A, const Constant *B,
641 const TargetData *TD) {
642 // Handle the trivial case quickly.
643 if (A == B) return true;
645 // If they have the same type but weren't the same constant, quickly
647 if (A->getType() == B->getType()) return false;
649 // For now, only support constants with the same size.
650 if (TD->getTypeStoreSize(A->getType()) != TD->getTypeStoreSize(B->getType()))
653 // If a floating-point value and an integer value have the same encoding,
654 // they can share a constant-pool entry.
655 if (const ConstantFP *AFP = dyn_cast<ConstantFP>(A))
656 if (const ConstantInt *BI = dyn_cast<ConstantInt>(B))
657 return AFP->getValueAPF().bitcastToAPInt() == BI->getValue();
658 if (const ConstantFP *BFP = dyn_cast<ConstantFP>(B))
659 if (const ConstantInt *AI = dyn_cast<ConstantInt>(A))
660 return BFP->getValueAPF().bitcastToAPInt() == AI->getValue();
662 // Two vectors can share an entry if each pair of corresponding
664 if (const ConstantVector *AV = dyn_cast<ConstantVector>(A))
665 if (const ConstantVector *BV = dyn_cast<ConstantVector>(B)) {
666 if (AV->getType()->getNumElements() != BV->getType()->getNumElements())
668 for (unsigned i = 0, e = AV->getType()->getNumElements(); i != e; ++i)
669 if (!CanShareConstantPoolEntry(AV->getOperand(i),
670 BV->getOperand(i), TD))
675 // TODO: Handle other cases.
680 /// getConstantPoolIndex - Create a new entry in the constant pool or return
681 /// an existing one. User must specify the log2 of the minimum required
682 /// alignment for the object.
684 unsigned MachineConstantPool::getConstantPoolIndex(const Constant *C,
685 unsigned Alignment) {
686 assert(Alignment && "Alignment must be specified!");
687 if (Alignment > PoolAlignment) PoolAlignment = Alignment;
689 // Check to see if we already have this constant.
691 // FIXME, this could be made much more efficient for large constant pools.
692 for (unsigned i = 0, e = Constants.size(); i != e; ++i)
693 if (!Constants[i].isMachineConstantPoolEntry() &&
694 CanShareConstantPoolEntry(Constants[i].Val.ConstVal, C, TD)) {
695 if ((unsigned)Constants[i].getAlignment() < Alignment)
696 Constants[i].Alignment = Alignment;
700 Constants.push_back(MachineConstantPoolEntry(C, Alignment));
701 return Constants.size()-1;
704 unsigned MachineConstantPool::getConstantPoolIndex(MachineConstantPoolValue *V,
705 unsigned Alignment) {
706 assert(Alignment && "Alignment must be specified!");
707 if (Alignment > PoolAlignment) PoolAlignment = Alignment;
709 // Check to see if we already have this constant.
711 // FIXME, this could be made much more efficient for large constant pools.
712 int Idx = V->getExistingMachineCPValue(this, Alignment);
714 return (unsigned)Idx;
716 Constants.push_back(MachineConstantPoolEntry(V, Alignment));
717 return Constants.size()-1;
720 void MachineConstantPool::print(raw_ostream &OS) const {
721 if (Constants.empty()) return;
723 OS << "Constant Pool:\n";
724 for (unsigned i = 0, e = Constants.size(); i != e; ++i) {
725 OS << " cp#" << i << ": ";
726 if (Constants[i].isMachineConstantPoolEntry())
727 Constants[i].Val.MachineCPVal->print(OS);
729 OS << *(Value*)Constants[i].Val.ConstVal;
730 OS << ", align=" << Constants[i].getAlignment();
735 void MachineConstantPool::dump() const { print(dbgs()); }