| /external/v8/src/crankshaft/ |
| D | unique.h | 150 UniqueSet() : size_(0), capacity_(0), array_(NULL) { } in UniqueSet()
154 : size_(0), capacity_(capacity), in UniqueSet()
161 : size_(1), capacity_(1), array_(zone->NewArray<Unique<T> >(1)) { in UniqueSet()
169 for (int i = 0; i < size_; i++) { in Add()
173 Grow(size_ + 1, zone); in Add()
174 for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j]; in Add()
176 size_++; in Add()
181 Grow(size_ + 1, zone); in Add()
182 array_[size_++] = uniq; in Add()
187 for (int i = 0; i < size_; i++) { in Remove()
[all …]
|
| /external/compiler-rt/lib/tsan/rtl/ |
| D | tsan_mutexset.cc | 21 size_ = 0; in MutexSet()
27 for (uptr i = 0; i < size_; i++) { in Add()
35 if (size_ == kMaxSize) { in Add()
38 for (uptr i = 0; i < size_; i++) { in Add()
45 CHECK_EQ(size_, kMaxSize - 1); in Add()
48 descs_[size_].id = id; in Add()
49 descs_[size_].write = write; in Add()
50 descs_[size_].epoch = epoch; in Add()
51 descs_[size_].count = 1; in Add()
52 size_++; in Add()
[all …]
|
| D | tsan_clock.cc | 106 DCHECK_LE(src->size_, kMaxTid); in acquire()
110 const uptr nclk = src->size_; in acquire()
163 DCHECK_LE(dst->size_, kMaxTid); in release()
165 if (dst->size_ == 0) { in release()
174 if (dst->size_ < nclk_) in release()
201 if (nclk_ < dst->size_) in release()
203 for (uptr i = nclk_; i < dst->size_; i++) in release()
217 DCHECK_LE(dst->size_, kMaxTid); in ReleaseStore()
221 if (dst->size_ < nclk_) in ReleaseStore()
240 if (nclk_ < dst->size_) { in ReleaseStore()
[all …]
|
| D | tsan_ignoreset.cc | 20 : size_() { in IgnoreSet()
24 if (size_ == kMaxSize) in Add()
26 for (uptr i = 0; i < size_; i++) { in Add()
30 stacks_[size_++] = stack_id; in Add()
34 size_ = 0; in Reset()
38 return size_; in Size()
42 CHECK_LT(i, size_); in At()
43 CHECK_LE(size_, kMaxSize); in At()
|
| /external/libchrome/base/containers/ |
| D | small_map.h | 200 SmallMap() : size_(0), functor_(MapInit()) {}
202 explicit SmallMap(const MapInit& functor) : size_(0), functor_(functor) {}
389 if (size_ >= 0) {
390 for (int i = 0; i < size_; i++) {
395 return iterator(array_ + size_);
403 if (size_ >= 0) {
404 for (int i = 0; i < size_; i++) {
409 return const_iterator(array_ + size_);
419 if (size_ >= 0) {
422 for (int i = size_-1; i >= 0; --i) {
[all …]
|
| /external/regex-re2/util/ |
| D | sparse_set.h | 57 … : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(NULL), valgrind_(RunningOnValgrind()) {} in SparseSet()
72 size_ = 0; in SparseSet()
83 int size() const { return size_; } in size()
85 iterator end() { return dense_ + size_; } in end()
87 const_iterator end() const { return dense_ + size_; } in end()
92 if (size_ > new_max_size) in resize()
93 size_ = new_max_size; in resize()
108 memmove(a, dense_, size_*sizeof a[0]); in resize()
110 for (int i = size_; i < new_max_size; i++) in resize()
125 void clear() { size_ = 0; } in clear()
[all …]
|
| D | sparse_array.h | 117 return size_; in size()
125 return dense_.begin() + size_; in end()
132 return dense_.begin() + size_; in end()
147 size_ = 0; in clear()
223 int size_; variable
234 : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(), valgrind_(RunningOnValgrind()) {} in SparseArray()
262 DCHECK_LT(i, size_); in iv()
287 if (size_ > max_size_) in resize()
288 size_ = max_size_; in resize()
301 return (uint)sparse_to_dense_[i] < (uint)size_ && in has_index()
[all …]
|
| /external/v8/src/ |
| D | identity-map.cc | 46 for (int index = start; index < size_; index++) { in LookupIndex()
62 int limit = size_ / 2; in InsertIndex()
84 if (size_ == 0) { in GetEntry()
86 size_ = kInitialIdentityMapSize; in GetEntry()
90 keys_ = zone_->NewArray<Object*>(size_); in GetEntry()
92 for (int i = 0; i < size_; i++) keys_[i] = not_mapped; in GetEntry()
93 values_ = zone_->NewArray<void*>(size_); in GetEntry()
94 memset(values_, 0, sizeof(void*) * size_); in GetEntry()
96 heap_->RegisterStrongRoots(keys_, keys_ + size_); in GetEntry()
116 if (size_ == 0) return nullptr; in FindEntry()
[all …]
|
| /external/protobuf/src/google/protobuf/stubs/ |
| D | substitute.h | 90 : text_(value), size_(strlen(text_)) {} in SubstituteArg()
92 : text_(value.data()), size_(value.size()) {} in SubstituteArg()
96 : text_(NULL), size_(-1) {} in SubstituteArg()
105 : text_(scratch_), size_(1) { scratch_[0] = value; } in SubstituteArg()
107 : text_(FastInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
109 : text_(FastUInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
111 : text_(FastInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
113 : text_(FastUInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
115 : text_(FastLongToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
117 : text_(FastULongToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | parameter_block.h | 91 int Size() const { return size_; } in Size()
111 memcpy(x, state_, sizeof(*state_) * size_); in GetState()
154 ? size_ in LocalSize()
164 CHECK(new_parameterization->GlobalSize() == size_) in SetParameterization()
166 << "has size " << size_ << " while the parameterization has a global " in SetParameterization()
186 CHECK_LT(index, size_); in SetUpperBound()
189 upper_bounds_.reset(new double[size_]); in SetUpperBound()
191 upper_bounds_.get() + size_, in SetUpperBound()
199 CHECK_LT(index, size_); in SetLowerBound()
202 lower_bounds_.reset(new double[size_]); in SetLowerBound()
[all …]
|
| D | local_parameterization.cc | 40 : size_(size) { in IdentityParameterization()
47 VectorRef(x_plus_delta, size_) = in Plus()
48 ConstVectorRef(x, size_) + ConstVectorRef(delta, size_); in Plus()
54 MatrixRef(jacobian, size_, size_) = Matrix::Identity(size_, size_); in ComputeJacobian()
|
| /external/webrtc/webrtc/base/ |
| D | buffer.h | 92 return size_; in size()
107 size_ = buf.size_;
116 return size_ == buf.size() && memcmp(data_.get(), buf.data(), size_) == 0;
126 size_ = 0; in SetData()
139 const size_t new_size = size_ + size; in AppendData()
141 std::memcpy(data_.get() + size_, data, size); in AppendData()
142 size_ = new_size; in AppendData()
157 size_ = size; in SetSize()
168 std::memcpy(new_data.get(), data_.get(), size_); in EnsureCapacity()
186 size_ = 0; in Clear()
[all …]
|
| D | array_view.h | 80 : data_(size == 0 ? nullptr : data), size_(size) { in ArrayView()
102 size_t size() const { return size_; } in size()
103 bool empty() const { return size_ == 0; } in empty()
106 RTC_DCHECK_LT(idx, size_);
111 T* end() const { return data_ + size_; } in end()
113 const T* cend() const { return data_ + size_; } in cend()
118 return a.data_ == b.data_ && a.size_ == b.size_;
126 void CheckInvariant() const { RTC_DCHECK_EQ(!data_, size_ == 0); } in CheckInvariant()
128 size_t size_; variable
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_list.h | 34 size_ = 0; in clear()
37 bool empty() const { return size_ == 0; } in empty()
38 uptr size() const { return size_; } in size()
44 size_ = 1; in push_back()
49 size_++; in push_back()
57 size_ = 1; in push_front()
61 size_++; in push_front()
70 size_--; in pop_front()
85 size_ += l->size(); in append_front()
99 size_ += l->size(); in append_back()
[all …]
|
| /external/jsoncpp/src/lib_json/ |
| D | json_internalarray.inl | 150 it.array_->size_,
180 it.array_->size_,
199 makeIterator(it, size_);
202 ValueInternalArray::ValueInternalArray() : pages_(0), size_(0), pageCount_(0) {}
205 : pages_(0), size_(other.size_), pageCount_(0) {
206 PageIndex minNewPages = other.size_ / itemsPerPage;
213 for (ArrayIndex index = 0; index < size_; ++index, increment(itOther)) {
239 PageIndex lastPageIndex = size_ / itemsPerPage;
250 ArrayIndex tempSize = size_;
251 size_ = other.size_;
[all …]
|
| /external/gemmlowp/public/ |
| D | map.h | 87 int size_; variable
90 VectorMap() : data_(nullptr), size_(0) {} in VectorMap()
91 VectorMap(Scalar* data, int size) : data_(data), size_(size) {} in VectorMap()
92 VectorMap(const VectorMap& other) : data_(other.data_), size_(other.size_) {} in VectorMap()
94 int size() const { return size_; } in size()
109 int size_; variable
112 VectorDup() : data_(0), size_(0) {} in VectorDup()
113 VectorDup(Scalar data, int size) : data_(data), size_(size) {} in VectorDup()
114 VectorDup(const VectorDup& other) : data_(other.data_), size_(other.size_) {} in VectorDup()
116 int size() const { return size_; } in size()
|
| /external/protobuf/gtest/samples/ |
| D | sample3-inl.h | 78 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
85 if (size_ > 0) { in Clear()
98 size_ = 0; in Clear()
103 size_t Size() const { return size_; } in Size()
120 if (size_ == 0) { in Enqueue()
122 size_ = 1; in Enqueue()
126 size_++; in Enqueue()
133 if (size_ == 0) { in Dequeue()
139 size_--; in Dequeue()
140 if (size_ == 0) { in Dequeue()
[all …]
|
| /external/opencv3/modules/videostab/src/ |
| D | fast_marching.cpp | 104 if (l < size_ && narrowBand_[l] < narrowBand_[smallest]) smallest = l; in heapDown()
105 if (r < size_ && narrowBand_[r] < narrowBand_[smallest]) smallest = r; in heapDown()
121 if (static_cast<int>(narrowBand_.size()) < size_ + 1) in heapAdd()
122 narrowBand_.resize(size_*2 + 1); in heapAdd()
123 narrowBand_[size_] = dxy; in heapAdd()
124 indexOf(dxy) = size_++; in heapAdd()
125 heapUp(size_-1); in heapAdd()
131 if (size_ > 0) in heapRemoveMin()
133 size_--; in heapRemoveMin()
134 std::swap(indexOf(narrowBand_[0]), indexOf(narrowBand_[size_])); in heapRemoveMin()
[all …]
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
84 if (size_ > 0) { in Clear()
97 size_ = 0; in Clear()
102 size_t Size() const { return size_; } in Size()
119 if (size_ == 0) { in Enqueue()
121 size_ = 1; in Enqueue()
125 size_++; in Enqueue()
132 if (size_ == 0) { in Dequeue()
138 size_--; in Dequeue()
139 if (size_ == 0) { in Dequeue()
[all …]
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| D | sample3-inl.h | 77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue()
84 if (size_ > 0) { in Clear()
97 size_ = 0; in Clear()
102 size_t Size() const { return size_; } in Size()
119 if (size_ == 0) { in Enqueue()
121 size_ = 1; in Enqueue()
125 size_++; in Enqueue()
132 if (size_ == 0) { in Dequeue()
138 size_--; in Dequeue()
139 if (size_ == 0) { in Dequeue()
[all …]
|
| /external/ceres-solver/include/ceres/internal/ |
| D | fixed_array.h | 104 inline size_type size() const { return size_; } in size()
107 inline size_t memsize() const { return size_ * sizeof(T); } in memsize()
116 DCHECK_LT(i, size_);
123 DCHECK_LT(i, size_);
128 inline iterator end() { return &array_[size_].element; } in end()
131 inline const_iterator end() const { return &array_[size_].element; } in end()
153 size_type const size_; variable
165 : size_(n), in FixedArray()
171 for (size_t i = 0; i != size_; ++i) { in FixedArray()
182 for (size_t i = 0; i != size_; ++i) { in ~FixedArray()
|
| /external/icu/icu4c/source/common/ |
| D | bytestream.cpp | 31 size_(0), appended_(0), overflowed_(FALSE) { in CheckedArrayByteSink()
37 size_ = appended_ = 0; in Reset()
47 int32_t available = capacity_ - size_; in Append()
52 if (n > 0 && bytes != (outbuf_ + size_)) { in Append()
53 uprv_memcpy(outbuf_ + size_, bytes, n); in Append()
55 size_ += n; in Append()
67 int32_t available = capacity_ - size_; in GetAppendBuffer()
70 return outbuf_ + size_; in GetAppendBuffer()
|
| /external/v8/src/compiler/ |
| D | value-numbering-reducer.cc | 46 : entries_(nullptr), capacity_(0), size_(0), zone_(zone) {} in ValueNumberingReducer()
57 DCHECK(size_ == 0); in Reduce()
64 size_ = 1; in Reduce()
68 DCHECK(size_ < capacity_); in Reduce()
69 DCHECK(size_ * kCapacityToSizeRatio < capacity_); in Reduce()
83 size_++; in Reduce()
86 if (size_ * kCapacityToSizeRatio >= capacity_) Grow(); in Reduce()
88 DCHECK(size_ * kCapacityToSizeRatio < capacity_); in Reduce()
140 size_ = 0; in Grow()
155 size_++; in Grow()
|
| D | node-cache.cc | 32 if (size_ >= max_) return false; // Don't grow past the maximum size. in Resize()
36 size_t old_size = size_ + kLinearProbe; in Resize()
37 size_ *= 4; in Resize()
38 size_t num_entries = size_ + kLinearProbe; in Resize()
47 size_t start = hash & (size_ - 1); in Resize()
70 size_ = kInitialSize; in Find()
79 size_t start = hash & (size_ - 1); in Find()
94 Entry* entry = &entries_[hash & (size_ - 1)]; in Find()
104 for (size_t i = 0; i < size_ + kLinearProbe; i++) { in GetCachedNodes()
|
| /external/libchrome/base/files/ |
| D | dir_reader_linux.h | 36 size_(0) { in DirReaderLinux()
53 if (size_) { in Next()
58 if (offset_ != size_) in Next()
68 size_ = r; in Next()
74 if (!size_) in name()
94 size_t size_; variable
|