[all-commits] [llvm/llvm-project] 39f274: [AMDGPU] IGroupLP: Avoid repeating reachability ch...

[Frederik Harwath via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: 39f2740faceafb5bb9fc2ad799eb17135faa1a38
      https://github.com/llvm/llvm-project/commit/39f2740faceafb5bb9fc2ad799eb17135faa1a38
  Author: Frederik Harwath <frederik.harwath at amd.com>
  Date:   2026-03-03 (Tue, 03 Mar 2026)

  Changed paths:
    M llvm/lib/Target/AMDGPU/AMDGPUIGroupLP.cpp

  Log Message:
  -----------
  [AMDGPU] IGroupLP: Avoid repeating reachability checks in greedy algorithm (#182463)

In the greedy pipeline solver, the group cost is found using the
addEdges function and the edges must be removed from the DAG after
processing each group. The best group edges are then reinserted using
the same function. This repeats the costly reachability checks inside
the function which become problematic for pipelines with many
SchedGroups.

The algorithm is changed to remember the best group edges instead of
recomputing them. Additionally, SchedGroup::tryAddEdge is refactored to
avoid a redundant cycle check which is already performed by DAG->addEdge.



To unsubscribe from these emails, change your notification settings at https://github.com/llvm/llvm-project/settings/notifications