diff options
| author | Chris Lattner <sabre@nondot.org> | 2009-07-22 00:28:43 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2009-07-22 00:28:43 +0000 |
| commit | b300a4f9884c996fd980f582b0a250e0e5bb96b4 (patch) | |
| tree | 74daaa0f3c48ff7fa403a94720b95d09a483b18b /llvm/lib/CodeGen/AsmPrinter/AsmPrinter.cpp | |
| parent | 168190d8225418b755a81daa6ba8082672a3b335 (diff) | |
| download | bcm5719-llvm-b300a4f9884c996fd980f582b0a250e0e5bb96b4.tar.gz bcm5719-llvm-b300a4f9884c996fd980f582b0a250e0e5bb96b4.zip | |
remove the SelectSectionForMachineConst hook, replacing it with
a new getSectionForMergableConstant hook. This removes one dependence
of TAI on Type, and provides the hook with enough info to make the
right decision based on whether the global has relocations etc.
llvm-svn: 76705
Diffstat (limited to 'llvm/lib/CodeGen/AsmPrinter/AsmPrinter.cpp')
| -rw-r--r-- | llvm/lib/CodeGen/AsmPrinter/AsmPrinter.cpp | 9 |
1 files changed, 7 insertions, 2 deletions
diff --git a/llvm/lib/CodeGen/AsmPrinter/AsmPrinter.cpp b/llvm/lib/CodeGen/AsmPrinter/AsmPrinter.cpp index 7b7a9a5a97a..e31a39c7a39 100644 --- a/llvm/lib/CodeGen/AsmPrinter/AsmPrinter.cpp +++ b/llvm/lib/CodeGen/AsmPrinter/AsmPrinter.cpp @@ -302,13 +302,18 @@ void AsmPrinter::EmitConstantPool(MachineConstantPool *MCP) { const std::vector<MachineConstantPoolEntry> &CP = MCP->getConstants(); if (CP.empty()) return; + const TargetData &TD = *TM.getTargetData(); + // Calculate sections for constant pool entries. We collect entries to go into // the same section together to reduce amount of section switch statements. SmallVector<SectionCPs, 4> CPSections; for (unsigned i = 0, e = CP.size(); i != e; ++i) { - MachineConstantPoolEntry CPE = CP[i]; + const MachineConstantPoolEntry &CPE = CP[i]; unsigned Align = CPE.getAlignment(); - const Section* S = TAI->SelectSectionForMachineConst(CPE.getType()); + uint64_t Size = TD.getTypeAllocSize(CPE.getType()); + const Section *S = + TAI->getSectionForMergableConstant(Size, CPE.getRelocationInfo()); + // The number of sections are small, just do a linear search from the // last section to the first. bool Found = false; |

