/external/llvm/test/Analysis/BlockFrequencyInfo/ |
D | irreducible_loop_crash.ll | 10 br i1 undef, label %if.end.12, label %for.body.5 12 for.inc: 14 br label %for.body.5 16 for.body.5: ; preds = %for.cond.4.preheader 17 br i1 %tobool7, label %for.inc.9, label %for.inc 19 for.inc.9: ; preds = %for.body.5 20 br i1 %tobool7, label %for.inc.9.1, label %for.inc 22 if.end.12: ; preds = %if.end.12, %for.body 23 br i1 undef, label %for.end.17, label %for.inc 25 for.end.17: ; preds = %entry [all …]
|
/external/llvm-project/llvm/test/Analysis/BlockFrequencyInfo/ |
D | irreducible_loop_crash.ll | 10 br i1 undef, label %if.end.12, label %for.body.5 12 for.inc: 14 br label %for.body.5 16 for.body.5: ; preds = %for.cond.4.preheader 17 br i1 %tobool7, label %for.inc.9, label %for.inc 19 for.inc.9: ; preds = %for.body.5 20 br i1 %tobool7, label %for.inc.9.1, label %for.inc 22 if.end.12: ; preds = %if.end.12, %for.body 23 br i1 undef, label %for.end.17, label %for.inc 25 for.end.17: ; preds = %entry [all …]
|
/external/llvm-project/llvm/test/Transforms/LoopStrengthReduce/AArch64/ |
D | pr47329.ll | 10 br label %for.body9 12 for.body9: ; preds = %for.body9, %entry 13 %i = phi i32** [ %.pre.pre, %entry ], [ %incdec.ptr, %for.body9 ] 15 br i1 undef, label %for.body9, label %for.inc 17 for.inc: ; preds = %for.body9 18 br label %for.body9.118 20 for.body9.1: ; preds = %for.inc.547, %for.body9.1 21 %i1 = phi i32** [ %incdec.ptr.1, %for.body9.1 ], [ %incdec.ptr.542, %for.inc.547 ] 23 br i1 undef, label %for.body9.1, label %for.inc.1 25 for.inc.1: ; preds = %for.body9.1 [all …]
|
/external/llvm-project/llvm/test/Transforms/IndVarSimplify/X86/ |
D | verify-scev.ll | 7 br i1 undef, label %for.end, label %for.body 9 for.body: ; preds = %for.body, %entry 10 br i1 false, label %for.end, label %for.body 12 for.end: ; preds = %for.body, %entry 13 br i1 undef, label %for.end11, label %for.body3 15 for.body3: ; preds = %for.end 18 for.end11: ; preds = %for.end 21 while.body: ; preds = %for.end11 24 while.end: ; preds = %for.end11 25 br i1 undef, label %if.end115, label %for.cond109 [all …]
|
/external/llvm/test/Transforms/IndVarSimplify/ |
D | verify-scev.ll | 7 br i1 undef, label %for.end, label %for.body 9 for.body: ; preds = %for.body, %entry 10 br i1 false, label %for.end, label %for.body 12 for.end: ; preds = %for.body, %entry 13 br i1 undef, label %for.end11, label %for.body3 15 for.body3: ; preds = %for.end 18 for.end11: ; preds = %for.end 21 while.body: ; preds = %for.end11 24 while.end: ; preds = %for.end11 25 br i1 undef, label %if.end115, label %for.cond109 [all …]
|
D | pr20680.ll | 24 br label %for.cond2.preheader 26 for.cond2.preheader: ; preds = %for.inc13, %entry 27 %storemerge15 = phi i8 [ -14, %entry ], [ %inc14, %for.inc13 ] 28 br i1 %tobool2, label %for.inc13, label %for.body3.lr.ph 30 for.body3.lr.ph: ; preds = %for.cond2.preheader 36 …br i1 %tobool5, label %for.body3.lr.ph.split.us, label %for.body3.lr.ph.for.body3.lr.ph.split_crit… 38 for.body3.lr.ph.for.body3.lr.ph.split_crit_edge: ; preds = %for.body3.lr.ph 39 br label %for.body3.lr.ph.split 41 for.body3.lr.ph.split.us: ; preds = %for.body3.lr.ph 42 …br i1 %tobool, label %for.body3.lr.ph.split.us.split.us, label %for.body3.lr.ph.split.us.for.body3… [all …]
|
/external/llvm-project/llvm/test/Analysis/LoopNestAnalysis/ |
D | nests-with-lcssa.ll | 5 ; for (int i = 0; i < N; ++i) { 6 ; for (int j = 0; j < M; ++j) res += i * j; 12 ; CHECK: IsPerfect=true, Depth=1, OutermostLoop: for.j, Loops: ( for.j ) 13 ; CHECK: IsPerfect=true, Depth=2, OutermostLoop: for.i, Loops: ( for.i for.j ) 16 br i1 %cmp4, label %for.i.ph, label %for.i.end 18 for.i.ph: ; preds = %entry 19 br label %for.i 21 for.i: ; preds = %for.i.ph, %for.i.inc 22 %i.06 = phi i32 [ 0, %for.i.ph ], [ %inc5, %for.i.inc ] 23 %res.05 = phi i32 [ 0, %for.i.ph ], [ %res.1.lcssa, %for.i.inc ] [all …]
|
/external/llvm-project/llvm/test/Transforms/LoopVectorize/ARM/ |
D | mve-interleaved-cost.ll | 15 br label %for.body 18 ; VF_2: Found an estimated cost of 20 for VF 2 For instruction: %tmp2 = load i8, i8* %tmp0… 19 ; VF_2-NEXT: Found an estimated cost of 0 for VF 2 For instruction: %tmp3 = load i8, i8* %tmp1,… 20 ; VF_2-NEXT: Found an estimated cost of 0 for VF 2 For instruction: store i8 0, i8* %tmp0, alig… 21 ; VF_2-NEXT: Found an estimated cost of 12 for VF 2 For instruction: store i8 0, i8* %tmp1, ali… 23 ; VF_4: Found an estimated cost of 4 for VF 4 For instruction: %tmp2 = load i8, i8* %tmp0,… 24 ; VF_4-NEXT: Found an estimated cost of 0 for VF 4 For instruction: %tmp3 = load i8, i8* %tmp1,… 25 ; VF_4-NEXT: Found an estimated cost of 0 for VF 4 For instruction: store i8 0, i8* %tmp0, alig… 26 ; VF_4-NEXT: Found an estimated cost of 4 for VF 4 For instruction: store i8 0, i8* %tmp1, alig… 28 ; VF_8: Found an estimated cost of 4 for VF 8 For instruction: %tmp2 = load i8, i8* %tmp0,… [all …]
|
/external/pdfium/testing/resources/javascript/ |
D | listbox_methods_expected.txt | 2 Alert: Answer for "foo" is: string foo 3 Alert: Answer for "bar" is: string bar 4 Alert: Answer for "qux" is: string qux 5 Alert: Answer for "bar" is: string bar 6 Alert: Answer for "qux" is: string qux 8 Alert: Answer for "" is: string 9 Alert: Answer for "goats" is: string 10 Alert: Answer for "b4" is: string 11 Alert: Answer for "b4.5" is: string 12 Alert: Answer for "4x" is: string [all …]
|
/external/llvm-project/polly/test/Isl/CodeGen/ |
D | loop-invariant-load-type-mismatch.ll | 13 br label %for.body 15 for.cond.30.for.cond.loopexit_crit_edge: ; preds = %for.end.54 16 br label %for.cond.loopexit 18 for.cond.loopexit: ; preds = %for.cond.30.preheader, %for.cond.30.fo… 20 br i1 false, label %for.body, label %for.end.65 22 for.body: ; preds = %for.cond.loopexit, %entry.split 23 %indvars.iv130 = phi i32 [ 1, %entry.split ], [ %indvars.iv.next131, %for.cond.loopexit ] 24 br i1 true, label %for.body.3.lr.ph, label %for.cond.30.preheader 26 for.body.3.lr.ph: ; preds = %for.body 27 br label %for.body.3 [all …]
|
/external/python/google-api-python-client/docs/dyn/ |
D | dfareporting_v3_3.accounts.html | 111 …"maximumImageSize": "A String", # Maximum image size allowed for this account, in kilobytes. Value… 114 # - "1" for USD 115 # - "2" for GBP 116 # - "3" for ESP 117 # - "4" for SEK 118 # - "5" for CAD 119 # - "6" for JPY 120 # - "7" for DEM 121 # - "8" for AUD 122 # - "9" for FRF [all …]
|
D | dfareporting_v3_1.accounts.html | 111 …"maximumImageSize": "A String", # Maximum image size allowed for this account, in kilobytes. Value… 114 # - "1" for USD 115 # - "2" for GBP 116 # - "3" for ESP 117 # - "4" for SEK 118 # - "5" for CAD 119 # - "6" for JPY 120 # - "7" for DEM 121 # - "8" for AUD 122 # - "9" for FRF [all …]
|
D | dfareporting_v3_2.accounts.html | 111 …"maximumImageSize": "A String", # Maximum image size allowed for this account, in kilobytes. Value… 114 # - "1" for USD 115 # - "2" for GBP 116 # - "3" for ESP 117 # - "4" for SEK 118 # - "5" for CAD 119 # - "6" for JPY 120 # - "7" for DEM 121 # - "8" for AUD 122 # - "9" for FRF [all …]
|
D | dfareporting_v2_8.accounts.html | 111 …"maximumImageSize": "A String", # Maximum image size allowed for this account, in kilobytes. Value… 114 # - "1" for USD 115 # - "2" for GBP 116 # - "3" for ESP 117 # - "4" for SEK 118 # - "5" for CAD 119 # - "6" for JPY 120 # - "7" for DEM 121 # - "8" for AUD 122 # - "9" for FRF [all …]
|
D | dfareporting_v2_7.accounts.html | 111 …"maximumImageSize": "A String", # Maximum image size allowed for this account, in kilobytes. Value… 114 # - "1" for USD 115 # - "2" for GBP 116 # - "3" for ESP 117 # - "4" for SEK 118 # - "5" for CAD 119 # - "6" for JPY 120 # - "7" for DEM 121 # - "8" for AUD 122 # - "9" for FRF [all …]
|
/external/llvm-project/llvm/test/Analysis/DependenceAnalysis/ |
D | DADelin.ll | 9 ;; for (int i = 0; i < n; i++) 10 ;; for (int j = 0; j < m; j++) 11 ;; for (int k = 0; k < o; k++) 20 br i1 %cmp49, label %for.cond1.preheader.lr.ph, label %for.cond.cleanup 22 for.cond1.preheader.lr.ph: ; preds = %entry 25 br label %for.cond1.preheader 27 for.cond1.preheader: ; preds = %for.cond.cleanup3, %for.cond1.preheade… 28 %i.050 = phi i32 [ 0, %for.cond1.preheader.lr.ph ], [ %inc23, %for.cond.cleanup3 ] 29 br i1 %cmp247, label %for.cond5.preheader.lr.ph, label %for.cond.cleanup3 31 for.cond5.preheader.lr.ph: ; preds = %for.cond1.preheader [all …]
|
D | SymbolicRDIV.ll | 10 ;; for (long int i = 0; i < n1; i++) 12 ;; for (long int j = 0; j < n2; j++) 18 br i1 %cmp4, label %for.cond1.preheader, label %for.body.preheader 20 ; CHECK: 'Dependence Analysis' for function 'symbolicrdiv0' 28 for.body.preheader: ; preds = %entry 29 br label %for.body 31 for.cond1.preheader.loopexit: ; preds = %for.body 32 br label %for.cond1.preheader 34 for.cond1.preheader: ; preds = %for.cond1.preheader.loopexit, %entry 36 br i1 %cmp21, label %for.end11, label %for.body4.preheader [all …]
|
/external/llvm-project/llvm/test/Transforms/LoopFlatten/ |
D | loop-flatten-negative.ll | 14 br i1 %cmp25, label %for.body4.lr.ph, label %for.cond.cleanup 16 for.body4.lr.ph: 17 %i.026 = phi i32 [ %inc10, %for.cond.cleanup3 ], [ 1, %entry ] 19 br label %for.body4 21 for.body4: 22 %j.024 = phi i32 [ 0, %for.body4.lr.ph ], [ %inc, %for.body4 ] 31 br i1 %exitcond, label %for.cond.cleanup3, label %for.body4 33 for.cond.cleanup3: 36 br i1 %exitcond27, label %for.cond.cleanup, label %for.body4.lr.ph 38 for.cond.cleanup: [all …]
|
D | loop-flatten.ll | 9 br label %for.body 12 ; CHECK: br label %for.body 14 for.body: ; preds = %entry, %for.inc6 15 %i.018 = phi i32 [ 0, %entry ], [ %inc7, %for.inc6 ] 17 br label %for.body3 18 ; CHECK: for.body: 19 ; CHECK: %i.018 = phi i32 [ 0, %entry ], [ %inc7, %for.inc6 ] 21 ; CHECK: br label %for.body3 23 for.body3: ; preds = %for.body, %for.body3 24 %j.017 = phi i32 [ 0, %for.body ], [ %inc, %for.body3 ] [all …]
|
/external/llvm/test/Analysis/DependenceAnalysis/ |
D | SymbolicRDIV.ll | 8 ;; for (long int i = 0; i < n1; i++) 10 ;; for (long int j = 0; j < n2; j++) 16 br i1 %cmp4, label %for.cond1.preheader, label %for.body.preheader 18 ; CHECK: 'Dependence Analysis' for function 'symbolicrdiv0' 26 for.body.preheader: ; preds = %entry 27 br label %for.body 29 for.cond1.preheader.loopexit: ; preds = %for.body 30 br label %for.cond1.preheader 32 for.cond1.preheader: ; preds = %for.cond1.preheader.loopexit, %entry 34 br i1 %cmp21, label %for.end11, label %for.body4.preheader [all …]
|
D | Preliminary.ll | 44 ;; for (long int i = 0; i < n; i++) { 45 ;; for (long int j = 0; j < n; j++) { 46 ;; for (long int k = 0; k < n; k++) { 49 ;; for (long int k = 0; k < n; k++) { 55 br i1 %cmp10, label %for.cond1.preheader.preheader, label %for.end26 64 for.cond1.preheader.preheader: ; preds = %entry 65 br label %for.cond1.preheader 67 for.cond1.preheader: ; preds = %for.cond1.preheader.preheader, %for.in… 68 %B.addr.012 = phi i64* [ %B.addr.1.lcssa, %for.inc24 ], [ %B, %for.cond1.preheader.preheader ] 69 %i.011 = phi i64 [ %inc25, %for.inc24 ], [ 0, %for.cond1.preheader.preheader ] [all …]
|
/external/llvm-project/llvm/test/Transforms/LoopUnrollAndJam/ |
D | disable.ll | 6 ;; Common check for all tests. None should be unroll and jammed 11 ; Tests for(i) { sum = A[i]; for(j) sum += B[j]; A[i+1] = sum; } 14 ; CHECK: %i.029 = phi i32 [ %add10, %for.latch ], [ 0, %for.preheader ] 15 ; CHECK: %j.026 = phi i32 [ 0, %for.outer ], [ %inc, %for.inner ] 20 br i1 %or.cond, label %for.preheader, label %return 22 for.preheader: 23 br label %for.outer 25 for.outer: 26 %i.029 = phi i32 [ %add10, %for.latch ], [ 0, %for.preheader ] 27 %b.028 = phi i32 [ %inc8, %for.latch ], [ 1, %for.preheader ] [all …]
|
D | unroll-and-jam.ll | 8 ; Tests for(i) { sum = 0; for(j) sum += B[j]; A[i] = sum; } 14 ; CHECK: for.outer.preheader: 19 ; CHECK: for.outer.preheader.new: 22 ; CHECK: for.outer: 34 ; CHECK: for.inner: 61 ; CHECK: for.latch: 76 ; CHECK: for.end.loopexit.unr-lcssa.loopexit: 79 ; CHECK: for.end.loopexit.unr-lcssa: 83 ; CHECK: for.outer.epil.preheader: 85 ; CHECK: for.outer.epil: [all …]
|
/external/llvm-project/llvm/test/Transforms/LoopDeletion/ |
D | update-scev.ll | 6 ; Checking for a crash. Loop-deletion would change the loop 16 br label %for.cond 18 for.cond: ; preds = %for.cond14, %entry 19 %f.0 = phi i32 [ 20, %entry ], [ 0, %for.cond14 ] 20 br label %for.body 22 for.body: ; preds = %for.inc11, %for.cond 23 ; IR-AFTER-TRANSFORM: for.body: 26 ; IR-AFTER-TRANSFORM: for.body6: 30 ; SCEV-EXPRS-NEXT: --> {{.*}} LoopDispositions: { %for.body: Variant, %for.cond: Variant, %for.bo… 31 %val = phi i32 [ -20, %for.cond ], [ %inc12, %for.inc11 ] [all …]
|
/external/llvm/test/Transforms/LoopInterchange/ |
D | reductions.ll | 8 ;; for( int i=1;i<N;i++) 9 ;; for( int j=1;j<N;j++) 15 br i1 %cmp16, label %for.body3.lr.ph, label %for.end8 17 for.body3.lr.ph: ; preds = %entry, %for.cond1.for.inc6_crit_edge 18 %indvars.iv18 = phi i64 [ %indvars.iv.next19, %for.cond1.for.inc6_crit_edge ], [ 1, %entry ] 20 br label %for.body3 22 for.body3: ; preds = %for.body3, %for.body3.lr.ph 23 %indvars.iv = phi i64 [ 1, %for.body3.lr.ph ], [ %indvars.iv.next, %for.body3 ] 24 %add15 = phi i32 [ %X.promoted, %for.body3.lr.ph ], [ %add, %for.body3 ] 31 br i1 %exitcond, label %for.cond1.for.inc6_crit_edge, label %for.body3 [all …]
|