| /art/runtime/base/ |
| bounded_fifo.h | 38 size_ = 0;
46 return size_;
50 ++size_;
51 DCHECK_LE(size_, kMaxSize);
57 DCHECK_GT(size_, 0U);
58 return data_[(back_index_ - size_) & mask_];
62 DCHECK_GT(size_, 0U);
63 --size_;
68 size_t back_index_, size_; member in class:art::BoundedFifoPowerOfTwo
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_ignoreset.cc | 20 : 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);
|
| tsan_mutexset.cc | 21 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/ |
| scoped_mach_vm.h | 52 : 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
|
| scoped_mach_vm.cc | 14 if (size_) {
18 std::min(size_, address - address_));
20 if (address_ + size_ > address + size) {
24 address_ + size_ - deallocate_start);
29 size_ = size;
|
| /external/regex-re2/util/ |
| sparse_set.h | 57 : 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_ = 0;
168 int size_; member in class:re2::SparseSet
[all...] |
| /frameworks/native/libs/vr/libdvrcommon/include/private/dvr/ |
| ring_buffer.h | 12 // A vector works but you either have to keep track of start_ and size_ yourself
33 Get(size_) = val;
34 size_++;
40 Get(size_) = std::move(val);
41 size_++;
44 bool IsEmpty() const { return size_ == 0; }
46 bool IsFull() const { return size_ == buffer_.size(); }
48 size_t GetSize() const { return size_; }
58 const T& Back() const { return Get(size_ - 1); }
60 T& Back() { return Get(size_ - 1);
93 size_t start_, size_; member in class:android::dvr::RingBuffer
[all...] |
| /external/eigen/unsupported/Eigen/CXX11/src/util/ |
| MaxSizeVector.h | 36 : 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/ |
| array_view.h | 80 : 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_ == 0
128 size_t size_; member in class:rtc::final
[all...] |
| /external/v8/src/crankshaft/ |
| unique.h | 150 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_; i++)
339 uint16_t size_; member in class:v8::internal::final
[all...] |
| /external/libmojo/mojo/public/cpp/bindings/lib/ |
| fixed_buffer.cc | 18 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;
|
| /frameworks/base/media/mca/filterfw/native/core/ |
| native_frame.cpp | 22 NativeFrame::NativeFrame(int size) : data_(NULL), size_(size), capacity_(size) {
31 if (size_ >= (offset + size)) {
40 size_ = capacity_ = size;
46 NativeFrame* result = new NativeFrame(size_);
48 result->WriteData(data_, 0, size_);
54 size_ = newSize;
|
| vertex_frame.cpp | 30 size_(size) {
55 if (first_upload && size == size_)
57 else if (!first_upload && size <= size_)
61 "inside the vertex frame (%d bytes)!", size, size_);
70 size_ = size;
76 return size_;
|
| /external/protobuf/gtest/samples/ |
| sample3-inl.h | 78 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_ == 0)
166 size_t size_; \/\/ The number of elements in the queue. member in class:Queue
[all...] |
| /external/v4l2_codec2/vda/ |
| rect.h | 26 Rect() : x_(0), y_(0), size_(0, 0) {}
27 Rect(int width, int height) : x_(0), y_(0), size_(width, height) {}
29 : x_(x), y_(y), size_(width, height) {}
30 explicit Rect(const Size& size) : x_(0), y_(0), size_(size) {}
38 int width() const { return size_.width(); }
39 void set_width(int width) { size_.set_width(width); }
41 int height() const { return size_.height(); }
42 void set_height(int height) { size_.set_height(height); }
44 const Size& size() const { return size_; }
61 bool IsEmpty() const { return size_.IsEmpty();
77 Size size_; member in class:media::Rect
[all...] |
| /bionic/linker/ |
| linker_mapped_file_fragment.h | 43 size_t size() const { return size_; }
48 size_t size_; member in class:MappedFileFragment
|
| /external/icu/icu4c/source/common/ |
| bytestream.cpp | 33 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_;
|
| /system/nvram/messages/ |
| blob.cpp | 31 size_ = 0;
47 size_t size_tmp = first.size_;
49 first.size_ = second.size_;
51 second.size_ = size_tmp;
58 size_ = 0;
62 size_ = size;
73 size_ = size;
|
| /external/libtextclassifier/util/strings/ |
| stringpiece.h | 32 : 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/ |
| zone-segment.h | 23 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
|
| /system/nvram/messages/include/nvram/messages/ |
| vector.h | 40 for (size_t i = 0; i < size_; ++i) {
45 size_ = 0;
64 size_t tmp_size = first.size_;
66 first.size_ = second.size_;
68 second.size_ = tmp_size;
72 NVRAM_CHECK(pos < size_);
76 NVRAM_CHECK(pos < size_);
81 ElementType* end() { return data_ + size_; }
84 const ElementType* end() const { return data_ + size_; }
162 size_t size_ = 0; member in class:nvram::Vector
[all...] |
| /external/protobuf/src/google/protobuf/stubs/ |
| bytestream.cc | 67 : 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_, bytes, n)
[all...] |
| substitute.h | 90 : 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_(strlen(text_)) {
134 int size_; member in class:google::protobuf::strings::internal::SubstituteArg
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_list.h | 34 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_ += l->size()
149 uptr size_; member in struct:__sanitizer::IntrusiveList
[all...] |
| /external/libtextclassifier/common/memory_image/ |
| memory-image-common.h | 47 : start_(start), size_(size) {}
53 size_t size() const { return size_; }
67 size_t size_; member in class:libtextclassifier::nlp_core::DataBlobView
|
