mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-12-04 17:56:53 +00:00
ef732a2bea
Will revert 75770 in the llvm-gcc trunk. llvm-svn: 75799
135 lines
4.0 KiB
C++
135 lines
4.0 KiB
C++
//===--- 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"
|
|
#include <cassert>
|
|
using namespace llvm;
|
|
|
|
// Clients are responsible for avoid race conditions in registration.
|
|
static Target *FirstTarget = 0;
|
|
|
|
const Target *
|
|
TargetRegistry::getClosestStaticTargetForTriple(const std::string &TT,
|
|
std::string &Error) {
|
|
Target *Best = 0, *EquallyBest = 0;
|
|
unsigned BestQuality = 0;
|
|
// FIXME: Use iterator.
|
|
for (Target *i = FirstTarget; i; i = i->Next) {
|
|
if (unsigned Qual = i->TripleMatchQualityFn(TT)) {
|
|
if (!Best || Qual > BestQuality) {
|
|
Best = i;
|
|
EquallyBest = 0;
|
|
BestQuality = Qual;
|
|
} else if (Qual == BestQuality)
|
|
EquallyBest = i;
|
|
}
|
|
}
|
|
|
|
if (!Best) {
|
|
Error = "No available targets are compatible with this module";
|
|
return 0;
|
|
}
|
|
|
|
// 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;
|
|
}
|
|
|
|
const Target *
|
|
TargetRegistry::getClosestStaticTargetForModule(const Module &M,
|
|
std::string &Error) {
|
|
Target *Best = 0, *EquallyBest = 0;
|
|
unsigned BestQuality = 0;
|
|
// FIXME: Use iterator.
|
|
for (Target *i = FirstTarget; i; i = i->Next) {
|
|
if (unsigned Qual = i->ModuleMatchQualityFn(M)) {
|
|
if (!Best || Qual > BestQuality) {
|
|
Best = i;
|
|
EquallyBest = 0;
|
|
BestQuality = Qual;
|
|
} else if (Qual == BestQuality)
|
|
EquallyBest = i;
|
|
}
|
|
}
|
|
|
|
if (!Best) {
|
|
Error = "No available targets are compatible with this module";
|
|
return 0;
|
|
}
|
|
|
|
// 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;
|
|
}
|
|
|
|
const Target *
|
|
TargetRegistry::getClosestTargetForJIT(std::string &Error) {
|
|
Target *Best = 0, *EquallyBest = 0;
|
|
unsigned BestQuality = 0;
|
|
// FIXME: Use iterator.
|
|
for (Target *i = FirstTarget; i; i = i->Next) {
|
|
if (unsigned Qual = i->JITMatchQualityFn()) {
|
|
if (!Best || Qual > BestQuality) {
|
|
Best = i;
|
|
EquallyBest = 0;
|
|
BestQuality = Qual;
|
|
} else if (Qual == BestQuality)
|
|
EquallyBest = i;
|
|
}
|
|
}
|
|
|
|
if (!Best) {
|
|
Error = "No JIT is available for this host";
|
|
return 0;
|
|
}
|
|
|
|
// Return the best, ignoring ties.
|
|
return Best;
|
|
}
|
|
|
|
void TargetRegistry::RegisterTarget(Target &T,
|
|
const char *Name,
|
|
const char *ShortDesc,
|
|
Target::TripleMatchQualityFnTy TQualityFn,
|
|
Target::ModuleMatchQualityFnTy MQualityFn,
|
|
Target::JITMatchQualityFnTy JITQualityFn) {
|
|
// Note that we don't require the constructor functions already be defined, in
|
|
// case a module happens to initialize the optional functionality before the
|
|
// target.
|
|
assert(!T.Next && !T.Name && !T.ShortDesc && !T.TripleMatchQualityFn &&
|
|
!T.ModuleMatchQualityFn && !T.JITMatchQualityFn &&
|
|
"This Target already registered!");
|
|
|
|
assert(Name && ShortDesc && TQualityFn && MQualityFn && JITQualityFn &&
|
|
"Missing required target information!");
|
|
|
|
// Add to the list of targets.
|
|
T.Next = FirstTarget;
|
|
FirstTarget = &T;
|
|
|
|
T.Name = Name;
|
|
T.ShortDesc = ShortDesc;
|
|
T.TripleMatchQualityFn = TQualityFn;
|
|
T.ModuleMatchQualityFn = MQualityFn;
|
|
T.JITMatchQualityFn = JITQualityFn;
|
|
}
|
|
|