Home
last modified time | relevance | path

Searched full:unrolled (Results 1 – 25 of 135) sorted by relevance

123456

/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DLoopUnrolling.h10 /// which loops should be completely unrolled and mark their corresponding
12 /// way specific loops can be marked as completely unrolled. For considering a
13 /// loop to be completely unrolled it has to fulfill the following requirements:
32 /// Returns if the given State indicates that is inside a completely unrolled
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopUnroll.cpp85 STATISTIC(NumCompletelyUnrolled, "Number of loops completely unrolled");
86 STATISTIC(NumUnrolled, "Number of loops unrolled (completely or otherwise)");
87 STATISTIC(NumUnrolledNotLatch, "Number of loops unrolled without a conditional "
92 cl::desc("Allow runtime unrolled loops to be unrolled "
118 /// \param Blocks is a vector of basic blocks representing unrolled loop.
155 assert(OldLoop && "Should (at least) be in the loop being unrolled!"); in addClonedBlockToLoopInfo()
351 // Simplify any new induction variables in the partially unrolled loop. in simplifyLoopAfterUnroll()
392 // unrolled loops, and handling this early allows following code to in simplifyLoopAfterUnroll()
458 /// required and not fully unrolled).
506 // Effectively "DCE" unrolled iterations that are beyond the max tripcount in UnrollLoop()
[all …]
H A DLoopUnrollAndJam.cpp199 So the outer loop is essetially unrolled and then the inner loops are fused
213 necessary to create one and not fully unrolled).
453 // Now that all the basic blocks for the unrolled iterations are in place, in UnrollAndJamLoop()
455 // is the last unrolled iterations values. in UnrollAndJamLoop()
684 // @param UnrollLevel The level of the loop being unrolled
707 // dependence (or EQ, if we fully unrolled the loop) at the loop's position: in checkDependency()
733 // If the distance carried by the unrolled loop is 0, then after unrolling in checkDependency()
830 // Only loops with a single exit block can be unrolled and jammed. in isEligibleLoopForm()
836 "blocks can be unrolled and jammed.\n"); in isEligibleLoopForm()
840 // Only loops with a single exiting block can be unrolled and jammed. in isEligibleLoopForm()
[all …]
H A DLoopUnrollRuntime.cpp18 // unrolled loop to execute the 'left over' iterations before or after the
19 // unrolled loop.
50 "Number of loops unrolled with run-time trip counts");
60 // we do not enter the unrolled loop at all.
64 // Probability that the loop trip count is so small that we skip the unrolled
182 // Add the branch to the exit block (around the unrolled loop) in ConnectProlog()
376 // Copy information from original loop to unrolled loop. in CloneLoopBlocks()
444 // unrolled. in CloneLoopBlocks()
473 // The main pain point with multi-exit loop unrolling is that once unrolled, in canProfitablyUnrollMultiExitLoop()
475 // There are branches within the unrolled loop that go to the OtherExits. in canProfitablyUnrollMultiExitLoop()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DUnrollLoop.h60 /// The loop was partially unrolled -- we still have a loop, but with a
65 /// The loop was fully unrolled into straight-line code. We no longer have
123 /// Produce an estimate of the unrolled cost of the specified loop. This
145 /// Returns loop size estimation for unrolled loop, given the unrolling
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopUnrollPass.cpp127 cl::desc("Allows loops to be partially unrolled until "
146 cl::desc("Unrolled size limit for loops with an unroll(full) or "
153 "aggressively unrolled."));
157 cl::desc("Allow the loop remainder to be unrolled."));
170 cl::desc("Threshold (max size of unrolled loop) to use in aggressive (O3) "
175 cl::desc("Default threshold (max size of unrolled "
346 /// estimates this optimization. It computes cost of unrolled loop
381 // The estimated cost of the unrolled form of the loop. We try to estimate in analyzeLoopUnrollCost()
393 // this to recursively merge costs into the unrolled cost on-demand so that in analyzeLoopUnrollCost()
587 // If unrolled body turns out to be too big, bail out. in analyzeLoopUnrollCost()
[all …]
H A DLoopUnrollAndJamPass.cpp85 cl::desc("Unrolled size limit for loops with an unroll_and_jam(full) or "
141 // Returns loop size estimation for unrolled loop.
173 // If the user explicitly set the loop as unrolled, dont UnJ it. Leave it in computeUnrollAndJamCount()
416 // If loop has an unroll count pragma or unrolled by explicitly set count in tryToUnrollAndJamLoop()
417 // mark loop as unrolled to prevent unrolling beyond that requested. in tryToUnrollAndJamLoop()
/freebsd/lib/libc/i386/string/
H A Dstrncmp.S47 * I've unrolled the loop eight times: large enough to make a
75 * unrolled part of the loop. The unrolled part would then be
H A Dstrcpy.S41 * I've unrolled the loop eight times: large enough to make a
H A Dstrcat.S42 * I've unrolled the loop eight times: large enough to make a
/freebsd/lib/libc/rpc/
H A Dauthdes_prot.c52 * Unrolled xdr in xdr_authdes_cred()
78 * Unrolled xdr in xdr_authdes_verf()
/freebsd/lib/libc/amd64/string/
H A Dstrncmp.S42 * This is just the scalar loop unrolled a bunch of times.
292 /* main loop unrolled twice */
320 /* main loop unrolled twice */
410 /* main loop unrolled twice */
439 /* main loop unrolled twice */
H A Dstrchrnul.S84 /* main loop unrolled twice */
143 /* main loop unrolled twice */
H A Dstpcpy.S156 /* main loop, unrolled twice */
176 add $16, %rsi # advance rsi to second unrolled half
H A Dstrrchr.S85 /* main loop unrolled twice */
170 /* main loop unrolled twice */
H A Dstrcmp.S193 /* main loop unrolled twice */
304 /* main loop unrolled twice */
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DLoopUnrolling.cpp10 /// unrolled. Moreover, these functions manages the stack of loop which is
31 enum Kind { Normal, Unrolled } K; enumerator
45 return LoopState(Unrolled, S, L, N); in getUnrolled()
47 bool isUnrolled() const { return K == Unrolled; } in isUnrolled()
/freebsd/crypto/openssh/
H A Dpoly1305.h5 * poly1305-donna-unrolled.c from https://github.com/floodyberry/poly1305-donna
/freebsd/sys/contrib/device-tree/Bindings/pci/
H A Dsnps,dw-pcie-ep.yaml34 if the space is unrolled (IP-core version >= 4.80a).
69 unrolled memory space with the internal Address Translation
H A Dsnps,dw-pcie.yaml43 also required if the space is unrolled (IP-core version >= 4.80a).
78 unrolled memory space with the internal Address Translation
/freebsd/sys/contrib/zlib/
H A Dzutil.c148 *dest++ = *source++; /* ??? to be unrolled */ in zmemcpy()
164 *dest++ = 0; /* ??? to be unrolled */ in zmemzero()
/freebsd/crypto/openssh/openbsd-compat/
H A Dsha2.c51 * UNROLLED TRANSFORM LOOP NOTE:
52 * You can define SHA2_UNROLL_TRANSFORM to use the unrolled transform
365 /* Unrolled SHA-256 round macros: */
407 /* Rounds 0 to 15 (unrolled): */ in SHA256Transform()
645 /* Unrolled SHA-512 round macros: */
688 /* Rounds 0 to 15 (unrolled): */ in SHA512Transform()
/freebsd/lib/libc/aarch64/string/
H A Dstrncmp.S253 /* main loop unrolled twice */
304 /* main loop unrolled twice */
443 /* main loop unrolled twice */
/freebsd/crypto/openssl/crypto/bn/asm/
H A Dbn-c64xplus.asm17 ;; unrolled SPLOOP-free loops - at ~8*n and ~5*n. Below assembler
220 ;; fully unrolled real Comba implementations are asymptotically 2x
307 ;; This alternative is an exercise in fully unrolled Comba
/freebsd/contrib/ldns/
H A Dsha2.c55 * UNROLLED TRANSFORM LOOP NOTE:
56 * You can define SHA2_UNROLL_TRANSFORM to use the unrolled transform
326 /* Unrolled SHA-256 round macros: */
381 /* Rounds 0 to 15 (unrolled): */ in ldns_sha256_Transform()
645 /* Unrolled SHA-512 round macros: */

123456