1 /* Generate code from machine description to compute values of attributes.
2 Copyright (C) 1991 Free Software Foundation, Inc.
3 Contributed by Richard Kenner (kenner@nyu.edu)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* This program handles insn attributes and the DEFINE_DELAY and
22 DEFINE_FUNCTION_UNIT definitions.
24 It produces a series of functions named `get_attr_...', one for each insn
25 attribute. Each of these is given the rtx for an insn and returns a member
26 of the enum for the attribute.
28 These subroutines have the form of a `switch' on the INSN_CODE (via
29 `recog_memoized'). Each case either returns a constant attribute value
30 or a value that depends on tests on other attributes, the form of
31 operands, or some random C expression (encoded with a SYMBOL_REF
34 If the attribute `alternative', or a random C expression is present,
35 `constrain_operands' is called. If either of these cases of a reference to
36 an operand is found, `insn_extract' is called.
38 The special attribute `length' is also recognized. For this operand,
39 expressions involving the address of an operand or the current insn,
40 (address (pc)), are valid. In this case, an initial pass is made to
41 set all lengths that do not depend on address. Those that do are set to
42 the maximum length. Then each insn that depends on an address is checked
43 and possibly has its length changed. The process repeats until no further
44 changed are made. The resulting lengths are saved for use by
47 A special form of DEFINE_ATTR, where the expression for default value is a
48 CONST expression, indicates an attribute that is constant for a given run
49 of the compiler. The subroutine generated for these attributes has no
50 parameters as it does not depend on any particular insn. Constant
51 attributes are typically used to specify which variety of processor is
54 Internal attributes are defined to handle DEFINE_DELAY and
55 DEFINE_FUNCTION_UNIT. Special routines are output for these cases.
57 This program works by keeping a list of possible values for each attribute.
58 These include the basic attribute choices, default values for attribute, and
59 all derived quantities.
61 As the description file is read, the definition for each insn is saved in a
62 `struct insn_def'. When the file reading is complete, a `struct insn_ent'
63 is created for each insn and chained to the corresponding attribute value,
64 either that specified, or the default.
66 An optimization phase is then run. This simplifies expressions for each
67 insn. EQ_ATTR tests are resolved, whenever possible, to a test that
68 indicates when the attribute has the specified value for the insn. This
69 avoids recursive calls during compilation.
71 The strategy used when processing DEFINE_DELAY and DEFINE_FUNCTION_UNIT
72 definitions is to create arbitrarily complex expressions and have the
73 optimization simplify them.
75 Once optimization is complete, any required routines and definitions
78 An optimization that is not yet implemented is to hoist the constant
79 expressions entirely out of the routines and definitions that are written.
80 A way to do this is to iterate over all possible combinations of values
81 for constant attributes and generate a set of functions for that given
82 combination. An initialization function would be written that evaluates
83 the attributes and installs the corresponding set of routines and
84 definitions (each would be accessed through a pointer).
86 We use the flags in an RTX as follows:
87 `unchanging' (RTX_UNCHANGING_P): This rtx is fully simplified
88 independent of the insn code.
89 `in_struct' (MEM_IN_STRUCT_P): This rtx is fully simplified
90 for the insn code currently being processed (see optimize_attrs).
91 `integrated' (RTX_INTEGRATED_P): This rtx is permanent and unique
93 `volatil' (MEM_VOLATILE_P): During simplify_by_exploding the value of an
94 EQ_ATTR rtx is true if !volatil and false if volatil. */
100 #include "insn-config.h" /* For REGISTER_CONSTRAINTS */
105 #include <sys/time.h>
106 #include <sys/resource.h>
110 /* We must include obstack.h after <sys/time.h>, to avoid lossage with
111 /usr/include/sys/stdtypes.h on Sun OS 4.x. */
114 static struct obstack obstack, obstack1, obstack2;
115 struct obstack *rtl_obstack = &obstack;
116 struct obstack *hash_obstack = &obstack1;
117 struct obstack *temp_obstack = &obstack2;
119 #define obstack_chunk_alloc xmalloc
120 #define obstack_chunk_free free
122 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
123 char **insn_name_ptr = 0;
126 extern rtx read_rtx ();
128 static void fatal ();
131 /* enough space to reserve for printing out ints */
132 #define MAX_DIGITS (HOST_BITS_PER_INT * 3 / 10 + 3)
134 /* Define structures used to record attributes and values. */
136 /* As each DEFINE_INSN, DEFINE_PEEPHOLE, or DEFINE_ASM_ATTRIBUTES is
137 encountered, we store all the relevant information into a
138 `struct insn_def'. This is done to allow attribute definitions to occur
139 anywhere in the file. */
143 int insn_code; /* Instruction number. */
144 int insn_index; /* Expression numer in file, for errors. */
145 struct insn_def *next; /* Next insn in chain. */
146 rtx def; /* The DEFINE_... */
147 int num_alternatives; /* Number of alternatives. */
148 int vec_idx; /* Index of attribute vector in `def'. */
151 /* Once everything has been read in, we store in each attribute value a list
152 of insn codes that have that value. Here is the structure used for the
157 int insn_code; /* Instruction number. */
158 int insn_index; /* Index of definition in file */
159 struct insn_ent *next; /* Next in chain. */
162 /* Each value of an attribute (either constant or computed) is assigned a
163 structure which is used as the listhead of the insns that have that
168 rtx value; /* Value of attribute. */
169 struct attr_value *next; /* Next attribute value in chain. */
170 struct insn_ent *first_insn; /* First insn with this value. */
171 int num_insns; /* Number of insns with this value. */
172 int has_asm_insn; /* True if this value used for `asm' insns */
175 /* Structure for each attribute. */
179 char *name; /* Name of attribute. */
180 struct attr_desc *next; /* Next attribute. */
181 int is_numeric; /* Values of this attribute are numeric. */
182 int negative_ok; /* Allow negative numeric values. */
183 int unsigned_p; /* Make the output function unsigned int. */
184 int is_const; /* Attribute value constant for each run. */
185 int is_special; /* Don't call `write_attr_set'. */
186 struct attr_value *first_value; /* First value of this attribute. */
187 struct attr_value *default_val; /* Default value for this attribute. */
190 #define NULL_ATTR (struct attr_desc *) NULL
192 /* A range of values. */
200 /* Structure for each DEFINE_DELAY. */
204 rtx def; /* DEFINE_DELAY expression. */
205 struct delay_desc *next; /* Next DEFINE_DELAY. */
206 int num; /* Number of DEFINE_DELAY, starting at 1. */
209 /* Record information about each DEFINE_FUNCTION_UNIT. */
211 struct function_unit_op
213 rtx condexp; /* Expression TRUE for applicable insn. */
214 struct function_unit_op *next; /* Next operation for this function unit. */
215 int num; /* Ordinal for this operation type in unit. */
216 int ready; /* Cost until data is ready. */
217 int issue_delay; /* Cost until unit can accept another insn. */
218 rtx conflict_exp; /* Expression TRUE for insns incurring issue delay. */
219 rtx issue_exp; /* Expression computing issue delay. */
222 /* Record information about each function unit mentioned in a
223 DEFINE_FUNCTION_UNIT. */
227 char *name; /* Function unit name. */
228 struct function_unit *next; /* Next function unit. */
229 int num; /* Ordinal of this unit type. */
230 int multiplicity; /* Number of units of this type. */
231 int simultaneity; /* Maximum number of simultaneous insns
232 on this function unit or 0 if unlimited. */
233 rtx condexp; /* Expression TRUE for insn needing unit. */
234 int num_opclasses; /* Number of different operation types. */
235 struct function_unit_op *ops; /* Pointer to first operation type. */
236 int needs_conflict_function; /* Nonzero if a conflict function required. */
237 int needs_blockage_function; /* Nonzero if a blockage function required. */
238 int needs_range_function; /* Nonzero if blockage range function needed.*/
239 rtx default_cost; /* Conflict cost, if constant. */
240 struct range issue_delay; /* Range of issue delay values. */
241 int max_blockage; /* Maximum time an insn blocks the unit. */
244 /* Listheads of above structures. */
246 /* This one is indexed by the first character of the attribute name. */
247 #define MAX_ATTRS_INDEX 256
248 static struct attr_desc *attrs[MAX_ATTRS_INDEX];
249 static struct insn_def *defs;
250 static struct delay_desc *delays;
251 static struct function_unit *units;
253 /* An expression where all the unknown terms are EQ_ATTR tests can be
254 rearranged into a COND provided we can enumerate all possible
255 combinations of the unknown values. The set of combinations become the
256 tests of the COND; the value of the expression given that combination is
257 computed and becomes the corresponding value. To do this, we must be
258 able to enumerate all values for each attribute used in the expression
259 (currently, we give up if we find a numeric attribute).
261 If the set of EQ_ATTR tests used in an expression tests the value of N
262 different attributes, the list of all possible combinations can be made
263 by walking the N-dimensional attribute space defined by those
264 attributes. We record each of these as a struct dimension.
266 The algorithm relies on sharing EQ_ATTR nodes: if two nodes in an
267 expression are the same, the will also have the same address. We find
268 all the EQ_ATTR nodes by marking them MEM_VOLATILE_P. This bit later
269 represents the value of an EQ_ATTR node, so once all nodes are marked,
270 they are also given an initial value of FALSE.
272 We then separate the set of EQ_ATTR nodes into dimensions for each
273 attribute and put them on the VALUES list. Terms are added as needed by
274 `add_values_to_cover' so that all possible values of the attribute are
277 Each dimension also has a current value. This is the node that is
278 currently considered to be TRUE. If this is one of the nodes added by
279 `add_values_to_cover', all the EQ_ATTR tests in the original expression
280 will be FALSE. Otherwise, only the CURRENT_VALUE will be true.
282 NUM_VALUES is simply the length of the VALUES list and is there for
285 Once the dimensions are created, the algorithm enumerates all possible
286 values and computes the current value of the given expression. */
290 struct attr_desc *attr; /* Attribute for this dimension. */
291 rtx values; /* List of attribute values used. */
292 rtx current_value; /* Position in the list for the TRUE value. */
293 int num_values; /* Length of the values list. */
296 /* Other variables. */
298 static int insn_code_number;
299 static int insn_index_number;
300 static int got_define_asm_attributes;
301 static int must_extract;
302 static int must_constrain;
303 static int address_used;
304 static int length_used;
305 static int num_delays;
306 static int have_annul_true, have_annul_false;
307 static int num_units;
309 /* Used as operand to `operate_exp': */
311 enum operator {PLUS_OP, MINUS_OP, POS_MINUS_OP, EQ_OP, OR_OP, MAX_OP, MIN_OP, RANGE_OP};
313 /* Stores, for each insn code, the number of constraint alternatives. */
315 static int *insn_n_alternatives;
317 /* Stores, for each insn code, a bitmap that has bits on for each possible
320 static int *insn_alternatives;
322 /* If nonzero, assume that the `alternative' attr has this value.
323 This is the hashed, unique string for the numeral
324 whose value is chosen alternative. */
326 static char *current_alternative_string;
328 /* Used to simplify expressions. */
330 static rtx true_rtx, false_rtx;
332 /* Used to reduce calls to `strcmp' */
334 static char *alternative_name;
336 /* Simplify an expression. Only call the routine if there is something to
338 #define SIMPLIFY_TEST_EXP(EXP,INSN_CODE,INSN_INDEX) \
339 (RTX_UNCHANGING_P (EXP) || MEM_IN_STRUCT_P (EXP) ? (EXP) \
340 : simplify_test_exp (EXP, INSN_CODE, INSN_INDEX))
342 /* Simplify (eq_attr ("alternative") ...)
343 when we are working with a particular alternative. */
344 #define SIMPLIFY_ALTERNATIVE(EXP) \
345 if (current_alternative_string \
346 && GET_CODE ((EXP)) == EQ_ATTR \
347 && XSTR ((EXP), 0) == alternative_name) \
348 (EXP) = (XSTR ((EXP), 1) == current_alternative_string \
349 ? true_rtx : false_rtx);
351 /* These are referenced by rtlanal.c and hence need to be defined somewhere.
352 They won't actually be used. */
354 rtx frame_pointer_rtx, stack_pointer_rtx, arg_pointer_rtx;
357 static rtx attr_rtx PROTO((enum rtx_code, ...));
358 static char *attr_printf PROTO((int, char *, ...));
360 static rtx attr_rtx ();
361 static char *attr_printf ();
364 static char *attr_string PROTO((char *, int));
365 static rtx check_attr_test PROTO((rtx, int));
366 static rtx check_attr_value PROTO((rtx, struct attr_desc *));
367 static rtx convert_set_attr_alternative PROTO((rtx, int, int, int));
368 static rtx convert_set_attr PROTO((rtx, int, int, int));
369 static void check_defs PROTO((void));
370 static rtx convert_const_symbol_ref PROTO((rtx, struct attr_desc *));
371 static rtx make_canonical PROTO((struct attr_desc *, rtx));
372 static struct attr_value *get_attr_value PROTO((rtx, struct attr_desc *, int));
373 static rtx copy_rtx_unchanging PROTO((rtx));
374 static rtx copy_boolean PROTO((rtx));
375 static void expand_delays PROTO((void));
376 static rtx operate_exp PROTO((enum operator, rtx, rtx));
377 static void expand_units PROTO((void));
378 static rtx simplify_knowing PROTO((rtx, rtx));
379 static rtx encode_units_mask PROTO((rtx));
380 static void fill_attr PROTO((struct attr_desc *));
381 static rtx substitute_address PROTO((rtx, rtx (*) (rtx), rtx (*) (rtx)));
382 static void make_length_attrs PROTO((void));
383 static rtx identity_fn PROTO((rtx));
384 static rtx zero_fn PROTO((rtx));
385 static rtx one_fn PROTO((rtx));
386 static rtx max_fn PROTO((rtx));
387 static rtx simplify_cond PROTO((rtx, int, int));
388 static rtx simplify_by_alternatives PROTO((rtx, int, int));
389 static rtx simplify_by_exploding PROTO((rtx));
390 static int find_and_mark_used_attributes PROTO((rtx, rtx *, int *));
391 static void unmark_used_attributes PROTO((rtx, struct dimension *, int));
392 static int add_values_to_cover PROTO((struct dimension *));
393 static int increment_current_value PROTO((struct dimension *, int));
394 static rtx test_for_current_value PROTO((struct dimension *, int));
395 static rtx simplify_with_current_value PROTO((rtx, struct dimension *, int));
396 static rtx simplify_with_current_value_aux PROTO((rtx));
397 static void remove_insn_ent PROTO((struct attr_value *, struct insn_ent *));
398 static void insert_insn_ent PROTO((struct attr_value *, struct insn_ent *));
399 static rtx insert_right_side PROTO((enum rtx_code, rtx, rtx, int, int));
400 static rtx make_alternative_compare PROTO((int));
401 static int compute_alternative_mask PROTO((rtx, enum rtx_code));
402 static rtx evaluate_eq_attr PROTO((rtx, rtx, int, int));
403 static rtx simplify_and_tree PROTO((rtx, rtx *, int, int));
404 static rtx simplify_or_tree PROTO((rtx, rtx *, int, int));
405 static rtx simplify_test_exp PROTO((rtx, int, int));
406 static void optimize_attrs PROTO((void));
407 static void gen_attr PROTO((rtx));
408 static int count_alternatives PROTO((rtx));
409 static int compares_alternatives_p PROTO((rtx));
410 static int contained_in_p PROTO((rtx, rtx));
411 static void gen_insn PROTO((rtx));
412 static void gen_delay PROTO((rtx));
413 static void gen_unit PROTO((rtx));
414 static void write_test_expr PROTO((rtx, int));
415 static int max_attr_value PROTO((rtx));
416 static void walk_attr_value PROTO((rtx));
417 static void write_attr_get PROTO((struct attr_desc *));
418 static rtx eliminate_known_true PROTO((rtx, rtx, int, int));
419 static void write_attr_set PROTO((struct attr_desc *, int, rtx, char *,
420 char *, rtx, int, int));
421 static void write_attr_case PROTO((struct attr_desc *, struct attr_value *,
422 int, char *, char *, int, rtx));
423 static void write_attr_valueq PROTO((struct attr_desc *, char *));
424 static void write_attr_value PROTO((struct attr_desc *, rtx));
425 static void write_upcase PROTO((char *));
426 static void write_indent PROTO((int));
427 static void write_eligible_delay PROTO((char *));
428 static void write_function_unit_info PROTO((void));
429 static void write_complex_function PROTO((struct function_unit *, char *,
431 static int n_comma_elts PROTO((char *));
432 static char *next_comma_elt PROTO((char **));
433 static struct attr_desc *find_attr PROTO((char *, int));
434 static void make_internal_attr PROTO((char *, rtx, int));
435 static struct attr_value *find_most_used PROTO((struct attr_desc *));
436 static rtx find_single_value PROTO((struct attr_desc *));
437 static rtx make_numeric_value PROTO((int));
438 static void extend_range PROTO((struct range *, int, int));
439 char *xrealloc PROTO((char *, unsigned));
440 char *xmalloc PROTO((unsigned));
442 #define oballoc(size) obstack_alloc (hash_obstack, size)
445 /* Hash table for sharing RTL and strings. */
447 /* Each hash table slot is a bucket containing a chain of these structures.
448 Strings are given negative hash codes; RTL expressions are given positive
453 struct attr_hash *next; /* Next structure in the bucket. */
454 int hashcode; /* Hash code of this rtx or string. */
457 char *str; /* The string (negative hash codes) */
458 rtx rtl; /* or the RTL recorded here. */
462 /* Now here is the hash table. When recording an RTL, it is added to
463 the slot whose index is the hash code mod the table size. Note
464 that the hash table is used for several kinds of RTL (see attr_rtx)
465 and for strings. While all these live in the same table, they are
466 completely independent, and the hash code is computed differently
469 #define RTL_HASH_SIZE 4093
470 struct attr_hash *attr_hash_table[RTL_HASH_SIZE];
472 /* Here is how primitive or already-shared RTL's hash
474 #define RTL_HASH(RTL) ((HOST_WIDE_INT) (RTL) & 0777777)
476 /* Add an entry to the hash table for RTL with hash code HASHCODE. */
479 attr_hash_add_rtx (hashcode, rtl)
483 register struct attr_hash *h;
485 h = (struct attr_hash *) obstack_alloc (hash_obstack,
486 sizeof (struct attr_hash));
487 h->hashcode = hashcode;
489 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
490 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
493 /* Add an entry to the hash table for STRING with hash code HASHCODE. */
496 attr_hash_add_string (hashcode, str)
500 register struct attr_hash *h;
502 h = (struct attr_hash *) obstack_alloc (hash_obstack,
503 sizeof (struct attr_hash));
504 h->hashcode = -hashcode;
506 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
507 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
510 /* Generate an RTL expression, but avoid duplicates.
511 Set the RTX_INTEGRATED_P flag for these permanent objects.
513 In some cases we cannot uniquify; then we return an ordinary
514 impermanent rtx with RTX_INTEGRATED_P clear.
516 Args are like gen_rtx, but without the mode:
518 rtx attr_rtx (code, [element1, ..., elementn]) */
527 register int i; /* Array indices... */
528 register char *fmt; /* Current rtx's format... */
529 register rtx rt_val; /* RTX to return to caller... */
531 register struct attr_hash *h;
532 struct obstack *old_obstack = rtl_obstack;
535 code = va_arg (p, enum rtx_code);
537 /* For each of several cases, search the hash table for an existing entry.
538 Use that entry if one is found; otherwise create a new RTL and add it
541 if (GET_RTX_CLASS (code) == '1')
543 rtx arg0 = va_arg (p, rtx);
545 /* A permanent object cannot point to impermanent ones. */
546 if (! RTX_INTEGRATED_P (arg0))
548 rt_val = rtx_alloc (code);
549 XEXP (rt_val, 0) = arg0;
554 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0));
555 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
556 if (h->hashcode == hashcode
557 && GET_CODE (h->u.rtl) == code
558 && XEXP (h->u.rtl, 0) == arg0)
563 rtl_obstack = hash_obstack;
564 rt_val = rtx_alloc (code);
565 XEXP (rt_val, 0) = arg0;
568 else if (GET_RTX_CLASS (code) == 'c'
569 || GET_RTX_CLASS (code) == '2'
570 || GET_RTX_CLASS (code) == '<')
572 rtx arg0 = va_arg (p, rtx);
573 rtx arg1 = va_arg (p, rtx);
575 /* A permanent object cannot point to impermanent ones. */
576 if (! RTX_INTEGRATED_P (arg0) || ! RTX_INTEGRATED_P (arg1))
578 rt_val = rtx_alloc (code);
579 XEXP (rt_val, 0) = arg0;
580 XEXP (rt_val, 1) = arg1;
585 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0) + RTL_HASH (arg1));
586 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
587 if (h->hashcode == hashcode
588 && GET_CODE (h->u.rtl) == code
589 && XEXP (h->u.rtl, 0) == arg0
590 && XEXP (h->u.rtl, 1) == arg1)
595 rtl_obstack = hash_obstack;
596 rt_val = rtx_alloc (code);
597 XEXP (rt_val, 0) = arg0;
598 XEXP (rt_val, 1) = arg1;
601 else if (GET_RTX_LENGTH (code) == 1
602 && GET_RTX_FORMAT (code)[0] == 's')
604 char * arg0 = va_arg (p, char *);
606 if (code == SYMBOL_REF)
607 arg0 = attr_string (arg0, strlen (arg0));
609 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0));
610 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
611 if (h->hashcode == hashcode
612 && GET_CODE (h->u.rtl) == code
613 && XSTR (h->u.rtl, 0) == arg0)
618 rtl_obstack = hash_obstack;
619 rt_val = rtx_alloc (code);
620 XSTR (rt_val, 0) = arg0;
623 else if (GET_RTX_LENGTH (code) == 2
624 && GET_RTX_FORMAT (code)[0] == 's'
625 && GET_RTX_FORMAT (code)[1] == 's')
627 char *arg0 = va_arg (p, char *);
628 char *arg1 = va_arg (p, char *);
630 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0) + RTL_HASH (arg1));
631 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
632 if (h->hashcode == hashcode
633 && GET_CODE (h->u.rtl) == code
634 && XSTR (h->u.rtl, 0) == arg0
635 && XSTR (h->u.rtl, 1) == arg1)
640 rtl_obstack = hash_obstack;
641 rt_val = rtx_alloc (code);
642 XSTR (rt_val, 0) = arg0;
643 XSTR (rt_val, 1) = arg1;
646 else if (code == CONST_INT)
648 HOST_WIDE_INT arg0 = va_arg (p, HOST_WIDE_INT);
658 rt_val = rtx_alloc (code); /* Allocate the storage space. */
660 fmt = GET_RTX_FORMAT (code); /* Find the right format... */
661 for (i = 0; i < GET_RTX_LENGTH (code); i++)
665 case '0': /* Unused field. */
668 case 'i': /* An integer? */
669 XINT (rt_val, i) = va_arg (p, int);
672 case 'w': /* A wide integer? */
673 XWINT (rt_val, i) = va_arg (p, HOST_WIDE_INT);
676 case 's': /* A string? */
677 XSTR (rt_val, i) = va_arg (p, char *);
680 case 'e': /* An expression? */
681 case 'u': /* An insn? Same except when printing. */
682 XEXP (rt_val, i) = va_arg (p, rtx);
685 case 'E': /* An RTX vector? */
686 XVEC (rt_val, i) = va_arg (p, rtvec);
697 rtl_obstack = old_obstack;
699 attr_hash_add_rtx (hashcode, rt_val);
700 RTX_INTEGRATED_P (rt_val) = 1;
708 /* Create a new string printed with the printf line arguments into a space
709 of at most LEN bytes:
711 rtx attr_printf (len, format, [arg1, ..., argn]) */
717 attr_printf (va_alist)
725 /* Print the string into a temporary location. */
727 len = va_arg (p, int);
728 str = (char *) alloca (len);
729 fmt = va_arg (p, char *);
730 vsprintf (str, fmt, p);
733 return attr_string (str, strlen (str));
736 #else /* not HAVE_VPRINTF */
739 attr_printf (len, fmt, arg1, arg2, arg3)
742 char *arg1, *arg2, *arg3; /* also int */
746 /* Print the string into a temporary location. */
747 str = (char *) alloca (len);
748 sprintf (str, fmt, arg1, arg2, arg3);
750 return attr_string (str, strlen (str));
752 #endif /* not HAVE_VPRINTF */
755 attr_eq (name, value)
758 return attr_rtx (EQ_ATTR, attr_string (name, strlen (name)),
759 attr_string (value, strlen (value)));
766 return XSTR (make_numeric_value (n), 0);
769 /* Return a permanent (possibly shared) copy of a string STR (not assumed
770 to be null terminated) with LEN bytes. */
773 attr_string (str, len)
777 register struct attr_hash *h;
780 register char *new_str;
782 /* Compute the hash code. */
783 hashcode = (len + 1) * 613 + (unsigned)str[0];
784 for (i = 1; i <= len; i += 2)
785 hashcode = ((hashcode * 613) + (unsigned)str[i]);
787 hashcode = -hashcode;
789 /* Search the table for the string. */
790 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
791 if (h->hashcode == -hashcode && h->u.str[0] == str[0]
792 && !strncmp (h->u.str, str, len))
793 return h->u.str; /* <-- return if found. */
795 /* Not found; create a permanent copy and add it to the hash table. */
796 new_str = (char *) obstack_alloc (hash_obstack, len + 1);
797 bcopy (str, new_str, len);
799 attr_hash_add_string (hashcode, new_str);
801 return new_str; /* Return the new string. */
804 /* Check two rtx's for equality of contents,
805 taking advantage of the fact that if both are hashed
806 then they can't be equal unless they are the same object. */
812 return (x == y || (! (RTX_INTEGRATED_P (x) && RTX_INTEGRATED_P (y))
813 && rtx_equal_p (x, y)));
816 /* Copy an attribute value expression,
817 descending to all depths, but not copying any
818 permanent hashed subexpressions. */
826 register RTX_CODE code;
827 register char *format_ptr;
829 /* No need to copy a permanent object. */
830 if (RTX_INTEGRATED_P (orig))
833 code = GET_CODE (orig);
848 copy = rtx_alloc (code);
849 PUT_MODE (copy, GET_MODE (orig));
850 copy->in_struct = orig->in_struct;
851 copy->volatil = orig->volatil;
852 copy->unchanging = orig->unchanging;
853 copy->integrated = orig->integrated;
855 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
857 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
859 switch (*format_ptr++)
862 XEXP (copy, i) = XEXP (orig, i);
863 if (XEXP (orig, i) != NULL)
864 XEXP (copy, i) = attr_copy_rtx (XEXP (orig, i));
869 XVEC (copy, i) = XVEC (orig, i);
870 if (XVEC (orig, i) != NULL)
872 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
873 for (j = 0; j < XVECLEN (copy, i); j++)
874 XVECEXP (copy, i, j) = attr_copy_rtx (XVECEXP (orig, i, j));
880 XINT (copy, i) = XINT (orig, i);
884 XWINT (copy, i) = XWINT (orig, i);
889 XSTR (copy, i) = XSTR (orig, i);
899 /* Given a test expression for an attribute, ensure it is validly formed.
900 IS_CONST indicates whether the expression is constant for each compiler
901 run (a constant expression may not test any particular insn).
903 Convert (eq_attr "att" "a1,a2") to (ior (eq_attr ... ) (eq_attrq ..))
904 and (eq_attr "att" "!a1") to (not (eq_attr "att" "a1")). Do the latter
905 test first so that (eq_attr "att" "!a1,a2,a3") works as expected.
907 Update the string address in EQ_ATTR expression to be the same used
908 in the attribute (or `alternative_name') to speed up subsequent
909 `find_attr' calls and eliminate most `strcmp' calls.
911 Return the new expression, if any. */
914 check_attr_test (exp, is_const)
918 struct attr_desc *attr;
919 struct attr_value *av;
923 switch (GET_CODE (exp))
926 /* Handle negation test. */
927 if (XSTR (exp, 1)[0] == '!')
928 return check_attr_test (attr_rtx (NOT,
929 attr_eq (XSTR (exp, 0),
933 else if (n_comma_elts (XSTR (exp, 1)) == 1)
935 attr = find_attr (XSTR (exp, 0), 0);
938 if (! strcmp (XSTR (exp, 0), "alternative"))
940 XSTR (exp, 0) = alternative_name;
941 /* This can't be simplified any further. */
942 RTX_UNCHANGING_P (exp) = 1;
946 fatal ("Unknown attribute `%s' in EQ_ATTR", XEXP (exp, 0));
949 if (is_const && ! attr->is_const)
950 fatal ("Constant expression uses insn attribute `%s' in EQ_ATTR",
953 /* Copy this just to make it permanent,
954 so expressions using it can be permanent too. */
955 exp = attr_eq (XSTR (exp, 0), XSTR (exp, 1));
957 /* It shouldn't be possible to simplify the value given to a
958 constant attribute, so don't expand this until it's time to
959 write the test expression. */
961 RTX_UNCHANGING_P (exp) = 1;
963 if (attr->is_numeric)
965 for (p = XSTR (exp, 1); *p; p++)
966 if (*p < '0' || *p > '9')
967 fatal ("Attribute `%s' takes only numeric values",
972 for (av = attr->first_value; av; av = av->next)
973 if (GET_CODE (av->value) == CONST_STRING
974 && ! strcmp (XSTR (exp, 1), XSTR (av->value, 0)))
978 fatal ("Unknown value `%s' for `%s' attribute",
979 XEXP (exp, 1), XEXP (exp, 0));
984 /* Make an IOR tree of the possible values. */
986 name_ptr = XSTR (exp, 1);
987 while ((p = next_comma_elt (&name_ptr)) != NULL)
989 newexp = attr_eq (XSTR (exp, 0), p);
990 orexp = insert_right_side (IOR, orexp, newexp, -2, -2);
993 return check_attr_test (orexp, is_const);
998 /* Either TRUE or FALSE. */
1006 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0), is_const);
1007 XEXP (exp, 1) = check_attr_test (XEXP (exp, 1), is_const);
1011 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0), is_const);
1016 fatal ("RTL operator \"%s\" not valid in constant attribute test",
1017 GET_RTX_NAME (MATCH_OPERAND));
1018 /* These cases can't be simplified. */
1019 RTX_UNCHANGING_P (exp) = 1;
1022 case LE: case LT: case GT: case GE:
1023 case LEU: case LTU: case GTU: case GEU:
1025 if (GET_CODE (XEXP (exp, 0)) == SYMBOL_REF
1026 && GET_CODE (XEXP (exp, 1)) == SYMBOL_REF)
1027 exp = attr_rtx (GET_CODE (exp),
1028 attr_rtx (SYMBOL_REF, XSTR (XEXP (exp, 0), 0)),
1029 attr_rtx (SYMBOL_REF, XSTR (XEXP (exp, 1), 0)));
1030 /* These cases can't be simplified. */
1031 RTX_UNCHANGING_P (exp) = 1;
1037 /* These cases are valid for constant attributes, but can't be
1039 exp = attr_rtx (SYMBOL_REF, XSTR (exp, 0));
1040 RTX_UNCHANGING_P (exp) = 1;
1044 fatal ("RTL operator \"%s\" not valid in attribute test",
1045 GET_RTX_NAME (GET_CODE (exp)));
1051 /* Given an expression, ensure that it is validly formed and that all named
1052 attribute values are valid for the given attribute. Issue a fatal error
1053 if not. If no attribute is specified, assume a numeric attribute.
1055 Return a perhaps modified replacement expression for the value. */
1058 check_attr_value (exp, attr)
1060 struct attr_desc *attr;
1062 struct attr_value *av;
1066 switch (GET_CODE (exp))
1069 if (attr && ! attr->is_numeric)
1070 fatal ("CONST_INT not valid for non-numeric `%s' attribute",
1073 if (INTVAL (exp) < 0)
1074 fatal ("Negative numeric value specified for `%s' attribute",
1080 if (! strcmp (XSTR (exp, 0), "*"))
1083 if (attr == 0 || attr->is_numeric)
1086 if (attr && attr->negative_ok && *p == '-')
1089 if (*p > '9' || *p < '0')
1090 fatal ("Non-numeric value for numeric `%s' attribute",
1091 attr ? attr->name : "internal");
1095 for (av = attr->first_value; av; av = av->next)
1096 if (GET_CODE (av->value) == CONST_STRING
1097 && ! strcmp (XSTR (av->value, 0), XSTR (exp, 0)))
1101 fatal ("Unknown value `%s' for `%s' attribute",
1102 XSTR (exp, 0), attr ? attr->name : "internal");
1107 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0),
1108 attr ? attr->is_const : 0);
1109 XEXP (exp, 1) = check_attr_value (XEXP (exp, 1), attr);
1110 XEXP (exp, 2) = check_attr_value (XEXP (exp, 2), attr);
1114 if (XVECLEN (exp, 0) % 2 != 0)
1115 fatal ("First operand of COND must have even length");
1117 for (i = 0; i < XVECLEN (exp, 0); i += 2)
1119 XVECEXP (exp, 0, i) = check_attr_test (XVECEXP (exp, 0, i),
1120 attr ? attr->is_const : 0);
1121 XVECEXP (exp, 0, i + 1)
1122 = check_attr_value (XVECEXP (exp, 0, i + 1), attr);
1125 XEXP (exp, 1) = check_attr_value (XEXP (exp, 1), attr);
1129 if (attr && attr->is_const)
1130 /* A constant SYMBOL_REF is valid as a constant attribute test and
1131 is expanded later by make_canonical into a COND. */
1132 return attr_rtx (SYMBOL_REF, XSTR (exp, 0));
1133 /* Otherwise, fall through... */
1136 fatal ("Illegal operation `%s' for attribute value",
1137 GET_RTX_NAME (GET_CODE (exp)));
1143 /* Given an SET_ATTR_ALTERNATIVE expression, convert to the canonical SET.
1144 It becomes a COND with each test being (eq_attr "alternative "n") */
1147 convert_set_attr_alternative (exp, num_alt, insn_code, insn_index)
1150 int insn_code, insn_index;
1155 if (XVECLEN (exp, 1) != num_alt)
1156 fatal ("Bad number of entries in SET_ATTR_ALTERNATIVE for insn %d",
1159 /* Make a COND with all tests but the last. Select the last value via the
1161 condexp = rtx_alloc (COND);
1162 XVEC (condexp, 0) = rtvec_alloc ((num_alt - 1) * 2);
1164 for (i = 0; i < num_alt - 1; i++)
1167 p = attr_numeral (i);
1169 XVECEXP (condexp, 0, 2 * i) = attr_eq (alternative_name, p);
1171 /* Sharing this EQ_ATTR rtl causes trouble. */
1172 XVECEXP (condexp, 0, 2 * i) = rtx_alloc (EQ_ATTR);
1173 XSTR (XVECEXP (condexp, 0, 2 * i), 0) = alternative_name;
1174 XSTR (XVECEXP (condexp, 0, 2 * i), 1) = p;
1176 XVECEXP (condexp, 0, 2 * i + 1) = XVECEXP (exp, 1, i);
1179 XEXP (condexp, 1) = XVECEXP (exp, 1, i);
1181 return attr_rtx (SET, attr_rtx (ATTR, XSTR (exp, 0)), condexp);
1184 /* Given a SET_ATTR, convert to the appropriate SET. If a comma-separated
1185 list of values is given, convert to SET_ATTR_ALTERNATIVE first. */
1188 convert_set_attr (exp, num_alt, insn_code, insn_index)
1191 int insn_code, insn_index;
1198 /* See how many alternative specified. */
1199 n = n_comma_elts (XSTR (exp, 1));
1201 return attr_rtx (SET,
1202 attr_rtx (ATTR, XSTR (exp, 0)),
1203 attr_rtx (CONST_STRING, XSTR (exp, 1)));
1205 newexp = rtx_alloc (SET_ATTR_ALTERNATIVE);
1206 XSTR (newexp, 0) = XSTR (exp, 0);
1207 XVEC (newexp, 1) = rtvec_alloc (n);
1209 /* Process each comma-separated name. */
1210 name_ptr = XSTR (exp, 1);
1212 while ((p = next_comma_elt (&name_ptr)) != NULL)
1213 XVECEXP (newexp, 1, n++) = attr_rtx (CONST_STRING, p);
1215 return convert_set_attr_alternative (newexp, num_alt, insn_code, insn_index);
1218 /* Scan all definitions, checking for validity. Also, convert any SET_ATTR
1219 and SET_ATTR_ALTERNATIVE expressions to the corresponding SET
1225 struct insn_def *id;
1226 struct attr_desc *attr;
1230 for (id = defs; id; id = id->next)
1232 if (XVEC (id->def, id->vec_idx) == NULL)
1235 for (i = 0; i < XVECLEN (id->def, id->vec_idx); i++)
1237 value = XVECEXP (id->def, id->vec_idx, i);
1238 switch (GET_CODE (value))
1241 if (GET_CODE (XEXP (value, 0)) != ATTR)
1242 fatal ("Bad attribute set in pattern %d", id->insn_index);
1245 case SET_ATTR_ALTERNATIVE:
1246 value = convert_set_attr_alternative (value,
1247 id->num_alternatives,
1253 value = convert_set_attr (value, id->num_alternatives,
1254 id->insn_code, id->insn_index);
1258 fatal ("Invalid attribute code `%s' for pattern %d",
1259 GET_RTX_NAME (GET_CODE (value)), id->insn_index);
1262 if ((attr = find_attr (XSTR (XEXP (value, 0), 0), 0)) == NULL)
1263 fatal ("Unknown attribute `%s' for pattern number %d",
1264 XSTR (XEXP (value, 0), 0), id->insn_index);
1266 XVECEXP (id->def, id->vec_idx, i) = value;
1267 XEXP (value, 1) = check_attr_value (XEXP (value, 1), attr);
1272 /* Given a constant SYMBOL_REF expression, convert to a COND that
1273 explicitly tests each enumerated value. */
1276 convert_const_symbol_ref (exp, attr)
1278 struct attr_desc *attr;
1281 struct attr_value *av;
1285 for (av = attr->first_value; av; av = av->next)
1288 /* Make a COND with all tests but the last, and in the original order.
1289 Select the last value via the default. Note that the attr values
1290 are constructed in reverse order. */
1292 condexp = rtx_alloc (COND);
1293 XVEC (condexp, 0) = rtvec_alloc ((num_alt - 1) * 2);
1294 av = attr->first_value;
1295 XEXP (condexp, 1) = av->value;
1297 for (i = num_alt - 2; av = av->next, i >= 0; i--)
1302 string = p = (char *) oballoc (2
1303 + strlen (attr->name)
1304 + strlen (XSTR (av->value, 0)));
1305 strcpy (p, attr->name);
1307 strcat (p, XSTR (av->value, 0));
1308 for (; *p != '\0'; p++)
1309 if (*p >= 'a' && *p <= 'z')
1312 value = attr_rtx (SYMBOL_REF, string);
1313 RTX_UNCHANGING_P (value) = 1;
1315 XVECEXP (condexp, 0, 2 * i) = attr_rtx (EQ, exp, value);
1317 XVECEXP (condexp, 0, 2 * i + 1) = av->value;
1323 /* Given a valid expression for an attribute value, remove any IF_THEN_ELSE
1324 expressions by converting them into a COND. This removes cases from this
1325 program. Also, replace an attribute value of "*" with the default attribute
1329 make_canonical (attr, exp)
1330 struct attr_desc *attr;
1336 switch (GET_CODE (exp))
1339 exp = make_numeric_value (INTVAL (exp));
1343 if (! strcmp (XSTR (exp, 0), "*"))
1345 if (attr == 0 || attr->default_val == 0)
1346 fatal ("(attr_value \"*\") used in invalid context.");
1347 exp = attr->default_val->value;
1353 if (!attr->is_const || RTX_UNCHANGING_P (exp))
1355 /* The SYMBOL_REF is constant for a given run, so mark it as unchanging.
1356 This makes the COND something that won't be considered an arbitrary
1357 expression by walk_attr_value. */
1358 RTX_UNCHANGING_P (exp) = 1;
1359 exp = convert_const_symbol_ref (exp, attr);
1360 RTX_UNCHANGING_P (exp) = 1;
1361 exp = check_attr_value (exp, attr);
1362 /* Goto COND case since this is now a COND. Note that while the
1363 new expression is rescanned, all symbol_ref notes are mared as
1368 newexp = rtx_alloc (COND);
1369 XVEC (newexp, 0) = rtvec_alloc (2);
1370 XVECEXP (newexp, 0, 0) = XEXP (exp, 0);
1371 XVECEXP (newexp, 0, 1) = XEXP (exp, 1);
1373 XEXP (newexp, 1) = XEXP (exp, 2);
1376 /* Fall through to COND case since this is now a COND. */
1384 /* First, check for degenerate COND. */
1385 if (XVECLEN (exp, 0) == 0)
1386 return make_canonical (attr, XEXP (exp, 1));
1387 defval = XEXP (exp, 1) = make_canonical (attr, XEXP (exp, 1));
1389 for (i = 0; i < XVECLEN (exp, 0); i += 2)
1391 XVECEXP (exp, 0, i) = copy_boolean (XVECEXP (exp, 0, i));
1392 XVECEXP (exp, 0, i + 1)
1393 = make_canonical (attr, XVECEXP (exp, 0, i + 1));
1394 if (! rtx_equal_p (XVECEXP (exp, 0, i + 1), defval))
1410 if (GET_CODE (exp) == AND || GET_CODE (exp) == IOR)
1411 return attr_rtx (GET_CODE (exp), copy_boolean (XEXP (exp, 0)),
1412 copy_boolean (XEXP (exp, 1)));
1416 /* Given a value and an attribute description, return a `struct attr_value *'
1417 that represents that value. This is either an existing structure, if the
1418 value has been previously encountered, or a newly-created structure.
1420 `insn_code' is the code of an insn whose attribute has the specified
1421 value (-2 if not processing an insn). We ensure that all insns for
1422 a given value have the same number of alternatives if the value checks
1425 static struct attr_value *
1426 get_attr_value (value, attr, insn_code)
1428 struct attr_desc *attr;
1431 struct attr_value *av;
1434 value = make_canonical (attr, value);
1435 if (compares_alternatives_p (value))
1437 if (insn_code < 0 || insn_alternatives == NULL)
1438 fatal ("(eq_attr \"alternatives\" ...) used in non-insn context");
1440 num_alt = insn_alternatives[insn_code];
1443 for (av = attr->first_value; av; av = av->next)
1444 if (rtx_equal_p (value, av->value)
1445 && (num_alt == 0 || av->first_insn == NULL
1446 || insn_alternatives[av->first_insn->insn_code]))
1449 av = (struct attr_value *) oballoc (sizeof (struct attr_value));
1451 av->next = attr->first_value;
1452 attr->first_value = av;
1453 av->first_insn = NULL;
1455 av->has_asm_insn = 0;
1460 /* After all DEFINE_DELAYs have been read in, create internal attributes
1461 to generate the required routines.
1463 First, we compute the number of delay slots for each insn (as a COND of
1464 each of the test expressions in DEFINE_DELAYs). Then, if more than one
1465 delay type is specified, we compute a similar function giving the
1466 DEFINE_DELAY ordinal for each insn.
1468 Finally, for each [DEFINE_DELAY, slot #] pair, we compute an attribute that
1469 tells whether a given insn can be in that delay slot.
1471 Normal attribute filling and optimization expands these to contain the
1472 information needed to handle delay slots. */
1477 struct delay_desc *delay;
1483 /* First, generate data for `num_delay_slots' function. */
1485 condexp = rtx_alloc (COND);
1486 XVEC (condexp, 0) = rtvec_alloc (num_delays * 2);
1487 XEXP (condexp, 1) = make_numeric_value (0);
1489 for (i = 0, delay = delays; delay; i += 2, delay = delay->next)
1491 XVECEXP (condexp, 0, i) = XEXP (delay->def, 0);
1492 XVECEXP (condexp, 0, i + 1)
1493 = make_numeric_value (XVECLEN (delay->def, 1) / 3);
1496 make_internal_attr ("*num_delay_slots", condexp, 0);
1498 /* If more than one delay type, do the same for computing the delay type. */
1501 condexp = rtx_alloc (COND);
1502 XVEC (condexp, 0) = rtvec_alloc (num_delays * 2);
1503 XEXP (condexp, 1) = make_numeric_value (0);
1505 for (i = 0, delay = delays; delay; i += 2, delay = delay->next)
1507 XVECEXP (condexp, 0, i) = XEXP (delay->def, 0);
1508 XVECEXP (condexp, 0, i + 1) = make_numeric_value (delay->num);
1511 make_internal_attr ("*delay_type", condexp, 1);
1514 /* For each delay possibility and delay slot, compute an eligibility
1515 attribute for non-annulled insns and for each type of annulled (annul
1516 if true and annul if false). */
1517 for (delay = delays; delay; delay = delay->next)
1519 for (i = 0; i < XVECLEN (delay->def, 1); i += 3)
1521 condexp = XVECEXP (delay->def, 1, i);
1522 if (condexp == 0) condexp = false_rtx;
1523 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1524 make_numeric_value (1), make_numeric_value (0));
1526 p = attr_printf (sizeof ("*delay__") + MAX_DIGITS*2, "*delay_%d_%d",
1528 make_internal_attr (p, newexp, 1);
1530 if (have_annul_true)
1532 condexp = XVECEXP (delay->def, 1, i + 1);
1533 if (condexp == 0) condexp = false_rtx;
1534 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1535 make_numeric_value (1),
1536 make_numeric_value (0));
1537 p = attr_printf (sizeof ("*annul_true__") + MAX_DIGITS*2,
1538 "*annul_true_%d_%d", delay->num, i / 3);
1539 make_internal_attr (p, newexp, 1);
1542 if (have_annul_false)
1544 condexp = XVECEXP (delay->def, 1, i + 2);
1545 if (condexp == 0) condexp = false_rtx;
1546 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1547 make_numeric_value (1),
1548 make_numeric_value (0));
1549 p = attr_printf (sizeof ("*annul_false__") + MAX_DIGITS*2,
1550 "*annul_false_%d_%d", delay->num, i / 3);
1551 make_internal_attr (p, newexp, 1);
1557 /* This function is given a left and right side expression and an operator.
1558 Each side is a conditional expression, each alternative of which has a
1559 numerical value. The function returns another conditional expression
1560 which, for every possible set of condition values, returns a value that is
1561 the operator applied to the values of the two sides.
1563 Since this is called early, it must also support IF_THEN_ELSE. */
1566 operate_exp (op, left, right)
1570 int left_value, right_value;
1574 /* If left is a string, apply operator to it and the right side. */
1575 if (GET_CODE (left) == CONST_STRING)
1577 /* If right is also a string, just perform the operation. */
1578 if (GET_CODE (right) == CONST_STRING)
1580 left_value = atoi (XSTR (left, 0));
1581 right_value = atoi (XSTR (right, 0));
1585 i = left_value + right_value;
1589 i = left_value - right_value;
1592 case POS_MINUS_OP: /* The positive part of LEFT - RIGHT. */
1593 if (left_value > right_value)
1594 i = left_value - right_value;
1600 i = left_value | right_value;
1604 i = left_value == right_value;
1608 i = (left_value << (HOST_BITS_PER_INT / 2)) | right_value;
1612 if (left_value > right_value)
1619 if (left_value < right_value)
1629 return make_numeric_value (i);
1631 else if (GET_CODE (right) == IF_THEN_ELSE)
1633 /* Apply recursively to all values within. */
1634 rtx newleft = operate_exp (op, left, XEXP (right, 1));
1635 rtx newright = operate_exp (op, left, XEXP (right, 2));
1636 if (rtx_equal_p (newleft, newright))
1638 return attr_rtx (IF_THEN_ELSE, XEXP (right, 0), newleft, newright);
1640 else if (GET_CODE (right) == COND)
1645 newexp = rtx_alloc (COND);
1646 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (right, 0));
1647 defval = XEXP (newexp, 1) = operate_exp (op, left, XEXP (right, 1));
1649 for (i = 0; i < XVECLEN (right, 0); i += 2)
1651 XVECEXP (newexp, 0, i) = XVECEXP (right, 0, i);
1652 XVECEXP (newexp, 0, i + 1)
1653 = operate_exp (op, left, XVECEXP (right, 0, i + 1));
1654 if (! rtx_equal_p (XVECEXP (newexp, 0, i + 1),
1659 /* If the resulting cond is trivial (all alternatives
1660 give the same value), optimize it away. */
1663 obstack_free (rtl_obstack, newexp);
1664 return operate_exp (op, left, XEXP (right, 1));
1667 /* If the result is the same as the RIGHT operand,
1669 if (rtx_equal_p (newexp, right))
1671 obstack_free (rtl_obstack, newexp);
1678 fatal ("Badly formed attribute value");
1681 /* Otherwise, do recursion the other way. */
1682 else if (GET_CODE (left) == IF_THEN_ELSE)
1684 rtx newleft = operate_exp (op, XEXP (left, 1), right);
1685 rtx newright = operate_exp (op, XEXP (left, 2), right);
1686 if (rtx_equal_p (newleft, newright))
1688 return attr_rtx (IF_THEN_ELSE, XEXP (left, 0), newleft, newright);
1690 else if (GET_CODE (left) == COND)
1695 newexp = rtx_alloc (COND);
1696 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (left, 0));
1697 defval = XEXP (newexp, 1) = operate_exp (op, XEXP (left, 1), right);
1699 for (i = 0; i < XVECLEN (left, 0); i += 2)
1701 XVECEXP (newexp, 0, i) = XVECEXP (left, 0, i);
1702 XVECEXP (newexp, 0, i + 1)
1703 = operate_exp (op, XVECEXP (left, 0, i + 1), right);
1704 if (! rtx_equal_p (XVECEXP (newexp, 0, i + 1),
1709 /* If the cond is trivial (all alternatives give the same value),
1710 optimize it away. */
1713 obstack_free (rtl_obstack, newexp);
1714 return operate_exp (op, XEXP (left, 1), right);
1717 /* If the result is the same as the LEFT operand,
1719 if (rtx_equal_p (newexp, left))
1721 obstack_free (rtl_obstack, newexp);
1729 fatal ("Badly formed attribute value.");
1734 /* Once all attributes and DEFINE_FUNCTION_UNITs have been read, we
1735 construct a number of attributes.
1737 The first produces a function `function_units_used' which is given an
1738 insn and produces an encoding showing which function units are required
1739 for the execution of that insn. If the value is non-negative, the insn
1740 uses that unit; otherwise, the value is a one's compliment mask of units
1743 The second produces a function `result_ready_cost' which is used to
1744 determine the time that the result of an insn will be ready and hence
1745 a worst-case schedule.
1747 Both of these produce quite complex expressions which are then set as the
1748 default value of internal attributes. Normal attribute simplification
1749 should produce reasonable expressions.
1751 For each unit, a `<name>_unit_ready_cost' function will take an
1752 insn and give the delay until that unit will be ready with the result
1753 and a `<name>_unit_conflict_cost' function is given an insn already
1754 executing on the unit and a candidate to execute and will give the
1755 cost from the time the executing insn started until the candidate
1756 can start (ignore limitations on the number of simultaneous insns).
1758 For each unit, a `<name>_unit_blockage' function is given an insn
1759 already executing on the unit and a candidate to execute and will
1760 give the delay incurred due to function unit conflicts. The range of
1761 blockage cost values for a given executing insn is given by the
1762 `<name>_unit_blockage_range' function. These values are encoded in
1763 an int where the upper half gives the minimum value and the lower
1764 half gives the maximum value. */
1769 struct function_unit *unit, **unit_num;
1770 struct function_unit_op *op, **op_array, ***unit_ops;
1775 int i, j, u, num, nvalues;
1777 /* Rebuild the condition for the unit to share the RTL expressions.
1778 Sharing is required by simplify_by_exploding. Build the issue delay
1779 expressions. Validate the expressions we were given for the conditions
1780 and conflict vector. Then make attributes for use in the conflict
1783 for (unit = units; unit; unit = unit->next)
1785 rtx min_issue = make_numeric_value (unit->issue_delay.min);
1787 unit->condexp = check_attr_test (unit->condexp, 0);
1789 for (op = unit->ops; op; op = op->next)
1791 rtx issue_delay = make_numeric_value (op->issue_delay);
1792 rtx issue_exp = issue_delay;
1794 /* Build, validate, and simplify the issue delay expression. */
1795 if (op->conflict_exp != true_rtx)
1796 issue_exp = attr_rtx (IF_THEN_ELSE, op->conflict_exp,
1797 issue_exp, make_numeric_value (0));
1798 issue_exp = check_attr_value (make_canonical (NULL_ATTR,
1801 issue_exp = simplify_knowing (issue_exp, unit->condexp);
1802 op->issue_exp = issue_exp;
1804 /* Make an attribute for use in the conflict function if needed. */
1805 unit->needs_conflict_function = (unit->issue_delay.min
1806 != unit->issue_delay.max);
1807 if (unit->needs_conflict_function)
1809 str = attr_printf (strlen (unit->name) + sizeof ("*_cost_") + MAX_DIGITS,
1810 "*%s_cost_%d", unit->name, op->num);
1811 make_internal_attr (str, issue_exp, 1);
1814 /* Validate the condition. */
1815 op->condexp = check_attr_test (op->condexp, 0);
1819 /* Compute the mask of function units used. Initially, the unitsmask is
1820 zero. Set up a conditional to compute each unit's contribution. */
1821 unitsmask = make_numeric_value (0);
1822 newexp = rtx_alloc (IF_THEN_ELSE);
1823 XEXP (newexp, 2) = make_numeric_value (0);
1825 /* Merge each function unit into the unit mask attributes. */
1826 for (unit = units; unit; unit = unit->next)
1828 XEXP (newexp, 0) = unit->condexp;
1829 XEXP (newexp, 1) = make_numeric_value (1 << unit->num);
1830 unitsmask = operate_exp (OR_OP, unitsmask, newexp);
1833 /* Simplify the unit mask expression, encode it, and make an attribute
1834 for the function_units_used function. */
1835 unitsmask = simplify_by_exploding (unitsmask);
1836 unitsmask = encode_units_mask (unitsmask);
1837 make_internal_attr ("*function_units_used", unitsmask, 2);
1839 /* Create an array of ops for each unit. Add an extra unit for the
1840 result_ready_cost function that has the ops of all other units. */
1841 unit_ops = (struct function_unit_op ***)
1842 alloca ((num_units + 1) * sizeof (struct function_unit_op **));
1843 unit_num = (struct function_unit **)
1844 alloca ((num_units + 1) * sizeof (struct function_unit *));
1846 unit_num[num_units] = unit = (struct function_unit *)
1847 alloca (sizeof (struct function_unit));
1848 unit->num = num_units;
1849 unit->num_opclasses = 0;
1851 for (unit = units; unit; unit = unit->next)
1853 unit_num[num_units]->num_opclasses += unit->num_opclasses;
1854 unit_num[unit->num] = unit;
1855 unit_ops[unit->num] = op_array = (struct function_unit_op **)
1856 alloca (unit->num_opclasses * sizeof (struct function_unit_op *));
1858 for (op = unit->ops; op; op = op->next)
1859 op_array[op->num] = op;
1862 /* Compose the array of ops for the extra unit. */
1863 unit_ops[num_units] = op_array = (struct function_unit_op **)
1864 alloca (unit_num[num_units]->num_opclasses
1865 * sizeof (struct function_unit_op *));
1867 for (unit = units, i = 0; unit; i += unit->num_opclasses, unit = unit->next)
1868 bcopy (unit_ops[unit->num], &op_array[i],
1869 unit->num_opclasses * sizeof (struct function_unit_op *));
1871 /* Compute the ready cost function for each unit by computing the
1872 condition for each non-default value. */
1873 for (u = 0; u <= num_units; u++)
1879 op_array = unit_ops[unit->num];
1880 num = unit->num_opclasses;
1882 /* Sort the array of ops into increasing ready cost order. */
1883 for (i = 0; i < num; i++)
1884 for (j = num - 1; j > i; j--)
1885 if (op_array[j-1]->ready < op_array[j]->ready)
1888 op_array[j] = op_array[j-1];
1892 /* Determine how many distinct non-default ready cost values there
1893 are. We use a default ready cost value of 1. */
1894 nvalues = 0; value = 1;
1895 for (i = num - 1; i >= 0; i--)
1896 if (op_array[i]->ready > value)
1898 value = op_array[i]->ready;
1903 readycost = make_numeric_value (1);
1906 /* Construct the ready cost expression as a COND of each value from
1907 the largest to the smallest. */
1908 readycost = rtx_alloc (COND);
1909 XVEC (readycost, 0) = rtvec_alloc (nvalues * 2);
1910 XEXP (readycost, 1) = make_numeric_value (1);
1912 nvalues = 0; orexp = false_rtx; value = op_array[0]->ready;
1913 for (i = 0; i < num; i++)
1918 else if (op->ready == value)
1919 orexp = insert_right_side (IOR, orexp, op->condexp, -2, -2);
1922 XVECEXP (readycost, 0, nvalues * 2) = orexp;
1923 XVECEXP (readycost, 0, nvalues * 2 + 1)
1924 = make_numeric_value (value);
1927 orexp = op->condexp;
1930 XVECEXP (readycost, 0, nvalues * 2) = orexp;
1931 XVECEXP (readycost, 0, nvalues * 2 + 1) = make_numeric_value (value);
1936 rtx max_blockage = 0, min_blockage = 0;
1938 /* Simplify the readycost expression by only considering insns
1939 that use the unit. */
1940 readycost = simplify_knowing (readycost, unit->condexp);
1942 /* Determine the blockage cost the executing insn (E) given
1943 the candidate insn (C). This is the maximum of the issue
1944 delay, the pipeline delay, and the simultaneity constraint.
1945 Each function_unit_op represents the characteristics of the
1946 candidate insn, so in the expressions below, C is a known
1947 term and E is an unknown term.
1949 The issue delay function for C is op->issue_exp and is used to
1950 write the `<name>_unit_conflict_cost' function. Symbolicly
1951 this is "ISSUE-DELAY (E,C)".
1953 The pipeline delay results form the FIFO constraint on the
1954 function unit and is "READY-COST (E) + 1 - READY-COST (C)".
1956 The simultaneity constraint is based on how long it takes to
1957 fill the unit given the minimum issue delay. FILL-TIME is the
1958 constant "MIN (ISSUE-DELAY (*,*)) * (SIMULTANEITY - 1)", and
1959 the simultaneity constraint is "READY-COST (E) - FILL-TIME"
1960 if SIMULTANEITY is non-zero and zero otherwise.
1962 Thus, BLOCKAGE (E,C) when SIMULTANEITY is zero is
1964 MAX (ISSUE-DELAY (E,C),
1965 READY-COST (E) - (READY-COST (C) - 1))
1969 MAX (ISSUE-DELAY (E,C),
1970 READY-COST (E) - (READY-COST (C) - 1),
1971 READY-COST (E) - FILL-TIME)
1973 The `<name>_unit_blockage' function is computed by determining
1974 this value for each candidate insn. As these values are
1975 computed, we also compute the upper and lower bounds for
1976 BLOCKAGE (E,*). These are combined to form the function
1977 `<name>_unit_blockage_range'. Finally, the maximum blockage
1978 cost, MAX (BLOCKAGE (*,*)), is computed. */
1980 for (op = unit->ops; op; op = op->next)
1982 rtx blockage = readycost;
1983 int delay = op->ready - 1;
1985 if (unit->simultaneity != 0)
1986 delay = MIN (delay, ((unit->simultaneity - 1)
1987 * unit->issue_delay.min));
1990 blockage = operate_exp (POS_MINUS_OP, blockage,
1991 make_numeric_value (delay));
1993 blockage = operate_exp (MAX_OP, blockage, op->issue_exp);
1994 blockage = simplify_knowing (blockage, unit->condexp);
1996 /* Add this op's contribution to MAX (BLOCKAGE (E,*)) and
1997 MIN (BLOCKAGE (E,*)). */
1998 if (max_blockage == 0)
1999 max_blockage = min_blockage = blockage;
2003 = simplify_knowing (operate_exp (MAX_OP, max_blockage,
2007 = simplify_knowing (operate_exp (MIN_OP, min_blockage,
2012 /* Make an attribute for use in the blockage function. */
2013 str = attr_printf (strlen (unit->name) + sizeof ("*_block_") + MAX_DIGITS,
2014 "*%s_block_%d", unit->name, op->num);
2015 make_internal_attr (str, blockage, 1);
2018 /* Record MAX (BLOCKAGE (*,*)). */
2019 unit->max_blockage = max_attr_value (max_blockage);
2021 /* See if the upper and lower bounds of BLOCKAGE (E,*) are the
2022 same. If so, the blockage function carries no additional
2023 information and is not written. */
2024 newexp = operate_exp (EQ_OP, max_blockage, min_blockage);
2025 newexp = simplify_knowing (newexp, unit->condexp);
2026 unit->needs_blockage_function
2027 = (GET_CODE (newexp) != CONST_STRING
2028 || atoi (XSTR (newexp, 0)) != 1);
2030 /* If the all values of BLOCKAGE (E,C) have the same value,
2031 neither blockage function is written. */
2032 unit->needs_range_function
2033 = (unit->needs_blockage_function
2034 || GET_CODE (max_blockage) != CONST_STRING);
2036 if (unit->needs_range_function)
2038 /* Compute the blockage range function and make an attribute
2039 for writing it's value. */
2040 newexp = operate_exp (RANGE_OP, min_blockage, max_blockage);
2041 newexp = simplify_knowing (newexp, unit->condexp);
2043 str = attr_printf (strlen (unit->name) + sizeof ("*_unit_blockage_range"),
2044 "*%s_unit_blockage_range", unit->name);
2045 make_internal_attr (str, newexp, 4);
2048 str = attr_printf (strlen (unit->name) + sizeof ("*_unit_ready_cost"),
2049 "*%s_unit_ready_cost", unit->name);
2052 str = "*result_ready_cost";
2054 /* Make an attribute for the ready_cost function. Simplifying
2055 further with simplify_by_exploding doesn't win. */
2056 make_internal_attr (str, readycost, 0);
2059 /* For each unit that requires a conflict cost function, make an attribute
2060 that maps insns to the operation number. */
2061 for (unit = units; unit; unit = unit->next)
2065 if (! unit->needs_conflict_function
2066 && ! unit->needs_blockage_function)
2069 caseexp = rtx_alloc (COND);
2070 XVEC (caseexp, 0) = rtvec_alloc ((unit->num_opclasses - 1) * 2);
2072 for (op = unit->ops; op; op = op->next)
2074 /* Make our adjustment to the COND being computed. If we are the
2075 last operation class, place our values into the default of the
2077 if (op->num == unit->num_opclasses - 1)
2079 XEXP (caseexp, 1) = make_numeric_value (op->num);
2083 XVECEXP (caseexp, 0, op->num * 2) = op->condexp;
2084 XVECEXP (caseexp, 0, op->num * 2 + 1)
2085 = make_numeric_value (op->num);
2089 /* Simplifying caseexp with simplify_by_exploding doesn't win. */
2090 str = attr_printf (strlen (unit->name) + sizeof ("*_cases"),
2091 "*%s_cases", unit->name);
2092 make_internal_attr (str, caseexp, 1);
2096 /* Simplify EXP given KNOWN_TRUE. */
2099 simplify_knowing (exp, known_true)
2100 rtx exp, known_true;
2102 if (GET_CODE (exp) != CONST_STRING)
2104 exp = attr_rtx (IF_THEN_ELSE, known_true, exp,
2105 make_numeric_value (max_attr_value (exp)));
2106 exp = simplify_by_exploding (exp);
2111 /* Translate the CONST_STRING expressions in X to change the encoding of
2112 value. On input, the value is a bitmask with a one bit for each unit
2113 used; on output, the value is the unit number (zero based) if one
2114 and only one unit is used or the one's compliment of the bitmask. */
2117 encode_units_mask (x)
2122 register enum rtx_code code;
2125 code = GET_CODE (x);
2130 i = atoi (XSTR (x, 0));
2132 abort (); /* The sign bit encodes a one's compliment mask. */
2133 else if (i != 0 && i == (i & -i))
2134 /* Only one bit is set, so yield that unit number. */
2135 for (j = 0; (i >>= 1) != 0; j++)
2139 return attr_rtx (CONST_STRING, attr_printf (MAX_DIGITS, "%d", j));
2153 /* Compare the elements. If any pair of corresponding elements
2154 fail to match, return 0 for the whole things. */
2156 fmt = GET_RTX_FORMAT (code);
2157 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2163 for (j = 0; j < XVECLEN (x, i); j++)
2164 XVECEXP (x, i, j) = encode_units_mask (XVECEXP (x, i, j));
2168 XEXP (x, i) = encode_units_mask (XEXP (x, i));
2175 /* Once all attributes and insns have been read and checked, we construct for
2176 each attribute value a list of all the insns that have that value for
2181 struct attr_desc *attr;
2183 struct attr_value *av;
2184 struct insn_ent *ie;
2185 struct insn_def *id;
2189 /* Don't fill constant attributes. The value is independent of
2190 any particular insn. */
2194 for (id = defs; id; id = id->next)
2196 /* If no value is specified for this insn for this attribute, use the
2199 if (XVEC (id->def, id->vec_idx))
2200 for (i = 0; i < XVECLEN (id->def, id->vec_idx); i++)
2201 if (! strcmp (XSTR (XEXP (XVECEXP (id->def, id->vec_idx, i), 0), 0),
2203 value = XEXP (XVECEXP (id->def, id->vec_idx, i), 1);
2206 av = attr->default_val;
2208 av = get_attr_value (value, attr, id->insn_code);
2210 ie = (struct insn_ent *) oballoc (sizeof (struct insn_ent));
2211 ie->insn_code = id->insn_code;
2212 ie->insn_index = id->insn_code;
2213 insert_insn_ent (av, ie);
2217 /* Given an expression EXP, see if it is a COND or IF_THEN_ELSE that has a
2218 test that checks relative positions of insns (uses MATCH_DUP or PC).
2219 If so, replace it with what is obtained by passing the expression to
2220 ADDRESS_FN. If not but it is a COND or IF_THEN_ELSE, call this routine
2221 recursively on each value (including the default value). Otherwise,
2222 return the value returned by NO_ADDRESS_FN applied to EXP. */
2225 substitute_address (exp, no_address_fn, address_fn)
2227 rtx (*no_address_fn) ();
2228 rtx (*address_fn) ();
2233 if (GET_CODE (exp) == COND)
2235 /* See if any tests use addresses. */
2237 for (i = 0; i < XVECLEN (exp, 0); i += 2)
2238 walk_attr_value (XVECEXP (exp, 0, i));
2241 return (*address_fn) (exp);
2243 /* Make a new copy of this COND, replacing each element. */
2244 newexp = rtx_alloc (COND);
2245 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (exp, 0));
2246 for (i = 0; i < XVECLEN (exp, 0); i += 2)
2248 XVECEXP (newexp, 0, i) = XVECEXP (exp, 0, i);
2249 XVECEXP (newexp, 0, i + 1)
2250 = substitute_address (XVECEXP (exp, 0, i + 1),
2251 no_address_fn, address_fn);
2254 XEXP (newexp, 1) = substitute_address (XEXP (exp, 1),
2255 no_address_fn, address_fn);
2260 else if (GET_CODE (exp) == IF_THEN_ELSE)
2263 walk_attr_value (XEXP (exp, 0));
2265 return (*address_fn) (exp);
2267 return attr_rtx (IF_THEN_ELSE,
2268 substitute_address (XEXP (exp, 0),
2269 no_address_fn, address_fn),
2270 substitute_address (XEXP (exp, 1),
2271 no_address_fn, address_fn),
2272 substitute_address (XEXP (exp, 2),
2273 no_address_fn, address_fn));
2276 return (*no_address_fn) (exp);
2279 /* Make new attributes from the `length' attribute. The following are made,
2280 each corresponding to a function called from `shorten_branches' or
2283 *insn_default_length This is the length of the insn to be returned
2284 by `get_attr_length' before `shorten_branches'
2285 has been called. In each case where the length
2286 depends on relative addresses, the largest
2287 possible is used. This routine is also used
2288 to compute the initial size of the insn.
2290 *insn_variable_length_p This returns 1 if the insn's length depends
2291 on relative addresses, zero otherwise.
2293 *insn_current_length This is only called when it is known that the
2294 insn has a variable length and returns the
2295 current length, based on relative addresses.
2299 make_length_attrs ()
2301 static char *new_names[] = {"*insn_default_length",
2302 "*insn_variable_length_p",
2303 "*insn_current_length"};
2304 static rtx (*no_address_fn[]) PROTO((rtx)) = {identity_fn, zero_fn, zero_fn};
2305 static rtx (*address_fn[]) PROTO((rtx)) = {max_fn, one_fn, identity_fn};
2307 struct attr_desc *length_attr, *new_attr;
2308 struct attr_value *av, *new_av;
2309 struct insn_ent *ie, *new_ie;
2311 /* See if length attribute is defined. If so, it must be numeric. Make
2312 it special so we don't output anything for it. */
2313 length_attr = find_attr ("length", 0);
2314 if (length_attr == 0)
2317 if (! length_attr->is_numeric)
2318 fatal ("length attribute must be numeric.");
2320 length_attr->is_const = 0;
2321 length_attr->is_special = 1;
2323 /* Make each new attribute, in turn. */
2324 for (i = 0; i < sizeof new_names / sizeof new_names[0]; i++)
2326 make_internal_attr (new_names[i],
2327 substitute_address (length_attr->default_val->value,
2328 no_address_fn[i], address_fn[i]),
2330 new_attr = find_attr (new_names[i], 0);
2331 for (av = length_attr->first_value; av; av = av->next)
2332 for (ie = av->first_insn; ie; ie = ie->next)
2334 new_av = get_attr_value (substitute_address (av->value,
2337 new_attr, ie->insn_code);
2338 new_ie = (struct insn_ent *) oballoc (sizeof (struct insn_ent));
2339 new_ie->insn_code = ie->insn_code;
2340 new_ie->insn_index = ie->insn_index;
2341 insert_insn_ent (new_av, new_ie);
2346 /* Utility functions called from above routine. */
2359 return make_numeric_value (0);
2366 return make_numeric_value (1);
2373 return make_numeric_value (max_attr_value (exp));
2376 /* Take a COND expression and see if any of the conditions in it can be
2377 simplified. If any are known true or known false for the particular insn
2378 code, the COND can be further simplified.
2380 Also call ourselves on any COND operations that are values of this COND.
2382 We do not modify EXP; rather, we make and return a new rtx. */
2385 simplify_cond (exp, insn_code, insn_index)
2387 int insn_code, insn_index;
2390 /* We store the desired contents here,
2391 then build a new expression if they don't match EXP. */
2392 rtx defval = XEXP (exp, 1);
2393 rtx new_defval = XEXP (exp, 1);
2395 int len = XVECLEN (exp, 0);
2396 rtx *tests = (rtx *) alloca (len * sizeof (rtx));
2400 /* This lets us free all storage allocated below, if appropriate. */
2401 first_spacer = (char *) obstack_finish (rtl_obstack);
2403 bcopy (&XVECEXP (exp, 0, 0), tests, len * sizeof (rtx));
2405 /* See if default value needs simplification. */
2406 if (GET_CODE (defval) == COND)
2407 new_defval = simplify_cond (defval, insn_code, insn_index);
2409 /* Simplify the subexpressions, and see what tests we can get rid of. */
2411 for (i = 0; i < len; i += 2)
2413 rtx newtest, newval;
2415 /* Simplify this test. */
2416 newtest = SIMPLIFY_TEST_EXP (tests[i], insn_code, insn_index);
2419 newval = tests[i + 1];
2420 /* See if this value may need simplification. */
2421 if (GET_CODE (newval) == COND)
2422 newval = simplify_cond (newval, insn_code, insn_index);
2424 /* Look for ways to delete or combine this test. */
2425 if (newtest == true_rtx)
2427 /* If test is true, make this value the default
2428 and discard this + any following tests. */
2430 defval = tests[i + 1];
2431 new_defval = newval;
2434 else if (newtest == false_rtx)
2436 /* If test is false, discard it and its value. */
2437 for (j = i; j < len - 2; j++)
2438 tests[j] = tests[j + 2];
2442 else if (i > 0 && attr_equal_p (newval, tests[i - 1]))
2444 /* If this value and the value for the prev test are the same,
2448 = insert_right_side (IOR, tests[i - 2], newtest,
2449 insn_code, insn_index);
2451 /* Delete this test/value. */
2452 for (j = i; j < len - 2; j++)
2453 tests[j] = tests[j + 2];
2458 tests[i + 1] = newval;
2461 /* If the last test in a COND has the same value
2462 as the default value, that test isn't needed. */
2464 while (len > 0 && attr_equal_p (tests[len - 1], new_defval))
2467 /* See if we changed anything. */
2468 if (len != XVECLEN (exp, 0) || new_defval != XEXP (exp, 1))
2471 for (i = 0; i < len; i++)
2472 if (! attr_equal_p (tests[i], XVECEXP (exp, 0, i)))
2480 obstack_free (rtl_obstack, first_spacer);
2481 if (GET_CODE (defval) == COND)
2482 return simplify_cond (defval, insn_code, insn_index);
2487 obstack_free (rtl_obstack, first_spacer);
2492 rtx newexp = rtx_alloc (COND);
2494 XVEC (newexp, 0) = rtvec_alloc (len);
2495 bcopy (tests, &XVECEXP (newexp, 0, 0), len * sizeof (rtx));
2496 XEXP (newexp, 1) = new_defval;
2501 /* Remove an insn entry from an attribute value. */
2504 remove_insn_ent (av, ie)
2505 struct attr_value *av;
2506 struct insn_ent *ie;
2508 struct insn_ent *previe;
2510 if (av->first_insn == ie)
2511 av->first_insn = ie->next;
2514 for (previe = av->first_insn; previe->next != ie; previe = previe->next)
2516 previe->next = ie->next;
2520 if (ie->insn_code == -1)
2521 av->has_asm_insn = 0;
2524 /* Insert an insn entry in an attribute value list. */
2527 insert_insn_ent (av, ie)
2528 struct attr_value *av;
2529 struct insn_ent *ie;
2531 ie->next = av->first_insn;
2532 av->first_insn = ie;
2534 if (ie->insn_code == -1)
2535 av->has_asm_insn = 1;
2538 /* This is a utility routine to take an expression that is a tree of either
2539 AND or IOR expressions and insert a new term. The new term will be
2540 inserted at the right side of the first node whose code does not match
2541 the root. A new node will be created with the root's code. Its left
2542 side will be the old right side and its right side will be the new
2545 If the `term' is itself a tree, all its leaves will be inserted. */
2548 insert_right_side (code, exp, term, insn_code, insn_index)
2552 int insn_code, insn_index;
2556 /* Avoid consing in some special cases. */
2557 if (code == AND && term == true_rtx)
2559 if (code == AND && term == false_rtx)
2561 if (code == AND && exp == true_rtx)
2563 if (code == AND && exp == false_rtx)
2565 if (code == IOR && term == true_rtx)
2567 if (code == IOR && term == false_rtx)
2569 if (code == IOR && exp == true_rtx)
2571 if (code == IOR && exp == false_rtx)
2573 if (attr_equal_p (exp, term))
2576 if (GET_CODE (term) == code)
2578 exp = insert_right_side (code, exp, XEXP (term, 0),
2579 insn_code, insn_index);
2580 exp = insert_right_side (code, exp, XEXP (term, 1),
2581 insn_code, insn_index);
2586 if (GET_CODE (exp) == code)
2588 rtx new = insert_right_side (code, XEXP (exp, 1),
2589 term, insn_code, insn_index);
2590 if (new != XEXP (exp, 1))
2591 /* Make a copy of this expression and call recursively. */
2592 newexp = attr_rtx (code, XEXP (exp, 0), new);
2598 /* Insert the new term. */
2599 newexp = attr_rtx (code, exp, term);
2602 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2605 /* If we have an expression which AND's a bunch of
2606 (not (eq_attrq "alternative" "n"))
2607 terms, we may have covered all or all but one of the possible alternatives.
2608 If so, we can optimize. Similarly for IOR's of EQ_ATTR.
2610 This routine is passed an expression and either AND or IOR. It returns a
2611 bitmask indicating which alternatives are mentioned within EXP. */
2614 compute_alternative_mask (exp, code)
2619 if (GET_CODE (exp) == code)
2620 return compute_alternative_mask (XEXP (exp, 0), code)
2621 | compute_alternative_mask (XEXP (exp, 1), code);
2623 else if (code == AND && GET_CODE (exp) == NOT
2624 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
2625 && XSTR (XEXP (exp, 0), 0) == alternative_name)
2626 string = XSTR (XEXP (exp, 0), 1);
2628 else if (code == IOR && GET_CODE (exp) == EQ_ATTR
2629 && XSTR (exp, 0) == alternative_name)
2630 string = XSTR (exp, 1);
2636 return 1 << (string[0] - '0');
2637 return 1 << atoi (string);
2640 /* Given I, a single-bit mask, return RTX to compare the `alternative'
2641 attribute with the value represented by that bit. */
2644 make_alternative_compare (mask)
2651 for (i = 0; (mask & (1 << i)) == 0; i++)
2654 newexp = attr_rtx (EQ_ATTR, alternative_name, attr_numeral (i));
2655 RTX_UNCHANGING_P (newexp) = 1;
2660 /* If we are processing an (eq_attr "attr" "value") test, we find the value
2661 of "attr" for this insn code. From that value, we can compute a test
2662 showing when the EQ_ATTR will be true. This routine performs that
2663 computation. If a test condition involves an address, we leave the EQ_ATTR
2664 intact because addresses are only valid for the `length' attribute.
2666 EXP is the EQ_ATTR expression and VALUE is the value of that attribute
2667 for the insn corresponding to INSN_CODE and INSN_INDEX. */
2670 evaluate_eq_attr (exp, value, insn_code, insn_index)
2673 int insn_code, insn_index;
2680 if (GET_CODE (value) == CONST_STRING)
2682 if (! strcmp (XSTR (value, 0), XSTR (exp, 1)))
2687 else if (GET_CODE (value) == COND)
2689 /* We construct an IOR of all the cases for which the requested attribute
2690 value is present. Since we start with FALSE, if it is not present,
2691 FALSE will be returned.
2693 Each case is the AND of the NOT's of the previous conditions with the
2694 current condition; in the default case the current condition is TRUE.
2696 For each possible COND value, call ourselves recursively.
2698 The extra TRUE and FALSE expressions will be eliminated by another
2699 call to the simplification routine. */
2704 if (current_alternative_string)
2705 clear_struct_flag (value);
2707 for (i = 0; i < XVECLEN (value, 0); i += 2)
2709 rtx this = SIMPLIFY_TEST_EXP (XVECEXP (value, 0, i),
2710 insn_code, insn_index);
2712 SIMPLIFY_ALTERNATIVE (this);
2714 right = insert_right_side (AND, andexp, this,
2715 insn_code, insn_index);
2716 right = insert_right_side (AND, right,
2717 evaluate_eq_attr (exp,
2720 insn_code, insn_index),
2721 insn_code, insn_index);
2722 orexp = insert_right_side (IOR, orexp, right,
2723 insn_code, insn_index);
2725 /* Add this condition into the AND expression. */
2726 newexp = attr_rtx (NOT, this);
2727 andexp = insert_right_side (AND, andexp, newexp,
2728 insn_code, insn_index);
2731 /* Handle the default case. */
2732 right = insert_right_side (AND, andexp,
2733 evaluate_eq_attr (exp, XEXP (value, 1),
2734 insn_code, insn_index),
2735 insn_code, insn_index);
2736 newexp = insert_right_side (IOR, orexp, right, insn_code, insn_index);
2741 /* If uses an address, must return original expression. But set the
2742 RTX_UNCHANGING_P bit so we don't try to simplify it again. */
2745 walk_attr_value (newexp);
2749 /* This had `&& current_alternative_string', which seems to be wrong. */
2750 if (! RTX_UNCHANGING_P (exp))
2751 return copy_rtx_unchanging (exp);
2758 /* This routine is called when an AND of a term with a tree of AND's is
2759 encountered. If the term or its complement is present in the tree, it
2760 can be replaced with TRUE or FALSE, respectively.
2762 Note that (eq_attr "att" "v1") and (eq_attr "att" "v2") cannot both
2763 be true and hence are complementary.
2765 There is one special case: If we see
2766 (and (not (eq_attr "att" "v1"))
2767 (eq_attr "att" "v2"))
2768 this can be replaced by (eq_attr "att" "v2"). To do this we need to
2769 replace the term, not anything in the AND tree. So we pass a pointer to
2773 simplify_and_tree (exp, pterm, insn_code, insn_index)
2776 int insn_code, insn_index;
2781 int left_eliminates_term, right_eliminates_term;
2783 if (GET_CODE (exp) == AND)
2785 left = simplify_and_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
2786 right = simplify_and_tree (XEXP (exp, 1), pterm, insn_code, insn_index);
2787 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2789 newexp = attr_rtx (GET_CODE (exp), left, right);
2791 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2795 else if (GET_CODE (exp) == IOR)
2797 /* For the IOR case, we do the same as above, except that we can
2798 only eliminate `term' if both sides of the IOR would do so. */
2800 left = simplify_and_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
2801 left_eliminates_term = (temp == true_rtx);
2804 right = simplify_and_tree (XEXP (exp, 1), &temp, insn_code, insn_index);
2805 right_eliminates_term = (temp == true_rtx);
2807 if (left_eliminates_term && right_eliminates_term)
2810 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2812 newexp = attr_rtx (GET_CODE (exp), left, right);
2814 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2818 /* Check for simplifications. Do some extra checking here since this
2819 routine is called so many times. */
2824 else if (GET_CODE (exp) == NOT && XEXP (exp, 0) == *pterm)
2827 else if (GET_CODE (*pterm) == NOT && exp == XEXP (*pterm, 0))
2830 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == EQ_ATTR)
2832 if (XSTR (exp, 0) != XSTR (*pterm, 0))
2835 if (! strcmp (XSTR (exp, 1), XSTR (*pterm, 1)))
2841 else if (GET_CODE (*pterm) == EQ_ATTR && GET_CODE (exp) == NOT
2842 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR)
2844 if (XSTR (*pterm, 0) != XSTR (XEXP (exp, 0), 0))
2847 if (! strcmp (XSTR (*pterm, 1), XSTR (XEXP (exp, 0), 1)))
2853 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == NOT
2854 && GET_CODE (XEXP (*pterm, 0)) == EQ_ATTR)
2856 if (XSTR (exp, 0) != XSTR (XEXP (*pterm, 0), 0))
2859 if (! strcmp (XSTR (exp, 1), XSTR (XEXP (*pterm, 0), 1)))
2865 else if (GET_CODE (exp) == NOT && GET_CODE (*pterm) == NOT)
2867 if (attr_equal_p (XEXP (exp, 0), XEXP (*pterm, 0)))
2871 else if (GET_CODE (exp) == NOT)
2873 if (attr_equal_p (XEXP (exp, 0), *pterm))
2877 else if (GET_CODE (*pterm) == NOT)
2879 if (attr_equal_p (XEXP (*pterm, 0), exp))
2883 else if (attr_equal_p (exp, *pterm))
2889 /* Similar to `simplify_and_tree', but for IOR trees. */
2892 simplify_or_tree (exp, pterm, insn_code, insn_index)
2895 int insn_code, insn_index;
2900 int left_eliminates_term, right_eliminates_term;
2902 if (GET_CODE (exp) == IOR)
2904 left = simplify_or_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
2905 right = simplify_or_tree (XEXP (exp, 1), pterm, insn_code, insn_index);
2906 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2908 newexp = attr_rtx (GET_CODE (exp), left, right);
2910 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2914 else if (GET_CODE (exp) == AND)
2916 /* For the AND case, we do the same as above, except that we can
2917 only eliminate `term' if both sides of the AND would do so. */
2919 left = simplify_or_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
2920 left_eliminates_term = (temp == false_rtx);
2923 right = simplify_or_tree (XEXP (exp, 1), &temp, insn_code, insn_index);
2924 right_eliminates_term = (temp == false_rtx);
2926 if (left_eliminates_term && right_eliminates_term)
2929 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2931 newexp = attr_rtx (GET_CODE (exp), left, right);
2933 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2937 if (attr_equal_p (exp, *pterm))
2940 else if (GET_CODE (exp) == NOT && attr_equal_p (XEXP (exp, 0), *pterm))
2943 else if (GET_CODE (*pterm) == NOT && attr_equal_p (XEXP (*pterm, 0), exp))
2946 else if (GET_CODE (*pterm) == EQ_ATTR && GET_CODE (exp) == NOT
2947 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
2948 && XSTR (*pterm, 0) == XSTR (XEXP (exp, 0), 0))
2951 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == NOT
2952 && GET_CODE (XEXP (*pterm, 0)) == EQ_ATTR
2953 && XSTR (exp, 0) == XSTR (XEXP (*pterm, 0), 0))
2959 /* Given an expression, see if it can be simplified for a particular insn
2960 code based on the values of other attributes being tested. This can
2961 eliminate nested get_attr_... calls.
2963 Note that if an endless recursion is specified in the patterns, the
2964 optimization will loop. However, it will do so in precisely the cases where
2965 an infinite recursion loop could occur during compilation. It's better that
2969 simplify_test_exp (exp, insn_code, insn_index)
2971 int insn_code, insn_index;
2974 struct attr_desc *attr;
2975 struct attr_value *av;
2976 struct insn_ent *ie;
2979 char *spacer = (char *) obstack_finish (rtl_obstack);
2981 static rtx loser = 0;
2982 static int count = 0;
2983 static stopcount = 0;
2988 if (count == stopcount)
2991 /* Don't re-simplify something we already simplified. */
2992 if (RTX_UNCHANGING_P (exp) || MEM_IN_STRUCT_P (exp))
2995 switch (GET_CODE (exp))
2998 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
2999 SIMPLIFY_ALTERNATIVE (left);
3000 if (left == false_rtx)
3002 obstack_free (rtl_obstack, spacer);
3005 right = SIMPLIFY_TEST_EXP (XEXP (exp, 1), insn_code, insn_index);
3006 SIMPLIFY_ALTERNATIVE (right);
3007 if (left == false_rtx)
3009 obstack_free (rtl_obstack, spacer);
3013 /* If either side is an IOR and we have (eq_attr "alternative" ..")
3014 present on both sides, apply the distributive law since this will
3015 yield simplifications. */
3016 if ((GET_CODE (left) == IOR || GET_CODE (right) == IOR)
3017 && compute_alternative_mask (left, IOR)
3018 && compute_alternative_mask (right, IOR))
3020 if (GET_CODE (left) == IOR)
3027 newexp = attr_rtx (IOR,
3028 attr_rtx (AND, left, XEXP (right, 0)),
3029 attr_rtx (AND, left, XEXP (right, 1)));
3031 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3034 /* Try with the term on both sides. */
3035 right = simplify_and_tree (right, &left, insn_code, insn_index);
3036 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
3037 left = simplify_and_tree (left, &right, insn_code, insn_index);
3039 if (left == false_rtx || right == false_rtx)
3041 obstack_free (rtl_obstack, spacer);
3044 else if (left == true_rtx)
3048 else if (right == true_rtx)
3052 /* See if all or all but one of the insn's alternatives are specified
3053 in this tree. Optimize if so. */
3055 else if (insn_code >= 0
3056 && (GET_CODE (left) == AND
3057 || (GET_CODE (left) == NOT
3058 && GET_CODE (XEXP (left, 0)) == EQ_ATTR
3059 && XSTR (XEXP (left, 0), 0) == alternative_name)
3060 || GET_CODE (right) == AND
3061 || (GET_CODE (right) == NOT
3062 && GET_CODE (XEXP (right, 0)) == EQ_ATTR
3063 && XSTR (XEXP (right, 0), 0) == alternative_name)))
3065 i = compute_alternative_mask (exp, AND);
3066 if (i & ~insn_alternatives[insn_code])
3067 fatal ("Illegal alternative specified for pattern number %d",
3070 /* If all alternatives are excluded, this is false. */
3071 i ^= insn_alternatives[insn_code];
3074 else if ((i & (i - 1)) == 0 && insn_alternatives[insn_code] > 1)
3076 /* If just one excluded, AND a comparison with that one to the
3077 front of the tree. The others will be eliminated by
3078 optimization. We do not want to do this if the insn has one
3079 alternative and we have tested none of them! */
3080 left = make_alternative_compare (i);
3081 right = simplify_and_tree (exp, &left, insn_code, insn_index);
3082 newexp = attr_rtx (AND, left, right);
3084 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3088 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3090 newexp = attr_rtx (AND, left, right);
3091 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3096 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3097 SIMPLIFY_ALTERNATIVE (left);
3098 if (left == true_rtx)
3100 obstack_free (rtl_obstack, spacer);
3103 right = SIMPLIFY_TEST_EXP (XEXP (exp, 1), insn_code, insn_index);
3104 SIMPLIFY_ALTERNATIVE (right);
3105 if (right == true_rtx)
3107 obstack_free (rtl_obstack, spacer);
3111 right = simplify_or_tree (right, &left, insn_code, insn_index);
3112 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
3113 left = simplify_or_tree (left, &right, insn_code, insn_index);
3115 if (right == true_rtx || left == true_rtx)
3117 obstack_free (rtl_obstack, spacer);
3120 else if (left == false_rtx)
3124 else if (right == false_rtx)
3129 /* Test for simple cases where the distributive law is useful. I.e.,
3130 convert (ior (and (x) (y))
3136 else if (GET_CODE (left) == AND && GET_CODE (right) == AND
3137 && attr_equal_p (XEXP (left, 0), XEXP (right, 0)))
3139 newexp = attr_rtx (IOR, XEXP (left, 1), XEXP (right, 1));
3141 left = XEXP (left, 0);
3143 newexp = attr_rtx (AND, left, right);
3144 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3147 /* See if all or all but one of the insn's alternatives are specified
3148 in this tree. Optimize if so. */
3150 else if (insn_code >= 0
3151 && (GET_CODE (left) == IOR
3152 || (GET_CODE (left) == EQ_ATTR
3153 && XSTR (left, 0) == alternative_name)
3154 || GET_CODE (right) == IOR
3155 || (GET_CODE (right) == EQ_ATTR
3156 && XSTR (right, 0) == alternative_name)))
3158 i = compute_alternative_mask (exp, IOR);
3159 if (i & ~insn_alternatives[insn_code])
3160 fatal ("Illegal alternative specified for pattern number %d",
3163 /* If all alternatives are included, this is true. */
3164 i ^= insn_alternatives[insn_code];
3167 else if ((i & (i - 1)) == 0 && insn_alternatives[insn_code] > 1)
3169 /* If just one excluded, IOR a comparison with that one to the
3170 front of the tree. The others will be eliminated by
3171 optimization. We do not want to do this if the insn has one
3172 alternative and we have tested none of them! */
3173 left = make_alternative_compare (i);
3174 right = simplify_and_tree (exp, &left, insn_code, insn_index);
3175 newexp = attr_rtx (IOR, attr_rtx (NOT, left), right);
3177 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3181 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3183 newexp = attr_rtx (IOR, left, right);
3184 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3189 if (GET_CODE (XEXP (exp, 0)) == NOT)
3191 left = SIMPLIFY_TEST_EXP (XEXP (XEXP (exp, 0), 0),
3192 insn_code, insn_index);
3193 SIMPLIFY_ALTERNATIVE (left);
3197 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3198 SIMPLIFY_ALTERNATIVE (left);
3199 if (GET_CODE (left) == NOT)
3200 return XEXP (left, 0);
3202 if (left == false_rtx)
3204 obstack_free (rtl_obstack, spacer);
3207 else if (left == true_rtx)
3209 obstack_free (rtl_obstack, spacer);
3213 /* Try to apply De`Morgan's laws. */
3214 else if (GET_CODE (left) == IOR)
3216 newexp = attr_rtx (AND,
3217 attr_rtx (NOT, XEXP (left, 0)),
3218 attr_rtx (NOT, XEXP (left, 1)));
3220 newexp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3222 else if (GET_CODE (left) == AND)
3224 newexp = attr_rtx (IOR,
3225 attr_rtx (NOT, XEXP (left, 0)),
3226 attr_rtx (NOT, XEXP (left, 1)));
3228 newexp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3230 else if (left != XEXP (exp, 0))
3232 newexp = attr_rtx (NOT, left);
3237 if (current_alternative_string && XSTR (exp, 0) == alternative_name)
3238 return (XSTR (exp, 1) == current_alternative_string
3239 ? true_rtx : false_rtx);
3241 /* Look at the value for this insn code in the specified attribute.
3242 We normally can replace this comparison with the condition that
3243 would give this insn the values being tested for. */
3244 if (XSTR (exp, 0) != alternative_name
3245 && (attr = find_attr (XSTR (exp, 0), 0)) != NULL)
3246 for (av = attr->first_value; av; av = av->next)
3247 for (ie = av->first_insn; ie; ie = ie->next)
3248 if (ie->insn_code == insn_code)
3249 return evaluate_eq_attr (exp, av->value, insn_code, insn_index);
3252 /* We have already simplified this expression. Simplifying it again
3253 won't buy anything unless we weren't given a valid insn code
3254 to process (i.e., we are canonicalizing something.). */
3255 if (insn_code != -2 /* Seems wrong: && current_alternative_string. */
3256 && ! RTX_UNCHANGING_P (newexp))
3257 return copy_rtx_unchanging (newexp);
3265 /* Optimize the attribute lists by seeing if we can determine conditional
3266 values from the known values of other attributes. This will save subroutine
3267 calls during the compilation. */
3272 struct attr_desc *attr;
3273 struct attr_value *av;
3274 struct insn_ent *ie;
3276 int something_changed = 1;
3278 struct attr_value_list { struct attr_value *av;
3279 struct insn_ent *ie;
3280 struct attr_desc * attr;
3281 struct attr_value_list *next; };
3282 struct attr_value_list **insn_code_values;
3283 struct attr_value_list *iv;
3285 /* For each insn code, make a list of all the insn_ent's for it,
3286 for all values for all attributes. */
3288 /* Make 2 extra elements, for "code" values -2 and -1. */
3290 = (struct attr_value_list **) alloca ((insn_code_number + 2)
3291 * sizeof (struct attr_value_list *));
3292 bzero (insn_code_values,
3293 (insn_code_number + 2) * sizeof (struct attr_value_list *));
3294 /* Offset the table address so we can index by -2 or -1. */
3295 insn_code_values += 2;
3297 for (i = 0; i < MAX_ATTRS_INDEX; i++)
3298 for (attr = attrs[i]; attr; attr = attr->next)
3299 for (av = attr->first_value; av; av = av->next)
3300 for (ie = av->first_insn; ie; ie = ie->next)
3302 iv = ((struct attr_value_list *)
3303 alloca (sizeof (struct attr_value_list)));
3307 iv->next = insn_code_values[ie->insn_code];
3308 insn_code_values[ie->insn_code] = iv;
3311 /* Process one insn code at a time. */
3312 for (i = -2; i < insn_code_number; i++)
3314 /* Clear the MEM_IN_STRUCT_P flag everywhere relevant.
3315 We use it to mean "already simplified for this insn". */
3316 for (iv = insn_code_values[i]; iv; iv = iv->next)
3317 clear_struct_flag (iv->av->value);
3319 /* Loop until nothing changes for one iteration. */
3320 something_changed = 1;
3321 while (something_changed)
3323 something_changed = 0;
3324 for (iv = insn_code_values[i]; iv; iv = iv->next)
3326 struct obstack *old = rtl_obstack;
3327 char *spacer = (char *) obstack_finish (temp_obstack);
3332 if (GET_CODE (av->value) != COND)
3335 rtl_obstack = temp_obstack;
3336 #if 0 /* This was intended as a speed up, but it was slower. */
3337 if (insn_n_alternatives[ie->insn_code] > 6
3338 && count_sub_rtxs (av->value, 200) >= 200)
3339 newexp = simplify_by_alternatives (av->value, ie->insn_code,
3343 newexp = simplify_cond (av->value, ie->insn_code,
3347 if (newexp != av->value)
3349 newexp = attr_copy_rtx (newexp);
3350 remove_insn_ent (av, ie);
3351 av = get_attr_value (newexp, attr, ie->insn_code);
3353 insert_insn_ent (av, ie);
3354 something_changed = 1;
3356 obstack_free (temp_obstack, spacer);
3364 simplify_by_alternatives (exp, insn_code, insn_index)
3366 int insn_code, insn_index;
3369 int len = insn_n_alternatives[insn_code];
3370 rtx newexp = rtx_alloc (COND);
3374 XVEC (newexp, 0) = rtvec_alloc (len * 2);
3376 /* It will not matter what value we use as the default value
3377 of the new COND, since that default will never be used.
3378 Choose something of the right type. */
3379 for (ultimate = exp; GET_CODE (ultimate) == COND;)
3380 ultimate = XEXP (ultimate, 1);
3381 XEXP (newexp, 1) = ultimate;
3383 for (i = 0; i < insn_n_alternatives[insn_code]; i++)
3385 current_alternative_string = attr_numeral (i);
3386 XVECEXP (newexp, 0, i * 2) = make_alternative_compare (1 << i);
3387 XVECEXP (newexp, 0, i * 2 + 1)
3388 = simplify_cond (exp, insn_code, insn_index);
3391 current_alternative_string = 0;
3392 return simplify_cond (newexp, insn_code, insn_index);
3396 /* If EXP is a suitable expression, reorganize it by constructing an
3397 equivalent expression that is a COND with the tests being all combinations
3398 of attribute values and the values being simple constants. */
3401 simplify_by_exploding (exp)
3404 rtx list = 0, link, condexp, defval;
3405 struct dimension *space;
3406 rtx *condtest, *condval;
3407 int i, j, total, ndim = 0;
3408 int most_tests, num_marks, new_marks;
3410 /* Locate all the EQ_ATTR expressions. */
3411 if (! find_and_mark_used_attributes (exp, &list, &ndim) || ndim == 0)
3413 unmark_used_attributes (list, 0, 0);
3417 /* Create an attribute space from the list of used attributes. For each
3418 dimension in the attribute space, record the attribute, list of values
3419 used, and number of values used. Add members to the list of values to
3420 cover the domain of the attribute. This makes the expanded COND form
3421 order independent. */
3423 space = (struct dimension *) alloca (ndim * sizeof (struct dimension));
3426 for (ndim = 0; list; ndim++)
3428 /* Pull the first attribute value from the list and record that
3429 attribute as another dimension in the attribute space. */
3430 char *name = XSTR (XEXP (list, 0), 0);
3433 if ((space[ndim].attr = find_attr (name, 0)) == 0
3434 || space[ndim].attr->is_numeric)
3436 unmark_used_attributes (list, space, ndim);
3440 /* Add all remaining attribute values that refer to this attribute. */
3441 space[ndim].num_values = 0;
3442 space[ndim].values = 0;
3444 for (link = list; link; link = *prev)
3445 if (! strcmp (XSTR (XEXP (link, 0), 0), name))
3447 space[ndim].num_values++;
3448 *prev = XEXP (link, 1);
3449 XEXP (link, 1) = space[ndim].values;
3450 space[ndim].values = link;
3453 prev = &XEXP (link, 1);
3455 /* Add sufficient members to the list of values to make the list
3456 mutually exclusive and record the total size of the attribute
3458 total *= add_values_to_cover (&space[ndim]);
3461 /* Sort the attribute space so that the attributes go from non-constant
3462 to constant and from most values to least values. */
3463 for (i = 0; i < ndim; i++)
3464 for (j = ndim - 1; j > i; j--)
3465 if ((space[j-1].attr->is_const && !space[j].attr->is_const)
3466 || space[j-1].num_values < space[j].num_values)
3468 struct dimension tmp;
3470 space[j] = space[j-1];
3474 /* Establish the initial current value. */
3475 for (i = 0; i < ndim; i++)
3476 space[i].current_value = space[i].values;
3478 condtest = (rtx *) alloca (total * sizeof (rtx));
3479 condval = (rtx *) alloca (total * sizeof (rtx));
3481 /* Expand the tests and values by iterating over all values in the
3485 condtest[i] = test_for_current_value (space, ndim);
3486 condval[i] = simplify_with_current_value (exp, space, ndim);
3487 if (! increment_current_value (space, ndim))
3493 /* We are now finished with the original expression. */
3494 unmark_used_attributes (0, space, ndim);
3496 /* Find the most used constant value and make that the default. */
3498 for (i = num_marks = 0; i < total; i++)
3499 if (GET_CODE (condval[i]) == CONST_STRING
3500 && ! MEM_VOLATILE_P (condval[i]))
3502 /* Mark the unmarked constant value and count how many are marked. */
3503 MEM_VOLATILE_P (condval[i]) = 1;
3504 for (j = new_marks = 0; j < total; j++)
3505 if (GET_CODE (condval[j]) == CONST_STRING
3506 && MEM_VOLATILE_P (condval[j]))
3508 if (new_marks - num_marks > most_tests)
3510 most_tests = new_marks - num_marks;
3511 defval = condval[i];
3513 num_marks = new_marks;
3515 /* Clear all the marks. */
3516 for (i = 0; i < total; i++)
3517 MEM_VOLATILE_P (condval[i]) = 0;
3519 /* Give up if nothing is constant. */
3523 /* If all values are the default, use that. */
3524 if (total == most_tests)
3527 /* Make a COND with the most common constant value the default. (A more
3528 complex method where tests with the same value were combined didn't
3529 seem to improve things.) */
3530 condexp = rtx_alloc (COND);
3531 XVEC (condexp, 0) = rtvec_alloc ((total - most_tests) * 2);
3532 XEXP (condexp, 1) = defval;
3533 for (i = j = 0; i < total; i++)
3534 if (condval[i] != defval)
3536 XVECEXP (condexp, 0, 2 * j) = condtest[i];
3537 XVECEXP (condexp, 0, 2 * j + 1) = condval[i];
3544 /* Set the MEM_VOLATILE_P flag for all EQ_ATTR expressions in EXP and
3545 verify that EXP can be simplified to a constant term if all the EQ_ATTR
3546 tests have known value. */
3549 find_and_mark_used_attributes (exp, terms, nterms)
3555 switch (GET_CODE (exp))
3558 if (! MEM_VOLATILE_P (exp))
3560 rtx link = rtx_alloc (EXPR_LIST);
3561 XEXP (link, 0) = exp;
3562 XEXP (link, 1) = *terms;
3565 MEM_VOLATILE_P (exp) = 1;
3571 if (! find_and_mark_used_attributes (XEXP (exp, 2), terms, nterms))
3575 if (! find_and_mark_used_attributes (XEXP (exp, 1), terms, nterms))
3578 if (! find_and_mark_used_attributes (XEXP (exp, 0), terms, nterms))
3583 for (i = 0; i < XVECLEN (exp, 0); i++)
3584 if (! find_and_mark_used_attributes (XVECEXP (exp, 0, i), terms, nterms))
3586 if (! find_and_mark_used_attributes (XEXP (exp, 1), terms, nterms))
3594 /* Clear the MEM_VOLATILE_P flag in all EQ_ATTR expressions on LIST and
3595 in the values of the NDIM-dimensional attribute space SPACE. */
3598 unmark_used_attributes (list, space, ndim)
3600 struct dimension *space;
3606 for (i = 0; i < ndim; i++)
3607 unmark_used_attributes (space[i].values, 0, 0);
3609 for (link = list; link; link = XEXP (link, 1))
3611 exp = XEXP (link, 0);
3612 if (GET_CODE (exp) == EQ_ATTR)
3613 MEM_VOLATILE_P (exp) = 0;
3617 /* Update the attribute dimension DIM so that all values of the attribute
3618 are tested. Return the updated number of values. */
3621 add_values_to_cover (dim)
3622 struct dimension *dim;
3624 struct attr_value *av;
3625 rtx exp, link, *prev;
3628 for (av = dim->attr->first_value; av; av = av->next)
3629 if (GET_CODE (av->value) == CONST_STRING)
3632 if (nalt < dim->num_values)
3634 else if (nalt == dim->num_values)
3636 else if (nalt * 2 < dim->num_values * 3)
3638 /* Most all the values of the attribute are used, so add all the unused
3640 prev = &dim->values;
3641 for (link = dim->values; link; link = *prev)
3642 prev = &XEXP (link, 1);
3644 for (av = dim->attr->first_value; av; av = av->next)
3645 if (GET_CODE (av->value) == CONST_STRING)
3647 exp = attr_eq (dim->attr->name, XSTR (av->value, 0));
3648 if (MEM_VOLATILE_P (exp))
3651 link = rtx_alloc (EXPR_LIST);
3652 XEXP (link, 0) = exp;
3655 prev = &XEXP (link, 1);
3657 dim->num_values = nalt;
3661 rtx orexp = false_rtx;
3663 /* Very few values are used, so compute a mutually exclusive
3664 expression. (We could do this for numeric values if that becomes
3666 prev = &dim->values;
3667 for (link = dim->values; link; link = *prev)
3669 orexp = insert_right_side (IOR, orexp, XEXP (link, 0), -2, -2);
3670 prev = &XEXP (link, 1);
3672 link = rtx_alloc (EXPR_LIST);
3673 XEXP (link, 0) = attr_rtx (NOT, orexp);
3678 return dim->num_values;
3681 /* Increment the current value for the NDIM-dimensional attribute space SPACE
3682 and return FALSE if the increment overflowed. */
3685 increment_current_value (space, ndim)
3686 struct dimension *space;
3691 for (i = ndim - 1; i >= 0; i--)
3693 if ((space[i].current_value = XEXP (space[i].current_value, 1)) == 0)
3694 space[i].current_value = space[i].values;
3701 /* Construct an expression corresponding to the current value for the
3702 NDIM-dimensional attribute space SPACE. */
3705 test_for_current_value (space, ndim)
3706 struct dimension *space;
3712 for (i = 0; i < ndim; i++)
3713 exp = insert_right_side (AND, exp, XEXP (space[i].current_value, 0),
3719 /* Given the current value of the NDIM-dimensional attribute space SPACE,
3720 set the corresponding EQ_ATTR expressions to that value and reduce
3721 the expression EXP as much as possible. On input [and output], all
3722 known EQ_ATTR expressions are set to FALSE. */
3725 simplify_with_current_value (exp, space, ndim)
3727 struct dimension *space;
3733 /* Mark each current value as TRUE. */
3734 for (i = 0; i < ndim; i++)
3736 x = XEXP (space[i].current_value, 0);
3737 if (GET_CODE (x) == EQ_ATTR)
3738 MEM_VOLATILE_P (x) = 0;
3741 exp = simplify_with_current_value_aux (exp);
3743 /* Change each current value back to FALSE. */
3744 for (i = 0; i < ndim; i++)
3746 x = XEXP (space[i].current_value, 0);
3747 if (GET_CODE (x) == EQ_ATTR)
3748 MEM_VOLATILE_P (x) = 1;
3754 /* Reduce the expression EXP based on the MEM_VOLATILE_P settings of
3755 all EQ_ATTR expressions. */
3758 simplify_with_current_value_aux (exp)
3764 switch (GET_CODE (exp))
3767 if (MEM_VOLATILE_P (exp))
3775 cond = simplify_with_current_value_aux (XEXP (exp, 0));
3776 if (cond == true_rtx)
3777 return simplify_with_current_value_aux (XEXP (exp, 1));
3778 else if (cond == false_rtx)
3779 return simplify_with_current_value_aux (XEXP (exp, 2));
3781 return attr_rtx (IF_THEN_ELSE, cond,
3782 simplify_with_current_value_aux (XEXP (exp, 1)),
3783 simplify_with_current_value_aux (XEXP (exp, 2)));
3786 cond = simplify_with_current_value_aux (XEXP (exp, 1));
3787 if (cond == true_rtx)
3789 else if (cond == false_rtx)
3790 return simplify_with_current_value_aux (XEXP (exp, 0));
3792 return attr_rtx (IOR, cond,
3793 simplify_with_current_value_aux (XEXP (exp, 0)));
3796 cond = simplify_with_current_value_aux (XEXP (exp, 1));
3797 if (cond == true_rtx)
3798 return simplify_with_current_value_aux (XEXP (exp, 0));
3799 else if (cond == false_rtx)
3802 return attr_rtx (AND, cond,
3803 simplify_with_current_value_aux (XEXP (exp, 0)));
3806 cond = simplify_with_current_value_aux (XEXP (exp, 0));
3807 if (cond == true_rtx)
3809 else if (cond == false_rtx)
3812 return attr_rtx (NOT, cond);
3815 for (i = 0; i < XVECLEN (exp, 0); i += 2)
3817 cond = simplify_with_current_value_aux (XVECEXP (exp, 0, i));
3818 if (cond == true_rtx)
3819 return simplify_with_current_value_aux (XVECEXP (exp, 0, i + 1));
3820 else if (cond == false_rtx)
3823 abort (); /* With all EQ_ATTR's of known value, a case should
3824 have been selected. */
3826 return simplify_with_current_value_aux (XEXP (exp, 1));
3831 /* Clear the MEM_IN_STRUCT_P flag in EXP and its subexpressions. */
3833 clear_struct_flag (x)
3838 register enum rtx_code code;
3841 MEM_IN_STRUCT_P (x) = 0;
3842 if (RTX_UNCHANGING_P (x))
3845 code = GET_CODE (x);
3861 /* Compare the elements. If any pair of corresponding elements
3862 fail to match, return 0 for the whole things. */
3864 fmt = GET_RTX_FORMAT (code);
3865 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3871 for (j = 0; j < XVECLEN (x, i); j++)
3872 clear_struct_flag (XVECEXP (x, i, j));
3876 clear_struct_flag (XEXP (x, i));
3882 /* Return the number of RTX objects making up the expression X.
3883 But if we count more more than MAX objects, stop counting. */
3885 count_sub_rtxs (x, max)
3891 register enum rtx_code code;
3895 code = GET_CODE (x);
3911 /* Compare the elements. If any pair of corresponding elements
3912 fail to match, return 0 for the whole things. */
3914 fmt = GET_RTX_FORMAT (code);
3915 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3924 for (j = 0; j < XVECLEN (x, i); j++)
3925 total += count_sub_rtxs (XVECEXP (x, i, j), max);
3929 total += count_sub_rtxs (XEXP (x, i), max);
3937 /* Create table entries for DEFINE_ATTR. */
3943 struct attr_desc *attr;
3944 struct attr_value *av;
3948 /* Make a new attribute structure. Check for duplicate by looking at
3949 attr->default_val, since it is initialized by this routine. */
3950 attr = find_attr (XSTR (exp, 0), 1);
3951 if (attr->default_val)
3952 fatal ("Duplicate definition for `%s' attribute", attr->name);
3954 if (*XSTR (exp, 1) == '\0')
3955 attr->is_numeric = 1;
3958 name_ptr = XSTR (exp, 1);
3959 while ((p = next_comma_elt (&name_ptr)) != NULL)
3961 av = (struct attr_value *) oballoc (sizeof (struct attr_value));
3962 av->value = attr_rtx (CONST_STRING, p);
3963 av->next = attr->first_value;
3964 attr->first_value = av;
3965 av->first_insn = NULL;
3967 av->has_asm_insn = 0;
3971 if (GET_CODE (XEXP (exp, 2)) == CONST)
3974 if (attr->is_numeric)
3975 fatal ("Constant attributes may not take numeric values");
3976 /* Get rid of the CONST node. It is allowed only at top-level. */
3977 XEXP (exp, 2) = XEXP (XEXP (exp, 2), 0);
3980 if (! strcmp (attr->name, "length") && ! attr->is_numeric)
3981 fatal ("`length' attribute must take numeric values");
3983 /* Set up the default value. */
3984 XEXP (exp, 2) = check_attr_value (XEXP (exp, 2), attr);
3985 attr->default_val = get_attr_value (XEXP (exp, 2), attr, -2);
3988 /* Given a pattern for DEFINE_PEEPHOLE or DEFINE_INSN, return the number of
3989 alternatives in the constraints. Assume all MATCH_OPERANDs have the same
3990 number of alternatives as this should be checked elsewhere. */
3993 count_alternatives (exp)
3999 if (GET_CODE (exp) == MATCH_OPERAND)
4000 return n_comma_elts (XSTR (exp, 2));
4002 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4003 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4008 n = count_alternatives (XEXP (exp, i));
4015 if (XVEC (exp, i) != NULL)
4016 for (j = 0; j < XVECLEN (exp, i); j++)
4018 n = count_alternatives (XVECEXP (exp, i, j));
4027 /* Returns non-zero if the given expression contains an EQ_ATTR with the
4028 `alternative' attribute. */
4031 compares_alternatives_p (exp)
4037 if (GET_CODE (exp) == EQ_ATTR && XSTR (exp, 0) == alternative_name)
4040 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4041 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4046 if (compares_alternatives_p (XEXP (exp, i)))
4051 for (j = 0; j < XVECLEN (exp, i); j++)
4052 if (compares_alternatives_p (XVECEXP (exp, i, j)))
4060 /* Returns non-zero is INNER is contained in EXP. */
4063 contained_in_p (inner, exp)
4070 if (rtx_equal_p (inner, exp))
4073 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4074 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4079 if (contained_in_p (inner, XEXP (exp, i)))
4084 for (j = 0; j < XVECLEN (exp, i); j++)
4085 if (contained_in_p (inner, XVECEXP (exp, i, j)))
4093 /* Process DEFINE_PEEPHOLE, DEFINE_INSN, and DEFINE_ASM_ATTRIBUTES. */
4099 struct insn_def *id;
4101 id = (struct insn_def *) oballoc (sizeof (struct insn_def));
4106 switch (GET_CODE (exp))
4109 id->insn_code = insn_code_number++;
4110 id->insn_index = insn_index_number++;
4111 id->num_alternatives = count_alternatives (exp);
4112 if (id->num_alternatives == 0)
4113 id->num_alternatives = 1;
4117 case DEFINE_PEEPHOLE:
4118 id->insn_code = insn_code_number++;
4119 id->insn_index = insn_index_number++;
4120 id->num_alternatives = count_alternatives (exp);
4121 if (id->num_alternatives == 0)
4122 id->num_alternatives = 1;
4126 case DEFINE_ASM_ATTRIBUTES:
4128 id->insn_index = -1;
4129 id->num_alternatives = 1;
4131 got_define_asm_attributes = 1;
4136 /* Process a DEFINE_DELAY. Validate the vector length, check if annul
4137 true or annul false is specified, and make a `struct delay_desc'. */
4143 struct delay_desc *delay;
4146 if (XVECLEN (def, 1) % 3 != 0)
4147 fatal ("Number of elements in DEFINE_DELAY must be multiple of three.");
4149 for (i = 0; i < XVECLEN (def, 1); i += 3)
4151 if (XVECEXP (def, 1, i + 1))
4152 have_annul_true = 1;
4153 if (XVECEXP (def, 1, i + 2))
4154 have_annul_false = 1;
4157 delay = (struct delay_desc *) oballoc (sizeof (struct delay_desc));
4159 delay->num = ++num_delays;
4160 delay->next = delays;
4164 /* Process a DEFINE_FUNCTION_UNIT.
4166 This gives information about a function unit contained in the CPU.
4167 We fill in a `struct function_unit_op' and a `struct function_unit'
4168 with information used later by `expand_unit'. */
4174 struct function_unit *unit;
4175 struct function_unit_op *op;
4176 char *name = XSTR (def, 0);
4177 int multiplicity = XINT (def, 1);
4178 int simultaneity = XINT (def, 2);
4179 rtx condexp = XEXP (def, 3);
4180 int ready_cost = MAX (XINT (def, 4), 1);
4181 int issue_delay = MAX (XINT (def, 5), 1);
4183 /* See if we have already seen this function unit. If so, check that
4184 the multiplicity and simultaneity values are the same. If not, make
4185 a structure for this function unit. */
4186 for (unit = units; unit; unit = unit->next)
4187 if (! strcmp (unit->name, name))
4189 if (unit->multiplicity != multiplicity
4190 || unit->simultaneity != simultaneity)
4191 fatal ("Differing specifications given for `%s' function unit.",
4198 unit = (struct function_unit *) oballoc (sizeof (struct function_unit));
4200 unit->multiplicity = multiplicity;
4201 unit->simultaneity = simultaneity;
4202 unit->issue_delay.min = unit->issue_delay.max = issue_delay;
4203 unit->num = num_units++;
4204 unit->num_opclasses = 0;
4205 unit->condexp = false_rtx;
4211 /* Make a new operation class structure entry and initialize it. */
4212 op = (struct function_unit_op *) oballoc (sizeof (struct function_unit_op));
4213 op->condexp = condexp;
4214 op->num = unit->num_opclasses++;
4215 op->ready = ready_cost;
4216 op->issue_delay = issue_delay;
4217 op->next = unit->ops;
4220 /* Set our issue expression based on whether or not an optional conflict
4221 vector was specified. */
4224 /* Compute the IOR of all the specified expressions. */
4225 rtx orexp = false_rtx;
4228 for (i = 0; i < XVECLEN (def, 6); i++)
4229 orexp = insert_right_side (IOR, orexp, XVECEXP (def, 6, i), -2, -2);
4231 op->conflict_exp = orexp;
4232 extend_range (&unit->issue_delay, 1, issue_delay);
4236 op->conflict_exp = true_rtx;
4237 extend_range (&unit->issue_delay, issue_delay, issue_delay);
4240 /* Merge our conditional into that of the function unit so we can determine
4241 which insns are used by the function unit. */
4242 unit->condexp = insert_right_side (IOR, unit->condexp, op->condexp, -2, -2);
4245 /* Given a piece of RTX, print a C expression to test it's truth value.
4246 We use AND and IOR both for logical and bit-wise operations, so
4247 interpret them as logical unless they are inside a comparison expression.
4248 The second operand of this function will be non-zero in that case. */
4251 write_test_expr (exp, in_comparison)
4255 int comparison_operator = 0;
4257 struct attr_desc *attr;
4259 /* In order not to worry about operator precedence, surround our part of
4260 the expression with parentheses. */
4263 code = GET_CODE (exp);
4266 /* Binary operators. */
4268 case GE: case GT: case GEU: case GTU:
4269 case LE: case LT: case LEU: case LTU:
4270 comparison_operator = 1;
4272 case PLUS: case MINUS: case MULT: case DIV: case MOD:
4273 case AND: case IOR: case XOR:
4274 case LSHIFT: case ASHIFT: case LSHIFTRT: case ASHIFTRT:
4275 write_test_expr (XEXP (exp, 0), in_comparison || comparison_operator);
4291 printf (" >= (unsigned) ");
4294 printf (" > (unsigned) ");
4303 printf (" <= (unsigned) ");
4306 printf (" < (unsigned) ");
4348 write_test_expr (XEXP (exp, 1), in_comparison || comparison_operator);
4352 /* Special-case (not (eq_attrq "alternative" "x")) */
4353 if (! in_comparison && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
4354 && XSTR (XEXP (exp, 0), 0) == alternative_name)
4356 printf ("which_alternative != %s", XSTR (XEXP (exp, 0), 1));
4360 /* Otherwise, fall through to normal unary operator. */
4362 /* Unary operators. */
4380 write_test_expr (XEXP (exp, 0), in_comparison);
4383 /* Comparison test of an attribute with a value. Most of these will
4384 have been removed by optimization. Handle "alternative"
4385 specially and give error if EQ_ATTR present inside a comparison. */
4388 fatal ("EQ_ATTR not valid inside comparison");
4390 if (XSTR (exp, 0) == alternative_name)
4392 printf ("which_alternative == %s", XSTR (exp, 1));
4396 attr = find_attr (XSTR (exp, 0), 0);
4397 if (! attr) abort ();
4399 /* Now is the time to expand the value of a constant attribute. */
4402 write_test_expr (evaluate_eq_attr (exp, attr->default_val->value,
4408 printf ("get_attr_%s (insn) == ", attr->name);
4409 write_attr_valueq (attr, XSTR (exp, 1));
4413 /* See if an operand matches a predicate. */
4415 /* If only a mode is given, just ensure the mode matches the operand.
4416 If neither a mode nor predicate is given, error. */
4417 if (XSTR (exp, 1) == NULL || *XSTR (exp, 1) == '\0')
4419 if (GET_MODE (exp) == VOIDmode)
4420 fatal ("Null MATCH_OPERAND specified as test");
4422 printf ("GET_MODE (operands[%d]) == %smode",
4423 XINT (exp, 0), GET_MODE_NAME (GET_MODE (exp)));
4426 printf ("%s (operands[%d], %smode)",
4427 XSTR (exp, 1), XINT (exp, 0), GET_MODE_NAME (GET_MODE (exp)));
4430 /* Constant integer. */
4432 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
4433 printf ("%d", XWINT (exp, 0));
4435 printf ("%ld", XWINT (exp, 0));
4439 /* A random C expression. */
4441 printf ("%s", XSTR (exp, 0));
4444 /* The address of the branch target. */
4446 printf ("insn_addresses[INSN_UID (JUMP_LABEL (insn))]");
4449 /* The address of the current insn. It would be more consistent with
4450 other usage to make this the address of the NEXT insn, but this gets
4451 too confusing because of the ambiguity regarding the length of the
4454 printf ("insn_current_address");
4458 fatal ("bad RTX code `%s' in attribute calculation\n",
4459 GET_RTX_NAME (code));
4465 /* Given an attribute value, return the maximum CONST_STRING argument
4466 encountered. It is assumed that they are all numeric. */
4469 max_attr_value (exp)
4472 int current_max = 0;
4476 if (GET_CODE (exp) == CONST_STRING)
4477 return atoi (XSTR (exp, 0));
4479 else if (GET_CODE (exp) == COND)
4481 for (i = 0; i < XVECLEN (exp, 0); i += 2)
4483 n = max_attr_value (XVECEXP (exp, 0, i + 1));
4484 if (n > current_max)
4488 n = max_attr_value (XEXP (exp, 1));
4489 if (n > current_max)
4493 else if (GET_CODE (exp) == IF_THEN_ELSE)
4495 current_max = max_attr_value (XEXP (exp, 1));
4496 n = max_attr_value (XEXP (exp, 2));
4497 if (n > current_max)
4507 /* Scan an attribute value, possibly a conditional, and record what actions
4508 will be required to do any conditional tests in it.
4511 `must_extract' if we need to extract the insn operands
4512 `must_constrain' if we must compute `which_alternative'
4513 `address_used' if an address expression was used
4514 `length_used' if an (eq_attr "length" ...) was used
4518 walk_attr_value (exp)
4528 code = GET_CODE (exp);
4532 if (! RTX_UNCHANGING_P (exp))
4533 /* Since this is an arbitrary expression, it can look at anything.
4534 However, constant expressions do not depend on any particular
4536 must_extract = must_constrain = 1;
4544 if (XSTR (exp, 0) == alternative_name)
4545 must_extract = must_constrain = 1;
4546 else if (strcmp (XSTR (exp, 0), "length") == 0)
4556 for (i = 0, fmt = GET_RTX_FORMAT (code); i < GET_RTX_LENGTH (code); i++)
4561 walk_attr_value (XEXP (exp, i));
4565 if (XVEC (exp, i) != NULL)
4566 for (j = 0; j < XVECLEN (exp, i); j++)
4567 walk_attr_value (XVECEXP (exp, i, j));
4572 /* Write out a function to obtain the attribute for a given INSN. */
4575 write_attr_get (attr)
4576 struct attr_desc *attr;
4578 struct attr_value *av, *common_av;
4580 /* Find the most used attribute value. Handle that as the `default' of the
4581 switch we will generate. */
4582 common_av = find_most_used (attr);
4584 /* Write out start of function, then all values with explicit `case' lines,
4585 then a `default', then the value with the most uses. */
4586 if (!attr->is_numeric)
4587 printf ("enum attr_%s\n", attr->name);
4588 else if (attr->unsigned_p)
4589 printf ("unsigned int\n");
4593 /* If the attribute name starts with a star, the remainder is the name of
4594 the subroutine to use, instead of `get_attr_...'. */
4595 if (attr->name[0] == '*')
4596 printf ("%s (insn)\n", &attr->name[1]);
4597 else if (attr->is_const == 0)
4598 printf ("get_attr_%s (insn)\n", attr->name);
4601 printf ("get_attr_%s ()\n", attr->name);
4604 for (av = attr->first_value; av; av = av->next)
4605 if (av->num_insns != 0)
4606 write_attr_set (attr, 2, av->value, "return", ";",
4607 true_rtx, av->first_insn->insn_code,
4608 av->first_insn->insn_index);
4613 printf (" rtx insn;\n");
4615 printf (" switch (recog_memoized (insn))\n");
4618 for (av = attr->first_value; av; av = av->next)
4619 if (av != common_av)
4620 write_attr_case (attr, av, 1, "return", ";", 4, true_rtx);
4622 write_attr_case (attr, common_av, 0, "return", ";", 4, true_rtx);
4623 printf (" }\n}\n\n");
4626 /* Given an AND tree of known true terms (because we are inside an `if' with
4627 that as the condition or are in an `else' clause) and an expression,
4628 replace any known true terms with TRUE. Use `simplify_and_tree' to do
4629 the bulk of the work. */
4632 eliminate_known_true (known_true, exp, insn_code, insn_index)
4635 int insn_code, insn_index;
4639 known_true = SIMPLIFY_TEST_EXP (known_true, insn_code, insn_index);
4641 if (GET_CODE (known_true) == AND)
4643 exp = eliminate_known_true (XEXP (known_true, 0), exp,
4644 insn_code, insn_index);
4645 exp = eliminate_known_true (XEXP (known_true, 1), exp,
4646 insn_code, insn_index);
4651 exp = simplify_and_tree (exp, &term, insn_code, insn_index);
4657 /* Write out a series of tests and assignment statements to perform tests and
4658 sets of an attribute value. We are passed an indentation amount and prefix
4659 and suffix strings to write around each attribute value (e.g., "return"
4663 write_attr_set (attr, indent, value, prefix, suffix, known_true,
4664 insn_code, insn_index)
4665 struct attr_desc *attr;
4671 int insn_code, insn_index;
4673 if (GET_CODE (value) == CONST_STRING)
4675 write_indent (indent);
4676 printf ("%s ", prefix);
4677 write_attr_value (attr, value);
4678 printf ("%s\n", suffix);
4680 else if (GET_CODE (value) == COND)
4682 /* Assume the default value will be the default of the COND unless we
4683 find an always true expression. */
4684 rtx default_val = XEXP (value, 1);
4685 rtx our_known_true = known_true;
4690 for (i = 0; i < XVECLEN (value, 0); i += 2)
4695 testexp = eliminate_known_true (our_known_true,
4696 XVECEXP (value, 0, i),
4697 insn_code, insn_index);
4698 newexp = attr_rtx (NOT, testexp);
4699 newexp = insert_right_side (AND, our_known_true, newexp,
4700 insn_code, insn_index);
4702 /* If the test expression is always true or if the next `known_true'
4703 expression is always false, this is the last case, so break
4704 out and let this value be the `else' case. */
4705 if (testexp == true_rtx || newexp == false_rtx)
4707 default_val = XVECEXP (value, 0, i + 1);
4711 /* Compute the expression to pass to our recursive call as being
4713 inner_true = insert_right_side (AND, our_known_true,
4714 testexp, insn_code, insn_index);
4716 /* If this is always false, skip it. */
4717 if (inner_true == false_rtx)
4720 write_indent (indent);
4721 printf ("%sif ", first_if ? "" : "else ");
4723 write_test_expr (testexp, 0);
4725 write_indent (indent + 2);
4728 write_attr_set (attr, indent + 4,
4729 XVECEXP (value, 0, i + 1), prefix, suffix,
4730 inner_true, insn_code, insn_index);
4731 write_indent (indent + 2);
4733 our_known_true = newexp;
4738 write_indent (indent);
4740 write_indent (indent + 2);
4744 write_attr_set (attr, first_if ? indent : indent + 4, default_val,
4745 prefix, suffix, our_known_true, insn_code, insn_index);
4749 write_indent (indent + 2);
4757 /* Write out the computation for one attribute value. */
4760 write_attr_case (attr, av, write_case_lines, prefix, suffix, indent,
4762 struct attr_desc *attr;
4763 struct attr_value *av;
4764 int write_case_lines;
4765 char *prefix, *suffix;
4769 struct insn_ent *ie;
4771 if (av->num_insns == 0)
4774 if (av->has_asm_insn)
4776 write_indent (indent);
4777 printf ("case -1:\n");
4778 write_indent (indent + 2);
4779 printf ("if (GET_CODE (PATTERN (insn)) != ASM_INPUT\n");
4780 write_indent (indent + 2);
4781 printf (" && asm_noperands (PATTERN (insn)) < 0)\n");
4782 write_indent (indent + 2);
4783 printf (" fatal_insn_not_found (insn);\n");
4786 if (write_case_lines)
4788 for (ie = av->first_insn; ie; ie = ie->next)
4789 if (ie->insn_code != -1)
4791 write_indent (indent);
4792 printf ("case %d:\n", ie->insn_code);
4797 write_indent (indent);
4798 printf ("default:\n");
4801 /* See what we have to do to output this value. */
4802 must_extract = must_constrain = address_used = 0;
4803 walk_attr_value (av->value);
4807 write_indent (indent + 2);
4808 printf ("insn_extract (insn);\n");
4813 #ifdef REGISTER_CONSTRAINTS
4814 write_indent (indent + 2);
4815 printf ("if (! constrain_operands (INSN_CODE (insn), reload_completed))\n");
4816 write_indent (indent + 2);
4817 printf (" fatal_insn_not_found (insn);\n");
4821 write_attr_set (attr, indent + 2, av->value, prefix, suffix,
4822 known_true, av->first_insn->insn_code,
4823 av->first_insn->insn_index);
4825 if (strncmp (prefix, "return", 6))
4827 write_indent (indent + 2);
4828 printf ("break;\n");
4833 /* Utilities to write names in various forms. */
4836 write_attr_valueq (attr, s)
4837 struct attr_desc *attr;
4840 if (attr->is_numeric)
4843 /* Make the blockage range values easier to read. */
4845 printf (" /* 0x%x */", atoi (s));
4849 write_upcase (attr->name);
4856 write_attr_value (attr, value)
4857 struct attr_desc *attr;
4860 if (GET_CODE (value) != CONST_STRING)
4863 write_attr_valueq (attr, XSTR (value, 0));
4871 if (*str < 'a' || *str > 'z')
4872 printf ("%c", *str++);
4874 printf ("%c", *str++ - 'a' + 'A');
4878 write_indent (indent)
4881 for (; indent > 8; indent -= 8)
4884 for (; indent; indent--)
4888 /* Write a subroutine that is given an insn that requires a delay slot, a
4889 delay slot ordinal, and a candidate insn. It returns non-zero if the
4890 candidate can be placed in the specified delay slot of the insn.
4892 We can write as many as three subroutines. `eligible_for_delay'
4893 handles normal delay slots, `eligible_for_annul_true' indicates that
4894 the specified insn can be annulled if the branch is true, and likewise
4895 for `eligible_for_annul_false'.
4897 KIND is a string distinguishing these three cases ("delay", "annul_true",
4898 or "annul_false"). */
4901 write_eligible_delay (kind)
4904 struct delay_desc *delay;
4907 struct attr_desc *attr;
4908 struct attr_value *av, *common_av;
4911 /* Compute the maximum number of delay slots required. We use the delay
4912 ordinal times this number plus one, plus the slot number as an index into
4913 the appropriate predicate to test. */
4915 for (delay = delays, max_slots = 0; delay; delay = delay->next)
4916 if (XVECLEN (delay->def, 1) / 3 > max_slots)
4917 max_slots = XVECLEN (delay->def, 1) / 3;
4919 /* Write function prelude. */
4922 printf ("eligible_for_%s (delay_insn, slot, candidate_insn)\n", kind);
4923 printf (" rtx delay_insn;\n");
4924 printf (" int slot;\n");
4925 printf (" rtx candidate_insn;\n");
4927 printf (" rtx insn;\n");
4929 printf (" if (slot >= %d)\n", max_slots);
4930 printf (" abort ();\n");
4933 /* If more than one delay type, find out which type the delay insn is. */
4937 attr = find_attr ("*delay_type", 0);
4938 if (! attr) abort ();
4939 common_av = find_most_used (attr);
4941 printf (" insn = delay_insn;\n");
4942 printf (" switch (recog_memoized (insn))\n");
4945 sprintf (str, " * %d;\n break;", max_slots);
4946 for (av = attr->first_value; av; av = av->next)
4947 if (av != common_av)
4948 write_attr_case (attr, av, 1, "slot +=", str, 4, true_rtx);
4950 write_attr_case (attr, common_av, 0, "slot +=", str, 4, true_rtx);
4953 /* Ensure matched. Otherwise, shouldn't have been called. */
4954 printf (" if (slot < %d)\n", max_slots);
4955 printf (" abort ();\n\n");
4958 /* If just one type of delay slot, write simple switch. */
4959 if (num_delays == 1 && max_slots == 1)
4961 printf (" insn = candidate_insn;\n");
4962 printf (" switch (recog_memoized (insn))\n");
4965 attr = find_attr ("*delay_1_0", 0);
4966 if (! attr) abort ();
4967 common_av = find_most_used (attr);
4969 for (av = attr->first_value; av; av = av->next)
4970 if (av != common_av)
4971 write_attr_case (attr, av, 1, "return", ";", 4, true_rtx);
4973 write_attr_case (attr, common_av, 0, "return", ";", 4, true_rtx);
4979 /* Write a nested CASE. The first indicates which condition we need to
4980 test, and the inner CASE tests the condition. */
4981 printf (" insn = candidate_insn;\n");
4982 printf (" switch (slot)\n");
4985 for (delay = delays; delay; delay = delay->next)
4986 for (i = 0; i < XVECLEN (delay->def, 1); i += 3)
4988 printf (" case %d:\n",
4989 (i / 3) + (num_delays == 1 ? 0 : delay->num * max_slots));
4990 printf (" switch (recog_memoized (insn))\n");
4993 sprintf (str, "*%s_%d_%d", kind, delay->num, i / 3);
4994 attr = find_attr (str, 0);
4995 if (! attr) abort ();
4996 common_av = find_most_used (attr);
4998 for (av = attr->first_value; av; av = av->next)
4999 if (av != common_av)
5000 write_attr_case (attr, av, 1, "return", ";", 8, true_rtx);
5002 write_attr_case (attr, common_av, 0, "return", ";", 8, true_rtx);
5006 printf (" default:\n");
5007 printf (" abort ();\n");
5014 /* Write routines to compute conflict cost for function units. Then write a
5015 table describing the available function units. */
5018 write_function_unit_info ()
5020 struct function_unit *unit;
5023 /* Write out conflict routines for function units. Don't bother writing
5024 one if there is only one issue delay value. */
5026 for (unit = units; unit; unit = unit->next)
5028 if (unit->needs_blockage_function)
5029 write_complex_function (unit, "blockage", "block");
5031 /* If the minimum and maximum conflict costs are the same, there
5032 is only one value, so we don't need a function. */
5033 if (! unit->needs_conflict_function)
5035 unit->default_cost = make_numeric_value (unit->issue_delay.max);
5039 /* The function first computes the case from the candidate insn. */
5040 unit->default_cost = make_numeric_value (0);
5041 write_complex_function (unit, "conflict_cost", "cost");
5044 /* Now that all functions have been written, write the table describing
5045 the function units. The name is included for documentation purposes
5048 printf ("struct function_unit_desc function_units[] = {\n");
5050 /* Write out the descriptions in numeric order, but don't force that order
5051 on the list. Doing so increases the runtime of genattrtab.c. */
5052 for (i = 0; i < num_units; i++)
5054 for (unit = units; unit; unit = unit->next)
5058 printf (" {\"%s\", %d, %d, %d, %s, %d, %s_unit_ready_cost, ",
5059 unit->name, 1 << unit->num, unit->multiplicity,
5060 unit->simultaneity, XSTR (unit->default_cost, 0),
5061 unit->issue_delay.max, unit->name);
5063 if (unit->needs_conflict_function)
5064 printf ("%s_unit_conflict_cost, ", unit->name);
5068 printf ("%d, ", unit->max_blockage);
5070 if (unit->needs_range_function)
5071 printf ("%s_unit_blockage_range, ", unit->name);
5075 if (unit->needs_blockage_function)
5076 printf ("%s_unit_blockage", unit->name);
5087 write_complex_function (unit, name, connection)
5088 struct function_unit *unit;
5089 char *name, *connection;
5091 struct attr_desc *case_attr, *attr;
5092 struct attr_value *av, *common_av;
5098 printf ("static int\n");
5099 printf ("%s_unit_%s (executing_insn, candidate_insn)\n",
5101 printf (" rtx executing_insn;\n");
5102 printf (" rtx candidate_insn;\n");
5104 printf (" rtx insn;\n");
5105 printf (" int casenum;\n\n");
5106 printf (" insn = candidate_insn;\n");
5107 printf (" switch (recog_memoized (insn))\n");
5110 /* Write the `switch' statement to get the case value. */
5111 str = (char *) alloca (strlen (unit->name) + strlen (name) + strlen (connection) + 10);
5112 sprintf (str, "*%s_cases", unit->name);
5113 case_attr = find_attr (str, 0);
5114 if (! case_attr) abort ();
5115 common_av = find_most_used (case_attr);
5117 for (av = case_attr->first_value; av; av = av->next)
5118 if (av != common_av)
5119 write_attr_case (case_attr, av, 1,
5120 "casenum =", ";", 4, unit->condexp);
5122 write_attr_case (case_attr, common_av, 0,
5123 "casenum =", ";", 4, unit->condexp);
5126 /* Now write an outer switch statement on each case. Then write
5127 the tests on the executing function within each. */
5128 printf (" insn = executing_insn;\n");
5129 printf (" switch (casenum)\n");
5132 for (i = 0; i < unit->num_opclasses; i++)
5134 /* Ensure using this case. */
5136 for (av = case_attr->first_value; av; av = av->next)
5138 && contained_in_p (make_numeric_value (i), av->value))
5144 printf (" case %d:\n", i);
5145 sprintf (str, "*%s_%s_%d", unit->name, connection, i);
5146 attr = find_attr (str, 0);
5147 if (! attr) abort ();
5149 /* If single value, just write it. */
5150 value = find_single_value (attr);
5152 write_attr_set (attr, 6, value, "return", ";\n", true_rtx, -2, -2);
5155 common_av = find_most_used (attr);
5156 printf (" switch (recog_memoized (insn))\n");
5159 for (av = attr->first_value; av; av = av->next)
5160 if (av != common_av)
5161 write_attr_case (attr, av, 1,
5162 "return", ";", 8, unit->condexp);
5164 write_attr_case (attr, common_av, 0,
5165 "return", ";", 8, unit->condexp);
5170 printf (" }\n}\n\n");
5173 /* This page contains miscellaneous utility routines. */
5175 /* Given a string, return the number of comma-separated elements in it.
5176 Return 0 for the null string. */
5187 for (n = 1; *s; s++)
5194 /* Given a pointer to a (char *), return a malloc'ed string containing the
5195 next comma-separated element. Advance the pointer to after the string
5196 scanned, or the end-of-string. Return NULL if at end of string. */
5199 next_comma_elt (pstr)
5208 /* Find end of string to compute length. */
5209 for (p = *pstr; *p != ',' && *p != '\0'; p++)
5212 out_str = attr_string (*pstr, p - *pstr);
5221 /* Return a `struct attr_desc' pointer for a given named attribute. If CREATE
5222 is non-zero, build a new attribute, if one does not exist. */
5224 static struct attr_desc *
5225 find_attr (name, create)
5229 struct attr_desc *attr;
5232 /* Before we resort to using `strcmp', see if the string address matches
5233 anywhere. In most cases, it should have been canonicalized to do so. */
5234 if (name == alternative_name)
5237 index = name[0] & (MAX_ATTRS_INDEX - 1);
5238 for (attr = attrs[index]; attr; attr = attr->next)
5239 if (name == attr->name)
5242 /* Otherwise, do it the slow way. */
5243 for (attr = attrs[index]; attr; attr = attr->next)
5244 if (name[0] == attr->name[0] && ! strcmp (name, attr->name))
5250 attr = (struct attr_desc *) oballoc (sizeof (struct attr_desc));
5251 attr->name = attr_string (name, strlen (name));
5252 attr->first_value = attr->default_val = NULL;
5253 attr->is_numeric = attr->negative_ok = attr->is_const = attr->is_special = 0;
5254 attr->next = attrs[index];
5255 attrs[index] = attr;
5260 /* Create internal attribute with the given default value. */
5263 make_internal_attr (name, value, special)
5268 struct attr_desc *attr;
5270 attr = find_attr (name, 1);
5271 if (attr->default_val)
5274 attr->is_numeric = 1;
5276 attr->is_special = (special & 1) != 0;
5277 attr->negative_ok = (special & 2) != 0;
5278 attr->unsigned_p = (special & 4) != 0;
5279 attr->default_val = get_attr_value (value, attr, -2);
5282 /* Find the most used value of an attribute. */
5284 static struct attr_value *
5285 find_most_used (attr)
5286 struct attr_desc *attr;
5288 struct attr_value *av;
5289 struct attr_value *most_used;
5295 for (av = attr->first_value; av; av = av->next)
5296 if (av->num_insns > nuses)
5297 nuses = av->num_insns, most_used = av;
5302 /* If an attribute only has a single value used, return it. Otherwise
5306 find_single_value (attr)
5307 struct attr_desc *attr;
5309 struct attr_value *av;
5312 unique_value = NULL;
5313 for (av = attr->first_value; av; av = av->next)
5319 unique_value = av->value;
5322 return unique_value;
5325 /* Return (attr_value "n") */
5328 make_numeric_value (n)
5331 static rtx int_values[20];
5338 if (n < 20 && int_values[n])
5339 return int_values[n];
5341 p = attr_printf (MAX_DIGITS, "%d", n);
5342 exp = attr_rtx (CONST_STRING, p);
5345 int_values[n] = exp;
5351 extend_range (range, min, max)
5352 struct range *range;
5356 if (range->min > min) range->min = min;
5357 if (range->max < max) range->max = max;
5361 xrealloc (ptr, size)
5365 char *result = (char *) realloc (ptr, size);
5367 fatal ("virtual memory exhausted");
5375 register char *val = (char *) malloc (size);
5378 fatal ("virtual memory exhausted");
5383 copy_rtx_unchanging (orig)
5388 register RTX_CODE code;
5391 if (RTX_UNCHANGING_P (orig) || MEM_IN_STRUCT_P (orig))
5394 MEM_IN_STRUCT_P (orig) = 1;
5398 code = GET_CODE (orig);
5408 copy = rtx_alloc (code);
5409 PUT_MODE (copy, GET_MODE (orig));
5410 RTX_UNCHANGING_P (copy) = 1;
5412 bcopy (&XEXP (orig, 0), &XEXP (copy, 0),
5413 GET_RTX_LENGTH (GET_CODE (copy)) * sizeof (rtx));
5422 fprintf (stderr, "genattrtab: ");
5423 fprintf (stderr, s, a1, a2);
5424 fprintf (stderr, "\n");
5425 exit (FATAL_EXIT_CODE);
5428 /* More 'friendly' abort that prints the line and file.
5429 config.h can #define abort fancy_abort if you like that sort of thing. */
5434 fatal ("Internal gcc abort.");
5437 /* Determine if an insn has a constant number of delay slots, i.e., the
5438 number of delay slots is not a function of the length of the insn. */
5441 write_const_num_delay_slots ()
5443 struct attr_desc *attr = find_attr ("*num_delay_slots", 0);
5444 struct attr_value *av;
5445 struct insn_ent *ie;
5450 printf ("int\nconst_num_delay_slots (insn)\n");
5451 printf (" rtx insn;\n");
5453 printf (" switch (recog_memoized (insn))\n");
5456 for (av = attr->first_value; av; av = av->next)
5459 walk_attr_value (av->value);
5462 for (ie = av->first_insn; ie; ie = ie->next)
5463 if (ie->insn_code != -1)
5464 printf (" case %d:\n", ie->insn_code);
5465 printf (" return 0;\n");
5469 printf (" default:\n");
5470 printf (" return 1;\n");
5484 struct attr_desc *attr;
5485 struct insn_def *id;
5490 /* Get rid of any avoidable limit on stack size. */
5494 /* Set the stack limit huge so that alloca does not fail. */
5495 getrlimit (RLIMIT_STACK, &rlim);
5496 rlim.rlim_cur = rlim.rlim_max;
5497 setrlimit (RLIMIT_STACK, &rlim);
5499 #endif /* RLIMIT_STACK defined */
5501 obstack_init (rtl_obstack);
5502 obstack_init (hash_obstack);
5503 obstack_init (temp_obstack);
5506 fatal ("No input file name.");
5508 infile = fopen (argv[1], "r");
5512 exit (FATAL_EXIT_CODE);
5517 /* Set up true and false rtx's */
5518 true_rtx = rtx_alloc (CONST_INT);
5519 XWINT (true_rtx, 0) = 1;
5520 false_rtx = rtx_alloc (CONST_INT);
5521 XWINT (false_rtx, 0) = 0;
5522 RTX_UNCHANGING_P (true_rtx) = RTX_UNCHANGING_P (false_rtx) = 1;
5523 RTX_INTEGRATED_P (true_rtx) = RTX_INTEGRATED_P (false_rtx) = 1;
5525 alternative_name = attr_string ("alternative", strlen ("alternative"));
5527 printf ("/* Generated automatically by the program `genattrtab'\n\
5528 from the machine description file `md'. */\n\n");
5530 /* Read the machine description. */
5534 c = read_skip_spaces (infile);
5539 desc = read_rtx (infile);
5540 if (GET_CODE (desc) == DEFINE_INSN
5541 || GET_CODE (desc) == DEFINE_PEEPHOLE
5542 || GET_CODE (desc) == DEFINE_ASM_ATTRIBUTES)
5545 else if (GET_CODE (desc) == DEFINE_EXPAND)
5546 insn_code_number++, insn_index_number++;
5548 else if (GET_CODE (desc) == DEFINE_SPLIT)
5549 insn_code_number++, insn_index_number++;
5551 else if (GET_CODE (desc) == DEFINE_ATTR)
5554 insn_index_number++;
5557 else if (GET_CODE (desc) == DEFINE_DELAY)
5560 insn_index_number++;
5563 else if (GET_CODE (desc) == DEFINE_FUNCTION_UNIT)
5566 insn_index_number++;
5570 /* If we didn't have a DEFINE_ASM_ATTRIBUTES, make a null one. */
5571 if (! got_define_asm_attributes)
5573 tem = rtx_alloc (DEFINE_ASM_ATTRIBUTES);
5574 XVEC (tem, 0) = rtvec_alloc (0);
5578 /* Expand DEFINE_DELAY information into new attribute. */
5582 /* Expand DEFINE_FUNCTION_UNIT information into new attributes. */
5586 printf ("#include \"config.h\"\n");
5587 printf ("#include \"rtl.h\"\n");
5588 printf ("#include \"insn-config.h\"\n");
5589 printf ("#include \"recog.h\"\n");
5590 printf ("#include \"regs.h\"\n");
5591 printf ("#include \"real.h\"\n");
5592 printf ("#include \"output.h\"\n");
5593 printf ("#include \"insn-attr.h\"\n");
5595 printf ("#define operands recog_operand\n\n");
5597 /* Make `insn_alternatives'. */
5598 insn_alternatives = (int *) oballoc (insn_code_number * sizeof (int));
5599 for (id = defs; id; id = id->next)
5600 if (id->insn_code >= 0)
5601 insn_alternatives[id->insn_code] = (1 << id->num_alternatives) - 1;
5603 /* Make `insn_n_alternatives'. */
5604 insn_n_alternatives = (int *) oballoc (insn_code_number * sizeof (int));
5605 for (id = defs; id; id = id->next)
5606 if (id->insn_code >= 0)
5607 insn_n_alternatives[id->insn_code] = id->num_alternatives;
5609 /* Prepare to write out attribute subroutines by checking everything stored
5610 away and building the attribute cases. */
5613 for (i = 0; i < MAX_ATTRS_INDEX; i++)
5614 for (attr = attrs[i]; attr; attr = attr->next)
5616 attr->default_val->value
5617 = check_attr_value (attr->default_val->value, attr);
5621 /* Construct extra attributes for `length'. */
5622 make_length_attrs ();
5624 /* Perform any possible optimizations to speed up compilation. */
5627 /* Now write out all the `gen_attr_...' routines. Do these before the
5628 special routines (specifically before write_function_unit_info), so
5629 that they get defined before they are used. */
5631 for (i = 0; i < MAX_ATTRS_INDEX; i++)
5632 for (attr = attrs[i]; attr; attr = attr->next)
5634 if (! attr->is_special)
5635 write_attr_get (attr);
5638 /* Write out delay eligibility information, if DEFINE_DELAY present.
5639 (The function to compute the number of delay slots will be written
5643 write_eligible_delay ("delay");
5644 if (have_annul_true)
5645 write_eligible_delay ("annul_true");
5646 if (have_annul_false)
5647 write_eligible_delay ("annul_false");
5650 /* Write out information about function units. */
5652 write_function_unit_info ();
5654 /* Write out constant delay slot info */
5655 write_const_num_delay_slots ();
5658 exit (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);