mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 18:54:02 +01:00
d2570e78cd
Summary:
This is the last functional patch affecting the representation of DDG.
Here we try to simplify the DDG to reduce the number of nodes and edges by
iteratively merging pairs of nodes that satisfy the following conditions,
until no such pair can be identified. A pair of nodes consisting of a and b
can be merged if:
1. the only edge from a is a def-use edge to b and
2. the only edge to b is a def-use edge from a and
3. there is no cyclic edge from b to a and
4. all instructions in a and b belong to the same basic block and
5. both a and b are simple (single or multi instruction) nodes.
These criteria allow us to fold many uninteresting def-use edges that
commonly exist in the graph while avoiding the risk of introducing
dependencies that didn't exist before.
Authored By: bmahjour
Reviewer: Meinersbur, fhahn, myhsu, xtian, dmgreen, kbarton, jdoerfert
Reviewed By: Meinersbur
Subscribers: ychen, arphaman, simoll, a.elovikov, mgorny, hiraditya, jfb, wuzish, llvm-commits, jsji, Whitney, etiotto, ppc-slack
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D72350
177 lines
6.3 KiB
LLVM
177 lines
6.3 KiB
LLVM
; RUN: opt < %s -disable-output "-passes=print<ddg>" 2>&1 | FileCheck %s
|
|
|
|
; CHECK-LABEL: 'DDG' for loop 'test1.for.body':
|
|
|
|
; CHECK: Node Address:[[PI:0x[0-9a-f]*]]:pi-block
|
|
; CHECK-NEXT: --- start of nodes in pi-block ---
|
|
; CHECK: Node Address:[[N1:0x[0-9a-f]*]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %i.02 = phi i64 [ %inc, %test1.for.body ], [ 0, %test1.for.body.preheader ]
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N2:0x[0-9a-f]*]]
|
|
|
|
; CHECK: Node Address:[[N2]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %inc = add i64 %i.02, 1
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N1]]
|
|
; CHECK-NEXT: --- end of nodes in pi-block ---
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N3:0x[0-9a-f]*]]
|
|
; CHECK-NEXT: [def-use] to [[N4:0x[0-9a-f]*]]
|
|
; CHECK-NEXT: [def-use] to [[N5:0x[0-9a-f]*]]
|
|
|
|
; CHECK: Node Address:[[N5]]:multi-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %exitcond = icmp ne i64 %inc, %n
|
|
; CHECK-NEXT: br i1 %exitcond, label %test1.for.body, label %for.end.loopexit
|
|
; CHECK-NEXT: Edges:none!
|
|
|
|
; CHECK: Node Address:[[N4]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %arrayidx1 = getelementptr inbounds float, float* %a, i64 %i.02
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N6:0x[0-9a-f]*]]
|
|
|
|
; CHECK: Node Address:[[N3]]:multi-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %arrayidx = getelementptr inbounds float, float* %b, i64 %i.02
|
|
; CHECK-NEXT: %0 = load float, float* %arrayidx, align 4
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N7:0x[0-9a-f]*]]
|
|
|
|
; CHECK: Node Address:[[N8:0x[0-9a-f]*]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %conv = uitofp i64 %n to float
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N7]]
|
|
|
|
; CHECK: Node Address:[[N7]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %add = fadd float %0, %conv
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N6]]
|
|
|
|
; CHECK: Node Address:[[N6]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: store float %add, float* %arrayidx1, align 4
|
|
; CHECK-NEXT: Edges:none!
|
|
|
|
|
|
;; No memory dependencies.
|
|
;; void test1(unsigned long n, float * restrict a, float * restrict b) {
|
|
;; for (unsigned long i = 0; i < n; i++)
|
|
;; a[i] = b[i] + n;
|
|
;; }
|
|
|
|
define void @test1(i64 %n, float* noalias %a, float* noalias %b) {
|
|
entry:
|
|
%exitcond1 = icmp ne i64 0, %n
|
|
br i1 %exitcond1, label %test1.for.body, label %for.end
|
|
|
|
test1.for.body: ; preds = %entry, %test1.for.body
|
|
%i.02 = phi i64 [ %inc, %test1.for.body ], [ 0, %entry ]
|
|
%arrayidx = getelementptr inbounds float, float* %b, i64 %i.02
|
|
%0 = load float, float* %arrayidx, align 4
|
|
%conv = uitofp i64 %n to float
|
|
%add = fadd float %0, %conv
|
|
%arrayidx1 = getelementptr inbounds float, float* %a, i64 %i.02
|
|
store float %add, float* %arrayidx1, align 4
|
|
%inc = add i64 %i.02, 1
|
|
%exitcond = icmp ne i64 %inc, %n
|
|
br i1 %exitcond, label %test1.for.body, label %for.end
|
|
|
|
for.end: ; preds = %test1.for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
|
|
; CHECK-LABEL: 'DDG' for loop 'test2.for.body':
|
|
|
|
; CHECK: Node Address:[[PI:0x[0-9a-f]*]]:pi-block
|
|
; CHECK-NEXT: --- start of nodes in pi-block ---
|
|
; CHECK: Node Address:[[N1:0x[0-9a-f]*]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %i.02 = phi i64 [ %inc, %test2.for.body ], [ 0, %test2.for.body.preheader ]
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N2:0x[0-9a-f]*]]
|
|
|
|
; CHECK: Node Address:[[N2]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %inc = add i64 %i.02, 1
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N1]]
|
|
; CHECK-NEXT: --- end of nodes in pi-block ---
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N3:0x[0-9a-f]*]]
|
|
; CHECK-NEXT: [def-use] to [[N4:0x[0-9a-f]*]]
|
|
; CHECK-NEXT: [def-use] to [[N5:0x[0-9a-f]*]]
|
|
; CHECK-NEXT: [def-use] to [[N6:0x[0-9a-f]*]]
|
|
|
|
; CHECK: Node Address:[[N6]]:multi-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %exitcond = icmp ne i64 %inc, %n
|
|
; CHECK-NEXT: br i1 %exitcond, label %test2.for.body, label %for.end.loopexit
|
|
; CHECK-NEXT: Edges:none!
|
|
|
|
; CHECK: Node Address:[[N5]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %arrayidx2 = getelementptr inbounds float, float* %a, i64 %i.02
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N7:0x[0-9a-f]*]]
|
|
|
|
; CHECK: Node Address:[[N4]]:multi-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %arrayidx1 = getelementptr inbounds float, float* %a, i64 %i.02
|
|
; CHECK-NEXT: %1 = load float, float* %arrayidx1, align 4
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N8:0x[0-9a-f]*]]
|
|
; CHECK-NEXT: [memory] to [[N7]]
|
|
|
|
; CHECK: Node Address:[[N3]]:multi-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %arrayidx = getelementptr inbounds float, float* %b, i64 %i.02
|
|
; CHECK-NEXT: %0 = load float, float* %arrayidx, align 4
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N8]]
|
|
|
|
; CHECK: Node Address:[[N8]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: %add = fadd float %0, %1
|
|
; CHECK-NEXT: Edges:
|
|
; CHECK-NEXT: [def-use] to [[N7]]
|
|
|
|
; CHECK: Node Address:[[N7]]:single-instruction
|
|
; CHECK-NEXT: Instructions:
|
|
; CHECK-NEXT: store float %add, float* %arrayidx2, align 4
|
|
; CHECK-NEXT: Edges:none!
|
|
|
|
|
|
|
|
;; Loop-independent memory dependencies.
|
|
;; void test2(unsigned long n, float * restrict a, float * restrict b) {
|
|
;; for (unsigned long i = 0; i < n; i++)
|
|
;; a[i] = b[i] + a[i];
|
|
;; }
|
|
|
|
define void @test2(i64 %n, float* noalias %a, float* noalias %b) {
|
|
entry:
|
|
%exitcond1 = icmp ne i64 0, %n
|
|
br i1 %exitcond1, label %test2.for.body, label %for.end
|
|
|
|
test2.for.body: ; preds = %entry, %test2.for.body
|
|
%i.02 = phi i64 [ %inc, %test2.for.body ], [ 0, %entry ]
|
|
%arrayidx = getelementptr inbounds float, float* %b, i64 %i.02
|
|
%0 = load float, float* %arrayidx, align 4
|
|
%arrayidx1 = getelementptr inbounds float, float* %a, i64 %i.02
|
|
%1 = load float, float* %arrayidx1, align 4
|
|
%add = fadd float %0, %1
|
|
%arrayidx2 = getelementptr inbounds float, float* %a, i64 %i.02
|
|
store float %add, float* %arrayidx2, align 4
|
|
%inc = add i64 %i.02, 1
|
|
%exitcond = icmp ne i64 %inc, %n
|
|
br i1 %exitcond, label %test2.for.body, label %for.end
|
|
|
|
for.end: ; preds = %test2.for.body, %entry
|
|
ret void
|
|
} |