Searched defs:bit (Results 1 - 10 of 10) sorted by relevance

/system/sepolicy/tools/sepolicy-analyze/
H A Dattribute.c11 unsigned int bit; local
24 ebitmap_for_each_bit(&policydb->attr_type_map[attr->s.value - 1], n, bit) {
25 if (!ebitmap_node_get_bit(n, bit))
27 printf("%s\n", policydb->p_type_val_to_name[bit]);
H A Dperm.c10 unsigned int bit; local
15 ebitmap_for_each_bit(&policydb->permissive_map, n, bit)
17 if (ebitmap_node_get_bit(n, bit)) {
18 printf("%s\n", policydb->p_type_val_to_name[bit -1]);
H A Dneverallow.c30 unsigned int bit; local
144 for (bit = 0; bit < policydb->p_types.nprim; bit++) {
145 if (ebitmap_get_bit(&typeset->negset, bit))
147 if (policydb->type_val_to_struct[bit] &&
148 policydb->type_val_to_struct[bit]->flavor == TYPE_ATTRIB)
150 if (ebitmap_set_bit(&typeset->types, bit, 1))
155 ebitmap_for_each_bit(&typeset->negset, n, bit) {
156 if (!ebitmap_node_get_bit(n, bit))
[all...]
/system/core/include/cutils/
H A Dbitops.h39 * int bit = bitmask_ffz(resource_bits, num_resources);
40 * bitmask_set(resource_bits, bit);
42 * if (bitmask_test(resource_bits, bit)) { ... }
44 * bitmask_clear(resource_bits, bit);
61 int bit, result; local
65 bit = ffs(~bitmask[i]);
66 if (bit) {
68 bit--;
69 result = BITS_PER_WORD * i + bit;
88 static inline void bitmask_set(unsigned int *bitmask, int bit) argument
93 bitmask_clear(unsigned int *bitmask, int bit) argument
98 bitmask_test(unsigned int *bitmask, int bit) argument
[all...]
/system/core/libmincrypt/
H A Dp256.c28 // be portable 32-bit, although it's still constant-time.
58 int p256_get_bit(const p256_int* scalar, int bit) { argument
59 return (P256_DIGIT(scalar, bit / P256_BITSPERDIGIT)
60 >> (bit & (P256_BITSPERDIGIT - 1))) & 1;
185 // tmp might still be larger than MOD, yet same bit length.
/system/core/libpixelflinger/
H A Dfixed.cpp54 // shift right 1-bit to make room for the sign bit
112 GGLfixed bit = 0x800000; local
115 GGLfixed temp = bit + (r<<1);
119 r += bit;
123 } while (bit>>=1);
190 // we get 3.75 cycles per bit in the main loop
191 // and 8 cycles per bit in the termination loop
257 // first we compute a*b as a 64-bit integer
317 // this function computes a*b/c with 64-bit intermediat
[all...]
/system/bt/stack/btm/
H A Dbtm_ble_privacy.c142 UINT8 bit; local
147 bit = index % 8;
148 btm_cb.ble_ctr_cb.irk_list_mask[byte] &= (~(1 << bit));
165 UINT8 bit; local
170 bit = i % 8;
172 if ((btm_cb.ble_ctr_cb.irk_list_mask[byte] & (1 << bit)) == 0)
174 btm_cb.ble_ctr_cb.irk_list_mask[byte] |= (1 << bit);
/system/extras/ext4_utils/
H A Dext4_utils.c106 int bitmap_get_bit(u8 *bitmap, u32 bit) argument
108 if (bitmap[bit / 8] & (1 << (bit % 8)))
114 void bitmap_clear_bit(u8 *bitmap, u32 bit) argument
116 bitmap[bit / 8] &= ~(1 << (bit % 8));
H A Dallocate.c181 static int bitmap_set_bit(u8 *bitmap, u32 bit) argument
183 if (bitmap[bit / 8] & 1 << (bit % 8))
186 bitmap[bit / 8] |= 1 << (bit % 8);
190 static int bitmap_set_8_bits(u8 *bitmap, u32 bit) argument
192 int ret = bitmap[bit / 8];
193 bitmap[bit / 8] = 0xFF;
/system/media/audio_utils/
H A Dprimitives.c347 uint32_t bit, ormask; \
351 bit = ormask & -ormask; /* get lowest bit */ \
352 ormask ^= bit; /* remove lowest bit */ \
353 if (dmask & bit) { \
354 *dst++ = smask & bit ? *src++ : zero; \
470 uint32_t bit, ormask = src_mask | dst_mask; local
473 bit = ormask & -ormask; /* get lowest bit */
[all...]

Completed in 1457 milliseconds