Lines Matching defs:node
40 // Parse an S-expression S and build a tree and return the root node.
58 // Remember the node stack position for start of a new internal node.
63 // children to build a new internal node. Push internal node back.
67 Tree_node* node =
71 node_stack.push_back(node);
74 // Just push a leaf node to node_stack.
83 // contain the root node.
165 Tree_node* node = root_node;
168 if (!node->is_leaf()
169 && node->child(0)->is_leaf()
170 && node->child(0)->name() == "-")
190 const std::string rhs(node->child(2)->s_expression());
201 node = node->child(1);
205 if (!node->is_leaf()
206 && node->child(0)->is_leaf()
207 && node->child(0)->name() == "|")
209 gold_assert(node->number_of_children() == 3
210 && node->child(2)->is_leaf()
211 && node->child(2)->name() == "T");
213 node = node->child(1);
217 if (!node->is_leaf()
218 && node->child(0)->is_leaf()
219 && node->child(0)->name() == "+")
221 gold_assert(node->number_of_children() == 3
222 && node->child(2)->is_leaf()
223 && node->child(2)->name() == "A");
225 node = node->child(1);
229 if (!node->is_leaf() && node->child(0)->is_leaf())
231 gold_assert(node->number_of_children() == 2
232 && node->child(1)->is_leaf()
233 && node->child(1)->name() == "S");
234 const std::string func(node->child(0)->name());
246 node = node->child(1);
249 gold_assert(node->is_leaf() && node->name() == "S");
