|
|
1.1 root 1: /* Declarations for interface to insn recognizer and insn-output.c.
2: Copyright (C) 1987 Free Software Foundation, Inc.
3:
4: This file is part of GNU CC.
5:
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)
9: any later version.
10:
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.
15:
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. */
19:
20: /* Add prototype support. */
21: #ifndef PROTO
22: #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
23: #define PROTO(ARGS) ARGS
24: #else
25: #define PROTO(ARGS) ()
26: #endif
27: #endif
28:
29: /* Recognize an insn and return its insn-code,
30: which is the sequence number of the DEFINE_INSN that it matches.
31: If the insn does not match, return -1. */
32:
33: extern int recog_memoized PROTO((rtx));
34:
35: /* Determine whether a proposed change to an insn or MEM will make it
36: invalid. Make the change if not. */
37:
38: extern int validate_change PROTO((rtx, rtx *, rtx, int));
39:
40: /* Apply a group of changes if valid. */
41:
42: extern int apply_change_group PROTO((void));
43:
44: /* Return the number of changes so far in the current group. */
45:
46: extern int num_validated_changes PROTO((void));
47:
48: /* Retract some changes. */
49:
50: extern void cancel_changes PROTO((int));
51:
52: /* Nonzero means volatile operands are recognized. */
53:
54: extern int volatile_ok;
55:
56: /* Extract the operands from an insn that has been recognized. */
57:
58: extern void insn_extract PROTO((rtx));
59:
60: /* The following vectors hold the results from insn_extract. */
61:
62: /* Indexed by N, gives value of operand N. */
63: extern rtx recog_operand[];
64:
65: /* Indexed by N, gives location where operand N was found. */
66: extern rtx *recog_operand_loc[];
67:
68: /* Indexed by N, gives location where the Nth duplicate-appearance of
69: an operand was found. This is something that matched MATCH_DUP. */
70: extern rtx *recog_dup_loc[];
71:
72: /* Indexed by N, gives the operand number that was duplicated in the
73: Nth duplicate-appearance of an operand. */
74: extern char recog_dup_num[];
75:
76: #ifndef __STDC__
77: #ifndef const
78: #define const
79: #endif
80: #endif
81:
82: /* Access the output function for CODE. */
83:
84: #define OUT_FCN(CODE) (*insn_outfun[(int) (CODE)])
85:
86: /* Tables defined in insn-output.c that give information about
87: each insn-code value. */
88:
89: /* These are vectors indexed by insn-code. Details in genoutput.c. */
90:
91: extern char *const insn_template[];
92:
93: extern char *(*const insn_outfun[]) ();
94:
95: extern const int insn_n_operands[];
96:
97: extern const int insn_n_dups[];
98:
99: /* Indexed by insn code number, gives # of constraint alternatives. */
100:
101: extern const int insn_n_alternatives[];
102:
103: /* These are two-dimensional arrays indexed first by the insn-code
104: and second by the operand number. Details in genoutput.c. */
105:
106: #ifdef REGISTER_CONSTRAINTS /* Avoid undef sym in certain broken linkers. */
107: extern char *const insn_operand_constraint[][MAX_RECOG_OPERANDS];
108: #endif
109:
110: #ifndef REGISTER_CONSTRAINTS /* Avoid undef sym in certain broken linkers. */
111: extern const char insn_operand_address_p[][MAX_RECOG_OPERANDS];
112: #endif
113:
114: extern const enum machine_mode insn_operand_mode[][MAX_RECOG_OPERANDS];
115:
116: extern const char insn_operand_strict_low[][MAX_RECOG_OPERANDS];
117:
118: extern int (*const insn_operand_predicate[][MAX_RECOG_OPERANDS]) ();
119:
120: extern char * insn_name[];
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.