1 /* Generate code from machine description to compute values of attributes.
2 Copyright (C) 1991, 1993, 1994 Free Software Foundation, Inc.
3 Contributed by Richard Kenner (kenner@vlsi1.ultra.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. */
98 /* gvarargs must always be included after *config.h. */
102 #include "gvarargs.h"
105 #include "insn-config.h" /* For REGISTER_CONSTRAINTS */
110 #include <sys/time.h>
111 #include <sys/resource.h>
115 /* We must include obstack.h after <sys/time.h>, to avoid lossage with
116 /usr/include/sys/stdtypes.h on Sun OS 4.x. */
119 static struct obstack obstack, obstack1, obstack2;
120 struct obstack *rtl_obstack = &obstack;
121 struct obstack *hash_obstack = &obstack1;
122 struct obstack *temp_obstack = &obstack2;
124 #define obstack_chunk_alloc xmalloc
125 #define obstack_chunk_free free
127 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
128 char **insn_name_ptr = 0;
131 extern rtx read_rtx ();
133 static void fatal ();
136 /* enough space to reserve for printing out ints */
137 #define MAX_DIGITS (HOST_BITS_PER_INT * 3 / 10 + 3)
139 /* Define structures used to record attributes and values. */
141 /* As each DEFINE_INSN, DEFINE_PEEPHOLE, or DEFINE_ASM_ATTRIBUTES is
142 encountered, we store all the relevant information into a
143 `struct insn_def'. This is done to allow attribute definitions to occur
144 anywhere in the file. */
148 int insn_code; /* Instruction number. */
149 int insn_index; /* Expression numer in file, for errors. */
150 struct insn_def *next; /* Next insn in chain. */
151 rtx def; /* The DEFINE_... */
152 int num_alternatives; /* Number of alternatives. */
153 int vec_idx; /* Index of attribute vector in `def'. */
156 /* Once everything has been read in, we store in each attribute value a list
157 of insn codes that have that value. Here is the structure used for the
162 int insn_code; /* Instruction number. */
163 int insn_index; /* Index of definition in file */
164 struct insn_ent *next; /* Next in chain. */
167 /* Each value of an attribute (either constant or computed) is assigned a
168 structure which is used as the listhead of the insns that have that
173 rtx value; /* Value of attribute. */
174 struct attr_value *next; /* Next attribute value in chain. */
175 struct insn_ent *first_insn; /* First insn with this value. */
176 int num_insns; /* Number of insns with this value. */
177 int has_asm_insn; /* True if this value used for `asm' insns */
180 /* Structure for each attribute. */
184 char *name; /* Name of attribute. */
185 struct attr_desc *next; /* Next attribute. */
186 int is_numeric; /* Values of this attribute are numeric. */
187 int negative_ok; /* Allow negative numeric values. */
188 int unsigned_p; /* Make the output function unsigned int. */
189 int is_const; /* Attribute value constant for each run. */
190 int is_special; /* Don't call `write_attr_set'. */
191 struct attr_value *first_value; /* First value of this attribute. */
192 struct attr_value *default_val; /* Default value for this attribute. */
195 #define NULL_ATTR (struct attr_desc *) NULL
197 /* A range of values. */
205 /* Structure for each DEFINE_DELAY. */
209 rtx def; /* DEFINE_DELAY expression. */
210 struct delay_desc *next; /* Next DEFINE_DELAY. */
211 int num; /* Number of DEFINE_DELAY, starting at 1. */
214 /* Record information about each DEFINE_FUNCTION_UNIT. */
216 struct function_unit_op
218 rtx condexp; /* Expression TRUE for applicable insn. */
219 struct function_unit_op *next; /* Next operation for this function unit. */
220 int num; /* Ordinal for this operation type in unit. */
221 int ready; /* Cost until data is ready. */
222 int issue_delay; /* Cost until unit can accept another insn. */
223 rtx conflict_exp; /* Expression TRUE for insns incurring issue delay. */
224 rtx issue_exp; /* Expression computing issue delay. */
227 /* Record information about each function unit mentioned in a
228 DEFINE_FUNCTION_UNIT. */
232 char *name; /* Function unit name. */
233 struct function_unit *next; /* Next function unit. */
234 int num; /* Ordinal of this unit type. */
235 int multiplicity; /* Number of units of this type. */
236 int simultaneity; /* Maximum number of simultaneous insns
237 on this function unit or 0 if unlimited. */
238 rtx condexp; /* Expression TRUE for insn needing unit. */
239 int num_opclasses; /* Number of different operation types. */
240 struct function_unit_op *ops; /* Pointer to first operation type. */
241 int needs_conflict_function; /* Nonzero if a conflict function required. */
242 int needs_blockage_function; /* Nonzero if a blockage function required. */
243 int needs_range_function; /* Nonzero if blockage range function needed.*/
244 rtx default_cost; /* Conflict cost, if constant. */
245 struct range issue_delay; /* Range of issue delay values. */
246 int max_blockage; /* Maximum time an insn blocks the unit. */
249 /* Listheads of above structures. */
251 /* This one is indexed by the first character of the attribute name. */
252 #define MAX_ATTRS_INDEX 256
253 static struct attr_desc *attrs[MAX_ATTRS_INDEX];
254 static struct insn_def *defs;
255 static struct delay_desc *delays;
256 static struct function_unit *units;
258 /* An expression where all the unknown terms are EQ_ATTR tests can be
259 rearranged into a COND provided we can enumerate all possible
260 combinations of the unknown values. The set of combinations become the
261 tests of the COND; the value of the expression given that combination is
262 computed and becomes the corresponding value. To do this, we must be
263 able to enumerate all values for each attribute used in the expression
264 (currently, we give up if we find a numeric attribute).
266 If the set of EQ_ATTR tests used in an expression tests the value of N
267 different attributes, the list of all possible combinations can be made
268 by walking the N-dimensional attribute space defined by those
269 attributes. We record each of these as a struct dimension.
271 The algorithm relies on sharing EQ_ATTR nodes: if two nodes in an
272 expression are the same, the will also have the same address. We find
273 all the EQ_ATTR nodes by marking them MEM_VOLATILE_P. This bit later
274 represents the value of an EQ_ATTR node, so once all nodes are marked,
275 they are also given an initial value of FALSE.
277 We then separate the set of EQ_ATTR nodes into dimensions for each
278 attribute and put them on the VALUES list. Terms are added as needed by
279 `add_values_to_cover' so that all possible values of the attribute are
282 Each dimension also has a current value. This is the node that is
283 currently considered to be TRUE. If this is one of the nodes added by
284 `add_values_to_cover', all the EQ_ATTR tests in the original expression
285 will be FALSE. Otherwise, only the CURRENT_VALUE will be true.
287 NUM_VALUES is simply the length of the VALUES list and is there for
290 Once the dimensions are created, the algorithm enumerates all possible
291 values and computes the current value of the given expression. */
295 struct attr_desc *attr; /* Attribute for this dimension. */
296 rtx values; /* List of attribute values used. */
297 rtx current_value; /* Position in the list for the TRUE value. */
298 int num_values; /* Length of the values list. */
301 /* Other variables. */
303 static int insn_code_number;
304 static int insn_index_number;
305 static int got_define_asm_attributes;
306 static int must_extract;
307 static int must_constrain;
308 static int address_used;
309 static int length_used;
310 static int num_delays;
311 static int have_annul_true, have_annul_false;
312 static int num_units;
314 /* Used as operand to `operate_exp': */
316 enum operator {PLUS_OP, MINUS_OP, POS_MINUS_OP, EQ_OP, OR_OP, MAX_OP, MIN_OP, RANGE_OP};
318 /* Stores, for each insn code, the number of constraint alternatives. */
320 static int *insn_n_alternatives;
322 /* Stores, for each insn code, a bitmap that has bits on for each possible
325 static int *insn_alternatives;
327 /* If nonzero, assume that the `alternative' attr has this value.
328 This is the hashed, unique string for the numeral
329 whose value is chosen alternative. */
331 static char *current_alternative_string;
333 /* Used to simplify expressions. */
335 static rtx true_rtx, false_rtx;
337 /* Used to reduce calls to `strcmp' */
339 static char *alternative_name;
341 /* Simplify an expression. Only call the routine if there is something to
343 #define SIMPLIFY_TEST_EXP(EXP,INSN_CODE,INSN_INDEX) \
344 (RTX_UNCHANGING_P (EXP) || MEM_IN_STRUCT_P (EXP) ? (EXP) \
345 : simplify_test_exp (EXP, INSN_CODE, INSN_INDEX))
347 /* Simplify (eq_attr ("alternative") ...)
348 when we are working with a particular alternative. */
349 #define SIMPLIFY_ALTERNATIVE(EXP) \
350 if (current_alternative_string \
351 && GET_CODE ((EXP)) == EQ_ATTR \
352 && XSTR ((EXP), 0) == alternative_name) \
353 (EXP) = (XSTR ((EXP), 1) == current_alternative_string \
354 ? true_rtx : false_rtx);
356 /* These are referenced by rtlanal.c and hence need to be defined somewhere.
357 They won't actually be used. */
359 rtx frame_pointer_rtx, hard_frame_pointer_rtx, stack_pointer_rtx;
362 static rtx attr_rtx PROTO((enum rtx_code, ...));
364 static char *attr_printf PROTO((int, char *, ...));
366 static char *attr_printf ();
369 static char *attr_string PROTO((char *, int));
370 static rtx check_attr_test PROTO((rtx, int));
371 static rtx check_attr_value PROTO((rtx, struct attr_desc *));
372 static rtx convert_set_attr_alternative PROTO((rtx, int, int, int));
373 static rtx convert_set_attr PROTO((rtx, int, int, int));
374 static void check_defs PROTO((void));
375 static rtx convert_const_symbol_ref PROTO((rtx, struct attr_desc *));
376 static rtx make_canonical PROTO((struct attr_desc *, rtx));
377 static struct attr_value *get_attr_value PROTO((rtx, struct attr_desc *, int));
378 static rtx copy_rtx_unchanging PROTO((rtx));
379 static rtx copy_boolean PROTO((rtx));
380 static void expand_delays PROTO((void));
381 static rtx operate_exp PROTO((enum operator, rtx, rtx));
382 static void expand_units PROTO((void));
383 static rtx simplify_knowing PROTO((rtx, rtx));
384 static rtx encode_units_mask PROTO((rtx));
385 static void fill_attr PROTO((struct attr_desc *));
386 /* dpx2 compiler chokes if we specify the arg types of the args. */
387 static rtx substitute_address PROTO((rtx, rtx (*) (), rtx (*) ()));
388 static void make_length_attrs PROTO((void));
389 static rtx identity_fn PROTO((rtx));
390 static rtx zero_fn PROTO((rtx));
391 static rtx one_fn PROTO((rtx));
392 static rtx max_fn PROTO((rtx));
393 static rtx simplify_cond PROTO((rtx, int, int));
394 static rtx simplify_by_alternatives PROTO((rtx, int, int));
395 static rtx simplify_by_exploding PROTO((rtx));
396 static int find_and_mark_used_attributes PROTO((rtx, rtx *, int *));
397 static void unmark_used_attributes PROTO((rtx, struct dimension *, int));
398 static int add_values_to_cover PROTO((struct dimension *));
399 static int increment_current_value PROTO((struct dimension *, int));
400 static rtx test_for_current_value PROTO((struct dimension *, int));
401 static rtx simplify_with_current_value PROTO((rtx, struct dimension *, int));
402 static rtx simplify_with_current_value_aux PROTO((rtx));
403 static void clear_struct_flag PROTO((rtx));
404 static int count_sub_rtxs PROTO((rtx, int));
405 static void remove_insn_ent PROTO((struct attr_value *, struct insn_ent *));
406 static void insert_insn_ent PROTO((struct attr_value *, struct insn_ent *));
407 static rtx insert_right_side PROTO((enum rtx_code, rtx, rtx, int, int));
408 static rtx make_alternative_compare PROTO((int));
409 static int compute_alternative_mask PROTO((rtx, enum rtx_code));
410 static rtx evaluate_eq_attr PROTO((rtx, rtx, int, int));
411 static rtx simplify_and_tree PROTO((rtx, rtx *, int, int));
412 static rtx simplify_or_tree PROTO((rtx, rtx *, int, int));
413 static rtx simplify_test_exp PROTO((rtx, int, int));
414 static void optimize_attrs PROTO((void));
415 static void gen_attr PROTO((rtx));
416 static int count_alternatives PROTO((rtx));
417 static int compares_alternatives_p PROTO((rtx));
418 static int contained_in_p PROTO((rtx, rtx));
419 static void gen_insn PROTO((rtx));
420 static void gen_delay PROTO((rtx));
421 static void gen_unit PROTO((rtx));
422 static void write_test_expr PROTO((rtx, int));
423 static int max_attr_value PROTO((rtx));
424 static void walk_attr_value PROTO((rtx));
425 static void write_attr_get PROTO((struct attr_desc *));
426 static rtx eliminate_known_true PROTO((rtx, rtx, int, int));
427 static void write_attr_set PROTO((struct attr_desc *, int, rtx, char *,
428 char *, rtx, int, int));
429 static void write_attr_case PROTO((struct attr_desc *, struct attr_value *,
430 int, char *, char *, int, rtx));
431 static void write_attr_valueq PROTO((struct attr_desc *, char *));
432 static void write_attr_value PROTO((struct attr_desc *, rtx));
433 static void write_upcase PROTO((char *));
434 static void write_indent PROTO((int));
435 static void write_eligible_delay PROTO((char *));
436 static void write_function_unit_info PROTO((void));
437 static void write_complex_function PROTO((struct function_unit *, char *,
439 static int n_comma_elts PROTO((char *));
440 static char *next_comma_elt PROTO((char **));
441 static struct attr_desc *find_attr PROTO((char *, int));
442 static void make_internal_attr PROTO((char *, rtx, int));
443 static struct attr_value *find_most_used PROTO((struct attr_desc *));
444 static rtx find_single_value PROTO((struct attr_desc *));
445 static rtx make_numeric_value PROTO((int));
446 static void extend_range PROTO((struct range *, int, int));
447 char *xrealloc PROTO((char *, unsigned));
448 char *xmalloc PROTO((unsigned));
450 #define oballoc(size) obstack_alloc (hash_obstack, size)
453 /* Hash table for sharing RTL and strings. */
455 /* Each hash table slot is a bucket containing a chain of these structures.
456 Strings are given negative hash codes; RTL expressions are given positive
461 struct attr_hash *next; /* Next structure in the bucket. */
462 int hashcode; /* Hash code of this rtx or string. */
465 char *str; /* The string (negative hash codes) */
466 rtx rtl; /* or the RTL recorded here. */
470 /* Now here is the hash table. When recording an RTL, it is added to
471 the slot whose index is the hash code mod the table size. Note
472 that the hash table is used for several kinds of RTL (see attr_rtx)
473 and for strings. While all these live in the same table, they are
474 completely independent, and the hash code is computed differently
477 #define RTL_HASH_SIZE 4093
478 struct attr_hash *attr_hash_table[RTL_HASH_SIZE];
480 /* Here is how primitive or already-shared RTL's hash
482 #define RTL_HASH(RTL) ((HOST_WIDE_INT) (RTL) & 0777777)
484 /* Add an entry to the hash table for RTL with hash code HASHCODE. */
487 attr_hash_add_rtx (hashcode, rtl)
491 register struct attr_hash *h;
493 h = (struct attr_hash *) obstack_alloc (hash_obstack,
494 sizeof (struct attr_hash));
495 h->hashcode = hashcode;
497 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
498 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
501 /* Add an entry to the hash table for STRING with hash code HASHCODE. */
504 attr_hash_add_string (hashcode, str)
508 register struct attr_hash *h;
510 h = (struct attr_hash *) obstack_alloc (hash_obstack,
511 sizeof (struct attr_hash));
512 h->hashcode = -hashcode;
514 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
515 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
518 /* Generate an RTL expression, but avoid duplicates.
519 Set the RTX_INTEGRATED_P flag for these permanent objects.
521 In some cases we cannot uniquify; then we return an ordinary
522 impermanent rtx with RTX_INTEGRATED_P clear.
524 Args are like gen_rtx, but without the mode:
526 rtx attr_rtx (code, [element1, ..., elementn]) */
530 attr_rtx VPROTO((enum rtx_code code, ...))
536 register int i; /* Array indices... */
537 register char *fmt; /* Current rtx's format... */
538 register rtx rt_val; /* RTX to return to caller... */
540 register struct attr_hash *h;
541 struct obstack *old_obstack = rtl_obstack;
546 code = va_arg (p, enum rtx_code);
549 /* For each of several cases, search the hash table for an existing entry.
550 Use that entry if one is found; otherwise create a new RTL and add it
553 if (GET_RTX_CLASS (code) == '1')
555 rtx arg0 = va_arg (p, rtx);
557 /* A permanent object cannot point to impermanent ones. */
558 if (! RTX_INTEGRATED_P (arg0))
560 rt_val = rtx_alloc (code);
561 XEXP (rt_val, 0) = arg0;
566 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0));
567 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
568 if (h->hashcode == hashcode
569 && GET_CODE (h->u.rtl) == code
570 && XEXP (h->u.rtl, 0) == arg0)
575 rtl_obstack = hash_obstack;
576 rt_val = rtx_alloc (code);
577 XEXP (rt_val, 0) = arg0;
580 else if (GET_RTX_CLASS (code) == 'c'
581 || GET_RTX_CLASS (code) == '2'
582 || GET_RTX_CLASS (code) == '<')
584 rtx arg0 = va_arg (p, rtx);
585 rtx arg1 = va_arg (p, rtx);
587 /* A permanent object cannot point to impermanent ones. */
588 if (! RTX_INTEGRATED_P (arg0) || ! RTX_INTEGRATED_P (arg1))
590 rt_val = rtx_alloc (code);
591 XEXP (rt_val, 0) = arg0;
592 XEXP (rt_val, 1) = arg1;
597 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0) + RTL_HASH (arg1));
598 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
599 if (h->hashcode == hashcode
600 && GET_CODE (h->u.rtl) == code
601 && XEXP (h->u.rtl, 0) == arg0
602 && XEXP (h->u.rtl, 1) == arg1)
607 rtl_obstack = hash_obstack;
608 rt_val = rtx_alloc (code);
609 XEXP (rt_val, 0) = arg0;
610 XEXP (rt_val, 1) = arg1;
613 else if (GET_RTX_LENGTH (code) == 1
614 && GET_RTX_FORMAT (code)[0] == 's')
616 char * arg0 = va_arg (p, char *);
618 if (code == SYMBOL_REF)
619 arg0 = attr_string (arg0, strlen (arg0));
621 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0));
622 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
623 if (h->hashcode == hashcode
624 && GET_CODE (h->u.rtl) == code
625 && XSTR (h->u.rtl, 0) == arg0)
630 rtl_obstack = hash_obstack;
631 rt_val = rtx_alloc (code);
632 XSTR (rt_val, 0) = arg0;
635 else if (GET_RTX_LENGTH (code) == 2
636 && GET_RTX_FORMAT (code)[0] == 's'
637 && GET_RTX_FORMAT (code)[1] == 's')
639 char *arg0 = va_arg (p, char *);
640 char *arg1 = va_arg (p, char *);
642 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0) + RTL_HASH (arg1));
643 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
644 if (h->hashcode == hashcode
645 && GET_CODE (h->u.rtl) == code
646 && XSTR (h->u.rtl, 0) == arg0
647 && XSTR (h->u.rtl, 1) == arg1)
652 rtl_obstack = hash_obstack;
653 rt_val = rtx_alloc (code);
654 XSTR (rt_val, 0) = arg0;
655 XSTR (rt_val, 1) = arg1;
658 else if (code == CONST_INT)
660 HOST_WIDE_INT arg0 = va_arg (p, HOST_WIDE_INT);
670 rt_val = rtx_alloc (code); /* Allocate the storage space. */
672 fmt = GET_RTX_FORMAT (code); /* Find the right format... */
673 for (i = 0; i < GET_RTX_LENGTH (code); i++)
677 case '0': /* Unused field. */
680 case 'i': /* An integer? */
681 XINT (rt_val, i) = va_arg (p, int);
684 case 'w': /* A wide integer? */
685 XWINT (rt_val, i) = va_arg (p, HOST_WIDE_INT);
688 case 's': /* A string? */
689 XSTR (rt_val, i) = va_arg (p, char *);
692 case 'e': /* An expression? */
693 case 'u': /* An insn? Same except when printing. */
694 XEXP (rt_val, i) = va_arg (p, rtx);
697 case 'E': /* An RTX vector? */
698 XVEC (rt_val, i) = va_arg (p, rtvec);
709 rtl_obstack = old_obstack;
711 attr_hash_add_rtx (hashcode, rt_val);
712 RTX_INTEGRATED_P (rt_val) = 1;
720 /* Create a new string printed with the printf line arguments into a space
721 of at most LEN bytes:
723 rtx attr_printf (len, format, [arg1, ..., argn]) */
729 attr_printf VPROTO((register int len, register char *fmt, ...))
741 len = va_arg (p, int);
742 fmt = va_arg (p, char*);
745 /* Print the string into a temporary location. */
746 str = (char *) alloca (len);
747 vsprintf (str, fmt, p);
750 return attr_string (str, strlen (str));
753 #else /* not HAVE_VPRINTF */
756 attr_printf (len, fmt, arg1, arg2, arg3)
759 char *arg1, *arg2, *arg3; /* also int */
763 /* Print the string into a temporary location. */
764 str = (char *) alloca (len);
765 sprintf (str, fmt, arg1, arg2, arg3);
767 return attr_string (str, strlen (str));
769 #endif /* not HAVE_VPRINTF */
772 attr_eq (name, value)
775 return attr_rtx (EQ_ATTR, attr_string (name, strlen (name)),
776 attr_string (value, strlen (value)));
783 return XSTR (make_numeric_value (n), 0);
786 /* Return a permanent (possibly shared) copy of a string STR (not assumed
787 to be null terminated) with LEN bytes. */
790 attr_string (str, len)
794 register struct attr_hash *h;
797 register char *new_str;
799 /* Compute the hash code. */
800 hashcode = (len + 1) * 613 + (unsigned)str[0];
801 for (i = 1; i <= len; i += 2)
802 hashcode = ((hashcode * 613) + (unsigned)str[i]);
804 hashcode = -hashcode;
806 /* Search the table for the string. */
807 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
808 if (h->hashcode == -hashcode && h->u.str[0] == str[0]
809 && !strncmp (h->u.str, str, len))
810 return h->u.str; /* <-- return if found. */
812 /* Not found; create a permanent copy and add it to the hash table. */
813 new_str = (char *) obstack_alloc (hash_obstack, len + 1);
814 bcopy (str, new_str, len);
816 attr_hash_add_string (hashcode, new_str);
818 return new_str; /* Return the new string. */
821 /* Check two rtx's for equality of contents,
822 taking advantage of the fact that if both are hashed
823 then they can't be equal unless they are the same object. */
829 return (x == y || (! (RTX_INTEGRATED_P (x) && RTX_INTEGRATED_P (y))
830 && rtx_equal_p (x, y)));
833 /* Copy an attribute value expression,
834 descending to all depths, but not copying any
835 permanent hashed subexpressions. */
843 register RTX_CODE code;
844 register char *format_ptr;
846 /* No need to copy a permanent object. */
847 if (RTX_INTEGRATED_P (orig))
850 code = GET_CODE (orig);
865 copy = rtx_alloc (code);
866 PUT_MODE (copy, GET_MODE (orig));
867 copy->in_struct = orig->in_struct;
868 copy->volatil = orig->volatil;
869 copy->unchanging = orig->unchanging;
870 copy->integrated = orig->integrated;
872 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
874 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
876 switch (*format_ptr++)
879 XEXP (copy, i) = XEXP (orig, i);
880 if (XEXP (orig, i) != NULL)
881 XEXP (copy, i) = attr_copy_rtx (XEXP (orig, i));
886 XVEC (copy, i) = XVEC (orig, i);
887 if (XVEC (orig, i) != NULL)
889 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
890 for (j = 0; j < XVECLEN (copy, i); j++)
891 XVECEXP (copy, i, j) = attr_copy_rtx (XVECEXP (orig, i, j));
897 XINT (copy, i) = XINT (orig, i);
901 XWINT (copy, i) = XWINT (orig, i);
906 XSTR (copy, i) = XSTR (orig, i);
916 /* Given a test expression for an attribute, ensure it is validly formed.
917 IS_CONST indicates whether the expression is constant for each compiler
918 run (a constant expression may not test any particular insn).
920 Convert (eq_attr "att" "a1,a2") to (ior (eq_attr ... ) (eq_attrq ..))
921 and (eq_attr "att" "!a1") to (not (eq_attr "att" "a1")). Do the latter
922 test first so that (eq_attr "att" "!a1,a2,a3") works as expected.
924 Update the string address in EQ_ATTR expression to be the same used
925 in the attribute (or `alternative_name') to speed up subsequent
926 `find_attr' calls and eliminate most `strcmp' calls.
928 Return the new expression, if any. */
931 check_attr_test (exp, is_const)
935 struct attr_desc *attr;
936 struct attr_value *av;
940 switch (GET_CODE (exp))
943 /* Handle negation test. */
944 if (XSTR (exp, 1)[0] == '!')
945 return check_attr_test (attr_rtx (NOT,
946 attr_eq (XSTR (exp, 0),
950 else if (n_comma_elts (XSTR (exp, 1)) == 1)
952 attr = find_attr (XSTR (exp, 0), 0);
955 if (! strcmp (XSTR (exp, 0), "alternative"))
957 XSTR (exp, 0) = alternative_name;
958 /* This can't be simplified any further. */
959 RTX_UNCHANGING_P (exp) = 1;
963 fatal ("Unknown attribute `%s' in EQ_ATTR", XEXP (exp, 0));
966 if (is_const && ! attr->is_const)
967 fatal ("Constant expression uses insn attribute `%s' in EQ_ATTR",
970 /* Copy this just to make it permanent,
971 so expressions using it can be permanent too. */
972 exp = attr_eq (XSTR (exp, 0), XSTR (exp, 1));
974 /* It shouldn't be possible to simplify the value given to a
975 constant attribute, so don't expand this until it's time to
976 write the test expression. */
978 RTX_UNCHANGING_P (exp) = 1;
980 if (attr->is_numeric)
982 for (p = XSTR (exp, 1); *p; p++)
983 if (*p < '0' || *p > '9')
984 fatal ("Attribute `%s' takes only numeric values",
989 for (av = attr->first_value; av; av = av->next)
990 if (GET_CODE (av->value) == CONST_STRING
991 && ! strcmp (XSTR (exp, 1), XSTR (av->value, 0)))
995 fatal ("Unknown value `%s' for `%s' attribute",
996 XEXP (exp, 1), XEXP (exp, 0));
1001 /* Make an IOR tree of the possible values. */
1003 name_ptr = XSTR (exp, 1);
1004 while ((p = next_comma_elt (&name_ptr)) != NULL)
1006 newexp = attr_eq (XSTR (exp, 0), p);
1007 orexp = insert_right_side (IOR, orexp, newexp, -2, -2);
1010 return check_attr_test (orexp, is_const);
1018 /* Either TRUE or FALSE. */
1026 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0), is_const);
1027 XEXP (exp, 1) = check_attr_test (XEXP (exp, 1), is_const);
1031 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0), is_const);
1036 fatal ("RTL operator \"%s\" not valid in constant attribute test",
1037 GET_RTX_NAME (MATCH_OPERAND));
1038 /* These cases can't be simplified. */
1039 RTX_UNCHANGING_P (exp) = 1;
1042 case LE: case LT: case GT: case GE:
1043 case LEU: case LTU: case GTU: case GEU:
1045 if (GET_CODE (XEXP (exp, 0)) == SYMBOL_REF
1046 && GET_CODE (XEXP (exp, 1)) == SYMBOL_REF)
1047 exp = attr_rtx (GET_CODE (exp),
1048 attr_rtx (SYMBOL_REF, XSTR (XEXP (exp, 0), 0)),
1049 attr_rtx (SYMBOL_REF, XSTR (XEXP (exp, 1), 0)));
1050 /* These cases can't be simplified. */
1051 RTX_UNCHANGING_P (exp) = 1;
1057 /* These cases are valid for constant attributes, but can't be
1059 exp = attr_rtx (SYMBOL_REF, XSTR (exp, 0));
1060 RTX_UNCHANGING_P (exp) = 1;
1064 fatal ("RTL operator \"%s\" not valid in attribute test",
1065 GET_RTX_NAME (GET_CODE (exp)));
1071 /* Given an expression, ensure that it is validly formed and that all named
1072 attribute values are valid for the given attribute. Issue a fatal error
1073 if not. If no attribute is specified, assume a numeric attribute.
1075 Return a perhaps modified replacement expression for the value. */
1078 check_attr_value (exp, attr)
1080 struct attr_desc *attr;
1082 struct attr_value *av;
1086 switch (GET_CODE (exp))
1089 if (attr && ! attr->is_numeric)
1090 fatal ("CONST_INT not valid for non-numeric `%s' attribute",
1093 if (INTVAL (exp) < 0)
1094 fatal ("Negative numeric value specified for `%s' attribute",
1100 if (! strcmp (XSTR (exp, 0), "*"))
1103 if (attr == 0 || attr->is_numeric)
1106 if (attr && attr->negative_ok && *p == '-')
1109 if (*p > '9' || *p < '0')
1110 fatal ("Non-numeric value for numeric `%s' attribute",
1111 attr ? attr->name : "internal");
1115 for (av = attr->first_value; av; av = av->next)
1116 if (GET_CODE (av->value) == CONST_STRING
1117 && ! strcmp (XSTR (av->value, 0), XSTR (exp, 0)))
1121 fatal ("Unknown value `%s' for `%s' attribute",
1122 XSTR (exp, 0), attr ? attr->name : "internal");
1127 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0),
1128 attr ? attr->is_const : 0);
1129 XEXP (exp, 1) = check_attr_value (XEXP (exp, 1), attr);
1130 XEXP (exp, 2) = check_attr_value (XEXP (exp, 2), attr);
1134 if (XVECLEN (exp, 0) % 2 != 0)
1135 fatal ("First operand of COND must have even length");
1137 for (i = 0; i < XVECLEN (exp, 0); i += 2)
1139 XVECEXP (exp, 0, i) = check_attr_test (XVECEXP (exp, 0, i),
1140 attr ? attr->is_const : 0);
1141 XVECEXP (exp, 0, i + 1)
1142 = check_attr_value (XVECEXP (exp, 0, i + 1), attr);
1145 XEXP (exp, 1) = check_attr_value (XEXP (exp, 1), attr);
1149 if (attr && attr->is_const)
1150 /* A constant SYMBOL_REF is valid as a constant attribute test and
1151 is expanded later by make_canonical into a COND. */
1152 return attr_rtx (SYMBOL_REF, XSTR (exp, 0));
1153 /* Otherwise, fall through... */
1156 fatal ("Illegal operation `%s' for attribute value",
1157 GET_RTX_NAME (GET_CODE (exp)));
1163 /* Given an SET_ATTR_ALTERNATIVE expression, convert to the canonical SET.
1164 It becomes a COND with each test being (eq_attr "alternative "n") */
1167 convert_set_attr_alternative (exp, num_alt, insn_code, insn_index)
1170 int insn_code, insn_index;
1175 if (XVECLEN (exp, 1) != num_alt)
1176 fatal ("Bad number of entries in SET_ATTR_ALTERNATIVE for insn %d",
1179 /* Make a COND with all tests but the last. Select the last value via the
1181 condexp = rtx_alloc (COND);
1182 XVEC (condexp, 0) = rtvec_alloc ((num_alt - 1) * 2);
1184 for (i = 0; i < num_alt - 1; i++)
1187 p = attr_numeral (i);
1189 XVECEXP (condexp, 0, 2 * i) = attr_eq (alternative_name, p);
1191 /* Sharing this EQ_ATTR rtl causes trouble. */
1192 XVECEXP (condexp, 0, 2 * i) = rtx_alloc (EQ_ATTR);
1193 XSTR (XVECEXP (condexp, 0, 2 * i), 0) = alternative_name;
1194 XSTR (XVECEXP (condexp, 0, 2 * i), 1) = p;
1196 XVECEXP (condexp, 0, 2 * i + 1) = XVECEXP (exp, 1, i);
1199 XEXP (condexp, 1) = XVECEXP (exp, 1, i);
1201 return attr_rtx (SET, attr_rtx (ATTR, XSTR (exp, 0)), condexp);
1204 /* Given a SET_ATTR, convert to the appropriate SET. If a comma-separated
1205 list of values is given, convert to SET_ATTR_ALTERNATIVE first. */
1208 convert_set_attr (exp, num_alt, insn_code, insn_index)
1211 int insn_code, insn_index;
1218 /* See how many alternative specified. */
1219 n = n_comma_elts (XSTR (exp, 1));
1221 return attr_rtx (SET,
1222 attr_rtx (ATTR, XSTR (exp, 0)),
1223 attr_rtx (CONST_STRING, XSTR (exp, 1)));
1225 newexp = rtx_alloc (SET_ATTR_ALTERNATIVE);
1226 XSTR (newexp, 0) = XSTR (exp, 0);
1227 XVEC (newexp, 1) = rtvec_alloc (n);
1229 /* Process each comma-separated name. */
1230 name_ptr = XSTR (exp, 1);
1232 while ((p = next_comma_elt (&name_ptr)) != NULL)
1233 XVECEXP (newexp, 1, n++) = attr_rtx (CONST_STRING, p);
1235 return convert_set_attr_alternative (newexp, num_alt, insn_code, insn_index);
1238 /* Scan all definitions, checking for validity. Also, convert any SET_ATTR
1239 and SET_ATTR_ALTERNATIVE expressions to the corresponding SET
1245 struct insn_def *id;
1246 struct attr_desc *attr;
1250 for (id = defs; id; id = id->next)
1252 if (XVEC (id->def, id->vec_idx) == NULL)
1255 for (i = 0; i < XVECLEN (id->def, id->vec_idx); i++)
1257 value = XVECEXP (id->def, id->vec_idx, i);
1258 switch (GET_CODE (value))
1261 if (GET_CODE (XEXP (value, 0)) != ATTR)
1262 fatal ("Bad attribute set in pattern %d", id->insn_index);
1265 case SET_ATTR_ALTERNATIVE:
1266 value = convert_set_attr_alternative (value,
1267 id->num_alternatives,
1273 value = convert_set_attr (value, id->num_alternatives,
1274 id->insn_code, id->insn_index);
1278 fatal ("Invalid attribute code `%s' for pattern %d",
1279 GET_RTX_NAME (GET_CODE (value)), id->insn_index);
1282 if ((attr = find_attr (XSTR (XEXP (value, 0), 0), 0)) == NULL)
1283 fatal ("Unknown attribute `%s' for pattern number %d",
1284 XSTR (XEXP (value, 0), 0), id->insn_index);
1286 XVECEXP (id->def, id->vec_idx, i) = value;
1287 XEXP (value, 1) = check_attr_value (XEXP (value, 1), attr);
1292 /* Given a constant SYMBOL_REF expression, convert to a COND that
1293 explicitly tests each enumerated value. */
1296 convert_const_symbol_ref (exp, attr)
1298 struct attr_desc *attr;
1301 struct attr_value *av;
1305 for (av = attr->first_value; av; av = av->next)
1308 /* Make a COND with all tests but the last, and in the original order.
1309 Select the last value via the default. Note that the attr values
1310 are constructed in reverse order. */
1312 condexp = rtx_alloc (COND);
1313 XVEC (condexp, 0) = rtvec_alloc ((num_alt - 1) * 2);
1314 av = attr->first_value;
1315 XEXP (condexp, 1) = av->value;
1317 for (i = num_alt - 2; av = av->next, i >= 0; i--)
1322 string = p = (char *) oballoc (2
1323 + strlen (attr->name)
1324 + strlen (XSTR (av->value, 0)));
1325 strcpy (p, attr->name);
1327 strcat (p, XSTR (av->value, 0));
1328 for (; *p != '\0'; p++)
1329 if (*p >= 'a' && *p <= 'z')
1332 value = attr_rtx (SYMBOL_REF, string);
1333 RTX_UNCHANGING_P (value) = 1;
1335 XVECEXP (condexp, 0, 2 * i) = attr_rtx (EQ, exp, value);
1337 XVECEXP (condexp, 0, 2 * i + 1) = av->value;
1343 /* Given a valid expression for an attribute value, remove any IF_THEN_ELSE
1344 expressions by converting them into a COND. This removes cases from this
1345 program. Also, replace an attribute value of "*" with the default attribute
1349 make_canonical (attr, exp)
1350 struct attr_desc *attr;
1356 switch (GET_CODE (exp))
1359 exp = make_numeric_value (INTVAL (exp));
1363 if (! strcmp (XSTR (exp, 0), "*"))
1365 if (attr == 0 || attr->default_val == 0)
1366 fatal ("(attr_value \"*\") used in invalid context.");
1367 exp = attr->default_val->value;
1373 if (!attr->is_const || RTX_UNCHANGING_P (exp))
1375 /* The SYMBOL_REF is constant for a given run, so mark it as unchanging.
1376 This makes the COND something that won't be considered an arbitrary
1377 expression by walk_attr_value. */
1378 RTX_UNCHANGING_P (exp) = 1;
1379 exp = convert_const_symbol_ref (exp, attr);
1380 RTX_UNCHANGING_P (exp) = 1;
1381 exp = check_attr_value (exp, attr);
1382 /* Goto COND case since this is now a COND. Note that while the
1383 new expression is rescanned, all symbol_ref notes are mared as
1388 newexp = rtx_alloc (COND);
1389 XVEC (newexp, 0) = rtvec_alloc (2);
1390 XVECEXP (newexp, 0, 0) = XEXP (exp, 0);
1391 XVECEXP (newexp, 0, 1) = XEXP (exp, 1);
1393 XEXP (newexp, 1) = XEXP (exp, 2);
1396 /* Fall through to COND case since this is now a COND. */
1404 /* First, check for degenerate COND. */
1405 if (XVECLEN (exp, 0) == 0)
1406 return make_canonical (attr, XEXP (exp, 1));
1407 defval = XEXP (exp, 1) = make_canonical (attr, XEXP (exp, 1));
1409 for (i = 0; i < XVECLEN (exp, 0); i += 2)
1411 XVECEXP (exp, 0, i) = copy_boolean (XVECEXP (exp, 0, i));
1412 XVECEXP (exp, 0, i + 1)
1413 = make_canonical (attr, XVECEXP (exp, 0, i + 1));
1414 if (! rtx_equal_p (XVECEXP (exp, 0, i + 1), defval))
1430 if (GET_CODE (exp) == AND || GET_CODE (exp) == IOR)
1431 return attr_rtx (GET_CODE (exp), copy_boolean (XEXP (exp, 0)),
1432 copy_boolean (XEXP (exp, 1)));
1436 /* Given a value and an attribute description, return a `struct attr_value *'
1437 that represents that value. This is either an existing structure, if the
1438 value has been previously encountered, or a newly-created structure.
1440 `insn_code' is the code of an insn whose attribute has the specified
1441 value (-2 if not processing an insn). We ensure that all insns for
1442 a given value have the same number of alternatives if the value checks
1445 static struct attr_value *
1446 get_attr_value (value, attr, insn_code)
1448 struct attr_desc *attr;
1451 struct attr_value *av;
1454 value = make_canonical (attr, value);
1455 if (compares_alternatives_p (value))
1457 if (insn_code < 0 || insn_alternatives == NULL)
1458 fatal ("(eq_attr \"alternatives\" ...) used in non-insn context");
1460 num_alt = insn_alternatives[insn_code];
1463 for (av = attr->first_value; av; av = av->next)
1464 if (rtx_equal_p (value, av->value)
1465 && (num_alt == 0 || av->first_insn == NULL
1466 || insn_alternatives[av->first_insn->insn_code]))
1469 av = (struct attr_value *) oballoc (sizeof (struct attr_value));
1471 av->next = attr->first_value;
1472 attr->first_value = av;
1473 av->first_insn = NULL;
1475 av->has_asm_insn = 0;
1480 /* After all DEFINE_DELAYs have been read in, create internal attributes
1481 to generate the required routines.
1483 First, we compute the number of delay slots for each insn (as a COND of
1484 each of the test expressions in DEFINE_DELAYs). Then, if more than one
1485 delay type is specified, we compute a similar function giving the
1486 DEFINE_DELAY ordinal for each insn.
1488 Finally, for each [DEFINE_DELAY, slot #] pair, we compute an attribute that
1489 tells whether a given insn can be in that delay slot.
1491 Normal attribute filling and optimization expands these to contain the
1492 information needed to handle delay slots. */
1497 struct delay_desc *delay;
1503 /* First, generate data for `num_delay_slots' function. */
1505 condexp = rtx_alloc (COND);
1506 XVEC (condexp, 0) = rtvec_alloc (num_delays * 2);
1507 XEXP (condexp, 1) = make_numeric_value (0);
1509 for (i = 0, delay = delays; delay; i += 2, delay = delay->next)
1511 XVECEXP (condexp, 0, i) = XEXP (delay->def, 0);
1512 XVECEXP (condexp, 0, i + 1)
1513 = make_numeric_value (XVECLEN (delay->def, 1) / 3);
1516 make_internal_attr ("*num_delay_slots", condexp, 0);
1518 /* If more than one delay type, do the same for computing the delay type. */
1521 condexp = rtx_alloc (COND);
1522 XVEC (condexp, 0) = rtvec_alloc (num_delays * 2);
1523 XEXP (condexp, 1) = make_numeric_value (0);
1525 for (i = 0, delay = delays; delay; i += 2, delay = delay->next)
1527 XVECEXP (condexp, 0, i) = XEXP (delay->def, 0);
1528 XVECEXP (condexp, 0, i + 1) = make_numeric_value (delay->num);
1531 make_internal_attr ("*delay_type", condexp, 1);
1534 /* For each delay possibility and delay slot, compute an eligibility
1535 attribute for non-annulled insns and for each type of annulled (annul
1536 if true and annul if false). */
1537 for (delay = delays; delay; delay = delay->next)
1539 for (i = 0; i < XVECLEN (delay->def, 1); i += 3)
1541 condexp = XVECEXP (delay->def, 1, i);
1542 if (condexp == 0) condexp = false_rtx;
1543 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1544 make_numeric_value (1), make_numeric_value (0));
1546 p = attr_printf (sizeof ("*delay__") + MAX_DIGITS*2, "*delay_%d_%d",
1548 make_internal_attr (p, newexp, 1);
1550 if (have_annul_true)
1552 condexp = XVECEXP (delay->def, 1, i + 1);
1553 if (condexp == 0) condexp = false_rtx;
1554 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1555 make_numeric_value (1),
1556 make_numeric_value (0));
1557 p = attr_printf (sizeof ("*annul_true__") + MAX_DIGITS*2,
1558 "*annul_true_%d_%d", delay->num, i / 3);
1559 make_internal_attr (p, newexp, 1);
1562 if (have_annul_false)
1564 condexp = XVECEXP (delay->def, 1, i + 2);
1565 if (condexp == 0) condexp = false_rtx;
1566 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1567 make_numeric_value (1),
1568 make_numeric_value (0));
1569 p = attr_printf (sizeof ("*annul_false__") + MAX_DIGITS*2,
1570 "*annul_false_%d_%d", delay->num, i / 3);
1571 make_internal_attr (p, newexp, 1);
1577 /* This function is given a left and right side expression and an operator.
1578 Each side is a conditional expression, each alternative of which has a
1579 numerical value. The function returns another conditional expression
1580 which, for every possible set of condition values, returns a value that is
1581 the operator applied to the values of the two sides.
1583 Since this is called early, it must also support IF_THEN_ELSE. */
1586 operate_exp (op, left, right)
1590 int left_value, right_value;
1594 /* If left is a string, apply operator to it and the right side. */
1595 if (GET_CODE (left) == CONST_STRING)
1597 /* If right is also a string, just perform the operation. */
1598 if (GET_CODE (right) == CONST_STRING)
1600 left_value = atoi (XSTR (left, 0));
1601 right_value = atoi (XSTR (right, 0));
1605 i = left_value + right_value;
1609 i = left_value - right_value;
1612 case POS_MINUS_OP: /* The positive part of LEFT - RIGHT. */
1613 if (left_value > right_value)
1614 i = left_value - right_value;
1620 i = left_value | right_value;
1624 i = left_value == right_value;
1628 i = (left_value << (HOST_BITS_PER_INT / 2)) | right_value;
1632 if (left_value > right_value)
1639 if (left_value < right_value)
1649 return make_numeric_value (i);
1651 else if (GET_CODE (right) == IF_THEN_ELSE)
1653 /* Apply recursively to all values within. */
1654 rtx newleft = operate_exp (op, left, XEXP (right, 1));
1655 rtx newright = operate_exp (op, left, XEXP (right, 2));
1656 if (rtx_equal_p (newleft, newright))
1658 return attr_rtx (IF_THEN_ELSE, XEXP (right, 0), newleft, newright);
1660 else if (GET_CODE (right) == COND)
1665 newexp = rtx_alloc (COND);
1666 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (right, 0));
1667 defval = XEXP (newexp, 1) = operate_exp (op, left, XEXP (right, 1));
1669 for (i = 0; i < XVECLEN (right, 0); i += 2)
1671 XVECEXP (newexp, 0, i) = XVECEXP (right, 0, i);
1672 XVECEXP (newexp, 0, i + 1)
1673 = operate_exp (op, left, XVECEXP (right, 0, i + 1));
1674 if (! rtx_equal_p (XVECEXP (newexp, 0, i + 1),
1679 /* If the resulting cond is trivial (all alternatives
1680 give the same value), optimize it away. */
1683 obstack_free (rtl_obstack, newexp);
1684 return operate_exp (op, left, XEXP (right, 1));
1687 /* If the result is the same as the RIGHT operand,
1689 if (rtx_equal_p (newexp, right))
1691 obstack_free (rtl_obstack, newexp);
1698 fatal ("Badly formed attribute value");
1701 /* Otherwise, do recursion the other way. */
1702 else if (GET_CODE (left) == IF_THEN_ELSE)
1704 rtx newleft = operate_exp (op, XEXP (left, 1), right);
1705 rtx newright = operate_exp (op, XEXP (left, 2), right);
1706 if (rtx_equal_p (newleft, newright))
1708 return attr_rtx (IF_THEN_ELSE, XEXP (left, 0), newleft, newright);
1710 else if (GET_CODE (left) == COND)
1715 newexp = rtx_alloc (COND);
1716 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (left, 0));
1717 defval = XEXP (newexp, 1) = operate_exp (op, XEXP (left, 1), right);
1719 for (i = 0; i < XVECLEN (left, 0); i += 2)
1721 XVECEXP (newexp, 0, i) = XVECEXP (left, 0, i);
1722 XVECEXP (newexp, 0, i + 1)
1723 = operate_exp (op, XVECEXP (left, 0, i + 1), right);
1724 if (! rtx_equal_p (XVECEXP (newexp, 0, i + 1),
1729 /* If the cond is trivial (all alternatives give the same value),
1730 optimize it away. */
1733 obstack_free (rtl_obstack, newexp);
1734 return operate_exp (op, XEXP (left, 1), right);
1737 /* If the result is the same as the LEFT operand,
1739 if (rtx_equal_p (newexp, left))
1741 obstack_free (rtl_obstack, newexp);
1749 fatal ("Badly formed attribute value.");
1754 /* Once all attributes and DEFINE_FUNCTION_UNITs have been read, we
1755 construct a number of attributes.
1757 The first produces a function `function_units_used' which is given an
1758 insn and produces an encoding showing which function units are required
1759 for the execution of that insn. If the value is non-negative, the insn
1760 uses that unit; otherwise, the value is a one's compliment mask of units
1763 The second produces a function `result_ready_cost' which is used to
1764 determine the time that the result of an insn will be ready and hence
1765 a worst-case schedule.
1767 Both of these produce quite complex expressions which are then set as the
1768 default value of internal attributes. Normal attribute simplification
1769 should produce reasonable expressions.
1771 For each unit, a `<name>_unit_ready_cost' function will take an
1772 insn and give the delay until that unit will be ready with the result
1773 and a `<name>_unit_conflict_cost' function is given an insn already
1774 executing on the unit and a candidate to execute and will give the
1775 cost from the time the executing insn started until the candidate
1776 can start (ignore limitations on the number of simultaneous insns).
1778 For each unit, a `<name>_unit_blockage' function is given an insn
1779 already executing on the unit and a candidate to execute and will
1780 give the delay incurred due to function unit conflicts. The range of
1781 blockage cost values for a given executing insn is given by the
1782 `<name>_unit_blockage_range' function. These values are encoded in
1783 an int where the upper half gives the minimum value and the lower
1784 half gives the maximum value. */
1789 struct function_unit *unit, **unit_num;
1790 struct function_unit_op *op, **op_array, ***unit_ops;
1795 int i, j, u, num, nvalues;
1797 /* Rebuild the condition for the unit to share the RTL expressions.
1798 Sharing is required by simplify_by_exploding. Build the issue delay
1799 expressions. Validate the expressions we were given for the conditions
1800 and conflict vector. Then make attributes for use in the conflict
1803 for (unit = units; unit; unit = unit->next)
1805 rtx min_issue = make_numeric_value (unit->issue_delay.min);
1807 unit->condexp = check_attr_test (unit->condexp, 0);
1809 for (op = unit->ops; op; op = op->next)
1811 rtx issue_delay = make_numeric_value (op->issue_delay);
1812 rtx issue_exp = issue_delay;
1814 /* Build, validate, and simplify the issue delay expression. */
1815 if (op->conflict_exp != true_rtx)
1816 issue_exp = attr_rtx (IF_THEN_ELSE, op->conflict_exp,
1817 issue_exp, make_numeric_value (0));
1818 issue_exp = check_attr_value (make_canonical (NULL_ATTR,
1821 issue_exp = simplify_knowing (issue_exp, unit->condexp);
1822 op->issue_exp = issue_exp;
1824 /* Make an attribute for use in the conflict function if needed. */
1825 unit->needs_conflict_function = (unit->issue_delay.min
1826 != unit->issue_delay.max);
1827 if (unit->needs_conflict_function)
1829 str = attr_printf (strlen (unit->name) + sizeof ("*_cost_") + MAX_DIGITS,
1830 "*%s_cost_%d", unit->name, op->num);
1831 make_internal_attr (str, issue_exp, 1);
1834 /* Validate the condition. */
1835 op->condexp = check_attr_test (op->condexp, 0);
1839 /* Compute the mask of function units used. Initially, the unitsmask is
1840 zero. Set up a conditional to compute each unit's contribution. */
1841 unitsmask = make_numeric_value (0);
1842 newexp = rtx_alloc (IF_THEN_ELSE);
1843 XEXP (newexp, 2) = make_numeric_value (0);
1845 /* Merge each function unit into the unit mask attributes. */
1846 for (unit = units; unit; unit = unit->next)
1848 XEXP (newexp, 0) = unit->condexp;
1849 XEXP (newexp, 1) = make_numeric_value (1 << unit->num);
1850 unitsmask = operate_exp (OR_OP, unitsmask, newexp);
1853 /* Simplify the unit mask expression, encode it, and make an attribute
1854 for the function_units_used function. */
1855 unitsmask = simplify_by_exploding (unitsmask);
1856 unitsmask = encode_units_mask (unitsmask);
1857 make_internal_attr ("*function_units_used", unitsmask, 2);
1859 /* Create an array of ops for each unit. Add an extra unit for the
1860 result_ready_cost function that has the ops of all other units. */
1861 unit_ops = (struct function_unit_op ***)
1862 alloca ((num_units + 1) * sizeof (struct function_unit_op **));
1863 unit_num = (struct function_unit **)
1864 alloca ((num_units + 1) * sizeof (struct function_unit *));
1866 unit_num[num_units] = unit = (struct function_unit *)
1867 alloca (sizeof (struct function_unit));
1868 unit->num = num_units;
1869 unit->num_opclasses = 0;
1871 for (unit = units; unit; unit = unit->next)
1873 unit_num[num_units]->num_opclasses += unit->num_opclasses;
1874 unit_num[unit->num] = unit;
1875 unit_ops[unit->num] = op_array = (struct function_unit_op **)
1876 alloca (unit->num_opclasses * sizeof (struct function_unit_op *));
1878 for (op = unit->ops; op; op = op->next)
1879 op_array[op->num] = op;
1882 /* Compose the array of ops for the extra unit. */
1883 unit_ops[num_units] = op_array = (struct function_unit_op **)
1884 alloca (unit_num[num_units]->num_opclasses
1885 * sizeof (struct function_unit_op *));
1887 for (unit = units, i = 0; unit; i += unit->num_opclasses, unit = unit->next)
1888 bcopy (unit_ops[unit->num], &op_array[i],
1889 unit->num_opclasses * sizeof (struct function_unit_op *));
1891 /* Compute the ready cost function for each unit by computing the
1892 condition for each non-default value. */
1893 for (u = 0; u <= num_units; u++)
1899 op_array = unit_ops[unit->num];
1900 num = unit->num_opclasses;
1902 /* Sort the array of ops into increasing ready cost order. */
1903 for (i = 0; i < num; i++)
1904 for (j = num - 1; j > i; j--)
1905 if (op_array[j-1]->ready < op_array[j]->ready)
1908 op_array[j] = op_array[j-1];
1912 /* Determine how many distinct non-default ready cost values there
1913 are. We use a default ready cost value of 1. */
1914 nvalues = 0; value = 1;
1915 for (i = num - 1; i >= 0; i--)
1916 if (op_array[i]->ready > value)
1918 value = op_array[i]->ready;
1923 readycost = make_numeric_value (1);
1926 /* Construct the ready cost expression as a COND of each value from
1927 the largest to the smallest. */
1928 readycost = rtx_alloc (COND);
1929 XVEC (readycost, 0) = rtvec_alloc (nvalues * 2);
1930 XEXP (readycost, 1) = make_numeric_value (1);
1932 nvalues = 0; orexp = false_rtx; value = op_array[0]->ready;
1933 for (i = 0; i < num; i++)
1938 else if (op->ready == value)
1939 orexp = insert_right_side (IOR, orexp, op->condexp, -2, -2);
1942 XVECEXP (readycost, 0, nvalues * 2) = orexp;
1943 XVECEXP (readycost, 0, nvalues * 2 + 1)
1944 = make_numeric_value (value);
1947 orexp = op->condexp;
1950 XVECEXP (readycost, 0, nvalues * 2) = orexp;
1951 XVECEXP (readycost, 0, nvalues * 2 + 1) = make_numeric_value (value);
1956 rtx max_blockage = 0, min_blockage = 0;
1958 /* Simplify the readycost expression by only considering insns
1959 that use the unit. */
1960 readycost = simplify_knowing (readycost, unit->condexp);
1962 /* Determine the blockage cost the executing insn (E) given
1963 the candidate insn (C). This is the maximum of the issue
1964 delay, the pipeline delay, and the simultaneity constraint.
1965 Each function_unit_op represents the characteristics of the
1966 candidate insn, so in the expressions below, C is a known
1967 term and E is an unknown term.
1969 We compute the blockage cost for each E for every possible C.
1970 Thus OP represents E, and READYCOST is a list of values for
1973 The issue delay function for C is op->issue_exp and is used to
1974 write the `<name>_unit_conflict_cost' function. Symbolicly
1975 this is "ISSUE-DELAY (E,C)".
1977 The pipeline delay results form the FIFO constraint on the
1978 function unit and is "READY-COST (E) + 1 - READY-COST (C)".
1980 The simultaneity constraint is based on how long it takes to
1981 fill the unit given the minimum issue delay. FILL-TIME is the
1982 constant "MIN (ISSUE-DELAY (*,*)) * (SIMULTANEITY - 1)", and
1983 the simultaneity constraint is "READY-COST (E) - FILL-TIME"
1984 if SIMULTANEITY is non-zero and zero otherwise.
1986 Thus, BLOCKAGE (E,C) when SIMULTANEITY is zero is
1988 MAX (ISSUE-DELAY (E,C),
1989 READY-COST (E) - (READY-COST (C) - 1))
1993 MAX (ISSUE-DELAY (E,C),
1994 READY-COST (E) - (READY-COST (C) - 1),
1995 READY-COST (E) - FILL-TIME)
1997 The `<name>_unit_blockage' function is computed by determining
1998 this value for each candidate insn. As these values are
1999 computed, we also compute the upper and lower bounds for
2000 BLOCKAGE (E,*). These are combined to form the function
2001 `<name>_unit_blockage_range'. Finally, the maximum blockage
2002 cost, MAX (BLOCKAGE (*,*)), is computed. */
2004 for (op = unit->ops; op; op = op->next)
2006 rtx blockage = operate_exp (POS_MINUS_OP, readycost,
2007 make_numeric_value (1));
2009 if (unit->simultaneity != 0)
2011 rtx filltime = make_numeric_value ((unit->simultaneity - 1)
2012 * unit->issue_delay.min);
2013 blockage = operate_exp (MIN_OP, blockage, filltime);
2016 blockage = operate_exp (POS_MINUS_OP,
2017 make_numeric_value (op->ready),
2020 blockage = operate_exp (MAX_OP, blockage, op->issue_exp);
2021 blockage = simplify_knowing (blockage, unit->condexp);
2023 /* Add this op's contribution to MAX (BLOCKAGE (E,*)) and
2024 MIN (BLOCKAGE (E,*)). */
2025 if (max_blockage == 0)
2026 max_blockage = min_blockage = blockage;
2030 = simplify_knowing (operate_exp (MAX_OP, max_blockage,
2034 = simplify_knowing (operate_exp (MIN_OP, min_blockage,
2039 /* Make an attribute for use in the blockage function. */
2040 str = attr_printf (strlen (unit->name) + sizeof ("*_block_") + MAX_DIGITS,
2041 "*%s_block_%d", unit->name, op->num);
2042 make_internal_attr (str, blockage, 1);
2045 /* Record MAX (BLOCKAGE (*,*)). */
2046 unit->max_blockage = max_attr_value (max_blockage);
2048 /* See if the upper and lower bounds of BLOCKAGE (E,*) are the
2049 same. If so, the blockage function carries no additional
2050 information and is not written. */
2051 newexp = operate_exp (EQ_OP, max_blockage, min_blockage);
2052 newexp = simplify_knowing (newexp, unit->condexp);
2053 unit->needs_blockage_function
2054 = (GET_CODE (newexp) != CONST_STRING
2055 || atoi (XSTR (newexp, 0)) != 1);
2057 /* If the all values of BLOCKAGE (E,C) have the same value,
2058 neither blockage function is written. */
2059 unit->needs_range_function
2060 = (unit->needs_blockage_function
2061 || GET_CODE (max_blockage) != CONST_STRING);
2063 if (unit->needs_range_function)
2065 /* Compute the blockage range function and make an attribute
2066 for writing it's value. */
2067 newexp = operate_exp (RANGE_OP, min_blockage, max_blockage);
2068 newexp = simplify_knowing (newexp, unit->condexp);
2070 str = attr_printf (strlen (unit->name) + sizeof ("*_unit_blockage_range"),
2071 "*%s_unit_blockage_range", unit->name);
2072 make_internal_attr (str, newexp, 4);
2075 str = attr_printf (strlen (unit->name) + sizeof ("*_unit_ready_cost"),
2076 "*%s_unit_ready_cost", unit->name);
2079 str = "*result_ready_cost";
2081 /* Make an attribute for the ready_cost function. Simplifying
2082 further with simplify_by_exploding doesn't win. */
2083 make_internal_attr (str, readycost, 0);
2086 /* For each unit that requires a conflict cost function, make an attribute
2087 that maps insns to the operation number. */
2088 for (unit = units; unit; unit = unit->next)
2092 if (! unit->needs_conflict_function
2093 && ! unit->needs_blockage_function)
2096 caseexp = rtx_alloc (COND);
2097 XVEC (caseexp, 0) = rtvec_alloc ((unit->num_opclasses - 1) * 2);
2099 for (op = unit->ops; op; op = op->next)
2101 /* Make our adjustment to the COND being computed. If we are the
2102 last operation class, place our values into the default of the
2104 if (op->num == unit->num_opclasses - 1)
2106 XEXP (caseexp, 1) = make_numeric_value (op->num);
2110 XVECEXP (caseexp, 0, op->num * 2) = op->condexp;
2111 XVECEXP (caseexp, 0, op->num * 2 + 1)
2112 = make_numeric_value (op->num);
2116 /* Simplifying caseexp with simplify_by_exploding doesn't win. */
2117 str = attr_printf (strlen (unit->name) + sizeof ("*_cases"),
2118 "*%s_cases", unit->name);
2119 make_internal_attr (str, caseexp, 1);
2123 /* Simplify EXP given KNOWN_TRUE. */
2126 simplify_knowing (exp, known_true)
2127 rtx exp, known_true;
2129 if (GET_CODE (exp) != CONST_STRING)
2131 exp = attr_rtx (IF_THEN_ELSE, known_true, exp,
2132 make_numeric_value (max_attr_value (exp)));
2133 exp = simplify_by_exploding (exp);
2138 /* Translate the CONST_STRING expressions in X to change the encoding of
2139 value. On input, the value is a bitmask with a one bit for each unit
2140 used; on output, the value is the unit number (zero based) if one
2141 and only one unit is used or the one's compliment of the bitmask. */
2144 encode_units_mask (x)
2149 register enum rtx_code code;
2152 code = GET_CODE (x);
2157 i = atoi (XSTR (x, 0));
2159 abort (); /* The sign bit encodes a one's compliment mask. */
2160 else if (i != 0 && i == (i & -i))
2161 /* Only one bit is set, so yield that unit number. */
2162 for (j = 0; (i >>= 1) != 0; j++)
2166 return attr_rtx (CONST_STRING, attr_printf (MAX_DIGITS, "%d", j));
2180 /* Compare the elements. If any pair of corresponding elements
2181 fail to match, return 0 for the whole things. */
2183 fmt = GET_RTX_FORMAT (code);
2184 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2190 for (j = 0; j < XVECLEN (x, i); j++)
2191 XVECEXP (x, i, j) = encode_units_mask (XVECEXP (x, i, j));
2195 XEXP (x, i) = encode_units_mask (XEXP (x, i));
2202 /* Once all attributes and insns have been read and checked, we construct for
2203 each attribute value a list of all the insns that have that value for
2208 struct attr_desc *attr;
2210 struct attr_value *av;
2211 struct insn_ent *ie;
2212 struct insn_def *id;
2216 /* Don't fill constant attributes. The value is independent of
2217 any particular insn. */
2221 for (id = defs; id; id = id->next)
2223 /* If no value is specified for this insn for this attribute, use the
2226 if (XVEC (id->def, id->vec_idx))
2227 for (i = 0; i < XVECLEN (id->def, id->vec_idx); i++)
2228 if (! strcmp (XSTR (XEXP (XVECEXP (id->def, id->vec_idx, i), 0), 0),
2230 value = XEXP (XVECEXP (id->def, id->vec_idx, i), 1);
2233 av = attr->default_val;
2235 av = get_attr_value (value, attr, id->insn_code);
2237 ie = (struct insn_ent *) oballoc (sizeof (struct insn_ent));
2238 ie->insn_code = id->insn_code;
2239 ie->insn_index = id->insn_code;
2240 insert_insn_ent (av, ie);
2244 /* Given an expression EXP, see if it is a COND or IF_THEN_ELSE that has a
2245 test that checks relative positions of insns (uses MATCH_DUP or PC).
2246 If so, replace it with what is obtained by passing the expression to
2247 ADDRESS_FN. If not but it is a COND or IF_THEN_ELSE, call this routine
2248 recursively on each value (including the default value). Otherwise,
2249 return the value returned by NO_ADDRESS_FN applied to EXP. */
2252 substitute_address (exp, no_address_fn, address_fn)
2254 rtx (*no_address_fn) ();
2255 rtx (*address_fn) ();
2260 if (GET_CODE (exp) == COND)
2262 /* See if any tests use addresses. */
2264 for (i = 0; i < XVECLEN (exp, 0); i += 2)
2265 walk_attr_value (XVECEXP (exp, 0, i));
2268 return (*address_fn) (exp);
2270 /* Make a new copy of this COND, replacing each element. */
2271 newexp = rtx_alloc (COND);
2272 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (exp, 0));
2273 for (i = 0; i < XVECLEN (exp, 0); i += 2)
2275 XVECEXP (newexp, 0, i) = XVECEXP (exp, 0, i);
2276 XVECEXP (newexp, 0, i + 1)
2277 = substitute_address (XVECEXP (exp, 0, i + 1),
2278 no_address_fn, address_fn);
2281 XEXP (newexp, 1) = substitute_address (XEXP (exp, 1),
2282 no_address_fn, address_fn);
2287 else if (GET_CODE (exp) == IF_THEN_ELSE)
2290 walk_attr_value (XEXP (exp, 0));
2292 return (*address_fn) (exp);
2294 return attr_rtx (IF_THEN_ELSE,
2295 substitute_address (XEXP (exp, 0),
2296 no_address_fn, address_fn),
2297 substitute_address (XEXP (exp, 1),
2298 no_address_fn, address_fn),
2299 substitute_address (XEXP (exp, 2),
2300 no_address_fn, address_fn));
2303 return (*no_address_fn) (exp);
2306 /* Make new attributes from the `length' attribute. The following are made,
2307 each corresponding to a function called from `shorten_branches' or
2310 *insn_default_length This is the length of the insn to be returned
2311 by `get_attr_length' before `shorten_branches'
2312 has been called. In each case where the length
2313 depends on relative addresses, the largest
2314 possible is used. This routine is also used
2315 to compute the initial size of the insn.
2317 *insn_variable_length_p This returns 1 if the insn's length depends
2318 on relative addresses, zero otherwise.
2320 *insn_current_length This is only called when it is known that the
2321 insn has a variable length and returns the
2322 current length, based on relative addresses.
2326 make_length_attrs ()
2328 static char *new_names[] = {"*insn_default_length",
2329 "*insn_variable_length_p",
2330 "*insn_current_length"};
2331 static rtx (*no_address_fn[]) PROTO((rtx)) = {identity_fn, zero_fn, zero_fn};
2332 static rtx (*address_fn[]) PROTO((rtx)) = {max_fn, one_fn, identity_fn};
2334 struct attr_desc *length_attr, *new_attr;
2335 struct attr_value *av, *new_av;
2336 struct insn_ent *ie, *new_ie;
2338 /* See if length attribute is defined. If so, it must be numeric. Make
2339 it special so we don't output anything for it. */
2340 length_attr = find_attr ("length", 0);
2341 if (length_attr == 0)
2344 if (! length_attr->is_numeric)
2345 fatal ("length attribute must be numeric.");
2347 length_attr->is_const = 0;
2348 length_attr->is_special = 1;
2350 /* Make each new attribute, in turn. */
2351 for (i = 0; i < sizeof new_names / sizeof new_names[0]; i++)
2353 make_internal_attr (new_names[i],
2354 substitute_address (length_attr->default_val->value,
2355 no_address_fn[i], address_fn[i]),
2357 new_attr = find_attr (new_names[i], 0);
2358 for (av = length_attr->first_value; av; av = av->next)
2359 for (ie = av->first_insn; ie; ie = ie->next)
2361 new_av = get_attr_value (substitute_address (av->value,
2364 new_attr, ie->insn_code);
2365 new_ie = (struct insn_ent *) oballoc (sizeof (struct insn_ent));
2366 new_ie->insn_code = ie->insn_code;
2367 new_ie->insn_index = ie->insn_index;
2368 insert_insn_ent (new_av, new_ie);
2373 /* Utility functions called from above routine. */
2386 return make_numeric_value (0);
2393 return make_numeric_value (1);
2400 return make_numeric_value (max_attr_value (exp));
2403 /* Take a COND expression and see if any of the conditions in it can be
2404 simplified. If any are known true or known false for the particular insn
2405 code, the COND can be further simplified.
2407 Also call ourselves on any COND operations that are values of this COND.
2409 We do not modify EXP; rather, we make and return a new rtx. */
2412 simplify_cond (exp, insn_code, insn_index)
2414 int insn_code, insn_index;
2417 /* We store the desired contents here,
2418 then build a new expression if they don't match EXP. */
2419 rtx defval = XEXP (exp, 1);
2420 rtx new_defval = XEXP (exp, 1);
2422 int len = XVECLEN (exp, 0);
2423 rtx *tests = (rtx *) alloca (len * sizeof (rtx));
2427 /* This lets us free all storage allocated below, if appropriate. */
2428 first_spacer = (char *) obstack_finish (rtl_obstack);
2430 bcopy (&XVECEXP (exp, 0, 0), tests, len * sizeof (rtx));
2432 /* See if default value needs simplification. */
2433 if (GET_CODE (defval) == COND)
2434 new_defval = simplify_cond (defval, insn_code, insn_index);
2436 /* Simplify the subexpressions, and see what tests we can get rid of. */
2438 for (i = 0; i < len; i += 2)
2440 rtx newtest, newval;
2442 /* Simplify this test. */
2443 newtest = SIMPLIFY_TEST_EXP (tests[i], insn_code, insn_index);
2446 newval = tests[i + 1];
2447 /* See if this value may need simplification. */
2448 if (GET_CODE (newval) == COND)
2449 newval = simplify_cond (newval, insn_code, insn_index);
2451 /* Look for ways to delete or combine this test. */
2452 if (newtest == true_rtx)
2454 /* If test is true, make this value the default
2455 and discard this + any following tests. */
2457 defval = tests[i + 1];
2458 new_defval = newval;
2461 else if (newtest == false_rtx)
2463 /* If test is false, discard it and its value. */
2464 for (j = i; j < len - 2; j++)
2465 tests[j] = tests[j + 2];
2469 else if (i > 0 && attr_equal_p (newval, tests[i - 1]))
2471 /* If this value and the value for the prev test are the same,
2475 = insert_right_side (IOR, tests[i - 2], newtest,
2476 insn_code, insn_index);
2478 /* Delete this test/value. */
2479 for (j = i; j < len - 2; j++)
2480 tests[j] = tests[j + 2];
2485 tests[i + 1] = newval;
2488 /* If the last test in a COND has the same value
2489 as the default value, that test isn't needed. */
2491 while (len > 0 && attr_equal_p (tests[len - 1], new_defval))
2494 /* See if we changed anything. */
2495 if (len != XVECLEN (exp, 0) || new_defval != XEXP (exp, 1))
2498 for (i = 0; i < len; i++)
2499 if (! attr_equal_p (tests[i], XVECEXP (exp, 0, i)))
2507 obstack_free (rtl_obstack, first_spacer);
2508 if (GET_CODE (defval) == COND)
2509 return simplify_cond (defval, insn_code, insn_index);
2514 obstack_free (rtl_obstack, first_spacer);
2519 rtx newexp = rtx_alloc (COND);
2521 XVEC (newexp, 0) = rtvec_alloc (len);
2522 bcopy (tests, &XVECEXP (newexp, 0, 0), len * sizeof (rtx));
2523 XEXP (newexp, 1) = new_defval;
2528 /* Remove an insn entry from an attribute value. */
2531 remove_insn_ent (av, ie)
2532 struct attr_value *av;
2533 struct insn_ent *ie;
2535 struct insn_ent *previe;
2537 if (av->first_insn == ie)
2538 av->first_insn = ie->next;
2541 for (previe = av->first_insn; previe->next != ie; previe = previe->next)
2543 previe->next = ie->next;
2547 if (ie->insn_code == -1)
2548 av->has_asm_insn = 0;
2551 /* Insert an insn entry in an attribute value list. */
2554 insert_insn_ent (av, ie)
2555 struct attr_value *av;
2556 struct insn_ent *ie;
2558 ie->next = av->first_insn;
2559 av->first_insn = ie;
2561 if (ie->insn_code == -1)
2562 av->has_asm_insn = 1;
2565 /* This is a utility routine to take an expression that is a tree of either
2566 AND or IOR expressions and insert a new term. The new term will be
2567 inserted at the right side of the first node whose code does not match
2568 the root. A new node will be created with the root's code. Its left
2569 side will be the old right side and its right side will be the new
2572 If the `term' is itself a tree, all its leaves will be inserted. */
2575 insert_right_side (code, exp, term, insn_code, insn_index)
2579 int insn_code, insn_index;
2583 /* Avoid consing in some special cases. */
2584 if (code == AND && term == true_rtx)
2586 if (code == AND && term == false_rtx)
2588 if (code == AND && exp == true_rtx)
2590 if (code == AND && exp == false_rtx)
2592 if (code == IOR && term == true_rtx)
2594 if (code == IOR && term == false_rtx)
2596 if (code == IOR && exp == true_rtx)
2598 if (code == IOR && exp == false_rtx)
2600 if (attr_equal_p (exp, term))
2603 if (GET_CODE (term) == code)
2605 exp = insert_right_side (code, exp, XEXP (term, 0),
2606 insn_code, insn_index);
2607 exp = insert_right_side (code, exp, XEXP (term, 1),
2608 insn_code, insn_index);
2613 if (GET_CODE (exp) == code)
2615 rtx new = insert_right_side (code, XEXP (exp, 1),
2616 term, insn_code, insn_index);
2617 if (new != XEXP (exp, 1))
2618 /* Make a copy of this expression and call recursively. */
2619 newexp = attr_rtx (code, XEXP (exp, 0), new);
2625 /* Insert the new term. */
2626 newexp = attr_rtx (code, exp, term);
2629 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2632 /* If we have an expression which AND's a bunch of
2633 (not (eq_attrq "alternative" "n"))
2634 terms, we may have covered all or all but one of the possible alternatives.
2635 If so, we can optimize. Similarly for IOR's of EQ_ATTR.
2637 This routine is passed an expression and either AND or IOR. It returns a
2638 bitmask indicating which alternatives are mentioned within EXP. */
2641 compute_alternative_mask (exp, code)
2646 if (GET_CODE (exp) == code)
2647 return compute_alternative_mask (XEXP (exp, 0), code)
2648 | compute_alternative_mask (XEXP (exp, 1), code);
2650 else if (code == AND && GET_CODE (exp) == NOT
2651 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
2652 && XSTR (XEXP (exp, 0), 0) == alternative_name)
2653 string = XSTR (XEXP (exp, 0), 1);
2655 else if (code == IOR && GET_CODE (exp) == EQ_ATTR
2656 && XSTR (exp, 0) == alternative_name)
2657 string = XSTR (exp, 1);
2663 return 1 << (string[0] - '0');
2664 return 1 << atoi (string);
2667 /* Given I, a single-bit mask, return RTX to compare the `alternative'
2668 attribute with the value represented by that bit. */
2671 make_alternative_compare (mask)
2678 for (i = 0; (mask & (1 << i)) == 0; i++)
2681 newexp = attr_rtx (EQ_ATTR, alternative_name, attr_numeral (i));
2682 RTX_UNCHANGING_P (newexp) = 1;
2687 /* If we are processing an (eq_attr "attr" "value") test, we find the value
2688 of "attr" for this insn code. From that value, we can compute a test
2689 showing when the EQ_ATTR will be true. This routine performs that
2690 computation. If a test condition involves an address, we leave the EQ_ATTR
2691 intact because addresses are only valid for the `length' attribute.
2693 EXP is the EQ_ATTR expression and VALUE is the value of that attribute
2694 for the insn corresponding to INSN_CODE and INSN_INDEX. */
2697 evaluate_eq_attr (exp, value, insn_code, insn_index)
2700 int insn_code, insn_index;
2707 if (GET_CODE (value) == CONST_STRING)
2709 if (! strcmp (XSTR (value, 0), XSTR (exp, 1)))
2714 else if (GET_CODE (value) == COND)
2716 /* We construct an IOR of all the cases for which the requested attribute
2717 value is present. Since we start with FALSE, if it is not present,
2718 FALSE will be returned.
2720 Each case is the AND of the NOT's of the previous conditions with the
2721 current condition; in the default case the current condition is TRUE.
2723 For each possible COND value, call ourselves recursively.
2725 The extra TRUE and FALSE expressions will be eliminated by another
2726 call to the simplification routine. */
2731 if (current_alternative_string)
2732 clear_struct_flag (value);
2734 for (i = 0; i < XVECLEN (value, 0); i += 2)
2736 rtx this = SIMPLIFY_TEST_EXP (XVECEXP (value, 0, i),
2737 insn_code, insn_index);
2739 SIMPLIFY_ALTERNATIVE (this);
2741 right = insert_right_side (AND, andexp, this,
2742 insn_code, insn_index);
2743 right = insert_right_side (AND, right,
2744 evaluate_eq_attr (exp,
2747 insn_code, insn_index),
2748 insn_code, insn_index);
2749 orexp = insert_right_side (IOR, orexp, right,
2750 insn_code, insn_index);
2752 /* Add this condition into the AND expression. */
2753 newexp = attr_rtx (NOT, this);
2754 andexp = insert_right_side (AND, andexp, newexp,
2755 insn_code, insn_index);
2758 /* Handle the default case. */
2759 right = insert_right_side (AND, andexp,
2760 evaluate_eq_attr (exp, XEXP (value, 1),
2761 insn_code, insn_index),
2762 insn_code, insn_index);
2763 newexp = insert_right_side (IOR, orexp, right, insn_code, insn_index);
2768 /* If uses an address, must return original expression. But set the
2769 RTX_UNCHANGING_P bit so we don't try to simplify it again. */
2772 walk_attr_value (newexp);
2776 /* This had `&& current_alternative_string', which seems to be wrong. */
2777 if (! RTX_UNCHANGING_P (exp))
2778 return copy_rtx_unchanging (exp);
2785 /* This routine is called when an AND of a term with a tree of AND's is
2786 encountered. If the term or its complement is present in the tree, it
2787 can be replaced with TRUE or FALSE, respectively.
2789 Note that (eq_attr "att" "v1") and (eq_attr "att" "v2") cannot both
2790 be true and hence are complementary.
2792 There is one special case: If we see
2793 (and (not (eq_attr "att" "v1"))
2794 (eq_attr "att" "v2"))
2795 this can be replaced by (eq_attr "att" "v2"). To do this we need to
2796 replace the term, not anything in the AND tree. So we pass a pointer to
2800 simplify_and_tree (exp, pterm, insn_code, insn_index)
2803 int insn_code, insn_index;
2808 int left_eliminates_term, right_eliminates_term;
2810 if (GET_CODE (exp) == AND)
2812 left = simplify_and_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
2813 right = simplify_and_tree (XEXP (exp, 1), pterm, insn_code, insn_index);
2814 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2816 newexp = attr_rtx (GET_CODE (exp), left, right);
2818 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2822 else if (GET_CODE (exp) == IOR)
2824 /* For the IOR case, we do the same as above, except that we can
2825 only eliminate `term' if both sides of the IOR would do so. */
2827 left = simplify_and_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
2828 left_eliminates_term = (temp == true_rtx);
2831 right = simplify_and_tree (XEXP (exp, 1), &temp, insn_code, insn_index);
2832 right_eliminates_term = (temp == true_rtx);
2834 if (left_eliminates_term && right_eliminates_term)
2837 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2839 newexp = attr_rtx (GET_CODE (exp), left, right);
2841 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2845 /* Check for simplifications. Do some extra checking here since this
2846 routine is called so many times. */
2851 else if (GET_CODE (exp) == NOT && XEXP (exp, 0) == *pterm)
2854 else if (GET_CODE (*pterm) == NOT && exp == XEXP (*pterm, 0))
2857 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == EQ_ATTR)
2859 if (XSTR (exp, 0) != XSTR (*pterm, 0))
2862 if (! strcmp (XSTR (exp, 1), XSTR (*pterm, 1)))
2868 else if (GET_CODE (*pterm) == EQ_ATTR && GET_CODE (exp) == NOT
2869 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR)
2871 if (XSTR (*pterm, 0) != XSTR (XEXP (exp, 0), 0))
2874 if (! strcmp (XSTR (*pterm, 1), XSTR (XEXP (exp, 0), 1)))
2880 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == NOT
2881 && GET_CODE (XEXP (*pterm, 0)) == EQ_ATTR)
2883 if (XSTR (exp, 0) != XSTR (XEXP (*pterm, 0), 0))
2886 if (! strcmp (XSTR (exp, 1), XSTR (XEXP (*pterm, 0), 1)))
2892 else if (GET_CODE (exp) == NOT && GET_CODE (*pterm) == NOT)
2894 if (attr_equal_p (XEXP (exp, 0), XEXP (*pterm, 0)))
2898 else if (GET_CODE (exp) == NOT)
2900 if (attr_equal_p (XEXP (exp, 0), *pterm))
2904 else if (GET_CODE (*pterm) == NOT)
2906 if (attr_equal_p (XEXP (*pterm, 0), exp))
2910 else if (attr_equal_p (exp, *pterm))
2916 /* Similar to `simplify_and_tree', but for IOR trees. */
2919 simplify_or_tree (exp, pterm, insn_code, insn_index)
2922 int insn_code, insn_index;
2927 int left_eliminates_term, right_eliminates_term;
2929 if (GET_CODE (exp) == IOR)
2931 left = simplify_or_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
2932 right = simplify_or_tree (XEXP (exp, 1), pterm, insn_code, insn_index);
2933 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2935 newexp = attr_rtx (GET_CODE (exp), left, right);
2937 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2941 else if (GET_CODE (exp) == AND)
2943 /* For the AND case, we do the same as above, except that we can
2944 only eliminate `term' if both sides of the AND would do so. */
2946 left = simplify_or_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
2947 left_eliminates_term = (temp == false_rtx);
2950 right = simplify_or_tree (XEXP (exp, 1), &temp, insn_code, insn_index);
2951 right_eliminates_term = (temp == false_rtx);
2953 if (left_eliminates_term && right_eliminates_term)
2956 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2958 newexp = attr_rtx (GET_CODE (exp), left, right);
2960 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2964 if (attr_equal_p (exp, *pterm))
2967 else if (GET_CODE (exp) == NOT && attr_equal_p (XEXP (exp, 0), *pterm))
2970 else if (GET_CODE (*pterm) == NOT && attr_equal_p (XEXP (*pterm, 0), exp))
2973 else if (GET_CODE (*pterm) == EQ_ATTR && GET_CODE (exp) == NOT
2974 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
2975 && XSTR (*pterm, 0) == XSTR (XEXP (exp, 0), 0))
2978 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == NOT
2979 && GET_CODE (XEXP (*pterm, 0)) == EQ_ATTR
2980 && XSTR (exp, 0) == XSTR (XEXP (*pterm, 0), 0))
2986 /* Given an expression, see if it can be simplified for a particular insn
2987 code based on the values of other attributes being tested. This can
2988 eliminate nested get_attr_... calls.
2990 Note that if an endless recursion is specified in the patterns, the
2991 optimization will loop. However, it will do so in precisely the cases where
2992 an infinite recursion loop could occur during compilation. It's better that
2996 simplify_test_exp (exp, insn_code, insn_index)
2998 int insn_code, insn_index;
3001 struct attr_desc *attr;
3002 struct attr_value *av;
3003 struct insn_ent *ie;
3006 char *spacer = (char *) obstack_finish (rtl_obstack);
3008 /* Don't re-simplify something we already simplified. */
3009 if (RTX_UNCHANGING_P (exp) || MEM_IN_STRUCT_P (exp))
3012 switch (GET_CODE (exp))
3015 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3016 SIMPLIFY_ALTERNATIVE (left);
3017 if (left == false_rtx)
3019 obstack_free (rtl_obstack, spacer);
3022 right = SIMPLIFY_TEST_EXP (XEXP (exp, 1), insn_code, insn_index);
3023 SIMPLIFY_ALTERNATIVE (right);
3024 if (left == false_rtx)
3026 obstack_free (rtl_obstack, spacer);
3030 /* If either side is an IOR and we have (eq_attr "alternative" ..")
3031 present on both sides, apply the distributive law since this will
3032 yield simplifications. */
3033 if ((GET_CODE (left) == IOR || GET_CODE (right) == IOR)
3034 && compute_alternative_mask (left, IOR)
3035 && compute_alternative_mask (right, IOR))
3037 if (GET_CODE (left) == IOR)
3044 newexp = attr_rtx (IOR,
3045 attr_rtx (AND, left, XEXP (right, 0)),
3046 attr_rtx (AND, left, XEXP (right, 1)));
3048 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3051 /* Try with the term on both sides. */
3052 right = simplify_and_tree (right, &left, insn_code, insn_index);
3053 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
3054 left = simplify_and_tree (left, &right, insn_code, insn_index);
3056 if (left == false_rtx || right == false_rtx)
3058 obstack_free (rtl_obstack, spacer);
3061 else if (left == true_rtx)
3065 else if (right == true_rtx)
3069 /* See if all or all but one of the insn's alternatives are specified
3070 in this tree. Optimize if so. */
3072 else if (insn_code >= 0
3073 && (GET_CODE (left) == AND
3074 || (GET_CODE (left) == NOT
3075 && GET_CODE (XEXP (left, 0)) == EQ_ATTR
3076 && XSTR (XEXP (left, 0), 0) == alternative_name)
3077 || GET_CODE (right) == AND
3078 || (GET_CODE (right) == NOT
3079 && GET_CODE (XEXP (right, 0)) == EQ_ATTR
3080 && XSTR (XEXP (right, 0), 0) == alternative_name)))
3082 i = compute_alternative_mask (exp, AND);
3083 if (i & ~insn_alternatives[insn_code])
3084 fatal ("Illegal alternative specified for pattern number %d",
3087 /* If all alternatives are excluded, this is false. */
3088 i ^= insn_alternatives[insn_code];
3091 else if ((i & (i - 1)) == 0 && insn_alternatives[insn_code] > 1)
3093 /* If just one excluded, AND a comparison with that one to the
3094 front of the tree. The others will be eliminated by
3095 optimization. We do not want to do this if the insn has one
3096 alternative and we have tested none of them! */
3097 left = make_alternative_compare (i);
3098 right = simplify_and_tree (exp, &left, insn_code, insn_index);
3099 newexp = attr_rtx (AND, left, right);
3101 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3105 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3107 newexp = attr_rtx (AND, left, right);
3108 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3113 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3114 SIMPLIFY_ALTERNATIVE (left);
3115 if (left == true_rtx)
3117 obstack_free (rtl_obstack, spacer);
3120 right = SIMPLIFY_TEST_EXP (XEXP (exp, 1), insn_code, insn_index);
3121 SIMPLIFY_ALTERNATIVE (right);
3122 if (right == true_rtx)
3124 obstack_free (rtl_obstack, spacer);
3128 right = simplify_or_tree (right, &left, insn_code, insn_index);
3129 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
3130 left = simplify_or_tree (left, &right, insn_code, insn_index);
3132 if (right == true_rtx || left == true_rtx)
3134 obstack_free (rtl_obstack, spacer);
3137 else if (left == false_rtx)
3141 else if (right == false_rtx)
3146 /* Test for simple cases where the distributive law is useful. I.e.,
3147 convert (ior (and (x) (y))
3153 else if (GET_CODE (left) == AND && GET_CODE (right) == AND
3154 && attr_equal_p (XEXP (left, 0), XEXP (right, 0)))
3156 newexp = attr_rtx (IOR, XEXP (left, 1), XEXP (right, 1));
3158 left = XEXP (left, 0);
3160 newexp = attr_rtx (AND, left, right);
3161 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3164 /* See if all or all but one of the insn's alternatives are specified
3165 in this tree. Optimize if so. */
3167 else if (insn_code >= 0
3168 && (GET_CODE (left) == IOR
3169 || (GET_CODE (left) == EQ_ATTR
3170 && XSTR (left, 0) == alternative_name)
3171 || GET_CODE (right) == IOR
3172 || (GET_CODE (right) == EQ_ATTR
3173 && XSTR (right, 0) == alternative_name)))
3175 i = compute_alternative_mask (exp, IOR);
3176 if (i & ~insn_alternatives[insn_code])
3177 fatal ("Illegal alternative specified for pattern number %d",
3180 /* If all alternatives are included, this is true. */
3181 i ^= insn_alternatives[insn_code];
3184 else if ((i & (i - 1)) == 0 && insn_alternatives[insn_code] > 1)
3186 /* If just one excluded, IOR a comparison with that one to the
3187 front of the tree. The others will be eliminated by
3188 optimization. We do not want to do this if the insn has one
3189 alternative and we have tested none of them! */
3190 left = make_alternative_compare (i);
3191 right = simplify_and_tree (exp, &left, insn_code, insn_index);
3192 newexp = attr_rtx (IOR, attr_rtx (NOT, left), right);
3194 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3198 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3200 newexp = attr_rtx (IOR, left, right);
3201 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3206 if (GET_CODE (XEXP (exp, 0)) == NOT)
3208 left = SIMPLIFY_TEST_EXP (XEXP (XEXP (exp, 0), 0),
3209 insn_code, insn_index);
3210 SIMPLIFY_ALTERNATIVE (left);
3214 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3215 SIMPLIFY_ALTERNATIVE (left);
3216 if (GET_CODE (left) == NOT)
3217 return XEXP (left, 0);
3219 if (left == false_rtx)
3221 obstack_free (rtl_obstack, spacer);
3224 else if (left == true_rtx)
3226 obstack_free (rtl_obstack, spacer);
3230 /* Try to apply De`Morgan's laws. */
3231 else if (GET_CODE (left) == IOR)
3233 newexp = attr_rtx (AND,
3234 attr_rtx (NOT, XEXP (left, 0)),
3235 attr_rtx (NOT, XEXP (left, 1)));
3237 newexp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3239 else if (GET_CODE (left) == AND)
3241 newexp = attr_rtx (IOR,
3242 attr_rtx (NOT, XEXP (left, 0)),
3243 attr_rtx (NOT, XEXP (left, 1)));
3245 newexp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3247 else if (left != XEXP (exp, 0))
3249 newexp = attr_rtx (NOT, left);
3254 if (current_alternative_string && XSTR (exp, 0) == alternative_name)
3255 return (XSTR (exp, 1) == current_alternative_string
3256 ? true_rtx : false_rtx);
3258 /* Look at the value for this insn code in the specified attribute.
3259 We normally can replace this comparison with the condition that
3260 would give this insn the values being tested for. */
3261 if (XSTR (exp, 0) != alternative_name
3262 && (attr = find_attr (XSTR (exp, 0), 0)) != NULL)
3263 for (av = attr->first_value; av; av = av->next)
3264 for (ie = av->first_insn; ie; ie = ie->next)
3265 if (ie->insn_code == insn_code)
3266 return evaluate_eq_attr (exp, av->value, insn_code, insn_index);
3269 /* We have already simplified this expression. Simplifying it again
3270 won't buy anything unless we weren't given a valid insn code
3271 to process (i.e., we are canonicalizing something.). */
3272 if (insn_code != -2 /* Seems wrong: && current_alternative_string. */
3273 && ! RTX_UNCHANGING_P (newexp))
3274 return copy_rtx_unchanging (newexp);
3279 /* Optimize the attribute lists by seeing if we can determine conditional
3280 values from the known values of other attributes. This will save subroutine
3281 calls during the compilation. */
3286 struct attr_desc *attr;
3287 struct attr_value *av;
3288 struct insn_ent *ie;
3290 int something_changed = 1;
3292 struct attr_value_list { struct attr_value *av;
3293 struct insn_ent *ie;
3294 struct attr_desc * attr;
3295 struct attr_value_list *next; };
3296 struct attr_value_list **insn_code_values;
3297 struct attr_value_list *iv;
3299 /* For each insn code, make a list of all the insn_ent's for it,
3300 for all values for all attributes. */
3302 /* Make 2 extra elements, for "code" values -2 and -1. */
3304 = (struct attr_value_list **) alloca ((insn_code_number + 2)
3305 * sizeof (struct attr_value_list *));
3306 bzero (insn_code_values,
3307 (insn_code_number + 2) * sizeof (struct attr_value_list *));
3308 /* Offset the table address so we can index by -2 or -1. */
3309 insn_code_values += 2;
3311 for (i = 0; i < MAX_ATTRS_INDEX; i++)
3312 for (attr = attrs[i]; attr; attr = attr->next)
3313 for (av = attr->first_value; av; av = av->next)
3314 for (ie = av->first_insn; ie; ie = ie->next)
3316 iv = ((struct attr_value_list *)
3317 alloca (sizeof (struct attr_value_list)));
3321 iv->next = insn_code_values[ie->insn_code];
3322 insn_code_values[ie->insn_code] = iv;
3325 /* Process one insn code at a time. */
3326 for (i = -2; i < insn_code_number; i++)
3328 /* Clear the MEM_IN_STRUCT_P flag everywhere relevant.
3329 We use it to mean "already simplified for this insn". */
3330 for (iv = insn_code_values[i]; iv; iv = iv->next)
3331 clear_struct_flag (iv->av->value);
3333 /* Loop until nothing changes for one iteration. */
3334 something_changed = 1;
3335 while (something_changed)
3337 something_changed = 0;
3338 for (iv = insn_code_values[i]; iv; iv = iv->next)
3340 struct obstack *old = rtl_obstack;
3341 char *spacer = (char *) obstack_finish (temp_obstack);
3346 if (GET_CODE (av->value) != COND)
3349 rtl_obstack = temp_obstack;
3350 #if 0 /* This was intended as a speed up, but it was slower. */
3351 if (insn_n_alternatives[ie->insn_code] > 6
3352 && count_sub_rtxs (av->value, 200) >= 200)
3353 newexp = simplify_by_alternatives (av->value, ie->insn_code,
3357 newexp = simplify_cond (av->value, ie->insn_code,
3361 if (newexp != av->value)
3363 newexp = attr_copy_rtx (newexp);
3364 remove_insn_ent (av, ie);
3365 av = get_attr_value (newexp, attr, ie->insn_code);
3367 insert_insn_ent (av, ie);
3368 something_changed = 1;
3370 obstack_free (temp_obstack, spacer);
3378 simplify_by_alternatives (exp, insn_code, insn_index)
3380 int insn_code, insn_index;
3383 int len = insn_n_alternatives[insn_code];
3384 rtx newexp = rtx_alloc (COND);
3388 XVEC (newexp, 0) = rtvec_alloc (len * 2);
3390 /* It will not matter what value we use as the default value
3391 of the new COND, since that default will never be used.
3392 Choose something of the right type. */
3393 for (ultimate = exp; GET_CODE (ultimate) == COND;)
3394 ultimate = XEXP (ultimate, 1);
3395 XEXP (newexp, 1) = ultimate;
3397 for (i = 0; i < insn_n_alternatives[insn_code]; i++)
3399 current_alternative_string = attr_numeral (i);
3400 XVECEXP (newexp, 0, i * 2) = make_alternative_compare (1 << i);
3401 XVECEXP (newexp, 0, i * 2 + 1)
3402 = simplify_cond (exp, insn_code, insn_index);
3405 current_alternative_string = 0;
3406 return simplify_cond (newexp, insn_code, insn_index);
3410 /* If EXP is a suitable expression, reorganize it by constructing an
3411 equivalent expression that is a COND with the tests being all combinations
3412 of attribute values and the values being simple constants. */
3415 simplify_by_exploding (exp)
3418 rtx list = 0, link, condexp, defval;
3419 struct dimension *space;
3420 rtx *condtest, *condval;
3421 int i, j, total, ndim = 0;
3422 int most_tests, num_marks, new_marks;
3424 /* Locate all the EQ_ATTR expressions. */
3425 if (! find_and_mark_used_attributes (exp, &list, &ndim) || ndim == 0)
3427 unmark_used_attributes (list, 0, 0);
3431 /* Create an attribute space from the list of used attributes. For each
3432 dimension in the attribute space, record the attribute, list of values
3433 used, and number of values used. Add members to the list of values to
3434 cover the domain of the attribute. This makes the expanded COND form
3435 order independent. */
3437 space = (struct dimension *) alloca (ndim * sizeof (struct dimension));
3440 for (ndim = 0; list; ndim++)
3442 /* Pull the first attribute value from the list and record that
3443 attribute as another dimension in the attribute space. */
3444 char *name = XSTR (XEXP (list, 0), 0);
3447 if ((space[ndim].attr = find_attr (name, 0)) == 0
3448 || space[ndim].attr->is_numeric)
3450 unmark_used_attributes (list, space, ndim);
3454 /* Add all remaining attribute values that refer to this attribute. */
3455 space[ndim].num_values = 0;
3456 space[ndim].values = 0;
3458 for (link = list; link; link = *prev)
3459 if (! strcmp (XSTR (XEXP (link, 0), 0), name))
3461 space[ndim].num_values++;
3462 *prev = XEXP (link, 1);
3463 XEXP (link, 1) = space[ndim].values;
3464 space[ndim].values = link;
3467 prev = &XEXP (link, 1);
3469 /* Add sufficient members to the list of values to make the list
3470 mutually exclusive and record the total size of the attribute
3472 total *= add_values_to_cover (&space[ndim]);
3475 /* Sort the attribute space so that the attributes go from non-constant
3476 to constant and from most values to least values. */
3477 for (i = 0; i < ndim; i++)
3478 for (j = ndim - 1; j > i; j--)
3479 if ((space[j-1].attr->is_const && !space[j].attr->is_const)
3480 || space[j-1].num_values < space[j].num_values)
3482 struct dimension tmp;
3484 space[j] = space[j-1];
3488 /* Establish the initial current value. */
3489 for (i = 0; i < ndim; i++)
3490 space[i].current_value = space[i].values;
3492 condtest = (rtx *) alloca (total * sizeof (rtx));
3493 condval = (rtx *) alloca (total * sizeof (rtx));
3495 /* Expand the tests and values by iterating over all values in the
3499 condtest[i] = test_for_current_value (space, ndim);
3500 condval[i] = simplify_with_current_value (exp, space, ndim);
3501 if (! increment_current_value (space, ndim))
3507 /* We are now finished with the original expression. */
3508 unmark_used_attributes (0, space, ndim);
3510 /* Find the most used constant value and make that the default. */
3512 for (i = num_marks = 0; i < total; i++)
3513 if (GET_CODE (condval[i]) == CONST_STRING
3514 && ! MEM_VOLATILE_P (condval[i]))
3516 /* Mark the unmarked constant value and count how many are marked. */
3517 MEM_VOLATILE_P (condval[i]) = 1;
3518 for (j = new_marks = 0; j < total; j++)
3519 if (GET_CODE (condval[j]) == CONST_STRING
3520 && MEM_VOLATILE_P (condval[j]))
3522 if (new_marks - num_marks > most_tests)
3524 most_tests = new_marks - num_marks;
3525 defval = condval[i];
3527 num_marks = new_marks;
3529 /* Clear all the marks. */
3530 for (i = 0; i < total; i++)
3531 MEM_VOLATILE_P (condval[i]) = 0;
3533 /* Give up if nothing is constant. */
3537 /* If all values are the default, use that. */
3538 if (total == most_tests)
3541 /* Make a COND with the most common constant value the default. (A more
3542 complex method where tests with the same value were combined didn't
3543 seem to improve things.) */
3544 condexp = rtx_alloc (COND);
3545 XVEC (condexp, 0) = rtvec_alloc ((total - most_tests) * 2);
3546 XEXP (condexp, 1) = defval;
3547 for (i = j = 0; i < total; i++)
3548 if (condval[i] != defval)
3550 XVECEXP (condexp, 0, 2 * j) = condtest[i];
3551 XVECEXP (condexp, 0, 2 * j + 1) = condval[i];
3558 /* Set the MEM_VOLATILE_P flag for all EQ_ATTR expressions in EXP and
3559 verify that EXP can be simplified to a constant term if all the EQ_ATTR
3560 tests have known value. */
3563 find_and_mark_used_attributes (exp, terms, nterms)
3569 switch (GET_CODE (exp))
3572 if (! MEM_VOLATILE_P (exp))
3574 rtx link = rtx_alloc (EXPR_LIST);
3575 XEXP (link, 0) = exp;
3576 XEXP (link, 1) = *terms;
3579 MEM_VOLATILE_P (exp) = 1;
3585 if (! find_and_mark_used_attributes (XEXP (exp, 2), terms, nterms))
3589 if (! find_and_mark_used_attributes (XEXP (exp, 1), terms, nterms))
3592 if (! find_and_mark_used_attributes (XEXP (exp, 0), terms, nterms))
3597 for (i = 0; i < XVECLEN (exp, 0); i++)
3598 if (! find_and_mark_used_attributes (XVECEXP (exp, 0, i), terms, nterms))
3600 if (! find_and_mark_used_attributes (XEXP (exp, 1), terms, nterms))
3608 /* Clear the MEM_VOLATILE_P flag in all EQ_ATTR expressions on LIST and
3609 in the values of the NDIM-dimensional attribute space SPACE. */
3612 unmark_used_attributes (list, space, ndim)
3614 struct dimension *space;
3620 for (i = 0; i < ndim; i++)
3621 unmark_used_attributes (space[i].values, 0, 0);
3623 for (link = list; link; link = XEXP (link, 1))
3625 exp = XEXP (link, 0);
3626 if (GET_CODE (exp) == EQ_ATTR)
3627 MEM_VOLATILE_P (exp) = 0;
3631 /* Update the attribute dimension DIM so that all values of the attribute
3632 are tested. Return the updated number of values. */
3635 add_values_to_cover (dim)
3636 struct dimension *dim;
3638 struct attr_value *av;
3639 rtx exp, link, *prev;
3642 for (av = dim->attr->first_value; av; av = av->next)
3643 if (GET_CODE (av->value) == CONST_STRING)
3646 if (nalt < dim->num_values)
3648 else if (nalt == dim->num_values)
3650 else if (nalt * 2 < dim->num_values * 3)
3652 /* Most all the values of the attribute are used, so add all the unused
3654 prev = &dim->values;
3655 for (link = dim->values; link; link = *prev)
3656 prev = &XEXP (link, 1);
3658 for (av = dim->attr->first_value; av; av = av->next)
3659 if (GET_CODE (av->value) == CONST_STRING)
3661 exp = attr_eq (dim->attr->name, XSTR (av->value, 0));
3662 if (MEM_VOLATILE_P (exp))
3665 link = rtx_alloc (EXPR_LIST);
3666 XEXP (link, 0) = exp;
3669 prev = &XEXP (link, 1);
3671 dim->num_values = nalt;
3675 rtx orexp = false_rtx;
3677 /* Very few values are used, so compute a mutually exclusive
3678 expression. (We could do this for numeric values if that becomes
3680 prev = &dim->values;
3681 for (link = dim->values; link; link = *prev)
3683 orexp = insert_right_side (IOR, orexp, XEXP (link, 0), -2, -2);
3684 prev = &XEXP (link, 1);
3686 link = rtx_alloc (EXPR_LIST);
3687 XEXP (link, 0) = attr_rtx (NOT, orexp);
3692 return dim->num_values;
3695 /* Increment the current value for the NDIM-dimensional attribute space SPACE
3696 and return FALSE if the increment overflowed. */
3699 increment_current_value (space, ndim)
3700 struct dimension *space;
3705 for (i = ndim - 1; i >= 0; i--)
3707 if ((space[i].current_value = XEXP (space[i].current_value, 1)) == 0)
3708 space[i].current_value = space[i].values;
3715 /* Construct an expression corresponding to the current value for the
3716 NDIM-dimensional attribute space SPACE. */
3719 test_for_current_value (space, ndim)
3720 struct dimension *space;
3726 for (i = 0; i < ndim; i++)
3727 exp = insert_right_side (AND, exp, XEXP (space[i].current_value, 0),
3733 /* Given the current value of the NDIM-dimensional attribute space SPACE,
3734 set the corresponding EQ_ATTR expressions to that value and reduce
3735 the expression EXP as much as possible. On input [and output], all
3736 known EQ_ATTR expressions are set to FALSE. */
3739 simplify_with_current_value (exp, space, ndim)
3741 struct dimension *space;
3747 /* Mark each current value as TRUE. */
3748 for (i = 0; i < ndim; i++)
3750 x = XEXP (space[i].current_value, 0);
3751 if (GET_CODE (x) == EQ_ATTR)
3752 MEM_VOLATILE_P (x) = 0;
3755 exp = simplify_with_current_value_aux (exp);
3757 /* Change each current value back to FALSE. */
3758 for (i = 0; i < ndim; i++)
3760 x = XEXP (space[i].current_value, 0);
3761 if (GET_CODE (x) == EQ_ATTR)
3762 MEM_VOLATILE_P (x) = 1;
3768 /* Reduce the expression EXP based on the MEM_VOLATILE_P settings of
3769 all EQ_ATTR expressions. */
3772 simplify_with_current_value_aux (exp)
3778 switch (GET_CODE (exp))
3781 if (MEM_VOLATILE_P (exp))
3789 cond = simplify_with_current_value_aux (XEXP (exp, 0));
3790 if (cond == true_rtx)
3791 return simplify_with_current_value_aux (XEXP (exp, 1));
3792 else if (cond == false_rtx)
3793 return simplify_with_current_value_aux (XEXP (exp, 2));
3795 return attr_rtx (IF_THEN_ELSE, cond,
3796 simplify_with_current_value_aux (XEXP (exp, 1)),
3797 simplify_with_current_value_aux (XEXP (exp, 2)));
3800 cond = simplify_with_current_value_aux (XEXP (exp, 1));
3801 if (cond == true_rtx)
3803 else if (cond == false_rtx)
3804 return simplify_with_current_value_aux (XEXP (exp, 0));
3806 return attr_rtx (IOR, cond,
3807 simplify_with_current_value_aux (XEXP (exp, 0)));
3810 cond = simplify_with_current_value_aux (XEXP (exp, 1));
3811 if (cond == true_rtx)
3812 return simplify_with_current_value_aux (XEXP (exp, 0));
3813 else if (cond == false_rtx)
3816 return attr_rtx (AND, cond,
3817 simplify_with_current_value_aux (XEXP (exp, 0)));
3820 cond = simplify_with_current_value_aux (XEXP (exp, 0));
3821 if (cond == true_rtx)
3823 else if (cond == false_rtx)
3826 return attr_rtx (NOT, cond);
3829 for (i = 0; i < XVECLEN (exp, 0); i += 2)
3831 cond = simplify_with_current_value_aux (XVECEXP (exp, 0, i));
3832 if (cond == true_rtx)
3833 return simplify_with_current_value_aux (XVECEXP (exp, 0, i + 1));
3834 else if (cond == false_rtx)
3837 abort (); /* With all EQ_ATTR's of known value, a case should
3838 have been selected. */
3840 return simplify_with_current_value_aux (XEXP (exp, 1));
3845 /* Clear the MEM_IN_STRUCT_P flag in EXP and its subexpressions. */
3848 clear_struct_flag (x)
3853 register enum rtx_code code;
3856 MEM_IN_STRUCT_P (x) = 0;
3857 if (RTX_UNCHANGING_P (x))
3860 code = GET_CODE (x);
3877 /* Compare the elements. If any pair of corresponding elements
3878 fail to match, return 0 for the whole things. */
3880 fmt = GET_RTX_FORMAT (code);
3881 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3887 for (j = 0; j < XVECLEN (x, i); j++)
3888 clear_struct_flag (XVECEXP (x, i, j));
3892 clear_struct_flag (XEXP (x, i));
3898 /* Return the number of RTX objects making up the expression X.
3899 But if we count more more than MAX objects, stop counting. */
3902 count_sub_rtxs (x, max)
3908 register enum rtx_code code;
3912 code = GET_CODE (x);
3929 /* Compare the elements. If any pair of corresponding elements
3930 fail to match, return 0 for the whole things. */
3932 fmt = GET_RTX_FORMAT (code);
3933 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3942 for (j = 0; j < XVECLEN (x, i); j++)
3943 total += count_sub_rtxs (XVECEXP (x, i, j), max);
3947 total += count_sub_rtxs (XEXP (x, i), max);
3955 /* Create table entries for DEFINE_ATTR. */
3961 struct attr_desc *attr;
3962 struct attr_value *av;
3966 /* Make a new attribute structure. Check for duplicate by looking at
3967 attr->default_val, since it is initialized by this routine. */
3968 attr = find_attr (XSTR (exp, 0), 1);
3969 if (attr->default_val)
3970 fatal ("Duplicate definition for `%s' attribute", attr->name);
3972 if (*XSTR (exp, 1) == '\0')
3973 attr->is_numeric = 1;
3976 name_ptr = XSTR (exp, 1);
3977 while ((p = next_comma_elt (&name_ptr)) != NULL)
3979 av = (struct attr_value *) oballoc (sizeof (struct attr_value));
3980 av->value = attr_rtx (CONST_STRING, p);
3981 av->next = attr->first_value;
3982 attr->first_value = av;
3983 av->first_insn = NULL;
3985 av->has_asm_insn = 0;
3989 if (GET_CODE (XEXP (exp, 2)) == CONST)
3992 if (attr->is_numeric)
3993 fatal ("Constant attributes may not take numeric values");
3994 /* Get rid of the CONST node. It is allowed only at top-level. */
3995 XEXP (exp, 2) = XEXP (XEXP (exp, 2), 0);
3998 if (! strcmp (attr->name, "length") && ! attr->is_numeric)
3999 fatal ("`length' attribute must take numeric values");
4001 /* Set up the default value. */
4002 XEXP (exp, 2) = check_attr_value (XEXP (exp, 2), attr);
4003 attr->default_val = get_attr_value (XEXP (exp, 2), attr, -2);
4006 /* Given a pattern for DEFINE_PEEPHOLE or DEFINE_INSN, return the number of
4007 alternatives in the constraints. Assume all MATCH_OPERANDs have the same
4008 number of alternatives as this should be checked elsewhere. */
4011 count_alternatives (exp)
4017 if (GET_CODE (exp) == MATCH_OPERAND)
4018 return n_comma_elts (XSTR (exp, 2));
4020 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4021 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4026 n = count_alternatives (XEXP (exp, i));
4033 if (XVEC (exp, i) != NULL)
4034 for (j = 0; j < XVECLEN (exp, i); j++)
4036 n = count_alternatives (XVECEXP (exp, i, j));
4045 /* Returns non-zero if the given expression contains an EQ_ATTR with the
4046 `alternative' attribute. */
4049 compares_alternatives_p (exp)
4055 if (GET_CODE (exp) == EQ_ATTR && XSTR (exp, 0) == alternative_name)
4058 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4059 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4064 if (compares_alternatives_p (XEXP (exp, i)))
4069 for (j = 0; j < XVECLEN (exp, i); j++)
4070 if (compares_alternatives_p (XVECEXP (exp, i, j)))
4078 /* Returns non-zero is INNER is contained in EXP. */
4081 contained_in_p (inner, exp)
4088 if (rtx_equal_p (inner, exp))
4091 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4092 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4097 if (contained_in_p (inner, XEXP (exp, i)))
4102 for (j = 0; j < XVECLEN (exp, i); j++)
4103 if (contained_in_p (inner, XVECEXP (exp, i, j)))
4111 /* Process DEFINE_PEEPHOLE, DEFINE_INSN, and DEFINE_ASM_ATTRIBUTES. */
4117 struct insn_def *id;
4119 id = (struct insn_def *) oballoc (sizeof (struct insn_def));
4124 switch (GET_CODE (exp))
4127 id->insn_code = insn_code_number++;
4128 id->insn_index = insn_index_number++;
4129 id->num_alternatives = count_alternatives (exp);
4130 if (id->num_alternatives == 0)
4131 id->num_alternatives = 1;
4135 case DEFINE_PEEPHOLE:
4136 id->insn_code = insn_code_number++;
4137 id->insn_index = insn_index_number++;
4138 id->num_alternatives = count_alternatives (exp);
4139 if (id->num_alternatives == 0)
4140 id->num_alternatives = 1;
4144 case DEFINE_ASM_ATTRIBUTES:
4146 id->insn_index = -1;
4147 id->num_alternatives = 1;
4149 got_define_asm_attributes = 1;
4154 /* Process a DEFINE_DELAY. Validate the vector length, check if annul
4155 true or annul false is specified, and make a `struct delay_desc'. */
4161 struct delay_desc *delay;
4164 if (XVECLEN (def, 1) % 3 != 0)
4165 fatal ("Number of elements in DEFINE_DELAY must be multiple of three.");
4167 for (i = 0; i < XVECLEN (def, 1); i += 3)
4169 if (XVECEXP (def, 1, i + 1))
4170 have_annul_true = 1;
4171 if (XVECEXP (def, 1, i + 2))
4172 have_annul_false = 1;
4175 delay = (struct delay_desc *) oballoc (sizeof (struct delay_desc));
4177 delay->num = ++num_delays;
4178 delay->next = delays;
4182 /* Process a DEFINE_FUNCTION_UNIT.
4184 This gives information about a function unit contained in the CPU.
4185 We fill in a `struct function_unit_op' and a `struct function_unit'
4186 with information used later by `expand_unit'. */
4192 struct function_unit *unit;
4193 struct function_unit_op *op;
4194 char *name = XSTR (def, 0);
4195 int multiplicity = XINT (def, 1);
4196 int simultaneity = XINT (def, 2);
4197 rtx condexp = XEXP (def, 3);
4198 int ready_cost = MAX (XINT (def, 4), 1);
4199 int issue_delay = MAX (XINT (def, 5), 1);
4201 /* See if we have already seen this function unit. If so, check that
4202 the multiplicity and simultaneity values are the same. If not, make
4203 a structure for this function unit. */
4204 for (unit = units; unit; unit = unit->next)
4205 if (! strcmp (unit->name, name))
4207 if (unit->multiplicity != multiplicity
4208 || unit->simultaneity != simultaneity)
4209 fatal ("Differing specifications given for `%s' function unit.",
4216 unit = (struct function_unit *) oballoc (sizeof (struct function_unit));
4218 unit->multiplicity = multiplicity;
4219 unit->simultaneity = simultaneity;
4220 unit->issue_delay.min = unit->issue_delay.max = issue_delay;
4221 unit->num = num_units++;
4222 unit->num_opclasses = 0;
4223 unit->condexp = false_rtx;
4229 /* Make a new operation class structure entry and initialize it. */
4230 op = (struct function_unit_op *) oballoc (sizeof (struct function_unit_op));
4231 op->condexp = condexp;
4232 op->num = unit->num_opclasses++;
4233 op->ready = ready_cost;
4234 op->issue_delay = issue_delay;
4235 op->next = unit->ops;
4238 /* Set our issue expression based on whether or not an optional conflict
4239 vector was specified. */
4242 /* Compute the IOR of all the specified expressions. */
4243 rtx orexp = false_rtx;
4246 for (i = 0; i < XVECLEN (def, 6); i++)
4247 orexp = insert_right_side (IOR, orexp, XVECEXP (def, 6, i), -2, -2);
4249 op->conflict_exp = orexp;
4250 extend_range (&unit->issue_delay, 1, issue_delay);
4254 op->conflict_exp = true_rtx;
4255 extend_range (&unit->issue_delay, issue_delay, issue_delay);
4258 /* Merge our conditional into that of the function unit so we can determine
4259 which insns are used by the function unit. */
4260 unit->condexp = insert_right_side (IOR, unit->condexp, op->condexp, -2, -2);
4263 /* Given a piece of RTX, print a C expression to test it's truth value.
4264 We use AND and IOR both for logical and bit-wise operations, so
4265 interpret them as logical unless they are inside a comparison expression.
4266 The second operand of this function will be non-zero in that case. */
4269 write_test_expr (exp, in_comparison)
4273 int comparison_operator = 0;
4275 struct attr_desc *attr;
4277 /* In order not to worry about operator precedence, surround our part of
4278 the expression with parentheses. */
4281 code = GET_CODE (exp);
4284 /* Binary operators. */
4286 case GE: case GT: case GEU: case GTU:
4287 case LE: case LT: case LEU: case LTU:
4288 comparison_operator = 1;
4290 case PLUS: case MINUS: case MULT: case DIV: case MOD:
4291 case AND: case IOR: case XOR:
4292 case LSHIFT: case ASHIFT: case LSHIFTRT: case ASHIFTRT:
4293 write_test_expr (XEXP (exp, 0), in_comparison || comparison_operator);
4309 printf (" >= (unsigned) ");
4312 printf (" > (unsigned) ");
4321 printf (" <= (unsigned) ");
4324 printf (" < (unsigned) ");
4366 write_test_expr (XEXP (exp, 1), in_comparison || comparison_operator);
4370 /* Special-case (not (eq_attrq "alternative" "x")) */
4371 if (! in_comparison && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
4372 && XSTR (XEXP (exp, 0), 0) == alternative_name)
4374 printf ("which_alternative != %s", XSTR (XEXP (exp, 0), 1));
4378 /* Otherwise, fall through to normal unary operator. */
4380 /* Unary operators. */
4398 write_test_expr (XEXP (exp, 0), in_comparison);
4401 /* Comparison test of an attribute with a value. Most of these will
4402 have been removed by optimization. Handle "alternative"
4403 specially and give error if EQ_ATTR present inside a comparison. */
4406 fatal ("EQ_ATTR not valid inside comparison");
4408 if (XSTR (exp, 0) == alternative_name)
4410 printf ("which_alternative == %s", XSTR (exp, 1));
4414 attr = find_attr (XSTR (exp, 0), 0);
4415 if (! attr) abort ();
4417 /* Now is the time to expand the value of a constant attribute. */
4420 write_test_expr (evaluate_eq_attr (exp, attr->default_val->value,
4426 printf ("get_attr_%s (insn) == ", attr->name);
4427 write_attr_valueq (attr, XSTR (exp, 1));
4431 /* Comparison test of flags for define_delays. */
4434 fatal ("ATTR_FLAG not valid inside comparison");
4435 printf ("(flags & ATTR_FLAG_%s) != 0", XSTR (exp, 0));
4438 /* See if an operand matches a predicate. */
4440 /* If only a mode is given, just ensure the mode matches the operand.
4441 If neither a mode nor predicate is given, error. */
4442 if (XSTR (exp, 1) == NULL || *XSTR (exp, 1) == '\0')
4444 if (GET_MODE (exp) == VOIDmode)
4445 fatal ("Null MATCH_OPERAND specified as test");
4447 printf ("GET_MODE (operands[%d]) == %smode",
4448 XINT (exp, 0), GET_MODE_NAME (GET_MODE (exp)));
4451 printf ("%s (operands[%d], %smode)",
4452 XSTR (exp, 1), XINT (exp, 0), GET_MODE_NAME (GET_MODE (exp)));
4455 /* Constant integer. */
4457 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
4458 printf ("%d", XWINT (exp, 0));
4460 printf ("%ld", XWINT (exp, 0));
4464 /* A random C expression. */
4466 printf ("%s", XSTR (exp, 0));
4469 /* The address of the branch target. */
4471 printf ("insn_addresses[INSN_UID (JUMP_LABEL (insn))]");
4474 /* The address of the current insn. It would be more consistent with
4475 other usage to make this the address of the NEXT insn, but this gets
4476 too confusing because of the ambiguity regarding the length of the
4479 printf ("insn_current_address");
4483 fatal ("bad RTX code `%s' in attribute calculation\n",
4484 GET_RTX_NAME (code));
4490 /* Given an attribute value, return the maximum CONST_STRING argument
4491 encountered. It is assumed that they are all numeric. */
4494 max_attr_value (exp)
4497 int current_max = 0;
4501 if (GET_CODE (exp) == CONST_STRING)
4502 return atoi (XSTR (exp, 0));
4504 else if (GET_CODE (exp) == COND)
4506 for (i = 0; i < XVECLEN (exp, 0); i += 2)
4508 n = max_attr_value (XVECEXP (exp, 0, i + 1));
4509 if (n > current_max)
4513 n = max_attr_value (XEXP (exp, 1));
4514 if (n > current_max)
4518 else if (GET_CODE (exp) == IF_THEN_ELSE)
4520 current_max = max_attr_value (XEXP (exp, 1));
4521 n = max_attr_value (XEXP (exp, 2));
4522 if (n > current_max)
4532 /* Scan an attribute value, possibly a conditional, and record what actions
4533 will be required to do any conditional tests in it.
4536 `must_extract' if we need to extract the insn operands
4537 `must_constrain' if we must compute `which_alternative'
4538 `address_used' if an address expression was used
4539 `length_used' if an (eq_attr "length" ...) was used
4543 walk_attr_value (exp)
4553 code = GET_CODE (exp);
4557 if (! RTX_UNCHANGING_P (exp))
4558 /* Since this is an arbitrary expression, it can look at anything.
4559 However, constant expressions do not depend on any particular
4561 must_extract = must_constrain = 1;
4569 if (XSTR (exp, 0) == alternative_name)
4570 must_extract = must_constrain = 1;
4571 else if (strcmp (XSTR (exp, 0), "length") == 0)
4584 for (i = 0, fmt = GET_RTX_FORMAT (code); i < GET_RTX_LENGTH (code); i++)
4589 walk_attr_value (XEXP (exp, i));
4593 if (XVEC (exp, i) != NULL)
4594 for (j = 0; j < XVECLEN (exp, i); j++)
4595 walk_attr_value (XVECEXP (exp, i, j));
4600 /* Write out a function to obtain the attribute for a given INSN. */
4603 write_attr_get (attr)
4604 struct attr_desc *attr;
4606 struct attr_value *av, *common_av;
4608 /* Find the most used attribute value. Handle that as the `default' of the
4609 switch we will generate. */
4610 common_av = find_most_used (attr);
4612 /* Write out start of function, then all values with explicit `case' lines,
4613 then a `default', then the value with the most uses. */
4614 if (!attr->is_numeric)
4615 printf ("enum attr_%s\n", attr->name);
4616 else if (attr->unsigned_p)
4617 printf ("unsigned int\n");
4621 /* If the attribute name starts with a star, the remainder is the name of
4622 the subroutine to use, instead of `get_attr_...'. */
4623 if (attr->name[0] == '*')
4624 printf ("%s (insn)\n", &attr->name[1]);
4625 else if (attr->is_const == 0)
4626 printf ("get_attr_%s (insn)\n", attr->name);
4629 printf ("get_attr_%s ()\n", attr->name);
4632 for (av = attr->first_value; av; av = av->next)
4633 if (av->num_insns != 0)
4634 write_attr_set (attr, 2, av->value, "return", ";",
4635 true_rtx, av->first_insn->insn_code,
4636 av->first_insn->insn_index);
4641 printf (" rtx insn;\n");
4643 printf (" switch (recog_memoized (insn))\n");
4646 for (av = attr->first_value; av; av = av->next)
4647 if (av != common_av)
4648 write_attr_case (attr, av, 1, "return", ";", 4, true_rtx);
4650 write_attr_case (attr, common_av, 0, "return", ";", 4, true_rtx);
4651 printf (" }\n}\n\n");
4654 /* Given an AND tree of known true terms (because we are inside an `if' with
4655 that as the condition or are in an `else' clause) and an expression,
4656 replace any known true terms with TRUE. Use `simplify_and_tree' to do
4657 the bulk of the work. */
4660 eliminate_known_true (known_true, exp, insn_code, insn_index)
4663 int insn_code, insn_index;
4667 known_true = SIMPLIFY_TEST_EXP (known_true, insn_code, insn_index);
4669 if (GET_CODE (known_true) == AND)
4671 exp = eliminate_known_true (XEXP (known_true, 0), exp,
4672 insn_code, insn_index);
4673 exp = eliminate_known_true (XEXP (known_true, 1), exp,
4674 insn_code, insn_index);
4679 exp = simplify_and_tree (exp, &term, insn_code, insn_index);
4685 /* Write out a series of tests and assignment statements to perform tests and
4686 sets of an attribute value. We are passed an indentation amount and prefix
4687 and suffix strings to write around each attribute value (e.g., "return"
4691 write_attr_set (attr, indent, value, prefix, suffix, known_true,
4692 insn_code, insn_index)
4693 struct attr_desc *attr;
4699 int insn_code, insn_index;
4701 if (GET_CODE (value) == CONST_STRING)
4703 write_indent (indent);
4704 printf ("%s ", prefix);
4705 write_attr_value (attr, value);
4706 printf ("%s\n", suffix);
4708 else if (GET_CODE (value) == COND)
4710 /* Assume the default value will be the default of the COND unless we
4711 find an always true expression. */
4712 rtx default_val = XEXP (value, 1);
4713 rtx our_known_true = known_true;
4718 for (i = 0; i < XVECLEN (value, 0); i += 2)
4723 testexp = eliminate_known_true (our_known_true,
4724 XVECEXP (value, 0, i),
4725 insn_code, insn_index);
4726 newexp = attr_rtx (NOT, testexp);
4727 newexp = insert_right_side (AND, our_known_true, newexp,
4728 insn_code, insn_index);
4730 /* If the test expression is always true or if the next `known_true'
4731 expression is always false, this is the last case, so break
4732 out and let this value be the `else' case. */
4733 if (testexp == true_rtx || newexp == false_rtx)
4735 default_val = XVECEXP (value, 0, i + 1);
4739 /* Compute the expression to pass to our recursive call as being
4741 inner_true = insert_right_side (AND, our_known_true,
4742 testexp, insn_code, insn_index);
4744 /* If this is always false, skip it. */
4745 if (inner_true == false_rtx)
4748 write_indent (indent);
4749 printf ("%sif ", first_if ? "" : "else ");
4751 write_test_expr (testexp, 0);
4753 write_indent (indent + 2);
4756 write_attr_set (attr, indent + 4,
4757 XVECEXP (value, 0, i + 1), prefix, suffix,
4758 inner_true, insn_code, insn_index);
4759 write_indent (indent + 2);
4761 our_known_true = newexp;
4766 write_indent (indent);
4768 write_indent (indent + 2);
4772 write_attr_set (attr, first_if ? indent : indent + 4, default_val,
4773 prefix, suffix, our_known_true, insn_code, insn_index);
4777 write_indent (indent + 2);
4785 /* Write out the computation for one attribute value. */
4788 write_attr_case (attr, av, write_case_lines, prefix, suffix, indent,
4790 struct attr_desc *attr;
4791 struct attr_value *av;
4792 int write_case_lines;
4793 char *prefix, *suffix;
4797 struct insn_ent *ie;
4799 if (av->num_insns == 0)
4802 if (av->has_asm_insn)
4804 write_indent (indent);
4805 printf ("case -1:\n");
4806 write_indent (indent + 2);
4807 printf ("if (GET_CODE (PATTERN (insn)) != ASM_INPUT\n");
4808 write_indent (indent + 2);
4809 printf (" && asm_noperands (PATTERN (insn)) < 0)\n");
4810 write_indent (indent + 2);
4811 printf (" fatal_insn_not_found (insn);\n");
4814 if (write_case_lines)
4816 for (ie = av->first_insn; ie; ie = ie->next)
4817 if (ie->insn_code != -1)
4819 write_indent (indent);
4820 printf ("case %d:\n", ie->insn_code);
4825 write_indent (indent);
4826 printf ("default:\n");
4829 /* See what we have to do to output this value. */
4830 must_extract = must_constrain = address_used = 0;
4831 walk_attr_value (av->value);
4835 write_indent (indent + 2);
4836 printf ("insn_extract (insn);\n");
4841 #ifdef REGISTER_CONSTRAINTS
4842 write_indent (indent + 2);
4843 printf ("if (! constrain_operands (INSN_CODE (insn), reload_completed))\n");
4844 write_indent (indent + 2);
4845 printf (" fatal_insn_not_found (insn);\n");
4849 write_attr_set (attr, indent + 2, av->value, prefix, suffix,
4850 known_true, av->first_insn->insn_code,
4851 av->first_insn->insn_index);
4853 if (strncmp (prefix, "return", 6))
4855 write_indent (indent + 2);
4856 printf ("break;\n");
4861 /* Utilities to write names in various forms. */
4864 write_attr_valueq (attr, s)
4865 struct attr_desc *attr;
4868 if (attr->is_numeric)
4871 /* Make the blockage range values easier to read. */
4873 printf (" /* 0x%x */", atoi (s));
4877 write_upcase (attr->name);
4884 write_attr_value (attr, value)
4885 struct attr_desc *attr;
4888 if (GET_CODE (value) != CONST_STRING)
4891 write_attr_valueq (attr, XSTR (value, 0));
4899 if (*str < 'a' || *str > 'z')
4900 printf ("%c", *str++);
4902 printf ("%c", *str++ - 'a' + 'A');
4906 write_indent (indent)
4909 for (; indent > 8; indent -= 8)
4912 for (; indent; indent--)
4916 /* Write a subroutine that is given an insn that requires a delay slot, a
4917 delay slot ordinal, and a candidate insn. It returns non-zero if the
4918 candidate can be placed in the specified delay slot of the insn.
4920 We can write as many as three subroutines. `eligible_for_delay'
4921 handles normal delay slots, `eligible_for_annul_true' indicates that
4922 the specified insn can be annulled if the branch is true, and likewise
4923 for `eligible_for_annul_false'.
4925 KIND is a string distinguishing these three cases ("delay", "annul_true",
4926 or "annul_false"). */
4929 write_eligible_delay (kind)
4932 struct delay_desc *delay;
4935 struct attr_desc *attr;
4936 struct attr_value *av, *common_av;
4939 /* Compute the maximum number of delay slots required. We use the delay
4940 ordinal times this number plus one, plus the slot number as an index into
4941 the appropriate predicate to test. */
4943 for (delay = delays, max_slots = 0; delay; delay = delay->next)
4944 if (XVECLEN (delay->def, 1) / 3 > max_slots)
4945 max_slots = XVECLEN (delay->def, 1) / 3;
4947 /* Write function prelude. */
4950 printf ("eligible_for_%s (delay_insn, slot, candidate_insn, flags)\n",
4952 printf (" rtx delay_insn;\n");
4953 printf (" int slot;\n");
4954 printf (" rtx candidate_insn;\n");
4955 printf (" int flags;\n");
4957 printf (" rtx insn;\n");
4959 printf (" if (slot >= %d)\n", max_slots);
4960 printf (" abort ();\n");
4963 /* If more than one delay type, find out which type the delay insn is. */
4967 attr = find_attr ("*delay_type", 0);
4968 if (! attr) abort ();
4969 common_av = find_most_used (attr);
4971 printf (" insn = delay_insn;\n");
4972 printf (" switch (recog_memoized (insn))\n");
4975 sprintf (str, " * %d;\n break;", max_slots);
4976 for (av = attr->first_value; av; av = av->next)
4977 if (av != common_av)
4978 write_attr_case (attr, av, 1, "slot +=", str, 4, true_rtx);
4980 write_attr_case (attr, common_av, 0, "slot +=", str, 4, true_rtx);
4983 /* Ensure matched. Otherwise, shouldn't have been called. */
4984 printf (" if (slot < %d)\n", max_slots);
4985 printf (" abort ();\n\n");
4988 /* If just one type of delay slot, write simple switch. */
4989 if (num_delays == 1 && max_slots == 1)
4991 printf (" insn = candidate_insn;\n");
4992 printf (" switch (recog_memoized (insn))\n");
4995 attr = find_attr ("*delay_1_0", 0);
4996 if (! attr) abort ();
4997 common_av = find_most_used (attr);
4999 for (av = attr->first_value; av; av = av->next)
5000 if (av != common_av)
5001 write_attr_case (attr, av, 1, "return", ";", 4, true_rtx);
5003 write_attr_case (attr, common_av, 0, "return", ";", 4, true_rtx);
5009 /* Write a nested CASE. The first indicates which condition we need to
5010 test, and the inner CASE tests the condition. */
5011 printf (" insn = candidate_insn;\n");
5012 printf (" switch (slot)\n");
5015 for (delay = delays; delay; delay = delay->next)
5016 for (i = 0; i < XVECLEN (delay->def, 1); i += 3)
5018 printf (" case %d:\n",
5019 (i / 3) + (num_delays == 1 ? 0 : delay->num * max_slots));
5020 printf (" switch (recog_memoized (insn))\n");
5023 sprintf (str, "*%s_%d_%d", kind, delay->num, i / 3);
5024 attr = find_attr (str, 0);
5025 if (! attr) abort ();
5026 common_av = find_most_used (attr);
5028 for (av = attr->first_value; av; av = av->next)
5029 if (av != common_av)
5030 write_attr_case (attr, av, 1, "return", ";", 8, true_rtx);
5032 write_attr_case (attr, common_av, 0, "return", ";", 8, true_rtx);
5036 printf (" default:\n");
5037 printf (" abort ();\n");
5044 /* Write routines to compute conflict cost for function units. Then write a
5045 table describing the available function units. */
5048 write_function_unit_info ()
5050 struct function_unit *unit;
5053 /* Write out conflict routines for function units. Don't bother writing
5054 one if there is only one issue delay value. */
5056 for (unit = units; unit; unit = unit->next)
5058 if (unit->needs_blockage_function)
5059 write_complex_function (unit, "blockage", "block");
5061 /* If the minimum and maximum conflict costs are the same, there
5062 is only one value, so we don't need a function. */
5063 if (! unit->needs_conflict_function)
5065 unit->default_cost = make_numeric_value (unit->issue_delay.max);
5069 /* The function first computes the case from the candidate insn. */
5070 unit->default_cost = make_numeric_value (0);
5071 write_complex_function (unit, "conflict_cost", "cost");
5074 /* Now that all functions have been written, write the table describing
5075 the function units. The name is included for documentation purposes
5078 printf ("struct function_unit_desc function_units[] = {\n");
5080 /* Write out the descriptions in numeric order, but don't force that order
5081 on the list. Doing so increases the runtime of genattrtab.c. */
5082 for (i = 0; i < num_units; i++)
5084 for (unit = units; unit; unit = unit->next)
5088 printf (" {\"%s\", %d, %d, %d, %s, %d, %s_unit_ready_cost, ",
5089 unit->name, 1 << unit->num, unit->multiplicity,
5090 unit->simultaneity, XSTR (unit->default_cost, 0),
5091 unit->issue_delay.max, unit->name);
5093 if (unit->needs_conflict_function)
5094 printf ("%s_unit_conflict_cost, ", unit->name);
5098 printf ("%d, ", unit->max_blockage);
5100 if (unit->needs_range_function)
5101 printf ("%s_unit_blockage_range, ", unit->name);
5105 if (unit->needs_blockage_function)
5106 printf ("%s_unit_blockage", unit->name);
5117 write_complex_function (unit, name, connection)
5118 struct function_unit *unit;
5119 char *name, *connection;
5121 struct attr_desc *case_attr, *attr;
5122 struct attr_value *av, *common_av;
5128 printf ("static int\n");
5129 printf ("%s_unit_%s (executing_insn, candidate_insn)\n",
5131 printf (" rtx executing_insn;\n");
5132 printf (" rtx candidate_insn;\n");
5134 printf (" rtx insn;\n");
5135 printf (" int casenum;\n\n");
5136 printf (" insn = executing_insn;\n");
5137 printf (" switch (recog_memoized (insn))\n");
5140 /* Write the `switch' statement to get the case value. */
5141 str = (char *) alloca (strlen (unit->name) + strlen (name) + strlen (connection) + 10);
5142 sprintf (str, "*%s_cases", unit->name);
5143 case_attr = find_attr (str, 0);
5144 if (! case_attr) abort ();
5145 common_av = find_most_used (case_attr);
5147 for (av = case_attr->first_value; av; av = av->next)
5148 if (av != common_av)
5149 write_attr_case (case_attr, av, 1,
5150 "casenum =", ";", 4, unit->condexp);
5152 write_attr_case (case_attr, common_av, 0,
5153 "casenum =", ";", 4, unit->condexp);
5156 /* Now write an outer switch statement on each case. Then write
5157 the tests on the executing function within each. */
5158 printf (" insn = candidate_insn;\n");
5159 printf (" switch (casenum)\n");
5162 for (i = 0; i < unit->num_opclasses; i++)
5164 /* Ensure using this case. */
5166 for (av = case_attr->first_value; av; av = av->next)
5168 && contained_in_p (make_numeric_value (i), av->value))
5174 printf (" case %d:\n", i);
5175 sprintf (str, "*%s_%s_%d", unit->name, connection, i);
5176 attr = find_attr (str, 0);
5177 if (! attr) abort ();
5179 /* If single value, just write it. */
5180 value = find_single_value (attr);
5182 write_attr_set (attr, 6, value, "return", ";\n", true_rtx, -2, -2);
5185 common_av = find_most_used (attr);
5186 printf (" switch (recog_memoized (insn))\n");
5189 for (av = attr->first_value; av; av = av->next)
5190 if (av != common_av)
5191 write_attr_case (attr, av, 1,
5192 "return", ";", 8, unit->condexp);
5194 write_attr_case (attr, common_av, 0,
5195 "return", ";", 8, unit->condexp);
5200 printf (" }\n}\n\n");
5203 /* This page contains miscellaneous utility routines. */
5205 /* Given a string, return the number of comma-separated elements in it.
5206 Return 0 for the null string. */
5217 for (n = 1; *s; s++)
5224 /* Given a pointer to a (char *), return a malloc'ed string containing the
5225 next comma-separated element. Advance the pointer to after the string
5226 scanned, or the end-of-string. Return NULL if at end of string. */
5229 next_comma_elt (pstr)
5238 /* Find end of string to compute length. */
5239 for (p = *pstr; *p != ',' && *p != '\0'; p++)
5242 out_str = attr_string (*pstr, p - *pstr);
5251 /* Return a `struct attr_desc' pointer for a given named attribute. If CREATE
5252 is non-zero, build a new attribute, if one does not exist. */
5254 static struct attr_desc *
5255 find_attr (name, create)
5259 struct attr_desc *attr;
5262 /* Before we resort to using `strcmp', see if the string address matches
5263 anywhere. In most cases, it should have been canonicalized to do so. */
5264 if (name == alternative_name)
5267 index = name[0] & (MAX_ATTRS_INDEX - 1);
5268 for (attr = attrs[index]; attr; attr = attr->next)
5269 if (name == attr->name)
5272 /* Otherwise, do it the slow way. */
5273 for (attr = attrs[index]; attr; attr = attr->next)
5274 if (name[0] == attr->name[0] && ! strcmp (name, attr->name))
5280 attr = (struct attr_desc *) oballoc (sizeof (struct attr_desc));
5281 attr->name = attr_string (name, strlen (name));
5282 attr->first_value = attr->default_val = NULL;
5283 attr->is_numeric = attr->negative_ok = attr->is_const = attr->is_special = 0;
5284 attr->next = attrs[index];
5285 attrs[index] = attr;
5290 /* Create internal attribute with the given default value. */
5293 make_internal_attr (name, value, special)
5298 struct attr_desc *attr;
5300 attr = find_attr (name, 1);
5301 if (attr->default_val)
5304 attr->is_numeric = 1;
5306 attr->is_special = (special & 1) != 0;
5307 attr->negative_ok = (special & 2) != 0;
5308 attr->unsigned_p = (special & 4) != 0;
5309 attr->default_val = get_attr_value (value, attr, -2);
5312 /* Find the most used value of an attribute. */
5314 static struct attr_value *
5315 find_most_used (attr)
5316 struct attr_desc *attr;
5318 struct attr_value *av;
5319 struct attr_value *most_used;
5325 for (av = attr->first_value; av; av = av->next)
5326 if (av->num_insns > nuses)
5327 nuses = av->num_insns, most_used = av;
5332 /* If an attribute only has a single value used, return it. Otherwise
5336 find_single_value (attr)
5337 struct attr_desc *attr;
5339 struct attr_value *av;
5342 unique_value = NULL;
5343 for (av = attr->first_value; av; av = av->next)
5349 unique_value = av->value;
5352 return unique_value;
5355 /* Return (attr_value "n") */
5358 make_numeric_value (n)
5361 static rtx int_values[20];
5368 if (n < 20 && int_values[n])
5369 return int_values[n];
5371 p = attr_printf (MAX_DIGITS, "%d", n);
5372 exp = attr_rtx (CONST_STRING, p);
5375 int_values[n] = exp;
5381 extend_range (range, min, max)
5382 struct range *range;
5386 if (range->min > min) range->min = min;
5387 if (range->max < max) range->max = max;
5391 xrealloc (ptr, size)
5395 char *result = (char *) realloc (ptr, size);
5397 fatal ("virtual memory exhausted");
5405 register char *val = (char *) malloc (size);
5408 fatal ("virtual memory exhausted");
5413 copy_rtx_unchanging (orig)
5418 register RTX_CODE code;
5421 if (RTX_UNCHANGING_P (orig) || MEM_IN_STRUCT_P (orig))
5424 MEM_IN_STRUCT_P (orig) = 1;
5428 code = GET_CODE (orig);
5438 copy = rtx_alloc (code);
5439 PUT_MODE (copy, GET_MODE (orig));
5440 RTX_UNCHANGING_P (copy) = 1;
5442 bcopy (&XEXP (orig, 0), &XEXP (copy, 0),
5443 GET_RTX_LENGTH (GET_CODE (copy)) * sizeof (rtx));
5452 fprintf (stderr, "genattrtab: ");
5453 fprintf (stderr, s, a1, a2);
5454 fprintf (stderr, "\n");
5455 exit (FATAL_EXIT_CODE);
5458 /* More 'friendly' abort that prints the line and file.
5459 config.h can #define abort fancy_abort if you like that sort of thing. */
5464 fatal ("Internal gcc abort.");
5467 /* Determine if an insn has a constant number of delay slots, i.e., the
5468 number of delay slots is not a function of the length of the insn. */
5471 write_const_num_delay_slots ()
5473 struct attr_desc *attr = find_attr ("*num_delay_slots", 0);
5474 struct attr_value *av;
5475 struct insn_ent *ie;
5480 printf ("int\nconst_num_delay_slots (insn)\n");
5481 printf (" rtx insn;\n");
5483 printf (" switch (recog_memoized (insn))\n");
5486 for (av = attr->first_value; av; av = av->next)
5489 walk_attr_value (av->value);
5492 for (ie = av->first_insn; ie; ie = ie->next)
5493 if (ie->insn_code != -1)
5494 printf (" case %d:\n", ie->insn_code);
5495 printf (" return 0;\n");
5499 printf (" default:\n");
5500 printf (" return 1;\n");
5514 struct attr_desc *attr;
5515 struct insn_def *id;
5520 /* Get rid of any avoidable limit on stack size. */
5524 /* Set the stack limit huge so that alloca does not fail. */
5525 getrlimit (RLIMIT_STACK, &rlim);
5526 rlim.rlim_cur = rlim.rlim_max;
5527 setrlimit (RLIMIT_STACK, &rlim);
5529 #endif /* RLIMIT_STACK defined */
5531 obstack_init (rtl_obstack);
5532 obstack_init (hash_obstack);
5533 obstack_init (temp_obstack);
5536 fatal ("No input file name.");
5538 infile = fopen (argv[1], "r");
5542 exit (FATAL_EXIT_CODE);
5547 /* Set up true and false rtx's */
5548 true_rtx = rtx_alloc (CONST_INT);
5549 XWINT (true_rtx, 0) = 1;
5550 false_rtx = rtx_alloc (CONST_INT);
5551 XWINT (false_rtx, 0) = 0;
5552 RTX_UNCHANGING_P (true_rtx) = RTX_UNCHANGING_P (false_rtx) = 1;
5553 RTX_INTEGRATED_P (true_rtx) = RTX_INTEGRATED_P (false_rtx) = 1;
5555 alternative_name = attr_string ("alternative", strlen ("alternative"));
5557 printf ("/* Generated automatically by the program `genattrtab'\n\
5558 from the machine description file `md'. */\n\n");
5560 /* Read the machine description. */
5564 c = read_skip_spaces (infile);
5569 desc = read_rtx (infile);
5570 if (GET_CODE (desc) == DEFINE_INSN
5571 || GET_CODE (desc) == DEFINE_PEEPHOLE
5572 || GET_CODE (desc) == DEFINE_ASM_ATTRIBUTES)
5575 else if (GET_CODE (desc) == DEFINE_EXPAND)
5576 insn_code_number++, insn_index_number++;
5578 else if (GET_CODE (desc) == DEFINE_SPLIT)
5579 insn_code_number++, insn_index_number++;
5581 else if (GET_CODE (desc) == DEFINE_ATTR)
5584 insn_index_number++;
5587 else if (GET_CODE (desc) == DEFINE_DELAY)
5590 insn_index_number++;
5593 else if (GET_CODE (desc) == DEFINE_FUNCTION_UNIT)
5596 insn_index_number++;
5600 /* If we didn't have a DEFINE_ASM_ATTRIBUTES, make a null one. */
5601 if (! got_define_asm_attributes)
5603 tem = rtx_alloc (DEFINE_ASM_ATTRIBUTES);
5604 XVEC (tem, 0) = rtvec_alloc (0);
5608 /* Expand DEFINE_DELAY information into new attribute. */
5612 /* Expand DEFINE_FUNCTION_UNIT information into new attributes. */
5616 printf ("#include \"config.h\"\n");
5617 printf ("#include \"rtl.h\"\n");
5618 printf ("#include \"insn-config.h\"\n");
5619 printf ("#include \"recog.h\"\n");
5620 printf ("#include \"regs.h\"\n");
5621 printf ("#include \"real.h\"\n");
5622 printf ("#include \"output.h\"\n");
5623 printf ("#include \"insn-attr.h\"\n");
5625 printf ("#define operands recog_operand\n\n");
5627 /* Make `insn_alternatives'. */
5628 insn_alternatives = (int *) oballoc (insn_code_number * sizeof (int));
5629 for (id = defs; id; id = id->next)
5630 if (id->insn_code >= 0)
5631 insn_alternatives[id->insn_code] = (1 << id->num_alternatives) - 1;
5633 /* Make `insn_n_alternatives'. */
5634 insn_n_alternatives = (int *) oballoc (insn_code_number * sizeof (int));
5635 for (id = defs; id; id = id->next)
5636 if (id->insn_code >= 0)
5637 insn_n_alternatives[id->insn_code] = id->num_alternatives;
5639 /* Prepare to write out attribute subroutines by checking everything stored
5640 away and building the attribute cases. */
5643 for (i = 0; i < MAX_ATTRS_INDEX; i++)
5644 for (attr = attrs[i]; attr; attr = attr->next)
5646 attr->default_val->value
5647 = check_attr_value (attr->default_val->value, attr);
5651 /* Construct extra attributes for `length'. */
5652 make_length_attrs ();
5654 /* Perform any possible optimizations to speed up compilation. */
5657 /* Now write out all the `gen_attr_...' routines. Do these before the
5658 special routines (specifically before write_function_unit_info), so
5659 that they get defined before they are used. */
5661 for (i = 0; i < MAX_ATTRS_INDEX; i++)
5662 for (attr = attrs[i]; attr; attr = attr->next)
5664 if (! attr->is_special)
5665 write_attr_get (attr);
5668 /* Write out delay eligibility information, if DEFINE_DELAY present.
5669 (The function to compute the number of delay slots will be written
5673 write_eligible_delay ("delay");
5674 if (have_annul_true)
5675 write_eligible_delay ("annul_true");
5676 if (have_annul_false)
5677 write_eligible_delay ("annul_false");
5680 /* Write out information about function units. */
5682 write_function_unit_info ();
5684 /* Write out constant delay slot info */
5685 write_const_num_delay_slots ();
5688 exit (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);