HomeSort by relevance Sort by last modified time
    Searched defs:bit (Results 51 - 75 of 136) sorted by null

1 23 4 5 6

  /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::__anon25217
  /system/core/libpixelflinger/
fixed.cpp 54 // shift right 1-bit to make room for the sign bit
111 GGLfixed bit = 0x800000; local
114 GGLfixed temp = bit + (r<<1);
118 r += bit;
122 } while (bit>>=1);
189 // we get 3.75 cycles per bit in the main loop
190 // and 8 cycles per bit in the termination loop
256 // first we compute a*b as a 64-bit integer
316 // this function computes a*b/c with 64-bit intermediate accurac
    [all...]
  /bootable/bootloader/legacy/arch_msm7k/
hsusb.c 43 unsigned bit; member in struct:usb_endpoint
70 ept->bit = EPT_TX(ept->num);
72 ept->bit = EPT_RX(ept->num);
83 DBG("ept%d %s @%p/%p max=%d bit=%x\n",
84 num, in ? "in":"out", ept, ept->head, max_pkt, ept->bit);
138 writel(ept->bit, USB_ENDPTPRIME);
227 writel(ept->bit, USB_ENDPTSETUPSTAT);
445 if(n & ept->bit) {
  /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/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/grub/netboot/
otulip.c 91 unsigned bit, csr; local
100 for (bit = 3 + SROM_BITWIDTH + 16; bit > 0; bit--) {
120 unsigned lastbit, data, bits, bit, csr; local
127 for (bits = idx|cmdmask, bit = bitwidth + 3; bit > 0; bit--, bits <<= 1)
  /external/icu4c/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/icu4c/i18n/
regexcmp.cpp 1397 int32_t bit = 0; local
    [all...]
  /external/icu4c/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/jmonkeyengine/engine/src/android/jme3tools/android/
Fixed.java 335 int bit = 0x40000000; local
336 while (bit >= 0x100) { // lower values give more accurate results
337 long tmp = sum | bit;
340 sum = tmp + bit;
342 bit >>= 1;
  /external/openssl/crypto/ec/
ec_mult.c 199 int bit, next_bit, mask; local
220 bit = 1 << w; /* at most 128 */
221 next_bit = bit << 1; /* at most 256 */
256 if (window_val & bit)
277 if (digit <= -bit || digit >= bit || !(digit & 1))
288 if (window_val != 0 && window_val != next_bit && window_val != bit)
298 window_val += bit * BN_is_bit_set(scalar, j + w);
417 * (NB: maximum wNAF length is bit length plus one) */
809 * one point per bit
    [all...]
  /external/ppp/pppd/
md4.c 31 ** This implementation assumes that ints are 32-bit quantities.
72 ** operator will shift in zeros rather than extending the sign bit.
214 unsigned int i, tmp, bit, byte, mask; local
250 bit = count & 7;
254 /* Add padding '1' bit and low-order zeros in last byte */
255 mask = 1 << (7 - bit);
257 /* If room for bit count, finish up with this block */
  /external/qemu/distrib/sdl-1.2.12/src/cpuinfo/
SDL_cpuinfo.c 64 " xorl $0x200000,%%eax # Flip ID bit in EFLAGS \n"
69 " xorl %%ecx,%%eax # Can not toggle ID bit, \n"
84 " xorl $0x200000,%%eax # Flip ID bit in EFLAGS \n"
89 " xorl %%ecx,%%eax # Can not toggle ID bit, \n"
102 xor eax, 200000h ; Flip ID bit in EFLAGS
107 xor eax, ecx ; Can not toggle ID bit, local
  /external/skia/src/images/
bmpdecoderhelper.cpp 305 int bit = w & 7; local
306 col = ((currVal >> (7 - bit)) & 1);
  /external/tcpdump/
print-ospf6.c 45 u_int32_t bit; member in struct:bits
123 if (options & bp->bit) {
127 } while ((++bp)->bit);
  /external/tremolo/Tremolo/
codebook.c 98 /* 32 bit float (not IEEE; nonnormalized mantissa +
167 int bit=(entry>>(length-j-1))&1; local
174 if (chase < 0 || chase >= n || chase*2+bit > n*2+1) return 1;
175 if(!r[chase*2+bit])
176 r[chase*2+bit]=top;
177 chase=r[chase*2+bit];
181 int bit=(entry>>(length-j-1))&1; local
186 r[chase*2+bit]= decpack(i,count++,quantvals,b,opb,maptype) |
226 * This probably wastes a bit of space, but it shouldn't
478 /* this is the correct boundary here; we lose one bit t
658 int bit=(lok>>i)&1; local
688 int bit=(lok>>i)&1; local
    [all...]
mdct.c 251 int bit = 0; local
255 DATA_TYPE b = bitrev12(bit++);
  /external/v8/src/x64/
assembler-x64.h 47 // Test whether a 64-bit value is in a specific range.
140 int bit() const { function in struct:v8::internal::Register
144 // Return the high bit of the register code as a 0 or 1. Used often
251 // Return the high bit of the register code as a 0 or 1. Used often
400 // Offset is added to existing displacement as 32-bit signed values and
569 // On the x64 architecture, we use relative jumps with a 32-bit displacement
571 // Jumps to C functions are done indirectly through a 64-bit register holding
594 static const int kSpecialTargetSize = 4; // Use 32-bit displacement.
597 static const int kCallTargetAddressOffset = 4; // Use 32-bit displacement.
599 // 32-bit displacement of a near call would be, relative to the pushe
    [all...]
  /external/valgrind/main/VEX/priv/
guest_s390_helpers.c 516 /* Shift the sign bit into the LSB. Note, that the tested value is an
517 8-bit value which has been zero-extended to 32/64 bit. */
758 Because cc == 3 cannot occur the rightmost bit of cond is
794 Because cc == 3 cannot occur the rightmost bit of cond is
830 Because cc == 3 cannot occur the rightmost bit of cond is
900 /* Extract the 32-bit value from the thunk */
927 cc == 1 --> leftmost inserted bit is one (cond == 4)
928 cc == 2 --> leftmost inserted bit is zero and not (cond == 2)
931 Because cc == 0,1,2 the rightmost bit of the mask is a don't care *
1243 IRExpr *bit = binop(Iop_Shr64, cc_dep1, mkU8(7)); local
    [all...]
  /external/yaffs2/yaffs2/utils/
mkyaffsimage.c 148 unsigned bit = 0; local
167 bit++;
170 ecc ^= bit;

Completed in 788 milliseconds

1 23 4 5 6