[llvm] r265063 - Fix PR26940 where compiles times regressed massively.
Chandler Carruth via llvm-commits
llvm-commits at lists.llvm.org
Thu Mar 31 14:55:58 PDT 2016
Author: chandlerc
Date: Thu Mar 31 16:55:58 2016
New Revision: 265063
URL: http://llvm.org/viewvc/llvm-project?rev=265063&view=rev
Log:
Fix PR26940 where compiles times regressed massively.
Patch by Jonas Paulsson. Original description:
Bugfix in buildSchedGraph() to make -dag-maps-huge-region work properly
I found that the reduction of the maps did in fact never happen in this
test case. This was because *all* the stores / loads were made with
addresses from arguments and they thus became "unknown" stores / loads.
Fixed by removing continue statements and making sure that the test for
reduction always takes place.
Differential Revision: http://reviews.llvm.org/D18673
Modified:
llvm/trunk/lib/CodeGen/ScheduleDAGInstrs.cpp
Modified: llvm/trunk/lib/CodeGen/ScheduleDAGInstrs.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/CodeGen/ScheduleDAGInstrs.cpp?rev=265063&r1=265062&r2=265063&view=diff
==============================================================================
--- llvm/trunk/lib/CodeGen/ScheduleDAGInstrs.cpp (original)
+++ llvm/trunk/lib/CodeGen/ScheduleDAGInstrs.cpp Thu Mar 31 16:55:58 2016
@@ -1025,52 +1025,49 @@ void ScheduleDAGInstrs::buildSchedGraph(
// Map this store to 'UnknownValue'.
Stores.insert(SU, UnknownValue);
- continue;
+ } else {
+ // Add precise dependencies against all previously seen memory
+ // accesses mapped to the same Value(s).
+ for (auto &underlObj : Objs) {
+ ValueType V = underlObj.getPointer();
+ bool ThisMayAlias = underlObj.getInt();
+
+ Value2SUsMap &stores_ = (ThisMayAlias ? Stores : NonAliasStores);
+
+ // Add dependencies to previous stores and loads mapped to V.
+ addChainDependencies(SU, stores_, V);
+ addChainDependencies(SU, (ThisMayAlias ? Loads : NonAliasLoads), V);
+
+ // Map this store to V.
+ stores_.insert(SU, V);
+ }
+ // The store may have dependencies to unanalyzable loads and
+ // stores.
+ addChainDependencies(SU, Loads, UnknownValue);
+ addChainDependencies(SU, Stores, UnknownValue);
}
-
- // Add precise dependencies against all previously seen memory
- // accesses mapped to the same Value(s).
- for (auto &underlObj : Objs) {
- ValueType V = underlObj.getPointer();
- bool ThisMayAlias = underlObj.getInt();
-
- Value2SUsMap &stores_ = (ThisMayAlias ? Stores : NonAliasStores);
-
- // Add dependencies to previous stores and loads mapped to V.
- addChainDependencies(SU, stores_, V);
- addChainDependencies(SU, (ThisMayAlias ? Loads : NonAliasLoads), V);
-
- // Map this store to V.
- stores_.insert(SU, V);
- }
- // The store may have dependencies to unanalyzable loads and
- // stores.
- addChainDependencies(SU, Loads, UnknownValue);
- addChainDependencies(SU, Stores, UnknownValue);
- }
- else { // SU is a load.
+ } else { // SU is a load.
if (Objs.empty()) {
// An unknown load depends on all stores.
addChainDependencies(SU, Stores);
addChainDependencies(SU, NonAliasStores);
Loads.insert(SU, UnknownValue);
- continue;
- }
-
- for (auto &underlObj : Objs) {
- ValueType V = underlObj.getPointer();
- bool ThisMayAlias = underlObj.getInt();
-
- // Add precise dependencies against all previously seen stores
- // mapping to the same Value(s).
- addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V);
-
- // Map this load to V.
- (ThisMayAlias ? Loads : NonAliasLoads).insert(SU, V);
+ } else {
+ for (auto &underlObj : Objs) {
+ ValueType V = underlObj.getPointer();
+ bool ThisMayAlias = underlObj.getInt();
+
+ // Add precise dependencies against all previously seen stores
+ // mapping to the same Value(s).
+ addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V);
+
+ // Map this load to V.
+ (ThisMayAlias ? Loads : NonAliasLoads).insert(SU, V);
+ }
+ // The load may have dependencies to unanalyzable stores.
+ addChainDependencies(SU, Stores, UnknownValue);
}
- // The load may have dependencies to unanalyzable stores.
- addChainDependencies(SU, Stores, UnknownValue);
}
// Reduce maps if they grow huge.
More information about the llvm-commits
mailing list