Searched refs:nof (Results 1 - 5 of 5) sorted by relevance
| /arkcompiler/ets_runtime/ecmascript/ |
| H A D | linked_hash_table.h | 76 int nof = numberOfElements + numOfAddElements; in HasSufficientCapacity() local
80 if ((nof < capacity) && ((numOfDelElements <= (capacity - nof) / 2))) { // 2: half in HasSufficientCapacity()
81 int neededFree = nof / 2; // 2: half in HasSufficientCapacity()
82 if (nof + neededFree <= capacity) { in HasSufficientCapacity()
181 inline void SetNumberOfElements(const JSThread *thread, int nof) in SetNumberOfElements() argument
183 Set(thread, NUMBER_OF_ELEMENTS_INDEX, JSTaggedValue(nof)); in SetNumberOfElements()
|
| H A D | tagged_list.h | 107 inline void SetNumberOfNodes(const JSThread *thread, int nof) in SetNumberOfNodes() argument
109 Set(thread, NUMBER_OF_NODE_INDEX, JSTaggedValue(nof)); in SetNumberOfNodes()
|
| H A D | tagged_hash_table.h | 359 inline void SetEntriesCount(const JSThread *thread, int nof) in SetEntriesCount() argument
361 Set(thread, NUMBER_OF_ENTRIES_INDEX, JSTaggedValue(nof)); in SetEntriesCount()
|
| H A D | tagged_tree.cpp | 467 uint32_t nof = tree->NumberOfElements() + tree->NumberOfDeletedElements(); in GrowCapacity() local
469 if (static_cast<int>(nof + 1) <= oldCapacity) { in GrowCapacity()
|
| /arkcompiler/ets_runtime/ecmascript/compiler/builtins/ |
| H A D | linked_hashtable_stub_builder.cpp | 204 GateRef nof = Int32Add(numberOfElements, numOfAddElements); in HasSufficientCapacity() local
207 .And(Int32LessThan(nof, capacity)) in HasSufficientCapacity()
208 .And(Int32LessThanOrEqual(numOfDelElements, Int32Div(Int32Sub(capacity, nof), Int32(2)))) in HasSufficientCapacity()
215 BRANCH(Int32LessThanOrEqual(Int32Add(nof, Int32Div(nof, Int32(2))), capacity), &need, &exit); // 2: half in HasSufficientCapacity()
|
Completed in 6 milliseconds