Home
last modified time | relevance | path

Searched full:guarantees (Results 1 – 25 of 560) sorted by relevance

12345678910>>...23

/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopSimplify.h13 // Loop pre-header insertion guarantees that there is a single, non-critical
17 // Loop exit-block insertion guarantees that all exit blocks from the loop
23 // This pass also guarantees that loops will have exactly one backedge.
27 // to transform the loop and make these guarantees. Client code should check
/freebsd/contrib/mandoc/
H A Dtbl.3104 guarantees that these pointers are not
129 guarantees that the
187 guarantees that the
214 guarantees that the
/freebsd/sys/sys/
H A Dsmr_types.h102 /* Release barrier guarantees contents are visible to reader */ \
110 * such as in the destructor callback or when the caller guarantees other
120 * such as in the destructor callback or when the caller guarantees other
/freebsd/sys/net/
H A Dmp_ring.c154 * The acquire style atomic above guarantees visibility of items in drain_ring_locked()
237 * The acquire style atomic above guarantees visibility of items in drain_ring_lockless()
366 * Update the ring's pidx_tail. The release style atomic guarantees in ifmp_ring_enqueue()
445 * Update the ring's pidx_tail. The release style atomic guarantees in ifmp_ring_enqueue()
500 * The acquire style atomic guarantees visibility of items associated in ifmp_ring_check_drainage()
/freebsd/sys/libkern/
H A Dmurmur3_32.c38 * faster if the caller guarantees that the input is correctly aligned for
39 * 32-bit reads, and slightly faster yet if the caller guarantees that the
H A Darc4random_uniform.c28 * guarantees the selected random number will be inside
/freebsd/contrib/llvm-project/libcxx/include/__utility/
H A Dexception_guard.h38 // that we don't provide the strong exception guarantees. However, Clang doesn't generate cleanup
39 // code with exceptions disabled, so even if we wanted to provide the strong exception guarantees
/freebsd/secure/lib/libpkgecc/
H A Dpkg_libecc_rand.c17 * We don't have any guarantees that this won't open a device on other in get_random()
/freebsd/contrib/processor-trace/libipt/internal/include/
H A Dpt_image_section_cache.h176 * The caller guarantees that @iscache contains @section (by using @section's
193 * The caller guarantees that @iscache contains @section (by using @section's
/freebsd/contrib/llvm-project/lldb/source/Plugins/Trace/intel-pt/
H A DTraceIntelPTProperties.td12 "4T, 8T and so on, which guarantees a total linear time spent checking "
/freebsd/share/man/man9/
H A Dsmr.9120 Then, the writer waits until some mechanism guarantees that no existing readers
257 functions should not be assumed to have any guarantees with respect to memory
H A Dvm_map_simplify_entry.951 This function guarantees that the passed entry remains valid, although
/freebsd/share/man/man4/
H A Dsym.4110 As a result, it guarantees that no more than 1 interrupt
119 As a result, the driver guarantees that no PCI self-mastering will occur
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dset_intersection.h70 // guarantees is _not_ straightforward: the guarantee is "at most 2*(N+M)-1 comparisons", and one-s…
78 …osition 5 if the set has 7 or 8 elements, but we'll never exceed the complexity guarantees from the
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DBranchProbability.h77 /// Scales \c Num. Guarantees full precision. Returns the floor of the
85 /// Scales \c Num by the inverse of \c this. Guarantees full precision.
H A DBinaryByteStream.h27 /// in a single contiguous buffer. BinaryByteStream guarantees that no read
86 /// version also guarantees that no read operation will ever incur a copy,
/freebsd/contrib/libfido2/fuzz/
H A Duniform_random.c29 * guarantees the selected random number will be inside
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp13 // Loop pre-header insertion guarantees that there is a single, non-critical
17 // Loop exit-block insertion guarantees that all exit blocks from the loop
23 // This pass also guarantees that loops will have exactly one backedge.
27 // to transform the loop and make these guarantees. Client code should check
548 // predecessors that are inside of the loop. This check guarantees that the in simplifyOneLoop()
773 /// verifyAnalysis() - Verify LoopSimplifyForm's guarantees.
/freebsd/contrib/unbound/compat/
H A Darc4random_uniform.c29 * guarantees the selected random number will be inside
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DASTContextAllocate.h33 // throw() spec guarantees it will not be implicitly called.
/freebsd/crypto/openssh/openbsd-compat/
H A Darc4random_uniform.c35 * guarantees the selected random number will be inside
/freebsd/sys/dev/enic/
H A Dcq_desc.h68 * are read from desc. Hardware guarantees color bit is last in cq_desc_dec()
/freebsd/crypto/libecc/src/sig/
H A Decgdsa.c165 * part too. This guarantees the context is an EC-GDSA in _ecgdsa_sign_update()
204 * part too. This guarantees the context is an EC-GDSA in _ecgdsa_sign_finalize()
483 * part too. This guarantees the context is an EC-GDSA in _ecgdsa_verify_update()
521 * part too. This guarantees the context is an EC-GDSA in _ecgdsa_verify_finalize()
/freebsd/contrib/ofed/include/
H A Dudma_barrier.h120 This guarantees that all reads that follow the barrier see the ordered
258 The spinlock guarantees that the WC writes issued within the critical
/freebsd/sys/kern/
H A Dsubr_disk.c136 * on the underlying TAILQ, but with additional guarantees on
141 * Updating bioq->last_offset on a bioq_insert_head() guarantees

12345678910>>...23