Lines Matching refs:node
24 if (node_key1->node == nullptr) {
25 if (node_key2->node == nullptr) {
30 node_key2->node);
33 if (node_key2->node == nullptr) {
36 node_key1->node);
38 return node_key1->node == node_key2->node;
46 bool StateValuesCache::IsKeysEqualToNode(StateValuesKey* key, Node* node) {
47 if (key->count != static_cast<size_t>(node->InputCount())) {
51 if (key->values[i] != node->InputAt(static_cast<int>(i))) {
74 Node* StateValuesCache::GetEmptyStateValues() {
93 int StateValuesHashKey(Node** nodes, size_t count) {
104 Node* StateValuesCache::GetValuesNodeFromCache(Node** nodes, size_t count) {
110 Node* node;
113 node = graph()->NewNode(common()->StateValues(input_count), input_count,
115 NodeKey* new_key = new (zone()->New(sizeof(NodeKey))) NodeKey(node);
117 lookup->value = node;
119 node = reinterpret_cast<Node*>(lookup->value);
121 return node;
127 ValueArrayIterator(Node** values, size_t count)
138 Node* node() {
144 Node** values_;
150 Node* StateValuesCache::BuildTree(ValueArrayIterator* it, size_t max_height) {
152 Node* node = it->node();
154 return node;
172 Node* StateValuesCache::GetNodeForValues(Node** values, size_t count) {
191 Node* tree = BuildTree(&it, height);
193 // If the 'tree' is a single node, equip it with a StateValues wrapper.
203 StateValuesAccess::iterator::iterator(Node* node) : current_depth_(0) {
204 // A hacky way initialize - just set the index before the node we want
206 stack_[current_depth_].node = node;
219 void StateValuesAccess::iterator::Push(Node* node) {
222 stack_[current_depth_].node = node;
240 // Fix up the position to point to a valid node.
243 Node* node = Top()->node;
246 if (index >= node->InputCount()) {
254 } else if (node->InputAt(index)->opcode() == IrOpcode::kStateValues ||
255 node->InputAt(index)->opcode() == IrOpcode::kTypedStateValues) {
257 Push(node->InputAt(index));
259 // We are on a valid node, we can stop the iteration.
266 Node* StateValuesAccess::iterator::node() {
267 return Top()->node->InputAt(Top()->index);
272 Node* state = Top()->node;
298 return TypedNode(node(), type());
