| /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 | 30 import com.android.dx.util.Bits;
123 * @see Bits
128 int[] result = Bits.makeBitSet(sz);
132 Bits.set(result, at, true);
145 * set new bits in the work set during the process.
157 int offset = Bits.findFirst(workSet, 0);
161 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;
314 int[] workSet = Bits.makeBitSet(maxLabel);
315 int[] tracebackSet = Bits.makeBitSet(maxLabel);
319 Bits.set(workSet, one.getLabel());
337 label = Bits.findFirst(workSet, 0)) {
357 if (Bits.get(tracebackSet, predLabel)) {
365 if (!Bits.get(workSet, predLabel)) {
374 Bits.set(tracebackSet, label);
389 Bits.clear(workSet, label);
390 Bits.clear(tracebackSet, label)
[all...] |
| /external/dexmaker/src/dx/java/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 | 59 struct BitsTag Bits;
64 Bits.Kind = kind;
65 Bits.Size = size;
69 unsigned size() const { return Bits.Size; }
72 return Bits.Kind == Overloaded
78 return Bits.Kind == SubstTemplateTemplateParm
84 return Bits.Kind == SubstTemplateTemplateParmPack
556 // No bits are available!
|
| /external/compiler-rt/lib/ubsan/ |
| ubsan_value.h | 106 /// value. Remaining bits are log_2(bit width). The value representation is
110 /// A floating-point type. Low 16 bits are bit width. The value
162 const unsigned Bits = getType().getIntegerBitWidth();
163 return Bits <= InlineBits;
170 const unsigned Bits = getType().getFloatBitWidth();
171 return Bits <= InlineBits;
|
| /external/llvm/include/llvm/ADT/ |
| 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...] |
| FoldingSet.h | 40 /// establish the unique bits of data for the node. The Profile method is
41 /// passed a FoldingSetNodeID object which is used to gather the bits. Just
78 /// exists, then call FindNodeOrInsertPos with a FoldingSetNodeID of the bits to
192 /// this function to gather data bits for the given node.
282 /// profiled bits and their ordering defined by memcmp().
290 /// FoldingSetNodeID - This class is used to gather all the unique data bits of
291 /// a node. When all the bits are gathered this class is used to produce a
295 /// Bits - Vector of all the data bits that make the node unique.
297 SmallVector<unsigned, 32> Bits;
[all...] |
| SmallBitVector.h | 26 /// pointer-sized field, which is directly used as a plain collection of bits
34 // pointer to memory containing size, allocation size, and the array of bits.
38 // The number of bits in this class.
42 // remaining bits are used for the small-mode representation.
45 // A few more bits are used to store the size of the bit set in small mode.
46 // Theoretically this is a ceil-log2. These bits are encoded in the most
47 // significant bits of the raw bits.
52 // The remaining bits are used to store the actual set in small mode.
104 // Return all the bits used for the "small" representation; this include
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64BranchFixupPass.cpp | 31 /// Return the worst case padding that could result from unknown offset bits.
32 /// This does not include alignment padding caused by known offset bits.
35 /// @param KnownBits Number of known low offset bits.
71 /// The number of low bits in Offset that are known to be exact. The
72 /// remaining bits of Offset are an upper bound.
82 /// Compute the number of known offset bits internally to this block.
86 unsigned Bits = Unalign ? Unalign : KnownBits;
87 // If the block size isn't a multiple of the known bits, assume the
89 if (Size & ((1u << Bits) - 1))
90 Bits = countTrailingZeros(Size)
[all...] |
| AArch64ISelDAGToDAG.cpp | 131 // could have 2^64 as an actual operand. Need 65 bits of precision.
178 uint32_t Bits;
184 if (!A64Imms::isLogicalImm(RegWidth, CN->getZExtValue(), Bits))
187 Imm = CurDAG->getTargetConstant(Bits, MVT::i32);
|
| AArch64InstrInfo.cpp | 614 uint64_t Bits = static_cast<uint64_t>(abs64(NumBytes));
616 .addImm(0xffff & Bits).addImm(0)
619 Bits >>= 16;
620 if (Bits & 0xffff) {
623 .addImm(0xffff & Bits).addImm(1)
627 Bits >>= 16;
628 if (Bits & 0xffff) {
631 .addImm(0xffff & Bits).addImm(2)
635 Bits >>= 16;
636 if (Bits & 0xffff)
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMTargetTransformInfo.cpp | 150 unsigned Bits = Ty->getPrimitiveSizeInBits();
151 if (Bits == 0 || Bits > 32)
|
| /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/llvm/lib/TableGen/ |
| TGLexer.h | 46 Bit, Bits, Class, Code, Dag, Def, Foreach, Defm, Field, In, Int, Let, List,
|
| /external/llvm/lib/Target/AArch64/Utils/ |
| AArch64BaseInfo.cpp | 776 // Try to parse an S<op0>_<op1>_<Cn>_<Cm>_<op2> register name, where the bits
787 uint32_t Bits;
792 Bits = (Op0 << 14) | (Op1 << 11) | (CRn << 7) | (CRm << 3) | Op2;
795 return Bits;
799 A64SysReg::SysRegMapper::toString(uint32_t Bits, bool &Valid) const {
801 if (SysRegPairs[i].Value == Bits) {
808 if (InstPairs[i].Value == Bits) {
814 uint32_t Op0 = (Bits >> 14) & 0x3;
815 uint32_t Op1 = (Bits >> 11) & 0x7;
816 uint32_t CRn = (Bits >> 7) & 0xf
[all...] |
| /external/valgrind/main/VEX/pub/ |
| libvex_guest_x86.h | 56 three bits are relevant.
109 FC3210 contains the C3, C2, C1 and C0 bits in the same place they
110 are in the FPU's status word. (bits 14, 10, 9, 8 respectively).
111 All other bits should be zero. The relevant mask to select just
112 those bits is 0x4700. To select C3, C2 and C0 only, the mask is
257 } Bits;
|
| /external/clang/lib/AST/ |
| ExprCXX.cpp | [all...] |
| /external/llvm/lib/CodeGen/ |
| LiveIntervalAnalysis.cpp | 655 ArrayRef<const uint32_t*> Bits;
658 Bits = getRegMaskBitsInBlock(MBB->getNumber());
661 Bits = getRegMaskBits();
679 // *SlotI overlaps LI. Collect mask bits.
687 UsableRegs.clearBitsNotInMask(Bits[SlotI-Slots.begin()]);
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.h | 152 unsigned Bits;
155 CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits,
157 Mask(mask), BB(bb), Bits(bits), ExtraWeight(Weight) { }
187 return C1.Bits > C2.Bits;
|
| /external/llvm/utils/TableGen/ |
| FixedLenDecoderEmitter.cpp | 144 static bit_value_t bitFromBits(const BitsInit &bits, unsigned index) {
145 if (BitInit *bit = dyn_cast<BitInit>(bits.getBit(index)))
152 static void dumpBits(raw_ostream &o, const BitsInit &bits) {
153 for (unsigned index = bits.getNumBits(); index > 0; --index) {
154 switch (bitFromBits(bits, index - 1)) {
171 BitsInit *bits = def.getValueAsBitsInit(str); local
172 return *bits;
189 /// words, what other remaining bits to look at. The FilterChooser eventually
224 unsigned NumBits; // number of bits to filter
225 bool Mixed; // a mixed region contains both set and unset bits
[all...] |
| /external/open-vcdiff/gtest/include/gtest/internal/ |
| gtest-internal.h | 324 // For float, there are 8 exponent bits and 23 fraction bits.
326 // For double, there are 11 exponent bits and 52 fraction bits.
339 typedef typename TypeWithSize<sizeof(RawType)>::UInt Bits;
343 // # of bits in a number.
346 // # of fraction bits in a number.
350 // # of exponent bits in a number.
354 static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1)
404 const Bits &bits() const { return u_.bits_; } function in class:testing::internal::FloatingPoint
[all...] |
