| /external/v8/src/ |
| D | safepoint-table.h | 43 SafepointEntry() : info_(0), bits_(NULL) {} in SafepointEntry()
45 SafepointEntry(unsigned info, uint8_t* bits) : info_(info), bits_(bits) { in SafepointEntry()
49 bool is_valid() const { return bits_ != NULL; } in is_valid()
52 return info_ == other.info_ && bits_ == other.bits_; in Equals()
57 bits_ = NULL; in Reset()
92 return bits_; in bits()
100 uint8_t* bits_; variable
|
| D | utils.h | 931 explicit EnumSet(T bits = 0) : bits_(bits) {}
932 bool IsEmpty() const { return bits_ == 0; }
933 bool Contains(E element) const { return (bits_ & Mask(element)) != 0; }
935 return (bits_ & set.bits_) != 0;
937 void Add(E element) { bits_ |= Mask(element); }
938 void Add(const EnumSet& set) { bits_ |= set.bits_; }
939 void Remove(E element) { bits_ &= ~Mask(element); }
940 void Remove(const EnumSet& set) { bits_ &= ~set.bits_; }
941 void RemoveAll() { bits_ = 0; }
942 void Intersect(const EnumSet& set) { bits_ &= set.bits_; }
[all …]
|
| D | lithium-allocator.h | 404 GrowableBitVector() : bits_(NULL) { } in GrowableBitVector()
408 return bits_->Contains(value); in Contains()
413 bits_->Add(value); in Add()
420 return bits_ != NULL && bits_->length() > value; in InBitsRange()
425 int new_length = bits_ == NULL ? kInitialLength : bits_->length(); in EnsureCapacity()
428 if (bits_ != NULL) new_bits->CopyFrom(*bits_); in EnsureCapacity()
429 bits_ = new_bits; in EnsureCapacity()
432 BitVector* bits_; variable
|
| D | jsregexp.h | 240 SetRelation() : bits_(0) {} in SetRelation()
243 void SetElementsInFirstSet() { bits_ |= kInFirst; } in SetElementsInFirstSet()
244 void SetElementsInSecondSet() { bits_ |= kInSecond; } in SetElementsInSecondSet()
245 void SetElementsInBothSets() { bits_ |= kInBoth; } in SetElementsInBothSets()
250 bool Disjoint() { return (bits_ & kInBoth) == 0; } in Disjoint()
252 bool Equals() { return (bits_ & (kInFirst | kInSecond)) == 0; } in Equals()
254 bool Contains() { return (bits_ & kInSecond) == 0; } in Contains()
256 bool ContainedIn() { return (bits_ & kInFirst) == 0; } in ContainedIn()
258 return (bits_ == (kInFirst | kInSecond | kInBoth)); in NonTrivialIntersection()
260 int value() { return bits_; } in value()
[all …]
|
| D | safepoint-table.cc | 46 if (bits_[i] != SafepointTable::kNoRegisters) return true; in HasRegisters()
57 return (bits_[byte_index] & (1 << bit_index)) != 0; in HasRegisterAt()
|
| /external/valgrind/tsan/ |
| D | ts_simple_cache.h | 51 bits_[idx / 32] |= 1U << (idx % 32); in Insert()
53 bits_[idx / 32] &= ~(1U << (idx % 32)); in Insert()
59 *val = (bits_[idx / 32] >> (idx % 32)) & 1; in Lookup()
66 uint32_t bits_[(kSize + 31) / 32]; variable
|
| /external/chromium/sdch/open-vcdiff/src/gtest/internal/ |
| D | gtest-internal.h | 377 fp.bits_ = bits; in ReinterpretBits()
389 const Bits &bits() const { return bits_; } in bits()
392 Bits exponent_bits() const { return kExponentBitMask & bits_; } in exponent_bits()
395 Bits fraction_bits() const { return kFractionBitMask & bits_; } in fraction_bits()
398 Bits sign_bit() const { return kSignBitMask & bits_; } in sign_bit()
418 return DistanceBetweenSignAndMagnitudeNumbers(bits_, rhs.bits_) <= kMaxUlps; in AlmostEquals()
458 Bits bits_; // The bits that represent the number. member
|
| /external/protobuf/gtest/include/gtest/internal/ |
| D | gtest-internal.h | 390 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/chromium/third_party/libjingle/source/talk/p2p/base/ |
| D | stun.cc | 347 : StunAttribute(type, SIZE), bits_(0) { in StunUInt32Attribute()
352 return static_cast<bool>((bits_ >> index) & 0x1); in GetBit()
357 bits_ &= ~(1 << index); in SetBit()
358 bits_ |= value ? (1 << index) : 0; in SetBit()
362 if (!buf->ReadUInt32(&bits_)) in Read()
368 buf->WriteUInt32(bits_); in Write()
|
| D | stun.h | 234 uint32 value() const { return bits_; } in value()
236 void SetValue(uint32 bits) { bits_ = bits; } in SetValue()
245 uint32 bits_;
|
| /external/gtest/include/gtest/internal/ |
| D | gtest-internal.h | 374 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/ |
| D | gtest-internal.h | 394 fp.u_.bits_ = bits; in ReinterpretBits()
406 const Bits &bits() const { return u_.bits_; } in bits()
409 Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } in exponent_bits()
412 Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } in fraction_bits()
415 Bits sign_bit() const { return kSignBitMask & u_.bits_; } in sign_bit()
435 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) in AlmostEquals()
443 Bits bits_; // The bits that represent the number. member
|
| /external/chromium/testing/gtest/include/gtest/internal/ |
| D | gtest-internal.h | 368 fp.u_.bits_ = bits; in ReinterpretBits()
380 const Bits &bits() const { return u_.bits_; } in bits()
383 Bits exponent_bits() const { return kExponentBitMask & u_.bits_; } in exponent_bits()
386 Bits fraction_bits() const { return kFractionBitMask & u_.bits_; } in fraction_bits()
389 Bits sign_bit() const { return kSignBitMask & u_.bits_; } in sign_bit()
409 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_) in AlmostEquals()
417 Bits bits_; // The bits that represent the number. member
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| D | BitSet.java | 56 public BitSet(long[] bits_) { in BitSet() argument
57 bits = bits_; in BitSet()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| D | BitSet.java | 73 public BitSet(long[] bits_) { in BitSet() argument
74 bits = bits_; in BitSet()
|
| /external/flac/libFLAC/ |
| D | stream_encoder.c | 3971 …unsigned bits_ = FLAC__ENTROPY_CODING_METHOD_TYPE_LEN + FLAC__ENTROPY_CODING_METHOD_PARTITIONED_RI… in set_partitioned_rice_() local
4032 bits_ += best_partition_bits; in set_partitioned_rice_()
4108 bits_ += best_partition_bits; in set_partitioned_rice_()
4113 *bits = bits_; in set_partitioned_rice_()
|