Home
last modified time | relevance | path

Searched refs:out_insertion_index (Results 1 – 5 of 5) sorted by relevance

/external/v8/src/
Dtransitions.h263 int* out_insertion_index = nullptr) {
264 return SearchName(name, out_insertion_index);
301 int* out_insertion_index = nullptr);
305 inline int SearchSpecial(Symbol* symbol, int* out_insertion_index = nullptr) {
306 return SearchName(symbol, out_insertion_index);
309 inline int SearchName(Name* name, int* out_insertion_index = nullptr);
311 PropertyAttributes attributes, int* out_insertion_index);
Dtransitions.cc561 int* out_insertion_index) { in SearchDetails() argument
579 if (out_insertion_index != nullptr) *out_insertion_index = transition; in SearchDetails()
585 int* out_insertion_index) { in Search() argument
586 int transition = SearchName(name, out_insertion_index); in Search()
588 return SearchDetails(transition, kind, attributes, out_insertion_index); in Search()
Dtransitions-inl.h148 int TransitionArray::SearchName(Name* name, int* out_insertion_index) { in SearchName() argument
151 out_insertion_index); in SearchName()
Dobjects-inl.h1716 int* out_insertion_index) { in BinarySearch() argument
1717 DCHECK(search_mode == ALL_ENTRIES || out_insertion_index == nullptr); in BinarySearch()
1742 if (search_mode == ALL_ENTRIES && out_insertion_index != nullptr) { in BinarySearch()
1743 *out_insertion_index = sort_index + (current_hash > hash ? 0 : 1); in BinarySearch()
1755 if (search_mode == ALL_ENTRIES && out_insertion_index != nullptr) { in BinarySearch()
1756 *out_insertion_index = limit + 1; in BinarySearch()
1766 int* out_insertion_index) { in LinearSearch() argument
1767 if (search_mode == ALL_ENTRIES && out_insertion_index != nullptr) { in LinearSearch()
1775 *out_insertion_index = sorted_index; in LinearSearch()
1780 *out_insertion_index = len; in LinearSearch()
[all …]
/external/v8/src/objects/
Dfixed-array.h460 int* out_insertion_index = nullptr);