MachineFunction.cpp revision e2f669fb3fa7a6bee4196999b119a98f31c072a3 
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/TargetFrameLowering.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                                 GCModuleInfo* gmi)
57  : Fn(F), Target(TM), Ctx(mmi.getContext()), MMI(mmi), GMI(gmi) {
58  if (TM.getRegisterInfo())
59    RegInfo = new (Allocator) MachineRegisterInfo(*TM.getRegisterInfo());
60  else
61    RegInfo = 0;
62  MFInfo = 0;
63  FrameInfo = new (Allocator) MachineFrameInfo(*TM.getFrameLowering());
64  if (Fn->hasFnAttr(Attribute::StackAlignment))
65    FrameInfo->setMaxAlignment(Attribute::getStackAlignmentFromAttrs(
66        Fn->getAttributes().getFnAttributes()));
67  ConstantPool = new (Allocator) MachineConstantPool(TM.getTargetData());
68  Alignment = TM.getTargetLowering()->getFunctionAlignment(F);
69  FunctionNumber = FunctionNum;
70  JumpTableInfo = 0;
71}
72
73MachineFunction::~MachineFunction() {
74  BasicBlocks.clear();
75  InstructionRecycler.clear(Allocator);
76  BasicBlockRecycler.clear(Allocator);
77  if (RegInfo) {
78    RegInfo->~MachineRegisterInfo();
79    Allocator.Deallocate(RegInfo);
80  }
81  if (MFInfo) {
82    MFInfo->~MachineFunctionInfo();
83    Allocator.Deallocate(MFInfo);
84  }
85  FrameInfo->~MachineFrameInfo();         Allocator.Deallocate(FrameInfo);
86  ConstantPool->~MachineConstantPool();   Allocator.Deallocate(ConstantPool);
87
88  if (JumpTableInfo) {
89    JumpTableInfo->~MachineJumpTableInfo();
90    Allocator.Deallocate(JumpTableInfo);
91  }
92}
93
94/// getOrCreateJumpTableInfo - Get the JumpTableInfo for this function, if it
95/// does already exist, allocate one.
96MachineJumpTableInfo *MachineFunction::
97getOrCreateJumpTableInfo(unsigned EntryKind) {
98  if (JumpTableInfo) return JumpTableInfo;
99
100  JumpTableInfo = new (Allocator)
101    MachineJumpTableInfo((MachineJumpTableInfo::JTEntryKind)EntryKind);
102  return JumpTableInfo;
103}
104
105/// RenumberBlocks - This discards all of the MachineBasicBlock numbers and
106/// recomputes them.  This guarantees that the MBB numbers are sequential,
107/// dense, and match the ordering of the blocks within the function.  If a
108/// specific MachineBasicBlock is specified, only that block and those after
109/// it are renumbered.
110void MachineFunction::RenumberBlocks(MachineBasicBlock *MBB) {
111  if (empty()) { MBBNumbering.clear(); return; }
112  MachineFunction::iterator MBBI, E = end();
113  if (MBB == 0)
114    MBBI = begin();
115  else
116    MBBI = MBB;
117
118  // Figure out the block number this should have.
119  unsigned BlockNo = 0;
120  if (MBBI != begin())
121    BlockNo = prior(MBBI)->getNumber()+1;
122
123  for (; MBBI != E; ++MBBI, ++BlockNo) {
124    if (MBBI->getNumber() != (int)BlockNo) {
125      // Remove use of the old number.
126      if (MBBI->getNumber() != -1) {
127        assert(MBBNumbering[MBBI->getNumber()] == &*MBBI &&
128               "MBB number mismatch!");
129        MBBNumbering[MBBI->getNumber()] = 0;
130      }
131
132      // If BlockNo is already taken, set that block's number to -1.
133      if (MBBNumbering[BlockNo])
134        MBBNumbering[BlockNo]->setNumber(-1);
135
136      MBBNumbering[BlockNo] = MBBI;
137      MBBI->setNumber(BlockNo);
138    }
139  }
140
141  // Okay, all the blocks are renumbered.  If we have compactified the block
142  // numbering, shrink MBBNumbering now.
143  assert(BlockNo <= MBBNumbering.size() && "Mismatch!");
144  MBBNumbering.resize(BlockNo);
145}
146
147/// CreateMachineInstr - Allocate a new MachineInstr. Use this instead
148/// of `new MachineInstr'.
149///
150MachineInstr *
151MachineFunction::CreateMachineInstr(const TargetInstrDesc &TID,
152                                    DebugLoc DL, bool NoImp) {
153  return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
154    MachineInstr(TID, DL, NoImp);
155}
156
157/// CloneMachineInstr - Create a new MachineInstr which is a copy of the
158/// 'Orig' instruction, identical in all ways except the instruction
159/// has no parent, prev, or next.
160///
161MachineInstr *
162MachineFunction::CloneMachineInstr(const MachineInstr *Orig) {
163  return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
164             MachineInstr(*this, *Orig);
165}
166
167/// DeleteMachineInstr - Delete the given MachineInstr.
168///
169void
170MachineFunction::DeleteMachineInstr(MachineInstr *MI) {
171  MI->~MachineInstr();
172  InstructionRecycler.Deallocate(Allocator, MI);
173}
174
175/// CreateMachineBasicBlock - Allocate a new MachineBasicBlock. Use this
176/// instead of `new MachineBasicBlock'.
177///
178MachineBasicBlock *
179MachineFunction::CreateMachineBasicBlock(const BasicBlock *bb) {
180  return new (BasicBlockRecycler.Allocate<MachineBasicBlock>(Allocator))
181             MachineBasicBlock(*this, bb);
182}
183
184/// DeleteMachineBasicBlock - Delete the given MachineBasicBlock.
185///
186void
187MachineFunction::DeleteMachineBasicBlock(MachineBasicBlock *MBB) {
188  assert(MBB->getParent() == this && "MBB parent mismatch!");
189  MBB->~MachineBasicBlock();
190  BasicBlockRecycler.Deallocate(Allocator, MBB);
191}
192
193MachineMemOperand *
194MachineFunction::getMachineMemOperand(MachinePointerInfo PtrInfo, unsigned f,
195                                      uint64_t s, unsigned base_alignment,
196                                      const MDNode *TBAAInfo) {
197  return new (Allocator) MachineMemOperand(PtrInfo, f, s, base_alignment,
198                                           TBAAInfo);
199}
200
201MachineMemOperand *
202MachineFunction::getMachineMemOperand(const MachineMemOperand *MMO,
203                                      int64_t Offset, uint64_t Size) {
204  return new (Allocator)
205             MachineMemOperand(MachinePointerInfo(MMO->getValue(),
206                                                  MMO->getOffset()+Offset),
207                               MMO->getFlags(), Size,
208                               MMO->getBaseAlignment(), 0);
209}
210
211MachineInstr::mmo_iterator
212MachineFunction::allocateMemRefsArray(unsigned long Num) {
213  return Allocator.Allocate<MachineMemOperand *>(Num);
214}
215
216std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
217MachineFunction::extractLoadMemRefs(MachineInstr::mmo_iterator Begin,
218                                    MachineInstr::mmo_iterator End) {
219  // Count the number of load mem refs.
220  unsigned Num = 0;
221  for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
222    if ((*I)->isLoad())
223      ++Num;
224
225  // Allocate a new array and populate it with the load information.
226  MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
227  unsigned Index = 0;
228  for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
229    if ((*I)->isLoad()) {
230      if (!(*I)->isStore())
231        // Reuse the MMO.
232        Result[Index] = *I;
233      else {
234        // Clone the MMO and unset the store flag.
235        MachineMemOperand *JustLoad =
236          getMachineMemOperand((*I)->getPointerInfo(),
237                               (*I)->getFlags() & ~MachineMemOperand::MOStore,
238                               (*I)->getSize(), (*I)->getBaseAlignment(),
239                               (*I)->getTBAAInfo());
240        Result[Index] = JustLoad;
241      }
242      ++Index;
243    }
244  }
245  return std::make_pair(Result, Result + Num);
246}
247
248std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
249MachineFunction::extractStoreMemRefs(MachineInstr::mmo_iterator Begin,
250                                     MachineInstr::mmo_iterator End) {
251  // Count the number of load mem refs.
252  unsigned Num = 0;
253  for (MachineInstr::mmo_iterator I = Begin; I != End; ++I)
254    if ((*I)->isStore())
255      ++Num;
256
257  // Allocate a new array and populate it with the store information.
258  MachineInstr::mmo_iterator Result = allocateMemRefsArray(Num);
259  unsigned Index = 0;
260  for (MachineInstr::mmo_iterator I = Begin; I != End; ++I) {
261    if ((*I)->isStore()) {
262      if (!(*I)->isLoad())
263        // Reuse the MMO.
264        Result[Index] = *I;
265      else {
266        // Clone the MMO and unset the load flag.
267        MachineMemOperand *JustStore =
268          getMachineMemOperand((*I)->getPointerInfo(),
269                               (*I)->getFlags() & ~MachineMemOperand::MOLoad,
270                               (*I)->getSize(), (*I)->getBaseAlignment(),
271                               (*I)->getTBAAInfo());
272        Result[Index] = JustStore;
273      }
274      ++Index;
275    }
276  }
277  return std::make_pair(Result, Result + Num);
278}
279
280void MachineFunction::dump() const {
281  print(dbgs());
282}
283
284void MachineFunction::print(raw_ostream &OS, SlotIndexes *Indexes) const {
285  OS << "# Machine code for function " << Fn->getName() << ":\n";
286
287  // Print Frame Information
288  FrameInfo->print(*this, OS);
289
290  // Print JumpTable Information
291  if (JumpTableInfo)
292    JumpTableInfo->print(OS);
293
294  // Print Constant Pool
295  ConstantPool->print(OS);
296
297  const TargetRegisterInfo *TRI = getTarget().getRegisterInfo();
298
299  if (RegInfo && !RegInfo->livein_empty()) {
300    OS << "Function Live Ins: ";
301    for (MachineRegisterInfo::livein_iterator
302         I = RegInfo->livein_begin(), E = RegInfo->livein_end(); I != E; ++I) {
303      OS << PrintReg(I->first, TRI);
304      if (I->second)
305        OS << " in " << PrintReg(I->second, TRI);
306      if (llvm::next(I) != E)
307        OS << ", ";
308    }
309    OS << '\n';
310  }
311  if (RegInfo && !RegInfo->liveout_empty()) {
312    OS << "Function Live Outs:";
313    for (MachineRegisterInfo::liveout_iterator
314         I = RegInfo->liveout_begin(), E = RegInfo->liveout_end(); I != E; ++I)
315      OS << ' ' << PrintReg(*I, TRI);
316    OS << '\n';
317  }
318
319  for (const_iterator BB = begin(), E = end(); BB != E; ++BB) {
320    OS << '\n';
321    BB->print(OS, Indexes);
322  }
323
324  OS << "\n# End machine code for function " << Fn->getName() << ".\n\n";
325}
326
327namespace llvm {
328  template<>
329  struct DOTGraphTraits<const MachineFunction*> : public DefaultDOTGraphTraits {
330
331  DOTGraphTraits (bool isSimple=false) : DefaultDOTGraphTraits(isSimple) {}
332
333    static std::string getGraphName(const MachineFunction *F) {
334      return "CFG for '" + F->getFunction()->getNameStr() + "' function";
335    }
336
337    std::string getNodeLabel(const MachineBasicBlock *Node,
338                             const MachineFunction *Graph) {
339      std::string OutStr;
340      {
341        raw_string_ostream OSS(OutStr);
342
343        if (isSimple()) {
344          OSS << "BB#" << Node->getNumber();
345          if (const BasicBlock *BB = Node->getBasicBlock())
346            OSS << ": " << BB->getName();
347        } else
348          Node->print(OSS);
349      }
350
351      if (OutStr[0] == '\n') OutStr.erase(OutStr.begin());
352
353      // Process string output to make it nicer...
354      for (unsigned i = 0; i != OutStr.length(); ++i)
355        if (OutStr[i] == '\n') {                            // Left justify
356          OutStr[i] = '\\';
357          OutStr.insert(OutStr.begin()+i+1, 'l');
358        }
359      return OutStr;
360    }
361  };
362}
363
364void MachineFunction::viewCFG() const
365{
366#ifndef NDEBUG
367  ViewGraph(this, "mf" + getFunction()->getNameStr());
368#else
369  errs() << "MachineFunction::viewCFG is only available in debug builds on "
370         << "systems with Graphviz or gv!\n";
371#endif // NDEBUG
372}
373
374void MachineFunction::viewCFGOnly() const
375{
376#ifndef NDEBUG
377  ViewGraph(this, "mf" + getFunction()->getNameStr(), true);
378#else
379  errs() << "MachineFunction::viewCFGOnly is only available in debug builds on "
380         << "systems with Graphviz or gv!\n";
381#endif // NDEBUG
382}
383
384/// addLiveIn - Add the specified physical register as a live-in value and
385/// create a corresponding virtual register for it.
386unsigned MachineFunction::addLiveIn(unsigned PReg,
387                                    const TargetRegisterClass *RC) {
388  MachineRegisterInfo &MRI = getRegInfo();
389  unsigned VReg = MRI.getLiveInVirtReg(PReg);
390  if (VReg) {
391    assert(MRI.getRegClass(VReg) == RC && "Register class mismatch!");
392    return VReg;
393  }
394  VReg = MRI.createVirtualRegister(RC);
395  MRI.addLiveIn(PReg, VReg);
396  return VReg;
397}
398
399/// getJTISymbol - Return the MCSymbol for the specified non-empty jump table.
400/// If isLinkerPrivate is specified, an 'l' label is returned, otherwise a
401/// normal 'L' label is returned.
402MCSymbol *MachineFunction::getJTISymbol(unsigned JTI, MCContext &Ctx,
403                                        bool isLinkerPrivate) const {
404  assert(JumpTableInfo && "No jump tables");
405
406  assert(JTI < JumpTableInfo->getJumpTables().size() && "Invalid JTI!");
407  const MCAsmInfo &MAI = *getTarget().getMCAsmInfo();
408
409  const char *Prefix = isLinkerPrivate ? MAI.getLinkerPrivateGlobalPrefix() :
410                                         MAI.getPrivateGlobalPrefix();
411  SmallString<60> Name;
412  raw_svector_ostream(Name)
413    << Prefix << "JTI" << getFunctionNumber() << '_' << JTI;
414  return Ctx.GetOrCreateSymbol(Name.str());
415}
416
417/// getPICBaseSymbol - Return a function-local symbol to represent the PIC
418/// base.
419MCSymbol *MachineFunction::getPICBaseSymbol() const {
420  const MCAsmInfo &MAI = *Target.getMCAsmInfo();
421  return Ctx.GetOrCreateSymbol(Twine(MAI.getPrivateGlobalPrefix())+
422                               Twine(getFunctionNumber())+"$pb");
423}
424
425//===----------------------------------------------------------------------===//
426//  MachineFrameInfo implementation
427//===----------------------------------------------------------------------===//
428
429/// CreateFixedObject - Create a new object at a fixed location on the stack.
430/// All fixed objects should be created before other objects are created for
431/// efficiency. By default, fixed objects are immutable. This returns an
432/// index with a negative value.
433///
434int MachineFrameInfo::CreateFixedObject(uint64_t Size, int64_t SPOffset,
435                                        bool Immutable) {
436  assert(Size != 0 && "Cannot allocate zero size fixed stack objects!");
437  // The alignment of the frame index can be determined from its offset from
438  // the incoming frame position.  If the frame object is at offset 32 and
439  // the stack is guaranteed to be 16-byte aligned, then we know that the
440  // object is 16-byte aligned.
441  unsigned StackAlign = TFI.getStackAlignment();
442  unsigned Align = MinAlign(SPOffset, StackAlign);
443  Objects.insert(Objects.begin(), StackObject(Size, Align, SPOffset, Immutable,
444                                              /*isSS*/false, false));
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 TargetFrameLowering *FI = MF.getTarget().getFrameLowering();
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  for (DenseSet<MachineConstantPoolValue*>::iterator I =
636       MachineCPVsSharingEntries.begin(), E = MachineCPVsSharingEntries.end();
637       I != E; ++I)
638    delete *I;
639}
640
641/// CanShareConstantPoolEntry - Test whether the given two constants
642/// can be allocated the same constant pool entry.
643static bool CanShareConstantPoolEntry(const Constant *A, const Constant *B,
644                                      const TargetData *TD) {
645  // Handle the trivial case quickly.
646  if (A == B) return true;
647
648  // If they have the same type but weren't the same constant, quickly
649  // reject them.
650  if (A->getType() == B->getType()) return false;
651
652  // For now, only support constants with the same size.
653  if (TD->getTypeStoreSize(A->getType()) != TD->getTypeStoreSize(B->getType()))
654    return false;
655
656  // If a floating-point value and an integer value have the same encoding,
657  // they can share a constant-pool entry.
658  if (const ConstantFP *AFP = dyn_cast<ConstantFP>(A))
659    if (const ConstantInt *BI = dyn_cast<ConstantInt>(B))
660      return AFP->getValueAPF().bitcastToAPInt() == BI->getValue();
661  if (const ConstantFP *BFP = dyn_cast<ConstantFP>(B))
662    if (const ConstantInt *AI = dyn_cast<ConstantInt>(A))
663      return BFP->getValueAPF().bitcastToAPInt() == AI->getValue();
664
665  // Two vectors can share an entry if each pair of corresponding
666  // elements could.
667  if (const ConstantVector *AV = dyn_cast<ConstantVector>(A))
668    if (const ConstantVector *BV = dyn_cast<ConstantVector>(B)) {
669      if (AV->getType()->getNumElements() != BV->getType()->getNumElements())
670        return false;
671      for (unsigned i = 0, e = AV->getType()->getNumElements(); i != e; ++i)
672        if (!CanShareConstantPoolEntry(AV->getOperand(i),
673                                       BV->getOperand(i), TD))
674          return false;
675      return true;
676    }
677
678  // TODO: Handle other cases.
679
680  return false;
681}
682
683/// getConstantPoolIndex - Create a new entry in the constant pool or return
684/// an existing one.  User must specify the log2 of the minimum required
685/// alignment for the object.
686///
687unsigned MachineConstantPool::getConstantPoolIndex(const Constant *C,
688                                                   unsigned Alignment) {
689  assert(Alignment && "Alignment must be specified!");
690  if (Alignment > PoolAlignment) PoolAlignment = Alignment;
691
692  // Check to see if we already have this constant.
693  //
694  // FIXME, this could be made much more efficient for large constant pools.
695  for (unsigned i = 0, e = Constants.size(); i != e; ++i)
696    if (!Constants[i].isMachineConstantPoolEntry() &&
697        CanShareConstantPoolEntry(Constants[i].Val.ConstVal, C, TD)) {
698      if ((unsigned)Constants[i].getAlignment() < Alignment)
699        Constants[i].Alignment = Alignment;
700      return i;
701    }
702
703  Constants.push_back(MachineConstantPoolEntry(C, Alignment));
704  return Constants.size()-1;
705}
706
707unsigned MachineConstantPool::getConstantPoolIndex(MachineConstantPoolValue *V,
708                                                   unsigned Alignment) {
709  assert(Alignment && "Alignment must be specified!");
710  if (Alignment > PoolAlignment) PoolAlignment = Alignment;
711
712  // Check to see if we already have this constant.
713  //
714  // FIXME, this could be made much more efficient for large constant pools.
715  int Idx = V->getExistingMachineCPValue(this, Alignment);
716  if (Idx != -1) {
717    MachineCPVsSharingEntries.insert(V);
718    return (unsigned)Idx;
719  }
720
721  Constants.push_back(MachineConstantPoolEntry(V, Alignment));
722  return Constants.size()-1;
723}
724
725void MachineConstantPool::print(raw_ostream &OS) const {
726  if (Constants.empty()) return;
727
728  OS << "Constant Pool:\n";
729  for (unsigned i = 0, e = Constants.size(); i != e; ++i) {
730    OS << "  cp#" << i << ": ";
731    if (Constants[i].isMachineConstantPoolEntry())
732      Constants[i].Val.MachineCPVal->print(OS);
733    else
734      OS << *(Value*)Constants[i].Val.ConstVal;
735    OS << ", align=" << Constants[i].getAlignment();
736    OS << "\n";
737  }
738}
739
740void MachineConstantPool::dump() const { print(dbgs()); }
741