1 /* Generate code from machine description to extract operands from insn as rtl.
2 Copyright (C) 1987, 1991, 1992 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
25 #include "insn-config.h"
27 static struct obstack obstack;
28 struct obstack *rtl_obstack = &obstack;
30 #define obstack_chunk_alloc xmalloc
31 #define obstack_chunk_free free
35 /* This structure contains all the information needed to describe one
36 set of extractions methods. Each method may be used by more than
37 one pattern if the operands are in the same place.
39 The string for each operand describes that path to the operand and
40 contains `0' through `9' when going into an expression and `a' through
41 `z' when going into a vector. We assume here that only the first operand
42 of an rtl expression is a vector. genrecog.c makes the same assumption
43 (and uses the same representation) and it is currently true. */
48 char *oplocs[MAX_RECOG_OPERANDS];
50 char *duplocs[MAX_DUP_OPERANDS];
51 int dupnums[MAX_DUP_OPERANDS];
52 struct code_ptr *insns;
53 struct extraction *next;
56 /* Holds a single insn code that use an extraction method. */
61 struct code_ptr *next;
64 static struct extraction *extractions;
66 /* Number instruction patterns handled, starting at 0 for first one. */
68 static int insn_code_number;
70 /* Records the large operand number in this insn. */
74 /* Records the location of any operands using the string format described
77 static char *oplocs[MAX_RECOG_OPERANDS];
79 /* Number the occurrences of MATCH_DUP in each instruction,
80 starting at 0 for the first occurrence. */
84 /* Records the location of any MATCH_DUP operands. */
86 static char *duplocs[MAX_DUP_OPERANDS];
88 /* Record the operand number of any MATCH_DUPs. */
90 static int dupnums[MAX_DUP_OPERANDS];
92 /* Record the list of insn_codes for peepholes. */
94 static struct code_ptr *peepholes;
96 static void walk_rtx ();
97 static void print_path ();
100 static void fatal ();
101 static char *copystr ();
102 static void mybzero ();
110 register struct extraction *p;
111 register struct code_ptr *link;
116 /* No operands seen so far in this pattern. */
117 mybzero (oplocs, sizeof oplocs);
119 /* Walk the insn's pattern, remembering at all times the path
120 down to the walking point. */
122 if (XVECLEN (insn, 1) == 1)
123 walk_rtx (XVECEXP (insn, 1, 0), "");
125 for (i = XVECLEN (insn, 1) - 1; i >= 0; i--)
127 char *path = (char *) alloca (2);
132 walk_rtx (XVECEXP (insn, 1, i), path);
135 link = (struct code_ptr *) xmalloc (sizeof (struct code_ptr));
136 link->insn_code = insn_code_number;
138 /* See if we find something that already had this extraction method. */
140 for (p = extractions; p; p = p->next)
142 if (p->op_count != op_count || p->dup_count != dup_count)
145 for (i = 0; i < op_count; i++)
146 if (p->oplocs[i] != oplocs[i]
147 && ! (p->oplocs[i] != 0 && oplocs[i] != 0
148 && ! strcmp (p->oplocs[i], oplocs[i])))
154 for (i = 0; i < dup_count; i++)
155 if (p->dupnums[i] != dupnums[i]
156 || strcmp (p->duplocs[i], duplocs[i]))
162 /* This extraction is the same as ours. Just link us in. */
163 link->next = p->insns;
168 /* Otherwise, make a new extraction method. */
170 p = (struct extraction *) xmalloc (sizeof (struct extraction));
171 p->op_count = op_count;
172 p->dup_count = dup_count;
173 p->next = extractions;
178 for (i = 0; i < op_count; i++)
179 p->oplocs[i] = oplocs[i];
181 for (i = 0; i < dup_count; i++)
182 p->dupnums[i] = dupnums[i], p->duplocs[i] = duplocs[i];
190 register RTX_CODE code;
194 register struct code_ptr *link;
195 int depth = strlen (path);
213 oplocs[XINT (x, 0)] = copystr (path);
214 op_count = MAX (op_count, XINT (x, 0) + 1);
219 duplocs[dup_count] = copystr (path);
220 dupnums[dup_count] = XINT (x, 0);
225 oplocs[XINT (x, 0)] = copystr (path);
226 op_count = MAX (op_count, XINT (x, 0) + 1);
228 newpath = (char *) alloca (depth + 2);
229 strcpy (newpath, path);
230 newpath[depth + 1] = 0;
232 for (i = XVECLEN (x, 2) - 1; i >= 0; i--)
234 newpath[depth] = '0' + i;
235 walk_rtx (XVECEXP (x, 2, i), newpath);
240 oplocs[XINT (x, 0)] = copystr (path);
241 op_count = MAX (op_count, XINT (x, 0) + 1);
243 newpath = (char *) alloca (depth + 2);
244 strcpy (newpath, path);
245 newpath[depth + 1] = 0;
247 for (i = XVECLEN (x, 2) - 1; i >= 0; i--)
249 newpath[depth] = 'a' + i;
250 walk_rtx (XVECEXP (x, 2, i), newpath);
255 walk_rtx (XEXP (x, 0), path);
259 newpath = (char *) alloca (depth + 2);
260 strcpy (newpath, path);
261 newpath[depth + 1] = 0;
263 fmt = GET_RTX_FORMAT (code);
264 len = GET_RTX_LENGTH (code);
265 for (i = 0; i < len; i++)
267 if (fmt[i] == 'e' || fmt[i] == 'u')
269 newpath[depth] = '0' + i;
270 walk_rtx (XEXP (x, i), newpath);
272 else if (fmt[i] == 'E')
275 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
277 newpath[depth] = 'a' + j;
278 walk_rtx (XVECEXP (x, i, j), newpath);
284 /* Given a PATH, representing a path down the instruction's
285 pattern from the root to a certain point, output code to
286 evaluate to the rtx at that point. */
292 register int len = strlen (path);
295 /* We first write out the operations (XEXP or XVECEXP) in reverse
296 order, then write "insn", then the indices in forward order. */
298 for (i = len - 1; i >=0 ; i--)
300 if (path[i] >= 'a' && path[i] <= 'z')
301 printf ("XVECEXP (");
302 else if (path[i] >= '0' && path[i] <= '9')
310 for (i = 0; i < len; i++)
312 if (path[i] >= 'a' && path[i] <= 'z')
313 printf (", 0, %d)", path[i] - 'a');
314 else if (path[i] >= '0' && path[i] <= '9')
315 printf (", %d)", path[i] - '0');
325 register char *val = (char *) malloc (size);
328 fatal ("virtual memory exhausted");
337 char *result = (char *) realloc (ptr, size);
339 fatal ("virtual memory exhausted");
347 fprintf (stderr, "genextract: ");
348 fprintf (stderr, s, a1, a2);
349 fprintf (stderr, "\n");
350 exit (FATAL_EXIT_CODE);
353 /* More 'friendly' abort that prints the line and file.
354 config.h can #define abort fancy_abort if you like that sort of thing. */
359 fatal ("Internal gcc abort.");
371 tem = (char *) xmalloc (strlen (s1) + 1);
380 register unsigned length;
393 extern rtx read_rtx ();
395 struct extraction *p;
396 struct code_ptr *link;
398 obstack_init (rtl_obstack);
401 fatal ("No input file name.");
403 infile = fopen (argv[1], "r");
407 exit (FATAL_EXIT_CODE);
412 /* Assign sequential codes to all entries in the machine description
413 in parallel with the tables in insn-output.c. */
415 insn_code_number = 0;
417 printf ("/* Generated automatically by the program `genextract'\n\
418 from the machine description file `md'. */\n\n");
420 printf ("#include \"config.h\"\n");
421 printf ("#include \"rtl.h\"\n\n");
423 /* This variable exists only so it can be the "location"
424 of any missing operand whose numbers are skipped by a given pattern. */
425 printf ("static rtx junk;\n");
427 printf ("extern rtx recog_operand[];\n");
428 printf ("extern rtx *recog_operand_loc[];\n");
429 printf ("extern rtx *recog_dup_loc[];\n");
430 printf ("extern char recog_dup_num[];\n");
431 printf ("extern\n#ifdef __GNUC__\nvolatile\n#endif\n");
432 printf ("void fatal_insn_not_found ();\n\n");
434 printf ("void\ninsn_extract (insn)\n");
435 printf (" rtx insn;\n");
437 printf (" register rtx *ro = recog_operand;\n");
438 printf (" register rtx **ro_loc = recog_operand_loc;\n");
439 printf (" int insn_code = INSN_CODE (insn);\n");
440 printf (" insn = PATTERN (insn);\n");
441 printf (" switch (insn_code)\n");
443 printf (" case -1:\n");
444 printf (" fatal_insn_not_found (insn);\n\n");
446 /* Read the machine description. */
450 c = read_skip_spaces (infile);
455 desc = read_rtx (infile);
456 if (GET_CODE (desc) == DEFINE_INSN)
462 else if (GET_CODE (desc) == DEFINE_PEEPHOLE)
464 struct code_ptr *link
465 = (struct code_ptr *) xmalloc (sizeof (struct code_ptr));
467 link->insn_code = insn_code_number;
468 link->next = peepholes;
473 else if (GET_CODE (desc) == DEFINE_EXPAND
474 || GET_CODE (desc) == DEFINE_SPLIT)
478 /* Write out code to handle peepholes and the insn_codes that it should
482 for (link = peepholes; link; link = link->next)
483 printf (" case %d:\n", link->insn_code);
485 /* The vector in the insn says how many operands it has.
486 And all it contains are operands. In fact, the vector was
487 created just for the sake of this function. */
488 printf ("#if __GNUC__ > 1 && !defined (bcopy)\n");
489 printf ("#define bcopy(FROM,TO,COUNT) __builtin_memcpy(TO,FROM,COUNT)\n");
491 printf (" bcopy (&XVECEXP (insn, 0, 0), ro,\n");
492 printf (" sizeof (rtx) * XVECLEN (insn, 0));\n");
493 printf (" break;\n\n");
496 /* Write out all the ways to extract insn operands. */
497 for (p = extractions; p; p = p->next)
499 for (link = p->insns; link; link = link->next)
500 printf (" case %d:\n", link->insn_code);
502 for (i = 0; i < p->op_count; i++)
504 if (p->oplocs[i] == 0)
506 printf (" ro[%d] = const0_rtx;\n", i);
507 printf (" ro_loc[%d] = &junk;\n", i, i);
511 printf (" ro[%d] = *(ro_loc[%d] = &", i, i);
512 print_path (p->oplocs[i]);
517 for (i = 0; i < p->dup_count; i++)
519 printf (" recog_dup_loc[%d] = &", i);
520 print_path (p->duplocs[i]);
522 printf (" recog_dup_num[%d] = %d;\n", i, p->dupnums[i]);
525 printf (" break;\n\n");
528 /* This should never be reached. Note that we would also reach this abort
529 if we tried to extract something whose INSN_CODE was a DEFINE_EXPAND or
530 DEFINE_SPLIT, but that is correct. */
531 printf (" default:\n abort ();\n");
536 exit (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);