/external/elfutils/backends/ |
ppc64_corenote.c | 1 #define BITS 64
|
sparc64_corenote.c | 1 #define BITS 64
|
sparc_corenote.c | 36 #ifndef BITS 37 # define BITS 32 40 # define BITS 64 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 == 3 [all...] |
ppc_corenote.c | 36 #ifndef BITS 37 # define BITS 32 40 # define BITS 64 48 { .offset = at * BITS/8, .regno = dwreg, .count = n, .bits = BITS } 65 #define PRSTATUS_REGS_SIZE (BITS / 8 * 48) 69 { .offset = 0, .regno = 32, .count = 32, .bits = 64 }, /* f0-f31 */ 70 { .offset = 32 * 8 + 4, .regno = 65, .count = 1, .bits = 32 } /* fpscr */ 77 { .offset = 0, .regno = 1124, .count = 32, .bits = 128 } [all...] |
/external/webp/src/utils/ |
bit_reader.h | 28 // However, since range_ is only 8bit, we only need an active window of 8 bits 29 // for value_. Left bits (MSB) gets zeroed and shifted away when value_ falls 30 // below 128, range_ is updated, and fresh bits read from the bitstream are 32 // To avoid reading the fresh bits one by one (slow), we cache a few of them 33 // ahead (actually, we cache BITS of them ahead. See below). There's two 34 // strategies regarding how to shift these looked-ahead fresh bits into the 37 // bits at a fixed, right-justified, position. 39 // Example, for BITS=16: here is the content of value_ for both strategies: 43 // <- 8b -><- 8b -><- BITS bits -> || <- 8b+3b -><- 8b -><- 13 bits - 147 bit_t bits; local [all...] |
/external/apache-http/src/org/apache/commons/codec/binary/ |
BinaryCodec.java | 70 private static final int[] BITS = {BIT_0, BIT_1, BIT_2, BIT_3, BIT_4, BIT_5, BIT_6, BIT_7}; 177 for (int bits = 0; bits < BITS.length; ++bits) { 178 if (ascii[jj - bits] == '1') { 179 l_raw[ii] |= BITS[bits]; 204 for (int bits = 0; bits < BITS.length; ++bits) [all...] |
/external/webkit/Source/JavaScriptCore/wtf/ |
TCPageMap.h | 39 // the bits every time. 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]" [all...] |
/external/openssl/crypto/sha/asm/ |
sha512-ia64.pl | 25 # reason lower 32 bits are deposited to upper half of 64-bit register 69 $BITS=8*$SZ; 83 $BITS=8*$SZ; 169 $code.=<<___ if ($BITS==64); 197 $t0="t0", $t1="t1", $code.=<<___ if ($BITS==32); 224 $t0="A", $t1="E", $code.=<<___ if ($BITS==64); 507 $t0="t0", $t1="t1", $code.=<<___ if ($BITS==32); 524 $t0="A", $t1="E", $code.=<<___ if ($BITS==64); 595 if ($BITS==64) { 605 print<<___ if ($BITS==32) [all...] |
/external/zlib/src/contrib/infback9/ |
infback9.c | 56 unsigned sym, bits, low, size; local 69 bits = 9; 70 inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work); 76 bits = 5; 77 inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work); 94 printf("{%u,%u,%d}", lenfix[low].op, lenfix[low].bits, 105 printf("{%u,%u,%d}", distfix[low].op, distfix[low].bits, 120 bits = 0; \ 143 hold += (unsigned long)(*next++) << bits; \ 144 bits += 8; 235 unsigned bits; \/* bits in bit buffer *\/ local [all...] |
/external/harfbuzz_ng/src/ |
hb-set-private.hh | 289 for (unsigned int j = 0; i < BITS; j++) 291 return i * BITS + j; 298 for (unsigned int j = BITS; j; j--) 300 return (i - 1) * BITS + (j - 1); 307 static const unsigned int BITS = (1 << SHIFT); 308 static const unsigned int MASK = BITS - 1; 309 static const unsigned int ELTS = (MAX_G + 1 + (BITS - 1)) / BITS; 318 ASSERT_STATIC (sizeof (elt_t) * 8 == BITS);
|
/external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
BitSet.pm | 14 # number of bits / long 15 Readonly my $BITS => 64; 16 sub BITS { return $BITS } 26 Readonly my $MOD_MASK => BITS - 1; 30 has 'bits' => ( 46 my $bits; 48 # Construct a bitset of size one word (64 bits) 49 $bits = '0' x BITS; [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
infback.c | 83 unsigned sym, bits; local 94 bits = 9; 95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); 101 bits = 5; 102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); 126 bits = state->bits; \ 137 state->bits = bits; \ 144 bits = 0; 253 unsigned bits; \/* bits in bit buffer *\/ local [all...] |
inflate.c | 30 * - Add comments on state->bits assertion in inffast.c 122 state->bits = 0; 128 int ZEXPORT inflatePrime(strm, bits, value) 130 int bits; 137 if (bits > 16 || state->bits + bits > 32) return Z_STREAM_ERROR; 138 value &= (1L << bits) - 1; 139 state->hold += value << state->bits; 140 state->bits += bits 215 unsigned sym, bits; local 563 unsigned bits; \/* bits in bit buffer *\/ local [all...] |
/external/zlib/src/ |
infback.c | 92 unsigned sym, bits; local 103 bits = 9; 104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); 110 bits = 5; 111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); 135 bits = state->bits; \ 146 state->bits = bits; \ 153 bits = 0; 262 unsigned bits; \/* bits in bit buffer *\/ local [all...] |
inflate.c | 30 * - Add comments on state->bits assertion in inffast.c 120 state->bits = 0; 165 /* set number of window bits, free window if different */ 229 int ZEXPORT inflatePrime(strm, bits, value) 231 int bits; 238 if (bits < 0) { 240 state->bits = 0; 243 if (bits > 16 || state->bits + bits > 32) return Z_STREAM_ERROR 270 unsigned sym, bits; local 613 unsigned bits; \/* bits in bit buffer *\/ local [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
BitSet.cs | 50 private const int BITS = 64; // number of bits / long 60 private const int MOD_MASK = BITS - 1; 62 /** <summary>The actual data bits</summary> */ 65 /** <summary>Construct a bitset of size one word (64 bits)</summary> */ 67 : this(BITS) { 71 public BitSet(ulong[] bits) { 72 _bits = bits; 83 * <param name="nbits">The size of the bitset in bits</param> 138 /** <summary>Grows the set to a larger number of bits.</summary [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
BitSet.cs | 52 private const int BITS = 64; // number of bits / long 62 private const int MOD_MASK = BITS - 1; 64 /** <summary>The actual data bits</summary> */ 67 /** <summary>Construct a bitset of size one word (64 bits)</summary> */ 69 : this( BITS ) 75 public BitSet( ulong[] bits ) 77 _bits = bits; 89 * <param name="nbits">The size of the bitset in bits</param> 153 /** <summary>Grows the set to a larger number of bits.</summary [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
BitSet.java | 37 protected final static int BITS = 64; // number of bits / long 45 protected final static int MOD_MASK = BITS - 1; 47 /** The actual data bits */ 48 protected long bits[]; field in class:BitSet 50 /** Construct a bitset of size one word (64 bits) */ 52 this(BITS); 57 bits = bits_; 70 * @param nbits The size of the bitset in bits 73 bits = new long[((nbits - 1) >> LOG_BITS) + 1] [all...] |
/external/qemu/distrib/sdl-1.2.15/src/hermes/ |
mmx_main.asm | 10 BITS 32
|
x86_main.asm | 12 BITS 32
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
ANTLRBitSet.h | 32 #define BITS (sizeof(NSUInteger) * 8) 48 * @param nbits The size of the ANTLRBitSet in bits
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
ANTLRBitSet.h | 32 #define BITS (sizeof(NSUInteger) * 8) 48 * @param nbits The size of the ANTLRBitSet in bits
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
ANTLRBitSet.h | 32 #define BITS (sizeof(NSUInteger) * 8) 48 * @param nbits The size of the ANTLRBitSet in bits
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRBitSet.h | 33 #define BITS (sizeof(NSUInteger) * 8) 49 * @param nbits The size of the ANTLRBitSet in bits
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
BitSet.as | 35 protected static const BITS:uint = 32; // number of bits / int 43 protected static const MOD_MASK:uint = BITS - 1; 45 /** The actual data bits */ 46 protected var bits:Array; 49 public function BitSet(bits:Array = null) { 50 if (bits == null) { 51 this.bits = new Array(); 54 this.bits = new Array(); 55 for (var i:int = 0; i < bits.length; i++) [all...] |