| /external/elfutils/libelf/ |
| abstract.h | 31 #define Ehdr(Bits, Ext) \
32 START (Bits, Ehdr, Ext##Ehdr) \
35 TYPE_NAME (ElfW2(Bits, Ext##Half), e_type) \
36 TYPE_NAME (ElfW2(Bits, Ext##Half), e_machine) \
37 TYPE_NAME (ElfW2(Bits, Ext##Word), e_version) \
38 TYPE_NAME (ElfW2(Bits, Ext##Addr), e_entry) \
39 TYPE_NAME (ElfW2(Bits, Ext##Off), e_phoff) \
40 TYPE_NAME (ElfW2(Bits, Ext##Off), e_shoff) \
41 TYPE_NAME (ElfW2(Bits, Ext##Word), e_flags) \
42 TYPE_NAME (ElfW2(Bits, Ext##Half), e_ehsize)
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_ceill.c | 35 uint64_t o = u.bits.manh; \
36 u.bits.manh += (c); \
37 if (u.bits.manh < o) \
38 u.bits.exp++; \
43 uint64_t o = u.bits.manh; \
44 u.bits.manh += (c); \
45 if (u.bits.manh < o) { \
46 u.bits.exp++; \
47 u.bits.manh |= 1llu << (LDBL_MANH_SIZE - 1); \
58 int e = u.bits.exp - LDBL_MAX_EXP + 1
[all...] |
| s_floorl.c | 35 uint64_t o = u.bits.manh; \
36 u.bits.manh += (c); \
37 if (u.bits.manh < o) \
38 u.bits.exp++; \
43 uint64_t o = u.bits.manh; \
44 u.bits.manh += (c); \
45 if (u.bits.manh < o) { \
46 u.bits.exp++; \
47 u.bits.manh |= 1llu << (LDBL_MANH_SIZE - 1); \
58 int e = u.bits.exp - LDBL_MAX_EXP + 1
[all...] |
| 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...] |
| e_fmodl.c | 62 * for an explicit integer bit in front of the fractional bits.
75 sx = ux.bits.sign;
78 if((uy.bits.exp|uy.bits.manh|uy.bits.manl)==0 || /* y=0 */
79 (ux.bits.exp == BIAS + LDBL_MAX_EXP) || /* or x not finite */
80 (uy.bits.exp == BIAS + LDBL_MAX_EXP &&
81 ((uy.bits.manh&~LDBL_NBIT)|uy.bits.manl)!=0)) /* or y is NaN */
83 if(ux.bits.exp<=uy.bits.exp)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| BitSet.java | 43 * is no way to access the internal bits (which I need for speed)
45 * Consider defining set degree. Without access to the bits, I must
49 * than this.bits.length.
54 protected final static int BITS = 64; // number of bits / long
62 protected final static int MOD_MASK = BITS - 1;
64 /** The actual data bits */
65 protected long bits[]; field in class:BitSet
67 /** Construct a bitset of size one word (64 bits) */
69 this(BITS);
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/cst/ |
| 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/ |
| 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/clang/test/SemaCXX/ |
| ms_wide_bitfield.cpp | 4 char a : 9; // expected-error{{width of bit-field 'a' (9 bits) exceeds size of its type (8 bits)}}
5 int b : 33; // expected-error{{width of bit-field 'b' (33 bits) exceeds size of its type (32 bits)}}
6 bool c : 9; // expected-error{{width of bit-field 'c' (9 bits) exceeds size of its type (8 bits)}}
|
| /external/llvm/lib/Fuzzer/test/ |
| 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) {
|
| /frameworks/base/core/java/com/android/internal/util/ |
| BitwiseOutputStream.java | 32 // The current position offset, in bits, from the msb in byte 0.
73 * @param bits additional bits to be accommodated
75 private void possExpand(int bits) {
76 if ((mPos + bits) < mEnd) return;
77 byte[] newBuf = new byte[(mPos + bits) >>> 2];
89 * @param bits the amount of data to write (gte 0, lte 8)
90 * @param data to write, will be masked to expose only bits param from lsb
92 public void write(int bits, int data) throws AccessException {
93 if ((bits < 0) || (bits > 8))
[all...] |
| /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/llvm/include/llvm/Support/ELFRelocs/ |
| Lanai.def | 10 // 21-bit symbol relocation with last two bits masked to 0
16 // Upper 16-bits of a symbolic relocation
18 // Lower 16-bits of a symbolic relocation
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/bits/ |
| elfclass.h | 6 # error "Never use <bits/elfclass.h> directly; include <link.h> instead."
9 #include <bits/wordsize.h>
13 /* The entries in the .hash table always have a size of 32 bits. */
|
| endian.h | 4 # error "Never use <bits/endian.h> directly; include <endian.h> instead."
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/i386-linux-gnu/bits/ |
| elfclass.h | 6 # error "Never use <bits/elfclass.h> directly; include <link.h> instead."
9 #include <bits/wordsize.h>
13 /* The entries in the .hash table always have a size of 32 bits. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/bits/ |
| elfclass.h | 6 # error "Never use <bits/elfclass.h> directly; include <link.h> instead."
9 #include <bits/wordsize.h>
13 /* The entries in the .hash table always have a size of 32 bits. */
|
| /external/swiftshader/third_party/LLVM/lib/Target/Alpha/ |
| AlphaInstrFormats.td | 31 class InstAlpha<bits<6> op, string asmstr, InstrItinClass itin> : Instruction {
32 field bits<32> Inst;
41 class MForm<bits<6> opcode, bit load, string asmstr, list<dag> pattern, InstrItinClass itin>
47 bits<5> Ra;
48 bits<16> disp;
49 bits<5> Rb;
55 class MfcForm<bits<6> opcode, bits<16> fc, string asmstr, InstrItinClass itin>
57 bits<5> Ra;
65 class MfcPForm<bits<6> opcode, bits<16> fc, string asmstr, InstrItinClass itin>
[all...] |
| /art/runtime/interpreter/mterp/x86/ |
| op_const.S | 2 movl 2(rPC), %eax # grab all 32 bits at once
|
| /art/runtime/interpreter/mterp/x86_64/ |
| op_const.S | 2 movl 2(rPC), %eax # grab all 32 bits at once
|
| /external/compiler-rt/lib/builtins/ |
| popcountdi2.c | 17 /* Returns: count of 1 bits */
24 /* Every 2 bits holds the sum of every pair of bits (32) */
26 /* Every 4 bits holds the sum of every 4-set of bits (3 significant bits) (16) */
28 /* Every 8 bits holds the sum of every 8-set of bits (4 significant bits) (8) */
30 /* The lower 32 bits hold four 16 bit sums (5 significant bits). *
[all...] |
| /external/llvm/test/TableGen/ |
| BitsInitOverflow.td | 4 bits<2> X = 5; // bitfield is too small, reject
|
| /external/swiftshader/third_party/LLVM/test/TableGen/ |
| BitsInitOverflow.td | 4 bits<2> X = 5; // bitfield is too small, reject
|
| LetInsideMultiClasses.td | 4 class Instruction<bits<4> opc, string Name> {
5 bits<4> opcode = opc;
10 multiclass basic_r<bits<4> opc> {
20 multiclass basic_ss<bits<4> opc> {
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/ |
| lastlog.h | 2 which we define in <bits/utmp.h>. */
|
