| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/ |
| i915_program.c | 78 int bit = ffs(~p->temp_flag); local
79 if (!bit) {
84 p->temp_flag |= 1 << (bit - 1);
85 return UREG(REG_TYPE_R, (bit - 1));
92 int bit = ffs(~p->utemp_flag); local
93 if (!bit) {
98 p->utemp_flag |= 1 << (bit - 1);
99 return UREG(REG_TYPE_U, (bit - 1));
209 int bit = ffs(~live_regs); local
210 if (!bit) {
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| imports.c | 236 * Find the first bit set in a word.
241 register int bit = 0; local
244 bit += 16;
248 bit += 8;
252 bit += 4;
256 bit++;
259 bit++;
261 return bit;
266 * Find position of first bit set in given value.
267 * XXX Warning: this function can only be used on 64-bit systems
274 int bit; local
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/ec/ |
| ec_mult.c | 199 int bit, next_bit, mask; local
220 bit = 1 << w; /* at most 128 */
221 next_bit = bit << 1; /* at most 256 */
256 if (window_val & bit)
277 if (digit <= -bit || digit >= bit || !(digit & 1))
288 if (window_val != 0 && window_val != next_bit && window_val != bit)
298 window_val += bit * BN_is_bit_set(scalar, j + w);
417 * (NB: maximum wNAF length is bit length plus one) */
809 * one point per bit
[all...] |
| /external/chromium_org/third_party/opus/src/celt/ |
| rate.c | 52 /*Determines if V(N,K) fits in a 32-bit unsigned integer.
153 /* N=1 bands only have a sign bit and fine bits. */
323 In the first case, we'd be coding a bit to signal we're going to waste
325 In the second case, we'd be coding a bit to redistribute all the bits
329 /* Give the bit we reserved to end skipping back. */
366 /*We used a bit to skip this band.*/
377 /*If we have enough for a fine energy bit per channel, use it.*/
435 opus_int32 excess, bit; local
440 bit = (opus_int32)bits[j]+balance;
444 excess = MAX32(bit-cap[j],0)
[all...] |
| /external/chromium_org/third_party/skia/src/images/ |
| bmpdecoderhelper.cpp | 305 int bit = w & 7; local
306 col = ((currVal >> (7 - bit)) & 1);
|
| /external/chromium_org/third_party/smhasher/src/ |
| Bitvec.cpp | 99 // Bit-level manipulation
101 // These two are from the "Bit Twiddling Hacks" webpage
122 uint32_t getbit ( const void * block, int len, uint32_t bit )
126 int byte = bit >> 3;
127 bit = bit & 0x7;
129 if(byte < len) return (b[byte] >> bit) & 1;
134 uint32_t getbit_wrap ( const void * block, int len, uint32_t bit )
138 int byte = bit >> 3;
139 bit = bit & 0x7
359 uint32_t bit = getbit(blob,len,nbits-1); local
454 uint32_t bit = getbit(blob,len,0); local
[all...] |
| /external/chromium_org/v8/src/ |
| interpreter-irregexp.cc | 482 int bit = (current_char & (kBitsPerByte - 1)); local
483 if ((b & (1 << bit)) != 0) {
|
| /external/grub/netboot/ |
| otulip.c | 91 unsigned bit, csr; local
100 for (bit = 3 + SROM_BITWIDTH + 16; bit > 0; bit--) {
120 unsigned lastbit, data, bits, bit, csr; local
127 for (bits = idx|cmdmask, bit = bitwidth + 3; bit > 0; bit--, bits <<= 1)
|
| /external/icu4c/common/ |
| usc_impl.c | 122 int8_t bit = 0; local
130 bit += 16;
135 bit += 8;
140 bit += 4;
145 bit += 2;
150 bit += 1;
153 return bit;
|
| /external/icu4c/i18n/ |
| regexcmp.cpp | 1439 int32_t bit = 0; local
[all...] |
| scriptset.cpp | 70 uint32_t bit = 1 << (script & 31); local
71 return ((bits[index] & bit) != 0);
84 uint32_t bit = 1 << (script & 31); local
85 bits[index] |= bit;
98 uint32_t bit = 1 << (script & 31); local
99 bits[index] &= ~bit;
160 // This bit counter is good for sparse numbers of '1's, which is
167 x &= (x - 1); // and off the least significant one bit.
|
| /external/icu4c/test/letest/ |
| PortableFontInstance.cpp | 28 // Finds the high bit by binary searching
37 le_uint8 bit = 0; local
41 bit += 16;
46 bit += 8;
51 bit += 4;
56 bit += 2;
61 bit += 1;
64 return bit;
|
| /external/iputils/ |
| ping_common.h | 106 #define A(bit) (rcvd_tbl.bitmap[(bit) >> BITMAP_SHIFT]) /* identify word in array */
107 #define B(bit) (((bitmap_t)1) << ((bit) & ((1 << BITMAP_SHIFT) - 1))) /* identify bit in word */
111 unsigned bit = seq % MAX_DUP_CHK; local
112 A(bit) |= B(bit);
117 unsigned bit = seq % MAX_DUP_CHK; local
118 A(bit) &= ~B(bit)
123 unsigned bit = seq % MAX_DUP_CHK; local
[all...] |
| /external/jmonkeyengine/engine/src/android/jme3tools/android/ |
| Fixed.java | 335 int bit = 0x40000000; local
336 while (bit >= 0x100) { // lower values give more accurate results
337 long tmp = sum | bit;
340 sum = tmp + bit;
342 bit >>= 1;
|
| /external/llvm/utils/TableGen/ |
| CodeEmitterGen.cpp | 12 // returns the (currently, 32-bit unsigned) value of the instruction.
47 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
70 for (unsigned bit = 0, end = numBits / 2; bit != end; ++bit) {
71 unsigned bitSwapIdx = numBits - bit - 1;
72 Init *OrigBit = BI->getBit(bit);
74 NewBits[bit] = BitSwap;
90 // If the VarBitInit at position 'bit' matches the specified variable then
91 // return the variable bit position. Otherwise return -1
113 int bit = BI->getNumBits()-1; local
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_rast_debug.c | 361 int bit = tile.coverage/(64.0*64.0)*10; local
362 debug_printf("%c", bits[MIN2(bit,10)]);
|
| /external/mesa3d/src/glx/ |
| glxextensions.c | 47 #define EXT_ENABLED(bit,supported) (IS_SET( supported, bit ))
55 unsigned char bit; member in struct:extension_info
255 /* global bit-fields of available extensions and their characteristics */
303 SET_BIT(supported, ext[i].bit);
306 CLR_BIT(supported, ext[i].bit);
319 * Convert the server's extension string to a bit-field.
322 * \param server_support Bit-field of supported extensions.
326 * bit-fields used to track each of these have different sizes. Therefore,
345 /* Set the bit for the extension in the server_support table
394 const unsigned bit = known_glx_extensions[i].bit; local
414 const unsigned bit = known_gl_extensions[i].bit; local
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i915/ |
| i915_program.c | 78 int bit = ffs(~p->temp_flag); local
79 if (!bit) {
84 p->temp_flag |= 1 << (bit - 1);
85 return UREG(REG_TYPE_R, (bit - 1));
92 int bit = ffs(~p->utemp_flag); local
93 if (!bit) {
98 p->utemp_flag |= 1 << (bit - 1);
99 return UREG(REG_TYPE_U, (bit - 1));
209 int bit = ffs(~live_regs); local
210 if (!bit) {
[all...] |
| /external/mesa3d/src/mesa/main/ |
| imports.c | 236 * Find the first bit set in a word.
241 register int bit = 0; local
244 bit += 16;
248 bit += 8;
252 bit += 4;
256 bit++;
259 bit++;
261 return bit;
266 * Find position of first bit set in given value.
267 * XXX Warning: this function can only be used on 64-bit systems
274 int bit; local
[all...] |
| /external/openssl/crypto/ec/ |
| ec_mult.c | 199 int bit, next_bit, mask; local
220 bit = 1 << w; /* at most 128 */
221 next_bit = bit << 1; /* at most 256 */
256 if (window_val & bit)
277 if (digit <= -bit || digit >= bit || !(digit & 1))
288 if (window_val != 0 && window_val != next_bit && window_val != bit)
298 window_val += bit * BN_is_bit_set(scalar, j + w);
417 * (NB: maximum wNAF length is bit length plus one) */
809 * one point per bit
[all...] |
| /external/ppp/pppd/ |
| md4.c | 31 ** This implementation assumes that ints are 32-bit quantities.
72 ** operator will shift in zeros rather than extending the sign bit.
214 unsigned int i, tmp, bit, byte, mask; local
250 bit = count & 7;
254 /* Add padding '1' bit and low-order zeros in last byte */
255 mask = 1 << (7 - bit);
257 /* If room for bit count, finish up with this block */
|
| /external/skia/src/images/ |
| bmpdecoderhelper.cpp | 305 int bit = w & 7; local
306 col = ((currVal >> (7 - bit)) & 1);
|
| /external/tcpdump/ |
| print-ospf6.c | 45 u_int32_t bit; member in struct:bits
123 if (options & bp->bit) {
127 } while ((++bp)->bit);
|
| /external/tremolo/Tremolo/ |
| codebook.c | 98 /* 32 bit float (not IEEE; nonnormalized mantissa +
167 int bit=(entry>>(length-j-1))&1; local
174 if (chase < 0 || chase >= n || chase*2+bit > n*2+1) return 1;
175 if(!r[chase*2+bit])
176 r[chase*2+bit]=top;
177 chase=r[chase*2+bit];
181 int bit=(entry>>(length-j-1))&1; local
186 r[chase*2+bit]= decpack(i,count++,quantvals,b,opb,maptype) |
226 * This probably wastes a bit of space, but it shouldn't
478 /* this is the correct boundary here; we lose one bit t
660 int bit=(lok>>i)&1; local
690 int bit=(lok>>i)&1; local
[all...] |
| mdct.c | 251 int bit = 0; local
255 DATA_TYPE b = bitrev12(bit++);
|
