225           NodeProperties::GetValueInput(current_node(), i));  in ValueInput()
229           NodeProperties::GetContextInput(current_node()));  in ContextInput()
338         if (NodeProperties::IsEffectEdge(edge)) {  in ReduceFrom()
391             states_->table_.Get(NodeProperties::GetEffectInput(node, 0));  in Scope()
417   Node* control = NodeProperties::GetControlInput(effect_phi, 0);  in MergeInputs()
422   State first_input = table_.Get(NodeProperties::GetEffectInput(effect_phi, 0));  in MergeInputs()
436             table_.Get(NodeProperties::GetEffectInput(effect_phi, i)).Get(var);  in MergeInputs()
456           NodeProperties::GetControlInput(old_value, 0) == control) {  in MergeInputs()
461           Node* old_input = NodeProperties::GetValueInput(old_value, i);  in MergeInputs()
464             NodeProperties::ReplaceValueInput(old_value, new_input, i);  in MergeInputs()
494             NodeProperties::SetType(phi, Type::Any());  in MergeInputs()
536   Type index_type = NodeProperties::GetType(index_node);  in OffsetOfElementsAccess()
554     NodeProperties::SetType(map_node, Type::Internal());  in LowerCompareMapsWithoutLoad()
557     NodeProperties::SetType(comparison, Type::Boolean());  in LowerCompareMapsWithoutLoad()
564       NodeProperties::SetType(replacement, Type::Boolean());  in LowerCompareMapsWithoutLoad()
662              NodeProperties::GetType(value).Is(access.type))) {  in ReduceNode()
672                     NodeProperties::GetType(value0).Is(access.type)) &&  in ReduceNode()
676                     NodeProperties::GetType(value1).Is(access.type))) {  in ReduceNode()
687             NodeProperties::SetType(check, Type::Boolean());  in ReduceNode()
691             NodeProperties::SetType(select, access.type);  in ReduceNode()
732       if (replacement && !NodeProperties::GetType(left).IsNone() &&  in ReduceNode()
733           !NodeProperties::GetType(right).IsNone()) {  in ReduceNode()
751           Type const map_type = NodeProperties::GetType(map);  in ReduceNode()