Index: polly/trunk/include/polly/ScopBuilder.h =================================================================== --- polly/trunk/include/polly/ScopBuilder.h +++ polly/trunk/include/polly/ScopBuilder.h @@ -356,7 +356,7 @@ /// base address and there are no other accesses which overlap with them. The /// base address check rules out impossible reductions candidates early. The /// overlap check, together with the "only one user" check in - /// collectCandiateReductionLoads, guarantees that none of the intermediate + /// collectCandidateReductionLoads, guarantees that none of the intermediate /// results will escape during execution of the loop nest. We basically check /// here that no other memory access can access the same memory as the /// potential reduction. @@ -372,8 +372,8 @@ /// /// Note: We allow only one use to ensure the load and binary operator cannot /// escape this block or into any other store except @p StoreMA. - void collectCandiateReductionLoads(MemoryAccess *StoreMA, - SmallVectorImpl &Loads); + void collectCandidateReductionLoads(MemoryAccess *StoreMA, + SmallVectorImpl &Loads); /// Build the access relation of all memory accesses of @p Stmt. void buildAccessRelations(ScopStmt &Stmt); Index: polly/trunk/lib/Analysis/ScopBuilder.cpp =================================================================== --- polly/trunk/lib/Analysis/ScopBuilder.cpp +++ polly/trunk/lib/Analysis/ScopBuilder.cpp @@ -984,7 +984,7 @@ continue; Loads.clear(); - collectCandiateReductionLoads(StoreMA, Loads); + collectCandidateReductionLoads(StoreMA, Loads); for (MemoryAccess *LoadMA : Loads) Candidates.push_back(std::make_pair(LoadMA, StoreMA)); } @@ -1034,7 +1034,7 @@ } } -void ScopBuilder::collectCandiateReductionLoads( +void ScopBuilder::collectCandidateReductionLoads( MemoryAccess *StoreMA, SmallVectorImpl &Loads) { ScopStmt *Stmt = StoreMA->getStatement();