HomeSort by relevance Sort by last modified time
    Searched defs:bit (Results 101 - 125 of 258) sorted by null

1 2 3 45 6 7 8 91011

  /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;
127 /* The contents of FRB with bit set 0 set to bit 0 of FRA copied into FRT */
  /external/valgrind/main/memcheck/tests/ppc64/
power_ISA2_05.c 16 int bit = val & 1; local
17 sum = sum + bit * scale;
126 /* The contents of FRB with bit set 0 set to bit 0 of FRA copied into FRT */
  /external/webp/src/utils/
bit_reader.h 30 // However, since range_ is only 8bit, we only need an active window of 8 bits
37 // 8bit window of value_: either we shift them in, while keeping the position of
71 #if defined(__i386__) || defined(_M_IX86) // x86 32bit
73 #elif defined(__x86_64__) || defined(_M_X64) // x86 64bit
133 // Initialize the bit reader and the boolean decoder.
146 // Read a bit with proba 'prob'. Speed-critical function!
170 #else // generic code for swapping 64-bit values (suggested by bdb@)
259 // It's important to avoid generating a 64bit x 64bit multiply here.
263 const int bit = VP8BitUpdate(br, split) local
280 const int bit = VP8BitUpdate(br, split); local
    [all...]
  /external/zlib/src/examples/
enough.c 30 the bit values to the codes (i.e. only canonical codes are counted).
34 be coded, what the last code length used was, and how many bit patterns of
39 properties are: we cannot use more bit patterns than are available; and when
40 all the symbols are used, there are exactly zero possible bit patterns
51 that root-bit prefix. If that longest code has length len, then the table
53 codes. Each subsequent root-bit prefix then has its own sub-table. The
55 incrementally as the number of codes at each bit length is populated. When
74 Second, the intermediate states that lead to (root + 1) bit or longer codes
80 Beginning the code examination at (root + 1) bit codes, which is enabled by
86 for the default arguments of 286 symbols limited to 15-bit codes
262 int bit; \/* mask for this state's bit *\/ local
    [all...]
  /frameworks/wilhelm/src/
locks.c 144 /** \brief Exclusively unlock an object and report updates to the specified bit-mask of
181 unsigned bit = ctz(attributes); local
182 // ATTR_INDEX_MAX == next bit position after the last attribute
183 assert(ATTR_INDEX_MAX > bit);
184 // compute the entry in the handler table using object ID and bit number
185 AttributeHandler handler = handlerTable[index][bit];
189 attributes &= ~(1 << bit);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sound/
i2c.h 24 #define SND_I2C_DEVICE_ADDRTEN (1<<0) /* 10-bit I2C address */
31 unsigned short addr; /* device address (might be 10-bit) */
66 struct snd_i2c_bit_ops *bit; member in union:snd_i2c_bus::__anon41465
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sound/
i2c.h 24 #define SND_I2C_DEVICE_ADDRTEN (1<<0) /* 10-bit I2C address */
31 unsigned short addr; /* device address (might be 10-bit) */
66 struct snd_i2c_bit_ops *bit; member in union:snd_i2c_bus::__anon42979
  /system/core/libpixelflinger/
fixed.cpp 54 // 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 intermediate accurac
    [all...]
  /external/aac/libSBRdec/src/
env_dec.cpp 20 individually for the purpose of encoding or decoding bit streams in products that are compliant with
687 int bit, mask; local
701 mask = 1; /* begin with lowest bit of exponent */
703 for ( bit=ENV_EXP_FRACT-1; bit>=0; bit-- ) {
705 /* The current bit of the exponent is set,
707 mantissa = (FIXP_SGL)( (mantissa * pow2[bit]) << 1);
709 /* Advance to next bit */
717 /* In case of the high amplitude resolution, 1 bit of the exponent gets lost by the shift
    [all...]
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3bitset.c 45 static void antlr3BitsetAdd (pANTLR3_BITSET bitset, ANTLR3_INT32 bit);
47 static ANTLR3_BOOLEAN antlr3BitsetMember (pANTLR3_BITSET bitset, ANTLR3_UINT32 bit);
49 static void antlr3BitsetRemove (pANTLR3_BITSET bitset, ANTLR3_UINT32 bit);
55 static void growToInclude (pANTLR3_BITSET bitset, ANTLR3_INT32 bit);
58 static ANTLR3_UINT32 numWordsToHold (ANTLR3_UINT32 bit);
59 static ANTLR3_UINT32 wordNumber (ANTLR3_UINT32 bit);
213 ANTLR3_UINT64 bit; local
223 while (en->next(en, &key, (void **)(&bit)) == ANTLR3_SUCCESS)
225 bitSet->add(bitSet, (ANTLR3_UINT32)bit);
234 /// Creates a new bitset with at least one 64 bit bset of bits, but a
487 ANTLR3_INT8 bit; local
    [all...]
  /external/apache-xml/src/main/java/org/apache/xpath/axes/
AxesWalker.java 206 int bit = WalkerFactory.getAnalysisBitFromAxes(axis); local
207 return bit;
UnionPathIterator.java 241 int bit = m_exprs[i].getAnalysisBits(); local
242 bits |= bit;
WalkingIterator.java 95 int bit = walker.getAnalysisBits(); local
96 bits |= bit;
  /external/arduino/hardware/arduino/cores/arduino/
wiring.h 96 #define bitRead(value, bit) (((value) >> (bit)) & 0x01)
97 #define bitSet(value, bit) ((value) |= (1UL << (bit)))
98 #define bitClear(value, bit) ((value) &= ~(1UL << (bit)))
99 #define bitWrite(value, bit, bitvalue) (bitvalue ? bitSet(value, bit) : bitClear(value, bit))
104 #define bit(b) (1UL << (b) macro
    [all...]
  /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/chromium_org/third_party/icu/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/chromium_org/third_party/icu/source/i18n/
regexcmp.cpp 1397 int32_t bit = 0; local
    [all...]
  /external/chromium_org/third_party/icu/source/test/letest/
PortableFontInstance.cpp 28 // Finds the high bit by binary searching
37 le_uint8 bit = 0; local
41 bit += 16;
46 bit += 8;
51 bit += 4;
56 bit += 2;
61 bit += 1;
64 return bit;
  /external/chromium_org/third_party/mesa/src/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/chromium_org/third_party/mesa/src/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...]

Completed in 1672 milliseconds

1 2 3 45 6 7 8 91011