/freebsd/sbin/nvmecontrol/modules/samsung/ |
H A D | samsung.c | 74 uint8_t normalized; in print_samsung_extended_smart() local 96 * walker[3] = Normalized Value in print_samsung_extended_smart() 104 normalized = walker[3]; in print_samsung_extended_smart() 111 le16dec(walker), name, normalized, in print_samsung_extended_smart() 116 le16dec(walker), name, normalized, in print_samsung_extended_smart() 121 le16dec(walker), name, normalized, in print_samsung_extended_smart() 126 le16dec(walker), name, normalized, in print_samsung_extended_smart()
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolutionNormalization.cpp | 9 // This file implements utilities for working with "normalized" expressions. 87 // normalization by induction. We subtract the normalized step in visitAddRecExpr() 106 const SCEV *Normalized = in normalizeForPostIncUse() local 108 const SCEV *Denormalized = denormalizeForPostIncUse(Normalized, Loops, SE); in normalizeForPostIncUse() 109 // If the normalized expression isn't invertible. in normalizeForPostIncUse() 112 return Normalized; in normalizeForPostIncUse()
|
/freebsd/sbin/nvmecontrol/modules/intel/ |
H A D | intel.c | 129 uint8_t normalized; in print_intel_add_smart() 153 * walker[3] = Normalized Value in print_intel_add_smart() 161 normalized = walker[3]; in print_intel_add_smart() 167 printf("%-32s: %3d min: %u max: %u ave: %u\n", name, normalized, in print_intel_add_smart() 171 printf("%-32s: %3d %.3f%%\n", name, normalized, raw / 1024.0); in print_intel_add_smart() 174 printf("%-32s: %3d %d%% %d times\n", name, normalized, walker[5], le32dec(walker+6)); in print_intel_add_smart() 177 printf("%-32s: %3d %ju\n", name, normalized, (uintmax_t)raw); in print_intel_add_smart() 126 uint8_t normalized; print_intel_add_smart() local
|
/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/aggs/ |
H A D | tst.clearnormalize.d | 31 * Normalized aggregation data can be cleared 58 printf("Normalized data before clear:\n"); 72 printf("Final (normalized) aggregation data:\n");
|
H A D | tst.multinormalize.d.out | 1 normalized data #1: 9 normalized data #2:
|
H A D | tst.clearnormalize.d.out | 1 Normalized data before clear: 15 Final (normalized) aggregation data:
|
H A D | tst.stddev.normalize.d.out | 1 normalized data:
|
H A D | tst.fmtnormalize.d.out | 1 normalized data:
|
H A D | tst.normalize.d.out | 1 normalized data:
|
/freebsd/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGCUDARuntime.h | 66 unsigned Normalized : 1; // Normalized texture. 71 : Kind(K), Extern(E), Constant(C), Managed(M), Normalized(N), in DeviceVarFlags() 78 bool isNormalized() const { return Normalized; } in isNormalized()
|
/freebsd/contrib/llvm-project/clang/include/clang/Sema/ |
H A D | SemaConcept.h | 92 NormalForm makeCNF(const NormalizedConstraint &Normalized); 98 NormalForm makeDNF(const NormalizedConstraint &Normalized); 102 /// \brief A normalized constraint, as defined in C++ [temp.constr.normal], is 103 /// either an atomic constraint, a conjunction of normalized constraints or a 104 /// disjunction of normalized constraints.
|
/freebsd/lib/libc/gen/ |
H A D | fpclassify.3 | 63 is a normalized number. 86 or a non-zero normalized number, respectively.
|
/freebsd/contrib/googletest/googlemock/test/ |
H A D | gmock_output_test.py | 125 A tuple (the normalized test output, the list of test names that have 144 """Runs a command and returns its normalized output and a list of leaky tests. 166 # The normalized output should match the golden file.
|
/freebsd/contrib/llvm-project/lldb/source/Utility/ |
H A D | FileSpec.cpp | 96 /// Check if a path needs to be normalized. 98 /// Check if a path needs to be normalized. We currently consider a 112 /// Returns \b true if the path needs to be normalized. 116 // We strip off leading "." values so these paths need to be normalized in needsNormalization() 130 // normalized in needsNormalization() 391 // Since the path was normalized and all paths use '/' when stored in these in GetPath() 557 // Directory is stored in normalized form, which might be different than in format()
|
/freebsd/contrib/kyua/utils/fs/ |
H A D | path.cpp | 43 /// A normalized path cannot have empty components; i.e. there can be at most 48 /// \return The normalized string, representing a path. 224 /// Given that the paths are internally normalized, input paths such as 257 /// normalized because, in general, they may come from user input. These
|
/freebsd/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaConcept.cpp | 1405 auto Normalized = in getNormalizedAssociatedConstraints() local 1411 Normalized in getNormalizedAssociatedConstraints() 1413 std::move(*Normalized)) in getNormalizedAssociatedConstraints() 1686 NormalForm clang::makeCNF(const NormalizedConstraint &Normalized) { in makeCNF() argument 1687 if (Normalized.isAtomic()) in makeCNF() 1688 return {{Normalized.getAtomicConstraint()}}; in makeCNF() 1690 else if (Normalized.isFoldExpanded()) in makeCNF() 1691 return {{Normalized.getFoldExpandedConstraint()}}; in makeCNF() 1693 NormalForm LCNF = makeCNF(Normalized.getLHS()); in makeCNF() 1694 NormalForm RCNF = makeCNF(Normalized.getRHS()); in makeCNF() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionNormalization.h | 9 // This file defines utilities for working with "normalized" ScalarEvolution 12 // The following example illustrates post-increment uses and how normalized
|
/freebsd/sys/sys/ |
H A D | msgbuf.h | 58 /* Add/subtract normalized sequence numbers. Normalized values result. */
|
/freebsd/contrib/ldns/ldns/ |
H A D | tsig.h | 42 * The wire must be given too because tsig does not sign normalized packets. 55 * The wire must be given too because tsig does not sign normalized packets.
|
/freebsd/lib/msun/src/ |
H A D | math_private.h | 443 * x must be sufficiently normalized and sufficiently larger than c, 444 * and the result is then sufficiently normalized. 447 * can be normalized without extra work to swap 'a' with c). The details of 448 * the normalization are that b must be small relative to the normalized 'a'. 449 * Normalization of (a, c) makes the normalized c tiny relative to the 450 * normalized a, so b remains small relative to 'a' in the result. However, 463 * be sufficiently normalized and sufficiently increasing.
|
/freebsd/sys/contrib/device-tree/Bindings/arm/ |
H A D | cpu-capacity.txt | 39 DMIPS/MHz are obtained. Such values are then normalized w.r.t. the highest 47 representing CPU capacity expressed in normalized DMIPS/MHz. At boot time, the 55 mhz values (normalized w.r.t. the highest value found while parsing the DT).
|
/freebsd/sys/contrib/device-tree/Bindings/cpu/ |
H A D | cpu-capacity.txt | 39 DMIPS/MHz are obtained. Such values are then normalized w.r.t. the highest 47 representing CPU capacity expressed in normalized DMIPS/MHz. At boot time, the 55 mhz values (normalized w.r.t. the highest value found while parsing the DT).
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MLRegallocEvictAdvisor.cpp |
|
H A D | MLRegAllocEvictAdvisor.cpp | 152 // Note on naming: the "_by_max" are normalized using the largest value of that 167 "number of 'urgent' intervals, normalized. Urgent are those that are OK " \ 180 "bb freq - weighed nr of reads, normalized") \ 182 "bb feq - weighed nr of writes, normalized") \ 184 "bb freq - weighed nr of uses that are both read and writes, normalized") \ 186 "bb freq - weighed nr of uses that are indvars, normalized") \ 188 "bb freq - weighed nr of uses that are hints, normalized") \ 190 "the freq in the start block, normalized") \ 192 "freq of end block, normalized") \ 194 "hottest BB freq, normalized") \
|
/freebsd/sys/contrib/openzfs/module/zstd/lib/common/ |
H A D | fse.h | 115 3. save normalized counters to memory buffer using writeNCount() 116 4. build encoding table 'CTable' from normalized counters 120 1. read normalized counters with readNCount() 121 2. build decoding table 'DTable' from normalized counters 126 or to save and provide normalized distribution using external method. 146 …Provides the maximum possible size of an FSE normalized table, given 'maxSymbolValue' and 'tableLo… 256 The first step is to obtain the normalized frequencies of symbols. 532 …* Fractional get rounded up (i.e : a symbol with a normalized frequency of 3 gives the same result…
|