| /external/ImageMagick/coders/ |
| jbig.c | 147 bit,
249 bit=0;
253 if (bit == 0)
256 bit++;
258 if (bit == 8)
259 bit=0;
447 bit,
488 bit=0;
495 bit++;
496 if (bit == 8
144 bit, local
441 bit, local
[all...] |
| xbm.c | 207 bit,
371 bit=0;
375 if (bit == 0)
378 bit++;
380 if (bit == 8)
381 bit=0;
506 bit,
547 bit=0;
564 bit++;
565 if (bit == 8
203 bit, local
499 bit, local
[all...] |
| /external/curl/lib/ |
| curl_sasl.c | 56 unsigned int bit; /* Flag bit */ member in struct:__anon17308
129 return mechtable[i].bit;
133 return mechtable[i].bit;
|
| /external/fec/ |
| vtest27.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,
|
| 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 | 33 * Bit 2 is true if A - B is not empty
34 * Bit 1 is true if A & B is not empty
35 * BIT 0 is true if B - A is not empty
103 Iterator<? extends T> bit = b.iterator(); local
106 T bb = bit.next();
113 if (!bit.hasNext()) return true;
115 } else if (!bit.hasNext()) {
119 bb = bit.next();
128 if (!bit.hasNext()) {
131 bb = bit.next()
[all...] |
| /external/icu/icu4c/source/test/letest/ |
| cmaps.cpp | 21 // Finds the high bit by binary searching
26 le_uint8 bit = 0; local
30 bit += 16;
35 bit += 8;
40 bit += 4;
45 bit += 2;
50 bit += 1;
53 return bit;
219 le_uint8 bit = highBit(nGroups); local
220 fPower = 1 << bit;
[all...] |
| /external/icu/icu4c/source/test/perf/leperf/ |
| cmaps.cpp | 25 // Finds the high bit by binary searching
30 le_uint8 bit = 0; local
34 bit += 16;
39 bit += 8;
44 bit += 4;
49 bit += 2;
54 bit += 1;
57 return bit;
220 le_uint8 bit = highBit(nGroups); local
221 fPower = 1 << bit;
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/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/libcups/filter/ |
| rastertohp.c | 564 unsigned char bit, /* Current plane data */ local
565 bit0, /* Current low bit data */
566 bit1, /* Current high bit data */
600 * Separate low and high bit data into separate buffers.
608 bit = plane_ptr[0];
610 bit0 = (unsigned char)(((bit & 64) << 1) | ((bit & 16) << 2) | ((bit & 4) << 3) | ((bit & 1) << 4));
611 bit1 = (unsigned char)((bit & 128) | ((bit & 32) << 1) | ((bit & 8) << 2) | ((bit & 2) << 3))
[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/libnetfilter_conntrack/src/conntrack/ |
| labels.c | 13 unsigned int bit; member in struct:labelmap_bucket
37 bucket->bit = b;
59 return list->bit;
65 const char *__labelmap_get_name(struct nfct_labelmap *m, unsigned int bit)
67 if (bit < m->namecount)
68 return m->bit_to_name[bit] ? m->bit_to_name[bit] : "";
170 m->bit_to_name[b->bit] = b->name;
240 int bit; local
245 bit = xtables_parse_connlabel_numerical(label, &end)
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeEmitterGen.cpp | 12 // returns the (currently, 32-bit unsigned) value of the instruction.
35 int getVariableBit(const std::string &VarName, BitsInit *BI, int bit);
45 // If the VarBitInit at position 'bit' matches the specified variable then
46 // return the variable bit position. Otherwise return -1.
48 BitsInit *BI, int bit) {
49 if (VarBitInit *VBI = dyn_cast<VarBitInit>(BI->getBit(bit))) {
53 } else if (VarInit *VI = dyn_cast<VarInit>(BI->getBit(bit))) {
69 int bit = BI->getNumBits()-1; local
71 // Scan for a bit that this contributed to.
72 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 | 69 int pos, bit; local
72 bit = bitvec[pos / 32] & (1 << (pos & 31));
73 return bit;
|
| /external/mesa3d/src/mesa/drivers/dri/i915/ |
| intel_pixel_bitmap.c | 91 static bool test_bit( const GLubyte *src, GLuint bit )
93 return (src[bit/8] & (1<<(bit % 8))) ? 1 : 0;
96 static void set_bit( GLubyte *dest, GLuint bit )
98 dest[bit/8] |= 1 << (bit % 8);
115 GLuint bit = 0; local
143 for (col = 0; col < w; col++, bit++) {
145 set_bit(dest, bit ^ 7);
151 bit = ALIGN(bit, row_align)
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| intel_pixel_bitmap.c | 88 static bool test_bit( const GLubyte *src, GLuint bit )
90 return (src[bit/8] & (1<<(bit % 8))) ? 1 : 0;
93 static void set_bit( GLubyte *dest, GLuint bit )
95 dest[bit/8] |= 1 << (bit % 8);
112 GLuint bit = 0; local
140 for (col = 0; col < w; col++, bit++) {
142 set_bit(dest, bit ^ 7);
148 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/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
40 ebitmap_for_each_bit(roles, rnode, bit) {
41 if (ebitmap_node_get_bit(rnode, bit)) {
42 char *role = policydb->p_role_val_to_name[bit];
126 unsigned bit; local
173 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
174 if (ebitmap_node_get_bit(rnode, bit)) {
176 (&(usrdatum->roles.roles), bit, 1))
|
| util.c | 130 unsigned int bit; local
146 for (bit = 0; bit < sizeof(xperms->perms)*8; bit++) {
147 if (!xperm_test(bit, xperms->perms))
150 if (in_range && next_bit_in_range(bit, xperms->perms)) {
153 } else if (next_bit_in_range(bit, xperms->perms)) {
155 low_bit = bit;
161 value = xperms->driver<<8 | bit;
169 value = bit << 8
[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);
|
