Home
last modified time | relevance | path

Searched full:largest (Results 1 – 25 of 884) sorted by relevance

12345678910>>...36

/freebsd/crypto/krb5/src/lib/krb5/os/
H A Dt_gifconf.c6 The "largest gap" values are the largest number of bytes I've seen
13 enough room; no overrun. Largest gap: 43. (NetBSD now has
20 Largest gap: 39.
29 The list is truncated if needed, with no indication. Largest gap: 31.
35 ifc_len is always less than the supplied one. Largest gap: 32.
41 many entries as will fit; no overrun. Largest gap: 143.
116 largest for that particular size of returned data. in main()
135 printf ("largest gap = %d\n", lastgap); in main()
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/largest_pool/
H A Dlargest_pool_001_pos.ksh37 # The largest pool can be created and a dataset in that
43 # create the largest pool allowed using the volume vdev.
44 # create and mount a dataset in the largest pool.
108 log_assert "The largest pool can be created and a dataset in that" \
140 log_note "Create the largest pool allowed using the volume vdev"
143 log_note "Create a zfs file system in the largest pool"
159 log_pass "Dataset can be created, mounted & destroy in largest pool succeeded."
/freebsd/tests/sys/cddl/zfs/tests/largest_pool/
H A Dlargest_pool_001_pos.ksh35 # The largest pool can be created and a dataset in that
41 # create the largest pool allowed using the volume vdev.
42 # create and mount a dataset in the largest pool.
110 log_assert "The largest pool can be created and a dataset in that" \
144 log_note "Create the largest pool allowed using the volume vdev"
147 log_note "Create a zfs file system in the largest pool"
163 log_pass "Dateset can be created, mounted & destroy in largest pool succeeded."
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DDebugInfoFlags.def69 // NOTE: always must be equal to largest flag, check this when adding new flag
70 HANDLE_DI_FLAG((1 << 29), Largest)
97 // NOTE: Always must be equal to largest flag, check this when adding new flags.
98 HANDLE_DISP_FLAG((1 << 11), Largest)
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DBitmaskEnum.h38 /// The parameter to LLVM_MARK_AS_BITMASK_ENUM should be the largest individual
57 /// The second parameter to LLVM_DECLARE_ENUM_AS_BITMASK specifies the largest
106 /// Trait class to determine bitmask enumeration largest bit.
119 /// Get a bitmask with 1s in all places up to the high-order bit of E's largest
132 assert(U <= Mask<E>() && "Enum value too large (or largest val too small?)");
/freebsd/contrib/arm-optimized-routines/math/aarch64/experimental/
H A Dasinhf_3u5.c23 |x| < 1.0: Use custom order-8 polynomial. The largest observed
28 definition of asinh(x) = ln(x + sqrt(x*x + 1)). The largest
35 ln(2). This largest observed error in this region is 3.39ulps.
H A Dasinh_2u5.c25 The largest observed error in this region is 1.47 ULPs:
31 The largest observed error in this region is 2.03 ULPs:
38 ln(2). The largest observed error in this region is 0.98 ULPs at many
H A Dacosf_1u4.c35 The largest observed error in this region is 1.16 ulps,
45 The largest observed error in this region is 1.32 ulps,
53 The largest observed error in this region is 1.28 ulps,
H A Derfinv_24u5.c46 Largest observed error is 24.46 ULP, in the extreme tail:
56 /* Largest observed error in this region is 6.06 ULP: in erfinv()
65 /* Largest observed error in this region is 6.95 ULP: in erfinv()
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/reservation/
H A Dreservation.shlib101 # This function compute the largest volume size which is multiple of volume
102 # block size (default 16K) and not greater than the largest expected volsize.
104 # $1 The largest expected volume size.
171 # This function takes a pool name as an argument, and returns the largest (give
/freebsd/crypto/openssl/crypto/
H A DREADME-sparse_array.md31 accommodate the largest index added to the data structure.
33 The largest index used to add a value to the array determines the tree height:
36 | Largest Added Index | Height of Tree |
150 largest element. The base of the logarithm is `SA_BLOCK_MAX`, so for moderately
H A Dsparse_array.c28 * creates enough blocks to support the largest used index. The depth is:
29 * ceil(log_2(largest index) / 2^{block size})
30 * E.g. with a block size of 4, and a largest index of 1000, the depth
/freebsd/share/man/man9/
H A Dhashinit.959 function allocates hash tables that are sized to largest power of two
64 function allocates hash tables that are sized to the largest prime
124 The largest prime hash value chosen by
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMLRegallocEvictAdvisor.cpp
H A DMLRegAllocEvictAdvisor.cpp152 // Note on naming: the "_by_max" are normalized using the largest value of that
200 "largest stage of an interval in this LR") \
317 llvm::SmallVectorImpl<float> &Largest, size_t Pos,
329 llvm::SmallVectorImpl<float> &Largest, size_t Pos,
602 llvm::SmallVectorImpl<float> &Largest, size_t Pos, in loadInterferenceFeatures() argument
661 extractFeatures(InterferingIntervals, Largest, Pos, IsHint, LocalIntfs, in loadInterferenceFeatures()
694 // Track the largest value of features seen during this eviction session. We in tryFindEvictionCandidate()
696 // dimension 'Largest' to all the features, especially since we have the in tryFindEvictionCandidate()
698 FeaturesListNormalizer Largest(FeatureIDs::FeatureCount, 0.0); in tryFindEvictionCandidate() local
716 Largest, Pos, LRPosInfo)) { in tryFindEvictionCandidate()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dsift_down.h55 // we are, __start is larger than its largest child in __sift_down()
60 // we are not in heap-order, swap the parent with its largest child in __sift_down()
104 // swap __hole with its largest child in __floyd_sift_down()
/freebsd/cddl/contrib/opensolaris/lib/libcmdutils/common/
H A Dnicenum.c33 /* The largest suffix that can fit, aka an exabyte (2^60 / 10^18) */
65 * is the largest prefix supported (i.e. don't bother computing in nicenum_scale()
66 * and checking S(n+1). Since INDEX_MAX should be the largest in nicenum_scale()
/freebsd/contrib/llvm-project/compiler-rt/lib/nsan/
H A Dnsan.cpp423 // We do all comparisons in the InternalFT domain, which is the largest FT in checkFT()
437 // We are re-computing `largest` here because this is a cold branch, and we in checkFT()
438 // want to avoid having to move the computation of `largest` before the in checkFT()
440 const InternalFT largest = max(ftAbs(check_value), ftAbs(check_shadow)); in checkFT() local
441 nsan_stats->AddCheck(CheckType, pc, bp, abs_err / largest); in checkFT()
449 const InternalFT largest = max(ftAbs(check_value), ftAbs(check_shadow)); in checkFT() local
450 if (abs_err * (1ull << flags().log2_max_relative_error) <= largest) in checkFT()
467 if (largest > Eps) { in checkFT()
469 static_cast<long double>(100.0 * abs_err / largest), in checkFT()
470 log2l(static_cast<long double>(abs_err / largest / Eps))); in checkFT()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Linker/
H A DLinkModules.cpp103 /// This can happen with COFF's largest selection kind.
158 // Comdat::SelectionKind::Largest is a behavior that comes from COFF. in computeResultingSelectionKind()
160 Dst == Comdat::SelectionKind::Largest; in computeResultingSelectionKind()
162 Src == Comdat::SelectionKind::Largest; in computeResultingSelectionKind()
164 if (Dst == Comdat::SelectionKind::Largest || in computeResultingSelectionKind()
165 Src == Comdat::SelectionKind::Largest) in computeResultingSelectionKind()
166 Result = Comdat::SelectionKind::Largest; in computeResultingSelectionKind()
185 case Comdat::SelectionKind::Largest: in computeResultingSelectionKind()
202 } else if (Result == Comdat::SelectionKind::Largest) { in computeResultingSelectionKind()
/freebsd/tests/sys/cddl/zfs/tests/reservation/
H A Dreservation.kshlib105 # This function compute the largest volume size which is multiple of volume
106 # block size (default 8K) and not greater than the largest expected volsize.
108 # $1 The largest expected volume size.
/freebsd/lib/msun/man/
H A Dfloor.335 .Nd largest integral value less than or equal to x
52 functions return the largest integral value
/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Dsc.h21 * group, which is delta larger than base, the largest size class in the
155 * the first size class needs to have lg_delta relative to the largest tiny size
245 /* The largest size class in the lookup table. */
252 /* The largest size class allocated out of a slab. */
264 /* The largest size class supported. */
/freebsd/sys/cddl/dev/dtrace/
H A Ddtrace_sysctl.c89 0, "largest allowed argument to memstr(), 0 indicates no limit");
92 &dtrace_dof_maxsize, 0, "largest allowed DOF table");
/freebsd/usr.bin/primes/
H A Dprimes.h45 #define BIG ULONG_MAX /* largest value will sieve */
57 extern const ubig *const pr_limit; /* largest prime in the prime array */
/freebsd/share/man/man7/
H A Dstdint.738 access speed with a minimum size, largest integer size, and
103 These types are generally the largest signed and unsigned

12345678910>>...36