2009-07-15 04:24:58 +00:00
|
|
|
//===--- TargetRegistry.cpp - Target registration -------------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Target/TargetRegistry.h"
|
2009-07-25 10:09:50 +00:00
|
|
|
#include "llvm/System/Host.h"
|
2009-07-15 04:24:58 +00:00
|
|
|
#include <cassert>
|
|
|
|
using namespace llvm;
|
|
|
|
|
2009-07-15 07:09:29 +00:00
|
|
|
// Clients are responsible for avoid race conditions in registration.
|
2009-07-15 04:24:58 +00:00
|
|
|
static Target *FirstTarget = 0;
|
|
|
|
|
2009-07-16 02:06:09 +00:00
|
|
|
TargetRegistry::iterator TargetRegistry::begin() {
|
|
|
|
return iterator(FirstTarget);
|
|
|
|
}
|
|
|
|
|
2009-07-26 02:12:58 +00:00
|
|
|
const Target *TargetRegistry::lookupTarget(const std::string &TT,
|
|
|
|
std::string &Error) {
|
2009-07-17 15:50:49 +00:00
|
|
|
// Provide special warning when no targets are initialized.
|
|
|
|
if (begin() == end()) {
|
|
|
|
Error = "Unable to find target for this triple (no targets are registered)";
|
|
|
|
return 0;
|
|
|
|
}
|
2009-07-16 02:06:09 +00:00
|
|
|
const Target *Best = 0, *EquallyBest = 0;
|
2009-07-15 04:24:58 +00:00
|
|
|
unsigned BestQuality = 0;
|
2009-07-16 02:06:09 +00:00
|
|
|
for (iterator it = begin(), ie = end(); it != ie; ++it) {
|
2009-07-26 02:12:58 +00:00
|
|
|
if (unsigned Qual = it->TripleMatchQualityFn(TT)) {
|
2009-07-15 04:24:58 +00:00
|
|
|
if (!Best || Qual > BestQuality) {
|
2009-07-16 02:06:09 +00:00
|
|
|
Best = &*it;
|
2009-07-15 04:24:58 +00:00
|
|
|
EquallyBest = 0;
|
|
|
|
BestQuality = Qual;
|
|
|
|
} else if (Qual == BestQuality)
|
2009-07-16 02:06:09 +00:00
|
|
|
EquallyBest = &*it;
|
2009-07-15 04:24:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!Best) {
|
2009-07-26 02:12:58 +00:00
|
|
|
Error = "No available targets are compatible with this triple";
|
|
|
|
return 0;
|
2009-07-15 04:24:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, take the best target, but make sure we don't have two equally
|
|
|
|
// good best targets.
|
|
|
|
if (EquallyBest) {
|
|
|
|
Error = std::string("Cannot choose between targets \"") +
|
|
|
|
Best->Name + "\" and \"" + EquallyBest->Name + "\"";
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return Best;
|
|
|
|
}
|
|
|
|
|
|
|
|
void TargetRegistry::RegisterTarget(Target &T,
|
|
|
|
const char *Name,
|
|
|
|
const char *ShortDesc,
|
|
|
|
Target::TripleMatchQualityFnTy TQualityFn,
|
2009-07-25 10:09:50 +00:00
|
|
|
bool HasJIT) {
|
2009-07-26 02:22:58 +00:00
|
|
|
assert(Name && ShortDesc && TQualityFn &&
|
2009-07-15 04:24:58 +00:00
|
|
|
"Missing required target information!");
|
2009-07-15 20:24:03 +00:00
|
|
|
|
|
|
|
// Check if this target has already been initialized, we allow this as a
|
|
|
|
// convenience to some clients.
|
|
|
|
if (T.Name)
|
|
|
|
return;
|
2009-07-15 04:24:58 +00:00
|
|
|
|
|
|
|
// Add to the list of targets.
|
|
|
|
T.Next = FirstTarget;
|
2009-07-15 07:37:49 +00:00
|
|
|
FirstTarget = &T;
|
2009-07-15 04:24:58 +00:00
|
|
|
|
|
|
|
T.Name = Name;
|
|
|
|
T.ShortDesc = ShortDesc;
|
|
|
|
T.TripleMatchQualityFn = TQualityFn;
|
2009-07-25 10:09:50 +00:00
|
|
|
T.HasJIT = HasJIT;
|
2009-07-15 04:24:58 +00:00
|
|
|
}
|
|
|
|
|
2009-08-03 04:20:57 +00:00
|
|
|
const Target *TargetRegistry::getClosestTargetForJIT(std::string &Error) {
|
|
|
|
const Target *TheTarget = lookupTarget(sys::getHostTriple(), Error);
|
|
|
|
|
|
|
|
if (TheTarget && !TheTarget->hasJIT()) {
|
|
|
|
Error = "No JIT compatible target available for this host";
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return TheTarget;
|
|
|
|
}
|
|
|
|
|