HomeSort by relevance Sort by last modified time
    Searched refs:bit_index (Results 1 - 25 of 27) sorted by null

1 2

  /hardware/libhardware/modules/usbaudio/
format.c 89 int slot_index, bit_index, table_index; local
94 for (bit_index = 0; bit_index < bits_per_slot; bit_index++) {
177 int slot_index, bit_index, table_index; local
182 for (bit_index = 0; bit_index < bits_per_slot && table_index < table_size; bit_index++) {
logging.c 42 size_t slot_index, bit_index; local
46 for (bit_index = 0; bit_index < bits_per_slot; bit_index++) {
alsa_device_profile.c 253 int slot_index, bit_index, table_index; local
259 for (bit_index = 0;
260 bit_index < bits_per_slot && table_index < table_size;
261 bit_index++) {
  /external/chromium_org/components/rappor/
bloom_filter.cc 34 uint32_t bit_index = index % 8; local
35 bytes_[byte_index] |= 1 << bit_index;
  /external/openfst/src/extensions/ngram/
bitmap-index.cc 72 size_t BitmapIndex::Select1(size_t bit_index) const {
73 if (bit_index >= GetOnesCount()) return Bits();
75 uint32 rembits = bit_index + 1;
76 const uint32 block = find_primary_block(bit_index + 1);
92 size_t BitmapIndex::Select0(size_t bit_index) const {
93 if (bit_index >= Bits() - GetOnesCount()) return Bits();
95 uint32 remzeros = bit_index + 1;
97 const uint32 block = find_inverted_primary_block(bit_index + 1);
175 inline size_t BitmapIndex::find_primary_block(size_t bit_index) const {
178 primary_index_.end(), bit_index));
    [all...]
  /external/chromium_org/third_party/libsrtp/srtp/crypto/math/
datatypes.c 328 const int bit_index = shift & 31; local
337 if (bit_index == 0) {
349 b = x->v32[from] << bit_index;
351 b |= x->v32[from-1] >> (32-bit_index);
367 const int bit_index = shift & 31; local
374 if (bit_index == 0) {
379 x->v32[i] = (x->v32[i+base_index] >> bit_index) ^
380 (x->v32[i+base_index+1] << (32 - bit_index));
381 x->v32[4 - base_index-1] = x->v32[4-1] >> bit_index;
395 bitvector_get_bit(const bitvector_t *v, int bit_index)
484 const int bit_index = shift & 31; local
    [all...]
math.c 653 const int bit_index = index & 31; local
662 if (bit_index == 0) {
674 b = x->v32[from] << bit_index;
676 b |= x->v32[from-1] >> (32-bit_index);
692 const int bit_index = index & 31; local
699 if (bit_index == 0) {
704 x->v32[i] = (x->v32[i+base_index] << bit_index) ^
705 (x->v32[i+base_index+1] >> (32 - bit_index));
706 x->v32[4 - base_index-1] = x->v32[4-1] << bit_index;
  /external/protobuf/src/google/protobuf/compiler/javanano/
javanano_helpers.h 154 // Effectively, GetBitFieldName(bit_index / 32)
155 string GetBitFieldNameForBit(int bit_index);
160 string GenerateGetBit(int bit_index);
165 string GenerateSetBit(int bit_index);
170 string GenerateClearBit(int bit_index);
176 string GenerateDifferentBit(int bit_index);
javanano_helpers.cc 510 string GetBitFieldNameForBit(int bit_index) {
511 return GetBitFieldName(bit_index / 32);
514 string GenerateGetBit(int bit_index) {
515 string var_name = GetBitFieldNameForBit(bit_index);
516 int bit_in_var_index = bit_index % 32;
523 string GenerateSetBit(int bit_index) {
524 string var_name = GetBitFieldNameForBit(bit_index);
525 int bit_in_var_index = bit_index % 32;
532 string GenerateClearBit(int bit_index) {
533 string var_name = GetBitFieldNameForBit(bit_index);
    [all...]
  /external/srtp/crypto/math/
datatypes.c 328 const int bit_index = index & 31; local
337 if (bit_index == 0) {
349 b = x->v32[from] << bit_index;
351 b |= x->v32[from-1] >> (32-bit_index);
367 const int bit_index = index & 31; local
374 if (bit_index == 0) {
379 x->v32[i] = (x->v32[i+base_index] >> bit_index) ^
380 (x->v32[i+base_index+1] << (32 - bit_index));
381 x->v32[4 - base_index-1] = x->v32[4-1] >> bit_index;
395 bitvector_get_bit(const bitvector_t *v, int bit_index)
484 const int bit_index = index & 31; local
    [all...]
math.c 653 const int bit_index = index & 31; local
662 if (bit_index == 0) {
674 b = x->v32[from] << bit_index;
676 b |= x->v32[from-1] >> (32-bit_index);
692 const int bit_index = index & 31; local
699 if (bit_index == 0) {
704 x->v32[i] = (x->v32[i+base_index] << bit_index) ^
705 (x->v32[i+base_index+1] >> (32 - bit_index));
706 x->v32[4 - base_index-1] = x->v32[4-1] << bit_index;
  /external/chromium_org/third_party/libsrtp/srtp/crypto/include/
datatypes.h 454 #define _bitvector_get_bit(v, bit_index) \
456 ((((v)->word[((bit_index) >> 5)]) >> ((bit_index) & 31)) & 1) \
460 #define _bitvector_set_bit(v, bit_index) \
462 (((v)->word[((bit_index) >> 5)] |= ((uint32_t)1 << ((bit_index) & 31)))) \
465 #define _bitvector_clear_bit(v, bit_index) \
467 (((v)->word[((bit_index) >> 5)] &= ~((uint32_t)1 << ((bit_index) & 31)))) \
477 #define bitvector_get_bit(v, bit_index) _bitvector_get_bit(v, bit_index
    [all...]
  /external/srtp/crypto/include/
datatypes.h 447 #define _bitvector_get_bit(v, bit_index) \
449 ((((v)->word[((bit_index) >> 5)]) >> ((bit_index) & 31)) & 1) \
453 #define _bitvector_set_bit(v, bit_index) \
455 (((v)->word[((bit_index) >> 5)] |= ((uint32_t)1 << ((bit_index) & 31)))) \
458 #define _bitvector_clear_bit(v, bit_index) \
460 (((v)->word[((bit_index) >> 5)] &= ~((uint32_t)1 << ((bit_index) & 31)))) \
470 #define bitvector_get_bit(v, bit_index) _bitvector_get_bit(v, bit_index
    [all...]
  /external/openfst/src/include/fst/extensions/ngram/
bitmap-index.h 106 size_t Select1(size_t bit_index) const;
110 size_t Select0(size_t bit_index) const;
142 size_t find_primary_block(size_t bit_index) const;
144 size_t find_inverted_primary_block(size_t bit_index) const;
  /external/tinyalsa/
tinypcminfo.c 92 /* Returns a human readable name for the format associated with bit_index,
93 * NULL if bit_index is not known.
95 inline const char *pcm_get_format_name(unsigned bit_index)
97 return bit_index < ARRAY_SIZE(format_lookup) ? format_lookup[bit_index] : NULL;
  /external/chromium_org/v8/src/
safepoint-table.cc 34 int bit_index = reg_index & (kBitsPerByte - 1); local
35 return (bits_[byte_index] & (1 << bit_index)) != 0;
184 int bit_index = index & (kBitsPerByte - 1); local
185 bits[byte_index] |= (1 << bit_index);
193 int bit_index = index & (kBitsPerByte - 1); local
194 bits[byte_index] |= (1U << bit_index);
frames.cc 670 int bit_index = index & (kBitsPerByte - 1); local
671 if ((safepoint_bits[byte_index] & (1U << bit_index)) != 0) {
    [all...]
  /external/chromium_org/net/disk_cache/blockfile/
bitmap.cc 219 const int bit_index = *index; local
220 if (bit_index >= limit || limit <= 0)
224 int word_index = bit_index >> kLogIntBits;
230 if (Get(bit_index) == value)
233 const int first_bit_offset = bit_index & (kIntBits - 1);
  /external/lldb/examples/summaries/cocoa/
CFBitVector.py 20 def bit_index(abs_pos): function
97 bit = get_bit(cur_byte_val,bit_index(i))
  /external/lldb/source/DataFormatters/
LibStdcpp.cpp 57 size_t bit_index = (idx & 7); // efficient idx % 8 for bit index local
68 switch (bit_index)
LibCxx.cpp 58 size_t bit_index = (idx & 7); // efficient idx % 8 for bit index local
69 switch (bit_index)
  /external/chromium_org/v8/src/ia32/
macro-assembler-ia32.cc     [all...]
macro-assembler-ia32.h 703 void BooleanBitTest(Register object, int field_offset, int bit_index);
    [all...]
  /external/chromium_org/v8/src/x87/
macro-assembler-x87.cc     [all...]
macro-assembler-x87.h 673 void BooleanBitTest(Register object, int field_offset, int bit_index);
    [all...]

Completed in 295 milliseconds

1 2