Home | History | Annotate | Download | only in gcc

Lines Matching defs:son

646       if (n->son)
647 	n = n->son;
650 	  while (!n->right || n->right == n->father->son)
897   struct et_node *node = bb->dom[dir_index], *son = node->son, *ason;
902   if (!son)
905   bbs.safe_push ((basic_block) son->data);
906   for (ason = son->right; ason != son; ason = ason->right)
956       basic_block son;
959       for (son = first_dom_son (dir, bb);
960 	   son;
961 	   son = next_dom_son (dir, son))
962 	bbs.safe_push (son);
987   struct et_node *bb_node, *to_node, *son;
994   if (!bb_node->son)
997   while (bb_node->son)
999       son = bb_node->son;
1001       et_split (son);
1002       et_set_father (son, to_node);
1303    for the sons of Y, found using the SON and BROTHER arrays representing
1309 			       int y, int *son, int *brother)
1319   if (son[y] == -1)
1326   if (brother[son[y]] == -1)
1328       /* Handle the common case Y has just one son specially.  */
1329       bb = bbs[son[y]];
1332       identify_vertices (g, y, son[y]);
1337   for (a = son[y]; a != -1; a = brother[a])
1347   for (a = son[y]; a != -1; a = brother[a])
1377   for (a = son[y]; a != -1; a = brother[a])
1399   int *parent, *son, *brother;
1522   son = XNEWVEC (int, n + 1);
1525   graphds_domtree (g, n, parent, son, brother);
1528   for (y = n; son[y] != -1; y = son[y])
1532       determine_dominators_for_sons (g, bbs, y, son, brother);
1537 	  while (son[y] != -1)
1538 	    y = son[y];
1544   free (son);
1583 /* Returns the first son of BB in the dominator or postdominator tree
1590   struct et_node *son = bb->dom[dir_index]->son;
1592   return (basic_block) (son ? son->data : NULL);
1595 /* Returns the next dominance son after BB in the dominator or postdominator
1604   return (basic_block) (next->father->son == next ? NULL : next->data);
1666   basic_block son;
1675   for (son = first_dom_son (dir, root);
1676        son;
1677        son = next_dom_son (dir, son))
1679       debug_dominance_tree_1 (dir, son, indent + 1, !first);