Home
last modified time | relevance | path

Searched full:iteration (Results 1 – 25 of 1276) sorted by relevance

12345678910>>...52

/freebsd/contrib/mandoc/
H A Ddbm.c70 static enum iter iteration; variable
210 * Return the number of the next manual page in the current iteration.
217 switch(iteration) { in dbm_page_next()
225 return page_bytitle(iteration, NULL); in dbm_page_next()
230 * Functions implementing the iteration over manual pages.
243 /* Initialize for a new iteration. */ in page_bytitle()
246 iteration = arg_iter; in page_bytitle()
248 switch (iteration) { in page_bytitle()
262 iteration = ITER_NONE; in page_bytitle()
274 if (iteration == ITER_NAME) in page_bytitle()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DCombiner.cpp31 STATISTIC(NumOneIteration, "Number of functions with one iteration");
144 unsigned Iteration = 0; in combineMachineInstrs() local
146 ++Iteration; in combineMachineInstrs()
147 LLVM_DEBUG(dbgs() << "\n\nCombiner iteration #" << Iteration << '\n'); in combineMachineInstrs()
181 LLVM_DEBUG(dbgs() << "\nCombiner reached fixed-point after iteration #" in combineMachineInstrs()
182 << Iteration << '\n'); in combineMachineInstrs()
187 if (CInfo.MaxIterations && Iteration >= CInfo.MaxIterations) { in combineMachineInstrs()
189 dbgs() << "\nCombiner reached iteration limit after iteration #" in combineMachineInstrs()
190 << Iteration << '\n'); in combineMachineInstrs()
195 if (Iteration == 1) in combineMachineInstrs()
[all …]
/freebsd/usr.bin/hexdump/
H A Dhexdump.1160 A format unit contains up to three items: an iteration count, a byte
163 The iteration count is an optional positive integer, which defaults to
165 Each format is applied iteration count times.
169 each iteration of the format.
171 If an iteration count and/or a byte count is specified, a single slash
172 must be placed after the iteration count and/or before the byte count
275 data required by each format unit, which is the iteration count times the
276 byte count, or the iteration count times the number of bytes required by
283 not have a specified iteration count, have the iteration count
290 the iteration count as described above, an iteration count is
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopPeel.cpp138 // of the loop (ie, they are known on the 4th iteration, so peel 3 iterations).
139 // The first iteration has g(0), g(0); the second has g(0), g(5); the
142 // %a is a phi with constants so it is determined after iteration 1.
144 // the iteration after %a is determined, so iteration 2.
146 // the iteration after %y, so iteration 3.
203 // %x = phi(0, %a) <-- becomes invariant starting from 3rd iteration.
295 // dereferenceable in the loop if the first iteration is peeled off. Also in peelToTurnInvariantLoadsDerefencebale()
391 // independently of the loop iteration. in countToEliminateCompares()
435 // iteration. See if that makes !Pred become unknown again. in countToEliminateCompares()
443 return; // Need to peel one more iteration, but can't. Give up. in countToEliminateCompares()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSequence.h37 /// To enable iteration with enum types, you need to either mark enums as safe
39 /// potentially unsafe iteration at every callsite by passing
94 // By default, enum types are *not* considered safe for iteration.
95 // To allow iteration for your enum type, provide a specialization with
301 /// forward iteration (resp. [INTMAX_MIN + 1, INTMAX_MAX] for reverse
302 /// iteration).
311 /// forward iteration (resp. [INTMAX_MIN + 1, INTMAX_MAX - 1] for reverse
312 /// iteration).
321 /// for forward iteration (resp. [INTMAX_MIN + 1, INTMAX_MAX - 1] for reverse
322 /// iteration)
[all...]
/freebsd/contrib/bmake/unit-tests/
H A Ddirective-for.mk27 # The .for loop also works for multiple iteration variables.
51 # In the body of the .for loop, the iteration variables can be accessed
59 # iteration variables and the normal global variables live in separate
88 # Before for.c 1.39 from 2008-12-21, the values of the iteration variables
186 # If the variable name could be chosen dynamically, the iteration variable
194 # is used both as a global variable, as well as an iteration variable in the
199 .for DIRECT in iteration
200 . if "${DIRECT} ${INDIRECT}" != "iteration global"
219 .for in value # expect+0: no iteration variables in for
223 # An empty list of iteration values to the right of the 'in' is accepted.
[all …]
H A Dvarname-dot-suffixes.mk77 # replacement mechanism for the iteration variables takes precedence.
92 # '.SUFFIXES' for the iteration variable is unusual. In ODE Make, the
93 # convention for these iteration variables is to have dots at both ends, so
94 # the name would be '.SUFFIXES.', furthermore the name of the iteration
/freebsd/contrib/libucl/doc/
H A Dapi.md11 - [Iteration functions](#iteration-functions)
36 - [Iteration functions](#iteration-functions-1)
65 ### Iteration functions
378 # Iteration functions
380 Iteration are used to iterate over UCL compound types: arrays and objects. Moreover, iterations cou…
390 …iteration process as well. `expand_values` flag speicifies whether `ucl_iterate_object` should exp…
411 such an object. Safe iterators are desinged to define two sorts of iteration:
413 1. Iteration over complex objects with expanding all values
414 2. Iteration over complex objects without expanding of values
416 The following example demonstrates the difference between these two types of iteration:
[all …]
H A Dlibucl.352 .SS Iteration functions
525 .SH ITERATION FUNCTIONS
527 Iteration are used to iterate over UCL compound types: arrays and
552 The object \f[C]obj\f[] should not be changed during the iteration
561 Mixing of iteration types is not permitted since the iterator is set
562 according to the iteration type and cannot be reused.
563 Here is an example of iteration over the objects using libucl API
589 Safe iterators are desinged to define two sorts of iteration:
591 Iteration over complex objects with expanding all values
593 Iteration over complex objects without expanding of values
[all …]
/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Dspin.h7 unsigned iteration; member
24 if (spin->iteration < 5) { in spin_adaptive()
25 for (i = 0; i < (1U << spin->iteration); i++) { in spin_adaptive()
28 spin->iteration++; in spin_adaptive()
/freebsd/crypto/openssl/doc/man3/
H A DPKCS5_PBKDF2_HMAC.pod5 …DF2_HMAC, PKCS5_PBKDF2_HMAC_SHA1 - password based derivation routines with salt and iteration count
22 PKCS5_PBKDF2_HMAC() derives a key from a password using a salt and iteration count
34 B<iter> is the iteration count and its value should be greater than or
35 equal to 1. RFC 2898 suggests an iteration count of at least 1000. Any
49 and an iteration count.
H A DPKCS12_create.pod31 iteration count to use and I<mac_iter> is the MAC iteration count to use.
44 derivation iteration count of B<PKCS12_DEFAULT_ITER> (currently 2048), and
48 The default MAC iteration count is 1 in order to retain compatibility with
49 old software which did not interpret MAC iteration counts. If such compatibility
105 derivation iteration count were changed in OpenSSL 3.0 to more modern
H A DPKCS12_key_gen_utf8_ex.pod39 I<saltlen>, an iteration count I<iter> and a digest algorithm I<md_type>.
88 I<iter> is the iteration count and its value should be greater than or
89 equal to 1. RFC 2898 suggests an iteration count of at least 1000. Any
90 I<iter> less than 1 is treated as a single iteration.
104 and an iteration count.
/freebsd/secure/lib/libcrypto/man/man3/
H A DPKCS5_PBKDF2_HMAC.3140 …F2_HMAC, PKCS5_PBKDF2_HMAC_SHA1 \- password based derivation routines with salt and iteration count
157 \&\s-1\fBPKCS5_PBKDF2_HMAC\s0()\fR derives a key from a password using a salt and iteration count
169 \&\fBiter\fR is the iteration count and its value should be greater than or
170 equal to 1. \s-1RFC 2898\s0 suggests an iteration count of at least 1000. Any
171 \&\fBiter\fR less than 1 is treated as a single iteration.
182 and an iteration count.
H A DPKCS12_create.3166 iteration count to use and \fImac_iter\fR is the \s-1MAC\s0 iteration count to use.
178 derivation iteration count of \fB\s-1PKCS12_DEFAULT_ITER\s0\fR (currently 2048), and
182 The default \s-1MAC\s0 iteration count is 1 in order to retain compatibility with
183 old software which did not interpret \s-1MAC\s0 iteration counts. If such compatibility
229 derivation iteration count were changed in OpenSSL 3.0 to more modern
/freebsd/contrib/googletest/googletest/test/
H A Dgoogletest-global-environment-unittest.py79 # environment should be set up and torn down for each iteration.
87 r'Repeating all tests \(iteration 1\)'
95 r'Repeating all tests \(iteration 2\)'
119 r'Repeating all tests \(iteration 1\)'
125 r'Repeating all tests \(iteration 2\)'
H A Dgoogletest-shuffle-test.py94 test iteration.
301 # iteration, and this test depends on the current implementation
312 # order as in iteration 1 above.
319 # order as in iteration 2 above. Success means that Google Test
321 # beginning of iteration 2.
328 # order as in iteration 3 above. Success means that Google Test
330 # beginning of iteration 3.
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopUnrollPass.cpp106 "unroll-max-iteration-count-to-analyze", cl::init(10), cl::Hidden,
286 /// each iteration.
293 int Iteration : 30; member
312 return PairInfo::getHashValue({S.I, S.Iteration}); in getHashValue()
317 return PairInfo::isEqual({LHS.I, LHS.Iteration}, {RHS.I, RHS.Iteration}); in isEqual()
350 /// given iteration its condition would be resolved to true, we won't add up the
392 // We track the simplification of each instruction in each iteration. We use in analyzeLoopUnrollCost()
406 auto AddCostRecursively = [&](Instruction &RootI, int Iteration) { in analyzeLoopUnrollCost() argument
407 assert(Iteration >= 0 && "Cannot have a negative iteration!"); in analyzeLoopUnrollCost()
415 for (;; --Iteration) { in analyzeLoopUnrollCost()
[all …]
H A DLoopInstSimplify.cpp59 // Track the PHI nodes that have already been visited during each iteration so in simplifyLoopInst()
70 // iteration over the loop and minimizes the possible causes for continuing to in simplifyLoopInst()
91 // We special case the first iteration which we can detect due to the in simplifyLoopInst()
148 // iteration over all instructions in all the loop blocks. in simplifyLoopInst()
158 // iteration, we're done. in simplifyLoopInst()
162 // Otherwise, put the next set in place for the next iteration and reset it in simplifyLoopInst()
163 // and the visited PHIs for that iteration. in simplifyLoopInst()
/freebsd/contrib/netbsd-tests/lib/libm/
H A Dt_bit.c67 atf_tc_fail("%s:%d iteration %d signbitf is wrong" in ATF_TC_BODY()
71 atf_tc_fail("%s:%d iteration %d signbit is wrong" in ATF_TC_BODY()
78 atf_tc_fail("%s:%d iteration %d signbitl is wrong" in ATF_TC_BODY()
87 atf_tc_fail("%s:%d iteration %d signbitl is" in ATF_TC_BODY()
/freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DResourcePressureView.h29 /// Resource pressure per iteration:
47 /// pipeline JFPU1. The overall pressure per iteration is reported by two
48 /// tables: the first smaller table is the resource pressure per iteration;
52 /// per iteration. Consequently, the resource pressure on JFPU0 is of 2cy per
53 /// iteration.
/freebsd/sys/teken/stress/
H A Dteken_stress.c102 unsigned int i, iteration = 0; in main() local
118 iteration++; in main()
119 if ((iteration % 10000) == 0) in main()
120 printf("Processed %u frames\n", iteration); in main()
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DPointerIterationChecker.cpp10 // caused due to iteration of unordered containers of pointer elements.
49 OS << "Iteration of pointer-like elements " in emitDiagnostics()
53 "Iteration of pointer-like elements", "Non-determinism", in emitDiagnostics()
57 // Assumption: Iteration of ordered containers of pointers is deterministic.
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopUnrollAnalyzer.h51 UnrolledInstAnalyzer(unsigned Iteration, in UnrolledInstAnalyzer() argument
55 IterationNumber = SE.getConstant(APInt(64, Iteration)); in UnrolledInstAnalyzer()
71 /// iteration.
75 /// of simplified values specific to this iteration. The idea is to propagate
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineLoopUtils.h18 LPD_Front, ///< Peel the first iteration of the loop.
19 LPD_Back ///< Peel the last iteration of the loop.
31 /// clone so as to execute a single iteration.

12345678910>>...52