/freebsd/sys/contrib/ck/src/ |
H A D | ck_hp.c | 69 unsigned int degree, in CK_STACK_CONTAINER() 75 state->degree = degree; in CK_STACK_CONTAINER() 145 memset(pointers, 0, state->degree * sizeof(void *)); in ck_hp_register() 165 ck_hp_member_scan(ck_stack_entry_t *entry, unsigned int degree, void *pointer) in ck_hp_member_scan() argument 179 for (i = 0; i < degree; i++) { in ck_hp_member_scan() 206 for (i = 0; i < global->degree; i++) { in ck_hp_member_cache() 249 ck_hp_member_scan(marker, global->degree, hazard->pointer)) { in ck_hp_reclaim()
|
/freebsd/sys/contrib/device-tree/Bindings/power/supply/ |
H A D | battery.yaml | 91 - description: the temperature in degree Celsius 94 A table providing the temperature in degree Celsius 101 An array containing the temperature in degree Celsius, 163 /* table for -10 degree Celsius */ 165 /* table for 0 degree Celsius */ 167 /* table for 10 degree Celsius */
|
H A D | max17042_battery.txt | 19 as cold (in tenths of degree Celsius). 21 as over heated (in tenths of degree Celsius).
|
H A D | charger-manager.yaml | 92 description: critical cold temperature of battery for charging in deci-degree celsius 100 description: critical hot temperature of battery for charging in deci-degree celsius 104 description: temperature difference to allow recharging in deci-degree celsius
|
H A D | maxim,max17042.yaml | 41 Temperature threshold to report battery as cold (in tenths of degree Celsius). 47 Temperature threshold to report battery as over heated (in tenths of degree Celsius).
|
/freebsd/sys/contrib/device-tree/Bindings/spi/ |
H A D | samsung,spi-peripheral-props.yaml | 26 - 1: 90 degree phase shift sampling. 27 - 2: 180 degree phase shift sampling. 28 - 3: 270 degree phase shift sampling.
|
H A D | spi-samsung.txt | 66 - 1: 90 degree phase shift sampling. 67 - 2: 180 degree phase shift sampling. 68 - 3: 270 degree phase shift sampling.
|
/freebsd/sys/contrib/openzfs/module/icp/algs/blake3/ |
H A D | blake3.c | 306 * is the dyanmically detected SIMD degree, at most MAX_SIMD_DEGREE. Or fewer, 311 * As a special case when the SIMD degree is 1, this function will still return 327 * Note that the single chunk case does *not* bump the SIMD degree up in blake3_compress_subtree_wide() 332 if (input_len <= (size_t)(ops->degree * BLAKE3_CHUNK_LEN)) { in blake3_compress_subtree_wide() 341 * only optimal as long as the SIMD degree is a power of 2. If we ever in blake3_compress_subtree_wide() 342 * get a SIMD degree of 3 or something, we'll need a more complicated in blake3_compress_subtree_wide() 354 * SIMD degree is 1. in blake3_compress_subtree_wide() 357 size_t degree = ops->degree; in blake3_compress_subtree_wide() local 358 if (left_input_len > BLAKE3_CHUNK_LEN && degree == 1) { in blake3_compress_subtree_wide() 361 * The special case: We always use a degree of at least two, in blake3_compress_subtree_wide() [all …]
|
H A D | blake3_impl.c | 97 .degree = 4, 161 .degree = 4, 194 .degree = 8, 252 .degree = 16,
|
/freebsd/lib/msun/src/ |
H A D | k_tanf.c | 45 * We add the small terms from lowest degree up for efficiency on in __kernel_tandf() 46 * non-sequential machines (the lowest degree terms tend to be ready in __kernel_tandf() 51 * small terms were added from highest degree down. in __kernel_tandf()
|
H A D | s_erf.c | 30 * where R = P/Q where P is an odd poly of degree 8 and 31 * Q is an odd poly of degree 10. 58 * P1(s) = degree 6 poly in s 59 * Q1(s) = degree 6 poly in s 65 * R1(z) = degree 7 poly in z, (z=1/x^2) 66 * S1(z) = degree 8 poly in z 75 * R2(z) = degree 6 poly in z, (z=1/x^2) 76 * S2(z) = degree 7 poly in z
|
/freebsd/contrib/llvm-project/llvm/lib/Support/BLAKE3/ |
H A D | blake3.c | 254 // is the dyanmically detected SIMD degree, at most MAX_SIMD_DEGREE. Or fewer, 259 // As a special case when the SIMD degree is 1, this function will still return 274 // Note that the single chunk case does *not* bump the SIMD degree up to 2 in blake3_compress_subtree_wide() 285 // as long as the SIMD degree is a power of 2. If we ever get a SIMD degree in blake3_compress_subtree_wide() 294 // account for the special case of returning 2 outputs when the SIMD degree in blake3_compress_subtree_wide() 297 size_t degree = blake3_simd_degree(); in blake3_compress_subtree_wide() local 298 if (left_input_len > BLAKE3_CHUNK_LEN && degree == 1) { in blake3_compress_subtree_wide() 299 // The special case: We always use a degree of at least two, to make in blake3_compress_subtree_wide() 301 // level, where we allow degree=1. (Note that the 1-chunk-input case is in blake3_compress_subtree_wide() 303 degree = 2; in blake3_compress_subtree_wide() [all …]
|
H A D | blake3_avx2.c | 5 #define DEGREE 8 macro 158 INLINE void transpose_vecs(__m256i vecs[DEGREE]) { in transpose_vecs() argument 308 while (num_inputs >= DEGREE) { in blake3_hash_many_avx2() 312 counter += DEGREE; in blake3_hash_many_avx2() 314 inputs += DEGREE; in blake3_hash_many_avx2() 315 num_inputs -= DEGREE; in blake3_hash_many_avx2() 316 out = &out[DEGREE * BLAKE3_OUT_LEN]; in blake3_hash_many_avx2()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
H A D | ReductionRules.h | 25 /// Reduce a node of degree one. 27 /// Propagate costs from the given node, which must be of degree one, to its 38 "R1 applied to node with degree != 1."); in applyR1() 82 "R2 applied to node with degree != 2."); in applyR2()
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DependenceGraphBuilder.cpp | 384 // an out-degree of one (in terms of def-use edges), and then ignoring those in simplify() 385 // whose targets have an in-degree more than one. Each node in the resulting in simplify() 390 // A mapping between nodes and their in-degree. To save space, this map in simplify() 402 // Insert an element into the in-degree map and initialize to zero. The in simplify() 425 dbgs() << "Size of target in-degree map:" << TargetInDegreeMap.size() in simplify() 426 << "\nContent of in-degree map:\n"; in simplify() 445 "Expected target to be in the in-degree map."); in simplify()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGFast.cpp | 708 unsigned Degree = OpN->getNodeId(); in ScheduleNode() local 709 assert(Degree > 0 && "Predecessor over-released!"); in ScheduleNode() 710 OpN->setNodeId(--Degree); in ScheduleNode() 711 if (Degree == 0) in ScheduleNode() 733 // Use node id to record degree. in Schedule() 734 unsigned Degree = N->use_size(); in Schedule() local 735 N->setNodeId(Degree); in Schedule() 753 unsigned Degree = Glue->getNodeId(); in Schedule() local 761 --Degree; in Schedule() 762 GUser->setNodeId(UDegree + Degree); in Schedule()
|
/freebsd/contrib/arm-optimized-routines/math/tools/ |
H A D | exp2.sollya | 7 deg = 3; // poly degree 13 //deg = 5; // poly degree
|
H A D | exp10.sollya | 7 deg = 5; // poly degree 14 //deg = 4; // poly degree - bump to 5 for ~1 ULP
|
H A D | tanf.sollya | 9 deg = 5; // poly degree 13 // deg = 3; // poly degree
|
/freebsd/sys/contrib/ck/include/ |
H A D | ck_hp.h | 47 unsigned int degree; member 105 for (i = 0; i < record->global->degree; i++) in ck_hp_clear()
|
/freebsd/sys/dev/qat/qat_api/firmware/include/ |
H A D | icp_qat_fw_mmp.h | 2310 …uint64_t xg; /**< x coordinate of verified base point (> 0 and degree(x(G)) < degree(q)) (8… 2311 …uint64_t yg; /**< y coordinate of verified base point (> 0 and degree(y(G)) < degree(q)) (8… 2313 uint64_t q; /**< field polynomial of degree > 2 and < 512 (8 qwords)*/ 2314 uint64_t a; /**< a equation coefficient (degree(a) < degree(q)) (8 qwords)*/ 2315 uint64_t b; /**< b equation coefficient (degree(b) < degree(q)) (8 qwords)*/ 2384 * Input parameter list for ECDSA GF2 Sign R for degree 571 , 2393 uint64_t a; /**< a coefficient of curve B/K-571 (degree(a) < degree(q)) (9 qwords)*/ 2394 uint64_t b; /**< b coefficient of curve B/K-571 (degree(b) < degree(q)) (9 qwords)*/ 2403 * Input parameter list for ECDSA GF2 Verify for degree 571 , 2422 uint64_t xg; /**< x coordinate of curve point (degree(xG) < 256) (4 qwords)*/ [all …]
|
/freebsd/share/doc/papers/jail/ |
H A D | future.ms | 16 However, there are a number of limitations on the degree of virtualisation 42 patches on FreeBSD 2.2.x, might be leveraged to allow some degree of
|
/freebsd/contrib/arm-optimized-routines/math/aarch64/sve/ |
H A D | sinf.c | 21 /* Non-zero coefficients from the degree 9 Taylor series expansion of 70 /* sin(r) approx using a degree 9 polynomial from the Taylor series in SV_NAME_F1()
|
/freebsd/usr.bin/cksum/ |
H A D | cksum.1 | 131 polynomial M(x) of degree 144 G(x) using mod 2 division, producing a remainder R(x) of degree <= 31.
|
/freebsd/sys/contrib/device-tree/Bindings/net/dsa/ |
H A D | nxp,sja1105.yaml | 106 the phase between 1640 ps (73.8 degree shift at 1Gbps) and 2260 ps 107 (101.7 degree shift) in increments of 0.9 degrees (20 ps).
|