1 /* Generate from machine description:
2 - some #define configuration flags.
3 Copyright (C) 1987, 1991, 1997, 1998, 1999 Free Software Foundation, Inc.
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. */
29 static struct obstack obstack;
30 struct obstack *rtl_obstack = &obstack;
32 #define obstack_chunk_alloc xmalloc
33 #define obstack_chunk_free free
35 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
36 char **insn_name_ptr = 0;
38 /* flags to determine output of machine description dependent #define's. */
39 static int max_recog_operands; /* Largest operand number seen. */
40 static int max_dup_operands; /* Largest number of match_dup in any insn. */
41 static int max_clobbers_per_insn;
42 static int register_constraint_flag;
43 static int have_cc0_flag;
44 static int have_cmove_flag;
45 static int have_lo_sum_flag;
46 static int have_peephole_flag;
47 static int have_peephole2_flag;
49 /* Maximum number of insns seen in a split. */
50 static int max_insns_per_split = 1;
52 static int clobbers_seen_this_insn;
53 static int dup_operands_seen_this_insn;
55 static void walk_insn_part PROTO((rtx, int, int));
56 static void gen_insn PROTO((rtx));
57 static void gen_expand PROTO((rtx));
58 static void gen_split PROTO((rtx));
59 static void gen_peephole PROTO((rtx));
61 /* RECOG_P will be non-zero if this pattern was seen in a context where it will
62 be used to recognize, rather than just generate an insn.
64 NON_PC_SET_SRC will be non-zero if this pattern was seen in a SET_SRC
65 of a SET whose destination is not (pc). */
68 walk_insn_part (part, recog_p, non_pc_set_src)
74 register RTX_CODE code;
75 register const char *format_ptr;
80 code = GET_CODE (part);
84 clobbers_seen_this_insn++;
88 if (XINT (part, 0) > max_recog_operands)
89 max_recog_operands = XINT (part, 0);
90 if (XSTR (part, 2) && *XSTR (part, 2))
91 register_constraint_flag = 1;
96 ++dup_operands_seen_this_insn;
100 if (XINT (part, 0) > max_recog_operands)
101 max_recog_operands = XINT (part, 0);
102 /* Now scan the rtl's in the vector inside the MATCH_OPERATOR or
107 if (GET_CODE (XEXP (part, 0)) == MATCH_OPERAND)
112 ++dup_operands_seen_this_insn;
113 if (XINT (part, 0) > max_recog_operands)
114 max_recog_operands = XINT (part, 0);
124 have_lo_sum_flag = 1;
128 walk_insn_part (SET_DEST (part), 0, recog_p);
129 walk_insn_part (SET_SRC (part), recog_p,
130 GET_CODE (SET_DEST (part)) != PC);
134 /* Only consider this machine as having a conditional move if the
135 two arms of the IF_THEN_ELSE are both MATCH_OPERAND. Otherwise,
136 we have some specific IF_THEN_ELSE construct (like the doz
137 instruction on the RS/6000) that can't be used in the general
138 context we want it for. */
140 if (recog_p && non_pc_set_src
141 && GET_CODE (XEXP (part, 1)) == MATCH_OPERAND
142 && GET_CODE (XEXP (part, 2)) == MATCH_OPERAND)
146 case REG: case CONST_INT: case SYMBOL_REF:
154 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
156 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
157 switch (*format_ptr++)
161 walk_insn_part (XEXP (part, i), recog_p, non_pc_set_src);
164 if (XVEC (part, i) != NULL)
165 for (j = 0; j < XVECLEN (part, i); j++)
166 walk_insn_part (XVECEXP (part, i, j), recog_p, non_pc_set_src);
177 /* Walk the insn pattern to gather the #define's status. */
178 clobbers_seen_this_insn = 0;
179 dup_operands_seen_this_insn = 0;
180 if (XVEC (insn, 1) != 0)
181 for (i = 0; i < XVECLEN (insn, 1); i++)
182 walk_insn_part (XVECEXP (insn, 1, i), 1, 0);
184 if (clobbers_seen_this_insn > max_clobbers_per_insn)
185 max_clobbers_per_insn = clobbers_seen_this_insn;
186 if (dup_operands_seen_this_insn > max_dup_operands)
187 max_dup_operands = dup_operands_seen_this_insn;
190 /* Similar but scan a define_expand. */
198 /* Walk the insn pattern to gather the #define's status. */
200 /* Note that we don't bother recording the number of MATCH_DUPs
201 that occur in a gen_expand, because only reload cares about that. */
202 if (XVEC (insn, 1) != 0)
203 for (i = 0; i < XVECLEN (insn, 1); i++)
205 /* Compute the maximum SETs and CLOBBERS
206 in any one of the sub-insns;
207 don't sum across all of them. */
208 clobbers_seen_this_insn = 0;
210 walk_insn_part (XVECEXP (insn, 1, i), 0, 0);
212 if (clobbers_seen_this_insn > max_clobbers_per_insn)
213 max_clobbers_per_insn = clobbers_seen_this_insn;
217 /* Similar but scan a define_split. */
225 /* Look through the patterns that are matched
226 to compute the maximum operand number. */
227 for (i = 0; i < XVECLEN (split, 0); i++)
228 walk_insn_part (XVECEXP (split, 0, i), 1, 0);
229 /* Look at the number of insns this insn could split into. */
230 if (XVECLEN (split, 2) > max_insns_per_split)
231 max_insns_per_split = XVECLEN (split, 2);
240 /* Look through the patterns that are matched
241 to compute the maximum operand number. */
242 for (i = 0; i < XVECLEN (peep, 0); i++)
243 walk_insn_part (XVECEXP (peep, 0, i), 1, 0);
250 register PTR val = (PTR) malloc (size);
253 fatal ("virtual memory exhausted");
265 ptr = (PTR) realloc (old, size);
267 ptr = (PTR) malloc (size);
269 fatal ("virtual memory exhausted");
282 progname = "genconfig";
283 obstack_init (rtl_obstack);
286 fatal ("No input file name.");
288 infile = fopen (argv[1], "r");
292 exit (FATAL_EXIT_CODE);
295 printf ("/* Generated automatically by the program `genconfig'\n\
296 from the machine description file `md'. */\n\n");
298 /* Allow at least 10 operands for the sake of asm constructs. */
299 max_recog_operands = 9; /* We will add 1 later. */
300 max_dup_operands = 1;
302 /* Read the machine description. */
306 c = read_skip_spaces (infile);
311 desc = read_rtx (infile);
312 if (GET_CODE (desc) == DEFINE_INSN)
314 if (GET_CODE (desc) == DEFINE_EXPAND)
316 if (GET_CODE (desc) == DEFINE_SPLIT)
318 if (GET_CODE (desc) == DEFINE_PEEPHOLE2)
320 have_peephole2_flag = 1;
323 if (GET_CODE (desc) == DEFINE_PEEPHOLE)
325 have_peephole_flag = 1;
330 printf ("\n#define MAX_RECOG_OPERANDS %d\n", max_recog_operands + 1);
332 printf ("\n#define MAX_DUP_OPERANDS %d\n", max_dup_operands);
334 /* This is conditionally defined, in case the user writes code which emits
335 more splits than we can readily see (and knows s/he does it). */
336 printf ("#ifndef MAX_INSNS_PER_SPLIT\n#define MAX_INSNS_PER_SPLIT %d\n#endif\n",
337 max_insns_per_split);
339 if (register_constraint_flag)
340 printf ("#define REGISTER_CONSTRAINTS\n");
343 printf ("#define HAVE_cc0\n");
346 printf ("#define HAVE_conditional_move\n");
348 if (have_lo_sum_flag)
349 printf ("#define HAVE_lo_sum\n");
351 if (have_peephole_flag)
352 printf ("#define HAVE_peephole\n");
354 if (have_peephole2_flag)
355 printf ("#define HAVE_peephole2\n");
358 exit (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);