Searched refs:costs (Results 1 - 7 of 7) sorted by relevance
| /openbsd-current/gnu/llvm/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.cpp | 184 // costs.
190 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1,
197 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity();
199 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0;
202 G.addEdge(node1, node2, std::move(costs));
212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge));
222 if (costs[i + 1][j + 1] !=
224 costs[i + 1][j + 1] > sameParityMax)
225 sameParityMax = costs[i + 1][j + 1];
233 if (sameParityMax > costs[
[all...] |
| /openbsd-current/gnu/usr.bin/gcc/gcc/ |
| H A D | regclass.c | 818 /* The `costs' struct records the cost of using a hard register of each class
822 struct costs
846 static struct costs *costs;
850 static struct costs init_cost;
866 static void record_operand_costs PARAMS ((rtx, struct costs *, struct reg_pref *));
870 struct costs *, struct reg_pref *));
922 /* Dump register costs. */
934 fprintf (dump, " Register %i costs:", i);
947 costs[
820 struct costs struct
844 static struct costs *costs; variable in typeref:struct:costs
[all...] |
| H A D | ra-rewrite.c | 272 /* The main phase to improve spill costs. This repeatedly runs
330 unsigned HOST_WIDE_INT *costs = (unsigned HOST_WIDE_INT *) local
331 xmalloc (FIRST_PSEUDO_REGISTER * sizeof (costs[0]));
338 memset (costs, 0, FIRST_PSEUDO_REGISTER * sizeof (costs[0]));
343 costs[pweb->color] += pweb->spill_cost;
353 costs[c] += 1000;
357 if ((bestc < 0 || costs[bestc] > costs[c])
373 free (costs);
[all...] |
| /openbsd-current/gnu/gcc/gcc/ |
| H A D | regclass.c | 803 /* The `costs' struct records the cost of using a hard register of each class
807 struct costs
832 static struct costs *costs;
836 static struct costs init_cost;
852 static void record_operand_costs (rtx, struct costs *, struct reg_pref *);
855 const char **, rtx, struct costs *,
930 /* Dump register costs. */
940 fprintf (dump, " Register %i costs:", i);
953 costs[
805 struct costs struct
830 static struct costs *costs; variable in typeref:struct:costs
[all...] |
| H A D | tree-ssa-loop-ivopts.c | 44 -- The use costs. Each of the interesting uses chooses the best induction
48 -- The variable costs. Each of the variables has a cost assigned that
49 reflects the costs associated with incrementing the value of the
54 All the costs are defined in a machine-specific way, using the target
62 to decide costs more precisely, but getting all the interactions right
157 /* The costs wrto the iv candidates. */
248 /* Candidate assigned to a use, together with the related costs. */
2297 /* Allocates the data structure mapping the (use, candidate) pairs to costs.
3224 static unsigned costs[NUM_MACHINE_MODES]; local
3228 if (costs[mod
3286 static htab_t costs; local
3375 static unsigned costs[2][2][2][2]; local
[all...] |
| /openbsd-current/usr.sbin/bgpd/ |
| H A D | rde.h | 245 uint32_t costs;
|
| /openbsd-current/gnu/usr.bin/perl/dist/SelfLoader/lib/ |
| H A D | SelfLoader.pm | 244 when it is called. The costs are the one-time parsing of the
|
Completed in 207 milliseconds