| /external/valgrind/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/memcheck/tests/ppc64/ |
| power_ISA2_05.c | 17 int bit = val & 1; local
18 sum = sum + bit * scale;
141 /* 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 value
34 // bit #14: flags for constant proba or idx
91 uint32_t bit, uint32_t proba_idx) {
93 assert(bit <= 1);
96 b->tokens_[slot] = (bit << 15) | proba_idx;
98 return bit;
102 uint32_t bit, uint32_t proba) {
104 assert(bit <= 1)
235 const int bit = (token >> 15) & 1; local
261 const int bit = token & (1 << 15); local
[all...] |
| /external/webrtc/webrtc/modules/video_coding/utility/ |
| vp8_header_parser.cc | 72 // Read a bit with proba 'prob'.
82 int bit; local
86 bit = 1;
89 bit = 0;
97 return bit;
|
| /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 | 157 /** \brief Exclusively unlock an object and report updates to the specified bit-mask of
194 unsigned bit = ctz(attributes); local
195 // ATTR_INDEX_MAX == next bit position after the last attribute
196 assert(ATTR_INDEX_MAX > bit);
197 // compute the entry in the handler table using object ID and bit number
198 AttributeHandler handler = handlerTable[index][bit];
202 attributes &= ~(1 << bit);
|
| /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/codecs/vc1/parser/ |
| viddec_vc1_workload.c | 307 which are the same register bit as RANGE_MAPY_FLAG, RANGE_MAPUV_FLAG */
532 uint32_t bit, byte; local
534 viddec_pm_get_au_pos(parent, &bit, &byte, &is_emul);
535 // Send current bit offset and current slice
540 // emulation prevention. But the actual data starts are offset 8 in this bit sequence.
541 wi.vwi_payload[0] = bit + (is_emul*8);
|
| /libcore/ojluni/src/main/java/sun/security/util/ |
| BitArray.java | 69 * specified byte array. The most significant bit of a[0] gets
71 * to specify a value for every bit in the BitArray. In other words,
81 "bit array of given length");
125 * Returns the indexed bit in this BitArray.
136 * Sets the indexed bit in this BitArray.
144 int bit = position(index); local
147 repn[idx] |= bit;
149 repn[idx] &= ~bit;
162 * The bit stored at index zero in this BitArray will be copied
163 * into the most significant bit of the zeroth element of th
[all...] |
| /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...] |
| /system/sepolicy/tools/sepolicy-analyze/ |
| neverallow.c | 30 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...] |
| /build/core/ |
| main.mk | 614 # Resolve the required module name to 32-bit or 64-bit variant.
615 # Get a list of corresponding 32-bit module names, if one exists.
616 define get-32-bit-modules
621 # Get a list of corresponding 32-bit module names, if one exists;
623 define get-32-bit-modules-if-we-can
632 # If a module is built for 32-bit, the required modules must be 32-bit too;
634 # the required modules must be 64-bit;
635 # otherwise we require both 64-bit and 32-bit variant, if one exists
[all...] |
| /art/runtime/base/ |
| bit_utils.h | 65 // Find the bit position of the most significant bit (0-based), or -1 if there were no bits set.
74 // Find the bit position of the least significant bit (0-based), or -1 if there were no bits set.
208 // Check whether an N-bit two's-complement representation can hold value.
268 // Generate maximum/minimum values for signed/unsigned n-bit integers
311 uint32_t bit = *static_cast<Iter&>(*this); local
312 bits_ &= ~(static_cast<T>(1u) << bit);
|
| /external/ImageMagick/MagickCore/ |
| quantum-export.c | 359 bit;
488 for (bit=0; bit < (ssize_t) (3*number_pixels % 2); bit++)
490 switch ((x+bit) % 3)
517 if (bit != 0)
357 bit; local
1961 bit; local
2220 bit; local
2514 bit; local
2682 bit; local
3090 bit; local
[all...] |
| quantum-import.c | 384 bit;
515 for (bit=0; bit < (ssize_t) (3*number_pixels % 2); bit++)
518 switch ((x+bit) % 3)
543 if (bit != 0)
382 bit; local
2020 bit; local
2335 bit; local
2663 bit; local
2876 bit; local
3324 bit; local
[all...] |
| /external/ImageMagick/coders/ |
| cut.c | 104 size_t bit; ssize_t x;
118 for (bit=0; bit < 8; bit++)
120 index=(Quantum) ((((*p) & (0x80 >> bit)) != 0) ? 0x01 : 0x00);
128 for (bit=0; bit < (image->columns % 8); bit++)
130 index=(Quantum) ((((*p) & (0x80 >> bit)) != 0) ? 0x01 : 0x00);
363 i=0; /*guess a number of bit planes*
101 size_t bit; ssize_t x; local
[all...] |
| dib.c | 477 bit,
694 for (bit=0; bit < 8; bit++)
696 index=(Quantum) ((*p) & (0x80 >> bit) ? 0x01 : 0x00);
704 for (bit=0; bit < (ssize_t) (image->columns % 8); bit++)
706 index=(Quantum) ((*p) & (0x80 >> bit) ? 0x01 : 0x00);
470 bit, local
1105 bit, local
[all...] |
| djvu.c | 398 size_t bit, byte;
405 bit=0;
411 if (bit == 0) byte= (size_t) q[(y * stride) + (x / 8)];
414 bit++;
415 if (bit == 8)
416 bit=0;
395 size_t bit, byte; local
|
| palm.c | 280 bit;
467 for (bit=0; bit < byte; bit++)
469 if ((y == 0) || (count & (one << (7 - bit))))
470 one_row[i+bit]=(unsigned char) ReadBlobByte(image);
472 one_row[i+bit]=lastrow[i+bit];
502 bit=8-bits_per_pixel;
507 index=(Quantum) (mask-(((*ptr) & (mask << bit)) >> bit))
274 bit; local
706 bit, local
[all...] |
| pcl.c | 870 bit,
876 bit=0;
883 bit++;
884 if (bit == 8)
887 bit=0;
892 if (bit != 0)
893 *q++=byte << (8-bit);
863 bit, local
|
| pcx.c | 564 bit;
568 for (bit=7; bit >= 0; bit--)
569 *r++=(unsigned char) ((*p) & (0x01 << bit) ? 0x01 : 0x00);
574 for (bit=7; bit >= (ssize_t) (8-(image->columns % 8)); bit--)
575 *r++=(unsigned char) ((*p) & (0x01 << bit) ? 0x01 : 0x00);
558 bit; local
1095 bit, local
[all...] |
| sun.c | 249 bit;
499 for (bit=7; bit >= 0; bit--)
501 SetPixelIndex(image,(Quantum) ((*p) & (0x01 << bit) ? 0x00 : 0x01),
509 for (bit=7; bit >= (int) (8-(image->columns % 8)); bit--)
511 SetPixelIndex(image,(Quantum) ((*p) & (0x01 << bit) ? 0x00 :
244 bit; local
923 bit, local
[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;
|
