Lines Matching defs:node
43 * For each child iidesc_t node, we first try to map its tdesc_t subgraph
44 * against the tdesc_t graph in the parent. For each node in the child subgraph
47 * parent nodes, a mapping is established between the child node ID and a
48 * newly-allocated ID that the node will use when it is re-created in the
62 * forward declaration in the parent. If we find such a node, we record an
73 * node, conjuring requires two steps - the copying of the common tdesc_t data
74 * (name, type, etc) from the child node, and the creation of links from the
75 * newly-created node to the parent equivalents of other tdesc_t nodes pointed
76 * to by node being conjured. Note that in some cases, the targets of these
90 * pointers correctly. We create each node, and attach the pointers to the
93 * 4. Resolving newly-created tdesc_t node links (the md_tdtbr list)
108 * edges to the forward declaration node to the actual definition.
367 * has already been established for a given child node, we can simply
368 * compare the mapping for the child node with the ID of the parent
369 * node. If we are in self-uniquify mode, then we're comparing two
400 * in lockstep. If a given node is equivalent in both the parent and the child,
402 * increasing number. If, in the course of the traversal, we reach a node that
459 /* We found an equivalent node */
474 * We didn't find an equivalent node by looking through the
516 * We didn't find an equivalent node using the quick way (going
599 * Check to see if this iidesc_t (node) - the current one on the list we're
606 iidesc_t *node = data;
610 if (node->ii_type != iif->iif_template->ii_type ||
611 !streq(node->ii_name, iif->iif_template->ii_name) ||
612 node->ii_dtype->t_id != iif->iif_newidx)
615 if ((node->ii_type == II_SVAR || node->ii_type == II_SFUN) &&
616 !streq(node->ii_owner, iif->iif_template->ii_owner))
619 if (node->ii_nargs != iif->iif_template->ii_nargs)
622 for (i = 0; i < node->ii_nargs; i++) {
625 node->ii_args[i]->t_id)