| /freebsd/sys/contrib/device-tree/Bindings/iio/adc/ |
| H A D | adi,ad4695.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Michael Hennerich <Michael.Hennerich@analog.com>
11 - Nuno Sá <nuno.sa@analog.com>
14 A family of similar multi-channel analog to digital converters with SPI bus.
21 $ref: /schemas/spi/spi-peripheral-props.yaml#
26 - adi,ad4695
27 - adi,ad4696
28 - adi,ad4697
[all …]
|
| H A D | adi,ad4000.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Marcelo Schmitt <marcelo.schmitt@analog.com>
15 https://www.analog.com/media/en/technical-documentation/data-sheets/ad4000-4004-4008.pdf
16 https://www.analog.com/media/en/technical-documentation/data-sheets/ad4001-4005.pdf
17 https://www.analog.com/media/en/technical-documentation/data-sheets/ad4002-4006-4010.pdf
18 https://www.analog.com/media/en/technical-documentation/data-sheets/ad4003-4007-4011.pdf
19 https://www.analog.com/media/en/technical-documentation/data-sheets/ad4020-4021-4022.pdf
20 https://www.analog.com/media/en/technical-documentation/data-sheets/adaq4001.pdf
[all …]
|
| /freebsd/lib/msun/src/ |
| H A D | e_rem_pio2.c | 29 * pio2_1t: pi/2 - pio2_1
31 * pio2_2t: pi/2 - (pio2_1+pio2_2)
33 * pio2_3t: pi/2 - (pio2_1+pio2_2+pio2_3)
39 invpio2 = 6.36619772367581382433e-01, /* 0x3FE45F30, 0x6DC9C883 */
41 pio2_1t = 6.07710050650619224932e-11, /* 0x3DD0B461, 0x1A626331 */
42 pio2_2 = 6.07710050630396597660e-11, /* 0x3DD0B461, 0x1A600000 */
43 pio2_2t = 2.02226624879595063154e-21, /* 0x3BA3198A, 0x2E037073 */
44 pio2_3 = 2.02226624871116645580e-21, /* 0x3BA3198A, 0x2E000000 */
45 pio2_3t = 8.47842766036889956997e-32; /* 0x397B839A, 0x252049C1 */
53 double z, in __ieee754_rem_pio2() local
131 u_int32_t high; __ieee754_rem_pio2() local
[all...] |
| H A D | s_exp2f.c | 1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
39 P1 = 0x1.62e430p-1f,
40 P2 = 0x1.ebfbe0p-3f,
41 P3 = 0x1.c6b348p-5f,
42 P4 = 0x1.3b2c9cp-
96 double tv, twopk, u, z; exp2f() local
[all...] |
| /freebsd/contrib/bearssl/src/int/ |
| H A D | i15_muladd.c | 18 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28 * Constant-time division. The divisor must not be larger than 16 bits,
39 for (i = 16; i >= 0; i --) { in divrem16()
44 x -= (-ctl) & d; in divrem16()
55 br_i15_muladd_small(uint16_t *x, uint16_t z, const uint16_t *m) in br_i15_muladd_small() argument
58 * Constant-time: we accept to leak the exact bit length of the in br_i15_muladd_small()
76 divrem16(((uint32_t)x[1] << 15) | z, m[1], &rem); in br_i15_muladd_small()
84 * Principle: we estimate the quotient (x*2^15+z)/m by in br_i15_muladd_small()
85 * doing a 30/15 division with the high words. in br_i15_muladd_small()
99 * b0, we ensured that b0 is "full" (high bit set), and a is in br_i15_muladd_small()
[all …]
|
| H A D | i31_muladd.c | 18 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
29 br_i31_muladd_small(uint32_t *x, uint32_t z, const uint32_t *m) in br_i31_muladd_small() argument
50 lo = (x[1] << 31) | z; in br_i31_muladd_small()
58 * Principle: we estimate the quotient (x*2^31+z)/m by in br_i31_muladd_small()
59 * doing a 64/32 division with the high words. in br_i31_muladd_small()
73 * b0, we ensured that b0 is "full" (high bit set), and a is in br_i31_muladd_small()
81 * u-2 <= q <= u in br_i31_muladd_small()
86 memmove(x + 2, x + 1, (mlen - 1) * sizeof *x); in br_i31_muladd_small()
87 x[1] = z; in br_i31_muladd_small()
91 a0 = ((x[mlen] << (31 - mblr)) | (x[mlen - 1] >> mblr)) in br_i31_muladd_small()
[all …]
|
| H A D | i32_muladd.c | 18 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
29 br_i32_muladd_small(uint32_t *x, uint32_t z, const uint32_t *m) in br_i32_muladd_small() argument
46 x[1] = br_rem(x[1], z, m[1]); in br_i32_muladd_small()
52 * Principle: we estimate the quotient (x*2^32+z)/m by in br_i32_muladd_small()
53 * doing a 64/32 division with the high words. in br_i32_muladd_small()
67 * b0, we ensured that b0 is "full" (high bit set), and a is in br_i32_muladd_small()
75 * u-2 <= q <= u in br_i32_muladd_small()
77 a0 = br_i32_word(x, m_bitlen - 32); in br_i32_muladd_small()
79 memmove(x + 2, x + 1, (mlen - 1) * sizeof *x); in br_i32_muladd_small()
80 x[1] = z; in br_i32_muladd_small()
[all …]
|
| H A D | i31_mulacc.c | 18 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
43 d[0] = (dh << 5) + dl + (~(uint32_t)(dl - 31) >> 31); in br_i31_mulacc()
51 * 32-bit register on 32-bit architectures (on a 64-bit in br_i31_mulacc()
53 * clearing the high bits, which is not free; on a 32-bit in br_i31_mulacc()
66 uint64_t z; in br_i31_mulacc() local
68 z = (uint64_t)d[1 + u + v] + MUL31(f, a[1 + v]) + cc; in br_i31_mulacc()
69 cc = z >> 31; in br_i31_mulacc()
70 d[1 + u + v] = (uint32_t)z & 0x7FFFFFFF; in br_i31_mulacc()
|
| H A D | i31_montmul.c | 18 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
34 * d <- (d + xu*y + f*m) / 2^31 in br_i31_montymul()
35 * We have xu <= 2^31-1 and f <= 2^31-1. in br_i31_montymul()
36 * Thus, if d <= 2*m-1 on input, then: in br_i31_montymul()
37 * 2*m-1 + 2*(2^31-1)*m <= (2^32)*m-1 in br_i31_montymul()
40 * We represent d over 31-bit words, with an extra word 'dh' in br_i31_montymul()
53 * d[v+1] <= 2^31-1 in br_i31_montymul()
54 * xu*y[v+1] <= (2^31-1)*(2^31-1) in br_i31_montymul()
55 * f*m[v+1] <= (2^31-1)*(2^31-1) in br_i31_montymul()
56 * r <= 2^32-1 in br_i31_montymul()
[all …]
|
| /freebsd/lib/libc/locale/ |
| H A D | collate.c | 1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE
54 #include "un-namespace.h"
74 {{0}, "C.UTF-8"}, 1, 0, 0, 0
84 if (table->map && (table->maplen > 0)) { in destruct_collate()
85 (void) munmap(table->map, table->maplen); in destruct_collate()
97 else if (strcmp(encoding, "C.UTF-8") == 0) in __collate_load()
104 table->header.header.destructor = destruct_collate; in __collate_load()
130 int i, chains, z; in __collate_load_tables_l() local
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
| H A D | SystemZMachineFunctionInfo.h | 1 //=== SystemZMachineFunctionInfo.h - SystemZ machine function info -*- C++ -*-//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===-
64 setSpillGPRRegs(Register Low,Register High,unsigned Offs) setSpillGPRRegs() argument
74 setRestoreGPRRegs(Register Low,Register High,unsigned Offs) setRestoreGPRRegs() argument
[all...] |
| /freebsd/sys/contrib/device-tree/src/arm/aspeed/ |
| H A D | aspeed-bmc-lenovo-hr630.dts | 1 // SPDX-License-Identifier: GPL-2.0+
5 * Copyright (C) 2019-present Lenovo
8 /dts-v1/;
10 #include "aspeed-g5.dtsi"
11 #include <dt-bindings/gpio/aspeed-gpio.h>
15 compatible = "lenovo,hr630-bmc", "aspeed,ast2500";
29 stdout-pat
[all...] |
| /freebsd/lib/msun/bsdsrc/ |
| H A D | b_tgamma.c | 1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
41 * The algorithm remains, but the code has been re-arranged to facilitate
65 * xleft > x > iota: smaller_gam(x) where iota = 1e-17.
66 * iota > x > -itoa: Handle x near 0.
67 * -iota > x : neg_gam
70 * -Inf: return NaN and raise invalid;
72 * other x ~< 177.79: return +-0 and raise underflow;
73 * +-0: return +-Inf and raise divide-by-zero;
[all …]
|
| H A D | b_exp.c | 1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
47 * r will be represented as r := z+c for better accuracy.
51 * exp(r) = 1 + r + r*R1/(2-R1),
53 * R1 = x - x^2*(p1+x^2*(p2+x^2*(p3+x^2*(p4+p5*x^2)))).
59 * exp(-INF)= 0;
68 p1 = 1.6666666666666660e-01, /* 0x3fc55555, 0x55555553 */
69 p2 = -2.7777777777564776e-03, /* 0xbf66c16c, 0x16c0ac3c */
70 p3 = 6.6137564717940088e-05, /* 0x3f11566a, 0xb5c2ba0d */
[all …]
|
| /freebsd/lib/msun/ld80/ |
| H A D | b_tgammal.c | 1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
72 static const volatile double tiny = 1e-300;
77 * equal-ripples:
79 * log(G(x)) ~= (x-0.5)*(log(x)-1) + 0.5(log(2*pi)-1) + 1/x*P(1/(x*x))
81 * Keep extra precision in multiplying (x-.5)(log(x)-1), to avoid
82 * premature round-off.
84 * Accurate to max(ulp(1/128) absolute, 2^-66 relative) error.
88 * The following is a decomposition of 0.5 * (log(2*pi) - 1) into the
[all …]
|
| /freebsd/usr.bin/mkuzip/ |
| H A D | mkuzip.8 | 1 .\"-
2 .\" Copyright (c) 2004-2016 Maxim Sobolev <sobomax@FreeBSD.org>
17 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
48 class will be able to decompress the resulting image at run-time.
56 .Bl -enum
69 .Bl -tag -width indent
86 In the very high compression
88 settings, it does not offer quite as high a compression ratio as
90 However, its decompression speed does not suffer at high compression
105 .Va 0-9 .
[all …]
|
| /freebsd/sys/kern/ |
| H A D | subr_unit.c | 1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2004 Poul-Henning Kamp
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
31 * These functions implement a mixed run-length/bitmap management of unit
36 * A return value of -1 signals that no more unit numbers are available.
38 * There is no cost associated with the range of unitnumbers, so unless
51 * sleep so the free_unr() function does not come in a pre-locked variant.
131 #define UNR_NO_MTX ((void *)(uintptr_t)-1)
140 KASSERT(mp->state == 0, ("mutex already locked")); in mtx_lock()
[all …]
|
| /freebsd/usr.sbin/moused/moused/ |
| H A D | moused.8 | 1 .\" SPDX-License-Identifier: BSD-4-Clause
24 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
51 .Op Fl z Ar target
83 .Dq Z
111 .Bl -tag -width indent
113 Emulate the third (middle) button for 2-button mice.
218 and your personal preference. A value of 1.0 means no
269 .Bl -tag -compact -width modelxxx
326 .Ar medium-low ,
327 .Ar medium-high
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/pinctrl/ |
| H A D | qcom,pmic-mpp.txt | 1 Qualcomm PMIC Multi-Purpose Pin (MPP) block
6 - compatible:
10 "qcom,pm8018-mpp",
11 "qcom,pm8019-mpp",
12 "qcom,pm8038-mpp",
13 "qcom,pm8058-mpp",
14 "qcom,pm8821-mpp",
15 "qcom,pm8841-mpp",
16 "qcom,pm8916-mpp",
17 "qcom,pm8917-mpp",
[all …]
|
| /freebsd/usr.bin/compress/ |
| H A D | compress.1 | 23 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
57 utility reduces the size of files using adaptive Lempel-Ziv coding.
61 .Pa .Z .
65 .Pa .Z
76 .Pa .Z
79 .Pa .Z
82 .Pa .Z
96 If no files are specified or a
107 .Bl -tag -width ".Fl b Ar bits"
137 utility uses a modified Lempel-Ziv algorithm.
[all …]
|
| /freebsd/crypto/openssl/crypto/ec/ |
| H A D | ecp_nistp256.c | 2 * Copyright 2011-2024 The OpenSSL Project Authors. All Rights Reserved.
17 * http://www.apache.org/licenses/LICENSE-2.0
33 * A 64-bit implementation of the NIST P-256 elliptic curve point multiplication
50 # error "Your compiler doesn't appear to support 128-bit integer types"
58 * The underlying field. P256 operates over GF(2^256-2^224+2^192+2^96-1). We
66 * These are the parameters of P256, taken from FIPS 186-3, page 86. These
67 * values are big-endian.
74 {0xff, 0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x01, /* a = -3 */
92 /*-
94 * ------------------------------------
[all …]
|
| /freebsd/libexec/rc/rc.d/ |
| H A D | power_profile | 19 LOGGER="logger -t power_profile -p daemon.notice"
25 # $value: HIGH for the highest performance value, LOW for the best
27 # $highest_value: maximum value for this sysctl, when $value is "HIGH"
33 if [ -z "$(sysctl -n ${node} 2> /dev/null)" ]; then
37 # Get the new value, checking for special types HIGH or LOW
53 if [ -n "${value}" ]; then
60 if [ $# -ne 1 ]; then
66 power_profile_svcj="NO"
92 highest_value="`(sysctl -n dev.cpu.0.freq_levels | \
93 awk '{ split($0, a, "[/ ]"); print a[1] }' -) 2> /dev/null`"
[all …]
|
| /freebsd/sys/contrib/openzfs/man/man7/ |
| H A D | zpool-features.7 | 1 .\" SPDX-License-Identifier: CDDL-1.0
9 .\" usr/src/OPENSOLARIS.LICENSE or https://opensource.org/licenses/CDDL-1.0.
27 .Nm zpool-features
31 ZFS pool on-disk format versions are specified via
33 which replace the old on-disk format numbers
34 .Pq the last supported on-disk format number is 28 .
38 .Sy feature Ns @ Ns Ar feature-name
48 Since most features can be enabled independently of each other, the on-disk
57 .Ar com.example : Ns Ar feature-name .
71 .Ar com.example : Ns Ar feature-name
[all …]
|
| /freebsd/share/doc/usd/05.dc/ |
| H A D | dc | 3 .\" Copyright (C) Caldera International Inc. 2001-2002.
26 .\" IN NO EVENT SHALL CALDERA INTERNATIONAL, INC. BE LIABLE FOR ANY DIRECT,
35 .EH 'USD:5-%''DC \- An Interactive Desk Calculator'
36 .OH 'DC \- An Interactive Desk Calculator''USD:5-%'
38 .\" ....TM 75-1271-8 39199 39199-11
41 DC \- An Interactive Desk Calculator
42 .AU "MH 2C-524" 3878
52 time-sharing system to do arbitrary-precision
54 It has provision for manipulating scaled fixed-point numbers and
77 time-sharing system
[all …]
|
| /freebsd/share/doc/psd/20.ipctut/ |
| H A D | tutor.me | 19 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 .oh 'Introductory 4.4BSD IPC''PSD:20-%'
29 .eh 'PSD:20-%''Introductory 4.4BSD IPC'
92 Pipes allow one-way data transmission from one process
163 therefore, typically precede, or are included in, an if-statement.
201 .(z
207 .)z
235 while the socket in the high end is opened only for writing.
245 .(z
250 .)z
[all …]
|