mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-06-17 20:23:59 +00:00
Readdress r236990, use of static members on a non-static variable.
The TargetRegistry is just a namespace-like class, instantiated in one place to use a range-based for loop. Instead, expose access to the registry via a range-based 'targets()' function instead. This makes most uses a bit awkward/more verbose - but eventually we should just add a range-based find_if function which will streamline these functions. I'm happy to mkae them a bit awkward in the interim as encouragement to improve the algorithms in time. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@237059 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@ -543,7 +543,14 @@ namespace llvm {
|
|||||||
|
|
||||||
/// TargetRegistry - Generic interface to target specific features.
|
/// TargetRegistry - Generic interface to target specific features.
|
||||||
struct TargetRegistry {
|
struct TargetRegistry {
|
||||||
class iterator {
|
// FIXME: Make this a namespace, probably just move all the Register*
|
||||||
|
// functions into Target (currently they all just set members on the Target
|
||||||
|
// anyway, and Target friends this class so those functions can...
|
||||||
|
// function).
|
||||||
|
TargetRegistry() = delete;
|
||||||
|
|
||||||
|
class iterator
|
||||||
|
: public std::iterator<std::forward_iterator_tag, Target, ptrdiff_t> {
|
||||||
const Target *Current;
|
const Target *Current;
|
||||||
explicit iterator(Target *T) : Current(T) {}
|
explicit iterator(Target *T) : Current(T) {}
|
||||||
friend struct TargetRegistry;
|
friend struct TargetRegistry;
|
||||||
@ -586,9 +593,7 @@ namespace llvm {
|
|||||||
/// @name Registry Access
|
/// @name Registry Access
|
||||||
/// @{
|
/// @{
|
||||||
|
|
||||||
static iterator begin();
|
static iterator_range<iterator> targets();
|
||||||
|
|
||||||
static iterator end() { return iterator(); }
|
|
||||||
|
|
||||||
/// lookupTarget - Lookup a target based on a target triple.
|
/// lookupTarget - Lookup a target based on a target triple.
|
||||||
///
|
///
|
||||||
|
@ -49,21 +49,19 @@ TargetMachine *EngineBuilder::selectTarget(const Triple &TargetTriple,
|
|||||||
// Adjust the triple to match what the user requested.
|
// Adjust the triple to match what the user requested.
|
||||||
const Target *TheTarget = nullptr;
|
const Target *TheTarget = nullptr;
|
||||||
if (!MArch.empty()) {
|
if (!MArch.empty()) {
|
||||||
for (TargetRegistry::iterator it = TargetRegistry::begin(),
|
auto I = std::find_if(
|
||||||
ie = TargetRegistry::end(); it != ie; ++it) {
|
TargetRegistry::targets().begin(), TargetRegistry::targets().end(),
|
||||||
if (MArch == it->getName()) {
|
[&](const Target &T) { return MArch == T.getName(); });
|
||||||
TheTarget = &*it;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!TheTarget) {
|
if (I == TargetRegistry::targets().end()) {
|
||||||
if (ErrorStr)
|
if (ErrorStr)
|
||||||
*ErrorStr = "No available targets are compatible with this -march, "
|
*ErrorStr = "No available targets are compatible with this -march, "
|
||||||
"see -version for the available targets.\n";
|
"see -version for the available targets.\n";
|
||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TheTarget = &*I;
|
||||||
|
|
||||||
// Adjust the triple to match (if known), otherwise stick with the
|
// Adjust the triple to match (if known), otherwise stick with the
|
||||||
// requested/host triple.
|
// requested/host triple.
|
||||||
Triple::ArchType Type = Triple::getArchTypeForLLVMName(MArch);
|
Triple::ArchType Type = Triple::getArchTypeForLLVMName(MArch);
|
||||||
|
@ -18,8 +18,8 @@ using namespace llvm;
|
|||||||
// Clients are responsible for avoid race conditions in registration.
|
// Clients are responsible for avoid race conditions in registration.
|
||||||
static Target *FirstTarget = nullptr;
|
static Target *FirstTarget = nullptr;
|
||||||
|
|
||||||
TargetRegistry::iterator TargetRegistry::begin() {
|
iterator_range<TargetRegistry::iterator> TargetRegistry::targets() {
|
||||||
return iterator(FirstTarget);
|
return make_range(iterator(FirstTarget), iterator());
|
||||||
}
|
}
|
||||||
|
|
||||||
const Target *TargetRegistry::lookupTarget(const std::string &ArchName,
|
const Target *TargetRegistry::lookupTarget(const std::string &ArchName,
|
||||||
@ -30,19 +30,17 @@ const Target *TargetRegistry::lookupTarget(const std::string &ArchName,
|
|||||||
// name, because it might be a backend that has no mapping to a target triple.
|
// name, because it might be a backend that has no mapping to a target triple.
|
||||||
const Target *TheTarget = nullptr;
|
const Target *TheTarget = nullptr;
|
||||||
if (!ArchName.empty()) {
|
if (!ArchName.empty()) {
|
||||||
for (TargetRegistry::iterator it = TargetRegistry::begin(),
|
auto I =
|
||||||
ie = TargetRegistry::end(); it != ie; ++it) {
|
std::find_if(targets().begin(), targets().end(),
|
||||||
if (ArchName == it->getName()) {
|
[&](const Target &T) { return ArchName == T.getName(); });
|
||||||
TheTarget = &*it;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!TheTarget) {
|
if (I == targets().end()) {
|
||||||
Error = "error: invalid target '" + ArchName + "'.\n";
|
Error = "error: invalid target '" + ArchName + "'.\n";
|
||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TheTarget = &*I;
|
||||||
|
|
||||||
// Adjust the triple to match (if known), otherwise stick with the
|
// Adjust the triple to match (if known), otherwise stick with the
|
||||||
// given triple.
|
// given triple.
|
||||||
Triple::ArchType Type = Triple::getArchTypeForLLVMName(ArchName);
|
Triple::ArchType Type = Triple::getArchTypeForLLVMName(ArchName);
|
||||||
@ -66,30 +64,28 @@ const Target *TargetRegistry::lookupTarget(const std::string &ArchName,
|
|||||||
const Target *TargetRegistry::lookupTarget(const std::string &TT,
|
const Target *TargetRegistry::lookupTarget(const std::string &TT,
|
||||||
std::string &Error) {
|
std::string &Error) {
|
||||||
// Provide special warning when no targets are initialized.
|
// Provide special warning when no targets are initialized.
|
||||||
if (begin() == end()) {
|
if (targets().begin() == targets().end()) {
|
||||||
Error = "Unable to find target for this triple (no targets are registered)";
|
Error = "Unable to find target for this triple (no targets are registered)";
|
||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
const Target *Matching = nullptr;
|
|
||||||
Triple::ArchType Arch = Triple(TT).getArch();
|
Triple::ArchType Arch = Triple(TT).getArch();
|
||||||
for (iterator it = begin(), ie = end(); it != ie; ++it) {
|
auto ArchMatch = [&](const Target &T) { return T.ArchMatchFn(Arch); };
|
||||||
if (it->ArchMatchFn(Arch)) {
|
auto I = std::find_if(targets().begin(), targets().end(), ArchMatch);
|
||||||
if (Matching) {
|
|
||||||
Error = std::string("Cannot choose between targets \"") +
|
|
||||||
Matching->Name + "\" and \"" + it->Name + "\"";
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
Matching = &*it;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!Matching) {
|
if (I == targets().end()) {
|
||||||
Error = "No available targets are compatible with this triple, "
|
Error = "No available targets are compatible with this triple, "
|
||||||
"see -version for the available targets.";
|
"see -version for the available targets.";
|
||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
return Matching;
|
auto J = std::find_if(std::next(I), targets().end(), ArchMatch);
|
||||||
|
if (J != targets().end()) {
|
||||||
|
Error = std::string("Cannot choose between targets \"") + I->Name +
|
||||||
|
"\" and \"" + J->Name + "\"";
|
||||||
|
return nullptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
return &*I;
|
||||||
}
|
}
|
||||||
|
|
||||||
void TargetRegistry::RegisterTarget(Target &T,
|
void TargetRegistry::RegisterTarget(Target &T,
|
||||||
@ -123,10 +119,8 @@ static int TargetArraySortFn(const std::pair<StringRef, const Target *> *LHS,
|
|||||||
void TargetRegistry::printRegisteredTargetsForVersion() {
|
void TargetRegistry::printRegisteredTargetsForVersion() {
|
||||||
std::vector<std::pair<StringRef, const Target*> > Targets;
|
std::vector<std::pair<StringRef, const Target*> > Targets;
|
||||||
size_t Width = 0;
|
size_t Width = 0;
|
||||||
for (TargetRegistry::iterator I = TargetRegistry::begin(),
|
for (const auto &T : TargetRegistry::targets()) {
|
||||||
E = TargetRegistry::end();
|
Targets.push_back(std::make_pair(T.getName(), &T));
|
||||||
I != E; ++I) {
|
|
||||||
Targets.push_back(std::make_pair(I->getName(), &*I));
|
|
||||||
Width = std::max(Width, Targets.back().first.size());
|
Width = std::max(Width, Targets.back().first.size());
|
||||||
}
|
}
|
||||||
array_pod_sort(Targets.begin(), Targets.end(), TargetArraySortFn);
|
array_pod_sort(Targets.begin(), Targets.end(), TargetArraySortFn);
|
||||||
|
@ -47,11 +47,11 @@ inline LLVMTargetRef wrap(const Target * P) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
LLVMTargetRef LLVMGetFirstTarget() {
|
LLVMTargetRef LLVMGetFirstTarget() {
|
||||||
if(TargetRegistry::begin() == TargetRegistry::end()) {
|
if (TargetRegistry::targets().begin() == TargetRegistry::targets().end()) {
|
||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
const Target* target = &*TargetRegistry::begin();
|
const Target *target = &*TargetRegistry::targets().begin();
|
||||||
return wrap(target);
|
return wrap(target);
|
||||||
}
|
}
|
||||||
LLVMTargetRef LLVMGetNextTarget(LLVMTargetRef T) {
|
LLVMTargetRef LLVMGetNextTarget(LLVMTargetRef T) {
|
||||||
@ -60,13 +60,10 @@ LLVMTargetRef LLVMGetNextTarget(LLVMTargetRef T) {
|
|||||||
|
|
||||||
LLVMTargetRef LLVMGetTargetFromName(const char *Name) {
|
LLVMTargetRef LLVMGetTargetFromName(const char *Name) {
|
||||||
StringRef NameRef = Name;
|
StringRef NameRef = Name;
|
||||||
for (TargetRegistry::iterator IT = TargetRegistry::begin(),
|
auto I = std::find_if(
|
||||||
IE = TargetRegistry::end(); IT != IE; ++IT) {
|
TargetRegistry::targets().begin(), TargetRegistry::targets().end(),
|
||||||
if (IT->getName() == NameRef)
|
[&](const Target &T) { return T.getName() == NameRef; });
|
||||||
return wrap(&*IT);
|
return I != TargetRegistry::targets().end() ? wrap(&*I) : nullptr;
|
||||||
}
|
|
||||||
|
|
||||||
return nullptr;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
LLVMBool LLVMGetTargetFromTriple(const char* TripleStr, LLVMTargetRef *T,
|
LLVMBool LLVMGetTargetFromTriple(const char* TripleStr, LLVMTargetRef *T,
|
||||||
|
@ -22,9 +22,8 @@ TEST(TargetRegistry, TargetHasArchType) {
|
|||||||
|
|
||||||
llvm::InitializeAllTargetInfos();
|
llvm::InitializeAllTargetInfos();
|
||||||
|
|
||||||
for (auto I = TargetRegistry::begin(), E = TargetRegistry::end();
|
for (const Target &T : TargetRegistry::targets()) {
|
||||||
I != E; ++I) {
|
StringRef Name = T.getName();
|
||||||
StringRef Name = I->getName();
|
|
||||||
// There is really no way (at present) to ask a Target whether it targets
|
// There is really no way (at present) to ask a Target whether it targets
|
||||||
// a specific architecture, because the logic for that is buried in a
|
// a specific architecture, because the logic for that is buried in a
|
||||||
// predicate.
|
// predicate.
|
||||||
|
Reference in New Issue
Block a user