[polly] r295551 - [DependenceInfo] Pull out statement [NFC]

[Tobias Grosser via llvm-commits]

Author: grosser
Date: Sat Feb 18 10:41:28 2017
New Revision: 295551

URL: http://llvm.org/viewvc/llvm-project?rev=295551&view=rev
Log:
[DependenceInfo] Pull out statement [NFC]

This simplifies the code slightly.

Modified:
    polly/trunk/lib/Analysis/DependenceInfo.cpp

Modified: polly/trunk/lib/Analysis/DependenceInfo.cpp
URL: http://llvm.org/viewvc/llvm-project/polly/trunk/lib/Analysis/DependenceInfo.cpp?rev=295551&r1=295550&r2=295551&view=diff
==============================================================================
--- polly/trunk/lib/Analysis/DependenceInfo.cpp (original)
+++ polly/trunk/lib/Analysis/DependenceInfo.cpp Sat Feb 18 10:41:28 2017
@@ -320,9 +320,10 @@ void Dependences::calculateDependences(S
         dbgs() << "AccessSchedule: " << AccessSchedule << '\n';
         dbgs() << "StmtSchedule: " << StmtSchedule << '\n';);
 
+  Schedule = S.getScheduleTree();
+
   if (!HasReductions) {
     isl_union_map_free(AccessSchedule);
-    Schedule = S.getScheduleTree();
     // Tag the schedule tree if we want fine-grain dependence info
     if (Level > AL_Statement) {
       auto TaggedDom = isl_union_map_domain((isl_union_map_copy(StmtSchedule)));
@@ -335,8 +336,6 @@ void Dependences::calculateDependences(S
     isl_union_map *ReductionMap, *IdentityMap;
     isl_union_pw_multi_aff *ReductionTags, *IdentityTags, *Tags;
 
-    Schedule = S.getScheduleTree();
-
     // Extract reduction tags from the access schedule. The result is a map that
     // maps each tagged element in the domain to the memory location it
     // accesses.