| /dalvik/dx/src/com/android/dx/dex/code/form/ |
| Form21s.java | 92 BitSet bits = new BitSet(1); local
94 bits.set(0, unsignedFitsInByte(regs.get(0).getReg()));
95 return bits;
|
| Form22b.java | 94 BitSet bits = new BitSet(2); local
96 bits.set(0, unsignedFitsInByte(regs.get(0).getReg()));
97 bits.set(1, unsignedFitsInByte(regs.get(1).getReg()));
98 return bits;
|
| Form22s.java | 94 BitSet bits = new BitSet(2); local
96 bits.set(0, unsignedFitsInNibble(regs.get(0).getReg()));
97 bits.set(1, unsignedFitsInNibble(regs.get(1).getReg()));
98 return bits;
|
| Form31c.java | 118 BitSet bits = new BitSet(sz); local
122 bits.set(0, compat);
125 bits.set(0, compat);
126 bits.set(1, compat);
130 return bits;
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3bitset.h | 43 /** How many bits in the elements
47 /** How many bits in a nible of bits
71 /// Pointer to the allocated array of bits for this bit set, which
79 pANTLR3_BITWORD bits; member in struct:ANTLR3_BITSET_LIST_struct
89 /// The actual bits themselves
|
| /external/boringssl/src/crypto/asn1/ |
| a_bitstr.c | 70 int ret,j,bits,len; local
81 bits=(int)a->flags&0x07;
90 if (j & 0x01) bits=0;
91 else if (j & 0x02) bits=1;
92 else if (j & 0x04) bits=2;
93 else if (j & 0x08) bits=3;
94 else if (j & 0x10) bits=4;
95 else if (j & 0x20) bits=5;
96 else if (j & 0x40) bits=6;
97 else if (j & 0x80) bits=7
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| FixedPointUtil.java | 35 int bits = getCombSize(c); local
36 int d = (bits + minWidth - 1) / minWidth;
|
| /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/clang/test/CodeGenCXX/ |
| 2007-01-06-PtrMethodInit.cpp | 57 PRUint8 bits; member in struct:EventDispatchData
|
| /external/deqp/framework/common/ |
| tcuFloatFormat.cpp | 130 //! For normal numbers this is the number of significand bits, but
139 //! significand bits and minimum exponent of the floatformat. Round up if
239 const deUint64 bits = deUint64(deLdExp(frac, shift)); local
240 const deUint64 whole = bits >> m_fractionBits;
241 const deUint64 fraction = bits & ((deUint64(1) << m_fractionBits) - 1);
|
| /external/deqp/framework/opengl/ |
| gluFboRenderContext.cpp | 40 const tcu::IVec4 bits = tcu::getTextureFormatBitDepth(glu::mapGLInternalFormat(colorFormat)); local
41 return tcu::PixelFormat(bits[0], bits[1], bits[2], bits[3]);
46 const tcu::IVec4 bits = tcu::getTextureFormatBitDepth(glu::mapGLInternalFormat(depthStencilFormat)); local
47 *depthBits = bits[0];
48 *stencilBits = bits[3];
68 const tcu::IVec4 bits = tcu::getTextureFormatBitDepth(glu::mapGLInternalFormat(format)); local
71 config.redBits != bits[0]
107 const tcu::IVec4 bits = tcu::getTextureFormatBitDepth(glu::mapGLInternalFormat(format)); local
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/form/ |
| Form11n.java | 94 BitSet bits = new BitSet(1); local
96 bits.set(0, unsignedFitsInNibble(regs.get(0).getReg()));
97 return bits;
|
| Form21c.java | 124 BitSet bits = new BitSet(sz); local
128 bits.set(0, compat);
131 bits.set(0, compat);
132 bits.set(1, compat);
136 return bits;
|
| Form21h.java | 90 // Where the high bits are depends on the category of the target.
92 int bits = cb.getIntBits(); local
93 return ((bits & 0xffff) == 0);
95 long bits = cb.getLongBits(); local
96 return ((bits & 0xffffffffffffL) == 0);
104 BitSet bits = new BitSet(1); local
106 bits.set(0, unsignedFitsInByte(regs.get(0).getReg()));
107 return bits;
115 short bits; local
117 // Where the high bits are depends on the category of the target
[all...] |
| Form21s.java | 93 BitSet bits = new BitSet(1); local
95 bits.set(0, unsignedFitsInByte(regs.get(0).getReg()));
96 return bits;
|
| Form22b.java | 95 BitSet bits = new BitSet(2); local
97 bits.set(0, unsignedFitsInByte(regs.get(0).getReg()));
98 bits.set(1, unsignedFitsInByte(regs.get(1).getReg()));
99 return bits;
|
| Form22s.java | 95 BitSet bits = new BitSet(2); local
97 bits.set(0, unsignedFitsInNibble(regs.get(0).getReg()));
98 bits.set(1, unsignedFitsInNibble(regs.get(1).getReg()));
99 return bits;
|
| Form31c.java | 119 BitSet bits = new BitSet(sz); local
123 bits.set(0, compat);
126 bits.set(0, compat);
127 bits.set(1, compat);
131 return bits;
|
| Form32s.java | 99 BitSet bits = new BitSet(2); local
101 bits.set(0, unsignedFitsInByte(regs.get(0).getReg()));
102 bits.set(1, unsignedFitsInByte(regs.get(1).getReg()));
103 return bits;
|
| Form41c.java | 121 BitSet bits = new BitSet(sz); local
125 bits.set(0, compat);
128 bits.set(0, compat);
129 bits.set(1, compat);
133 return bits;
|
| /external/elfutils/src/backends/ |
| aarch64_retval.c | 57 int bits; local
58 if (((bits = 8 * dwarf_bytesize (die)) < 0
59 && (bits = dwarf_bitsize (die)) < 0)
60 || bits % 8 != 0)
63 *sizep = bits / 8;
330 to the least significant bits of register v[NSRN]. */
359 bits in x[NGRN]. */
|
| /external/elfutils/src/tests/ |
| allregs.c | 76 int bits; member in struct:reginfo
104 int bits, int type)
120 state->info[regno].bits = bits;
135 int bits, int type)
138 printf ("%5d => %s register %s%s %s %d bits\n",
140 dwarf_encoding_string (type), bits);
180 printf ("\t%3d: %s%s (%s), %s %d bits\n",
185 state.info[i].bits);
|
| /external/flac/libFLAC/ |
| fixed.c | 51 /* rbps stands for residual bits per sample
60 unsigned bits; /* the number of bits required to represent a number */ local
61 int fracbits; /* the number of bits of rbps that comprise the fractional part */
71 * The above two things tell us 1) n fits in 16 bits; 2) err/n > 1.
80 /* err now holds err/n with fracbits fractional bits */
83 * Whittle err down to 16 bits max. 16 significant bits is enough for
87 bits = FLAC__bitmath_ilog2(err)+1;
88 if(bits > 16)
139 unsigned bits; \/* the number of bits required to represent a number *\/ local
[all...] |
| /external/freetype/src/gzip/ |
| infblock.c | 15 #define bits word.what.Bits macro
27 3. There is an implied maximum of 7 bits for the bit length table and
28 15 bits for the actual data.
36 zero distance codes, which is sent as one code of zero bits in
41 cannot be used though, since there is no length base or extra bits
43 However, static trees define 32 codes (all 5 bits) to fill out the
47 8. The five bits following the block type is really the number of
49 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits
55 11. Correction: 4 Bits: # of Bit Length codes - 4 (4 - 19
[all...] |
| /external/google-tv-pairing-protocol/java/src/com/google/polo/wire/json/ |
| Base64.java | 74 int bits = 0; local
88 bits = chr - 65;
93 bits = chr - 71;
98 bits = chr + 4;
100 bits = 62;
102 bits = 63;
107 quantum = (quantum << 6) | (byte) bits;
|
