/external/webrtc/webrtc/modules/audio_coding/neteq/ |
H A D | audio_vector.h | 106 size_t capacity_; // Allocated number of samples in the array. member in class:webrtc::AudioVector
|
/external/webrtc/webrtc/base/ |
H A D | bufferqueue.h | 46 size_t capacity_; member in class:rtc::BufferQueue
|
H A D | 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_ > 224 size_t capacity_; member in class:rtc::Buffer [all...] |
H A D | 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
|
/external/webrtc/webrtc/modules/video_coding/ |
H A D | timestamp_map.h | 40 const size_t capacity_; member in class:webrtc::VCMTimestampMap
|
/external/v8/src/compiler/ |
H A D | value-numbering-reducer.h | 33 size_t capacity_; member in class:v8::internal::compiler::final
|
H A D | node.h | 174 int capacity_; member in struct:v8::internal::compiler::final::OutOfLineInputs
|
/external/icu/icu4c/source/common/unicode/ |
H A D | bytestream.h | 216 const int32_t capacity_; member in class:CheckedArrayByteSink
|
/external/libtextclassifier/util/utf8/ |
H A D | unicodetext.h | 162 int capacity_; member in class:libtextclassifier::UnicodeText::Repr 165 Repr() : data_(NULL), size_(0), capacity_(0), ours_(true) {}
|
/external/protobuf/src/google/protobuf/stubs/ |
H A D | bytestream.h | 204 const size_t capacity_; member in class:google::protobuf::strings::CheckedArrayByteSink 240 size_t capacity_; member in class:google::protobuf::strings::GrowingArrayByteSink
|
/external/v8/src/ |
H A D | list.h | 81 INLINE(int capacity() const) { return capacity_; } 173 capacity_ = capacity; 179 int capacity_; member in class:v8::internal::List
|
H A D | identity-map.h | 23 int capacity() const { return capacity_; } 37 capacity_(0), 73 int capacity_; member in class:v8::internal::IdentityMapBase
|
H A D | string-stream.h | 110 capacity_(kInitialCapacity), 172 unsigned capacity_; member in class:v8::internal::final 176 bool full() const { return (capacity_ - length_) == 1; } 177 int space() const { return capacity_ - length_; }
|
H A D | api.cc | 5649 capacity_(capacity), 5711 int remaining_capacity = capacity_ - static_cast<int>(buffer - start_); 5728 DCHECK(capacity_ == -1 || (buffer - start_) <= capacity_); 5736 DCHECK(capacity_ == -1 || (buffer - start_) <= capacity_); 5750 int remaining_capacity = capacity_ - static_cast<int>(buffer - start_); 5799 (capacity_ == -1 || (buffer_ - start_) < capacity_)) { 5810 int capacity_; member in class:v8::Utf8WriterVisitor [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | collationkeys.h | 35 : buffer_(dest), capacity_(destCapacity), 46 if (appended_ < capacity_ || Resize(1, appended_)) { 64 return ignore_ + capacity_ - appended_; 67 UBool Overflowed() const { return appended_ > capacity_; } 77 capacity_ = 0; 81 int32_t capacity_; member in class:SortKeyByteSink
|
/external/v8/src/crankshaft/ |
H A D | 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;
|
/external/v8/src/interpreter/ |
H A D | constant-array-builder.h | 162 inline size_t capacity() const { return capacity_; } 170 const size_t capacity_; member in struct:v8::internal::interpreter::BASE_EMBEDDED::final
|
/external/vixl/src/ |
H A D | code-buffer-vixl.h | 98 VIXL_ASSERT((cursor_ >= buffer_) && (cursor_ <= (buffer_ + capacity_))); 99 return (buffer_ + capacity_) - cursor_; 106 VIXL_ASSERT((cursor_ >= buffer_) && (cursor_ <= (buffer_ + capacity_))); 141 size_t GetCapacity() const { return capacity_; } 160 if (is_full) Grow(capacity_ * 2 + amount); 181 size_t capacity_; member in class:vixl::CodeBuffer
|
/external/webrtc/webrtc/modules/remote_bitrate_estimator/ |
H A D | remote_bitrate_estimator_unittest_helper.h | 136 int capacity_; member in class:webrtc::testing::StreamGenerator
|
/external/webrtc/webrtc/modules/remote_bitrate_estimator/test/ |
H A D | bwe.h | 73 explicit LinkedSet(int capacity) : capacity_(capacity) {} 92 size_t capacity() const { return capacity_; } 106 size_t capacity_; member in class:webrtc::testing::bwe::LinkedSet
|
/external/v8/src/base/ |
H A D | hashmap.h | 83 capacity_ = 0; 92 uint32_t capacity() const { return capacity_; } 106 Initialize(capacity_, allocator); 115 uint32_t capacity_; member in class:v8::base::TemplateHashMapImpl 121 Entry* map_end() const { return map_ + capacity_; } 145 : capacity_(original->capacity_), 148 map_ = reinterpret_cast<Entry*>(allocator.New(capacity_ * sizeof(Entry))); 149 memcpy(map_, original->map_, capacity_ * sizeof(Entry)); 227 DCHECK(occupancy_ < capacity_); 302 DCHECK(i < capacity_); DCHECK(occupancy_ < capacity_); while (map_[i].exists() && !match_(hash, map_[i].hash, key, map_[i].key)) { i = (i + 1) & (capacity_ - 1); } return &map_[i]; } template <typename Key, typename Value, typename MatchFun, class AllocationPolicy> typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry* TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::FillEmptyEntry( Entry* entry, const Key& key, const Value& value, uint32_t hash, AllocationPolicy allocator) { DCHECK(!entry->exists()); new (entry) Entry(key, value, hash); occupancy_++; if (occupancy_ + occupancy_ / 4 >= capacity_) argument [all...] |
/external/v8/src/zone/ |
H A D | zone-chunk-list.h | 106 uint32_t capacity_ = 0; member in struct:v8::internal::ZoneChunkList::StartMode::Chunk 116 chunk->capacity_ = capacity; 156 if (position_ >= current_->capacity_) { 165 position_ = current_ ? current_->capacity_ - 1 : 0; 217 DCHECK_LE(list->back_->position_, list->back_->capacity_); 218 if (list->back_->position_ == list->back_->capacity_) { 267 list->back_->previous_, list->back_->previous_->capacity_ - 1); 309 DCHECK_LE(back_->position_, back_->capacity_); 310 if (back_->position_ == back_->capacity_) { 312 Chunk* chunk = NewChunk(Min(back_->capacity_ << [all...] |
/external/v8/src/heap/ |
H A D | spaces.h | 1264 return capacity_ < size ? 0 : capacity_ - size; 1371 size_t capacity_; member in class:v8::internal::MemoryAllocator 1372 // Maximum subset of capacity_ that can be executable 1572 capacity_ = 0; 1577 void ClearSize() { size_ = capacity_; } 1580 size_t Capacity() { return capacity_; } 1589 DCHECK_GE(capacity_ + bytes, capacity_); 1590 capacity_ 1642 size_t capacity_; member in class:v8::internal::BASE_EMBEDDED [all...] |