Add a comment explaining that I have a better plan for implementing the

GCC installation search that requires fewer filesystem operations.
Planning to implement that next as the current approcah while thorough
(and so far looks correct) does a very unfortunate number of filesystem
operations.

I'm motivated to fix this in no small part because I would like to
support a much larger space of triples and GCC versions, which would
explode the current algorithm.

llvm-svn: 141073
This commit is contained in:
Chandler Carruth 2011-10-04 09:58:21 +00:00
parent 1d6073abad
commit 1a98ab4fc3
1 changed files with 2 additions and 0 deletions

View File

@ -1605,6 +1605,8 @@ public:
// accuracy, and architecture specificity in that order. The inverted walk
// requires testing the filesystem more times than is ideal, but shouldn't
// matter in practice as this is once on startup.
// FIXME: Instead of this, we should walk from the root down through each
// layer, and if it is "better" than prior installations found, use it.
static const char* GccVersions[] = {
"4.6.1", "4.6.0", "4.6",
"4.5.3", "4.5.2", "4.5.1", "4.5",