MachineFunction.cpp revision 208599
1//===-- MachineFunction.cpp -----------------------------------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// Collect native machine code information for a function. This allows 11// target-specific information about the generated code to be stored with each 12// function. 13// 14//===----------------------------------------------------------------------===// 15 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" 41using namespace llvm; 42 43//===----------------------------------------------------------------------===// 44// MachineFunction implementation 45//===----------------------------------------------------------------------===// 46 47// Out of line virtual method. 48MachineFunctionInfo::~MachineFunctionInfo() {} 49 50void ilist_traits<MachineBasicBlock>::deleteNode(MachineBasicBlock *MBB) { 51 MBB->getParent()->DeleteMachineBasicBlock(MBB); 52} 53 54MachineFunction::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()); 59 else 60 RegInfo = 0; 61 MFInfo = 0; 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; 69 JumpTableInfo = 0; 70} 71 72MachineFunction::~MachineFunction() { 73 BasicBlocks.clear(); 74 InstructionRecycler.clear(Allocator); 75 BasicBlockRecycler.clear(Allocator); 76 if (RegInfo) { 77 RegInfo->~MachineRegisterInfo(); 78 Allocator.Deallocate(RegInfo); 79 } 80 if (MFInfo) { 81 MFInfo->~MachineFunctionInfo(); 82 Allocator.Deallocate(MFInfo); 83 } 84 FrameInfo->~MachineFrameInfo(); Allocator.Deallocate(FrameInfo); 85 ConstantPool->~MachineConstantPool(); Allocator.Deallocate(ConstantPool); 86 87 if (JumpTableInfo) { 88 JumpTableInfo->~MachineJumpTableInfo(); 89 Allocator.Deallocate(JumpTableInfo); 90 } 91} 92 93/// getOrCreateJumpTableInfo - Get the JumpTableInfo for this function, if it 94/// does already exist, allocate one. 95MachineJumpTableInfo *MachineFunction:: 96getOrCreateJumpTableInfo(unsigned EntryKind) { 97 if (JumpTableInfo) return JumpTableInfo; 98 99 JumpTableInfo = new (Allocator) 100 MachineJumpTableInfo((MachineJumpTableInfo::JTEntryKind)EntryKind); 101 return JumpTableInfo; 102} 103 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. 109void MachineFunction::RenumberBlocks(MachineBasicBlock *MBB) { 110 if (empty()) { MBBNumbering.clear(); return; } 111 MachineFunction::iterator MBBI, E = end(); 112 if (MBB == 0) 113 MBBI = begin(); 114 else 115 MBBI = MBB; 116 117 // Figure out the block number this should have. 118 unsigned BlockNo = 0; 119 if (MBBI != begin()) 120 BlockNo = prior(MBBI)->getNumber()+1; 121 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; 129 } 130 131 // If BlockNo is already taken, set that block's number to -1. 132 if (MBBNumbering[BlockNo]) 133 MBBNumbering[BlockNo]->setNumber(-1); 134 135 MBBNumbering[BlockNo] = MBBI; 136 MBBI->setNumber(BlockNo); 137 } 138 } 139 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); 144} 145 146/// CreateMachineInstr - Allocate a new MachineInstr. Use this instead 147/// of `new MachineInstr'. 148/// 149MachineInstr * 150MachineFunction::CreateMachineInstr(const TargetInstrDesc &TID, 151 DebugLoc DL, bool NoImp) { 152 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator)) 153 MachineInstr(TID, DL, NoImp); 154} 155 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. 159/// 160MachineInstr * 161MachineFunction::CloneMachineInstr(const MachineInstr *Orig) { 162 return new (InstructionRecycler.Allocate<MachineInstr>(Allocator)) 163 MachineInstr(*this, *Orig); 164} 165 166/// DeleteMachineInstr - Delete the given MachineInstr. 167/// 168void 169MachineFunction::DeleteMachineInstr(MachineInstr *MI) { 170 MI->~MachineInstr(); 171 InstructionRecycler.Deallocate(Allocator, MI); 172} 173 174/// CreateMachineBasicBlock - Allocate a new MachineBasicBlock. Use this 175/// instead of `new MachineBasicBlock'. 176/// 177MachineBasicBlock * 178MachineFunction::CreateMachineBasicBlock(const BasicBlock *bb) { 179 return new (BasicBlockRecycler.Allocate<MachineBasicBlock>(Allocator)) 180 MachineBasicBlock(*this, bb); 181} 182 183/// DeleteMachineBasicBlock - Delete the given MachineBasicBlock. 184/// 185void 186MachineFunction::DeleteMachineBasicBlock(MachineBasicBlock *MBB) { 187 assert(MBB->getParent() == this && "MBB parent mismatch!"); 188 MBB->~MachineBasicBlock(); 189 BasicBlockRecycler.Deallocate(Allocator, MBB); 190} 191 192MachineMemOperand * 193MachineFunction::getMachineMemOperand(const Value *v, unsigned f, 194 int64_t o, uint64_t s, 195 unsigned base_alignment) { 196 return new (Allocator) MachineMemOperand(v, f, o, s, base_alignment); 197} 198 199MachineMemOperand * 200MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO, 201 int64_t Offset, uint64_t Size) { 202 return new (Allocator) 203 MachineMemOperand(MMO->getValue(), MMO->getFlags(), 204 int64_t(uint64_t(MMO->getOffset()) + 205 uint64_t(Offset)), 206 Size, MMO->getBaseAlignment()); 207} 208 209MachineInstr::mmo_iterator 210MachineFunction::allocateMemRefsArray(unsigned long Num) { 211 return Allocator.Allocate<MachineMemOperand *>(Num); 212} 213 214std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator> 215MachineFunction::extractLoadMemRefs(MachineInstr::mmo_iterator Begin, 216 MachineInstr::mmo_iterator End) { 217 // Count the number of load mem refs. 218 unsigned Num = 0; 219 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) 220 if ((*I)->isLoad()) 221 ++Num; 222 223 // Allocate a new array and populate it with the load information. 224 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num); 225 unsigned Index = 0; 226 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) { 227 if ((*I)->isLoad()) { 228 if (!(*I)->isStore()) 229 // Reuse the MMO. 230 Result[Index] = *I; 231 else { 232 // Clone the MMO and unset the store flag. 233 MachineMemOperand *JustLoad = 234 getMachineMemOperand((*I)->getValue(), 235 (*I)->getFlags() & ~MachineMemOperand::MOStore, 236 (*I)->getOffset(), (*I)->getSize(), 237 (*I)->getBaseAlignment()); 238 Result[Index] = JustLoad; 239 } 240 ++Index; 241 } 242 } 243 return std::make_pair(Result, Result + Num); 244} 245 246std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator> 247MachineFunction::extractStoreMemRefs(MachineInstr::mmo_iterator Begin, 248 MachineInstr::mmo_iterator End) { 249 // Count the number of load mem refs. 250 unsigned Num = 0; 251 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) 252 if ((*I)->isStore()) 253 ++Num; 254 255 // Allocate a new array and populate it with the store information. 256 MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num); 257 unsigned Index = 0; 258 for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) { 259 if ((*I)->isStore()) { 260 if (!(*I)->isLoad()) 261 // Reuse the MMO. 262 Result[Index] = *I; 263 else { 264 // Clone the MMO and unset the load flag. 265 MachineMemOperand *JustStore = 266 getMachineMemOperand((*I)->getValue(), 267 (*I)->getFlags() & ~MachineMemOperand::MOLoad, 268 (*I)->getOffset(), (*I)->getSize(), 269 (*I)->getBaseAlignment()); 270 Result[Index] = JustStore; 271 } 272 ++Index; 273 } 274 } 275 return std::make_pair(Result, Result + Num); 276} 277 278void MachineFunction::dump() const { 279 print(dbgs()); 280} 281 282void MachineFunction::print(raw_ostream &OS) const { 283 OS << "# Machine code for function " << Fn->getName() << ":\n"; 284 285 // Print Frame Information 286 FrameInfo->print(*this, OS); 287 288 // Print JumpTable Information 289 if (JumpTableInfo) 290 JumpTableInfo->print(OS); 291 292 // Print Constant Pool 293 ConstantPool->print(OS); 294 295 const TargetRegisterInfo *TRI = getTarget().getRegisterInfo(); 296 297 if (RegInfo && !RegInfo->livein_empty()) { 298 OS << "Function Live Ins: "; 299 for (MachineRegisterInfo::livein_iterator 300 I = RegInfo->livein_begin(), E = RegInfo->livein_end(); I != E; ++I) { 301 if (TRI) 302 OS << "%" << TRI->getName(I->first); 303 else 304 OS << " %physreg" << I->first; 305 306 if (I->second) 307 OS << " in reg%" << I->second; 308 309 if (llvm::next(I) != E) 310 OS << ", "; 311 } 312 OS << '\n'; 313 } 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 if (TRI) 319 OS << '%' << TRI->getName(*I); 320 else 321 OS << "%physreg" << *I; 322 323 if (llvm::next(I) != E) 324 OS << " "; 325 } 326 OS << '\n'; 327 } 328 329 for (const_iterator BB = begin(), E = end(); BB != E; ++BB) { 330 OS << '\n'; 331 BB->print(OS); 332 } 333 334 OS << "\n# End machine code for function " << Fn->getName() << ".\n\n"; 335} 336 337namespace llvm { 338 template<> 339 struct DOTGraphTraits<const MachineFunction*> : public DefaultDOTGraphTraits { 340 341 DOTGraphTraits (bool isSimple=false) : DefaultDOTGraphTraits(isSimple) {} 342 343 static std::string getGraphName(const MachineFunction *F) { 344 return "CFG for '" + F->getFunction()->getNameStr() + "' function"; 345 } 346 347 std::string getNodeLabel(const MachineBasicBlock *Node, 348 const MachineFunction *Graph) { 349 if (isSimple () && Node->getBasicBlock() && 350 !Node->getBasicBlock()->getName().empty()) 351 return Node->getBasicBlock()->getNameStr() + ":"; 352 353 std::string OutStr; 354 { 355 raw_string_ostream OSS(OutStr); 356 357 if (isSimple()) 358 OSS << Node->getNumber() << ':'; 359 else 360 Node->print(OSS); 361 } 362 363 if (OutStr[0] == '\n') OutStr.erase(OutStr.begin()); 364 365 // Process string output to make it nicer... 366 for (unsigned i = 0; i != OutStr.length(); ++i) 367 if (OutStr[i] == '\n') { // Left justify 368 OutStr[i] = '\\'; 369 OutStr.insert(OutStr.begin()+i+1, 'l'); 370 } 371 return OutStr; 372 } 373 }; 374} 375 376void MachineFunction::viewCFG() const 377{ 378#ifndef NDEBUG 379 ViewGraph(this, "mf" + getFunction()->getNameStr()); 380#else 381 errs() << "SelectionDAG::viewGraph is only available in debug builds on " 382 << "systems with Graphviz or gv!\n"; 383#endif // NDEBUG 384} 385 386void MachineFunction::viewCFGOnly() const 387{ 388#ifndef NDEBUG 389 ViewGraph(this, "mf" + getFunction()->getNameStr(), true); 390#else 391 errs() << "SelectionDAG::viewGraph is only available in debug builds on " 392 << "systems with Graphviz or gv!\n"; 393#endif // NDEBUG 394} 395 396/// addLiveIn - Add the specified physical register as a live-in value and 397/// create a corresponding virtual register for it. 398unsigned MachineFunction::addLiveIn(unsigned PReg, 399 const TargetRegisterClass *RC) { 400 assert(RC->contains(PReg) && "Not the correct regclass!"); 401 MachineRegisterInfo &MRI = getRegInfo(); 402 unsigned VReg = MRI.getLiveInVirtReg(PReg); 403 if (VReg) { 404 assert(MRI.getRegClass(VReg) == RC && "Register class mismatch!"); 405 return VReg; 406 } 407 VReg = MRI.createVirtualRegister(RC); 408 MRI.addLiveIn(PReg, VReg); 409 return VReg; 410} 411 412/// getJTISymbol - Return the MCSymbol for the specified non-empty jump table. 413/// If isLinkerPrivate is specified, an 'l' label is returned, otherwise a 414/// normal 'L' label is returned. 415MCSymbol *MachineFunction::getJTISymbol(unsigned JTI, MCContext &Ctx, 416 bool isLinkerPrivate) const { 417 assert(JumpTableInfo && "No jump tables"); 418 419 assert(JTI < JumpTableInfo->getJumpTables().size() && "Invalid JTI!"); 420 const MCAsmInfo &MAI = *getTarget().getMCAsmInfo(); 421 422 const char *Prefix = isLinkerPrivate ? MAI.getLinkerPrivateGlobalPrefix() : 423 MAI.getPrivateGlobalPrefix(); 424 SmallString<60> Name; 425 raw_svector_ostream(Name) 426 << Prefix << "JTI" << getFunctionNumber() << '_' << JTI; 427 return Ctx.GetOrCreateSymbol(Name.str()); 428} 429 430 431//===----------------------------------------------------------------------===// 432// MachineFrameInfo implementation 433//===----------------------------------------------------------------------===// 434 435/// CreateFixedObject - Create a new object at a fixed location on the stack. 436/// All fixed objects should be created before other objects are created for 437/// efficiency. By default, fixed objects are immutable. This returns an 438/// index with a negative value. 439/// 440int MachineFrameInfo::CreateFixedObject(uint64_t Size, int64_t SPOffset, 441 bool Immutable, bool isSS) { 442 assert(Size != 0 && "Cannot allocate zero size fixed stack objects!"); 443 Objects.insert(Objects.begin(), StackObject(Size, 1, SPOffset, Immutable, 444 isSS)); 445 return -++NumFixedObjects; 446} 447 448 449BitVector 450MachineFrameInfo::getPristineRegs(const MachineBasicBlock *MBB) const { 451 assert(MBB && "MBB must be valid"); 452 const MachineFunction *MF = MBB->getParent(); 453 assert(MF && "MBB must be part of a MachineFunction"); 454 const TargetMachine &TM = MF->getTarget(); 455 const TargetRegisterInfo *TRI = TM.getRegisterInfo(); 456 BitVector BV(TRI->getNumRegs()); 457 458 // Before CSI is calculated, no registers are considered pristine. They can be 459 // freely used and PEI will make sure they are saved. 460 if (!isCalleeSavedInfoValid()) 461 return BV; 462 463 for (const unsigned *CSR = TRI->getCalleeSavedRegs(MF); CSR && *CSR; ++CSR) 464 BV.set(*CSR); 465 466 // The entry MBB always has all CSRs pristine. 467 if (MBB == &MF->front()) 468 return BV; 469 470 // On other MBBs the saved CSRs are not pristine. 471 const std::vector<CalleeSavedInfo> &CSI = getCalleeSavedInfo(); 472 for (std::vector<CalleeSavedInfo>::const_iterator I = CSI.begin(), 473 E = CSI.end(); I != E; ++I) 474 BV.reset(I->getReg()); 475 476 return BV; 477} 478 479 480void MachineFrameInfo::print(const MachineFunction &MF, raw_ostream &OS) const{ 481 if (Objects.empty()) return; 482 483 const TargetFrameInfo *FI = MF.getTarget().getFrameInfo(); 484 int ValOffset = (FI ? FI->getOffsetOfLocalArea() : 0); 485 486 OS << "Frame Objects:\n"; 487 488 for (unsigned i = 0, e = Objects.size(); i != e; ++i) { 489 const StackObject &SO = Objects[i]; 490 OS << " fi#" << (int)(i-NumFixedObjects) << ": "; 491 if (SO.Size == ~0ULL) { 492 OS << "dead\n"; 493 continue; 494 } 495 if (SO.Size == 0) 496 OS << "variable sized"; 497 else 498 OS << "size=" << SO.Size; 499 OS << ", align=" << SO.Alignment; 500 501 if (i < NumFixedObjects) 502 OS << ", fixed"; 503 if (i < NumFixedObjects || SO.SPOffset != -1) { 504 int64_t Off = SO.SPOffset - ValOffset; 505 OS << ", at location [SP"; 506 if (Off > 0) 507 OS << "+" << Off; 508 else if (Off < 0) 509 OS << Off; 510 OS << "]"; 511 } 512 OS << "\n"; 513 } 514} 515 516void MachineFrameInfo::dump(const MachineFunction &MF) const { 517 print(MF, dbgs()); 518} 519 520//===----------------------------------------------------------------------===// 521// MachineJumpTableInfo implementation 522//===----------------------------------------------------------------------===// 523 524/// getEntrySize - Return the size of each entry in the jump table. 525unsigned MachineJumpTableInfo::getEntrySize(const TargetData &TD) const { 526 // The size of a jump table entry is 4 bytes unless the entry is just the 527 // address of a block, in which case it is the pointer size. 528 switch (getEntryKind()) { 529 case MachineJumpTableInfo::EK_BlockAddress: 530 return TD.getPointerSize(); 531 case MachineJumpTableInfo::EK_GPRel32BlockAddress: 532 case MachineJumpTableInfo::EK_LabelDifference32: 533 case MachineJumpTableInfo::EK_Custom32: 534 return 4; 535 case MachineJumpTableInfo::EK_Inline: 536 return 0; 537 } 538 assert(0 && "Unknown jump table encoding!"); 539 return ~0; 540} 541 542/// getEntryAlignment - Return the alignment of each entry in the jump table. 543unsigned MachineJumpTableInfo::getEntryAlignment(const TargetData &TD) const { 544 // The alignment of a jump table entry is the alignment of int32 unless the 545 // entry is just the address of a block, in which case it is the pointer 546 // alignment. 547 switch (getEntryKind()) { 548 case MachineJumpTableInfo::EK_BlockAddress: 549 return TD.getPointerABIAlignment(); 550 case MachineJumpTableInfo::EK_GPRel32BlockAddress: 551 case MachineJumpTableInfo::EK_LabelDifference32: 552 case MachineJumpTableInfo::EK_Custom32: 553 return TD.getABIIntegerTypeAlignment(32); 554 case MachineJumpTableInfo::EK_Inline: 555 return 1; 556 } 557 assert(0 && "Unknown jump table encoding!"); 558 return ~0; 559} 560 561/// createJumpTableIndex - Create a new jump table entry in the jump table info. 562/// 563unsigned MachineJumpTableInfo::createJumpTableIndex( 564 const std::vector<MachineBasicBlock*> &DestBBs) { 565 assert(!DestBBs.empty() && "Cannot create an empty jump table!"); 566 JumpTables.push_back(MachineJumpTableEntry(DestBBs)); 567 return JumpTables.size()-1; 568} 569 570/// ReplaceMBBInJumpTables - If Old is the target of any jump tables, update 571/// the jump tables to branch to New instead. 572bool MachineJumpTableInfo::ReplaceMBBInJumpTables(MachineBasicBlock *Old, 573 MachineBasicBlock *New) { 574 assert(Old != New && "Not making a change?"); 575 bool MadeChange = false; 576 for (size_t i = 0, e = JumpTables.size(); i != e; ++i) 577 ReplaceMBBInJumpTable(i, Old, New); 578 return MadeChange; 579} 580 581/// ReplaceMBBInJumpTable - If Old is a target of the jump tables, update 582/// the jump table to branch to New instead. 583bool MachineJumpTableInfo::ReplaceMBBInJumpTable(unsigned Idx, 584 MachineBasicBlock *Old, 585 MachineBasicBlock *New) { 586 assert(Old != New && "Not making a change?"); 587 bool MadeChange = false; 588 MachineJumpTableEntry &JTE = JumpTables[Idx]; 589 for (size_t j = 0, e = JTE.MBBs.size(); j != e; ++j) 590 if (JTE.MBBs[j] == Old) { 591 JTE.MBBs[j] = New; 592 MadeChange = true; 593 } 594 return MadeChange; 595} 596 597void MachineJumpTableInfo::print(raw_ostream &OS) const { 598 if (JumpTables.empty()) return; 599 600 OS << "Jump Tables:\n"; 601 602 for (unsigned i = 0, e = JumpTables.size(); i != e; ++i) { 603 OS << " jt#" << i << ": "; 604 for (unsigned j = 0, f = JumpTables[i].MBBs.size(); j != f; ++j) 605 OS << " BB#" << JumpTables[i].MBBs[j]->getNumber(); 606 } 607 608 OS << '\n'; 609} 610 611void MachineJumpTableInfo::dump() const { print(dbgs()); } 612 613 614//===----------------------------------------------------------------------===// 615// MachineConstantPool implementation 616//===----------------------------------------------------------------------===// 617 618const Type *MachineConstantPoolEntry::getType() const { 619 if (isMachineConstantPoolEntry()) 620 return Val.MachineCPVal->getType(); 621 return Val.ConstVal->getType(); 622} 623 624 625unsigned MachineConstantPoolEntry::getRelocationInfo() const { 626 if (isMachineConstantPoolEntry()) 627 return Val.MachineCPVal->getRelocationInfo(); 628 return Val.ConstVal->getRelocationInfo(); 629} 630 631MachineConstantPool::~MachineConstantPool() { 632 for (unsigned i = 0, e = Constants.size(); i != e; ++i) 633 if (Constants[i].isMachineConstantPoolEntry()) 634 delete Constants[i].Val.MachineCPVal; 635} 636 637/// CanShareConstantPoolEntry - Test whether the given two constants 638/// can be allocated the same constant pool entry. 639static bool CanShareConstantPoolEntry(const Constant *A, const Constant *B, 640 const TargetData *TD) { 641 // Handle the trivial case quickly. 642 if (A == B) return true; 643 644 // If they have the same type but weren't the same constant, quickly 645 // reject them. 646 if (A->getType() == B->getType()) return false; 647 648 // For now, only support constants with the same size. 649 if (TD->getTypeStoreSize(A->getType()) != TD->getTypeStoreSize(B->getType())) 650 return false; 651 652 // If a floating-point value and an integer value have the same encoding, 653 // they can share a constant-pool entry. 654 if (const ConstantFP *AFP = dyn_cast<ConstantFP>(A)) 655 if (const ConstantInt *BI = dyn_cast<ConstantInt>(B)) 656 return AFP->getValueAPF().bitcastToAPInt() == BI->getValue(); 657 if (const ConstantFP *BFP = dyn_cast<ConstantFP>(B)) 658 if (const ConstantInt *AI = dyn_cast<ConstantInt>(A)) 659 return BFP->getValueAPF().bitcastToAPInt() == AI->getValue(); 660 661 // Two vectors can share an entry if each pair of corresponding 662 // elements could. 663 if (const ConstantVector *AV = dyn_cast<ConstantVector>(A)) 664 if (const ConstantVector *BV = dyn_cast<ConstantVector>(B)) { 665 if (AV->getType()->getNumElements() != BV->getType()->getNumElements()) 666 return false; 667 for (unsigned i = 0, e = AV->getType()->getNumElements(); i != e; ++i) 668 if (!CanShareConstantPoolEntry(AV->getOperand(i), 669 BV->getOperand(i), TD)) 670 return false; 671 return true; 672 } 673 674 // TODO: Handle other cases. 675 676 return false; 677} 678 679/// getConstantPoolIndex - Create a new entry in the constant pool or return 680/// an existing one. User must specify the log2 of the minimum required 681/// alignment for the object. 682/// 683unsigned MachineConstantPool::getConstantPoolIndex(const Constant *C, 684 unsigned Alignment) { 685 assert(Alignment && "Alignment must be specified!"); 686 if (Alignment > PoolAlignment) PoolAlignment = Alignment; 687 688 // Check to see if we already have this constant. 689 // 690 // FIXME, this could be made much more efficient for large constant pools. 691 for (unsigned i = 0, e = Constants.size(); i != e; ++i) 692 if (!Constants[i].isMachineConstantPoolEntry() && 693 CanShareConstantPoolEntry(Constants[i].Val.ConstVal, C, TD)) { 694 if ((unsigned)Constants[i].getAlignment() < Alignment) 695 Constants[i].Alignment = Alignment; 696 return i; 697 } 698 699 Constants.push_back(MachineConstantPoolEntry(C, Alignment)); 700 return Constants.size()-1; 701} 702 703unsigned MachineConstantPool::getConstantPoolIndex(MachineConstantPoolValue *V, 704 unsigned Alignment) { 705 assert(Alignment && "Alignment must be specified!"); 706 if (Alignment > PoolAlignment) PoolAlignment = Alignment; 707 708 // Check to see if we already have this constant. 709 // 710 // FIXME, this could be made much more efficient for large constant pools. 711 int Idx = V->getExistingMachineCPValue(this, Alignment); 712 if (Idx != -1) 713 return (unsigned)Idx; 714 715 Constants.push_back(MachineConstantPoolEntry(V, Alignment)); 716 return Constants.size()-1; 717} 718 719void MachineConstantPool::print(raw_ostream &OS) const { 720 if (Constants.empty()) return; 721 722 OS << "Constant Pool:\n"; 723 for (unsigned i = 0, e = Constants.size(); i != e; ++i) { 724 OS << " cp#" << i << ": "; 725 if (Constants[i].isMachineConstantPoolEntry()) 726 Constants[i].Val.MachineCPVal->print(OS); 727 else 728 OS << *(Value*)Constants[i].Val.ConstVal; 729 OS << ", align=" << Constants[i].getAlignment(); 730 OS << "\n"; 731 } 732} 733 734void MachineConstantPool::dump() const { print(dbgs()); } 735