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
;
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
PROTO((rtx
, int, int));
54 static void gen_insn
PROTO((rtx
));
55 static void gen_expand
PROTO((rtx
));
56 static void gen_split
PROTO((rtx
));
57 static void gen_peephole
PROTO((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);
88 if (XSTR (part
, 2) && *XSTR (part
, 2))
89 register_constraint_flag
= 1;
94 ++dup_operands_seen_this_insn
;
98 if (XINT (part
, 0) > max_recog_operands
)
99 max_recog_operands
= XINT (part
, 0);
100 /* Now scan the rtl's in the vector inside the MATCH_OPERATOR or
105 if (GET_CODE (XEXP (part
, 0)) == MATCH_OPERAND
)
110 ++dup_operands_seen_this_insn
;
111 if (XINT (part
, 0) > max_recog_operands
)
112 max_recog_operands
= XINT (part
, 0);
122 have_lo_sum_flag
= 1;
126 walk_insn_part (SET_DEST (part
), 0, recog_p
);
127 walk_insn_part (SET_SRC (part
), recog_p
,
128 GET_CODE (SET_DEST (part
)) != PC
);
132 /* Only consider this machine as having a conditional move if the
133 two arms of the IF_THEN_ELSE are both MATCH_OPERAND. Otherwise,
134 we have some specific IF_THEN_ELSE construct (like the doz
135 instruction on the RS/6000) that can't be used in the general
136 context we want it for. */
138 if (recog_p
&& non_pc_set_src
139 && GET_CODE (XEXP (part
, 1)) == MATCH_OPERAND
140 && GET_CODE (XEXP (part
, 2)) == MATCH_OPERAND
)
144 case REG
: case CONST_INT
: case SYMBOL_REF
:
152 format_ptr
= GET_RTX_FORMAT (GET_CODE (part
));
154 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (part
)); i
++)
155 switch (*format_ptr
++)
159 walk_insn_part (XEXP (part
, i
), recog_p
, non_pc_set_src
);
162 if (XVEC (part
, i
) != NULL
)
163 for (j
= 0; j
< XVECLEN (part
, i
); j
++)
164 walk_insn_part (XVECEXP (part
, i
, j
), recog_p
, non_pc_set_src
);
175 /* Walk the insn pattern to gather the #define's status. */
176 clobbers_seen_this_insn
= 0;
177 dup_operands_seen_this_insn
= 0;
178 if (XVEC (insn
, 1) != 0)
179 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
180 walk_insn_part (XVECEXP (insn
, 1, i
), 1, 0);
182 if (clobbers_seen_this_insn
> max_clobbers_per_insn
)
183 max_clobbers_per_insn
= clobbers_seen_this_insn
;
184 if (dup_operands_seen_this_insn
> max_dup_operands
)
185 max_dup_operands
= dup_operands_seen_this_insn
;
188 /* Similar but scan a define_expand. */
196 /* Walk the insn pattern to gather the #define's status. */
198 /* Note that we don't bother recording the number of MATCH_DUPs
199 that occur in a gen_expand, because only reload cares about that. */
200 if (XVEC (insn
, 1) != 0)
201 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
203 /* Compute the maximum SETs and CLOBBERS
204 in any one of the sub-insns;
205 don't sum across all of them. */
206 clobbers_seen_this_insn
= 0;
208 walk_insn_part (XVECEXP (insn
, 1, i
), 0, 0);
210 if (clobbers_seen_this_insn
> max_clobbers_per_insn
)
211 max_clobbers_per_insn
= clobbers_seen_this_insn
;
215 /* Similar but scan a define_split. */
223 /* Look through the patterns that are matched
224 to compute the maximum operand number. */
225 for (i
= 0; i
< XVECLEN (split
, 0); i
++)
226 walk_insn_part (XVECEXP (split
, 0, i
), 1, 0);
227 /* Look at the number of insns this insn could split into. */
228 if (XVECLEN (split
, 2) > max_insns_per_split
)
229 max_insns_per_split
= XVECLEN (split
, 2);
238 /* Look through the patterns that are matched
239 to compute the maximum operand number. */
240 for (i
= 0; i
< XVECLEN (peep
, 0); i
++)
241 walk_insn_part (XVECEXP (peep
, 0, i
), 1, 0);
248 register PTR val
= (PTR
) malloc (size
);
251 fatal ("virtual memory exhausted");
263 ptr
= (PTR
) realloc (old
, size
);
265 ptr
= (PTR
) malloc (size
);
267 fatal ("virtual memory exhausted");
280 progname
= "genconfig";
281 obstack_init (rtl_obstack
);
284 fatal ("No input file name.");
286 infile
= fopen (argv
[1], "r");
290 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_PEEPHOLE
)
322 printf ("\n#define MAX_RECOG_OPERANDS %d\n", max_recog_operands
+ 1);
324 printf ("\n#define MAX_DUP_OPERANDS %d\n", max_dup_operands
);
326 /* This is conditionally defined, in case the user writes code which emits
327 more splits than we can readily see (and knows s/he does it). */
328 printf ("#ifndef MAX_INSNS_PER_SPLIT\n#define MAX_INSNS_PER_SPLIT %d\n#endif\n",
329 max_insns_per_split
);
331 if (register_constraint_flag
)
332 printf ("#define REGISTER_CONSTRAINTS\n");
335 printf ("#define HAVE_cc0\n");
338 printf ("#define HAVE_conditional_move\n");
340 if (have_lo_sum_flag
)
341 printf ("#define HAVE_lo_sum\n");
344 exit (ferror (stdout
) != 0 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);