| /external/elfutils/libcpu/ |
| i386_parse.h | 77 struct bitvalue *bit; member in union:YYSTYPE
|
| /external/icu4c/extra/scrptrun/ |
| scrptrun.cpp | 53 int8_t bit = 0; local
57 bit += 16;
62 bit += 8;
67 bit += 4;
72 bit += 2;
77 bit += 1;
80 return bit;
|
| /external/icu4c/samples/layout/ |
| cmaps.cpp | 24 // Finds the high bit by binary searching
29 le_uint8 bit = 0; local
33 bit += 16;
38 bit += 8;
43 bit += 4;
48 bit += 2;
53 bit += 1;
56 return bit;
173 le_uint8 bit = highBit(nGroups); local
174 fPower = 1 << bit;
[all...] |
| /external/icu4c/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...] |
| /external/libsepol/src/ |
| genusers.c | 41 unsigned lineno = 0, islist = 0, bit; local
161 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
162 if (ebitmap_node_get_bit(rnode, bit))
164 (&usrdatum->roles.roles, bit, 1)) {
|
| users.c | 24 unsigned bit; local
35 ebitmap_for_each_bit(roles, rnode, bit) {
36 if (ebitmap_node_get_bit(rnode, bit)) {
37 char *role = policydb->p_role_val_to_name[bit];
121 unsigned bit; local
170 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
171 if (ebitmap_node_get_bit(rnode, bit)) {
173 (&(usrdatum->roles.roles), bit, 1))
|
| /external/yaffs2/yaffs2/ |
| yaffs_ecc.c | 20 * The two unused bit are set to 1.
21 * The ECC can correct single bit errors in a 256-byte page of data. Thus, two such ECC
29 * Bit 0 of each entry indicates whether the entry has an odd or even parity, and therefore
188 /* Single bit (recoverable) error in data */
191 unsigned bit; local
202 bit = byte = 0;
222 bit |= 0x04;
224 bit |= 0x02;
226 bit |= 0x01;
228 data[byte] ^= (1 << bit);
289 unsigned bit; local
[all...] |
| /dalvik/vm/alloc/TEST/HeapBitmapTest/ |
| main.c | 211 unsigned long bit; local
219 bit = dvmHeapBitmapSetAndReturnObjectBit(&hb, HEAP_BASE);
220 assert(bit == 0);
239 bit = dvmHeapBitmapSetAndReturnObjectBit(&hb, HEAP_BASE);
240 assert(bit != 0);
259 bit = dvmHeapBitmapSetAndReturnObjectBit(&hb,
261 assert(bit == 0);
280 bit = dvmHeapBitmapSetAndReturnObjectBit(&hb,
282 assert(bit != 0);
|
| /external/bluetooth/bluez/sbc/ |
| sbctester.c | 42 unsigned short bit; local
48 /* Bit 0 is MSB */
55 /* Bit 15 is LSB */
57 bit = (unsigned short) sample16;
58 bit >>= 15 - i;
59 bit %= 2;
62 printf("%d", bit);
64 if (bit)
|
| /external/chromium/net/base/ |
| dnssec_unittest.cc | 80 // The is root's 1024-bit key.
92 // The is root's 2048-bit key.
594 unsigned bit = bit_to_flip & 7; local
[all...] |
| /external/clang/test/Sema/ |
| constant-conversion.c | 18 struct { int bit : 1; } a; member in struct:__anon5587
19 a.bit = 1; // shouldn't warn
|
| /external/grub/netboot/ |
| 3c595.c | 37 int bit; member in struct:connector_entry
357 if (vx_connectors & conn_tab[k].bit) {
398 if ((vx_connectors & conn_tab[vx_connector].bit) == 0) {
|
| /external/iptables/extensions/ |
| libxt_sctp.c | 123 int bit,
132 flag_info[i].flag_mask |= (1 << bit);
134 flag_info[i].flag |= (1 << bit);
149 flag_info[*flag_count].flag_mask |= (1 << bit);
151 flag_info[*flag_count].flag |= (1 << bit);
205 int bit; local
209 bit = p - sctp_chunk_names[i].valid_flags;
210 bit = 7 - bit;
213 &(einfo->flag_count), i, bit,
[all...] |
| /external/kernel-headers/original/asm-mips/ |
| bitops.h | 49 * set_bit - Atomically set a bit in memory
50 * @nr: the bit to set
61 unsigned short bit = nr & SZLONG_MASK; local
73 : "ir" (1UL << bit), "m" (*m));
75 } else if (__builtin_constant_p(bit)) {
85 : "ir" (bit), "m" (*m), "r" (~0));
99 : "ir" (1UL << bit), "m" (*m));
106 mask = 1UL << bit;
114 * clear_bit - Clears a bit in memory
115 * @nr: Bit to clea
126 unsigned short bit = nr & SZLONG_MASK; local
203 unsigned short bit = nr & SZLONG_MASK; local
258 unsigned short bit = nr & SZLONG_MASK; local
328 unsigned short bit = nr & SZLONG_MASK; local
395 unsigned short bit = nr & SZLONG_MASK; local
485 unsigned short bit = nr & SZLONG_MASK; local
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeEmitterGen.cpp | 12 // returns the (currently, 32-bit unsigned) value of the instruction.
47 for (unsigned bit = 0, end = numBits / 2; bit != end; ++bit) {
48 unsigned bitSwapIdx = numBits - bit - 1;
49 Init *OrigBit = BI->getBit(bit);
51 NewBits[bit] = BitSwap;
67 // If the VarBitInit at position 'bit' matches the specified variable then
68 // return the variable bit position. Otherwise return -1.
70 BitsInit *BI, int bit) {
90 int bit = BI->getNumBits()-1; local
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/video/ |
| SDL_blit_0.c | 48 Uint8 byte = 0, bit; local
53 bit = (byte&0x80)>>7;
55 *dst = map[bit];
65 Uint8 byte = 0, bit; local
70 bit = (byte&0x80)>>7;
72 *dst = bit;
101 Uint8 byte = 0, bit; local
106 bit = (byte&0x80)>>7;
108 *dst = map[bit];
135 Uint8 byte = 0, bit; local
173 Uint8 byte = 0, bit; local
207 Uint8 byte = 0, bit; local
224 Uint8 byte = 0, bit; local
259 Uint8 byte = 0, bit; local
292 Uint8 byte = 0, bit; local
326 Uint8 byte = 0, bit; local
362 Uint8 byte = 0, bit; local
409 Uint8 byte = 0, bit; local
[all...] |
| /external/sonivox/arm-fm-22k/lib_src/ |
| eas_smf.c | 619 EAS_U32 bit = (EAS_U32) value; local
620 bit = (bit << JET_EVENT_SEG_SHIFT) & JET_EVENT_SEG_MASK;
625 i << JET_EVENT_TRACK_SHIFT | bit | MIDI_FLAGS_JET_CB;
634 EAS_U32 bit = (EAS_U32) value; local
637 if (bit & 1)
641 bit >>= 1;
756 /* read until bit 7 is zero */
[all...] |
| /external/sonivox/arm-hybrid-22k/lib_src/ |
| eas_smf.c | 619 EAS_U32 bit = (EAS_U32) value; local
620 bit = (bit << JET_EVENT_SEG_SHIFT) & JET_EVENT_SEG_MASK;
625 i << JET_EVENT_TRACK_SHIFT | bit | MIDI_FLAGS_JET_CB;
634 EAS_U32 bit = (EAS_U32) value; local
637 if (bit & 1)
641 bit >>= 1;
756 /* read until bit 7 is zero */
[all...] |
| /external/sonivox/arm-wt-22k/lib_src/ |
| eas_smf.c | 624 EAS_U32 bit = (EAS_U32) value; local
625 bit = (bit << JET_EVENT_SEG_SHIFT) & JET_EVENT_SEG_MASK;
630 i << JET_EVENT_TRACK_SHIFT | bit | MIDI_FLAGS_JET_CB;
639 EAS_U32 bit = (EAS_U32) value; local
642 if (bit & 1)
646 bit >>= 1;
761 /* read until bit 7 is zero */
[all...] |
| /external/speex/libspeex/ |
| bits.c | 4 Handles bit packing/unpacking
43 /* Maximum size of the bit-stream (for fixed-size allocation) */
256 int bit; local
257 bit = (d>>(nbBits-1))&1;
258 bits->chars[bits->charPtr] |= bit<<(BITS_PER_CHAR-1-bits->bitPtr);
|
| /external/valgrind/main/coregrind/m_initimg/ |
| simple_huffman.c | 12 * - Slow bit stream implementation
18 * an unsigned 32-bit integer).
22 * 12 bits per symbol (for 8 bit symbols), meaning a maximum of 384
108 UInt x, bit, count; local
113 bit = stream->BitPos;
119 x = (x<<1) + (*buf & (1<<(7-bit)) ? 1 : 0);
120 bit = (bit+1) & 7;
121 if( !bit )
129 stream->BitPos = bit;
142 UInt bit, count; local
[all...] |
| /external/valgrind/main/memcheck/tests/ppc32/ |
| power_ISA2_05.c | 16 int bit = val & 1; local
17 sum = sum + bit * scale;
141 /* The contents of FRB with bit set 0 set to bit 0 of FRA copied into FRT */
223 int bit = val & 1; local
224 sum = sum + bit * scale;
348 /* The contents of FRB with bit set 0 set to bit 0 of FRA copied into FRT */
430 int bit = val & 1; local
431 sum = sum + bit * scale
637 int bit = val & 1; local
844 int bit = val & 1; local
[all...] |
| /external/valgrind/main/memcheck/tests/ppc64/ |
| power_ISA2_05.c | 16 int bit = val & 1; local
17 sum = sum + bit * scale;
141 /* The contents of FRB with bit set 0 set to bit 0 of FRA copied into FRT */
223 int bit = val & 1; local
224 sum = sum + bit * scale;
348 /* The contents of FRB with bit set 0 set to bit 0 of FRA copied into FRT */
430 int bit = val & 1; local
431 sum = sum + bit * scale
637 int bit = val & 1; local
844 int bit = val & 1; local
[all...] |
| /external/zlib/examples/ |
| enough.c | 27 the bit values to the codes (i.e. only canonical codes are counted).
31 be coded, what the last code length used was, and how many bit patterns of
36 properties are: we cannot use more bit patterns than are available; and when
37 all the symbols are used, there are exactly zero possible bit patterns
48 that root-bit prefix. If that longest code has length len, then the table
50 codes. Each subsequent root-bit prefix then has its own sub-table. The
52 incrementally as the number of codes at each bit length is populated. When
71 Second, the intermediate states that lead to (root + 1) bit or longer codes
77 Beginning the code examination at (root + 1) bit codes, which is enabled by
83 for the default arguments of 286 symbols limited to 15-bit codes
259 int bit; \/* mask for this state's bit *\/ local
[all...] |
| /frameworks/rs/ |
| rsUtils.h | 85 uint32_t bit = 0; local
87 bit++;
90 return bit;
|
