| /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...] |
| /art/libartbase/base/ |
| bounded_fifo.h | 39 size_ = 0;
47 return size_;
51 ++size_;
52 DCHECK_LE(size_, kMaxSize);
58 DCHECK_GT(size_, 0U);
59 return data_[(back_index_ - size_) & mask_];
63 DCHECK_GT(size_, 0U);
64 --size_;
69 size_t back_index_, size_; member in class:art::BoundedFifoPowerOfTwo
|
| /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...] |
| /tools/dexter/slicer/export/slicer/ |
| memview.h | 29 MemView() : ptr_(nullptr), size_(0) {}
31 MemView(const void* ptr, size_t size) : ptr_(ptr), size_(size) {
42 size_t size() const { return size_; }
46 size_t size_; member in class:slicer::MemView
|
| /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/tensorflow/tensorflow/core/lib/core/ |
| stringpiece.h | 45 StringPiece() : data_(nullptr), size_(0) {}
48 StringPiece(const char* d, size_t n) : data_(d), size_(n) {}
51 StringPiece(const string& s) : data_(s.data()), size_(s.size()) {}
54 StringPiece(const char* s) : data_(s), size_(strlen(s)) {}
60 size_t size() const { return size_; }
63 bool empty() const { return size_ == 0; }
68 iterator end() const { return data_ + size_; }
83 size_ -= n;
87 assert(size_ >= n);
88 size_ -= n
129 size_t size_; member in class:tensorflow::StringPiece
[all...] |
| stringpiece.cc | 38 if (pos >= size_) {
42 reinterpret_cast<const char*>(memchr(data_ + pos, c, size_ - pos));
48 if (size_ == 0) return npos;
49 for (const char* p = data_ + std::min(pos, size_ - 1); p >= data_; p--) {
58 if (pos > size_) pos = size_;
59 if (n > size_ - pos) n = size_ - pos;
|
| /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/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_; }
54 bool empty() const { return size_ == 0; }
63 size_t size_; member in class:libtextclassifier2::StringPiece
|
| /external/tensorflow/tensorflow/contrib/tensorrt/segment/ |
| union_find.h | 30 UnionFind() : size_(1), parent_(nullptr) {}
31 explicit UnionFind(const T& v) : size_(1), parent_(nullptr), value_(v) {}
34 int Size() { return FindRoot()->size_; }
51 int size_; member in class:tensorflow::tensorrt::segment::UnionFind
63 a->size_ += b->size_;
|
| /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_;
|
| /hardware/interfaces/wifi/1.2/default/ |
| ringbuffer.cpp | 27 Ringbuffer::Ringbuffer(size_t maxSize) : size_(0), maxSize_(maxSize) {}
39 size_ += input.size() * sizeof(input[0]);
40 while (size_ > maxSize_) {
41 size_ -= data_.front().size() * sizeof(data_.front()[0]);
|
| /device/google/cuttlefish_common/common/libs/auto_resources/ |
| auto_resources.cpp | 50 size_ = 0;
63 if (size_ > newsize) size_ = newsize;
68 // If reservation is small, and we get a shrink request, simply reduce size_.
69 if (reserve_size_ < kAutoBufferShrinkReserveThreshold && newsize < size_) {
70 size_ = newsize;
77 if (newsize > size_) memset(&data_[size_], 0, newsize - size_);
78 size_ = newsize
[all...] |
| /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 | 28 Rect() : x_(0), y_(0), size_(0, 0) {}
29 Rect(int width, int height) : x_(0), y_(0), size_(width, height) {}
31 : x_(x), y_(y), size_(width, height) {}
32 explicit Rect(const Size& size) : x_(0), y_(0), size_(size) {}
40 int width() const { return size_.width(); }
41 void set_width(int width) { size_.set_width(width); }
43 int height() const { return size_.height(); }
44 void set_height(int height) { size_.set_height(height); }
46 const Size& size() const { return size_; }
63 bool IsEmpty() const { return size_.IsEmpty();
79 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;
55 int32_t available = capacity_ - size_;
60 if (n > 0 && bytes != (outbuf_ + size_)) {
61 uprv_memcpy(outbuf_ + size_, bytes, n);
63 size_ += n;
75 int32_t available = capacity_ - size_;
78 return outbuf_ + size_;
|
| /external/tensorflow/tensorflow/core/lib/io/ |
| block.h | 35 size_t size() const { return size_; }
42 size_t size_; member in class:tensorflow::table::Block
|
| /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/ |
| tensor-view.h | 36 : data_(data), shape_(shape), size_(internal::NumberOfElements(shape)) {}
54 int size() const { return size_; }
57 if (dest_size < size_) {
60 std::copy(data_, data_ + size_, dest);
67 const int size_; member in class:libtextclassifier2::TensorView
|
| /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...] |
