contrib/gcc/genrecog.c

70   struct decision *first;
505   last->first = last->last = new;
889    in the calling function, for the first node).
946 	      last->first = last->last = NULL;
1088   /* Do tests against the current node first.  */
1364       if (d1->success.first == 0)
1366       for (p1 = d1->success.first; p1; p1 = p1->next)
1384   if (toplevel || d1->success.first == 0 || d2->success.first == 0)
1387   for (p1 = d1->success.first; p1; p1 = p1->next)
1388     for (p2 = d2->success.first; p2; p2 = p2->next)
1468   if (d1->success.first
1469       && d2->success.first
1470       && strcmp (d1->success.first->position, d2->success.first->position))
1532   if (addh->first == 0)
1534   if (oldh->first == 0)
1541   gcc_assert (!strcmp (oldh->first->position, addh->first->position));
1543   for (add = addh->first; add ; add = next)
1551 	 matches two patterns, the first one will be used.  However,
1579 	     are also ordered within the list, examining the first is
1597 	    oldh->first = add;
1614   struct decision *first, *next;
1616   for (first = head->first; first && first->next; first = next)
1621       type = first->tests->type;
1622       next = first->next;
1639          below our first test.  */
1640       if (first->tests->next != NULL)
1642 	  new = new_decision (first->position, &first->success);
1643 	  new->tests = first->tests->next;
1644 	  first->tests->next = NULL;
1647       /* Crop the node tree off after our first test.  */
1648       first->next = NULL;
1650       head->last = first;
1667 	  h.first = h.last = new;
1684   for (first = head->first; first; first = first->next)
1685     factor_tests (&first->success);
1701   for (tree = head->first; tree; tree = tree->next)
1717 	     generated from the predicate in the first place.  */
1725   for (tree = head->first; tree; tree = tree->next)
1730    make the first node in HEAD start a separate subroutine in the C code
1739   for (sub = head->first; sub; sub = sub->next)
1744       head->first->subroutine_number = ++next_subroutine_number;
1761   p = head->first;
1781   for (p = head->first; p ; p = p->next)
1782     if (p->success.first)
1786      position in the first node where write_tree can find it, and we
1788   p = head->first;
1824       /* It's a different insn from the first one.  */
1883    nodes at START.  Return the first node yet untested.  */
1921 	  printf (":\n      goto L%d;\n", p->success.first->number);
1922 	  p->success.first->need_label = 1;
2060 	  printf (":\n%s      goto L%d;\n", indent, p->success.first->number);
2061 	  p->success.first->need_label = 1;
2315   write_action (p, last_test, depth, uncond, p->success.first, subroutine_type);
2329   for (p = head->first; p ; p = next)
2331       /* The label for the first element was printed in write_tree.  */
2332       if (p != head->first && p->need_label)
2360   struct decision *p = head->first;
2404       for (p = head->first; p; p = p->next)
2405         if (p->success.first)
2416   int subfunction = head->first ? head->first->subroutine_number : 0;
2457   if (head->first)
2473   for (p = head->first; p ; p = p->next)
2474     if (p->success.first)
2477   if (head->first->subroutine_number > 0)
2716   if (head->first == NULL)
2921   for (n = d->success.first; n ; n = n->next)