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