/* Instruction scheduling pass.
Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998,
- 1999, 2000 Free Software Foundation, Inc.
+ 1999, 2000, 2002, 2003, 2004 Free Software Foundation, Inc.
Contributed by Michael Tiemann (tiemann@cygnus.com) Enhanced by,
and currently maintained by, Jim Wilson (wilson@cygnus.com)
-This file is part of GNU CC.
+This file is part of GCC.
-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.
+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.
-GNU CC is distributed in the hope that it will be useful, but WITHOUT
-ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+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 GNU CC; see the file COPYING. If not, write to the Free
-the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+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. */
\f
#include "config.h"
#include "system.h"
+#include "coretypes.h"
+#include "tm.h"
#include "toplev.h"
#include "rtl.h"
#include "tm_p.h"
#include "regs.h"
+#include "hard-reg-set.h"
+#include "basic-block.h"
#include "insn-attr.h"
+#include "real.h"
#include "sched-int.h"
+#include "target.h"
+#ifdef INSN_SCHEDULING
/* target_units bitmask has 1 for each unit in the cpu. It should be
possible to compute this variable from the machine description.
But currently it is computed by examining the insn list. Since
this is only needed for visualization, it seems an acceptable
solution. (For understanding the mapping of bits to units, see
- definition of function_units[] in "insn-attrtab.c".) */
+ definition of function_units[] in "insn-attrtab.c".) The scheduler
+ using only DFA description should never use the following variable. */
static int target_units = 0;
-static char *safe_concat PARAMS ((char *, char *, const char *));
-static int get_visual_tbl_length PARAMS ((void));
-static void print_exp PARAMS ((char *, rtx, int));
-static void print_value PARAMS ((char *, rtx, int));
-static void print_pattern PARAMS ((char *, rtx, int));
-static void print_insn PARAMS ((char *, rtx, int));
+static char *safe_concat (char *, char *, const char *);
+static int get_visual_tbl_length (void);
+static void print_exp (char *, rtx, int);
+static void print_value (char *, rtx, int);
+static void print_pattern (char *, rtx, int);
/* Print names of units on which insn can/should execute, for debugging. */
void
-insn_print_units (insn)
- rtx insn;
+insn_print_units (rtx insn)
{
int i;
int unit = insn_unit (insn);
}
/* MAX_VISUAL_LINES is the maximum number of lines in visualization table
- of a basic block. If more lines are needed, table is splitted to two.
+ of a basic block. If more lines are needed, table is split to two.
n_visual_lines is the number of lines printed so far for a block.
visual_tbl contains the block visualization info.
vis_no_unit holds insns in a cycle that are not mapped to any unit. */
#define MAX_VISUAL_LINES 100
#define INSN_LEN 30
int n_visual_lines;
+static unsigned visual_tbl_line_length;
char *visual_tbl;
int n_vis_no_unit;
-rtx vis_no_unit[10];
+#define MAX_VISUAL_NO_UNIT 20
+rtx vis_no_unit[MAX_VISUAL_NO_UNIT];
-/* Finds units that are in use in this fuction. Required only
+/* Finds units that are in use in this function. Required only
for visualization. */
void
-init_target_units ()
+init_target_units (void)
{
rtx insn;
int unit;
/* Return the length of the visualization table. */
static int
-get_visual_tbl_length ()
+get_visual_tbl_length (void)
{
int unit, i;
int n, n1;
char *s;
+ if (targetm.sched.use_dfa_pipeline_interface
+ && targetm.sched.use_dfa_pipeline_interface ())
+ {
+ visual_tbl_line_length = 1;
+ return 1; /* Can't return 0 because that will cause problems
+ with alloca. */
+ }
+
/* Compute length of one field in line. */
- s = (char *) alloca (INSN_LEN + 6);
+ s = alloca (INSN_LEN + 6);
sprintf (s, " %33s", "uname");
n1 = strlen (s);
n += n1;
n += strlen ("\n") + 2;
+ visual_tbl_line_length = n;
+
/* Compute length of visualization string. */
return (MAX_VISUAL_LINES * n);
}
/* Init block visualization debugging info. */
void
-init_block_visualization ()
+init_block_visualization (void)
{
strcpy (visual_tbl, "");
n_visual_lines = 0;
#define BUF_LEN 2048
static char *
-safe_concat (buf, cur, str)
- char *buf;
- char *cur;
- const char *str;
+safe_concat (char *buf, char *cur, const char *str)
{
char *end = buf + BUF_LEN - 2; /* Leave room for null. */
int c;
may be stored in objects representing values. */
static void
-print_exp (buf, x, verbose)
- char *buf;
- rtx x;
- int verbose;
+print_exp (char *buf, rtx x, int verbose)
{
char tmp[BUF_LEN];
const char *st[4];
fun = "trap_if";
op[0] = TRAP_CONDITION (x);
break;
+ case PREFETCH:
+ fun = "prefetch";
+ op[0] = XEXP (x, 0);
+ op[1] = XEXP (x, 1);
+ op[2] = XEXP (x, 2);
+ break;
case UNSPEC:
case UNSPEC_VOLATILE:
{
cur = safe_concat (buf, cur, ")");
} /* print_exp */
-/* Prints rtxes, I customly classified as values. They're constants,
+/* Prints rtxes, I customarily classified as values. They're constants,
registers, labels, symbols and memory accesses. */
static void
-print_value (buf, x, verbose)
- char *buf;
- rtx x;
- int verbose;
+print_value (char *buf, rtx x, int verbose)
{
char t[BUF_LEN];
char *cur = buf;
cur = safe_concat (buf, cur, t);
break;
case CONST_DOUBLE:
- sprintf (t, "<0x%lx,0x%lx>", (long) XWINT (x, 2), (long) XWINT (x, 3));
+ if (FLOAT_MODE_P (GET_MODE (x)))
+ real_to_decimal (t, CONST_DOUBLE_REAL_VALUE (x), sizeof (t), 0, 1);
+ else
+ sprintf (t, "<0x%lx,0x%lx>", (long) XWINT (x, 2), (long) XWINT (x, 3));
cur = safe_concat (buf, cur, t);
break;
case CONST_STRING:
if (REGNO (x) < FIRST_PSEUDO_REGISTER)
{
int c = reg_names[REGNO (x)][0];
- if (c >= '0' && c <= '9')
+ if (ISDIGIT (c))
cur = safe_concat (buf, cur, "%");
cur = safe_concat (buf, cur, reg_names[REGNO (x)]);
case SUBREG:
print_value (t, SUBREG_REG (x), verbose);
cur = safe_concat (buf, cur, t);
- sprintf (t, "#%d", SUBREG_WORD (x));
+ sprintf (t, "#%d", SUBREG_BYTE (x));
cur = safe_concat (buf, cur, t);
break;
case SCRATCH:
/* The next step in insn detalization, its pattern recognition. */
static void
-print_pattern (buf, x, verbose)
- char *buf;
- rtx x;
- int verbose;
+print_pattern (char *buf, rtx x, int verbose)
{
char t1[BUF_LEN], t2[BUF_LEN], t3[BUF_LEN];
&& XEXP (COND_EXEC_TEST (x), 1) == const0_rtx)
print_value (t1, XEXP (COND_EXEC_TEST (x), 0), verbose);
else if (GET_CODE (COND_EXEC_TEST (x)) == EQ
- && XEXP (COND_EXEC_TEST (x), 1) == const0_rtx)
- {
+ && XEXP (COND_EXEC_TEST (x), 1) == const0_rtx)
+ {
t1[0] = '!';
print_value (t1 + 1, XEXP (COND_EXEC_TEST (x), 0), verbose);
}
else
- print_value (t1, COND_EXEC_TEST (x), verbose);
+ print_value (t1, COND_EXEC_TEST (x), verbose);
print_pattern (t2, COND_EXEC_CODE (x), verbose);
sprintf (buf, "(%s) %s", t1, t2);
break;
}
break;
case SEQUENCE:
- {
- int i;
-
- sprintf (t1, "%%{");
- for (i = 0; i < XVECLEN (x, 0); i++)
- {
- print_insn (t2, XVECEXP (x, 0, i), verbose);
- sprintf (t3, "%s%s;", t1, t2);
- strcpy (t1, t3);
- }
- sprintf (buf, "%s%%}", t1);
- }
+ /* Should never see SEQUENCE codes until after reorg. */
+ abort ();
break;
case ASM_INPUT:
sprintf (buf, "asm {%s}", XSTR (x, 0));
(Probably the last "option" should be extended somehow, since it
depends now on sched.c inner variables ...) */
-static void
-print_insn (buf, x, verbose)
- char *buf;
- rtx x;
- int verbose;
+void
+print_insn (char *buf, rtx x, int verbose)
{
char t[BUF_LEN];
rtx insn = x;
}
} /* print_insn */
-/* Print visualization debugging info. */
+/* Print visualization debugging info. The scheduler using only DFA
+ description should never use the following function. */
void
-print_block_visualization (s)
- const char *s;
+print_block_visualization (const char *s)
{
int unit, i;
/* Print insns in the 'no_unit' column of visualization. */
void
-visualize_no_unit (insn)
- rtx insn;
+visualize_no_unit (rtx insn)
{
- vis_no_unit[n_vis_no_unit] = insn;
- n_vis_no_unit++;
+ if (n_vis_no_unit < MAX_VISUAL_NO_UNIT)
+ {
+ vis_no_unit[n_vis_no_unit] = insn;
+ n_vis_no_unit++;
+ }
}
/* Print insns scheduled in clock, for visualization. */
void
-visualize_scheduled_insns (clock)
- int clock;
+visualize_scheduled_insns (int clock)
{
int i, unit;
/* Print stalled cycles. */
void
-visualize_stall_cycles (stalls)
- int stalls;
+visualize_stall_cycles (int stalls)
{
- int i;
+ static const char *const prefix = ";; ";
+ const char *suffix = "\n";
+ char *p;
/* If no more room, split table into two. */
if (n_visual_lines >= MAX_VISUAL_LINES)
n_visual_lines++;
- sprintf (visual_tbl + strlen (visual_tbl), ";; ");
- for (i = 0; i < stalls; i++)
- sprintf (visual_tbl + strlen (visual_tbl), ".");
- sprintf (visual_tbl + strlen (visual_tbl), "\n");
+ p = visual_tbl + strlen (visual_tbl);
+ strcpy (p, prefix);
+ p += strlen (prefix);
+
+ if ((unsigned) stalls >
+ visual_tbl_line_length - strlen (prefix) - strlen (suffix))
+ {
+ suffix = "[...]\n";
+ stalls = visual_tbl_line_length - strlen (prefix) - strlen (suffix);
+ }
+
+ memset (p, '.', stalls);
+ p += stalls;
+
+ strcpy (p, suffix);
}
/* Allocate data used for visualization during scheduling. */
void
-visualize_alloc ()
+visualize_alloc (void)
{
visual_tbl = xmalloc (get_visual_tbl_length ());
}
/* Free data used for visualization. */
void
-visualize_free ()
+visualize_free (void)
{
free (visual_tbl);
}
+#endif
OSDN Git Service
