blob: 6af925cdae0fc45325803af0258c7eeb7f56a332 [file] [log] [blame]
Nate Begeman21e463b2005-10-16 05:39:50 +00001//===-- PPCTargetMachine.cpp - Define TargetMachine for PowerPC -----------===//
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002//
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00007//
Misha Brukman5dfe3a92004-06-21 16:55:25 +00008//===----------------------------------------------------------------------===//
Misha Brukmanb5f662f2005-04-21 23:30:14 +00009//
Chris Lattnerb0096bd2005-08-15 23:47:04 +000010// Top-level implementation for the PowerPC target.
Misha Brukman5dfe3a92004-06-21 16:55:25 +000011//
12//===----------------------------------------------------------------------===//
13
Chris Lattner26689592005-10-14 23:51:18 +000014#include "PPC.h"
15#include "PPCFrameInfo.h"
Chris Lattner16e71f22005-10-14 23:59:06 +000016#include "PPCTargetMachine.h"
Chris Lattnerb9459b72005-10-14 23:53:41 +000017#include "PPCJITInfo.h"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000018#include "llvm/Module.h"
19#include "llvm/PassManager.h"
Nate Begeman3d72d142005-08-04 20:49:48 +000020#include "llvm/Analysis/Verifier.h"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000021#include "llvm/CodeGen/MachineFunction.h"
22#include "llvm/CodeGen/Passes.h"
Chris Lattner68905bb2004-07-11 04:17:58 +000023#include "llvm/Target/TargetOptions.h"
Chris Lattnerd36c9702004-07-11 02:48:49 +000024#include "llvm/Target/TargetMachineRegistry.h"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000025#include "llvm/Transforms/Scalar.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000026#include "llvm/Support/CommandLine.h"
Chris Lattnerd36c9702004-07-11 02:48:49 +000027#include <iostream>
Misha Brukman5dfe3a92004-06-21 16:55:25 +000028using namespace llvm;
29
Nate Begeman7a4fe9b2004-08-11 07:40:04 +000030namespace {
Nate Begeman7a4fe9b2004-08-11 07:40:04 +000031 // Register the targets
Chris Lattner94de9a82006-06-16 01:37:27 +000032 RegisterTarget<PPC32TargetMachine>
33 X("ppc32", " PowerPC 32");
34 RegisterTarget<PPC64TargetMachine>
35 Y("ppc64", " PowerPC 64");
Nate Begeman7a4fe9b2004-08-11 07:40:04 +000036}
37
Chris Lattner94de9a82006-06-16 01:37:27 +000038unsigned PPC32TargetMachine::getJITMatchQuality() {
Misha Brukman01eca8d2004-07-12 23:36:12 +000039#if defined(__POWERPC__) || defined (__ppc__) || defined(_POWER)
Chris Lattner94de9a82006-06-16 01:37:27 +000040 if (sizeof(void*) == 4)
41 return 10;
Misha Brukman01eca8d2004-07-12 23:36:12 +000042#else
43 return 0;
44#endif
45}
Chris Lattner94de9a82006-06-16 01:37:27 +000046unsigned PPC64TargetMachine::getJITMatchQuality() {
47#if defined(__POWERPC__) || defined (__ppc__) || defined(_POWER)
48 if (sizeof(void*) == 8)
Chris Lattner90ac1c02006-07-06 17:10:42 +000049 return 10;
Chris Lattner94de9a82006-06-16 01:37:27 +000050#endif
51 return 0;
52}
Misha Brukman01eca8d2004-07-12 23:36:12 +000053
Chris Lattner94de9a82006-06-16 01:37:27 +000054unsigned PPC32TargetMachine::getModuleMatchQuality(const Module &M) {
Nate Begeman21e463b2005-10-16 05:39:50 +000055 // We strongly match "powerpc-*".
56 std::string TT = M.getTargetTriple();
57 if (TT.size() >= 8 && std::string(TT.begin(), TT.begin()+8) == "powerpc-")
58 return 20;
59
60 if (M.getEndianness() == Module::BigEndian &&
61 M.getPointerSize() == Module::Pointer32)
62 return 10; // Weak match
63 else if (M.getEndianness() != Module::AnyEndianness ||
64 M.getPointerSize() != Module::AnyPointerSize)
65 return 0; // Match for some other target
66
67 return getJITMatchQuality()/2;
68}
69
Chris Lattner94de9a82006-06-16 01:37:27 +000070unsigned PPC64TargetMachine::getModuleMatchQuality(const Module &M) {
71 // We strongly match "powerpc64-*".
72 std::string TT = M.getTargetTriple();
73 if (TT.size() >= 10 && std::string(TT.begin(), TT.begin()+10) == "powerpc64-")
74 return 20;
75
76 if (M.getEndianness() == Module::BigEndian &&
77 M.getPointerSize() == Module::Pointer64)
78 return 10; // Weak match
79 else if (M.getEndianness() != Module::AnyEndianness ||
80 M.getPointerSize() != Module::AnyPointerSize)
81 return 0; // Match for some other target
82
83 return getJITMatchQuality()/2;
84}
85
86
87PPCTargetMachine::PPCTargetMachine(const Module &M, const std::string &FS,
88 bool is64Bit)
89 : TargetMachine("PowerPC"), Subtarget(M, FS, is64Bit),
Chris Lattnerb1d26f62006-06-17 00:01:04 +000090 DataLayout(Subtarget.getTargetDataString()), InstrInfo(*this),
Chris Lattner94de9a82006-06-16 01:37:27 +000091 FrameInfo(*this, false), JITInfo(*this), TLInfo(*this),
92 InstrItins(Subtarget.getInstrItineraryData()) {
93
Evan Cheng4c1aa862006-02-22 20:19:42 +000094 if (getRelocationModel() == Reloc::Default)
95 if (Subtarget.isDarwin())
96 setRelocationModel(Reloc::DynamicNoPIC);
97 else
98 setRelocationModel(Reloc::PIC);
Nate Begeman21e463b2005-10-16 05:39:50 +000099}
100
Chris Lattner94de9a82006-06-16 01:37:27 +0000101PPC32TargetMachine::PPC32TargetMachine(const Module &M, const std::string &FS)
102 : PPCTargetMachine(M, FS, false) {
103}
104
105
106PPC64TargetMachine::PPC64TargetMachine(const Module &M, const std::string &FS)
107 : PPCTargetMachine(M, FS, true) {
108}
109
Chris Lattner0431c962005-06-25 02:48:37 +0000110/// addPassesToEmitFile - Add passes to the specified pass manager to implement
111/// a static compiler for this target.
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000112///
Nate Begeman21e463b2005-10-16 05:39:50 +0000113bool PPCTargetMachine::addPassesToEmitFile(PassManager &PM,
114 std::ostream &Out,
Chris Lattnerdf2e4252005-11-08 02:12:47 +0000115 CodeGenFileType FileType,
116 bool Fast) {
Chris Lattner0431c962005-06-25 02:48:37 +0000117 if (FileType != TargetMachine::AssemblyFile) return true;
Jim Laskeya7cea6f2006-01-04 13:52:30 +0000118
Chris Lattnerb0096bd2005-08-15 23:47:04 +0000119 // Run loop strength reduction before anything else.
Evan Cheng714554d2006-03-16 21:47:42 +0000120 if (!Fast) PM.add(createLoopStrengthReducePass(&TLInfo));
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000121
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000122 // FIXME: Implement efficient support for garbage collection intrinsics.
123 PM.add(createLowerGCPass());
124
125 // FIXME: Implement the invoke/unwind instructions!
126 PM.add(createLowerInvokePass());
Chris Lattner5e8d2dc2005-09-27 00:14:41 +0000127
128 // Clean up after other passes, e.g. merging critical edges.
Chris Lattnerdf2e4252005-11-08 02:12:47 +0000129 if (!Fast) PM.add(createCFGSimplificationPass());
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000130
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000131 // Make sure that no unreachable blocks are instruction selected.
132 PM.add(createUnreachableBlockEliminationPass());
133
Chris Lattner8482dd82005-08-17 19:33:30 +0000134 // Install an instruction selector.
Chris Lattner05f1fe82006-01-12 01:46:07 +0000135 PM.add(createPPCISelDag(*this));
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000136
137 if (PrintMachineCode)
138 PM.add(createMachineFunctionPrinterPass(&std::cerr));
139
140 PM.add(createRegisterAllocator());
141
142 if (PrintMachineCode)
143 PM.add(createMachineFunctionPrinterPass(&std::cerr));
144
Nate Begemanca068e82004-08-14 22:16:36 +0000145 PM.add(createPrologEpilogCodeInserter());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000146
Nate Begemanca068e82004-08-14 22:16:36 +0000147 // Must run branch selection immediately preceding the asm printer
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000148 PM.add(createPPCBranchSelectionPass());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000149
Nate Begeman3d72d142005-08-04 20:49:48 +0000150 // Decide which asm printer to use. If the user has not specified one on
151 // the command line, choose whichever one matches the default (current host).
Chris Lattneraf89fa62006-06-16 18:50:48 +0000152 if (Subtarget.isAIX())
Nate Begemaned428532004-09-04 05:00:00 +0000153 PM.add(createAIXAsmPrinter(Out, *this));
Chris Lattneraf89fa62006-06-16 18:50:48 +0000154 else
Nate Begemaned428532004-09-04 05:00:00 +0000155 PM.add(createDarwinAsmPrinter(Out, *this));
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000156
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000157 PM.add(createMachineCodeDeleter());
158 return false;
159}
160
Nate Begeman21e463b2005-10-16 05:39:50 +0000161void PPCJITInfo::addPassesToJITCompile(FunctionPassManager &PM) {
Nate Begemand9993b02006-04-21 22:11:27 +0000162 // The JIT should use the static relocation model.
Nate Begeman6fcbd692006-04-21 22:04:15 +0000163 TM.setRelocationModel(Reloc::Static);
Nate Begemanf8b02942005-04-15 22:12:16 +0000164
Chris Lattnerb0096bd2005-08-15 23:47:04 +0000165 // Run loop strength reduction before anything else.
Evan Cheng714554d2006-03-16 21:47:42 +0000166 PM.add(createLoopStrengthReducePass(TM.getTargetLowering()));
Chris Lattner0c749062005-03-02 06:19:22 +0000167
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000168 // FIXME: Implement efficient support for garbage collection intrinsics.
169 PM.add(createLowerGCPass());
170
171 // FIXME: Implement the invoke/unwind instructions!
172 PM.add(createLowerInvokePass());
173
Chris Lattner5e8d2dc2005-09-27 00:14:41 +0000174 // Clean up after other passes, e.g. merging critical edges.
175 PM.add(createCFGSimplificationPass());
176
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000177 // Make sure that no unreachable blocks are instruction selected.
178 PM.add(createUnreachableBlockEliminationPass());
179
Nate Begeman73bfa712005-08-18 23:53:15 +0000180 // Install an instruction selector.
Chris Lattner05f1fe82006-01-12 01:46:07 +0000181 PM.add(createPPCISelDag(TM));
Nate Begemanf8b02942005-04-15 22:12:16 +0000182
Nate Begeman7a4fe9b2004-08-11 07:40:04 +0000183 PM.add(createRegisterAllocator());
184 PM.add(createPrologEpilogCodeInserter());
Chris Lattnere4fce6f2004-11-23 05:56:40 +0000185
186 // Must run branch selection immediately preceding the asm printer
187 PM.add(createPPCBranchSelectionPass());
188
189 if (PrintMachineCode)
190 PM.add(createMachineFunctionPrinterPass(&std::cerr));
Misha Brukman01458812004-08-11 00:11:25 +0000191}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000192