HomeSort by: relevance | last modified time | path
    Searched defs:add_cost (Results 1 - 5 of 5) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
expmed.h 343 /* Subroutine of {set_,}add_cost. Not to be used otherwise. */
362 add_cost (bool speed, machine_mode mode) function
ira-costs.cc 1292 int k, regno, add_cost;
1304 add_cost = (ira_memory_move_cost[Pmode][rclass][1] * scale) / 2;
1305 if (INT_MAX - add_cost < pp->mem_cost)
1308 pp->mem_cost += add_cost;
1317 add_cost = (move_in_cost[i][rclass] * scale) / 2;
1318 if (INT_MAX - add_cost < pp_costs[k])
1321 pp_costs[k] += add_cost;
1631 int add_cost = 0;
1637 add_cost = q->mem_cost;
1638 if (add_cost > 0 && INT_MAX - add_cost < p->mem_cost
1288 int k, regno, add_cost; local
1625 int add_cost = 0; local
2049 int rclass, a_num, parent_a_num, add_cost; local
    [all...]
tree-vect-slp.cc 4977 auto add_cost = [&](graph_edge *, unsigned int other_node_i) local
4991 for_each_partition_edge (node_i, add_cost);
5199 auto add_cost = [&](graph_edge *ud, unsigned int other_node_i) local
5229 for_each_partition_edge (node_i, add_cost);
5324 auto add_cost = [&](graph_edge *ud, unsigned int other_node_i) local
5348 for_each_partition_edge (node_i, add_cost);
  /src/external/gpl3/gcc.old/dist/gcc/
expmed.h 344 /* Subroutine of {set_,}add_cost. Not to be used otherwise. */
363 add_cost (bool speed, machine_mode mode) function
ira-costs.cc 1291 int k, regno, add_cost;
1303 add_cost = (ira_memory_move_cost[Pmode][rclass][1] * scale) / 2;
1304 if (INT_MAX - add_cost < pp->mem_cost)
1307 pp->mem_cost += add_cost;
1316 add_cost = (move_in_cost[i][rclass] * scale) / 2;
1317 if (INT_MAX - add_cost < pp_costs[k])
1320 pp_costs[k] += add_cost;
1623 int add_cost = 0;
1629 add_cost = q->mem_cost;
1630 if (add_cost > 0 && INT_MAX - add_cost < p->mem_cost
1287 int k, regno, add_cost; local
1617 int add_cost = 0; local
1856 int rclass, a_num, parent_a_num, add_cost; local
    [all...]

Completed in 38 milliseconds