| /external/deqp-deps/SPIRV-Tools/source/util/ |
| D | small_vector.h | 48 : size_(0), in SmallVector()
60 size_ = vec.size(); in SmallVector()
61 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
71 size_ = vec.size(); in SmallVector()
72 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
82 new (small_data_ + (size_++)) T(std::move(*it)); in SmallVector()
92 for (T* p = small_data_; p < small_data_ + size_; ++p) { in ~SmallVector()
109 for (; i < size_ && i < that.size_; ++i) {
113 if (i >= that.size_) {
116 for (; i < size_; ++i) {
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/source/util/ |
| D | small_vector.h | 48 : size_(0), in SmallVector()
60 size_ = vec.size(); in SmallVector()
61 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
71 size_ = vec.size(); in SmallVector()
72 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
82 new (small_data_ + (size_++)) T(std::move(*it)); in SmallVector()
92 for (T* p = small_data_; p < small_data_ + size_; ++p) { in ~SmallVector()
109 for (; i < size_ && i < that.size_; ++i) {
113 if (i >= that.size_) {
116 for (; i < size_; ++i) {
[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/libaom/libaom/test/ |
| D | intra_edge_test.cc | 50 const int max_idx = (size_ - 1) * 2; in Common()
62 int size_; member in __anond991ab740111::UpsampleTest
75 params_.ref_func(edge_ref_, size_); in Execute()
76 ASM_REGISTER_STATE_CHECK(params_.tst_func(edge_tst, size_)); in Execute()
82 size_ = 4 * (this->rng_(4) + 1); in TEST_P()
85 for (i = 0; i < kOffset + size_; ++i) { in TEST_P()
119 params_.ref_func(edge_ref_, size_, bit_depth_); in Execute()
120 ASM_REGISTER_STATE_CHECK(params_.tst_func(edge_tst, size_, bit_depth_)); in Execute()
134 size_ = 4 * (this->rng_(4) + 1); in TEST_P()
137 for (i = 0; i < kOffset + size_; ++i) { in TEST_P()
[all …]
|
| /external/libchrome/base/containers/ |
| D | small_map.h | 182 small_map() : size_(0), functor_(MapInit()) {}
184 explicit small_map(const MapInit& functor) : size_(0), functor_(functor) {}
367 if (size_ >= 0) {
368 for (int i = 0; i < size_; i++) {
373 return iterator(array_ + size_);
381 if (size_ >= 0) {
382 for (int i = 0; i < size_; i++) {
387 return const_iterator(array_ + size_);
397 if (size_ >= 0) {
400 for (int i = size_-1; i >= 0; --i) {
[all …]
|
| /external/libchrome/base/task/sequence_manager/ |
| D | intrusive_heap.h | 50 IntrusiveHeap() : nodes_(kMinimumHeapSize), size_(0) {} in IntrusiveHeap()
53 for (size_t i = 1; i <= size_; i++) { in ~IntrusiveHeap()
58 bool empty() const { return size_ == 0; } in empty()
60 size_t size() const { return size_; } in size()
63 for (size_t i = 1; i <= size_; i++) { in Clear()
67 size_ = 0; in Clear()
71 DCHECK_GE(size_, 1u); in Min()
76 DCHECK_GE(size_, 1u); in Pop()
78 size_t top_index = size_--; in Pop()
84 size_++; in insert()
[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 …]
|
| /external/libvpx/libvpx/test/ |
| D | dct_test.cc | 145 size_ = func_info->size; in SetUp()
151 if (stride_ < size_) { in SetUp()
152 stride_ = size_; in SetUp()
159 block_size_ = size_ * stride_; in SetUp()
212 Buffer<int16_t>(size_, size_, 8, size_ == 4 ? 0 : 16); in RunAccuracyCheck()
216 Buffer<tran_low_t>(size_, size_, 0, 16); in RunAccuracyCheck()
223 for (int h = 0; h < size_; ++h) { in RunAccuracyCheck()
224 for (int w = 0; w < size_; ++w) { in RunAccuracyCheck()
241 for (int h = 0; h < size_; ++h) { in RunAccuracyCheck()
242 for (int w = 0; w < size_; ++w) { in RunAccuracyCheck()
[all …]
|
| /external/grpc-grpc/src/core/lib/gprpp/ |
| D | inlined_vector.h | 91 assert(offset < size_);
96 assert(offset < size_);
103 for (size_t i = 0; i < size_; ++i) { in reserve()
115 if (size_ == capacity_) { in emplace_back()
118 new (&(data()[size_])) T(std::forward<Args>(args)...); in emplace_back()
119 ++size_; in emplace_back()
130 memcpy(dynamic_, v.dynamic_, v.size_ * sizeof(T)); in copy_from()
132 memcpy(inline_, v.inline_, v.size_ * sizeof(T)); in copy_from()
135 size_ = v.size_; in copy_from()
144 memcpy(inline_, v.inline_, v.size_ * sizeof(T)); in move_from()
[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/perfetto/src/ipc/ |
| D | buffered_frame_deserializer.cc | 54 PERFETTO_DCHECK(size_ == 0); in BeginReceive()
63 PERFETTO_CHECK(capacity_ > size_); in BeginReceive()
64 return ReceiveBuffer{buf() + size_, capacity_ - size_}; in BeginReceive()
68 PERFETTO_CHECK(recv_size + size_ <= capacity_); in EndReceive()
69 size_ += recv_size; in EndReceive()
93 if (size_ < consumed_size + kHeaderSize) in EndReceive()
108 if (size_ < consumed_size + next_frame_size) { in EndReceive()
125 PERFETTO_DCHECK(consumed_size <= size_); in EndReceive()
130 size_ -= consumed_size; in EndReceive()
131 if (size_ > 0) { in EndReceive()
[all …]
|
| /external/v8/src/compiler/ |
| D | value-numbering-reducer.cc | 20 size_(0), in ValueNumberingReducer()
32 DCHECK_EQ(0, size_); in Reduce()
39 size_ = 1; in Reduce()
43 DCHECK(size_ < capacity_); in Reduce()
44 DCHECK(size_ + size_ / 4 < capacity_); in Reduce()
58 size_++; in Reduce()
61 if (size_ + size_ / 4 >= capacity_) Grow(); in Reduce()
63 DCHECK(size_ + size_ / 4 < capacity_); in Reduce()
93 size_--; in Reduce()
108 size_--; in Reduce()
[all …]
|
| /external/libtextclassifier/utils/strings/ |
| D | stringpiece.h | 33 : start_(str), size_(str == nullptr ? 0 : strlen(str)) {} in StringPiece()
35 StringPiece(const char *start, size_t size) : start_(start), size_(size) {} in StringPiece()
51 size_t size() const { return size_; } in size()
52 size_t length() const { return size_; } in length()
54 bool empty() const { return size_ == 0; } in empty()
61 return suffix.empty() || (size_ >= suffix.size() && in EndsWith()
62 memcmp(start_ + (size_ - suffix.size()), in EndsWith()
69 (size_ >= prefix.size() && in StartsWith()
74 return size() == other.size() && memcmp(start_, other.data(), size_) == 0; in Equals()
80 TC3_CHECK_LE(n, size_); in RemovePrefix()
[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/perfetto/include/perfetto/base/ |
| D | string_view.h | 37 StringView() : data_(nullptr), size_(0) {} in StringView()
40 StringView(const char* data, size_t size) : data_(data), size_(size) { in StringView()
53 StringView(const char* cstr) : data_(cstr), size_(strlen(cstr)) { in StringView()
60 : data_(str.data()), size_(str.size()) {} in StringView()
62 bool empty() const { return size_ == 0; } in empty()
63 size_t size() const { return size_; } in size()
67 PERFETTO_DCHECK(pos < size_); in at()
72 for (size_t i = 0; i < size_; ++i) { in find()
80 for (size_t i = size_; i > 0; --i) { in rfind()
88 if (pos >= size_)
[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 | 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/v4l2_codec2/vda/ |
| D | rect.h | 28 Rect() : x_(0), y_(0), size_(0, 0) {} in Rect()
29 Rect(int width, int height) : x_(0), y_(0), size_(width, height) {} in Rect()
31 : x_(x), y_(y), size_(width, height) {} in Rect()
32 explicit Rect(const Size& size) : x_(0), y_(0), size_(size) {} in Rect()
40 int width() const { return size_.width(); } in width()
41 void set_width(int width) { size_.set_width(width); } in set_width()
43 int height() const { return size_.height(); } in height()
44 void set_height(int height) { size_.set_height(height); } in set_height()
46 const Size& size() const { return size_; } in size()
63 bool IsEmpty() const { return size_.IsEmpty(); } in IsEmpty()
[all …]
|
| /external/libtextclassifier/utils/utf8/ |
| D | unicodetext.cc | 34 size_ = src.size_; in operator =()
44 size_ = size; in PointTo()
60 if (size_ < new_size) memset(data_ + size_, 0, new_size - size_); in resize()
61 size_ = new_size; in resize()
76 memcpy(new_data, data_, size_); in reserve()
85 reserve(size_ + byte_length); in append()
86 memcpy(data_ + size_, bytes, byte_length); in append()
87 size_ += byte_length; in append()
93 size_ = capacity_ = 0; in clear()
109 repr_.Copy(src.repr_.data_, src.repr_.size_); in Copy()
[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/image_io/src/base/ |
| D | byte_buffer.cc | 33 : buffer_(std::move(buffer)), size_(size) { in ByteBuffer()
35 size_ = 0; in ByteBuffer()
37 if (!size_) { in ByteBuffer()
43 size_ = 0; in ByteBuffer()
45 size_ += byte_data.GetByteCount(); in ByteBuffer()
47 if (!size_) { in ByteBuffer()
53 buffer_.reset(new Byte[size_]); // NOLINT in ByteBuffer()
58 size_ = 0; in ByteBuffer()
66 if (location + 1 >= size_) { in SetBigEndianValue()
75 size_ = 0; in Release()
|
| /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 …]
|