1 /* Generate code from machine description to compute values of attributes.
2 Copyright (C) 1991, 93, 94, 95, 96, 1997 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, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 /* This program handles insn attributes and the DEFINE_DELAY and
23 DEFINE_FUNCTION_UNIT definitions.
25 It produces a series of functions named `get_attr_...', one for each insn
26 attribute. Each of these is given the rtx for an insn and returns a member
27 of the enum for the attribute.
29 These subroutines have the form of a `switch' on the INSN_CODE (via
30 `recog_memoized'). Each case either returns a constant attribute value
31 or a value that depends on tests on other attributes, the form of
32 operands, or some random C expression (encoded with a SYMBOL_REF
35 If the attribute `alternative', or a random C expression is present,
36 `constrain_operands' is called. If either of these cases of a reference to
37 an operand is found, `insn_extract' is called.
39 The special attribute `length' is also recognized. For this operand,
40 expressions involving the address of an operand or the current insn,
41 (address (pc)), are valid. In this case, an initial pass is made to
42 set all lengths that do not depend on address. Those that do are set to
43 the maximum length. Then each insn that depends on an address is checked
44 and possibly has its length changed. The process repeats until no further
45 changed are made. The resulting lengths are saved for use by
48 A special form of DEFINE_ATTR, where the expression for default value is a
49 CONST expression, indicates an attribute that is constant for a given run
50 of the compiler. The subroutine generated for these attributes has no
51 parameters as it does not depend on any particular insn. Constant
52 attributes are typically used to specify which variety of processor is
55 Internal attributes are defined to handle DEFINE_DELAY and
56 DEFINE_FUNCTION_UNIT. Special routines are output for these cases.
58 This program works by keeping a list of possible values for each attribute.
59 These include the basic attribute choices, default values for attribute, and
60 all derived quantities.
62 As the description file is read, the definition for each insn is saved in a
63 `struct insn_def'. When the file reading is complete, a `struct insn_ent'
64 is created for each insn and chained to the corresponding attribute value,
65 either that specified, or the default.
67 An optimization phase is then run. This simplifies expressions for each
68 insn. EQ_ATTR tests are resolved, whenever possible, to a test that
69 indicates when the attribute has the specified value for the insn. This
70 avoids recursive calls during compilation.
72 The strategy used when processing DEFINE_DELAY and DEFINE_FUNCTION_UNIT
73 definitions is to create arbitrarily complex expressions and have the
74 optimization simplify them.
76 Once optimization is complete, any required routines and definitions
79 An optimization that is not yet implemented is to hoist the constant
80 expressions entirely out of the routines and definitions that are written.
81 A way to do this is to iterate over all possible combinations of values
82 for constant attributes and generate a set of functions for that given
83 combination. An initialization function would be written that evaluates
84 the attributes and installs the corresponding set of routines and
85 definitions (each would be accessed through a pointer).
87 We use the flags in an RTX as follows:
88 `unchanging' (RTX_UNCHANGING_P): This rtx is fully simplified
89 independent of the insn code.
90 `in_struct' (MEM_IN_STRUCT_P): This rtx is fully simplified
91 for the insn code currently being processed (see optimize_attrs).
92 `integrated' (RTX_INTEGRATED_P): This rtx is permanent and unique
94 `volatil' (MEM_VOLATILE_P): During simplify_by_exploding the value of an
95 EQ_ATTR rtx is true if !volatil and false if volatil. */
99 /* varargs must always be included after *config.h. */
107 #include "insn-config.h" /* For REGISTER_CONSTRAINTS */
109 #ifdef TIME_WITH_SYS_TIME
110 # include <sys/time.h>
114 # include <sys/time.h>
120 #ifdef HAVE_SYS_RESOURCE_H
121 # include <sys/resource.h>
124 /* We must include obstack.h after <sys/time.h>, to avoid lossage with
125 /usr/include/sys/stdtypes.h on Sun OS 4.x. */
128 static struct obstack obstack, obstack1, obstack2;
129 struct obstack *rtl_obstack = &obstack;
130 struct obstack *hash_obstack = &obstack1;
131 struct obstack *temp_obstack = &obstack2;
133 #define obstack_chunk_alloc xmalloc
134 #define obstack_chunk_free free
136 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
137 char **insn_name_ptr = 0;
140 extern rtx read_rtx ();
142 static void fatal ();
145 /* enough space to reserve for printing out ints */
146 #define MAX_DIGITS (HOST_BITS_PER_INT * 3 / 10 + 3)
148 /* Define structures used to record attributes and values. */
150 /* As each DEFINE_INSN, DEFINE_PEEPHOLE, or DEFINE_ASM_ATTRIBUTES is
151 encountered, we store all the relevant information into a
152 `struct insn_def'. This is done to allow attribute definitions to occur
153 anywhere in the file. */
157 int insn_code; /* Instruction number. */
158 int insn_index; /* Expression numer in file, for errors. */
159 struct insn_def *next; /* Next insn in chain. */
160 rtx def; /* The DEFINE_... */
161 int num_alternatives; /* Number of alternatives. */
162 int vec_idx; /* Index of attribute vector in `def'. */
165 /* Once everything has been read in, we store in each attribute value a list
166 of insn codes that have that value. Here is the structure used for the
171 int insn_code; /* Instruction number. */
172 int insn_index; /* Index of definition in file */
173 struct insn_ent *next; /* Next in chain. */
176 /* Each value of an attribute (either constant or computed) is assigned a
177 structure which is used as the listhead of the insns that have that
182 rtx value; /* Value of attribute. */
183 struct attr_value *next; /* Next attribute value in chain. */
184 struct insn_ent *first_insn; /* First insn with this value. */
185 int num_insns; /* Number of insns with this value. */
186 int has_asm_insn; /* True if this value used for `asm' insns */
189 /* Structure for each attribute. */
193 char *name; /* Name of attribute. */
194 struct attr_desc *next; /* Next attribute. */
195 int is_numeric; /* Values of this attribute are numeric. */
196 int negative_ok; /* Allow negative numeric values. */
197 int unsigned_p; /* Make the output function unsigned int. */
198 int is_const; /* Attribute value constant for each run. */
199 int is_special; /* Don't call `write_attr_set'. */
200 struct attr_value *first_value; /* First value of this attribute. */
201 struct attr_value *default_val; /* Default value for this attribute. */
204 #define NULL_ATTR (struct attr_desc *) NULL
206 /* A range of values. */
214 /* Structure for each DEFINE_DELAY. */
218 rtx def; /* DEFINE_DELAY expression. */
219 struct delay_desc *next; /* Next DEFINE_DELAY. */
220 int num; /* Number of DEFINE_DELAY, starting at 1. */
223 /* Record information about each DEFINE_FUNCTION_UNIT. */
225 struct function_unit_op
227 rtx condexp; /* Expression TRUE for applicable insn. */
228 struct function_unit_op *next; /* Next operation for this function unit. */
229 int num; /* Ordinal for this operation type in unit. */
230 int ready; /* Cost until data is ready. */
231 int issue_delay; /* Cost until unit can accept another insn. */
232 rtx conflict_exp; /* Expression TRUE for insns incurring issue delay. */
233 rtx issue_exp; /* Expression computing issue delay. */
236 /* Record information about each function unit mentioned in a
237 DEFINE_FUNCTION_UNIT. */
241 char *name; /* Function unit name. */
242 struct function_unit *next; /* Next function unit. */
243 int num; /* Ordinal of this unit type. */
244 int multiplicity; /* Number of units of this type. */
245 int simultaneity; /* Maximum number of simultaneous insns
246 on this function unit or 0 if unlimited. */
247 rtx condexp; /* Expression TRUE for insn needing unit. */
248 int num_opclasses; /* Number of different operation types. */
249 struct function_unit_op *ops; /* Pointer to first operation type. */
250 int needs_conflict_function; /* Nonzero if a conflict function required. */
251 int needs_blockage_function; /* Nonzero if a blockage function required. */
252 int needs_range_function; /* Nonzero if blockage range function needed.*/
253 rtx default_cost; /* Conflict cost, if constant. */
254 struct range issue_delay; /* Range of issue delay values. */
255 int max_blockage; /* Maximum time an insn blocks the unit. */
258 /* Listheads of above structures. */
260 /* This one is indexed by the first character of the attribute name. */
261 #define MAX_ATTRS_INDEX 256
262 static struct attr_desc *attrs[MAX_ATTRS_INDEX];
263 static struct insn_def *defs;
264 static struct delay_desc *delays;
265 static struct function_unit *units;
267 /* An expression where all the unknown terms are EQ_ATTR tests can be
268 rearranged into a COND provided we can enumerate all possible
269 combinations of the unknown values. The set of combinations become the
270 tests of the COND; the value of the expression given that combination is
271 computed and becomes the corresponding value. To do this, we must be
272 able to enumerate all values for each attribute used in the expression
273 (currently, we give up if we find a numeric attribute).
275 If the set of EQ_ATTR tests used in an expression tests the value of N
276 different attributes, the list of all possible combinations can be made
277 by walking the N-dimensional attribute space defined by those
278 attributes. We record each of these as a struct dimension.
280 The algorithm relies on sharing EQ_ATTR nodes: if two nodes in an
281 expression are the same, the will also have the same address. We find
282 all the EQ_ATTR nodes by marking them MEM_VOLATILE_P. This bit later
283 represents the value of an EQ_ATTR node, so once all nodes are marked,
284 they are also given an initial value of FALSE.
286 We then separate the set of EQ_ATTR nodes into dimensions for each
287 attribute and put them on the VALUES list. Terms are added as needed by
288 `add_values_to_cover' so that all possible values of the attribute are
291 Each dimension also has a current value. This is the node that is
292 currently considered to be TRUE. If this is one of the nodes added by
293 `add_values_to_cover', all the EQ_ATTR tests in the original expression
294 will be FALSE. Otherwise, only the CURRENT_VALUE will be true.
296 NUM_VALUES is simply the length of the VALUES list and is there for
299 Once the dimensions are created, the algorithm enumerates all possible
300 values and computes the current value of the given expression. */
304 struct attr_desc *attr; /* Attribute for this dimension. */
305 rtx values; /* List of attribute values used. */
306 rtx current_value; /* Position in the list for the TRUE value. */
307 int num_values; /* Length of the values list. */
310 /* Other variables. */
312 static int insn_code_number;
313 static int insn_index_number;
314 static int got_define_asm_attributes;
315 static int must_extract;
316 static int must_constrain;
317 static int address_used;
318 static int length_used;
319 static int num_delays;
320 static int have_annul_true, have_annul_false;
321 static int num_units, num_unit_opclasses;
322 static int num_insn_ents;
324 /* Used as operand to `operate_exp': */
326 enum operator {PLUS_OP, MINUS_OP, POS_MINUS_OP, EQ_OP, OR_OP, ORX_OP, MAX_OP, MIN_OP, RANGE_OP};
328 /* Stores, for each insn code, the number of constraint alternatives. */
330 static int *insn_n_alternatives;
332 /* Stores, for each insn code, a bitmap that has bits on for each possible
335 static int *insn_alternatives;
337 /* If nonzero, assume that the `alternative' attr has this value.
338 This is the hashed, unique string for the numeral
339 whose value is chosen alternative. */
341 static char *current_alternative_string;
343 /* Used to simplify expressions. */
345 static rtx true_rtx, false_rtx;
347 /* Used to reduce calls to `strcmp' */
349 static char *alternative_name;
351 /* Indicate that REG_DEAD notes are valid if dead_or_set_p is ever
354 int reload_completed = 0;
356 /* Simplify an expression. Only call the routine if there is something to
358 #define SIMPLIFY_TEST_EXP(EXP,INSN_CODE,INSN_INDEX) \
359 (RTX_UNCHANGING_P (EXP) || MEM_IN_STRUCT_P (EXP) ? (EXP) \
360 : simplify_test_exp (EXP, INSN_CODE, INSN_INDEX))
362 /* Simplify (eq_attr ("alternative") ...)
363 when we are working with a particular alternative. */
364 #define SIMPLIFY_ALTERNATIVE(EXP) \
365 if (current_alternative_string \
366 && GET_CODE ((EXP)) == EQ_ATTR \
367 && XSTR ((EXP), 0) == alternative_name) \
368 (EXP) = (XSTR ((EXP), 1) == current_alternative_string \
369 ? true_rtx : false_rtx);
371 /* These are referenced by rtlanal.c and hence need to be defined somewhere.
372 They won't actually be used. */
374 struct _global_rtl global_rtl;
376 static rtx attr_rtx PVPROTO((enum rtx_code, ...));
378 static char *attr_printf PVPROTO((int, char *, ...));
380 static char *attr_printf ();
383 static char *attr_string PROTO((char *, int));
384 static rtx check_attr_test PROTO((rtx, int));
385 static rtx check_attr_value PROTO((rtx, struct attr_desc *));
386 static rtx convert_set_attr_alternative PROTO((rtx, int, int, int));
387 static rtx convert_set_attr PROTO((rtx, int, int, int));
388 static void check_defs PROTO((void));
390 static rtx convert_const_symbol_ref PROTO((rtx, struct attr_desc *));
392 static rtx make_canonical PROTO((struct attr_desc *, rtx));
393 static struct attr_value *get_attr_value PROTO((rtx, struct attr_desc *, int));
394 static rtx copy_rtx_unchanging PROTO((rtx));
395 static rtx copy_boolean PROTO((rtx));
396 static void expand_delays PROTO((void));
397 static rtx operate_exp PROTO((enum operator, rtx, rtx));
398 static void expand_units PROTO((void));
399 static rtx simplify_knowing PROTO((rtx, rtx));
400 static rtx encode_units_mask PROTO((rtx));
401 static void fill_attr PROTO((struct attr_desc *));
402 /* dpx2 compiler chokes if we specify the arg types of the args. */
403 static rtx substitute_address PROTO((rtx, rtx (*) (), rtx (*) ()));
404 static void make_length_attrs PROTO((void));
405 static rtx identity_fn PROTO((rtx));
406 static rtx zero_fn PROTO((rtx));
407 static rtx one_fn PROTO((rtx));
408 static rtx max_fn PROTO((rtx));
409 static rtx simplify_cond PROTO((rtx, int, int));
411 static rtx simplify_by_alternatives PROTO((rtx, int, int));
413 static rtx simplify_by_exploding PROTO((rtx));
414 static int find_and_mark_used_attributes PROTO((rtx, rtx *, int *));
415 static void unmark_used_attributes PROTO((rtx, struct dimension *, int));
416 static int add_values_to_cover PROTO((struct dimension *));
417 static int increment_current_value PROTO((struct dimension *, int));
418 static rtx test_for_current_value PROTO((struct dimension *, int));
419 static rtx simplify_with_current_value PROTO((rtx, struct dimension *, int));
420 static rtx simplify_with_current_value_aux PROTO((rtx));
421 static void clear_struct_flag PROTO((rtx));
422 static int count_sub_rtxs PROTO((rtx, int));
423 static void remove_insn_ent PROTO((struct attr_value *, struct insn_ent *));
424 static void insert_insn_ent PROTO((struct attr_value *, struct insn_ent *));
425 static rtx insert_right_side PROTO((enum rtx_code, rtx, rtx, int, int));
426 static rtx make_alternative_compare PROTO((int));
427 static int compute_alternative_mask PROTO((rtx, enum rtx_code));
428 static rtx evaluate_eq_attr PROTO((rtx, rtx, int, int));
429 static rtx simplify_and_tree PROTO((rtx, rtx *, int, int));
430 static rtx simplify_or_tree PROTO((rtx, rtx *, int, int));
431 static rtx simplify_test_exp PROTO((rtx, int, int));
432 static void optimize_attrs PROTO((void));
433 static void gen_attr PROTO((rtx));
434 static int count_alternatives PROTO((rtx));
435 static int compares_alternatives_p PROTO((rtx));
436 static int contained_in_p PROTO((rtx, rtx));
437 static void gen_insn PROTO((rtx));
438 static void gen_delay PROTO((rtx));
439 static void gen_unit PROTO((rtx));
440 static void write_test_expr PROTO((rtx, int));
441 static int max_attr_value PROTO((rtx));
442 static void walk_attr_value PROTO((rtx));
443 static void write_attr_get PROTO((struct attr_desc *));
444 static rtx eliminate_known_true PROTO((rtx, rtx, int, int));
445 static void write_attr_set PROTO((struct attr_desc *, int, rtx, char *,
446 char *, rtx, int, int));
447 static void write_attr_case PROTO((struct attr_desc *, struct attr_value *,
448 int, char *, char *, int, rtx));
449 static void write_attr_valueq PROTO((struct attr_desc *, char *));
450 static void write_attr_value PROTO((struct attr_desc *, rtx));
451 static void write_upcase PROTO((char *));
452 static void write_indent PROTO((int));
453 static void write_eligible_delay PROTO((char *));
454 static void write_function_unit_info PROTO((void));
455 static void write_complex_function PROTO((struct function_unit *, char *,
457 static int write_expr_attr_cache PROTO((rtx, struct attr_desc *));
458 static void write_toplevel_expr PROTO((rtx));
459 static int n_comma_elts PROTO((char *));
460 static char *next_comma_elt PROTO((char **));
461 static struct attr_desc *find_attr PROTO((char *, int));
462 static void make_internal_attr PROTO((char *, rtx, int));
463 static struct attr_value *find_most_used PROTO((struct attr_desc *));
464 static rtx find_single_value PROTO((struct attr_desc *));
465 static rtx make_numeric_value PROTO((int));
466 static void extend_range PROTO((struct range *, int, int));
467 char *xrealloc PROTO((char *, unsigned));
468 char *xmalloc PROTO((unsigned));
470 #define oballoc(size) obstack_alloc (hash_obstack, size)
473 /* Hash table for sharing RTL and strings. */
475 /* Each hash table slot is a bucket containing a chain of these structures.
476 Strings are given negative hash codes; RTL expressions are given positive
481 struct attr_hash *next; /* Next structure in the bucket. */
482 int hashcode; /* Hash code of this rtx or string. */
485 char *str; /* The string (negative hash codes) */
486 rtx rtl; /* or the RTL recorded here. */
490 /* Now here is the hash table. When recording an RTL, it is added to
491 the slot whose index is the hash code mod the table size. Note
492 that the hash table is used for several kinds of RTL (see attr_rtx)
493 and for strings. While all these live in the same table, they are
494 completely independent, and the hash code is computed differently
497 #define RTL_HASH_SIZE 4093
498 struct attr_hash *attr_hash_table[RTL_HASH_SIZE];
500 /* Here is how primitive or already-shared RTL's hash
502 #define RTL_HASH(RTL) ((HOST_WIDE_INT) (RTL) & 0777777)
504 /* Add an entry to the hash table for RTL with hash code HASHCODE. */
507 attr_hash_add_rtx (hashcode, rtl)
511 register struct attr_hash *h;
513 h = (struct attr_hash *) obstack_alloc (hash_obstack,
514 sizeof (struct attr_hash));
515 h->hashcode = hashcode;
517 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
518 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
521 /* Add an entry to the hash table for STRING with hash code HASHCODE. */
524 attr_hash_add_string (hashcode, str)
528 register struct attr_hash *h;
530 h = (struct attr_hash *) obstack_alloc (hash_obstack,
531 sizeof (struct attr_hash));
532 h->hashcode = -hashcode;
534 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
535 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
538 /* Generate an RTL expression, but avoid duplicates.
539 Set the RTX_INTEGRATED_P flag for these permanent objects.
541 In some cases we cannot uniquify; then we return an ordinary
542 impermanent rtx with RTX_INTEGRATED_P clear.
544 Args are like gen_rtx, but without the mode:
546 rtx attr_rtx (code, [element1, ..., elementn]) */
550 attr_rtx VPROTO((enum rtx_code code, ...))
556 register int i; /* Array indices... */
557 register char *fmt; /* Current rtx's format... */
558 register rtx rt_val; /* RTX to return to caller... */
560 register struct attr_hash *h;
561 struct obstack *old_obstack = rtl_obstack;
566 code = va_arg (p, enum rtx_code);
569 /* For each of several cases, search the hash table for an existing entry.
570 Use that entry if one is found; otherwise create a new RTL and add it
573 if (GET_RTX_CLASS (code) == '1')
575 rtx arg0 = va_arg (p, rtx);
577 /* A permanent object cannot point to impermanent ones. */
578 if (! RTX_INTEGRATED_P (arg0))
580 rt_val = rtx_alloc (code);
581 XEXP (rt_val, 0) = arg0;
586 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0));
587 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
588 if (h->hashcode == hashcode
589 && GET_CODE (h->u.rtl) == code
590 && XEXP (h->u.rtl, 0) == arg0)
595 rtl_obstack = hash_obstack;
596 rt_val = rtx_alloc (code);
597 XEXP (rt_val, 0) = arg0;
600 else if (GET_RTX_CLASS (code) == 'c'
601 || GET_RTX_CLASS (code) == '2'
602 || GET_RTX_CLASS (code) == '<')
604 rtx arg0 = va_arg (p, rtx);
605 rtx arg1 = va_arg (p, rtx);
607 /* A permanent object cannot point to impermanent ones. */
608 if (! RTX_INTEGRATED_P (arg0) || ! RTX_INTEGRATED_P (arg1))
610 rt_val = rtx_alloc (code);
611 XEXP (rt_val, 0) = arg0;
612 XEXP (rt_val, 1) = arg1;
617 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0) + RTL_HASH (arg1));
618 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
619 if (h->hashcode == hashcode
620 && GET_CODE (h->u.rtl) == code
621 && XEXP (h->u.rtl, 0) == arg0
622 && XEXP (h->u.rtl, 1) == arg1)
627 rtl_obstack = hash_obstack;
628 rt_val = rtx_alloc (code);
629 XEXP (rt_val, 0) = arg0;
630 XEXP (rt_val, 1) = arg1;
633 else if (GET_RTX_LENGTH (code) == 1
634 && GET_RTX_FORMAT (code)[0] == 's')
636 char * arg0 = va_arg (p, char *);
638 if (code == SYMBOL_REF)
639 arg0 = attr_string (arg0, strlen (arg0));
641 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0));
642 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
643 if (h->hashcode == hashcode
644 && GET_CODE (h->u.rtl) == code
645 && XSTR (h->u.rtl, 0) == arg0)
650 rtl_obstack = hash_obstack;
651 rt_val = rtx_alloc (code);
652 XSTR (rt_val, 0) = arg0;
655 else if (GET_RTX_LENGTH (code) == 2
656 && GET_RTX_FORMAT (code)[0] == 's'
657 && GET_RTX_FORMAT (code)[1] == 's')
659 char *arg0 = va_arg (p, char *);
660 char *arg1 = va_arg (p, char *);
662 hashcode = ((HOST_WIDE_INT) code + RTL_HASH (arg0) + RTL_HASH (arg1));
663 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
664 if (h->hashcode == hashcode
665 && GET_CODE (h->u.rtl) == code
666 && XSTR (h->u.rtl, 0) == arg0
667 && XSTR (h->u.rtl, 1) == arg1)
672 rtl_obstack = hash_obstack;
673 rt_val = rtx_alloc (code);
674 XSTR (rt_val, 0) = arg0;
675 XSTR (rt_val, 1) = arg1;
678 else if (code == CONST_INT)
680 HOST_WIDE_INT arg0 = va_arg (p, HOST_WIDE_INT);
690 rt_val = rtx_alloc (code); /* Allocate the storage space. */
692 fmt = GET_RTX_FORMAT (code); /* Find the right format... */
693 for (i = 0; i < GET_RTX_LENGTH (code); i++)
697 case '0': /* Unused field. */
700 case 'i': /* An integer? */
701 XINT (rt_val, i) = va_arg (p, int);
704 case 'w': /* A wide integer? */
705 XWINT (rt_val, i) = va_arg (p, HOST_WIDE_INT);
708 case 's': /* A string? */
709 XSTR (rt_val, i) = va_arg (p, char *);
712 case 'e': /* An expression? */
713 case 'u': /* An insn? Same except when printing. */
714 XEXP (rt_val, i) = va_arg (p, rtx);
717 case 'E': /* An RTX vector? */
718 XVEC (rt_val, i) = va_arg (p, rtvec);
729 rtl_obstack = old_obstack;
731 attr_hash_add_rtx (hashcode, rt_val);
732 RTX_INTEGRATED_P (rt_val) = 1;
740 /* Create a new string printed with the printf line arguments into a space
741 of at most LEN bytes:
743 rtx attr_printf (len, format, [arg1, ..., argn]) */
749 attr_printf VPROTO((register int len, char *fmt, ...))
761 len = va_arg (p, int);
762 fmt = va_arg (p, char *);
765 /* Print the string into a temporary location. */
766 str = (char *) alloca (len);
767 vsprintf (str, fmt, p);
770 return attr_string (str, strlen (str));
773 #else /* not HAVE_VPRINTF */
776 attr_printf (len, fmt, arg1, arg2, arg3)
779 char *arg1, *arg2, *arg3; /* also int */
783 /* Print the string into a temporary location. */
784 str = (char *) alloca (len);
785 sprintf (str, fmt, arg1, arg2, arg3);
787 return attr_string (str, strlen (str));
789 #endif /* not HAVE_VPRINTF */
792 attr_eq (name, value)
795 return attr_rtx (EQ_ATTR, attr_string (name, strlen (name)),
796 attr_string (value, strlen (value)));
803 return XSTR (make_numeric_value (n), 0);
806 /* Return a permanent (possibly shared) copy of a string STR (not assumed
807 to be null terminated) with LEN bytes. */
810 attr_string (str, len)
814 register struct attr_hash *h;
817 register char *new_str;
819 /* Compute the hash code. */
820 hashcode = (len + 1) * 613 + (unsigned)str[0];
821 for (i = 1; i <= len; i += 2)
822 hashcode = ((hashcode * 613) + (unsigned)str[i]);
824 hashcode = -hashcode;
826 /* Search the table for the string. */
827 for (h = attr_hash_table[hashcode % RTL_HASH_SIZE]; h; h = h->next)
828 if (h->hashcode == -hashcode && h->u.str[0] == str[0]
829 && !strncmp (h->u.str, str, len))
830 return h->u.str; /* <-- return if found. */
832 /* Not found; create a permanent copy and add it to the hash table. */
833 new_str = (char *) obstack_alloc (hash_obstack, len + 1);
834 bcopy (str, new_str, len);
836 attr_hash_add_string (hashcode, new_str);
838 return new_str; /* Return the new string. */
841 /* Check two rtx's for equality of contents,
842 taking advantage of the fact that if both are hashed
843 then they can't be equal unless they are the same object. */
849 return (x == y || (! (RTX_INTEGRATED_P (x) && RTX_INTEGRATED_P (y))
850 && rtx_equal_p (x, y)));
853 /* Copy an attribute value expression,
854 descending to all depths, but not copying any
855 permanent hashed subexpressions. */
863 register RTX_CODE code;
864 register char *format_ptr;
866 /* No need to copy a permanent object. */
867 if (RTX_INTEGRATED_P (orig))
870 code = GET_CODE (orig);
888 copy = rtx_alloc (code);
889 PUT_MODE (copy, GET_MODE (orig));
890 copy->in_struct = orig->in_struct;
891 copy->volatil = orig->volatil;
892 copy->unchanging = orig->unchanging;
893 copy->integrated = orig->integrated;
895 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
897 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
899 switch (*format_ptr++)
902 XEXP (copy, i) = XEXP (orig, i);
903 if (XEXP (orig, i) != NULL)
904 XEXP (copy, i) = attr_copy_rtx (XEXP (orig, i));
909 XVEC (copy, i) = XVEC (orig, i);
910 if (XVEC (orig, i) != NULL)
912 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
913 for (j = 0; j < XVECLEN (copy, i); j++)
914 XVECEXP (copy, i, j) = attr_copy_rtx (XVECEXP (orig, i, j));
920 XINT (copy, i) = XINT (orig, i);
924 XWINT (copy, i) = XWINT (orig, i);
929 XSTR (copy, i) = XSTR (orig, i);
939 /* Given a test expression for an attribute, ensure it is validly formed.
940 IS_CONST indicates whether the expression is constant for each compiler
941 run (a constant expression may not test any particular insn).
943 Convert (eq_attr "att" "a1,a2") to (ior (eq_attr ... ) (eq_attrq ..))
944 and (eq_attr "att" "!a1") to (not (eq_attr "att" "a1")). Do the latter
945 test first so that (eq_attr "att" "!a1,a2,a3") works as expected.
947 Update the string address in EQ_ATTR expression to be the same used
948 in the attribute (or `alternative_name') to speed up subsequent
949 `find_attr' calls and eliminate most `strcmp' calls.
951 Return the new expression, if any. */
954 check_attr_test (exp, is_const)
958 struct attr_desc *attr;
959 struct attr_value *av;
963 switch (GET_CODE (exp))
966 /* Handle negation test. */
967 if (XSTR (exp, 1)[0] == '!')
968 return check_attr_test (attr_rtx (NOT,
969 attr_eq (XSTR (exp, 0),
973 else if (n_comma_elts (XSTR (exp, 1)) == 1)
975 attr = find_attr (XSTR (exp, 0), 0);
978 if (! strcmp (XSTR (exp, 0), "alternative"))
980 XSTR (exp, 0) = alternative_name;
981 /* This can't be simplified any further. */
982 RTX_UNCHANGING_P (exp) = 1;
986 fatal ("Unknown attribute `%s' in EQ_ATTR", XEXP (exp, 0));
989 if (is_const && ! attr->is_const)
990 fatal ("Constant expression uses insn attribute `%s' in EQ_ATTR",
993 /* Copy this just to make it permanent,
994 so expressions using it can be permanent too. */
995 exp = attr_eq (XSTR (exp, 0), XSTR (exp, 1));
997 /* It shouldn't be possible to simplify the value given to a
998 constant attribute, so don't expand this until it's time to
999 write the test expression. */
1001 RTX_UNCHANGING_P (exp) = 1;
1003 if (attr->is_numeric)
1005 for (p = XSTR (exp, 1); *p; p++)
1006 if (*p < '0' || *p > '9')
1007 fatal ("Attribute `%s' takes only numeric values",
1012 for (av = attr->first_value; av; av = av->next)
1013 if (GET_CODE (av->value) == CONST_STRING
1014 && ! strcmp (XSTR (exp, 1), XSTR (av->value, 0)))
1018 fatal ("Unknown value `%s' for `%s' attribute",
1019 XEXP (exp, 1), XEXP (exp, 0));
1024 /* Make an IOR tree of the possible values. */
1026 name_ptr = XSTR (exp, 1);
1027 while ((p = next_comma_elt (&name_ptr)) != NULL)
1029 newexp = attr_eq (XSTR (exp, 0), p);
1030 orexp = insert_right_side (IOR, orexp, newexp, -2, -2);
1033 return check_attr_test (orexp, is_const);
1041 /* Either TRUE or FALSE. */
1049 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0), is_const);
1050 XEXP (exp, 1) = check_attr_test (XEXP (exp, 1), is_const);
1054 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0), is_const);
1059 fatal ("RTL operator \"%s\" not valid in constant attribute test",
1060 GET_RTX_NAME (MATCH_OPERAND));
1061 /* These cases can't be simplified. */
1062 RTX_UNCHANGING_P (exp) = 1;
1065 case LE: case LT: case GT: case GE:
1066 case LEU: case LTU: case GTU: case GEU:
1068 if (GET_CODE (XEXP (exp, 0)) == SYMBOL_REF
1069 && GET_CODE (XEXP (exp, 1)) == SYMBOL_REF)
1070 exp = attr_rtx (GET_CODE (exp),
1071 attr_rtx (SYMBOL_REF, XSTR (XEXP (exp, 0), 0)),
1072 attr_rtx (SYMBOL_REF, XSTR (XEXP (exp, 1), 0)));
1073 /* These cases can't be simplified. */
1074 RTX_UNCHANGING_P (exp) = 1;
1080 /* These cases are valid for constant attributes, but can't be
1082 exp = attr_rtx (SYMBOL_REF, XSTR (exp, 0));
1083 RTX_UNCHANGING_P (exp) = 1;
1087 fatal ("RTL operator \"%s\" not valid in attribute test",
1088 GET_RTX_NAME (GET_CODE (exp)));
1094 /* Given an expression, ensure that it is validly formed and that all named
1095 attribute values are valid for the given attribute. Issue a fatal error
1096 if not. If no attribute is specified, assume a numeric attribute.
1098 Return a perhaps modified replacement expression for the value. */
1101 check_attr_value (exp, attr)
1103 struct attr_desc *attr;
1105 struct attr_value *av;
1109 switch (GET_CODE (exp))
1112 if (attr && ! attr->is_numeric)
1113 fatal ("CONST_INT not valid for non-numeric `%s' attribute",
1116 if (INTVAL (exp) < 0)
1117 fatal ("Negative numeric value specified for `%s' attribute",
1123 if (! strcmp (XSTR (exp, 0), "*"))
1126 if (attr == 0 || attr->is_numeric)
1129 if (attr && attr->negative_ok && *p == '-')
1132 if (*p > '9' || *p < '0')
1133 fatal ("Non-numeric value for numeric `%s' attribute",
1134 attr ? attr->name : "internal");
1138 for (av = attr->first_value; av; av = av->next)
1139 if (GET_CODE (av->value) == CONST_STRING
1140 && ! strcmp (XSTR (av->value, 0), XSTR (exp, 0)))
1144 fatal ("Unknown value `%s' for `%s' attribute",
1145 XSTR (exp, 0), attr ? attr->name : "internal");
1150 XEXP (exp, 0) = check_attr_test (XEXP (exp, 0),
1151 attr ? attr->is_const : 0);
1152 XEXP (exp, 1) = check_attr_value (XEXP (exp, 1), attr);
1153 XEXP (exp, 2) = check_attr_value (XEXP (exp, 2), attr);
1158 XEXP (exp, 0) = check_attr_value (XEXP (exp, 0), attr);
1159 XEXP (exp, 1) = check_attr_value (XEXP (exp, 1), attr);
1163 XEXP (exp, 0) = check_attr_value (XEXP (exp, 0), attr);
1167 if (XVECLEN (exp, 0) % 2 != 0)
1168 fatal ("First operand of COND must have even length");
1170 for (i = 0; i < XVECLEN (exp, 0); i += 2)
1172 XVECEXP (exp, 0, i) = check_attr_test (XVECEXP (exp, 0, i),
1173 attr ? attr->is_const : 0);
1174 XVECEXP (exp, 0, i + 1)
1175 = check_attr_value (XVECEXP (exp, 0, i + 1), attr);
1178 XEXP (exp, 1) = check_attr_value (XEXP (exp, 1), attr);
1182 if (attr && attr->is_const)
1183 /* A constant SYMBOL_REF is valid as a constant attribute test and
1184 is expanded later by make_canonical into a COND. */
1185 return attr_rtx (SYMBOL_REF, XSTR (exp, 0));
1186 /* Otherwise, fall through... */
1189 fatal ("Invalid operation `%s' for attribute value",
1190 GET_RTX_NAME (GET_CODE (exp)));
1196 /* Given an SET_ATTR_ALTERNATIVE expression, convert to the canonical SET.
1197 It becomes a COND with each test being (eq_attr "alternative "n") */
1200 convert_set_attr_alternative (exp, num_alt, insn_code, insn_index)
1203 int insn_code, insn_index;
1208 if (XVECLEN (exp, 1) != num_alt)
1209 fatal ("Bad number of entries in SET_ATTR_ALTERNATIVE for insn %d",
1212 /* Make a COND with all tests but the last. Select the last value via the
1214 condexp = rtx_alloc (COND);
1215 XVEC (condexp, 0) = rtvec_alloc ((num_alt - 1) * 2);
1217 for (i = 0; i < num_alt - 1; i++)
1220 p = attr_numeral (i);
1222 XVECEXP (condexp, 0, 2 * i) = attr_eq (alternative_name, p);
1224 /* Sharing this EQ_ATTR rtl causes trouble. */
1225 XVECEXP (condexp, 0, 2 * i) = rtx_alloc (EQ_ATTR);
1226 XSTR (XVECEXP (condexp, 0, 2 * i), 0) = alternative_name;
1227 XSTR (XVECEXP (condexp, 0, 2 * i), 1) = p;
1229 XVECEXP (condexp, 0, 2 * i + 1) = XVECEXP (exp, 1, i);
1232 XEXP (condexp, 1) = XVECEXP (exp, 1, i);
1234 return attr_rtx (SET, attr_rtx (ATTR, XSTR (exp, 0)), condexp);
1237 /* Given a SET_ATTR, convert to the appropriate SET. If a comma-separated
1238 list of values is given, convert to SET_ATTR_ALTERNATIVE first. */
1241 convert_set_attr (exp, num_alt, insn_code, insn_index)
1244 int insn_code, insn_index;
1251 /* See how many alternative specified. */
1252 n = n_comma_elts (XSTR (exp, 1));
1254 return attr_rtx (SET,
1255 attr_rtx (ATTR, XSTR (exp, 0)),
1256 attr_rtx (CONST_STRING, XSTR (exp, 1)));
1258 newexp = rtx_alloc (SET_ATTR_ALTERNATIVE);
1259 XSTR (newexp, 0) = XSTR (exp, 0);
1260 XVEC (newexp, 1) = rtvec_alloc (n);
1262 /* Process each comma-separated name. */
1263 name_ptr = XSTR (exp, 1);
1265 while ((p = next_comma_elt (&name_ptr)) != NULL)
1266 XVECEXP (newexp, 1, n++) = attr_rtx (CONST_STRING, p);
1268 return convert_set_attr_alternative (newexp, num_alt, insn_code, insn_index);
1271 /* Scan all definitions, checking for validity. Also, convert any SET_ATTR
1272 and SET_ATTR_ALTERNATIVE expressions to the corresponding SET
1278 struct insn_def *id;
1279 struct attr_desc *attr;
1283 for (id = defs; id; id = id->next)
1285 if (XVEC (id->def, id->vec_idx) == NULL)
1288 for (i = 0; i < XVECLEN (id->def, id->vec_idx); i++)
1290 value = XVECEXP (id->def, id->vec_idx, i);
1291 switch (GET_CODE (value))
1294 if (GET_CODE (XEXP (value, 0)) != ATTR)
1295 fatal ("Bad attribute set in pattern %d", id->insn_index);
1298 case SET_ATTR_ALTERNATIVE:
1299 value = convert_set_attr_alternative (value,
1300 id->num_alternatives,
1306 value = convert_set_attr (value, id->num_alternatives,
1307 id->insn_code, id->insn_index);
1311 fatal ("Invalid attribute code `%s' for pattern %d",
1312 GET_RTX_NAME (GET_CODE (value)), id->insn_index);
1315 if ((attr = find_attr (XSTR (XEXP (value, 0), 0), 0)) == NULL)
1316 fatal ("Unknown attribute `%s' for pattern number %d",
1317 XSTR (XEXP (value, 0), 0), id->insn_index);
1319 XVECEXP (id->def, id->vec_idx, i) = value;
1320 XEXP (value, 1) = check_attr_value (XEXP (value, 1), attr);
1326 /* Given a constant SYMBOL_REF expression, convert to a COND that
1327 explicitly tests each enumerated value. */
1330 convert_const_symbol_ref (exp, attr)
1332 struct attr_desc *attr;
1335 struct attr_value *av;
1339 for (av = attr->first_value; av; av = av->next)
1342 /* Make a COND with all tests but the last, and in the original order.
1343 Select the last value via the default. Note that the attr values
1344 are constructed in reverse order. */
1346 condexp = rtx_alloc (COND);
1347 XVEC (condexp, 0) = rtvec_alloc ((num_alt - 1) * 2);
1348 av = attr->first_value;
1349 XEXP (condexp, 1) = av->value;
1351 for (i = num_alt - 2; av = av->next, i >= 0; i--)
1356 string = p = (char *) oballoc (2
1357 + strlen (attr->name)
1358 + strlen (XSTR (av->value, 0)));
1359 strcpy (p, attr->name);
1361 strcat (p, XSTR (av->value, 0));
1362 for (; *p != '\0'; p++)
1363 if (*p >= 'a' && *p <= 'z')
1366 value = attr_rtx (SYMBOL_REF, string);
1367 RTX_UNCHANGING_P (value) = 1;
1369 XVECEXP (condexp, 0, 2 * i) = attr_rtx (EQ, exp, value);
1371 XVECEXP (condexp, 0, 2 * i + 1) = av->value;
1378 /* Given a valid expression for an attribute value, remove any IF_THEN_ELSE
1379 expressions by converting them into a COND. This removes cases from this
1380 program. Also, replace an attribute value of "*" with the default attribute
1384 make_canonical (attr, exp)
1385 struct attr_desc *attr;
1391 switch (GET_CODE (exp))
1394 exp = make_numeric_value (INTVAL (exp));
1398 if (! strcmp (XSTR (exp, 0), "*"))
1400 if (attr == 0 || attr->default_val == 0)
1401 fatal ("(attr_value \"*\") used in invalid context.");
1402 exp = attr->default_val->value;
1408 if (!attr->is_const || RTX_UNCHANGING_P (exp))
1410 /* The SYMBOL_REF is constant for a given run, so mark it as unchanging.
1411 This makes the COND something that won't be considered an arbitrary
1412 expression by walk_attr_value. */
1413 RTX_UNCHANGING_P (exp) = 1;
1415 /* ??? Why do we do this? With attribute values { A B C D E }, this
1416 tends to generate (!(x==A) && !(x==B) && !(x==C) && !(x==D)) rather
1418 exp = convert_const_symbol_ref (exp, attr);
1419 RTX_UNCHANGING_P (exp) = 1;
1420 exp = check_attr_value (exp, attr);
1421 /* Goto COND case since this is now a COND. Note that while the
1422 new expression is rescanned, all symbol_ref notes are marked as
1426 exp = check_attr_value (exp, attr);
1431 newexp = rtx_alloc (COND);
1432 XVEC (newexp, 0) = rtvec_alloc (2);
1433 XVECEXP (newexp, 0, 0) = XEXP (exp, 0);
1434 XVECEXP (newexp, 0, 1) = XEXP (exp, 1);
1436 XEXP (newexp, 1) = XEXP (exp, 2);
1439 /* Fall through to COND case since this is now a COND. */
1447 /* First, check for degenerate COND. */
1448 if (XVECLEN (exp, 0) == 0)
1449 return make_canonical (attr, XEXP (exp, 1));
1450 defval = XEXP (exp, 1) = make_canonical (attr, XEXP (exp, 1));
1452 for (i = 0; i < XVECLEN (exp, 0); i += 2)
1454 XVECEXP (exp, 0, i) = copy_boolean (XVECEXP (exp, 0, i));
1455 XVECEXP (exp, 0, i + 1)
1456 = make_canonical (attr, XVECEXP (exp, 0, i + 1));
1457 if (! rtx_equal_p (XVECEXP (exp, 0, i + 1), defval))
1476 if (GET_CODE (exp) == AND || GET_CODE (exp) == IOR)
1477 return attr_rtx (GET_CODE (exp), copy_boolean (XEXP (exp, 0)),
1478 copy_boolean (XEXP (exp, 1)));
1482 /* Given a value and an attribute description, return a `struct attr_value *'
1483 that represents that value. This is either an existing structure, if the
1484 value has been previously encountered, or a newly-created structure.
1486 `insn_code' is the code of an insn whose attribute has the specified
1487 value (-2 if not processing an insn). We ensure that all insns for
1488 a given value have the same number of alternatives if the value checks
1491 static struct attr_value *
1492 get_attr_value (value, attr, insn_code)
1494 struct attr_desc *attr;
1497 struct attr_value *av;
1500 value = make_canonical (attr, value);
1501 if (compares_alternatives_p (value))
1503 if (insn_code < 0 || insn_alternatives == NULL)
1504 fatal ("(eq_attr \"alternatives\" ...) used in non-insn context");
1506 num_alt = insn_alternatives[insn_code];
1509 for (av = attr->first_value; av; av = av->next)
1510 if (rtx_equal_p (value, av->value)
1511 && (num_alt == 0 || av->first_insn == NULL
1512 || insn_alternatives[av->first_insn->insn_code]))
1515 av = (struct attr_value *) oballoc (sizeof (struct attr_value));
1517 av->next = attr->first_value;
1518 attr->first_value = av;
1519 av->first_insn = NULL;
1521 av->has_asm_insn = 0;
1526 /* After all DEFINE_DELAYs have been read in, create internal attributes
1527 to generate the required routines.
1529 First, we compute the number of delay slots for each insn (as a COND of
1530 each of the test expressions in DEFINE_DELAYs). Then, if more than one
1531 delay type is specified, we compute a similar function giving the
1532 DEFINE_DELAY ordinal for each insn.
1534 Finally, for each [DEFINE_DELAY, slot #] pair, we compute an attribute that
1535 tells whether a given insn can be in that delay slot.
1537 Normal attribute filling and optimization expands these to contain the
1538 information needed to handle delay slots. */
1543 struct delay_desc *delay;
1549 /* First, generate data for `num_delay_slots' function. */
1551 condexp = rtx_alloc (COND);
1552 XVEC (condexp, 0) = rtvec_alloc (num_delays * 2);
1553 XEXP (condexp, 1) = make_numeric_value (0);
1555 for (i = 0, delay = delays; delay; i += 2, delay = delay->next)
1557 XVECEXP (condexp, 0, i) = XEXP (delay->def, 0);
1558 XVECEXP (condexp, 0, i + 1)
1559 = make_numeric_value (XVECLEN (delay->def, 1) / 3);
1562 make_internal_attr ("*num_delay_slots", condexp, 0);
1564 /* If more than one delay type, do the same for computing the delay type. */
1567 condexp = rtx_alloc (COND);
1568 XVEC (condexp, 0) = rtvec_alloc (num_delays * 2);
1569 XEXP (condexp, 1) = make_numeric_value (0);
1571 for (i = 0, delay = delays; delay; i += 2, delay = delay->next)
1573 XVECEXP (condexp, 0, i) = XEXP (delay->def, 0);
1574 XVECEXP (condexp, 0, i + 1) = make_numeric_value (delay->num);
1577 make_internal_attr ("*delay_type", condexp, 1);
1580 /* For each delay possibility and delay slot, compute an eligibility
1581 attribute for non-annulled insns and for each type of annulled (annul
1582 if true and annul if false). */
1583 for (delay = delays; delay; delay = delay->next)
1585 for (i = 0; i < XVECLEN (delay->def, 1); i += 3)
1587 condexp = XVECEXP (delay->def, 1, i);
1588 if (condexp == 0) condexp = false_rtx;
1589 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1590 make_numeric_value (1), make_numeric_value (0));
1592 p = attr_printf (sizeof ("*delay__") + MAX_DIGITS*2, "*delay_%d_%d",
1594 make_internal_attr (p, newexp, 1);
1596 if (have_annul_true)
1598 condexp = XVECEXP (delay->def, 1, i + 1);
1599 if (condexp == 0) condexp = false_rtx;
1600 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1601 make_numeric_value (1),
1602 make_numeric_value (0));
1603 p = attr_printf (sizeof ("*annul_true__") + MAX_DIGITS*2,
1604 "*annul_true_%d_%d", delay->num, i / 3);
1605 make_internal_attr (p, newexp, 1);
1608 if (have_annul_false)
1610 condexp = XVECEXP (delay->def, 1, i + 2);
1611 if (condexp == 0) condexp = false_rtx;
1612 newexp = attr_rtx (IF_THEN_ELSE, condexp,
1613 make_numeric_value (1),
1614 make_numeric_value (0));
1615 p = attr_printf (sizeof ("*annul_false__") + MAX_DIGITS*2,
1616 "*annul_false_%d_%d", delay->num, i / 3);
1617 make_internal_attr (p, newexp, 1);
1623 /* This function is given a left and right side expression and an operator.
1624 Each side is a conditional expression, each alternative of which has a
1625 numerical value. The function returns another conditional expression
1626 which, for every possible set of condition values, returns a value that is
1627 the operator applied to the values of the two sides.
1629 Since this is called early, it must also support IF_THEN_ELSE. */
1632 operate_exp (op, left, right)
1636 int left_value, right_value;
1640 /* If left is a string, apply operator to it and the right side. */
1641 if (GET_CODE (left) == CONST_STRING)
1643 /* If right is also a string, just perform the operation. */
1644 if (GET_CODE (right) == CONST_STRING)
1646 left_value = atoi (XSTR (left, 0));
1647 right_value = atoi (XSTR (right, 0));
1651 i = left_value + right_value;
1655 i = left_value - right_value;
1658 case POS_MINUS_OP: /* The positive part of LEFT - RIGHT. */
1659 if (left_value > right_value)
1660 i = left_value - right_value;
1667 i = left_value | right_value;
1671 i = left_value == right_value;
1675 i = (left_value << (HOST_BITS_PER_INT / 2)) | right_value;
1679 if (left_value > right_value)
1686 if (left_value < right_value)
1696 if (i == left_value)
1698 if (i == right_value)
1700 return make_numeric_value (i);
1702 else if (GET_CODE (right) == IF_THEN_ELSE)
1704 /* Apply recursively to all values within. */
1705 rtx newleft = operate_exp (op, left, XEXP (right, 1));
1706 rtx newright = operate_exp (op, left, XEXP (right, 2));
1707 if (rtx_equal_p (newleft, newright))
1709 return attr_rtx (IF_THEN_ELSE, XEXP (right, 0), newleft, newright);
1711 else if (GET_CODE (right) == COND)
1716 newexp = rtx_alloc (COND);
1717 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (right, 0));
1718 defval = XEXP (newexp, 1) = operate_exp (op, left, XEXP (right, 1));
1720 for (i = 0; i < XVECLEN (right, 0); i += 2)
1722 XVECEXP (newexp, 0, i) = XVECEXP (right, 0, i);
1723 XVECEXP (newexp, 0, i + 1)
1724 = operate_exp (op, left, XVECEXP (right, 0, i + 1));
1725 if (! rtx_equal_p (XVECEXP (newexp, 0, i + 1),
1730 /* If the resulting cond is trivial (all alternatives
1731 give the same value), optimize it away. */
1734 obstack_free (rtl_obstack, newexp);
1735 return operate_exp (op, left, XEXP (right, 1));
1738 /* If the result is the same as the RIGHT operand,
1740 if (rtx_equal_p (newexp, right))
1742 obstack_free (rtl_obstack, newexp);
1749 fatal ("Badly formed attribute value");
1752 /* A hack to prevent expand_units from completely blowing up: ORX_OP does
1753 not associate through IF_THEN_ELSE. */
1754 else if (op == ORX_OP && GET_CODE (right) == IF_THEN_ELSE)
1756 return attr_rtx (IOR, left, right);
1759 /* Otherwise, do recursion the other way. */
1760 else if (GET_CODE (left) == IF_THEN_ELSE)
1762 rtx newleft = operate_exp (op, XEXP (left, 1), right);
1763 rtx newright = operate_exp (op, XEXP (left, 2), right);
1764 if (rtx_equal_p (newleft, newright))
1766 return attr_rtx (IF_THEN_ELSE, XEXP (left, 0), newleft, newright);
1768 else if (GET_CODE (left) == COND)
1773 newexp = rtx_alloc (COND);
1774 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (left, 0));
1775 defval = XEXP (newexp, 1) = operate_exp (op, XEXP (left, 1), right);
1777 for (i = 0; i < XVECLEN (left, 0); i += 2)
1779 XVECEXP (newexp, 0, i) = XVECEXP (left, 0, i);
1780 XVECEXP (newexp, 0, i + 1)
1781 = operate_exp (op, XVECEXP (left, 0, i + 1), right);
1782 if (! rtx_equal_p (XVECEXP (newexp, 0, i + 1),
1787 /* If the cond is trivial (all alternatives give the same value),
1788 optimize it away. */
1791 obstack_free (rtl_obstack, newexp);
1792 return operate_exp (op, XEXP (left, 1), right);
1795 /* If the result is the same as the LEFT operand,
1797 if (rtx_equal_p (newexp, left))
1799 obstack_free (rtl_obstack, newexp);
1807 fatal ("Badly formed attribute value.");
1812 /* Once all attributes and DEFINE_FUNCTION_UNITs have been read, we
1813 construct a number of attributes.
1815 The first produces a function `function_units_used' which is given an
1816 insn and produces an encoding showing which function units are required
1817 for the execution of that insn. If the value is non-negative, the insn
1818 uses that unit; otherwise, the value is a one's compliment mask of units
1821 The second produces a function `result_ready_cost' which is used to
1822 determine the time that the result of an insn will be ready and hence
1823 a worst-case schedule.
1825 Both of these produce quite complex expressions which are then set as the
1826 default value of internal attributes. Normal attribute simplification
1827 should produce reasonable expressions.
1829 For each unit, a `<name>_unit_ready_cost' function will take an
1830 insn and give the delay until that unit will be ready with the result
1831 and a `<name>_unit_conflict_cost' function is given an insn already
1832 executing on the unit and a candidate to execute and will give the
1833 cost from the time the executing insn started until the candidate
1834 can start (ignore limitations on the number of simultaneous insns).
1836 For each unit, a `<name>_unit_blockage' function is given an insn
1837 already executing on the unit and a candidate to execute and will
1838 give the delay incurred due to function unit conflicts. The range of
1839 blockage cost values for a given executing insn is given by the
1840 `<name>_unit_blockage_range' function. These values are encoded in
1841 an int where the upper half gives the minimum value and the lower
1842 half gives the maximum value. */
1847 struct function_unit *unit, **unit_num;
1848 struct function_unit_op *op, **op_array, ***unit_ops;
1853 int i, j, u, num, nvalues;
1855 /* Rebuild the condition for the unit to share the RTL expressions.
1856 Sharing is required by simplify_by_exploding. Build the issue delay
1857 expressions. Validate the expressions we were given for the conditions
1858 and conflict vector. Then make attributes for use in the conflict
1861 for (unit = units; unit; unit = unit->next)
1863 unit->condexp = check_attr_test (unit->condexp, 0);
1865 for (op = unit->ops; op; op = op->next)
1867 rtx issue_delay = make_numeric_value (op->issue_delay);
1868 rtx issue_exp = issue_delay;
1870 /* Build, validate, and simplify the issue delay expression. */
1871 if (op->conflict_exp != true_rtx)
1872 issue_exp = attr_rtx (IF_THEN_ELSE, op->conflict_exp,
1873 issue_exp, make_numeric_value (0));
1874 issue_exp = check_attr_value (make_canonical (NULL_ATTR,
1877 issue_exp = simplify_knowing (issue_exp, unit->condexp);
1878 op->issue_exp = issue_exp;
1880 /* Make an attribute for use in the conflict function if needed. */
1881 unit->needs_conflict_function = (unit->issue_delay.min
1882 != unit->issue_delay.max);
1883 if (unit->needs_conflict_function)
1885 str = attr_printf (strlen (unit->name) + sizeof ("*_cost_") + MAX_DIGITS,
1886 "*%s_cost_%d", unit->name, op->num);
1887 make_internal_attr (str, issue_exp, 1);
1890 /* Validate the condition. */
1891 op->condexp = check_attr_test (op->condexp, 0);
1895 /* Compute the mask of function units used. Initially, the unitsmask is
1896 zero. Set up a conditional to compute each unit's contribution. */
1897 unitsmask = make_numeric_value (0);
1898 newexp = rtx_alloc (IF_THEN_ELSE);
1899 XEXP (newexp, 2) = make_numeric_value (0);
1901 /* If we have just a few units, we may be all right expanding the whole
1902 thing. But the expansion is 2**N in space on the number of opclasses,
1903 so we can't do this for very long -- Alpha and MIPS in particular have
1904 problems with this. So in that situation, we fall back on an alternate
1905 implementation method. */
1906 #define NUM_UNITOP_CUTOFF 20
1908 if (num_unit_opclasses < NUM_UNITOP_CUTOFF)
1910 /* Merge each function unit into the unit mask attributes. */
1911 for (unit = units; unit; unit = unit->next)
1913 XEXP (newexp, 0) = unit->condexp;
1914 XEXP (newexp, 1) = make_numeric_value (1 << unit->num);
1915 unitsmask = operate_exp (OR_OP, unitsmask, newexp);
1920 /* Merge each function unit into the unit mask attributes. */
1921 for (unit = units; unit; unit = unit->next)
1923 XEXP (newexp, 0) = unit->condexp;
1924 XEXP (newexp, 1) = make_numeric_value (1 << unit->num);
1925 unitsmask = operate_exp (ORX_OP, unitsmask, attr_copy_rtx (newexp));
1929 /* Simplify the unit mask expression, encode it, and make an attribute
1930 for the function_units_used function. */
1931 unitsmask = simplify_by_exploding (unitsmask);
1933 if (num_unit_opclasses < NUM_UNITOP_CUTOFF)
1934 unitsmask = encode_units_mask (unitsmask);
1937 /* We can no longer encode unitsmask at compile time, so emit code to
1938 calculate it at runtime. Rather, put a marker for where we'd do
1939 the code, and actually output it in write_attr_get(). */
1940 unitsmask = attr_rtx (FFS, unitsmask);
1943 make_internal_attr ("*function_units_used", unitsmask, 2);
1945 /* Create an array of ops for each unit. Add an extra unit for the
1946 result_ready_cost function that has the ops of all other units. */
1947 unit_ops = (struct function_unit_op ***)
1948 alloca ((num_units + 1) * sizeof (struct function_unit_op **));
1949 unit_num = (struct function_unit **)
1950 alloca ((num_units + 1) * sizeof (struct function_unit *));
1952 unit_num[num_units] = unit = (struct function_unit *)
1953 alloca (sizeof (struct function_unit));
1954 unit->num = num_units;
1955 unit->num_opclasses = 0;
1957 for (unit = units; unit; unit = unit->next)
1959 unit_num[num_units]->num_opclasses += unit->num_opclasses;
1960 unit_num[unit->num] = unit;
1961 unit_ops[unit->num] = op_array = (struct function_unit_op **)
1962 alloca (unit->num_opclasses * sizeof (struct function_unit_op *));
1964 for (op = unit->ops; op; op = op->next)
1965 op_array[op->num] = op;
1968 /* Compose the array of ops for the extra unit. */
1969 unit_ops[num_units] = op_array = (struct function_unit_op **)
1970 alloca (unit_num[num_units]->num_opclasses
1971 * sizeof (struct function_unit_op *));
1973 for (unit = units, i = 0; unit; i += unit->num_opclasses, unit = unit->next)
1974 bcopy ((char *) unit_ops[unit->num], (char *) &op_array[i],
1975 unit->num_opclasses * sizeof (struct function_unit_op *));
1977 /* Compute the ready cost function for each unit by computing the
1978 condition for each non-default value. */
1979 for (u = 0; u <= num_units; u++)
1985 op_array = unit_ops[unit->num];
1986 num = unit->num_opclasses;
1988 /* Sort the array of ops into increasing ready cost order. */
1989 for (i = 0; i < num; i++)
1990 for (j = num - 1; j > i; j--)
1991 if (op_array[j-1]->ready < op_array[j]->ready)
1994 op_array[j] = op_array[j-1];
1998 /* Determine how many distinct non-default ready cost values there
1999 are. We use a default ready cost value of 1. */
2000 nvalues = 0; value = 1;
2001 for (i = num - 1; i >= 0; i--)
2002 if (op_array[i]->ready > value)
2004 value = op_array[i]->ready;
2009 readycost = make_numeric_value (1);
2012 /* Construct the ready cost expression as a COND of each value from
2013 the largest to the smallest. */
2014 readycost = rtx_alloc (COND);
2015 XVEC (readycost, 0) = rtvec_alloc (nvalues * 2);
2016 XEXP (readycost, 1) = make_numeric_value (1);
2018 nvalues = 0; orexp = false_rtx; value = op_array[0]->ready;
2019 for (i = 0; i < num; i++)
2024 else if (op->ready == value)
2025 orexp = insert_right_side (IOR, orexp, op->condexp, -2, -2);
2028 XVECEXP (readycost, 0, nvalues * 2) = orexp;
2029 XVECEXP (readycost, 0, nvalues * 2 + 1)
2030 = make_numeric_value (value);
2033 orexp = op->condexp;
2036 XVECEXP (readycost, 0, nvalues * 2) = orexp;
2037 XVECEXP (readycost, 0, nvalues * 2 + 1) = make_numeric_value (value);
2042 rtx max_blockage = 0, min_blockage = 0;
2044 /* Simplify the readycost expression by only considering insns
2045 that use the unit. */
2046 readycost = simplify_knowing (readycost, unit->condexp);
2048 /* Determine the blockage cost the executing insn (E) given
2049 the candidate insn (C). This is the maximum of the issue
2050 delay, the pipeline delay, and the simultaneity constraint.
2051 Each function_unit_op represents the characteristics of the
2052 candidate insn, so in the expressions below, C is a known
2053 term and E is an unknown term.
2055 We compute the blockage cost for each E for every possible C.
2056 Thus OP represents E, and READYCOST is a list of values for
2059 The issue delay function for C is op->issue_exp and is used to
2060 write the `<name>_unit_conflict_cost' function. Symbolicly
2061 this is "ISSUE-DELAY (E,C)".
2063 The pipeline delay results form the FIFO constraint on the
2064 function unit and is "READY-COST (E) + 1 - READY-COST (C)".
2066 The simultaneity constraint is based on how long it takes to
2067 fill the unit given the minimum issue delay. FILL-TIME is the
2068 constant "MIN (ISSUE-DELAY (*,*)) * (SIMULTANEITY - 1)", and
2069 the simultaneity constraint is "READY-COST (E) - FILL-TIME"
2070 if SIMULTANEITY is non-zero and zero otherwise.
2072 Thus, BLOCKAGE (E,C) when SIMULTANEITY is zero is
2074 MAX (ISSUE-DELAY (E,C),
2075 READY-COST (E) - (READY-COST (C) - 1))
2079 MAX (ISSUE-DELAY (E,C),
2080 READY-COST (E) - (READY-COST (C) - 1),
2081 READY-COST (E) - FILL-TIME)
2083 The `<name>_unit_blockage' function is computed by determining
2084 this value for each candidate insn. As these values are
2085 computed, we also compute the upper and lower bounds for
2086 BLOCKAGE (E,*). These are combined to form the function
2087 `<name>_unit_blockage_range'. Finally, the maximum blockage
2088 cost, MAX (BLOCKAGE (*,*)), is computed. */
2090 for (op = unit->ops; op; op = op->next)
2093 rtx blockage = op->issue_exp;
2095 rtx blockage = operate_exp (POS_MINUS_OP, readycost,
2096 make_numeric_value (1));
2098 if (unit->simultaneity != 0)
2100 rtx filltime = make_numeric_value ((unit->simultaneity - 1)
2101 * unit->issue_delay.min);
2102 blockage = operate_exp (MIN_OP, blockage, filltime);
2105 blockage = operate_exp (POS_MINUS_OP,
2106 make_numeric_value (op->ready),
2109 blockage = operate_exp (MAX_OP, blockage, op->issue_exp);
2111 blockage = simplify_knowing (blockage, unit->condexp);
2113 /* Add this op's contribution to MAX (BLOCKAGE (E,*)) and
2114 MIN (BLOCKAGE (E,*)). */
2115 if (max_blockage == 0)
2116 max_blockage = min_blockage = blockage;
2120 = simplify_knowing (operate_exp (MAX_OP, max_blockage,
2124 = simplify_knowing (operate_exp (MIN_OP, min_blockage,
2129 /* Make an attribute for use in the blockage function. */
2130 str = attr_printf (strlen (unit->name) + sizeof ("*_block_") + MAX_DIGITS,
2131 "*%s_block_%d", unit->name, op->num);
2132 make_internal_attr (str, blockage, 1);
2135 /* Record MAX (BLOCKAGE (*,*)). */
2136 unit->max_blockage = max_attr_value (max_blockage);
2138 /* See if the upper and lower bounds of BLOCKAGE (E,*) are the
2139 same. If so, the blockage function carries no additional
2140 information and is not written. */
2141 newexp = operate_exp (EQ_OP, max_blockage, min_blockage);
2142 newexp = simplify_knowing (newexp, unit->condexp);
2143 unit->needs_blockage_function
2144 = (GET_CODE (newexp) != CONST_STRING
2145 || atoi (XSTR (newexp, 0)) != 1);
2147 /* If the all values of BLOCKAGE (E,C) have the same value,
2148 neither blockage function is written. */
2149 unit->needs_range_function
2150 = (unit->needs_blockage_function
2151 || GET_CODE (max_blockage) != CONST_STRING);
2153 if (unit->needs_range_function)
2155 /* Compute the blockage range function and make an attribute
2156 for writing it's value. */
2157 newexp = operate_exp (RANGE_OP, min_blockage, max_blockage);
2158 newexp = simplify_knowing (newexp, unit->condexp);
2160 str = attr_printf (strlen (unit->name) + sizeof ("*_unit_blockage_range"),
2161 "*%s_unit_blockage_range", unit->name);
2162 make_internal_attr (str, newexp, 4);
2165 str = attr_printf (strlen (unit->name) + sizeof ("*_unit_ready_cost"),
2166 "*%s_unit_ready_cost", unit->name);
2169 str = "*result_ready_cost";
2171 /* Make an attribute for the ready_cost function. Simplifying
2172 further with simplify_by_exploding doesn't win. */
2173 make_internal_attr (str, readycost, 0);
2176 /* For each unit that requires a conflict cost function, make an attribute
2177 that maps insns to the operation number. */
2178 for (unit = units; unit; unit = unit->next)
2182 if (! unit->needs_conflict_function
2183 && ! unit->needs_blockage_function)
2186 caseexp = rtx_alloc (COND);
2187 XVEC (caseexp, 0) = rtvec_alloc ((unit->num_opclasses - 1) * 2);
2189 for (op = unit->ops; op; op = op->next)
2191 /* Make our adjustment to the COND being computed. If we are the
2192 last operation class, place our values into the default of the
2194 if (op->num == unit->num_opclasses - 1)
2196 XEXP (caseexp, 1) = make_numeric_value (op->num);
2200 XVECEXP (caseexp, 0, op->num * 2) = op->condexp;
2201 XVECEXP (caseexp, 0, op->num * 2 + 1)
2202 = make_numeric_value (op->num);
2206 /* Simplifying caseexp with simplify_by_exploding doesn't win. */
2207 str = attr_printf (strlen (unit->name) + sizeof ("*_cases"),
2208 "*%s_cases", unit->name);
2209 make_internal_attr (str, caseexp, 1);
2213 /* Simplify EXP given KNOWN_TRUE. */
2216 simplify_knowing (exp, known_true)
2217 rtx exp, known_true;
2219 if (GET_CODE (exp) != CONST_STRING)
2221 exp = attr_rtx (IF_THEN_ELSE, known_true, exp,
2222 make_numeric_value (max_attr_value (exp)));
2223 exp = simplify_by_exploding (exp);
2228 /* Translate the CONST_STRING expressions in X to change the encoding of
2229 value. On input, the value is a bitmask with a one bit for each unit
2230 used; on output, the value is the unit number (zero based) if one
2231 and only one unit is used or the one's compliment of the bitmask. */
2234 encode_units_mask (x)
2239 register enum rtx_code code;
2242 code = GET_CODE (x);
2247 i = atoi (XSTR (x, 0));
2249 abort (); /* The sign bit encodes a one's compliment mask. */
2250 else if (i != 0 && i == (i & -i))
2251 /* Only one bit is set, so yield that unit number. */
2252 for (j = 0; (i >>= 1) != 0; j++)
2256 return attr_rtx (CONST_STRING, attr_printf (MAX_DIGITS, "%d", j));
2273 /* Compare the elements. If any pair of corresponding elements
2274 fail to match, return 0 for the whole things. */
2276 fmt = GET_RTX_FORMAT (code);
2277 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2283 for (j = 0; j < XVECLEN (x, i); j++)
2284 XVECEXP (x, i, j) = encode_units_mask (XVECEXP (x, i, j));
2288 XEXP (x, i) = encode_units_mask (XEXP (x, i));
2295 /* Once all attributes and insns have been read and checked, we construct for
2296 each attribute value a list of all the insns that have that value for
2301 struct attr_desc *attr;
2303 struct attr_value *av;
2304 struct insn_ent *ie;
2305 struct insn_def *id;
2309 /* Don't fill constant attributes. The value is independent of
2310 any particular insn. */
2314 for (id = defs; id; id = id->next)
2316 /* If no value is specified for this insn for this attribute, use the
2319 if (XVEC (id->def, id->vec_idx))
2320 for (i = 0; i < XVECLEN (id->def, id->vec_idx); i++)
2321 if (! strcmp (XSTR (XEXP (XVECEXP (id->def, id->vec_idx, i), 0), 0),
2323 value = XEXP (XVECEXP (id->def, id->vec_idx, i), 1);
2326 av = attr->default_val;
2328 av = get_attr_value (value, attr, id->insn_code);
2330 ie = (struct insn_ent *) oballoc (sizeof (struct insn_ent));
2331 ie->insn_code = id->insn_code;
2332 ie->insn_index = id->insn_code;
2333 insert_insn_ent (av, ie);
2337 /* Given an expression EXP, see if it is a COND or IF_THEN_ELSE that has a
2338 test that checks relative positions of insns (uses MATCH_DUP or PC).
2339 If so, replace it with what is obtained by passing the expression to
2340 ADDRESS_FN. If not but it is a COND or IF_THEN_ELSE, call this routine
2341 recursively on each value (including the default value). Otherwise,
2342 return the value returned by NO_ADDRESS_FN applied to EXP. */
2345 substitute_address (exp, no_address_fn, address_fn)
2347 rtx (*no_address_fn) ();
2348 rtx (*address_fn) ();
2353 if (GET_CODE (exp) == COND)
2355 /* See if any tests use addresses. */
2357 for (i = 0; i < XVECLEN (exp, 0); i += 2)
2358 walk_attr_value (XVECEXP (exp, 0, i));
2361 return (*address_fn) (exp);
2363 /* Make a new copy of this COND, replacing each element. */
2364 newexp = rtx_alloc (COND);
2365 XVEC (newexp, 0) = rtvec_alloc (XVECLEN (exp, 0));
2366 for (i = 0; i < XVECLEN (exp, 0); i += 2)
2368 XVECEXP (newexp, 0, i) = XVECEXP (exp, 0, i);
2369 XVECEXP (newexp, 0, i + 1)
2370 = substitute_address (XVECEXP (exp, 0, i + 1),
2371 no_address_fn, address_fn);
2374 XEXP (newexp, 1) = substitute_address (XEXP (exp, 1),
2375 no_address_fn, address_fn);
2380 else if (GET_CODE (exp) == IF_THEN_ELSE)
2383 walk_attr_value (XEXP (exp, 0));
2385 return (*address_fn) (exp);
2387 return attr_rtx (IF_THEN_ELSE,
2388 substitute_address (XEXP (exp, 0),
2389 no_address_fn, address_fn),
2390 substitute_address (XEXP (exp, 1),
2391 no_address_fn, address_fn),
2392 substitute_address (XEXP (exp, 2),
2393 no_address_fn, address_fn));
2396 return (*no_address_fn) (exp);
2399 /* Make new attributes from the `length' attribute. The following are made,
2400 each corresponding to a function called from `shorten_branches' or
2403 *insn_default_length This is the length of the insn to be returned
2404 by `get_attr_length' before `shorten_branches'
2405 has been called. In each case where the length
2406 depends on relative addresses, the largest
2407 possible is used. This routine is also used
2408 to compute the initial size of the insn.
2410 *insn_variable_length_p This returns 1 if the insn's length depends
2411 on relative addresses, zero otherwise.
2413 *insn_current_length This is only called when it is known that the
2414 insn has a variable length and returns the
2415 current length, based on relative addresses.
2419 make_length_attrs ()
2421 static char *new_names[] = {"*insn_default_length",
2422 "*insn_variable_length_p",
2423 "*insn_current_length"};
2424 static rtx (*no_address_fn[]) PROTO((rtx)) = {identity_fn, zero_fn, zero_fn};
2425 static rtx (*address_fn[]) PROTO((rtx)) = {max_fn, one_fn, identity_fn};
2427 struct attr_desc *length_attr, *new_attr;
2428 struct attr_value *av, *new_av;
2429 struct insn_ent *ie, *new_ie;
2431 /* See if length attribute is defined. If so, it must be numeric. Make
2432 it special so we don't output anything for it. */
2433 length_attr = find_attr ("length", 0);
2434 if (length_attr == 0)
2437 if (! length_attr->is_numeric)
2438 fatal ("length attribute must be numeric.");
2440 length_attr->is_const = 0;
2441 length_attr->is_special = 1;
2443 /* Make each new attribute, in turn. */
2444 for (i = 0; i < sizeof new_names / sizeof new_names[0]; i++)
2446 make_internal_attr (new_names[i],
2447 substitute_address (length_attr->default_val->value,
2448 no_address_fn[i], address_fn[i]),
2450 new_attr = find_attr (new_names[i], 0);
2451 for (av = length_attr->first_value; av; av = av->next)
2452 for (ie = av->first_insn; ie; ie = ie->next)
2454 new_av = get_attr_value (substitute_address (av->value,
2457 new_attr, ie->insn_code);
2458 new_ie = (struct insn_ent *) oballoc (sizeof (struct insn_ent));
2459 new_ie->insn_code = ie->insn_code;
2460 new_ie->insn_index = ie->insn_index;
2461 insert_insn_ent (new_av, new_ie);
2466 /* Utility functions called from above routine. */
2479 return make_numeric_value (0);
2486 return make_numeric_value (1);
2493 return make_numeric_value (max_attr_value (exp));
2496 /* Take a COND expression and see if any of the conditions in it can be
2497 simplified. If any are known true or known false for the particular insn
2498 code, the COND can be further simplified.
2500 Also call ourselves on any COND operations that are values of this COND.
2502 We do not modify EXP; rather, we make and return a new rtx. */
2505 simplify_cond (exp, insn_code, insn_index)
2507 int insn_code, insn_index;
2510 /* We store the desired contents here,
2511 then build a new expression if they don't match EXP. */
2512 rtx defval = XEXP (exp, 1);
2513 rtx new_defval = XEXP (exp, 1);
2514 int len = XVECLEN (exp, 0);
2515 rtunion *tests = (rtunion *) alloca (len * sizeof (rtunion));
2519 /* This lets us free all storage allocated below, if appropriate. */
2520 first_spacer = (char *) obstack_finish (rtl_obstack);
2522 bcopy ((char *) XVEC (exp, 0)->elem, (char *) tests, len * sizeof (rtunion));
2524 /* See if default value needs simplification. */
2525 if (GET_CODE (defval) == COND)
2526 new_defval = simplify_cond (defval, insn_code, insn_index);
2528 /* Simplify the subexpressions, and see what tests we can get rid of. */
2530 for (i = 0; i < len; i += 2)
2532 rtx newtest, newval;
2534 /* Simplify this test. */
2535 newtest = SIMPLIFY_TEST_EXP (tests[i].rtx, insn_code, insn_index);
2536 tests[i].rtx = newtest;
2538 newval = tests[i + 1].rtx;
2539 /* See if this value may need simplification. */
2540 if (GET_CODE (newval) == COND)
2541 newval = simplify_cond (newval, insn_code, insn_index);
2543 /* Look for ways to delete or combine this test. */
2544 if (newtest == true_rtx)
2546 /* If test is true, make this value the default
2547 and discard this + any following tests. */
2549 defval = tests[i + 1].rtx;
2550 new_defval = newval;
2553 else if (newtest == false_rtx)
2555 /* If test is false, discard it and its value. */
2556 for (j = i; j < len - 2; j++)
2557 tests[j].rtx = tests[j + 2].rtx;
2561 else if (i > 0 && attr_equal_p (newval, tests[i - 1].rtx))
2563 /* If this value and the value for the prev test are the same,
2567 = insert_right_side (IOR, tests[i - 2].rtx, newtest,
2568 insn_code, insn_index);
2570 /* Delete this test/value. */
2571 for (j = i; j < len - 2; j++)
2572 tests[j].rtx = tests[j + 2].rtx;
2577 tests[i + 1].rtx = newval;
2580 /* If the last test in a COND has the same value
2581 as the default value, that test isn't needed. */
2583 while (len > 0 && attr_equal_p (tests[len - 1].rtx, new_defval))
2586 /* See if we changed anything. */
2587 if (len != XVECLEN (exp, 0) || new_defval != XEXP (exp, 1))
2590 for (i = 0; i < len; i++)
2591 if (! attr_equal_p (tests[i].rtx, XVECEXP (exp, 0, i)))
2599 obstack_free (rtl_obstack, first_spacer);
2600 if (GET_CODE (defval) == COND)
2601 return simplify_cond (defval, insn_code, insn_index);
2606 obstack_free (rtl_obstack, first_spacer);
2611 rtx newexp = rtx_alloc (COND);
2613 XVEC (newexp, 0) = rtvec_alloc (len);
2614 bcopy ((char *) tests, (char *) XVEC (newexp, 0)->elem,
2615 len * sizeof (rtunion));
2616 XEXP (newexp, 1) = new_defval;
2621 /* Remove an insn entry from an attribute value. */
2624 remove_insn_ent (av, ie)
2625 struct attr_value *av;
2626 struct insn_ent *ie;
2628 struct insn_ent *previe;
2630 if (av->first_insn == ie)
2631 av->first_insn = ie->next;
2634 for (previe = av->first_insn; previe->next != ie; previe = previe->next)
2636 previe->next = ie->next;
2640 if (ie->insn_code == -1)
2641 av->has_asm_insn = 0;
2646 /* Insert an insn entry in an attribute value list. */
2649 insert_insn_ent (av, ie)
2650 struct attr_value *av;
2651 struct insn_ent *ie;
2653 ie->next = av->first_insn;
2654 av->first_insn = ie;
2656 if (ie->insn_code == -1)
2657 av->has_asm_insn = 1;
2662 /* This is a utility routine to take an expression that is a tree of either
2663 AND or IOR expressions and insert a new term. The new term will be
2664 inserted at the right side of the first node whose code does not match
2665 the root. A new node will be created with the root's code. Its left
2666 side will be the old right side and its right side will be the new
2669 If the `term' is itself a tree, all its leaves will be inserted. */
2672 insert_right_side (code, exp, term, insn_code, insn_index)
2676 int insn_code, insn_index;
2680 /* Avoid consing in some special cases. */
2681 if (code == AND && term == true_rtx)
2683 if (code == AND && term == false_rtx)
2685 if (code == AND && exp == true_rtx)
2687 if (code == AND && exp == false_rtx)
2689 if (code == IOR && term == true_rtx)
2691 if (code == IOR && term == false_rtx)
2693 if (code == IOR && exp == true_rtx)
2695 if (code == IOR && exp == false_rtx)
2697 if (attr_equal_p (exp, term))
2700 if (GET_CODE (term) == code)
2702 exp = insert_right_side (code, exp, XEXP (term, 0),
2703 insn_code, insn_index);
2704 exp = insert_right_side (code, exp, XEXP (term, 1),
2705 insn_code, insn_index);
2710 if (GET_CODE (exp) == code)
2712 rtx new = insert_right_side (code, XEXP (exp, 1),
2713 term, insn_code, insn_index);
2714 if (new != XEXP (exp, 1))
2715 /* Make a copy of this expression and call recursively. */
2716 newexp = attr_rtx (code, XEXP (exp, 0), new);
2722 /* Insert the new term. */
2723 newexp = attr_rtx (code, exp, term);
2726 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2729 /* If we have an expression which AND's a bunch of
2730 (not (eq_attrq "alternative" "n"))
2731 terms, we may have covered all or all but one of the possible alternatives.
2732 If so, we can optimize. Similarly for IOR's of EQ_ATTR.
2734 This routine is passed an expression and either AND or IOR. It returns a
2735 bitmask indicating which alternatives are mentioned within EXP. */
2738 compute_alternative_mask (exp, code)
2743 if (GET_CODE (exp) == code)
2744 return compute_alternative_mask (XEXP (exp, 0), code)
2745 | compute_alternative_mask (XEXP (exp, 1), code);
2747 else if (code == AND && GET_CODE (exp) == NOT
2748 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
2749 && XSTR (XEXP (exp, 0), 0) == alternative_name)
2750 string = XSTR (XEXP (exp, 0), 1);
2752 else if (code == IOR && GET_CODE (exp) == EQ_ATTR
2753 && XSTR (exp, 0) == alternative_name)
2754 string = XSTR (exp, 1);
2760 return 1 << (string[0] - '0');
2761 return 1 << atoi (string);
2764 /* Given I, a single-bit mask, return RTX to compare the `alternative'
2765 attribute with the value represented by that bit. */
2768 make_alternative_compare (mask)
2775 for (i = 0; (mask & (1 << i)) == 0; i++)
2778 newexp = attr_rtx (EQ_ATTR, alternative_name, attr_numeral (i));
2779 RTX_UNCHANGING_P (newexp) = 1;
2784 /* If we are processing an (eq_attr "attr" "value") test, we find the value
2785 of "attr" for this insn code. From that value, we can compute a test
2786 showing when the EQ_ATTR will be true. This routine performs that
2787 computation. If a test condition involves an address, we leave the EQ_ATTR
2788 intact because addresses are only valid for the `length' attribute.
2790 EXP is the EQ_ATTR expression and VALUE is the value of that attribute
2791 for the insn corresponding to INSN_CODE and INSN_INDEX. */
2794 evaluate_eq_attr (exp, value, insn_code, insn_index)
2797 int insn_code, insn_index;
2804 if (GET_CODE (value) == CONST_STRING)
2806 if (! strcmp (XSTR (value, 0), XSTR (exp, 1)))
2811 else if (GET_CODE (value) == SYMBOL_REF)
2815 if (GET_CODE (exp) != EQ_ATTR)
2818 string = (char *) alloca (2 + strlen (XSTR (exp, 0))
2819 + strlen (XSTR (exp, 1)));
2820 strcpy (string, XSTR (exp, 0));
2821 strcat (string, "_");
2822 strcat (string, XSTR (exp, 1));
2823 for (p = string; *p ; p++)
2824 if (*p >= 'a' && *p <= 'z')
2827 newexp = attr_rtx (EQ, value,
2828 attr_rtx (SYMBOL_REF,
2829 attr_string(string, strlen(string))));
2831 else if (GET_CODE (value) == COND)
2833 /* We construct an IOR of all the cases for which the requested attribute
2834 value is present. Since we start with FALSE, if it is not present,
2835 FALSE will be returned.
2837 Each case is the AND of the NOT's of the previous conditions with the
2838 current condition; in the default case the current condition is TRUE.
2840 For each possible COND value, call ourselves recursively.
2842 The extra TRUE and FALSE expressions will be eliminated by another
2843 call to the simplification routine. */
2848 if (current_alternative_string)
2849 clear_struct_flag (value);
2851 for (i = 0; i < XVECLEN (value, 0); i += 2)
2853 rtx this = SIMPLIFY_TEST_EXP (XVECEXP (value, 0, i),
2854 insn_code, insn_index);
2856 SIMPLIFY_ALTERNATIVE (this);
2858 right = insert_right_side (AND, andexp, this,
2859 insn_code, insn_index);
2860 right = insert_right_side (AND, right,
2861 evaluate_eq_attr (exp,
2864 insn_code, insn_index),
2865 insn_code, insn_index);
2866 orexp = insert_right_side (IOR, orexp, right,
2867 insn_code, insn_index);
2869 /* Add this condition into the AND expression. */
2870 newexp = attr_rtx (NOT, this);
2871 andexp = insert_right_side (AND, andexp, newexp,
2872 insn_code, insn_index);
2875 /* Handle the default case. */
2876 right = insert_right_side (AND, andexp,
2877 evaluate_eq_attr (exp, XEXP (value, 1),
2878 insn_code, insn_index),
2879 insn_code, insn_index);
2880 newexp = insert_right_side (IOR, orexp, right, insn_code, insn_index);
2885 /* If uses an address, must return original expression. But set the
2886 RTX_UNCHANGING_P bit so we don't try to simplify it again. */
2889 walk_attr_value (newexp);
2893 /* This had `&& current_alternative_string', which seems to be wrong. */
2894 if (! RTX_UNCHANGING_P (exp))
2895 return copy_rtx_unchanging (exp);
2902 /* This routine is called when an AND of a term with a tree of AND's is
2903 encountered. If the term or its complement is present in the tree, it
2904 can be replaced with TRUE or FALSE, respectively.
2906 Note that (eq_attr "att" "v1") and (eq_attr "att" "v2") cannot both
2907 be true and hence are complementary.
2909 There is one special case: If we see
2910 (and (not (eq_attr "att" "v1"))
2911 (eq_attr "att" "v2"))
2912 this can be replaced by (eq_attr "att" "v2"). To do this we need to
2913 replace the term, not anything in the AND tree. So we pass a pointer to
2917 simplify_and_tree (exp, pterm, insn_code, insn_index)
2920 int insn_code, insn_index;
2925 int left_eliminates_term, right_eliminates_term;
2927 if (GET_CODE (exp) == AND)
2929 left = simplify_and_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
2930 right = simplify_and_tree (XEXP (exp, 1), pterm, insn_code, insn_index);
2931 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2933 newexp = attr_rtx (GET_CODE (exp), left, right);
2935 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2939 else if (GET_CODE (exp) == IOR)
2941 /* For the IOR case, we do the same as above, except that we can
2942 only eliminate `term' if both sides of the IOR would do so. */
2944 left = simplify_and_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
2945 left_eliminates_term = (temp == true_rtx);
2948 right = simplify_and_tree (XEXP (exp, 1), &temp, insn_code, insn_index);
2949 right_eliminates_term = (temp == true_rtx);
2951 if (left_eliminates_term && right_eliminates_term)
2954 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2956 newexp = attr_rtx (GET_CODE (exp), left, right);
2958 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
2962 /* Check for simplifications. Do some extra checking here since this
2963 routine is called so many times. */
2968 else if (GET_CODE (exp) == NOT && XEXP (exp, 0) == *pterm)
2971 else if (GET_CODE (*pterm) == NOT && exp == XEXP (*pterm, 0))
2974 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == EQ_ATTR)
2976 if (XSTR (exp, 0) != XSTR (*pterm, 0))
2979 if (! strcmp (XSTR (exp, 1), XSTR (*pterm, 1)))
2985 else if (GET_CODE (*pterm) == EQ_ATTR && GET_CODE (exp) == NOT
2986 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR)
2988 if (XSTR (*pterm, 0) != XSTR (XEXP (exp, 0), 0))
2991 if (! strcmp (XSTR (*pterm, 1), XSTR (XEXP (exp, 0), 1)))
2997 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == NOT
2998 && GET_CODE (XEXP (*pterm, 0)) == EQ_ATTR)
3000 if (XSTR (exp, 0) != XSTR (XEXP (*pterm, 0), 0))
3003 if (! strcmp (XSTR (exp, 1), XSTR (XEXP (*pterm, 0), 1)))
3009 else if (GET_CODE (exp) == NOT && GET_CODE (*pterm) == NOT)
3011 if (attr_equal_p (XEXP (exp, 0), XEXP (*pterm, 0)))
3015 else if (GET_CODE (exp) == NOT)
3017 if (attr_equal_p (XEXP (exp, 0), *pterm))
3021 else if (GET_CODE (*pterm) == NOT)
3023 if (attr_equal_p (XEXP (*pterm, 0), exp))
3027 else if (attr_equal_p (exp, *pterm))
3033 /* Similar to `simplify_and_tree', but for IOR trees. */
3036 simplify_or_tree (exp, pterm, insn_code, insn_index)
3039 int insn_code, insn_index;
3044 int left_eliminates_term, right_eliminates_term;
3046 if (GET_CODE (exp) == IOR)
3048 left = simplify_or_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
3049 right = simplify_or_tree (XEXP (exp, 1), pterm, insn_code, insn_index);
3050 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3052 newexp = attr_rtx (GET_CODE (exp), left, right);
3054 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3058 else if (GET_CODE (exp) == AND)
3060 /* For the AND case, we do the same as above, except that we can
3061 only eliminate `term' if both sides of the AND would do so. */
3063 left = simplify_or_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
3064 left_eliminates_term = (temp == false_rtx);
3067 right = simplify_or_tree (XEXP (exp, 1), &temp, insn_code, insn_index);
3068 right_eliminates_term = (temp == false_rtx);
3070 if (left_eliminates_term && right_eliminates_term)
3073 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3075 newexp = attr_rtx (GET_CODE (exp), left, right);
3077 exp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3081 if (attr_equal_p (exp, *pterm))
3084 else if (GET_CODE (exp) == NOT && attr_equal_p (XEXP (exp, 0), *pterm))
3087 else if (GET_CODE (*pterm) == NOT && attr_equal_p (XEXP (*pterm, 0), exp))
3090 else if (GET_CODE (*pterm) == EQ_ATTR && GET_CODE (exp) == NOT
3091 && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
3092 && XSTR (*pterm, 0) == XSTR (XEXP (exp, 0), 0))
3095 else if (GET_CODE (exp) == EQ_ATTR && GET_CODE (*pterm) == NOT
3096 && GET_CODE (XEXP (*pterm, 0)) == EQ_ATTR
3097 && XSTR (exp, 0) == XSTR (XEXP (*pterm, 0), 0))
3103 /* Given an expression, see if it can be simplified for a particular insn
3104 code based on the values of other attributes being tested. This can
3105 eliminate nested get_attr_... calls.
3107 Note that if an endless recursion is specified in the patterns, the
3108 optimization will loop. However, it will do so in precisely the cases where
3109 an infinite recursion loop could occur during compilation. It's better that
3113 simplify_test_exp (exp, insn_code, insn_index)
3115 int insn_code, insn_index;
3118 struct attr_desc *attr;
3119 struct attr_value *av;
3120 struct insn_ent *ie;
3123 char *spacer = (char *) obstack_finish (rtl_obstack);
3125 /* Don't re-simplify something we already simplified. */
3126 if (RTX_UNCHANGING_P (exp) || MEM_IN_STRUCT_P (exp))
3129 switch (GET_CODE (exp))
3132 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3133 SIMPLIFY_ALTERNATIVE (left);
3134 if (left == false_rtx)
3136 obstack_free (rtl_obstack, spacer);
3139 right = SIMPLIFY_TEST_EXP (XEXP (exp, 1), insn_code, insn_index);
3140 SIMPLIFY_ALTERNATIVE (right);
3141 if (left == false_rtx)
3143 obstack_free (rtl_obstack, spacer);
3147 /* If either side is an IOR and we have (eq_attr "alternative" ..")
3148 present on both sides, apply the distributive law since this will
3149 yield simplifications. */
3150 if ((GET_CODE (left) == IOR || GET_CODE (right) == IOR)
3151 && compute_alternative_mask (left, IOR)
3152 && compute_alternative_mask (right, IOR))
3154 if (GET_CODE (left) == IOR)
3161 newexp = attr_rtx (IOR,
3162 attr_rtx (AND, left, XEXP (right, 0)),
3163 attr_rtx (AND, left, XEXP (right, 1)));
3165 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3168 /* Try with the term on both sides. */
3169 right = simplify_and_tree (right, &left, insn_code, insn_index);
3170 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
3171 left = simplify_and_tree (left, &right, insn_code, insn_index);
3173 if (left == false_rtx || right == false_rtx)
3175 obstack_free (rtl_obstack, spacer);
3178 else if (left == true_rtx)
3182 else if (right == true_rtx)
3186 /* See if all or all but one of the insn's alternatives are specified
3187 in this tree. Optimize if so. */
3189 else if (insn_code >= 0
3190 && (GET_CODE (left) == AND
3191 || (GET_CODE (left) == NOT
3192 && GET_CODE (XEXP (left, 0)) == EQ_ATTR
3193 && XSTR (XEXP (left, 0), 0) == alternative_name)
3194 || GET_CODE (right) == AND
3195 || (GET_CODE (right) == NOT
3196 && GET_CODE (XEXP (right, 0)) == EQ_ATTR
3197 && XSTR (XEXP (right, 0), 0) == alternative_name)))
3199 i = compute_alternative_mask (exp, AND);
3200 if (i & ~insn_alternatives[insn_code])
3201 fatal ("Invalid alternative specified for pattern number %d",
3204 /* If all alternatives are excluded, this is false. */
3205 i ^= insn_alternatives[insn_code];
3208 else if ((i & (i - 1)) == 0 && insn_alternatives[insn_code] > 1)
3210 /* If just one excluded, AND a comparison with that one to the
3211 front of the tree. The others will be eliminated by
3212 optimization. We do not want to do this if the insn has one
3213 alternative and we have tested none of them! */
3214 left = make_alternative_compare (i);
3215 right = simplify_and_tree (exp, &left, insn_code, insn_index);
3216 newexp = attr_rtx (AND, left, right);
3218 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3222 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3224 newexp = attr_rtx (AND, left, right);
3225 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3230 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3231 SIMPLIFY_ALTERNATIVE (left);
3232 if (left == true_rtx)
3234 obstack_free (rtl_obstack, spacer);
3237 right = SIMPLIFY_TEST_EXP (XEXP (exp, 1), insn_code, insn_index);
3238 SIMPLIFY_ALTERNATIVE (right);
3239 if (right == true_rtx)
3241 obstack_free (rtl_obstack, spacer);
3245 right = simplify_or_tree (right, &left, insn_code, insn_index);
3246 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
3247 left = simplify_or_tree (left, &right, insn_code, insn_index);
3249 if (right == true_rtx || left == true_rtx)
3251 obstack_free (rtl_obstack, spacer);
3254 else if (left == false_rtx)
3258 else if (right == false_rtx)
3263 /* Test for simple cases where the distributive law is useful. I.e.,
3264 convert (ior (and (x) (y))
3270 else if (GET_CODE (left) == AND && GET_CODE (right) == AND
3271 && attr_equal_p (XEXP (left, 0), XEXP (right, 0)))
3273 newexp = attr_rtx (IOR, XEXP (left, 1), XEXP (right, 1));
3275 left = XEXP (left, 0);
3277 newexp = attr_rtx (AND, left, right);
3278 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3281 /* See if all or all but one of the insn's alternatives are specified
3282 in this tree. Optimize if so. */
3284 else if (insn_code >= 0
3285 && (GET_CODE (left) == IOR
3286 || (GET_CODE (left) == EQ_ATTR
3287 && XSTR (left, 0) == alternative_name)
3288 || GET_CODE (right) == IOR
3289 || (GET_CODE (right) == EQ_ATTR
3290 && XSTR (right, 0) == alternative_name)))
3292 i = compute_alternative_mask (exp, IOR);
3293 if (i & ~insn_alternatives[insn_code])
3294 fatal ("Invalid alternative specified for pattern number %d",
3297 /* If all alternatives are included, this is true. */
3298 i ^= insn_alternatives[insn_code];
3301 else if ((i & (i - 1)) == 0 && insn_alternatives[insn_code] > 1)
3303 /* If just one excluded, IOR a comparison with that one to the
3304 front of the tree. The others will be eliminated by
3305 optimization. We do not want to do this if the insn has one
3306 alternative and we have tested none of them! */
3307 left = make_alternative_compare (i);
3308 right = simplify_and_tree (exp, &left, insn_code, insn_index);
3309 newexp = attr_rtx (IOR, attr_rtx (NOT, left), right);
3311 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3315 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
3317 newexp = attr_rtx (IOR, left, right);
3318 return SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3323 if (GET_CODE (XEXP (exp, 0)) == NOT)
3325 left = SIMPLIFY_TEST_EXP (XEXP (XEXP (exp, 0), 0),
3326 insn_code, insn_index);
3327 SIMPLIFY_ALTERNATIVE (left);
3331 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
3332 SIMPLIFY_ALTERNATIVE (left);
3333 if (GET_CODE (left) == NOT)
3334 return XEXP (left, 0);
3336 if (left == false_rtx)
3338 obstack_free (rtl_obstack, spacer);
3341 else if (left == true_rtx)
3343 obstack_free (rtl_obstack, spacer);
3347 /* Try to apply De`Morgan's laws. */
3348 else if (GET_CODE (left) == IOR)
3350 newexp = attr_rtx (AND,
3351 attr_rtx (NOT, XEXP (left, 0)),
3352 attr_rtx (NOT, XEXP (left, 1)));
3354 newexp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3356 else if (GET_CODE (left) == AND)
3358 newexp = attr_rtx (IOR,
3359 attr_rtx (NOT, XEXP (left, 0)),
3360 attr_rtx (NOT, XEXP (left, 1)));
3362 newexp = SIMPLIFY_TEST_EXP (newexp, insn_code, insn_index);
3364 else if (left != XEXP (exp, 0))
3366 newexp = attr_rtx (NOT, left);
3371 if (current_alternative_string && XSTR (exp, 0) == alternative_name)
3372 return (XSTR (exp, 1) == current_alternative_string
3373 ? true_rtx : false_rtx);
3375 /* Look at the value for this insn code in the specified attribute.
3376 We normally can replace this comparison with the condition that
3377 would give this insn the values being tested for. */
3378 if (XSTR (exp, 0) != alternative_name
3379 && (attr = find_attr (XSTR (exp, 0), 0)) != NULL)
3380 for (av = attr->first_value; av; av = av->next)
3381 for (ie = av->first_insn; ie; ie = ie->next)
3382 if (ie->insn_code == insn_code)
3383 return evaluate_eq_attr (exp, av->value, insn_code, insn_index);
3390 /* We have already simplified this expression. Simplifying it again
3391 won't buy anything unless we weren't given a valid insn code
3392 to process (i.e., we are canonicalizing something.). */
3393 if (insn_code != -2 /* Seems wrong: && current_alternative_string. */
3394 && ! RTX_UNCHANGING_P (newexp))
3395 return copy_rtx_unchanging (newexp);
3400 /* Optimize the attribute lists by seeing if we can determine conditional
3401 values from the known values of other attributes. This will save subroutine
3402 calls during the compilation. */
3407 struct attr_desc *attr;
3408 struct attr_value *av;
3409 struct insn_ent *ie;
3411 int something_changed = 1;
3413 struct attr_value_list { struct attr_value *av;
3414 struct insn_ent *ie;
3415 struct attr_desc * attr;
3416 struct attr_value_list *next; };
3417 struct attr_value_list **insn_code_values;
3418 struct attr_value_list *ivbuf;
3419 struct attr_value_list *iv;
3421 /* For each insn code, make a list of all the insn_ent's for it,
3422 for all values for all attributes. */
3424 if (num_insn_ents == 0)
3427 /* Make 2 extra elements, for "code" values -2 and -1. */
3429 = (struct attr_value_list **) alloca ((insn_code_number + 2)
3430 * sizeof (struct attr_value_list *));
3431 bzero ((char *) insn_code_values,
3432 (insn_code_number + 2) * sizeof (struct attr_value_list *));
3434 /* Offset the table address so we can index by -2 or -1. */
3435 insn_code_values += 2;
3437 /* Allocate the attr_value_list structures using xmalloc rather than
3438 alloca, because using alloca can overflow the maximum permitted
3439 stack limit on SPARC Lynx. */
3440 iv = ivbuf = ((struct attr_value_list *)
3441 xmalloc (num_insn_ents * sizeof (struct attr_value_list)));
3443 for (i = 0; i < MAX_ATTRS_INDEX; i++)
3444 for (attr = attrs[i]; attr; attr = attr->next)
3445 for (av = attr->first_value; av; av = av->next)
3446 for (ie = av->first_insn; ie; ie = ie->next)
3451 iv->next = insn_code_values[ie->insn_code];
3452 insn_code_values[ie->insn_code] = iv;
3456 /* Sanity check on num_insn_ents. */
3457 if (iv != ivbuf + num_insn_ents)
3460 /* Process one insn code at a time. */
3461 for (i = -2; i < insn_code_number; i++)
3463 /* Clear the MEM_IN_STRUCT_P flag everywhere relevant.
3464 We use it to mean "already simplified for this insn". */
3465 for (iv = insn_code_values[i]; iv; iv = iv->next)
3466 clear_struct_flag (iv->av->value);
3468 /* Loop until nothing changes for one iteration. */
3469 something_changed = 1;
3470 while (something_changed)
3472 something_changed = 0;
3473 for (iv = insn_code_values[i]; iv; iv = iv->next)
3475 struct obstack *old = rtl_obstack;
3476 char *spacer = (char *) obstack_finish (temp_obstack);
3481 if (GET_CODE (av->value) != COND)
3484 rtl_obstack = temp_obstack;
3485 #if 0 /* This was intended as a speed up, but it was slower. */
3486 if (insn_n_alternatives[ie->insn_code] > 6
3487 && count_sub_rtxs (av->value, 200) >= 200)
3488 newexp = simplify_by_alternatives (av->value, ie->insn_code,
3492 newexp = simplify_cond (av->value, ie->insn_code,
3496 if (newexp != av->value)
3498 newexp = attr_copy_rtx (newexp);
3499 remove_insn_ent (av, ie);
3500 av = get_attr_value (newexp, attr, ie->insn_code);
3502 insert_insn_ent (av, ie);
3503 something_changed = 1;
3505 obstack_free (temp_obstack, spacer);
3515 simplify_by_alternatives (exp, insn_code, insn_index)
3517 int insn_code, insn_index;
3520 int len = insn_n_alternatives[insn_code];
3521 rtx newexp = rtx_alloc (COND);
3525 XVEC (newexp, 0) = rtvec_alloc (len * 2);
3527 /* It will not matter what value we use as the default value
3528 of the new COND, since that default will never be used.
3529 Choose something of the right type. */
3530 for (ultimate = exp; GET_CODE (ultimate) == COND;)
3531 ultimate = XEXP (ultimate, 1);
3532 XEXP (newexp, 1) = ultimate;
3534 for (i = 0; i < insn_n_alternatives[insn_code]; i++)
3536 current_alternative_string = attr_numeral (i);
3537 XVECEXP (newexp, 0, i * 2) = make_alternative_compare (1 << i);
3538 XVECEXP (newexp, 0, i * 2 + 1)
3539 = simplify_cond (exp, insn_code, insn_index);
3542 current_alternative_string = 0;
3543 return simplify_cond (newexp, insn_code, insn_index);
3547 /* If EXP is a suitable expression, reorganize it by constructing an
3548 equivalent expression that is a COND with the tests being all combinations
3549 of attribute values and the values being simple constants. */
3552 simplify_by_exploding (exp)
3555 rtx list = 0, link, condexp, defval;
3556 struct dimension *space;
3557 rtx *condtest, *condval;
3558 int i, j, total, ndim = 0;
3559 int most_tests, num_marks, new_marks;
3561 /* Locate all the EQ_ATTR expressions. */
3562 if (! find_and_mark_used_attributes (exp, &list, &ndim) || ndim == 0)
3564 unmark_used_attributes (list, 0, 0);
3568 /* Create an attribute space from the list of used attributes. For each
3569 dimension in the attribute space, record the attribute, list of values
3570 used, and number of values used. Add members to the list of values to
3571 cover the domain of the attribute. This makes the expanded COND form
3572 order independent. */
3574 space = (struct dimension *) alloca (ndim * sizeof (struct dimension));
3577 for (ndim = 0; list; ndim++)
3579 /* Pull the first attribute value from the list and record that
3580 attribute as another dimension in the attribute space. */
3581 char *name = XSTR (XEXP (list, 0), 0);
3584 if ((space[ndim].attr = find_attr (name, 0)) == 0
3585 || space[ndim].attr->is_numeric)
3587 unmark_used_attributes (list, space, ndim);
3591 /* Add all remaining attribute values that refer to this attribute. */
3592 space[ndim].num_values = 0;
3593 space[ndim].values = 0;
3595 for (link = list; link; link = *prev)
3596 if (! strcmp (XSTR (XEXP (link, 0), 0), name))
3598 space[ndim].num_values++;
3599 *prev = XEXP (link, 1);
3600 XEXP (link, 1) = space[ndim].values;
3601 space[ndim].values = link;
3604 prev = &XEXP (link, 1);
3606 /* Add sufficient members to the list of values to make the list
3607 mutually exclusive and record the total size of the attribute
3609 total *= add_values_to_cover (&space[ndim]);
3612 /* Sort the attribute space so that the attributes go from non-constant
3613 to constant and from most values to least values. */
3614 for (i = 0; i < ndim; i++)
3615 for (j = ndim - 1; j > i; j--)
3616 if ((space[j-1].attr->is_const && !space[j].attr->is_const)
3617 || space[j-1].num_values < space[j].num_values)
3619 struct dimension tmp;
3621 space[j] = space[j-1];
3625 /* Establish the initial current value. */
3626 for (i = 0; i < ndim; i++)
3627 space[i].current_value = space[i].values;
3629 condtest = (rtx *) alloca (total * sizeof (rtx));
3630 condval = (rtx *) alloca (total * sizeof (rtx));
3632 /* Expand the tests and values by iterating over all values in the
3636 condtest[i] = test_for_current_value (space, ndim);
3637 condval[i] = simplify_with_current_value (exp, space, ndim);
3638 if (! increment_current_value (space, ndim))
3644 /* We are now finished with the original expression. */
3645 unmark_used_attributes (0, space, ndim);
3647 /* Find the most used constant value and make that the default. */
3649 for (i = num_marks = 0; i < total; i++)
3650 if (GET_CODE (condval[i]) == CONST_STRING
3651 && ! MEM_VOLATILE_P (condval[i]))
3653 /* Mark the unmarked constant value and count how many are marked. */
3654 MEM_VOLATILE_P (condval[i]) = 1;
3655 for (j = new_marks = 0; j < total; j++)
3656 if (GET_CODE (condval[j]) == CONST_STRING
3657 && MEM_VOLATILE_P (condval[j]))
3659 if (new_marks - num_marks > most_tests)
3661 most_tests = new_marks - num_marks;
3662 defval = condval[i];
3664 num_marks = new_marks;
3666 /* Clear all the marks. */
3667 for (i = 0; i < total; i++)
3668 MEM_VOLATILE_P (condval[i]) = 0;
3670 /* Give up if nothing is constant. */
3674 /* If all values are the default, use that. */
3675 if (total == most_tests)
3678 /* Make a COND with the most common constant value the default. (A more
3679 complex method where tests with the same value were combined didn't
3680 seem to improve things.) */
3681 condexp = rtx_alloc (COND);
3682 XVEC (condexp, 0) = rtvec_alloc ((total - most_tests) * 2);
3683 XEXP (condexp, 1) = defval;
3684 for (i = j = 0; i < total; i++)
3685 if (condval[i] != defval)
3687 XVECEXP (condexp, 0, 2 * j) = condtest[i];
3688 XVECEXP (condexp, 0, 2 * j + 1) = condval[i];
3695 /* Set the MEM_VOLATILE_P flag for all EQ_ATTR expressions in EXP and
3696 verify that EXP can be simplified to a constant term if all the EQ_ATTR
3697 tests have known value. */
3700 find_and_mark_used_attributes (exp, terms, nterms)
3706 switch (GET_CODE (exp))
3709 if (! MEM_VOLATILE_P (exp))
3711 rtx link = rtx_alloc (EXPR_LIST);
3712 XEXP (link, 0) = exp;
3713 XEXP (link, 1) = *terms;
3716 MEM_VOLATILE_P (exp) = 1;
3723 if (! find_and_mark_used_attributes (XEXP (exp, 2), terms, nterms))
3727 if (! find_and_mark_used_attributes (XEXP (exp, 1), terms, nterms))
3730 if (! find_and_mark_used_attributes (XEXP (exp, 0), terms, nterms))
3735 for (i = 0; i < XVECLEN (exp, 0); i++)
3736 if (! find_and_mark_used_attributes (XVECEXP (exp, 0, i), terms, nterms))
3738 if (! find_and_mark_used_attributes (XEXP (exp, 1), terms, nterms))
3747 /* Clear the MEM_VOLATILE_P flag in all EQ_ATTR expressions on LIST and
3748 in the values of the NDIM-dimensional attribute space SPACE. */
3751 unmark_used_attributes (list, space, ndim)
3753 struct dimension *space;
3759 for (i = 0; i < ndim; i++)
3760 unmark_used_attributes (space[i].values, 0, 0);
3762 for (link = list; link; link = XEXP (link, 1))
3764 exp = XEXP (link, 0);
3765 if (GET_CODE (exp) == EQ_ATTR)
3766 MEM_VOLATILE_P (exp) = 0;
3770 /* Update the attribute dimension DIM so that all values of the attribute
3771 are tested. Return the updated number of values. */
3774 add_values_to_cover (dim)
3775 struct dimension *dim;
3777 struct attr_value *av;
3778 rtx exp, link, *prev;
3781 for (av = dim->attr->first_value; av; av = av->next)
3782 if (GET_CODE (av->value) == CONST_STRING)
3785 if (nalt < dim->num_values)
3787 else if (nalt == dim->num_values)
3789 else if (nalt * 2 < dim->num_values * 3)
3791 /* Most all the values of the attribute are used, so add all the unused
3793 prev = &dim->values;
3794 for (link = dim->values; link; link = *prev)
3795 prev = &XEXP (link, 1);
3797 for (av = dim->attr->first_value; av; av = av->next)
3798 if (GET_CODE (av->value) == CONST_STRING)
3800 exp = attr_eq (dim->attr->name, XSTR (av->value, 0));
3801 if (MEM_VOLATILE_P (exp))
3804 link = rtx_alloc (EXPR_LIST);
3805 XEXP (link, 0) = exp;
3808 prev = &XEXP (link, 1);
3810 dim->num_values = nalt;
3814 rtx orexp = false_rtx;
3816 /* Very few values are used, so compute a mutually exclusive
3817 expression. (We could do this for numeric values if that becomes
3819 prev = &dim->values;
3820 for (link = dim->values; link; link = *prev)
3822 orexp = insert_right_side (IOR, orexp, XEXP (link, 0), -2, -2);
3823 prev = &XEXP (link, 1);
3825 link = rtx_alloc (EXPR_LIST);
3826 XEXP (link, 0) = attr_rtx (NOT, orexp);
3831 return dim->num_values;
3834 /* Increment the current value for the NDIM-dimensional attribute space SPACE
3835 and return FALSE if the increment overflowed. */
3838 increment_current_value (space, ndim)
3839 struct dimension *space;
3844 for (i = ndim - 1; i >= 0; i--)
3846 if ((space[i].current_value = XEXP (space[i].current_value, 1)) == 0)
3847 space[i].current_value = space[i].values;
3854 /* Construct an expression corresponding to the current value for the
3855 NDIM-dimensional attribute space SPACE. */
3858 test_for_current_value (space, ndim)
3859 struct dimension *space;
3865 for (i = 0; i < ndim; i++)
3866 exp = insert_right_side (AND, exp, XEXP (space[i].current_value, 0),
3872 /* Given the current value of the NDIM-dimensional attribute space SPACE,
3873 set the corresponding EQ_ATTR expressions to that value and reduce
3874 the expression EXP as much as possible. On input [and output], all
3875 known EQ_ATTR expressions are set to FALSE. */
3878 simplify_with_current_value (exp, space, ndim)
3880 struct dimension *space;
3886 /* Mark each current value as TRUE. */
3887 for (i = 0; i < ndim; i++)
3889 x = XEXP (space[i].current_value, 0);
3890 if (GET_CODE (x) == EQ_ATTR)
3891 MEM_VOLATILE_P (x) = 0;
3894 exp = simplify_with_current_value_aux (exp);
3896 /* Change each current value back to FALSE. */
3897 for (i = 0; i < ndim; i++)
3899 x = XEXP (space[i].current_value, 0);
3900 if (GET_CODE (x) == EQ_ATTR)
3901 MEM_VOLATILE_P (x) = 1;
3907 /* Reduce the expression EXP based on the MEM_VOLATILE_P settings of
3908 all EQ_ATTR expressions. */
3911 simplify_with_current_value_aux (exp)
3917 switch (GET_CODE (exp))
3920 if (MEM_VOLATILE_P (exp))
3929 cond = simplify_with_current_value_aux (XEXP (exp, 0));
3930 if (cond == true_rtx)
3931 return simplify_with_current_value_aux (XEXP (exp, 1));
3932 else if (cond == false_rtx)
3933 return simplify_with_current_value_aux (XEXP (exp, 2));
3935 return attr_rtx (IF_THEN_ELSE, cond,
3936 simplify_with_current_value_aux (XEXP (exp, 1)),
3937 simplify_with_current_value_aux (XEXP (exp, 2)));
3940 cond = simplify_with_current_value_aux (XEXP (exp, 1));
3941 if (cond == true_rtx)
3943 else if (cond == false_rtx)
3944 return simplify_with_current_value_aux (XEXP (exp, 0));
3946 return attr_rtx (IOR, cond,
3947 simplify_with_current_value_aux (XEXP (exp, 0)));
3950 cond = simplify_with_current_value_aux (XEXP (exp, 1));
3951 if (cond == true_rtx)
3952 return simplify_with_current_value_aux (XEXP (exp, 0));
3953 else if (cond == false_rtx)
3956 return attr_rtx (AND, cond,
3957 simplify_with_current_value_aux (XEXP (exp, 0)));
3960 cond = simplify_with_current_value_aux (XEXP (exp, 0));
3961 if (cond == true_rtx)
3963 else if (cond == false_rtx)
3966 return attr_rtx (NOT, cond);
3969 for (i = 0; i < XVECLEN (exp, 0); i += 2)
3971 cond = simplify_with_current_value_aux (XVECEXP (exp, 0, i));
3972 if (cond == true_rtx)
3973 return simplify_with_current_value_aux (XVECEXP (exp, 0, i + 1));
3974 else if (cond == false_rtx)
3977 abort (); /* With all EQ_ATTR's of known value, a case should
3978 have been selected. */
3980 return simplify_with_current_value_aux (XEXP (exp, 1));
3987 /* Clear the MEM_IN_STRUCT_P flag in EXP and its subexpressions. */
3990 clear_struct_flag (x)
3995 register enum rtx_code code;
3998 MEM_IN_STRUCT_P (x) = 0;
3999 if (RTX_UNCHANGING_P (x))
4002 code = GET_CODE (x);
4022 /* Compare the elements. If any pair of corresponding elements
4023 fail to match, return 0 for the whole things. */
4025 fmt = GET_RTX_FORMAT (code);
4026 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
4032 for (j = 0; j < XVECLEN (x, i); j++)
4033 clear_struct_flag (XVECEXP (x, i, j));
4037 clear_struct_flag (XEXP (x, i));
4043 /* Return the number of RTX objects making up the expression X.
4044 But if we count more more than MAX objects, stop counting. */
4047 count_sub_rtxs (x, max)
4053 register enum rtx_code code;
4057 code = GET_CODE (x);
4077 /* Compare the elements. If any pair of corresponding elements
4078 fail to match, return 0 for the whole things. */
4080 fmt = GET_RTX_FORMAT (code);
4081 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
4090 for (j = 0; j < XVECLEN (x, i); j++)
4091 total += count_sub_rtxs (XVECEXP (x, i, j), max);
4095 total += count_sub_rtxs (XEXP (x, i), max);
4103 /* Create table entries for DEFINE_ATTR. */
4109 struct attr_desc *attr;
4110 struct attr_value *av;
4114 /* Make a new attribute structure. Check for duplicate by looking at
4115 attr->default_val, since it is initialized by this routine. */
4116 attr = find_attr (XSTR (exp, 0), 1);
4117 if (attr->default_val)
4118 fatal ("Duplicate definition for `%s' attribute", attr->name);
4120 if (*XSTR (exp, 1) == '\0')
4121 attr->is_numeric = 1;
4124 name_ptr = XSTR (exp, 1);
4125 while ((p = next_comma_elt (&name_ptr)) != NULL)
4127 av = (struct attr_value *) oballoc (sizeof (struct attr_value));
4128 av->value = attr_rtx (CONST_STRING, p);
4129 av->next = attr->first_value;
4130 attr->first_value = av;
4131 av->first_insn = NULL;
4133 av->has_asm_insn = 0;
4137 if (GET_CODE (XEXP (exp, 2)) == CONST)
4140 if (attr->is_numeric)
4141 fatal ("Constant attributes may not take numeric values");
4142 /* Get rid of the CONST node. It is allowed only at top-level. */
4143 XEXP (exp, 2) = XEXP (XEXP (exp, 2), 0);
4146 if (! strcmp (attr->name, "length") && ! attr->is_numeric)
4147 fatal ("`length' attribute must take numeric values");
4149 /* Set up the default value. */
4150 XEXP (exp, 2) = check_attr_value (XEXP (exp, 2), attr);
4151 attr->default_val = get_attr_value (XEXP (exp, 2), attr, -2);
4154 /* Given a pattern for DEFINE_PEEPHOLE or DEFINE_INSN, return the number of
4155 alternatives in the constraints. Assume all MATCH_OPERANDs have the same
4156 number of alternatives as this should be checked elsewhere. */
4159 count_alternatives (exp)
4165 if (GET_CODE (exp) == MATCH_OPERAND)
4166 return n_comma_elts (XSTR (exp, 2));
4168 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4169 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4174 n = count_alternatives (XEXP (exp, i));
4181 if (XVEC (exp, i) != NULL)
4182 for (j = 0; j < XVECLEN (exp, i); j++)
4184 n = count_alternatives (XVECEXP (exp, i, j));
4193 /* Returns non-zero if the given expression contains an EQ_ATTR with the
4194 `alternative' attribute. */
4197 compares_alternatives_p (exp)
4203 if (GET_CODE (exp) == EQ_ATTR && XSTR (exp, 0) == alternative_name)
4206 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4207 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4212 if (compares_alternatives_p (XEXP (exp, i)))
4217 for (j = 0; j < XVECLEN (exp, i); j++)
4218 if (compares_alternatives_p (XVECEXP (exp, i, j)))
4226 /* Returns non-zero is INNER is contained in EXP. */
4229 contained_in_p (inner, exp)
4236 if (rtx_equal_p (inner, exp))
4239 for (i = 0, fmt = GET_RTX_FORMAT (GET_CODE (exp));
4240 i < GET_RTX_LENGTH (GET_CODE (exp)); i++)
4245 if (contained_in_p (inner, XEXP (exp, i)))
4250 for (j = 0; j < XVECLEN (exp, i); j++)
4251 if (contained_in_p (inner, XVECEXP (exp, i, j)))
4259 /* Process DEFINE_PEEPHOLE, DEFINE_INSN, and DEFINE_ASM_ATTRIBUTES. */
4265 struct insn_def *id;
4267 id = (struct insn_def *) oballoc (sizeof (struct insn_def));
4272 switch (GET_CODE (exp))
4275 id->insn_code = insn_code_number++;
4276 id->insn_index = insn_index_number++;
4277 id->num_alternatives = count_alternatives (exp);
4278 if (id->num_alternatives == 0)
4279 id->num_alternatives = 1;
4283 case DEFINE_PEEPHOLE:
4284 id->insn_code = insn_code_number++;
4285 id->insn_index = insn_index_number++;
4286 id->num_alternatives = count_alternatives (exp);
4287 if (id->num_alternatives == 0)
4288 id->num_alternatives = 1;
4292 case DEFINE_ASM_ATTRIBUTES:
4294 id->insn_index = -1;
4295 id->num_alternatives = 1;
4297 got_define_asm_attributes = 1;
4305 /* Process a DEFINE_DELAY. Validate the vector length, check if annul
4306 true or annul false is specified, and make a `struct delay_desc'. */
4312 struct delay_desc *delay;
4315 if (XVECLEN (def, 1) % 3 != 0)
4316 fatal ("Number of elements in DEFINE_DELAY must be multiple of three.");
4318 for (i = 0; i < XVECLEN (def, 1); i += 3)
4320 if (XVECEXP (def, 1, i + 1))
4321 have_annul_true = 1;
4322 if (XVECEXP (def, 1, i + 2))
4323 have_annul_false = 1;
4326 delay = (struct delay_desc *) oballoc (sizeof (struct delay_desc));
4328 delay->num = ++num_delays;
4329 delay->next = delays;
4333 /* Process a DEFINE_FUNCTION_UNIT.
4335 This gives information about a function unit contained in the CPU.
4336 We fill in a `struct function_unit_op' and a `struct function_unit'
4337 with information used later by `expand_unit'. */
4343 struct function_unit *unit;
4344 struct function_unit_op *op;
4345 char *name = XSTR (def, 0);
4346 int multiplicity = XINT (def, 1);
4347 int simultaneity = XINT (def, 2);
4348 rtx condexp = XEXP (def, 3);
4349 int ready_cost = MAX (XINT (def, 4), 1);
4350 int issue_delay = MAX (XINT (def, 5), 1);
4352 /* See if we have already seen this function unit. If so, check that
4353 the multiplicity and simultaneity values are the same. If not, make
4354 a structure for this function unit. */
4355 for (unit = units; unit; unit = unit->next)
4356 if (! strcmp (unit->name, name))
4358 if (unit->multiplicity != multiplicity
4359 || unit->simultaneity != simultaneity)
4360 fatal ("Differing specifications given for `%s' function unit.",
4367 unit = (struct function_unit *) oballoc (sizeof (struct function_unit));
4369 unit->multiplicity = multiplicity;
4370 unit->simultaneity = simultaneity;
4371 unit->issue_delay.min = unit->issue_delay.max = issue_delay;
4372 unit->num = num_units++;
4373 unit->num_opclasses = 0;
4374 unit->condexp = false_rtx;
4380 /* Make a new operation class structure entry and initialize it. */
4381 op = (struct function_unit_op *) oballoc (sizeof (struct function_unit_op));
4382 op->condexp = condexp;
4383 op->num = unit->num_opclasses++;
4384 op->ready = ready_cost;
4385 op->issue_delay = issue_delay;
4386 op->next = unit->ops;
4388 num_unit_opclasses++;
4390 /* Set our issue expression based on whether or not an optional conflict
4391 vector was specified. */
4394 /* Compute the IOR of all the specified expressions. */
4395 rtx orexp = false_rtx;
4398 for (i = 0; i < XVECLEN (def, 6); i++)
4399 orexp = insert_right_side (IOR, orexp, XVECEXP (def, 6, i), -2, -2);
4401 op->conflict_exp = orexp;
4402 extend_range (&unit->issue_delay, 1, issue_delay);
4406 op->conflict_exp = true_rtx;
4407 extend_range (&unit->issue_delay, issue_delay, issue_delay);
4410 /* Merge our conditional into that of the function unit so we can determine
4411 which insns are used by the function unit. */
4412 unit->condexp = insert_right_side (IOR, unit->condexp, op->condexp, -2, -2);
4415 /* Given a piece of RTX, print a C expression to test it's truth value.
4417 We use AND and IOR both for logical and bit-wise operations, so
4418 interpret them as logical unless they are inside a comparison expression.
4419 The first bit of FLAGS will be non-zero in that case.
4421 Set the second bit of FLAGS to make references to attribute values use
4422 a cached local variable instead of calling a function. */
4425 write_test_expr (exp, flags)
4429 int comparison_operator = 0;
4431 struct attr_desc *attr;
4433 /* In order not to worry about operator precedence, surround our part of
4434 the expression with parentheses. */
4437 code = GET_CODE (exp);
4440 /* Binary operators. */
4442 case GE: case GT: case GEU: case GTU:
4443 case LE: case LT: case LEU: case LTU:
4444 comparison_operator = 1;
4446 case PLUS: case MINUS: case MULT: case DIV: case MOD:
4447 case AND: case IOR: case XOR:
4448 case ASHIFT: case LSHIFTRT: case ASHIFTRT:
4449 write_test_expr (XEXP (exp, 0), flags | comparison_operator);
4465 printf (" >= (unsigned) ");
4468 printf (" > (unsigned) ");
4477 printf (" <= (unsigned) ");
4480 printf (" < (unsigned) ");
4523 write_test_expr (XEXP (exp, 1), flags | comparison_operator);
4527 /* Special-case (not (eq_attrq "alternative" "x")) */
4528 if (! (flags & 1) && GET_CODE (XEXP (exp, 0)) == EQ_ATTR
4529 && XSTR (XEXP (exp, 0), 0) == alternative_name)
4531 printf ("which_alternative != %s", XSTR (XEXP (exp, 0), 1));
4535 /* Otherwise, fall through to normal unary operator. */
4537 /* Unary operators. */
4557 write_test_expr (XEXP (exp, 0), flags);
4560 /* Comparison test of an attribute with a value. Most of these will
4561 have been removed by optimization. Handle "alternative"
4562 specially and give error if EQ_ATTR present inside a comparison. */
4565 fatal ("EQ_ATTR not valid inside comparison");
4567 if (XSTR (exp, 0) == alternative_name)
4569 printf ("which_alternative == %s", XSTR (exp, 1));
4573 attr = find_attr (XSTR (exp, 0), 0);
4574 if (! attr) abort ();
4576 /* Now is the time to expand the value of a constant attribute. */
4579 write_test_expr (evaluate_eq_attr (exp, attr->default_val->value,
4586 printf ("attr_%s", attr->name);
4588 printf ("get_attr_%s (insn)", attr->name);
4590 write_attr_valueq (attr, XSTR (exp, 1));
4594 /* Comparison test of flags for define_delays. */
4597 fatal ("ATTR_FLAG not valid inside comparison");
4598 printf ("(flags & ATTR_FLAG_%s) != 0", XSTR (exp, 0));
4601 /* See if an operand matches a predicate. */
4603 /* If only a mode is given, just ensure the mode matches the operand.
4604 If neither a mode nor predicate is given, error. */
4605 if (XSTR (exp, 1) == NULL || *XSTR (exp, 1) == '\0')
4607 if (GET_MODE (exp) == VOIDmode)
4608 fatal ("Null MATCH_OPERAND specified as test");
4610 printf ("GET_MODE (operands[%d]) == %smode",
4611 XINT (exp, 0), GET_MODE_NAME (GET_MODE (exp)));
4614 printf ("%s (operands[%d], %smode)",
4615 XSTR (exp, 1), XINT (exp, 0), GET_MODE_NAME (GET_MODE (exp)));
4618 /* Constant integer. */
4620 printf (HOST_WIDE_INT_PRINT_DEC, XWINT (exp, 0));
4623 /* A random C expression. */
4625 printf ("%s", XSTR (exp, 0));
4628 /* The address of the branch target. */
4630 printf ("insn_addresses[INSN_UID (GET_CODE (operands[%d]) == LABEL_REF ? XEXP (operands[%d], 0) : operands[%d])]",
4631 XINT (exp, 0), XINT (exp, 0), XINT (exp, 0));
4634 /* The address of the current insn. It would be more consistent with
4635 other usage to make this the address of the NEXT insn, but this gets
4636 too confusing because of the ambiguity regarding the length of the
4639 printf ("insn_current_address");
4643 printf ("%s", XSTR (exp, 0));
4647 write_test_expr (XEXP (exp, 0), flags & 2);
4649 write_test_expr (XEXP (exp, 1), flags | 1);
4651 write_test_expr (XEXP (exp, 2), flags | 1);
4655 fatal ("bad RTX code `%s' in attribute calculation\n",
4656 GET_RTX_NAME (code));
4662 /* Given an attribute value, return the maximum CONST_STRING argument
4663 encountered. It is assumed that they are all numeric. */
4666 max_attr_value (exp)
4669 int current_max = 0;
4673 if (GET_CODE (exp) == CONST_STRING)
4674 return atoi (XSTR (exp, 0));
4676 else if (GET_CODE (exp) == COND)
4678 for (i = 0; i < XVECLEN (exp, 0); i += 2)
4680 n = max_attr_value (XVECEXP (exp, 0, i + 1));
4681 if (n > current_max)
4685 n = max_attr_value (XEXP (exp, 1));
4686 if (n > current_max)
4690 else if (GET_CODE (exp) == IF_THEN_ELSE)
4692 current_max = max_attr_value (XEXP (exp, 1));
4693 n = max_attr_value (XEXP (exp, 2));
4694 if (n > current_max)
4704 /* Scan an attribute value, possibly a conditional, and record what actions
4705 will be required to do any conditional tests in it.
4708 `must_extract' if we need to extract the insn operands
4709 `must_constrain' if we must compute `which_alternative'
4710 `address_used' if an address expression was used
4711 `length_used' if an (eq_attr "length" ...) was used
4715 walk_attr_value (exp)
4725 code = GET_CODE (exp);
4729 if (! RTX_UNCHANGING_P (exp))
4730 /* Since this is an arbitrary expression, it can look at anything.
4731 However, constant expressions do not depend on any particular
4733 must_extract = must_constrain = 1;
4741 if (XSTR (exp, 0) == alternative_name)
4742 must_extract = must_constrain = 1;
4743 else if (strcmp (XSTR (exp, 0), "length") == 0)
4763 for (i = 0, fmt = GET_RTX_FORMAT (code); i < GET_RTX_LENGTH (code); i++)
4768 walk_attr_value (XEXP (exp, i));
4772 if (XVEC (exp, i) != NULL)
4773 for (j = 0; j < XVECLEN (exp, i); j++)
4774 walk_attr_value (XVECEXP (exp, i, j));
4779 /* Write out a function to obtain the attribute for a given INSN. */
4782 write_attr_get (attr)
4783 struct attr_desc *attr;
4785 struct attr_value *av, *common_av;
4787 /* Find the most used attribute value. Handle that as the `default' of the
4788 switch we will generate. */
4789 common_av = find_most_used (attr);
4791 /* Write out start of function, then all values with explicit `case' lines,
4792 then a `default', then the value with the most uses. */
4793 if (!attr->is_numeric)
4794 printf ("enum attr_%s\n", attr->name);
4795 else if (attr->unsigned_p)
4796 printf ("unsigned int\n");
4800 /* If the attribute name starts with a star, the remainder is the name of
4801 the subroutine to use, instead of `get_attr_...'. */
4802 if (attr->name[0] == '*')
4803 printf ("%s (insn)\n", &attr->name[1]);
4804 else if (attr->is_const == 0)
4805 printf ("get_attr_%s (insn)\n", attr->name);
4808 printf ("get_attr_%s ()\n", attr->name);
4811 for (av = attr->first_value; av; av = av->next)
4812 if (av->num_insns != 0)
4813 write_attr_set (attr, 2, av->value, "return", ";",
4814 true_rtx, av->first_insn->insn_code,
4815 av->first_insn->insn_index);
4821 printf (" rtx insn;\n");
4824 if (GET_CODE (common_av->value) == FFS)
4826 rtx p = XEXP (common_av->value, 0);
4828 /* No need to emit code to abort if the insn is unrecognized; the
4829 other get_attr_foo functions will do that when we call them. */
4831 write_toplevel_expr (p);
4833 printf ("\n if (accum && accum == (accum & -accum))\n");
4835 printf (" int i;\n");
4836 printf (" for (i = 0; accum >>= 1; ++i) continue;\n");
4837 printf (" accum = i;\n");
4838 printf (" }\n else\n");
4839 printf (" accum = ~accum;\n");
4840 printf (" return accum;\n}\n\n");
4844 printf (" switch (recog_memoized (insn))\n");
4847 for (av = attr->first_value; av; av = av->next)
4848 if (av != common_av)
4849 write_attr_case (attr, av, 1, "return", ";", 4, true_rtx);
4851 write_attr_case (attr, common_av, 0, "return", ";", 4, true_rtx);
4852 printf (" }\n}\n\n");
4856 /* Given an AND tree of known true terms (because we are inside an `if' with
4857 that as the condition or are in an `else' clause) and an expression,
4858 replace any known true terms with TRUE. Use `simplify_and_tree' to do
4859 the bulk of the work. */
4862 eliminate_known_true (known_true, exp, insn_code, insn_index)
4865 int insn_code, insn_index;
4869 known_true = SIMPLIFY_TEST_EXP (known_true, insn_code, insn_index);
4871 if (GET_CODE (known_true) == AND)
4873 exp = eliminate_known_true (XEXP (known_true, 0), exp,
4874 insn_code, insn_index);
4875 exp = eliminate_known_true (XEXP (known_true, 1), exp,
4876 insn_code, insn_index);
4881 exp = simplify_and_tree (exp, &term, insn_code, insn_index);
4887 /* Write out a series of tests and assignment statements to perform tests and
4888 sets of an attribute value. We are passed an indentation amount and prefix
4889 and suffix strings to write around each attribute value (e.g., "return"
4893 write_attr_set (attr, indent, value, prefix, suffix, known_true,
4894 insn_code, insn_index)
4895 struct attr_desc *attr;
4901 int insn_code, insn_index;
4903 if (GET_CODE (value) == CONST_STRING)
4905 write_indent (indent);
4906 printf ("%s ", prefix);
4907 write_attr_value (attr, value);
4908 printf ("%s\n", suffix);
4910 else if (GET_CODE (value) == COND)
4912 /* Assume the default value will be the default of the COND unless we
4913 find an always true expression. */
4914 rtx default_val = XEXP (value, 1);
4915 rtx our_known_true = known_true;
4920 for (i = 0; i < XVECLEN (value, 0); i += 2)
4925 testexp = eliminate_known_true (our_known_true,
4926 XVECEXP (value, 0, i),
4927 insn_code, insn_index);
4928 newexp = attr_rtx (NOT, testexp);
4929 newexp = insert_right_side (AND, our_known_true, newexp,
4930 insn_code, insn_index);
4932 /* If the test expression is always true or if the next `known_true'
4933 expression is always false, this is the last case, so break
4934 out and let this value be the `else' case. */
4935 if (testexp == true_rtx || newexp == false_rtx)
4937 default_val = XVECEXP (value, 0, i + 1);
4941 /* Compute the expression to pass to our recursive call as being
4943 inner_true = insert_right_side (AND, our_known_true,
4944 testexp, insn_code, insn_index);
4946 /* If this is always false, skip it. */
4947 if (inner_true == false_rtx)
4950 write_indent (indent);
4951 printf ("%sif ", first_if ? "" : "else ");
4953 write_test_expr (testexp, 0);
4955 write_indent (indent + 2);
4958 write_attr_set (attr, indent + 4,
4959 XVECEXP (value, 0, i + 1), prefix, suffix,
4960 inner_true, insn_code, insn_index);
4961 write_indent (indent + 2);
4963 our_known_true = newexp;
4968 write_indent (indent);
4970 write_indent (indent + 2);
4974 write_attr_set (attr, first_if ? indent : indent + 4, default_val,
4975 prefix, suffix, our_known_true, insn_code, insn_index);
4979 write_indent (indent + 2);
4987 /* Write out the computation for one attribute value. */
4990 write_attr_case (attr, av, write_case_lines, prefix, suffix, indent,
4992 struct attr_desc *attr;
4993 struct attr_value *av;
4994 int write_case_lines;
4995 char *prefix, *suffix;
4999 struct insn_ent *ie;
5001 if (av->num_insns == 0)
5004 if (av->has_asm_insn)
5006 write_indent (indent);
5007 printf ("case -1:\n");
5008 write_indent (indent + 2);
5009 printf ("if (GET_CODE (PATTERN (insn)) != ASM_INPUT\n");
5010 write_indent (indent + 2);
5011 printf (" && asm_noperands (PATTERN (insn)) < 0)\n");
5012 write_indent (indent + 2);
5013 printf (" fatal_insn_not_found (insn);\n");
5016 if (write_case_lines)
5018 for (ie = av->first_insn; ie; ie = ie->next)
5019 if (ie->insn_code != -1)
5021 write_indent (indent);
5022 printf ("case %d:\n", ie->insn_code);
5027 write_indent (indent);
5028 printf ("default:\n");
5031 /* See what we have to do to output this value. */
5032 must_extract = must_constrain = address_used = 0;
5033 walk_attr_value (av->value);
5037 write_indent (indent + 2);
5038 printf ("insn_extract (insn);\n");
5043 #ifdef REGISTER_CONSTRAINTS
5044 write_indent (indent + 2);
5045 printf ("if (! constrain_operands (INSN_CODE (insn), reload_completed))\n");
5046 write_indent (indent + 2);
5047 printf (" fatal_insn_not_found (insn);\n");
5051 write_attr_set (attr, indent + 2, av->value, prefix, suffix,
5052 known_true, av->first_insn->insn_code,
5053 av->first_insn->insn_index);
5055 if (strncmp (prefix, "return", 6))
5057 write_indent (indent + 2);
5058 printf ("break;\n");
5063 /* Search for uses of non-const attributes and write code to cache them. */
5066 write_expr_attr_cache (p, attr)
5068 struct attr_desc *attr;
5073 if (GET_CODE (p) == EQ_ATTR)
5075 if (XSTR (p, 0) != attr->name)
5078 if (!attr->is_numeric)
5079 printf (" register enum attr_%s ", attr->name);
5080 else if (attr->unsigned_p)
5081 printf (" register unsigned int ");
5083 printf (" register int ");
5085 printf ("attr_%s = get_attr_%s (insn);\n", attr->name, attr->name);
5089 fmt = GET_RTX_FORMAT (GET_CODE (p));
5090 ie = GET_RTX_LENGTH (GET_CODE (p));
5091 for (i = 0; i < ie; i++)
5096 if (write_expr_attr_cache (XEXP (p, i), attr))
5101 je = XVECLEN (p, i);
5102 for (j = 0; j < je; ++j)
5103 if (write_expr_attr_cache (XVECEXP (p, i, j), attr))
5112 /* Evaluate an expression at top level. A front end to write_test_expr,
5113 in which we cache attribute values and break up excessively large
5114 expressions to cater to older compilers. */
5117 write_toplevel_expr (p)
5120 struct attr_desc *attr;
5123 for (i = 0; i < MAX_ATTRS_INDEX; ++i)
5124 for (attr = attrs[i]; attr ; attr = attr->next)
5125 if (!attr->is_const)
5126 write_expr_attr_cache (p, attr);
5128 printf(" register unsigned long accum = 0;\n\n");
5130 while (GET_CODE (p) == IOR)
5133 if (GET_CODE (XEXP (p, 0)) == IOR)
5134 e = XEXP (p, 1), p = XEXP (p, 0);
5136 e = XEXP (p, 0), p = XEXP (p, 1);
5138 printf (" accum |= ");
5139 write_test_expr (e, 3);
5142 printf (" accum |= ");
5143 write_test_expr (p, 3);
5147 /* Utilities to write names in various forms. */
5150 write_attr_valueq (attr, s)
5151 struct attr_desc *attr;
5154 if (attr->is_numeric)
5157 /* Make the blockage range values easier to read. */
5159 printf (" /* 0x%x */", atoi (s));
5163 write_upcase (attr->name);
5170 write_attr_value (attr, value)
5171 struct attr_desc *attr;
5174 if (GET_CODE (value) != CONST_STRING)
5177 write_attr_valueq (attr, XSTR (value, 0));
5185 if (*str < 'a' || *str > 'z')
5186 printf ("%c", *str++);
5188 printf ("%c", *str++ - 'a' + 'A');
5192 write_indent (indent)
5195 for (; indent > 8; indent -= 8)
5198 for (; indent; indent--)
5202 /* Write a subroutine that is given an insn that requires a delay slot, a
5203 delay slot ordinal, and a candidate insn. It returns non-zero if the
5204 candidate can be placed in the specified delay slot of the insn.
5206 We can write as many as three subroutines. `eligible_for_delay'
5207 handles normal delay slots, `eligible_for_annul_true' indicates that
5208 the specified insn can be annulled if the branch is true, and likewise
5209 for `eligible_for_annul_false'.
5211 KIND is a string distinguishing these three cases ("delay", "annul_true",
5212 or "annul_false"). */
5215 write_eligible_delay (kind)
5218 struct delay_desc *delay;
5221 struct attr_desc *attr;
5222 struct attr_value *av, *common_av;
5225 /* Compute the maximum number of delay slots required. We use the delay
5226 ordinal times this number plus one, plus the slot number as an index into
5227 the appropriate predicate to test. */
5229 for (delay = delays, max_slots = 0; delay; delay = delay->next)
5230 if (XVECLEN (delay->def, 1) / 3 > max_slots)
5231 max_slots = XVECLEN (delay->def, 1) / 3;
5233 /* Write function prelude. */
5236 printf ("eligible_for_%s (delay_insn, slot, candidate_insn, flags)\n",
5238 printf (" rtx delay_insn;\n");
5239 printf (" int slot;\n");
5240 printf (" rtx candidate_insn;\n");
5241 printf (" int flags;\n");
5243 printf (" rtx insn;\n");
5245 printf (" if (slot >= %d)\n", max_slots);
5246 printf (" abort ();\n");
5249 /* If more than one delay type, find out which type the delay insn is. */
5253 attr = find_attr ("*delay_type", 0);
5254 if (! attr) abort ();
5255 common_av = find_most_used (attr);
5257 printf (" insn = delay_insn;\n");
5258 printf (" switch (recog_memoized (insn))\n");
5261 sprintf (str, " * %d;\n break;", max_slots);
5262 for (av = attr->first_value; av; av = av->next)
5263 if (av != common_av)
5264 write_attr_case (attr, av, 1, "slot +=", str, 4, true_rtx);
5266 write_attr_case (attr, common_av, 0, "slot +=", str, 4, true_rtx);
5269 /* Ensure matched. Otherwise, shouldn't have been called. */
5270 printf (" if (slot < %d)\n", max_slots);
5271 printf (" abort ();\n\n");
5274 /* If just one type of delay slot, write simple switch. */
5275 if (num_delays == 1 && max_slots == 1)
5277 printf (" insn = candidate_insn;\n");
5278 printf (" switch (recog_memoized (insn))\n");
5281 attr = find_attr ("*delay_1_0", 0);
5282 if (! attr) abort ();
5283 common_av = find_most_used (attr);
5285 for (av = attr->first_value; av; av = av->next)
5286 if (av != common_av)
5287 write_attr_case (attr, av, 1, "return", ";", 4, true_rtx);
5289 write_attr_case (attr, common_av, 0, "return", ";", 4, true_rtx);
5295 /* Write a nested CASE. The first indicates which condition we need to
5296 test, and the inner CASE tests the condition. */
5297 printf (" insn = candidate_insn;\n");
5298 printf (" switch (slot)\n");
5301 for (delay = delays; delay; delay = delay->next)
5302 for (i = 0; i < XVECLEN (delay->def, 1); i += 3)
5304 printf (" case %d:\n",
5305 (i / 3) + (num_delays == 1 ? 0 : delay->num * max_slots));
5306 printf (" switch (recog_memoized (insn))\n");
5309 sprintf (str, "*%s_%d_%d", kind, delay->num, i / 3);
5310 attr = find_attr (str, 0);
5311 if (! attr) abort ();
5312 common_av = find_most_used (attr);
5314 for (av = attr->first_value; av; av = av->next)
5315 if (av != common_av)
5316 write_attr_case (attr, av, 1, "return", ";", 8, true_rtx);
5318 write_attr_case (attr, common_av, 0, "return", ";", 8, true_rtx);
5322 printf (" default:\n");
5323 printf (" abort ();\n");
5330 /* Write routines to compute conflict cost for function units. Then write a
5331 table describing the available function units. */
5334 write_function_unit_info ()
5336 struct function_unit *unit;
5339 /* Write out conflict routines for function units. Don't bother writing
5340 one if there is only one issue delay value. */
5342 for (unit = units; unit; unit = unit->next)
5344 if (unit->needs_blockage_function)
5345 write_complex_function (unit, "blockage", "block");
5347 /* If the minimum and maximum conflict costs are the same, there
5348 is only one value, so we don't need a function. */
5349 if (! unit->needs_conflict_function)
5351 unit->default_cost = make_numeric_value (unit->issue_delay.max);
5355 /* The function first computes the case from the candidate insn. */
5356 unit->default_cost = make_numeric_value (0);
5357 write_complex_function (unit, "conflict_cost", "cost");
5360 /* Now that all functions have been written, write the table describing
5361 the function units. The name is included for documentation purposes
5364 printf ("struct function_unit_desc function_units[] = {\n");
5366 /* Write out the descriptions in numeric order, but don't force that order
5367 on the list. Doing so increases the runtime of genattrtab.c. */
5368 for (i = 0; i < num_units; i++)
5370 for (unit = units; unit; unit = unit->next)
5374 printf (" {\"%s\", %d, %d, %d, %s, %d, %s_unit_ready_cost, ",
5375 unit->name, 1 << unit->num, unit->multiplicity,
5376 unit->simultaneity, XSTR (unit->default_cost, 0),
5377 unit->issue_delay.max, unit->name);
5379 if (unit->needs_conflict_function)
5380 printf ("%s_unit_conflict_cost, ", unit->name);
5384 printf ("%d, ", unit->max_blockage);
5386 if (unit->needs_range_function)
5387 printf ("%s_unit_blockage_range, ", unit->name);
5391 if (unit->needs_blockage_function)
5392 printf ("%s_unit_blockage", unit->name);
5403 write_complex_function (unit, name, connection)
5404 struct function_unit *unit;
5405 char *name, *connection;
5407 struct attr_desc *case_attr, *attr;
5408 struct attr_value *av, *common_av;
5414 printf ("static int\n");
5415 printf ("%s_unit_%s (executing_insn, candidate_insn)\n",
5417 printf (" rtx executing_insn;\n");
5418 printf (" rtx candidate_insn;\n");
5420 printf (" rtx insn;\n");
5421 printf (" int casenum;\n\n");
5422 printf (" insn = executing_insn;\n");
5423 printf (" switch (recog_memoized (insn))\n");
5426 /* Write the `switch' statement to get the case value. */
5427 str = (char *) alloca (strlen (unit->name) + strlen (name) + strlen (connection) + 10);
5428 sprintf (str, "*%s_cases", unit->name);
5429 case_attr = find_attr (str, 0);
5430 if (! case_attr) abort ();
5431 common_av = find_most_used (case_attr);
5433 for (av = case_attr->first_value; av; av = av->next)
5434 if (av != common_av)
5435 write_attr_case (case_attr, av, 1,
5436 "casenum =", ";", 4, unit->condexp);
5438 write_attr_case (case_attr, common_av, 0,
5439 "casenum =", ";", 4, unit->condexp);
5442 /* Now write an outer switch statement on each case. Then write
5443 the tests on the executing function within each. */
5444 printf (" insn = candidate_insn;\n");
5445 printf (" switch (casenum)\n");
5448 for (i = 0; i < unit->num_opclasses; i++)
5450 /* Ensure using this case. */
5452 for (av = case_attr->first_value; av; av = av->next)
5454 && contained_in_p (make_numeric_value (i), av->value))
5460 printf (" case %d:\n", i);
5461 sprintf (str, "*%s_%s_%d", unit->name, connection, i);
5462 attr = find_attr (str, 0);
5463 if (! attr) abort ();
5465 /* If single value, just write it. */
5466 value = find_single_value (attr);
5468 write_attr_set (attr, 6, value, "return", ";\n", true_rtx, -2, -2);
5471 common_av = find_most_used (attr);
5472 printf (" switch (recog_memoized (insn))\n");
5475 for (av = attr->first_value; av; av = av->next)
5476 if (av != common_av)
5477 write_attr_case (attr, av, 1,
5478 "return", ";", 8, unit->condexp);
5480 write_attr_case (attr, common_av, 0,
5481 "return", ";", 8, unit->condexp);
5486 printf (" }\n}\n\n");
5489 /* This page contains miscellaneous utility routines. */
5491 /* Given a string, return the number of comma-separated elements in it.
5492 Return 0 for the null string. */
5503 for (n = 1; *s; s++)
5510 /* Given a pointer to a (char *), return a malloc'ed string containing the
5511 next comma-separated element. Advance the pointer to after the string
5512 scanned, or the end-of-string. Return NULL if at end of string. */
5515 next_comma_elt (pstr)
5524 /* Find end of string to compute length. */
5525 for (p = *pstr; *p != ',' && *p != '\0'; p++)
5528 out_str = attr_string (*pstr, p - *pstr);
5537 /* Return a `struct attr_desc' pointer for a given named attribute. If CREATE
5538 is non-zero, build a new attribute, if one does not exist. */
5540 static struct attr_desc *
5541 find_attr (name, create)
5545 struct attr_desc *attr;
5548 /* Before we resort to using `strcmp', see if the string address matches
5549 anywhere. In most cases, it should have been canonicalized to do so. */
5550 if (name == alternative_name)
5553 index = name[0] & (MAX_ATTRS_INDEX - 1);
5554 for (attr = attrs[index]; attr; attr = attr->next)
5555 if (name == attr->name)
5558 /* Otherwise, do it the slow way. */
5559 for (attr = attrs[index]; attr; attr = attr->next)
5560 if (name[0] == attr->name[0] && ! strcmp (name, attr->name))
5566 attr = (struct attr_desc *) oballoc (sizeof (struct attr_desc));
5567 attr->name = attr_string (name, strlen (name));
5568 attr->first_value = attr->default_val = NULL;
5569 attr->is_numeric = attr->negative_ok = attr->is_const = attr->is_special = 0;
5570 attr->next = attrs[index];
5571 attrs[index] = attr;
5576 /* Create internal attribute with the given default value. */
5579 make_internal_attr (name, value, special)
5584 struct attr_desc *attr;
5586 attr = find_attr (name, 1);
5587 if (attr->default_val)
5590 attr->is_numeric = 1;
5592 attr->is_special = (special & 1) != 0;
5593 attr->negative_ok = (special & 2) != 0;
5594 attr->unsigned_p = (special & 4) != 0;
5595 attr->default_val = get_attr_value (value, attr, -2);
5598 /* Find the most used value of an attribute. */
5600 static struct attr_value *
5601 find_most_used (attr)
5602 struct attr_desc *attr;
5604 struct attr_value *av;
5605 struct attr_value *most_used;
5611 for (av = attr->first_value; av; av = av->next)
5612 if (av->num_insns > nuses)
5613 nuses = av->num_insns, most_used = av;
5618 /* If an attribute only has a single value used, return it. Otherwise
5622 find_single_value (attr)
5623 struct attr_desc *attr;
5625 struct attr_value *av;
5628 unique_value = NULL;
5629 for (av = attr->first_value; av; av = av->next)
5635 unique_value = av->value;
5638 return unique_value;
5641 /* Return (attr_value "n") */
5644 make_numeric_value (n)
5647 static rtx int_values[20];
5654 if (n < 20 && int_values[n])
5655 return int_values[n];
5657 p = attr_printf (MAX_DIGITS, "%d", n);
5658 exp = attr_rtx (CONST_STRING, p);
5661 int_values[n] = exp;
5667 extend_range (range, min, max)
5668 struct range *range;
5672 if (range->min > min) range->min = min;
5673 if (range->max < max) range->max = max;
5677 xrealloc (ptr, size)
5681 char *result = (char *) realloc (ptr, size);
5683 fatal ("virtual memory exhausted");
5691 register char *val = (char *) malloc (size);
5694 fatal ("virtual memory exhausted");
5699 copy_rtx_unchanging (orig)
5704 register RTX_CODE code;
5707 if (RTX_UNCHANGING_P (orig) || MEM_IN_STRUCT_P (orig))
5710 MEM_IN_STRUCT_P (orig) = 1;
5714 code = GET_CODE (orig);
5727 copy = rtx_alloc (code);
5728 PUT_MODE (copy, GET_MODE (orig));
5729 RTX_UNCHANGING_P (copy) = 1;
5731 bcopy ((char *) &XEXP (orig, 0), (char *) &XEXP (copy, 0),
5732 GET_RTX_LENGTH (GET_CODE (copy)) * sizeof (rtx));
5742 fprintf (stderr, "genattrtab: ");
5743 fprintf (stderr, s, a1, a2);
5744 fprintf (stderr, "\n");
5745 exit (FATAL_EXIT_CODE);
5748 /* More 'friendly' abort that prints the line and file.
5749 config.h can #define abort fancy_abort if you like that sort of thing. */
5754 fatal ("Internal gcc abort.");
5757 /* Determine if an insn has a constant number of delay slots, i.e., the
5758 number of delay slots is not a function of the length of the insn. */
5761 write_const_num_delay_slots ()
5763 struct attr_desc *attr = find_attr ("*num_delay_slots", 0);
5764 struct attr_value *av;
5765 struct insn_ent *ie;
5770 printf ("int\nconst_num_delay_slots (insn)\n");
5771 printf (" rtx insn;\n");
5773 printf (" switch (recog_memoized (insn))\n");
5776 for (av = attr->first_value; av; av = av->next)
5779 walk_attr_value (av->value);
5782 for (ie = av->first_insn; ie; ie = ie->next)
5783 if (ie->insn_code != -1)
5784 printf (" case %d:\n", ie->insn_code);
5785 printf (" return 0;\n");
5789 printf (" default:\n");
5790 printf (" return 1;\n");
5804 struct attr_desc *attr;
5805 struct insn_def *id;
5809 #if defined (RLIMIT_STACK) && defined (HAVE_GETRLIMIT) && defined (HAVE_SETRLIMIT)
5810 /* Get rid of any avoidable limit on stack size. */
5814 /* Set the stack limit huge so that alloca does not fail. */
5815 getrlimit (RLIMIT_STACK, &rlim);
5816 rlim.rlim_cur = rlim.rlim_max;
5817 setrlimit (RLIMIT_STACK, &rlim);
5821 obstack_init (rtl_obstack);
5822 obstack_init (hash_obstack);
5823 obstack_init (temp_obstack);
5826 fatal ("No input file name.");
5828 infile = fopen (argv[1], "r");
5832 exit (FATAL_EXIT_CODE);
5837 /* Set up true and false rtx's */
5838 true_rtx = rtx_alloc (CONST_INT);
5839 XWINT (true_rtx, 0) = 1;
5840 false_rtx = rtx_alloc (CONST_INT);
5841 XWINT (false_rtx, 0) = 0;
5842 RTX_UNCHANGING_P (true_rtx) = RTX_UNCHANGING_P (false_rtx) = 1;
5843 RTX_INTEGRATED_P (true_rtx) = RTX_INTEGRATED_P (false_rtx) = 1;
5845 alternative_name = attr_string ("alternative", strlen ("alternative"));
5847 printf ("/* Generated automatically by the program `genattrtab'\n\
5848 from the machine description file `md'. */\n\n");
5850 /* Read the machine description. */
5854 c = read_skip_spaces (infile);
5859 desc = read_rtx (infile);
5860 if (GET_CODE (desc) == DEFINE_INSN
5861 || GET_CODE (desc) == DEFINE_PEEPHOLE
5862 || GET_CODE (desc) == DEFINE_ASM_ATTRIBUTES)
5865 else if (GET_CODE (desc) == DEFINE_EXPAND)
5866 insn_code_number++, insn_index_number++;
5868 else if (GET_CODE (desc) == DEFINE_SPLIT)
5869 insn_code_number++, insn_index_number++;
5871 else if (GET_CODE (desc) == DEFINE_ATTR)
5874 insn_index_number++;
5877 else if (GET_CODE (desc) == DEFINE_DELAY)
5880 insn_index_number++;
5883 else if (GET_CODE (desc) == DEFINE_FUNCTION_UNIT)
5886 insn_index_number++;
5890 /* If we didn't have a DEFINE_ASM_ATTRIBUTES, make a null one. */
5891 if (! got_define_asm_attributes)
5893 tem = rtx_alloc (DEFINE_ASM_ATTRIBUTES);
5894 XVEC (tem, 0) = rtvec_alloc (0);
5898 /* Expand DEFINE_DELAY information into new attribute. */
5902 /* Expand DEFINE_FUNCTION_UNIT information into new attributes. */
5906 printf ("#include \"config.h\"\n");
5907 printf ("#include <stdio.h>\n");
5908 printf ("#include \"rtl.h\"\n");
5909 printf ("#include \"insn-config.h\"\n");
5910 printf ("#include \"recog.h\"\n");
5911 printf ("#include \"regs.h\"\n");
5912 printf ("#include \"real.h\"\n");
5913 printf ("#include \"output.h\"\n");
5914 printf ("#include \"insn-attr.h\"\n");
5916 printf ("#define operands recog_operand\n\n");
5918 /* Make `insn_alternatives'. */
5919 insn_alternatives = (int *) oballoc (insn_code_number * sizeof (int));
5920 for (id = defs; id; id = id->next)
5921 if (id->insn_code >= 0)
5922 insn_alternatives[id->insn_code] = (1 << id->num_alternatives) - 1;
5924 /* Make `insn_n_alternatives'. */
5925 insn_n_alternatives = (int *) oballoc (insn_code_number * sizeof (int));
5926 for (id = defs; id; id = id->next)
5927 if (id->insn_code >= 0)
5928 insn_n_alternatives[id->insn_code] = id->num_alternatives;
5930 /* Prepare to write out attribute subroutines by checking everything stored
5931 away and building the attribute cases. */
5934 for (i = 0; i < MAX_ATTRS_INDEX; i++)
5935 for (attr = attrs[i]; attr; attr = attr->next)
5937 attr->default_val->value
5938 = check_attr_value (attr->default_val->value, attr);
5942 /* Construct extra attributes for `length'. */
5943 make_length_attrs ();
5945 /* Perform any possible optimizations to speed up compilation. */
5948 /* Now write out all the `gen_attr_...' routines. Do these before the
5949 special routines (specifically before write_function_unit_info), so
5950 that they get defined before they are used. */
5952 for (i = 0; i < MAX_ATTRS_INDEX; i++)
5953 for (attr = attrs[i]; attr; attr = attr->next)
5955 if (! attr->is_special && ! attr->is_const)
5956 write_attr_get (attr);
5959 /* Write out delay eligibility information, if DEFINE_DELAY present.
5960 (The function to compute the number of delay slots will be written
5964 write_eligible_delay ("delay");
5965 if (have_annul_true)
5966 write_eligible_delay ("annul_true");
5967 if (have_annul_false)
5968 write_eligible_delay ("annul_false");
5971 /* Write out information about function units. */
5973 write_function_unit_info ();
5975 /* Write out constant delay slot info */
5976 write_const_num_delay_slots ();
5979 exit (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);