Home
last modified time | relevance | path

Searched refs:nof (Results 1 – 8 of 8) sorted by relevance

/external/v8/src/
Dhandles.cc157 void SetExpectedNofProperties(Handle<JSFunction> func, int nof) { in SetExpectedNofProperties() argument
165 func->shared()->set_expected_nof_properties(nof); in SetExpectedNofProperties()
170 new_initial_map->set_unused_property_fields(nof); in SetExpectedNofProperties()
Dhandles.h260 void SetExpectedNofProperties(Handle<JSFunction> func, int nof);
Dobjects-inl.h1891 int nof = number_of_descriptors(); in Search() local
1892 if (nof == 0) return kNotFound; in Search()
1896 if (StringShape(name).IsSymbol() && nof < kMaxElementsForLinearSearch) { in Search()
1897 return LinearSearch(name, nof); in Search()
1901 return BinarySearch(name, 0, nof - 1); in Search()
Dobjects.cc10989 int nof = NumberOfElements() + n; in EnsureCapacity() local
10994 if (nod <= (capacity - nof) >> 1) { in EnsureCapacity()
10995 int needed_free = nof >> 1; in EnsureCapacity()
10996 if (nof + needed_free <= capacity) return this; in EnsureCapacity()
11004 Allocate(nof * 2, pretenure ? TENURED : NOT_TENURED); in EnsureCapacity()
11015 int nof = NumberOfElements(); in Shrink() local
11019 if (nof > (capacity >> 2)) return this; in Shrink()
11024 int at_least_room_for = nof; in Shrink()
Dobjects.h2819 void SetNumberOfElements(int nof) { in SetNumberOfElements() argument
2820 set(kNumberOfElementsIndex, Smi::FromInt(nof)); in SetNumberOfElements()
Dhydrogen.cc3709 int nof = boilerplate->map()->inobject_properties(); in IsFastLiteral() local
3710 for (int i = 0; i < nof; i++) { in IsFastLiteral()
Druntime.cc164 int nof = copy->map()->inobject_properties(); in DeepCopyBoilerplate() local
165 for (int i = 0; i < nof; i++) { in DeepCopyBoilerplate()
/external/v8/test/cctest/
Dtest-api.cc10826 const int nof = 2; in THREADED_TEST() local
10827 const char* sources[nof] = { in THREADED_TEST()
10832 for (int i = 0; i < nof; i++) { in THREADED_TEST()