| /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/boringssl/src/crypto/ec/ |
| wnaf.c | 155 int bit, next_bit, mask; local
175 bit = 1 << w; /* at most 128 */
176 next_bit = bit << 1; /* at most 256 */
210 if (window_val & bit) {
227 if (digit <= -bit || digit >= bit || !(digit & 1)) {
237 if (window_val != 0 && window_val != next_bit && window_val != bit) {
246 window_val += bit * BN_is_bit_set(scalar, j + w);
357 * (NB: maximum wNAF length is bit length plus one) */
730 * one point per bit
[all...] |
| /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::__anon8042::__anon8043
76 if (renderBits & bitInfos[infoNdx].bit)
90 ModifyBits bit; member in struct:deqp::gles31::Functional::__anon8042::__anon8044
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/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/libcxxabi/src/Unwind/ |
| AddressSpace.hpp | 159 /// Read a ULEB128 into a 64-bit word.
164 int bit = 0; local
173 if (bit >= 64 || b << bit >> bit != b) {
176 result |= b << bit;
177 bit += 7;
184 /// Read a SLEB128 into a 64-bit word.
189 int bit = 0; local
195 result |= ((byte & 0x7f) << bit);
[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/lldb/source/Plugins/Process/Utility/ |
| ARMUtils.h | 278 static inline uint32_t bit(const uint32_t val, const uint32_t msbit) function in namespace:lldb_private
320 const uint32_t i = bit(opcode, 26);
367 const uint32_t i = bit(opcode, 26);
|
| /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/spdy/ |
| 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...] |
| /external/pdfium/core/src/fxcrt/ |
| fx_basic_buffer.cpp | 404 int bit = (m_pData[m_BitPos / 8] & (1 << (7 - m_BitPos % 8))) ? 1 : 0; local
406 return bit;
|
| /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;
255 /* Add padding '1' bit and low-order zeros in last byte */
256 mask = 1 << (7 - bit);
258 /* If room for bit count, finish up with this block */
|
| /external/selinux/checkpolicy/test/ |
| dispol.c | 66 unsigned int bit; local
70 for (bit = 0; bit < sizeof(ops->perms)*8; bit++) {
71 if (!operation_perm_test(bit, ops->perms))
74 if (in_range && next_bit_in_range(bit, ops->perms)) {
77 } else if (next_bit_in_range(bit, ops->perms)) {
79 low_bit = bit;
85 value = ops->type<<8 | bit;
92 value = bit << 8
[all...] |
| /external/skia/src/images/ |
| bmpdecoderhelper.cpp | 305 int bit = w & 7; local
306 col = ((currVal >> (7 - bit)) & 1);
|
