From 9a855d84862cd3f752498e1bc9f599efe65c7f24 Mon Sep 17 00:00:00 2001 From: "J\"orn Rennecke" Date: Tue, 25 Aug 1998 11:43:35 +0000 Subject: [PATCH] * sh.h (GIV_SORT_CRITERION): Delete. From-SVN: r21966 --- gcc/ChangeLog | 4 ++++ gcc/config/sh/sh.h | 8 -------- gcc/tm.texi | 9 --------- 3 files changed, 4 insertions(+), 17 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 0a129024f06..ae0884eae14 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,7 @@ +Tue Aug 25 19:20:12 1998 J"orn Rennecke + + * sh.h (GIV_SORT_CRITERION): Delete. + Tue Aug 25 13:19:46 1998 Dave Brolley * regclass.c (regclass): Use xmalloc/free instead of alloca. diff --git a/gcc/config/sh/sh.h b/gcc/config/sh/sh.h index a773ea2bd93..10936c78fee 100644 --- a/gcc/config/sh/sh.h +++ b/gcc/config/sh/sh.h @@ -1945,14 +1945,6 @@ do { \ cost = 2; \ } while (0) \ -/* Since the SH architecture lacks negative address offsets, - the givs should be sorted smallest to largest so combine_givs - has maximum opportunity to combine givs. */ -#define GIV_SORT_CRITERION(X, Y) \ - if (GET_CODE ((X)->add_val) == CONST_INT \ - && GET_CODE ((Y)->add_val) == CONST_INT) \ - return INTVAL ((X)->add_val) - INTVAL ((Y)->add_val); - /* For the sake of libgcc2.c, indicate target supports atexit. */ #define HAVE_ATEXIT diff --git a/gcc/tm.texi b/gcc/tm.texi index 1ec7537698e..bf9aa4a05cf 100644 --- a/gcc/tm.texi +++ b/gcc/tm.texi @@ -7454,15 +7454,6 @@ unit may not be bound to undefined symbols in another translation unit without user intervention. For instance, under Microsoft Windows symbols must be explicitly imported from shared libraries (DLLs). -@findex GIV_SORT_CRITERION -@item GIV_SORT_CRITERION (@var{giv1}, @var{giv2}) -In some cases, the strength reduction optimization pass can produce better -code if this is defined. This macro controls the order that induction -variables are combined. This macro is particularly useful if the target has -limited addressing modes. For instance, the SH target has only positive -offsets in addresses. Thus sorting to put the smallest address first -allows the most combinations to be found. - @findex ISSUE_RATE @item ISSUE_RATE A C expression that returns how many instructions can be issued at the