git
/
gcc
mirror of git://gcc.gnu.org/git/gcc.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

[expmed][cleanup] Use std::swap instead of manual swapping 

* expmed.c (synth_mult): Use std::swap instead of manually
	swapping algorithms.

From-SVN: r221486
This commit is contained in:
Kyrylo Tkachov 2015-03-18 12:01:24 +00:00 committed by Kyrylo Tkachov
parent fbf524de7b
commit 076701b69d
2 changed files with 14 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -1,3 +1,8 @@
2015-03-18 Kyrylo Tkachov <kyrylo.tkachov@arm.com>
* expmed.c (synth_mult): Use std::swap instead of manually
swapping algorithms.
2015-03-18 Jakub Jelinek <jakub@redhat.com> 2015-03-18 Jakub Jelinek <jakub@redhat.com>
PR target/65078 PR target/65078

27
gcc/expmed.c
View File

@ -2551,9 +2551,8 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
alg_in->cost.latency += op_cost; alg_in->cost.latency += op_cost;
if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
{ {
struct algorithm *x;
best_cost = alg_in->cost; best_cost = alg_in->cost;
x = alg_in, alg_in = best_alg, best_alg = x; std::swap (alg_in, best_alg);
best_alg->log[best_alg->ops] = m; best_alg->log[best_alg->ops] = m;
best_alg->op[best_alg->ops] = alg_shift; best_alg->op[best_alg->ops] = alg_shift;
} }
@ -2582,9 +2581,8 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
alg_in->cost.latency += op_cost; alg_in->cost.latency += op_cost;
if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
{ {
struct algorithm *x;
best_cost = alg_in->cost; best_cost = alg_in->cost;
x = alg_in, alg_in = best_alg, best_alg = x; std::swap (alg_in, best_alg);
best_alg->log[best_alg->ops] = m; best_alg->log[best_alg->ops] = m;
best_alg->op[best_alg->ops] = alg_shift; best_alg->op[best_alg->ops] = alg_shift;
} }
@ -2624,9 +2622,8 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
alg_in->cost.latency += op_cost; alg_in->cost.latency += op_cost;
if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
{ {
struct algorithm *x;
best_cost = alg_in->cost; best_cost = alg_in->cost;
x = alg_in, alg_in = best_alg, best_alg = x; std::swap (alg_in, best_alg);
best_alg->log[best_alg->ops] = 0; best_alg->log[best_alg->ops] = 0;
best_alg->op[best_alg->ops] = alg_sub_t_m2; best_alg->op[best_alg->ops] = alg_sub_t_m2;
} }
@ -2644,9 +2641,8 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
alg_in->cost.latency += op_cost; alg_in->cost.latency += op_cost;
if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
{ {
struct algorithm *x;
best_cost = alg_in->cost; best_cost = alg_in->cost;
x = alg_in, alg_in = best_alg, best_alg = x; std::swap (alg_in, best_alg);
best_alg->log[best_alg->ops] = 0; best_alg->log[best_alg->ops] = 0;
best_alg->op[best_alg->ops] = alg_add_t_m2; best_alg->op[best_alg->ops] = alg_add_t_m2;
} }
@ -2667,9 +2663,8 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
alg_in->cost.latency += op_cost; alg_in->cost.latency += op_cost;
if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
{ {
struct algorithm *x;
best_cost = alg_in->cost; best_cost = alg_in->cost;
x = alg_in, alg_in = best_alg, best_alg = x; std::swap (alg_in, best_alg);
best_alg->log[best_alg->ops] = m; best_alg->log[best_alg->ops] = m;
best_alg->op[best_alg->ops] = alg_sub_t_m2; best_alg->op[best_alg->ops] = alg_sub_t_m2;
} }
@ -2723,9 +2718,8 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
alg_in->cost.latency = op_cost; alg_in->cost.latency = op_cost;
if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
{ {
struct algorithm *x;
best_cost = alg_in->cost; best_cost = alg_in->cost;
x = alg_in, alg_in = best_alg, best_alg = x; std::swap (alg_in, best_alg);
best_alg->log[best_alg->ops] = m; best_alg->log[best_alg->ops] = m;
best_alg->op[best_alg->ops] = alg_add_factor; best_alg->op[best_alg->ops] = alg_add_factor;
} }
@ -2762,9 +2756,8 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
alg_in->cost.latency = op_cost; alg_in->cost.latency = op_cost;
if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
{ {
struct algorithm *x;
best_cost = alg_in->cost; best_cost = alg_in->cost;
x = alg_in, alg_in = best_alg, best_alg = x; std::swap (alg_in, best_alg);
best_alg->log[best_alg->ops] = m; best_alg->log[best_alg->ops] = m;
best_alg->op[best_alg->ops] = alg_sub_factor; best_alg->op[best_alg->ops] = alg_sub_factor;
} }
@ -2793,9 +2786,8 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
alg_in->cost.latency += op_cost; alg_in->cost.latency += op_cost;
if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
{ {
struct algorithm *x;
best_cost = alg_in->cost; best_cost = alg_in->cost;
x = alg_in, alg_in = best_alg, best_alg = x; std::swap (alg_in, best_alg);
best_alg->log[best_alg->ops] = m; best_alg->log[best_alg->ops] = m;
best_alg->op[best_alg->ops] = alg_add_t2_m; best_alg->op[best_alg->ops] = alg_add_t2_m;
} }
@ -2818,9 +2810,8 @@ synth_mult (struct algorithm *alg_out, unsigned HOST_WIDE_INT t,
alg_in->cost.latency += op_cost; alg_in->cost.latency += op_cost;
if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost)) if (CHEAPER_MULT_COST (&alg_in->cost, &best_cost))
{ {
struct algorithm *x;
best_cost = alg_in->cost; best_cost = alg_in->cost;
x = alg_in, alg_in = best_alg, best_alg = x; std::swap (alg_in, best_alg);
best_alg->log[best_alg->ops] = m; best_alg->log[best_alg->ops] = m;
best_alg->op[best_alg->ops] = alg_sub_t2_m; best_alg->op[best_alg->ops] = alg_sub_t2_m;
} }