Searched refs:costs (Results 1 - 3 of 3) sorted by relevance

/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h47 Vector costs; member in class:PBQP::Graph::NodeEntry
50 NodeEntry() : costs(0, 0) {}
52 NodeEntry(const Vector &costs) : costs(costs), data(0) {} argument
53 Vector& getCosts() { return costs; }
54 const Vector& getCosts() const { return costs; }
71 Matrix costs; member in class:PBQP::Graph::EdgeEntry
74 EdgeEntry() : costs(0, 0, 0), data(0) {}
76 EdgeEntry(NodeId node1, NodeId node2, const Matrix &costs) argument
213 addNode(const Vector &costs) argument
221 addEdge(NodeId n1Id, NodeId n2Id, const Matrix &costs) argument
[all...]
/freebsd-9.3-release/contrib/gcc/
H A Dregclass.c803 /* 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 Dtree-ssa-loop-ivopts.c44 -- 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...]

Completed in 88 milliseconds