Home
last modified time | relevance | path

Searched +full:2 +full:x (Results 1 – 25 of 1830) sorted by relevance

12345678910>>...74

/freebsd/tools/tools/ath/ath_ee_v14_print/
H A Dath_ee_v14_print.c10 * 2. Redistributions in binary form must reproduce the above copyright
68 sscanf(b, "%x: %x %x %x %x %x %x %x %x\n", in load_eeprom_dump()
69 &i, &r[0], &r[1], &r[2], &r[3], &r[4], in load_eeprom_dump()
73 buf[i++] = r[2]; in load_eeprom_dump()
90 printf("| Version: 0x%.4x | Length: 0x%.4x | Checksum: 0x%.4x ", in eeprom_v14_base_print()
92 printf("| CapFlags: 0x%.2x\n", eh->opCapFlags); in eeprom_v14_base_print()
94 printf("| eepMisc: 0x%.2x | RegDomain: 0x%.4x 0x%.4x | \n", in eeprom_v14_base_print()
96 printf("| MAC: %.2x:%.2x:%.2x:%.2x:%.2x:%.2x ", in eeprom_v14_base_print()
97 eh->macAddr[0], eh->macAddr[1], eh->macAddr[2], in eeprom_v14_base_print()
99 printf("| RxMask: 0x%.2x | TxMask: 0x%.2x | RfSilent: 0x%.4x | btOptions: 0x%.4x |\n", in eeprom_v14_base_print()
[all …]
/freebsd/tools/tools/ath/ath_ee_v4k_print/
H A Dv4k.c10 * 2. Redistributions in binary form must reproduce the above copyright
54 printf("| Version: 0x%.4x | Length: 0x%.4x | Checksum: 0x%.4x ", in eeprom_v4k_base_print()
56 printf("| CapFlags: 0x%.2x | eepMisc: 0x%.2x | RegDomain: 0x%.4x 0x%.4x | \n", in eeprom_v4k_base_print()
58 printf("| MAC: %.2x:%.2x:%.2x:%.2x:%.2x:%.2x ", in eeprom_v4k_base_print()
59 eh->macAddr[0], eh->macAddr[1], eh->macAddr[2], in eeprom_v4k_base_print()
61 printf("| RxMask: 0x%.2x | TxMask: 0x%.2x | RfSilent: 0x%.4x | btOptions: 0x%.4x |\n", in eeprom_v4k_base_print()
63 printf("| DeviceCap: 0x%.4x | binBuildNumber: %.8x | deviceType: 0x%.2x | txGainType 0x%.2x |\n", in eeprom_v4k_base_print()
76 printf("%s0x%.2x %s", in eeprom_v4k_custdata_print()
91 printf("| antCtrlCommon: 0x%.8x |\n", mh->antCtrlCommon); in eeprom_v4k_modal_print()
92 printf("| switchSettling: 0x%.2x |\n", mh->switchSettling); in eeprom_v4k_modal_print()
[all …]
/freebsd/contrib/bc/gen/
H A Dlib2.bc4 * SPDX-License-Identifier: BSD-2-Clause
36 define p(x,y){
39 if(x==0){
44 if(y==a)return(x^a)@scale
46 if(x<1){
49 z=x
50 x=1/x
53 return e(y*l(x))
55 i=x
[all...]
H A Dlib.bc4 * SPDX-License-Identifier: BSD-2-Clause
36 define e(x){
40 if(x<0){
42 x=-x
45 r=6+s+.44*x
46 scale=scale(x)+1
47 while(x>1){
49 x/=2
[all...]
/freebsd/bin/sh/tests/builtins/
H A Dread1.03 echo "1 2 3" | { read a; echo "x${a}x"; }
4 echo "1 2 3" | { read a b; echo "x${a}x${b}x"; }
5 echo "1 2 3" | { read a b c; echo "x${a}x${b}x${c}x"; }
6 echo "1 2 3" | { read a b c d; echo "x${a}x${b}x${c}x${d}x"; }
8 echo " 1 2 3 " | { read a b c; echo "x${a}x${b}x${c}x"; }
9 echo " 1 2 3 " | { unset IFS; read a b c; echo "x${a}x${b}x${c}x"; }
10 echo " 1 2 3 " | { IFS=$(printf ' \t\n') read a b c; echo "x${a}x${b}x${c}x"; }
11 echo " 1 2 3 " | { IFS= read a b; echo "x${a}x${b}x"; }
13 echo " 1,2 3 " | { IFS=' ,' read a b c; echo "x${a}x${b}x${c}x"; }
14 echo ", 2 ,3" | { IFS=' ,' read a b c; echo "x${a}x${b}x${c}x"; }
[all …]
/freebsd/sys/dev/qlxge/
H A Dqls_dbg.c2 * SPDX-License-Identifier: BSD-2-Clause
13 * 2. Redistributions in binary form must reproduce the above copyright
60 device_printf(dev,"0x%08x:\t0x%08x, 0x%08x, 0x%08x, 0x%08x,\n", in qls_dump_buf32()
61 i, buf[0], buf[1], buf[2], buf[3]); in qls_dump_buf32()
68 device_printf(dev,"0x%08x: 0x%08x\n", i, buf[0]); in qls_dump_buf32()
70 case 2: in qls_dump_buf32()
71 device_printf(dev,"0x%08x: 0x%08x 0x%08x\n", i, buf[0], buf[1]); in qls_dump_buf32()
74 device_printf(dev,"0x%08x: 0x%08x 0x%08x 0x%08x\n", in qls_dump_buf32()
75 i, buf[0], buf[1], buf[2]); in qls_dump_buf32()
102 device_printf(dev,"0x%08x: 0x%04x 0x%04x 0x%04x 0x%04x" in qls_dump_buf16()
[all …]
/freebsd/sys/dev/qlxgb/
H A Dqla_dbg.c2 * SPDX-License-Identifier: BSD-2-Clause
13 * 2. Redistributions in binary form must reproduce the above copyright
61 device_printf(dev,"0x%08x: 0x%08x 0x%08x 0x%08x 0x%08x\n", in qla_dump_buf32()
62 i, buf[0], buf[1], buf[2], buf[3]); in qla_dump_buf32()
69 device_printf(dev,"0x%08x: 0x%08x\n", i, buf[0]); in qla_dump_buf32()
71 case 2: in qla_dump_buf32()
72 device_printf(dev,"0x%08x: 0x%08x 0x%08x\n", i, buf[0], buf[1]); in qla_dump_buf32()
75 device_printf(dev,"0x%08x: 0x%08x 0x%08x 0x%08x\n", in qla_dump_buf32()
76 i, buf[0], buf[1], buf[2]); in qla_dump_buf32()
100 device_printf(dev,"0x%08x: 0x%04x 0x%04x 0x%04x 0x%04x" in qla_dump_buf16()
[all …]
/freebsd/sys/dev/qlxgbe/
H A Dql_dbg.c2 * SPDX-License-Identifier: BSD-2-Clause
13 * 2. Redistributions in binary form must reproduce the above copyright
58 device_printf(dev,"0x%08x: 0x%08x 0x%08x 0x%08x 0x%08x\n", in ql_dump_buf32()
59 i, buf[0], buf[1], buf[2], buf[3]); in ql_dump_buf32()
66 device_printf(dev,"0x%08x: 0x%08x\n", i, buf[0]); in ql_dump_buf32()
68 case 2: in ql_dump_buf32()
69 device_printf(dev,"0x%08x: 0x%08x 0x%08x\n", i, buf[0], buf[1]); in ql_dump_buf32()
72 device_printf(dev,"0x%08x: 0x%08x 0x%08x 0x%08x\n", in ql_dump_buf32()
73 i, buf[0], buf[1], buf[2]); in ql_dump_buf32()
97 device_printf(dev,"0x%08x: 0x%04x 0x%04x 0x%04x 0x%04x" in ql_dump_buf16()
[all …]
/freebsd/crypto/openssl/crypto/chacha/asm/
H A Dchacha-armv4.pl48 open STDOUT,"| \"$^X\" $xlate $flavour $output"
61 my @x=map("r$_",(0..7,"x","x","x","x",12,"x",14,"x"));
71 my ($xd,$xd_) = $odd ? (@t[2],@x[$d1]) : (@x[$d0],@t[2]);
81 # 2 6 10 14
85 # 2 7 8 13
88 # 'a', 'b' are permanently allocated in registers, @x[0..7],
99 "&add (@x[$a0],@x[$a0],@x[$b0])",
101 "&add (@x[$a1],@x[$a1],@x[$b1])",
103 "&eor ($xd,$xd,@x[$a0],'ror#16')",
104 "&eor ($xd_,$xd_,@x[$a1],'ror#16')",
[all …]
H A Dchacha-armv8.pl24 # option on most(*), but not all, processors, yet 6+2 is retained.
26 # improvement on processors where 6+2 helps. Most notably +37% on
34 # IALU/gcc-4.9 4xNEON+1xIALU 6xNEON+2xIALU
40 # X-Gene 9.50/+46% 8.20 8.90(*)
57 open OUT,"| \"$^X\" $xlate $flavour \"$output\""
68 my ($out,$inp,$len,$key,$ctr) = map("x$_",(0..4));
70 my @x=map("x$_",(5..17,19..21));
71 my @d=map("x$_",(22..28,30));
80 "&add_32 (@x[$a0],@x[$a0],@x[$b0])",
81 "&add_32 (@x[$a1],@x[$a1],@x[$b1])",
[all …]
H A Dchacha-ppc.pl25 # cycle. But POWER8 (and POWER9) can issue a pair, and vector-only 4x
32 # IALU/gcc-4.x 3xAltiVec+1xIALU 4xVSX
54 $LRSAVE =2*$SIZE_T;
75 open STDOUT,"| $^X $xlate $flavour \"$output\""
90 my @x=map("r$_",(16..31));
101 "&add (@x[$a0],@x[$a0],@x[$b0])",
102 "&add (@x[$a1],@x[$a1],@x[$b1])",
103 "&add (@x[$a2],@x[$a2],@x[$b2])",
104 "&add (@x[$a3],@x[$a3],@x[$b3])",
105 "&xor (@x[$d0],@x[$d0],@x[$a0])",
[all …]
/freebsd/tools/tools/ath/ath_ee_9287_print/
H A D9287.c9 * 2. Redistributions in binary form must reproduce the above copyright
54 printf("| Version: 0x%.4x | Length: 0x%.4x | Checksum: 0x%.4x ", in eeprom_9287_base_print()
56 printf("| CapFlags: 0x%.2x | eepMisc: 0x%.2x | RegDomain: 0x%.4x 0x%.4x | \n", in eeprom_9287_base_print()
58 printf("| MAC: %.2x:%.2x:%.2x:%.2x:%.2x:%.2x ", in eeprom_9287_base_print()
59 eh->macAddr[0], eh->macAddr[1], eh->macAddr[2], in eeprom_9287_base_print()
61 printf("| RxMask: 0x%.2x | TxMask: 0x%.2x | RfSilent: 0x%.4x | btOptions: 0x%.4x |\n", in eeprom_9287_base_print()
63 …printf("| DeviceCap: 0x%.4x | binBuildNumber: %.8x | deviceType: 0x%.2x | openLoopPwrCntl 0x%.2x |… in eeprom_9287_base_print()
70 printf("0x%.2x ", eh->futureBase[i]); in eeprom_9287_base_print()
84 printf("%s0x%.2x %s", in eeprom_9287_custdata_print()
99 printf("| antCtrlCommon: 0x%.8x |\n", mh->antCtrlCommon); in eeprom_9287_modal_print()
[all …]
/freebsd/lib/msun/src/
H A De_jn.c13 * jn(n, x), yn(n, x)
14 * floating point Bessel's function of the 1st and 2nd kind
20 * Note 2. About jn(n,x), yn(n,x)
21 * For n=0, j0(x) is called.
22 * For n=1, j1(x) is called.
23 * For n<x, forward recursion is used starting
24 * from values of j0(x) and j1(x).
25 * For n>x, a continued fraction approximation to
26 * j(n,x)/j(n-1,x) is evaluated and then backward
28 * for j(n,x). The resulting values of j(0,x) or j(1,x) are
[all …]
H A De_j1.c12 /* j1(x), y1(x)
14 * Method -- j1(x):
15 * 1. For tiny x, we use j1(x) = x/2 - x^3/16 + x^5/384 - ...
16 * 2. Reduce x to |x| since j1(x)=-j1(-x), and
17 * for x in (0,2)
18 * j1(x) = x/2 + x*z*R0/S0, where z = x*x;
19 * (precision: |j1/x - 1/2 - R0/S0 |<2**-61.51 )
20 * for x in (2,inf)
21 * j1(x) = sqrt(2/(pi*x))*(p1(x)*cos(x1)-q1(x)*sin(x1))
22 * y1(x) = sqrt(2/(pi*x))*(p1(x)*sin(x1)+q1(x)*cos(x1))
[all …]
H A De_j0.c12 /* j0(x), y0(x)
14 * Method -- j0(x):
15 * 1. For tiny x, we use j0(x) = 1 - x^2/4 + x^4/64 - ...
16 * 2. Reduce x to |x| since j0(x)=j0(-x), and
17 * for x in (0,2)
18 * j0(x) = 1-z/4+ z^2*R0/S0, where z = x*x;
19 * (precision: |j0-1+z/4-z^2R0/S0 |<2**-63.67 )
20 * for x in (2,inf)
21 * j0(x) = sqrt(2/(pi*x))*(p0(x)*cos(x0)-q0(x)*sin(x0))
22 * where x0 = x-pi/4. It is better to compute sin(x0),cos(x0)
[all …]
H A De_asin.c13 /* asin(x)
15 * Since asin(x) = x + x^3/6 + x^5*3/40 + x^7*15/336 + ...
16 * we approximate asin(x) on [0,0.5] by
17 * asin(x) = x + x*x^2*R(x^2)
19 * R(x^2) is a rational approximation of (asin(x)-x)/x^3
21 * |(asin(x)-x)/x^3 - R(x^2)| < 2^(-58.75)
23 * For x in [0.5,1]
24 * asin(x) = pi/2-2*asin(sqrt((1-x)/2))
25 * Let y = (1-x), z = y/2, s := sqrt(z), and pio2_hi+pio2_lo=pi/2;
26 * then for x>0.98
[all …]
H A De_cosh.c13 /* cosh(x)
15 * mathematically cosh(x) if defined to be (exp(x)+exp(-x))/2
16 * 1. Replace x by |x| (cosh(x) = cosh(-x)).
17 * 2.
18 * [ exp(x) - 1 ]^2
19 * 0 <= x <= ln2/2 : cosh(x) := 1 + -------------------
20 * 2*exp(x)
22 * exp(x) + 1/exp(x)
23 * ln2/2 <= x <= 22 : cosh(x) := -------------------
24 * 2
[all …]
/freebsd/crypto/openssl/crypto/cast/
H A Dc_skey.c23 a[n+2]=(l>> 8)&0xff; \
34 CAST_LONG x[16]; in CAST_set_key() local
37 CAST_LONG X[4], Z[4]; in CAST_set_key() local
42 x[i] = 0; in CAST_set_key()
46 x[i] = data[i]; in CAST_set_key()
53 X[0] = ((x[0] << 24) | (x[1] << 16) | (x[2] << 8) | x[3]) & 0xffffffffL; in CAST_set_key()
54 X[1] = ((x[4] << 24) | (x[5] << 16) | (x[6] << 8) | x[7]) & 0xffffffffL; in CAST_set_key()
55 X[2] = ((x[8] << 24) | (x[9] << 16) | (x[10] << 8) | x[11]) & 0xffffffffL; in CAST_set_key()
56 X[3] = in CAST_set_key()
57 ((x[12] << 24) | (x[13] << 16) | (x[14] << 8) | x[15]) & 0xffffffffL; in CAST_set_key()
[all …]
/freebsd/crypto/openssl/crypto/sha/asm/
H A Dsha512-ia64.pl19 # sha512_block runs in 1003 cycles on Itanium 2, which is almost 50%
25 # 924 cycles long sha256_block outperforms gcc by over factor of 2(!)
29 # 64-bit ones and 1003*64/80 gives 802. Extra cycles, 2 per round,
34 # operations, X[16] values are *maintained* with copies of lower
46 # takes 2 extra cycles before the result of integer operation is
47 # available *to* MMALU and 2(*) extra cycles before the result of MM
49 # MMALU itself has 2 cycles latency. However! I explicitly scheduled
53 # (*) 2 cycles on Itanium 1 and 1 cycle on Itanium 2. But I schedule
54 # for 2 in order to provide for best *overall* performance,
66 # Current performance in cycles per processed byte for Itanium 2
[all …]
/freebsd/contrib/bc/tests/bc/
H A Dmisc2.txt2 define x() {
3 "x"
8 return (2)
21 if (x() == y()) { 1 }
23 if (x() <= y()) { 2 }
24 if (y() >= x()) { 3 }
25 if (x() != y()) { 4 }
26 if (x() < y()) { 5 }
27 if (y() > x()) { 6 }
29 if (x() == z()) { 11 }
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DValueTypes.td65 def i1 : VTInt<1, 2>; // One bit boolean value
66 def i2 : VTInt<2, 3>; // 2-bit integer value
82 def v1i1 : VTVec<1, i1, 17>; // 1 x i1 vector value
83 def v2i1 : VTVec<2, i1, 18>; // 2 x i1 vector value
84 def v3i1 : VTVec<3, i1, 19>; // 3 x i1 vector value
85 def v4i1 : VTVec<4, i1, 20>; // 4 x i1 vector value
86 def v8i1 : VTVec<8, i1, 21>; // 8 x i1 vector value
87 def v16i1 : VTVec<16, i1, 22>; // 16 x i1 vector value
88 def v32i1 : VTVec<32, i1, 23>; // 32 x i1 vector value
89 def v64i1 : VTVec<64, i1, 24>; // 64 x i1 vector value
[all …]
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_pwhash/scryptsalsa208sha256/nosse/
H A Dpwhash_scryptsalsa208sha256_nosse.c11 * 2. Redistributions in binary form must reproduce the above copyright
79 L = (len >> 2); in blkcpy()
97 L = (len >> 2); in blkxor()
116 escrypt_block_t X; in salsa20_8() local
117 uint32_t *x = X.w; in salsa20_8() local
120 blkcpy_64(&X, (escrypt_block_t *) B); in salsa20_8()
121 for (i = 0; i < 8; i += 2) { in salsa20_8()
124 x[4] ^= R(x[0] + x[12], 7); in salsa20_8()
125 x[8] ^= R(x[4] + x[0], 9); in salsa20_8()
126 x[12] ^= R(x[8] + x[4], 13); in salsa20_8()
[all …]
/freebsd/contrib/netbsd-tests/bin/sh/
H A Dt_fsplit.sh11 # 2. Redistributions in binary form must reproduce the above copyright
32 # In particular this means that in ${x-word}, 'word' must be expanded as if
33 # the "${x-" and "}" were absent from the input line.
35 # So: sh -c 'set ${x-a b c}; echo $#' should give 3.
36 # and: sh -c 'set -- ${x-}' echo $#' shold give 0
50 (2) ;;
54 result=$( ${TEST_SH} -c "unset x; $1" )
66 set -- "$(expr "$1" : '\(............\).*')..." "$2" ;;
69 if [ "$2" != "$result" ]
73 atf_fail "Test ${TEST} '$1': expected [$2], found [$result]"
[all …]
/freebsd/contrib/arm-optimized-routines/math/aarch64/experimental/
H A Dasinf_2u5.c2 * Single-precision asin(x) function.
17 #define Small 0x39800000 /* 2^-12. */
21 /* Fast implementation of single-precision asin(x) based on polynomial
24 For x < Small, approximate asin(x) by x. Small = 2^-12 for correct rounding.
26 For x in [Small, 0.5], use order 4 polynomial P such that the final
27 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
30 asinf(0x1.ea00f4p-2) got 0x1.fef15ep-2 want 0x1.fef15cp-2.
32 No cheap approximation can be obtained near x = 1, since the function is not
35 For x in [0.5, 1.0], we use a method based on a trigonometric identity
37 asin(x) = pi/2 - acos(x)
[all …]
H A Dlog1p_2u.c2 * Double-precision log(1+x) function.
15 #define HfRt2Top 0x3fe6a09e /* top32(asuint64(sqrt(2)/2)). */
17 0x00095f62 /* top32(asuint64(1)) - top32(asuint64(sqrt(2)/2)). */
38 log1p(-0x1.2e1aea97b3e5cp-2) got -0x1.65fb8659a2f9p-2
39 want -0x1.65fb8659a2f92p-2. */
41 log1p (double x) in log1p() argument
43 uint64_t ix = asuint64 (x); in log1p()
53 /* x == -0 => log1p(x) = -0. in log1p()
54 x == Inf => log1p(x) = Inf. */ in log1p()
55 return x; in log1p()
[all …]

12345678910>>...74