HomeSort by relevance Sort by last modified time
    Searched refs:b1 (Results 1 - 25 of 95) sorted by null

1 2 3 4

  /netvirt/usr/src/lib/libast/common/comp/
memcmp.c 35 register const unsigned char* b1 = (const unsigned char*)ab1;
37 register const unsigned char* e = b1 + n;
39 while (b1 < e)
40 if (*b1++ != *b2++)
41 return(*--b1 - *--b2);
  /netvirt/usr/src/cmd/perl/5.6.1/distrib/lib/unicode/Is/
SylWII.pl 10 14b0 14b1
LbrkPR.pl 9 00b1
BidiET.pl 9 00b0 00b1
Sm.pl 10 00b1
S.pl 14 00ae 00b1
88 27b1 27be
  /netvirt/usr/src/cmd/eqn/
shift.c 23 int shval, d1, h1, b1, h2, b2; local
31 b1 = ebase[p1];
48 if (d1+b1 > h2) /* move little sub down */
49 shval = b1-b2;
50 ebase[yyval] = b1 + max(0, h2-b1-d1);
51 eht[yyval] = h1 + max(0, h2-b1-d1);
65 ebase[yyval] = b1;
67 shval = -VERT((4 * (h1-b1)) / 10) - b2;
68 if (VERT(4*(h1-b1)/10) + h2 < h1-b1) /* raise little super *
114 int effps, h1, h2, h3, b1, b2, b3, subsh, d1, d2, supsh, treg; local
    [all...]
fromto.c 22 int b, h1, b1, pss; local
26 b1 = ebase[p1];
48 eht[p2]-ebase[p2]+b1, yyval, p2, pss, p2, EFFPS(ps));
50 yyval, p2, -(eht[p2]-ebase[p2]+b1));
62 -(h1-b1+ebase[p3]), yyval, p3, pss, p3, EFFPS(ps),
63 yyval, p3, (h1-b1+ebase[p3]));
66 ebase[yyval] = b + b1;
paren.c 26 int n, m, h1, j, b1, v; local
27 h1 = eht[p1]; b1 = ebase[p1];
33 n = max(b1+VERT(1), h1-b1-VERT(1)) / VERT(1);
46 ebase[yyval] = b1 + (eht[yyval]-h1)/2;
47 v = b1 - h1/2 + VERT(EM(0.4, ps));
53 v = b1 - h1/2 + VERT(1);
  /netvirt/usr/src/grub/grub-0.95/stage2/
zfs_fletcher.c 34 uint64_t a0, b0, a1, b1; local
36 for (a0 = b0 = a1 = b1 = 0; ip < ipend; ip += 2) {
40 b1 += a1;
43 ZIO_SET_CHECKSUM(zcp, a0, a1, b0, b1);
51 uint64_t a0, b0, a1, b1; local
53 for (a0 = b0 = a1 = b1 = 0; ip < ipend; ip += 2) {
57 b1 += a1;
60 ZIO_SET_CHECKSUM(zcp, a0, a1, b0, b1);
  /netvirt/usr/src/cmd/perl/5.8.4/distrib/t/op/
bless.t 27 $b1 = bless [], "B";
28 print expected($b1, "B", "ARRAY"), "ok 2\n";
53 local $b1 = bless [], "B3";
57 print expected($b1, "B3", "ARRAY"), "ok 12\n";
62 print expected($b1, "B", "ARRAY"), "ok 16\n";
116 $b1 = eval { bless {}, $a1 };
117 print $@ ? "ok 29\n" : "not ok 29\t# $b1\n";
die.t 60 eval qq/ use strict; \$\x{3b1} /;
61 print "not " unless $@ =~ /Global symbol "\$\x{3b1}"/;
  /netvirt/usr/src/cmd/perl/5.8.4/distrib/lib/base/t/
fields-base.t 27 package B1;
28 use fields qw(b1 b2 b3);
32 use fields qw(b1 _b2 b2);
40 use base 'B1';
44 use base 'B1';
51 use fields qw(b1 d1 _b1 _d1); # hide b1
70 use base 'B1';
77 package B1;
78 use fields qw(b1 b2 b3)
    [all...]
  /netvirt/usr/src/uts/common/fs/zfs/
fletcher.c 38 uint64_t a0, b0, a1, b1; local
40 for (a0 = b0 = a1 = b1 = 0; ip < ipend; ip += 2) {
44 b1 += a1;
47 ZIO_SET_CHECKSUM(zcp, a0, a1, b0, b1);
55 uint64_t a0, b0, a1, b1; local
57 for (a0 = b0 = a1 = b1 = 0; ip < ipend; ip += 2) {
61 b1 += a1;
64 ZIO_SET_CHECKSUM(zcp, a0, a1, b0, b1);
  /netvirt/usr/src/cmd/perl/5.6.1/distrib/t/lib/
fields.t 9 if ($_[0] =~ /^Hides field 'b1' in base class/) {
21 package B1;
22 use fields qw(b1 b2 b3);
26 use fields qw(b1 _b2 b2);
31 use base 'B1';
35 use base 'B1';
41 use fields qw(b1 d1 _b1 _d1); # hide b1
54 use base 'B1';
61 package B1;
    [all...]
  /netvirt/usr/src/cmd/uniq/
uniq.c 88 static int equal(char *b1, char *b2);
97 char *b1 = NULL, *b2 = NULL; local
107 if ((b1 = ((char *) malloc((unsigned) BLOCKSIZE))) == NULL || (b2 =
208 if (gline(&b1, &b1size))
213 pline(b1);
216 if (!equal(b1, b2)) {
217 pline(b1);
221 if (gline(&b1, &b1size)) {
225 } while (equal(b1, b2));
297 equal(b1, b2
    [all...]
  /netvirt/usr/src/common/mpi/
mp_gf2m-priv.h 88 /* Compute xor-multiply of two binary polynomials (a1, a0) x (b1, b0)
92 void s_bmul_2x2(mp_digit *r, const mp_digit a1, const mp_digit a0, const mp_digit b1,
95 /* Compute xor-multiply of two binary polynomials (a2, a1, a0) x (b2, b1, b0)
100 const mp_digit b2, const mp_digit b1, const mp_digit b0);
102 /* Compute xor-multiply of two binary polynomials (a3, a2, a1, a0) x (b3, b2, b1, b0)
107 const mp_digit a0, const mp_digit b3, const mp_digit b2, const mp_digit b1,
  /netvirt/usr/src/lib/libc/i386/gen/
strcmp.c 72 int b1, b2; local
202 b1 = i1; /* save the ints in memory */
204 str1 = (void *) &b1; /* point at them */
  /netvirt/usr/src/common/openssl/crypto/idea/
i_skey.c 129 long n1,n2,q,r,b1,b2,t; local
138 b1=0;
150 b2=b1-q*b2;
151 b1=t;
  /netvirt/usr/src/lib/libshell/common/tests/
attributes.sh 165 then b1=aGVsbG8gd29ybGQ=
167 else b1=iIWTk5ZAppaZk4Q=
170 z=$b1
171 typeset -b x=$b1
174 typeset -b -Z5 a=$b1
179 x+=$b1
182 typeset -b -Z20 z=$b1
191 [[ $v1 == "$b1" ]] || err_exit "v1=$v1 should be $b1"
  /netvirt/usr/src/common/openssl/crypto/asn1/
a_set.c 76 const MYBLOB *b1 = (const MYBLOB *)elem1; local
80 r = memcmp(b1->pbData, b2->pbData,
81 b1->cbData < b2->cbData ? b1->cbData : b2->cbData);
84 return b1->cbData-b2->cbData;
  /netvirt/usr/src/lib/libslp/javalib/com/sun/slp/
IANACharCode.java 279 byte b0 = 0, b1 = 0, b2 = 0, b3 = 0;
283 b1 = (byte) ((code >> 8) & 0xFF);
293 b[1] = b1;
302 if (b1 != 0 || b2 != 0) {
324 b[1] = b1;
326 } else if (b1 != 0) {
328 b[1] = b1;
  /netvirt/usr/src/cmd/perl/5.8.4/distrib/lib/Test/Simple/t/
is_deeply.t 178 my($b1, $b2, $b3);
179 $b1 = \$b2; $b2 = \$b3;
183 is_deeply($a1, $b1, 'deep scalar refs');
195 # is_deeply([$a1], [$b1], 'deep mixed scalar refs');
  /netvirt/usr/src/common/unicode/
u8_textprep.c 147 #define U8_PUT_3BYTES_INTO_UTF32(u, b1, b2, b3) \
148 (u) = ((uint32_t)(b1) & 0x0F) << 12 | ((uint32_t)(b2) & 0x3F) << 6 | \
226 /* B0 B1 B2 B3 B4 B5 B6 B7 B8 B9 BA BB BC BD BE BF */
465 uint16_t b1 = 0; local
487 b1 = u8s[0] = s[0];
506 b1 = u8_common_b1_tbl[uv][b1];
507 if (b1 == U8_TBL_ELEMENT_NOT_DEF)
510 b2 = u8_case_common_b2_tbl[uv][b1][b2];
695 uint16_t b1 = 0 local
749 uint16_t b1 = 0; local
971 uint16_t b1 = 0; local
    [all...]
  /netvirt/usr/src/uts/common/rpc/
rpcsec_defs.h 112 #define GSS_BUFFERS_EQUAL(b1, b2) (((b1).length == (b2).length) && \
113 (bcmp((b1).value, (b2).value, (b1.length)) == 0))

Completed in 4379 milliseconds

1 2 3 4