| /dalvik/dx/src/com/android/dx/util/_tests/ |
| _Bits.java | 19 import com.android.dx.util.Bits;
24 * Test the class {@code com.android.dx.util.Bits}.
29 assertEquals(label(0), 0, Bits.makeBitSet(0).length);
32 assertEquals(label(i), 1, Bits.makeBitSet(i).length);
36 assertEquals(label(i), 2, Bits.makeBitSet(i).length);
44 assertEquals(label(i), expect, Bits.makeBitSet(i).length);
55 Bits.getMax(new int[expect]));
60 int[] bits = Bits.makeBitSet(100); local
63 assertFalse(label(i), Bits.get(bits, i))
68 int[] bits = Bits.makeBitSet(100); local
79 int[] bits = Bits.makeBitSet(100); local
92 int[] bits = Bits.makeBitSet(50); local
109 int[] bits = Bits.makeBitSet(100); local
137 int[] bits = Bits.makeBitSet(100); local
152 int[] bits = Bits.makeBitSet(100); local
177 int[] bits = Bits.makeBitSet(i); local
196 int[] bits = Bits.makeBitSet(i); local
219 int[] bits = new int[100]; local
227 int[] bits = new int[100]; local
235 int[] bits = new int[100]; local
243 int[] bits = new int[100]; local
254 int[] bits = new int[100]; local
265 int[] bits = new int[100]; local
276 int[] bits = new int[100]; local
284 int[] bits = new int[100]; local
295 int[] bits = new int[100]; local
[all...] |
| /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/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
57 BitWord Bits[BITWORDS_PER_ELEMENT];
62 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
68 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
76 if (Bits[i] != RHS.Bits[i])
85 // Return the bits that make up word Idx in our element.
88 return Bits[Idx];
97 if (Bits[i]
[all...] |
| PackedVector.h | 30 static T getValue(const llvm::BitVector &Bits, unsigned Idx) {
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
37 static void setValue(llvm::BitVector &Bits, unsigned Idx, T val) {
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
47 static T getValue(const llvm::BitVector &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(llvm::BitVector &Bits, unsigned Idx, T val) {
59 Bits.set((Idx << (BitNum-1)) + BitNum-1);
63 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i)
[all...] |
| BitVector.h | 31 BitWord *Bits; // Actual bits.
32 unsigned Size; // Size of bitvector in bits.
47 WordRef = &b.Bits[Idx / BITWORD_SIZE];
74 Bits = 0;
77 /// BitVector ctor - Creates a bitvector of specified number of bits. All
78 /// bits are initialized to the specified value.
81 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
82 init_words(Bits, Capacity, t);
90 Bits = 0
[all...] |
| SmallBitVector.h | 25 /// pointer-sized field, which is directly used as a plain collection of bits
33 // pointer to memory containing size, allocation size, and the array of bits.
37 // The number of bits in this class.
41 // remaining bits are used for the small-mode representation.
44 // A few more bits are used to store the size of the bit set in small mode.
45 // Theoretically this is a ceil-log2. These bits are encoded in the most
46 // significant bits of the raw bits.
51 // The remaining bits are used to store the actual set in small mode.
103 // Return all the bits used for the "small" representation; this include
[all...] |
| /external/llvm/lib/TableGen/ |
| TGParser.h | 36 std::vector<unsigned> Bits;
41 : Name(N), Bits(B), Value(V), Loc(L) {
|
| /external/llvm/lib/Target/PowerPC/MCTargetDesc/ |
| PPCMCCodeEmitter.cpp | 64 unsigned Bits = getBinaryCodeForInstr(MI, Fixups);
68 OS << (char)(Bits >> 24);
69 Bits <<= 8;
132 // Encode (imm, reg) as a memri, which has the low 16-bits as the
133 // displacement and the next 5 bits as the register #.
150 // Encode (imm, reg) as a memrix, which has the low 14-bits as the
151 // displacement and the next 5 bits as the register #.
|
| /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/llvm/lib/MC/ |
| SubtargetFeature.cpp | 192 void SetImpliedBits(uint64_t &Bits, const SubtargetFeatureKV *FeatureEntry,
201 Bits |= FE.Value;
202 SetImpliedBits(Bits, &FE, FeatureTable, FeatureTableSize);
211 void ClearImpliedBits(uint64_t &Bits, const SubtargetFeatureKV *FeatureEntry,
220 Bits &= ~FE.Value;
221 ClearImpliedBits(Bits, &FE, FeatureTable, FeatureTableSize);
227 /// bits.
229 SubtargetFeatures::ToggleFeature(uint64_t Bits, const StringRef Feature,
237 if ((Bits & FeatureEntry->Value) == FeatureEntry->Value) {
238 Bits &= ~FeatureEntry->Value
[all...] |
| /external/skia/include/effects/ |
| SkLayerDrawLooper.h | 15 * Bits specifies which aspects of the layer's paint should replace the
20 enum Bits {
|
| /external/valgrind/main/coregrind/m_initimg/ |
| simple_huffman.c | 15 * size of 32 bits). If I'm not mistaking, this should not be possible
22 * 12 bits per symbol (for 8 bit symbols), meaning a maximum of 384
74 UInt Bits;
102 * _Huffman_ReadBits() - Read bits from a bitstream.
106 UInt bits )
115 /* Extract bits */
117 for( count = 0; count < bits; ++ count )
136 * _Huffman_WriteBits() - Write bits to a bitstream.
140 UInt bits )
150 /* Append bits */
455 UInt bits, delta_bits, new_bits, code; local
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| RopTranslator.java | 39 import com.android.dexgen.util.Bits;
308 int[] workSet = Bits.makeBitSet(maxLabel);
309 int[] tracebackSet = Bits.makeBitSet(maxLabel);
313 Bits.set(workSet, one.getLabel());
331 label = Bits.findFirst(workSet, 0)) {
351 if (Bits.get(tracebackSet, predLabel)) {
359 if (!Bits.get(workSet, predLabel)) {
368 Bits.set(tracebackSet, label);
383 Bits.clear(workSet, label);
384 Bits.clear(tracebackSet, label)
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| BytecodeArray.java | 29 import com.android.dx.util.Bits;
122 * @see Bits
127 int[] result = Bits.makeBitSet(sz);
131 Bits.set(result, at, true);
144 * set new bits in the work set during the process.
156 int offset = Bits.findFirst(workSet, 0);
160 Bits.clear(workSet, offset);
[all...] |
| BasicBlocker.java | 24 import com.android.dx.util.Bits;
36 * {@code non-null;} work set; bits indicate offsets in need of
42 * {@code non-null;} live set; bits indicate potentially-live
49 * {@code non-null;} block start set; bits indicate the starts of
106 workSet = Bits.makeBitSet(sz);
107 liveSet = Bits.makeBitSet(sz);
108 blockSet = Bits.makeBitSet(sz);
277 next = Bits.findFirst(blockSet, at + 1);
282 if (Bits.get(liveSet, at)) {
336 Bits.set(workSet, 0)
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| RopTranslator.java | 40 import com.android.dx.util.Bits;
315 int[] workSet = Bits.makeBitSet(maxLabel);
316 int[] tracebackSet = Bits.makeBitSet(maxLabel);
320 Bits.set(workSet, one.getLabel());
338 label = Bits.findFirst(workSet, 0)) {
358 if (Bits.get(tracebackSet, predLabel)) {
366 if (!Bits.get(workSet, predLabel)) {
375 Bits.set(tracebackSet, label);
390 Bits.clear(workSet, label);
391 Bits.clear(tracebackSet, label)
[all...] |
| /external/chromium/sdch/open-vcdiff/src/gtest/internal/ |
| gtest-internal.h | 309 // For float, there are 8 exponent bits and 23 fraction bits.
311 // For double, there are 11 exponent bits and 52 fraction bits.
324 typedef typename TypeWithSize<sizeof(RawType)>::UInt Bits;
328 // # of bits in a number.
331 // # of fraction bits in a number.
335 // # of exponent bits in a number.
339 static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1)
389 const Bits &bits() const { return bits_; } function in class:testing::internal::FloatingPoint
[all...] |
| /external/clang/include/clang/AST/ |
| TemplateName.h | 57 } Bits;
63 Bits.Kind = kind;
64 Bits.Size = size;
68 unsigned size() const { return Bits.Size; }
71 return Bits.Kind == Overloaded
77 return Bits.Kind == SubstTemplateTemplateParm
83 return Bits.Kind == SubstTemplateTemplateParmPack
552 // No bits are available!
|
| /external/valgrind/main/none/tests/x86-linux/ |
| seg_override.c | 33 } Bits;
40 (unsigned long)ent->HighWord.Bits.BaseMid << 16 |
41 (unsigned long)ent->HighWord.Bits.BaseHi << 24);
45 unsigned int limit = ent->LimitLow | (ent->HighWord.Bits.LimitHi << 16);
46 if (ent->HighWord.Bits.Granularity) limit = (limit << 12) | 0xfff;
|
| /external/webkit/Source/JavaScriptCore/heap/ |
| MarkedBlock.h | 35 typedef uintptr_t Bits;
|
| /external/gtest/include/gtest/internal/ |
| gtest-internal.h | 327 // For float, there are 8 exponent bits and 23 fraction bits.
329 // For double, there are 11 exponent bits and 52 fraction bits.
342 typedef typename TypeWithSize<sizeof(RawType)>::UInt Bits;
346 // # of bits in a number.
349 // # of fraction bits in a number.
353 // # of exponent bits in a number.
357 static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1)
407 const Bits &bits() const { return bits_; } function in class:testing::internal::FloatingPoint
[all...] |
