2000-12-21 Benjamin Kosnik <bkoz@redhat.com>
[official-gcc.git] / gcc / genattr.c
blob27123d87871eb4581f88487587a73ef71a072861
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 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)
10 any later version.
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. */
23 #include "hconfig.h"
24 #include "system.h"
25 #include "rtl.h"
26 #include "errors.h"
27 #include "gensupport.h"
30 /* A range of values. */
32 struct range
34 int min;
35 int max;
38 /* Record information about each function unit mentioned in a
39 DEFINE_FUNCTION_UNIT. */
41 struct 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 *,
58 struct range *));
59 static void
60 extend_range (range, min, max)
61 struct range *range;
62 int min;
63 int max;
65 if (range->min > min) range->min = min;
66 if (range->max < max) range->max = max;
69 static void
70 init_range (range)
71 struct range *range;
73 range->min = 100000;
74 range->max = -1;
77 static void
78 write_upcase (str)
79 const char *str;
81 for (; *str; str++)
82 putchar (TOUPPER(*str));
85 static void
86 gen_attr (attr)
87 rtx attr;
89 const char *p;
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"));
98 else
100 printf ("enum attr_%s {", XSTR (attr, 0));
101 write_upcase (XSTR (attr, 0));
102 printf ("_");
104 for (p = XSTR (attr, 1); *p != '\0'; p++)
106 if (*p == ',')
108 printf (", ");
109 write_upcase (XSTR (attr, 0));
110 printf ("_");
112 else
113 putchar (TOUPPER(*p));
116 printf ("};\n");
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");
133 static void
134 write_units (num_units, multiplicity, simultaneity,
135 ready_cost, issue_delay, blockage)
136 int num_units;
137 struct range *multiplicity;
138 struct range *simultaneity;
139 struct range *ready_cost;
140 struct range *issue_delay;
141 struct range *blockage;
143 int i, q_size;
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");
149 printf ("{\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 **));
188 main (argc, argv)
189 int argc;
190 char **argv;
192 rtx desc;
193 int have_delay = 0;
194 int have_annul_true = 0;
195 int have_annul_false = 0;
196 int num_units = 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;
200 int i;
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";
210 if (argc <= 1)
211 fatal ("No input file name.");
213 if (init_md_reader (argv[1]) != SUCCESS_EXIT_CODE)
214 return (FATAL_EXIT_CODE);
216 printf ("/* Generated automatically by the program `genattr'\n\
217 from the machine description file `md'. */\n\n");
219 /* For compatibility, define the attribute `alternative', which is just
220 a reference to the variable `which_alternative'. */
222 printf ("#define HAVE_ATTR_alternative\n");
223 printf ("#define get_attr_alternative(insn) which_alternative\n");
225 /* Read the machine description. */
227 while (1)
229 int line_no, insn_code_number;
231 desc = read_md_rtx (&line_no, &insn_code_number);
232 if (desc == NULL)
233 break;
235 if (GET_CODE (desc) == DEFINE_ATTR)
236 gen_attr (desc);
238 else if (GET_CODE (desc) == DEFINE_DELAY)
240 if (! have_delay)
242 printf ("#define DELAY_SLOTS\n");
243 printf ("extern int num_delay_slots PARAMS ((rtx));\n");
244 printf ("extern int eligible_for_delay PARAMS ((rtx, int, rtx, int));\n\n");
245 printf ("extern int const_num_delay_slots PARAMS ((rtx));\n\n");
246 have_delay = 1;
249 for (i = 0; i < XVECLEN (desc, 1); i += 3)
251 if (XVECEXP (desc, 1, i + 1) && ! have_annul_true)
253 printf ("#define ANNUL_IFTRUE_SLOTS\n");
254 printf ("extern int eligible_for_annul_true PARAMS ((rtx, int, rtx, int));\n");
255 have_annul_true = 1;
258 if (XVECEXP (desc, 1, i + 2) && ! have_annul_false)
260 printf ("#define ANNUL_IFFALSE_SLOTS\n");
261 printf ("extern int eligible_for_annul_false PARAMS ((rtx, int, rtx, int));\n");
262 have_annul_false = 1;
267 else if (GET_CODE (desc) == DEFINE_FUNCTION_UNIT)
269 const char *name = XSTR (desc, 0);
270 int multiplicity = XINT (desc, 1);
271 int simultaneity = XINT (desc, 2);
272 int ready_cost = MAX (XINT (desc, 4), 1);
273 int issue_delay = MAX (XINT (desc, 5), 1);
274 int issueexp_p = (XVEC (desc, 6) != 0);
276 for (unit = units; unit; unit = unit->next)
277 if (strcmp (unit->name, name) == 0)
278 break;
280 if (unit == 0)
282 int len = strlen (name) + 1;
283 unit = (struct function_unit *)
284 alloca (sizeof (struct function_unit));
285 unit->name = (char *) alloca (len);
286 memcpy (unit->name, name, len);
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;
291 unit->next = units;
292 units = unit;
293 num_units++;
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.",
301 unit->name);
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);
313 if (num_units > 0)
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))
321 and otherwise
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),
334 blockage.max);
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,
342 blockage.min);
343 blockage.max = MAX (unit->ready_cost.max - fill_time,
344 blockage.max);
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 fflush (stdout);
365 return (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
368 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
369 const char *
370 get_insn_name (code)
371 int code ATTRIBUTE_UNUSED;
373 return NULL;