MachineFunction.cpp revision f5a86f45e75ec744c203270ffa03659eb0a220c1 
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"
35using namespace llvm;
36
37namespace {
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;
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///
66FunctionPass *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.
76MachineFunctionInfo::~MachineFunctionInfo() {}
77
78void ilist_traits<MachineBasicBlock>::deleteNode(MachineBasicBlock *MBB) {
79  MBB->getParent()->DeleteMachineBasicBlock(MBB);
80}
81
82MachineFunction::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
108MachineFunction::~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.
131void 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///
171MachineInstr *
172MachineFunction::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///
182MachineInstr *
183MachineFunction::CloneMachineInstr(const MachineInstr *Orig) {
184  return new (InstructionRecycler.Allocate<MachineInstr>(Allocator))
185             MachineInstr(*this, *Orig);
186}
187
188/// DeleteMachineInstr - Delete the given MachineInstr.
189///
190void
191MachineFunction::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///
199MachineBasicBlock *
200MachineFunction::CreateMachineBasicBlock(const BasicBlock *bb) {
201  return new (BasicBlockRecycler.Allocate<MachineBasicBlock>(Allocator))
202             MachineBasicBlock(*this, bb);
203}
204
205/// DeleteMachineBasicBlock - Delete the given MachineBasicBlock.
206///
207void
208MachineFunction::DeleteMachineBasicBlock(MachineBasicBlock *MBB) {
209  assert(MBB->getParent() == this && "MBB parent mismatch!");
210  MBB->~MachineBasicBlock();
211  BasicBlockRecycler.Deallocate(Allocator, MBB);
212}
213
214MachineMemOperand *
215MachineFunction::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
222MachineMemOperand *
223MachineFunction::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
232MachineInstr::mmo_iterator
233MachineFunction::allocateMemRefsArray(unsigned long Num) {
234  return Allocator.Allocate<MachineMemOperand *>(Num);
235}
236
237std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
238MachineFunction::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
269std::pair<MachineInstr::mmo_iterator, MachineInstr::mmo_iterator>
270MachineFunction::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
301void MachineFunction::dump() const {
302  print(errs());
303}
304
305void MachineFunction::print(raw_ostream &OS) const {
306  OS << "# Machine code for " << 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 << "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 << " Reg #" << I->first;
327
328      if (I->second)
329        OS << " in VR#" << I->second << ' ';
330    }
331    OS << '\n';
332  }
333  if (RegInfo && !RegInfo->liveout_empty()) {
334    OS << "Live Outs:";
335    for (MachineRegisterInfo::liveout_iterator
336         I = RegInfo->liveout_begin(), E = RegInfo->liveout_end(); I != E; ++I)
337      if (TRI)
338        OS << ' ' << TRI->getName(*I);
339      else
340        OS << " Reg #" << *I;
341    OS << '\n';
342  }
343
344  for (const_iterator BB = begin(), E = end(); BB != E; ++BB)
345    BB->print(OS);
346
347  OS << "\n# End machine code for " << Fn->getName() << "().\n\n";
348}
349
350namespace llvm {
351  template<>
352  struct DOTGraphTraits<const MachineFunction*> : public DefaultDOTGraphTraits {
353    static std::string getGraphName(const MachineFunction *F) {
354      return "CFG for '" + F->getFunction()->getNameStr() + "' function";
355    }
356
357    static std::string getNodeLabel(const MachineBasicBlock *Node,
358                                    const MachineFunction *Graph,
359                                    bool ShortNames) {
360      if (ShortNames && Node->getBasicBlock() &&
361          !Node->getBasicBlock()->getName().empty())
362        return Node->getBasicBlock()->getNameStr() + ":";
363
364      std::string OutStr;
365      {
366        raw_string_ostream OSS(OutStr);
367
368        if (ShortNames)
369          OSS << Node->getNumber() << ':';
370        else
371          Node->print(OSS);
372      }
373
374      if (OutStr[0] == '\n') OutStr.erase(OutStr.begin());
375
376      // Process string output to make it nicer...
377      for (unsigned i = 0; i != OutStr.length(); ++i)
378        if (OutStr[i] == '\n') {                            // Left justify
379          OutStr[i] = '\\';
380          OutStr.insert(OutStr.begin()+i+1, 'l');
381        }
382      return OutStr;
383    }
384  };
385}
386
387void MachineFunction::viewCFG() const
388{
389#ifndef NDEBUG
390  ViewGraph(this, "mf" + getFunction()->getNameStr());
391#else
392  errs() << "SelectionDAG::viewGraph is only available in debug builds on "
393         << "systems with Graphviz or gv!\n";
394#endif // NDEBUG
395}
396
397void MachineFunction::viewCFGOnly() const
398{
399#ifndef NDEBUG
400  ViewGraph(this, "mf" + getFunction()->getNameStr(), true);
401#else
402  errs() << "SelectionDAG::viewGraph is only available in debug builds on "
403         << "systems with Graphviz or gv!\n";
404#endif // NDEBUG
405}
406
407/// addLiveIn - Add the specified physical register as a live-in value and
408/// create a corresponding virtual register for it.
409unsigned MachineFunction::addLiveIn(unsigned PReg,
410                                    const TargetRegisterClass *RC) {
411  assert(RC->contains(PReg) && "Not the correct regclass!");
412  unsigned VReg = getRegInfo().createVirtualRegister(RC);
413  getRegInfo().addLiveIn(PReg, VReg);
414  return VReg;
415}
416
417/// getDebugLocTuple - Get the DebugLocTuple for a given DebugLoc object.
418DebugLocTuple MachineFunction::getDebugLocTuple(DebugLoc DL) const {
419  unsigned Idx = DL.getIndex();
420  assert(Idx < DebugLocInfo.DebugLocations.size() &&
421         "Invalid index into debug locations!");
422  return DebugLocInfo.DebugLocations[Idx];
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  Objects.insert(Objects.begin(), StackObject(Size, 1, SPOffset, Immutable));
438  return -++NumFixedObjects;
439}
440
441
442BitVector
443MachineFrameInfo::getPristineRegs(const MachineBasicBlock *MBB) const {
444  assert(MBB && "MBB must be valid");
445  const MachineFunction *MF = MBB->getParent();
446  assert(MF && "MBB must be part of a MachineFunction");
447  const TargetMachine &TM = MF->getTarget();
448  const TargetRegisterInfo *TRI = TM.getRegisterInfo();
449  BitVector BV(TRI->getNumRegs());
450
451  // Before CSI is calculated, no registers are considered pristine. They can be
452  // freely used and PEI will make sure they are saved.
453  if (!isCalleeSavedInfoValid())
454    return BV;
455
456  for (const unsigned *CSR = TRI->getCalleeSavedRegs(MF); CSR && *CSR; ++CSR)
457    BV.set(*CSR);
458
459  // The entry MBB always has all CSRs pristine.
460  if (MBB == &MF->front())
461    return BV;
462
463  // On other MBBs the saved CSRs are not pristine.
464  const std::vector<CalleeSavedInfo> &CSI = getCalleeSavedInfo();
465  for (std::vector<CalleeSavedInfo>::const_iterator I = CSI.begin(),
466         E = CSI.end(); I != E; ++I)
467    BV.reset(I->getReg());
468
469  return BV;
470}
471
472
473void MachineFrameInfo::print(const MachineFunction &MF, raw_ostream &OS) const{
474  const TargetFrameInfo *FI = MF.getTarget().getFrameInfo();
475  int ValOffset = (FI ? FI->getOffsetOfLocalArea() : 0);
476
477  for (unsigned i = 0, e = Objects.size(); i != e; ++i) {
478    const StackObject &SO = Objects[i];
479    OS << "  <fi#" << (int)(i-NumFixedObjects) << ">: ";
480    if (SO.Size == ~0ULL) {
481      OS << "dead\n";
482      continue;
483    }
484    if (SO.Size == 0)
485      OS << "variable sized";
486    else
487      OS << "size is " << SO.Size << " byte" << (SO.Size != 1 ? "s," : ",");
488    OS << " alignment is " << SO.Alignment << " byte"
489       << (SO.Alignment != 1 ? "s," : ",");
490
491    if (i < NumFixedObjects)
492      OS << " fixed";
493    if (i < NumFixedObjects || SO.SPOffset != -1) {
494      int64_t Off = SO.SPOffset - ValOffset;
495      OS << " at location [SP";
496      if (Off > 0)
497        OS << "+" << Off;
498      else if (Off < 0)
499        OS << Off;
500      OS << "]";
501    }
502    OS << "\n";
503  }
504
505  if (HasVarSizedObjects)
506    OS << "  Stack frame contains variable sized objects\n";
507}
508
509void MachineFrameInfo::dump(const MachineFunction &MF) const {
510  print(MF, errs());
511}
512
513//===----------------------------------------------------------------------===//
514//  MachineJumpTableInfo implementation
515//===----------------------------------------------------------------------===//
516
517/// getJumpTableIndex - Create a new jump table entry in the jump table info
518/// or return an existing one.
519///
520unsigned MachineJumpTableInfo::getJumpTableIndex(
521                               const std::vector<MachineBasicBlock*> &DestBBs) {
522  assert(!DestBBs.empty() && "Cannot create an empty jump table!");
523  for (unsigned i = 0, e = JumpTables.size(); i != e; ++i)
524    if (JumpTables[i].MBBs == DestBBs)
525      return i;
526
527  JumpTables.push_back(MachineJumpTableEntry(DestBBs));
528  return JumpTables.size()-1;
529}
530
531/// ReplaceMBBInJumpTables - If Old is the target of any jump tables, update
532/// the jump tables to branch to New instead.
533bool
534MachineJumpTableInfo::ReplaceMBBInJumpTables(MachineBasicBlock *Old,
535                                             MachineBasicBlock *New) {
536  assert(Old != New && "Not making a change?");
537  bool MadeChange = false;
538  for (size_t i = 0, e = JumpTables.size(); i != e; ++i) {
539    MachineJumpTableEntry &JTE = JumpTables[i];
540    for (size_t j = 0, e = JTE.MBBs.size(); j != e; ++j)
541      if (JTE.MBBs[j] == Old) {
542        JTE.MBBs[j] = New;
543        MadeChange = true;
544      }
545  }
546  return MadeChange;
547}
548
549void MachineJumpTableInfo::print(raw_ostream &OS) const {
550  // FIXME: this is lame, maybe we could print out the MBB numbers or something
551  // like {1, 2, 4, 5, 3, 0}
552  for (unsigned i = 0, e = JumpTables.size(); i != e; ++i) {
553    OS << "  <jt#" << i << "> has " << JumpTables[i].MBBs.size()
554       << " entries\n";
555  }
556}
557
558void MachineJumpTableInfo::dump() const { print(errs()); }
559
560
561//===----------------------------------------------------------------------===//
562//  MachineConstantPool implementation
563//===----------------------------------------------------------------------===//
564
565const Type *MachineConstantPoolEntry::getType() const {
566  if (isMachineConstantPoolEntry())
567    return Val.MachineCPVal->getType();
568  return Val.ConstVal->getType();
569}
570
571
572unsigned MachineConstantPoolEntry::getRelocationInfo() const {
573  if (isMachineConstantPoolEntry())
574    return Val.MachineCPVal->getRelocationInfo();
575  return Val.ConstVal->getRelocationInfo();
576}
577
578MachineConstantPool::~MachineConstantPool() {
579  for (unsigned i = 0, e = Constants.size(); i != e; ++i)
580    if (Constants[i].isMachineConstantPoolEntry())
581      delete Constants[i].Val.MachineCPVal;
582}
583
584/// getConstantPoolIndex - Create a new entry in the constant pool or return
585/// an existing one.  User must specify the log2 of the minimum required
586/// alignment for the object.
587///
588unsigned MachineConstantPool::getConstantPoolIndex(Constant *C,
589                                                   unsigned Alignment) {
590  assert(Alignment && "Alignment must be specified!");
591  if (Alignment > PoolAlignment) PoolAlignment = Alignment;
592
593  // Check to see if we already have this constant.
594  //
595  // FIXME, this could be made much more efficient for large constant pools.
596  for (unsigned i = 0, e = Constants.size(); i != e; ++i)
597    if (Constants[i].Val.ConstVal == C &&
598        (Constants[i].getAlignment() & (Alignment - 1)) == 0)
599      return i;
600
601  Constants.push_back(MachineConstantPoolEntry(C, Alignment));
602  return Constants.size()-1;
603}
604
605unsigned MachineConstantPool::getConstantPoolIndex(MachineConstantPoolValue *V,
606                                                   unsigned Alignment) {
607  assert(Alignment && "Alignment must be specified!");
608  if (Alignment > PoolAlignment) PoolAlignment = Alignment;
609
610  // Check to see if we already have this constant.
611  //
612  // FIXME, this could be made much more efficient for large constant pools.
613  int Idx = V->getExistingMachineCPValue(this, Alignment);
614  if (Idx != -1)
615    return (unsigned)Idx;
616
617  Constants.push_back(MachineConstantPoolEntry(V, Alignment));
618  return Constants.size()-1;
619}
620
621void MachineConstantPool::print(raw_ostream &OS) const {
622  for (unsigned i = 0, e = Constants.size(); i != e; ++i) {
623    OS << "  <cp#" << i << "> is";
624    if (Constants[i].isMachineConstantPoolEntry())
625      Constants[i].Val.MachineCPVal->print(OS);
626    else
627      OS << *(Value*)Constants[i].Val.ConstVal;
628    OS << " , alignment=" << Constants[i].getAlignment();
629    OS << "\n";
630  }
631}
632
633void MachineConstantPool::dump() const { print(errs()); }
634