2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
24 * @author Sebastian Buchwald
35 pbqp_matrix_t *pbqp_matrix_alloc(pbqp_t *pbqp, unsigned rows, unsigned cols)
37 unsigned length = rows * cols;
38 pbqp_matrix_t *mat = (pbqp_matrix_t*)obstack_alloc(&pbqp->obstack, sizeof(*mat) + sizeof(*mat->entries) * length);
45 memset(mat->entries, 0, sizeof(*mat->entries) * length);
50 pbqp_matrix_t *pbqp_matrix_copy(pbqp_t *pbqp, pbqp_matrix_t *m)
52 unsigned len = m->rows * m->cols;
53 pbqp_matrix_t *copy = (pbqp_matrix_t*)obstack_copy(&pbqp->obstack, m, sizeof(*copy) + sizeof(*copy->entries) * len);
59 pbqp_matrix_t *pbqp_matrix_copy_and_transpose(pbqp_t *pbqp, pbqp_matrix_t *m)
63 unsigned cols = m->cols;
64 unsigned rows = m->rows;
65 unsigned len = rows * cols;
66 pbqp_matrix_t *copy = (pbqp_matrix_t*)obstack_alloc(&pbqp->obstack, sizeof(*copy) + sizeof(*copy->entries) * len);
68 for (i = 0; i < rows; ++i) {
69 for (j = 0; j < cols; ++j) {
70 copy->entries[j*rows+i] = m->entries[i*cols+j];
80 void pbqp_matrix_transpose(pbqp_t *pbqp, pbqp_matrix_t *mat)
85 len = mat->rows * mat->cols;
87 tmp = pbqp_matrix_copy_and_transpose(pbqp, mat);
89 memcpy(mat, tmp, sizeof(*mat) + sizeof(*mat->entries) * len);
91 obstack_free(&pbqp->obstack, tmp);
94 void pbqp_matrix_add(pbqp_matrix_t *sum, pbqp_matrix_t *summand)
99 assert(sum->cols == summand->cols);
100 assert(sum->rows == summand->rows);
102 len = sum->rows * sum->cols;
104 for (i = 0; i < len; ++i) {
105 sum->entries[i] = pbqp_add(sum->entries[i], summand->entries[i]);
109 void pbqp_matrix_set_col_value(pbqp_matrix_t *mat, unsigned col, num value)
114 assert(col < mat->cols);
118 for (row_index = 0; row_index < row_len; ++row_index) {
119 mat->entries[row_index * mat->cols + col] = value;
123 void pbqp_matrix_set_row_value(pbqp_matrix_t *mat, unsigned row, num value)
128 assert(row < mat->rows);
132 for (col_index = 0; col_index < col_len; ++col_index) {
133 mat->entries[row * mat->cols + col_index] = value;
137 void pbqp_matrix_set(pbqp_matrix_t *mat, unsigned row, unsigned col, num value)
139 assert(col < mat->cols);
140 assert(row < mat->rows);
142 mat->entries[row * mat->cols + col] = value;
145 num pbqp_matrix_get_col_min(pbqp_matrix_t *matrix, unsigned col_index, vector_t *flags)
150 unsigned col_len = matrix->cols;
151 unsigned row_len = matrix->rows;
153 assert(matrix->rows == flags->len);
155 for (row_index = 0; row_index < row_len; ++row_index) {
158 /* Ignore virtual deleted columns. */
159 if (flags->entries[row_index].data == INF_COSTS) continue;
161 elem = matrix->entries[row_index * col_len + col_index];
171 unsigned pbqp_matrix_get_col_min_index(pbqp_matrix_t *matrix, unsigned col_index, vector_t *flags)
174 unsigned min_index = 0;
177 unsigned col_len = matrix->cols;
178 unsigned row_len = matrix->rows;
180 assert(matrix->rows == flags->len);
182 for (row_index = 0; row_index < row_len; ++row_index) {
185 /* Ignore virtual deleted columns. */
186 if (flags->entries[row_index].data == INF_COSTS) continue;
188 elem = matrix->entries[row_index * col_len + col_index];
192 min_index = row_index;
199 void pbqp_matrix_sub_col_value(pbqp_matrix_t *matrix, unsigned col_index,
200 vector_t *flags, num value)
206 assert(matrix->rows == flags->len);
208 col_len = matrix->cols;
209 row_len = matrix->rows;
211 for (row_index = 0; row_index < row_len; ++row_index) {
212 if (flags->entries[row_index].data == INF_COSTS) {
213 matrix->entries[row_index * col_len + col_index] = 0;
216 /* inf - x = inf if x < inf */
217 if (matrix->entries[row_index * col_len + col_index] == INF_COSTS && value
220 matrix->entries[row_index * col_len + col_index] -= value;
224 num pbqp_matrix_get_row_min(pbqp_matrix_t *matrix, unsigned row_index, vector_t *flags)
229 unsigned len = flags->len;
231 assert(matrix->cols == len);
233 for (col_index = 0; col_index < len; ++col_index) {
236 /* Ignore virtual deleted columns. */
237 if (flags->entries[col_index].data == INF_COSTS) continue;
239 elem = matrix->entries[row_index * len + col_index];
249 unsigned pbqp_matrix_get_row_min_index(pbqp_matrix_t *matrix, unsigned row_index, vector_t *flags)
252 unsigned min_index = 0;
255 unsigned len = flags->len;
257 assert(matrix->cols == len);
259 for (col_index = 0; col_index < len; ++col_index) {
262 /* Ignore virtual deleted columns. */
263 if (flags->entries[col_index].data == INF_COSTS) continue;
265 elem = matrix->entries[row_index * len + col_index];
269 min_index = col_index;
276 void pbqp_matrix_sub_row_value(pbqp_matrix_t *matrix, unsigned row_index,
277 vector_t *flags, num value)
282 assert(matrix->cols == flags->len);
284 col_len = matrix->cols;
286 for (col_index = 0; col_index < col_len; ++col_index) {
287 if (flags->entries[col_index].data == INF_COSTS) {
288 matrix->entries[row_index * col_len + col_index] = 0;
291 /* inf - x = inf if x < inf */
292 if (matrix->entries[row_index * col_len + col_index] == INF_COSTS && value
295 matrix->entries[row_index * col_len + col_index] -= value;
299 int pbqp_matrix_is_zero(pbqp_matrix_t *mat, vector_t *src_vec, vector_t *tgt_vec)
306 assert(mat->cols = tgt_vec->len);
307 assert(mat->rows = src_vec->len);
312 for (row_index = 0; row_index < row_len; ++row_index) {
313 if (src_vec->entries[row_index].data == INF_COSTS) continue;
314 for (col_index = 0; col_index < col_len; ++col_index) {
315 if (tgt_vec->entries[col_index].data == INF_COSTS) continue;
317 if (mat->entries[row_index * col_len + col_index] != 0) {
326 void pbqp_matrix_add_to_all_cols(pbqp_matrix_t *mat, vector_t *vec)
333 assert(mat->rows == vec->len);
338 for (row_index = 0; row_index < row_len; ++row_index) {
339 num value = vec->entries[row_index].data;
340 for (col_index = 0; col_index < col_len; ++col_index) {
341 mat->entries[row_index * col_len + col_index] = pbqp_add(
342 mat->entries[row_index * col_len + col_index], value);
347 void pbqp_matrix_add_to_all_rows(pbqp_matrix_t *mat, vector_t *vec)
354 assert(mat->cols == vec->len);
359 for (row_index = 0; row_index < row_len; ++row_index) {
360 for (col_index = 0; col_index < col_len; ++col_index) {
361 num value = vec->entries[col_index].data;
363 mat->entries[row_index * col_len + col_index] = pbqp_add(mat->entries[row_index * col_len + col_index], value);