capacity 3853 src/api.cc if (capacity == -1) {
capacity 3854 src/api.cc capacity = str->length() + 1;
capacity 3857 src/api.cc len = i::Min(capacity, str->length());
capacity 3861 src/api.cc if (!(options & NO_NULL_TERMINATION) && capacity > len) {
capacity 3868 src/api.cc if (capacity == -1 || capacity / 3 >= string_length) {
capacity 3882 src/api.cc (capacity > utf8_bytes || capacity == -1)) {
capacity 3891 src/api.cc return WriteUtf8(buffer, capacity, nchars_ref, options);
capacity 3892 src/api.cc } else if (capacity >= string_length) {
capacity 3898 src/api.cc if (utf8_bytes <= capacity) {
capacity 3916 src/api.cc int fast_end = capacity - (unibrow::Utf8::kMaxEncodedSize - 1);
capacity 3921 src/api.cc for (i = 0; i < len && (capacity == -1 || pos < fast_end); i++) {
capacity 3933 src/api.cc for (; i < len && pos < capacity; i++) {
capacity 3941 src/api.cc ASSERT(pos < capacity);
capacity 3951 src/api.cc if (pos + written <= capacity) {
capacity 3966 src/api.cc (i == len && (capacity == -1 || pos < capacity)))
capacity 270 src/ast.h SmallMapList(int capacity, Zone* zone) : list_(capacity, zone) {}
capacity 272 src/ast.h void Reserve(int capacity, Zone* zone) { list_.Reserve(capacity, zone); }
capacity 435 src/ast.h int capacity,
capacity 439 src/ast.h statements_(capacity, zone),
capacity 2713 src/ast.h int capacity,
capacity 2716 src/ast.h isolate_, labels, capacity, is_initializer_block, zone_);
capacity 2202 src/bootstrapper.cc int capacity = properties->Capacity();
capacity 2203 src/bootstrapper.cc for (int i = 0; i < capacity; i++) {
capacity 525 src/builtins.cc int capacity = new_length + (new_length >> 1) + 16;
capacity 527 src/builtins.cc { MaybeObject* maybe_obj = heap->AllocateUninitializedFixedArray(capacity);
capacity 534 src/builtins.cc FillWithHoles(heap, new_elms, new_length, capacity);
capacity 662 src/builtins.cc int capacity = new_length + (new_length >> 1) + 16;
capacity 664 src/builtins.cc { MaybeObject* maybe_obj = heap->AllocateUninitializedFixedArray(capacity);
capacity 670 src/builtins.cc FillWithHoles(heap, new_elms, new_length, capacity);
capacity 894 src/builtins.cc int capacity = new_length + (new_length >> 1) + 16;
capacity 897 src/builtins.cc heap->AllocateUninitializedFixedArray(capacity);
capacity 914 src/builtins.cc FillWithHoles(heap, new_elms, new_length, capacity);
capacity 584 src/elements.cc capacity,
capacity 979 src/elements.cc return obj->SetFastElementsCapacityAndLength(capacity,
capacity 1049 src/elements.cc return obj->SetFastDoubleElementsCapacityAndLength(capacity,
capacity 1159 src/elements.cc uint32_t capacity =
capacity 1161 src/elements.cc return key < capacity;
capacity 1285 src/elements.cc int capacity = dict->Capacity();
capacity 1286 src/elements.cc for (int i = 0; i < capacity; i++) {
capacity 1304 src/elements.cc for (int i = 0; i < capacity; i++) {
capacity 89 src/elements.h int capacity,
capacity 1019 src/factory.cc capacity,
capacity 1044 src/factory.cc accessor->SetCapacityAndLength(*array, capacity, length));
capacity 273 src/factory.h int capacity,
capacity 283 src/factory.h int capacity,
capacity 51 src/hashmap.h uint32_t capacity = kDefaultHashMapCapacity,
capacity 87 src/hashmap.h uint32_t capacity() const { return capacity_; }
capacity 108 src/hashmap.h void Initialize(uint32_t capacity, AllocationPolicy allocator);
capacity 277 src/hashmap.h uint32_t capacity, AllocationPolicy allocator) {
capacity 278 src/hashmap.h ASSERT(IsPowerOf2(capacity));
capacity 279 src/hashmap.h map_ = reinterpret_cast<Entry*>(allocator.New(capacity * sizeof(Entry)));
capacity 284 src/hashmap.h capacity_ = capacity;
capacity 4010 src/heap.cc ASSERT(capacity >= length);
capacity 4018 src/heap.cc if (capacity == 0) {
capacity 4028 src/heap.cc maybe_elms = AllocateUninitializedFixedDoubleArray(capacity);
capacity 4031 src/heap.cc maybe_elms = AllocateFixedDoubleArrayWithHoles(capacity);
capacity 4036 src/heap.cc maybe_elms = AllocateUninitializedFixedArray(capacity);
capacity 4039 src/heap.cc maybe_elms = AllocateFixedArrayWithHoles(capacity);
capacity 550 src/heap.h int capacity,
capacity 1675 src/hydrogen.cc memset(sparse_, 0, sizeof(sparse_[0]) * capacity);
capacity 435 src/incremental-marking.cc int capacity = stubs->Capacity();
capacity 436 src/incremental-marking.cc for (int i = 0; i < capacity; i++) {
capacity 1605 src/isolate.cc int capacity = serialize_partial_snapshot_cache_capacity();
capacity 1607 src/isolate.cc if (length >= capacity) {
capacity 1608 src/isolate.cc int new_capacity = static_cast<int>((capacity + 10) * 1.2);
capacity 1613 src/isolate.cc if (capacity != 0) delete[] serialize_partial_snapshot_cache();
capacity 214 src/list-inl.h void List<T, P>::Initialize(int capacity, P allocator) {
capacity 215 src/list-inl.h ASSERT(capacity >= 0);
capacity 216 src/list-inl.h data_ = (capacity > 0) ? NewData(capacity, allocator) : NULL;
capacity 217 src/list-inl.h capacity_ = capacity;
capacity 56 src/list.h INLINE(explicit List(int capacity,
capacity 58 src/list.h Initialize(capacity, allocator);
capacity 96 src/list.h INLINE(int capacity() const) { return capacity_; }
capacity 164 src/list.h INLINE(void Initialize(int capacity,
capacity 931 src/liveobjectlist.cc elements_ = NewArray<Element>(capacity);
capacity 122 src/liveobjectlist.h explicit LiveObjectList(LiveObjectList* prev, int capacity);
capacity 256 src/log.h intptr_t capacity, intptr_t used);
capacity 2150 src/objects-inl.h int capacity = RoundUpToPowerOf2(at_least_space_for * 2);
capacity 2151 src/objects-inl.h if (capacity < kMinCapacity) {
capacity 2152 src/objects-inl.h capacity = kMinCapacity; // Guarantee min capacity.
capacity 2154 src/objects-inl.h return capacity;
capacity 2167 src/objects-inl.h uint32_t capacity = Capacity();
capacity 2168 src/objects-inl.h uint32_t entry = FirstProbe(HashTable<Shape, Key>::Hash(key), capacity);
capacity 2177 src/objects-inl.h entry = NextProbe(entry, count++, capacity);
capacity 6092 src/objects.cc rbb->capacity,
capacity 6099 src/objects.cc rbb->capacity,
capacity 6143 src/objects.cc (rbb->capacity <= left_length - offset &&
capacity 6188 src/objects.cc max_chars > rbb->capacity ? rbb->capacity : max_chars);
capacity 6222 src/objects.cc rbb->capacity,
capacity 6228 src/objects.cc rbb->capacity,
capacity 6243 src/objects.cc unsigned capacity = rbb->capacity - rbb->cursor;
capacity 6244 src/objects.cc if (max_chars > capacity) max_chars = capacity;
capacity 6259 src/objects.cc unsigned capacity = rbb->capacity - rbb->cursor;
capacity 6260 src/objects.cc if (max_chars > capacity) max_chars = capacity;
capacity 6480 src/objects.cc ReadBlockBuffer rbb(util_buffer, 0, capacity, 0);
capacity 6496 src/objects.cc if (chars > capacity) chars = capacity;
capacity 6497 src/objects.cc ReadBlockBuffer rbb(util_buffer, 0, capacity, 0);
capacity 8494 src/objects.cc { MaybeObject* maybe = heap->AllocateFixedArrayWithHoles(capacity);
capacity 8559 src/objects.cc heap->AllocateUninitializedFixedDoubleArray(capacity);
capacity 8606 src/objects.cc ASSERT(capacity >= 0);
capacity 8609 src/objects.cc if (capacity == 0) {
capacity 8612 src/objects.cc MaybeObject* maybe_obj = heap->AllocateFixedArrayWithHoles(capacity);
capacity 8661 src/objects.cc int capacity = (cache->length() - header) / step;
capacity 8665 src/objects.cc if (transitions > capacity) {
capacity 8666 src/objects.cc if (capacity > kMaxCachedPrototypeTransitions) return this;
capacity 8675 src/objects.cc for (int i = 0; i < capacity * step; i++) {
capacity 9185 src/objects.cc uint32_t capacity = static_cast<uint32_t>(backing_store->length());
capacity 9188 src/objects.cc (index >= capacity || backing_store->get(index)->IsTheHole())) {
capacity 9197 src/objects.cc uint32_t new_capacity = capacity;
capacity 9210 src/objects.cc introduces_holes = index >= capacity;
capacity 9226 src/objects.cc if (index >= capacity) {
capacity 9228 src/objects.cc if ((index - capacity) < kMaxGap) {
capacity 9264 src/objects.cc if (new_capacity != capacity) {
capacity 9782 src/objects.cc uint32_t capacity = static_cast<uint32_t>(elms->length());
capacity 9783 src/objects.cc uint32_t length = capacity;
capacity 9799 src/objects.cc SetFastDoubleElementsCapacityAndLength(capacity, length);
capacity 9808 src/objects.cc capacity, length, kDontAllowSmiElements);
capacity 9896 src/objects.cc int capacity = 0;
capacity 9898 src/objects.cc GetElementsCapacityAndUsage(&capacity, &used);
capacity 9899 src/objects.cc return (capacity == 0) || (used > (capacity / 2));
capacity 9904 src/objects.cc *capacity = 0;
capacity 9917 src/objects.cc *capacity = dictionary->Capacity();
capacity 9925 src/objects.cc *capacity = backing_store_base->length();
capacity 9933 src/objects.cc *capacity = backing_store->length();
capacity 9934 src/objects.cc for (int i = 0; i < *capacity; ++i) {
capacity 9941 src/objects.cc *capacity = dictionary->Capacity();
capacity 9947 src/objects.cc *capacity = backing_store_base->length();
capacity 9954 src/objects.cc *capacity = elms->length();
capacity 9955 src/objects.cc for (int i = 0; i < *capacity; i++) {
capacity 9971 src/objects.cc *capacity = external_array->length();
capacity 10065 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
capacity 10066 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 10087 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
capacity 10090 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 10989 src/objects.cc int capacity = ComputeCapacity(at_least_space_for);
capacity 10990 src/objects.cc if (capacity > HashTable::kMaxCapacity) {
capacity 10996 src/objects.cc AllocateHashTable(EntryToIndex(capacity), pretenure);
capacity 11001 src/objects.cc HashTable::cast(obj)->SetCapacity(capacity);
capacity 11022 src/objects.cc uint32_t capacity = Capacity();
capacity 11023 src/objects.cc uint32_t entry = FirstProbe(key->Hash(), capacity);
capacity 11040 src/objects.cc entry = NextProbe(entry, count++, capacity);
capacity 11061 src/objects.cc int capacity = Capacity();
capacity 11062 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 11082 src/objects.cc int capacity = Capacity();
capacity 11088 src/objects.cc if (nod <= (capacity - nof) >> 1) {
capacity 11090 src/objects.cc if (nof + needed_free <= capacity) return this;
capacity 11095 src/objects.cc (capacity > kMinCapacityForPretenure) && !GetHeap()->InNewSpace(this);
capacity 11108 src/objects.cc int capacity = Capacity();
capacity 11113 src/objects.cc if (nof > (capacity >> 2)) return this;
capacity 11137 src/objects.cc uint32_t capacity = Capacity();
capacity 11138 src/objects.cc uint32_t entry = FirstProbe(hash, capacity);
capacity 11144 src/objects.cc entry = NextProbe(entry, count++, capacity);
capacity 11291 src/objects.cc int capacity = dict->Capacity();
capacity 11292 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 12079 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
capacity 12081 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 12098 src/objects.cc capacity = HashTable<Shape, Key>::Capacity();
capacity 12100 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 12325 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
capacity 12327 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 12353 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
capacity 12355 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 12374 src/objects.cc int capacity = Capacity();
capacity 12376 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 12398 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
capacity 12399 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 12417 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
capacity 12418 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 12448 src/objects.cc int capacity = Capacity();
capacity 12449 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 12492 src/objects.cc for (int i = 0; i < capacity; i++) {
capacity 1853 src/objects.h int capacity,
capacity 1857 src/objects.h int capacity,
capacity 2204 src/objects.h void GetElementsCapacityAndUsage(int* capacity, int* used);
capacity 2901 src/objects.h void SetCapacity(int capacity) {
capacity 2905 src/objects.h ASSERT(capacity > 0);
capacity 2906 src/objects.h ASSERT(capacity <= kMaxCapacity);
capacity 2907 src/objects.h set(kCapacityIndex, Smi::FromInt(capacity));
capacity 7318 src/objects.h unsigned capacity,
capacity 7323 src/objects.h unsigned capacity,
capacity 7371 src/objects.h capacity(capacity_),
capacity 7376 src/objects.h unsigned capacity;
capacity 8216 src/objects.h MUST_USE_RESULT MaybeObject* Initialize(int capacity);
capacity 1089 src/parser.cc if (names_.capacity() == 0) {
capacity 1090 src/parser.cc ASSERT(assigned_arguments_.capacity() == 0);
capacity 1091 src/parser.cc ASSERT(assigned_constants_.capacity() == 0);
capacity 174 src/profile-generator.cc size += sizeof(HashMap::Entry) * names_.capacity();
capacity 1468 src/profile-generator.cc sizeof(HashMap::Entry) * entries_map_.capacity() +
capacity 1560 src/profile-generator.cc size += sizeof(HashMap::Entry) * snapshots_uids_.capacity();
capacity 243 src/runtime.cc int capacity = element_dictionary->Capacity();
capacity 244 src/runtime.cc for (int i = 0; i < capacity; i++) {
capacity 2393 src/runtime.cc ASSERT(length_ < capacity());
capacity 2401 src/runtime.cc ASSERT(length_ < capacity());
capacity 2565 src/runtime.cc ASSERT(array_builder_.capacity() > array_builder_.length());
capacity 9703 src/runtime.cc int capacity = dictionary->Capacity();
capacity 9704 src/runtime.cc for (int i = 0; i < capacity; i++) {
capacity 9810 src/runtime.cc uint32_t capacity = dict->Capacity();
capacity 9811 src/runtime.cc for (uint32_t j = 0; j < capacity; j++) {
capacity 230 src/scanner.h int capacity = Max(min_capacity, backing_store_.length());
capacity 231 src/scanner.h int new_capacity = Min(capacity * kGrowthFactory, capacity + kMaxGrowth);
capacity 47 src/small-pointer-list.h SmallPointerList(int capacity, Zone* zone) : data_(kEmptyTag) {
capacity 48 src/small-pointer-list.h Reserve(capacity, zone);
capacity 51 src/small-pointer-list.h void Reserve(int capacity, Zone* zone) {
capacity 52 src/small-pointer-list.h if (capacity < 2) return;
capacity 54 src/small-pointer-list.h if (list()->capacity() >= capacity) return;
capacity 56 src/small-pointer-list.h list()->AddBlock(NULL, capacity - list()->capacity(), zone);
capacity 60 src/small-pointer-list.h PointerList* list = new(zone) PointerList(capacity, zone);
capacity 274 src/spaces.cc capacity_ = RoundUp(capacity, Page::kPageSize);
capacity 161 src/unicode-inl.h unsigned capacity, unsigned& offset) {
capacity 162 src/unicode-inl.h if (offset >= capacity) return false;
capacity 169 src/unicode-inl.h unsigned capacity, unsigned& offset) {
capacity 171 src/unicode-inl.h if ((aligned + sizeof(uchar)) > capacity)
capacity 185 src/unicode-inl.h bool CharacterStream::EncodeCharacter(uchar c, byte* buffer, unsigned capacity,
capacity 188 src/unicode-inl.h return EncodeAsciiCharacter(c, buffer, capacity, offset);
capacity 190 src/unicode-inl.h return EncodeNonAsciiCharacter(c, buffer, capacity, offset);
capacity 310 src/unicode.cc capacity,
capacity 319 src/unicode.cc capacity,
capacity 158 src/unicode.h unsigned capacity, unsigned* chars_read, unsigned* offset);
capacity 193 src/unicode.h static inline bool EncodeCharacter(uchar c, byte* buffer, unsigned capacity,
capacity 196 src/unicode.h unsigned capacity, unsigned& offset);
capacity 198 src/unicode.h unsigned capacity, unsigned& offset);
capacity 148 src/zone.cc memset(start, kZapDeadByte, keep->capacity());
capacity 187 src/zone.h ZoneList(int capacity, Zone* zone)
capacity 188 src/zone.h : List<T, ZoneAllocationPolicy>(capacity, ZoneAllocationPolicy(zone)) { }
capacity 222 src/zone.h INLINE(void Initialize(int capacity, Zone* zone)) {
capacity 223 src/zone.h List<T, ZoneAllocationPolicy>::Initialize(capacity,
capacity 139 test/cctest/test-list.cc CHECK_LE(100, list.capacity());