/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | buffer.h | 58 size_t capacity() const { return capacity_; } 90 if (capacity > capacity_) { 94 capacity_ = capacity; 102 buf->capacity_ = capacity_; 108 data_.reset(new char[capacity_ = capacity]); 114 size_t capacity_; member in class:talk_base::Buffer
|
H A D | cryptstring.h | 95 capacity_ = 32; 129 if (capacity_ >= n) { 133 size_t old_capacity = capacity_; 137 capacity_ *= 2; 138 if (capacity_ >= n) 142 storage_ = new char[capacity_]; 157 if (capacity_) { 159 for (size_t i = 1; i < capacity_; i++) { 167 size_t capacity_; member in class:talk_base::FormatCryptString
|
/external/chromium/net/spdy/ |
H A D | spdy_frame_builder.cc | 12 // We mark a read only SpdyFrameBuilder with a special capacity_. 17 capacity_(0), 25 capacity_(kCapacityReadOnly), 31 if (capacity_ != kCapacityReadOnly) 117 DCHECK(capacity_ != kCapacityReadOnly); 151 if (needed_size > capacity_ && !Resize(std::max(capacity_ * 2, needed_size))) 165 if (new_capacity <= capacity_) 172 memcpy(p, buffer_, capacity_); 176 capacity_ [all...] |
H A D | spdy_frame_builder.h | 47 capacity_ = 0; 120 return capacity_; 152 size_t capacity_; // Allocation size of payload (or -1 if buffer is const). member in class:spdy::SpdyFrameBuilder
|
/external/chromium/net/base/ |
H A D | io_buffer.cc | 82 capacity_(0), 90 capacity_ = capacity; 98 DCHECK(offset >= 0 && offset <= capacity_); 104 return capacity_ - offset_;
|
H A D | io_buffer.h | 106 int capacity() { return capacity_; } 119 int capacity_; member in class:net::GrowableIOBuffer
|
/external/icu4c/common/ |
H A D | bytestream.cpp | 28 : outbuf_(outbuf), capacity_(capacity < 0 ? 0 : capacity), 43 int32_t available = capacity_ - size_; 63 int32_t available = capacity_ - size_;
|
/external/v8/src/ |
H A D | hashmap.h | 77 uint32_t capacity() const { return capacity_; } 93 uint32_t capacity_; member in class:v8::internal::TemplateHashMapImpl 96 Entry* map_end() const { return map_ + capacity_; } 135 if (occupancy_ + occupancy_/4 >= capacity_) { 171 ASSERT(occupancy_ < capacity_); 190 Entry* r = map_ + (q->hash & (capacity_ - 1)); 244 ASSERT(IsPowerOf2(capacity_)); 245 Entry* p = map_ + (hash & (capacity_ - 1)); 249 ASSERT(occupancy_ < capacity_); // Guarantees loop termination. 269 capacity_ [all...] |
H A D | list-inl.h | 39 if (length_ < capacity_) { 56 if (capacity_ < result_length) Resize(result_length); 74 ASSERT(length_ >= capacity_); 77 int new_capacity = 1 + 2 * capacity_; 89 memcpy(new_data, data_, capacity_ * sizeof(T)); 92 capacity_ = new_capacity; 205 capacity_ = capacity;
|
H A D | string-stream.h | 117 capacity_(kInitialCapacity), 179 unsigned capacity_; member in class:v8::internal::StringStream 183 bool full() const { return (capacity_ - length_) == 1; } 184 int space() const { return capacity_ - length_; }
|
H A D | list.h | 82 INLINE(int capacity() const) { return capacity_; } 146 int capacity_;
|
H A D | string-stream.cc | 55 ASSERT(length_ < capacity_); 57 // indicated by a difference of 1 between length_ and capacity_. Thus when 59 if (length_ == capacity_ - 2) { 60 unsigned new_capacity = capacity_; 62 if (new_capacity > capacity_) { 63 capacity_ = new_capacity; 67 ASSERT(capacity_ >= 5); 68 length_ = capacity_ - 1; // Indicate fullness of the stream.
|
H A D | spaces.cc | 266 capacity_(0), 274 capacity_ = RoundUp(capacity, Page::kPageSize); 276 ASSERT_GE(capacity_, capacity_executable_); 290 capacity_ = 0; 695 float pct = static_cast<float>(capacity_ - size_) / capacity_; 699 capacity_, size_, static_cast<int>(pct*100)); 1295 capacity_ = initial_capacity; 1308 capacity_ = 0; 1314 int pages = capacity_ / Pag 1415 capacity_ = new_capacity; member in namespace:v8::internal [all...] |
H A D | spaces.h | 962 intptr_t Available() { return capacity_ < size_ ? 0 : capacity_ - size_; } 1051 size_t capacity_; member in class:v8::internal::MemoryAllocator 1052 // Maximum subset of capacity_ that can be executable 1222 capacity_ = 0; 1228 size_ = capacity_; 1240 intptr_t Capacity() { return capacity_; } 1248 capacity_ += size_in_bytes; 1257 capacity_ -= size_in_bytes; 1282 intptr_t capacity_; member in class:v8::internal::BASE_EMBEDDED 1939 int capacity_; member in class:v8::internal::SemiSpace [all...] |
H A D | liveobjectlist.h | 203 int capacity_; member in class:v8::internal::LiveObjectList
|
H A D | gdb-jit.cc | 62 capacity_(1024), 63 buffer_(reinterpret_cast<byte*>(malloc(capacity_))) { 123 if (capacity_ < pos) { 124 while (capacity_ < pos) capacity_ *= 2; 125 buffer_ = reinterpret_cast<byte*>(realloc(buffer_, capacity_)); 178 ASSERT(offset < capacity_ && offset + sizeof(T) <= capacity_); 184 uintptr_t capacity_;
|
H A D | liveobjectlist.cc | 929 capacity_(capacity), 976 ASSERT(obj_count_ <= capacity_); 977 if (obj_count_ == capacity_) { 2422 lol->capacity_ = 0; 2445 int diff = lol->capacity_ - new_count; 2454 lol->capacity_ = new_count;
|
H A D | objects.h | 7102 unsigned capacity_, 7106 capacity(capacity_),
|
H A D | hydrogen.cc | 1370 : capacity_(capacity), 1381 ASSERT(0 <= n && n < capacity_); 1397 int capacity_; member in class:v8::internal::SparseSet
|
/external/chromium/base/ |
H A D | pickle.cc | 17 // We mark a read only pickle with a special capacity_. 25 capacity_(0), 34 capacity_(0), 45 capacity_(kCapacityReadOnly), 64 capacity_(0), 73 if (capacity_ != kCapacityReadOnly) 82 if (capacity_ == kCapacityReadOnly) { 84 capacity_ = 0; 330 DCHECK(capacity_ != kCapacityReadOnly) << "oops: pickle is readonly"; 385 if (needed_size > capacity_ [all...] |
H A D | pickle.h | 193 return capacity_; 238 size_t capacity_; member in class:Pickle
|
/external/icu4c/common/unicode/ |
H A D | bytestream.h | 209 const int32_t capacity_; member in class:CheckedArrayByteSink
|
/external/protobuf/gtest/src/ |
H A D | gtest-internal-inl.h | 255 Vector() : elements_(NULL), capacity_(0), size_(0) {} 269 capacity_ = size_ = 0; 452 if (new_capacity <= capacity_) 455 capacity_ = new_capacity; 457 realloc(elements_, capacity_*sizeof(elements_[0]))); 462 if (size_ < capacity_) 468 const int new_capacity = 3*(capacity_/2 + 1); 469 GTEST_CHECK_(new_capacity > capacity_) // Does the new capacity overflow? 470 << "Cannot grow a Vector with " << capacity_ << " elements already."; 480 int capacity_; // Th member in class:testing::internal::Vector [all...] |
/external/chromium/chrome/browser/tab_contents/ |
H A D | thumbnail_generator_unittest.cc | 289 capacity_(1) { 294 return known_url_map_.size() >= capacity_; 317 size_t capacity_; member in class:MockTopSites
|
/external/icu4c/i18n/ |
H A D | ucol.cpp | 4275 : ownedBuffer_(NULL), buffer_(dest), capacity_(destCapacity), 4279 if (buffer_ == NULL || capacity_ < 0) { 4281 capacity_ = 0; 4289 if (appended_ < capacity_) { 4297 if (a2 <= capacity_) { 4338 capacity_ = 0; 4345 int32_t capacity_; member in class:SortKeyByteSink 4366 int32_t available = capacity_ - length; 4406 int32_t available = capacity_ - appended_; 4411 *result_capacity = capacity_ [all...] |