1 /* Generate from machine description:
2 - some #define configuration flags.
3 Copyright (C) 1987, 1991, 1997, 1998,
4 1999, 2000 Free Software Foundation, Inc.
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
30 static struct obstack obstack;
31 struct obstack *rtl_obstack = &obstack;
33 #define obstack_chunk_alloc xmalloc
34 #define obstack_chunk_free free
36 /* flags to determine output of machine description dependent #define's. */
37 static int max_recog_operands; /* Largest operand number seen. */
38 static int max_dup_operands; /* Largest number of match_dup in any insn. */
39 static int max_clobbers_per_insn;
40 static int have_cc0_flag;
41 static int have_cmove_flag;
42 static int have_cond_arith_flag;
43 static int have_lo_sum_flag;
44 static int have_peephole_flag;
45 static int have_peephole2_flag;
47 /* Maximum number of insns seen in a split. */
48 static int max_insns_per_split = 1;
50 static int clobbers_seen_this_insn;
51 static int dup_operands_seen_this_insn;
53 static void walk_insn_part PARAMS ((rtx, int, int));
54 static void gen_insn PARAMS ((rtx));
55 static void gen_expand PARAMS ((rtx));
56 static void gen_split PARAMS ((rtx));
57 static void gen_peephole PARAMS ((rtx));
59 /* RECOG_P will be non-zero if this pattern was seen in a context where it will
60 be used to recognize, rather than just generate an insn.
62 NON_PC_SET_SRC will be non-zero if this pattern was seen in a SET_SRC
63 of a SET whose destination is not (pc). */
66 walk_insn_part (part, recog_p, non_pc_set_src)
72 register RTX_CODE code;
73 register const char *format_ptr;
78 code = GET_CODE (part);
82 clobbers_seen_this_insn++;
86 if (XINT (part, 0) > max_recog_operands)
87 max_recog_operands = XINT (part, 0);
92 ++dup_operands_seen_this_insn;
96 if (XINT (part, 0) > max_recog_operands)
97 max_recog_operands = XINT (part, 0);
98 /* Now scan the rtl's in the vector inside the MATCH_OPERATOR or
103 if (GET_CODE (XEXP (part, 0)) == MATCH_OPERAND)
108 ++dup_operands_seen_this_insn;
109 if (XINT (part, 0) > max_recog_operands)
110 max_recog_operands = XINT (part, 0);
120 have_lo_sum_flag = 1;
124 walk_insn_part (SET_DEST (part), 0, recog_p);
125 walk_insn_part (SET_SRC (part), recog_p,
126 GET_CODE (SET_DEST (part)) != PC);
130 /* Only consider this machine as having a conditional move if the
131 two arms of the IF_THEN_ELSE are both MATCH_OPERAND. Otherwise,
132 we have some specific IF_THEN_ELSE construct (like the doz
133 instruction on the RS/6000) that can't be used in the general
134 context we want it for. If the first operand is an arithmetic
135 operation and the second is a MATCH_OPERNAND, show we have
136 conditional arithmetic. */
138 if (recog_p && non_pc_set_src
139 && GET_CODE (XEXP (part, 1)) == MATCH_OPERAND
140 && GET_CODE (XEXP (part, 2)) == MATCH_OPERAND)
142 else if (recog_p && non_pc_set_src
143 && (GET_RTX_CLASS (GET_CODE (XEXP (part, 1))) == '1'
144 || GET_RTX_CLASS (GET_CODE (XEXP (part, 1))) == '2'
145 || GET_RTX_CLASS (GET_CODE (XEXP (part, 1))) == 'c')
146 && GET_CODE (XEXP (XEXP (part, 1), 0)) == MATCH_OPERAND
147 && GET_CODE (XEXP (part, 2)) == MATCH_OPERAND)
148 have_cond_arith_flag = 1;
151 case REG: case CONST_INT: case SYMBOL_REF:
159 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
161 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
162 switch (*format_ptr++)
166 walk_insn_part (XEXP (part, i), recog_p, non_pc_set_src);
169 if (XVEC (part, i) != NULL)
170 for (j = 0; j < XVECLEN (part, i); j++)
171 walk_insn_part (XVECEXP (part, i, j), recog_p, non_pc_set_src);
182 /* Walk the insn pattern to gather the #define's status. */
183 clobbers_seen_this_insn = 0;
184 dup_operands_seen_this_insn = 0;
185 if (XVEC (insn, 1) != 0)
186 for (i = 0; i < XVECLEN (insn, 1); i++)
187 walk_insn_part (XVECEXP (insn, 1, i), 1, 0);
189 if (clobbers_seen_this_insn > max_clobbers_per_insn)
190 max_clobbers_per_insn = clobbers_seen_this_insn;
191 if (dup_operands_seen_this_insn > max_dup_operands)
192 max_dup_operands = dup_operands_seen_this_insn;
195 /* Similar but scan a define_expand. */
203 /* Walk the insn pattern to gather the #define's status. */
205 /* Note that we don't bother recording the number of MATCH_DUPs
206 that occur in a gen_expand, because only reload cares about that. */
207 if (XVEC (insn, 1) != 0)
208 for (i = 0; i < XVECLEN (insn, 1); i++)
210 /* Compute the maximum SETs and CLOBBERS
211 in any one of the sub-insns;
212 don't sum across all of them. */
213 clobbers_seen_this_insn = 0;
215 walk_insn_part (XVECEXP (insn, 1, i), 0, 0);
217 if (clobbers_seen_this_insn > max_clobbers_per_insn)
218 max_clobbers_per_insn = clobbers_seen_this_insn;
222 /* Similar but scan a define_split. */
230 /* Look through the patterns that are matched
231 to compute the maximum operand number. */
232 for (i = 0; i < XVECLEN (split, 0); i++)
233 walk_insn_part (XVECEXP (split, 0, i), 1, 0);
234 /* Look at the number of insns this insn could split into. */
235 if (XVECLEN (split, 2) > max_insns_per_split)
236 max_insns_per_split = XVECLEN (split, 2);
245 /* Look through the patterns that are matched
246 to compute the maximum operand number. */
247 for (i = 0; i < XVECLEN (peep, 0); i++)
248 walk_insn_part (XVECEXP (peep, 0, i), 1, 0);
255 register PTR val = (PTR) malloc (size);
258 fatal ("virtual memory exhausted");
270 ptr = (PTR) realloc (old, size);
272 ptr = (PTR) malloc (size);
274 fatal ("virtual memory exhausted");
278 extern int main PARAMS ((int, char **));
289 progname = "genconfig";
290 obstack_init (rtl_obstack);
293 fatal ("No input file name.");
295 infile = fopen (argv[1], "r");
299 return (FATAL_EXIT_CODE);
301 read_rtx_filename = argv[1];
303 printf ("/* Generated automatically by the program `genconfig'\n\
304 from the machine description file `md'. */\n\n");
306 /* Allow at least 10 operands for the sake of asm constructs. */
307 max_recog_operands = 9; /* We will add 1 later. */
308 max_dup_operands = 1;
310 /* Read the machine description. */
314 c = read_skip_spaces (infile);
319 desc = read_rtx (infile);
320 if (GET_CODE (desc) == DEFINE_INSN)
322 if (GET_CODE (desc) == DEFINE_EXPAND)
324 if (GET_CODE (desc) == DEFINE_SPLIT)
326 if (GET_CODE (desc) == DEFINE_PEEPHOLE2)
328 have_peephole2_flag = 1;
331 if (GET_CODE (desc) == DEFINE_PEEPHOLE)
333 have_peephole_flag = 1;
338 printf ("\n#define MAX_RECOG_OPERANDS %d\n", max_recog_operands + 1);
340 printf ("\n#define MAX_DUP_OPERANDS %d\n", max_dup_operands);
342 /* This is conditionally defined, in case the user writes code which emits
343 more splits than we can readily see (and knows s/he does it). */
344 printf ("#ifndef MAX_INSNS_PER_SPLIT\n#define MAX_INSNS_PER_SPLIT %d\n#endif\n",
345 max_insns_per_split);
348 printf ("#define HAVE_cc0\n");
351 printf ("#define HAVE_conditional_move\n");
354 /* Disabled. See the discussion in jump.c. */
355 if (have_cond_arith_flag)
356 printf ("#define HAVE_conditional_arithmetic\n");
359 if (have_lo_sum_flag)
360 printf ("#define HAVE_lo_sum\n");
362 if (have_peephole_flag)
363 printf ("#define HAVE_peephole\n");
365 if (have_peephole2_flag)
366 printf ("#define HAVE_peephole2\n");
369 return (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
372 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
375 int code ATTRIBUTE_UNUSED;