Lines Matching refs:Allocate
1761 // The Windows version of vsnprintf can allocate when printing a %g string
1765 // print that using vsnprintf (which may truncate but never allocate if
1808 // double field, allocate new storage.
1879 // Allocate new instance descriptors with (name, index) added
1934 // Allocate new instance descriptors with (name, constant) added
2345 // - Otherwise, allocate a fixed array large enough to hold all fields, in
4498 // Allocate new content.
4508 NameDictionary::Allocate(GetHeap(), property_count);
4672 // Compute the effective length and allocate a new backing store.
4681 SeededNumberDictionary::Allocate(GetHeap(), used_elements);
4939 ObjectHashTable::Allocate(GetHeap(),
5506 MaybeObject* maybe_dict = SeededNumberDictionary::Allocate(heap, used);
6107 // For the global object allocate a new map to invalidate the global inline
6303 // containing the accessor. Allocate a new pair if there were no source
6582 MaybeObject* maybe_descriptors = DescriptorArray::Allocate(
6833 MaybeObject* maybe_descriptors = DescriptorArray::Allocate(old_size, 1);
6880 MaybeObject* maybe_descriptors = Allocate(size);
6927 MaybeObject* maybe_descriptors = DescriptorArray::Allocate(new_size);
6962 // Allocate the code cache if not present.
7201 CodeCacheHashTable::Allocate(GetHeap(),
7482 PolymorphicCodeCacheHashTable::Allocate(
7717 MaybeObject* DescriptorArray::Allocate(int number_of_descriptors, int slack) {
7723 // Allocate the array of keys.
7781 // Allocate a new descriptor array large enough to hold the required
7783 MaybeObject* maybe_descriptors = DescriptorArray::Allocate(
7942 MaybeObject* DeoptimizationInputData::Allocate(int deopt_entry_count,
7950 MaybeObject* DeoptimizationOutputData::Allocate(int number_of_deopt_points,
10843 // Allocate a new fast elements backing store.
13573 // Otherwise allocate a new internalized string.
13601 MaybeObject* HashTable<Shape, Key>::Allocate(Heap* heap,
13717 Allocate(GetHeap(),
13736 // Allocate a new dictionary with room for at least the current
13749 Allocate(GetHeap(),
13795 Allocate(Heap* heap, int at_least_space_for, PretenureFlag pretenure);
13798 Allocate(Heap* heap, int at_least_space_for, PretenureFlag pretenure);
13801 Allocate(Heap* heap, int n, PretenureFlag pretenure);
13898 // Allocate space for result before we start mutating the object.
13908 SeededNumberDictionary::Allocate(GetHeap(), dict->NumberOfElements());
13934 // does not cause GC. This is the case because we made sure to allocate
14046 // Pessimistically allocate space for return value before
14744 MaybeObject* Dictionary<Shape, Key>::Allocate(Heap* heap,
14749 HashTable<Shape, Key>::Allocate(
14774 // Allocate and initialize iteration order array.
14784 // Allocate array with enumeration order.
15209 // Allocate new map.
15226 // Allocate the instance descriptor.
15229 DescriptorArray::Allocate(instance_descriptor_length);
15244 // Allocate the fixed array for the fields.
15569 // Allocate new BreakPointInfo object and set the break point.
