github/ROCm
1
1
Fork 0
mirror of https://github.com/ROCm/ROCm.git synced 2026-04-05 03:01:17 -04:00
Code Issues Packages Projects Releases Wiki Activity

[OPTIMIZER] Using new multiRootGetSlice utility in memory coalescing pass (#1169)

Browse Source
This commit is contained in:
Philippe Tillet
2023-02-09 10:43:33 -08:00
committed by GitHub
parent 6173dd174f
commit 0cbe368fe5
4 changed files with 35 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
lib/Analysis/Utility.cpp
View File

@@ -300,4 +300,29 @@ multiRootTopologicalSort(const SetVector<Operation *> &toSort) {
return res;
}
SetVector<Operation *> multiRootGetSlice(Operation *op,
TransitiveFilter backwardFilter,
TransitiveFilter forwardFilter) {
SetVector<Operation *> slice;
slice.insert(op);
unsigned currentIndex = 0;
SetVector<Operation *> backwardSlice;
SetVector<Operation *> forwardSlice;
while (currentIndex != slice.size()) {
auto *currentOp = (slice)[currentIndex];
// Compute and insert the backwardSlice starting from currentOp.
backwardSlice.clear();
getBackwardSlice(currentOp, &backwardSlice, backwardFilter);
slice.insert(backwardSlice.begin(), backwardSlice.end());
// Compute and insert the forwardSlice starting from currentOp.
forwardSlice.clear();
getForwardSlice(currentOp, &forwardSlice, forwardFilter);
slice.insert(forwardSlice.begin(), forwardSlice.end());
++currentIndex;
}
return multiRootTopologicalSort(slice);
}
} // namespace mlir