| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| WalkingIterator.java | 95 int bit = walker.getAnalysisBits(); local
96 bits |= bit;
|
| /external/autotest/client/site_tests/hardware_Keyboard/src/ |
| evtest.c | 305 #define BIT(x) (1UL<<OFF(x))
307 #define test_bit(bit, array) ((array[LONG(bit)] >> OFF(bit)) & 1)
352 unsigned long bit[EV_MAX][NBITS(KEY_MAX)];
local
355 ioctl(fd, EVIOCGBIT(EV_KEY, KEY_MAX), bit[EV_KEY]);
356 if (test_bit(keycode, bit[EV_KEY])) {
374 unsigned long bit[EV_MAX][NBITS(KEY_MAX)];
local
375 memset(bit, 0, sizeof(bit));
397 unsigned long bit[EV_MAX][NBITS(KEY_MAX)]; local
491 unsigned long bit[EV_MAX][NBITS(KEY_MAX)]; local
[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/curl/src/ |
| tool_paramhlp.c | 252 long bit; member in struct:sprotos
316 *val &= ~(pp->bit);
319 *val |= pp->bit;
322 *val = pp->bit;
|
| /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/deqp/modules/gles31/functional/ |
| es31fTextureBufferTests.cpp | 59 RenderBits bit; member in struct:deqp::gles31::Functional::__anon11273::__anon11274
76 if (renderBits & bitInfos[infoNdx].bit)
90 ModifyBits bit; member in struct:deqp::gles31::Functional::__anon11273::__anon11275
107 if (modifyBits & bitInfos[infoNdx].bit)
|
| /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 | 1453 int32_t bit = 0; local
[all...] |
| scriptset.cpp | 69 uint32_t bit = 1 << (script & 31); local
70 return ((bits[index] & bit) != 0);
83 uint32_t bit = 1 << (script & 31); local
84 bits[index] |= bit;
97 uint32_t bit = 1 << (script & 31); local
98 bits[index] &= ~bit;
159 // This bit counter is good for sparse numbers of '1's, which is
166 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/jemalloc/include/jemalloc/internal/ |
| bitmap.h | 4 /* Maximum bitmap bit count is 2^LG_BITMAP_MAXBITS. */
127 bool bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
128 void bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
130 void bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
154 bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit)
159 assert(bit < binfo->nbits);
160 goff = bit >> LG_BITMAP_GROUP_NBITS;
162 return (!(g & (ZU(1) << (bit & BITMAP_GROUP_NBITS_MASK))));
166 bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit)
172 assert(bit < binfo->nbits)
204 size_t bit; local
[all...] |
| /external/libjpeg-turbo/ |
| jcdctmgr.c | 78 * Find the highest bit in an integer through binary search.
84 int bit; local
86 bit = 16;
92 bit -= 8;
96 bit -= 4;
100 bit -= 2;
104 bit -= 1;
108 return bit;
200 /* fq will be one bit too large to fit in DCTELEM, so adjust */
566 * The maximum coefficient size is +-16K (for 12-bit data), so thi
[all...] |
| /external/libopus/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/libunwind_llvm/src/ |
| AddressSpace.hpp | 166 /// Read a ULEB128 into a 64-bit word.
171 int bit = 0; local
180 if (bit >= 64 || b << bit >> bit != b) {
183 result |= b << bit;
184 bit += 7;
191 /// Read a SLEB128 into a 64-bit word.
196 int bit = 0; local
202 result |= ((byte & 0x7f) << bit);
[all...] |
| /external/libvpx/libvpx/third_party/libwebm/ |
| mkvmuxerutil.cpp | 215 // Doubling the requested value ensures positive values with their high bit
377 const uint64 bit = 1LL << (size * 7); local
379 if (value > (bit - 2))
382 value |= bit;
385 int64 bit; local
388 bit = 1LL << (size * 7);
389 const uint64 max = bit - 2;
400 value |= bit;
538 // is a signed, 16-bit integer). However, as a simplification we
|
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/ |
| LZMADecoder.java | 168 int bit; local
173 bit = rc.decodeBit(probs, offset + matchBit + symbol);
174 symbol = (symbol << 1) | bit;
175 offset &= (0 - bit) ^ ~matchBit;
|
| /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/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/framed/ |
| Settings.java | 94 int bit = 1 << id; local
95 set |= bit;
97 persistValue |= bit;
99 persistValue &= ~bit;
102 persisted |= bit;
104 persisted &= ~bit;
113 int bit = 1 << id; local
114 return (set & bit) != 0;
137 int bit = 1 << UPLOAD_BANDWIDTH; local
138 return (bit & set) != 0 ? values[UPLOAD_BANDWIDTH] : defaultValue
143 int bit = 1 << HEADER_TABLE_SIZE; local
149 int bit = 1 << DOWNLOAD_BANDWIDTH; local
156 int bit = 1 << ENABLE_PUSH; local
162 int bit = 1 << ROUND_TRIP_TIME; local
168 int bit = 1 << MAX_CONCURRENT_STREAMS; local
174 int bit = 1 << CURRENT_CWND; local
180 int bit = 1 << MAX_FRAME_SIZE; local
186 int bit = 1 << DOWNLOAD_RETRANS_RATE; local
192 int bit = 1 << MAX_HEADER_LIST_SIZE; local
197 int bit = 1 << INITIAL_WINDOW_SIZE; local
203 int bit = 1 << CLIENT_CERTIFICATE_VECTOR_SIZE; local
209 int bit = 1 << FLOW_CONTROL_OPTIONS; local
219 int bit = 1 << id; local
225 int bit = 1 << id; local
[all...] |
