/* Generate code from machine description to perform peephole optimizations.
Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc.
This file is part of GNU CC.
GNU CC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
GNU CC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU CC; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
static struct obstack obstack
;
struct obstack
*rtl_obstack
= &obstack
;
#define obstack_chunk_alloc xmalloc
#define obstack_chunk_free free
/* While tree-walking an instruction pattern, we keep a chain
of these `struct link's to record how to get down to the
current position. In each one, POS is the operand number,
and if the operand is a vector VEC is the element number.
VEC is -1 if the operand is not a vector. */
static void match_rtx ();
/* Number of operands used in current peephole definition. */
/* Peephole optimizations get insn codes just like insn patterns.
Count them so we know the code of the define_peephole we are handling. */
static int insn_code_number
= 0;
static void print_path ();
static void print_code ();
int ninsns
= XVECLEN (peep
, 0);
printf (" insn = ins1;\n");
printf (" want_jump = 0;\n");
for (i
= 0; i
< ninsns
; i
++)
printf (" do { insn = NEXT_INSN (insn);\n");
printf (" if (insn == 0) goto L%d; }\n",
printf (" while (GET_CODE (insn) == NOTE\n");
printf ("\t || (GET_CODE (insn) == INSN\n");
printf ("\t && (GET_CODE (PATTERN (insn)) == USE\n");
printf ("\t\t || GET_CODE (PATTERN (insn)) == CLOBBER)));\n");
printf (" if (GET_CODE (insn) == CODE_LABEL\n\
|| GET_CODE (insn) == BARRIER)\n goto L%d;\n",
printf (" if (GET_CODE (insn) == JUMP_INSN)\n");
printf (" want_jump = JUMP_LABEL (insn);\n");
printf (" pat = PATTERN (insn);\n");
/* Walk the insn's pattern, remembering at all times the path
down to the walking point. */
match_rtx (XVECEXP (peep
, 0, i
), NULL_PTR
, insn_code_number
);
/* We get this far if the pattern matches.
Now test the extra condition. */
if (XSTR (peep
, 1) && XSTR (peep
, 1)[0])
printf (" if (! (%s)) goto L%d;\n",
XSTR (peep
, 1), insn_code_number
);
/* If that matches, construct new pattern and put it in the first insn.
This new pattern will never be matched.
It exists only so that insn-extract can get the operands back.
So use a simple regular form: a PARALLEL containing a vector
printf (" PATTERN (ins1) = gen_rtx (PARALLEL, VOIDmode, gen_rtvec_v (%d, operands));\n", n_operands
);
printf (" if (want_jump && GET_CODE (ins1) != JUMP_INSN)\n");
printf (" rtx insn2 = emit_jump_insn_before (PATTERN (ins1), ins1);\n");
printf (" delete_insn (ins1);\n");
printf (" ins1 = ins2;\n");
/* Record this define_peephole's insn code in the insn,
as if it had been recognized to match this. */
printf (" INSN_CODE (ins1) = %d;\n",
/* Delete the remaining insns. */
printf (" delete_for_peephole (NEXT_INSN (ins1), insn);\n");
/* See reload1.c for insertion of NOTE which guarantees that this
printf (" return NEXT_INSN (insn);\n");
printf (" L%d:\n\n", insn_code_number
);
match_rtx (x
, path
, fail_label
)
if (XINT (x
, 0) > max_opno
)
if (XINT (x
, 0) >= n_operands
)
n_operands
= 1 + XINT (x
, 0);
printf (" operands[%d] = x;\n", XINT (x
, 0));
if (XSTR (x
, 1) && XSTR (x
, 1)[0])
printf (" if (! %s (x, %smode)) goto L%d;\n",
XSTR (x
, 1), GET_MODE_NAME (GET_MODE (x
)), fail_label
);
printf (" if (!rtx_equal_p (operands[%d], x)) goto L%d;\n",
XINT (x
, 0), fail_label
);
printf (" if (GET_CODE (operands[%d]) != GET_CODE (x)\n", XINT (x
, 0));
printf (" || GET_MODE (operands[%d]) != GET_MODE (x)) goto L%d;\n",
XINT (x
, 0), fail_label
);
printf (" operands[%d] = x;\n", XINT (x
, 0));
for (i
= 0; i
< XVECLEN (x
, 1); i
++)
match_rtx (XVECEXP (x
, 1, i
), &link
, fail_label
);
if (XINT (x
, 0) > max_opno
)
if (XINT (x
, 0) >= n_operands
)
n_operands
= 1 + XINT (x
, 0);
printf (" operands[%d] = x;\n", XINT (x
, 0));
if (XSTR (x
, 1) && XSTR (x
, 1)[0])
printf (" if (! %s (x, %smode)) goto L%d;\n",
XSTR (x
, 1), GET_MODE_NAME (GET_MODE (x
)), fail_label
);
for (i
= 0; i
< XVECLEN (x
, 2); i
++)
match_rtx (XVECEXP (x
, 2, i
), &link
, fail_label
);
if (XINT (x
, 0) > max_opno
)
if (XINT (x
, 0) >= n_operands
)
n_operands
= 1 + XINT (x
, 0);
printf (" if (GET_CODE (x) != PARALLEL) goto L%d;\n", fail_label
);
printf (" operands[%d] = x;\n", XINT (x
, 0));
if (XSTR (x
, 1) && XSTR (x
, 1)[0])
printf (" if (! %s (x, %smode)) goto L%d;\n",
XSTR (x
, 1), GET_MODE_NAME (GET_MODE (x
)), fail_label
);
for (i
= 0; i
< XVECLEN (x
, 2); i
++)
match_rtx (XVECEXP (x
, 2, i
), &link
, fail_label
);
match_rtx (XEXP (x
, 0), path
, fail_label
);
printf (" if (GET_CODE (x) != ");
printf (") goto L%d;\n", fail_label
);
if (GET_MODE (x
) != VOIDmode
)
printf (" if (GET_MODE (x) != %smode) goto L%d;\n",
GET_MODE_NAME (GET_MODE (x
)), fail_label
);
fmt
= GET_RTX_FORMAT (code
);
len
= GET_RTX_LENGTH (code
);
for (i
= 0; i
< len
; i
++)
if (fmt
[i
] == 'e' || fmt
[i
] == 'u')
match_rtx (XEXP (x
, i
), &link
, fail_label
);
printf (" if (XVECLEN (x, %d) != %d) goto L%d;\n",
i
, XVECLEN (x
, i
), fail_label
);
for (j
= 0; j
< XVECLEN (x
, i
); j
++)
match_rtx (XVECEXP (x
, i
, j
), &link
, fail_label
);
/* Make sure that at run time `x' is the RTX we want to test. */
printf (" if (XINT (x, %d) != %d) goto L%d;\n",
i
, XINT (x
, i
), fail_label
);
/* Make sure that at run time `x' is the RTX we want to test. */
#if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
printf (" if (XWINT (x, %d) != %d) goto L%d;\n",
i
, XWINT (x
, i
), fail_label
);
printf (" if (XWINT (x, %d) != %ld) goto L%d;\n",
i
, XWINT (x
, i
), fail_label
);
/* Make sure that at run time `x' is the RTX we want to test. */
printf (" if (strcmp (XSTR (x, %d), \"%s\")) goto L%d;\n",
i
, XSTR (x
, i
), fail_label
);
/* Given a PATH, representing a path down the instruction's
pattern from the root to a certain point, output code to
evaluate to the rtx at that point. */
else if (path
->vecelt
>= 0)
printf (", %d, %d)", path
->pos
, path
->vecelt
);
printf (", %d)", path
->pos
);
for (p1
= GET_RTX_NAME (code
); *p1
; p1
++)
if (*p1
>= 'a' && *p1
<= 'z')
putchar (*p1
+ 'A' - 'a');
register char *val
= (char *) malloc (size
);
fatal ("virtual memory exhausted");
char *result
= (char *) realloc (ptr
, size
);
fatal ("virtual memory exhausted");
fprintf (stderr
, "genpeep: ");
fprintf (stderr
, s
, a1
, a2
);
/* More 'friendly' abort that prints the line and file.
config.h can #define abort fancy_abort if you like that sort of thing. */
fatal ("Internal gcc abort.");
obstack_init (rtl_obstack
);
fatal ("No input file name.");
infile
= fopen (argv
[1], "r");
printf ("/* Generated automatically by the program `genpeep'\n\
from the machine description file `md'. */\n\n");
printf ("#include \"config.h\"\n");
printf ("#include \"rtl.h\"\n");
printf ("#include \"regs.h\"\n");
printf ("#include \"output.h\"\n");
printf ("#include \"real.h\"\n\n");
printf ("extern rtx peep_operand[];\n\n");
printf ("#define operands peep_operand\n\n");
printf ("rtx\npeephole (ins1)\n rtx ins1;\n{\n");
printf (" rtx insn, x, pat;\n");
/* Early out: no peepholes for insns followed by barriers. */
printf (" if (NEXT_INSN (ins1)\n");
printf (" && GET_CODE (NEXT_INSN (ins1)) == BARRIER)\n");
printf (" return 0;\n\n");
/* Read the machine description. */
c
= read_skip_spaces (infile
);
desc
= read_rtx (infile
);
if (GET_CODE (desc
) == DEFINE_PEEPHOLE
)
if (GET_CODE (desc
) == DEFINE_INSN
|| GET_CODE (desc
) == DEFINE_EXPAND
|| GET_CODE (desc
) == DEFINE_SPLIT
)
printf (" return 0;\n}\n\n");
printf ("rtx peep_operand[%d];\n", max_opno
+ 1);
exit (ferror (stdout
) != 0 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);