HomeSort by relevance Sort by last modified time
    Searched refs:bits (Results 1 - 25 of 4238) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /dalvik/dexgen/src/com/android/dexgen/rop/cst/
CstLiteral64.java 24 /** the value as {@code long} bits */
25 private final long bits; field in class:CstLiteral64
30 * @param bits the value as {@code long} bits
32 /*package*/ CstLiteral64(long bits) {
33 this.bits = bits;
41 bits == ((CstLiteral64) other).bits;
47 return (int) bits ^ (int) (bits >> 32)
    [all...]
CstLiteral32.java 24 /** the value as {@code int} bits */
25 private final int bits; field in class:CstLiteral32
30 * @param bits the value as {@code int} bits
32 /*package*/ CstLiteral32(int bits) {
33 this.bits = bits;
41 bits == ((CstLiteral32) other).bits;
47 return bits;
    [all...]
CstLiteralBits.java 36 * Gets the value as {@code int} bits. If this instance contains
37 * more bits than fit in an {@code int}, then this returns only
38 * the low-order bits.
40 * @return the bits
45 * Gets the value as {@code long} bits. If this instance contains
46 * fewer bits than fit in a {@code long}, then the result of this
49 * @return the bits
54 * Returns true if this value can fit in 16 bits with sign-extension.
56 * @return true if the sign-extended lower 16 bits are the same as
64 int bits = getIntBits() local
79 int bits = getIntBits(); local
    [all...]
  /dalvik/dx/src/com/android/dx/rop/cst/
CstLiteral64.java 24 /** the value as {@code long} bits */
25 private final long bits; field in class:CstLiteral64
30 * @param bits the value as {@code long} bits
32 /*package*/ CstLiteral64(long bits) {
33 this.bits = bits;
41 bits == ((CstLiteral64) other).bits;
47 return (int) bits ^ (int) (bits >> 32)
    [all...]
CstLiteral32.java 24 /** the value as {@code int} bits */
25 private final int bits; field in class:CstLiteral32
30 * @param bits the value as {@code int} bits
32 /*package*/ CstLiteral32(int bits) {
33 this.bits = bits;
41 bits == ((CstLiteral32) other).bits;
47 return bits;
    [all...]
CstLiteralBits.java 36 * Gets the value as {@code int} bits. If this instance contains
37 * more bits than fit in an {@code int}, then this returns only
38 * the low-order bits.
40 * @return the bits
45 * Gets the value as {@code long} bits. If this instance contains
46 * fewer bits than fit in a {@code long}, then the result of this
49 * @return the bits
54 * Returns true if this value can fit in 16 bits with sign-extension.
56 * @return true if the sign-extended lower 16 bits are the same as
64 int bits = getIntBits() local
79 int bits = getIntBits(); local
    [all...]
  /external/elfutils/tests/
run-allregs.sh 32 0: %eax (eax), signed 32 bits
33 1: %ecx (ecx), signed 32 bits
34 2: %edx (edx), signed 32 bits
35 3: %ebx (ebx), signed 32 bits
36 4: %esp (esp), address 32 bits
37 5: %ebp (ebp), address 32 bits
38 6: %esi (esi), signed 32 bits
39 7: %edi (edi), signed 32 bits
40 8: %eip (eip), address 32 bits
41 9: %eflags (eflags), unsigned 32 bits
    [all...]
  /bionic/libc/include/sys/
sysconf.h 6 #include <bits/sysconf.h>
  /external/jemalloc/test/src/
btalloc.c 4 btalloc(size_t size, unsigned bits)
7 return (btalloc_0(size, bits));
  /external/llvm/lib/Fuzzer/test/
FullCoverageSetTest.cpp 11 int bits = 0; local
12 if (Size > 0 && Data[0] == 'F') bits |= 1;
13 if (Size > 1 && Data[1] == 'U') bits |= 2;
14 if (Size > 2 && Data[2] == 'Z') bits |= 4;
15 if (Size > 3 && Data[3] == 'Z') bits |= 8;
16 if (Size > 4 && Data[4] == 'E') bits |= 16;
17 if (Size > 5 && Data[5] == 'R') bits |= 32;
18 if (bits == 63) {
FourIndependentBranchesTest.cpp 11 int bits = 0; local
12 if (Size > 0 && Data[0] == 'F') bits |= 1;
13 if (Size > 1 && Data[1] == 'U') bits |= 2;
14 if (Size > 2 && Data[2] == 'Z') bits |= 4;
15 if (Size > 3 && Data[3] == 'Z') bits |= 8;
16 if (bits == 15) {
  /external/speex/libspeex/
bits.c 48 EXPORT void speex_bits_init(SpeexBits *bits)
50 bits->chars = (char*)speex_alloc(MAX_CHARS_PER_FRAME);
51 if (!bits->chars)
54 bits->buf_size = MAX_CHARS_PER_FRAME;
56 bits->owner=1;
58 speex_bits_reset(bits);
61 EXPORT void speex_bits_init_buffer(SpeexBits *bits, void *buff, int buf_size)
63 bits->chars = (char*)buff;
64 bits->buf_size = buf_size;
66 bits->owner=0
    [all...]
  /external/valgrind/memcheck/tests/vbit-test/
vbits.c 49 /* Return the bits of V if they fit into 64-bit. If V has fewer than
50 64 bits, the bit pattern is zero-extended to the left. */
55 case 1: return v.bits.u32;
56 case 8: return v.bits.u8;
57 case 16: return v.bits.u16;
58 case 32: return v.bits.u32;
59 case 64: return v.bits.u64;
72 case 1: fprintf(fp, "%08x", v.bits.u32); break;
73 case 8: fprintf(fp, "%02x", v.bits.u8); break;
74 case 16: fprintf(fp, "%04x", v.bits.u16); break
466 uint64_t bits; local
530 uint64_t bits = left64(get_bits64(v)); local
795 uint64_t bits = get_bits64(v); local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/
basic_iterator.h 36 #include <bits/c++config.h>
37 #include <bits/stl_iterator_base_types.h>
38 #include <bits/stl_iterator_base_funcs.h>
39 #include <bits/stl_iterator.h>
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
basic_iterator.h 36 #include <bits/c++config.h>
37 #include <bits/stl_iterator_base_types.h>
38 #include <bits/stl_iterator_base_funcs.h>
39 #include <bits/stl_iterator.h>
  /external/clang/utils/ABITest/
build-and-summarize-all.sh 10 for bits in 32 64; do
12 echo "-- $kind-$bits --"
13 (cd $kind-$bits && ../build-and-summarize.sh $1)
  /external/clang/test/Analysis/
fields.c 45 struct Bits {
62 struct Bits bits; local
64 if (foo() && bits.b) // expected-warning {{garbage}}
66 if (foo() && bits.inner.e) // expected-warning {{garbage}}
69 bits.c = 1;
70 clang_analyzer_eval(bits.c == 1); // expected-warning {{TRUE}}
72 if (foo() && bits.b) // expected-warning {{garbage}}
74 if (foo() && bits.x) // expected-warning {{garbage}}
77 bits.x = true
121 struct Bits bits; local
    [all...]
  /external/jemalloc/test/include/test/
btalloc.h 2 void *btalloc(size_t size, unsigned bits);
5 void *btalloc_##n(size_t size, unsigned bits);
11 btalloc_##n(size_t size, unsigned bits) \
15 if (bits == 0) \
18 switch (bits & 0x1U) { \
20 p = (btalloc_0(size, bits >> 1)); \
23 p = (btalloc_1(size, bits >> 1)); \
  /external/libgsm/tls/
bitter.c 9 /* Generate code to pack a bit array from a name:#bits description */
18 int bits = 8; local
27 if (bits == 8) printf("\t*c++ = ");
30 if (vars == bits) {
32 printf( (bits==8? "%s & 0x%lX;\n" : "(%s & 0x%lX);\n"),
34 ~(0xfffffffe << (bits - 1)));
39 bits = 8;
41 } else if (vars < bits) {
46 bits - vars);
47 bits -= vars
    [all...]
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_fmax.c 43 if (u[0].bits.exp == 2047 && (u[0].bits.manh | u[0].bits.manl) != 0)
45 if (u[1].bits.exp == 2047 && (u[1].bits.manh | u[1].bits.manl) != 0)
49 if (u[0].bits.sign != u[1].bits.sign)
50 return (u[u[0].bits.sign].d);
s_fmaxl.c 45 if (u[0].bits.exp == 32767 && (u[0].bits.manh | u[0].bits.manl) != 0)
47 if (u[1].bits.exp == 32767 && (u[1].bits.manh | u[1].bits.manl) != 0)
51 if (u[0].bits.sign != u[1].bits.sign)
52 return (u[0].bits.sign ? y : x);
s_fmin.c 43 if (u[0].bits.exp == 2047 && (u[0].bits.manh | u[0].bits.manl) != 0)
45 if (u[1].bits.exp == 2047 && (u[1].bits.manh | u[1].bits.manl) != 0)
49 if (u[0].bits.sign != u[1].bits.sign)
50 return (u[u[1].bits.sign].d);
s_fminl.c 45 if (u[0].bits.exp == 32767 && (u[0].bits.manh | u[0].bits.manl) != 0)
47 if (u[1].bits.exp == 32767 && (u[1].bits.manh | u[1].bits.manl) != 0)
51 if (u[0].bits.sign != u[1].bits.sign)
52 return (u[1].bits.sign ? y : x);
s_nextafterl.c 42 if ((ux.bits.exp == 0x7fff &&
43 ((ux.bits.manh&~LDBL_NBIT)|ux.bits.manl) != 0) ||
44 (uy.bits.exp == 0x7fff &&
45 ((uy.bits.manh&~LDBL_NBIT)|uy.bits.manl) != 0))
49 ux.bits.manh = 0; /* return +-minsubnormal */
50 ux.bits.manl = 1;
51 ux.bits.sign = uy.bits.sign
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/params/
RC2Parameters.java 6 private int bits; field in class:RC2Parameters
16 int bits)
19 this.bits = bits;
24 return bits;

Completed in 412 milliseconds

1 2 3 4 5 6 7 8 91011>>