1 /* Generate attribute information (insn-attr.h) from machine description.
2 Copyright (C) 1991, 1994, 1996 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. */
32 static struct obstack obstack;
33 struct obstack *rtl_obstack = &obstack;
35 #define obstack_chunk_alloc xmalloc
36 #define obstack_chunk_free free
38 extern void free PROTO((void *));
39 extern rtx read_rtx PROTO((FILE *));
41 char *xmalloc PROTO((unsigned));
43 void fancy_abort PROTO((void));
45 /* A range of values. */
53 /* Record information about each function unit mentioned in a
54 DEFINE_FUNCTION_UNIT. */
58 char *name; /* Function unit name. */
59 struct function_unit *next; /* Next function unit. */
60 int multiplicity; /* Number of units of this type. */
61 int simultaneity; /* Maximum number of simultaneous insns
62 on this function unit or 0 if unlimited. */
63 struct range ready_cost; /* Range of ready cost values. */
64 struct range issue_delay; /* Range of issue delay values. */
68 extend_range (range, min, max)
73 if (range->min > min) range->min = min;
74 if (range->max < max) range->max = max;
90 if (*str >= 'a' && *str <= 'z')
91 printf ("%c", *str - 'a' + 'A');
102 printf ("#define HAVE_ATTR_%s\n", XSTR (attr, 0));
104 /* If numeric attribute, don't need to write an enum. */
105 if (*XSTR (attr, 1) == '\0')
106 printf ("extern int get_attr_%s ();\n", XSTR (attr, 0));
109 printf ("enum attr_%s {", XSTR (attr, 0));
110 write_upcase (XSTR (attr, 0));
113 for (p = XSTR (attr, 1); *p != '\0'; p++)
118 write_upcase (XSTR (attr, 0));
121 else if (*p >= 'a' && *p <= 'z')
122 printf ("%c", *p - 'a' + 'A');
128 printf ("extern enum attr_%s get_attr_%s ();\n\n",
129 XSTR (attr, 0), XSTR (attr, 0));
132 /* If `length' attribute, write additional function definitions and define
133 variables used by `insn_current_length'. */
134 if (! strcmp (XSTR (attr, 0), "length"))
136 printf ("extern void init_lengths ();\n");
137 printf ("extern void shorten_branches PROTO((rtx));\n");
138 printf ("extern int insn_default_length PROTO((rtx));\n");
139 printf ("extern int insn_variable_length_p PROTO((rtx));\n");
140 printf ("extern int insn_current_length PROTO((rtx));\n\n");
141 printf ("extern int *insn_addresses;\n");
142 printf ("extern int insn_current_address;\n\n");
147 write_units (num_units, multiplicity, simultaneity,
148 ready_cost, issue_delay, blockage)
150 struct range *multiplicity;
151 struct range *simultaneity;
152 struct range *ready_cost;
153 struct range *issue_delay;
154 struct range *blockage;
158 printf ("#define INSN_SCHEDULING\n\n");
159 printf ("extern int result_ready_cost PROTO((rtx));\n");
160 printf ("extern int function_units_used PROTO((rtx));\n\n");
161 printf ("extern struct function_unit_desc\n");
163 printf (" char *name;\n");
164 printf (" int bitmask;\n");
165 printf (" int multiplicity;\n");
166 printf (" int simultaneity;\n");
167 printf (" int default_cost;\n");
168 printf (" int max_issue_delay;\n");
169 printf (" int (*ready_cost_function) ();\n");
170 printf (" int (*conflict_cost_function) ();\n");
171 printf (" int max_blockage;\n");
172 printf (" unsigned int (*blockage_range_function) ();\n");
173 printf (" int (*blockage_function) ();\n");
174 printf ("} function_units[];\n\n");
175 printf ("#define FUNCTION_UNITS_SIZE %d\n", num_units);
176 printf ("#define MIN_MULTIPLICITY %d\n", multiplicity->min);
177 printf ("#define MAX_MULTIPLICITY %d\n", multiplicity->max);
178 printf ("#define MIN_SIMULTANEITY %d\n", simultaneity->min);
179 printf ("#define MAX_SIMULTANEITY %d\n", simultaneity->max);
180 printf ("#define MIN_READY_COST %d\n", ready_cost->min);
181 printf ("#define MAX_READY_COST %d\n", ready_cost->max);
182 printf ("#define MIN_ISSUE_DELAY %d\n", issue_delay->min);
183 printf ("#define MAX_ISSUE_DELAY %d\n", issue_delay->max);
184 printf ("#define MIN_BLOCKAGE %d\n", blockage->min);
185 printf ("#define MAX_BLOCKAGE %d\n", blockage->max);
186 for (i = 0; (1 << i) < blockage->max; i++)
188 printf ("#define BLOCKAGE_BITS %d\n", i + 1);
190 /* INSN_QUEUE_SIZE is a power of two larger than MAX_BLOCKAGE and
191 MAX_READY_COST. This is the longest time an isnsn may be queued. */
192 i = MAX (blockage->max, ready_cost->max);
193 for (q_size = 1; q_size <= i; q_size <<= 1)
195 printf ("#define INSN_QUEUE_SIZE %d\n", q_size);
202 register char *val = (char *) malloc (size);
205 fatal ("virtual memory exhausted");
214 char * result = (char *) realloc (ptr, size);
216 fatal ("virtual memory exhausted");
224 fprintf (stderr, "genattr: ");
225 fprintf (stderr, s, a1, a2);
226 fprintf (stderr, "\n");
227 exit (FATAL_EXIT_CODE);
230 /* More 'friendly' abort that prints the line and file.
231 config.h can #define abort fancy_abort if you like that sort of thing. */
236 fatal ("Internal gcc abort.");
248 int have_annul_true = 0;
249 int have_annul_false = 0;
251 struct range all_simultaneity, all_multiplicity;
252 struct range all_ready_cost, all_issue_delay, all_blockage;
253 struct function_unit *units = 0, *unit;
256 init_range (&all_multiplicity);
257 init_range (&all_simultaneity);
258 init_range (&all_ready_cost);
259 init_range (&all_issue_delay);
260 init_range (&all_blockage);
262 obstack_init (rtl_obstack);
265 fatal ("No input file name.");
267 infile = fopen (argv[1], "r");
271 exit (FATAL_EXIT_CODE);
276 printf ("/* Generated automatically by the program `genattr'\n\
277 from the machine description file `md'. */\n\n");
279 /* For compatibility, define the attribute `alternative', which is just
280 a reference to the variable `which_alternative'. */
282 printf ("#define HAVE_ATTR_alternative\n");
283 printf ("#define get_attr_alternative(insn) which_alternative\n");
285 /* Read the machine description. */
289 c = read_skip_spaces (infile);
294 desc = read_rtx (infile);
295 if (GET_CODE (desc) == DEFINE_ATTR)
298 else if (GET_CODE (desc) == DEFINE_DELAY)
302 printf ("#define DELAY_SLOTS\n");
303 printf ("extern int num_delay_slots PROTO((rtx));\n");
304 printf ("extern int eligible_for_delay PROTO((rtx, int, rtx, int));\n\n");
305 printf ("extern int const_num_delay_slots PROTO((rtx));\n\n");
309 for (i = 0; i < XVECLEN (desc, 1); i += 3)
311 if (XVECEXP (desc, 1, i + 1) && ! have_annul_true)
313 printf ("#define ANNUL_IFTRUE_SLOTS\n");
314 printf ("extern int eligible_for_annul_true ();\n");
318 if (XVECEXP (desc, 1, i + 2) && ! have_annul_false)
320 printf ("#define ANNUL_IFFALSE_SLOTS\n");
321 printf ("extern int eligible_for_annul_false ();\n");
322 have_annul_false = 1;
327 else if (GET_CODE (desc) == DEFINE_FUNCTION_UNIT)
329 char *name = XSTR (desc, 0);
330 int multiplicity = XINT (desc, 1);
331 int simultaneity = XINT (desc, 2);
332 int ready_cost = MAX (XINT (desc, 4), 1);
333 int issue_delay = MAX (XINT (desc, 5), 1);
334 int issueexp_p = (XVEC (desc, 6) != 0);
336 for (unit = units; unit; unit = unit->next)
337 if (strcmp (unit->name, name) == 0)
342 int len = strlen (name) + 1;
343 unit = (struct function_unit *)
344 alloca (sizeof (struct function_unit));
345 unit->name = (char *) alloca (len);
346 bcopy (name, unit->name, len);
347 unit->multiplicity = multiplicity;
348 unit->simultaneity = simultaneity;
349 unit->ready_cost.min = unit->ready_cost.max = ready_cost;
350 unit->issue_delay.min = unit->issue_delay.max = issue_delay;
355 extend_range (&all_multiplicity, multiplicity, multiplicity);
356 extend_range (&all_simultaneity, simultaneity, simultaneity);
358 else if (unit->multiplicity != multiplicity
359 || unit->simultaneity != simultaneity)
360 fatal ("Differing specifications given for `%s' function unit.",
363 extend_range (&unit->ready_cost, ready_cost, ready_cost);
364 extend_range (&unit->issue_delay,
365 issueexp_p ? 1 : issue_delay, issue_delay);
366 extend_range (&all_ready_cost,
367 unit->ready_cost.min, unit->ready_cost.max);
368 extend_range (&all_issue_delay,
369 unit->issue_delay.min, unit->issue_delay.max);
375 /* Compute the range of blockage cost values. See genattrtab.c
376 for the derivation. BLOCKAGE (E,C) when SIMULTANEITY is zero is
378 MAX (ISSUE-DELAY (E,C),
379 READY-COST (E) - (READY-COST (C) - 1))
383 MAX (ISSUE-DELAY (E,C),
384 READY-COST (E) - (READY-COST (C) - 1),
385 READY-COST (E) - FILL-TIME) */
387 for (unit = units; unit; unit = unit->next)
389 struct range blockage;
391 blockage = unit->issue_delay;
392 blockage.max = MAX (unit->ready_cost.max
393 - (unit->ready_cost.min - 1),
395 blockage.min = MAX (1, blockage.min);
397 if (unit->simultaneity != 0)
399 int fill_time = ((unit->simultaneity - 1)
400 * unit->issue_delay.min);
401 blockage.min = MAX (unit->ready_cost.min - fill_time,
403 blockage.max = MAX (unit->ready_cost.max - fill_time,
406 extend_range (&all_blockage, blockage.min, blockage.max);
409 write_units (num_units, &all_multiplicity, &all_simultaneity,
410 &all_ready_cost, &all_issue_delay, &all_blockage);
413 /* Output flag masks for use by reorg.
415 Flags are used to hold branch direction and prediction information
416 for use by eligible_for_... */
417 printf("\n#define ATTR_FLAG_forward\t0x1\n");
418 printf("#define ATTR_FLAG_backward\t0x2\n");
419 printf("#define ATTR_FLAG_likely\t0x4\n");
420 printf("#define ATTR_FLAG_very_likely\t0x8\n");
421 printf("#define ATTR_FLAG_unlikely\t0x10\n");
422 printf("#define ATTR_FLAG_very_unlikely\t0x20\n");
425 exit (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);