1107   TNode<IntPtrT> number_of_elements =  in NextSkipHoles()  local
1112       IntPtrAdd(number_of_elements, number_of_deleted_elements);  in NextSkipHoles()
1254     Node* const number_of_elements = SmiUntag(  in TF_BUILTIN()  local
1258     occupancy.Bind(IntPtrAdd(number_of_elements, number_of_deleted));  in TF_BUILTIN()
1308   TNode<Smi> const number_of_elements =  in StoreOrderedHashMapNewEntry()  local
1311                                  SmiAdd(number_of_elements, SmiConstant(1)));  in StoreOrderedHashMapNewEntry()
1347   TNode<Smi> const number_of_elements = SmiSub(  in TF_BUILTIN()  local
1351                                  number_of_elements);  in TF_BUILTIN()
1364   GotoIf(SmiLessThan(SmiAdd(number_of_elements, number_of_elements),  in TF_BUILTIN()
1422     Node* const number_of_elements = SmiUntag(  in TF_BUILTIN()  local
1426     occupancy.Bind(IntPtrAdd(number_of_elements, number_of_deleted));  in TF_BUILTIN()
1473   TNode<Smi> const number_of_elements =  in StoreOrderedHashSetNewEntry()  local
1476                                  SmiAdd(number_of_elements, SmiConstant(1)));  in StoreOrderedHashSetNewEntry()
1508   TNode<Smi> const number_of_elements = SmiSub(  in TF_BUILTIN()  local
1512                                  number_of_elements);  in TF_BUILTIN()
1525   GotoIf(SmiLessThan(SmiAdd(number_of_elements, number_of_elements),  in TF_BUILTIN()
1987                 TNode<IntPtrT> number_of_elements);
2020                                            TNode<IntPtrT> number_of_elements,
2032                    TNode<IntPtrT> number_of_elements);
2033   TNode<BoolT> ShouldRehash(TNode<IntPtrT> number_of_elements,
2036                               TNode<IntPtrT> number_of_elements);
2042     TNode<Object> key, TNode<Object> value, TNode<IntPtrT> number_of_elements) {  in AddEntry()  argument
2050                          SmiFromIntPtr(number_of_elements), SKIP_WRITE_BARRIER);  in AddEntry()
2166   TNode<IntPtrT> number_of_elements = SmiUntag(CAST(LoadFixedArrayElement(  in LoadNumberOfElements()  local
2168   return IntPtrAdd(number_of_elements, IntPtrConstant(offset));  in LoadNumberOfElements()
2190     TNode<IntPtrT> capacity, TNode<IntPtrT> number_of_elements,  in InsufficientCapacityToAdd()  argument
2196   TNode<IntPtrT> available = IntPtrSub(capacity, number_of_elements);  in InsufficientCapacityToAdd()
2198   TNode<IntPtrT> needed_available = WordShr(number_of_elements, 1);  in InsufficientCapacityToAdd()
2203       IntPtrGreaterThan(IntPtrAdd(number_of_elements, needed_available),  in InsufficientCapacityToAdd()
2209     TNode<IntPtrT> number_of_elements) {  in RemoveEntry()  argument
2218                          SmiFromIntPtr(number_of_elements), SKIP_WRITE_BARRIER);  in RemoveEntry()
2225     TNode<IntPtrT> number_of_elements, TNode<IntPtrT> number_of_deleted) {  in ShouldRehash()  argument
2228                                   number_of_elements);  in ShouldRehash()
2232     TNode<IntPtrT> capacity, TNode<IntPtrT> number_of_elements) {  in ShouldShrink()  argument
2238       IntPtrLessThanOrEqual(number_of_elements, quarter_capacity),  in ShouldShrink()
2244       IntPtrGreaterThanOrEqual(number_of_elements, IntPtrConstant(16)));  in ShouldShrink()
2352   TNode<IntPtrT> number_of_elements = LoadNumberOfElements(table, -1);  in TF_BUILTIN()  local
2353   GotoIf(ShouldShrink(capacity, number_of_elements), &call_runtime);  in TF_BUILTIN()
2355   RemoveEntry(table, key_index, number_of_elements);  in TF_BUILTIN()
2397     TNode<IntPtrT> number_of_elements = LoadNumberOfElements(table, 1);  in TF_BUILTIN()  local
2400     GotoIf(Word32Or(ShouldRehash(number_of_elements, number_of_deleted),  in TF_BUILTIN()
2401                     InsufficientCapacityToAdd(capacity, number_of_elements,  in TF_BUILTIN()
2407     AddEntry(table, insertion_key_index, key, value, number_of_elements);  in TF_BUILTIN()