gcc/gcc/genattrtab.c

41    set all lengths that do not depend on address.  Those that do are set to
59    all derived quantities.
79    A way to do this is to iterate over all possible combinations of values
132    encountered, we store all the relevant information into a
305    files: all "*insn_default_latency" functions go to LATENCY_FILE_NAME,
306    all "*internal_dfa_insn_code" functions go to DFA_FILE_NAME, and the
335    and for strings.  While all these live in the same table, they are
652    descending to all depths, but not copying any
900 /* Given an expression, ensure that it is validly formed and that all named
1072   /* Make a COND with all tests but the last.  Select the last value via the
1122 /* Scan all definitions, checking for validity.  Also, convert any SET_ATTR
1287    value (-2 if not processing an insn).  We ensure that all insns for
1323 /* After all DEFINE_DELAYs have been read in, create internal attributes
1421 /* Once all attributes and insns have been read and checked, we construct for
1422    each attribute value a list of all the insns that have that value for
1727   /* This lets us free all storage allocated below, if appropriate.  */
1873    If the `term' is itself a tree, all its leaves will be inserted.  */
1931    terms, we may have covered all or all but one of the possible alternatives.
2058       /* We construct an IOR of all the cases for which the
2563       /* See if all or all but one of the insn's alternatives are specified
2591 	  /* If all alternatives are excluded, this is false.  */
2683       /* See if all or all but one of the insn's alternatives are specified
2703 	  /* If all alternatives are included, this is true.  */
2877 /* Calculate a topological sorting of all attributes so that
2878    all attributes only depend on attributes in front of it.
2888   struct attr_desc **all, **sorted;
2893   all = XNEWVEC (struct attr_desc *, num);
2899       all[num++] = attr;
2903     if (all[i]->is_const)
2904       handled[i] = 1, sorted[j++] = all[i];
2920 		  for (av = all[i]->first_value; av; av = av->next)
2922 		      if (tests_attr_p (av->value, all[k]))
2934 		sorted[j++] = all[i];
2960   free (all);
2982   /* For each insn code, make a list of all the insn_ent's for it,
2983      for all values for all attributes.  */
3203    alternatives in the constraints.  Assume all MATCH_OPERANDs have the same
3891 /* Given an attribute value, return the result of ORing together all
4018   /* Write out start of function, then all values with explicit `case' lines,
4809 /* Find and mark all of the bypassed insns.  */
4855    in all define_insn_reservation conditions.  */
4893 /* Create all of the attributes that describe automaton properties.
4919       /* Write the prototypes for all DFA functions.  */
4931       /* Write the prototypes for all latency functions.  */
4943       /* Write the prototypes for all automaton functions.  */
5305   /* Now write out all the `gen_attr_...' routines.  Do these before the