3 static pbqp_node *get_node(pbqp *pbqp, int index)
5 return pbqp->nodes[index];
8 pbqp *alloc_pbqp(int number_nodes)
10 pbqp* pbqp = xmalloc(sizeof(*pbqp));
12 obstack_init(&pbqp->obstack);
15 pbqp->num_nodes = number_nodes;
16 pbqp->nodes = obstack_alloc(&pbqp->obstack, number_nodes
17 * sizeof(*pbqp->nodes));
20 void free_pbqp(pbqp *pbqp)
22 obstack_free(&pbqp->obstack, NULL);
26 void add_node_costs(pbqp *pbqp, int node_index, vector *costs)
28 pbqp_node *node = get_node(pbqp, node_index);
31 node = alloc_node(pbqp, costs);
33 vector_add(node->costs, costs);