| /external/webrtc/webrtc/modules/video_coding/ |
| timestamp_map.cc | 21 capacity_(capacity),
30 next_add_idx_ = (next_add_idx_ + 1) % capacity_;
34 next_pop_idx_ = (next_pop_idx_ + 1) % capacity_;
44 next_pop_idx_ = (next_pop_idx_ + 1) % capacity_;
53 next_pop_idx_ = (next_pop_idx_ + 1) % capacity_;
|
| timestamp_map.h | 40 const size_t capacity_; member in class:webrtc::VCMTimestampMap
|
| /frameworks/base/media/mca/filterfw/native/core/ |
| native_frame.cpp | 22 NativeFrame::NativeFrame(int size) : data_(NULL), size_(size), capacity_(size) {
23 data_ = capacity_ == 0 ? NULL : new uint8_t[capacity_];
40 size_ = capacity_ = size;
53 if (newSize <= capacity_ && newSize >= 0) {
|
| native_frame.h | 63 return capacity_;
77 int capacity_; member in class:android::filterfw::NativeFrame
|
| /external/webrtc/webrtc/base/ |
| buffer.cc | 18 Buffer::Buffer() : size_(0), capacity_(0), data_(nullptr) {
27 capacity_(buf.capacity()),
38 capacity_(std::max(size, capacity)),
39 data_(new uint8_t[capacity_]) {
|
| cryptstring.h | 75 capacity_ = 32;
109 if (capacity_ >= n) {
113 size_t old_capacity = capacity_;
117 capacity_ *= 2;
118 if (capacity_ >= n)
122 storage_ = new char[capacity_];
137 if (capacity_) {
139 for (size_t i = 1; i < capacity_; i++) {
147 size_t capacity_; member in class:rtc::FormatCryptString
|
| buffer.h | 96 return capacity_;
108 capacity_ = buf.capacity_;
165 if (capacity <= capacity_)
170 capacity_ = capacity;
187 capacity_ = 0;
195 swap(a.capacity_, b.capacity_);
205 return (data_ || capacity_ == 0) && capacity_ >= size_
224 size_t capacity_; member in class:rtc::Buffer
[all...] |
| bufferqueue.cc | 16 : capacity_(capacity), default_size_(default_size) {
41 bool was_writable = queue_.size() < capacity_;
60 if (queue_.size() == capacity_) {
|
| bufferqueue.h | 46 size_t capacity_; member in class:rtc::BufferQueue
|
| /external/v8/src/compiler/ |
| value-numbering-reducer.cc | 46 : entries_(nullptr), capacity_(0), size_(0), zone_(zone) {}
58 DCHECK(capacity_ == 0);
60 capacity_ = kInitialCapacity;
68 DCHECK(size_ < capacity_);
69 DCHECK(size_ * kCapacityToSizeRatio < capacity_);
71 const size_t mask = capacity_ - 1;
72 size_t dead = capacity_;
77 if (dead != capacity_) {
86 if (size_ * kCapacityToSizeRatio >= capacity_) Grow();
88 DCHECK(size_ * kCapacityToSizeRatio < capacity_);
[all...] |
| value-numbering-reducer.h | 28 size_t capacity_; member in class:v8::internal::compiler::final
|
| /external/vixl/src/vixl/ |
| code-buffer.cc | 33 CodeBuffer::CodeBuffer(size_t capacity) : managed_(true), capacity_(capacity) {
34 VIXL_CHECK(capacity_ != 0);
35 buffer_ = reinterpret_cast<byte*>(malloc(capacity_));
51 capacity_(capacity) {
90 memset(buffer_, 0, capacity_);
100 VIXL_ASSERT(new_capacity > capacity_);
106 capacity_ = new_capacity;
|
| code-buffer.h | 60 VIXL_ASSERT((cursor_ >= buffer_) && (cursor_ <= (buffer_ + capacity_)));
61 return (buffer_ + capacity_) - cursor_;
77 size_t capacity() const { return capacity_; }
107 size_t capacity_; member in class:vixl::CodeBuffer
|
| /bionic/libc/bionic/ |
| scandir.cpp | 31 ScandirResult() : names_(nullptr), size_(0), capacity_(0) {
48 size_ = capacity_ = 0;
53 if (size_ >= capacity_) {
54 size_t new_capacity = capacity_ + 32;
61 capacity_ = new_capacity;
83 size_t capacity_; member in class:ScandirResult
|
| /external/icu/icu4c/source/i18n/ |
| collationkeys.h | 33 : buffer_(dest), capacity_(destCapacity),
44 if (appended_ < capacity_ || Resize(1, appended_)) {
62 return ignore_ + capacity_ - appended_;
65 UBool Overflowed() const { return appended_ > capacity_; }
75 capacity_ = 0;
79 int32_t capacity_; member in class:SortKeyByteSink
|
| /external/icu/icu4c/source/common/ |
| bytestream.cpp | 30 : outbuf_(outbuf), capacity_(capacity < 0 ? 0 : capacity),
47 int32_t available = capacity_ - size_;
67 int32_t available = capacity_ - size_;
|
| /external/v8/src/ |
| hashmap.h | 68 uint32_t capacity() const { return capacity_; }
89 uint32_t capacity_; member in class:v8::internal::TemplateHashMapImpl
92 Entry* map_end() const { return map_ + capacity_; }
140 if (occupancy_ + occupancy_ / 4 >= capacity_) {
173 DCHECK(occupancy_ < capacity_);
192 Entry* r = map_ + (q->hash & (capacity_ - 1));
248 DCHECK(base::bits::IsPowerOfTwo32(capacity_));
249 Entry* p = map_ + (hash & (capacity_ - 1));
253 DCHECK(occupancy_ < capacity_); // Guarantees loop termination.
274 capacity_ = capacity
[all...] |
| list-inl.h | 19 if (length_ < capacity_) {
36 if (capacity_ < result_length) Resize(result_length, alloc);
56 DCHECK(length_ >= capacity_);
59 int new_capacity = 1 + 2 * capacity_;
75 capacity_ = new_capacity;
132 std::swap(capacity_, list->capacity_);
149 capacity_ = 0;
163 if (length_ < capacity_ / 4) {
164 Resize(capacity_ / 2, alloc)
[all...] |
| string-stream.h | 106 capacity_(kInitialCapacity),
171 unsigned capacity_; member in class:v8::internal::final
175 bool full() const { return (capacity_ - length_) == 1; }
176 int space() const { return capacity_ - length_; }
|
| /ndk/sources/android/support/tests/minitest/ |
| minitest.cc | 102 capacity_ = 0;
106 if (new_size > capacity_) {
107 size_t new_capacity = capacity_;
119 if (new_capacity > capacity_)
120 ::memset(str_ + capacity_, '\0', new_capacity - capacity_);
121 capacity_ = new_capacity;
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| result_set.h | 94 KNNSimpleResultSet(int capacity_) : capacity(capacity_), count(0)
161 KNNResultSet(int capacity_) : capacity(capacity_), count(0)
238 RadiusResultSet(DistanceType radius_, int* indices_, DistanceType* dists_, int capacity_) :
239 radius(radius_), indices(indices_), dists(dists_), capacity(capacity_)
395 KNNUniqueResultSet(unsigned int capacity) : capacity_(capacity)
412 if (dist_indices_.size() > capacity_) {
417 else if (dist_indices_.size() == capacity_) {
439 unsigned int capacity_; member in class:cvflann::KNNUniqueResultSet
536 unsigned int capacity_; member in class:cvflann::KNNRadiusUniqueResultSet
[all...] |
| /external/v8/src/interpreter/ |
| constant-array-builder.h | 74 inline size_t capacity() const { return capacity_; }
80 const size_t capacity_; member in struct:v8::internal::interpreter::final::final
|
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 77 return AtomicPushBackInternal(value, capacity_);
117 for (size_t i = 0; i < capacity_; ++i) {
175 return capacity_;
180 capacity_ = new_capacity;
217 capacity_(capacity),
242 mem_map_.reset(MemMap::MapAnonymous(name_.c_str(), nullptr, capacity_ * sizeof(begin_[0]),
262 // Current maximum which we can push back to, must be <= capacity_.
265 size_t capacity_; member in class:art::gc::accounting::AtomicStack
|
| /external/webrtc/webrtc/modules/audio_coding/neteq/ |
| audio_vector.cc | 24 capacity_(kDefaultInitialSize) {
30 capacity_(initial_size) {
43 assert(copy_to->capacity_ >= Size());
115 position = std::min(capacity_, position);
182 if (capacity_ < n) {
186 capacity_ = n;
|
| /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)) {
340 uint16_t capacity_; member in class:v8::internal::final
346 if (capacity_ < size) {
347 int new_capacity = 2 * capacity_ + size;
353 capacity_ = new_capacity;
|
