1 /* Generate code from machine description to perform peephole optimizations.
2 Copyright (C) 1987, 1989, 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. */
26 static struct obstack obstack
;
27 struct obstack
*rtl_obstack
= &obstack
;
29 #define obstack_chunk_alloc xmalloc
30 #define obstack_chunk_free free
33 extern rtx
read_rtx ();
35 /* While tree-walking an instruction pattern, we keep a chain
36 of these `struct link's to record how to get down to the
37 current position. In each one, POS is the operand number,
38 and if the operand is a vector VEC is the element number.
39 VEC is -1 if the operand is not a vector. */
49 static void match_rtx ();
50 static void gen_exp ();
56 /* Number of operands used in current peephole definition. */
58 static int n_operands
;
60 /* Peephole optimizations get insn codes just like insn patterns.
61 Count them so we know the code of the define_peephole we are handling. */
63 static int insn_code_number
= 0;
65 static void print_path ();
66 static void print_code ();
72 int ninsns
= XVECLEN (peep
, 0);
77 printf (" insn = ins1;\n");
79 printf (" want_jump = 0;\n");
82 for (i
= 0; i
< ninsns
; i
++)
86 printf (" do { insn = NEXT_INSN (insn);\n");
87 printf (" if (insn == 0) goto L%d; }\n",
89 printf (" while (GET_CODE (insn) == NOTE\n");
90 printf ("\t || (GET_CODE (insn) == INSN\n");
91 printf ("\t && (GET_CODE (PATTERN (insn)) == USE\n");
92 printf ("\t\t || GET_CODE (PATTERN (insn)) == CLOBBER)));\n");
94 printf (" if (GET_CODE (insn) == CODE_LABEL\n\
95 || GET_CODE (insn) == BARRIER)\n goto L%d;\n",
100 printf (" if (GET_CODE (insn) == JUMP_INSN)\n");
101 printf (" want_jump = JUMP_LABEL (insn);\n");
104 printf (" pat = PATTERN (insn);\n");
106 /* Walk the insn's pattern, remembering at all times the path
107 down to the walking point. */
109 match_rtx (XVECEXP (peep
, 0, i
), NULL_PTR
, insn_code_number
);
112 /* We get this far if the pattern matches.
113 Now test the extra condition. */
115 if (XSTR (peep
, 1) && XSTR (peep
, 1)[0])
116 printf (" if (! (%s)) goto L%d;\n",
117 XSTR (peep
, 1), insn_code_number
);
119 /* If that matches, construct new pattern and put it in the first insn.
120 This new pattern will never be matched.
121 It exists only so that insn-extract can get the operands back.
122 So use a simple regular form: a PARALLEL containing a vector
123 of all the operands. */
125 printf (" PATTERN (ins1) = gen_rtx (PARALLEL, VOIDmode, gen_rtvec_v (%d, operands));\n", n_operands
);
128 printf (" if (want_jump && GET_CODE (ins1) != JUMP_INSN)\n");
130 printf (" rtx insn2 = emit_jump_insn_before (PATTERN (ins1), ins1);\n");
131 printf (" delete_insn (ins1);\n");
132 printf (" ins1 = ins2;\n");
136 /* Record this define_peephole's insn code in the insn,
137 as if it had been recognized to match this. */
138 printf (" INSN_CODE (ins1) = %d;\n",
141 /* Delete the remaining insns. */
143 printf (" delete_for_peephole (NEXT_INSN (ins1), insn);\n");
145 /* See reload1.c for insertion of NOTE which guarantees that this
147 printf (" return NEXT_INSN (insn);\n");
149 printf (" L%d:\n\n", insn_code_number
);
153 match_rtx (x
, path
, fail_label
)
158 register RTX_CODE code
;
173 if (XINT (x
, 0) > max_opno
)
174 max_opno
= XINT (x
, 0);
175 if (XINT (x
, 0) >= n_operands
)
176 n_operands
= 1 + XINT (x
, 0);
182 printf (" operands[%d] = x;\n", XINT (x
, 0));
183 if (XSTR (x
, 1) && XSTR (x
, 1)[0])
184 printf (" if (! %s (x, %smode)) goto L%d;\n",
185 XSTR (x
, 1), GET_MODE_NAME (GET_MODE (x
)), fail_label
);
194 printf (" if (!rtx_equal_p (operands[%d], x)) goto L%d;\n",
195 XINT (x
, 0), fail_label
);
203 printf (" if (GET_CODE (operands[%d]) != GET_CODE (x)\n", XINT (x
, 0));
204 printf (" || GET_MODE (operands[%d]) != GET_MODE (x)) goto L%d;\n",
205 XINT (x
, 0), fail_label
);
206 printf (" operands[%d] = x;\n", XINT (x
, 0));
209 for (i
= 0; i
< XVECLEN (x
, 1); i
++)
212 match_rtx (XVECEXP (x
, 1, i
), &link
, fail_label
);
217 if (XINT (x
, 0) > max_opno
)
218 max_opno
= XINT (x
, 0);
219 if (XINT (x
, 0) >= n_operands
)
220 n_operands
= 1 + XINT (x
, 0);
226 printf (" operands[%d] = x;\n", XINT (x
, 0));
227 if (XSTR (x
, 1) && XSTR (x
, 1)[0])
228 printf (" if (! %s (x, %smode)) goto L%d;\n",
229 XSTR (x
, 1), GET_MODE_NAME (GET_MODE (x
)), fail_label
);
232 for (i
= 0; i
< XVECLEN (x
, 2); i
++)
235 match_rtx (XVECEXP (x
, 2, i
), &link
, fail_label
);
240 if (XINT (x
, 0) > max_opno
)
241 max_opno
= XINT (x
, 0);
242 if (XINT (x
, 0) >= n_operands
)
243 n_operands
= 1 + XINT (x
, 0);
249 printf (" if (GET_CODE (x) != PARALLEL) goto L%d;\n", fail_label
);
250 printf (" operands[%d] = x;\n", XINT (x
, 0));
251 if (XSTR (x
, 1) && XSTR (x
, 1)[0])
252 printf (" if (! %s (x, %smode)) goto L%d;\n",
253 XSTR (x
, 1), GET_MODE_NAME (GET_MODE (x
)), fail_label
);
256 for (i
= 0; i
< XVECLEN (x
, 2); i
++)
259 match_rtx (XVECEXP (x
, 2, i
), &link
, fail_label
);
264 match_rtx (XEXP (x
, 0), path
, fail_label
);
272 printf (" if (GET_CODE (x) != ");
274 printf (") goto L%d;\n", fail_label
);
276 if (GET_MODE (x
) != VOIDmode
)
278 printf (" if (GET_MODE (x) != %smode) goto L%d;\n",
279 GET_MODE_NAME (GET_MODE (x
)), fail_label
);
284 fmt
= GET_RTX_FORMAT (code
);
285 len
= GET_RTX_LENGTH (code
);
286 for (i
= 0; i
< len
; i
++)
289 if (fmt
[i
] == 'e' || fmt
[i
] == 'u')
290 match_rtx (XEXP (x
, i
), &link
, fail_label
);
291 else if (fmt
[i
] == 'E')
294 printf (" if (XVECLEN (x, %d) != %d) goto L%d;\n",
295 i
, XVECLEN (x
, i
), fail_label
);
296 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
299 match_rtx (XVECEXP (x
, i
, j
), &link
, fail_label
);
302 else if (fmt
[i
] == 'i')
304 /* Make sure that at run time `x' is the RTX we want to test. */
312 printf (" if (XINT (x, %d) != %d) goto L%d;\n",
313 i
, XINT (x
, i
), fail_label
);
315 else if (fmt
[i
] == 'w')
317 /* Make sure that at run time `x' is the RTX we want to test. */
325 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
326 printf (" if (XWINT (x, %d) != %d) goto L%d;\n",
327 i
, XWINT (x
, i
), fail_label
);
329 printf (" if (XWINT (x, %d) != %ld) goto L%d;\n",
330 i
, XWINT (x
, i
), fail_label
);
333 else if (fmt
[i
] == 's')
335 /* Make sure that at run time `x' is the RTX we want to test. */
343 printf (" if (strcmp (XSTR (x, %d), \"%s\")) goto L%d;\n",
344 i
, XSTR (x
, i
), fail_label
);
349 /* Given a PATH, representing a path down the instruction's
350 pattern from the root to a certain point, output code to
351 evaluate to the rtx at that point. */
359 else if (path
->vecelt
>= 0)
361 printf ("XVECEXP (");
362 print_path (path
->next
);
363 printf (", %d, %d)", path
->pos
, path
->vecelt
);
368 print_path (path
->next
);
369 printf (", %d)", path
->pos
);
378 for (p1
= GET_RTX_NAME (code
); *p1
; p1
++)
380 if (*p1
>= 'a' && *p1
<= 'z')
381 putchar (*p1
+ 'A' - 'a');
391 register char *val
= (char *) malloc (size
);
394 fatal ("virtual memory exhausted");
403 char *result
= (char *) realloc (ptr
, size
);
405 fatal ("virtual memory exhausted");
413 fprintf (stderr
, "genpeep: ");
414 fprintf (stderr
, s
, a1
, a2
);
415 fprintf (stderr
, "\n");
416 exit (FATAL_EXIT_CODE
);
419 /* More 'friendly' abort that prints the line and file.
420 config.h can #define abort fancy_abort if you like that sort of thing. */
425 fatal ("Internal gcc abort.");
439 obstack_init (rtl_obstack
);
442 fatal ("No input file name.");
444 infile
= fopen (argv
[1], "r");
448 exit (FATAL_EXIT_CODE
);
453 printf ("/* Generated automatically by the program `genpeep'\n\
454 from the machine description file `md'. */\n\n");
456 printf ("#include \"config.h\"\n");
457 printf ("#include \"rtl.h\"\n");
458 printf ("#include \"regs.h\"\n");
459 printf ("#include \"output.h\"\n");
460 printf ("#include \"real.h\"\n\n");
462 printf ("extern rtx peep_operand[];\n\n");
463 printf ("#define operands peep_operand\n\n");
465 printf ("rtx\npeephole (ins1)\n rtx ins1;\n{\n");
466 printf (" rtx insn, x, pat;\n");
467 printf (" int i;\n\n");
469 /* Early out: no peepholes for insns followed by barriers. */
470 printf (" if (NEXT_INSN (ins1)\n");
471 printf (" && GET_CODE (NEXT_INSN (ins1)) == BARRIER)\n");
472 printf (" return 0;\n\n");
474 /* Read the machine description. */
478 c
= read_skip_spaces (infile
);
483 desc
= read_rtx (infile
);
484 if (GET_CODE (desc
) == DEFINE_PEEPHOLE
)
489 if (GET_CODE (desc
) == DEFINE_INSN
490 || GET_CODE (desc
) == DEFINE_EXPAND
491 || GET_CODE (desc
) == DEFINE_SPLIT
)
497 printf (" return 0;\n}\n\n");
502 printf ("rtx peep_operand[%d];\n", max_opno
+ 1);
505 exit (ferror (stdout
) != 0 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);