| /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/eigen/unsupported/Eigen/CXX11/src/util/ |
| D | MaxSizeVector.h | 36 : reserve_(n), size_(0), in MaxSizeVector()
45 : reserve_(n), size_(n), in MaxSizeVector()
52 for (size_t i = 0; i < size_; ++i) { in ~MaxSizeVector()
60 for (size_t i = size_; i < n; ++i) { in resize()
63 for (size_t i = n; i < size_; ++i) { in resize()
66 size_ = n; in resize()
72 eigen_assert(size_ < reserve_); in push_back()
73 data_[size_++] = t; in push_back()
78 eigen_assert(i < size_);
84 eigen_assert(i < size_);
[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/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 …]
|
| D | bytestream.cc | 67 : outbuf_(outbuf), capacity_(capacity), size_(0), overflowed_(false) { in CheckedArrayByteSink()
71 size_t available = capacity_ - size_; in Append()
76 if (n > 0 && bytes != (outbuf_ + size_)) { in Append()
80 memcpy(outbuf_ + size_, bytes, n); in Append()
82 size_ += n; in Append()
88 size_(0) { in GrowingArrayByteSink()
96 size_t available = capacity_ - size_; in Append()
97 if (bytes != (buf_ + size_)) { in Append()
106 if (n > 0 && bytes != (buf_ + size_)) { in Append()
107 memcpy(buf_ + size_, bytes, n); in Append()
[all …]
|
| /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/v4l2_codec2/vda/ |
| D | rect.h | 26 Rect() : x_(0), y_(0), size_(0, 0) {} in Rect()
27 Rect(int width, int height) : x_(0), y_(0), size_(width, height) {} in Rect()
29 : x_(x), y_(y), size_(width, height) {} in Rect()
30 explicit Rect(const Size& size) : x_(0), y_(0), size_(size) {} in Rect()
38 int width() const { return size_.width(); } in width()
39 void set_width(int width) { size_.set_width(width); } in set_width()
41 int height() const { return size_.height(); } in height()
42 void set_height(int height) { size_.set_height(height); } in set_height()
44 const Size& size() const { return size_; } in size()
61 bool IsEmpty() const { return size_.IsEmpty(); } in IsEmpty()
[all …]
|
| /external/gemmlowp/public/ |
| D | map.h | 91 int size_; variable
94 VectorMap() : data_(nullptr), size_(0) {} in VectorMap()
95 VectorMap(Scalar* data, int size) : data_(data), size_(size) {} in VectorMap()
96 VectorMap(const VectorMap& other) : data_(other.data_), size_(other.size_) {} in VectorMap()
98 int size() const { return size_; } in size()
105 assert(start + len <= size_); in block()
120 int size_; variable
123 VectorDup() : data_(0), size_(0) {} in VectorDup()
124 VectorDup(Scalar data, int size) : data_(data), size_(size) {} in VectorDup()
125 VectorDup(const VectorDup& other) : data_(other.data_), size_(other.size_) {} in VectorDup()
[all …]
|
| /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()
87 size_ += l->size(); in append_front()
101 size_ += l->size(); in append_back()
[all …]
|
| /external/v8/src/compiler/ |
| D | value-numbering-reducer.cc | 55 size_(0), in ValueNumberingReducer()
67 DCHECK(size_ == 0); in Reduce()
74 size_ = 1; in Reduce()
78 DCHECK(size_ < capacity_); in Reduce()
79 DCHECK(size_ + size_ / 4 < capacity_); in Reduce()
93 size_++; in Reduce()
96 if (size_ + size_ / 4 >= capacity_) Grow(); in Reduce()
98 DCHECK(size_ + size_ / 4 < capacity_); in Reduce()
128 size_--; in Reduce()
143 size_--; in Reduce()
[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/libchrome/base/mac/ |
| D | scoped_mach_vm.h | 52 : address_(address), size_(size) { in address_()
58 if (size_) { in ~ScopedMachVM()
59 vm_deallocate(mach_task_self(), address_, size_); in ~ScopedMachVM()
70 return size_; in size()
75 std::swap(size_, that.size_); in swap()
80 size_ = 0; in release()
85 vm_size_t size_; variable
|
| /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/v8/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/googletest/googletest/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/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/vixl/src/aarch64/ |
| D | operands-aarch64.h | 58 CPURegister() : code_(0), size_(0), type_(kNoRegister) { in CPURegister()
64 : code_(code), size_(size), type_(type) { in CPURegister()
88 VIXL_ASSERT(size_ % 8 == 0); in GetSizeInBytes()
89 return size_ / 8; in GetSizeInBytes()
97 return size_; in GetSizeInBits()
108 return size_ == 8; in Is8Bits()
113 return size_ == 16; in Is16Bits()
118 return size_ == 32; in Is32Bits()
123 return size_ == 64; in Is64Bits()
128 return size_ == 128; in Is128Bits()
[all …]
|
| /external/libtextclassifier/util/utf8/ |
| D | unicodetext.cc | 30 size_ = size; in PointTo()
46 if (size_ < new_size) memset(data_ + size_, 0, new_size - size_); in resize()
47 size_ = new_size; in resize()
62 memcpy(new_data, data_, size_); in reserve()
71 reserve(size_ + byte_length); in append()
72 memcpy(data_ + size_, bytes, byte_length); in append()
73 size_ += byte_length; in append()
79 size_ = capacity_ = 0; in clear()
90 repr_.Copy(src.repr_.data_, src.repr_.size_); in Copy()
137 return const_iterator(repr_.data_ + repr_.size_); in end()
|