OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

pdp11.h: Use optimize_size for space optimizations.

Browse Source 
* pdp11.h: Use optimize_size for space optimizations.
	* pdp11.c: Likewise.
	* pdp11.md: Likewise.

From-SVN: r24082
This commit is contained in:
Joseph Myers 1998-12-03 17:40:21 -07:00 committed by Jeff Law
parent d1a0959019
commit f4190acc20
4 changed files with 14 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
gcc/ChangeLog
View File

@ -14,6 +14,10 @@ Thu Dec 3 11:19:50 1998 Mike Stump <mrs@wrs.com>
1998-12-03 Joseph S. Myers <jsm28@cam.ac.uk> 1998-12-03 Joseph S. Myers <jsm28@cam.ac.uk>
* pdp11.h: Use optimize_size for space optimizations.
* pdp11.c: Likewise.
* pdp11.md: Likewise.
* pdp11.h (TARGET_40_PLUS): Fix typo. * pdp11.h (TARGET_40_PLUS): Fix typo.
Thu Dec 3 11:48:32 1998 Jeffrey A Law (law@cygnus.com) Thu Dec 3 11:48:32 1998 Jeffrey A Law (law@cygnus.com)

6
gcc/config/pdp11/pdp11.c
View File

@ -1115,7 +1115,7 @@ output_block_move(operands)
char buf[200]; char buf[200];
if (GET_CODE(operands[2]) == CONST_INT if (GET_CODE(operands[2]) == CONST_INT
&& TARGET_TIME) && ! optimize_size)
{ {
if (INTVAL(operands[2]) < 16 if (INTVAL(operands[2]) < 16
&& INTVAL(operands[3]) == 1) && INTVAL(operands[3]) == 1)
@ -1257,7 +1257,7 @@ output_block_move(operands)
bgt x bgt x
*/ */
if (TARGET_SPACE) if (optimize_size)
goto generate_compact_code; goto generate_compact_code;
output_asm_insn("asr %4", operands); output_asm_insn("asr %4", operands);
@ -1308,7 +1308,7 @@ output_block_move(operands)
*/ */
if (TARGET_SPACE) if (optimize_size)
goto generate_compact_code; goto generate_compact_code;
output_asm_insn("asr %4", operands); output_asm_insn("asr %4", operands);

18
gcc/config/pdp11/pdp11.h
View File

@ -89,9 +89,6 @@ extern int target_flags;
/* this is just to play around and check what code gcc generates */ \ /* this is just to play around and check what code gcc generates */ \
{ "branch-expensive", 256}, \ { "branch-expensive", 256}, \
{ "branch-cheap", -256}, \ { "branch-cheap", -256}, \
/* optimize for space instead of time - just in a couple of places */ \
{ "space", 512 }, \
{ "time", -512 }, \
/* split instruction and data memory? */ \ /* split instruction and data memory? */ \
{ "split", 1024 }, \ { "split", 1024 }, \
{ "no-split", -1024 }, \ { "no-split", -1024 }, \
@ -124,9 +121,6 @@ extern int target_flags;
#define TARGET_BRANCH_EXPENSIVE (target_flags & 256) #define TARGET_BRANCH_EXPENSIVE (target_flags & 256)
#define TARGET_BRANCH_CHEAP (!TARGET_BRANCH_EXPENSIVE) #define TARGET_BRANCH_CHEAP (!TARGET_BRANCH_EXPENSIVE)
#define TARGET_SPACE (target_flags & 512)
#define TARGET_TIME (! TARGET_SPACE)
#define TARGET_SPLIT (target_flags & 1024) #define TARGET_SPLIT (target_flags & 1024)
#define TARGET_NOSPLIT (! TARGET_SPLIT) #define TARGET_NOSPLIT (! TARGET_SPLIT)
@ -1315,31 +1309,31 @@ JMP FUNCTION 0x0058 0x0000 <- FUNCTION
there is something wrong in MULT because MULT is not there is something wrong in MULT because MULT is not
as cheap as total = 2 even if we can shift! as cheap as total = 2 even if we can shift!
if TARGET_SPACE make mult etc cheap, but not 1, so when if optimizing for size make mult etc cheap, but not 1, so when
in doubt the faster insn is chosen. in doubt the faster insn is chosen.
*/ */
#define RTX_COSTS(X,CODE,OUTER_CODE) \ #define RTX_COSTS(X,CODE,OUTER_CODE) \
case MULT: \ case MULT: \
if (TARGET_SPACE) \ if (optimize_size) \
total = COSTS_N_INSNS(2); \ total = COSTS_N_INSNS(2); \
else \ else \
total = COSTS_N_INSNS (11); \ total = COSTS_N_INSNS (11); \
break; \ break; \
case DIV: \ case DIV: \
if (TARGET_SPACE) \ if (optimize_size) \
total = COSTS_N_INSNS(2); \ total = COSTS_N_INSNS(2); \
else \ else \
total = COSTS_N_INSNS (25); \ total = COSTS_N_INSNS (25); \
break; \ break; \
case MOD: \ case MOD: \
if (TARGET_SPACE) \ if (optimize_size) \
total = COSTS_N_INSNS(2); \ total = COSTS_N_INSNS(2); \
else \ else \
total = COSTS_N_INSNS (26); \ total = COSTS_N_INSNS (26); \
break; \ break; \
case ABS: \ case ABS: \
/* equivalent to length, so same for TARGET_SPACE */ \ /* equivalent to length, so same for optimize_size */ \
total = COSTS_N_INSNS (3); \ total = COSTS_N_INSNS (3); \
break; \ break; \
case ZERO_EXTEND: \ case ZERO_EXTEND: \
@ -1358,7 +1352,7 @@ JMP FUNCTION 0x0058 0x0000 <- FUNCTION
case ASHIFT: \ case ASHIFT: \
case LSHIFTRT: \ case LSHIFTRT: \
case ASHIFTRT: \ case ASHIFTRT: \
if (TARGET_SPACE) \ if (optimize_size) \
total = COSTS_N_INSNS(1); \ total = COSTS_N_INSNS(1); \
else if (GET_MODE(X) == QImode) \ else if (GET_MODE(X) == QImode) \
{ \ { \

2
gcc/config/pdp11/pdp11.md
View File

@ -1432,7 +1432,7 @@
[(set (match_operand:HI 0 "general_operand" "=r") [(set (match_operand:HI 0 "general_operand" "=r")
(ashift:HI (match_operand:HI 1 "general_operand" "0") (ashift:HI (match_operand:HI 1 "general_operand" "0")
(match_operand:HI 2 "expand_shift_operand" "O")))] (match_operand:HI 2 "expand_shift_operand" "O")))]
"TARGET_TIME" "! optimize_size"
"* "*
{ {
register int i; register int i;