| /external/arduino/hardware/arduino/cores/arduino/ |
| wiring.h | 96 #define bitRead(value, bit) (((value) >> (bit)) & 0x01)
97 #define bitSet(value, bit) ((value) |= (1UL << (bit)))
98 #define bitClear(value, bit) ((value) &= ~(1UL << (bit)))
99 #define bitWrite(value, bit, bitvalue) (bitvalue ? bitSet(value, bit) : bitClear(value, bit))
104 #define bit(b) (1UL << (b) macro
[all...] |
| /external/blktrace/ |
| blkrawverify.c | 104 static void dump_trace(FILE *ofp, char *prefix, struct blk_io_trace *bit)
107 fprintf(ofp, " %8s: %08x\n", "magic", bit->magic);
108 fprintf(ofp, " %8s: %u\n", "sequence", bit->sequence);
109 fprintf(ofp, " %8s: %llu\n", "time", (unsigned long long) bit->time);
110 fprintf(ofp, " %8s: %llu\n", "sector", (unsigned long long) bit->sector);
111 fprintf(ofp, " %8s: %u\n", "bytes", bit->bytes);
112 fprintf(ofp, " %8s: %s\n", "action", act_to_str(bit->action));
113 fprintf(ofp, " %8s: %u\n", "bytes", bit->bytes);
114 fprintf(ofp, " %8s: %u\n", "cpu", bit->cpu);
115 fprintf(ofp, " %8s: %u\n", "error", bit->error)
148 struct blk_io_trace *bit = malloc(sizeof(struct blk_io_trace)); local
[all...] |
| /external/chromium_org/third_party/icu/source/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/chromium_org/third_party/icu/source/i18n/ |
| regexcmp.cpp | 1397 int32_t bit = 0; local
[all...] |
| /external/chromium_org/third_party/icu/source/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/chromium_org/third_party/mesa/src/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/chromium_org/third_party/mesa/src/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/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/experimental/Intersection/ |
| ConvexHull_Test.cpp | 247 int pt, bit; local
272 for (bit = 0; bit < 4; ++bit) {
273 if (pts & 1 << bit) {
277 if (order[pt] == bit) {
280 if (cubic[order[pt]] == cubic[bit]) {
281 pts |= 1 << bit;
285 for (bit = 0; bit < 4; ++bit)
[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 | 445 int bit = (current_char & (kBitsPerByte - 1)); local
446 if ((b & (1 << bit)) != 0) {
|
| /external/deqp/framework/common/ |
| tcuFormatUtil.hpp | 77 deUint64 bit; member in class:tcu::Format::BitDesc
80 BitDesc (deUint64 bit_, const char* name_) : bit(bit_), name(name_) {}
83 #define TCU_BIT_DESC(BIT) tcu::Format::BitDesc(BIT, #BIT)
101 if (curDesc->bit & bitsLeft)
106 bitsLeft ^= curDesc->bit;
|
| /external/deqp/framework/referencerenderer/ |
| rrRasterizer.hpp | 42 //! Get coverage bit value.
60 //! Set bit in coverage mask.
63 const deUint64 bit = getCoverageBit(numSamples, x, y, sampleNdx); local
64 return val ? (mask | bit) : (mask & ~bit);
67 //! Get coverage bit value in mask.
79 //! Get position of first coverage bit of fragment - equivalent to deClz64(getCoverageFragmentSampleBits(numSamples, x, y)).
|
| /external/fio/lib/ |
| axmap.c | 7 * A set bit at layer N indicates a full word at layer N-1, and so forth. As
12 * Axmaps get pretty close to optimal (1 bit per block) space usage, since
142 unsigned int bit = index & BLOCKS_PER_UNIT_MASK; local
146 if (func(al, offset, bit, data))
163 unsigned int bit = index & BLOCKS_PER_UNIT_MASK; local
167 if (func(al, offset, bit, data))
175 unsigned int bit, void *unused)
177 if (!(al->map[offset] & (1UL << bit)))
180 al->map[offset] &= ~(1UL << bit);
217 unsigned int bit, void *__data
384 uint64_t bit; member in struct:axmap_next_free_data
[all...] |
| /external/icu/icu4c/source/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/icu/icu4c/source/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/icu/icu4c/source/test/letest/ |
| PortableFontInstance.cpp | 40 // Finds the high bit by binary searching
49 le_uint8 bit = 0; local
53 bit += 16;
58 bit += 8;
63 bit += 4;
68 bit += 2;
73 bit += 1;
76 return bit;
|
| /external/icu/icu4c/source/test/perf/leperf/ |
| PortableFontInstance.cpp | 40 // Finds the high bit by binary searching
49 le_uint8 bit = 0; local
53 bit += 16;
58 bit += 8;
63 bit += 4;
68 bit += 2;
73 bit += 1;
76 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/libcxxabi/src/Unwind/ |
| AddressSpace.hpp | 139 /// Read a ULEB128 into a 64-bit word.
144 int bit = 0; local
153 if (bit >= 64 || b << bit >> bit != b) {
156 result |= b << bit;
157 bit += 7;
164 /// Read a SLEB128 into a 64-bit word.
169 int bit = 0; local
175 result |= ((byte & 0x7f) << bit);
[all...] |
