Sameer Sahasrabuddhe 475ce4c200 RFC: Uniformity Analysis for Irreducible Control Flow
Uniformity analysis is a generalization of divergence analysis to
include irreducible control flow:

  1. The proposed spec presents a notion of "maximal convergence" that
     captures the existing convention of converging threads at the
     headers of natual loops.

  2. Maximal convergence is then extended to irreducible cycles. The
     identity of irreducible cycles is determined by the choices made
     in a depth-first traversal of the control flow graph. Uniformity
     analysis uses criteria that depend only on closed paths and not
     cycles, to determine maximal convergence. This makes it a
     conservative analysis that is independent of the effect of DFS on
     CycleInfo.

  3. The analysis is implemented as a template that can be
     instantiated for both LLVM IR and Machine IR.

Validation:
  - passes existing tests for divergence analysis
  - passes new tests with irreducible control flow
  - passes equivalent tests in MIR and GMIR

Based on concepts originally outlined by
Nicolai Haehnle <nicolai.haehnle@amd.com>

With contributions from Ruiling Song <ruiling.song@amd.com> and
Jay Foad <jay.foad@amd.com>.

Support for GMIR and lit tests for GMIR/MIR added by
Yashwant Singh <yashwant.singh@amd.com>.

Differential Revision: https://reviews.llvm.org/D130746
2022-12-20 07:22:24 +05:30

48 lines
1.7 KiB
LLVM

; RUN: opt -mtriple amdgcn-unknown-amdhsa -passes='print<divergence>' -disable-output %s 2>&1 | FileCheck %s
; RUN: opt -mtriple amdgcn-unknown-amdhsa -passes='print<uniformity>' -disable-output %s 2>&1 | FileCheck %s
; CHECK: DIVERGENT: %.126.i355.i = phi i1 [ false, %bb5 ], [ true, %bb4 ]
; Function Attrs: nounwind readnone speculatable
declare i32 @llvm.amdgcn.workitem.id.x() #0
define protected amdgpu_kernel void @_Z23krnl_GPUITSFitterKerneli() {
bb0:
%i4 = call i32 @llvm.amdgcn.workitem.id.x()
%i5 = icmp eq i32 %i4, -1
br label %bb1
bb1: ; preds = %bb3, %bb0
%lsr.iv = phi i32 [ %i1, %bb3 ], [ 7, %bb0 ]
br i1 %i5, label %bb2, label %bb3
bb2: ; preds = %bb1
%lsr.iv.next = add nsw i32 %lsr.iv, -1
%i14 = icmp eq i32 %lsr.iv.next, 0
br label %bb3
bb3: ; preds = %bb2, %bb1
%i1 = phi i32 [ %lsr.iv.next, %bb2 ], [ 0, %bb1 ]
%i2 = phi i1 [ false, %bb2 ], [ true, %bb1 ]
%i3 = phi i1 [ %i14, %bb2 ], [ true, %bb1 ]
br i1 %i3, label %bb4, label %bb1
bb4: ; preds = %bb3
br i1 %i2, label %bb5, label %bb6
bb5: ; preds = %bb4
br label %bb6
bb6: ; preds = %bb5, %bb4
%.126.i355.i = phi i1 [ false, %bb5 ], [ true, %bb4 ]
br i1 %.126.i355.i, label %bb7, label %bb8
bb7: ; preds = %bb6
br label %bb8
bb8: ; preds = %bb7, %bb6
ret void
}
attributes #0 = { nounwind readnone speculatable }