| /external/llvm/unittests/ADT/ |
| APSIntTest.cpp | 29 const uint64_t *Bits = Wide.getRawData();
32 EXPECT_EQ(Bits, D.getRawData()); // Verify that "Wide" was really moved.
38 Bits = Wide.getRawData();
41 EXPECT_EQ(Bits, A.getRawData()); // Verify that "Wide" was really moved.
|
| /dalvik/dx/junit-tests/com/android/dx/util/ |
| BitsTest.java | 23 assertEquals(label(0), 0, Bits.makeBitSet(0).length);
26 assertEquals(label(i), 1, Bits.makeBitSet(i).length);
30 assertEquals(label(i), 2, Bits.makeBitSet(i).length);
38 assertEquals(label(i), expect, Bits.makeBitSet(i).length);
49 Bits.getMax(new int[expect]));
54 int[] bits = Bits.makeBitSet(100); local
57 assertFalse(label(i), Bits.get(bits, i));
62 int[] bits = Bits.makeBitSet(100) local
73 int[] bits = Bits.makeBitSet(100); local
86 int[] bits = Bits.makeBitSet(50); local
103 int[] bits = Bits.makeBitSet(100); local
131 int[] bits = Bits.makeBitSet(100); local
146 int[] bits = Bits.makeBitSet(100); local
171 int[] bits = Bits.makeBitSet(i); local
190 int[] bits = Bits.makeBitSet(i); local
213 int[] bits = new int[100]; local
221 int[] bits = new int[100]; local
229 int[] bits = new int[100]; local
237 int[] bits = new int[100]; local
248 int[] bits = new int[100]; local
259 int[] bits = new int[100]; local
270 int[] bits = new int[100]; local
278 int[] bits = new int[100]; local
289 int[] bits = new int[100]; local
[all...] |
| /external/freetype/src/gzip/ |
| inftrees.h | 22 Byte Exop; /* number of extra bits or operation */
23 Byte Bits; /* number of bits in this code or subcode */
40 uIntf *, /* bits tree desired/actual depth */
41 inflate_huft * FAR *, /* bits tree result */
|
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| BitIntSet.java | 27 int[] bits; field in class:BitIntSet
35 bits = Bits.makeBitSet(max);
41 Bits.set(bits, value, true);
50 if (value >= Bits.getMax(bits)) {
51 int[] newBits = Bits.makeBitSet(
52 Math.max(value + 1, 2 * Bits.getMax(bits)));
[all...] |
| Bits.java | 22 public final class Bits {
26 private Bits() {
31 * Constructs a bit set to contain bits up to the given index (exclusive).
44 * @param bits {@code non-null;} bit set in question
47 public static int getMax(int[] bits) {
48 return bits.length * 0x20;
54 * @param bits {@code non-null;} bit set to operate on
58 public static boolean get(int[] bits, int idx) {
61 return (bits[arrayIdx] & bit) != 0;
67 * @param bits {@code non-null;} bit set to operate o
[all...] |
| /dalvik/dx/src/com/android/dx/util/ |
| BitIntSet.java | 27 int[] bits; field in class:BitIntSet
35 bits = Bits.makeBitSet(max);
41 Bits.set(bits, value, true);
50 if (value >= Bits.getMax(bits)) {
51 int[] newBits = Bits.makeBitSet(
52 Math.max(value + 1, 2 * Bits.getMax(bits)));
[all...] |
| Bits.java | 22 public final class Bits {
26 private Bits() {
31 * Constructs a bit set to contain bits up to the given index (exclusive).
44 * @param bits {@code non-null;} bit set in question
47 public static int getMax(int[] bits) {
48 return bits.length * 0x20;
54 * @param bits {@code non-null;} bit set to operate on
58 public static boolean get(int[] bits, int idx) {
61 return (bits[arrayIdx] & bit) != 0;
67 * @param bits {@code non-null;} bit set to operate o
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/util/ |
| BitIntSet.java | 27 int[] bits; field in class:BitIntSet
35 bits = Bits.makeBitSet(max);
41 Bits.set(bits, value, true);
50 if (value >= Bits.getMax(bits)) {
51 int[] newBits = Bits.makeBitSet(
52 Math.max(value + 1, 2 * Bits.getMax(bits)));
[all...] |
| Bits.java | 22 public final class Bits {
26 private Bits() {
31 * Constructs a bit set to contain bits up to the given index (exclusive).
44 * @param bits {@code non-null;} bit set in question
47 public static int getMax(int[] bits) {
48 return bits.length * 0x20;
54 * @param bits {@code non-null;} bit set to operate on
58 public static boolean get(int[] bits, int idx) {
61 return (bits[arrayIdx] & bit) != 0;
67 * @param bits {@code non-null;} bit set to operate o
[all...] |
| /external/lldb/test/lang/c/bitfields/ |
| main.c | 13 struct Bits
28 printf("%lu", sizeof(struct Bits));
30 struct Bits bits; local
33 bits.b1 = i; //// break $source:$line
35 bits.b2 = i; //// break $source:$line
37 bits.b3 = i; //// break $source:$line
39 bits.b4 = i; //// break $source:$line
41 bits.b5 = i; //// break $source:$line
43 bits.b6 = i; //// break $source:$lin
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SparseBitVector.h | 30 /// storing the elements that have non-zero bits set. In order to make this
37 /// enormous amounts of time with a large amount of bits. Other structures that
58 BitWord Bits[BITWORDS_PER_ELEMENT];
63 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
69 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
77 if (Bits[i] != RHS.Bits[i])
86 // Return the bits that make up word Idx in our element.
89 return Bits[Idx];
98 if (Bits[i]
[all...] |
| PackedVector.h | 30 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
37 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) {
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
47 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
50 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
51 if (Bits[(Idx << (BitNum-1)) + BitNum-1])
56 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) {
59 Bits.set((Idx << (BitNum-1)) + BitNum-1);
63 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| HashFunctions.h | 110 typedef typename IntTypes<sizeof(T)>::UnsignedType Bits;
113 return intHash(bitwise_cast<Bits>(key));
117 return bitwise_cast<Bits>(a) == bitwise_cast<Bits>(b);
|
| /external/chromium_org/third_party/skia/src/utils/ |
| SkFloatUtils.h | 57 /** Bits is a unsigned integer the same size as the floating point number. */
58 typedef typename SkTypeWithSize<sizeof(RawType) * CHAR_BIT>::UInt Bits;
60 /** # of bits in a number. */
63 /** # of fraction bits in a number. */
66 /** # of exponent bits in a number. */
70 static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1);
72 /** The mask for the fraction bits. */
73 static const Bits kFractionBitMask =
74 ~static_cast<Bits>(0) >> (kExponentBitCount + 1)
129 Bits bits; member in union:SkFloatingPoint::FloatingPointUnion
[all...] |
| /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/eigen/bench/ |
| sparse_randomsetter.cpp | 85 const int Bits = 6;
88 dostuff<RandomSetter<EigenSparseMatrix,StdMapTraits,Bits> >("std::map ", sm1);
89 dostuff<RandomSetter<EigenSparseMatrix,GnuHashMapTraits,Bits> >("gnu::hash_map", sm1);
90 dostuff<RandomSetter<EigenSparseMatrix,GoogleDenseHashMapTraits,Bits> >("google::dense", sm1);
91 dostuff<RandomSetter<EigenSparseMatrix,GoogleSparseHashMapTraits,Bits> >("google::sparse", sm1);
94 // RandomSetter<EigenSparseMatrix,GnuHashMapTraits,Bits> set1(sm1);
103 // RandomSetter<EigenSparseMatrix,GoogleDenseHashMapTraits,Bits> set1(sm1);
112 // RandomSetter<EigenSparseMatrix,GoogleSparseHashMapTraits,Bits> set1(sm1);
|
| /external/llvm/lib/MC/ |
| SubtargetFeature.cpp | 153 void SetImpliedBits(uint64_t &Bits, const SubtargetFeatureKV *FeatureEntry,
159 Bits |= FE.Value;
160 SetImpliedBits(Bits, &FE, FeatureTable);
169 void ClearImpliedBits(uint64_t &Bits, const SubtargetFeatureKV *FeatureEntry,
175 Bits &= ~FE.Value;
176 ClearImpliedBits(Bits, &FE, FeatureTable);
182 /// bits.
184 SubtargetFeatures::ToggleFeature(uint64_t Bits, const StringRef Feature,
192 if ((Bits & FeatureEntry->Value) == FeatureEntry->Value) {
193 Bits &= ~FeatureEntry->Value
[all...] |
| /external/llvm/lib/Target/Sparc/MCTargetDesc/ |
| SparcMCCodeEmitter.cpp | 86 unsigned Bits = getBinaryCodeForInstr(MI, Fixups, STI);
90 OS << (char)(Bits >> 24);
91 Bits <<= 8;
|
| /external/llvm/lib/Target/SystemZ/MCTargetDesc/ |
| SystemZMCCodeEmitter.cpp | 57 // the low 12 bits are encoded before the high 8 bits.
106 uint64_t Bits = getBinaryCodeForInstr(MI, Fixups, STI);
111 OS << uint8_t(Bits >> ShiftValue);
|
| /external/skia/src/utils/ |
| SkFloatUtils.h | 57 /** Bits is a unsigned integer the same size as the floating point number. */
58 typedef typename SkTypeWithSize<sizeof(RawType) * CHAR_BIT>::UInt Bits;
60 /** # of bits in a number. */
63 /** # of fraction bits in a number. */
66 /** # of exponent bits in a number. */
70 static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1);
72 /** The mask for the fraction bits. */
73 static const Bits kFractionBitMask =
74 ~static_cast<Bits>(0) >> (kExponentBitCount + 1)
129 Bits bits; member in union:SkFloatingPoint::FloatingPointUnion
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| LocalVariableExtractor.java | 19 import com.android.dexgen.util.Bits;
66 this.workSet = Bits.makeBitSet(maxLabel);
77 label = Bits.findFirst(workSet, 0)) {
78 Bits.clear(workSet, label);
187 Bits.set(workSet, succ);
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| LocalVariableExtractor.java | 19 import com.android.dx.util.Bits;
66 this.workSet = Bits.makeBitSet(maxLabel);
77 label = Bits.findFirst(workSet, 0)) {
78 Bits.clear(workSet, label);
187 Bits.set(workSet, succ);
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| LocalVariableExtractor.java | 19 import com.android.dx.util.Bits;
66 this.workSet = Bits.makeBitSet(maxLabel);
77 label = Bits.findFirst(workSet, 0)) {
78 Bits.clear(workSet, label);
187 Bits.set(workSet, succ);
|
| /external/chromium_org/third_party/skia/include/effects/ |
| SkLayerDrawLooper.h | 23 * Bits specifies which aspects of the layer's paint should replace the
29 enum Bits {
|
| /external/llvm/lib/TableGen/ |
| TGParser.h | 36 std::vector<unsigned> Bits;
41 : Name(N), Bits(B), Value(V), Loc(L) {
|
