Home
last modified time | relevance | path

Searched full:reduction (Results 1 – 25 of 794) sorted by relevance

12345678910>>...32

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DIVDescriptors.cpp93 /// Compute the minimal bit width needed to represent a reduction whose exit
138 /// model, given a reduction exit value and the minimal type in which the
139 // reduction can be represented. Also search casts to the recurrence type
181 // Check if a given Phi node can be recognized as an ordered reduction for
196 // Ensure the exit instruction has only one user other than the reduction PHI in checkOrderedReduction()
200 // The only pattern accepted is the one in which the reduction PHI in checkOrderedReduction()
209 LLVM_DEBUG(dbgs() << "LV: Found an ordered reduction: Phi: " << *Phi in checkOrderedReduction()
222 // Reduction variables are only found in the loop header block. in AddReductionVar()
226 // Obtain the reduction start value from the value that comes from the loop in AddReductionVar()
231 // We only allow for a single reduction value to be used outside the loop. in AddReductionVar()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPRecipeBuilder.h26 /// A chain of instructions that form a partial reduction.
31 PartialReductionChain(Instruction *Reduction, Instruction *ExtendA, in PartialReductionChain()
33 : Reduction(Reduction), ExtendA(ExtendA), ExtendB(ExtendB), in PartialReductionChain()
35 /// The top-level binary operation that forms the reduction to a scalar
37 Instruction *Reduction; member
79 /// Cross-iteration reduction & first-order recurrence phis for which we need
84 /// A mapping of partial reduction exit instructions to their scaling factor.
133 /// Examines reduction operations to see if the target can use a cheaper
135 /// Each element within Chains is a pair with a struct containing reduction
172 /// Create and return a partial reduction recipe for a reduction instruction
[all …]
/freebsd/contrib/arm-optimized-routines/math/aarch64/experimental/
H A Dtanf_3u3.c37 /* Reduction of the input argument x using Cody-Waite approach, such that x = r
48 /* r = x - n * (pi/2) (range reduction into -pi/4 .. pi/4). */ in reduce()
58 Reduction uses a table of 4/PI with 192 bits of precision. A 32x96->128 bit
103 /* Dispatch between no reduction (small numbers), fast reduction and in tanf()
104 slow large numbers reduction. The reduction step determines r float in tanf()
124 /* Similar to other trigonometric routines, fast inaccurate reduction is in tanf()
128 but slower reduction techniques need to be implemented to reach a similar in tanf()
132 /* Fast inaccurate reduction. */ in tanf()
137 /* Slow accurate reduction. */ in tanf()
162 /* Perform additional reduction if required. */ in tanf()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DExpandReductions.cpp1 //===- ExpandReductions.cpp - Expand reduction intrinsics -----------------===//
9 // This pass implements IR expansion for reduction intrinsics, allowing targets
73 // FMFs must be attached to the call, otherwise it's an ordered reduction in expandReductions()
93 // Or reduction for i1 is represented as: in expandReductions()
96 // And reduction for i1 is represented as: in expandReductions()
111 assert(ID == Intrinsic::vector_reduce_or && "Expected or reduction."); in expandReductions()
137 // We require "nnan" to use a shuffle reduction; "nsz" is implied by the in expandReductions()
138 // semantics of the reduction. in expandReductions()
177 "Expand reduction intrinsics", false, false)
180 "Expand reduction intrinsics", false, false) in INITIALIZE_PASS_DEPENDENCY()
H A DExpandVectorPredication.cpp173 /// Lower this VP reduction to a call to an unpredicated reduction intrinsic.
351 Value *Reduction; in expandPredicationInReduction() local
356 llvm_unreachable("Impossible reduction kind"); in expandPredicationInReduction()
365 Reduction = Builder.CreateUnaryIntrinsic(RedID, RedOp); in expandPredicationInReduction()
366 Reduction = in expandPredicationInReduction()
367 Builder.CreateBinOp((Instruction::BinaryOps)Opc, Reduction, Start); in expandPredicationInReduction()
380 Reduction = Builder.CreateUnaryIntrinsic(RedID, RedOp); in expandPredicationInReduction()
381 transferDecorations(*Reduction, VPI); in expandPredicationInReduction()
382 Reduction = Builder.CreateBinaryIntrinsic(ScalarID, Reduction, Start); in expandPredicationInReduction()
386 Reduction = Builder.CreateFAddReduce(Start, RedOp); in expandPredicationInReduction()
[all …]
/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DCGOpenMPRuntime.h128 /// Class intended to support codegen of all kind of the reduction clauses.
131 /// Data required for codegen of reduction clauses.
139 /// Helper expression for generation reduction operation.
146 /// List of reduction-based clauses.
153 /// Sizes of the reduction items in chars.
155 /// Base declarations for the reduction items.
163 /// \param N Number of reduction item in the common list.
166 /// \param DRD Declare reduction construct used for reduction item.
175 /// Emits lvalue for the shared and original reduction item.
176 /// \param N Number of the reduction item.
[all …]
H A DCGOpenMPRuntimeGPU.h261 /// Emit a code for reduction clause.
263 /// \param Privates List of private copies for original reduction arguments.
264 /// \param LHSExprs List of LHS in \a ReductionOps reduction operations.
265 /// \param RHSExprs List of RHS in \a ReductionOps reduction operations.
266 /// \param ReductionOps List of reduction operations in form 'LHS binop RHS'
268 /// \param Options List of options for reduction codegen:
271 /// SimpleReduction Emit reduction operation only. Used for omp simd
273 /// ReductionKind The kind of reduction to perform.
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIVDescriptors.h57 AnyOf, ///< AnyOf reduction with select(cmp(),x,y) where one of (x,y) is
59 FindFirstIVSMin, /// FindFirst reduction with select(icmp(),x,y) where one of
61 ///< are integer type, producing a SMin reduction.
62 FindFirstIVUMin, /// FindFirst reduction with select(icmp(),x,y) where one of
64 ///< are integer type, producing a UMin reduction.
65 FindLastIVSMax, ///< FindLast reduction with select(cmp(),x,y) where one of
67 ///< are integer type, producing a SMax reduction.
68 FindLastIVUMax, ///< FindLast reduction with select(cmp(),x,y) where one of
70 ///< are integer type, producing a UMax reduction.
72 // TODO: Any_of and FindLast reduction need not be restricted to integer type
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMParallelDSP.cpp55 class Reduction;
85 class Reduction { class
93 Reduction() = delete;
95 Reduction (Instruction *Add) : Root(Add) { } in Reduction() function in __anon176cfc890111::Reduction
97 /// Record an Add instruction that is a part of the this reduction.
101 /// of this reduction.
133 /// reduction already has a value to initialise the accumulator.
155 /// Return the add instruction which is the root of the reduction.
165 /// Return the set of adds that comprise the reduction.
169 /// the reduction.
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopUtils.h374 /// Returns the arithmetic instruction opcode used when expanding a reduction.
376 /// Returns the reduction intrinsic id corresponding to the binary operation.
379 /// Returns the min/max intrinsic used when expanding a min/max reduction.
382 /// Returns the min/max intrinsic used when expanding a min/max reduction.
385 /// Returns the recurence kind used when expanding a min/max reduction.
388 /// Returns the comparison predicate used when expanding a min/max reduction.
392 /// the identity value for the reduction.
405 /// Generates an ordered vector reduction using extracts to reduce the value.
410 /// Generates a vector reduction using shufflevectors to reduce the value.
417 /// Create a reduction of the given vector. The reduction operation
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DDeclOpenMP.h167 /// This represents '#pragma omp declare reduction ...' directive.
168 /// For example, in the following, declared reduction 'foo' for types 'int' and
172 /// #pragma omp declare reduction (foo : int,float : omp_out += omp_in)
182 /// Combiner for declare reduction construct.
184 /// Initializer for declare reduction construct.
195 /// Reference to the previous declare reduction construct in the same
197 /// the declare reduction construct is declared inside compound statement.
211 /// Create declare reduction node.
215 /// Create deserialized declare reduction node.
219 /// Get combiner expression of the declare reduction construct.
[all …]
/freebsd/crypto/openssl/crypto/modes/asm/
H A Dghashp8-ppc.pl30 # 2x aggregated reduction improves performance by 50% (resulting
32 # aggregated reduction - by 170% or 2.7x (resulting in 0.55 cpb).
125 vpmsumd $t2,$Xl,$xC2 # 1st reduction phase
135 vsldoi $t1,$Xl,$Xl,8 # 2nd reduction phase
161 vpmsumd $t2,$Xl,$xC2 # 1st reduction phase
162 vpmsumd $t6,$Xl1,$xC2 # 1st reduction phase
178 vsldoi $t1,$Xl,$Xl,8 # 2nd reduction phase
179 vsldoi $t5,$Xl1,$Xl1,8 # 2nd reduction phase
238 vpmsumd $t2,$Xl,$xC2 # 1st reduction phase
248 vsldoi $t1,$Xl,$Xl,8 # 2nd reduction phase
[all …]
H A Dghash-riscv64.pl139 # extensions. Using the no-Karatsuba approach and clmul for the final reduction.
144 # reduction to shift&xor. For a full discussion of this estimates see
165 # Load the reduction constant
183 # Reduction with clmul
222 # Load the reduction constant
240 # Reduction with clmul
290 # Load the reduction constant
319 # Reduction with clmul
361 # Load the reduction constant
390 # Reduction with clmul
H A Dghashv8-armx.pl28 # Implement 2x aggregated reduction [see ghash-x86.pl for background
33 # AArch64 register bank to "accommodate" 4x aggregated reduction and
334 vpmull.p64 $t2,$Xl,$xC2 @ 1st phase of reduction
340 vext.8 $t2,$Xl,$Xl,#8 @ 2nd phase of reduction
452 vpmull.p64 $t2,$Xl,$xC2 @ 1st phase of reduction
465 vext.8 $t2,$Xl,$Xl,#8 @ 2nd phase of reduction
495 vpmull.p64 $t2,$Xl,$xC2 @ 1st phase of reduction
501 vext.8 $t2,$Xl,$Xl,#8 @ 2nd phase of reduction
610 vpmull.p64 $t2,$Xl,$xC2 @ 1st phase of reduction
623 vext.8 $t2,$Xl,$Xl,#8 @ 2nd phase of reduction
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DSLPVectorizer.h115 /// Try to find horizontal reduction or otherwise, collect instructions
117 /// \a P if not null designates phi node the reduction is fed into
118 /// (with reduction operators \a Root or one of its operands, in a basic block
120 /// \returns true if a horizontal reduction was matched and reduced.
122 /// or a horizontal reduction was not matched or not possible.
127 /// Make an attempt to vectorize reduction and then try to vectorize
/freebsd/contrib/llvm-project/llvm/include/llvm/Frontend/OpenMP/
H A DOMPIRBuilder.h1377 /// Values representing pointers to LHS and RHS of the reduction, as well as
1383 /// Enum class for reduction evaluation types scalar, complex and aggregate.
1386 /// Information about an OpenMP reduction.
1401 /// Reduction element type, must match pointee type of variable.
1404 /// Reduction variable of pointer type.
1407 /// Thread-private partial reduction variable.
1410 /// Reduction evaluation kind - scalar, complex or aggregate.
1413 /// Callback for generating the reduction body. The IR produced by this will
1418 /// Clang callback for generating the reduction body. The IR produced by
1423 /// Callback for generating the atomic reduction body, may be null. The IR
[all …]
/freebsd/sys/contrib/device-tree/Bindings/sound/
H A Dst,sta32x.txt67 If present, power bridge correction for THD reduction near maximum
70 - st,am-reduction-mode:
71 If present, FFX mode runs in AM reduction mode, otherwise normal
97 // correction for THD reduction
H A Dst,sta350.txt71 If present, power bridge correction for THD reduction near maximum
74 - st,am-reduction-mode:
75 If present, FFX mode runs in AM reduction mode, otherwise normal
127 // correction for THD reduction
/freebsd/sys/contrib/dev/iwlwifi/fw/api/
H A Dpower.h274 * struct iwl_dev_tx_power_common - Common part of the TX power reduction cmd
288 * struct iwl_dev_tx_power_cmd_v3 - TX power reduction command version 3
298 * struct iwl_dev_tx_power_cmd_v4 - TX power reduction command version 4
301 * reduction.
311 * struct iwl_dev_tx_power_cmd_v5 - TX power reduction command version 5
314 * reduction.
332 * struct iwl_dev_tx_power_cmd_v8 - TX power reduction command version 8
335 * reduction.
369 * struct iwl_dev_tx_power_cmd_v3_v8 - TX power reduction command (multiversion)
389 * struct iwl_dev_tx_power_cmd_v9 - TX power reduction cmd
[all …]
/freebsd/usr.bin/units/
H A Dunits.1174 new units in terms of old ones so that a reduction leads to the
363 .It memory overflow in unit reduction
462 units: memory overflow in unit reduction
467 units: memory overflow in unit reduction
468 units: memory overflow in unit reduction
469 units: memory overflow in unit reduction
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86PartialReduction.cpp9 // This pass looks for add instructions used by a horizontal reduction to see
29 #define DEBUG_TYPE "x86-partial-reduction"
49 return "X86 Partial Reduction"; in getPassName()
65 "X86 Partial Reduction", false, false)
350 // a horizontal reduction. Return the input to the reduction if we find one.
366 // Ensure the reduction size is a power of 2. in matchAddReduction()
429 // reduction. Root is the Value that is used by the horizontal reduction.
518 // First find a reduction tree. in runOnFunction()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp390 /// Discover induction and reduction PHIs in the header of \p L. Induction
406 /// Set of reduction PHIs taking part of a reduction across the inner and
809 // Check V's users to see if it is involved in a reduction in L.
813 // Reduction variables cannot be constants. in findInnerReductionPhi()
823 // Detect floating point reduction only when it can be reordered. in findInnerReductionPhi()
866 // Bail out when we fail to collect reduction instructions chain. in findInnerReductionPhi()
872 "Expected the instruction to be the reduction operation"); in findInnerReductionPhi()
902 // PHIs in inner loops need to be part of a reduction in the outer loop, in findInductionAndReductions()
913 // Check if we have a PHI node in the outer loop that has a reduction in findInductionAndReductions()
922 << "Failed to recognize PHI as an induction or reduction.\n"); in findInductionAndReductions()
[all …]
/freebsd/sys/contrib/device-tree/Bindings/net/nfc/
H A Dti,trf7970a.yaml58 ti,rx-gain-reduction-db:
61 Specify an RX gain reduction to reduce antenna sensitivity with 5dB per
104 ti,rx-gain-reduction-db = <15>;
/freebsd/contrib/llvm-project/llvm/tools/bugpoint/
H A DListReducer.h83 while (MidTop > 1) { // Binary split reduction loop in reduceList()
86 errs() << "\n\n*** Reduction Interrupted, cleaning up...\n\n"; in reduceList()
154 // split reduction loop. in reduceList()
168 // If the binary split reduction loop made an unfortunate sequence of in reduceList()
179 errs() << "\n\n*** Reduction Interrupted, cleaning up...\n\n"; in reduceList()
/freebsd/sys/crypto/openssl/arm/
H A Dghashv8-armx.S87 INST(0x26,0x4e,0xe0,0xf2) @ pmull q10,q0,q11 @ 1st phase of reduction
93 vext.8 q10,q0,q0,#8 @ 2nd phase of reduction
180 INST(0x26,0x4e,0xe0,0xf2) @ pmull q10,q0,q11 @ 1st phase of reduction
193 vext.8 q10,q0,q0,#8 @ 2nd phase of reduction
220 INST(0x26,0x4e,0xe0,0xf2) @ pmull q10,q0,q11 @ 1st phase of reduction
226 vext.8 q10,q0,q0,#8 @ 2nd phase of reduction

12345678910>>...32