/external/llvm/include/llvm/ADT/ |
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 | 32 BitWord *Bits; // Actual bits. 33 unsigned Size; // Size of bitvector in bits. 48 WordRef = &b.Bits[Idx / BITWORD_SIZE]; 75 Bits = 0; 78 /// BitVector ctor - Creates a bitvector of specified number of bits. All 79 /// bits are initialized to the specified value. 82 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); 83 init_words(Bits, Capacity, t); 91 Bits = 0 [all...] |
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...] |
/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/clang/lib/Basic/ |
LangOptions.cpp | 18 #define LANGOPT(Name, Bits, Default, Description) Name = Default; 19 #define ENUM_LANGOPT(Name, Type, Bits, Default, Description) set##Name(Default); 24 #define LANGOPT(Name, Bits, Default, Description) 25 #define BENIGN_LANGOPT(Name, Bits, Default, Description) Name = Default; 26 #define BENIGN_ENUM_LANGOPT(Name, Type, Bits, Default, Description) \
|
/external/elfutils/libelf/ |
gelf_xlate.c | 81 bit. We need only functions for 16, 32, and 64 bits. The 87 #define FETCH(Bits, ptr) (*(const uint##Bits##_t *) ptr) 88 #define STORE(Bits, ptr, val) (*(uint##Bits##_t *) ptr = val) 99 #define FETCH(Bits, ptr) (((const union unaligned *) ptr)->u##Bits) 100 #define STORE(Bits, ptr, val) (((union unaligned *) ptr)->u##Bits = val) 110 #define FUNDAMENTAL(NAME, Name, Bits) \ [all...] |
abstract.h | 52 #define Ehdr(Bits, Ext) \ 53 START (Bits, Ehdr, Ext##Ehdr) \ 56 TYPE_NAME (ElfW2(Bits, Ext##Half), e_type) \ 57 TYPE_NAME (ElfW2(Bits, Ext##Half), e_machine) \ 58 TYPE_NAME (ElfW2(Bits, Ext##Word), e_version) \ 59 TYPE_NAME (ElfW2(Bits, Ext##Addr), e_entry) \ 60 TYPE_NAME (ElfW2(Bits, Ext##Off), e_phoff) \ 61 TYPE_NAME (ElfW2(Bits, Ext##Off), e_shoff) \ 62 TYPE_NAME (ElfW2(Bits, Ext##Word), e_flags) \ 63 TYPE_NAME (ElfW2(Bits, Ext##Half), e_ehsize) [all...] |
exttypes.h | 73 #define START(Bits, Name, EName) typedef struct { 74 #define END(Bits, Name) } ElfW2(Bits, Name)
|
libelfP.h | 71 #define __elfw2_(Bits, Name) __elf##Bits##_##Name 72 #define elfw2_(Bits, Name) elf##Bits##_##Name 73 #define ElfW2_(Bits, Name) Elf##Bits##_##Name 74 #define ELFW2_(Bits, Name) ELF##Bits##_##Name 75 #define ELFW_(Name, Bits) Name##Bits [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...] |
/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...] |
/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...] |
/external/clang/include/clang/Basic/ |
LangOptions.h | 31 #define LANGOPT(Name, Bits, Default, Description) unsigned Name : Bits; 32 #define ENUM_LANGOPT(Name, Type, Bits, Default, Description) 38 #define LANGOPT(Name, Bits, Default, Description) 39 #define ENUM_LANGOPT(Name, Type, Bits, Default, Description) \ 40 unsigned Name : Bits; 82 #define LANGOPT(Name, Bits, Default, Description) 83 #define ENUM_LANGOPT(Name, Type, Bits, Default, Description) \
|
/external/v8/src/arm/ |
constants-arm.h | 210 // The bits for bit 7-4 for some type 0 miscellaneous instructions. 212 // With bits 22-21 01. 218 // With bits 22-21 11. 223 // Instruction encoding bits and masks. 363 // svc (formerly swi) provides a 24bit immediate value. Use bits 22:0 for 502 // bits. 528 // Get the raw instruction bits. 533 // Set the raw instruction bits to value. 538 // Read one particular bit out of the instruction bits. 543 // Read a bit field's value out of the instruction bits [all...] |
/external/llvm/include/llvm/ |
Attributes.h | 46 Attributes() : Bits(0) { } 47 explicit Attributes(uint64_t Val) : Bits(Val) { } 48 /*implicit*/ Attributes(Attribute::AttrConst Val) : Bits(Val.v) { } 50 operator const void *() const { return Bits ? this : 0; } 51 bool isEmptyOrSingleton() const { return (Bits & (Bits - 1)) == 0; } 53 return Bits == Attrs.Bits; 56 return Bits != Attrs.Bits; [all...] |
/external/llvm/lib/Support/ |
FoldingSet.cpp | 42 /// profiled bits and their ordering defined by memcmp(). 59 Bits.append(reinterpret_cast<unsigned *>(&Ptr), 63 Bits.push_back(I); 66 Bits.push_back(I); 86 Bits.push_back(unsigned(I >> 32)); 91 Bits.push_back(Size); 100 Bits.append(Base, Base + Units); 112 Bits.push_back(V); 121 Bits.push_back(V); 126 // With the leftover bits [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/llvm/lib/MC/ |
SubtargetFeature.cpp | 191 void SetImpliedBits(uint64_t &Bits, const SubtargetFeatureKV *FeatureEntry, 200 Bits |= FE.Value; 201 SetImpliedBits(Bits, &FE, FeatureTable, FeatureTableSize); 210 void ClearImpliedBits(uint64_t &Bits, const SubtargetFeatureKV *FeatureEntry, 219 Bits &= ~FE.Value; 220 ClearImpliedBits(Bits, &FE, FeatureTable, FeatureTableSize); 226 /// bits. 228 SubtargetFeatures::ToggleFeature(uint64_t Bits, const StringRef Feature, 236 if ((Bits & FeatureEntry->Value) == FeatureEntry->Value) { 237 Bits &= ~FeatureEntry->Value [all...] |
/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;
|
/dalvik/dx/src/com/android/dx/cf/code/ |
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...] |
/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/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/protobuf/gtest/include/gtest/internal/ |
gtest-internal.h | 322 // For float, there are 8 exponent bits and 23 fraction bits. 324 // For double, there are 11 exponent bits and 52 fraction bits. 337 typedef typename TypeWithSize<sizeof(RawType)>::UInt Bits; 341 // # of bits in a number. 344 // # of fraction bits in a number. 348 // # of exponent bits in a number. 352 static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1) 402 const Bits &bits() const { return u_.bits_; } function in class:testing::internal::FloatingPoint [all...] |