2 * This file is part of libFirm.
3 * Copyright (C) 2012 University of Karlsruhe.
10 * @author Sebastian Buchwald
16 #include "adt/array.h"
20 num pbqp_add(num x, num y)
24 if (x == INF_COSTS || y == INF_COSTS) return INF_COSTS;
28 #if !KAPS_USE_UNSIGNED
29 /* No positive overflow. */
30 assert(x < 0 || y < 0 || res >= x);
31 assert(x < 0 || y < 0 || res >= y);
34 /* No negative overflow. */
35 assert(x > 0 || y > 0 || res <= x);
36 assert(x > 0 || y > 0 || res <= y);
38 /* Result is not infinity.*/
39 assert(res < INF_COSTS);
44 vector_t *vector_alloc(pbqp_t *pbqp, unsigned length)
46 vector_t *vec = (vector_t*)obstack_alloc(&pbqp->obstack, sizeof(*vec) + sizeof(*vec->entries) * length);
50 memset(vec->entries, 0, sizeof(*vec->entries) * length);
55 vector_t *vector_copy(pbqp_t *pbqp, vector_t *v)
57 unsigned len = v->len;
58 vector_t *copy = (vector_t*)obstack_copy(&pbqp->obstack, v, sizeof(*copy) + sizeof(*copy->entries) * len);
64 void vector_add(vector_t *sum, vector_t *summand)
69 assert(sum->len == summand->len);
73 for (i = 0; i < len; ++i) {
74 sum->entries[i].data = pbqp_add(sum->entries[i].data,
75 summand->entries[i].data);
79 void vector_set(vector_t *vec, unsigned index, num value)
81 assert(index < vec->len);
82 vec->entries[index].data = value;
85 #if KAPS_ENABLE_VECTOR_NAMES
86 void vector_set_description(vector_t *vec, unsigned index, const char *name)
88 assert(index < vec->len);
89 vec->entries[index].name = name;
93 void vector_add_value(vector_t *vec, num value)
100 for (index = 0; index < len; ++index) {
101 vec->entries[index].data = pbqp_add(vec->entries[index].data, value);
105 void vector_add_matrix_col(vector_t *vec, pbqp_matrix_t *mat, unsigned col_index)
110 assert(vec->len == mat->rows);
111 assert(col_index < mat->cols);
115 for (index = 0; index < len; ++index) {
116 vec->entries[index].data = pbqp_add(vec->entries[index].data, mat->entries[index * mat->cols + col_index]);
120 void vector_add_matrix_row(vector_t *vec, pbqp_matrix_t *mat, unsigned row_index)
125 assert(vec->len == mat->cols);
126 assert(row_index < mat->rows);
130 for (index = 0; index < len; ++index) {
131 vec->entries[index].data = pbqp_add(vec->entries[index].data,
132 mat->entries[row_index * mat->cols + index]);
136 num vector_get_min(vector_t *vec)
145 for (index = 0; index < len; ++index) {
146 num elem = vec->entries[index].data;
156 unsigned vector_get_min_index(vector_t *vec)
160 unsigned min_index = 0;
166 for (index = 0; index < len; ++index) {
167 num elem = vec->entries[index].data;