| /external/marisa-trie/v0_1_5/tests/ |
| vector-test.cc | 224 const bool bit = (std::rand() % 2) == 0; local
225 bits[i] = bit;
226 bv.push_back(bit);
227 (bit ? ones : zeros).push_back(i);
|
| /external/chromium_org/v8/tools/ |
| generate-ten-powers.scm | 43 (define (bit-lshbx::bignum x::bignum by::bint)
48 (define (bit-rshbx::bignum x::bignum by::bint)
57 (define max-container (- (bit-lshbx #z1 nb-bits) 1))
65 (-bx (bit-lshbx #z1
70 (bit-lshbx #z1
73 (cut (bit-rshbx (round n) shift))
74 (exact? (=bx n (bit-lshbx cut shift))))
93 (max-container (- (bit-lshbx #z1 nb-bits) 1)))
116 (loop i ten^i (bit-lshbx two^e 1) (+fx e 1)))))
122 (n (bit-lshbx #z1 (-fx nb-bits 1))
[all...] |
| /external/v8/tools/ |
| generate-ten-powers.scm | 43 (define (bit-lshbx::bignum x::bignum by::bint)
48 (define (bit-rshbx::bignum x::bignum by::bint)
57 (define max-container (- (bit-lshbx #z1 nb-bits) 1))
65 (-bx (bit-lshbx #z1
70 (bit-lshbx #z1
73 (cut (bit-rshbx (round n) shift))
74 (exact? (=bx n (bit-lshbx cut shift))))
93 (max-container (- (bit-lshbx #z1 nb-bits) 1)))
116 (loop i ten^i (bit-lshbx two^e 1) (+fx e 1)))))
122 (n (bit-lshbx #z1 (-fx nb-bits 1))
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/modes/gcm/ |
| Tables1kGCMExponentiator.java | 27 int bit = 0; local
32 ensureAvailable(bit);
33 GCMUtil.multiply(y, (byte[])lookupPowX2.elementAt(bit));
35 ++bit;
42 private void ensureAvailable(int bit)
45 if (count <= bit)
54 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/chromium_org/third_party/mesa/src/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/chromium_org/third_party/openssl/openssl/crypto/bn/ |
| bn_rand.c | 121 int ret=0,bit,bytes,mask; local
131 bit=(bits-1)%8;
132 mask=0xff<<(bit+1);
181 if (bit == 0)
188 buf[0]|=(3<<(bit-1));
193 buf[0]|=(1<<bit);
197 if (bottom) /* set bottom bit if requested */
251 * so 3*range (= 11..._2) is exactly one bit longer than range */
|
| /external/chromium_org/third_party/skia/src/utils/ |
| SkPathUtils.cpp | 34 int bit = x & 7; local
36 return buffer[byte] & (128 >> bit);
|
| /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/vp9/decoder/ |
| vp9_dboolhuff.h | 42 unsigned int bit = 0; local
62 bit = 1;
75 return bit;
83 int z = 0, bit; local
85 for (bit = bits - 1; bit >= 0; bit--)
86 z |= vp9_read_bit(br) << bit;
|
| vp9_read_bit_buffer.h | 41 const int bit = (rb->bit_buffer[p] & (1 << q)) >> q; local
43 return bit;
48 int value = 0, bit; local
49 for (bit = bits - 1; bit >= 0; bit--)
50 value |= vp9_rb_read_bit(rb) << bit;
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_boolhuff.h | 32 // Variables used to track bit costs without outputing to the bitstream
44 static void vp9_write(vp9_writer *br, int bit, int probability) {
54 if (bit)
66 if (bit) {
103 static void vp9_write_bit(vp9_writer *w, int bit) {
104 vp9_write(w, bit, 128); // vp9_prob_half
108 int bit; local
110 for (bit = bits - 1; bit >= 0; bit--
[all...] |
| /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/openssl/crypto/bn/ |
| bn_rand.c | 121 int ret=0,bit,bytes,mask; local
131 bit=(bits-1)%8;
132 mask=0xff<<(bit+1);
181 if (bit == 0)
188 buf[0]|=(3<<(bit-1));
193 buf[0]|=(1<<bit);
197 if (bottom) /* set bottom bit if requested */
251 * so 3*range (= 11..._2) is exactly one bit longer than range */
|
| /external/qemu/distrib/sdl-1.2.15/src/video/photon/ |
| SDL_ph_mouse.c | 55 unsigned char bit, databit, maskbit; local
94 for (bit = 0; bit < 8; bit++)
96 databit = data[i] & (1 << bit);
97 maskbit = mask[i] & (1 << bit);
|
| /external/skia/src/utils/ |
| SkPathUtils.cpp | 34 int bit = x & 7; local
36 return buffer[byte] & (128 >> bit);
|
| /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;
|
| /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/chromium_org/chrome/installer/tools/ |
| validate_installation_main.cc | 128 int bit; member in struct:__anon9229::ProductData
151 if ((type & product_data.bit) != 0) {
|
| /external/chromium_org/third_party/icu/source/test/letest/ |
| cmaps.cpp | 18 // Finds the high bit by binary searching
23 le_uint8 bit = 0; local
27 bit += 16;
32 bit += 8;
37 bit += 4;
42 bit += 2;
47 bit += 1;
50 return bit;
167 le_uint8 bit = highBit(nGroups); local
168 fPower = 1 << bit;
[all...] |
