| /freebsd/contrib/tcsh/ |
| H A D | termcap.vms | 9 :ts=\E[1$}\E[;H\E[K:\
10 :fs=\E[0$}:\
11 :ds=\E[1$}\E[D;H\E[K\E[0$}:\
12 :ae=4\E(B:\
13 :al=\E[L:\
14 :as=2\E(<:\
15 :dc=\E[P;\E[:dl=\E[M:\
16 :ei=\E[4l:im=\E[4h:mi:nd=\E[C:se=\E[m:so=\E[7m:sr=\EM:\
17 :ue=\E[m:up=\E[A:us=\E[4m:\
18 :cr=^M:do=^J:nl=^J:bl=^G:co#80:li#24:cl=50\E[;H\E[2J:\
[all …]
|
| /freebsd/contrib/netbsd-tests/lib/libc/regex/data/att/ |
| H A D | nullsubexpr.dat | 3 E (a*)* a (0,1)(0,1)
4 E SAME x (0,0)(0,0)
5 E SAME aaaaaa (0,6)(0,6)
6 E SAME aaaaaax (0,6)(0,6)
7 E (a*)+ a (0,1)(0,1)
8 E SAME x (0,0)(0,0)
9 E SAME aaaaaa (0,6)(0,6)
10 E SAME aaaaaax (0,6)(0,6)
11 E (a+)* a (0,1)(0,1)
12 E SAME x (0,0)
[all …]
|
| H A D | repetition.dat | 6 # (0,.)\((\(.\),\(.\))(?,?)(\2,\3)\)*
7 # (0,.)\((\(.\),\(.\))(\2,\3)(?,?)\)*
8 # i.e., each 3-tuple has two identical elements and one (?,?)
10 E ((..)|(.)) NULL NOMATCH
11 E ((..)|(.))((..)|(.)) NULL NOMATCH
12 E ((..)|(.))((..)|(.))((..)|(.)) NULL NOMATCH
14 E ((..)|(.)){1} NULL NOMATCH
15 E ((..)|(.)){2} NULL NOMATCH
16 E ((..)|(.)){3} NULL NOMATCH
18 E ((..)|(.))* NULL (0,0)
[all …]
|
| H A D | basic.dat | 4 BE a...b abababbb (2,7)
5 BE XXXXXX ..XXXXXX (2,8)
6 E \) () (1,2)
7 BE a] a]a (0,2)
9 E \} } (0,1)
12 E ] ] (0,1)
17 BE a\^ a^ (0,2)
18 BE a$ aa (1,2)
19 BE a\$ a$ (0,2)
21 E $^ NULL (0,0)
[all …]
|
| H A D | forcedassoc.dat | 3 E (a|ab)(c|bcd) abcd (0,4)(0,1)(1,4)
4 E (a|ab)(bcd|c) abcd (0,4)(0,1)(1,4)
5 E (ab|a)(c|bcd) abcd (0,4)(0,1)(1,4)
6 E (ab|a)(bcd|c) abcd (0,4)(0,1)(1,4)
7 E ((a|ab)(c|bcd))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
8 E ((a|ab)(bcd|c))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
9 E ((ab|a)(c|bcd))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
10 E ((ab|a)(bcd|c))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
11 E (a|ab)((c|bcd)(d*)) abcd (0,4)(0,2)(2,4)(2,3)(3,4)
12 E (a|ab)((bcd|c)(d*)) abcd (0,4)(0,2)(2,4)(2,3)(3,4)
[all …]
|
| H A D | categorization.dat | 3 ?E aa* xaxaax (1,2) POSITION=leftmost
6 ?E (a*)(ab)*(b*) abc (0,2)(0,1)(?,?)(1,2) ASSOCIATIVITY=right
7 |E (a*)(ab)*(b*) abc (0,2)(0,0)(0,2)(2,2) ASSOCIATIVITY=left
10 ?E ((a*)(ab)*)((b*)(a*)) aba (0,3)(0,2)(0,0)(0,2)(2,3)(2,2)(2,3) SUBEXPRESSION=precedence
11 |E ((a*)(ab)*)((b*)(a*)) aba (0,3)(0,1)(0,1)(?,?)(1,3)(1,2)(2,3) SUBEXPRESSION=grouping
14 ?E (...?.?)* xxxxxx (0,6)(4,6) REPEAT_LONGEST=first
15 |E (...?.?)* xxxxxx (0,6)(2,6) REPEAT_LONGEST=last
16 |E (...?.?)* xxxxxx OK REPEAT_LONGEST=unknown
19 ?E (a|ab)(bc|c) abcabc (0,3)(0,2)(2,3) EXPECTED
20 |E (a|ab)(bc|c) abcabc (0,3)(0,1)(1,3) BUG=alternation-order
[all …]
|
| /freebsd/contrib/netbsd-tests/lib/libcurses/ |
| H A D | atf.terminfo | 14 is2=is2, kDC=\E[3;2~, kEND=\E[1;2F, kHOM=\E[1;2H,
15 kIC=\E[2;2~, kLFT=\E[1;2D, kNXT=\E[6;2~, kPRV=\E[5;2~,
16 kRIT=\E[1;2C, kb2=\EOE, kbs=^H, kcbt=\E[Z, kcub1=\EOD, kcud1=\EOB,
17 kcuf1=\EOC, kcuu1=\EOA, kdch1=\E[3~, kend=\EOF, kent=\EOM,
18 kf1=\EOP, kf10=\E[21~, kf11=\E[23~, kf12=\E[24~, kf13=\E[1;2P,
19 kf14=\E[1;2Q, kf15=\E[1;2R, kf16=\E[1;2S, kf17=\E[15;2~,
20 kf18=\E[17;2~, kf19=\E[18;2~, kf2=\EOQ, kf20=\E[19;2~,
21 kf21=\E[20;2~, kf22=\E[21;2~, kf23=\E[23;2~, kf24=\E[24;2~,
22 kf25=\E[1;5P, kf26=\E[1;5Q, kf27=\E[1;5R, kf28=\E[1;5S,
23 kf29=\E[15;5~, kf3=\EOR, kf30=\E[17;5~, kf31=\E[18;5~,
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Frontend/OpenMP/ |
| H A D | ClauseT.h | 16 // - a variant (i.e. union) of values, named `u`.
169 // // (2) bool(a.id()) == false and bool(b.id()) == false
184 template <typename I, typename E>
185 bool operator==(const ObjectT<I, E> &o1, const ObjectT<I, E> &o2) {
189 template <typename I, typename E> using ObjectListT = ListT<ObjectT<I, E>>;
193 template <typename I, typename E> //
197 ObjectT<I, E> v;
205 // V5.2: [3.2.6] `iterator` modifier
206 template <typename E> //
210 std::tuple<E, E, OPT(E)> t;
[all …]
|
| /freebsd/crypto/openssl/crypto/sha/asm/ |
| H A D | keccak1600-armv4.pl | 24 # be assembled even as Thumb-2. NEON code path is KECCAK_1X_ALT with
30 # Switch to KECCAK_2X variant for non-NEON code and merge almost 1/2
39 # e.g. 'eor a,b>>>x,c>>>y'. This conundrum is resolved by using
44 # is the keyword, i.e. "almost 1/2" is kind of complexity cap [for the
47 # Reduce per-round instruction count in Thumb-2 case by 16%. This is
57 # r=1088(*) Thumb-2(**) NEON
69 # (**) Thumb-2 results for Cortex-A5/A7 are likely to apply even to
91 my @E = map("r$_",(10..12,14));
111 my @A = map([ 8*$_, 8*($_+1), 8*($_+2), 8*($_+3), 8*($_+4) ], (0,5,10,15,20));
113 my @T = map([ 8*$_, 8*($_+1), 8*($_+2), 8*($_+3), 8*($_+4) ], (30,35,40,45,50));
[all …]
|
| /freebsd/lib/msun/ld80/ |
| H A D | s_erfl.c | 32 two = 2;
34 * In the domain [0, 2**-34], only the first term in the power series
36 * terms is less than 2**-102.
39 efxu = LD80C(0x8375d410a6db446c, -3, 1.28379167095512573902e-1L),
40 efx8u = LD80C(0x8375d410a6db446c, 0, 1.02703333676410059122e+0L),
42 * Domain [0, 0.84375], range ~[-1.423e-22, 1.423e-22]:
43 * |(erf(x) - x)/x - pp(x)/qq(x)| < 2**-72.573
45 pp0u = LD80C(0x8375d410a6db446c, -3, 1.28379167095512573902e-1L),
46 pp1u = LD80C(0xa46c7d09ec3d0cec, -2, -3.21140201054840180596e-1L),
47 pp2u = LD80C(0x9b31e66325576f86, -5, -3.78893851760347812082e-2L),
[all …]
|
| H A D | e_lgammal_r.c | 34 piu = LD80C(0xc90fdaa22168c235, 1, 3.14159265358979323851e+00L);
35 #define pi (piu.e)
37 * Domain y in [0x1p-70, 0.27], range ~[-4.5264e-22, 4.5264e-22]:
38 * |(lgamma(2 - y) + y / 2) / y - a(y)| < 2**-70.9
41 a0u = LD80C(0x9e233f1bed863d26, -4, 7.72156649015328606028e-02L),
42 a1u = LD80C(0xa51a6625307d3249, -2, 3.22467033424113218889e-01L),
43 a2u = LD80C(0x89f000d2abafda8c, -4, 6.73523010531979398946e-02L),
44 a3u = LD80C(0xa8991563eca75f26, -6, 2.05808084277991211934e-02L),
45 a4u = LD80C(0xf2027e10634ce6b6, -8, 7.38555102796070454026e-03L),
46 a5u = LD80C(0xbd6eb76dd22187f4, -9, 2.89051035162703932972e-03L),
[all …]
|
| /freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/ |
| H A D | cert-onecolumn.pem | 5 E
95 2
119 2
155 E
183 2
188 E
197 E
210 e
225 2
235 E
[all …]
|
| /freebsd/contrib/netbsd-tests/bin/sh/ |
| H A D | t_arith.sh | 11 # 2. Redistributions in binary form must reproduce the above copyright
34 # only digits to examine, and it is good to be sure that 1 + 1 really gives 2
35 # and that 42 or 123 don't look like success because there is a 2 in them.
44 if ! ${TEST_SH} -c ': $(( 0x10000 ))' 2>/dev/null
54 # 2. represent a positive number input as negative value
64 if ! ${TEST_SH} -c ': $(( 0xC0000000 ))' 2>/dev/null
70 if ${TEST_SH} 2>/dev/null \
76 if ${TEST_SH} -c '[ $(( 0xC0000000 )) != 3221225472 ]' 2>/dev/null
82 if ! ${TEST_SH} -c ': $(( 0xC000000000000000 ))' 2>/dev/null
87 if ${TEST_SH} 2>/dev/null \
[all …]
|
| H A D | t_cmdsub.sh | 11 # 2. Redistributions in binary form must reproduce the above copyright
43 atf_check -s exit:0 -o match:'Result is true today' -e empty \
47 atf_check -s exit:0 -o match:'Result is false today' -e empty \
51 atf_check -s exit:0 -o match:'aaabbbccc' -e empty \
53 atf_check -s exit:0 -o match:'aaabbb cccddd' -e empty \
55 atf_check -s exit:0 -o inline:'aaabbb cccddd\n' -e empty \
57 atf_check -s exit:0 -o inline:'aaabbb\ncccddd\n' -e empty \
60 atf_check -s exit:0 -o inline:'some string\n' -e empty \
62 atf_check -s exit:0 -o inline:'weird; string *\n' -e empty \
65 rm -f * 2>/dev/null || :
[all …]
|
| /freebsd/sys/crypto/openssl/aarch64/ |
| H A D | sha1-armv8.S | 50 add w23,w23,w28 // future e+=K
52 add w24,w24,w27 // e+=rot(a,5)
53 ror w21,w21,#2
54 add w23,w23,w4 // future e+=X[i]
55 add w24,w24,w25 // e+=F(b,c,d)
64 add w22,w22,w28 // future e+=K
66 add w23,w23,w27 // e+=rot(a,5)
67 ror w20,w20,#2
68 add w22,w22,w5 // future e+=X[i]
69 add w23,w23,w25 // e+=F(b,c,d)
[all …]
|
| /freebsd/lib/msun/ld128/ |
| H A D | e_lgammal_r.c | 30 pi = 3.14159265358979323846264338327950288e+00L;
32 * Domain y in [0x1p-119, 0.28], range ~[-1.4065e-36, 1.4065e-36]:
33 * |(lgamma(2 - y) + y / 2) / y - a(y)| < 2**-119.1
36 a0 = 7.72156649015328606065120900824024296e-02L,
37 a1 = 3.22467033424113218236207583323018498e-01L,
38 a2 = 6.73523010531980951332460538330282217e-02L,
39 a3 = 2.05808084277845478790009252803463129e-02L,
40 a4 = 7.38555102867398526627292839296001626e-03L,
41 a5 = 2.89051033074152328576829509522483468e-03L,
42 a6 = 1.19275391170326097618357349881842913e-03L,
[all …]
|
| /freebsd/share/doc/usd/22.trofftut/ |
| H A D | tt11 | 62 .P2
71 \es\-2\e\e$1\es+2
73 .P2
76 .BD \e\e$n
82 .BD \e\e$1
94 \e\e$3\es\-2\e\e$1\es+2\e\e$2
96 .P2
102 .P2
108 .P2
127 .P1 2
[all …]
|
| /freebsd/lib/msun/src/ |
| H A D | e_j1.c | 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))
26 * = 1/sqrt(2) * (sin(x) - cos(x))
28 * = -1/sqrt(2) * (sin(x) + cos(x))
[all …]
|
| H A D | e_j0.c | 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))
25 * = 1/sqrt(2) * (cos(x) + sin(x))
27 * = 1/sqrt(2) * (sin(x) - cos(x))
29 * sin(x) +- cos(x) = -cos(2x)/(sin(x) -+ cos(x))
[all …]
|
| H A D | e_j1f.c | 30 invsqrtpi= 5.6418961287e-01, /* 0x3f106ebb */
31 tpi = 6.3661974669e-01, /* 0x3f22f983 */
32 /* R0/S0 on [0,2] */
33 r00 = -6.2500000000e-02, /* 0xbd800000 */
34 r01 = 1.4070566976e-03, /* 0x3ab86cfd */
35 r02 = -1.5995563444e-05, /* 0xb7862e36 */
36 r03 = 4.9672799207e-08, /* 0x335557d2 */
37 s01 = 1.9153760746e-02, /* 0x3c9ce859 */
38 s02 = 1.8594678841e-04, /* 0x3942fab6 */
39 s03 = 1.1771846857e-06, /* 0x359dffc2 */
[all …]
|
| /freebsd/share/termcap/ |
| H A D | termcap | 9 # 2. Redistributions in binary form must reproduce the above copyright
51 # Certain abbreviations (e.g. c100 for concept100) are also allowed
60 # 2p Has two pages of memory. Likewise 4p, 8p, etc.
75 # check for the 2nd entry (the canonical form) since all other codes are
116 :bs:hc:os:pl:co#132:do=^J:kb=^H:up=\E\n:\
119 :do=^J:ct=\E2:st=\E1:ch=\E\t%i%.:\
121 :kb=^H:le=^H:bs:co#132:hc:hu=\EU:hd=\ED:os:pt:up=\E\n:
126 :us=\EE:ue=\ER:so=\EW:se=\E&:tc=1620:
130 :co#124:us=\EE:ue=\ER:so=\EW:se=\E&:tc=1620:
160 :ip=.1*:so=\E"I:us=\E"U:cd=\E'P:ce=\E'L:cl=^L:cm=\E#%+ %+ :\
[all …]
|
| /freebsd/tests/sys/net/if_ovpn/ |
| H A D | server.crt | 15 00:b1:4c:f3:d9:6e:39:ac:d7:8f:78:e9:37:dd:ae:
16 73:f4:d6:77:84:42:3e:2a:76:76:6f:71:6a:b4:45:
17 a9:e3:84:0e:ee:3d:18:20:47:9d:fb:d1:ca:bb:d7:
18 cd:d5:e3:b8:3d:1b:9e:c1:f5:26:72:4a:bb:fe:4e:
19 ec:49:06:c0:ff:21:f4:b5:5c:72:fc:c7:3e:27:86:
21 41:a0:34:06:14:19:08:7a:47:69:5e:b6:aa:6f:74:
22 08:4f:13:ca:1d:b1:d8:2e:3a:a7:41:ec:e0:3e:b4:
23 54:b2:7c:2e:dd:ee:f5:07:92:ed:f2:64:62:2f:7a:
24 c2:8e:f0:50:2d:f6:2b:1c:9d:1d:db:25:04:1e:b5:
25 0d:18:c8:a4:b6:1e:cc:05:a1:10:74:e2:4c:98:32:
[all …]
|
| /freebsd/usr.bin/sed/tests/ |
| H A D | multi_test.sh | 12 # 2. Redistributions in binary form must reproduce the above copyright
51 exec 4>&1 5>&2
53 exec 1>&4 2>&5
56 rm -f current.out lines[1-4] script[1-2]
86 echo "Seeding $REGRESS/${TESTNAME} with current result" 1>&2
93 fi 1>&4 2>&5
103 exec 1>&4 2>&5
118 $SED -e '' <lines1
126 $SED -e 's/^/e1_/p' lines1
128 $SED -e 's/^/e1_/p' <lines1
[all …]
|
| /freebsd/crypto/libecc/scripts/ |
| H A D | crossbuild.sh | 18 # Check if a file $1 exists. Copy it in $2 if
21 if [ -e $1 ]
23 cp $1 $2
25 echo "$2 did not compile ..." >> $3
31 CROSSBUILD_OUTPUT=$2
55 wordsize=$2
97 echo "======== COMPILING RELEASE FOR $triplet / $wordsize" 2>&1 | tee -a $COMPILATION_LOG_FILE
99 …e VERBOSE=1 -e ASSERT_PRINT="1" -e COMPLETE="$COMPLETE" -e BLINDING="$BLINDING" -e LADDER="$LADDER…
104 …e VERBOSE=1 -e ASSERT_PRINT="1" -e COMPLETE="$COMPLETE" -e BLINDING="$BLINDING" -e LADDER="$LADDER…
107 …ker run -e VERBOSE=1 -e ASSERT_PRINT="1" -e COMPLETE="$COMPLETE" -e BLINDING="$BLINDING" -e LADDER…
[all …]
|
| /freebsd/contrib/ncurses/misc/ |
| H A D | terminfo.src | 4 # by Thomas E. Dickey (TD).
48 # Please e-mail changes to terminfo@thyrsus.com; the old termcap@berkeley.edu
73 # by global-replacing \E(B and \E)B with the appropriate ISO 6429 enablers
74 # for your character set. \E(A and \E)A enables the British character set
75 # with the pound sign at position 2/3.
79 # so \E)0 should be avoided in <enacs> and initialization strings.
162 # -2p Has two pages of memory. Likewise 4p, 8p, etc.
183 # been removed (i.e., "33" for the Model 33 Teletype, "2621" for the HP2621).
209 # from the terminal. Common values for <u9> will be ^E (on older ASCII
210 # terminals) or \E[c (on newer VT100/ANSI/ECMA-48-compatible terminals).
[all …]
|