Searched refs:size_ (Results 1 - 25 of 241) sorted by relevance

12345678910

/external/compiler-rt/lib/tsan/rtl/
H A Dtsan_ignoreset.cc20 : size_() {
24 if (size_ == kMaxSize)
26 for (uptr i = 0; i < size_; i++) {
30 stacks_[size_++] = stack_id;
34 size_ = 0;
38 return size_;
42 CHECK_LT(i, size_);
43 CHECK_LE(size_, kMaxSize);
H A Dtsan_mutexset.cc21 size_ = 0;
27 for (uptr i = 0; i < size_; i++) {
35 if (size_ == kMaxSize) {
38 for (uptr i = 0; i < size_; i++) {
45 CHECK_EQ(size_, kMaxSize - 1);
48 descs_[size_].id = id;
49 descs_[size_].write = write;
50 descs_[size_].epoch = epoch;
51 descs_[size_].count = 1;
52 size_
[all...]
/external/libchrome/base/mac/
H A Dscoped_mach_vm.h52 : address_(address), size_(size) {
58 if (size_) {
59 vm_deallocate(mach_task_self(), address_, size_); local
70 return size_;
75 std::swap(size_, that.size_);
80 size_ = 0;
85 vm_size_t size_; member in class:base::mac::ScopedMachVM
H A Dscoped_mach_vm.cc14 if (size_) {
18 std::min(size_, address - address_));
20 if (address_ + size_ > address + size) {
24 address_ + size_ - deallocate_start);
29 size_ = size;
/external/eigen/unsupported/Eigen/CXX11/src/util/
H A DMaxSizeVector.h36 : reserve_(n), size_(0),
45 : reserve_(n), size_(n),
52 for (size_t i = 0; i < size_; ++i) {
60 for (size_t i = size_; i < n; ++i) {
63 for (size_t i = n; i < size_; ++i) {
66 size_ = n;
72 eigen_assert(size_ < reserve_);
73 data_[size_++] = t;
78 eigen_assert(i < size_);
84 eigen_assert(i < size_);
135 size_t size_; member in class:Eigen::MaxSizeVector
[all...]
/external/webrtc/webrtc/base/
H A Darray_view.h80 : data_(size == 0 ? nullptr : data), size_(size) {
102 size_t size() const { return size_; }
103 bool empty() const { return size_ == 0; }
106 RTC_DCHECK_LT(idx, size_);
107 RTC_DCHECK(data_); // Follows from size_ > idx and the class invariant.
111 T* end() const { return data_ + size_; }
113 const T* cend() const { return data_ + size_; }
118 return a.data_ == b.data_ && a.size_ == b.size_;
125 // Invariant: !data_ iff size_
128 size_t size_; member in class:rtc::final
[all...]
/external/libmojo/mojo/public/cpp/bindings/lib/
H A Dfixed_buffer.cc18 FixedBuffer::FixedBuffer() : ptr_(nullptr), cursor_(0), size_(0) {}
25 size_ = size;
31 if (delta == 0 || delta > size_ - cursor_) {
43 size_ = internal::Align(size);
45 ptr_ = static_cast<char*>(calloc(size_, 1));
56 size_ = 0;
/external/regex-re2/util/
H A Dsparse_set.h57 : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(NULL), valgrind_(RunningOnValgrind()) {}
72 size_ = 0;
83 int size() const { return size_; }
85 iterator end() { return dense_ + size_; }
87 const_iterator end() const { return dense_ + size_; }
92 if (size_ > new_max_size)
93 size_ = new_max_size;
108 memmove(a, dense_, size_*sizeof a[0]);
110 for (int i = size_; i < new_max_size; i++)
125 void clear() { size_
168 int size_; member in class:re2::SparseSet
[all...]
/external/icu/icu4c/source/common/
H A Dbytestream.cpp33 size_(0), appended_(0), overflowed_(FALSE) {
39 size_ = appended_ = 0;
49 int32_t available = capacity_ - size_;
54 if (n > 0 && bytes != (outbuf_ + size_)) {
55 uprv_memcpy(outbuf_ + size_, bytes, n);
57 size_ += n;
69 int32_t available = capacity_ - size_;
72 return outbuf_ + size_;
/external/libtextclassifier/util/strings/
H A Dstringpiece.h32 : start_(str), size_(strlen(str)) {}
35 : start_(start), size_(size) {}
51 size_t size() const { return size_; }
52 size_t length() const { return size_; }
61 size_t size_; member in class:libtextclassifier::StringPiece
/external/v8/src/zone/
H A Dzone-segment.h23 void Initialize(size_t size) { size_ = size; }
31 size_t size() const { return size_; }
32 size_t capacity() const { return size_ - sizeof(Segment); }
35 Address end() const { return address(size_); }
53 size_t size_; member in class:v8::internal::Segment
/external/v8/src/crankshaft/
H A Dunique.h150 UniqueSet() : size_(0), capacity_(0), array_(NULL) { }
154 : size_(0), capacity_(capacity),
161 : size_(1), capacity_(1), array_(zone->NewArray<Unique<T> >(1)) {
169 for (int i = 0; i < size_; i++) {
173 Grow(size_ + 1, zone);
174 for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j];
176 size_++;
181 Grow(size_ + 1, zone);
182 array_[size_++] = uniq;
187 for (int i = 0; i < size_;
339 uint16_t size_; member in class:v8::internal::final
[all...]
/external/protobuf/src/google/protobuf/stubs/
H A Dbytestream.cc67 : outbuf_(outbuf), capacity_(capacity), size_(0), overflowed_(false) {
71 size_t available = capacity_ - size_;
76 if (n > 0 && bytes != (outbuf_ + size_)) {
80 memcpy(outbuf_ + size_, bytes, n);
82 size_ += n;
88 size_(0) {
96 size_t available = capacity_ - size_;
97 if (bytes != (buf_ + size_)) {
106 if (n > 0 && bytes != (buf_ + size_)) {
107 memcpy(buf_ + size_, byte
[all...]
H A Dsubstitute.h90 : text_(value), size_(strlen(text_)) {}
92 : text_(value.data()), size_(value.size()) {}
96 : text_(NULL), size_(-1) {}
105 : text_(scratch_), size_(1) { scratch_[0] = value; }
107 : text_(FastInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {}
109 : text_(FastUInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {}
111 : text_(FastInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {}
113 : text_(FastUInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {}
115 : text_(FastLongToBuffer(value, scratch_)), size_(strlen(text_)) {}
117 : text_(FastULongToBuffer(value, scratch_)), size_(strle
134 int size_; member in class:google::protobuf::strings::internal::SubstituteArg
[all...]
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_list.h34 size_ = 0;
37 bool empty() const { return size_ == 0; }
38 uptr size() const { return size_; }
44 size_ = 1;
49 size_++;
57 size_ = 1;
61 size_++;
70 size_--;
87 size_ += l->size();
101 size_
149 uptr size_; member in struct:__sanitizer::IntrusiveList
[all...]
/external/gemmlowp/public/
H A Dmap.h87 int size_; member in class:gemmlowp::VectorMap
90 VectorMap() : data_(nullptr), size_(0) {}
91 VectorMap(Scalar* data, int size) : data_(data), size_(size) {}
92 VectorMap(const VectorMap& other) : data_(other.data_), size_(other.size_) {}
94 int size() const { return size_; }
109 int size_; member in class:gemmlowp::VectorDup
112 VectorDup() : data_(0), size_(0) {}
113 VectorDup(Scalar data, int size) : data_(data), size_(size) {}
114 VectorDup(const VectorDup& other) : data_(other.data_), size_(othe
[all...]
/external/libtextclassifier/common/memory_image/
H A Dmemory-image-common.h47 : start_(start), size_(size) {}
53 size_t size() const { return size_; }
67 size_t size_; member in class:libtextclassifier::nlp_core::DataBlobView
/external/libchrome/base/containers/
H A Dsmall_map.h200 SmallMap() : size_(0), functor_(MapInit()) {}
202 explicit SmallMap(const MapInit& functor) : size_(0), functor_(functor) {}
206 // size_ and functor_ are initted in InitFrom()
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_ >
571 int size_; // negative = using hash_map member in class:base::SmallMap
[all...]
/external/bsdiff/
H A Dmemory_file.cc13 : data_(data), size_(size) {}
16 count = std::min(count, static_cast<size_t>(size_ - offset_));
28 if (pos > static_cast<off_t>(size_) || pos < 0)
39 *size = size_;
/external/google-breakpad/src/testing/gtest/samples/
H A Dsample3-inl.h77 Queue() : head_(NULL), last_(NULL), size_(0) {}
84 if (size_ > 0) {
97 size_ = 0;
102 size_t Size() const { return size_; }
119 if (size_ == 0) {
121 size_ = 1;
125 size_++;
132 if (size_ == 0) {
138 size_--;
139 if (size_
165 size_t size_; // The number of elements in the queue. member in class:Queue
[all...]
/external/googletest/googletest/samples/
H A Dsample3-inl.h77 Queue() : head_(NULL), last_(NULL), size_(0) {}
84 if (size_ > 0) {
97 size_ = 0;
102 size_t Size() const { return size_; }
119 if (size_ == 0) {
121 size_ = 1;
125 size_++;
132 if (size_ == 0) {
138 size_--;
139 if (size_
165 size_t size_; // The number of elements in the queue. member in class:Queue
[all...]
/external/protobuf/gtest/samples/
H A Dsample3-inl.h78 Queue() : head_(NULL), last_(NULL), size_(0) {}
85 if (size_ > 0) {
98 size_ = 0;
103 size_t Size() const { return size_; }
120 if (size_ == 0) {
122 size_ = 1;
126 size_++;
133 if (size_ == 0) {
139 size_--;
140 if (size_
166 size_t size_; // The number of elements in the queue. member in class:Queue
[all...]
/external/v8/testing/gtest/samples/
H A Dsample3-inl.h77 Queue() : head_(NULL), last_(NULL), size_(0) {}
84 if (size_ > 0) {
97 size_ = 0;
102 size_t Size() const { return size_; }
119 if (size_ == 0) {
121 size_ = 1;
125 size_++;
132 if (size_ == 0) {
138 size_--;
139 if (size_
165 size_t size_; // The number of elements in the queue. member in class:Queue
[all...]
/external/vulkan-validation-layers/tests/gtest-1.7.0/samples/
H A Dsample3-inl.h77 Queue() : head_(NULL), last_(NULL), size_(0) {}
84 if (size_ > 0) {
97 size_ = 0;
102 size_t Size() const { return size_; }
119 if (size_ == 0) {
121 size_ = 1;
125 size_++;
132 if (size_ == 0) {
138 size_--;
139 if (size_
165 size_t size_; // The number of elements in the queue. member in class:Queue
[all...]
/external/libchrome/base/files/
H A Ddir_reader_linux.h36 size_(0) {
53 if (size_) {
58 if (offset_ != size_)
68 size_ = r;
74 if (!size_)
94 size_t size_; member in class:base::DirReaderLinux

Completed in 1148 milliseconds

12345678910