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

haifa-sched.c (rank_for_schedule): Revert 2002-05-02 change, no longer needed. 

2002-05-03  David S. Miller  <davem@redhat.com>

	* haifa-sched.c (rank_for_schedule): Revert 2002-05-02 change,
	no longer needed.

From-SVN: r53136
This commit is contained in:
David S. Miller 2002-05-03 17:38:36 -07:00 committed by David S. Miller
parent b44140e711
commit 8f39865a3c
2 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -1,3 +1,8 @@
2002-05-03 David S. Miller <davem@redhat.com>
* haifa-sched.c (rank_for_schedule): Revert 2002-05-02 change,
no longer needed.
2002-05-03 Aldy Hernandez <aldyh@redhat.com> 2002-05-03 Aldy Hernandez <aldyh@redhat.com>
* config/rs6000/rs6000.c (altivec_expand_binop_builtin): Error out * config/rs6000/rs6000.c (altivec_expand_binop_builtin): Error out

17
gcc/haifa-sched.c
View File

@ -852,7 +852,7 @@ rank_for_schedule (x, y)
{ {
rtx tmp = *(const rtx *) y; rtx tmp = *(const rtx *) y;
rtx tmp2 = *(const rtx *) x; rtx tmp2 = *(const rtx *) x;
rtx link, lsi; rtx link;
int tmp_class, tmp2_class, depend_count1, depend_count2; int tmp_class, tmp2_class, depend_count1, depend_count2;
int val, priority_val, weight_val, info_val; int val, priority_val, weight_val, info_val;
@ -871,28 +871,23 @@ rank_for_schedule (x, y)
return info_val; return info_val;
/* Compare insns based on their relation to the last-scheduled-insn. */ /* Compare insns based on their relation to the last-scheduled-insn. */
for (lsi = last_scheduled_insn; if (last_scheduled_insn)
lsi && INSN_UID (lsi) >= old_max_uid;
lsi = PREV_INSN (lsi))
continue;
if (lsi)
{ {
/* Classify the instructions into three classes: /* Classify the instructions into three classes:
1) Data dependent on last schedule insn. 1) Data dependent on last schedule insn.
2) Anti/Output dependent on last scheduled insn. 2) Anti/Output dependent on last scheduled insn.
3) Independent of last scheduled insn, or has latency of one. 3) Independent of last scheduled insn, or has latency of one.
Choose the insn from the highest numbered class if different. */ Choose the insn from the highest numbered class if different. */
link = find_insn_list (tmp, INSN_DEPEND (lsi)); link = find_insn_list (tmp, INSN_DEPEND (last_scheduled_insn));
if (link == 0 || insn_cost (lsi, link, tmp) == 1) if (link == 0 || insn_cost (last_scheduled_insn, link, tmp) == 1)
tmp_class = 3; tmp_class = 3;
else if (REG_NOTE_KIND (link) == 0) /* Data dependence. */ else if (REG_NOTE_KIND (link) == 0) /* Data dependence. */
tmp_class = 1; tmp_class = 1;
else else
tmp_class = 2; tmp_class = 2;
link = find_insn_list (tmp2, INSN_DEPEND (lsi)); link = find_insn_list (tmp2, INSN_DEPEND (last_scheduled_insn));
if (link == 0 || insn_cost (lsi, link, tmp2) == 1) if (link == 0 || insn_cost (last_scheduled_insn, link, tmp2) == 1)
tmp2_class = 3; tmp2_class = 3;
else if (REG_NOTE_KIND (link) == 0) /* Data dependence. */ else if (REG_NOTE_KIND (link) == 0) /* Data dependence. */
tmp2_class = 1; tmp2_class = 1;