| /external/libvorbis/lib/ |
| mdct.c | 350 int *bit = init->bitrev; local
356 DATA_TYPE *x0 = x+bit[0];
357 DATA_TYPE *x1 = x+bit[1];
374 x0 = x+bit[2];
375 x1 = x+bit[3];
391 bit += 4;
|
| /external/llvm/utils/TableGen/ |
| CodeEmitterGen.cpp | 12 // returns the (currently, 32-bit unsigned) value of the instruction.
44 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
54 // If the VarBitInit at position 'bit' matches the specified variable then
55 // return the variable bit position. Otherwise return -1.
57 BitsInit *BI, int bit) {
58 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) {
62 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) {
78 int bit = BI->getNumBits()-1; local
80 // Scan for a bit that this contributed to.
81 for (; bit >= 0; )
[all...] |
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| sp_tile_cache.c | 62 int pos, bit; local
65 bit = bitvec[pos / 32] & (1 << (pos & 31));
66 return bit;
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_state_upload.c | 320 uint32_t bit; member in struct:dirty_bit_map
410 if (bit_map[i].bit == 0)
413 if (bit_map[i].bit & bits)
424 if (bit_map[i].bit == 0)
428 bit_map[i].bit, bit_map[i].count, bit_map[i].name);
|
| /external/mesa3d/src/mesa/drivers/dri/intel/ |
| intel_pixel_bitmap.c | 89 static bool test_bit( const GLubyte *src, GLuint bit )
91 return (src[bit/8] & (1<<(bit % 8))) ? 1 : 0;
94 static void set_bit( GLubyte *dest, GLuint bit )
96 dest[bit/8] |= 1 << (bit % 8);
113 GLuint bit = 0; local
141 for (col = 0; col < w; col++, bit++) {
143 set_bit(dest, bit ^ 7);
149 bit = ALIGN(bit, row_align)
[all...] |
| /external/mesa3d/src/mesa/main/ |
| texcompress_etc_tmp.h | 120 int modifier, bit, idx, blk; local
123 bit = y + x * 4;
124 idx = ((block->pixel_indices >> (15 + bit)) & 0x2) |
125 ((block->pixel_indices >> (bit)) & 0x1);
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/h264/read/ |
| CAVLCReader.java | 136 int bit = read1Bit(); local
137 bt = bt.down(bit);
|
| /external/qemu/distrib/sdl-1.2.15/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/skia/src/pathops/ |
| SkIntersections.cpp | 131 int bit = 1 << index; local
132 fIsCoincident[0] |= bit;
133 fIsCoincident[1] |= bit;
|
| /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/memcheck/tests/ppc32/ |
| power_ISA2_05.c | 17 int bit = val & 1; local
18 sum = sum + bit * scale;
136 /* 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 | 17 int bit = val & 1; local
18 sum = sum + bit * scale;
135 /* The contents of FRB with bit set 0 set to bit 0 of FRA copied into FRT */
|
| /external/webp/src/enc/ |
| token.c | 12 // A 'token' is a bit value associated with a probability, either fixed
33 typedef uint16_t token_t; // bit#15: bit
34 // bit #14: constant proba or idx
91 int bit, uint32_t proba_idx) {
93 assert(bit == 0 || bit == 1);
96 b->tokens_[slot] = (bit << 15) | proba_idx;
98 return bit;
102 int bit, int proba)
236 const int bit = (token >> 15) & 1; local
262 const int bit = token & (1 << 15); 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 | 158 /** \brief Exclusively unlock an object and report updates to the specified bit-mask of
195 unsigned bit = ctz(attributes); local
196 // ATTR_INDEX_MAX == next bit position after the last attribute
197 assert(ATTR_INDEX_MAX > bit);
198 // compute the entry in the handler table using object ID and bit number
199 AttributeHandler handler = handlerTable[index][bit];
203 attributes &= ~(1 << bit);
|
| /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...] |
| /build/core/ |
| main.mk | 572 # Resolve the required module name to 32-bit or 64-bit variant.
573 # Get a list of corresponding 32-bit module names, if one exists.
574 define get-32-bit-modules
579 # Get a list of corresponding 32-bit module names, if one exists;
581 define get-32-bit-modules-if-we-can
588 # If a module is built for 32-bit, the required modules must be 32-bit too;
590 # the required modules must be 64-bit;
591 # otherwise we require both 64-bit and 32-bit variant, if one exists
[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;
|
