/* Generate code from machine description to recognize rtl as insns.
- Copyright (C) 1987, 88, 92-95, 97-98, 1999 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)
-any later version.
-
-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, 59 Temple Place - Suite 330,
-Boston, MA 02111-1307, USA. */
-
-
-/* This program is used to produce insn-recog.c, which contains
- a function called `recog' plus its subroutines.
- These functions contain a decision tree
- that recognizes whether an rtx, the argument given to recog,
- is a valid instruction.
-
- recog returns -1 if the rtx is not valid.
- If the rtx is valid, recog returns a nonnegative number
- which is the insn code number for the pattern that matched.
- This is the same as the order in the machine description of the
- entry that matched. This number can be used as an index into various
- insn_* tables, such as insn_template, insn_outfun, and insn_n_operands
- (found in insn-output.c).
-
- The third argument to recog is an optional pointer to an int.
- If present, recog will accept a pattern if it matches except for
+ Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1997, 1998,
+ 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
+
+ This file is part of GCC.
+
+ GCC 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)
+ any later version.
+
+ GCC 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 GCC; see the file COPYING. If not, write to the Free
+ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+ 02111-1307, USA. */
+
+
+/* This program is used to produce insn-recog.c, which contains a
+ function called `recog' plus its subroutines. These functions
+ contain a decision tree that recognizes whether an rtx, the
+ argument given to recog, is a valid instruction.
+
+ recog returns -1 if the rtx is not valid. If the rtx is valid,
+ recog returns a nonnegative number which is the insn code number
+ for the pattern that matched. This is the same as the order in the
+ machine description of the entry that matched. This number can be
+ used as an index into various insn_* tables, such as insn_template,
+ insn_outfun, and insn_n_operands (found in insn-output.c).
+
+ The third argument to recog is an optional pointer to an int. If
+ present, recog will accept a pattern if it matches except for
missing CLOBBER expressions at the end. In that case, the value
pointed to by the optional pointer will be set to the number of
CLOBBERs that need to be added (it should be initialized to zero by
the caller). If it is set nonzero, the caller should allocate a
- PARALLEL of the appropriate size, copy the initial entries, and call
- add_clobbers (found in insn-emit.c) to fill in the CLOBBERs.
+ PARALLEL of the appropriate size, copy the initial entries, and
+ call add_clobbers (found in insn-emit.c) to fill in the CLOBBERs.
- This program also generates the function `split_insns',
- which returns 0 if the rtl could not be split, or
- it returns the split rtl in a SEQUENCE. */
+ This program also generates the function `split_insns', which
+ returns 0 if the rtl could not be split, or it returns the split
+ rtl in a SEQUENCE.
+
+ This program also generates the function `peephole2_insns', which
+ returns 0 if the rtl could not be matched. If there was a match,
+ the new rtl is returned in a SEQUENCE, and LAST_INSN will point
+ to the last recognized insn in the old sequence. */
#include "hconfig.h"
#include "system.h"
#include "rtl.h"
-#include "obstack.h"
+#include "errors.h"
+#include "gensupport.h"
+
#define OUTPUT_LABEL(INDENT_STRING, LABEL_NUMBER) \
printf("%sL%d: ATTRIBUTE_UNUSED_LABEL\n", (INDENT_STRING), (LABEL_NUMBER))
-static struct obstack obstack;
-struct obstack *rtl_obstack = &obstack;
+/* Holds an array of names indexed by insn_code_number. */
+static char **insn_name_ptr = 0;
+static int insn_name_ptr_size = 0;
-#define obstack_chunk_alloc xmalloc
-#define obstack_chunk_free free
+/* A listhead of decision trees. The alternatives to a node are kept
+ in a doublely-linked list so we can easily add nodes to the proper
+ place when merging. */
-/* Define this so we can link with print-rtl.o to get debug_rtx function. */
-char **insn_name_ptr = 0;
+struct decision_head
+{
+ struct decision *first;
+ struct decision *last;
+};
-/* Data structure for a listhead of decision trees. The alternatives
- to a node are kept in a doublely-linked list so we can easily add nodes
- to the proper place when merging. */
+/* A single test. The two accept types aren't tests per-se, but
+ their equality (or lack thereof) does affect tree merging so
+ it is convenient to keep them here. */
+
+struct decision_test
+{
+ /* A linked list through the tests attached to a node. */
+ struct decision_test *next;
-struct decision_head { struct decision *first, *last; };
+ /* These types are roughly in the order in which we'd like to test them. */
+ enum decision_type
+ {
+ DT_mode, DT_code, DT_veclen,
+ DT_elt_zero_int, DT_elt_one_int, DT_elt_zero_wide, DT_elt_zero_wide_safe,
+ DT_veclen_ge, DT_dup, DT_pred, DT_c_test,
+ DT_accept_op, DT_accept_insn
+ } type;
+
+ union
+ {
+ enum machine_mode mode; /* Machine mode of node. */
+ RTX_CODE code; /* Code to test. */
+
+ struct
+ {
+ const char *name; /* Predicate to call. */
+ int index; /* Index into `preds' or -1. */
+ enum machine_mode mode; /* Machine mode for node. */
+ } pred;
+
+ const char *c_test; /* Additional test to perform. */
+ int veclen; /* Length of vector. */
+ int dup; /* Number of operand to compare against. */
+ HOST_WIDE_INT intval; /* Value for XINT for XWINT. */
+ int opno; /* Operand number matched. */
+
+ struct {
+ int code_number; /* Insn number matched. */
+ int lineno; /* Line number of the insn. */
+ int num_clobbers_to_add; /* Number of CLOBBERs to be added. */
+ } insn;
+ } u;
+};
-/* Data structure for decision tree for recognizing
- legitimate instructions. */
+/* Data structure for decision tree for recognizing legitimate insns. */
struct decision
{
+ struct decision_head success; /* Nodes to test on success. */
+ struct decision *next; /* Node to test on failure. */
+ struct decision *prev; /* Node whose failure tests us. */
+ struct decision *afterward; /* Node to test on success,
+ but failure of successor nodes. */
+
+ const char *position; /* String denoting position in pattern. */
+
+ struct decision_test *tests; /* The tests for this node. */
+
int number; /* Node number, used for labels */
- char *position; /* String denoting position in pattern */
- RTX_CODE code; /* Code to test for or UNKNOWN to suppress */
- char ignore_code; /* If non-zero, need not test code */
- char ignore_mode; /* If non-zero, need not test mode */
- int veclen; /* Length of vector, if nonzero */
- enum machine_mode mode; /* Machine mode of node */
- char enforce_mode; /* If non-zero, test `mode' */
- char retest_code, retest_mode; /* See write_tree_1 */
- int test_elt_zero_int; /* Nonzero if should test XINT (rtl, 0) */
- int elt_zero_int; /* Required value for XINT (rtl, 0) */
- int test_elt_one_int; /* Nonzero if should test XINT (rtl, 1) */
- int elt_one_int; /* Required value for XINT (rtl, 1) */
- int test_elt_zero_wide; /* Nonzero if should test XWINT (rtl, 0) */
- HOST_WIDE_INT elt_zero_wide; /* Required value for XWINT (rtl, 0) */
- const char *tests; /* If nonzero predicate to call */
- int pred; /* `preds' index of predicate or -1 */
- char *c_test; /* Additional test to perform */
- struct decision_head success; /* Nodes to test on success */
- int insn_code_number; /* Insn number matched, if success */
- int num_clobbers_to_add; /* Number of CLOBBERs to be added to pattern */
- struct decision *next; /* Node to test on failure */
- struct decision *prev; /* Node whose failure tests us */
- struct decision *afterward; /* Node to test on success, but failure of
- successor nodes */
- int opno; /* Operand number, if >= 0 */
- int dupno; /* Number of operand to compare against */
- int label_needed; /* Nonzero if label needed when writing tree */
int subroutine_number; /* Number of subroutine this node starts */
+ int need_label; /* Label needs to be output. */
};
-#define SUBROUTINE_THRESHOLD 50
+#define SUBROUTINE_THRESHOLD 100
static int next_subroutine_number;
-/* We can write two types of subroutines: One for insn recognition and
- one to split insns. This defines which type is being written. */
+/* We can write three types of subroutines: One for insn recognition,
+ one to split insns, and one for peephole-type optimizations. This
+ defines which type is being written. */
+
+enum routine_type {
+ RECOG, SPLIT, PEEPHOLE2
+};
-enum routine_type {RECOG, SPLIT};
+#define IS_SPLIT(X) ((X) != RECOG)
/* Next available node number for tree nodes. */
allocate in each subroutine we make. */
static int max_depth;
+
+/* The line number of the start of the pattern currently being processed. */
+static int pattern_lineno;
+
+/* Count of errors. */
+static int error_count;
\f
/* This table contains a list of the rtl codes that can possibly match a
- predicate defined in recog.c. The function `not_both_true' uses it to
+ predicate defined in recog.c. The function `maybe_both_true' uses it to
deduce that there are no expressions that can be matches by certain pairs
of tree nodes. Also, if a predicate can match only one code, we can
hardwire that code into the node testing the predicate. */
-static struct pred_table
+static const struct pred_table
{
- const char *name;
- RTX_CODE codes[NUM_RTX_CODE];
-} preds[]
- = {{"general_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
- LABEL_REF, SUBREG, REG, MEM}},
+ const char *const name;
+ const RTX_CODE codes[NUM_RTX_CODE];
+} preds[] = {
+ {"general_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
+ LABEL_REF, SUBREG, REG, MEM}},
#ifdef PREDICATE_CODES
- PREDICATE_CODES
+ PREDICATE_CODES
+#endif
+ {"address_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
+ LABEL_REF, SUBREG, REG, MEM, PLUS, MINUS, MULT}},
+ {"register_operand", {SUBREG, REG}},
+ {"pmode_register_operand", {SUBREG, REG}},
+ {"scratch_operand", {SCRATCH, REG}},
+ {"immediate_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
+ LABEL_REF}},
+ {"const_int_operand", {CONST_INT}},
+ {"const_double_operand", {CONST_INT, CONST_DOUBLE}},
+ {"nonimmediate_operand", {SUBREG, REG, MEM}},
+ {"nonmemory_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
+ LABEL_REF, SUBREG, REG}},
+ {"push_operand", {MEM}},
+ {"pop_operand", {MEM}},
+ {"memory_operand", {SUBREG, MEM}},
+ {"indirect_operand", {SUBREG, MEM}},
+ {"comparison_operator", {EQ, NE, LE, LT, GE, GT, LEU, LTU, GEU, GTU,
+ UNORDERED, ORDERED, UNEQ, UNGE, UNGT, UNLE,
+ UNLT, LTGT}},
+ {"mode_independent_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
+ LABEL_REF, SUBREG, REG, MEM}}
+};
+
+#define NUM_KNOWN_PREDS ARRAY_SIZE (preds)
+
+static const char *const special_mode_pred_table[] = {
+#ifdef SPECIAL_MODE_PREDICATES
+ SPECIAL_MODE_PREDICATES
#endif
- {"address_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
- LABEL_REF, SUBREG, REG, MEM, PLUS, MINUS, MULT}},
- {"register_operand", {SUBREG, REG}},
- {"scratch_operand", {SCRATCH, REG}},
- {"immediate_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
- LABEL_REF}},
- {"const_int_operand", {CONST_INT}},
- {"const_double_operand", {CONST_INT, CONST_DOUBLE}},
- {"nonimmediate_operand", {SUBREG, REG, MEM}},
- {"nonmemory_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
- LABEL_REF, SUBREG, REG}},
- {"push_operand", {MEM}},
- {"memory_operand", {SUBREG, MEM}},
- {"indirect_operand", {SUBREG, MEM}},
- {"comparison_operator", {EQ, NE, LE, LT, GE, GT, LEU, LTU, GEU, GTU}},
- {"mode_independent_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
- LABEL_REF, SUBREG, REG, MEM}}};
-
-#define NUM_KNOWN_PREDS (sizeof preds / sizeof preds[0])
-
-static struct decision_head make_insn_sequence PROTO((rtx, enum routine_type));
-static struct decision *add_to_sequence PROTO((rtx, struct decision_head *,
- const char *));
-static int not_both_true PROTO((struct decision *, struct decision *,
- int));
-static int position_merit PROTO((struct decision *, enum machine_mode,
- enum rtx_code));
-static struct decision_head merge_trees PROTO((struct decision_head,
- struct decision_head));
-static int break_out_subroutines PROTO((struct decision_head,
- enum routine_type, int));
-static void write_subroutine PROTO((struct decision *, enum routine_type));
-static void write_tree_1 PROTO((struct decision *, const char *,
- struct decision *, enum routine_type));
-static void print_code PROTO((enum rtx_code));
-static int same_codes PROTO((struct decision *, enum rtx_code));
-static void clear_codes PROTO((struct decision *));
-static int same_modes PROTO((struct decision *, enum machine_mode));
-static void clear_modes PROTO((struct decision *));
-static void write_tree PROTO((struct decision *, const char *,
- struct decision *, int,
- enum routine_type));
-static void change_state PROTO((const char *, const char *, int));
-static void fatal PVPROTO((const char *, ...))
- ATTRIBUTE_PRINTF_1 ATTRIBUTE_NORETURN;
-void fancy_abort PROTO((void)) ATTRIBUTE_NORETURN;
+ "pmode_register_operand"
+};
+
+#define NUM_SPECIAL_MODE_PREDS ARRAY_SIZE (special_mode_pred_table)
+
+static struct decision *new_decision
+ PARAMS ((const char *, struct decision_head *));
+static struct decision_test *new_decision_test
+ PARAMS ((enum decision_type, struct decision_test ***));
+static rtx find_operand
+ PARAMS ((rtx, int));
+static rtx find_matching_operand
+ PARAMS ((rtx, int));
+static void validate_pattern
+ PARAMS ((rtx, rtx, rtx, int));
+static struct decision *add_to_sequence
+ PARAMS ((rtx, struct decision_head *, const char *, enum routine_type, int));
+
+static int maybe_both_true_2
+ PARAMS ((struct decision_test *, struct decision_test *));
+static int maybe_both_true_1
+ PARAMS ((struct decision_test *, struct decision_test *));
+static int maybe_both_true
+ PARAMS ((struct decision *, struct decision *, int));
+
+static int nodes_identical_1
+ PARAMS ((struct decision_test *, struct decision_test *));
+static int nodes_identical
+ PARAMS ((struct decision *, struct decision *));
+static void merge_accept_insn
+ PARAMS ((struct decision *, struct decision *));
+static void merge_trees
+ PARAMS ((struct decision_head *, struct decision_head *));
+
+static void factor_tests
+ PARAMS ((struct decision_head *));
+static void simplify_tests
+ PARAMS ((struct decision_head *));
+static int break_out_subroutines
+ PARAMS ((struct decision_head *, int));
+static void find_afterward
+ PARAMS ((struct decision_head *, struct decision *));
+
+static void change_state
+ PARAMS ((const char *, const char *, struct decision *, const char *));
+static void print_code
+ PARAMS ((enum rtx_code));
+static void write_afterward
+ PARAMS ((struct decision *, struct decision *, const char *));
+static struct decision *write_switch
+ PARAMS ((struct decision *, int));
+static void write_cond
+ PARAMS ((struct decision_test *, int, enum routine_type));
+static void write_action
+ PARAMS ((struct decision *, struct decision_test *, int, int,
+ struct decision *, enum routine_type));
+static int is_unconditional
+ PARAMS ((struct decision_test *, enum routine_type));
+static int write_node
+ PARAMS ((struct decision *, int, enum routine_type));
+static void write_tree_1
+ PARAMS ((struct decision_head *, int, enum routine_type));
+static void write_tree
+ PARAMS ((struct decision_head *, const char *, enum routine_type, int));
+static void write_subroutine
+ PARAMS ((struct decision_head *, enum routine_type));
+static void write_subroutines
+ PARAMS ((struct decision_head *, enum routine_type));
+static void write_header
+ PARAMS ((void));
+
+static struct decision_head make_insn_sequence
+ PARAMS ((rtx, enum routine_type));
+static void process_tree
+ PARAMS ((struct decision_head *, enum routine_type));
+
+static void record_insn_name
+ PARAMS ((int, const char *));
+
+static void debug_decision_0
+ PARAMS ((struct decision *, int, int));
+static void debug_decision_1
+ PARAMS ((struct decision *, int));
+static void debug_decision_2
+ PARAMS ((struct decision_test *));
+extern void debug_decision
+ PARAMS ((struct decision *));
+extern void debug_decision_list
+ PARAMS ((struct decision *));
\f
-/* Construct and return a sequence of decisions
- that will recognize INSN.
+/* Create a new node in sequence after LAST. */
- TYPE says what type of routine we are recognizing (RECOG or SPLIT). */
+static struct decision *
+new_decision (position, last)
+ const char *position;
+ struct decision_head *last;
+{
+ struct decision *new
+ = (struct decision *) xmalloc (sizeof (struct decision));
-static struct decision_head
-make_insn_sequence (insn, type)
- rtx insn;
- enum routine_type type;
+ memset (new, 0, sizeof (*new));
+ new->success = *last;
+ new->position = xstrdup (position);
+ new->number = next_number++;
+
+ last->first = last->last = new;
+ return new;
+}
+
+/* Create a new test and link it in at PLACE. */
+
+static struct decision_test *
+new_decision_test (type, pplace)
+ enum decision_type type;
+ struct decision_test ***pplace;
{
- rtx x;
- char *c_test = XSTR (insn, type == RECOG ? 2 : 1);
- struct decision *last;
- struct decision_head head;
+ struct decision_test **place = *pplace;
+ struct decision_test *test;
- if (XVECLEN (insn, type == RECOG) == 1)
- x = XVECEXP (insn, type == RECOG, 0);
- else
+ test = (struct decision_test *) xmalloc (sizeof (*test));
+ test->next = *place;
+ test->type = type;
+ *place = test;
+
+ place = &test->next;
+ *pplace = place;
+
+ return test;
+}
+
+/* Search for and return operand N. */
+
+static rtx
+find_operand (pattern, n)
+ rtx pattern;
+ int n;
+{
+ const char *fmt;
+ RTX_CODE code;
+ int i, j, len;
+ rtx r;
+
+ code = GET_CODE (pattern);
+ if ((code == MATCH_SCRATCH
+ || code == MATCH_INSN
+ || code == MATCH_OPERAND
+ || code == MATCH_OPERATOR
+ || code == MATCH_PARALLEL)
+ && XINT (pattern, 0) == n)
+ return pattern;
+
+ fmt = GET_RTX_FORMAT (code);
+ len = GET_RTX_LENGTH (code);
+ for (i = 0; i < len; i++)
{
- x = rtx_alloc (PARALLEL);
- XVEC (x, 0) = XVEC (insn, type == RECOG);
- PUT_MODE (x, VOIDmode);
+ switch (fmt[i])
+ {
+ case 'e': case 'u':
+ if ((r = find_operand (XEXP (pattern, i), n)) != NULL_RTX)
+ return r;
+ break;
+
+ case 'V':
+ if (! XVEC (pattern, i))
+ break;
+ /* FALLTHRU */
+
+ case 'E':
+ for (j = 0; j < XVECLEN (pattern, i); j++)
+ if ((r = find_operand (XVECEXP (pattern, i, j), n)) != NULL_RTX)
+ return r;
+ break;
+
+ case 'i': case 'w': case '0': case 's':
+ break;
+
+ default:
+ abort ();
+ }
}
- last = add_to_sequence (x, &head, "");
+ return NULL;
+}
- if (c_test[0])
- last->c_test = c_test;
- last->insn_code_number = next_insn_code;
- last->num_clobbers_to_add = 0;
+/* Search for and return operand M, such that it has a matching
+ constraint for operand N. */
- /* If this is not a DEFINE_SPLIT and X is a PARALLEL, see if it ends with a
- group of CLOBBERs of (hard) registers or MATCH_SCRATCHes. If so, set up
- to recognize the pattern without these CLOBBERs. */
+static rtx
+find_matching_operand (pattern, n)
+ rtx pattern;
+ int n;
+{
+ const char *fmt;
+ RTX_CODE code;
+ int i, j, len;
+ rtx r;
+
+ code = GET_CODE (pattern);
+ if (code == MATCH_OPERAND
+ && (XSTR (pattern, 2)[0] == '0' + n
+ || (XSTR (pattern, 2)[0] == '%'
+ && XSTR (pattern, 2)[1] == '0' + n)))
+ return pattern;
- if (type == RECOG && GET_CODE (x) == PARALLEL)
+ fmt = GET_RTX_FORMAT (code);
+ len = GET_RTX_LENGTH (code);
+ for (i = 0; i < len; i++)
{
- int i;
+ switch (fmt[i])
+ {
+ case 'e': case 'u':
+ if ((r = find_matching_operand (XEXP (pattern, i), n)))
+ return r;
+ break;
+
+ case 'V':
+ if (! XVEC (pattern, i))
+ break;
+ /* FALLTHRU */
- for (i = XVECLEN (x, 0); i > 0; i--)
- if (GET_CODE (XVECEXP (x, 0, i - 1)) != CLOBBER
- || (GET_CODE (XEXP (XVECEXP (x, 0, i - 1), 0)) != REG
- && GET_CODE (XEXP (XVECEXP (x, 0, i - 1), 0)) != MATCH_SCRATCH))
+ case 'E':
+ for (j = 0; j < XVECLEN (pattern, i); j++)
+ if ((r = find_matching_operand (XVECEXP (pattern, i, j), n)))
+ return r;
break;
- if (i != XVECLEN (x, 0))
- {
- rtx new;
- struct decision_head clobber_head;
+ case 'i': case 'w': case '0': case 's':
+ break;
- if (i == 1)
- new = XVECEXP (x, 0, 0);
- else
- {
- int j;
+ default:
+ abort ();
+ }
+ }
- new = rtx_alloc (PARALLEL);
- XVEC (new, 0) = rtvec_alloc (i);
- for (j = i - 1; j >= 0; j--)
- XVECEXP (new, 0, j) = XVECEXP (x, 0, j);
- }
+ return NULL;
+}
+
+
+/* Check for various errors in patterns. SET is nonnull for a destination,
+ and is the complete set pattern. SET_CODE is '=' for normal sets, and
+ '+' within a context that requires in-out constraints. */
+
+static void
+validate_pattern (pattern, insn, set, set_code)
+ rtx pattern;
+ rtx insn;
+ rtx set;
+ int set_code;
+{
+ const char *fmt;
+ RTX_CODE code;
+ size_t i, len;
+ int j;
+
+ code = GET_CODE (pattern);
+ switch (code)
+ {
+ case MATCH_SCRATCH:
+ return;
+
+ case MATCH_INSN:
+ case MATCH_OPERAND:
+ case MATCH_OPERATOR:
+ {
+ const char *pred_name = XSTR (pattern, 1);
+ int allows_non_lvalue = 1, allows_non_const = 1;
+ int special_mode_pred = 0;
+ const char *c_test;
+
+ if (GET_CODE (insn) == DEFINE_INSN)
+ c_test = XSTR (insn, 2);
+ else
+ c_test = XSTR (insn, 1);
+
+ if (pred_name[0] != 0)
+ {
+ for (i = 0; i < NUM_KNOWN_PREDS; i++)
+ if (! strcmp (preds[i].name, pred_name))
+ break;
+
+ if (i < NUM_KNOWN_PREDS)
+ {
+ int j;
+
+ allows_non_lvalue = allows_non_const = 0;
+ for (j = 0; preds[i].codes[j] != 0; j++)
+ {
+ RTX_CODE c = preds[i].codes[j];
+ if (c != LABEL_REF
+ && c != SYMBOL_REF
+ && c != CONST_INT
+ && c != CONST_DOUBLE
+ && c != CONST
+ && c != HIGH
+ && c != CONSTANT_P_RTX)
+ allows_non_const = 1;
+
+ if (c != REG
+ && c != SUBREG
+ && c != MEM
+ && c != CONCAT
+ && c != PARALLEL
+ && c != STRICT_LOW_PART)
+ allows_non_lvalue = 1;
+ }
+ }
+ else
+ {
+#ifdef PREDICATE_CODES
+ /* If the port has a list of the predicates it uses but
+ omits one, warn. */
+ message_with_line (pattern_lineno,
+ "warning: `%s' not in PREDICATE_CODES",
+ pred_name);
+#endif
+ }
+
+ for (i = 0; i < NUM_SPECIAL_MODE_PREDS; ++i)
+ if (strcmp (pred_name, special_mode_pred_table[i]) == 0)
+ {
+ special_mode_pred = 1;
+ break;
+ }
+ }
+
+ if (code == MATCH_OPERAND)
+ {
+ const char constraints0 = XSTR (pattern, 2)[0];
+
+ /* In DEFINE_EXPAND, DEFINE_SPLIT, and DEFINE_PEEPHOLE2, we
+ don't use the MATCH_OPERAND constraint, only the predicate.
+ This is confusing to folks doing new ports, so help them
+ not make the mistake. */
+ if (GET_CODE (insn) == DEFINE_EXPAND
+ || GET_CODE (insn) == DEFINE_SPLIT
+ || GET_CODE (insn) == DEFINE_PEEPHOLE2)
+ {
+ if (constraints0)
+ message_with_line (pattern_lineno,
+ "warning: constraints not supported in %s",
+ rtx_name[GET_CODE (insn)]);
+ }
+
+ /* A MATCH_OPERAND that is a SET should have an output reload. */
+ else if (set && constraints0)
+ {
+ if (set_code == '+')
+ {
+ if (constraints0 == '+')
+ ;
+ /* If we've only got an output reload for this operand,
+ we'd better have a matching input operand. */
+ else if (constraints0 == '='
+ && find_matching_operand (insn, XINT (pattern, 0)))
+ ;
+ else
+ {
+ message_with_line (pattern_lineno,
+ "operand %d missing in-out reload",
+ XINT (pattern, 0));
+ error_count++;
+ }
+ }
+ else if (constraints0 != '=' && constraints0 != '+')
+ {
+ message_with_line (pattern_lineno,
+ "operand %d missing output reload",
+ XINT (pattern, 0));
+ error_count++;
+ }
+ }
+ }
+
+ /* Allowing non-lvalues in destinations -- particularly CONST_INT --
+ while not likely to occur at runtime, results in less efficient
+ code from insn-recog.c. */
+ if (set
+ && pred_name[0] != '\0'
+ && allows_non_lvalue)
+ {
+ message_with_line (pattern_lineno,
+ "warning: destination operand %d allows non-lvalue",
+ XINT (pattern, 0));
+ }
+
+ /* A modeless MATCH_OPERAND can be handy when we can
+ check for multiple modes in the c_test. In most other cases,
+ it is a mistake. Only DEFINE_INSN is eligible, since SPLIT
+ and PEEP2 can FAIL within the output pattern. Exclude
+ address_operand, since its mode is related to the mode of
+ the memory not the operand. Exclude the SET_DEST of a call
+ instruction, as that is a common idiom. */
+
+ if (GET_MODE (pattern) == VOIDmode
+ && code == MATCH_OPERAND
+ && GET_CODE (insn) == DEFINE_INSN
+ && allows_non_const
+ && ! special_mode_pred
+ && pred_name[0] != '\0'
+ && strcmp (pred_name, "address_operand") != 0
+ && strstr (c_test, "operands") == NULL
+ && ! (set
+ && GET_CODE (set) == SET
+ && GET_CODE (SET_SRC (set)) == CALL))
+ {
+ message_with_line (pattern_lineno,
+ "warning: operand %d missing mode?",
+ XINT (pattern, 0));
+ }
+ return;
+ }
+
+ case SET:
+ {
+ enum machine_mode dmode, smode;
+ rtx dest, src;
+
+ dest = SET_DEST (pattern);
+ src = SET_SRC (pattern);
+
+ /* STRICT_LOW_PART is a wrapper. Its argument is the real
+ destination, and it's mode should match the source. */
+ if (GET_CODE (dest) == STRICT_LOW_PART)
+ dest = XEXP (dest, 0);
+
+ /* Find the referant for a DUP. */
+
+ if (GET_CODE (dest) == MATCH_DUP
+ || GET_CODE (dest) == MATCH_OP_DUP
+ || GET_CODE (dest) == MATCH_PAR_DUP)
+ dest = find_operand (insn, XINT (dest, 0));
+
+ if (GET_CODE (src) == MATCH_DUP
+ || GET_CODE (src) == MATCH_OP_DUP
+ || GET_CODE (src) == MATCH_PAR_DUP)
+ src = find_operand (insn, XINT (src, 0));
+
+ dmode = GET_MODE (dest);
+ smode = GET_MODE (src);
+
+ /* The mode of an ADDRESS_OPERAND is the mode of the memory
+ reference, not the mode of the address. */
+ if (GET_CODE (src) == MATCH_OPERAND
+ && ! strcmp (XSTR (src, 1), "address_operand"))
+ ;
+
+ /* The operands of a SET must have the same mode unless one
+ is VOIDmode. */
+ else if (dmode != VOIDmode && smode != VOIDmode && dmode != smode)
+ {
+ message_with_line (pattern_lineno,
+ "mode mismatch in set: %smode vs %smode",
+ GET_MODE_NAME (dmode), GET_MODE_NAME (smode));
+ error_count++;
+ }
+
+ /* If only one of the operands is VOIDmode, and PC or CC0 is
+ not involved, it's probably a mistake. */
+ else if (dmode != smode
+ && GET_CODE (dest) != PC
+ && GET_CODE (dest) != CC0
+ && GET_CODE (src) != PC
+ && GET_CODE (src) != CC0
+ && GET_CODE (src) != CONST_INT)
+ {
+ const char *which;
+ which = (dmode == VOIDmode ? "destination" : "source");
+ message_with_line (pattern_lineno,
+ "warning: %s missing a mode?", which);
+ }
+
+ if (dest != SET_DEST (pattern))
+ validate_pattern (dest, insn, pattern, '=');
+ validate_pattern (SET_DEST (pattern), insn, pattern, '=');
+ validate_pattern (SET_SRC (pattern), insn, NULL_RTX, 0);
+ return;
+ }
+
+ case CLOBBER:
+ validate_pattern (SET_DEST (pattern), insn, pattern, '=');
+ return;
- last = add_to_sequence (new, &clobber_head, "");
+ case ZERO_EXTRACT:
+ validate_pattern (XEXP (pattern, 0), insn, set, set ? '+' : 0);
+ validate_pattern (XEXP (pattern, 1), insn, NULL_RTX, 0);
+ validate_pattern (XEXP (pattern, 2), insn, NULL_RTX, 0);
+ return;
- if (c_test[0])
- last->c_test = c_test;
- last->insn_code_number = next_insn_code;
- last->num_clobbers_to_add = XVECLEN (x, 0) - i;
+ case STRICT_LOW_PART:
+ validate_pattern (XEXP (pattern, 0), insn, set, set ? '+' : 0);
+ return;
- head = merge_trees (head, clobber_head);
+ case LABEL_REF:
+ if (GET_MODE (XEXP (pattern, 0)) != VOIDmode)
+ {
+ message_with_line (pattern_lineno,
+ "operand to label_ref %smode not VOIDmode",
+ GET_MODE_NAME (GET_MODE (XEXP (pattern, 0))));
+ error_count++;
}
+ break;
+
+ default:
+ break;
}
- next_insn_code++;
+ fmt = GET_RTX_FORMAT (code);
+ len = GET_RTX_LENGTH (code);
+ for (i = 0; i < len; i++)
+ {
+ switch (fmt[i])
+ {
+ case 'e': case 'u':
+ validate_pattern (XEXP (pattern, i), insn, NULL_RTX, 0);
+ break;
- if (type == SPLIT)
- /* Define the subroutine we will call below and emit in genemit. */
- printf ("extern rtx gen_split_%d ();\n", last->insn_code_number);
+ case 'E':
+ for (j = 0; j < XVECLEN (pattern, i); j++)
+ validate_pattern (XVECEXP (pattern, i, j), insn, NULL_RTX, 0);
+ break;
- return head;
+ case 'i': case 'w': case '0': case 's':
+ break;
+
+ default:
+ abort ();
+ }
+ }
}
-\f
+
/* Create a chain of nodes to verify that an rtl expression matches
PATTERN.
POSITION is the string representing the current position in the insn.
+ INSN_TYPE is the type of insn for which we are emitting code.
+
A pointer to the final node in the chain is returned. */
static struct decision *
-add_to_sequence (pattern, last, position)
+add_to_sequence (pattern, last, position, insn_type, top)
rtx pattern;
struct decision_head *last;
const char *position;
+ enum routine_type insn_type;
+ int top;
{
- register RTX_CODE code;
- register struct decision *new
- = (struct decision *) xmalloc (sizeof (struct decision));
- struct decision *this;
- char *newpos;
- register char *fmt;
- register size_t i;
+ RTX_CODE code;
+ struct decision *this, *sub;
+ struct decision_test *test;
+ struct decision_test **place;
+ char *subpos;
+ size_t i;
+ const char *fmt;
int depth = strlen (position);
int len;
+ enum machine_mode mode;
if (depth > max_depth)
max_depth = depth;
- new->number = next_number++;
- new->position = xstrdup (position);
- new->ignore_code = 0;
- new->ignore_mode = 0;
- new->enforce_mode = 1;
- new->retest_code = new->retest_mode = 0;
- new->veclen = 0;
- new->test_elt_zero_int = 0;
- new->test_elt_one_int = 0;
- new->test_elt_zero_wide = 0;
- new->elt_zero_int = 0;
- new->elt_one_int = 0;
- new->elt_zero_wide = 0;
- new->tests = 0;
- new->pred = -1;
- new->c_test = 0;
- new->success.first = new->success.last = 0;
- new->insn_code_number = -1;
- new->num_clobbers_to_add = 0;
- new->next = 0;
- new->prev = 0;
- new->afterward = 0;
- new->opno = -1;
- new->dupno = -1;
- new->label_needed = 0;
- new->subroutine_number = 0;
-
- this = new;
-
- last->first = last->last = new;
+ subpos = (char *) xmalloc (depth + 2);
+ strcpy (subpos, position);
+ subpos[depth + 1] = 0;
- newpos = (char *) alloca (depth + 2);
- strcpy (newpos, position);
- newpos[depth + 1] = 0;
+ sub = this = new_decision (position, last);
+ place = &this->tests;
restart:
-
- new->mode = GET_MODE (pattern);
- new->code = code = GET_CODE (pattern);
+ mode = GET_MODE (pattern);
+ code = GET_CODE (pattern);
switch (code)
{
- case MATCH_OPERAND:
- case MATCH_SCRATCH:
- case MATCH_OPERATOR:
- case MATCH_PARALLEL:
- case MATCH_INSN2:
- new->opno = XINT (pattern, 0);
- new->code = (code == MATCH_PARALLEL ? PARALLEL : UNKNOWN);
- new->enforce_mode = 0;
+ case PARALLEL:
+ /* Toplevel peephole pattern. */
+ if (insn_type == PEEPHOLE2 && top)
+ {
+ /* We don't need the node we just created -- unlink it. */
+ last->first = last->last = NULL;
- if (code == MATCH_SCRATCH)
- new->tests = "scratch_operand";
- else
- new->tests = XSTR (pattern, 1);
+ for (i = 0; i < (size_t) XVECLEN (pattern, 0); i++)
+ {
+ /* Which insn we're looking at is represented by A-Z. We don't
+ ever use 'A', however; it is always implied. */
- if (*new->tests == 0)
- new->tests = 0;
+ subpos[depth] = (i > 0 ? 'A' + i : 0);
+ sub = add_to_sequence (XVECEXP (pattern, 0, i),
+ last, subpos, insn_type, 0);
+ last = &sub->success;
+ }
+ goto ret;
+ }
- /* See if we know about this predicate and save its number. If we do,
- and it only accepts one code, note that fact. The predicate
- `const_int_operand' only tests for a CONST_INT, so if we do so we
- can avoid calling it at all.
+ /* Else nothing special. */
+ break;
- Finally, if we know that the predicate does not allow CONST_INT, we
- know that the only way the predicate can match is if the modes match
- (here we use the kludge of relying on the fact that "address_operand"
- accepts CONST_INT; otherwise, it would have to be a special case),
- so we can test the mode (but we need not). This fact should
- considerably simplify the generated code. */
+ case MATCH_PARALLEL:
+ /* The explicit patterns within a match_parallel enforce a minimum
+ length on the vector. The match_parallel predicate may allow
+ for more elements. We do need to check for this minimum here
+ or the code generated to match the internals may reference data
+ beyond the end of the vector. */
+ test = new_decision_test (DT_veclen_ge, &place);
+ test->u.veclen = XVECLEN (pattern, 2);
+ /* FALLTHRU */
- if (new->tests)
- {
- for (i = 0; i < NUM_KNOWN_PREDS; i++)
- if (! strcmp (preds[i].name, new->tests))
+ case MATCH_OPERAND:
+ case MATCH_SCRATCH:
+ case MATCH_OPERATOR:
+ case MATCH_INSN:
+ {
+ const char *pred_name;
+ RTX_CODE was_code = code;
+ int allows_const_int = 1;
+
+ if (code == MATCH_SCRATCH)
+ {
+ pred_name = "scratch_operand";
+ code = UNKNOWN;
+ }
+ else
+ {
+ pred_name = XSTR (pattern, 1);
+ if (code == MATCH_PARALLEL)
+ code = PARALLEL;
+ else
+ code = UNKNOWN;
+ }
+
+ if (pred_name[0] != 0)
+ {
+ test = new_decision_test (DT_pred, &place);
+ test->u.pred.name = pred_name;
+ test->u.pred.mode = mode;
+
+ /* See if we know about this predicate and save its number.
+ If we do, and it only accepts one code, note that fact.
+
+ If we know that the predicate does not allow CONST_INT,
+ we know that the only way the predicate can match is if
+ the modes match (here we use the kludge of relying on the
+ fact that "address_operand" accepts CONST_INT; otherwise,
+ it would have to be a special case), so we can test the
+ mode (but we need not). This fact should considerably
+ simplify the generated code. */
+
+ for (i = 0; i < NUM_KNOWN_PREDS; i++)
+ if (! strcmp (preds[i].name, pred_name))
+ break;
+
+ if (i < NUM_KNOWN_PREDS)
{
int j;
- int allows_const_int = 0;
- new->pred = i;
+ test->u.pred.index = i;
- if (preds[i].codes[1] == 0 && new->code == UNKNOWN)
- {
- new->code = preds[i].codes[0];
- if (! strcmp ("const_int_operand", new->tests))
- new->tests = 0, new->pred = -1;
- }
+ if (preds[i].codes[1] == 0 && code == UNKNOWN)
+ code = preds[i].codes[0];
- for (j = 0; j < NUM_RTX_CODE && preds[i].codes[j] != 0; j++)
+ allows_const_int = 0;
+ for (j = 0; preds[i].codes[j] != 0; j++)
if (preds[i].codes[j] == CONST_INT)
- allows_const_int = 1;
-
- if (! allows_const_int)
- new->enforce_mode = new->ignore_mode= 1;
-
- break;
+ {
+ allows_const_int = 1;
+ break;
+ }
}
+ else
+ test->u.pred.index = -1;
+ }
+
+ /* Can't enforce a mode if we allow const_int. */
+ if (allows_const_int)
+ mode = VOIDmode;
+
+ /* Accept the operand, ie. record it in `operands'. */
+ test = new_decision_test (DT_accept_op, &place);
+ test->u.opno = XINT (pattern, 0);
+
+ if (was_code == MATCH_OPERATOR || was_code == MATCH_PARALLEL)
+ {
+ char base = (was_code == MATCH_OPERATOR ? '0' : 'a');
+ for (i = 0; i < (size_t) XVECLEN (pattern, 2); i++)
+ {
+ subpos[depth] = i + base;
+ sub = add_to_sequence (XVECEXP (pattern, 2, i),
+ &sub->success, subpos, insn_type, 0);
+ }
+ }
+ goto fini;
+ }
-#ifdef PREDICATE_CODES
- /* If the port has a list of the predicates it uses but omits
- one, warn. */
- if (i == NUM_KNOWN_PREDS)
- fprintf (stderr, "Warning: `%s' not in PREDICATE_CODES\n",
- new->tests);
-#endif
- }
+ case MATCH_OP_DUP:
+ code = UNKNOWN;
- if (code == MATCH_OPERATOR || code == MATCH_PARALLEL)
- {
- for (i = 0; i < (size_t) XVECLEN (pattern, 2); i++)
- {
- newpos[depth] = i + (code == MATCH_OPERATOR ? '0': 'a');
- new = add_to_sequence (XVECEXP (pattern, 2, i),
- &new->success, newpos);
- }
- }
+ test = new_decision_test (DT_dup, &place);
+ test->u.dup = XINT (pattern, 0);
- return new;
+ test = new_decision_test (DT_accept_op, &place);
+ test->u.opno = XINT (pattern, 0);
- case MATCH_OP_DUP:
- new->opno = XINT (pattern, 0);
- new->dupno = XINT (pattern, 0);
- new->code = UNKNOWN;
- new->tests = 0;
for (i = 0; i < (size_t) XVECLEN (pattern, 1); i++)
{
- newpos[depth] = i + '0';
- new = add_to_sequence (XVECEXP (pattern, 1, i),
- &new->success, newpos);
+ subpos[depth] = i + '0';
+ sub = add_to_sequence (XVECEXP (pattern, 1, i),
+ &sub->success, subpos, insn_type, 0);
}
- return new;
+ goto fini;
case MATCH_DUP:
case MATCH_PAR_DUP:
- new->dupno = XINT (pattern, 0);
- new->code = UNKNOWN;
- new->enforce_mode = 0;
- return new;
+ code = UNKNOWN;
+
+ test = new_decision_test (DT_dup, &place);
+ test->u.dup = XINT (pattern, 0);
+ goto fini;
case ADDRESS:
pattern = XEXP (pattern, 0);
goto restart;
- case SET:
- /* The operands of a SET must have the same mode unless one is VOIDmode. */
- if (GET_MODE (SET_SRC (pattern)) != VOIDmode
- && GET_MODE (SET_DEST (pattern)) != VOIDmode
- && GET_MODE (SET_SRC (pattern)) != GET_MODE (SET_DEST (pattern))
- /* The mode of an ADDRESS_OPERAND is the mode of the memory reference,
- not the mode of the address. */
- && ! (GET_CODE (SET_SRC (pattern)) == MATCH_OPERAND
- && ! strcmp (XSTR (SET_SRC (pattern), 1), "address_operand")))
- {
- print_rtl (stderr, pattern);
- fputc ('\n', stderr);
- fatal ("mode mismatch in SET");
- }
- newpos[depth] = '0';
- new = add_to_sequence (SET_DEST (pattern), &new->success, newpos);
- this->success.first->enforce_mode = 1;
- newpos[depth] = '1';
- new = add_to_sequence (SET_SRC (pattern), &new->success, newpos);
-
- /* If set are setting CC0 from anything other than a COMPARE, we
- must enforce the mode so that we do not produce ambiguous insns. */
- if (GET_CODE (SET_DEST (pattern)) == CC0
- && GET_CODE (SET_SRC (pattern)) != COMPARE)
- this->success.first->enforce_mode = 1;
- return new;
-
- case SIGN_EXTEND:
- case ZERO_EXTEND:
- case STRICT_LOW_PART:
- newpos[depth] = '0';
- new = add_to_sequence (XEXP (pattern, 0), &new->success, newpos);
- this->success.first->enforce_mode = 1;
- return new;
-
- case SUBREG:
- this->test_elt_one_int = 1;
- this->elt_one_int = XINT (pattern, 1);
- newpos[depth] = '0';
- new = add_to_sequence (XEXP (pattern, 0), &new->success, newpos);
- this->success.first->enforce_mode = 1;
- return new;
-
- case ZERO_EXTRACT:
- case SIGN_EXTRACT:
- newpos[depth] = '0';
- new = add_to_sequence (XEXP (pattern, 0), &new->success, newpos);
- this->success.first->enforce_mode = 1;
- newpos[depth] = '1';
- new = add_to_sequence (XEXP (pattern, 1), &new->success, newpos);
- newpos[depth] = '2';
- new = add_to_sequence (XEXP (pattern, 2), &new->success, newpos);
- return new;
-
- case EQ: case NE: case LE: case LT: case GE: case GT:
- case LEU: case LTU: case GEU: case GTU:
- /* If the first operand is (cc0), we don't have to do anything
- special. */
- if (GET_CODE (XEXP (pattern, 0)) == CC0)
- break;
-
- /* ... fall through ... */
-
- case COMPARE:
- /* Enforce the mode on the first operand to avoid ambiguous insns. */
- newpos[depth] = '0';
- new = add_to_sequence (XEXP (pattern, 0), &new->success, newpos);
- this->success.first->enforce_mode = 1;
- newpos[depth] = '1';
- new = add_to_sequence (XEXP (pattern, 1), &new->success, newpos);
- return new;
-
default:
break;
}
fmt = GET_RTX_FORMAT (code);
len = GET_RTX_LENGTH (code);
+
+ /* Do tests against the current node first. */
for (i = 0; i < (size_t) len; i++)
{
- newpos[depth] = '0' + i;
- if (fmt[i] == 'e' || fmt[i] == 'u')
- new = add_to_sequence (XEXP (pattern, i), &new->success, newpos);
- else if (fmt[i] == 'i' && i == 0)
- {
- this->test_elt_zero_int = 1;
- this->elt_zero_int = XINT (pattern, i);
- }
- else if (fmt[i] == 'i' && i == 1)
+ if (fmt[i] == 'i')
{
- this->test_elt_one_int = 1;
- this->elt_one_int = XINT (pattern, i);
+ if (i == 0)
+ {
+ test = new_decision_test (DT_elt_zero_int, &place);
+ test->u.intval = XINT (pattern, i);
+ }
+ else if (i == 1)
+ {
+ test = new_decision_test (DT_elt_one_int, &place);
+ test->u.intval = XINT (pattern, i);
+ }
+ else
+ abort ();
}
- else if (fmt[i] == 'w' && i == 0)
+ else if (fmt[i] == 'w')
{
- this->test_elt_zero_wide = 1;
- this->elt_zero_wide = XWINT (pattern, i);
+ /* If this value actually fits in an int, we can use a switch
+ statement here, so indicate that. */
+ enum decision_type type
+ = ((int) XWINT (pattern, i) == XWINT (pattern, i))
+ ? DT_elt_zero_wide_safe : DT_elt_zero_wide;
+
+ if (i != 0)
+ abort ();
+
+ test = new_decision_test (type, &place);
+ test->u.intval = XWINT (pattern, i);
}
else if (fmt[i] == 'E')
{
- register int j;
- /* We do not handle a vector appearing as other than
- the first item, just because nothing uses them
- and by handling only the special case
- we can use one element in newpos for either
- the item number of a subexpression
- or the element number in a vector. */
if (i != 0)
abort ();
- this->veclen = XVECLEN (pattern, i);
- for (j = 0; j < XVECLEN (pattern, i); j++)
- {
- newpos[depth] = 'a' + j;
- new = add_to_sequence (XVECEXP (pattern, i, j),
- &new->success, newpos);
- }
+
+ test = new_decision_test (DT_veclen, &place);
+ test->u.veclen = XVECLEN (pattern, i);
}
- else if (fmt[i] != '0')
- abort ();
}
- return new;
-}
-\f
-/* Return 1 if we can prove that there is no RTL that can match both
- D1 and D2. Otherwise, return 0 (it may be that there is an RTL that
- can match both or just that we couldn't prove there wasn't such an RTL).
-
- TOPLEVEL is non-zero if we are to only look at the top level and not
- recursively descend. */
-static int
-not_both_true (d1, d2, toplevel)
- struct decision *d1, *d2;
- int toplevel;
-{
- struct decision *p1, *p2;
+ /* Now test our sub-patterns. */
+ for (i = 0; i < (size_t) len; i++)
+ {
+ switch (fmt[i])
+ {
+ case 'e': case 'u':
+ subpos[depth] = '0' + i;
+ sub = add_to_sequence (XEXP (pattern, i), &sub->success,
+ subpos, insn_type, 0);
+ break;
- /* If they are both to test modes and the modes are different, they aren't
- both true. Similarly for codes, integer elements, and vector lengths. */
-
- if ((d1->enforce_mode && d2->enforce_mode
- && d1->mode != VOIDmode && d2->mode != VOIDmode && d1->mode != d2->mode)
- || (d1->code != UNKNOWN && d2->code != UNKNOWN && d1->code != d2->code)
- || (d1->test_elt_zero_int && d2->test_elt_zero_int
- && d1->elt_zero_int != d2->elt_zero_int)
- || (d1->test_elt_one_int && d2->test_elt_one_int
- && d1->elt_one_int != d2->elt_one_int)
- || (d1->test_elt_zero_wide && d2->test_elt_zero_wide
- && d1->elt_zero_wide != d2->elt_zero_wide)
- || (d1->veclen && d2->veclen && d1->veclen != d2->veclen))
- return 1;
+ case 'E':
+ {
+ int j;
+ for (j = 0; j < XVECLEN (pattern, i); j++)
+ {
+ subpos[depth] = 'a' + j;
+ sub = add_to_sequence (XVECEXP (pattern, i, j),
+ &sub->success, subpos, insn_type, 0);
+ }
+ break;
+ }
- /* If either is a wild-card MATCH_OPERAND without a predicate, it can match
- absolutely anything, so we can't say that no intersection is possible.
- This case is detected by having a zero TESTS field with a code of
- UNKNOWN. */
+ case 'i': case 'w':
+ /* Handled above. */
+ break;
+ case '0':
+ break;
- if ((d1->tests == 0 && d1->code == UNKNOWN)
- || (d2->tests == 0 && d2->code == UNKNOWN))
- return 0;
+ default:
+ abort ();
+ }
+ }
- /* If either has a predicate that we know something about, set things up so
- that D1 is the one that always has a known predicate. Then see if they
- have any codes in common. */
+ fini:
+ /* Insert nodes testing mode and code, if they're still relevant,
+ before any of the nodes we may have added above. */
+ if (code != UNKNOWN)
+ {
+ place = &this->tests;
+ test = new_decision_test (DT_code, &place);
+ test->u.code = code;
+ }
- if (d1->pred >= 0 || d2->pred >= 0)
+ if (mode != VOIDmode)
{
- int i, j;
+ place = &this->tests;
+ test = new_decision_test (DT_mode, &place);
+ test->u.mode = mode;
+ }
- if (d2->pred >= 0)
- p1 = d1, d1 = d2, d2 = p1;
+ /* If we didn't insert any tests or accept nodes, hork. */
+ if (this->tests == NULL)
+ abort ();
+
+ ret:
+ free (subpos);
+ return sub;
+}
+\f
+/* A subroutine of maybe_both_true; examines only one test.
+ Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
- /* If D2 tests an explicit code, see if it is in the list of valid codes
- for D1's predicate. */
- if (d2->code != UNKNOWN)
+static int
+maybe_both_true_2 (d1, d2)
+ struct decision_test *d1, *d2;
+{
+ if (d1->type == d2->type)
+ {
+ switch (d1->type)
{
- for (i = 0; i < NUM_RTX_CODE && preds[d1->pred].codes[i] != 0; i++)
- if (preds[d1->pred].codes[i] == d2->code)
- break;
+ case DT_mode:
+ return d1->u.mode == d2->u.mode;
- if (preds[d1->pred].codes[i] == 0)
- return 1;
+ case DT_code:
+ return d1->u.code == d2->u.code;
+
+ case DT_veclen:
+ return d1->u.veclen == d2->u.veclen;
+
+ case DT_elt_zero_int:
+ case DT_elt_one_int:
+ case DT_elt_zero_wide:
+ case DT_elt_zero_wide_safe:
+ return d1->u.intval == d2->u.intval;
+
+ default:
+ break;
}
+ }
+
+ /* If either has a predicate that we know something about, set
+ things up so that D1 is the one that always has a known
+ predicate. Then see if they have any codes in common. */
- /* Otherwise see if the predicates have any codes in common. */
+ if (d1->type == DT_pred || d2->type == DT_pred)
+ {
+ if (d2->type == DT_pred)
+ {
+ struct decision_test *tmp;
+ tmp = d1, d1 = d2, d2 = tmp;
+ }
- else if (d2->pred >= 0)
+ /* If D2 tests a mode, see if it matches D1. */
+ if (d1->u.pred.mode != VOIDmode)
{
- for (i = 0; i < NUM_RTX_CODE && preds[d1->pred].codes[i] != 0; i++)
+ if (d2->type == DT_mode)
{
- for (j = 0; j < NUM_RTX_CODE; j++)
- if (preds[d2->pred].codes[j] == 0
- || preds[d2->pred].codes[j] == preds[d1->pred].codes[i])
- break;
+ if (d1->u.pred.mode != d2->u.mode
+ /* The mode of an address_operand predicate is the
+ mode of the memory, not the operand. It can only
+ be used for testing the predicate, so we must
+ ignore it here. */
+ && strcmp (d1->u.pred.name, "address_operand") != 0)
+ return 0;
+ }
+ /* Don't check two predicate modes here, because if both predicates
+ accept CONST_INT, then both can still be true even if the modes
+ are different. If they don't accept CONST_INT, there will be a
+ separate DT_mode that will make maybe_both_true_1 return 0. */
+ }
- if (preds[d2->pred].codes[j] != 0)
- break;
+ if (d1->u.pred.index >= 0)
+ {
+ /* If D2 tests a code, see if it is in the list of valid
+ codes for D1's predicate. */
+ if (d2->type == DT_code)
+ {
+ const RTX_CODE *c = &preds[d1->u.pred.index].codes[0];
+ while (*c != 0)
+ {
+ if (*c == d2->u.code)
+ break;
+ ++c;
+ }
+ if (*c == 0)
+ return 0;
}
- if (preds[d1->pred].codes[i] == 0)
- return 1;
- }
- }
+ /* Otherwise see if the predicates have any codes in common. */
+ else if (d2->type == DT_pred && d2->u.pred.index >= 0)
+ {
+ const RTX_CODE *c1 = &preds[d1->u.pred.index].codes[0];
+ int common = 0;
- /* If we got here, we can't prove that D1 and D2 cannot both be true.
- If we are only to check the top level, return 0. Otherwise, see if
- we can prove that all choices in both successors are mutually
- exclusive. If either does not have any successors, we can't prove
- they can't both be true. */
+ while (*c1 != 0 && !common)
+ {
+ const RTX_CODE *c2 = &preds[d2->u.pred.index].codes[0];
+ while (*c2 != 0 && !common)
+ {
+ common = (*c1 == *c2);
+ ++c2;
+ }
+ ++c1;
+ }
- if (toplevel || d1->success.first == 0 || d2->success.first == 0)
- return 0;
+ if (!common)
+ return 0;
+ }
+ }
+ }
- for (p1 = d1->success.first; p1; p1 = p1->next)
- for (p2 = d2->success.first; p2; p2 = p2->next)
- if (! not_both_true (p1, p2, 0))
- return 0;
+ /* Tests vs veclen may be known when strict equality is involved. */
+ if (d1->type == DT_veclen && d2->type == DT_veclen_ge)
+ return d1->u.veclen >= d2->u.veclen;
+ if (d1->type == DT_veclen_ge && d2->type == DT_veclen)
+ return d2->u.veclen >= d1->u.veclen;
- return 1;
+ return -1;
}
-\f
-/* Assuming that we can reorder all the alternatives at a specific point in
- the tree (see discussion in merge_trees), we would prefer an ordering of
- nodes where groups of consecutive nodes test the same mode and, within each
- mode, groups of nodes test the same code. With this order, we can
- construct nested switch statements, the inner one to test the code and
- the outer one to test the mode.
-
- We would like to list nodes testing for specific codes before those
- that test predicates to avoid unnecessary function calls. Similarly,
- tests for specific modes should precede nodes that allow any mode.
-
- This function returns the merit (with 0 being the best) of inserting
- a test involving the specified MODE and CODE after node P. If P is
- zero, we are to determine the merit of inserting the test at the front
- of the list. */
+
+/* A subroutine of maybe_both_true; examines all the tests for a given node.
+ Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
static int
-position_merit (p, mode, code)
- struct decision *p;
- enum machine_mode mode;
- enum rtx_code code;
+maybe_both_true_1 (d1, d2)
+ struct decision_test *d1, *d2;
{
- enum machine_mode p_mode;
-
- /* The only time the front of the list is anything other than the worst
- position is if we are testing a mode that isn't VOIDmode. */
- if (p == 0)
- return mode == VOIDmode ? 3 : 2;
-
- p_mode = p->enforce_mode ? p->mode : VOIDmode;
-
- /* The best case is if the codes and modes both match. */
- if (p_mode == mode && p->code== code)
- return 0;
+ struct decision_test *t1, *t2;
- /* If the codes don't match, the next best case is if the modes match.
- In that case, the best position for this node depends on whether
- we are testing for a specific code or not. If we are, the best place
- is after some other test for an explicit code and our mode or after
- the last test in the previous mode if every test in our mode is for
- an unknown code.
-
- If we are testing for UNKNOWN, then the next best case is at the end of
- our mode. */
-
- if ((code != UNKNOWN
- && ((p_mode == mode && p->code != UNKNOWN)
- || (p_mode != mode && p->next
- && (p->next->enforce_mode ? p->next->mode : VOIDmode) == mode
- && (p->next->code == UNKNOWN))))
- || (code == UNKNOWN && p_mode == mode
- && (p->next == 0
- || (p->next->enforce_mode ? p->next->mode : VOIDmode) != mode)))
+ /* A match_operand with no predicate can match anything. Recognize
+ this by the existence of a lone DT_accept_op test. */
+ if (d1->type == DT_accept_op || d2->type == DT_accept_op)
return 1;
- /* The third best case occurs when nothing is testing MODE. If MODE
- is not VOIDmode, then the third best case is after something of any
- mode that is not VOIDmode. If we are testing VOIDmode, the third best
- place is the end of the list. */
+ /* Eliminate pairs of tests while they can exactly match. */
+ while (d1 && d2 && d1->type == d2->type)
+ {
+ if (maybe_both_true_2 (d1, d2) == 0)
+ return 0;
+ d1 = d1->next, d2 = d2->next;
+ }
- if (p_mode != mode
- && ((mode != VOIDmode && p_mode != VOIDmode)
- || (mode == VOIDmode && p->next == 0)))
- return 2;
+ /* After that, consider all pairs. */
+ for (t1 = d1; t1 ; t1 = t1->next)
+ for (t2 = d2; t2 ; t2 = t2->next)
+ if (maybe_both_true_2 (t1, t2) == 0)
+ return 0;
- /* Otherwise, we have the worst case. */
- return 3;
+ return -1;
}
-\f
-/* Merge two decision tree listheads OLDH and ADDH,
- modifying OLDH destructively, and return the merged tree. */
-static struct decision_head
-merge_trees (oldh, addh)
- register struct decision_head oldh, addh;
+/* Return 0 if we can prove that there is no RTL that can match both
+ D1 and D2. Otherwise, return 1 (it may be that there is an RTL that
+ can match both or just that we couldn't prove there wasn't such an RTL).
+
+ TOPLEVEL is non-zero if we are to only look at the top level and not
+ recursively descend. */
+
+static int
+maybe_both_true (d1, d2, toplevel)
+ struct decision *d1, *d2;
+ int toplevel;
{
- struct decision *add, *next;
+ struct decision *p1, *p2;
+ int cmp;
- if (oldh.first == 0)
- return addh;
+ /* Don't compare strings on the different positions in insn. Doing so
+ is incorrect and results in false matches from constructs like
- if (addh.first == 0)
- return oldh;
+ [(set (subreg:HI (match_operand:SI "register_operand" "r") 0)
+ (subreg:HI (match_operand:SI "register_operand" "r") 0))]
+ vs
+ [(set (match_operand:HI "register_operand" "r")
+ (match_operand:HI "register_operand" "r"))]
- /* If we are adding things at different positions, something is wrong. */
- if (strcmp (oldh.first->position, addh.first->position))
- abort ();
+ If we are presented with such, we are recursing through the remainder
+ of a node's success nodes (from the loop at the end of this function).
+ Skip forward until we come to a position that matches.
- for (add = addh.first; add; add = next)
+ Due to the way position strings are constructed, we know that iterating
+ forward from the lexically lower position (e.g. "00") will run into
+ the lexically higher position (e.g. "1") and not the other way around.
+ This saves a bit of effort. */
+
+ cmp = strcmp (d1->position, d2->position);
+ if (cmp != 0)
{
- enum machine_mode add_mode = add->enforce_mode ? add->mode : VOIDmode;
- struct decision *best_position = 0;
- int best_merit = 4;
- struct decision *old;
+ if (toplevel)
+ abort ();
- next = add->next;
+ /* If the d2->position was lexically lower, swap. */
+ if (cmp > 0)
+ p1 = d1, d1 = d2, d2 = p1;
- /* The semantics of pattern matching state that the tests are done in
- the order given in the MD file so that if an insn matches two
- patterns, the first one will be used. However, in practice, most,
- if not all, patterns are unambiguous so that their order is
- independent. In that case, we can merge identical tests and
- group all similar modes and codes together.
+ if (d1->success.first == 0)
+ return 1;
+ for (p1 = d1->success.first; p1; p1 = p1->next)
+ if (maybe_both_true (p1, d2, 0))
+ return 1;
- Scan starting from the end of OLDH until we reach a point
- where we reach the head of the list or where we pass a pattern
- that could also be true if NEW is true. If we find an identical
- pattern, we can merge them. Also, record the last node that tests
- the same code and mode and the last one that tests just the same mode.
+ return 0;
+ }
- If we have no match, place NEW after the closest match we found. */
-
- for (old = oldh.last; old; old = old->prev)
- {
- int our_merit;
-
- /* If we don't have anything to test except an additional test,
- do not consider the two nodes equal. If we did, the test below
- would cause an infinite recursion. */
- if (old->tests == 0 && old->test_elt_zero_int == 0
- && old->test_elt_one_int == 0 && old->veclen == 0
- && old->test_elt_zero_wide == 0
- && old->dupno == -1 && old->mode == VOIDmode
- && old->code == UNKNOWN
- && (old->c_test != 0 || add->c_test != 0))
- ;
-
- else if ((old->tests == add->tests
- || (old->pred >= 0 && old->pred == add->pred)
- || (old->tests && add->tests
- && !strcmp (old->tests, add->tests)))
- && old->test_elt_zero_int == add->test_elt_zero_int
- && old->elt_zero_int == add->elt_zero_int
- && old->test_elt_one_int == add->test_elt_one_int
- && old->elt_one_int == add->elt_one_int
- && old->test_elt_zero_wide == add->test_elt_zero_wide
- && old->elt_zero_wide == add->elt_zero_wide
- && old->veclen == add->veclen
- && old->dupno == add->dupno
- && old->opno == add->opno
- && old->code == add->code
- && old->enforce_mode == add->enforce_mode
- && old->mode == add->mode)
- {
- /* If the additional test is not the same, split both nodes
- into nodes that just contain all things tested before the
- additional test and nodes that contain the additional test
- and actions when it is true. This optimization is important
- because of the case where we have almost identical patterns
- with different tests on target flags. */
-
- if (old->c_test != add->c_test
- && ! (old->c_test && add->c_test
- && !strcmp (old->c_test, add->c_test)))
- {
- if (old->insn_code_number >= 0 || old->opno >= 0)
- {
- struct decision *split
- = (struct decision *) xmalloc (sizeof (struct decision));
-
- memcpy (split, old, sizeof (struct decision));
-
- old->success.first = old->success.last = split;
- old->c_test = 0;
- old->opno = -1;
- old->insn_code_number = -1;
- old->num_clobbers_to_add = 0;
-
- split->number = next_number++;
- split->next = split->prev = 0;
- split->mode = VOIDmode;
- split->code = UNKNOWN;
- split->veclen = 0;
- split->test_elt_zero_int = 0;
- split->test_elt_one_int = 0;
- split->test_elt_zero_wide = 0;
- split->tests = 0;
- split->pred = -1;
- split->dupno = -1;
- }
+ /* Test the current level. */
+ cmp = maybe_both_true_1 (d1->tests, d2->tests);
+ if (cmp >= 0)
+ return cmp;
- if (add->insn_code_number >= 0 || add->opno >= 0)
- {
- struct decision *split
- = (struct decision *) xmalloc (sizeof (struct decision));
-
- memcpy (split, add, sizeof (struct decision));
-
- add->success.first = add->success.last = split;
- add->c_test = 0;
- add->opno = -1;
- add->insn_code_number = -1;
- add->num_clobbers_to_add = 0;
-
- split->number = next_number++;
- split->next = split->prev = 0;
- split->mode = VOIDmode;
- split->code = UNKNOWN;
- split->veclen = 0;
- split->test_elt_zero_int = 0;
- split->test_elt_one_int = 0;
- split->test_elt_zero_wide = 0;
- split->tests = 0;
- split->pred = -1;
- split->dupno = -1;
- }
- }
+ /* We can't prove that D1 and D2 cannot both be true. If we are only
+ to check the top level, return 1. Otherwise, see if we can prove
+ that all choices in both successors are mutually exclusive. If
+ either does not have any successors, we can't prove they can't both
+ be true. */
- if (old->insn_code_number >= 0 && add->insn_code_number >= 0)
- {
- /* If one node is for a normal insn and the second is
- for the base insn with clobbers stripped off, the
- second node should be ignored. */
-
- if (old->num_clobbers_to_add == 0
- && add->num_clobbers_to_add > 0)
- /* Nothing to do here. */
- ;
- else if (old->num_clobbers_to_add > 0
- && add->num_clobbers_to_add == 0)
- {
- /* In this case, replace OLD with ADD. */
- old->insn_code_number = add->insn_code_number;
- old->num_clobbers_to_add = 0;
- }
- else
- fatal ("Two actions at one point in tree");
- }
+ if (toplevel || d1->success.first == 0 || d2->success.first == 0)
+ return 1;
- if (old->insn_code_number == -1)
- old->insn_code_number = add->insn_code_number;
- old->success = merge_trees (old->success, add->success);
- add = 0;
- break;
- }
+ for (p1 = d1->success.first; p1; p1 = p1->next)
+ for (p2 = d2->success.first; p2; p2 = p2->next)
+ if (maybe_both_true (p1, p2, 0))
+ return 1;
- /* Unless we have already found the best possible insert point,
- see if this position is better. If so, record it. */
+ return 0;
+}
- if (best_merit != 0
- && ((our_merit = position_merit (old, add_mode, add->code))
- < best_merit))
- best_merit = our_merit, best_position = old;
+/* A subroutine of nodes_identical. Examine two tests for equivalence. */
- if (! not_both_true (old, add, 0))
- break;
- }
+static int
+nodes_identical_1 (d1, d2)
+ struct decision_test *d1, *d2;
+{
+ switch (d1->type)
+ {
+ case DT_mode:
+ return d1->u.mode == d2->u.mode;
- /* If ADD was duplicate, we are done. */
- if (add == 0)
- continue;
+ case DT_code:
+ return d1->u.code == d2->u.code;
- /* Otherwise, find the best place to insert ADD. Normally this is
- BEST_POSITION. However, if we went all the way to the top of
- the list, it might be better to insert at the top. */
+ case DT_pred:
+ return (d1->u.pred.mode == d2->u.pred.mode
+ && strcmp (d1->u.pred.name, d2->u.pred.name) == 0);
- if (best_position == 0)
- abort ();
+ case DT_c_test:
+ return strcmp (d1->u.c_test, d2->u.c_test) == 0;
- if (old == 0
- && position_merit (NULL_PTR, add_mode, add->code) < best_merit)
- {
- add->prev = 0;
- add->next = oldh.first;
- oldh.first->prev = add;
- oldh.first = add;
- }
+ case DT_veclen:
+ case DT_veclen_ge:
+ return d1->u.veclen == d2->u.veclen;
- else
- {
- add->prev = best_position;
- add->next = best_position->next;
- best_position->next = add;
- if (best_position == oldh.last)
- oldh.last = add;
- else
- add->next->prev = add;
- }
- }
+ case DT_dup:
+ return d1->u.dup == d2->u.dup;
- return oldh;
-}
-\f
-/* Count the number of subnodes of HEAD. If the number is high enough,
- make the first node in HEAD start a separate subroutine in the C code
- that is generated.
+ case DT_elt_zero_int:
+ case DT_elt_one_int:
+ case DT_elt_zero_wide:
+ case DT_elt_zero_wide_safe:
+ return d1->u.intval == d2->u.intval;
- TYPE gives the type of routine we are writing.
+ case DT_accept_op:
+ return d1->u.opno == d2->u.opno;
- INITIAL is non-zero if this is the highest-level node. We never write
- it out here. */
+ case DT_accept_insn:
+ /* Differences will be handled in merge_accept_insn. */
+ return 1;
+
+ default:
+ abort ();
+ }
+}
+
+/* True iff the two nodes are identical (on one level only). Due
+ to the way these lists are constructed, we shouldn't have to
+ consider different orderings on the tests. */
static int
-break_out_subroutines (head, type, initial)
- struct decision_head head;
- enum routine_type type;
- int initial;
+nodes_identical (d1, d2)
+ struct decision *d1, *d2;
{
- int size = 0;
- struct decision *sub;
+ struct decision_test *t1, *t2;
- for (sub = head.first; sub; sub = sub->next)
- size += 1 + break_out_subroutines (sub->success, type, 0);
-
- if (size > SUBROUTINE_THRESHOLD && ! initial)
+ for (t1 = d1->tests, t2 = d2->tests; t1 && t2; t1 = t1->next, t2 = t2->next)
{
- head.first->subroutine_number = ++next_subroutine_number;
- write_subroutine (head.first, type);
- size = 1;
+ if (t1->type != t2->type)
+ return 0;
+ if (! nodes_identical_1 (t1, t2))
+ return 0;
}
- return size;
-}
-\f
-/* Write out a subroutine of type TYPE to do comparisons starting at node
- TREE. */
-
-static void
-write_subroutine (tree, type)
- struct decision *tree;
- enum routine_type type;
-{
- int i;
- if (type == SPLIT)
- printf ("rtx\nsplit");
- else
- printf ("int\nrecog");
+ /* For success, they should now both be null. */
+ if (t1 != t2)
+ return 0;
- if (tree != 0 && tree->subroutine_number > 0)
- printf ("_%d", tree->subroutine_number);
- else if (type == SPLIT)
- printf ("_insns");
+ /* Check that their subnodes are at the same position, as any one set
+ of sibling decisions must be at the same position. Allowing this
+ requires complications to find_afterward and when change_state is
+ invoked. */
+ if (d1->success.first
+ && d2->success.first
+ && strcmp (d1->success.first->position, d2->success.first->position))
+ return 0;
- printf (" (x0, insn");
- if (type == RECOG)
- printf (", pnum_clobbers");
+ return 1;
+}
- printf (")\n");
- printf (" register rtx x0;\n rtx insn ATTRIBUTE_UNUSED;\n");
- if (type == RECOG)
- printf (" int *pnum_clobbers ATTRIBUTE_UNUSED;\n");
+/* A subroutine of merge_trees; given two nodes that have been declared
+ identical, cope with two insn accept states. If they differ in the
+ number of clobbers, then the conflict was created by make_insn_sequence
+ and we can drop the with-clobbers version on the floor. If both
+ nodes have no additional clobbers, we have found an ambiguity in the
+ source machine description. */
- printf ("{\n");
- printf (" register rtx *ro = &recog_operand[0];\n");
+static void
+merge_accept_insn (oldd, addd)
+ struct decision *oldd, *addd;
+{
+ struct decision_test *old, *add;
- printf (" register rtx ");
- for (i = 1; i < max_depth; i++)
- printf ("x%d ATTRIBUTE_UNUSED, ", i);
+ for (old = oldd->tests; old; old = old->next)
+ if (old->type == DT_accept_insn)
+ break;
+ if (old == NULL)
+ return;
- printf ("x%d ATTRIBUTE_UNUSED;\n", max_depth);
- printf (" %s tem ATTRIBUTE_UNUSED;\n", type == SPLIT ? "rtx" : "int");
- write_tree (tree, "", NULL_PTR, 1, type);
- printf (" ret0: return %d;\n}\n\n", type == SPLIT ? 0 : -1);
-}
-\f
-/* This table is used to indent the recog_* functions when we are inside
- conditions or switch statements. We only support small indentations
- and always indent at least two spaces. */
-
-static const char *indents[]
- = {" ", " ", " ", " ", " ", " ", " ", " ",
- "\t", "\t ", "\t ", "\t ", "\t ", "\t ", "\t ",
- "\t\t", "\t\t ", "\t\t ", "\t\t ", "\t\t ", "\t\t "};
-
-/* Write out C code to perform the decisions in TREE for a subroutine of
- type TYPE. If all of the choices fail, branch to node AFTERWARD, if
- non-zero, otherwise return. PREVPOS is the position of the node that
- branched to this test.
-
- When we merged all alternatives, we tried to set up a convenient order.
- Specifically, tests involving the same mode are all grouped together,
- followed by a group that does not contain a mode test. Within each group
- of the same mode, we also group tests with the same code, followed by a
- group that does not test a code.
-
- Occasionally, we cannot arbitrarily reorder the tests so that multiple
- sequence of groups as described above are present.
-
- We generate two nested switch statements, the outer statement for
- testing modes, and the inner switch for testing RTX codes. It is
- not worth optimizing cases when only a small number of modes or
- codes is tested, since the compiler can do that when compiling the
- resulting function. We do check for when every test is the same mode
- or code. */
+ for (add = addd->tests; add; add = add->next)
+ if (add->type == DT_accept_insn)
+ break;
+ if (add == NULL)
+ return;
-static void
-write_tree_1 (tree, prevpos, afterward, type)
- struct decision *tree;
- const char *prevpos;
- struct decision *afterward;
- enum routine_type type;
-{
- register struct decision *p, *p1;
- register int depth = tree ? strlen (tree->position) : 0;
- enum machine_mode switch_mode = VOIDmode;
- RTX_CODE switch_code = UNKNOWN;
- int uncond = 0;
- char modemap[NUM_MACHINE_MODES];
- char codemap[NUM_RTX_CODE];
- int indent = 2;
- int i;
+ /* If one node is for a normal insn and the second is for the base
+ insn with clobbers stripped off, the second node should be ignored. */
- /* One tricky area is what is the exact state when we branch to a
- node's label. There are two cases where we branch: when looking at
- successors to a node, or when a set of tests fails.
-
- In the former case, we are always branching to the first node in a
- decision list and we want all required tests to be performed. We
- put the labels for such nodes in front of any switch or test statements.
- These branches are done without updating the position to that of the
- target node.
-
- In the latter case, we are branching to a node that is not the first
- node in a decision list. We have already checked that it is possible
- for both the node we originally tested at this level and the node we
- are branching to to both match some pattern. That means that they
- usually will be testing the same mode and code. So it is normally safe
- for such labels to be inside switch statements, since the tests done
- by virtue of arriving at that label will usually already have been
- done. The exception is a branch from a node that does not test a
- mode or code to one that does. In such cases, we set the `retest_mode'
- or `retest_code' flags. That will ensure that we start a new switch
- at that position and put the label before the switch.
-
- The branches in the latter case must set the position to that of the
- target node. */
-
-
- printf ("\n");
- if (tree && tree->subroutine_number == 0)
+ if (old->u.insn.num_clobbers_to_add == 0
+ && add->u.insn.num_clobbers_to_add > 0)
{
- OUTPUT_LABEL (" ", tree->number);
- tree->label_needed = 0;
+ /* Nothing to do here. */
}
-
- if (tree)
+ else if (old->u.insn.num_clobbers_to_add > 0
+ && add->u.insn.num_clobbers_to_add == 0)
{
- change_state (prevpos, tree->position, 2);
- prevpos = tree->position;
+ /* In this case, replace OLD with ADD. */
+ old->u.insn = add->u.insn;
}
-
- for (p = tree; p; p = p->next)
+ else
{
- enum machine_mode mode = p->enforce_mode ? p->mode : VOIDmode;
- int need_bracket;
- int wrote_bracket = 0;
- int inner_indent;
+ message_with_line (add->u.insn.lineno, "`%s' matches `%s'",
+ get_insn_name (add->u.insn.code_number),
+ get_insn_name (old->u.insn.code_number));
+ message_with_line (old->u.insn.lineno, "previous definition of `%s'",
+ get_insn_name (old->u.insn.code_number));
+ error_count++;
+ }
+}
- if (p->success.first == 0 && p->insn_code_number < 0)
- abort ();
+/* Merge two decision trees OLDH and ADDH, modifying OLDH destructively. */
- /* Find the next alternative to p that might be true when p is true.
- Test that one next if p's successors fail. */
+static void
+merge_trees (oldh, addh)
+ struct decision_head *oldh, *addh;
+{
+ struct decision *next, *add;
- for (p1 = p->next; p1 && not_both_true (p, p1, 1); p1 = p1->next)
- ;
- p->afterward = p1;
+ if (addh->first == 0)
+ return;
+ if (oldh->first == 0)
+ {
+ *oldh = *addh;
+ return;
+ }
- if (p1)
- {
- if (mode == VOIDmode && p1->enforce_mode && p1->mode != VOIDmode)
- p1->retest_mode = 1;
- if (p->code == UNKNOWN && p1->code != UNKNOWN)
- p1->retest_code = 1;
- p1->label_needed = 1;
- }
+ /* Trying to merge bits at different positions isn't possible. */
+ if (strcmp (oldh->first->position, addh->first->position))
+ abort ();
- /* If we have a different code or mode than the last node and
- are in a switch on codes, we must either end the switch or
- go to another case. We must also end the switch if this
- node needs a label and to retest either the mode or code. */
+ for (add = addh->first; add ; add = next)
+ {
+ struct decision *old, *insert_before = NULL;
- if (switch_code != UNKNOWN
- && (switch_code != p->code || switch_mode != mode
- || (p->label_needed && (p->retest_mode || p->retest_code))))
- {
- enum rtx_code code = p->code;
+ next = add->next;
- /* If P is testing a predicate that we know about and we haven't
- seen any of the codes that are valid for the predicate, we
- can write a series of "case" statement, one for each possible
- code. Since we are already in a switch, these redundant tests
- are very cheap and will reduce the number of predicate called. */
+ /* The semantics of pattern matching state that the tests are
+ done in the order given in the MD file so that if an insn
+ matches two patterns, the first one will be used. However,
+ in practice, most, if not all, patterns are unambiguous so
+ that their order is independent. In that case, we can merge
+ identical tests and group all similar modes and codes together.
- if (p->pred >= 0)
- {
- for (i = 0; i < NUM_RTX_CODE && preds[p->pred].codes[i] != 0; i++)
- if (codemap[(int) preds[p->pred].codes[i]])
- break;
+ Scan starting from the end of OLDH until we reach a point
+ where we reach the head of the list or where we pass a
+ pattern that could also be true if NEW is true. If we find
+ an identical pattern, we can merge them. Also, record the
+ last node that tests the same code and mode and the last one
+ that tests just the same mode.
- if (preds[p->pred].codes[i] == 0)
- code = MATCH_OPERAND;
- }
+ If we have no match, place NEW after the closest match we found. */
- if (code == UNKNOWN || codemap[(int) code]
- || switch_mode != mode
- || (p->label_needed && (p->retest_mode || p->retest_code)))
+ for (old = oldh->last; old; old = old->prev)
+ {
+ if (nodes_identical (old, add))
{
- printf ("%s}\n", indents[indent - 2]);
- switch_code = UNKNOWN;
- indent -= 4;
+ merge_accept_insn (old, add);
+ merge_trees (&old->success, &add->success);
+ goto merged_nodes;
}
- else
- {
- if (! uncond)
- printf ("%sbreak;\n", indents[indent]);
-
- if (code == MATCH_OPERAND)
- {
- for (i = 0; i < NUM_RTX_CODE && preds[p->pred].codes[i] != 0; i++)
- {
- printf ("%scase ", indents[indent - 2]);
- print_code (preds[p->pred].codes[i]);
- printf (":\n");
- codemap[(int) preds[p->pred].codes[i]] = 1;
- }
- }
- else
- {
- printf ("%scase ", indents[indent - 2]);
- print_code (code);
- printf (":\n");
- codemap[(int) p->code] = 1;
- }
- switch_code = code;
- }
+ if (maybe_both_true (old, add, 0))
+ break;
- uncond = 0;
+ /* Insert the nodes in DT test type order, which is roughly
+ how expensive/important the test is. Given that the tests
+ are also ordered within the list, examining the first is
+ sufficient. */
+ if ((int) add->tests->type < (int) old->tests->type)
+ insert_before = old;
}
- /* If we were previously in a switch on modes and now have a different
- mode, end at least the case, and maybe end the switch if we are
- not testing a mode or testing a mode whose case we already saw. */
-
- if (switch_mode != VOIDmode
- && (switch_mode != mode || (p->label_needed && p->retest_mode)))
+ if (insert_before == NULL)
{
- if (mode == VOIDmode || modemap[(int) mode]
- || (p->label_needed && p->retest_mode))
- {
- printf ("%s}\n", indents[indent - 2]);
- switch_mode = VOIDmode;
- indent -= 4;
- }
+ add->next = NULL;
+ add->prev = oldh->last;
+ oldh->last->next = add;
+ oldh->last = add;
+ }
+ else
+ {
+ if ((add->prev = insert_before->prev) != NULL)
+ add->prev->next = add;
else
- {
- if (! uncond)
- printf (" break;\n");
- printf (" case %smode:\n", GET_MODE_NAME (mode));
- switch_mode = mode;
- modemap[(int) mode] = 1;
- }
-
- uncond = 0;
+ oldh->first = add;
+ add->next = insert_before;
+ insert_before->prev = add;
}
- /* If we are about to write dead code, something went wrong. */
- if (! p->label_needed && uncond)
- abort ();
+ merged_nodes:;
+ }
+}
+\f
+/* Walk the tree looking for sub-nodes that perform common tests.
+ Factor out the common test into a new node. This enables us
+ (depending on the test type) to emit switch statements later. */
- /* If we need a label and we will want to retest the mode or code at
- that label, write the label now. We have already ensured that
- things will be valid for the test. */
+static void
+factor_tests (head)
+ struct decision_head *head;
+{
+ struct decision *first, *next;
- if (p->label_needed && (p->retest_mode || p->retest_code))
- {
- OUTPUT_LABEL (indents[indent - 2], p->number);
- p->label_needed = 0;
- }
+ for (first = head->first; first && first->next; first = next)
+ {
+ enum decision_type type;
+ struct decision *new, *old_last;
- uncond = 0;
+ type = first->tests->type;
+ next = first->next;
+
+ /* Want at least two compatible sequential nodes. */
+ if (next->tests->type != type)
+ continue;
- /* If we are not in any switches, see if we can shortcut things
- by checking for identical modes and codes. */
+ /* Don't want all node types, just those we can turn into
+ switch statements. */
+ if (type != DT_mode
+ && type != DT_code
+ && type != DT_veclen
+ && type != DT_elt_zero_int
+ && type != DT_elt_one_int
+ && type != DT_elt_zero_wide_safe)
+ continue;
- if (switch_mode == VOIDmode && switch_code == UNKNOWN)
+ /* If we'd been performing more than one test, create a new node
+ below our first test. */
+ if (first->tests->next != NULL)
{
- /* If p and its alternatives all want the same mode,
- reject all others at once, first, then ignore the mode. */
+ new = new_decision (first->position, &first->success);
+ new->tests = first->tests->next;
+ first->tests->next = NULL;
+ }
- if (mode != VOIDmode && p->next && same_modes (p, mode))
- {
- printf (" if (GET_MODE (x%d) != %smode)\n",
- depth, GET_MODE_NAME (p->mode));
- if (afterward)
- {
- printf (" {\n");
- change_state (p->position, afterward->position, 6);
- printf (" goto L%d;\n }\n", afterward->number);
- }
- else
- printf (" goto ret0;\n");
- clear_modes (p);
- mode = VOIDmode;
- }
+ /* Crop the node tree off after our first test. */
+ first->next = NULL;
+ old_last = head->last;
+ head->last = first;
- /* If p and its alternatives all want the same code,
- reject all others at once, first, then ignore the code. */
+ /* For each compatible test, adjust to perform only one test in
+ the top level node, then merge the node back into the tree. */
+ do
+ {
+ struct decision_head h;
- if (p->code != UNKNOWN && p->next && same_codes (p, p->code))
+ if (next->tests->next != NULL)
{
- printf (" if (GET_CODE (x%d) != ", depth);
- print_code (p->code);
- printf (")\n");
- if (afterward)
- {
- printf (" {\n");
- change_state (p->position, afterward->position, indent + 4);
- printf (" goto L%d;\n }\n", afterward->number);
- }
- else
- printf (" goto ret0;\n");
- clear_codes (p);
+ new = new_decision (next->position, &next->success);
+ new->tests = next->tests->next;
+ next->tests->next = NULL;
}
- }
+ new = next;
+ next = next->next;
+ new->next = NULL;
+ h.first = h.last = new;
- /* If we are not in a mode switch and we are testing for a specific
- mode, start a mode switch unless we have just one node or the next
- node is not testing a mode (we have already tested for the case of
- more than one mode, but all of the same mode). */
-
- if (switch_mode == VOIDmode && mode != VOIDmode && p->next != 0
- && p->next->enforce_mode && p->next->mode != VOIDmode)
- {
- memset (modemap, 0, sizeof modemap);
- printf ("%sswitch (GET_MODE (x%d))\n", indents[indent], depth);
- printf ("%s{\n", indents[indent + 2]);
- indent += 4;
- printf ("%sdefault:\n%sbreak;\n", indents[indent - 2],
- indents[indent]);
- printf ("%scase %smode:\n", indents[indent - 2],
- GET_MODE_NAME (mode));
- modemap[(int) mode] = 1;
- switch_mode = mode;
+ merge_trees (head, &h);
}
+ while (next && next->tests->type == type);
- /* Similarly for testing codes. */
-
- if (switch_code == UNKNOWN && p->code != UNKNOWN && ! p->ignore_code
- && p->next != 0 && p->next->code != UNKNOWN)
+ /* After we run out of compatible tests, graft the remaining nodes
+ back onto the tree. */
+ if (next)
{
- memset (codemap, 0, sizeof codemap);
- printf ("%sswitch (GET_CODE (x%d))\n", indents[indent], depth);
- printf ("%s{\n", indents[indent + 2]);
- indent += 4;
- printf ("%sdefault:\n%sbreak;\n", indents[indent - 2],
- indents[indent]);
- printf ("%scase ", indents[indent - 2]);
- print_code (p->code);
- printf (":\n");
- codemap[(int) p->code] = 1;
- switch_code = p->code;
+ next->prev = head->last;
+ head->last->next = next;
+ head->last = old_last;
}
+ }
- /* Now that most mode and code tests have been done, we can write out
- a label for an inner node, if we haven't already. */
- if (p->label_needed)
- OUTPUT_LABEL (indents[indent - 2], p->number);
+ /* Recurse. */
+ for (first = head->first; first; first = first->next)
+ factor_tests (&first->success);
+}
- inner_indent = indent;
+/* After factoring, try to simplify the tests on any one node.
+ Tests that are useful for switch statements are recognizable
+ by having only a single test on a node -- we'll be manipulating
+ nodes with multiple tests:
- /* The only way we can have to do a mode or code test here is if
- this node needs such a test but is the only node to be tested.
- In that case, we won't have started a switch. Note that this is
- the only way the switch and test modes can disagree. */
+ If we have mode tests or code tests that are redundant with
+ predicates, remove them. */
- if ((mode != switch_mode && ! p->ignore_mode)
- || (p->code != switch_code && p->code != UNKNOWN && ! p->ignore_code)
- || p->test_elt_zero_int || p->test_elt_one_int
- || p->test_elt_zero_wide || p->veclen
- || p->dupno >= 0 || p->tests || p->num_clobbers_to_add)
- {
- printf ("%sif (", indents[indent]);
+static void
+simplify_tests (head)
+ struct decision_head *head;
+{
+ struct decision *tree;
- if (mode != switch_mode && ! p->ignore_mode)
- printf ("GET_MODE (x%d) == %smode && ",
- depth, GET_MODE_NAME (mode));
- if (p->code != switch_code && p->code != UNKNOWN && ! p->ignore_code)
- {
- printf ("GET_CODE (x%d) == ", depth);
- print_code (p->code);
- printf (" && ");
- }
+ for (tree = head->first; tree; tree = tree->next)
+ {
+ struct decision_test *a, *b;
- if (p->test_elt_zero_int)
- printf ("XINT (x%d, 0) == %d && ", depth, p->elt_zero_int);
- if (p->test_elt_one_int)
- printf ("XINT (x%d, 1) == %d && ", depth, p->elt_one_int);
- if (p->test_elt_zero_wide)
- {
- /* Set offset to 1 iff the number might get propagated to
- unsigned long by ANSI C rules, else 0.
- Prospective hosts are required to have at least 32 bit
- ints, and integer constants in machine descriptions
- must fit in 32 bit, thus it suffices to check only
- for 1 << 31 . */
- HOST_WIDE_INT offset = p->elt_zero_wide == -2147483647 - 1;
- printf ("XWINT (x%d, 0) == ", depth);
- printf (HOST_WIDE_INT_PRINT_DEC, p->elt_zero_wide + offset);
- printf ("%s && ", offset ? "-1" : "");
- }
- if (p->veclen)
- printf ("XVECLEN (x%d, 0) == %d && ", depth, p->veclen);
- if (p->dupno >= 0)
- printf ("rtx_equal_p (x%d, ro[%d]) && ", depth, p->dupno);
- if (p->num_clobbers_to_add)
- printf ("pnum_clobbers != 0 && ");
- if (p->tests)
- printf ("%s (x%d, %smode)", p->tests, depth,
- GET_MODE_NAME (p->mode));
- else
- printf ("1");
+ a = tree->tests;
+ b = a->next;
+ if (b == NULL)
+ continue;
- printf (")\n");
- inner_indent += 2;
+ /* Find a predicate node. */
+ while (b && b->type != DT_pred)
+ b = b->next;
+ if (b)
+ {
+ /* Due to how these tests are constructed, we don't even need
+ to check that the mode and code are compatible -- they were
+ generated from the predicate in the first place. */
+ while (a->type == DT_mode || a->type == DT_code)
+ a = a->next;
+ tree->tests = a;
}
- else
- uncond = 1;
+ }
- need_bracket = ! uncond;
+ /* Recurse. */
+ for (tree = head->first; tree; tree = tree->next)
+ simplify_tests (&tree->success);
+}
- if (p->opno >= 0)
- {
- if (need_bracket)
- {
- printf ("%s{\n", indents[inner_indent]);
- inner_indent += 2;
- wrote_bracket = 1;
- need_bracket = 0;
- }
+/* Count the number of subnodes of HEAD. If the number is high enough,
+ make the first node in HEAD start a separate subroutine in the C code
+ that is generated. */
+
+static int
+break_out_subroutines (head, initial)
+ struct decision_head *head;
+ int initial;
+{
+ int size = 0;
+ struct decision *sub;
+
+ for (sub = head->first; sub; sub = sub->next)
+ size += 1 + break_out_subroutines (&sub->success, 0);
+
+ if (size > SUBROUTINE_THRESHOLD && ! initial)
+ {
+ head->first->subroutine_number = ++next_subroutine_number;
+ size = 1;
+ }
+ return size;
+}
+
+/* For each node p, find the next alternative that might be true
+ when p is true. */
+
+static void
+find_afterward (head, real_afterward)
+ struct decision_head *head;
+ struct decision *real_afterward;
+{
+ struct decision *p, *q, *afterward;
+
+ /* We can't propagate alternatives across subroutine boundaries.
+ This is not incorrect, merely a minor optimization loss. */
- printf ("%sro[%d] = x%d;\n", indents[inner_indent], p->opno, depth);
+ p = head->first;
+ afterward = (p->subroutine_number > 0 ? NULL : real_afterward);
+
+ for ( ; p ; p = p->next)
+ {
+ /* Find the next node that might be true if this one fails. */
+ for (q = p->next; q ; q = q->next)
+ if (maybe_both_true (p, q, 1))
+ break;
+
+ /* If we reached the end of the list without finding one,
+ use the incoming afterward position. */
+ if (!q)
+ q = afterward;
+ p->afterward = q;
+ if (q)
+ q->need_label = 1;
+ }
+
+ /* Recurse. */
+ for (p = head->first; p ; p = p->next)
+ if (p->success.first)
+ find_afterward (&p->success, p->afterward);
+
+ /* When we are generating a subroutine, record the real afterward
+ position in the first node where write_tree can find it, and we
+ can do the right thing at the subroutine call site. */
+ p = head->first;
+ if (p->subroutine_number > 0)
+ p->afterward = real_afterward;
+}
+\f
+/* Assuming that the state of argument is denoted by OLDPOS, take whatever
+ actions are necessary to move to NEWPOS. If we fail to move to the
+ new state, branch to node AFTERWARD if non-zero, otherwise return.
+
+ Failure to move to the new state can only occur if we are trying to
+ match multiple insns and we try to step past the end of the stream. */
+
+static void
+change_state (oldpos, newpos, afterward, indent)
+ const char *oldpos;
+ const char *newpos;
+ struct decision *afterward;
+ const char *indent;
+{
+ int odepth = strlen (oldpos);
+ int ndepth = strlen (newpos);
+ int depth;
+ int old_has_insn, new_has_insn;
+
+ /* Pop up as many levels as necessary. */
+ for (depth = odepth; strncmp (oldpos, newpos, depth) != 0; --depth)
+ continue;
+
+ /* Hunt for the last [A-Z] in both strings. */
+ for (old_has_insn = odepth - 1; old_has_insn >= 0; --old_has_insn)
+ if (ISUPPER (oldpos[old_has_insn]))
+ break;
+ for (new_has_insn = ndepth - 1; new_has_insn >= 0; --new_has_insn)
+ if (ISUPPER (newpos[new_has_insn]))
+ break;
+
+ /* Go down to desired level. */
+ while (depth < ndepth)
+ {
+ /* It's a different insn from the first one. */
+ if (ISUPPER (newpos[depth]))
+ {
+ /* We can only fail if we're moving down the tree. */
+ if (old_has_insn >= 0 && oldpos[old_has_insn] >= newpos[depth])
+ {
+ printf ("%stem = peep2_next_insn (%d);\n",
+ indent, newpos[depth] - 'A');
+ }
+ else
+ {
+ printf ("%stem = peep2_next_insn (%d);\n",
+ indent, newpos[depth] - 'A');
+ printf ("%sif (tem == NULL_RTX)\n", indent);
+ if (afterward)
+ printf ("%s goto L%d;\n", indent, afterward->number);
+ else
+ printf ("%s goto ret0;\n", indent);
+ }
+ printf ("%sx%d = PATTERN (tem);\n", indent, depth + 1);
}
+ else if (ISLOWER (newpos[depth]))
+ printf ("%sx%d = XVECEXP (x%d, 0, %d);\n",
+ indent, depth + 1, depth, newpos[depth] - 'a');
+ else
+ printf ("%sx%d = XEXP (x%d, %c);\n",
+ indent, depth + 1, depth, newpos[depth]);
+ ++depth;
+ }
+}
+\f
+/* Print the enumerator constant for CODE -- the upcase version of
+ the name. */
+
+static void
+print_code (code)
+ enum rtx_code code;
+{
+ const char *p;
+ for (p = GET_RTX_NAME (code); *p; p++)
+ putchar (TOUPPER (*p));
+}
+
+/* Emit code to cross an afterward link -- change state and branch. */
+
+static void
+write_afterward (start, afterward, indent)
+ struct decision *start;
+ struct decision *afterward;
+ const char *indent;
+{
+ if (!afterward || start->subroutine_number > 0)
+ printf("%sgoto ret0;\n", indent);
+ else
+ {
+ change_state (start->position, afterward->position, NULL, indent);
+ printf ("%sgoto L%d;\n", indent, afterward->number);
+ }
+}
+
+/* Emit a switch statement, if possible, for an initial sequence of
+ nodes at START. Return the first node yet untested. */
- if (p->c_test)
+static struct decision *
+write_switch (start, depth)
+ struct decision *start;
+ int depth;
+{
+ struct decision *p = start;
+ enum decision_type type = p->tests->type;
+ struct decision *needs_label = NULL;
+
+ /* If we have two or more nodes in sequence that test the same one
+ thing, we may be able to use a switch statement. */
+
+ if (!p->next
+ || p->tests->next
+ || p->next->tests->type != type
+ || p->next->tests->next
+ || nodes_identical_1 (p->tests, p->next->tests))
+ return p;
+
+ /* DT_code is special in that we can do interesting things with
+ known predicates at the same time. */
+ if (type == DT_code)
+ {
+ char codemap[NUM_RTX_CODE];
+ struct decision *ret;
+ RTX_CODE code;
+
+ memset (codemap, 0, sizeof(codemap));
+
+ printf (" switch (GET_CODE (x%d))\n {\n", depth);
+ code = p->tests->u.code;
+ do
{
- printf ("%sif (%s)\n", indents[inner_indent], p->c_test);
- inner_indent += 2;
- uncond = 0;
- need_bracket = 1;
+ if (p != start && p->need_label && needs_label == NULL)
+ needs_label = p;
+
+ printf (" case ");
+ print_code (code);
+ printf (":\n goto L%d;\n", p->success.first->number);
+ p->success.first->need_label = 1;
+
+ codemap[code] = 1;
+ p = p->next;
}
+ while (p
+ && ! p->tests->next
+ && p->tests->type == DT_code
+ && ! codemap[code = p->tests->u.code]);
+
+ /* If P is testing a predicate that we know about and we haven't
+ seen any of the codes that are valid for the predicate, we can
+ write a series of "case" statement, one for each possible code.
+ Since we are already in a switch, these redundant tests are very
+ cheap and will reduce the number of predicates called. */
+
+ /* Note that while we write out cases for these predicates here,
+ we don't actually write the test here, as it gets kinda messy.
+ It is trivial to leave this to later by telling our caller that
+ we only processed the CODE tests. */
+ if (needs_label != NULL)
+ ret = needs_label;
+ else
+ ret = p;
- if (p->insn_code_number >= 0)
+ while (p && p->tests->type == DT_pred
+ && p->tests->u.pred.index >= 0)
{
- if (type == SPLIT)
- printf ("%sreturn gen_split_%d (operands);\n",
- indents[inner_indent], p->insn_code_number);
- else
+ const RTX_CODE *c;
+
+ for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
+ if (codemap[(int) *c] != 0)
+ goto pred_done;
+
+ for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
{
- if (p->num_clobbers_to_add)
- {
- if (need_bracket)
- {
- printf ("%s{\n", indents[inner_indent]);
- inner_indent += 2;
- }
+ printf (" case ");
+ print_code (*c);
+ printf (":\n");
+ codemap[(int) *c] = 1;
+ }
- printf ("%s*pnum_clobbers = %d;\n",
- indents[inner_indent], p->num_clobbers_to_add);
- printf ("%sreturn %d;\n",
- indents[inner_indent], p->insn_code_number);
+ printf (" goto L%d;\n", p->number);
+ p->need_label = 1;
+ p = p->next;
+ }
- if (need_bracket)
- {
- inner_indent -= 2;
- printf ("%s}\n", indents[inner_indent]);
- }
- }
- else
- printf ("%sreturn %d;\n",
- indents[inner_indent], p->insn_code_number);
+ pred_done:
+ /* Make the default case skip the predicates we managed to match. */
+
+ printf (" default:\n");
+ if (p != ret)
+ {
+ if (p)
+ {
+ printf (" goto L%d;\n", p->number);
+ p->need_label = 1;
}
+ else
+ write_afterward (start, start->afterward, " ");
}
else
- printf ("%sgoto L%d;\n", indents[inner_indent],
- p->success.first->number);
+ printf (" break;\n");
+ printf (" }\n");
- if (wrote_bracket)
- printf ("%s}\n", indents[inner_indent - 2]);
+ return ret;
}
+ else if (type == DT_mode
+ || type == DT_veclen
+ || type == DT_elt_zero_int
+ || type == DT_elt_one_int
+ || type == DT_elt_zero_wide_safe)
+ {
+ const char *indent = "";
+
+ /* We cast switch parameter to integer, so we must ensure that the value
+ fits. */
+ if (type == DT_elt_zero_wide_safe)
+ {
+ indent = " ";
+ printf(" if ((int) XWINT (x%d, 0) == XWINT (x%d, 0))\n", depth, depth);
+ }
+ printf ("%s switch (", indent);
+ switch (type)
+ {
+ case DT_mode:
+ printf ("GET_MODE (x%d)", depth);
+ break;
+ case DT_veclen:
+ printf ("XVECLEN (x%d, 0)", depth);
+ break;
+ case DT_elt_zero_int:
+ printf ("XINT (x%d, 0)", depth);
+ break;
+ case DT_elt_one_int:
+ printf ("XINT (x%d, 1)", depth);
+ break;
+ case DT_elt_zero_wide_safe:
+ /* Convert result of XWINT to int for portability since some C
+ compilers won't do it and some will. */
+ printf ("(int) XWINT (x%d, 0)", depth);
+ break;
+ default:
+ abort ();
+ }
+ printf (")\n%s {\n", indent);
+
+ do
+ {
+ /* Merge trees will not unify identical nodes if their
+ sub-nodes are at different levels. Thus we must check
+ for duplicate cases. */
+ struct decision *q;
+ for (q = start; q != p; q = q->next)
+ if (nodes_identical_1 (p->tests, q->tests))
+ goto case_done;
+
+ if (p != start && p->need_label && needs_label == NULL)
+ needs_label = p;
+
+ printf ("%s case ", indent);
+ switch (type)
+ {
+ case DT_mode:
+ printf ("%smode", GET_MODE_NAME (p->tests->u.mode));
+ break;
+ case DT_veclen:
+ printf ("%d", p->tests->u.veclen);
+ break;
+ case DT_elt_zero_int:
+ case DT_elt_one_int:
+ case DT_elt_zero_wide:
+ case DT_elt_zero_wide_safe:
+ printf (HOST_WIDE_INT_PRINT_DEC, p->tests->u.intval);
+ break;
+ default:
+ abort ();
+ }
+ printf (":\n%s goto L%d;\n", indent, p->success.first->number);
+ p->success.first->need_label = 1;
- /* We have now tested all alternatives. End any switches we have open
- and branch to the alternative node unless we know that we can't fall
- through to the branch. */
+ p = p->next;
+ }
+ while (p && p->tests->type == type && !p->tests->next);
+
+ case_done:
+ printf ("%s default:\n%s break;\n%s }\n",
+ indent, indent, indent);
- if (switch_code != UNKNOWN)
+ return needs_label != NULL ? needs_label : p;
+ }
+ else
{
- printf ("%s}\n", indents[indent - 2]);
- indent -= 4;
- uncond = 0;
+ /* None of the other tests are ameanable. */
+ return p;
}
+}
+
+/* Emit code for one test. */
- if (switch_mode != VOIDmode)
+static void
+write_cond (p, depth, subroutine_type)
+ struct decision_test *p;
+ int depth;
+ enum routine_type subroutine_type;
+{
+ switch (p->type)
{
- printf ("%s}\n", indents[indent - 2]);
- indent -= 4;
- uncond = 0;
- }
+ case DT_mode:
+ printf ("GET_MODE (x%d) == %smode", depth, GET_MODE_NAME (p->u.mode));
+ break;
- if (indent != 2)
- abort ();
+ case DT_code:
+ printf ("GET_CODE (x%d) == ", depth);
+ print_code (p->u.code);
+ break;
- if (uncond)
- return;
+ case DT_veclen:
+ printf ("XVECLEN (x%d, 0) == %d", depth, p->u.veclen);
+ break;
- if (afterward)
- {
- change_state (prevpos, afterward->position, 2);
- printf (" goto L%d;\n", afterward->number);
+ case DT_elt_zero_int:
+ printf ("XINT (x%d, 0) == %d", depth, (int) p->u.intval);
+ break;
+
+ case DT_elt_one_int:
+ printf ("XINT (x%d, 1) == %d", depth, (int) p->u.intval);
+ break;
+
+ case DT_elt_zero_wide:
+ case DT_elt_zero_wide_safe:
+ printf ("XWINT (x%d, 0) == ", depth);
+ printf (HOST_WIDE_INT_PRINT_DEC, p->u.intval);
+ break;
+
+ case DT_veclen_ge:
+ printf ("XVECLEN (x%d, 0) >= %d", depth, p->u.veclen);
+ break;
+
+ case DT_dup:
+ printf ("rtx_equal_p (x%d, operands[%d])", depth, p->u.dup);
+ break;
+
+ case DT_pred:
+ printf ("%s (x%d, %smode)", p->u.pred.name, depth,
+ GET_MODE_NAME (p->u.pred.mode));
+ break;
+
+ case DT_c_test:
+ printf ("(%s)", p->u.c_test);
+ break;
+
+ case DT_accept_insn:
+ switch (subroutine_type)
+ {
+ case RECOG:
+ if (p->u.insn.num_clobbers_to_add == 0)
+ abort ();
+ printf ("pnum_clobbers != NULL");
+ break;
+
+ default:
+ abort ();
+ }
+ break;
+
+ default:
+ abort ();
}
- else
- printf (" goto ret0;\n");
}
+/* Emit code for one action. The previous tests have succeeded;
+ TEST is the last of the chain. In the normal case we simply
+ perform a state change. For the `accept' tests we must do more work. */
+
static void
-print_code (code)
- enum rtx_code code;
+write_action (p, test, depth, uncond, success, subroutine_type)
+ struct decision *p;
+ struct decision_test *test;
+ int depth, uncond;
+ struct decision *success;
+ enum routine_type subroutine_type;
{
- register char *p1;
- for (p1 = GET_RTX_NAME (code); *p1; p1++)
+ const char *indent;
+ int want_close = 0;
+
+ if (uncond)
+ indent = " ";
+ else if (test->type == DT_accept_op || test->type == DT_accept_insn)
{
- if (*p1 >= 'a' && *p1 <= 'z')
- putchar (*p1 + 'A' - 'a');
- else
- putchar (*p1);
+ fputs (" {\n", stdout);
+ indent = " ";
+ want_close = 1;
+ }
+ else
+ indent = " ";
+
+ if (test->type == DT_accept_op)
+ {
+ printf("%soperands[%d] = x%d;\n", indent, test->u.opno, depth);
+
+ /* Only allow DT_accept_insn to follow. */
+ if (test->next)
+ {
+ test = test->next;
+ if (test->type != DT_accept_insn)
+ abort ();
+ }
}
+
+ /* Sanity check that we're now at the end of the list of tests. */
+ if (test->next)
+ abort ();
+
+ if (test->type == DT_accept_insn)
+ {
+ switch (subroutine_type)
+ {
+ case RECOG:
+ if (test->u.insn.num_clobbers_to_add != 0)
+ printf ("%s*pnum_clobbers = %d;\n",
+ indent, test->u.insn.num_clobbers_to_add);
+ printf ("%sreturn %d;\n", indent, test->u.insn.code_number);
+ break;
+
+ case SPLIT:
+ printf ("%sreturn gen_split_%d (operands);\n",
+ indent, test->u.insn.code_number);
+ break;
+
+ case PEEPHOLE2:
+ {
+ int match_len = 0, i;
+
+ for (i = strlen (p->position) - 1; i >= 0; --i)
+ if (ISUPPER (p->position[i]))
+ {
+ match_len = p->position[i] - 'A';
+ break;
+ }
+ printf ("%s*_pmatch_len = %d;\n", indent, match_len);
+ printf ("%stem = gen_peephole2_%d (insn, operands);\n",
+ indent, test->u.insn.code_number);
+ printf ("%sif (tem != 0)\n%s return tem;\n", indent, indent);
+ }
+ break;
+
+ default:
+ abort ();
+ }
+ }
+ else
+ {
+ printf("%sgoto L%d;\n", indent, success->number);
+ success->need_label = 1;
+ }
+
+ if (want_close)
+ fputs (" }\n", stdout);
}
+/* Return 1 if the test is always true and has no fallthru path. Return -1
+ if the test does have a fallthru path, but requires that the condition be
+ terminated. Otherwise return 0 for a normal test. */
+/* ??? is_unconditional is a stupid name for a tri-state function. */
+
static int
-same_codes (p, code)
- register struct decision *p;
- register enum rtx_code code;
+is_unconditional (t, subroutine_type)
+ struct decision_test *t;
+ enum routine_type subroutine_type;
{
- for (; p; p = p->next)
- if (p->code != code)
- return 0;
+ if (t->type == DT_accept_op)
+ return 1;
- return 1;
-}
+ if (t->type == DT_accept_insn)
+ {
+ switch (subroutine_type)
+ {
+ case RECOG:
+ return (t->u.insn.num_clobbers_to_add == 0);
+ case SPLIT:
+ return 1;
+ case PEEPHOLE2:
+ return -1;
+ default:
+ abort ();
+ }
+ }
-static void
-clear_codes (p)
- register struct decision *p;
-{
- for (; p; p = p->next)
- p->ignore_code = 1;
+ return 0;
}
+/* Emit code for one node -- the conditional and the accompanying action.
+ Return true if there is no fallthru path. */
+
static int
-same_modes (p, mode)
- register struct decision *p;
- register enum machine_mode mode;
+write_node (p, depth, subroutine_type)
+ struct decision *p;
+ int depth;
+ enum routine_type subroutine_type;
{
- for (; p; p = p->next)
- if ((p->enforce_mode ? p->mode : VOIDmode) != mode)
- return 0;
+ struct decision_test *test, *last_test;
+ int uncond;
- return 1;
+ last_test = test = p->tests;
+ uncond = is_unconditional (test, subroutine_type);
+ if (uncond == 0)
+ {
+ printf (" if (");
+ write_cond (test, depth, subroutine_type);
+
+ while ((test = test->next) != NULL)
+ {
+ int uncond2;
+
+ last_test = test;
+ uncond2 = is_unconditional (test, subroutine_type);
+ if (uncond2 != 0)
+ break;
+
+ printf ("\n && ");
+ write_cond (test, depth, subroutine_type);
+ }
+
+ printf (")\n");
+ }
+
+ write_action (p, last_test, depth, uncond, p->success.first, subroutine_type);
+
+ return uncond > 0;
}
+/* Emit code for all of the sibling nodes of HEAD. */
+
static void
-clear_modes (p)
- register struct decision *p;
+write_tree_1 (head, depth, subroutine_type)
+ struct decision_head *head;
+ int depth;
+ enum routine_type subroutine_type;
{
- for (; p; p = p->next)
- p->enforce_mode = 0;
-}
-\f
-/* Write out the decision tree starting at TREE for a subroutine of type TYPE.
+ struct decision *p, *next;
+ int uncond = 0;
- PREVPOS is the position at the node that branched to this node.
+ for (p = head->first; p ; p = next)
+ {
+ /* The label for the first element was printed in write_tree. */
+ if (p != head->first && p->need_label)
+ OUTPUT_LABEL (" ", p->number);
+
+ /* Attempt to write a switch statement for a whole sequence. */
+ next = write_switch (p, depth);
+ if (p != next)
+ uncond = 0;
+ else
+ {
+ /* Failed -- fall back and write one node. */
+ uncond = write_node (p, depth, subroutine_type);
+ next = p->next;
+ }
+ }
- INITIAL is nonzero if this is the first node we are writing in a subroutine.
+ /* Finished with this chain. Close a fallthru path by branching
+ to the afterward node. */
+ if (! uncond)
+ write_afterward (head->last, head->last->afterward, " ");
+}
- If all nodes are false, branch to the node AFTERWARD. */
+/* Write out the decision tree starting at HEAD. PREVPOS is the
+ position at the node that branched to this node. */
static void
-write_tree (tree, prevpos, afterward, initial, type)
- struct decision *tree;
+write_tree (head, prevpos, type, initial)
+ struct decision_head *head;
const char *prevpos;
- struct decision *afterward;
- int initial;
enum routine_type type;
+ int initial;
{
- register struct decision *p;
- const char *name_prefix = (type == SPLIT ? "split" : "recog");
- const char *call_suffix = (type == SPLIT ? "" : ", pnum_clobbers");
+ struct decision *p = head->first;
- if (! initial && tree->subroutine_number > 0)
+ putchar ('\n');
+ if (p->need_label)
+ OUTPUT_LABEL (" ", p->number);
+
+ if (! initial && p->subroutine_number > 0)
{
- OUTPUT_LABEL (" ", tree->number);
+ static const char * const name_prefix[] = {
+ "recog", "split", "peephole2"
+ };
+
+ static const char * const call_suffix[] = {
+ ", pnum_clobbers", "", ", _pmatch_len"
+ };
- if (afterward)
+ /* This node has been broken out into a separate subroutine.
+ Call it, test the result, and branch accordingly. */
+
+ if (p->afterward)
{
printf (" tem = %s_%d (x0, insn%s);\n",
- name_prefix, tree->subroutine_number, call_suffix);
- if (type == SPLIT)
- printf (" if (tem != 0) return tem;\n");
+ name_prefix[type], p->subroutine_number, call_suffix[type]);
+ if (IS_SPLIT (type))
+ printf (" if (tem != 0)\n return tem;\n");
else
- printf (" if (tem >= 0) return tem;\n");
- change_state (tree->position, afterward->position, 2);
- printf (" goto L%d;\n", afterward->number);
+ printf (" if (tem >= 0)\n return tem;\n");
+
+ change_state (p->position, p->afterward->position, NULL, " ");
+ printf (" goto L%d;\n", p->afterward->number);
}
else
- printf (" return %s_%d (x0, insn%s);\n",
- name_prefix, tree->subroutine_number, call_suffix);
- return;
+ {
+ printf (" return %s_%d (x0, insn%s);\n",
+ name_prefix[type], p->subroutine_number, call_suffix[type]);
+ }
}
+ else
+ {
+ int depth = strlen (p->position);
- write_tree_1 (tree, prevpos, afterward, type);
+ change_state (prevpos, p->position, head->last->afterward, " ");
+ write_tree_1 (head, depth, type);
- for (p = tree; p; p = p->next)
- if (p->success.first)
- write_tree (p->success.first, p->position,
- p->afterward ? p->afterward : afterward, 0, type);
+ for (p = head->first; p; p = p->next)
+ if (p->success.first)
+ write_tree (&p->success, p->position, type, 0);
+ }
}
-\f
-/* Assuming that the state of argument is denoted by OLDPOS, take whatever
- actions are necessary to move to NEWPOS.
-
- INDENT says how many blanks to place at the front of lines. */
+/* Write out a subroutine of type TYPE to do comparisons starting at
+ node TREE. */
static void
-change_state (oldpos, newpos, indent)
- const char *oldpos;
- const char *newpos;
- int indent;
+write_subroutine (head, type)
+ struct decision_head *head;
+ enum routine_type type;
{
- int odepth = strlen (oldpos);
- int depth = odepth;
- int ndepth = strlen (newpos);
-
- /* Pop up as many levels as necessary. */
+ int subfunction = head->first ? head->first->subroutine_number : 0;
+ const char *s_or_e;
+ char extension[32];
+ int i;
- while (strncmp (oldpos, newpos, depth))
- --depth;
+ s_or_e = subfunction ? "static " : "";
- /* Go down to desired level. */
+ if (subfunction)
+ sprintf (extension, "_%d", subfunction);
+ else if (type == RECOG)
+ extension[0] = '\0';
+ else
+ strcpy (extension, "_insns");
- while (depth < ndepth)
+ switch (type)
{
- if (newpos[depth] >= 'a' && newpos[depth] <= 'z')
- printf ("%sx%d = XVECEXP (x%d, 0, %d);\n",
- indents[indent], depth + 1, depth, newpos[depth] - 'a');
- else
- printf ("%sx%d = XEXP (x%d, %c);\n",
- indents[indent], depth + 1, depth, newpos[depth]);
- ++depth;
+ case RECOG:
+ printf ("%sint recog%s PARAMS ((rtx, rtx, int *));\n", s_or_e, extension);
+ printf ("%sint\n\
+recog%s (x0, insn, pnum_clobbers)\n\
+ rtx x0 ATTRIBUTE_UNUSED;\n\
+ rtx insn ATTRIBUTE_UNUSED;\n\
+ int *pnum_clobbers ATTRIBUTE_UNUSED;\n", s_or_e, extension);
+ break;
+ case SPLIT:
+ printf ("%srtx split%s PARAMS ((rtx, rtx));\n", s_or_e, extension);
+ printf ("%srtx\n\
+split%s (x0, insn)\n\
+ rtx x0 ATTRIBUTE_UNUSED;\n\
+ rtx insn ATTRIBUTE_UNUSED;\n", s_or_e, extension);
+ break;
+ case PEEPHOLE2:
+ printf ("%srtx peephole2%s PARAMS ((rtx, rtx, int *));\n",
+ s_or_e, extension);
+ printf ("%srtx\n\
+peephole2%s (x0, insn, _pmatch_len)\n\
+ rtx x0 ATTRIBUTE_UNUSED;\n\
+ rtx insn ATTRIBUTE_UNUSED;\n\
+ int *_pmatch_len ATTRIBUTE_UNUSED;\n", s_or_e, extension);
+ break;
}
+
+ printf ("{\n rtx * const operands ATTRIBUTE_UNUSED = &recog_data.operand[0];\n");
+ for (i = 1; i <= max_depth; i++)
+ printf (" rtx x%d ATTRIBUTE_UNUSED;\n", i);
+
+ printf (" %s tem ATTRIBUTE_UNUSED;\n", IS_SPLIT (type) ? "rtx" : "int");
+
+ if (!subfunction)
+ printf (" recog_data.insn = NULL_RTX;\n");
+
+ if (head->first)
+ write_tree (head, "", type, 1);
+ else
+ printf (" goto ret0;\n");
+
+ printf (" ret0:\n return %d;\n}\n\n", IS_SPLIT (type) ? 0 : -1);
}
-\f
-char *
-xstrdup (input)
- const char *input;
+
+/* In break_out_subroutines, we discovered the boundaries for the
+ subroutines, but did not write them out. Do so now. */
+
+static void
+write_subroutines (head, type)
+ struct decision_head *head;
+ enum routine_type type;
{
- register size_t len = strlen (input) + 1;
- register char *output = xmalloc (len);
- memcpy (output, input, len);
- return output;
+ struct decision *p;
+
+ for (p = head->first; p ; p = p->next)
+ if (p->success.first)
+ write_subroutines (&p->success, type);
+
+ if (head->first->subroutine_number > 0)
+ write_subroutine (head, type);
}
-PTR
-xrealloc (ptr, size)
- PTR ptr;
- size_t size;
+/* Begin the output file. */
+
+static void
+write_header ()
{
- register PTR result = (PTR) realloc (ptr, size);
- if (!result)
- fatal ("virtual memory exhausted");
- return result;
+ puts ("\
+/* Generated automatically by the program `genrecog' from the target\n\
+ machine description file. */\n\
+\n\
+#include \"config.h\"\n\
+#include \"system.h\"\n\
+#include \"rtl.h\"\n\
+#include \"tm_p.h\"\n\
+#include \"function.h\"\n\
+#include \"insn-config.h\"\n\
+#include \"recog.h\"\n\
+#include \"real.h\"\n\
+#include \"output.h\"\n\
+#include \"flags.h\"\n\
+#include \"hard-reg-set.h\"\n\
+#include \"resource.h\"\n\
+#include \"toplev.h\"\n\
+#include \"reload.h\"\n\
+\n");
+
+ puts ("\n\
+/* `recog' contains a decision tree that recognizes whether the rtx\n\
+ X0 is a valid instruction.\n\
+\n\
+ recog returns -1 if the rtx is not valid. If the rtx is valid, recog\n\
+ returns a nonnegative number which is the insn code number for the\n\
+ pattern that matched. This is the same as the order in the machine\n\
+ description of the entry that matched. This number can be used as an\n\
+ index into `insn_data' and other tables.\n");
+ puts ("\
+ The third argument to recog is an optional pointer to an int. If\n\
+ present, recog will accept a pattern if it matches except for missing\n\
+ CLOBBER expressions at the end. In that case, the value pointed to by\n\
+ the optional pointer will be set to the number of CLOBBERs that need\n\
+ to be added (it should be initialized to zero by the caller). If it");
+ puts ("\
+ is set nonzero, the caller should allocate a PARALLEL of the\n\
+ appropriate size, copy the initial entries, and call add_clobbers\n\
+ (found in insn-emit.c) to fill in the CLOBBERs.\n\
+");
+
+ puts ("\n\
+ The function split_insns returns 0 if the rtl could not\n\
+ be split or the split rtl in a SEQUENCE if it can be.\n\
+\n\
+ The function peephole2_insns returns 0 if the rtl could not\n\
+ be matched. If there was a match, the new rtl is returned in a SEQUENCE,\n\
+ and LAST_INSN will point to the last recognized insn in the old sequence.\n\
+*/\n\n");
}
-PTR
-xmalloc (size)
- size_t size;
+\f
+/* Construct and return a sequence of decisions
+ that will recognize INSN.
+
+ TYPE says what type of routine we are recognizing (RECOG or SPLIT). */
+
+static struct decision_head
+make_insn_sequence (insn, type)
+ rtx insn;
+ enum routine_type type;
{
- register PTR val = (PTR) malloc (size);
+ rtx x;
+ const char *c_test = XSTR (insn, type == RECOG ? 2 : 1);
+ struct decision *last;
+ struct decision_test *test, **place;
+ struct decision_head head;
+ char c_test_pos[2];
+
+ record_insn_name (next_insn_code, (type == RECOG ? XSTR (insn, 0) : NULL));
+
+ c_test_pos[0] = '\0';
+ if (type == PEEPHOLE2)
+ {
+ int i, j;
+
+ /* peephole2 gets special treatment:
+ - X always gets an outer parallel even if it's only one entry
+ - we remove all traces of outer-level match_scratch and match_dup
+ expressions here. */
+ x = rtx_alloc (PARALLEL);
+ PUT_MODE (x, VOIDmode);
+ XVEC (x, 0) = rtvec_alloc (XVECLEN (insn, 0));
+ for (i = j = 0; i < XVECLEN (insn, 0); i++)
+ {
+ rtx tmp = XVECEXP (insn, 0, i);
+ if (GET_CODE (tmp) != MATCH_SCRATCH && GET_CODE (tmp) != MATCH_DUP)
+ {
+ XVECEXP (x, 0, j) = tmp;
+ j++;
+ }
+ }
+ XVECLEN (x, 0) = j;
+
+ c_test_pos[0] = 'A' + j - 1;
+ c_test_pos[1] = '\0';
+ }
+ else if (XVECLEN (insn, type == RECOG) == 1)
+ x = XVECEXP (insn, type == RECOG, 0);
+ else
+ {
+ x = rtx_alloc (PARALLEL);
+ XVEC (x, 0) = XVEC (insn, type == RECOG);
+ PUT_MODE (x, VOIDmode);
+ }
+
+ validate_pattern (x, insn, NULL_RTX, 0);
+
+ memset(&head, 0, sizeof(head));
+ last = add_to_sequence (x, &head, "", type, 1);
+
+ /* Find the end of the test chain on the last node. */
+ for (test = last->tests; test->next; test = test->next)
+ continue;
+ place = &test->next;
+
+ if (c_test[0])
+ {
+ /* Need a new node if we have another test to add. */
+ if (test->type == DT_accept_op)
+ {
+ last = new_decision (c_test_pos, &last->success);
+ place = &last->tests;
+ }
+ test = new_decision_test (DT_c_test, &place);
+ test->u.c_test = c_test;
+ }
+
+ test = new_decision_test (DT_accept_insn, &place);
+ test->u.insn.code_number = next_insn_code;
+ test->u.insn.lineno = pattern_lineno;
+ test->u.insn.num_clobbers_to_add = 0;
+
+ switch (type)
+ {
+ case RECOG:
+ /* If this is an DEFINE_INSN and X is a PARALLEL, see if it ends
+ with a group of CLOBBERs of (hard) registers or MATCH_SCRATCHes.
+ If so, set up to recognize the pattern without these CLOBBERs. */
+
+ if (GET_CODE (x) == PARALLEL)
+ {
+ int i;
+
+ /* Find the last non-clobber in the parallel. */
+ for (i = XVECLEN (x, 0); i > 0; i--)
+ {
+ rtx y = XVECEXP (x, 0, i - 1);
+ if (GET_CODE (y) != CLOBBER
+ || (GET_CODE (XEXP (y, 0)) != REG
+ && GET_CODE (XEXP (y, 0)) != MATCH_SCRATCH))
+ break;
+ }
+
+ if (i != XVECLEN (x, 0))
+ {
+ rtx new;
+ struct decision_head clobber_head;
+
+ /* Build a similar insn without the clobbers. */
+ if (i == 1)
+ new = XVECEXP (x, 0, 0);
+ else
+ {
+ int j;
+
+ new = rtx_alloc (PARALLEL);
+ XVEC (new, 0) = rtvec_alloc (i);
+ for (j = i - 1; j >= 0; j--)
+ XVECEXP (new, 0, j) = XVECEXP (x, 0, j);
+ }
+
+ /* Recognize it. */
+ memset (&clobber_head, 0, sizeof(clobber_head));
+ last = add_to_sequence (new, &clobber_head, "", type, 1);
+
+ /* Find the end of the test chain on the last node. */
+ for (test = last->tests; test->next; test = test->next)
+ continue;
+
+ /* We definitely have a new test to add -- create a new
+ node if needed. */
+ place = &test->next;
+ if (test->type == DT_accept_op)
+ {
+ last = new_decision ("", &last->success);
+ place = &last->tests;
+ }
- if (val == 0)
- fatal ("virtual memory exhausted");
- return val;
+ if (c_test[0])
+ {
+ test = new_decision_test (DT_c_test, &place);
+ test->u.c_test = c_test;
+ }
+
+ test = new_decision_test (DT_accept_insn, &place);
+ test->u.insn.code_number = next_insn_code;
+ test->u.insn.lineno = pattern_lineno;
+ test->u.insn.num_clobbers_to_add = XVECLEN (x, 0) - i;
+
+ merge_trees (&head, &clobber_head);
+ }
+ }
+ break;
+
+ case SPLIT:
+ /* Define the subroutine we will call below and emit in genemit. */
+ printf ("extern rtx gen_split_%d PARAMS ((rtx *));\n", next_insn_code);
+ break;
+
+ case PEEPHOLE2:
+ /* Define the subroutine we will call below and emit in genemit. */
+ printf ("extern rtx gen_peephole2_%d PARAMS ((rtx, rtx *));\n",
+ next_insn_code);
+ break;
+ }
+
+ return head;
}
static void
-fatal VPROTO ((const char *format, ...))
+process_tree (head, subroutine_type)
+ struct decision_head *head;
+ enum routine_type subroutine_type;
{
-#ifndef ANSI_PROTOTYPES
- const char *format;
-#endif
- va_list ap;
-
- VA_START (ap, format);
+ if (head->first == NULL)
+ {
+ /* We can elide peephole2_insns, but not recog or split_insns. */
+ if (subroutine_type == PEEPHOLE2)
+ return;
+ }
+ else
+ {
+ factor_tests (head);
-#ifndef ANSI_PROTOTYPES
- format = va_arg (ap, const char *);
-#endif
+ next_subroutine_number = 0;
+ break_out_subroutines (head, 1);
+ find_afterward (head, NULL);
- fprintf (stderr, "genrecog: ");
- vfprintf (stderr, format, ap);
- va_end (ap);
- fprintf (stderr, "\n");
- fprintf (stderr, "after %d definitions\n", next_index);
- exit (FATAL_EXIT_CODE);
-}
+ /* We run this after find_afterward, because find_afterward needs
+ the redundant DT_mode tests on predicates to determine whether
+ two tests can both be true or not. */
+ simplify_tests(head);
-/* More 'friendly' abort that prints the line and file.
- config.h can #define abort fancy_abort if you like that sort of thing. */
+ write_subroutines (head, subroutine_type);
+ }
-void
-fancy_abort ()
-{
- fatal ("Internal gcc abort.");
+ write_subroutine (head, subroutine_type);
}
\f
+extern int main PARAMS ((int, char **));
+
int
main (argc, argv)
int argc;
char **argv;
{
rtx desc;
- struct decision_head recog_tree;
- struct decision_head split_tree;
- FILE *infile;
- register int c;
+ struct decision_head recog_tree, split_tree, peephole2_tree, h;
+
+ progname = "genrecog";
- obstack_init (rtl_obstack);
- recog_tree.first = recog_tree.last = split_tree.first = split_tree.last = 0;
+ memset (&recog_tree, 0, sizeof recog_tree);
+ memset (&split_tree, 0, sizeof split_tree);
+ memset (&peephole2_tree, 0, sizeof peephole2_tree);
if (argc <= 1)
- fatal ("No input file name.");
+ fatal ("no input file name");
- infile = fopen (argv[1], "r");
- if (infile == 0)
- {
- perror (argv[1]);
- exit (FATAL_EXIT_CODE);
- }
+ if (init_md_reader_args (argc, argv) != SUCCESS_EXIT_CODE)
+ return (FATAL_EXIT_CODE);
- init_rtl ();
next_insn_code = 0;
next_index = 0;
- printf ("/* Generated automatically by the program `genrecog'\n\
-from the machine description file `md'. */\n\n");
-
- printf ("#include \"config.h\"\n");
- printf ("#include \"system.h\"\n");
- printf ("#include \"rtl.h\"\n");
- printf ("#include \"insn-config.h\"\n");
- printf ("#include \"recog.h\"\n");
- printf ("#include \"real.h\"\n");
- printf ("#include \"output.h\"\n");
- printf ("#include \"flags.h\"\n");
- printf ("\n");
+ write_header ();
/* Read the machine description. */
while (1)
{
- c = read_skip_spaces (infile);
- if (c == EOF)
+ desc = read_md_rtx (&pattern_lineno, &next_insn_code);
+ if (desc == NULL)
break;
- ungetc (c, infile);
- desc = read_rtx (infile);
if (GET_CODE (desc) == DEFINE_INSN)
- recog_tree = merge_trees (recog_tree,
- make_insn_sequence (desc, RECOG));
+ {
+ h = make_insn_sequence (desc, RECOG);
+ merge_trees (&recog_tree, &h);
+ }
else if (GET_CODE (desc) == DEFINE_SPLIT)
- split_tree = merge_trees (split_tree,
- make_insn_sequence (desc, SPLIT));
- if (GET_CODE (desc) == DEFINE_PEEPHOLE
- || GET_CODE (desc) == DEFINE_EXPAND)
- next_insn_code++;
+ {
+ h = make_insn_sequence (desc, SPLIT);
+ merge_trees (&split_tree, &h);
+ }
+ else if (GET_CODE (desc) == DEFINE_PEEPHOLE2)
+ {
+ h = make_insn_sequence (desc, PEEPHOLE2);
+ merge_trees (&peephole2_tree, &h);
+ }
+
next_index++;
}
- printf ("\n\
-/* `recog' contains a decision tree\n\
- that recognizes whether the rtx X0 is a valid instruction.\n\
-\n\
- recog returns -1 if the rtx is not valid.\n\
- If the rtx is valid, recog returns a nonnegative number\n\
- which is the insn code number for the pattern that matched.\n");
- printf (" This is the same as the order in the machine description of\n\
- the entry that matched. This number can be used as an index into various\n\
- insn_* tables, such as insn_templates, insn_outfun, and insn_n_operands\n\
- (found in insn-output.c).\n\n");
- printf (" The third argument to recog is an optional pointer to an int.\n\
- If present, recog will accept a pattern if it matches except for\n\
- missing CLOBBER expressions at the end. In that case, the value\n\
- pointed to by the optional pointer will be set to the number of\n\
- CLOBBERs that need to be added (it should be initialized to zero by\n\
- the caller). If it is set nonzero, the caller should allocate a\n\
- PARALLEL of the appropriate size, copy the initial entries, and call\n\
- add_clobbers (found in insn-emit.c) to fill in the CLOBBERs.");
-
- if (split_tree.first)
- printf ("\n\n The function split_insns returns 0 if the rtl could not\n\
- be split or the split rtl in a SEQUENCE if it can be.");
-
- printf ("*/\n\n");
-
- printf ("#define operands recog_operand\n\n");
-
- next_subroutine_number = 0;
- break_out_subroutines (recog_tree, RECOG, 1);
- write_subroutine (recog_tree.first, RECOG);
-
- next_subroutine_number = 0;
- break_out_subroutines (split_tree, SPLIT, 1);
- write_subroutine (split_tree.first, SPLIT);
+ if (error_count)
+ return FATAL_EXIT_CODE;
+
+ puts ("\n\n");
+
+ process_tree (&recog_tree, RECOG);
+ process_tree (&split_tree, SPLIT);
+ process_tree (&peephole2_tree, PEEPHOLE2);
fflush (stdout);
- exit (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
- /* NOTREACHED */
- return 0;
+ return (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
+}
+\f
+/* Define this so we can link with print-rtl.o to get debug_rtx function. */
+const char *
+get_insn_name (code)
+ int code;
+{
+ if (code < insn_name_ptr_size)
+ return insn_name_ptr[code];
+ else
+ return NULL;
+}
+
+static void
+record_insn_name (code, name)
+ int code;
+ const char *name;
+{
+ static const char *last_real_name = "insn";
+ static int last_real_code = 0;
+ char *new;
+
+ if (insn_name_ptr_size <= code)
+ {
+ int new_size;
+ new_size = (insn_name_ptr_size ? insn_name_ptr_size * 2 : 512);
+ insn_name_ptr =
+ (char **) xrealloc (insn_name_ptr, sizeof(char *) * new_size);
+ memset (insn_name_ptr + insn_name_ptr_size, 0,
+ sizeof(char *) * (new_size - insn_name_ptr_size));
+ insn_name_ptr_size = new_size;
+ }
+
+ if (!name || name[0] == '\0')
+ {
+ new = xmalloc (strlen (last_real_name) + 10);
+ sprintf (new, "%s+%d", last_real_name, code - last_real_code);
+ }
+ else
+ {
+ last_real_name = new = xstrdup (name);
+ last_real_code = code;
+ }
+
+ insn_name_ptr[code] = new;
+}
+\f
+static void
+debug_decision_2 (test)
+ struct decision_test *test;
+{
+ switch (test->type)
+ {
+ case DT_mode:
+ fprintf (stderr, "mode=%s", GET_MODE_NAME (test->u.mode));
+ break;
+ case DT_code:
+ fprintf (stderr, "code=%s", GET_RTX_NAME (test->u.code));
+ break;
+ case DT_veclen:
+ fprintf (stderr, "veclen=%d", test->u.veclen);
+ break;
+ case DT_elt_zero_int:
+ fprintf (stderr, "elt0_i=%d", (int) test->u.intval);
+ break;
+ case DT_elt_one_int:
+ fprintf (stderr, "elt1_i=%d", (int) test->u.intval);
+ break;
+ case DT_elt_zero_wide:
+ fprintf (stderr, "elt0_w=");
+ fprintf (stderr, HOST_WIDE_INT_PRINT_DEC, test->u.intval);
+ break;
+ case DT_elt_zero_wide_safe:
+ fprintf (stderr, "elt0_ws=");
+ fprintf (stderr, HOST_WIDE_INT_PRINT_DEC, test->u.intval);
+ break;
+ case DT_veclen_ge:
+ fprintf (stderr, "veclen>=%d", test->u.veclen);
+ break;
+ case DT_dup:
+ fprintf (stderr, "dup=%d", test->u.dup);
+ break;
+ case DT_pred:
+ fprintf (stderr, "pred=(%s,%s)",
+ test->u.pred.name, GET_MODE_NAME(test->u.pred.mode));
+ break;
+ case DT_c_test:
+ {
+ char sub[16+4];
+ strncpy (sub, test->u.c_test, sizeof(sub));
+ memcpy (sub+16, "...", 4);
+ fprintf (stderr, "c_test=\"%s\"", sub);
+ }
+ break;
+ case DT_accept_op:
+ fprintf (stderr, "A_op=%d", test->u.opno);
+ break;
+ case DT_accept_insn:
+ fprintf (stderr, "A_insn=(%d,%d)",
+ test->u.insn.code_number, test->u.insn.num_clobbers_to_add);
+ break;
+
+ default:
+ abort ();
+ }
+}
+
+static void
+debug_decision_1 (d, indent)
+ struct decision *d;
+ int indent;
+{
+ int i;
+ struct decision_test *test;
+
+ if (d == NULL)
+ {
+ for (i = 0; i < indent; ++i)
+ putc (' ', stderr);
+ fputs ("(nil)\n", stderr);
+ return;
+ }
+
+ for (i = 0; i < indent; ++i)
+ putc (' ', stderr);
+
+ putc ('{', stderr);
+ test = d->tests;
+ if (test)
+ {
+ debug_decision_2 (test);
+ while ((test = test->next) != NULL)
+ {
+ fputs (" + ", stderr);
+ debug_decision_2 (test);
+ }
+ }
+ fprintf (stderr, "} %d n %d a %d\n", d->number,
+ (d->next ? d->next->number : -1),
+ (d->afterward ? d->afterward->number : -1));
+}
+
+static void
+debug_decision_0 (d, indent, maxdepth)
+ struct decision *d;
+ int indent, maxdepth;
+{
+ struct decision *n;
+ int i;
+
+ if (maxdepth < 0)
+ return;
+ if (d == NULL)
+ {
+ for (i = 0; i < indent; ++i)
+ putc (' ', stderr);
+ fputs ("(nil)\n", stderr);
+ return;
+ }
+
+ debug_decision_1 (d, indent);
+ for (n = d->success.first; n ; n = n->next)
+ debug_decision_0 (n, indent + 2, maxdepth - 1);
+}
+
+void
+debug_decision (d)
+ struct decision *d;
+{
+ debug_decision_0 (d, 0, 1000000);
+}
+
+void
+debug_decision_list (d)
+ struct decision *d;
+{
+ while (d)
+ {
+ debug_decision_0 (d, 0, 0);
+ d = d->next;
+ }
}
OSDN Git Service
