blob: 8d91a53c22646d77103e227e5c1ca7d257745398 [file] [log] [blame]
Daniel Dunbar078a71e2009-07-15 04:24:58 +00001//===--- TargetRegistry.cpp - Target registration -------------------------===//
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
Evan Cheng2bb40352011-08-24 18:08:43 +000010#include "llvm/Support/TargetRegistry.h"
Chandler Carruth2baac022011-07-22 07:50:44 +000011#include "llvm/ADT/STLExtras.h"
12#include "llvm/ADT/StringRef.h"
Michael J. Spencer447762d2010-11-29 18:16:10 +000013#include "llvm/Support/Host.h"
Chandler Carruth2baac022011-07-22 07:50:44 +000014#include "llvm/Support/raw_ostream.h"
Daniel Dunbar078a71e2009-07-15 04:24:58 +000015#include <cassert>
Chandler Carruth2baac022011-07-22 07:50:44 +000016#include <vector>
Daniel Dunbar078a71e2009-07-15 04:24:58 +000017using namespace llvm;
18
Daniel Dunbar1c663322009-07-15 07:09:29 +000019// Clients are responsible for avoid race conditions in registration.
Daniel Dunbar078a71e2009-07-15 04:24:58 +000020static Target *FirstTarget = 0;
21
Daniel Dunbar78c8fb12009-07-16 02:06:09 +000022TargetRegistry::iterator TargetRegistry::begin() {
23 return iterator(FirstTarget);
24}
25
Kevin Enderbyfe3d0052012-05-08 23:38:45 +000026const Target *TargetRegistry::lookupTarget(const std::string &ArchName,
27 Triple &TheTriple,
28 std::string &Error) {
29 // Allocate target machine. First, check whether the user has explicitly
30 // specified an architecture to compile for. If so we have to look it up by
31 // name, because it might be a backend that has no mapping to a target triple.
32 const Target *TheTarget = 0;
33 if (!ArchName.empty()) {
34 for (TargetRegistry::iterator it = TargetRegistry::begin(),
35 ie = TargetRegistry::end(); it != ie; ++it) {
36 if (ArchName == it->getName()) {
37 TheTarget = &*it;
38 break;
39 }
40 }
41
42 if (!TheTarget) {
43 Error = "error: invalid target '" + ArchName + "'.\n";
44 return 0;
45 }
46
47 // Adjust the triple to match (if known), otherwise stick with the
48 // given triple.
49 Triple::ArchType Type = Triple::getArchTypeForLLVMName(ArchName);
50 if (Type != Triple::UnknownArch)
51 TheTriple.setArch(Type);
52 } else {
53 // Get the target specific parser.
54 std::string TempError;
55 TheTarget = TargetRegistry::lookupTarget(TheTriple.getTriple(), TempError);
56 if (TheTarget == 0) {
57 Error = ": error: unable to get target for '"
58 + TheTriple.getTriple()
59 + "', see --version and --triple.\n";
60 return 0;
61 }
62 }
63
64 return TheTarget;
65}
66
Daniel Dunbar47d67912009-07-26 02:12:58 +000067const Target *TargetRegistry::lookupTarget(const std::string &TT,
Daniel Dunbar47d67912009-07-26 02:12:58 +000068 std::string &Error) {
Daniel Dunbar50745bf2009-07-17 15:50:49 +000069 // Provide special warning when no targets are initialized.
70 if (begin() == end()) {
71 Error = "Unable to find target for this triple (no targets are registered)";
72 return 0;
73 }
Rafael Espindoladfc14702013-12-13 16:05:32 +000074 const Target *Matching = 0;
75 Triple::ArchType Arch = Triple(TT).getArch();
Daniel Dunbar78c8fb12009-07-16 02:06:09 +000076 for (iterator it = begin(), ie = end(); it != ie; ++it) {
Rafael Espindoladfc14702013-12-13 16:05:32 +000077 if (it->ArchMatchFn(Arch)) {
78 if (Matching) {
79 Error = std::string("Cannot choose between targets \"") +
80 Matching->Name + "\" and \"" + it->Name + "\"";
81 return 0;
82 }
83 Matching = &*it;
Daniel Dunbar078a71e2009-07-15 04:24:58 +000084 }
85 }
86
Rafael Espindoladfc14702013-12-13 16:05:32 +000087 if (!Matching) {
Daniel Dunbar6119d872009-09-08 23:32:35 +000088 Error = "No available targets are compatible with this triple, "
89 "see -version for the available targets.";
Daniel Dunbar078a71e2009-07-15 04:24:58 +000090 return 0;
91 }
92
Rafael Espindoladfc14702013-12-13 16:05:32 +000093 return Matching;
Daniel Dunbar078a71e2009-07-15 04:24:58 +000094}
95
Daniel Dunbar078a71e2009-07-15 04:24:58 +000096void TargetRegistry::RegisterTarget(Target &T,
97 const char *Name,
98 const char *ShortDesc,
Rafael Espindoladfc14702013-12-13 16:05:32 +000099 Target::ArchMatchFnTy ArchMatchFn,
Daniel Dunbar691a4782009-07-25 10:09:50 +0000100 bool HasJIT) {
Rafael Espindoladfc14702013-12-13 16:05:32 +0000101 assert(Name && ShortDesc && ArchMatchFn &&
Daniel Dunbar078a71e2009-07-15 04:24:58 +0000102 "Missing required target information!");
Daniel Dunbare8338102009-07-15 20:24:03 +0000103
104 // Check if this target has already been initialized, we allow this as a
105 // convenience to some clients.
106 if (T.Name)
107 return;
Daniel Dunbar078a71e2009-07-15 04:24:58 +0000108
109 // Add to the list of targets.
110 T.Next = FirstTarget;
Daniel Dunbar54995de2009-07-15 07:37:49 +0000111 FirstTarget = &T;
Daniel Dunbar078a71e2009-07-15 04:24:58 +0000112
113 T.Name = Name;
114 T.ShortDesc = ShortDesc;
Rafael Espindoladfc14702013-12-13 16:05:32 +0000115 T.ArchMatchFn = ArchMatchFn;
Daniel Dunbar691a4782009-07-25 10:09:50 +0000116 T.HasJIT = HasJIT;
Daniel Dunbar078a71e2009-07-15 04:24:58 +0000117}
118
Daniel Dunbar719d2352009-08-03 04:20:57 +0000119const Target *TargetRegistry::getClosestTargetForJIT(std::string &Error) {
Sebastian Pop99ab2732012-01-05 18:28:46 +0000120 const Target *TheTarget = lookupTarget(sys::getDefaultTargetTriple(), Error);
Daniel Dunbar719d2352009-08-03 04:20:57 +0000121
122 if (TheTarget && !TheTarget->hasJIT()) {
123 Error = "No JIT compatible target available for this host";
124 return 0;
125 }
126
127 return TheTarget;
128}
129
Benjamin Kramer8817cca2013-09-22 14:09:50 +0000130static int TargetArraySortFn(const std::pair<StringRef, const Target *> *LHS,
131 const std::pair<StringRef, const Target *> *RHS) {
132 return LHS->first.compare(RHS->first);
Chandler Carruth2baac022011-07-22 07:50:44 +0000133}
134
135void TargetRegistry::printRegisteredTargetsForVersion() {
136 std::vector<std::pair<StringRef, const Target*> > Targets;
137 size_t Width = 0;
138 for (TargetRegistry::iterator I = TargetRegistry::begin(),
139 E = TargetRegistry::end();
140 I != E; ++I) {
141 Targets.push_back(std::make_pair(I->getName(), &*I));
142 Width = std::max(Width, Targets.back().first.size());
143 }
144 array_pod_sort(Targets.begin(), Targets.end(), TargetArraySortFn);
145
146 raw_ostream &OS = outs();
147 OS << " Registered Targets:\n";
148 for (unsigned i = 0, e = Targets.size(); i != e; ++i) {
149 OS << " " << Targets[i].first;
150 OS.indent(Width - Targets[i].first.size()) << " - "
151 << Targets[i].second->getShortDescription() << '\n';
152 }
153 if (Targets.empty())
154 OS << " (none)\n";
155}