Searched refs:digs (Results 1 - 25 of 38) sorted by relevance

12

/netbsd-current/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
H A Dbn_mp_radix_size.c23 int res, digs; local
45 /* digs is the digit count */
46 digs = 0;
50 ++digs;
67 ++digs;
71 /* return digs + 1, the 1 is for the NULL byte that would be required. */
72 *size = digs + 1;
H A Dbn_s_mp_mul_digs.c20 /* multiplies |a| * |b| and only computes upto digs digits of result
24 int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) argument
33 if (((digs) < MP_WARRAY) &&
36 return fast_s_mp_mul_digs (a, b, c, digs);
39 if ((res = mp_init_size (&t, digs)) != MP_OKAY) {
42 t.used = digs;
50 /* limit ourselves to making digs digits of output */
51 pb = MIN (b->used, digs - ix);
76 /* set carry if it is placed below digs */
77 if (ix + iy < digs) {
[all...]
H A Dbn_mp_toradix_n.c26 int res, digs; local
60 digs = 0;
71 ++digs;
77 bn_reverse ((unsigned char *)_s, digs);
H A Dbn_mp_toradix.c23 int res, digs; local
51 digs = 0;
58 ++digs;
64 bn_reverse ((unsigned char *)_s, digs);
H A Dbn_mp_montgomery_reduce.c24 int ix, res, digs; local
33 digs = n->used * 2 + 1;
34 if ((digs < MP_WARRAY) &&
41 if (x->alloc < digs) {
42 if ((res = mp_grow (x, digs)) != MP_OKAY) {
46 x->used = digs;
H A Dbn_s_mp_mul_high_digs.c20 /* multiplies |a| * |b| and does not compute the lower digs digits
24 s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) argument
36 return fast_s_mp_mul_high_digs (a, b, c, digs);
55 tmpt = &(t.dp[digs]);
58 tmpy = b->dp + (digs - ix);
60 for (iy = digs - ix; iy < pb; iy++) {
H A Dbn_mp_mul.c45 int digs = a->used + b->used + 1; local
48 if ((digs < MP_WARRAY) &&
51 res = fast_s_mp_mul_digs (a, b, c, digs);
H A Dbn_fast_s_mp_mul_digs.c36 int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) argument
43 if (c->alloc < digs) {
44 if ((res = mp_grow (c, digs)) != MP_OKAY) {
50 pa = MIN(digs, a->used + b->used);
H A Dbn_fast_s_mp_mul_high_digs.c21 * output digits *above* digs. See the comments for fast_s_mul_digs
29 int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) argument
46 for (ix = digs; ix < pa; ix++) {
82 tmpc = c->dp + digs;
83 for (ix = digs; ix < pa; ix++) {
H A Dtommath.h564 int fast_s_mp_mul_digs(mp_int *a, mp_int *b, mp_int *c, int digs);
565 int s_mp_mul_digs(mp_int *a, mp_int *b, mp_int *c, int digs);
566 int fast_s_mp_mul_high_digs(mp_int *a, mp_int *b, mp_int *c, int digs);
567 int s_mp_mul_high_digs(mp_int *a, mp_int *b, mp_int *c, int digs);
/netbsd-current/external/bsd/file/dist/src/
H A Dis_tar.c163 from_oct(const char *where, size_t digs) argument
167 if (digs == 0)
172 if (digs-- == 0)
176 while (digs > 0 && isodigit(*where)) { /* Scan til non-octal */
178 digs--;
181 if (digs > 0 && *where && !isspace(CAST(unsigned char, *where)))
/netbsd-current/external/mpl/bind/dist/bin/tests/system/doth/
H A Dstress_http_quota.py165 digs = []
167 digs.append(SubDIG(http_secure=http_secure, extra_args=extra_args))
168 self.digs = digs
169 assert len(self.digs) == int(numdigs), f"len={len(self.digs)} numdigs={numdigs}"
172 for p in self.digs:
176 return map(lambda p: (p.wait()), self.digs)
186 return reduce(lambda a, b: (a and b), map(lambda p: (p.alive()), self.digs))
190 for p in self.digs
[all...]
/netbsd-current/external/ibm-public/postfix/dist/src/global/
H A Doff_cvt.c100 static char digs[] = "0123456789"; local
117 VSTRING_ADDCH(buf, digs[offset % 10]);
/netbsd-current/external/gpl3/binutils.old/dist/bfd/
H A Dverilog.c67 static const char digs[] = "0123456789ABCDEF"; variable
72 d[1] = digs[(x) & 0xf]; \
73 d[0] = digs[((x) >> 4) & 0xf];
H A Dtekhex.c86 static const char digs[] = "0123456789ABCDEF"; variable
95 (d)[1] = digs[(x) & 0xf]; \
96 (d)[0] = digs[((x)>>4)&0xf];
729 *p++ = digs[(value >> shift) & 0xf];
763 *p++ = digs[len];
/netbsd-current/external/gpl3/binutils/dist/bfd/
H A Dverilog.c67 static const char digs[] = "0123456789ABCDEF"; variable
72 d[1] = digs[(x) & 0xf]; \
73 d[0] = digs[((x) >> 4) & 0xf];
H A Dtekhex.c86 static const char digs[] = "0123456789ABCDEF"; variable
95 (d)[1] = digs[(x) & 0xf]; \
96 (d)[0] = digs[((x)>>4)&0xf];
729 *p++ = digs[(value >> shift) & 0xf];
763 *p++ = digs[len];
/netbsd-current/external/gpl3/gdb.old/dist/bfd/
H A Dverilog.c67 static const char digs[] = "0123456789ABCDEF"; variable
72 d[1] = digs[(x) & 0xf]; \
73 d[0] = digs[((x) >> 4) & 0xf];
H A Dtekhex.c86 static const char digs[] = "0123456789ABCDEF"; variable
95 (d)[1] = digs[(x) & 0xf]; \
96 (d)[0] = digs[((x)>>4)&0xf];
729 *p++ = digs[(value >> shift) & 0xf];
763 *p++ = digs[len];
/netbsd-current/crypto/external/bsd/netpgp/dist/src/libbn/
H A Dbignum.c2293 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) argument
2301 if (c->alloc < digs) {
2302 if ((res = mp_grow (c, digs)) != MP_OKAY) {
2308 pa = MIN(digs, a->used + b->used);
2369 /* multiplies |a| * |b| and only computes upto digs digits of result
2373 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) argument
2382 if (((unsigned)(digs) < MP_WARRAY) &&
2385 return fast_s_mp_mul_digs (a, b, c, digs);
2388 if ((res = mp_init_size (&t, digs)) != MP_OKAY) {
2391 t.used = digs;
2464 int digs = a->used + b->used + 1; local
2488 fast_s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs) argument
2564 s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs) argument
3781 int ix, res, digs; local
4965 int res, digs; local
5027 int res, digs; local
[all...]
/netbsd-current/external/gpl3/gdb/dist/bfd/
H A Dverilog.c71 static const char digs[] = "0123456789ABCDEF"; variable
76 d[1] = digs[(x) & 0xf]; \
77 d[0] = digs[((x) >> 4) & 0xf];
H A Dtekhex.c86 static const char digs[] = "0123456789ABCDEF"; variable
95 (d)[1] = digs[(x) & 0xf]; \
96 (d)[0] = digs[((x)>>4)&0xf];
729 *p++ = digs[(value >> shift) & 0xf];
763 *p++ = digs[len];
/netbsd-current/external/bsd/wpa/dist/src/tls/
H A Dlibtommath.c141 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
143 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs);
146 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
518 int digs = a->used + b->used + 1; local
520 if ((digs < MP_WARRAY) &&
523 res = fast_s_mp_mul_digs (a, b, c, digs);
2337 /* multiplies |a| * |b| and only computes up to digs digits of result
2341 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) argument
2351 if (((digs) < MP_WARRAY) &&
2354 return fast_s_mp_mul_digs (a, b, c, digs);
2426 fast_s_mp_mul_digs(mp_int * a, mp_int * b, mp_int * c, int digs) argument
2594 s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs) argument
[all...]
/netbsd-current/crypto/external/bsd/netpgp/dist/src/netpgpverify/
H A Dbignum.c2252 fast_col_array_multiply(mp_int * a, mp_int * b, mp_int * c, int digs) argument
2260 if (c->alloc < digs) {
2261 if ((res = mp_grow(c, digs)) != MP_OKAY) {
2267 pa = MIN(digs, a->used + b->used);
2341 /* multiplies |a| * |b| and only computes upto digs digits of result
2346 basic_multiply_partial_lower(mp_int * a, mp_int * b, mp_int * c, int digs) argument
2355 if (can_use_fast_column_array(digs, MIN(a->used, b->used))) {
2356 return fast_col_array_multiply(a, b, c, digs);
2359 if ((res = mp_init_size(&t, digs)) != MP_OKAY) {
2362 t.used = digs;
2428 int digs = a->used + b->used + 1; local
2450 fast_basic_multiply_partial_upper(mp_int * a, mp_int * b, mp_int * c, int digs) argument
2526 basic_multiply_partial_upper(mp_int * a, mp_int * b, mp_int * c, int digs) argument
3764 int ix, res, digs; local
4922 int res, digs; local
4984 int res, digs; local
[all...]
/netbsd-current/sbin/nvmectl/
H A Dbignum.c2248 fast_col_array_multiply(mp_int * a, mp_int * b, mp_int * c, int digs) argument
2256 if (c->alloc < digs) {
2257 if ((res = mp_grow(c, digs)) != MP_OKAY) {
2263 pa = MIN(digs, a->used + b->used);
2337 /* multiplies |a| * |b| and only computes upto digs digits of result
2342 basic_multiply_partial_lower(mp_int * a, mp_int * b, mp_int * c, int digs) argument
2351 if (can_use_fast_column_array(digs, MIN(a->used, b->used))) {
2352 return fast_col_array_multiply(a, b, c, digs);
2355 if ((res = mp_init_size(&t, digs)) != MP_OKAY) {
2358 t.used = digs;
2424 int digs = a->used + b->used + 1; local
2446 fast_basic_multiply_partial_upper(mp_int * a, mp_int * b, mp_int * c, int digs) argument
2522 basic_multiply_partial_upper(mp_int * a, mp_int * b, mp_int * c, int digs) argument
3741 int ix, res, digs; local
4899 int res, digs; local
4961 int res, digs; local
[all...]

Completed in 348 milliseconds

12