| /bootable/bootloader/legacy/arch_msm7k/ |
| vic.c | 77 unsigned reg, bit; local
80 bit = 1 << (n & 31);
82 writel(readl(reg) | bit, reg);
87 unsigned reg, bit; local
90 bit = 1 << (n & 31);
92 writel(bit, reg);
97 unsigned reg, bit, tmp; local
100 bit = 1 << (n & 31);
104 writel(tmp | bit, reg);
106 writel(tmp & (~bit), reg)
[all...] |
| /development/simulator/wrapsim/ |
| BitVector.c | 4 * Simple bit vector.
17 * Allocate a bit vector with enough space to hold at least the specified
25 assert(sizeof(bv->storage[0]) == 4); /* assuming 32-bit units */
52 * "Allocate" the first-available bit in the bitmap.
63 int word, bit; local
71 bit = ffs(pBits->storage[word]) -1;
72 assert(bit >= 0 && bit < 32);
73 pBits->storage[word] &= ~(1 << bit);
74 return (word << 5) | bit;
[all...] |
| /external/ppp/android/ |
| ip-up-vpn.c | 59 uint32_t bit = ntohl(*netmask); local
60 bit = htonl(bit ^ (1 << 31 | bit >> 1));
61 if (bit) {
62 *netmask |= bit;
66 *address ^= bit;
|
| /frameworks/base/media/libstagefright/codecs/amrwbenc/src/ |
| bits.c | 20 Description: Performs bit stream manipulation
36 Word16 coding_mode, /* i: coding bit-stream ratio mode */
37 Word16 mode, /* i: coding bit-stream ratio mode*/
193 Word16 i, bit;
local
197 bit = (Word16) (value & 0x0001); /* get lsb */
198 if (bit == 0)
|
| /bionic/libc/kernel/arch-sh/asm/ |
| push-switch.h | 37 unsigned int bit; member in struct:push_switch_platform_info
|
| /external/bouncycastle/src/main/java/org/bouncycastle/crypto/modes/gcm/ |
| GCMUtil.java | 17 // P is the value with only bit i=1 set
41 int bit = 0; local
45 block[i] = (byte) ((b >>> 1) | bit);
50 bit = (b & 1) << 7;
57 int bit = 0; local
61 block[i] = (b >>> 1) | bit;
66 bit = b << 31;
|
| /external/icu4c/layout/ |
| CoverageTables.cpp | 45 le_uint8 bit = OpenTypeUtilities::highBit(count); local
46 le_uint16 power = 1 << bit;
|
| OpenTypeUtilities.cpp | 15 // Finds the high bit by binary searching
24 le_uint8 bit = 0; local
28 bit += 16;
33 bit += 8;
38 bit += 4;
43 bit += 2;
48 bit += 1;
51 return bit;
56 le_uint8 bit = highBit(recordCount); local
57 le_int32 power = 1 << bit;
83 le_uint8 bit = highBit(recordCount); local
[all...] |
| /external/icu4c/layoutex/ |
| LXUtilities.cpp | 14 // Finds the high bit by binary searching
23 le_int8 bit = 0; local
27 bit += 16;
32 bit += 8;
37 bit += 4;
42 bit += 2;
47 bit += 1;
50 return bit;
|
| /external/libvpx/vp8/encoder/ |
| boolhuff.c | 77 void vp8_encode_bool(BOOL_CODER *br, int bit, int probability)
88 if (bit)
100 if (bit)
143 int bit; local
145 for (bit = bits - 1; bit >= 0; bit--)
146 vp8_encode_bool(br, (1 & (data >> bit)), 0x80);
|
| /external/bzip2/ |
| unzcrash.c | 6 and then repeatedly decompress it, each time with a different bit of
7 the compressed data inverted, so as to test all possible one-bit errors.
64 void flip_bit ( int bit )
66 int byteno = bit / 8;
67 int bitno = bit % 8;
69 //fprintf ( stderr, "(byte %d bit %d mask %d)",
78 int bit; local
102 for (bit = 0; bit < nZ*8; bit++)
[all...] |
| /external/openssl/crypto/bn/ |
| bn_rand.c | 121 int ret=0,bit,bytes,mask; local
131 bit=(bits-1)%8;
132 mask=0xff<<(bit+1);
181 if (bit == 0)
188 buf[0]|=(3<<(bit-1));
193 buf[0]|=(1<<bit);
197 if (bottom) /* set bottom bit if requested */
251 * so 3*range (= 11..._2) is exactly one bit longer than range */
|
| /external/qemu/distrib/sdl-1.2.12/src/video/photon/ |
| SDL_ph_mouse.c | 55 unsigned char bit, databit, maskbit; local
94 for (bit = 0; bit < 8; bit++)
96 databit = data[i] & (1 << bit);
97 maskbit = mask[i] & (1 << bit);
|
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| AtomicMarkableReference.java | 11 * along with a mark bit, that can be updated atomically.
25 private final boolean bit; field in class:AtomicMarkableReference.ReferenceBooleanPair
27 reference = r; bit = i;
59 return atomicRef.get().bit;
72 markHolder[0] = p.bit;
98 expectedMark == current.bit &&
99 ((newReference == current.reference && newMark == current.bit) ||
123 expectedMark == current.bit &&
124 ((newReference == current.reference && newMark == current.bit) ||
138 if (newReference != current.reference || newMark != current.bit)
[all...] |
| /dalvik/dx/src/com/android/dx/util/ |
| Bits.java | 20 * Utilities for treating {@code int[]}s as bit sets.
31 * Constructs a bit set to contain bits up to the given index (exclusive).
33 * @param max {@code >= 0;} the maximum bit index (exclusive)
42 * Gets the maximum index (exclusive) for the given bit set.
44 * @param bits {@code non-null;} bit set in question
52 * Gets the value of the bit at the given index.
54 * @param bits {@code non-null;} bit set to operate on
55 * @param idx {@code >= 0, < getMax(set);} which bit
56 * @return the value of the indicated bit
60 int bit = 1 << (idx & 0x1f) local
73 int bit = 1 << (idx & 0x1f); local
90 int bit = 1 << (idx & 0x1f); local
102 int bit = 1 << (idx & 0x1f); local
[all...] |
| /external/chromium/third_party/icu/source/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/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/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...] |
| /frameworks/base/libs/rs/ |
| rsUtils.h | 65 uint32_t bit = 0; local
67 bit++;
70 return bit;
|
| /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/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/ |
| libip6t_sctp.c | 139 int bit,
148 flag_info[i].flag_mask |= (1 << bit);
150 flag_info[i].flag |= (1 << bit);
165 flag_info[*flag_count].flag_mask |= (1 << bit);
167 flag_info[*flag_count].flag |= (1 << bit);
222 int bit; local
226 bit = p - sctp_chunk_names[i].valid_flags;
227 bit = 7 - bit;
230 &(einfo->flag_count), i, bit,
[all...] |
