| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| bn_mp_radix_size.c | 23 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;
|
| bn_s_mp_mul_digs.c | 20 /* 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)
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...] |
| bn_mp_toradix.c | 23 int res, digs; local
51 digs = 0;
58 ++digs;
64 bn_reverse ((unsigned char *)_s, digs);
|
| bn_mp_toradix_n.c | 26 int res, digs; local
60 digs = 0;
71 ++digs;
77 bn_reverse ((unsigned char *)_s, digs);
|
| bn_mp_montgomery_reduce.c | 24 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;
|
| bn_s_mp_mul_high_digs.c | 20 /* 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)
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++) {
|
| bn_mp_mul.c | 45 int digs = a->used + b->used + 1; local
48 if ((digs < MP_WARRAY) &&
51 res = fast_s_mp_mul_digs (a, b, c, digs);
|
| bn_fast_s_mp_mul_digs.c | 36 int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
43 if (c->alloc < digs) {
44 if ((res = mp_grow (c, digs)) != MP_OKAY) {
50 pa = MIN(digs, a->used + b->used);
|
| bn_fast_s_mp_mul_high_digs.c | 21 * 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)
46 for (ix = digs; ix < pa; ix++) {
82 tmpc = c->dp + digs;
83 for (ix = digs; ix < pa; ix++) {
|
| tommath.h | 564 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);
|
| /src/external/bsd/file/dist/src/ |
| is_tar.c | 163 from_oct(const char *where, size_t digs)
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)))
|
| /src/external/mpl/bind/dist/bin/tests/system/doth/ |
| stress_http_quota.py | 162 digs = []
164 digs.append(SubDIG(http_secure=http_secure, extra_args=extra_args))
165 self.digs = digs
166 assert len(self.digs) == int(numdigs), f"len={len(self.digs)} numdigs={numdigs}"
169 for p in self.digs:
173 return map(lambda p: (p.wait()), self.digs)
183 return reduce(lambda a, b: (a and b), map(lambda p: (p.alive()), self.digs))
187 for p in self.digs
[all...] |
| /src/external/ibm-public/postfix/dist/src/global/ |
| off_cvt.c | 100 static char digs[] = "0123456789"; local
117 VSTRING_ADDCH(buf, digs[offset % 10]);
|
| /src/external/gpl3/binutils/dist/bfd/ |
| verilog.c | 71 static const char digs[] = "0123456789ABCDEF"; variable
76 d[1] = digs[(x) & 0xf]; \
77 d[0] = digs[((x) >> 4) & 0xf];
|
| tekhex.c | 86 static const char digs[] = "0123456789ABCDEF"; variable
95 (d)[1] = digs[(x) & 0xf]; \
96 (d)[0] = digs[((x)>>4)&0xf];
728 *p++ = digs[len & 0xf];
730 *p++ = digs[(value >> shift) & 0xf];
748 *p++ = digs[len & 0xf];
|
| /src/external/gpl3/binutils.old/dist/bfd/ |
| verilog.c | 71 static const char digs[] = "0123456789ABCDEF"; variable
76 d[1] = digs[(x) & 0xf]; \
77 d[0] = digs[((x) >> 4) & 0xf];
|
| tekhex.c | 86 static const char digs[] = "0123456789ABCDEF"; variable
95 (d)[1] = digs[(x) & 0xf]; \
96 (d)[0] = digs[((x)>>4)&0xf];
728 *p++ = digs[len & 0xf];
730 *p++ = digs[(value >> shift) & 0xf];
748 *p++ = digs[len & 0xf];
|
| /src/external/gpl3/gdb/dist/bfd/ |
| verilog.c | 71 static const char digs[] = "0123456789ABCDEF"; variable
76 d[1] = digs[(x) & 0xf]; \
77 d[0] = digs[((x) >> 4) & 0xf];
|
| tekhex.c | 86 static const char digs[] = "0123456789ABCDEF"; variable
95 (d)[1] = digs[(x) & 0xf]; \
96 (d)[0] = digs[((x)>>4)&0xf];
728 *p++ = digs[len & 0xf];
730 *p++ = digs[(value >> shift) & 0xf];
748 *p++ = digs[len & 0xf];
|
| /src/crypto/external/bsd/netpgp/dist/src/libbn/ |
| bignum.c | 2293 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
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)
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
3781 int ix, res, digs; local
4965 int res, digs; local
5027 int res, digs; local
[all...] |
| /src/external/gpl3/gdb.old/dist/bfd/ |
| tekhex.c | 86 static const char digs[] = "0123456789ABCDEF"; variable
95 (d)[1] = digs[(x) & 0xf]; \
96 (d)[0] = digs[((x)>>4)&0xf];
732 *p++ = digs[len & 0xf];
734 *p++ = digs[(value >> shift) & 0xf];
752 *p++ = digs[len & 0xf];
|
| verilog.c | 71 static const char digs[] = "0123456789ABCDEF"; variable
76 d[1] = digs[(x) & 0xf]; \
77 d[0] = digs[((x) >> 4) & 0xf];
|
| /src/external/bsd/wpa/dist/src/tls/ |
| libtommath.c | 133 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
135 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs);
138 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
510 int digs = a->used + b->used + 1; local
512 if ((digs < MP_WARRAY) &&
515 res = fast_s_mp_mul_digs (a, b, c, digs);
2329 /* multiplies |a| * |b| and only computes up to digs digits of result
2333 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
2343 if (((digs) < MP_WARRAY) &&
2346 return fast_s_mp_mul_digs (a, b, c, digs);
[all...] |
| /src/sbin/nvmectl/ |
| bignum.c | 2248 fast_col_array_multiply(mp_int * a, mp_int * b, mp_int * c, int digs)
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)
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
3741 int ix, res, digs; local
4899 int res, digs; local
4961 int res, digs; local
[all...] |
| /src/crypto/external/bsd/netpgp/dist/src/netpgpverify/ |
| bignum.c | 2252 fast_col_array_multiply(mp_int * a, mp_int * b, mp_int * c, int digs)
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)
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
3764 int ix, res, digs; local
4922 int res, digs; local
4984 int res, digs; local
[all...] |
