Searched refs:carried (Results 1 – 25 of 161) sorted by relevance
1234567
| /external/rust/crates/ring/crypto/limbs/ |
| D | limbs.c | 183 Limb carried = 0; in GFp_limbs_mul_add_limb() local
189 Carry c = limb_add(&tmp, lo, carried); in GFp_limbs_mul_add_limb()
190 c = limb_adc(&carried, hi, 0, c); in GFp_limbs_mul_add_limb()
193 c = limb_adc(&carried, carried, 0, c); in GFp_limbs_mul_add_limb()
197 return carried; in GFp_limbs_mul_add_limb()
|
| /external/llvm-project/llvm/test/Analysis/DivergenceAnalysis/AMDGPU/ |
| D | temporal_diverge.ll | 3 ; temporal-divergent use of value carried by divergent loop
27 ; temporal-divergent use of value carried by divergent loop inside a top-level loop
59 ; temporal-uniform use of a valud, definition and users are carried by a surrounding divergent loop
91 ; temporal-divergent use of value carried by divergent loop, user is inside sibling loop
121 ; temporal-divergent use of value carried by divergent loop, user is inside sibling loop, defs and …
|
| /external/llvm-project/llvm/test/CodeGen/Hexagon/ |
| D | swp-loop-carried-unknown.ll | 4 ; loop carried dependence. Previously, the loop carried dependence wasn't added
|
| D | swp-loop-carried.ll | 4 ; A Phi that depends on another Phi is loop carried.
|
| D | swp-carried-dep2.mir | 4 # Test that the loop carried dependence check correctly identifies a recurrence
|
| D | swp-rename-dead-phi.ll | 4 ; Pipelining can eliminate the need for a Phi if the loop carried use
|
| D | swp-epilog-phi12.ll | 3 ; Test epilogue generation when reading loop-carried dependency from a previous
|
| /external/llvm-project/llvm/test/tools/llvm-mca/X86/BtVer2/ |
| D | bottleneck-hints-4.s | 32 # CHECK-NEXT: | < loop carried >
38 # CHECK-NEXT: | < loop carried >
|
| D | bottleneck-hints-2.s | 30 # CHECK-NEXT: | < loop carried >
34 # CHECK-NEXT: | < loop carried >
|
| D | bottleneck-hints-1.s | 31 # CHECK-NEXT: | < loop carried >
38 # CHECK-NEXT: | < loop carried >
|
| D | bottleneck-hints-3.s | 35 # CHECK-NEXT: | < loop carried >
46 # CHECK-NEXT: | < loop carried >
|
| /external/llvm-project/llvm/test/tools/llvm-mca/X86/ |
| D | option-all-views-1.s | 33 # FULLREPORT-NEXT: | < loop carried >
37 # FULLREPORT-NEXT: | < loop carried >
|
| D | option-all-views-2.s | 32 # ALL-NEXT: | < loop carried >
36 # ALL-NEXT: | < loop carried >
|
| /external/llvm-project/llvm/test/MC/Mips/mips64r6/ |
| D | valid.s | 17 # FIXME: Add the instructions carried forward from older ISA's
|
| /external/llvm-project/llvm/test/MC/Mips/mips32r6/ |
| D | valid.s | 17 # FIXME: Add the instructions carried forward from older ISA's
|
| /external/llvm-project/llvm/test/CodeGen/AArch64/ |
| D | function-info-noredzone-present.ll | 3 ; Here we check thatt the noredzone attribute is carried through the machine
|
| /external/llvm/test/MC/Mips/mips32r6/ |
| D | valid.s | 17 # FIXME: Add the instructions carried forward from older ISA's
|
| /external/llvm/test/MC/Mips/mips64r6/ |
| D | valid.s | 17 # FIXME: Add the instructions carried forward from older ISA's
|
| /external/llvm-project/llvm/test/Transforms/LoopLoadElim/ |
| D | def-store-before-load.ll | 3 ; No loop-carried forwarding: The intervening store to A[i] kills the stored
|
| D | non-consecutive.ll | 3 ; The accesses to A are independent here but LAA reports it as a loop-carried
|
| /external/llvm/test/Transforms/LoopLoadElim/ |
| D | def-store-before-load.ll | 3 ; No loop-carried forwarding: The intervening store to A[i] kills the stored
|
| D | non-consecutive.ll | 3 ; The accesses to A are independent here but LAA reports it as a loop-carried
|
| /external/fonttools/Doc/source/cu2qu/ |
| D | index.rst | 8 Conversion is carried out to a degree of tolerance provided by the user. While
|
| /external/llvm/test/Analysis/LoopAccessAnalysis/ |
| D | safe-no-checks.ll | 11 ; Check the loop-carried forward anti-dep between the load of A[i+1] and the
|
| /external/llvm-project/llvm/test/Analysis/LoopAccessAnalysis/ |
| D | safe-no-checks.ll | 11 ; Check the loop-carried forward anti-dep between the load of A[i+1] and the
|
1234567