RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 19:23:23 +01:00
Code Issues Projects Releases Wiki Activity

Oops, check in these files too, for the FastISel -> Fast rename.

Browse Source 
llvm-svn: 54750
This commit is contained in:
Dan Gohman 2008-08-13 19:55:00 +00:00
parent 9e27bed4f0
commit 502d2aebff
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
lib/Target/X86/X86ISelDAGToDAG.cpp
View File

@ -314,7 +314,7 @@ static inline bool isNonImmUse(SDNode *Root, SDNode *Def, SDNode *ImmedUse,
bool X86DAGToDAGISel::CanBeFoldedBy(SDNode *N, SDNode *U, SDNode *Root) const {
if (FastISel) return false;
if (Fast) return false;
// If U use can somehow reach N through another path then U can't fold N or
// it will create a cycle. e.g. In the following diagram, U can reach N
@ -579,7 +579,7 @@ void X86DAGToDAGISel::InstructionSelect(SelectionDAG &DAG) {
CurBB = BB; // BB can change as result of isel.
DEBUG(BB->dump());
if (!FastISel)
if (!Fast)
PreprocessForRMW(DAG);
// FIXME: This should only happen when not -fast.

2
utils/TableGen/DAGISelEmitter.cpp
View File

@ -429,7 +429,7 @@ public:
NumInputRootOps = N->getNumChildren();
if (DisablePatternForFastISel(N, CGP))
emitCheck("!FastISel");
emitCheck("!Fast");
std::string PredicateCheck;
for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {