/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 | 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...] |
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
|
/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/webkit/Source/JavaScriptCore/wtf/ |
H A D | TCPageMap.h | 41 // The BITS parameter should be the number of bits required to hold 43 // page offset fits in lower 12 bits), BITS == 20. 60 template <int BITS> 69 array_ = reinterpret_cast<void**>((*allocator)(sizeof(void*) << BITS)); 70 memset(array_, 0, sizeof(void*) << BITS); 82 // REQUIRES "k" is in range "[0,2^BITS-1]". 91 // REQUIRES "k" is in range "[0,2^BITS-1]". 101 template <int BITS> 104 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf. 108 static const int LEAF_BITS = BITS [all...] |
/external/zlib/contrib/infback9/ |
H A D | infback9.c | 157 #define BITS(n) \ macro 285 lastblock = BITS(1); 287 switch (BITS(2)) { 349 state->nlen = BITS(5) + 257; 351 state->ndist = BITS(5) + 1; 353 state->ncode = BITS(4) + 4; 366 state->lens[order[state->have++]] = (unsigned short)BITS(3); 387 here = lencode[BITS(lenbits)]; 406 copy = 3 + BITS(2); 413 copy = 3 + BITS( [all...] |
/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...] |
H A D | inflate.c | 450 #define BITS(n) \ macro 492 the requested bits are not available. The typical use of the BITS macros 496 ... do something with BITS(n) ... 500 input left to load n bits into the accumulator, or it continues. BITS(n) 505 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. 521 keep[want++] = BITS(n); 610 ((BITS(8) << 8) + (hold >> 8)) % 31) { 615 if (BITS(4) != Z_DEFLATED) { 621 len = BITS(4) + 8; 782 state->last = BITS( [all...] |
/external/zlib/ |
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...] |
H A D | inflate.c | 505 #define BITS(n) \ macro 547 the requested bits are not available. The typical use of the BITS macros 551 ... do something with BITS(n) ... 555 input left to load n bits into the accumulator, or it continues. BITS(n) 560 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. 576 keep[want++] = BITS(n); 665 ((BITS(8) << 8) + (hold >> 8)) % 31) { 670 if (BITS(4) != Z_DEFLATED) { 676 len = BITS(4) + 8; 839 state->last = BITS( [all...] |
/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/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/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/qemu/distrib/sdl-1.2.12/src/hermes/ |
H A D | mmx_main.asm | 10 BITS 32 label
|
H A D | x86_main.asm | 12 BITS 32 label
|
/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/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | BitSet.as | 35 protected static const BITS:uint = 32; // number of bits / int 43 protected static const MOD_MASK:uint = BITS - 1; 120 var bitPosition:int = bitNumber & MOD_MASK; // bitNumber mod BITS 134 for (var bit:int = BITS - 1; bit >= 0; bit--) { 235 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/openssl/crypto/bn/asm/ |
H A D | ppc-mont.pl | 30 $BITS= 32; 31 $BNSZ= $BITS/8; 49 $BITS= 64; 50 $BNSZ= $BITS/8;
|
H A D | ppc.pl | 106 $BITS= 32; 107 $BNSZ= $BITS/8; 129 $BITS= 64; 130 $BNSZ= $BITS/8; 1635 li r8,$BITS 1654 $SHRI r9,r5,`$BITS/2` # r9 = dh 1660 $SHRI r8,r3,`$BITS/2` #r8 = (h>>BN_BITS4) 1661 $SHRI r11,r4,`$BITS/2` #r11= (l&BN_MASK2h)>>BN_BITS4 1667 $CLRU r8,r8,`$BITS/2` #q = BN_MASK2l 1673 $CLRU r10,r5,`$BITS/ [all...] |