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