Lines Matching refs:iidesc_t
34 * tdata_t structures contain two main elements - a hash of iidesc_t nodes, and
35 * a directed graph of tdesc_t nodes, pointed to by the iidesc_t nodes. Simply
36 * put, we merge the tdesc_t graphs, followed by the iidesc_t nodes, and then we
41 * 1. Mapping iidesc_t nodes
43 * For each child iidesc_t node, we first try to map its tdesc_t subgraph
52 * If all of the nodes in the subgraph for an iidesc_t in the child can be
54 * iidesc_t onto an iidesc_t in the parent. If we cannot find an equivalent
55 * iidesc_t, or if we were not able to completely map the tdesc_t subgraph(s),
56 * then we add this iidesc_t to the md_iitba (iidesc_t To Be Added) list. This
57 * list tracks iidesc_t nodes that are to be created in the parent.
84 * 3. Creating new iidesc_t nodes (the md_iitba list)
89 * create all of the iidesc_t nodes, as we can attach the tdesc_t subgraph
150 list_t **md_iitba; /* iidesc_t nodes To Be Added to the parent */
581 * Determining equivalence of iidesc_t nodes
585 iidesc_t *iif_template;
592 * Check to see if this iidesc_t (node) - the current one on the list we're
599 iidesc_t *node = data;
648 iidesc_t *sii = data;
847 static iidesc_t *
848 conjure_iidesc(iidesc_t *old, merge_cb_data_t *mcd)
850 iidesc_t *new = iidesc_dup(old);
945 iidesc_t *tba = data;
946 iidesc_t *new;
962 debug(3, "iidesc_t %s already exists\n",