Commit d969caf8 by Richard Kenner

Define SHIFT_COUNT_TRUNCATED to have a value of 1.

From-SVN: r5732
parent 85c0a556
...@@ -1276,9 +1276,9 @@ extern char *a29k_function_name; ...@@ -1276,9 +1276,9 @@ extern char *a29k_function_name;
but a CALL with constant address is cheap. */ but a CALL with constant address is cheap. */
#define NO_FUNCTION_CSE #define NO_FUNCTION_CSE
/* Define this if shift instructions ignore all but the low-order /* Define this to be nonzero if shift instructions ignore all but the low-order
few bits. */ few bits. */
#define SHIFT_COUNT_TRUNCATED #define SHIFT_COUNT_TRUNCATED 1
/* Compute the cost of computing a constant rtl expression RTX /* Compute the cost of computing a constant rtl expression RTX
whose rtx-code is CODE. The body of this macro is a portion whose rtx-code is CODE. The body of this macro is a portion
......
...@@ -1279,9 +1279,9 @@ extern char *current_function_name; ...@@ -1279,9 +1279,9 @@ extern char *current_function_name;
#define NO_FUNCTION_CSE #define NO_FUNCTION_CSE
/* Define this if shift instructions ignore all but the low-order /* Define this to be nonzero if shift instructions ignore all but the low-order
few bits. */ few bits. */
#define SHIFT_COUNT_TRUNCATED #define SHIFT_COUNT_TRUNCATED 1
/* Compute the cost of computing a constant rtl expression RTX /* Compute the cost of computing a constant rtl expression RTX
whose rtx-code is CODE. The body of this macro is a portion whose rtx-code is CODE. The body of this macro is a portion
......
...@@ -841,10 +841,9 @@ extern enum reg_class regno_reg_class[]; ...@@ -841,10 +841,9 @@ extern enum reg_class regno_reg_class[];
/* Nonzero if access to memory by bytes is slow and undesirable. */ /* Nonzero if access to memory by bytes is slow and undesirable. */
#define SLOW_BYTE_ACCESS 0 #define SLOW_BYTE_ACCESS 0
/* Define if shifts truncate the shift count /* Define this to be nonzero if shift instructions ignore all but the low-order
which implies one can omit a sign-extension or zero-extension few bits. */
of a shift count. */ #define SHIFT_COUNT_TRUNCATED 1
#define SHIFT_COUNT_TRUNCATED
/* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
is done just by pretending it is already truncated. */ is done just by pretending it is already truncated. */
......
...@@ -1075,10 +1075,9 @@ extern struct rtx_def *legitimize_address (); ...@@ -1075,10 +1075,9 @@ extern struct rtx_def *legitimize_address ();
#define STORE_FLAG_VALUE 1 #define STORE_FLAG_VALUE 1
/* Define if shifts truncate the shift count /* Define this to be nonzero if shift instructions ignore all but the low-order
which implies one can omit a sign-extension or zero-extension few bits. */
of a shift count. */ #define SHIFT_COUNT_TRUNCATED 1
#define SHIFT_COUNT_TRUNCATED
/* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
is done just by pretending it is already truncated. */ is done just by pretending it is already truncated. */
......
...@@ -2389,13 +2389,9 @@ while (0) ...@@ -2389,13 +2389,9 @@ while (0)
/* Define this if zero-extension is slow (more than one real instruction). */ /* Define this if zero-extension is slow (more than one real instruction). */
#define SLOW_ZERO_EXTEND #define SLOW_ZERO_EXTEND
/* Define if shifts truncate the shift count /* Define this to be nonzero if shift instructions ignore all but the low-order
which implies one can omit a sign-extension or zero-extension few bits. */
of a shift count. #define SHIFT_COUNT_TRUNCATED 1
Only 5 bits are used in SLLV and SRLV */
#define SHIFT_COUNT_TRUNCATED
/* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
is done just by pretending it is already truncated. */ is done just by pretending it is already truncated. */
......
...@@ -1427,9 +1427,9 @@ while (0) ...@@ -1427,9 +1427,9 @@ while (0)
but a CALL with constant address is cheap. */ but a CALL with constant address is cheap. */
#define NO_FUNCTION_CSE #define NO_FUNCTION_CSE
/* Define this if shift instructions ignore all but the low-order /* Define this to be nonzero if shift instructions ignore all but the low-order
few bits. */ few bits. */
#define SHIFT_COUNT_TRUNCATED #define SHIFT_COUNT_TRUNCATED 1
/* Use atexit for static constructors/destructors, instead of defining /* Use atexit for static constructors/destructors, instead of defining
our own exit function. */ our own exit function. */
......
...@@ -1029,10 +1029,9 @@ extern int current_function_calls_alloca; ...@@ -1029,10 +1029,9 @@ extern int current_function_calls_alloca;
/* 1 if byte access requires more than one instruction */ /* 1 if byte access requires more than one instruction */
#define SLOW_BYTE_ACCESS 0 #define SLOW_BYTE_ACCESS 0
/* Define if shifts truncate the shift count /* Define this to be nonzero if shift instructions ignore all but the low-order
which implies one can omit a sign-extension or zero-extension few bits. */
of a shift count. */ #define SHIFT_COUNT_TRUNCATED 1
#define SHIFT_COUNT_TRUNCATED
/* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
is done just by pretending it is already truncated. */ is done just by pretending it is already truncated. */
......
...@@ -1341,9 +1341,9 @@ struct rs6000_args {int words, fregno, nargs_prototype; }; ...@@ -1341,9 +1341,9 @@ struct rs6000_args {int words, fregno, nargs_prototype; };
but a CALL with constant address is cheap. */ but a CALL with constant address is cheap. */
#define NO_FUNCTION_CSE #define NO_FUNCTION_CSE
/* Define this if shift instructions ignore all but the low-order /* Define this to be nonzero if shift instructions ignore all but the low-order
few bits. */ few bits. */
#define SHIFT_COUNT_TRUNCATED #define SHIFT_COUNT_TRUNCATED 1
/* Use atexit for static constructors/destructors, instead of defining /* Use atexit for static constructors/destructors, instead of defining
our own exit function. */ our own exit function. */
......
...@@ -1383,10 +1383,9 @@ extern struct rtx_def *legitimize_pic_address (); ...@@ -1383,10 +1383,9 @@ extern struct rtx_def *legitimize_pic_address ();
/* When a prototype says `char' or `short', really pass an `int'. */ /* When a prototype says `char' or `short', really pass an `int'. */
#define PROMOTE_PROTOTYPES #define PROMOTE_PROTOTYPES
/* Define if shifts truncate the shift count /* Define this to be nonzero if shift instructions ignore all but the low-order
which implies one can omit a sign-extension or zero-extension few bits. */
of a shift count. */ #define SHIFT_COUNT_TRUNCATED 1
#define SHIFT_COUNT_TRUNCATED
/* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
is done just by pretending it is already truncated. */ is done just by pretending it is already truncated. */
......
...@@ -621,7 +621,7 @@ enum reg_class {NO_REGS,GENERAL_REGS,FPP_REG,ALL_REGS,LIM_REG_CLASSES}; ...@@ -621,7 +621,7 @@ enum reg_class {NO_REGS,GENERAL_REGS,FPP_REG,ALL_REGS,LIM_REG_CLASSES};
/* any bits higher than the low 4 are ignored in the shift count */ /* any bits higher than the low 4 are ignored in the shift count */
/* so don't bother zero extending or sign extending them */ /* so don't bother zero extending or sign extending them */
#define SHIFT_COUNT_TRUNCATED #define SHIFT_COUNT_TRUNCATED 1
/* we don't need to officially convert from one fixed type to another */ /* we don't need to officially convert from one fixed type to another */
/* in order to use it as that type. We can just assume it's the same */ /* in order to use it as that type. We can just assume it's the same */
......
...@@ -647,10 +647,9 @@ enum reg_class { NO_REGS, GENERAL_REGS, ...@@ -647,10 +647,9 @@ enum reg_class { NO_REGS, GENERAL_REGS,
/* Nonzero if access to memory by bytes is slow and undesirable. */ /* Nonzero if access to memory by bytes is slow and undesirable. */
#define SLOW_BYTE_ACCESS 0 #define SLOW_BYTE_ACCESS 0
/* Define if shifts truncate the shift count /* Define this to be nonzero if shift instructions ignore all but the low-order
which implies one can omit a sign-extension or zero-extension few bits. */
of a shift count. */ #define SHIFT_COUNT_TRUNCATED 1
#define SHIFT_COUNT_TRUNCATED
/* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
is done just by pretending it is already truncated. */ is done just by pretending it is already truncated. */
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment