1 /* Generate attribute information (insn-attr.h) from machine description.
2 Copyright (C) 1991, 1994, 1996, 1998, 1999, 2000 Free Software Foundation, Inc.
3 Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
27 #include "gensupport.h"
30 /* A range of values. */
38 /* Record information about each function unit mentioned in a
39 DEFINE_FUNCTION_UNIT. */
43 char *name
; /* Function unit name. */
44 struct function_unit
*next
; /* Next function unit. */
45 int multiplicity
; /* Number of units of this type. */
46 int simultaneity
; /* Maximum number of simultaneous insns
47 on this function unit or 0 if unlimited. */
48 struct range ready_cost
; /* Range of ready cost values. */
49 struct range issue_delay
; /* Range of issue delay values. */
52 static void extend_range
PARAMS ((struct range
*, int, int));
53 static void init_range
PARAMS ((struct range
*));
54 static void write_upcase
PARAMS ((const char *));
55 static void gen_attr
PARAMS ((rtx
));
56 static void write_units
PARAMS ((int, struct range
*, struct range
*,
57 struct range
*, struct range
*,
60 extend_range (range
, min
, max
)
65 if (range
->min
> min
) range
->min
= min
;
66 if (range
->max
< max
) range
->max
= max
;
82 putchar (TOUPPER(*str
));
90 int is_const
= GET_CODE (XEXP (attr
, 2)) == CONST
;
92 printf ("#define HAVE_ATTR_%s\n", XSTR (attr
, 0));
94 /* If numeric attribute, don't need to write an enum. */
95 if (*XSTR (attr
, 1) == '\0')
96 printf ("extern int get_attr_%s PARAMS ((%s));\n", XSTR (attr
, 0),
97 (is_const
? "void" : "rtx"));
100 printf ("enum attr_%s {", XSTR (attr
, 0));
101 write_upcase (XSTR (attr
, 0));
104 for (p
= XSTR (attr
, 1); *p
!= '\0'; p
++)
109 write_upcase (XSTR (attr
, 0));
113 putchar (TOUPPER(*p
));
117 printf ("extern enum attr_%s get_attr_%s PARAMS ((%s));\n\n",
118 XSTR (attr
, 0), XSTR (attr
, 0), (is_const
? "void" : "rtx"));
121 /* If `length' attribute, write additional function definitions and define
122 variables used by `insn_current_length'. */
123 if (! strcmp (XSTR (attr
, 0), "length"))
125 printf ("extern void shorten_branches PARAMS ((rtx));\n");
126 printf ("extern int insn_default_length PARAMS ((rtx));\n");
127 printf ("extern int insn_variable_length_p PARAMS ((rtx));\n");
128 printf ("extern int insn_current_length PARAMS ((rtx));\n\n");
129 printf ("#include \"insn-addr.h\"\n\n");
134 write_units (num_units
, multiplicity
, simultaneity
,
135 ready_cost
, issue_delay
, blockage
)
137 struct range
*multiplicity
;
138 struct range
*simultaneity
;
139 struct range
*ready_cost
;
140 struct range
*issue_delay
;
141 struct range
*blockage
;
145 printf ("#define INSN_SCHEDULING\n\n");
146 printf ("extern int result_ready_cost PARAMS ((rtx));\n");
147 printf ("extern int function_units_used PARAMS ((rtx));\n\n");
148 printf ("extern struct function_unit_desc\n");
150 printf (" const char *name;\n");
151 printf (" int bitmask;\n");
152 printf (" int multiplicity;\n");
153 printf (" int simultaneity;\n");
154 printf (" int default_cost;\n");
155 printf (" int max_issue_delay;\n");
156 printf (" int (*ready_cost_function) PARAMS ((rtx));\n");
157 printf (" int (*conflict_cost_function) PARAMS ((rtx, rtx));\n");
158 printf (" int max_blockage;\n");
159 printf (" unsigned int (*blockage_range_function) PARAMS ((rtx));\n");
160 printf (" int (*blockage_function) PARAMS ((rtx, rtx));\n");
161 printf ("} function_units[];\n\n");
162 printf ("#define FUNCTION_UNITS_SIZE %d\n", num_units
);
163 printf ("#define MIN_MULTIPLICITY %d\n", multiplicity
->min
);
164 printf ("#define MAX_MULTIPLICITY %d\n", multiplicity
->max
);
165 printf ("#define MIN_SIMULTANEITY %d\n", simultaneity
->min
);
166 printf ("#define MAX_SIMULTANEITY %d\n", simultaneity
->max
);
167 printf ("#define MIN_READY_COST %d\n", ready_cost
->min
);
168 printf ("#define MAX_READY_COST %d\n", ready_cost
->max
);
169 printf ("#define MIN_ISSUE_DELAY %d\n", issue_delay
->min
);
170 printf ("#define MAX_ISSUE_DELAY %d\n", issue_delay
->max
);
171 printf ("#define MIN_BLOCKAGE %d\n", blockage
->min
);
172 printf ("#define MAX_BLOCKAGE %d\n", blockage
->max
);
173 for (i
= 0; (1 << i
) < blockage
->max
; i
++)
175 printf ("#define BLOCKAGE_BITS %d\n", i
+ 1);
177 /* INSN_QUEUE_SIZE is a power of two larger than MAX_BLOCKAGE and
178 MAX_READY_COST. This is the longest time an isnsn may be queued. */
179 i
= MAX (blockage
->max
, ready_cost
->max
);
180 for (q_size
= 1; q_size
<= i
; q_size
<<= 1)
182 printf ("#define INSN_QUEUE_SIZE %d\n", q_size
);
185 extern int main
PARAMS ((int, char **));
194 int have_annul_true
= 0;
195 int have_annul_false
= 0;
197 struct range all_simultaneity
, all_multiplicity
;
198 struct range all_ready_cost
, all_issue_delay
, all_blockage
;
199 struct function_unit
*units
= 0, *unit
;
202 init_range (&all_multiplicity
);
203 init_range (&all_simultaneity
);
204 init_range (&all_ready_cost
);
205 init_range (&all_issue_delay
);
206 init_range (&all_blockage
);
208 progname
= "genattr";
211 fatal ("No input file name.");
213 if (init_md_reader (argv
[1]) != SUCCESS_EXIT_CODE
)
214 return (FATAL_EXIT_CODE
);
216 puts ("/* Generated automatically by the program `genattr'");
217 puts (" from the machine description file `md'. */\n");
218 puts ("#ifndef GCC_INSN_ATTR_H");
219 puts ("#define GCC_INSN_ATTR_H\n");
221 /* For compatibility, define the attribute `alternative', which is just
222 a reference to the variable `which_alternative'. */
224 puts ("#define HAVE_ATTR_alternative");
225 puts ("#define get_attr_alternative(insn) which_alternative");
227 /* Read the machine description. */
231 int line_no
, insn_code_number
;
233 desc
= read_md_rtx (&line_no
, &insn_code_number
);
237 if (GET_CODE (desc
) == DEFINE_ATTR
)
240 else if (GET_CODE (desc
) == DEFINE_DELAY
)
244 printf ("#define DELAY_SLOTS\n");
245 printf ("extern int num_delay_slots PARAMS ((rtx));\n");
246 printf ("extern int eligible_for_delay PARAMS ((rtx, int, rtx, int));\n\n");
247 printf ("extern int const_num_delay_slots PARAMS ((rtx));\n\n");
251 for (i
= 0; i
< XVECLEN (desc
, 1); i
+= 3)
253 if (XVECEXP (desc
, 1, i
+ 1) && ! have_annul_true
)
255 printf ("#define ANNUL_IFTRUE_SLOTS\n");
256 printf ("extern int eligible_for_annul_true PARAMS ((rtx, int, rtx, int));\n");
260 if (XVECEXP (desc
, 1, i
+ 2) && ! have_annul_false
)
262 printf ("#define ANNUL_IFFALSE_SLOTS\n");
263 printf ("extern int eligible_for_annul_false PARAMS ((rtx, int, rtx, int));\n");
264 have_annul_false
= 1;
269 else if (GET_CODE (desc
) == DEFINE_FUNCTION_UNIT
)
271 const char *name
= XSTR (desc
, 0);
272 int multiplicity
= XINT (desc
, 1);
273 int simultaneity
= XINT (desc
, 2);
274 int ready_cost
= MAX (XINT (desc
, 4), 1);
275 int issue_delay
= MAX (XINT (desc
, 5), 1);
276 int issueexp_p
= (XVEC (desc
, 6) != 0);
278 for (unit
= units
; unit
; unit
= unit
->next
)
279 if (strcmp (unit
->name
, name
) == 0)
284 unit
= (struct function_unit
*)
285 xmalloc (sizeof (struct function_unit
));
286 unit
->name
= xstrdup (name
);
287 unit
->multiplicity
= multiplicity
;
288 unit
->simultaneity
= simultaneity
;
289 unit
->ready_cost
.min
= unit
->ready_cost
.max
= ready_cost
;
290 unit
->issue_delay
.min
= unit
->issue_delay
.max
= issue_delay
;
295 extend_range (&all_multiplicity
, multiplicity
, multiplicity
);
296 extend_range (&all_simultaneity
, simultaneity
, simultaneity
);
298 else if (unit
->multiplicity
!= multiplicity
299 || unit
->simultaneity
!= simultaneity
)
300 fatal ("Differing specifications given for `%s' function unit.",
303 extend_range (&unit
->ready_cost
, ready_cost
, ready_cost
);
304 extend_range (&unit
->issue_delay
,
305 issueexp_p
? 1 : issue_delay
, issue_delay
);
306 extend_range (&all_ready_cost
,
307 unit
->ready_cost
.min
, unit
->ready_cost
.max
);
308 extend_range (&all_issue_delay
,
309 unit
->issue_delay
.min
, unit
->issue_delay
.max
);
315 /* Compute the range of blockage cost values. See genattrtab.c
316 for the derivation. BLOCKAGE (E,C) when SIMULTANEITY is zero is
318 MAX (ISSUE-DELAY (E,C),
319 READY-COST (E) - (READY-COST (C) - 1))
323 MAX (ISSUE-DELAY (E,C),
324 READY-COST (E) - (READY-COST (C) - 1),
325 READY-COST (E) - FILL-TIME) */
327 for (unit
= units
; unit
; unit
= unit
->next
)
329 struct range blockage
;
331 blockage
= unit
->issue_delay
;
332 blockage
.max
= MAX (unit
->ready_cost
.max
333 - (unit
->ready_cost
.min
- 1),
335 blockage
.min
= MAX (1, blockage
.min
);
337 if (unit
->simultaneity
!= 0)
339 int fill_time
= ((unit
->simultaneity
- 1)
340 * unit
->issue_delay
.min
);
341 blockage
.min
= MAX (unit
->ready_cost
.min
- fill_time
,
343 blockage
.max
= MAX (unit
->ready_cost
.max
- fill_time
,
346 extend_range (&all_blockage
, blockage
.min
, blockage
.max
);
349 write_units (num_units
, &all_multiplicity
, &all_simultaneity
,
350 &all_ready_cost
, &all_issue_delay
, &all_blockage
);
353 /* Output flag masks for use by reorg.
355 Flags are used to hold branch direction and prediction information
356 for use by eligible_for_... */
357 printf("\n#define ATTR_FLAG_forward\t0x1\n");
358 printf("#define ATTR_FLAG_backward\t0x2\n");
359 printf("#define ATTR_FLAG_likely\t0x4\n");
360 printf("#define ATTR_FLAG_very_likely\t0x8\n");
361 printf("#define ATTR_FLAG_unlikely\t0x10\n");
362 printf("#define ATTR_FLAG_very_unlikely\t0x20\n");
364 puts("\n#endif /* GCC_INSN_ATTR_H */");
366 if (ferror (stdout
) || fflush (stdout
) || fclose (stdout
))
367 return FATAL_EXIT_CODE
;
369 return SUCCESS_EXIT_CODE
;
372 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
375 int code ATTRIBUTE_UNUSED
;