| /external/v8/src/ |
| spaces.h | 408 // Max capacity of the total space.
755 // The 'capacity' of a space is the number of object-area bytes (ie, not
762 // capacity is the sum of size, waste, and available.
765 // functions increase or decrease one of the non-capacity stats in
766 // conjunction with capacity, or else they always balance increases and
767 // decreases to the non-capacity stats.
772 // Zero out all the allocation statistics (ie, no capacity).
780 // Reset the allocation statistics (ie, available = capacity with no
789 int Capacity() { return capacity_; }
[all...] |
| spaces.cc | 301 bool MemoryAllocator::Setup(int capacity) {
302 capacity_ = RoundUp(capacity, Page::kPageSize);
619 PrintF(" capacity: %d, used: %d, available: %%%d\n\n",
668 ASSERT(Capacity() <= max_capacity_);
685 return (Capacity() > 0);
833 ASSERT(Capacity() % Page::kObjectAreaSize == 0);
835 if (Capacity() == max_capacity_) return false;
837 ASSERT(Capacity() < max_capacity_);
841 int available_pages = (max_capacity_ - Capacity()) / Page::kObjectAreaSize;
849 ASSERT(Capacity() <= max_capacity_)
[all...] |
| scanner.cc | 63 int old_capacity = Capacity();
73 ASSERT(Capacity() == new_capacity && pos() == old_position);
80 ASSERT(pos() <= Capacity());
[all...] |
| heap.cc | 128 int Heap::Capacity() {
131 return new_space_.Capacity() +
132 old_pointer_space_->Capacity() +
133 old_data_space_->Capacity() +
134 code_space_->Capacity() +
135 map_space_->Capacity() +
136 cell_space_->Capacity();
353 Counters::symbol_table_capacity.Set(symbol_table()->Capacity());
763 if (new_space_.Capacity() < new_space_.MaximumCapacity() &&
764 survived_since_last_expansion_ > new_space_.Capacity()) {
[all...] |
| scanner.h | 74 int Capacity() const {
79 static char* ComputeLimit(char* data, int capacity) {
80 return (data + capacity) - unibrow::Utf8::kMaxEncodedSize;
|
| heap-inl.h | 178 || (new_space_.Size() + object_size) >= (new_space_.Capacity() >> 2);
|
| objects-debug.cc | 638 && instance_size() < Heap::Capacity());
[all...] |
| objects.cc | 3096 int capacity = dict->Capacity(); local
3836 unsigned capacity = rbb->capacity - rbb->cursor; local
3852 unsigned capacity = rbb->capacity - rbb->cursor; local
6038 int capacity = 0; local
6119 int capacity = HashTable<Shape, Key>::Capacity(); local
6141 int capacity = HashTable<Shape, Key>::Capacity(); local
6840 int capacity = RoundUpToPowerOf2(at_least_space_for); local
6860 uint32_t capacity = Capacity(); local
6876 int capacity = Capacity(); local
6920 uint32_t capacity = Capacity(); local
7027 int capacity = dict->Capacity(); local
7641 int capacity = HashTable<Shape, Key>::Capacity(); local
7696 int capacity = Capacity(); local
7842 int capacity = HashTable<Shape, Key>::Capacity(); local
7868 int capacity = HashTable<Shape, Key>::Capacity(); local
7887 int capacity = Capacity(); local
7908 int capacity = HashTable<Shape, Key>::Capacity(); local
7925 int capacity = HashTable<Shape, Key>::Capacity(); local
7960 int capacity = Capacity(); local
[all...] |
| heap.h | 234 // Returns the capacity of the heap in bytes w/o growing. Heap grows when
236 static int Capacity();
[all...] |
| bootstrapper.cc | 1436 int capacity = properties->Capacity(); local
[all...] |
| runtime.cc | 174 int capacity = element_dictionary->Capacity(); local
175 for (int i = 0; i < capacity; i++) {
[all...] |
| objects.h | 3987 unsigned capacity; member in class:v8::internal::String::ReadBlockBuffer
[all...] |
| /external/protobuf/src/google/protobuf/ |
| repeated_field.h | 103 int Capacity() const;
209 int Capacity() const;
336 int Capacity() const;
440 inline int RepeatedField<Element>::Capacity() const {
446 GOOGLE_DCHECK_LT(size(), Capacity());
452 GOOGLE_DCHECK_LT(size(), Capacity());
682 inline int RepeatedPtrFieldBase::Capacity() const {
905 inline int RepeatedPtrField<Element>::Capacity() const {
906 return RepeatedPtrFieldBase::Capacity();
[all...] |
| repeated_field_unittest.cc | 475 while (field.size() < field.Capacity()) {
481 // First branch: Field is at capacity with no cleared objects.
488 // Last branch: Field is not at capacity and there are no cleared objects.
496 // Third branch: Field is not at capacity and there are no cleared objects.
504 // Second branch: Field is at capacity but has some cleared objects.
505 while (field.size() < field.Capacity()) {
|
| wire_format_lite_inl.h | 232 int elements_already_reserved = values->Capacity() - values->size();
270 int elements_available = min(values->Capacity() - values->size(),
|
