/external/puffin/src/ |
D | puff_reader.cc | 28 TEST_AND_RETURN_FALSE(index_ < puff_size_); in GetNext() 29 if (puff_buf_in_[index_] & 0x80) { // Reading length/distance. in GetNext() 30 if ((puff_buf_in_[index_] & 0x7F) < 127) { in GetNext() 31 length = puff_buf_in_[index_] & 0x7F; in GetNext() 33 index_++; in GetNext() 35 TEST_AND_RETURN_FALSE(index_ < puff_size_); in GetNext() 36 length = puff_buf_in_[index_] + 127; in GetNext() 41 index_++; in GetNext() 53 TEST_AND_RETURN_FALSE(index_ + 1 < puff_size_); in GetNext() 54 auto distance = ReadByteArrayToUint16(&puff_buf_in_[index_]); in GetNext() [all …]
|
D | puff_writer.cc | 38 len_index_ = index_; in Insert() 39 index_++; in Insert() 46 TEST_AND_RETURN_FALSE(index_ + 2 <= puff_size_); in Insert() 52 index_ += 2; in Insert() 59 TEST_AND_RETURN_FALSE(index_ + length <= puff_size_); in Insert() 61 puff_buf_out_[index_] = pd.byte; in Insert() 63 TEST_AND_RETURN_FALSE(pd.read_fn(&puff_buf_out_[index_], length)); in Insert() 69 index_ += length; in Insert() 88 TEST_AND_RETURN_FALSE(index_ + 3 <= puff_size_); in Insert() 90 puff_buf_out_[index_++] = in Insert() [all …]
|
D | bit_reader.cc | 12 if ((in_size_ - index_) * 8 + in_cache_bits_ < nbits) { in CacheBits() 19 in_cache_ |= in_buf_[index_++] << in_cache_bits_; in CacheBits() 47 index_ -= (in_cache_bits_ + 7) / 8; in GetByteReaderFn() 50 TEST_AND_RETURN_FALSE(length <= in_size_ - index_); in GetByteReaderFn() 54 memcpy(buffer, &in_buf_[index_], count); in GetByteReaderFn() 56 index_ += count; in GetByteReaderFn() 64 return index_ - in_cache_bits_ / 8; in Offset() 68 return (index_ * 8) - in_cache_bits_; in OffsetInBits() 72 return ((in_size_ - index_) * 8) + in_cache_bits_; in BitsRemaining()
|
D | bit_writer.cc | 14 TEST_AND_RETURN_FALSE(((out_size_ - index_) * 8) - out_holder_bits_ >= nbits); in WriteBits() 18 out_buf_[index_++] = out_holder_ & 0x000000FF; in WriteBits() 36 TEST_AND_RETURN_FALSE(((out_size_ - index_) * 8) - out_holder_bits_ >= in WriteBytes() 40 TEST_AND_RETURN_FALSE(read_fn(&out_buf_[index_], nbytes)); in WriteBytes() 41 index_ += nbytes; in WriteBytes() 52 out_buf_[index_++] = out_holder_ & 0x000000FF; in Flush() 60 return index_; in Size()
|
/external/v8/src/ |
D | collector.h | 29 : index_(0), size_(0) { 43 if (index_ >= current_chunk_.length()) { in Add() 46 current_chunk_[index_] = value; in Add() 47 index_++; in Add() 57 if (size > current_chunk_.length() - index_) { in AddBlock() 60 T* position = current_chunk_.start() + index_; in AddBlock() 61 index_ += size; in AddBlock() 74 if (source.length() > current_chunk_.length() - index_) { in AddBlock() 77 T* position = current_chunk_.start() + index_; in AddBlock() 78 index_ += source.length(); in AddBlock() [all …]
|
D | dateparser.h | 53 : index_(0), in InputReader() 59 int position() { return index_; } in position() 63 ch_ = (index_ < buffer_.length()) ? buffer_[index_] : 0; in Next() 64 index_++; in Next() 116 int index_; 296 TimeComposer() : index_(0), hour_offset_(kNone) {} in TimeComposer() 297 bool IsEmpty() const { return index_ == 0; } in IsEmpty() 299 return (index_ == 1 && IsMinute(n)) || in IsExpecting() 300 (index_ == 2 && IsSecond(n)) || in IsExpecting() 301 (index_ == 3 && IsMillisecond(n)); in IsExpecting() [all …]
|
D | dateparser.cc | 14 if (index_ < 1) return false; in Write() 16 while (index_ < kSize) { in Write() 17 comp_[index_++] = 1; in Write() 25 if (is_iso_date_ || (index_ == 3 && !IsDay(comp_[0]))) { in Write() 34 if (index_ == 3) year = comp_[2]; in Write() 38 if (index_ == 1) { in Write() 68 while (index_ < kSize) { in Write() 69 comp_[index_++] = 0; in Write()
|
D | source-position-table.h | 64 int index_; member 98 bool done() const { return index_ == kDone; } in done() 100 IndexAndPosition GetState() const { return {index_, current_}; } in GetState() 103 index_ = saved_state.index_; in RestoreState() 112 int index_ = 0; variable
|
/external/webrtc/webrtc/modules/audio_processing/vad/ |
D | vad_circular_buffer.cc | 21 index_(0), in VadCircularBuffer() 31 index_ = 0; in Reset() 45 return buffer_[index_]; in Oldest() 53 if (index_ > 0) in Mean() 54 m = sum_ / index_; in Mean() 63 sum_ -= buffer_[index_]; in Insert() 66 buffer_[index_] = value; in Insert() 67 index_++; in Insert() 68 if (index_ >= buffer_size_) { in Insert() 70 index_ = 0; in Insert() [all …]
|
D | standalone_vad.cc | 24 : vad_(vad), buffer_(), index_(0), mode_(kDefaultStandaloneVadMode) { in StandaloneVad() 49 if (index_ + length > kLength10Ms * kMaxNum10msFrames) in AddAudio() 53 index_ = 0; in AddAudio() 55 memcpy(&buffer_[index_], data, sizeof(int16_t) * length); in AddAudio() 56 index_ += length; in AddAudio() 61 if (index_ == 0) in GetActivity() 64 const size_t num_frames = index_ / kLength10Ms; in GetActivity() 67 assert(WebRtcVad_ValidRateAndFrameLength(kSampleRateHz, index_) == 0); in GetActivity() 69 int activity = WebRtcVad_Process(vad_, kSampleRateHz, buffer_, index_); in GetActivity() 79 index_ = 0; in GetActivity()
|
/external/google-breakpad/src/processor/ |
D | static_map_iterator-inl.h | 47 index_(index), base_(base) { in StaticMapIterator() 64 if (++index_ > num_nodes_) index_ = num_nodes_; 76 if (++index_ > num_nodes_) index_ = num_nodes_; 88 if (--index_ < 0) index_ = 0; 101 if (--index_ < 0) index_ = 0; 111 return &(keys_[index_]); in GetKeyPtr() 120 return base_ + offsets_[index_]; in GetValueRawPtr() 126 return base_ == x.base_ && index_ == x.index_; 134 return base_ != x.base_ || index_ != x.index_; 139 if (!base_ || index_ < 0 || index_ > num_nodes_) in IsValid()
|
/external/libchrome/base/containers/ |
D | circular_deque.h | 139 circular_deque_const_iterator() : parent_deque_(nullptr), index_(0) { in circular_deque_const_iterator() 148 parent_deque_->CheckValidIndex(index_); 149 return parent_deque_->buffer_[index_]; 153 parent_deque_->CheckValidIndex(index_); 154 return &parent_deque_->buffer_[index_]; 212 return lhs.index_ == rhs.index_; 241 : parent_deque_(parent), index_(index) { in circular_deque_const_iterator() 250 if (index_ >= parent_deque_->begin_) in OffsetFromBegin() 251 return index_ - parent_deque_->begin_; // On the same side as begin. in OffsetFromBegin() 252 return parent_deque_->buffer_.capacity() - parent_deque_->begin_ + index_; in OffsetFromBegin() [all …]
|
D | mru_cache.h | 97 typename KeyIndex::iterator index_iter = index_.find(key); in Put() 98 if (index_iter != index_.end()) { in Put() 109 index_.emplace(key, ordering_.begin()); in Put() 117 typename KeyIndex::iterator index_iter = index_.find(key); in Get() 118 if (index_iter == index_.end()) in Get() 130 typename KeyIndex::const_iterator index_iter = index_.find(key); in Peek() 131 if (index_iter == index_.end()) in Peek() 137 typename KeyIndex::const_iterator index_iter = index_.find(key); in Peek() 138 if (index_iter == index_.end()) in Peek() 146 index_.swap(other.index_); in Swap() [all …]
|
D | ring_buffer.h | 64 size_t index() const { return index_; } in index() 66 const T* operator->() const { return &buffer_.ReadBuffer(index_); } 67 const T* operator*() const { return &buffer_.ReadBuffer(index_); } 70 index_++; 71 if (index_ == kSize) 77 if (index_ == 0) 79 index_--; 84 return !out_of_range_ && buffer_.IsFilledIndex(index_); 89 : buffer_(buffer), index_(index), out_of_range_(false) {} in Iterator() 92 size_t index_; variable
|
/external/libchrome/base/ |
D | observer_list.h | 111 Iter() : index_(0), max_index_(0) {} in Iter() 115 index_(0), in Iter() 136 index_(other.index_), in Iter() 145 swap(index_, other.index_); 152 (list_.get() == other.list_.get() && index_ == other.index_); 159 ++index_; 189 DCHECK_LT(index_, clamped_max_index()); in GetCurrent() 190 return list_->observers_[index_]; in GetCurrent() 196 while (index_ < max_index && !list_->observers_[index_]) in EnsureValidIndex() 197 ++index_; in EnsureValidIndex() [all …]
|
/external/libchrome/base/task/sequence_manager/ |
D | intrusive_heap.h | 23 HeapHandle() : index_(0u) {} in HeapHandle() 25 bool IsValid() const { return index_ != 0u; } in IsValid() 31 HeapHandle(size_t index) : index_(index) {} in HeapHandle() 33 size_t index_; variable 93 DCHECK_GT(handle.index_, 0u); in erase() 94 DCHECK_LE(handle.index_, size_); in erase() 95 MakeHole(handle.index_); in erase() 97 if (empty() || top_index == handle.index_) in erase() 99 if (nodes_[handle.index_] <= nodes_[top_index]) { in erase() 100 MoveHoleDownAndFillWithLeafElement(handle.index_, in erase() [all …]
|
/external/libchrome/base/json/ |
D | json_parser.cc | 61 index_(0), in JSONParser() 75 index_ = 0; in Parse() 169 if (static_cast<size_t>(index_) + count > input_.length()) in PeekChars() 173 return StringPiece(input_.data() + index_, count); in PeekChars() 186 index_ += count; in ConsumeChars() 198 CHECK_LE(static_cast<size_t>(index_), input_.length()); in pos() 199 return input_.data() + index_; in pos() 252 index_last_line_ = index_; in EatWhitespaceAndComments() 254 if (!(c == '\n' && index_ > 0 && input_[index_ - 1] == '\r')) { in EatWhitespaceAndComments() 458 &index_, in ConsumeStringRaw() [all …]
|
/external/grpc-grpc/src/cpp/common/ |
D | auth_property_iterator.cc | 26 : property_(nullptr), ctx_(nullptr), index_(0), name_(nullptr) {} in AuthPropertyIterator() 32 index_(iter->index), in AuthPropertyIterator() 38 grpc_auth_property_iterator iter = {ctx_, index_, name_}; in operator ++() 41 index_ = iter.index; in operator ++() 56 return index_ == rhs.index_; in operator ==()
|
/external/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
D | reduction_pass.cpp | 41 index_ = 0; in TryApplyReduction() 52 if (index_ >= opportunities.size()) { in TryApplyReduction() 53 index_ = 0; in TryApplyReduction() 58 for (uint32_t i = index_; in TryApplyReduction() 59 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction() 64 index_ += granularity_; in TryApplyReduction()
|
/external/deqp-deps/SPIRV-Tools/source/reduce/ |
D | reduction_pass.cpp | 41 index_ = 0; in TryApplyReduction() 52 if (index_ >= opportunities.size()) { in TryApplyReduction() 53 index_ = 0; in TryApplyReduction() 58 for (uint32_t i = index_; in TryApplyReduction() 59 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction() 64 index_ += granularity_; in TryApplyReduction()
|
/external/parameter-framework/asio-1.10.6/include/asio/ip/ |
D | basic_resolver_iterator.hpp | 65 : index_(0) in basic_resolver_iterator() 182 if (++index_ == values_->size()) in increment() 186 index_ = 0; in increment() 196 return index_ == other.index_; in equal() 201 return (*values_)[index_]; in dereference() 206 std::size_t index_; member in asio::ip::basic_resolver_iterator
|
/external/libprotobuf-mutator/src/ |
D | field_instance.h | 36 : message_(nullptr), descriptor_(nullptr), index_(kInvalidIndex) {} in ConstFieldInstance() 40 : message_(message), descriptor_(field), index_(index) { in ConstFieldInstance() 43 assert(index_ != kInvalidIndex); in ConstFieldInstance() 49 : message_(message), descriptor_(field), index_(kInvalidIndex) { in ConstFieldInstance() 102 ? reflection().GetRepeatedInt32(*message_, descriptor_, index_) in Load() 108 ? reflection().GetRepeatedInt64(*message_, descriptor_, index_) in Load() 114 descriptor_, index_) in Load() 120 descriptor_, index_) in Load() 126 descriptor_, index_) in Load() 132 ? reflection().GetRepeatedFloat(*message_, descriptor_, index_) in Load() [all …]
|
/external/perfetto/src/tracing/core/ |
D | trace_buffer.cc | 97 index_.clear(); in Initialize() 99 read_iter_ = GetReadIterForSequence(index_.end()); in Initialize() 154 const auto it = index_.find(key); in CopyChunkUntrusted() 155 if (PERFETTO_UNLIKELY(it != index_.end())) { in CopyChunkUntrusted() 181 const auto subsequent_it = index_.find(subsequent_key); in CopyChunkUntrusted() 182 if (subsequent_it != index_.end() && in CopyChunkUntrusted() 271 auto it_and_inserted = index_.emplace( in CopyChunkUntrusted() 351 auto it = index_.find(key); in DeleteNextChunksFor() 353 if (PERFETTO_LIKELY(it != index_.end())) { in DeleteNextChunksFor() 385 index_.erase(it); in DeleteNextChunksFor() [all …]
|
/external/webrtc/webrtc/base/ |
D | window.h | 92 DesktopId() : id_(0), index_(-1) {} in DesktopId() 94 : id_(id), index_(index) { in DesktopId() 97 int index() const { return index_; } in index() 98 bool IsValid() const { return index_ != -1; } in IsValid() 100 return id_ == other.id() && index_ == other.index(); in Equals() 108 int index_; variable
|
/external/libtextclassifier/actions/ |
D | ngram-model.cc | 37 : model_(model), index_(index) {} in FirstTokenIterator() 40 index_++; in operator ++() 44 index_ += dist; in operator +=() 48 return index_ - other_it.index_; in operator -() 51 const uint32 token_offset = (*model_->ngram_start_offsets())[index_]; in operator *() 54 int index() const { return index_; } in index() 58 int index_; member in libtextclassifier3::__anon9476c0f10111::FirstTokenIterator
|