| /src/crypto/external/apache2/openssl/dist/crypto/bn/ |
| bn_exp2.c | 20 int i, j, bits, b, bits1, bits2, ret = 0, wpos1, wpos2, window1, window2, wvalue1, wvalue2; local
38 bits1 = BN_num_bits(p1);
40 if ((bits1 == 0) && (bits2 == 0)) {
45 bits = (bits1 > bits2) ? bits1 : bits2;
64 window1 = BN_window_bits_for_exponent_size(bits1);
|
| /src/crypto/external/bsd/openssl/dist/crypto/bn/ |
| bn_exp2.c | 20 int i, j, bits, b, bits1, bits2, ret = local
39 bits1 = BN_num_bits(p1);
41 if ((bits1 == 0) && (bits2 == 0)) {
46 bits = (bits1 > bits2) ? bits1 : bits2;
65 window1 = BN_window_bits_for_exponent_size(bits1);
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/bn/ |
| bn_exp2.c | 20 int i, j, bits, b, bits1, bits2, ret = local
39 bits1 = BN_num_bits(p1);
41 if ((bits1 == 0) && (bits2 == 0)) {
46 bits = (bits1 > bits2) ? bits1 : bits2;
65 window1 = BN_window_bits_for_exponent_size(bits1);
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++17/ryu/ |
| f2s_intrinsics.h | 71 const uint64_t bits1 = (uint64_t)m * factorHi; local
77 uint32_t bits1Lo = (uint32_t)(bits1);
78 uint32_t bits1Hi = (uint32_t)(bits1 >> 32);
90 const uint64_t sum = (bits0 >> 32) + bits1;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++17/ryu/ |
| f2s_intrinsics.h | 71 const uint64_t bits1 = (uint64_t)m * factorHi; local
77 uint32_t bits1Lo = (uint32_t)(bits1);
78 uint32_t bits1Hi = (uint32_t)(bits1 >> 32);
90 const uint64_t sum = (bits0 >> 32) + bits1;
|
| /src/external/lgpl3/gmp/dist/mpq/ |
| cmp.c | 101 mp_bitcnt_t bits1, bits2; local
105 bits1 = (mp_bitcnt_t) tmp1_size * GMP_NUMB_BITS - cnt1 - cnt2 + 2 * GMP_NAIL_BITS;
111 if (bits1 > bits2 + 1)
113 if (bits2 + op2_is_int > bits1 + 1)
|
| /src/external/bsd/zstd/dist/lib/decompress/ |
| huf_decompress_amd64.S | 79 #define bits1 rdx define
152 movq 72(%rax), %bits1
354 movq %bits1, 72(%rax)
411 movq 72(%rax), %bits1
580 movq %bits1, 72(%rax)
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-ifcombine.cc | 413 tree name1, name2, bit1, bit2, bits1, bits2; local
486 test for name & (bits1 | bits2) != 0. */
487 else if (recognize_bits_test (inner_cond, &name1, &bits1, !inner_inv)
502 else if (bits1 == bits2)
505 std::swap (name1, bits1);
509 else if (bits1 == name2)
510 std::swap (name1, bits1);
517 if (TYPE_PRECISION (TREE_TYPE (bits1))
520 bits1 = fold_convert (unsigned_type_for (TREE_TYPE (bits1)), bits1)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-ifcombine.cc | 394 tree name1, name2, bit1, bit2, bits1, bits2; local
465 test for name & (bits1 | bits2) != 0. */
466 else if (recognize_bits_test (inner_cond, &name1, &bits1, !inner_inv)
481 else if (bits1 == bits2)
484 std::swap (name1, bits1);
488 else if (bits1 == name2)
489 std::swap (name1, bits1);
496 if (TYPE_PRECISION (TREE_TYPE (bits1))
499 bits1 = fold_convert (unsigned_type_for (TREE_TYPE (bits1)), bits1)
[all...] |
| /src/sys/dev/qbus/ |
| if_de.c | 594 char bits1[64]; local
597 snprintb(bits1, sizeof(bits1), PCSR1_BITS, csr1);
599 fn, bits0, bits1);
|
| /src/sys/net/npf/ |
| npf_portmap.c | 88 volatile uint64_t bits1[PORTMAP_L1_WORDS]; member in struct:__anon7071
306 return (bm1->bits1[i] & b) != 0;
356 bm1->bits1[off] |= UINT64_C(1) << (v & PORTMAP_L1_MASK);
379 oval = bm1->bits1[i];
384 if (__npf_atomic_cas_64(&bm1->bits1[i], oval, nval) != oval) {
419 oval = bm1->bits1[i];
424 if (__npf_atomic_cas_64(&bm1->bits1[i], oval, nval) != oval) {
|
| /src/tests/usr.bin/xlint/lint1/ |
| expr_sizeof.c | 101 unsigned int bits1:16; member in struct:__anon7
110 unsigned int bits1:24; member in struct:__anon8
|
| /src/external/gpl3/gcc/dist/gcc/c-family/ |
| c-warn.cc | 2434 Similarly for bits1. */
2444 int bits1 = TYPE_PRECISION (result_type); local
2446 bits1 = TYPE_PRECISION (TREE_TYPE (op1));
2451 bits1 = TYPE_PRECISION (TREE_TYPE (arg1));
2461 std::swap (bits0, bits1);
|
| /src/external/gpl3/gcc.old/dist/gcc/c-family/ |
| c-warn.cc | 2346 Similarly for bits1. */
2356 int bits1 = TYPE_PRECISION (result_type); local
2358 bits1 = TYPE_PRECISION (TREE_TYPE (op1));
2363 bits1 = TYPE_PRECISION (TREE_TYPE (arg1));
2373 std::swap (bits0, bits1);
|
| /src/external/bsd/ntp/dist/ntpd/ |
| refclock_oncore.c | 3355 int bits1, bits2, bits3; local
3357 bits1 = (instance->BEHa[129]>>5) & 0x7; /* actually Ha */
3360 instance->rsm.bad_fix = (bits2 & 0x8) || (bits1 == 0x2);
3372 bits1, bits2, bits3,
|
| /src/external/gpl3/gcc/dist/libbacktrace/ |
| elf.c | 4047 unsigned int bits1, bits2, bits3, bits4; local
4087 if (!elf_fetch_backward_init (&pback1, pbackend1, &val1, &bits1))
4113 if (!elf_fetch_bits_backward (&pback1, pbackend1, &val1, &bits1))
4126 t1 = huffman_table[(val1 >> (bits1 - huffman_table_bits))
4137 bits1 -= t1 & 0xff;
4153 while (bits1 > 11 && bits2 > 11 && bits3 > 11 && bits4 > 11);
4162 if (!elf_fetch_bits_backward (&pback1, pbackend1, &val1, &bits1))
4174 if (unlikely (bits1 < huffman_table_bits))
4176 t1 = huffman_table[(val1 << (huffman_table_bits - bits1))
4178 if (unlikely (bits1 < (t1 & 0xff))
[all...] |
| /src/external/gpl3/gdb/dist/libbacktrace/ |
| elf.c | 4047 unsigned int bits1, bits2, bits3, bits4; local
4087 if (!elf_fetch_backward_init (&pback1, pbackend1, &val1, &bits1))
4113 if (!elf_fetch_bits_backward (&pback1, pbackend1, &val1, &bits1))
4126 t1 = huffman_table[(val1 >> (bits1 - huffman_table_bits))
4137 bits1 -= t1 & 0xff;
4153 while (bits1 > 11 && bits2 > 11 && bits3 > 11 && bits4 > 11);
4162 if (!elf_fetch_bits_backward (&pback1, pbackend1, &val1, &bits1))
4174 if (unlikely (bits1 < huffman_table_bits))
4176 t1 = huffman_table[(val1 << (huffman_table_bits - bits1))
4178 if (unlikely (bits1 < (t1 & 0xff))
[all...] |
| /src/external/gpl3/gdb.old/dist/libbacktrace/ |
| elf.c | 4047 unsigned int bits1, bits2, bits3, bits4; local
4087 if (!elf_fetch_backward_init (&pback1, pbackend1, &val1, &bits1))
4113 if (!elf_fetch_bits_backward (&pback1, pbackend1, &val1, &bits1))
4126 t1 = huffman_table[(val1 >> (bits1 - huffman_table_bits))
4137 bits1 -= t1 & 0xff;
4153 while (bits1 > 11 && bits2 > 11 && bits3 > 11 && bits4 > 11);
4162 if (!elf_fetch_bits_backward (&pback1, pbackend1, &val1, &bits1))
4174 if (unlikely (bits1 < huffman_table_bits))
4176 t1 = huffman_table[(val1 << (huffman_table_bits - bits1))
4178 if (unlikely (bits1 < (t1 & 0xff))
[all...] |
