| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/modes/gcm/ |
| Tables1kGCMExponentiator.java | 28 int bit = 0; local
33 ensureAvailable(bit);
34 GCMUtil.multiply(y, (int[])lookupPowX2.elementAt(bit));
36 ++bit;
43 private void ensureAvailable(int bit)
46 if (count <= bit)
55 while (++count <= bit);
|
| /external/bzip2/ |
| unzcrash.c | 6 and then repeatedly decompress it, each time with a different bit of
7 the compressed data inverted, so as to test all possible one-bit errors.
64 void flip_bit ( int bit )
66 int byteno = bit / 8;
67 int bitno = bit % 8;
69 //fprintf ( stderr, "(byte %d bit %d mask %d)",
78 int bit; local
102 for (bit = 0; bit < nZ*8; bit++)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_bitvector_test.cc | 94 uptr bit = ((uptr)my_rand() % bv.size()); local
95 EXPECT_EQ(bv.getBit(bit), s.count(bit) == 1);
98 EXPECT_EQ(bv.setBit(bit), s.insert(bit).second);
102 s.erase(bit);
103 EXPECT_EQ(bv.clearBit(bit), old_size > s.size());
106 EXPECT_EQ(bv.getBit(bit), s.count(bit) == 1);
|
| /external/icu/icu4c/source/layout/ |
| OpenTypeUtilities.cpp | 15 // Finds the high bit by binary searching
24 le_uint8 bit = 0; local
28 bit += 16;
33 bit += 8;
38 bit += 4;
43 bit += 2;
48 bit += 1;
51 return bit;
61 le_uint8 bit = highBit(recordCount); local
62 le_int32 power = 1 << bit;
100 le_uint8 bit = highBit(recordCount); local
[all...] |
| /external/libopus/silk/ |
| encode_pulses.c | 68 opus_int i, k, j, iter, bit, nLS, scale_down, RateLevelIndex = 0; local
192 bit = silk_RSHIFT( abs_q, j ) & 1;
193 ec_enc_icdf( psRangeEnc, bit, silk_lsb_iCDF, 8 );
195 bit = abs_q & 1;
196 ec_enc_icdf( psRangeEnc, bit, silk_lsb_iCDF, 8 );
|
| /external/libvorbis/doc/ |
| 02-bitpacking.tex | 23 seven, ten, eleven and sixteen bit 'bytes' have been used. For
36 the native bit-width of a given storage system. This document assumes
39 \subsubsection{bit order}
41 A byte has a well-defined 'least significant' bit (LSb), which is the
42 only bit set when the byte is storing the two's complement integer
43 value +1. A byte's 'most significant' bit (MSb) is at the opposite
70 The Vorbis codec has need to code arbitrary bit-width integers, from
73 is written at the bit position at which the previous field ends.
77 significant bit, etc, until the requested number of bits have been
80 significant unused bit position of the destination byte, followed b
[all...] |
| /external/libvpx/libvpx/vp8/decoder/ |
| dboolhuff.h | 59 unsigned int bit = 0; local
82 bit = 1;
95 return bit;
101 int bit; local
103 for (bit = bits - 1; bit >= 0; bit--)
105 z |= (vp8dx_decode_bool(br, 0x80) << bit);
|
| /external/mesa3d/src/mesa/main/ |
| querymatrix.c | 108 unsigned int bit; local
149 for (i = 0, bit = 1; i < 16; i++, bit<<=1) {
181 rv |= bit;
195 rv |= bit;
204 rv |= bit;
|
| texgen.c | 106 GLbitfield bit = 0x0; local
111 bit = TEXGEN_OBJ_LINEAR;
114 bit = TEXGEN_EYE_LINEAR;
118 bit = TEXGEN_SPHERE_MAP;
122 bit = TEXGEN_REFLECTION_MAP_NV;
126 bit = TEXGEN_NORMAL_MAP_NV;
131 if (!bit) {
136 && (bit & (TEXGEN_REFLECTION_MAP_NV | TEXGEN_NORMAL_MAP_NV)) == 0) {
143 texgen->_ModeBit = bit;
|
| /external/selinux/policycoreutils/mcstrans/src/ |
| mls_level.c | 48 int bit = atoi(scontextp + 1); local
49 if (ebitmap_set_bit(&l->cat, bit, 1))
58 for (i = bit + 1; i <= ubit; i++) {
|
| /external/valgrind/memcheck/tests/amd64/ |
| insn-pmovmskb.c | 23 bit means "defined"; 1 means "undefined". */
32 static void print(V128 vbits, V128 val, int bit, int result)
34 printf("vbits=0x%016lx%016lx val=0x%016lx%016lx bit=%d result=%d\n",
36 bit, result);
67 int bit = 0; ULong mask = (1UL << bit); local
68 if ((vbits_mask & mask) == 0) print(vbits, val_copy, bit, result & mask);
69 else use(bit, result & mask);
71 bit = 1; mask = (1UL << bit);
[all...] |
| /frameworks/opt/telephony/src/java/com/android/internal/telephony/uicc/ |
| IccServiceTable.java | 22 * Wrapper class for an ICC EF containing a bit field of enabled services.
50 int bit = service % 8; local
51 return (mServiceTable[offset] & (1 << bit)) != 0;
64 for (int bit = 0; bit < 8; bit++) {
65 if ((currentByte & (1 << bit)) != 0) {
71 int ordinal = (i * 8) + bit;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/decoder/ |
| vp9_reader.h | 48 unsigned int bit = 0; local
68 bit = 1;
81 return bit;
89 int literal = 0, bit; local
91 for (bit = bits - 1; bit >= 0; bit--)
92 literal |= vp9_read_bit(r) << bit;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_writer.h | 30 // Variables used to track bit costs without outputing to the bitstream
38 static void vp9_write(vp9_writer *br, int bit, int probability) {
49 if (bit) {
86 static void vp9_write_bit(vp9_writer *w, int bit) {
87 vp9_write(w, bit, 128); // vp9_prob_half
91 int bit; local
93 for (bit = bits - 1; bit >= 0; bit--)
94 vp9_write_bit(w, 1 & (data >> bit));
[all...] |
| /system/core/include/cutils/ |
| bitops.h | 39 * int bit = bitmask_ffz(resource_bits, num_resources);
40 * bitmask_set(resource_bits, bit);
42 * if (bitmask_test(resource_bits, bit)) { ... }
44 * bitmask_clear(resource_bits, bit);
61 int bit, result; local
65 bit = ffs(~bitmask[i]);
66 if (bit) {
68 bit--;
69 result = BITS_PER_WORD * i + bit;
88 static inline void bitmask_set(unsigned int *bitmask, int bit)
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| Bits.java | 20 * Utilities for treating {@code int[]}s as bit sets.
31 * Constructs a bit set to contain bits up to the given index (exclusive).
33 * @param max {@code >= 0;} the maximum bit index (exclusive)
42 * Gets the maximum index (exclusive) for the given bit set.
44 * @param bits {@code non-null;} bit set in question
52 * Gets the value of the bit at the given index.
54 * @param bits {@code non-null;} bit set to operate on
55 * @param idx {@code >= 0, < getMax(set);} which bit
56 * @return the value of the indicated bit
60 int bit = 1 << (idx & 0x1f) local
73 int bit = 1 << (idx & 0x1f); local
90 int bit = 1 << (idx & 0x1f); local
102 int bit = 1 << (idx & 0x1f); local
[all...] |
| /dalvik/dx/src/com/android/dx/util/ |
| Bits.java | 20 * Utilities for treating {@code int[]}s as bit sets.
31 * Constructs a bit set to contain bits up to the given index (exclusive).
33 * @param max {@code >= 0;} the maximum bit index (exclusive)
42 * Gets the maximum index (exclusive) for the given bit set.
44 * @param bits {@code non-null;} bit set in question
52 * Gets the value of the bit at the given index.
54 * @param bits {@code non-null;} bit set to operate on
55 * @param idx {@code >= 0, < getMax(set);} which bit
56 * @return the value of the indicated bit
60 int bit = 1 << (idx & 0x1f) local
73 int bit = 1 << (idx & 0x1f); local
90 int bit = 1 << (idx & 0x1f); local
102 int bit = 1 << (idx & 0x1f); local
[all...] |
| /external/aac/libSBRdec/src/ |
| psbitdec.cpp | 20 individually for the purpose of encoding or decoding bit streams in products that are compliant with
106 UCHAR bit = 0; local
111 bit = FDKreadBits (hBitBuf, 1);
113 index = h[index][bit];
|
| /external/boringssl/src/crypto/bn/ |
| random.c | 120 int ret = 0, bit, bytes, mask; local
132 bit = (bits - 1) % 8;
133 mask = 0xff << (bit + 1);
148 if (bit == 0) {
152 buf[0] |= (3 << (bit - 1));
155 buf[0] |= (1 << bit);
161 /* set bottom bit if requested */
200 * so 3*range (= 11..._2) is exactly one bit longer than range */
|
| /external/dexmaker/src/dx/java/com/android/dx/util/ |
| Bits.java | 20 * Utilities for treating {@code int[]}s as bit sets.
31 * Constructs a bit set to contain bits up to the given index (exclusive).
33 * @param max {@code >= 0;} the maximum bit index (exclusive)
42 * Gets the maximum index (exclusive) for the given bit set.
44 * @param bits {@code non-null;} bit set in question
52 * Gets the value of the bit at the given index.
54 * @param bits {@code non-null;} bit set to operate on
55 * @param idx {@code >= 0, < getMax(set);} which bit
56 * @return the value of the indicated bit
60 int bit = 1 << (idx & 0x1f) local
73 int bit = 1 << (idx & 0x1f); local
90 int bit = 1 << (idx & 0x1f); local
102 int bit = 1 << (idx & 0x1f); local
[all...] |
| /external/elfutils/src/libcpu/ |
| i386_parse.h | 85 struct bitvalue *bit; member in union:YYSTYPE
|
| /external/fio/lib/ |
| bloom.c | 105 const unsigned int bit = hash[i] & BITS_INDEX_MASK; local
107 if (b->map[index] & (1U << bit))
110 b->map[index] |= 1U << bit;
|
| /external/icu/icu4c/source/extra/scrptrun/ |
| scrptrun.cpp | 53 int8_t bit = 0; local
57 bit += 16;
62 bit += 8;
67 bit += 4;
72 bit += 2;
77 bit += 1;
80 return bit;
|
| /external/icu/icu4c/source/samples/layout/ |
| cmaps.cpp | 24 // Finds the high bit by binary searching
29 le_uint8 bit = 0; local
33 bit += 16;
38 bit += 8;
43 bit += 4;
48 bit += 2;
53 bit += 1;
56 return bit;
173 le_uint8 bit = highBit(nGroups); local
174 fPower = 1 << bit;
[all...] |
| /external/libvpx/libvpx/vp9/decoder/ |
| vp9_reader.h | 56 unsigned int bit = 0; local
76 bit = 1;
89 return bit;
97 int literal = 0, bit; local
99 for (bit = bits - 1; bit >= 0; bit--)
100 literal |= vp9_read_bit(r) << bit;
|
