/external/elfutils/backends/ |
H A D | ppc64_corenote.c | 1 #define BITS 64 macro
|
H A D | sparc64_corenote.c | 1 #define BITS 64 macro
|
H A D | ppc_corenote.c | 36 #ifndef BITS 37 # define BITS 32 macro 40 # define BITS 64 macro 48 { .offset = at * BITS/8, .regno = dwreg, .count = n, .bits = BITS } 65 #define PRSTATUS_REGS_SIZE (BITS / 8 * 48) 98 #if BITS == 32
|
H A D | sparc_corenote.c | 36 #ifndef BITS 37 # define BITS 32 macro 40 # define BITS 64 macro 46 { .offset = at * BITS/8, .regno = dwreg, .count = n, .bits = BITS } 51 #if BITS == 32 62 #define PRSTATUS_REGS_SIZE (BITS / 8 * (32 + (BITS == 32 ? 6 : 4))) 66 #if BITS == 32 81 #if BITS [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRBitSet.h | 32 #define BITS (sizeof(NSUInteger) * 8) macro
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRBitSet.h | 32 #define BITS (sizeof(NSUInteger) * 8) macro
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRBitSet.h | 32 #define BITS (sizeof(NSUInteger) * 8) macro
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRBitSet.h | 33 #define BITS (sizeof(NSUInteger) * 8) macro
|
/external/qemu/distrib/sdl-1.2.15/src/hermes/ |
H A D | mmx_main.asm | 10 BITS 32 label
|
H A D | x86_main.asm | 12 BITS 32 label
|
H A D | mmxp2_32.asm | 21 BITS 32 label
|
H A D | x86p_16.asm | 13 BITS 32 label
|
H A D | x86p_32.asm | 12 BITS 32 label
|
/external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
H A D | BitSet.pm | 15 Readonly my $BITS => 64; 16 sub BITS { return $BITS } subroutine 26 Readonly my $MOD_MASK => BITS - 1; 49 $bits = '0' x BITS; 190 return $self->num_bits() / $self->BITS; 209 $self->bits =~ /.{BITS}/gxms
|
/external/apache-http/src/org/apache/commons/codec/binary/ |
H A D | BinaryCodec.java | 70 private static final int[] BITS = {BIT_0, BIT_1, BIT_2, BIT_3, BIT_4, BIT_5, BIT_6, BIT_7}; field in class:BinaryCodec 177 for (int bits = 0; bits < BITS.length; ++bits) { 179 l_raw[ii] |= BITS[bits]; 204 for (int bits = 0; bits < BITS.length; ++bits) { 206 l_raw[ii] |= BITS[bits]; 233 for (int bits = 0; bits < BITS.length; ++bits) { 234 if ((raw[ii] & BITS[bits]) == 0) { 263 for (int bits = 0; bits < BITS.length; ++bits) { 264 if ((raw[ii] & BITS[bits]) == 0) {
|
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/win64/tests/ |
H A D | win64-dataref.asm | 0 BITS 64 1 BITS 64 label
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | BitSet.cs | 50 private const int BITS = 64; // number of bits / long field in class:Antlr.Runtime.BitSet 60 private const int MOD_MASK = BITS - 1; 67 : this(BITS) { 168 int bitPosition = bitNumber & MOD_MASK; // bitNumber mod BITS 181 for (int bit = BITS - 1; bit >= 0; bit--) { 289 return bit >> LOG_BITS; // bit / BITS
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | BitSet.cs | 52 private const int BITS = 64; // number of bits / long field in class:Antlr.Runtime.BitSet 62 private const int MOD_MASK = BITS - 1; 69 : this( BITS ) 190 int bitPosition = bitNumber & MOD_MASK; // bitNumber mod BITS 207 for ( int bit = BITS - 1; bit >= 0; bit-- ) 342 return bit >> LOG_BITS; // bit / BITS
|
/external/chromium_org/third_party/zlib/ |
H A D | infback.c | 181 #define BITS(n) \ macro 291 state->last = BITS(1); 293 switch (BITS(2)) { 352 state->nlen = BITS(5) + 257; 354 state->ndist = BITS(5) + 1; 356 state->ncode = BITS(4) + 4; 371 state->lens[order[state->have++]] = (unsigned short)BITS(3); 392 here = state->lencode[BITS(state->lenbits)]; 411 copy = 3 + BITS(2); 418 copy = 3 + BITS( [all...] |
/external/chromium_org/tools/traceline/traceline/ |
H A D | stubs.asm | 7 BITS 32 label
|
/external/qemu/distrib/zlib-1.2.3/ |
H A D | infback.c | 181 #define BITS(n) \ macro 291 state->last = BITS(1); 293 switch (BITS(2)) { 352 state->nlen = BITS(5) + 257; 354 state->ndist = BITS(5) + 1; 356 state->ncode = BITS(4) + 4; 371 state->lens[order[state->have++]] = (unsigned short)BITS(3); 392 this = state->lencode[BITS(state->lenbits)]; 411 copy = 3 + BITS(2); 418 copy = 3 + BITS( [all...] |
/external/zlib/src/ |
H A D | infback.c | 190 #define BITS(n) \ macro 300 state->last = BITS(1); 302 switch (BITS(2)) { 361 state->nlen = BITS(5) + 257; 363 state->ndist = BITS(5) + 1; 365 state->ncode = BITS(4) + 4; 380 state->lens[order[state->have++]] = (unsigned short)BITS(3); 401 here = state->lencode[BITS(state->lenbits)]; 419 copy = 3 + BITS(2); 426 copy = 3 + BITS( [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | BitSet.java | 37 protected final static int BITS = 64; // number of bits / long field in class:BitSet 45 protected final static int MOD_MASK = BITS - 1; 52 this(BITS); 162 int bitPosition = bitNumber & MOD_MASK; // bitNumber mod BITS 184 for (int bit = BITS - 1; bit >= 0; bit--) { 293 return bit >> LOG_BITS; // bit / BITS
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | BitSet.java | 54 protected final static int BITS = 64; // number of bits / long field in class:BitSet 62 protected final static int MOD_MASK = BITS - 1; 69 this(BITS); 169 int bitPosition = bitNumber & MOD_MASK; // bitNumber mod BITS 205 for (int bit = BITS - 1; bit >= 0; bit--) { 572 return bit >> LOG_BITS; // bit / BITS
|
/external/chromium_org/third_party/libwebp/utils/ |
H A D | bit_reader.h | 35 // ahead (actually, we cache BITS of them ahead. See below). There's two 41 // Example, for BITS=16: here is the content of value_ for both strategies: 45 // <- 8b -><- 8b -><- BITS bits -> || <- 8b+3b -><- 8b -><- 13 bits -> 58 // -> we're back to height active 'value_' bits (marked 'v') and BITS cached 64 // BITS can be any multiple of 8 from 8 to 56 (inclusive). 72 #define BITS 16 macro 74 #define BITS 56 macro 76 #define BITS 24 macro 78 #define BITS 24 macro 84 #define BITS macro [all...] |