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 a blockage range function required. */
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 /* Other variables. */
255 static int insn_code_number;
256 static int insn_index_number;
257 static int got_define_asm_attributes;
258 static int must_extract;
259 static int must_constrain;
260 static int address_used;
261 static int length_used;
262 static int num_delays;
263 static int have_annul_true, have_annul_false;
264 static int num_units;
266 /* Used as operand to `operate_exp': */
268 enum operator {PLUS_OP, MINUS_OP, POS_MINUS_OP, EQ_OP, OR_OP, MAX_OP, MIN_OP, RANGE_OP};
270 /* Stores, for each insn code, the number of constraint alternatives. */
272 static int *insn_n_alternatives;
274 /* Stores, for each insn code, a bitmap that has bits on for each possible
277 static int *insn_alternatives;
279 /* If nonzero, assume that the `alternative' attr has this value.
280 This is the hashed, unique string for the numeral
281 whose value is chosen alternative. */
283 static char *current_alternative_string;
285 /* Used to simplify expressions. */
287 static rtx true_rtx, false_rtx;
289 /* Used to reduce calls to `strcmp' */
291 static char *alternative_name;
293 /* Simplify an expression. Only call the routine if there is something to
295 #define SIMPLIFY_TEST_EXP(EXP,INSN_CODE,INSN_INDEX) \
296 (RTX_UNCHANGING_P (EXP) || MEM_IN_STRUCT_P (EXP) ? (EXP) \
297 : simplify_test_exp (EXP, INSN_CODE, INSN_INDEX))
299 /* Simplify (eq_attr ("alternative") ...)
300 when we are working with a particular alternative. */
301 #define SIMPLIFY_ALTERNATIVE(EXP) \
302 if (current_alternative_string \
303 && GET_CODE ((EXP)) == EQ_ATTR \
304 && XSTR ((EXP), 0) == alternative_name) \
305 (EXP) = (XSTR ((EXP), 1) == current_alternative_string \
306 ? true_rtx : false_rtx);
308 /* These are referenced by rtlanal.c and hence need to be defined somewhere.
309 They won't actually be used. */
311 rtx frame_pointer_rtx, stack_pointer_rtx, arg_pointer_rtx;
313 static rtx attr_rtx ();
314 static char *attr_printf ();
315 static char *attr_string ();
316 static rtx check_attr_test ();
317 static rtx check_attr_value ();
318 static rtx convert_set_attr_alternative ();
319 static rtx convert_set_attr ();
320 static void check_defs ();
321 static rtx convert_const_symbol_ref ();
322 static rtx make_canonical ();
323 static struct attr_value *get_attr_value ();
324 static rtx copy_rtx_unchanging ();
325 static rtx copy_boolean ();
326 static void expand_delays ();
327 static rtx operate_exp ();
328 static void expand_units ();
329 static rtx simplify_knowing ();
330 static rtx encode_units_mask ();
331 static void fill_attr ();
332 static rtx substitute_address ();
333 static void make_length_attrs ();
334 static rtx identity_fn ();
335 static rtx zero_fn ();
336 static rtx one_fn ();
337 static rtx max_fn ();
338 static rtx simplify_cond ();
339 static rtx simplify_by_alternatives ();
340 static rtx simplify_by_exploding ();
341 static int find_and_mark_used_attributes ();
342 static void unmark_used_attributes ();
343 static int add_values_to_cover ();
344 static int increment_current_value ();
345 static rtx test_for_current_value ();
346 static rtx simplify_with_current_value ();
347 static rtx simplify_with_current_value_aux ();
348 static void remove_insn_ent ();
349 static void insert_insn_ent ();
350 static rtx insert_right_side ();
351 static rtx make_alternative_compare ();
352 static int compute_alternative_mask ();
353 static rtx evaluate_eq_attr ();
354 static rtx simplify_and_tree ();
355 static rtx simplify_or_tree ();
356 static rtx simplify_test_exp ();
357 static void optimize_attrs ();
358 static void gen_attr ();
359 static int count_alternatives ();
360 static int compares_alternatives_p ();
361 static int contained_in_p ();
362 static void gen_insn ();
363 static void gen_delay ();
364 static void gen_unit ();
365 static void write_test_expr ();
366 static int max_attr_value ();
367 static void walk_attr_value ();
368 static void write_attr_get ();
369 static rtx eliminate_known_true ();
370 static void write_attr_set ();
371 static void write_attr_case ();
372 static void write_attr_value ();
373 static void write_attr_valueq ();
374 static void write_upcase ();
375 static void write_indent ();
376 static void write_eligible_delay ();
377 static void write_function_unit_info ();
378 static void write_complex_function ();
379 static int n_comma_elts ();
380 static char *next_comma_elt ();
381 static struct attr_desc *find_attr ();
382 static void make_internal_attr ();
383 static struct attr_value *find_most_used ();
384 static rtx find_single_value ();
385 static rtx make_numeric_value ();
386 static void extend_range ();
389 static void fatal ();
391 #define oballoc(size) obstack_alloc (hash_obstack, size)
394 /* Hash table for sharing RTL and strings. */
396 /* Each hash table slot is a bucket containing a chain of these structures.
397 Strings are given negative hash codes; RTL expressions are given positive
402 struct attr_hash *next; /* Next structure in the bucket. */
403 int hashcode; /* Hash code of this rtx or string. */
406 char *str; /* The string (negative hash codes) */
407 rtx rtl; /* or the RTL recorded here. */
411 /* Now here is the hash table. When recording an RTL, it is added to
412 the slot whose index is the hash code mod the table size. Note
413 that the hash table is used for several kinds of RTL (see attr_rtx)
414 and for strings. While all these live in the same table, they are
415 completely independent, and the hash code is computed differently
418 #define RTL_HASH_SIZE 4093
419 struct attr_hash *attr_hash_table[RTL_HASH_SIZE];
421 /* Here is how primitive or already-shared RTL's hash
423 #define RTL_HASH(RTL) ((HOST_WIDE_INT) (RTL) & 0777777)
425 /* Add an entry to the hash table for RTL with hash code HASHCODE. */
428 attr_hash_add_rtx (hashcode, rtl)
432 register struct attr_hash *h;
434 h = (struct attr_hash *) obstack_alloc (hash_obstack,
435 sizeof (struct attr_hash));
436 h->hashcode = hashcode;
438 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
439 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
442 /* Add an entry to the hash table for STRING with hash code HASHCODE. */
445 attr_hash_add_string (hashcode, str)
449 register struct attr_hash *h;
451 h = (struct attr_hash *) obstack_alloc (hash_obstack,
452 sizeof (struct attr_hash));
453 h->hashcode = -hashcode;
455 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
456 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
459 /* Generate an RTL expression, but avoid duplicates.
460 Set the RTX_INTEGRATED_P flag for these permanent objects.
462 In some cases we cannot uniquify; then we return an ordinary
463 impermanent rtx with RTX_INTEGRATED_P clear.
465 Args are like gen_rtx, but without the mode:
467 rtx attr_rtx (code, [element1, ..., elementn]) */
476 register int i; /* Array indices... */
477 register char *fmt; /* Current rtx's format... */
478 register rtx rt_val; /* RTX to return to caller... */
480 register struct attr_hash *h;
481 struct obstack *old_obstack = rtl_obstack;
484 code = va_arg (p, enum rtx_code);
486 /* For each of several cases, search the hash table for an existing entry.
487 Use that entry if one is found; otherwise create a new RTL and add it
490 if (GET_RTX_CLASS (code) == '1')
492 rtx arg0 = va_arg (p, rtx);
494 /* A permanent object cannot point to impermanent ones. */
495 if (! RTX_INTEGRATED_P (arg0))
497 rt_val = rtx_alloc (code);
498 XEXP (rt_val, 0) = arg0;
503 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0));
504 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
505 if (h->hashcode == hashcode
506 && GET_CODE (h->u.rtl) == code
507 && XEXP (h->u.rtl, 0) == arg0)
512 rtl_obstack = hash_obstack;
513 rt_val = rtx_alloc (code);
514 XEXP (rt_val, 0) = arg0;
517 else if (GET_RTX_CLASS (code) == 'c'
518 || GET_RTX_CLASS (code) == '2'
519 || GET_RTX_CLASS (code) == '<')
521 rtx arg0 = va_arg (p, rtx);
522 rtx arg1 = va_arg (p, rtx);
524 /* A permanent object cannot point to impermanent ones. */
525 if (! RTX_INTEGRATED_P (arg0) || ! RTX_INTEGRATED_P (arg1))
527 rt_val = rtx_alloc (code);
528 XEXP (rt_val, 0) = arg0;
529 XEXP (rt_val, 1) = arg1;
534 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0) + RTL_HASH (arg1));
535 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
536 if (h->hashcode == hashcode
537 && GET_CODE (h->u.rtl) == code
538 && XEXP (h->u.rtl, 0) == arg0
539 && XEXP (h->u.rtl, 1) == arg1)
544 rtl_obstack = hash_obstack;
545 rt_val = rtx_alloc (code);
546 XEXP (rt_val, 0) = arg0;
547 XEXP (rt_val, 1) = arg1;
550 else if (GET_RTX_LENGTH (code) == 1
551 && GET_RTX_FORMAT (code)[0] == 's')
553 char * arg0 = va_arg (p, char *);
555 if (code == SYMBOL_REF)
556 arg0 = attr_string (arg0, strlen (arg0));
558 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0));
559 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
560 if (h->hashcode == hashcode
561 && GET_CODE (h->u.rtl) == code
562 && XSTR (h->u.rtl, 0) == arg0)
567 rtl_obstack = hash_obstack;
568 rt_val = rtx_alloc (code);
569 XSTR (rt_val, 0) = arg0;
572 else if (GET_RTX_LENGTH (code) == 2
573 && GET_RTX_FORMAT (code)[0] == 's'
574 && GET_RTX_FORMAT (code)[1] == 's')
576 char *arg0 = va_arg (p, char *);
577 char *arg1 = va_arg (p, char *);
579 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0) + RTL_HASH (arg1));
580 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
581 if (h->hashcode == hashcode
582 && GET_CODE (h->u.rtl) == code
583 && XSTR (h->u.rtl, 0) == arg0
584 && XSTR (h->u.rtl, 1) == arg1)
589 rtl_obstack = hash_obstack;
590 rt_val = rtx_alloc (code);
591 XSTR (rt_val, 0) = arg0;
592 XSTR (rt_val, 1) = arg1;
595 else if (code == CONST_INT)
597 HOST_WIDE_INT arg0 = va_arg (p, HOST_WIDE_INT);
607 rt_val = rtx_alloc (code); /* Allocate the storage space. */
609 fmt = GET_RTX_FORMAT (code); /* Find the right format... */
610 for (i = 0; i < GET_RTX_LENGTH (code); i++)
614 case '0': /* Unused field. */
617 case 'i': /* An integer? */
618 XINT (rt_val, i) = va_arg (p, int);
621 case 'w': /* A wide integer? */
622 XWINT (rt_val, i) = va_arg (p, HOST_WIDE_INT);
625 case 's': /* A string? */
626 XSTR (rt_val, i) = va_arg (p, char *);
629 case 'e': /* An expression? */
630 case 'u': /* An insn? Same except when printing. */
631 XEXP (rt_val, i) = va_arg (p, rtx);
634 case 'E': /* An RTX vector? */
635 XVEC (rt_val, i) = va_arg (p, rtvec);
646 rtl_obstack = old_obstack;
648 attr_hash_add_rtx (hashcode, rt_val);
649 RTX_INTEGRATED_P (rt_val) = 1;
657 /* Create a new string printed with the printf line arguments into a space
658 of at most LEN bytes:
660 rtx attr_printf (len, format, [arg1, ..., argn]) */
666 attr_printf (va_alist)
674 /* Print the string into a temporary location. */
676 len = va_arg (p, int);
677 str = (char *) alloca (len);
678 fmt = va_arg (p, char *);
679 vsprintf (str, fmt, p);
682 return attr_string (str, strlen (str));
685 #else /* not HAVE_VPRINTF */
688 attr_printf (len, fmt, arg1, arg2, arg3)
691 char *arg1, *arg2, *arg3; /* also int */
695 /* Print the string into a temporary location. */
696 str = (char *) alloca (len);
697 sprintf (str, fmt, arg1, arg2, arg3);
699 return attr_string (str, strlen (str));
701 #endif /* not HAVE_VPRINTF */
704 attr_eq (name, value)
707 return attr_rtx (EQ_ATTR, attr_string (name, strlen (name)),
708 attr_string (value, strlen (value)));
715 return XSTR (make_numeric_value (n), 0);
718 /* Return a permanent (possibly shared) copy of a string STR (not assumed
719 to be null terminated) with LEN bytes. */
722 attr_string (str, len)
726 register struct attr_hash *h;
729 register char *new_str;
731 /* Compute the hash code. */
732 hashcode = (len + 1) * 613 + (unsigned)str[0];
733 for (i = 1; i <= len; i += 2)
734 hashcode = ((hashcode * 613) + (unsigned)str[i]);
736 hashcode = -hashcode;
738 /* Search the table for the string. */
739 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
740 if (h->hashcode == -hashcode && h->u.str[0] == str[0]
741 && !strncmp (h->u.str, str, len))
742 return h->u.str; /* <-- return if found. */
744 /* Not found; create a permanent copy and add it to the hash table. */
745 new_str = (char *) obstack_alloc (hash_obstack, len + 1);
746 bcopy (str, new_str, len);
748 attr_hash_add_string (hashcode, new_str);
750 return new_str; /* Return the new string. */
753 /* Check two rtx's for equality of contents,
754 taking advantage of the fact that if both are hashed
755 then they can't be equal unless they are the same object. */
761 return (x == y || (! (RTX_INTEGRATED_P (x) && RTX_INTEGRATED_P (y))
762 && rtx_equal_p (x, y)));
765 /* Copy an attribute value expression,
766 descending to all depths, but not copying any
767 permanent hashed subexpressions. */
775 register RTX_CODE code;
776 register char *format_ptr;
778 /* No need to copy a permanent object. */
779 if (RTX_INTEGRATED_P (orig))
782 code = GET_CODE (orig);
797 copy = rtx_alloc (code);
798 PUT_MODE (copy, GET_MODE (orig));
799 copy->in_struct = orig->in_struct;
800 copy->volatil = orig->volatil;
801 copy->unchanging = orig->unchanging;
802 copy->integrated = orig->integrated;
804 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
806 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
808 switch (*format_ptr++)
811 XEXP (copy, i) = XEXP (orig, i);
812 if (XEXP (orig, i) != NULL)
813 XEXP (copy, i) = attr_copy_rtx (XEXP (orig, i));
818 XVEC (copy, i) = XVEC (orig, i);
819 if (XVEC (orig, i) != NULL)
821 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
822 for (j = 0; j < XVECLEN (copy, i); j++)
823 XVECEXP (copy, i, j) = attr_copy_rtx (XVECEXP (orig, i, j));
829 XINT (copy, i) = XINT (orig, i);
833 XWINT (copy, i) = XWINT (orig, i);
838 XSTR (copy, i) = XSTR (orig, i);
848 /* Given a test expression for an attribute, ensure it is validly formed.
849 IS_CONST indicates whether the expression is constant for each compiler
850 run (a constant expression may not test any particular insn).
852 Convert (eq_attr "att" "a1,a2") to (ior (eq_attr ... ) (eq_attrq ..))
853 and (eq_attr "att" "!a1") to (not (eq_attr "att" "a1")). Do the latter
854 test first so that (eq_attr "att" "!a1,a2,a3") works as expected.
856 Update the string address in EQ_ATTR expression to be the same used
857 in the attribute (or `alternative_name') to speed up subsequent
858 `find_attr' calls and eliminate most `strcmp' calls.
860 Return the new expression, if any. */
863 check_attr_test (exp, is_const)
867 struct attr_desc *attr;
868 struct attr_value *av;
872 switch (GET_CODE (exp))
875 /* Handle negation test. */
876 if (XSTR (exp, 1)[0] == '!')
877 return check_attr_test (attr_rtx (NOT,
878 attr_eq (XSTR (exp, 0),
882 else if (n_comma_elts (XSTR (exp, 1)) == 1)
884 attr = find_attr (XSTR (exp, 0), 0);
887 if (! strcmp (XSTR (exp, 0), "alternative"))
889 XSTR (exp, 0) = alternative_name;
890 /* This can't be simplified any further. */
891 RTX_UNCHANGING_P (exp) = 1;
895 fatal ("Unknown attribute `%s' in EQ_ATTR", XEXP (exp, 0));
898 if (is_const && ! attr->is_const)
899 fatal ("Constant expression uses insn attribute `%s' in EQ_ATTR",
902 /* Copy this just to make it permanent,
903 so expressions using it can be permanent too. */
904 exp = attr_eq (XSTR (exp, 0), XSTR (exp, 1));
906 /* It shouldn't be possible to simplify the value given to a
907 constant attribute, so don't expand this until it's time to
908 write the test expression. */
910 RTX_UNCHANGING_P (exp) = 1;
912 if (attr->is_numeric)
914 for (p = XSTR (exp, 1); *p; p++)
915 if (*p < '0' || *p > '9')
916 fatal ("Attribute `%s' takes only numeric values",
921 for (av = attr->first_value; av; av = av->next)
922 if (GET_CODE (av->value) == CONST_STRING
923 && ! strcmp (XSTR (exp, 1), XSTR (av->value, 0)))
927 fatal ("Unknown value `%s' for `%s' attribute",
928 XEXP (exp, 1), XEXP (exp, 0));
933 /* Make an IOR tree of the possible values. */
935 name_ptr = XSTR (exp, 1);
936 while ((p = next_comma_elt (&name_ptr)) != NULL)
938 newexp = attr_eq (XSTR (exp, 0), p);
939 orexp = insert_right_side (IOR, orexp, newexp, -2);
942 return check_attr_test (orexp, is_const);
947 /* Either TRUE or FALSE. */
955 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0), is_const);
956 XEXP (exp, 1) = check_attr_test (XEXP (exp, 1), is_const);
960 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0), is_const);
965 fatal ("RTL operator \"%s\" not valid in constant attribute test",
966 GET_RTX_NAME (MATCH_OPERAND));
967 /* These cases can't be simplified. */
968 RTX_UNCHANGING_P (exp) = 1;
971 case LE: case LT: case GT: case GE:
972 case LEU: case LTU: case GTU: case GEU:
974 if (GET_CODE (XEXP (exp, 0)) == SYMBOL_REF
975 && GET_CODE (XEXP (exp, 1)) == SYMBOL_REF)
976 exp = attr_rtx (GET_CODE (exp),
977 attr_rtx (SYMBOL_REF, XSTR (XEXP (exp, 0), 0)),
978 attr_rtx (SYMBOL_REF, XSTR (XEXP (exp, 1), 0)));
979 /* These cases can't be simplified. */
980 RTX_UNCHANGING_P (exp) = 1;
986 /* These cases are valid for constant attributes, but can't be
988 exp = attr_rtx (SYMBOL_REF, XSTR (exp, 0));
989 RTX_UNCHANGING_P (exp) = 1;
993 fatal ("RTL operator \"%s\" not valid in attribute test",
994 GET_RTX_NAME (GET_CODE (exp)));
1000 /* Given an expression, ensure that it is validly formed and that all named
1001 attribute values are valid for the given attribute. Issue a fatal error
1002 if not. If no attribute is specified, assume a numeric attribute.
1004 Return a perhaps modified replacement expression for the value. */
1007 check_attr_value (exp, attr)
1009 struct attr_desc *attr;
1011 struct attr_value *av;
1015 switch (GET_CODE (exp))
1018 if (attr && ! attr->is_numeric)
1019 fatal ("CONST_INT not valid for non-numeric `%s' attribute",
1022 if (INTVAL (exp) < 0)
1023 fatal ("Negative numeric value specified for `%s' attribute",
1029 if (! strcmp (XSTR (exp, 0), "*"))
1032 if (attr == 0 || attr->is_numeric)
1035 if (attr && attr->negative_ok && *p == '-')
1038 if (*p > '9' || *p < '0')
1039 fatal ("Non-numeric value for numeric `%s' attribute",
1040 attr ? attr->name : "internal");
1044 for (av = attr->first_value; av; av = av->next)
1045 if (GET_CODE (av->value) == CONST_STRING
1046 && ! strcmp (XSTR (av->value, 0), XSTR (exp, 0)))
1050 fatal ("Unknown value `%s' for `%s' attribute",
1051 XSTR (exp, 0), attr ? attr->name : "internal");
1056 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0),
1057 attr ? attr->is_const : 0);
1058 XEXP (exp, 1) = check_attr_value (XEXP (exp, 1), attr);
1059 XEXP (exp, 2) = check_attr_value (XEXP (exp, 2), attr);
1063 if (XVECLEN (exp, 0) % 2 != 0)
1064 fatal ("First operand of COND must have even length");
1066 for (i = 0; i < XVECLEN (exp, 0); i += 2)
1068 XVECEXP (exp, 0, i) = check_attr_test (XVECEXP (exp, 0, i),
1069 attr ? attr->is_const : 0);
1070 XVECEXP (exp, 0, i + 1)
1071 = check_attr_value (XVECEXP (exp, 0, i + 1), attr);
1074 XEXP (exp, 1) = check_attr_value (XEXP (exp, 1), attr);
1078 if (attr && attr->is_const)
1079 /* A constant SYMBOL_REF is valid as a constant attribute test and
1080 is expanded later by make_canonical into a COND. */
1081 return attr_rtx (SYMBOL_REF, XSTR (exp, 0));
1082 /* Otherwise, fall through... */
1085 fatal ("Illegal operation `%s' for attribute value",
1086 GET_RTX_NAME (GET_CODE (exp)));
1092 /* Given an SET_ATTR_ALTERNATIVE expression, convert to the canonical SET.
1093 It becomes a COND with each test being (eq_attr "alternative "n") */
1096 convert_set_attr_alternative (exp, num_alt, insn_code, insn_index)
1099 int insn_code, insn_index;
1104 if (XVECLEN (exp, 1) != num_alt)
1105 fatal ("Bad number of entries in SET_ATTR_ALTERNATIVE for insn %d",
1108 /* Make a COND with all tests but the last. Select the last value via the
1110 condexp = rtx_alloc (COND);
1111 XVEC (condexp, 0) = rtvec_alloc ((num_alt - 1) * 2);
1113 for (i = 0; i < num_alt - 1; i++)
1116 p = attr_numeral (i);
1118 XVECEXP (condexp, 0, 2 * i) = attr_eq (alternative_name, p);
1120 /* Sharing this EQ_ATTR rtl causes trouble. */
1121 XVECEXP (condexp, 0, 2 * i) = rtx_alloc (EQ_ATTR);
1122 XSTR (XVECEXP (condexp, 0, 2 * i), 0) = alternative_name;
1123 XSTR (XVECEXP (condexp, 0, 2 * i), 1) = p;
1125 XVECEXP (condexp, 0, 2 * i + 1) = XVECEXP (exp, 1, i);
1128 XEXP (condexp, 1) = XVECEXP (exp, 1, i);
1130 return attr_rtx (SET, attr_rtx (ATTR, XSTR (exp, 0)), condexp);
1133 /* Given a SET_ATTR, convert to the appropriate SET. If a comma-separated
1134 list of values is given, convert to SET_ATTR_ALTERNATIVE first. */
1137 convert_set_attr (exp, num_alt, insn_code, insn_index)
1140 int insn_code, insn_index;
1147 /* See how many alternative specified. */
1148 n = n_comma_elts (XSTR (exp, 1));
1150 return attr_rtx (SET,
1151 attr_rtx (ATTR, XSTR (exp, 0)),
1152 attr_rtx (CONST_STRING, XSTR (exp, 1)));
1154 newexp = rtx_alloc (SET_ATTR_ALTERNATIVE);
1155 XSTR (newexp, 0) = XSTR (exp, 0);
1156 XVEC (newexp, 1) = rtvec_alloc (n);
1158 /* Process each comma-separated name. */
1159 name_ptr = XSTR (exp, 1);
1161 while ((p = next_comma_elt (&name_ptr)) != NULL)
1162 XVECEXP (newexp, 1, n++) = attr_rtx (CONST_STRING, p);
1164 return convert_set_attr_alternative (newexp, num_alt, insn_code, insn_index);
1167 /* Scan all definitions, checking for validity. Also, convert any SET_ATTR
1168 and SET_ATTR_ALTERNATIVE expressions to the corresponding SET
1174 struct insn_def *id;
1175 struct attr_desc *attr;
1179 for (id = defs; id; id = id->next)
1181 if (XVEC (id->def, id->vec_idx) == NULL)
1184 for (i = 0; i < XVECLEN (id->def, id->vec_idx); i++)
1186 value = XVECEXP (id->def, id->vec_idx, i);
1187 switch (GET_CODE (value))
1190 if (GET_CODE (XEXP (value, 0)) != ATTR)
1191 fatal ("Bad attribute set in pattern %d", id->insn_index);
1194 case SET_ATTR_ALTERNATIVE:
1195 value = convert_set_attr_alternative (value,
1196 id->num_alternatives,
1202 value = convert_set_attr (value, id->num_alternatives,
1203 id->insn_code, id->insn_index);
1207 fatal ("Invalid attribute code `%s' for pattern %d",
1208 GET_RTX_NAME (GET_CODE (value)), id->insn_index);
1211 if ((attr = find_attr (XSTR (XEXP (value, 0), 0), 0)) == NULL)
1212 fatal ("Unknown attribute `%s' for pattern number %d",
1213 XSTR (XEXP (value, 0), 0), id->insn_index);
1215 XVECEXP (id->def, id->vec_idx, i) = value;
1216 XEXP (value, 1) = check_attr_value (XEXP (value, 1), attr);
1221 /* Given a constant SYMBOL_REF expression, convert to a COND that
1222 explicitly tests each enumerated value. */
1225 convert_const_symbol_ref (exp, attr)
1227 struct attr_desc *attr;
1230 struct attr_value *av;
1234 for (av = attr->first_value; av; av = av->next)
1237 /* Make a COND with all tests but the last, and in the original order.
1238 Select the last value via the default. Note that the attr values
1239 are constructed in reverse order. */
1241 condexp = rtx_alloc (COND);
1242 XVEC (condexp, 0) = rtvec_alloc ((num_alt - 1) * 2);
1243 av = attr->first_value;
1244 XEXP (condexp, 1) = av->value;
1246 for (i = num_alt - 2; av = av->next, i >= 0; i--)
1251 string = p = (char *) oballoc (2
1252 + strlen (attr->name)
1253 + strlen (XSTR (av->value, 0)));
1254 strcpy (p, attr->name);
1256 strcat (p, XSTR (av->value, 0));
1257 for (; *p != '\0'; p++)
1258 if (*p >= 'a' && *p <= 'z')
1261 value = attr_rtx (SYMBOL_REF, string);
1262 RTX_UNCHANGING_P (value) = 1;
1264 XVECEXP (condexp, 0, 2 * i) = attr_rtx (EQ, exp, value);
1266 XVECEXP (condexp, 0, 2 * i + 1) = av->value;
1272 /* Given a valid expression for an attribute value, remove any IF_THEN_ELSE
1273 expressions by converting them into a COND. This removes cases from this
1274 program. Also, replace an attribute value of "*" with the default attribute
1278 make_canonical (attr, exp)
1279 struct attr_desc *attr;
1285 switch (GET_CODE (exp))
1288 exp = make_numeric_value (INTVAL (exp));
1292 if (! strcmp (XSTR (exp, 0), "*"))
1294 if (attr == 0 || attr->default_val == 0)
1295 fatal ("(attr_value \"*\") used in invalid context.");
1296 exp = attr->default_val->value;
1302 if (!attr->is_const || RTX_UNCHANGING_P (exp))
1304 /* The SYMBOL_REF is constant for a given run, so mark it as unchanging.
1305 This makes the COND something that won't be considered an arbitrary
1306 expression by walk_attr_value. */
1307 RTX_UNCHANGING_P (exp) = 1;
1308 exp = convert_const_symbol_ref (exp, attr);
1309 RTX_UNCHANGING_P (exp) = 1;
1310 exp = check_attr_value (exp, attr);
1311 /* Goto COND case since this is now a COND. Note that while the
1312 new expression is rescanned, all symbol_ref notes are mared as
1317 newexp = rtx_alloc (COND);
1318 XVEC (newexp, 0) = rtvec_alloc (2);
1319 XVECEXP (newexp, 0, 0) = XEXP (exp, 0);
1320 XVECEXP (newexp, 0, 1) = XEXP (exp, 1);
1322 XEXP (newexp, 1) = XEXP (exp, 2);
1325 /* Fall through to COND case since this is now a COND. */
1333 /* First, check for degenerate COND. */
1334 if (XVECLEN (exp, 0) == 0)
1335 return make_canonical (attr, XEXP (exp, 1));
1336 defval = XEXP (exp, 1) = make_canonical (attr, XEXP (exp, 1));
1338 for (i = 0; i < XVECLEN (exp, 0); i += 2)
1340 XVECEXP (exp, 0, i) = copy_boolean (XVECEXP (exp, 0, i));
1341 XVECEXP (exp, 0, i + 1)
1342 = make_canonical (attr, XVECEXP (exp, 0, i + 1));
1343 if (! rtx_equal_p (XVECEXP (exp, 0, i + 1), defval))
1359 if (GET_CODE (exp) == AND || GET_CODE (exp) == IOR)
1360 return attr_rtx (GET_CODE (exp), copy_boolean (XEXP (exp, 0)),
1361 copy_boolean (XEXP (exp, 1)));
1365 /* Given a value and an attribute description, return a `struct attr_value *'
1366 that represents that value. This is either an existing structure, if the
1367 value has been previously encountered, or a newly-created structure.
1369 `insn_code' is the code of an insn whose attribute has the specified
1370 value (-2 if not processing an insn). We ensure that all insns for
1371 a given value have the same number of alternatives if the value checks
1374 static struct attr_value *
1375 get_attr_value (value, attr, insn_code)
1377 struct attr_desc *attr;
1380 struct attr_value *av;
1383 value = make_canonical (attr, value);
1384 if (compares_alternatives_p (value))
1386 if (insn_code < 0 || insn_alternatives == NULL)
1387 fatal ("(eq_attr \"alternatives\" ...) used in non-insn context");
1389 num_alt = insn_alternatives[insn_code];
1392 for (av = attr->first_value; av; av = av->next)
1393 if (rtx_equal_p (value, av->value)
1394 && (num_alt == 0 || av->first_insn == NULL
1395 || insn_alternatives[av->first_insn->insn_code]))
1398 av = (struct attr_value *) oballoc (sizeof (struct attr_value));
1400 av->next = attr->first_value;
1401 attr->first_value = av;
1402 av->first_insn = NULL;
1404 av->has_asm_insn = 0;
1409 /* After all DEFINE_DELAYs have been read in, create internal attributes
1410 to generate the required routines.
1412 First, we compute the number of delay slots for each insn (as a COND of
1413 each of the test expressions in DEFINE_DELAYs). Then, if more than one
1414 delay type is specified, we compute a similar function giving the
1415 DEFINE_DELAY ordinal for each insn.
1417 Finally, for each [DEFINE_DELAY, slot #] pair, we compute an attribute that
1418 tells whether a given insn can be in that delay slot.
1420 Normal attribute filling and optimization expands these to contain the
1421 information needed to handle delay slots. */
1426 struct delay_desc *delay;
1432 /* First, generate data for `num_delay_slots' function. */
1434 condexp = rtx_alloc (COND);
1435 XVEC (condexp, 0) = rtvec_alloc (num_delays * 2);
1436 XEXP (condexp, 1) = make_numeric_value (0);
1438 for (i = 0, delay = delays; delay; i += 2, delay = delay->next)
1440 XVECEXP (condexp, 0, i) = XEXP (delay->def, 0);
1441 XVECEXP (condexp, 0, i + 1)
1442 = make_numeric_value (XVECLEN (delay->def, 1) / 3);
1445 make_internal_attr ("*num_delay_slots", condexp, 0);
1447 /* If more than one delay type, do the same for computing the delay type. */
1450 condexp = rtx_alloc (COND);
1451 XVEC (condexp, 0) = rtvec_alloc (num_delays * 2);
1452 XEXP (condexp, 1) = make_numeric_value (0);
1454 for (i = 0, delay = delays; delay; i += 2, delay = delay->next)
1456 XVECEXP (condexp, 0, i) = XEXP (delay->def, 0);
1457 XVECEXP (condexp, 0, i + 1) = make_numeric_value (delay->num);
1460 make_internal_attr ("*delay_type", condexp, 1);
1463 /* For each delay possibility and delay slot, compute an eligibility
1464 attribute for non-annulled insns and for each type of annulled (annul
1465 if true and annul if false). */
1466 for (delay = delays; delay; delay = delay->next)
1468 for (i = 0; i < XVECLEN (delay->def, 1); i += 3)
1470 condexp = XVECEXP (delay->def, 1, i);
1471 if (condexp == 0) condexp = false_rtx;
1472 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1473 make_numeric_value (1), make_numeric_value (0));
1475 p = attr_printf (sizeof ("*delay__") + MAX_DIGITS*2, "*delay_%d_%d",
1477 make_internal_attr (p, newexp, 1);
1479 if (have_annul_true)
1481 condexp = XVECEXP (delay->def, 1, i + 1);
1482 if (condexp == 0) condexp = false_rtx;
1483 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1484 make_numeric_value (1),
1485 make_numeric_value (0));
1486 p = attr_printf (sizeof ("*annul_true__") + MAX_DIGITS*2,
1487 "*annul_true_%d_%d", delay->num, i / 3);
1488 make_internal_attr (p, newexp, 1);
1491 if (have_annul_false)
1493 condexp = XVECEXP (delay->def, 1, i + 2);
1494 if (condexp == 0) condexp = false_rtx;
1495 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1496 make_numeric_value (1),
1497 make_numeric_value (0));
1498 p = attr_printf (sizeof ("*annul_false__") + MAX_DIGITS*2,
1499 "*annul_false_%d_%d", delay->num, i / 3);
1500 make_internal_attr (p, newexp, 1);
1506 /* This function is given a left and right side expression and an operator.
1507 Each side is a conditional expression, each alternative of which has a
1508 numerical value. The function returns another conditional expression
1509 which, for every possible set of condition values, returns a value that is
1510 the operator applied to the values of the two sides.
1512 Since this is called early, it must also support IF_THEN_ELSE. */
1515 operate_exp (op, left, right)
1519 int left_value, right_value;
1523 /* If left is a string, apply operator to it and the right side. */
1524 if (GET_CODE (left) == CONST_STRING)
1526 /* If right is also a string, just perform the operation. */
1527 if (GET_CODE (right) == CONST_STRING)
1529 left_value = atoi (XSTR (left, 0));
1530 right_value = atoi (XSTR (right, 0));
1534 i = left_value + right_value;
1538 i = left_value - right_value;
1541 case POS_MINUS_OP: /* The positive part of LEFT - RIGHT. */
1542 if (left_value > right_value)
1543 i = left_value - right_value;
1549 i = left_value | right_value;
1553 i = left_value == right_value;
1557 i = (left_value << (HOST_BITS_PER_INT / 2)) | right_value;
1561 if (left_value > right_value)
1568 if (left_value < right_value)
1578 return make_numeric_value (i);
1580 else if (GET_CODE (right) == IF_THEN_ELSE)
1582 /* Apply recursively to all values within. */
1583 rtx newleft = operate_exp (op, left, XEXP (right, 1));
1584 rtx newright = operate_exp (op, left, XEXP (right, 2));
1585 if (rtx_equal_p (newleft, newright))
1587 return attr_rtx (IF_THEN_ELSE, XEXP (right, 0), newleft, newright);
1589 else if (GET_CODE (right) == COND)
1594 newexp = rtx_alloc (COND);
1595 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (right, 0));
1596 defval = XEXP (newexp, 1) = operate_exp (op, left, XEXP (right, 1));
1598 for (i = 0; i < XVECLEN (right, 0); i += 2)
1600 XVECEXP (newexp, 0, i) = XVECEXP (right, 0, i);
1601 XVECEXP (newexp, 0, i + 1)
1602 = operate_exp (op, left, XVECEXP (right, 0, i + 1));
1603 if (! rtx_equal_p (XVECEXP (newexp, 0, i + 1),
1608 /* If the resulting cond is trivial (all alternatives
1609 give the same value), optimize it away. */
1612 obstack_free (rtl_obstack, newexp);
1613 return operate_exp (op, left, XEXP (right, 1));
1616 /* If the result is the same as the RIGHT operand,
1618 if (rtx_equal_p (newexp, right))
1620 obstack_free (rtl_obstack, newexp);
1627 fatal ("Badly formed attribute value");
1630 /* Otherwise, do recursion the other way. */
1631 else if (GET_CODE (left) == IF_THEN_ELSE)
1633 rtx newleft = operate_exp (op, XEXP (left, 1), right);
1634 rtx newright = operate_exp (op, XEXP (left, 2), right);
1635 if (rtx_equal_p (newleft, newright))
1637 return attr_rtx (IF_THEN_ELSE, XEXP (left, 0), newleft, newright);
1639 else if (GET_CODE (left) == COND)
1644 newexp = rtx_alloc (COND);
1645 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (left, 0));
1646 defval = XEXP (newexp, 1) = operate_exp (op, XEXP (left, 1), right);
1648 for (i = 0; i < XVECLEN (left, 0); i += 2)
1650 XVECEXP (newexp, 0, i) = XVECEXP (left, 0, i);
1651 XVECEXP (newexp, 0, i + 1)
1652 = operate_exp (op, XVECEXP (left, 0, i + 1), right);
1653 if (! rtx_equal_p (XVECEXP (newexp, 0, i + 1),
1658 /* If the cond is trivial (all alternatives give the same value),
1659 optimize it away. */
1662 obstack_free (rtl_obstack, newexp);
1663 return operate_exp (op, XEXP (left, 1), right);
1666 /* If the result is the same as the LEFT operand,
1668 if (rtx_equal_p (newexp, left))
1670 obstack_free (rtl_obstack, newexp);
1678 fatal ("Badly formed attribute value.");
1683 /* Once all attributes and DEFINE_FUNCTION_UNITs have been read, we
1684 construct a number of attributes.
1686 The first produces a function `function_units_used' which is given an
1687 insn and produces an encoding showing which function units are required
1688 for the execution of that insn. If the value is non-negative, the insn
1689 uses that unit; otherwise, the value is a one's compliment mask of units
1692 The second produces a function `result_ready_cost' which is used to
1693 determine the time that the result of an insn will be ready and hence
1694 a worst-case schedule.
1696 Both of these produce quite complex expressions which are then set as the
1697 default value of internal attributes. Normal attribute simplification
1698 should produce reasonable expressions.
1700 For each unit, a `<name>_unit_ready_cost' function will take an
1701 insn and give the delay until that unit will be ready with the result
1702 and a `<name>_unit_conflict_cost' function is given an insn already
1703 executing on the unit and a candidate to execute and will give the
1704 cost from the time the executing insn started until the candidate
1705 can start (ignore limitations on the number of simultaneous insns).
1707 For each unit, a `<name>_unit_blockage' function is given an insn
1708 already executing on the unit and a candidate to execute and will
1709 give the delay incurred due to function unit conflicts. The range of
1710 blockage cost values for a given executing insn is given by the
1711 `<name>_unit_blockage_range' function. These values are encoded in
1712 an int where the upper half gives the minimum value and the lower
1713 half gives the maximum value. */
1718 struct function_unit *unit, **unit_num;
1719 struct function_unit_op *op, **op_array, ***unit_ops;
1724 int i, j, u, num, nvalues;
1726 /* Rebuild the condition for the unit to share the RTL expressions.
1727 Sharing is required by simplify_by_exploding. Build the issue delay
1728 expressions. Validate the expressions we were given for the conditions
1729 and conflict vector. Then make attributes for use in the conflict
1732 for (unit = units; unit; unit = unit->next)
1734 rtx min_issue = make_numeric_value (unit->issue_delay.min);
1736 unit->condexp = check_attr_test (unit->condexp, 0);
1738 for (op = unit->ops; op; op = op->next)
1740 rtx issue_delay = make_numeric_value (op->issue_delay);
1741 rtx issue_exp = issue_delay;
1743 /* Build, validate, and simplify the issue delay expression. */
1744 if (op->conflict_exp != true_rtx)
1745 issue_exp = attr_rtx (IF_THEN_ELSE, op->conflict_exp,
1746 issue_exp, make_numeric_value (0));
1747 issue_exp = check_attr_value (make_canonical (NULL_ATTR,
1750 issue_exp = simplify_knowing (issue_exp, unit->condexp);
1751 op->issue_exp = issue_exp;
1753 /* Make an attribute for use in the conflict function if needed. */
1754 unit->needs_conflict_function = (unit->issue_delay.min
1755 != unit->issue_delay.max);
1756 if (unit->needs_conflict_function)
1758 str = attr_printf (strlen (unit->name) + sizeof ("*_cost_") + MAX_DIGITS,
1759 "*%s_cost_%d", unit->name, op->num);
1760 make_internal_attr (str, issue_exp, 1);
1763 /* Validate the condition. */
1764 op->condexp = check_attr_test (op->condexp, 0);
1768 /* Compute the mask of function units used. Initially, the unitsmask is
1769 zero. Set up a conditional to compute each unit's contribution. */
1770 unitsmask = make_numeric_value (0);
1771 newexp = rtx_alloc (IF_THEN_ELSE);
1772 XEXP (newexp, 2) = make_numeric_value (0);
1774 /* Merge each function unit into the unit mask attributes. */
1775 for (unit = units; unit; unit = unit->next)
1777 XEXP (newexp, 0) = unit->condexp;
1778 XEXP (newexp, 1) = make_numeric_value (1 << unit->num);
1779 unitsmask = operate_exp (OR_OP, unitsmask, newexp);
1782 /* Simplify the unit mask expression, encode it, and make an attribute
1783 for the function_units_used function. */
1784 unitsmask = simplify_by_exploding (unitsmask);
1785 unitsmask = encode_units_mask (unitsmask);
1786 make_internal_attr ("*function_units_used", unitsmask, 2);
1788 /* Create an array of ops for each unit. Add an extra unit for the
1789 result_ready_cost function that has the ops of all other units. */
1790 unit_ops = (struct function_unit_op ***)
1791 alloca ((num_units + 1) * sizeof (struct function_unit_op **));
1792 unit_num = (struct function_unit **)
1793 alloca ((num_units + 1) * sizeof (struct function_unit *));
1795 unit_num[num_units] = unit = (struct function_unit *)
1796 alloca (sizeof (struct function_unit));
1797 unit->num = num_units;
1798 unit->num_opclasses = 0;
1800 for (unit = units; unit; unit = unit->next)
1802 unit_num[num_units]->num_opclasses += unit->num_opclasses;
1803 unit_num[unit->num] = unit;
1804 unit_ops[unit->num] = op_array = (struct function_unit_op **)
1805 alloca (unit->num_opclasses * sizeof (struct function_unit_op *));
1807 for (op = unit->ops; op; op = op->next)
1808 op_array[op->num] = op;
1811 /* Compose the array of ops for the extra unit. */
1812 unit_ops[num_units] = op_array = (struct function_unit_op **)
1813 alloca (unit_num[num_units]->num_opclasses
1814 * sizeof (struct function_unit_op *));
1816 for (unit = units, i = 0; unit; i += unit->num_opclasses, unit = unit->next)
1817 bcopy (unit_ops[unit->num], &op_array[i],
1818 unit->num_opclasses * sizeof (struct function_unit_op *));
1820 /* Compute the ready cost function for each unit by computing the
1821 condition for each non-default value. */
1822 for (u = 0; u <= num_units; u++)
1828 op_array = unit_ops[unit->num];
1829 num = unit->num_opclasses;
1831 /* Sort the array of ops into increasing ready cost order. */
1832 for (i = 0; i < num; i++)
1833 for (j = num - 1; j > i; j--)
1834 if (op_array[j-1]->ready < op_array[j]->ready)
1837 op_array[j] = op_array[j-1];
1841 /* Determine how many distinct non-default ready cost values there
1842 are. We use a default ready cost value of 1. */
1843 nvalues = 0; value = 1;
1844 for (i = num - 1; i >= 0; i--)
1845 if (op_array[i]->ready > value)
1847 value = op_array[i]->ready;
1852 readycost = make_numeric_value (1);
1855 /* Construct the ready cost expression as a COND of each value from
1856 the largest to the smallest. */
1857 readycost = rtx_alloc (COND);
1858 XVEC (readycost, 0) = rtvec_alloc (nvalues * 2);
1859 XEXP (readycost, 1) = make_numeric_value (1);
1861 nvalues = 0; orexp = false_rtx; value = op_array[0]->ready;
1862 for (i = 0; i < num; i++)
1867 else if (op->ready == value)
1868 orexp = insert_right_side (IOR, orexp, op->condexp, -2);
1871 XVECEXP (readycost, 0, nvalues * 2) = orexp;
1872 XVECEXP (readycost, 0, nvalues * 2 + 1)
1873 = make_numeric_value (value);
1876 orexp = op->condexp;
1879 XVECEXP (readycost, 0, nvalues * 2) = orexp;
1880 XVECEXP (readycost, 0, nvalues * 2 + 1) = make_numeric_value (value);
1885 rtx max_blockage = 0, min_blockage = 0;
1887 /* Simplify the readycost expression by only considering insns
1888 that use the unit. */
1889 readycost = simplify_knowing (readycost, unit->condexp);
1891 /* Determine the blockage cost the executing insn (E) given
1892 the candidate insn (C). This is the maximum of the issue
1893 delay, the pipeline delay, and the simultaneity constraint.
1894 Each function_unit_op represents the characteristics of the
1895 candidate insn, so in the expressions below, C is a known
1896 term and E is an unknown term.
1898 The issue delay function for C is op->issue_exp and is used to
1899 write the `<name>_unit_conflict_cost' function. Symbolicly
1900 this is "ISSUE-DELAY (E,C)".
1902 The pipeline delay results form the FIFO constraint on the
1903 function unit and is "READY-COST (E) + 1 - READY-COST (C)".
1905 The simultaneity constraint is based on how long it takes to
1906 fill the unit given the minimum issue delay. FILL-TIME is the
1907 constant "MIN (ISSUE-DELAY (*,*)) * (SIMULTANEITY - 1)", and
1908 the simultaneity constraint is "READY-COST (E) - FILL-TIME"
1909 if SIMULTANEITY is non-zero and zero otherwise.
1911 Thus, BLOCKAGE (E,C) when SIMULTANEITY is zero is
1913 MAX (ISSUE-DELAY (E,C),
1914 READY-COST (E) - (READY-COST (C) - 1))
1918 MAX (ISSUE-DELAY (E,C),
1919 READY-COST (E) - (READY-COST (C) - 1),
1920 READY-COST (E) - FILL-TIME)
1922 The `<name>_unit_blockage' function is computed by determining
1923 this value for each candidate insn. As these values are
1924 computed, we also compute the upper and lower bounds for
1925 BLOCKAGE (E,*). These are combined to form the function
1926 `<name>_unit_blockage_range'. Finally, the maximum blockage
1927 cost, MAX (BLOCKAGE (*,*)), is computed. */
1929 for (op = unit->ops; op; op = op->next)
1931 rtx blockage = readycost;
1932 int delay = op->ready - 1;
1934 if (unit->simultaneity != 0)
1935 delay = MIN (delay, ((unit->simultaneity - 1)
1936 * unit->issue_delay.min));
1939 blockage = operate_exp (POS_MINUS_OP, blockage,
1940 make_numeric_value (delay));
1942 blockage = operate_exp (MAX_OP, blockage, op->issue_exp);
1943 blockage = simplify_knowing (blockage, unit->condexp);
1945 /* Add this op's contribution to MAX (BLOCKAGE (E,*)) and
1946 MIN (BLOCKAGE (E,*)). */
1947 if (max_blockage == 0)
1948 max_blockage = min_blockage = blockage;
1952 = simplify_knowing (operate_exp (MAX_OP, max_blockage,
1956 = simplify_knowing (operate_exp (MIN_OP, min_blockage,
1961 /* Make an attribute for use in the blockage function. */
1962 str = attr_printf (strlen (unit->name) + sizeof ("*_block_") + MAX_DIGITS,
1963 "*%s_block_%d", unit->name, op->num);
1964 make_internal_attr (str, blockage, 1);
1967 /* Record MAX (BLOCKAGE (*,*)). */
1968 unit->max_blockage = max_attr_value (max_blockage);
1970 /* See if the upper and lower bounds of BLOCKAGE (E,*) are the
1971 same. If so, the blockage function carries no additional
1972 information and is not written. */
1973 newexp = operate_exp (EQ_OP, max_blockage, min_blockage);
1974 newexp = simplify_knowing (newexp, unit->condexp);
1975 unit->needs_blockage_function
1976 = (GET_CODE (newexp) != CONST_STRING
1977 || atoi (XSTR (newexp, 0)) != 1);
1979 /* If the all values of BLOCKAGE (E,C) have the same value,
1980 neither blockage function is written. */
1981 unit->needs_range_function
1982 = (unit->needs_blockage_function
1983 || GET_CODE (max_blockage) != CONST_STRING);
1985 if (unit->needs_range_function)
1987 /* Compute the blockage range function and make an attribute
1988 for writing it's value. */
1989 newexp = operate_exp (RANGE_OP, min_blockage, max_blockage);
1990 newexp = simplify_knowing (newexp, unit->condexp);
1992 str = attr_printf (strlen (unit->name) + sizeof ("*_unit_blockage_range"),
1993 "*%s_unit_blockage_range", unit->name);
1994 make_internal_attr (str, newexp, 4);
1997 str = attr_printf (strlen (unit->name) + sizeof ("*_unit_ready_cost"),
1998 "*%s_unit_ready_cost", unit->name);
2001 str = "*result_ready_cost";
2003 /* Make an attribute for the ready_cost function. Simplifying
2004 further with simplify_by_exploding doesn't win. */
2005 make_internal_attr (str, readycost, 0);
2008 /* For each unit that requires a conflict cost function, make an attribute
2009 that maps insns to the operation number. */
2010 for (unit = units; unit; unit = unit->next)
2014 if (! unit->needs_conflict_function
2015 && ! unit->needs_blockage_function)
2018 caseexp = rtx_alloc (COND);
2019 XVEC (caseexp, 0) = rtvec_alloc ((unit->num_opclasses - 1) * 2);
2021 for (op = unit->ops; op; op = op->next)
2023 /* Make our adjustment to the COND being computed. If we are the
2024 last operation class, place our values into the default of the
2026 if (op->num == unit->num_opclasses - 1)
2028 XEXP (caseexp, 1) = make_numeric_value (op->num);
2032 XVECEXP (caseexp, 0, op->num * 2) = op->condexp;
2033 XVECEXP (caseexp, 0, op->num * 2 + 1)
2034 = make_numeric_value (op->num);
2038 /* Simplifying caseexp with simplify_by_exploding doesn't win. */
2039 str = attr_printf (strlen (unit->name) + sizeof ("*_cases"),
2040 "*%s_cases", unit->name);
2041 make_internal_attr (str, caseexp, 1);
2045 /* Simplify EXP given KNOWN_TRUE. */
2048 simplify_knowing (exp, known_true)
2049 rtx exp, known_true;
2051 if (GET_CODE (exp) != CONST_STRING)
2053 exp = attr_rtx (IF_THEN_ELSE, known_true, exp,
2054 make_numeric_value (max_attr_value (exp)));
2055 exp = simplify_by_exploding (exp);
2060 /* Translate the CONST_STRING expressions in X to change the encoding of
2061 value. On input, the value is a bitmask with a one bit for each unit
2062 used; on output, the value is the unit number (zero based) if one
2063 and only one unit is used or the one's compliment of the bitmask. */
2066 encode_units_mask (x)
2071 register enum rtx_code code;
2074 code = GET_CODE (x);
2079 i = atoi (XSTR (x, 0));
2081 abort (); /* The sign bit encodes a one's compliment mask. */
2082 else if (i != 0 && i == (i & -i))
2083 /* Only one bit is set, so yield that unit number. */
2084 for (j = 0; (i >>= 1) != 0; j++)
2088 return attr_rtx (CONST_STRING, attr_printf (MAX_DIGITS, "%d", j));
2102 /* Compare the elements. If any pair of corresponding elements
2103 fail to match, return 0 for the whole things. */
2105 fmt = GET_RTX_FORMAT (code);
2106 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2112 for (j = 0; j < XVECLEN (x, i); j++)
2113 XVECEXP (x, i, j) = encode_units_mask (XVECEXP (x, i, j));
2117 XEXP (x, i) = encode_units_mask (XEXP (x, i));
2124 /* Once all attributes and insns have been read and checked, we construct for
2125 each attribute value a list of all the insns that have that value for
2130 struct attr_desc *attr;
2132 struct attr_value *av;
2133 struct insn_ent *ie;
2134 struct insn_def *id;
2138 /* Don't fill constant attributes. The value is independent of
2139 any particular insn. */
2143 for (id = defs; id; id = id->next)
2145 /* If no value is specified for this insn for this attribute, use the
2148 if (XVEC (id->def, id->vec_idx))
2149 for (i = 0; i < XVECLEN (id->def, id->vec_idx); i++)
2150 if (! strcmp (XSTR (XEXP (XVECEXP (id->def, id->vec_idx, i), 0), 0),
2152 value = XEXP (XVECEXP (id->def, id->vec_idx, i), 1);
2155 av = attr->default_val;
2157 av = get_attr_value (value, attr, id->insn_code);
2159 ie = (struct insn_ent *) oballoc (sizeof (struct insn_ent));
2160 ie->insn_code = id->insn_code;
2161 ie->insn_index = id->insn_code;
2162 insert_insn_ent (av, ie);
2166 /* Given an expression EXP, see if it is a COND or IF_THEN_ELSE that has a
2167 test that checks relative positions of insns (uses MATCH_DUP or PC).
2168 If so, replace it with what is obtained by passing the expression to
2169 ADDRESS_FN. If not but it is a COND or IF_THEN_ELSE, call this routine
2170 recursively on each value (including the default value). Otherwise,
2171 return the value returned by NO_ADDRESS_FN applied to EXP. */
2174 substitute_address (exp, no_address_fn, address_fn)
2176 rtx (*no_address_fn) ();
2177 rtx (*address_fn) ();
2182 if (GET_CODE (exp) == COND)
2184 /* See if any tests use addresses. */
2186 for (i = 0; i < XVECLEN (exp, 0); i += 2)
2187 walk_attr_value (XVECEXP (exp, 0, i));
2190 return (*address_fn) (exp);
2192 /* Make a new copy of this COND, replacing each element. */
2193 newexp = rtx_alloc (COND);
2194 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (exp, 0));
2195 for (i = 0; i < XVECLEN (exp, 0); i += 2)
2197 XVECEXP (newexp, 0, i) = XVECEXP (exp, 0, i);
2198 XVECEXP (newexp, 0, i + 1)
2199 = substitute_address (XVECEXP (exp, 0, i + 1),
2200 no_address_fn, address_fn);
2203 XEXP (newexp, 1) = substitute_address (XEXP (exp, 1),
2204 no_address_fn, address_fn);
2209 else if (GET_CODE (exp) == IF_THEN_ELSE)
2212 walk_attr_value (XEXP (exp, 0));
2214 return (*address_fn) (exp);
2216 return attr_rtx (IF_THEN_ELSE,
2217 substitute_address (XEXP (exp, 0),
2218 no_address_fn, address_fn),
2219 substitute_address (XEXP (exp, 1),
2220 no_address_fn, address_fn),
2221 substitute_address (XEXP (exp, 2),
2222 no_address_fn, address_fn));
2225 return (*no_address_fn) (exp);
2228 /* Make new attributes from the `length' attribute. The following are made,
2229 each corresponding to a function called from `shorten_branches' or
2232 *insn_default_length This is the length of the insn to be returned
2233 by `get_attr_length' before `shorten_branches'
2234 has been called. In each case where the length
2235 depends on relative addresses, the largest
2236 possible is used. This routine is also used
2237 to compute the initial size of the insn.
2239 *insn_variable_length_p This returns 1 if the insn's length depends
2240 on relative addresses, zero otherwise.
2242 *insn_current_length This is only called when it is known that the
2243 insn has a variable length and returns the
2244 current length, based on relative addresses.
2248 make_length_attrs ()
2250 static char *new_names[] = {"*insn_default_length",
2251 "*insn_variable_length_p",
2252 "*insn_current_length"};
2253 static rtx (*no_address_fn[]) () = {identity_fn, zero_fn, zero_fn};
2254 static rtx (*address_fn[]) () = {max_fn, one_fn, identity_fn};
2256 struct attr_desc *length_attr, *new_attr;
2257 struct attr_value *av, *new_av;
2258 struct insn_ent *ie, *new_ie;
2260 /* See if length attribute is defined. If so, it must be numeric. Make
2261 it special so we don't output anything for it. */
2262 length_attr = find_attr ("length", 0);
2263 if (length_attr == 0)
2266 if (! length_attr->is_numeric)
2267 fatal ("length attribute must be numeric.");
2269 length_attr->is_const = 0;
2270 length_attr->is_special = 1;
2272 /* Make each new attribute, in turn. */
2273 for (i = 0; i < sizeof new_names / sizeof new_names[0]; i++)
2275 make_internal_attr (new_names[i],
2276 substitute_address (length_attr->default_val->value,
2277 no_address_fn[i], address_fn[i]),
2279 new_attr = find_attr (new_names[i], 0);
2280 for (av = length_attr->first_value; av; av = av->next)
2281 for (ie = av->first_insn; ie; ie = ie->next)
2283 new_av = get_attr_value (substitute_address (av->value,
2286 new_attr, ie->insn_code);
2287 new_ie = (struct insn_ent *) oballoc (sizeof (struct insn_ent));
2288 new_ie->insn_code = ie->insn_code;
2289 new_ie->insn_index = ie->insn_index;
2290 insert_insn_ent (new_av, new_ie);
2295 /* Utility functions called from above routine. */
2308 return make_numeric_value (0);
2315 return make_numeric_value (1);
2322 return make_numeric_value (max_attr_value (exp));
2325 /* Take a COND expression and see if any of the conditions in it can be
2326 simplified. If any are known true or known false for the particular insn
2327 code, the COND can be further simplified.
2329 Also call ourselves on any COND operations that are values of this COND.
2331 We do not modify EXP; rather, we make and return a new rtx. */
2334 simplify_cond (exp, insn_code, insn_index)
2336 int insn_code, insn_index;
2339 /* We store the desired contents here,
2340 then build a new expression if they don't match EXP. */
2341 rtx defval = XEXP (exp, 1);
2342 rtx new_defval = XEXP (exp, 1);
2344 int len = XVECLEN (exp, 0);
2345 rtx *tests = (rtx *) alloca (len * sizeof (rtx));
2349 /* This lets us free all storage allocated below, if appropriate. */
2350 first_spacer = (char *) obstack_finish (rtl_obstack);
2352 bcopy (&XVECEXP (exp, 0, 0), tests, len * sizeof (rtx));
2354 /* See if default value needs simplification. */
2355 if (GET_CODE (defval) == COND)
2356 new_defval = simplify_cond (defval, insn_code, insn_index);
2358 /* Simplify the subexpressions, and see what tests we can get rid of. */
2360 for (i = 0; i < len; i += 2)
2362 rtx newtest, newval;
2364 /* Simplify this test. */
2365 newtest = SIMPLIFY_TEST_EXP (tests[i], insn_code, insn_index);
2368 newval = tests[i + 1];
2369 /* See if this value may need simplification. */
2370 if (GET_CODE (newval) == COND)
2371 newval = simplify_cond (newval, insn_code, insn_index);
2373 /* Look for ways to delete or combine this test. */
2374 if (newtest == true_rtx)
2376 /* If test is true, make this value the default
2377 and discard this + any following tests. */
2379 defval = tests[i + 1];
2380 new_defval = newval;
2383 else if (newtest == false_rtx)
2385 /* If test is false, discard it and its value. */
2386 for (j = i; j < len - 2; j++)
2387 tests[j] = tests[j + 2];
2391 else if (i > 0 && attr_equal_p (newval, tests[i - 1]))
2393 /* If this value and the value for the prev test are the same,
2397 = insert_right_side (IOR, tests[i - 2], newtest,
2398 insn_code, insn_index);
2400 /* Delete this test/value. */
2401 for (j = i; j < len - 2; j++)
2402 tests[j] = tests[j + 2];
2407 tests[i + 1] = newval;
2410 /* If the last test in a COND has the same value
2411 as the default value, that test isn't needed. */
2413 while (len > 0 && attr_equal_p (tests[len - 1], new_defval))
2416 /* See if we changed anything. */
2417 if (len != XVECLEN (exp, 0) || new_defval != XEXP (exp, 1))
2420 for (i = 0; i < len; i++)
2421 if (! attr_equal_p (tests[i], XVECEXP (exp, 0, i)))
2429 obstack_free (rtl_obstack, first_spacer);
2430 if (GET_CODE (defval) == COND)
2431 return simplify_cond (defval, insn_code, insn_index);
2436 obstack_free (rtl_obstack, first_spacer);
2441 rtx newexp = rtx_alloc (COND);
2443 XVEC (newexp, 0) = rtvec_alloc (len);
2444 bcopy (tests, &XVECEXP (newexp, 0, 0), len * sizeof (rtx));
2445 XEXP (newexp, 1) = new_defval;
2450 /* Remove an insn entry from an attribute value. */
2453 remove_insn_ent (av, ie)
2454 struct attr_value *av;
2455 struct insn_ent *ie;
2457 struct insn_ent *previe;
2459 if (av->first_insn == ie)
2460 av->first_insn = ie->next;
2463 for (previe = av->first_insn; previe->next != ie; previe = previe->next)
2465 previe->next = ie->next;
2469 if (ie->insn_code == -1)
2470 av->has_asm_insn = 0;
2473 /* Insert an insn entry in an attribute value list. */
2476 insert_insn_ent (av, ie)
2477 struct attr_value *av;
2478 struct insn_ent *ie;
2480 ie->next = av->first_insn;
2481 av->first_insn = ie;
2483 if (ie->insn_code == -1)
2484 av->has_asm_insn = 1;
2487 /* This is a utility routine to take an expression that is a tree of either
2488 AND or IOR expressions and insert a new term. The new term will be
2489 inserted at the right side of the first node whose code does not match
2490 the root. A new node will be created with the root's code. Its left
2491 side will be the old right side and its right side will be the new
2494 If the `term' is itself a tree, all its leaves will be inserted. */
2497 insert_right_side (code, exp, term, insn_code, insn_index)
2501 int insn_code, insn_index;
2505 /* Avoid consing in some special cases. */
2506 if (code == AND && term == true_rtx)
2508 if (code == AND && term == false_rtx)
2510 if (code == AND && exp == true_rtx)
2512 if (code == AND && exp == false_rtx)
2514 if (code == IOR && term == true_rtx)
2516 if (code == IOR && term == false_rtx)
2518 if (code == IOR && exp == true_rtx)
2520 if (code == IOR && exp == false_rtx)
2522 if (attr_equal_p (exp, term))
2525 if (GET_CODE (term) == code)
2527 exp = insert_right_side (code, exp, XEXP (term, 0),
2528 insn_code, insn_index);
2529 exp = insert_right_side (code, exp, XEXP (term, 1),
2530 insn_code, insn_index);
2535 if (GET_CODE (exp) == code)
2537 rtx new = insert_right_side (code, XEXP (exp, 1),
2538 term, insn_code, insn_index);
2539 if (new != XEXP (exp, 1))
2540 /* Make a copy of this expression and call recursively. */
2541 newexp = attr_rtx (code, XEXP (exp, 0), new);
2547 /* Insert the new term. */
2548 newexp = attr_rtx (code, exp, term);
2551 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2554 /* If we have an expression which AND's a bunch of
2555 (not (eq_attrq "alternative" "n"))
2556 terms, we may have covered all or all but one of the possible alternatives.
2557 If so, we can optimize. Similarly for IOR's of EQ_ATTR.
2559 This routine is passed an expression and either AND or IOR. It returns a
2560 bitmask indicating which alternatives are present.
2561 ??? What does "present" mean? */
2564 compute_alternative_mask (exp, code)
2569 if (GET_CODE (exp) == code)
2570 return compute_alternative_mask (XEXP (exp, 0), code)
2571 | compute_alternative_mask (XEXP (exp, 1), code);
2573 else if (code == AND && GET_CODE (exp) == NOT
2574 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
2575 && XSTR (XEXP (exp, 0), 0) == alternative_name)
2576 string = XSTR (XEXP (exp, 0), 1);
2578 else if (code == IOR && GET_CODE (exp) == EQ_ATTR
2579 && XSTR (exp, 0) == alternative_name)
2580 string = XSTR (exp, 1);
2586 return 1 << (string[0] - '0');
2587 return 1 << atoi (string);
2590 /* Given I, a single-bit mask, return RTX to compare the `alternative'
2591 attribute with the value represented by that bit. */
2594 make_alternative_compare (mask)
2601 for (i = 0; (mask & (1 << i)) == 0; i++)
2604 newexp = attr_rtx (EQ_ATTR, alternative_name, attr_numeral (i));
2605 RTX_UNCHANGING_P (newexp) = 1;
2610 /* If we are processing an (eq_attr "attr" "value") test, we find the value
2611 of "attr" for this insn code. From that value, we can compute a test
2612 showing when the EQ_ATTR will be true. This routine performs that
2613 computation. If a test condition involves an address, we leave the EQ_ATTR
2614 intact because addresses are only valid for the `length' attribute. */
2616 /* ??? Kenner, document the meanings of the arguments!!! */
2619 evaluate_eq_attr (exp, value, insn_code, insn_index)
2622 int insn_code, insn_index;
2629 if (GET_CODE (value) == CONST_STRING)
2631 if (! strcmp (XSTR (value, 0), XSTR (exp, 1)))
2636 else if (GET_CODE (value) == COND)
2638 /* We construct an IOR of all the cases for which the requested attribute
2639 value is present. Since we start with FALSE, if it is not present,
2640 FALSE will be returned.
2642 Each case is the AND of the NOT's of the previous conditions with the
2643 current condition; in the default case the current condition is TRUE.
2645 For each possible COND value, call ourselves recursively.
2647 The extra TRUE and FALSE expressions will be eliminated by another
2648 call to the simplification routine. */
2653 if (current_alternative_string)
2654 clear_struct_flag (value);
2656 for (i = 0; i < XVECLEN (value, 0); i += 2)
2658 rtx this = SIMPLIFY_TEST_EXP (XVECEXP (value, 0, i),
2659 insn_code, insn_index);
2661 SIMPLIFY_ALTERNATIVE (this);
2663 right = insert_right_side (AND, andexp, this,
2664 insn_code, insn_index);
2665 right = insert_right_side (AND, right,
2666 evaluate_eq_attr (exp, XVECEXP (value, 0, i + 1),
2667 insn_code, insn_index),
2668 insn_code, insn_index);
2669 orexp = insert_right_side (IOR, orexp, right,
2670 insn_code, insn_index);
2672 /* Add this condition into the AND expression. */
2673 newexp = attr_rtx (NOT, this);
2674 andexp = insert_right_side (AND, andexp, newexp,
2675 insn_code, insn_index);
2678 /* Handle the default case. */
2679 right = insert_right_side (AND, andexp,
2680 evaluate_eq_attr (exp, XEXP (value, 1),
2681 insn_code, insn_index),
2682 insn_code, insn_index);
2683 newexp = insert_right_side (IOR, orexp, right, insn_code, insn_index);
2688 /* If uses an address, must return original expression. But set the
2689 RTX_UNCHANGING_P bit so we don't try to simplify it again. */
2692 walk_attr_value (newexp);
2696 /* This had `&& current_alternative_string', which seems to be wrong. */
2697 if (! RTX_UNCHANGING_P (exp))
2698 return copy_rtx_unchanging (exp);
2705 /* This routine is called when an AND of a term with a tree of AND's is
2706 encountered. If the term or its complement is present in the tree, it
2707 can be replaced with TRUE or FALSE, respectively.
2709 Note that (eq_attr "att" "v1") and (eq_attr "att" "v2") cannot both
2710 be true and hence are complementary.
2712 There is one special case: If we see
2713 (and (not (eq_attr "att" "v1"))
2714 (eq_attr "att" "v2"))
2715 this can be replaced by (eq_attr "att" "v2"). To do this we need to
2716 replace the term, not anything in the AND tree. So we pass a pointer to
2720 simplify_and_tree (exp, pterm, insn_code, insn_index)
2723 int insn_code, insn_index;
2728 int left_eliminates_term, right_eliminates_term;
2730 if (GET_CODE (exp) == AND)
2732 left = simplify_and_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
2733 right = simplify_and_tree (XEXP (exp, 1), pterm, insn_code, insn_index);
2734 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2736 newexp = attr_rtx (GET_CODE (exp), left, right);
2738 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2742 else if (GET_CODE (exp) == IOR)
2744 /* For the IOR case, we do the same as above, except that we can
2745 only eliminate `term' if both sides of the IOR would do so. */
2747 left = simplify_and_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
2748 left_eliminates_term = (temp == true_rtx);
2751 right = simplify_and_tree (XEXP (exp, 1), &temp, insn_code, insn_index);
2752 right_eliminates_term = (temp == true_rtx);
2754 if (left_eliminates_term && right_eliminates_term)
2757 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2759 newexp = attr_rtx (GET_CODE (exp), left, right);
2761 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2765 /* Check for simplifications. Do some extra checking here since this
2766 routine is called so many times. */
2771 else if (GET_CODE (exp) == NOT && XEXP (exp, 0) == *pterm)
2774 else if (GET_CODE (*pterm) == NOT && exp == XEXP (*pterm, 0))
2777 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == EQ_ATTR)
2779 if (XSTR (exp, 0) != XSTR (*pterm, 0))
2782 if (! strcmp (XSTR (exp, 1), XSTR (*pterm, 1)))
2788 else if (GET_CODE (*pterm) == EQ_ATTR && GET_CODE (exp) == NOT
2789 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR)
2791 if (XSTR (*pterm, 0) != XSTR (XEXP (exp, 0), 0))
2794 if (! strcmp (XSTR (*pterm, 1), XSTR (XEXP (exp, 0), 1)))
2800 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == NOT
2801 && GET_CODE (XEXP (*pterm, 0)) == EQ_ATTR)
2803 if (XSTR (exp, 0) != XSTR (XEXP (*pterm, 0), 0))
2806 if (! strcmp (XSTR (exp, 1), XSTR (XEXP (*pterm, 0), 1)))
2812 else if (GET_CODE (exp) == NOT && GET_CODE (*pterm) == NOT)
2814 if (attr_equal_p (XEXP (exp, 0), XEXP (*pterm, 0)))
2818 else if (GET_CODE (exp) == NOT)
2820 if (attr_equal_p (XEXP (exp, 0), *pterm))
2824 else if (GET_CODE (*pterm) == NOT)
2826 if (attr_equal_p (XEXP (*pterm, 0), exp))
2830 else if (attr_equal_p (exp, *pterm))
2836 /* Similar to `simplify_and_tree', but for IOR trees. */
2839 simplify_or_tree (exp, pterm, insn_code, insn_index)
2842 int insn_code, insn_index;
2847 int left_eliminates_term, right_eliminates_term;
2849 if (GET_CODE (exp) == IOR)
2851 left = simplify_or_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
2852 right = simplify_or_tree (XEXP (exp, 1), pterm, insn_code, insn_index);
2853 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2855 newexp = attr_rtx (GET_CODE (exp), left, right);
2857 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2861 else if (GET_CODE (exp) == AND)
2863 /* For the AND case, we do the same as above, except that we can
2864 only eliminate `term' if both sides of the AND would do so. */
2866 left = simplify_or_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
2867 left_eliminates_term = (temp == false_rtx);
2870 right = simplify_or_tree (XEXP (exp, 1), &temp, insn_code, insn_index);
2871 right_eliminates_term = (temp == false_rtx);
2873 if (left_eliminates_term && right_eliminates_term)
2876 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2878 newexp = attr_rtx (GET_CODE (exp), left, right);
2880 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2884 if (attr_equal_p (exp, *pterm))
2887 else if (GET_CODE (exp) == NOT && attr_equal_p (XEXP (exp, 0), *pterm))
2890 else if (GET_CODE (*pterm) == NOT && attr_equal_p (XEXP (*pterm, 0), exp))
2893 else if (GET_CODE (*pterm) == EQ_ATTR && GET_CODE (exp) == NOT
2894 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
2895 && XSTR (*pterm, 0) == XSTR (XEXP (exp, 0), 0))
2898 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == NOT
2899 && GET_CODE (XEXP (*pterm, 0)) == EQ_ATTR
2900 && XSTR (exp, 0) == XSTR (XEXP (*pterm, 0), 0))
2906 /* Given an expression, see if it can be simplified for a particular insn
2907 code based on the values of other attributes being tested. This can
2908 eliminate nested get_attr_... calls.
2910 Note that if an endless recursion is specified in the patterns, the
2911 optimization will loop. However, it will do so in precisely the cases where
2912 an infinite recursion loop could occur during compilation. It's better that
2916 simplify_test_exp (exp, insn_code, insn_index)
2918 int insn_code, insn_index;
2921 struct attr_desc *attr;
2922 struct attr_value *av;
2923 struct insn_ent *ie;
2926 char *spacer = (char *) obstack_finish (rtl_obstack);
2928 static rtx loser = 0;
2929 static int count = 0;
2930 static stopcount = 0;
2935 if (count == stopcount)
2938 /* Don't re-simplify something we already simplified. */
2939 if (RTX_UNCHANGING_P (exp) || MEM_IN_STRUCT_P (exp))
2942 switch (GET_CODE (exp))
2945 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
2946 SIMPLIFY_ALTERNATIVE (left);
2947 if (left == false_rtx)
2949 obstack_free (rtl_obstack, spacer);
2952 right = SIMPLIFY_TEST_EXP (XEXP (exp, 1), insn_code, insn_index);
2953 SIMPLIFY_ALTERNATIVE (right);
2954 if (left == false_rtx)
2956 obstack_free (rtl_obstack, spacer);
2960 /* If either side is an IOR and we have (eq_attr "alternative" ..")
2961 present on both sides, apply the distributive law since this will
2962 yield simplifications. */
2963 if ((GET_CODE (left) == IOR || GET_CODE (right) == IOR)
2964 && compute_alternative_mask (left, IOR)
2965 && compute_alternative_mask (right, IOR))
2967 if (GET_CODE (left) == IOR)
2974 newexp = attr_rtx (IOR,
2975 attr_rtx (AND, left, XEXP (right, 0)),
2976 attr_rtx (AND, left, XEXP (right, 1)));
2978 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2981 /* Try with the term on both sides. */
2982 right = simplify_and_tree (right, &left, insn_code, insn_index);
2983 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
2984 left = simplify_and_tree (left, &right, insn_code, insn_index);
2986 if (left == false_rtx || right == false_rtx)
2988 obstack_free (rtl_obstack, spacer);
2991 else if (left == true_rtx)
2995 else if (right == true_rtx)
2999 /* See if all or all but one of the insn's alternatives are specified
3000 in this tree. Optimize if so. */
3002 else if (insn_code >= 0
3003 && (GET_CODE (left) == AND
3004 || (GET_CODE (left) == NOT
3005 && GET_CODE (XEXP (left, 0)) == EQ_ATTR
3006 && XSTR (XEXP (left, 0), 0) == alternative_name)
3007 || GET_CODE (right) == AND
3008 || (GET_CODE (right) == NOT
3009 && GET_CODE (XEXP (right, 0)) == EQ_ATTR
3010 && XSTR (XEXP (right, 0), 0) == alternative_name)))
3012 i = compute_alternative_mask (exp, AND);
3013 if (i & ~insn_alternatives[insn_code])
3014 fatal ("Illegal alternative specified for pattern number %d",
3017 /* If all alternatives are excluded, this is false. */
3018 i ^= insn_alternatives[insn_code];
3021 else if ((i & (i - 1)) == 0 && insn_alternatives[insn_code] > 1)
3023 /* If just one excluded, AND a comparison with that one to the
3024 front of the tree. The others will be eliminated by
3025 optimization. We do not want to do this if the insn has one
3026 alternative and we have tested none of them! */
3027 left = make_alternative_compare (i);
3028 right = simplify_and_tree (exp, &left, insn_code, insn_index);
3029 newexp = attr_rtx (AND, left, right);
3031 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3035 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3037 newexp = attr_rtx (AND, left, right);
3038 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3043 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3044 SIMPLIFY_ALTERNATIVE (left);
3045 if (left == true_rtx)
3047 obstack_free (rtl_obstack, spacer);
3050 right = SIMPLIFY_TEST_EXP (XEXP (exp, 1), insn_code, insn_index);
3051 SIMPLIFY_ALTERNATIVE (right);
3052 if (right == true_rtx)
3054 obstack_free (rtl_obstack, spacer);
3058 right = simplify_or_tree (right, &left, insn_code, insn_index);
3059 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
3060 left = simplify_or_tree (left, &right, insn_code, insn_index);
3062 if (right == true_rtx || left == true_rtx)
3064 obstack_free (rtl_obstack, spacer);
3067 else if (left == false_rtx)
3071 else if (right == false_rtx)
3076 /* Test for simple cases where the distributive law is useful. I.e.,
3077 convert (ior (and (x) (y))
3083 else if (GET_CODE (left) == AND && GET_CODE (right) == AND
3084 && attr_equal_p (XEXP (left, 0), XEXP (right, 0)))
3086 newexp = attr_rtx (IOR, XEXP (left, 1), XEXP (right, 1));
3088 left = XEXP (left, 0);
3090 newexp = attr_rtx (AND, left, right);
3091 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3094 /* See if all or all but one of the insn's alternatives are specified
3095 in this tree. Optimize if so. */
3097 else if (insn_code >= 0
3098 && (GET_CODE (left) == IOR
3099 || (GET_CODE (left) == EQ_ATTR
3100 && XSTR (left, 0) == alternative_name)
3101 || GET_CODE (right) == IOR
3102 || (GET_CODE (right) == EQ_ATTR
3103 && XSTR (right, 0) == alternative_name)))
3105 i = compute_alternative_mask (exp, IOR);
3106 if (i & ~insn_alternatives[insn_code])
3107 fatal ("Illegal alternative specified for pattern number %d",
3110 /* If all alternatives are included, this is true. */
3111 i ^= insn_alternatives[insn_code];
3114 else if ((i & (i - 1)) == 0 && insn_alternatives[insn_code] > 1)
3116 /* If just one excluded, IOR a comparison with that one to the
3117 front of the tree. The others will be eliminated by
3118 optimization. We do not want to do this if the insn has one
3119 alternative and we have tested none of them! */
3120 left = make_alternative_compare (i);
3121 right = simplify_and_tree (exp, &left, insn_code, insn_index);
3122 newexp = attr_rtx (IOR, attr_rtx (NOT, left), right);
3124 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3128 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3130 newexp = attr_rtx (IOR, left, right);
3131 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3136 if (GET_CODE (XEXP (exp, 0)) == NOT)
3138 left = SIMPLIFY_TEST_EXP (XEXP (XEXP (exp, 0), 0),
3139 insn_code, insn_index);
3140 SIMPLIFY_ALTERNATIVE (left);
3144 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3145 SIMPLIFY_ALTERNATIVE (left);
3146 if (GET_CODE (left) == NOT)
3147 return XEXP (left, 0);
3149 if (left == false_rtx)
3151 obstack_free (rtl_obstack, spacer);
3154 else if (left == true_rtx)
3156 obstack_free (rtl_obstack, spacer);
3160 /* Try to apply De`Morgan's laws. */
3161 else if (GET_CODE (left) == IOR)
3163 newexp = attr_rtx (AND,
3164 attr_rtx (NOT, XEXP (left, 0)),
3165 attr_rtx (NOT, XEXP (left, 1)));
3167 newexp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3169 else if (GET_CODE (left) == AND)
3171 newexp = attr_rtx (IOR,
3172 attr_rtx (NOT, XEXP (left, 0)),
3173 attr_rtx (NOT, XEXP (left, 1)));
3175 newexp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3177 else if (left != XEXP (exp, 0))
3179 newexp = attr_rtx (NOT, left);
3184 if (current_alternative_string && XSTR (exp, 0) == alternative_name)
3185 return (XSTR (exp, 1) == current_alternative_string
3186 ? true_rtx : false_rtx);
3188 /* Look at the value for this insn code in the specified attribute.
3189 We normally can replace this comparison with the condition that
3190 would give this insn the values being tested for. */
3191 if (XSTR (exp, 0) != alternative_name
3192 && (attr = find_attr (XSTR (exp, 0), 0)) != NULL)
3193 for (av = attr->first_value; av; av = av->next)
3194 for (ie = av->first_insn; ie; ie = ie->next)
3195 if (ie->insn_code == insn_code)
3196 return evaluate_eq_attr (exp, av->value, insn_code, insn_index);
3199 /* We have already simplified this expression. Simplifying it again
3200 won't buy anything unless we weren't given a valid insn code
3201 to process (i.e., we are canonicalizing something.). */
3202 if (insn_code != -2 /* Seems wrong: && current_alternative_string. */
3203 && ! RTX_UNCHANGING_P (newexp))
3204 return copy_rtx_unchanging (newexp);
3212 /* Optimize the attribute lists by seeing if we can determine conditional
3213 values from the known values of other attributes. This will save subroutine
3214 calls during the compilation. */
3219 struct attr_desc *attr;
3220 struct attr_value *av;
3221 struct insn_ent *ie;
3223 int something_changed = 1;
3225 struct attr_value_list { struct attr_value *av;
3226 struct insn_ent *ie;
3227 struct attr_desc * attr;
3228 struct attr_value_list *next; };
3229 struct attr_value_list **insn_code_values;
3230 struct attr_value_list *iv;
3232 /* For each insn code, make a list of all the insn_ent's for it,
3233 for all values for all attributes. */
3235 /* Make 2 extra elements, for "code" values -2 and -1. */
3237 = (struct attr_value_list **) alloca ((insn_code_number + 2)
3238 * sizeof (struct attr_value_list *));
3239 bzero (insn_code_values,
3240 (insn_code_number + 2) * sizeof (struct attr_value_list *));
3241 /* Offset the table address so we can index by -2 or -1. */
3242 insn_code_values += 2;
3244 for (i = 0; i < MAX_ATTRS_INDEX; i++)
3245 for (attr = attrs[i]; attr; attr = attr->next)
3246 for (av = attr->first_value; av; av = av->next)
3247 for (ie = av->first_insn; ie; ie = ie->next)
3249 iv = ((struct attr_value_list *)
3250 alloca (sizeof (struct attr_value_list)));
3254 iv->next = insn_code_values[ie->insn_code];
3255 insn_code_values[ie->insn_code] = iv;
3258 /* Process one insn code at a time. */
3259 for (i = -2; i < insn_code_number; i++)
3261 /* Clear the MEM_IN_STRUCT_P flag everywhere relevant.
3262 We use it to mean "already simplified for this insn". */
3263 for (iv = insn_code_values[i]; iv; iv = iv->next)
3264 clear_struct_flag (iv->av->value);
3266 /* Loop until nothing changes for one iteration. */
3267 something_changed = 1;
3268 while (something_changed)
3270 something_changed = 0;
3271 for (iv = insn_code_values[i]; iv; iv = iv->next)
3273 struct obstack *old = rtl_obstack;
3274 char *spacer = (char *) obstack_finish (temp_obstack);
3279 if (GET_CODE (av->value) != COND)
3282 rtl_obstack = temp_obstack;
3283 #if 0 /* This was intended as a speed up, but it was slower. */
3284 if (insn_n_alternatives[ie->insn_code] > 6
3285 && count_sub_rtxs (av->value, 200) >= 200)
3286 newexp = simplify_by_alternatives (av->value, ie->insn_code,
3290 newexp = simplify_cond (av->value, ie->insn_code,
3294 if (newexp != av->value)
3296 newexp = attr_copy_rtx (newexp);
3297 remove_insn_ent (av, ie);
3298 av = get_attr_value (newexp, attr, ie->insn_code);
3300 insert_insn_ent (av, ie);
3301 something_changed = 1;
3303 obstack_free (temp_obstack, spacer);
3311 simplify_by_alternatives (exp, insn_code, insn_index)
3313 int insn_code, insn_index;
3316 int len = insn_n_alternatives[insn_code];
3317 rtx newexp = rtx_alloc (COND);
3321 XVEC (newexp, 0) = rtvec_alloc (len * 2);
3323 /* It will not matter what value we use as the default value
3324 of the new COND, since that default will never be used.
3325 Choose something of the right type. */
3326 for (ultimate = exp; GET_CODE (ultimate) == COND;)
3327 ultimate = XEXP (ultimate, 1);
3328 XEXP (newexp, 1) = ultimate;
3330 for (i = 0; i < insn_n_alternatives[insn_code]; i++)
3332 current_alternative_string = attr_numeral (i);
3333 XVECEXP (newexp, 0, i * 2) = make_alternative_compare (1 << i);
3334 XVECEXP (newexp, 0, i * 2 + 1)
3335 = simplify_cond (exp, insn_code, insn_index);
3338 current_alternative_string = 0;
3339 return simplify_cond (newexp, insn_code, insn_index);
3343 /* An expression where all the unknown terms are EQ_ATTR tests can be
3344 rearranged into a COND provided we can enumerate all possible
3345 combinations of the unknown values. The set of combinations become the
3346 tests of the COND; the value of the expression given that combination is
3347 computed and becomes the corresponding value. To do this, we must be
3348 able to enumerate all values for each attribute used in the expression
3349 (currently, we give up if we find a numeric attribute).
3351 If the set of EQ_ATTR tests used in an expression tests the value of N
3352 different attributes, the list of all possible combinations can be made
3353 by walking the N-dimensional attribute space defined by those
3354 attributes. We record each of these as a struct dimension.
3356 The algorithm relies on sharing EQ_ATTR nodes: if two nodes in an
3357 expression are the same, the will also have the same address. We find
3358 all the EQ_ATTR nodes by marking them MEM_VOLATILE_P. This bit later
3359 represents the value of an EQ_ATTR node, so once all nodes are marked,
3360 they are also given an initial value of FALSE.
3362 We then separate the set of EQ_ATTR nodes into dimensions for each
3363 attribute and put them on the VALUES list. Terms are added as needed by
3364 `add_values_to_cover' so that all possible values of the attribute are
3367 Each dimension also has a current value. This is the node that is
3368 currently considered to be TRUE. If this is one of the nodes added by
3369 `add_values_to_cover', all the EQ_ATTR tests in the original expression
3370 will be FALSE. Otherwise, only the CURRENT_VALUE will be true.
3372 NUM_VALUES is simply the length of the VALUES list and is there for
3375 Once the dimensions are created, the algorithm enumerates all possible
3376 values and computes the current value of the given expression. */
3380 struct attr_desc *attr; /* Attribute for this dimension. */
3381 rtx values; /* List of attribute values used. */
3382 rtx current_value; /* Position in the list for the TRUE value. */
3383 int num_values; /* Length of the values list. */
3386 /* If EXP is a suitable expression, reorganize it by constructing an
3387 equivalent expression that is a COND with the tests being all combinations
3388 of attribute values and the values being simple constants. */
3391 simplify_by_exploding (exp)
3394 rtx list = 0, link, condexp, defval;
3395 struct dimension *space;
3396 rtx *condtest, *condval;
3397 int i, j, total, ndim = 0;
3398 int most_tests, num_marks, new_marks;
3400 /* Locate all the EQ_ATTR expressions. */
3401 if (! find_and_mark_used_attributes (exp, &list, &ndim) || ndim == 0)
3403 unmark_used_attributes (list, 0, 0);
3407 /* Create an attribute space from the list of used attributes. For each
3408 dimension in the attribute space, record the attribute, list of values
3409 used, and number of values used. Add members to the list of values to
3410 cover the domain of the attribute. This makes the expanded COND form
3411 order independent. */
3413 space = (struct dimension *) alloca (ndim * sizeof (struct dimension));
3416 for (ndim = 0; list; ndim++)
3418 /* Pull the first attribute value from the list and record that
3419 attribute as another dimension in the attribute space. */
3420 char *name = XSTR (XEXP (list, 0), 0);
3423 if ((space[ndim].attr = find_attr (name, 0)) == 0
3424 || space[ndim].attr->is_numeric)
3426 unmark_used_attributes (list, space, ndim);
3430 /* Add all remaining attribute values that refer to this attribute. */
3431 space[ndim].num_values = 0;
3432 space[ndim].values = 0;
3434 for (link = list; link; link = *prev)
3435 if (! strcmp (XSTR (XEXP (link, 0), 0), name))
3437 space[ndim].num_values++;
3438 *prev = XEXP (link, 1);
3439 XEXP (link, 1) = space[ndim].values;
3440 space[ndim].values = link;
3443 prev = &XEXP (link, 1);
3445 /* Add sufficient members to the list of values to make the list
3446 mutually exclusive and record the total size of the attribute
3448 total *= add_values_to_cover (&space[ndim]);
3451 /* Sort the attribute space so that the attributes go from non-constant
3452 to constant and from most values to least values. */
3453 for (i = 0; i < ndim; i++)
3454 for (j = ndim - 1; j > i; j--)
3455 if ((space[j-1].attr->is_const && !space[j].attr->is_const)
3456 || space[j-1].num_values < space[j].num_values)
3458 struct dimension tmp;
3460 space[j] = space[j-1];
3464 /* Establish the initial current value. */
3465 for (i = 0; i < ndim; i++)
3466 space[i].current_value = space[i].values;
3468 condtest = (rtx *) alloca (total * sizeof (rtx));
3469 condval = (rtx *) alloca (total * sizeof (rtx));
3471 /* Expand the tests and values by iterating over all values in the
3475 condtest[i] = test_for_current_value (space, ndim);
3476 condval[i] = simplify_with_current_value (exp, space, ndim);
3477 if (! increment_current_value (space, ndim))
3483 /* We are now finished with the original expression. */
3484 unmark_used_attributes (0, space, ndim);
3486 /* Find the most used constant value and make that the default. */
3488 for (i = num_marks = 0; i < total; i++)
3489 if (GET_CODE (condval[i]) == CONST_STRING
3490 && ! MEM_VOLATILE_P (condval[i]))
3492 /* Mark the unmarked constant value and count how many are marked. */
3493 MEM_VOLATILE_P (condval[i]) = 1;
3494 for (j = new_marks = 0; j < total; j++)
3495 if (GET_CODE (condval[j]) == CONST_STRING
3496 && MEM_VOLATILE_P (condval[j]))
3498 if (new_marks - num_marks > most_tests)
3500 most_tests = new_marks - num_marks;
3501 defval = condval[i];
3503 num_marks = new_marks;
3505 /* Clear all the marks. */
3506 for (i = 0; i < total; i++)
3507 MEM_VOLATILE_P (condval[i]) = 0;
3509 /* Give up if nothing is constant. */
3513 /* If all values are the default, use that. */
3514 if (total == most_tests)
3517 /* Make a COND with the most common constant value the default. (A more
3518 complex method where tests with the same value were combined didn't
3519 seem to improve things.) */
3520 condexp = rtx_alloc (COND);
3521 XVEC (condexp, 0) = rtvec_alloc ((total - most_tests) * 2);
3522 XEXP (condexp, 1) = defval;
3523 for (i = j = 0; i < total; i++)
3524 if (condval[i] != defval)
3526 XVECEXP (condexp, 0, 2 * j) = condtest[i];
3527 XVECEXP (condexp, 0, 2 * j + 1) = condval[i];
3534 /* Set the MEM_VOLATILE_P flag for all EQ_ATTR expressions in EXP and
3535 verify that EXP can be simplified to a constant term if all the EQ_ATTR
3536 tests have known value. */
3539 find_and_mark_used_attributes (exp, terms, nterms)
3545 switch (GET_CODE (exp))
3548 if (! MEM_VOLATILE_P (exp))
3550 rtx link = rtx_alloc (EXPR_LIST);
3551 XEXP (link, 0) = exp;
3552 XEXP (link, 1) = *terms;
3555 MEM_VOLATILE_P (exp) = 1;
3561 if (! find_and_mark_used_attributes (XEXP (exp, 2), terms, nterms))
3565 if (! find_and_mark_used_attributes (XEXP (exp, 1), terms, nterms))
3568 if (! find_and_mark_used_attributes (XEXP (exp, 0), terms, nterms))
3573 for (i = 0; i < XVECLEN (exp, 0); i++)
3574 if (! find_and_mark_used_attributes (XVECEXP (exp, 0, i), terms, nterms))
3576 if (! find_and_mark_used_attributes (XEXP (exp, 1), terms, nterms))
3584 /* Clear the MEM_VOLATILE_P flag in all EQ_ATTR expressions on LIST and
3585 in the values of the NDIM-dimensional attribute space SPACE. */
3588 unmark_used_attributes (list, space, ndim)
3590 struct dimension *space;
3596 for (i = 0; i < ndim; i++)
3597 unmark_used_attributes (space[i].values, 0, 0);
3599 for (link = list; link; link = XEXP (link, 1))
3601 exp = XEXP (link, 0);
3602 if (GET_CODE (exp) == EQ_ATTR)
3603 MEM_VOLATILE_P (exp) = 0;
3607 /* Update the attribute dimension DIM so that all values of the attribute
3608 are tested. Return the updated number of values. */
3611 add_values_to_cover (dim)
3612 struct dimension *dim;
3614 struct attr_value *av;
3615 rtx exp, link, *prev;
3618 for (av = dim->attr->first_value; av; av = av->next)
3619 if (GET_CODE (av->value) == CONST_STRING)
3622 if (nalt < dim->num_values)
3624 else if (nalt == dim->num_values)
3626 else if (nalt * 2 < dim->num_values * 3)
3628 /* Most all the values of the attribute are used, so add all the unused
3630 prev = &dim->values;
3631 for (link = dim->values; link; link = *prev)
3632 prev = &XEXP (link, 1);
3634 for (av = dim->attr->first_value; av; av = av->next)
3635 if (GET_CODE (av->value) == CONST_STRING)
3637 exp = attr_eq (dim->attr->name, XSTR (av->value, 0));
3638 if (MEM_VOLATILE_P (exp))
3641 link = rtx_alloc (EXPR_LIST);
3642 XEXP (link, 0) = exp;
3645 prev = &XEXP (link, 1);
3647 dim->num_values = nalt;
3651 rtx orexp = false_rtx;
3653 /* Very few values are used, so compute a mutually exclusive
3654 expression. (We could do this for numeric values if that becomes
3656 prev = &dim->values;
3657 for (link = dim->values; link; link = *prev)
3659 orexp = insert_right_side (IOR, orexp, XEXP (link, 0), -2);
3660 prev = &XEXP (link, 1);
3662 link = rtx_alloc (EXPR_LIST);
3663 XEXP (link, 0) = attr_rtx (NOT, orexp);
3668 return dim->num_values;
3671 /* Increment the current value for the NDIM-dimensional attribute space SPACE
3672 and return FALSE if the increment overflowed. */
3675 increment_current_value (space, ndim)
3676 struct dimension *space;
3681 for (i = ndim - 1; i >= 0; i--)
3683 if ((space[i].current_value = XEXP (space[i].current_value, 1)) == 0)
3684 space[i].current_value = space[i].values;
3691 /* Construct an expression corresponding to the current value for the
3692 NDIM-dimensional attribute space SPACE. */
3695 test_for_current_value (space, ndim)
3696 struct dimension *space;
3702 for (i = 0; i < ndim; i++)
3703 exp = insert_right_side (AND, exp, XEXP (space[i].current_value, 0), -2);
3708 /* Given the current value of the NDIM-dimensional attribute space SPACE,
3709 set the corresponding EQ_ATTR expressions to that value and reduce
3710 the expression EXP as much as possible. On input [and output], all
3711 known EQ_ATTR expressions are set to FALSE. */
3714 simplify_with_current_value (exp, space, ndim)
3716 struct dimension *space;
3722 /* Mark each current value as TRUE. */
3723 for (i = 0; i < ndim; i++)
3725 x = XEXP (space[i].current_value, 0);
3726 if (GET_CODE (x) == EQ_ATTR)
3727 MEM_VOLATILE_P (x) = 0;
3730 exp = simplify_with_current_value_aux (exp);
3732 /* Change each current value back to FALSE. */
3733 for (i = 0; i < ndim; i++)
3735 x = XEXP (space[i].current_value, 0);
3736 if (GET_CODE (x) == EQ_ATTR)
3737 MEM_VOLATILE_P (x) = 1;
3743 /* Reduce the expression EXP based on the MEM_VOLATILE_P settings of
3744 all EQ_ATTR expressions. */
3747 simplify_with_current_value_aux (exp)
3753 switch (GET_CODE (exp))
3756 if (MEM_VOLATILE_P (exp))
3764 cond = simplify_with_current_value_aux (XEXP (exp, 0));
3765 if (cond == true_rtx)
3766 return simplify_with_current_value_aux (XEXP (exp, 1));
3767 else if (cond == false_rtx)
3768 return simplify_with_current_value_aux (XEXP (exp, 2));
3770 return attr_rtx (IF_THEN_ELSE, cond,
3771 simplify_with_current_value_aux (XEXP (exp, 1)),
3772 simplify_with_current_value_aux (XEXP (exp, 2)));
3775 cond = simplify_with_current_value_aux (XEXP (exp, 1));
3776 if (cond == true_rtx)
3778 else if (cond == false_rtx)
3779 return simplify_with_current_value_aux (XEXP (exp, 0));
3781 return attr_rtx (IOR, cond,
3782 simplify_with_current_value_aux (XEXP (exp, 0)));
3785 cond = simplify_with_current_value_aux (XEXP (exp, 1));
3786 if (cond == true_rtx)
3787 return simplify_with_current_value_aux (XEXP (exp, 0));
3788 else if (cond == false_rtx)
3791 return attr_rtx (AND, cond,
3792 simplify_with_current_value_aux (XEXP (exp, 0)));
3795 cond = simplify_with_current_value_aux (XEXP (exp, 0));
3796 if (cond == true_rtx)
3798 else if (cond == false_rtx)
3801 return attr_rtx (NOT, cond);
3804 for (i = 0; i < XVECLEN (exp, 0); i += 2)
3806 cond = simplify_with_current_value_aux (XVECEXP (exp, 0, i));
3807 if (cond == true_rtx)
3808 return simplify_with_current_value_aux (XVECEXP (exp, 0, i + 1));
3809 else if (cond == false_rtx)
3812 abort (); /* With all EQ_ATTR's of known value, a case should
3813 have been selected. */
3815 return simplify_with_current_value_aux (XEXP (exp, 1));
3820 /* Clear the MEM_IN_STRUCT_P flag in EXP and its subexpressions. */
3822 clear_struct_flag (x)
3827 register enum rtx_code code;
3830 MEM_IN_STRUCT_P (x) = 0;
3831 if (RTX_UNCHANGING_P (x))
3834 code = GET_CODE (x);
3850 /* Compare the elements. If any pair of corresponding elements
3851 fail to match, return 0 for the whole things. */
3853 fmt = GET_RTX_FORMAT (code);
3854 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3860 for (j = 0; j < XVECLEN (x, i); j++)
3861 clear_struct_flag (XVECEXP (x, i, j));
3865 clear_struct_flag (XEXP (x, i));
3871 /* Return the number of RTX objects making up the expression X.
3872 But if we count more more than MAX objects, stop counting. */
3874 count_sub_rtxs (x, max)
3880 register enum rtx_code code;
3884 code = GET_CODE (x);
3900 /* Compare the elements. If any pair of corresponding elements
3901 fail to match, return 0 for the whole things. */
3903 fmt = GET_RTX_FORMAT (code);
3904 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3913 for (j = 0; j < XVECLEN (x, i); j++)
3914 total += count_sub_rtxs (XVECEXP (x, i, j), max);
3918 total += count_sub_rtxs (XEXP (x, i), max);
3926 /* Create table entries for DEFINE_ATTR. */
3932 struct attr_desc *attr;
3933 struct attr_value *av;
3937 /* Make a new attribute structure. Check for duplicate by looking at
3938 attr->default_val, since it is initialized by this routine. */
3939 attr = find_attr (XSTR (exp, 0), 1);
3940 if (attr->default_val)
3941 fatal ("Duplicate definition for `%s' attribute", attr->name);
3943 if (*XSTR (exp, 1) == '\0')
3944 attr->is_numeric = 1;
3947 name_ptr = XSTR (exp, 1);
3948 while ((p = next_comma_elt (&name_ptr)) != NULL)
3950 av = (struct attr_value *) oballoc (sizeof (struct attr_value));
3951 av->value = attr_rtx (CONST_STRING, p);
3952 av->next = attr->first_value;
3953 attr->first_value = av;
3954 av->first_insn = NULL;
3956 av->has_asm_insn = 0;
3960 if (GET_CODE (XEXP (exp, 2)) == CONST)
3963 if (attr->is_numeric)
3964 fatal ("Constant attributes may not take numeric values");
3965 /* Get rid of the CONST node. It is allowed only at top-level. */
3966 XEXP (exp, 2) = XEXP (XEXP (exp, 2), 0);
3969 if (! strcmp (attr->name, "length") && ! attr->is_numeric)
3970 fatal ("`length' attribute must take numeric values");
3972 /* Set up the default value. */
3973 XEXP (exp, 2) = check_attr_value (XEXP (exp, 2), attr);
3974 attr->default_val = get_attr_value (XEXP (exp, 2), attr, -2);
3977 /* Given a pattern for DEFINE_PEEPHOLE or DEFINE_INSN, return the number of
3978 alternatives in the constraints. Assume all MATCH_OPERANDs have the same
3979 number of alternatives as this should be checked elsewhere. */
3982 count_alternatives (exp)
3988 if (GET_CODE (exp) == MATCH_OPERAND)
3989 return n_comma_elts (XSTR (exp, 2));
3991 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
3992 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
3997 n = count_alternatives (XEXP (exp, i));
4004 if (XVEC (exp, i) != NULL)
4005 for (j = 0; j < XVECLEN (exp, i); j++)
4007 n = count_alternatives (XVECEXP (exp, i, j));
4016 /* Returns non-zero if the given expression contains an EQ_ATTR with the
4017 `alternative' attribute. */
4020 compares_alternatives_p (exp)
4026 if (GET_CODE (exp) == EQ_ATTR && XSTR (exp, 0) == alternative_name)
4029 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4030 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4035 if (compares_alternatives_p (XEXP (exp, i)))
4040 for (j = 0; j < XVECLEN (exp, i); j++)
4041 if (compares_alternatives_p (XVECEXP (exp, i, j)))
4049 /* Returns non-zero is INNER is contained in EXP. */
4052 contained_in_p (inner, exp)
4059 if (rtx_equal_p (inner, exp))
4062 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4063 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4068 if (contained_in_p (inner, XEXP (exp, i)))
4073 for (j = 0; j < XVECLEN (exp, i); j++)
4074 if (contained_in_p (inner, XVECEXP (exp, i, j)))
4082 /* Process DEFINE_PEEPHOLE, DEFINE_INSN, and DEFINE_ASM_ATTRIBUTES. */
4088 struct insn_def *id;
4090 id = (struct insn_def *) oballoc (sizeof (struct insn_def));
4095 switch (GET_CODE (exp))
4098 id->insn_code = insn_code_number++;
4099 id->insn_index = insn_index_number++;
4100 id->num_alternatives = count_alternatives (exp);
4101 if (id->num_alternatives == 0)
4102 id->num_alternatives = 1;
4106 case DEFINE_PEEPHOLE:
4107 id->insn_code = insn_code_number++;
4108 id->insn_index = insn_index_number++;
4109 id->num_alternatives = count_alternatives (exp);
4110 if (id->num_alternatives == 0)
4111 id->num_alternatives = 1;
4115 case DEFINE_ASM_ATTRIBUTES:
4117 id->insn_index = -1;
4118 id->num_alternatives = 1;
4120 got_define_asm_attributes = 1;
4125 /* Process a DEFINE_DELAY. Validate the vector length, check if annul
4126 true or annul false is specified, and make a `struct delay_desc'. */
4132 struct delay_desc *delay;
4135 if (XVECLEN (def, 1) % 3 != 0)
4136 fatal ("Number of elements in DEFINE_DELAY must be multiple of three.");
4138 for (i = 0; i < XVECLEN (def, 1); i += 3)
4140 if (XVECEXP (def, 1, i + 1))
4141 have_annul_true = 1;
4142 if (XVECEXP (def, 1, i + 2))
4143 have_annul_false = 1;
4146 delay = (struct delay_desc *) oballoc (sizeof (struct delay_desc));
4148 delay->num = ++num_delays;
4149 delay->next = delays;
4153 /* Process a DEFINE_FUNCTION_UNIT.
4155 This gives information about a function unit contained in the CPU.
4156 We fill in a `struct function_unit_op' and a `struct function_unit'
4157 with information used later by `expand_unit'. */
4163 struct function_unit *unit;
4164 struct function_unit_op *op;
4165 char *name = XSTR (def, 0);
4166 int multiplicity = XINT (def, 1);
4167 int simultaneity = XINT (def, 2);
4168 rtx condexp = XEXP (def, 3);
4169 int ready_cost = MAX (XINT (def, 4), 1);
4170 int issue_delay = MAX (XINT (def, 5), 1);
4172 /* See if we have already seen this function unit. If so, check that
4173 the multiplicity and simultaneity values are the same. If not, make
4174 a structure for this function unit. */
4175 for (unit = units; unit; unit = unit->next)
4176 if (! strcmp (unit->name, name))
4178 if (unit->multiplicity != multiplicity
4179 || unit->simultaneity != simultaneity)
4180 fatal ("Differing specifications given for `%s' function unit.",
4187 unit = (struct function_unit *) oballoc (sizeof (struct function_unit));
4189 unit->multiplicity = multiplicity;
4190 unit->simultaneity = simultaneity;
4191 unit->issue_delay.min = unit->issue_delay.max = issue_delay;
4192 unit->num = num_units++;
4193 unit->num_opclasses = 0;
4194 unit->condexp = false_rtx;
4200 /* Make a new operation class structure entry and initialize it. */
4201 op = (struct function_unit_op *) oballoc (sizeof (struct function_unit_op));
4202 op->condexp = condexp;
4203 op->num = unit->num_opclasses++;
4204 op->ready = ready_cost;
4205 op->issue_delay = issue_delay;
4206 op->next = unit->ops;
4209 /* Set our issue expression based on whether or not an optional conflict
4210 vector was specified. */
4213 /* Compute the IOR of all the specified expressions. */
4214 rtx orexp = false_rtx;
4217 for (i = 0; i < XVECLEN (def, 6); i++)
4218 orexp = insert_right_side (IOR, orexp, XVECEXP (def, 6, i), -2);
4220 op->conflict_exp = orexp;
4221 extend_range (&unit->issue_delay, 1, issue_delay);
4225 op->conflict_exp = true_rtx;
4226 extend_range (&unit->issue_delay, issue_delay, issue_delay);
4229 /* Merge our conditional into that of the function unit so we can determine
4230 which insns are used by the function unit. */
4231 unit->condexp = insert_right_side (IOR, unit->condexp, op->condexp, -2);
4234 /* Given a piece of RTX, print a C expression to test it's truth value.
4235 We use AND and IOR both for logical and bit-wise operations, so
4236 interpret them as logical unless they are inside a comparison expression.
4237 The second operand of this function will be non-zero in that case. */
4240 write_test_expr (exp, in_comparison)
4244 int comparison_operator = 0;
4246 struct attr_desc *attr;
4248 /* In order not to worry about operator precedence, surround our part of
4249 the expression with parentheses. */
4252 code = GET_CODE (exp);
4255 /* Binary operators. */
4257 case GE: case GT: case GEU: case GTU:
4258 case LE: case LT: case LEU: case LTU:
4259 comparison_operator = 1;
4261 case PLUS: case MINUS: case MULT: case DIV: case MOD:
4262 case AND: case IOR: case XOR:
4263 case LSHIFT: case ASHIFT: case LSHIFTRT: case ASHIFTRT:
4264 write_test_expr (XEXP (exp, 0), in_comparison || comparison_operator);
4280 printf (" >= (unsigned) ");
4283 printf (" > (unsigned) ");
4292 printf (" <= (unsigned) ");
4295 printf (" < (unsigned) ");
4337 write_test_expr (XEXP (exp, 1), in_comparison || comparison_operator);
4341 /* Special-case (not (eq_attrq "alternative" "x")) */
4342 if (! in_comparison && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
4343 && XSTR (XEXP (exp, 0), 0) == alternative_name)
4345 printf ("which_alternative != %s", XSTR (XEXP (exp, 0), 1));
4349 /* Otherwise, fall through to normal unary operator. */
4351 /* Unary operators. */
4369 write_test_expr (XEXP (exp, 0), in_comparison);
4372 /* Comparison test of an attribute with a value. Most of these will
4373 have been removed by optimization. Handle "alternative"
4374 specially and give error if EQ_ATTR present inside a comparison. */
4377 fatal ("EQ_ATTR not valid inside comparison");
4379 if (XSTR (exp, 0) == alternative_name)
4381 printf ("which_alternative == %s", XSTR (exp, 1));
4385 attr = find_attr (XSTR (exp, 0), 0);
4386 if (! attr) abort ();
4388 /* Now is the time to expand the value of a constant attribute. */
4391 write_test_expr (evaluate_eq_attr (exp, attr->default_val->value,
4397 printf ("get_attr_%s (insn) == ", attr->name);
4398 write_attr_valueq (attr, XSTR (exp, 1));
4402 /* See if an operand matches a predicate. */
4404 /* If only a mode is given, just ensure the mode matches the operand.
4405 If neither a mode nor predicate is given, error. */
4406 if (XSTR (exp, 1) == NULL || *XSTR (exp, 1) == '\0')
4408 if (GET_MODE (exp) == VOIDmode)
4409 fatal ("Null MATCH_OPERAND specified as test");
4411 printf ("GET_MODE (operands[%d]) == %smode",
4412 XINT (exp, 0), GET_MODE_NAME (GET_MODE (exp)));
4415 printf ("%s (operands[%d], %smode)",
4416 XSTR (exp, 1), XINT (exp, 0), GET_MODE_NAME (GET_MODE (exp)));
4419 /* Constant integer. */
4421 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
4422 printf ("%d", XWINT (exp, 0));
4424 printf ("%ld", XWINT (exp, 0));
4428 /* A random C expression. */
4430 printf ("%s", XSTR (exp, 0));
4433 /* The address of the branch target. */
4435 printf ("insn_addresses[INSN_UID (JUMP_LABEL (insn))]");
4438 /* The address of the current insn. It would be more consistent with
4439 other usage to make this the address of the NEXT insn, but this gets
4440 too confusing because of the ambiguity regarding the length of the
4443 printf ("insn_current_address");
4447 fatal ("bad RTX code `%s' in attribute calculation\n",
4448 GET_RTX_NAME (code));
4454 /* Given an attribute value, return the maximum CONST_STRING argument
4455 encountered. It is assumed that they are all numeric. */
4458 max_attr_value (exp)
4461 int current_max = 0;
4465 if (GET_CODE (exp) == CONST_STRING)
4466 return atoi (XSTR (exp, 0));
4468 else if (GET_CODE (exp) == COND)
4470 for (i = 0; i < XVECLEN (exp, 0); i += 2)
4472 n = max_attr_value (XVECEXP (exp, 0, i + 1));
4473 if (n > current_max)
4477 n = max_attr_value (XEXP (exp, 1));
4478 if (n > current_max)
4482 else if (GET_CODE (exp) == IF_THEN_ELSE)
4484 current_max = max_attr_value (XEXP (exp, 1));
4485 n = max_attr_value (XEXP (exp, 2));
4486 if (n > current_max)
4496 /* Scan an attribute value, possibly a conditional, and record what actions
4497 will be required to do any conditional tests in it.
4500 `must_extract' if we need to extract the insn operands
4501 `must_constrain' if we must compute `which_alternative'
4502 `address_used' if an address expression was used
4503 `length_used' if an (eq_attr "length" ...) was used
4507 walk_attr_value (exp)
4517 code = GET_CODE (exp);
4521 if (! RTX_UNCHANGING_P (exp))
4522 /* Since this is an arbitrary expression, it can look at anything.
4523 However, constant expressions do not depend on any particular
4525 must_extract = must_constrain = 1;
4533 if (XSTR (exp, 0) == alternative_name)
4534 must_extract = must_constrain = 1;
4535 else if (strcmp (XSTR (exp, 0), "length") == 0)
4545 for (i = 0, fmt = GET_RTX_FORMAT (code); i < GET_RTX_LENGTH (code); i++)
4550 walk_attr_value (XEXP (exp, i));
4554 if (XVEC (exp, i) != NULL)
4555 for (j = 0; j < XVECLEN (exp, i); j++)
4556 walk_attr_value (XVECEXP (exp, i, j));
4561 /* Write out a function to obtain the attribute for a given INSN. */
4564 write_attr_get (attr)
4565 struct attr_desc *attr;
4567 struct attr_value *av, *common_av;
4569 /* Find the most used attribute value. Handle that as the `default' of the
4570 switch we will generate. */
4571 common_av = find_most_used (attr);
4573 /* Write out start of function, then all values with explicit `case' lines,
4574 then a `default', then the value with the most uses. */
4575 if (!attr->is_numeric)
4576 printf ("enum attr_%s\n", attr->name);
4577 else if (attr->unsigned_p)
4578 printf ("unsigned int\n");
4582 /* If the attribute name starts with a star, the remainder is the name of
4583 the subroutine to use, instead of `get_attr_...'. */
4584 if (attr->name[0] == '*')
4585 printf ("%s (insn)\n", &attr->name[1]);
4586 else if (attr->is_const == 0)
4587 printf ("get_attr_%s (insn)\n", attr->name);
4590 printf ("get_attr_%s ()\n", attr->name);
4593 for (av = attr->first_value; av; av = av->next)
4594 if (av->num_insns != 0)
4595 write_attr_set (attr, 2, av->value, "return", ";",
4596 true_rtx, av->first_insn->insn_code,
4597 av->first_insn->insn_index);
4602 printf (" rtx insn;\n");
4604 printf (" switch (recog_memoized (insn))\n");
4607 for (av = attr->first_value; av; av = av->next)
4608 if (av != common_av)
4609 write_attr_case (attr, av, 1, "return", ";", 4, true_rtx);
4611 write_attr_case (attr, common_av, 0, "return", ";", 4, true_rtx);
4612 printf (" }\n}\n\n");
4615 /* Given an AND tree of known true terms (because we are inside an `if' with
4616 that as the condition or are in an `else' clause) and an expression,
4617 replace any known true terms with TRUE. Use `simplify_and_tree' to do
4618 the bulk of the work. */
4621 eliminate_known_true (known_true, exp, insn_code, insn_index)
4624 int insn_code, insn_index;
4628 known_true = SIMPLIFY_TEST_EXP (known_true, insn_code, insn_index);
4630 if (GET_CODE (known_true) == AND)
4632 exp = eliminate_known_true (XEXP (known_true, 0), exp,
4633 insn_code, insn_index);
4634 exp = eliminate_known_true (XEXP (known_true, 1), exp,
4635 insn_code, insn_index);
4640 exp = simplify_and_tree (exp, &term, insn_code, insn_index);
4646 /* Write out a series of tests and assignment statements to perform tests and
4647 sets of an attribute value. We are passed an indentation amount and prefix
4648 and suffix strings to write around each attribute value (e.g., "return"
4652 write_attr_set (attr, indent, value, prefix, suffix, known_true,
4653 insn_code, insn_index)
4654 struct attr_desc *attr;
4660 int insn_code, insn_index;
4662 if (GET_CODE (value) == CONST_STRING)
4664 write_indent (indent);
4665 printf ("%s ", prefix);
4666 write_attr_value (attr, value);
4667 printf ("%s\n", suffix);
4669 else if (GET_CODE (value) == COND)
4671 /* Assume the default value will be the default of the COND unless we
4672 find an always true expression. */
4673 rtx default_val = XEXP (value, 1);
4674 rtx our_known_true = known_true;
4679 for (i = 0; i < XVECLEN (value, 0); i += 2)
4684 testexp = eliminate_known_true (our_known_true,
4685 XVECEXP (value, 0, i),
4686 insn_code, insn_index);
4687 newexp = attr_rtx (NOT, testexp);
4688 newexp = insert_right_side (AND, our_known_true, newexp,
4689 insn_code, insn_index);
4691 /* If the test expression is always true or if the next `known_true'
4692 expression is always false, this is the last case, so break
4693 out and let this value be the `else' case. */
4694 if (testexp == true_rtx || newexp == false_rtx)
4696 default_val = XVECEXP (value, 0, i + 1);
4700 /* Compute the expression to pass to our recursive call as being
4702 inner_true = insert_right_side (AND, our_known_true,
4703 testexp, insn_code, insn_index);
4705 /* If this is always false, skip it. */
4706 if (inner_true == false_rtx)
4709 write_indent (indent);
4710 printf ("%sif ", first_if ? "" : "else ");
4712 write_test_expr (testexp, 0);
4714 write_indent (indent + 2);
4717 write_attr_set (attr, indent + 4,
4718 XVECEXP (value, 0, i + 1), prefix, suffix,
4719 inner_true, insn_code, insn_index);
4720 write_indent (indent + 2);
4722 our_known_true = newexp;
4727 write_indent (indent);
4729 write_indent (indent + 2);
4733 write_attr_set (attr, first_if ? indent : indent + 4, default_val,
4734 prefix, suffix, our_known_true, insn_code, insn_index);
4738 write_indent (indent + 2);
4746 /* Write out the computation for one attribute value. */
4749 write_attr_case (attr, av, write_case_lines, prefix, suffix, indent, known_true)
4750 struct attr_desc *attr;
4751 struct attr_value *av;
4752 int write_case_lines;
4753 char *prefix, *suffix;
4757 struct insn_ent *ie;
4759 if (av->num_insns == 0)
4762 if (av->has_asm_insn)
4764 write_indent (indent);
4765 printf ("case -1:\n");
4766 write_indent (indent + 2);
4767 printf ("if (GET_CODE (PATTERN (insn)) != ASM_INPUT\n");
4768 write_indent (indent + 2);
4769 printf (" && asm_noperands (PATTERN (insn)) < 0)\n");
4770 write_indent (indent + 2);
4771 printf (" fatal_insn_not_found (insn);\n");
4774 if (write_case_lines)
4776 for (ie = av->first_insn; ie; ie = ie->next)
4777 if (ie->insn_code != -1)
4779 write_indent (indent);
4780 printf ("case %d:\n", ie->insn_code);
4785 write_indent (indent);
4786 printf ("default:\n");
4789 /* See what we have to do to output this value. */
4790 must_extract = must_constrain = address_used = 0;
4791 walk_attr_value (av->value);
4795 write_indent (indent + 2);
4796 printf ("insn_extract (insn);\n");
4801 #ifdef REGISTER_CONSTRAINTS
4802 write_indent (indent + 2);
4803 printf ("if (! constrain_operands (INSN_CODE (insn), reload_completed))\n");
4804 write_indent (indent + 2);
4805 printf (" fatal_insn_not_found (insn);\n");
4809 write_attr_set (attr, indent + 2, av->value, prefix, suffix,
4810 known_true, av->first_insn->insn_code,
4811 av->first_insn->insn_index);
4813 if (strncmp (prefix, "return", 6))
4815 write_indent (indent + 2);
4816 printf ("break;\n");
4821 /* Utilities to write names in various forms. */
4824 write_attr_valueq (attr, s)
4825 struct attr_desc *attr;
4828 if (attr->is_numeric)
4831 /* Make the blockage range values easier to read. */
4833 printf (" /* 0x%x */", atoi (s));
4837 write_upcase (attr->name);
4844 write_attr_value (attr, value)
4845 struct attr_desc *attr;
4848 if (GET_CODE (value) != CONST_STRING)
4851 write_attr_valueq (attr, XSTR (value, 0));
4859 if (*str < 'a' || *str > 'z')
4860 printf ("%c", *str++);
4862 printf ("%c", *str++ - 'a' + 'A');
4866 write_indent (indent)
4869 for (; indent > 8; indent -= 8)
4872 for (; indent; indent--)
4876 /* Write a subroutine that is given an insn that requires a delay slot, a
4877 delay slot ordinal, and a candidate insn. It returns non-zero if the
4878 candidate can be placed in the specified delay slot of the insn.
4880 We can write as many as three subroutines. `eligible_for_delay'
4881 handles normal delay slots, `eligible_for_annul_true' indicates that
4882 the specified insn can be annulled if the branch is true, and likewise
4883 for `eligible_for_annul_false'.
4885 KIND is a string distinguishing these three cases ("delay", "annul_true",
4886 or "annul_false"). */
4889 write_eligible_delay (kind)
4892 struct delay_desc *delay;
4895 struct attr_desc *attr;
4896 struct attr_value *av, *common_av;
4899 /* Compute the maximum number of delay slots required. We use the delay
4900 ordinal times this number plus one, plus the slot number as an index into
4901 the appropriate predicate to test. */
4903 for (delay = delays, max_slots = 0; delay; delay = delay->next)
4904 if (XVECLEN (delay->def, 1) / 3 > max_slots)
4905 max_slots = XVECLEN (delay->def, 1) / 3;
4907 /* Write function prelude. */
4910 printf ("eligible_for_%s (delay_insn, slot, candidate_insn)\n", kind);
4911 printf (" rtx delay_insn;\n");
4912 printf (" int slot;\n");
4913 printf (" rtx candidate_insn;\n");
4915 printf (" rtx insn;\n");
4917 printf (" if (slot >= %d)\n", max_slots);
4918 printf (" abort ();\n");
4921 /* If more than one delay type, find out which type the delay insn is. */
4925 attr = find_attr ("*delay_type", 0);
4926 if (! attr) abort ();
4927 common_av = find_most_used (attr);
4929 printf (" insn = delay_insn;\n");
4930 printf (" switch (recog_memoized (insn))\n");
4933 sprintf (str, " * %d;\n break;", max_slots);
4934 for (av = attr->first_value; av; av = av->next)
4935 if (av != common_av)
4936 write_attr_case (attr, av, 1, "slot +=", str, 4, true_rtx);
4938 write_attr_case (attr, common_av, 0, "slot +=", str, 4, true_rtx);
4941 /* Ensure matched. Otherwise, shouldn't have been called. */
4942 printf (" if (slot < %d)\n", max_slots);
4943 printf (" abort ();\n\n");
4946 /* If just one type of delay slot, write simple switch. */
4947 if (num_delays == 1 && max_slots == 1)
4949 printf (" insn = candidate_insn;\n");
4950 printf (" switch (recog_memoized (insn))\n");
4953 attr = find_attr ("*delay_1_0", 0);
4954 if (! attr) abort ();
4955 common_av = find_most_used (attr);
4957 for (av = attr->first_value; av; av = av->next)
4958 if (av != common_av)
4959 write_attr_case (attr, av, 1, "return", ";", 4, true_rtx);
4961 write_attr_case (attr, common_av, 0, "return", ";", 4, true_rtx);
4967 /* Write a nested CASE. The first indicates which condition we need to
4968 test, and the inner CASE tests the condition. */
4969 printf (" insn = candidate_insn;\n");
4970 printf (" switch (slot)\n");
4973 for (delay = delays; delay; delay = delay->next)
4974 for (i = 0; i < XVECLEN (delay->def, 1); i += 3)
4976 printf (" case %d:\n",
4977 (i / 3) + (num_delays == 1 ? 0 : delay->num * max_slots));
4978 printf (" switch (recog_memoized (insn))\n");
4981 sprintf (str, "*%s_%d_%d", kind, delay->num, i / 3);
4982 attr = find_attr (str, 0);
4983 if (! attr) abort ();
4984 common_av = find_most_used (attr);
4986 for (av = attr->first_value; av; av = av->next)
4987 if (av != common_av)
4988 write_attr_case (attr, av, 1, "return", ";", 8, true_rtx);
4990 write_attr_case (attr, common_av, 0, "return", ";", 8, true_rtx);
4994 printf (" default:\n");
4995 printf (" abort ();\n");
5002 /* Write routines to compute conflict cost for function units. Then write a
5003 table describing the available function units. */
5006 write_function_unit_info ()
5008 struct function_unit *unit;
5011 /* Write out conflict routines for function units. Don't bother writing
5012 one if there is only one issue delay value. */
5014 for (unit = units; unit; unit = unit->next)
5016 if (unit->needs_blockage_function)
5017 write_complex_function (unit, "blockage", "block");
5019 /* If the minimum and maximum conflict costs are the same, there
5020 is only one value, so we don't need a function. */
5021 if (! unit->needs_conflict_function)
5023 unit->default_cost = make_numeric_value (unit->issue_delay.max);
5027 /* The function first computes the case from the candidate insn. */
5028 unit->default_cost = make_numeric_value (0);
5029 write_complex_function (unit, "conflict_cost", "cost");
5032 /* Now that all functions have been written, write the table describing
5033 the function units. The name is included for documentation purposes
5036 printf ("struct function_unit_desc function_units[] = {\n");
5038 /* Write out the descriptions in numeric order, but don't force that order
5039 on the list. Doing so increases the runtime of genattrtab.c. */
5040 for (i = 0; i < num_units; i++)
5042 for (unit = units; unit; unit = unit->next)
5046 printf (" {\"%s\", %d, %d, %d, %s, %d, %s_unit_ready_cost, ",
5047 unit->name, 1 << unit->num, unit->multiplicity,
5048 unit->simultaneity, XSTR (unit->default_cost, 0),
5049 unit->issue_delay.max, unit->name);
5051 if (unit->needs_conflict_function)
5052 printf ("%s_unit_conflict_cost, ", unit->name);
5056 printf ("%d, ", unit->max_blockage);
5058 if (unit->needs_range_function)
5059 printf ("%s_unit_blockage_range, ", unit->name);
5063 if (unit->needs_blockage_function)
5064 printf ("%s_unit_blockage", unit->name);
5075 write_complex_function (unit, name, connection)
5076 struct function_unit *unit;
5077 char *name, *connection;
5079 struct attr_desc *case_attr, *attr;
5080 struct attr_value *av, *common_av;
5086 printf ("static int\n");
5087 printf ("%s_unit_%s (executing_insn, candidate_insn)\n",
5089 printf (" rtx executing_insn;\n");
5090 printf (" rtx candidate_insn;\n");
5092 printf (" rtx insn;\n");
5093 printf (" int casenum;\n\n");
5094 printf (" insn = candidate_insn;\n");
5095 printf (" switch (recog_memoized (insn))\n");
5098 /* Write the `switch' statement to get the case value. */
5099 str = (char *) alloca (strlen (unit->name) + strlen (name) + strlen (connection) + 10);
5100 sprintf (str, "*%s_cases", unit->name);
5101 case_attr = find_attr (str, 0);
5102 if (! case_attr) abort ();
5103 common_av = find_most_used (case_attr);
5105 for (av = case_attr->first_value; av; av = av->next)
5106 if (av != common_av)
5107 write_attr_case (case_attr, av, 1,
5108 "casenum =", ";", 4, unit->condexp);
5110 write_attr_case (case_attr, common_av, 0,
5111 "casenum =", ";", 4, unit->condexp);
5114 /* Now write an outer switch statement on each case. Then write
5115 the tests on the executing function within each. */
5116 printf (" insn = executing_insn;\n");
5117 printf (" switch (casenum)\n");
5120 for (i = 0; i < unit->num_opclasses; i++)
5122 /* Ensure using this case. */
5124 for (av = case_attr->first_value; av; av = av->next)
5126 && contained_in_p (make_numeric_value (i), av->value))
5132 printf (" case %d:\n", i);
5133 sprintf (str, "*%s_%s_%d", unit->name, connection, i);
5134 attr = find_attr (str, 0);
5135 if (! attr) abort ();
5137 /* If single value, just write it. */
5138 value = find_single_value (attr);
5140 write_attr_set (attr, 6, value, "return", ";\n", true_rtx, -2);
5143 common_av = find_most_used (attr);
5144 printf (" switch (recog_memoized (insn))\n");
5147 for (av = attr->first_value; av; av = av->next)
5148 if (av != common_av)
5149 write_attr_case (attr, av, 1,
5150 "return", ";", 8, unit->condexp);
5152 write_attr_case (attr, common_av, 0,
5153 "return", ";", 8, unit->condexp);
5158 printf (" }\n}\n\n");
5161 /* This page contains miscellaneous utility routines. */
5163 /* Given a string, return the number of comma-separated elements in it.
5164 Return 0 for the null string. */
5175 for (n = 1; *s; s++)
5182 /* Given a pointer to a (char *), return a malloc'ed string containing the
5183 next comma-separated element. Advance the pointer to after the string
5184 scanned, or the end-of-string. Return NULL if at end of string. */
5187 next_comma_elt (pstr)
5196 /* Find end of string to compute length. */
5197 for (p = *pstr; *p != ',' && *p != '\0'; p++)
5200 out_str = attr_string (*pstr, p - *pstr);
5209 /* Return a `struct attr_desc' pointer for a given named attribute. If CREATE
5210 is non-zero, build a new attribute, if one does not exist. */
5212 static struct attr_desc *
5213 find_attr (name, create)
5217 struct attr_desc *attr;
5220 /* Before we resort to using `strcmp', see if the string address matches
5221 anywhere. In most cases, it should have been canonicalized to do so. */
5222 if (name == alternative_name)
5225 index = name[0] & (MAX_ATTRS_INDEX - 1);
5226 for (attr = attrs[index]; attr; attr = attr->next)
5227 if (name == attr->name)
5230 /* Otherwise, do it the slow way. */
5231 for (attr = attrs[index]; attr; attr = attr->next)
5232 if (name[0] == attr->name[0] && ! strcmp (name, attr->name))
5238 attr = (struct attr_desc *) oballoc (sizeof (struct attr_desc));
5239 attr->name = attr_string (name, strlen (name));
5240 attr->first_value = attr->default_val = NULL;
5241 attr->is_numeric = attr->negative_ok = attr->is_const = attr->is_special = 0;
5242 attr->next = attrs[index];
5243 attrs[index] = attr;
5248 /* Create internal attribute with the given default value. */
5251 make_internal_attr (name, value, special)
5256 struct attr_desc *attr;
5258 attr = find_attr (name, 1);
5259 if (attr->default_val)
5262 attr->is_numeric = 1;
5264 attr->is_special = (special & 1) != 0;
5265 attr->negative_ok = (special & 2) != 0;
5266 attr->unsigned_p = (special & 4) != 0;
5267 attr->default_val = get_attr_value (value, attr, -2);
5270 /* Find the most used value of an attribute. */
5272 static struct attr_value *
5273 find_most_used (attr)
5274 struct attr_desc *attr;
5276 struct attr_value *av;
5277 struct attr_value *most_used;
5283 for (av = attr->first_value; av; av = av->next)
5284 if (av->num_insns > nuses)
5285 nuses = av->num_insns, most_used = av;
5290 /* If an attribute only has a single value used, return it. Otherwise
5294 find_single_value (attr)
5295 struct attr_desc *attr;
5297 struct attr_value *av;
5300 unique_value = NULL;
5301 for (av = attr->first_value; av; av = av->next)
5307 unique_value = av->value;
5310 return unique_value;
5313 /* Return (attr_value "n") */
5316 make_numeric_value (n)
5319 static rtx int_values[20];
5326 if (n < 20 && int_values[n])
5327 return int_values[n];
5329 p = attr_printf (MAX_DIGITS, "%d", n);
5330 exp = attr_rtx (CONST_STRING, p);
5333 int_values[n] = exp;
5339 extend_range (range, min, max)
5340 struct range *range;
5344 if (range->min > min) range->min = min;
5345 if (range->max < max) range->max = max;
5349 xrealloc (ptr, size)
5353 char *result = (char *) realloc (ptr, size);
5355 fatal ("virtual memory exhausted");
5363 register char *val = (char *) malloc (size);
5366 fatal ("virtual memory exhausted");
5371 copy_rtx_unchanging (orig)
5376 register RTX_CODE code;
5379 if (RTX_UNCHANGING_P (orig) || MEM_IN_STRUCT_P (orig))
5382 MEM_IN_STRUCT_P (orig) = 1;
5386 code = GET_CODE (orig);
5396 copy = rtx_alloc (code);
5397 PUT_MODE (copy, GET_MODE (orig));
5398 RTX_UNCHANGING_P (copy) = 1;
5400 bcopy (&XEXP (orig, 0), &XEXP (copy, 0),
5401 GET_RTX_LENGTH (GET_CODE (copy)) * sizeof (rtx));
5410 fprintf (stderr, "genattrtab: ");
5411 fprintf (stderr, s, a1, a2);
5412 fprintf (stderr, "\n");
5413 exit (FATAL_EXIT_CODE);
5416 /* More 'friendly' abort that prints the line and file.
5417 config.h can #define abort fancy_abort if you like that sort of thing. */
5422 fatal ("Internal gcc abort.");
5425 /* Determine if an insn has a constant number of delay slots, i.e., the
5426 number of delay slots is not a function of the length of the insn. */
5429 write_const_num_delay_slots ()
5431 struct attr_desc *attr = find_attr ("*num_delay_slots", 0);
5432 struct attr_value *av;
5433 struct insn_ent *ie;
5438 printf ("int\nconst_num_delay_slots (insn)\n");
5439 printf (" rtx *insn;\n");
5441 printf (" switch (recog_memoized (insn))\n");
5444 for (av = attr->first_value; av; av = av->next)
5447 walk_attr_value (av->value);
5450 for (ie = av->first_insn; ie; ie = ie->next)
5451 if (ie->insn_code != -1)
5452 printf (" case %d:\n", ie->insn_code);
5453 printf (" return 0;\n");
5457 printf (" default:\n");
5458 printf (" return 1;\n");
5472 struct attr_desc *attr;
5473 struct insn_def *id;
5478 /* Get rid of any avoidable limit on stack size. */
5482 /* Set the stack limit huge so that alloca does not fail. */
5483 getrlimit (RLIMIT_STACK, &rlim);
5484 rlim.rlim_cur = rlim.rlim_max;
5485 setrlimit (RLIMIT_STACK, &rlim);
5487 #endif /* RLIMIT_STACK defined */
5489 obstack_init (rtl_obstack);
5490 obstack_init (hash_obstack);
5491 obstack_init (temp_obstack);
5494 fatal ("No input file name.");
5496 infile = fopen (argv[1], "r");
5500 exit (FATAL_EXIT_CODE);
5505 /* Set up true and false rtx's */
5506 true_rtx = rtx_alloc (CONST_INT);
5507 XWINT (true_rtx, 0) = 1;
5508 false_rtx = rtx_alloc (CONST_INT);
5509 XWINT (false_rtx, 0) = 0;
5510 RTX_UNCHANGING_P (true_rtx) = RTX_UNCHANGING_P (false_rtx) = 1;
5511 RTX_INTEGRATED_P (true_rtx) = RTX_INTEGRATED_P (false_rtx) = 1;
5513 alternative_name = attr_string ("alternative", strlen ("alternative"));
5515 printf ("/* Generated automatically by the program `genattrtab'\n\
5516 from the machine description file `md'. */\n\n");
5518 /* Read the machine description. */
5522 c = read_skip_spaces (infile);
5527 desc = read_rtx (infile);
5528 if (GET_CODE (desc) == DEFINE_INSN
5529 || GET_CODE (desc) == DEFINE_PEEPHOLE
5530 || GET_CODE (desc) == DEFINE_ASM_ATTRIBUTES)
5533 else if (GET_CODE (desc) == DEFINE_EXPAND)
5534 insn_code_number++, insn_index_number++;
5536 else if (GET_CODE (desc) == DEFINE_SPLIT)
5537 insn_code_number++, insn_index_number++;
5539 else if (GET_CODE (desc) == DEFINE_ATTR)
5542 insn_index_number++;
5545 else if (GET_CODE (desc) == DEFINE_DELAY)
5548 insn_index_number++;
5551 else if (GET_CODE (desc) == DEFINE_FUNCTION_UNIT)
5554 insn_index_number++;
5558 /* If we didn't have a DEFINE_ASM_ATTRIBUTES, make a null one. */
5559 if (! got_define_asm_attributes)
5561 tem = rtx_alloc (DEFINE_ASM_ATTRIBUTES);
5562 XVEC (tem, 0) = rtvec_alloc (0);
5566 /* Expand DEFINE_DELAY information into new attribute. */
5570 /* Expand DEFINE_FUNCTION_UNIT information into new attributes. */
5574 printf ("#include \"config.h\"\n");
5575 printf ("#include \"rtl.h\"\n");
5576 printf ("#include \"insn-config.h\"\n");
5577 printf ("#include \"recog.h\"\n");
5578 printf ("#include \"regs.h\"\n");
5579 printf ("#include \"real.h\"\n");
5580 printf ("#include \"output.h\"\n");
5581 printf ("#include \"insn-attr.h\"\n");
5583 printf ("#define operands recog_operand\n\n");
5585 /* Make `insn_alternatives'. */
5586 insn_alternatives = (int *) oballoc (insn_code_number * sizeof (int));
5587 for (id = defs; id; id = id->next)
5588 if (id->insn_code >= 0)
5589 insn_alternatives[id->insn_code] = (1 << id->num_alternatives) - 1;
5591 /* Make `insn_n_alternatives'. */
5592 insn_n_alternatives = (int *) oballoc (insn_code_number * sizeof (int));
5593 for (id = defs; id; id = id->next)
5594 if (id->insn_code >= 0)
5595 insn_n_alternatives[id->insn_code] = id->num_alternatives;
5597 /* Prepare to write out attribute subroutines by checking everything stored
5598 away and building the attribute cases. */
5601 for (i = 0; i < MAX_ATTRS_INDEX; i++)
5602 for (attr = attrs[i]; attr; attr = attr->next)
5604 attr->default_val->value
5605 = check_attr_value (attr->default_val->value, attr);
5609 /* Construct extra attributes for `length'. */
5610 make_length_attrs ();
5612 /* Perform any possible optimizations to speed up compilation. */
5615 /* Now write out all the `gen_attr_...' routines. Do these before the
5616 special routines (specifically before write_function_unit_info), so
5617 that they get defined before they are used. */
5619 for (i = 0; i < MAX_ATTRS_INDEX; i++)
5620 for (attr = attrs[i]; attr; attr = attr->next)
5622 if (! attr->is_special)
5623 write_attr_get (attr);
5626 /* Write out delay eligibility information, if DEFINE_DELAY present.
5627 (The function to compute the number of delay slots will be written
5631 write_eligible_delay ("delay");
5632 if (have_annul_true)
5633 write_eligible_delay ("annul_true");
5634 if (have_annul_false)
5635 write_eligible_delay ("annul_false");
5638 /* Write out information about function units. */
5640 write_function_unit_info ();
5642 /* Write out constant delay slot info */
5643 write_const_num_delay_slots ();
5646 exit (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);