Skip to content

Commit

Permalink
fixup
Browse files Browse the repository at this point in the history
  • Loading branch information
Rohan Yadav committed Mar 1, 2022
1 parent dbcf161 commit da8d7f4
Show file tree
Hide file tree
Showing 2 changed files with 7 additions and 5 deletions.
6 changes: 4 additions & 2 deletions legion/spmm/taco-generated.cu
Original file line number Diff line number Diff line change
Expand Up @@ -273,8 +273,8 @@ partitionPackForcomputeLegionConsMem partitionForcomputeLegionConsMem(Legion::Co
BRect = BRect.make_empty();
}
BColoring[(*itr)] = BRect;
Point<2> CStart = Point<2>(B2_crd_accessor[B2_pos_accessor[Point<1>(iB)].lo], (jo * ((C2_dimension + (gy - 1)) / gy)));
Point<2> CEnd = Point<2>(TACO_MIN(B2_crd_accessor[((B2_pos_accessor[Point<1>(iB)].hi + 1) - 1)],CDomain.hi()[0]), TACO_MIN((jo * ((C2_dimension + (gy - 1)) / gy) + ((C2_dimension + (gy - 1)) / gy - 1)),CDomain.hi()[1]));
Point<2> CStart = Point<2>(0, (jo * ((C2_dimension + (gy - 1)) / gy)));
Point<2> CEnd = Point<2>(CDomain.hi()[0], TACO_MIN((jo * ((C2_dimension + (gy - 1)) / gy) + ((C2_dimension + (gy - 1)) / gy - 1)),CDomain.hi()[1]));
Rect<2> CRect = Rect<2>(CStart, CEnd);
if (!CDomain.contains(CRect.lo) || !CDomain.contains(CRect.hi)) {
CRect = CRect.make_empty();
Expand Down Expand Up @@ -425,6 +425,8 @@ void computeLegionConsMem(Legion::Context ctx, Legion::Runtime* runtime, LegionT
launcher.add_region_requirement(RegionRequirement(partitionPack->BPartition.indicesPartitions[1][1], 0, READ_ONLY, EXCLUSIVE, get_logical_region(B2_crd_parent)).add_field(FID_COORD));
launcher.add_region_requirement(RegionRequirement(partitionPack->BPartition.valsPartition, 0, READ_ONLY, EXCLUSIVE, B_vals_parent).add_field(FID_VAL));
launcher.add_region_requirement(RegionRequirement(partitionPack->CPartition.valsPartition, 0, READ_ONLY, EXCLUSIVE, C_vals_parent).add_field(FID_VAL));
launcher.tag |= TACOMapper::UNTRACK_VALID_REGIONS;
launcher.tag |= TACOMapper::BACKPRESSURE_TASK;
runtime->execute_index_space(ctx, launcher);

}
Expand Down
6 changes: 3 additions & 3 deletions legion/src/taco_mapper.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -634,7 +634,7 @@ void TACOMapper::report_profiling(const MapperContext ctx,
// Clean up after ourselves.
delete prof;

std::cout << "Report profiling for task: " << task.get_task_name() << " " << task.get_unique_id() << " " << task.index_domain << " " << task.index_point << std::endl;
// std::cout << "Report profiling for task: " << task.get_task_name() << " " << task.get_unique_id() << " " << task.index_domain << " " << task.index_point << std::endl;

// Backpressured tasks are launched in a loop, and are kept on the originating processor.
// So, we'll use orig_proc to index into the queue.
Expand Down Expand Up @@ -690,7 +690,7 @@ void TACOMapper::select_tasks_to_map(const MapperContext ctx,
bool schedule = true;
// TODO (rohany): Handle a case here when the total index space volume is also equal 1.
if (((task->tag & BACKPRESSURE_TASK) != 0) && !(task->is_index_space && task->get_slice_domain().get_volume() > 1)) {
std::cout << "Visiting task: " << task->get_task_name() << " " << task->get_unique_id() << " " << task->index_domain << " " << task->index_point << " " << task->get_slice_domain() << std::endl;
// std::cout << "Visiting task: " << task->get_task_name() << " " << task->get_unique_id() << " " << task->index_domain << " " << task->index_point << " " << task->get_slice_domain() << std::endl;
// See how many tasks we have in flight. Again, we use the orig_proc here
// rather than target_proc to match with our heuristics for where serial task
// launch loops go.
Expand Down Expand Up @@ -720,7 +720,7 @@ void TACOMapper::select_tasks_to_map(const MapperContext ctx,
if (schedule && (*it)->get_depth() == max_depth)
{
auto dom = task->get_slice_domain();
std::cout << "Putting task in output map queue: " << Utilities::to_string(runtime, ctx, *task) << " " << task->index_domain << " " << (dom.exists() ? dom : Domain(Rect<1>(0, 0))) << std::endl;
// std::cout << "Putting task in output map queue: " << Utilities::to_string(runtime, ctx, *task) << " " << task->index_domain << " " << (dom.exists() ? dom : Domain(Rect<1>(0, 0))) << std::endl;
output.map_tasks.insert(*it);
count++;
}
Expand Down

0 comments on commit da8d7f4

Please sign in to comment.