Home
last modified time | relevance | path

Searched refs:bits_ (Results 1 – 25 of 30) sorted by relevance

12

/external/v8/src/
Dhydrogen-gvn.h26 SideEffects() : bits_(0) { in SideEffects()
27 DCHECK(kNumberOfFlags + kNumberOfSpecials == sizeof(bits_) * CHAR_BIT); in SideEffects()
29 explicit SideEffects(GVNFlagSet flags) : bits_(flags.ToIntegral()) {} in SideEffects()
30 bool IsEmpty() const { return bits_ == 0; } in IsEmpty()
32 return (bits_ & MaskFlag(flag)) != 0; in ContainsFlag()
35 return (bits_ & MaskSpecial(special)) != 0; in ContainsSpecial()
37 bool ContainsAnyOf(SideEffects set) const { return (bits_ & set.bits_) != 0; } in ContainsAnyOf()
38 void Add(SideEffects set) { bits_ |= set.bits_; } in Add()
39 void AddSpecial(int special) { bits_ |= MaskSpecial(special); } in AddSpecial()
40 void RemoveFlag(GVNFlag flag) { bits_ &= ~MaskFlag(flag); } in RemoveFlag()
[all …]
Ddata-flow.h198 : it_(target->bits_ == NULL in Iterator()
200 : target->bits_) { } in Iterator()
208 GrowableBitVector() : bits_(NULL) { } in GrowableBitVector()
210 : bits_(new(zone) BitVector(length, zone)) { } in GrowableBitVector()
214 return bits_->Contains(value); in Contains()
219 bits_->Add(value); in Add()
228 void Clear() { if (bits_ != NULL) bits_->Clear(); } in Clear()
234 return bits_ != NULL && bits_->length() > value; in InBitsRange()
239 int new_length = bits_ == NULL ? kInitialLength : bits_->length(); in EnsureCapacity()
242 if (bits_ != NULL) new_bits->CopyFrom(*bits_); in EnsureCapacity()
[all …]
Dsafepoint-table.h20 SafepointEntry() : info_(0), bits_(NULL) {} in SafepointEntry()
22 SafepointEntry(unsigned info, uint8_t* bits) : info_(info), bits_(bits) { in SafepointEntry()
26 bool is_valid() const { return bits_ != NULL; } in is_valid()
29 return info_ == other.info_ && bits_ == other.bits_; in Equals()
34 bits_ = NULL; in Reset()
69 return bits_; in bits()
77 uint8_t* bits_; variable
Dutils.h849 explicit EnumSet(T bits = 0) : bits_(bits) {}
850 bool IsEmpty() const { return bits_ == 0; }
851 bool Contains(E element) const { return (bits_ & Mask(element)) != 0; }
853 return (bits_ & set.bits_) != 0;
855 void Add(E element) { bits_ |= Mask(element); }
856 void Add(const EnumSet& set) { bits_ |= set.bits_; }
857 void Remove(E element) { bits_ &= ~Mask(element); }
858 void Remove(const EnumSet& set) { bits_ &= ~set.bits_; }
859 void RemoveAll() { bits_ = 0; }
860 void Intersect(const EnumSet& set) { bits_ &= set.bits_; }
[all …]
Dsafepoint-table.cc24 if (bits_[i] != SafepointTable::kNoRegisters) return true; in HasRegisters()
35 return (bits_[byte_index] & (1 << bit_index)) != 0; in HasRegisterAt()
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_bitvector.h29 void clear() { bits_ = 0; } in clear()
30 void setAll() { bits_ = ~(basic_int_t)0; } in setAll()
31 bool empty() const { return bits_ == 0; } in empty()
35 basic_int_t old = bits_; in setBit()
36 bits_ |= mask(idx); in setBit()
37 return bits_ != old; in setBit()
42 basic_int_t old = bits_; in clearBit()
43 bits_ &= ~mask(idx); in clearBit()
44 return bits_ != old; in clearBit()
47 bool getBit(uptr idx) const { return (bits_ & mask(idx)) != 0; } in getBit()
[all …]
/external/webp/src/utils/
Dbit_reader_inl.h102 br->bits_ += BITS; in VP8LoadNewBytes()
114 if (br->bits_ < 0) { in VP8GetBit()
118 const int pos = br->bits_; in VP8GetBit()
143 br->bits_ -= shift; in VP8GetBit()
152 if (br->bits_ < 0) { in VP8GetSigned()
156 const int pos = br->bits_; in VP8GetSigned()
160 br->bits_ -= 1; in VP8GetSigned()
Dbit_reader.c32 br->bits_ = -8; // to load the very first 8bits in VP8InitBitReader()
80 br->bits_ += 8; in VP8LoadFinalBytes()
84 br->bits_ += 8; in VP8LoadFinalBytes()
Dbit_writer.c258 vp8l_atype_t lbits = bw->bits_; in VP8LWriteBits()
289 bw->bits_ = lbits | ((vp8l_atype_t)bits << used); in VP8LWriteBits()
298 *bw->cur_++ = (uint8_t)bw->bits_; in VP8LBitWriterFinish()
299 bw->bits_ >>= 8; in VP8LBitWriterFinish()
Dbit_writer.h83 vp8l_atype_t bits_; // bit accumulator member
Dbit_reader.h73 int bits_; // number of valid bits left member
/external/v8/src/compiler/
Dinstruction-selector.h67 Features() : bits_(0) {} in Features()
68 explicit Features(unsigned bits) : bits_(bits) {} in Features()
69 explicit Features(CpuFeature f) : bits_(1u << f) {} in Features()
70 Features(CpuFeature f1, CpuFeature f2) : bits_((1u << f1) | (1u << f2)) {} in Features()
72 bool Contains(CpuFeature f) const { return (bits_ & (1u << f)); } in Contains()
75 unsigned bits_;
/external/openfst/src/extensions/ngram/
Dbitmap-index.cc68 return sum + __builtin_popcountll(bits_[end_word] & in Rank1()
88 int nth = nth_bit(bits_[offset], rembits); in Select1()
111 int nth = nth_bit(~bits_[offset], remzeros); in Select0()
126 bits_ = bits; in BuildIndex()
145 block_popcount += __builtin_popcountll(bits_[j] & mask); in BuildIndex()
/external/openfst/src/include/fst/extensions/ngram/
Dbitmap-index.h47 BitmapIndex() : bits_(NULL), size_(0) { } in BitmapIndex()
50 return (bits_[index >> kStorageLogBitSize] & in Get()
168 const uint64* bits_; variable
/external/protobuf/gtest/include/gtest/internal/
Dgtest-internal.h390 fp.u_.bits_ = bits; in ReinterpretBits()
402 const Bits &bits() const { return u_.bits_; } in bits()
405 Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } in exponent_bits()
408 Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } in fraction_bits()
411 Bits sign_bit() const { return kSignBitMask & u_.bits_; } in sign_bit()
431 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) in AlmostEquals()
439 Bits bits_; // The bits that represent the number. member
/external/v8/src/arm64/
Dsimulator-arm64.h214 bits_ = 0;
215 DCHECK(sizeof(argument) <= sizeof(bits_));
216 memcpy(&bits_, &argument, sizeof(argument));
221 DCHECK(sizeof(argument) == sizeof(bits_));
222 memcpy(&bits_, &argument, sizeof(argument));
232 DCHECK(sizeof(kFP64SignallingNaN) == sizeof(bits_));
233 memcpy(&bits_, &kFP64SignallingNaN, sizeof(kFP64SignallingNaN));
235 DCHECK(sizeof(argument) <= sizeof(bits_));
236 memcpy(&bits_, &argument, sizeof(argument));
244 int64_t bits() const { return bits_; }
[all …]
/external/gtest/include/gtest/internal/
Dgtest-internal.h289 fp.u_.bits_ = bits; in ReinterpretBits()
304 const Bits &bits() const { return u_.bits_; } in bits()
307 Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } in exponent_bits()
310 Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } in fraction_bits()
313 Bits sign_bit() const { return kSignBitMask & u_.bits_; } in sign_bit()
333 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) in AlmostEquals()
341 Bits bits_; // The bits that represent the number. member
/external/google-breakpad/src/testing/gtest/include/gtest/internal/
Dgtest-internal.h374 fp.u_.bits_ = bits; in ReinterpretBits()
386 const Bits &bits() const { return u_.bits_; } in bits()
389 Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } in exponent_bits()
392 Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } in fraction_bits()
395 Bits sign_bit() const { return kSignBitMask & u_.bits_; } in sign_bit()
415 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) in AlmostEquals()
423 Bits bits_; // The bits that represent the number. member
/external/llvm/utils/unittest/googletest/include/gtest/internal/
Dgtest-internal.h403 fp.u_.bits_ = bits; in ReinterpretBits()
415 const Bits &bits() const { return u_.bits_; } in bits()
418 Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } in exponent_bits()
421 Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } in fraction_bits()
424 Bits sign_bit() const { return kSignBitMask & u_.bits_; } in sign_bit()
444 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) in AlmostEquals()
452 Bits bits_; // The bits that represent the number. member
/external/mesa3d/src/gtest/include/gtest/internal/
Dgtest-internal.h374 fp.u_.bits_ = bits; in ReinterpretBits()
386 const Bits &bits() const { return u_.bits_; } in bits()
389 Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } in exponent_bits()
392 Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } in fraction_bits()
395 Bits sign_bit() const { return kSignBitMask & u_.bits_; } in sign_bit()
415 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) in AlmostEquals()
423 Bits bits_; // The bits that represent the number. member
/external/webp/src/dsp/
Dlossless.c755 const int tile_width = 1 << transform->bits_; in PredictorInverseTransform()
758 const int tiles_per_row = VP8LSubSampleSize(width, transform->bits_); in PredictorInverseTransform()
760 transform->data_ + (y >> transform->bits_) * tiles_per_row; in PredictorInverseTransform()
1156 const int tile_width = 1 << transform->bits_; in ColorSpaceInverseTransform()
1160 const int tiles_per_row = VP8LSubSampleSize(width, transform->bits_); in ColorSpaceInverseTransform()
1163 transform->data_ + (y >> transform->bits_) * tiles_per_row; in ColorSpaceInverseTransform()
1191 const int bits_per_pixel = 8 >> transform->bits_; \
1195 const int pixels_per_byte = 1 << transform->bits_; \
1267 if (in == out && transform->bits_ > 0) { in COLOR_INDEX_INVERSE()
1275 VP8LSubSampleSize(transform->xsize_, transform->bits_); in COLOR_INDEX_INVERSE()
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
DBitSet.java56 public BitSet(long[] bits_) { in BitSet() argument
57 bits = bits_; in BitSet()
/external/webp/src/dec/
Dvp8li.h37 int bits_; // subsampling bits defining transform window. member
Dvp8l.c954 const int final_num_colors = 1 << (8 >> transform->bits_); in ExpandColorMap()
1000 transform->bits_ = VP8LReadBits(br, 3) + 2; in ReadTransform()
1002 transform->bits_), in ReadTransform()
1004 transform->bits_), in ReadTransform()
1014 transform->bits_ = bits; in ReadTransform()
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
DBitSet.java73 public BitSet(long[] bits_) { in BitSet() argument
74 bits = bits_; in BitSet()

12