/third_party/node/deps/v8/src/utils/ |
D | scoped-list.h | 40 : buffer_(*buffer), start_(buffer->size()), end_(buffer->size()) {} in ScopedList() 46 buffer_.resize(start_); in Rewind() 47 end_ = start_; in Rewind() 51 DCHECK_EQ(parent->end_, start_); in MergeInto() 53 start_ = end_; in MergeInto() 57 int length() const { return static_cast<int>(end_ - start_); } in length() 60 size_t index = start_ + i; in at() 61 DCHECK_LE(start_, index); in at() 67 size_t index = start_ + i; in at() 68 DCHECK_LE(start_, index); in at() [all …]
|
D | utils-inl.h | 21 : start_(TimestampMs()), result_(result) {} in TimedScope() 23 ~TimedScope() { *result_ = TimestampMs() - start_; } in ~TimedScope() 31 double start_; variable
|
/third_party/node/deps/v8/src/heap/cppgc/ |
D | virtual-memory.cc | 20 start_ = page_allocator->AllocatePages(hint, RoundUp(size, page_size), in VirtualMemory() 23 if (start_) { in VirtualMemory() 30 page_allocator_->FreePages(start_, size_); in ~VirtualMemory() 36 start_(std::move(other.start_)), in VirtualMemory() 44 start_ = std::move(other.start_); in operator =() 51 start_ = nullptr; in Reset()
|
D | heap-space.h | 74 Address result = start_; in Allocate() 75 start_ += alloc_size; in Allocate() 81 start_ = ptr; in Set() 85 Address start() const { return start_; } in start() 89 Address start_ = nullptr;
|
D | virtual-memory.h | 36 bool IsReserved() const { return start_ != nullptr; } in IsReserved() 40 return start_; in address() 53 void* start_ = nullptr; variable
|
/third_party/libphonenumber/cpp/src/phonenumbers/ |
D | phonenumbermatch.cc | 34 : start_(start), raw_string_(raw_string), number_(number) { in PhoneNumberMatch() 38 : start_(-1), raw_string_(""), number_(PhoneNumber::default_instance()) { in PhoneNumberMatch() 46 return start_; in start() 50 return static_cast<int>(start_ + raw_string_.length()); in end() 62 start_ = start; in set_start() 81 match.start_ == start_; in Equals() 86 start_ = match.start(); in CopyFrom()
|
/third_party/node/deps/v8/src/heap/ |
D | linear-allocation-area.h | 24 : start_(top), top_(top), limit_(limit) { in LinearAllocationArea() 29 start_ = top; in Reset() 35 void ResetStart() { start_ = top_; } in ResetStart() 53 if (start_ > top_) { in DecrementTopIfAdjacent() 67 start_ = other.start_; in MergeIfAdjacent() 82 return start_; in start() 99 SLOW_DCHECK(start_ <= top_); in Verify() 111 Address start_ = kNullAddress;
|
/third_party/node/deps/v8/src/base/ |
D | ring-buffer.h | 24 elements_[start_++] = value; in Push() 25 if (start_ == kSize) start_ = 0; in Push() 27 DCHECK_EQ(start_, 0); in Push() 36 int j = start_ + count_ - 1; in Sum() 46 void Reset() { start_ = count_ = 0; } in Reset() 50 int start_; variable
|
D | vector.h | 28 constexpr Vector() : start_(nullptr), length_(0) {} in Vector() 30 constexpr Vector(T* data, size_t length) : start_(data), length_(length) { in Vector() 62 return start_[index]; 67 T& first() { return start_[0]; } in first() 71 return start_[length_ - 1]; in last() 75 constexpr T* begin() const { return start_; } in begin() 78 constexpr T* data() const { return start_; } in data() 81 constexpr T* end() const { return start_ + length_; } in end() 86 for (size_t i = 0; i < length_; i++) result[i] = start_[i]; in Clone() 98 delete[] start_; in Dispose() [all …]
|
/third_party/node/deps/v8/src/compiler/ |
D | graph.h | 46 : graph_(graph), start_(graph->start()), end_(graph->end()) {} in NON_EXPORTED_BASE() 48 graph_->SetStart(start_); in NON_EXPORTED_BASE() 56 Node* const start_; in NON_EXPORTED_BASE() local 84 Node* start() const { return start_; } in NON_EXPORTED_BASE() 87 void SetStart(Node* start) { start_ = start; } in NON_EXPORTED_BASE() 105 Node* start_; in NON_EXPORTED_BASE() local
|
/third_party/node/deps/v8/src/execution/ |
D | microtask-queue.cc | 27 const size_t MicrotaskQueue::kStartOffset = OFFSET_OF(MicrotaskQueue, start_); 109 ring_buffer_[(start_ + size_) % capacity_] = microtask.ptr(); in EnqueueMicrotask() 188 start_ = 0; in RunMicrotasks() 205 Root::kStrongRoots, nullptr, FullObjectSlot(ring_buffer_ + start_), in IterateMicrotasks() 206 FullObjectSlot(ring_buffer_ + std::min(start_ + size_, capacity_))); in IterateMicrotasks() 209 FullObjectSlot(ring_buffer_ + std::max(start_ + size_ - capacity_, in IterateMicrotasks() 256 Object microtask(ring_buffer_[(index + start_) % capacity_]); in get() 264 new_ring_buffer[i] = ring_buffer_[(start_ + i) % capacity_]; in ResizeBuffer() 270 start_ = 0; in ResizeBuffer()
|
/third_party/node/deps/v8/src/diagnostics/ |
D | eh-frame.h | 216 : start_(start), next_(start), end_(end) { in EhFrameIterator() 221 DCHECK_EQ(next_, start_); in SkipCie() 255 DCHECK_GE(next_, start_); in GetCurrentOffset() 256 return static_cast<int>(next_ - start_); in GetCurrentOffset() 259 int GetBufferSize() { return static_cast<int>(end_ - start_); } in GetBufferSize() 280 const byte* start_; variable 290 : start_(start), end_(end) { in EhFrameDisassembler() 304 const byte* start_; variable
|
/third_party/skia/third_party/externals/libwebp/src/enc/ |
D | backward_references_cost_enc.c | 166 int start_; member 176 int start_; member 293 cur->start_ = 0; in CostManagerInit() 301 cur->start_ = i; in CostManagerInit() 378 while (current != NULL && current->start_ <= i) { in UpdateCostAtIndex() 401 while (previous != NULL && current->start_ < previous->start_) { in PositionOrphanInterval() 405 previous->next_->start_ < current->start_) { in PositionOrphanInterval() 448 interval_new->start_ = start; in InsertInterval() 488 cost_cache_intervals[i].start_ < len; in PushInterval() 491 int start = position + cost_cache_intervals[i].start_; in PushInterval() [all …]
|
/third_party/skia/third_party/externals/icu/source/i18n/ |
D | double-conversion-utils.h | 218 Vector() : start_(NULL), length_(0) {} in Vector() 219 Vector(T* data, int len) : start_(data), length_(len) { in Vector() 239 T* start() const { return start_; } in start() 244 return start_[index]; 247 T& first() { return start_[0]; } in first() 249 T& last() { return start_[length_ - 1]; } in last() 257 T* start_;
|
/third_party/node/src/ |
D | string_search.h | 22 : start_(data), length_(length), is_forward_(isForward) { in Vector() 28 const T* start() const { return start_; } in start() 40 return start_[is_forward_ ? index : (length_ - index - 1)]; 44 T* start_; 94 : pattern_(pattern), start_(0) { in StringSearch() 96 start_ = pattern.length() - kBMMaxShift; in StringSearch() 176 size_t start_; variable 342 size_t start = start_; in BoyerMooreSearch() 345 int* good_suffix_shift = good_suffix_shift_table_ - start_; in BoyerMooreSearch() 390 const size_t start = start_; in PopulateBoyerMooreTable() [all …]
|
/third_party/icu/icu4c/source/i18n/ |
D | double-conversion-utils.h | 264 Vector() : start_(DOUBLE_CONVERSION_NULLPTR), length_(0) {} in Vector() 265 Vector(T* data, int len) : start_(data), length_(len) { in Vector() 285 T* start() const { return start_; } in start() 290 return start_[index]; 293 T& first() { return start_[0]; } in first() 295 T& last() { return start_[length_ - 1]; } in last() 303 T* start_;
|
/third_party/node/deps/icu-small/source/i18n/ |
D | double-conversion-utils.h | 264 Vector() : start_(DOUBLE_CONVERSION_NULLPTR), length_(0) {} in Vector() 265 Vector(T* data, int len) : start_(data), length_(len) { in Vector() 285 T* start() const { return start_; } in start() 290 return start_[index]; 293 T& first() { return start_[0]; } in first() 295 T& last() { return start_[length_ - 1]; } in last() 303 T* start_;
|
/third_party/icu/vendor/double-conversion/upstream/double-conversion/ |
D | utils.h | 251 Vector() : start_(DOUBLE_CONVERSION_NULLPTR), length_(0) {} in Vector() 252 Vector(T* data, int len) : start_(data), length_(len) { in Vector() 272 T* start() const { return start_; } in start() 277 return start_[index]; 280 T& first() { return start_[0]; } in first() 282 T& last() { return start_[length_ - 1]; } in last() 290 T* start_;
|
/third_party/node/deps/v8/src/torque/ |
D | earley-parser.h | 284 : rule_(rule), mark_(mark), start_(start), pos_(pos) { in Item() 314 Item result(rule_, mark_ + 1, start_, new_pos); 328 const MatchedInput& start = tokens.token_contents[start_]; in GetMatchedInput() 329 const MatchedInput& end = start_ == pos_ ? tokens.token_contents[start_] in GetMatchedInput() 341 start_ == other.start_ && pos_ == other.pos_; 345 return base::hash_combine(i.rule_, i.mark_, i.start_, i.pos_); in hash_value() 352 size_t start() const { return start_; } in start() 357 size_t start_; variable 422 explicit Grammar(Symbol* start) : start_(start) {} in Grammar() 426 return ParseTokens(start_, tokens); in Parse() [all …]
|
D | cfg.h | 99 start_ = NewBlock(std::move(input_types), false); in ControlFlowGraph() 100 PlaceBlock(start_); in ControlFlowGraph() 116 Block* start() const { return start_; } in start() 136 return start_ ? start_->InputTypes().Size() : 0; in ParameterCount() 141 Block* start_; variable
|
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/str_format/ |
D | arg.cc | 79 start_ = p; in PrintAsOct() 88 start_ = storage_; in PrintAsDec() 119 start_ = p; in PrintAsDec() 140 start_ = p; in PrintAsHexLower() 156 start_ = p; in PrintAsHexUpper() 162 string_view with_neg_and_zero() const { return {start_, size_}; } in with_neg_and_zero() 168 size_t advance = start_[0] <= '0' ? 1 : 0; in without_neg_or_zero() 169 return {start_ + advance, size_ - advance}; in without_neg_or_zero() 172 bool is_negative() const { return start_[0] == '-'; } in is_negative() 175 const char *start_; member in absl::str_format_internal::__anon4808c6fb0111::IntDigits
|
/third_party/gn/src/util/ |
D | ticks.h | 38 ElapsedTimer() : start_(TicksNow()) {} in ElapsedTimer() 39 TickDelta Elapsed() { return TicksDelta(TicksNow(), start_); } in Elapsed() 42 Ticks start_;
|
/third_party/skia/third_party/externals/libwebp/src/dec/ |
D | idec_dec.c | 56 size_t start_; // start location of the data to be decoded member 92 return (mem->end_ - mem->start_); in MemDataSize() 114 const uint8_t* const new_base = mem->buf_ + mem->start_; in DoRemap() 170 (mem->buf_ == NULL) ? NULL : mem->buf_ + mem->start_; in AppendToMemBuffer() 173 assert(mem->buf_ != NULL || mem->start_ == 0); in AppendToMemBuffer() 193 mem->start_ = new_mem_start; in AppendToMemBuffer() 202 DoRemap(idec, mem->buf_ + mem->start_ - old_start); in AppendToMemBuffer() 211 (old_buf == NULL) ? NULL : old_buf + mem->start_; in RemapMemBuffer() 212 assert(old_buf != NULL || mem->start_ == 0); in RemapMemBuffer() 220 DoRemap(idec, mem->buf_ + mem->start_ - old_start); in RemapMemBuffer() [all …]
|
/third_party/node/deps/v8/src/wasm/ |
D | function-body-decoder.h | 143 return static_cast<uint32_t>(ptr_ - start_); in NON_EXPORTED_BASE() 147 const byte* start_; in NON_EXPORTED_BASE() 150 : iterator_base(ptr, end), start_(start) {} in NON_EXPORTED_BASE() 166 offset_iterator(start_, pc_, end_), in NON_EXPORTED_BASE() 167 offset_iterator(start_, end_, end_)); in NON_EXPORTED_BASE()
|
/third_party/cef/tests/cefclient/renderer/ |
D | performance_test_setup.h | 45 start_.Now(); in Start() 56 return start_.Delta(stop_); in Delta() 61 CefTime start_; variable
|