Skip to content

[TIR][Schedule] Make consistent implementation for GetProducers() & GetConsumers() #13344

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
junrushao merged 1 commit into from
Nov 11, 2022
Merged

[TIR][Schedule] Make consistent implementation for GetProducers() & GetConsumers() #13344

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
34 changes: 22 additions & 12 deletions src/tir/schedule/analysis/analysis.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1014,23 +1014,33 @@ std::pair<Array<StmtSRef>, std::vector<int>> CollectComputeLocation(const Schedu
/******** Producer-consumer relation ********/

Array<StmtSRef> GetProducers(const StmtSRef& block_sref, const BlockScope& scope) {
Array<Dependency> deps = scope->GetDepsByDst(block_sref);
Array<StmtSRef> result;
result.reserve(deps.size());
for (const Dependency& dep : deps) {
result.push_back(dep->src);
Array<Dependency> edges = scope->GetDepsByDst(block_sref);
Array<StmtSRef> results;
std::unordered_set<StmtSRef, ObjectPtrHash, ObjectPtrEqual> result_set;
results.reserve(edges.size());
for (const Dependency& edge : edges) {
if ((edge->kind == DepKind::kRAW || edge->kind == DepKind::kWAW) &&
!result_set.count(edge->src)) {
results.push_back(edge->src);
result_set.emplace(edge->src);
}
}
return result;
return results;
}

Array<StmtSRef> GetConsumers(const StmtSRef& block_sref, const BlockScope& scope) {
Array<Dependency> deps = scope->GetDepsBySrc(block_sref);
Array<StmtSRef> result;
result.reserve(deps.size());
for (const Dependency& dep : deps) {
result.push_back(dep->dst);
Array<Dependency> edges = scope->GetDepsBySrc(block_sref);
Array<StmtSRef> results;
std::unordered_set<StmtSRef, ObjectPtrHash, ObjectPtrEqual> result_set;
results.reserve(edges.size());
for (const Dependency& edge : edges) {
if ((edge->kind == DepKind::kRAW || edge->kind == DepKind::kWAW) &&
!result_set.count(edge->dst)) {
results.push_back(edge->dst);
result_set.emplace(edge->dst);
}
}
return result;
return results;
}

ProducerConsumerSplit ProducerConsumerSplit::Find(
Expand Down
27 changes: 3 additions & 24 deletions src/tir/schedule/primitive/get_block_loop.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,6 +16,7 @@
* specific language governing permissions and limitations
* under the License.
*/
#include "../analysis.h"
#include "../utils.h"

namespace tvm {
Expand Down Expand Up @@ -79,34 +80,12 @@ Array<StmtSRef> GetChildBlocks(const ScheduleState& self, const StmtSRef& parent

Array<StmtSRef> GetProducers(const ScheduleState& self, const StmtSRef& block_sref) {
StmtSRef scope_root = GetScopeRoot(self, block_sref, /*require_stage_pipeline=*/false);
Array<Dependency> edges = self->GetBlockScope(scope_root)->GetDepsByDst(block_sref);
Array<StmtSRef> results;
std::unordered_set<StmtSRef, ObjectPtrHash, ObjectPtrEqual> result_set;
results.reserve(edges.size());
for (const Dependency& edge : edges) {
if ((edge->kind == DepKind::kRAW || edge->kind == DepKind::kWAW) &&
!result_set.count(edge->src)) {
results.push_back(edge->src);
result_set.emplace(edge->src);
}
}
return results;
return tir::GetProducers(block_sref, self->GetBlockScope(scope_root));
}

Array<StmtSRef> GetConsumers(const ScheduleState& self, const StmtSRef& block_sref) {
StmtSRef scope_root = GetScopeRoot(self, block_sref, /*require_stage_pipeline=*/false);
Array<Dependency> edges = self->GetBlockScope(scope_root)->GetDepsBySrc(block_sref);
Array<StmtSRef> results;
std::unordered_set<StmtSRef, ObjectPtrHash, ObjectPtrEqual> result_set;
results.reserve(edges.size());
for (const Dependency& edge : edges) {
if ((edge->kind == DepKind::kRAW || edge->kind == DepKind::kWAW) &&
!result_set.count(edge->dst)) {
results.push_back(edge->dst);
result_set.emplace(edge->dst);
}
}
return results;
return tir::GetConsumers(block_sref, self->GetBlockScope(scope_root));
}

/******** InstructionKind Registration ********/
Expand Down