HomeSort by relevance Sort by last modified time
    Searched full:bits_ (Results 1 - 25 of 41) sorted by null

1 2

  /external/chromium_org/v8/src/
data-flow.h 207 : it_(target->bits_ == NULL
209 : target->bits_) { }
217 GrowableBitVector() : bits_(NULL) { }
219 : bits_(new(zone) BitVector(length, zone)) { }
223 return bits_->Contains(value);
228 bits_->Add(value);
237 void Clear() { if (bits_ != NULL) bits_->Clear(); }
243 return bits_ != NULL && bits_->length() > value
255 BitVector* bits_; member in class:v8::internal::BASE_EMBEDDED
    [all...]
safepoint-table.h 43 SafepointEntry() : info_(0), bits_(NULL) {}
45 SafepointEntry(unsigned info, uint8_t* bits) : info_(info), bits_(bits) {
49 bool is_valid() const { return bits_ != NULL; }
52 return info_ == other.info_ && bits_ == other.bits_;
57 bits_ = NULL;
92 return bits_;
100 uint8_t* bits_; member in class:v8::internal::BASE_EMBEDDED
utils.h 1062 explicit EnumSet(T bits = 0) : bits_(bits) {}
1063 bool IsEmpty() const { return bits_ == 0; }
1064 bool Contains(E element) const { return (bits_ & Mask(element)) != 0; }
1066 return (bits_ & set.bits_) != 0;
1068 void Add(E element) { bits_ |= Mask(element); }
1069 void Add(const EnumSet& set) { bits_ |= set.bits_; }
1070 void Remove(E element) { bits_ &= ~Mask(element); }
1071 void Remove(const EnumSet& set) { bits_ &= ~set.bits_;
    [all...]
safepoint-table.cc 46 if (bits_[i] != SafepointTable::kNoRegisters) return true;
57 return (bits_[byte_index] & (1 << bit_index)) != 0;
  /external/chromium_org/content/browser/speech/
audio_encoder.cc 122 SpeexBits bits_; member in class:content::__anon7930::SpeexEncoder
132 // speex_bits_init() does not initialize all of the |bits_| struct.
133 memset(&bits_, 0, sizeof(bits_));
134 speex_bits_init(&bits_);
147 speex_bits_destroy(&bits_);
158 speex_bits_reset(&bits_);
159 speex_encode_int(encoder_state_, src_buffer + i, &bits_);
163 int frame_length = speex_bits_write(&bits_, encoded_frame_data_ + 1,
  /external/v8/src/
safepoint-table.h 43 SafepointEntry() : info_(0), bits_(NULL) {}
45 SafepointEntry(unsigned info, uint8_t* bits) : info_(info), bits_(bits) {
49 bool is_valid() const { return bits_ != NULL; }
52 return info_ == other.info_ && bits_ == other.bits_;
57 bits_ = NULL;
92 return bits_;
100 uint8_t* bits_; member in class:v8::internal::BASE_EMBEDDED
lithium-allocator.h 404 GrowableBitVector() : bits_(NULL) { }
408 return bits_->Contains(value);
413 bits_->Add(value);
420 return bits_ != NULL && bits_->length() > value;
425 int new_length = bits_ == NULL ? kInitialLength : bits_->length();
428 if (bits_ != NULL) new_bits->CopyFrom(*bits_);
429 bits_ = new_bits
432 BitVector* bits_; member in class:v8::internal::BASE_EMBEDDED
    [all...]
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_;
    [all...]
jsregexp.h 240 SetRelation() : bits_(0) {}
243 void SetElementsInFirstSet() { bits_ |= kInFirst; }
244 void SetElementsInSecondSet() { bits_ |= kInSecond; }
245 void SetElementsInBothSets() { bits_ |= kInBoth; }
250 bool Disjoint() { return (bits_ & kInBoth) == 0; }
252 bool Equals() { return (bits_ & (kInFirst | kInSecond)) == 0; }
254 bool Contains() { return (bits_ & kInSecond) == 0; }
256 bool ContainedIn() { return (bits_ & kInFirst) == 0; }
258 return (bits_ == (kInFirst | kInSecond | kInBoth));
260 int value() { return bits_; }
263 int bits_; member in class:v8::internal::BASE_EMBEDDED
    [all...]
safepoint-table.cc 46 if (bits_[i] != SafepointTable::kNoRegisters) return true;
57 return (bits_[byte_index] & (1 << bit_index)) != 0;
  /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
bitvect.c 41 #define bits_(BitVector) *(BitVector-3) macro
537 bits_(newaddr) = bits;
564 return( BitVector_Create(bits_(addr),true) );
572 bits = bits_(addr);
588 bitsX = bits_(X);
589 bitsY = bits_(Y);
671 N_word bits = bits_(addr);
700 N_word bits = bits_(X);
708 else if (bits == bits_(Y))
741 N_word bits = bits_(addr)
    [all...]
  /external/openfst/src/extensions/ngram/
bitmap-index.cc 68 return sum + __builtin_popcountll(bits_[end_word] &
88 int nth = nth_bit(bits_[offset], rembits);
111 int nth = nth_bit(~bits_[offset], remzeros);
126 bits_ = bits;
145 block_popcount += __builtin_popcountll(bits_[j] & mask);
  /external/chromium_org/third_party/libjingle/source/talk/p2p/base/
stun.cc 658 : StunAttribute(type, SIZE), bits_(value) {
662 : StunAttribute(type, SIZE), bits_(0) {
667 return static_cast<bool>((bits_ >> index) & 0x1);
672 bits_ &= ~(1 << index);
673 bits_ |= value ? (1 << index) : 0;
677 if (length() != SIZE || !buf->ReadUInt32(&bits_))
683 buf->WriteUInt32(bits_);
688 : StunAttribute(type, SIZE), bits_(value) {
692 : StunAttribute(type, SIZE), bits_(0) {
696 if (length() != SIZE || !buf->ReadUInt64(&bits_))
    [all...]
  /external/chromium_org/third_party/libwebp/utils/
bit_reader.h 130 int bits_; // number of valid bits left member in struct:VP8BitReader
202 br->value_ |= bits << (-br->bits_);
206 br->bits_ += (BITS);
213 if (br->bits_ < 0) { // Make sure we have a least BITS bits in 'value_'
228 const int pos = br->bits_;
249 br->bits_ -= shift;
254 br->bits_ -= shift;
bit_reader.c 38 br->bits_ = -8; // to load the very first 8bits
81 br->value_ |= (bit_t)(*br->buf_++) << ((BITS) - 8 - br->bits_);
85 br->bits_ += 8;
91 br->bits_ += 8;
  /external/webp/src/utils/
bit_reader.h 130 int bits_; // number of valid bits left member in struct:VP8BitReader
202 br->value_ |= bits << (-br->bits_);
206 br->bits_ += (BITS);
213 if (br->bits_ < 0) { // Make sure we have a least BITS bits in 'value_'
228 const int pos = br->bits_;
249 br->bits_ -= shift;
254 br->bits_ -= shift;
bit_reader.c 38 br->bits_ = -8; // to load the very first 8bits
81 br->value_ |= (bit_t)(*br->buf_++) << ((BITS) - 8 - br->bits_);
85 br->bits_ += 8;
91 br->bits_ += 8;
  /external/chromium/third_party/libjingle/source/talk/p2p/base/
stun.cc 347 : StunAttribute(type, SIZE), bits_(0) {
352 return static_cast<bool>((bits_ >> index) & 0x1);
357 bits_ &= ~(1 << index);
358 bits_ |= value ? (1 << index) : 0;
362 if (!buf->ReadUInt32(&bits_))
368 buf->WriteUInt32(bits_);
stun.h 234 uint32 value() const { return bits_; }
236 void SetValue(uint32 bits) { bits_ = bits; }
245 uint32 bits_; member in class:cricket::StunUInt32Attribute
  /external/openfst/src/include/fst/extensions/ngram/
bitmap-index.h 47 BitmapIndex() : bits_(NULL), size_(0) { }
50 return (bits_[index >> kStorageLogBitSize] &
168 const uint64* bits_; member in class:fst::BitmapIndex
  /external/chromium/sdch/open-vcdiff/src/gtest/internal/
gtest-internal.h 377 fp.bits_ = bits;
389 const Bits &bits() const { return bits_; }
392 Bits exponent_bits() const { return kExponentBitMask & bits_; }
395 Bits fraction_bits() const { return kFractionBitMask & bits_; }
398 Bits sign_bit() const { return kSignBitMask & bits_; }
418 return DistanceBetweenSignAndMagnitudeNumbers(bits_, rhs.bits_) <= kMaxUlps;
458 Bits bits_; // The bits that represent the number. member in union:testing::internal::FloatingPoint::__anon2970
  /external/chromium_org/third_party/libwebp/dsp/
lossless.c 686 const int mask = (1 << transform->bits_) - 1;
687 const int tiles_per_row = VP8LSubSampleSize(width, transform->bits_);
689 transform->data_ + (y >> transform->bits_) * tiles_per_row;
    [all...]
  /external/webp/src/dsp/
lossless.c 686 const int mask = (1 << transform->bits_) - 1;
687 const int tiles_per_row = VP8LSubSampleSize(width, transform->bits_);
689 transform->data_ + (y >> transform->bits_) * tiles_per_row;
    [all...]
  /external/open-vcdiff/gtest/include/gtest/internal/
gtest-internal.h 392 fp.u_.bits_ = bits;
404 const Bits &bits() const { return u_.bits_; }
407 Bits exponent_bits() const { return kExponentBitMask & u_.bits_; }
410 Bits fraction_bits() const { return kFractionBitMask & u_.bits_; }
413 Bits sign_bit() const { return kSignBitMask & u_.bits_; }
433 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_)
441 Bits bits_; // The bits that represent the number. member in union:testing::internal::FloatingPoint::FloatingPointUnion
    [all...]
  /external/protobuf/gtest/include/gtest/internal/
gtest-internal.h 390 fp.u_.bits_ = bits;
402 const Bits &bits() const { return u_.bits_; }
405 Bits exponent_bits() const { return kExponentBitMask & u_.bits_; }
408 Bits fraction_bits() const { return kFractionBitMask & u_.bits_; }
411 Bits sign_bit() const { return kSignBitMask & u_.bits_; }
431 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_)
439 Bits bits_; // The bits that represent the number. member in union:testing::internal::FloatingPoint::FloatingPointUnion
    [all...]

Completed in 260 milliseconds

1 2