| /external/fec/ |
| vtest29.c | 116 int bit = (i < framebits) ? (random() & 1) : 0; local
118 sr = (sr << 1) | bit;
178 printf("Execution time for %d %d-bit frames: %.2f sec\n",trials,
|
| vtest39.c | 116 int bit = (i < framebits) ? (random() & 1) : 0; local
118 sr = (sr << 1) | bit;
179 printf("Execution time for %d %d-bit frames: %.2f sec\n",trials,
|
| vtest615.c | 118 int bit = (i < framebits) ? (random() & 1) : 0; local
120 sr = (sr << 1) | bit;
186 printf("Execution time for %d %d-bit frames: %.2f sec\n",trials,
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| SortedSetRelation.java | 31 * Bit 2 is true if A - B is not empty
32 * Bit 1 is true if A & B is not empty
33 * BIT 0 is true if B - A is not empty
101 Iterator<? extends T> bit = b.iterator(); local
104 T bb = bit.next();
111 if (!bit.hasNext()) return true;
113 } else if (!bit.hasNext()) {
117 bb = bit.next();
126 if (!bit.hasNext()) {
129 bb = bit.next()
[all...] |
| /external/icu/icu4c/source/test/letest/ |
| cmaps.cpp | 19 // Finds the high bit by binary searching
24 le_uint8 bit = 0; local
28 bit += 16;
33 bit += 8;
38 bit += 4;
43 bit += 2;
48 bit += 1;
51 return bit;
217 le_uint8 bit = highBit(nGroups); local
218 fPower = 1 << bit;
[all...] |
| /external/icu/icu4c/source/test/perf/leperf/ |
| cmaps.cpp | 19 // Finds the high bit by binary searching
24 le_uint8 bit = 0; local
28 bit += 16;
33 bit += 8;
38 bit += 4;
43 bit += 2;
48 bit += 1;
51 return bit;
214 le_uint8 bit = highBit(nGroups); local
215 fPower = 1 << bit;
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| SortedSetRelation.java | 29 * Bit 2 is true if A - B is not empty
30 * Bit 1 is true if A & B is not empty
31 * BIT 0 is true if B - A is not empty
99 Iterator<? extends T> bit = b.iterator(); local
102 T bb = bit.next();
109 if (!bit.hasNext()) return true;
111 } else if (!bit.hasNext()) {
115 bb = bit.next();
124 if (!bit.hasNext()) {
127 bb = bit.next()
[all...] |
| /external/iptables/extensions/ |
| libxt_sctp.c | 123 int bit,
132 flag_info[i].flag_mask |= (1 << bit);
134 flag_info[i].flag |= (1 << bit);
149 flag_info[*flag_count].flag_mask |= (1 << bit);
151 flag_info[*flag_count].flag |= (1 << bit);
205 int bit; local
209 bit = p - sctp_chunk_names[i].valid_flags;
210 bit = 7 - bit;
213 &(einfo->flag_count), i, bit,
[all...] |
| /external/libexif/libexif/canon/ |
| mnote-canon-entry.c | 476 unsigned int i, bit, lastbit = 0; local
479 * Search the table for the last matching bit, because
483 bit = table[i].value;
484 if ((vs >> bit) & 1) {
485 lastbit = bit;
490 bit = table[i].value;
491 if ((vs >> bit) & 1) {
493 if (bit != lastbit)
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/ |
| btAabbUtil2.h | 145 int bit=1; local
151 if (sourceOutcode & bit)
161 else if (targetOutcode & bit)
166 bit<<=1;
211 //This block replaces the block below and uses no branches, and replaces the 8 bit return with a 32 bit return for improved performance (~3x on XBox 360)
|
| /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.
36 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
46 // If the VarBitInit at position 'bit' matches the specified variable then
47 // return the variable bit position. Otherwise return -1.
49 BitsInit *BI, int bit) {
50 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) {
54 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) {
70 int bit = BI->getNumBits()-1; local
72 // Scan for a bit that this contributed to.
73 for (; bit >= 0; )
[all...] |
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/rangecoder/ |
| RangeEncoder.java | 104 public void encodeBit(short[] probs, int index, int bit) {
108 // NOTE: Any non-zero value for bit is taken as 1.
109 if (bit == 0) {
125 public static int getBitPrice(int prob, int bit) {
126 // NOTE: Unlike in encodeBit(), here bit must be 0 or 1.
127 assert bit == 0 || bit == 1; local
128 return prices[(prob ^ ((-bit) & (BIT_MODEL_TOTAL - 1)))
138 int bit = symbol & mask; local
139 encodeBit(probs, index, bit);
153 int bit = symbol & 1; local
166 int bit = symbol & 1; local
179 int bit = symbol & 1; local
[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/opencv3/3rdparty/libwebp/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/pdfium/xfa/src/fxbarcode/oned/ |
| BC_OnedCodaBarWriter.cpp | 196 int32_t bit = 0;
local
197 while (bit < 7) {
200 if (((code >> (6 - bit)) & 1) == 0 || counter == m_iWideNarrRatio - 1) {
202 bit++;
|
| /external/selinux/libselinux/src/ |
| stringrep.c | 326 access_vector_t bit = 1; local
336 if (av & bit) {
337 permstr = security_av_perm_to_string(tclass, bit);
341 av &= ~bit;
343 bit <<= 1;
|
| /external/selinux/libsepol/src/ |
| users.c | 24 unsigned bit; local
35 ebitmap_for_each_bit(roles, rnode, bit) {
36 if (ebitmap_node_get_bit(rnode, bit)) {
37 char *role = policydb->p_role_val_to_name[bit];
121 unsigned bit; local
170 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
171 if (ebitmap_node_get_bit(rnode, bit)) {
173 (&(usrdatum->roles.roles), bit, 1))
|
| util.c | 129 unsigned int bit; local
145 for (bit = 0; bit < sizeof(xperms->perms)*8; bit++) {
146 if (!xperm_test(bit, xperms->perms))
149 if (in_range && next_bit_in_range(bit, xperms->perms)) {
152 } else if (next_bit_in_range(bit, xperms->perms)) {
154 low_bit = bit;
160 value = xperms->driver<<8 | bit;
168 value = bit << 8
[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);
|
