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
36 pbqp_matrix_t *pbqp_matrix_alloc(pbqp_t *pbqp, unsigned rows, unsigned cols)
38 unsigned length = rows * cols;
39 pbqp_matrix_t *mat = (pbqp_matrix_t*)obstack_alloc(&pbqp->obstack, sizeof(*mat) + sizeof(*mat->entries) * length);
46 memset(mat->entries, 0, sizeof(*mat->entries) * length);
51 pbqp_matrix_t *pbqp_matrix_copy(pbqp_t *pbqp, pbqp_matrix_t *m)
53 unsigned len = m->rows * m->cols;
54 pbqp_matrix_t *copy = (pbqp_matrix_t*)obstack_copy(&pbqp->obstack, m, sizeof(*copy) + sizeof(*copy->entries) * len);
60 pbqp_matrix_t *pbqp_matrix_copy_and_transpose(pbqp_t *pbqp, pbqp_matrix_t *m)
64 unsigned cols = m->cols;
65 unsigned rows = m->rows;
66 unsigned len = rows * cols;
67 pbqp_matrix_t *copy = (pbqp_matrix_t*)obstack_alloc(&pbqp->obstack, sizeof(*copy) + sizeof(*copy->entries) * len);
69 for (i = 0; i < rows; ++i) {
70 for (j = 0; j < cols; ++j) {
71 copy->entries[j*rows+i] = m->entries[i*cols+j];
81 void pbqp_matrix_transpose(pbqp_t *pbqp, pbqp_matrix_t *mat)
86 len = mat->rows * mat->cols;
88 tmp = pbqp_matrix_copy_and_transpose(pbqp, mat);
90 memcpy(mat, tmp, sizeof(*mat) + sizeof(*mat->entries) * len);
92 obstack_free(&pbqp->obstack, tmp);
95 void pbqp_matrix_add(pbqp_matrix_t *sum, pbqp_matrix_t *summand)
100 assert(sum->cols == summand->cols);
101 assert(sum->rows == summand->rows);
103 len = sum->rows * sum->cols;
105 for (i = 0; i < len; ++i) {
106 sum->entries[i] = pbqp_add(sum->entries[i], summand->entries[i]);
110 void pbqp_matrix_set_col_value(pbqp_matrix_t *mat, unsigned col, num value)
115 assert(col < mat->cols);
119 for (row_index = 0; row_index < row_len; ++row_index) {
120 mat->entries[row_index * mat->cols + col] = value;
124 void pbqp_matrix_set_row_value(pbqp_matrix_t *mat, unsigned row, num value)
129 assert(row < mat->rows);
133 for (col_index = 0; col_index < col_len; ++col_index) {
134 mat->entries[row * mat->cols + col_index] = value;
138 void pbqp_matrix_set(pbqp_matrix_t *mat, unsigned row, unsigned col, num value)
140 assert(col < mat->cols);
141 assert(row < mat->rows);
143 mat->entries[row * mat->cols + col] = value;
146 num pbqp_matrix_get_col_min(pbqp_matrix_t *matrix, unsigned col_index, vector_t *flags)
151 unsigned col_len = matrix->cols;
152 unsigned row_len = matrix->rows;
154 assert(matrix->rows == flags->len);
156 for (row_index = 0; row_index < row_len; ++row_index) {
159 /* Ignore virtual deleted columns. */
160 if (flags->entries[row_index].data == INF_COSTS) continue;
162 elem = matrix->entries[row_index * col_len + col_index];
172 unsigned pbqp_matrix_get_col_min_index(pbqp_matrix_t *matrix, unsigned col_index, vector_t *flags)
175 unsigned min_index = 0;
178 unsigned col_len = matrix->cols;
179 unsigned row_len = matrix->rows;
181 assert(matrix->rows == flags->len);
183 for (row_index = 0; row_index < row_len; ++row_index) {
186 /* Ignore virtual deleted columns. */
187 if (flags->entries[row_index].data == INF_COSTS) continue;
189 elem = matrix->entries[row_index * col_len + col_index];
193 min_index = row_index;
200 void pbqp_matrix_sub_col_value(pbqp_matrix_t *matrix, unsigned col_index,
201 vector_t *flags, num value)
207 assert(matrix->rows == flags->len);
209 col_len = matrix->cols;
210 row_len = matrix->rows;
212 for (row_index = 0; row_index < row_len; ++row_index) {
213 if (flags->entries[row_index].data == INF_COSTS) {
214 matrix->entries[row_index * col_len + col_index] = 0;
217 /* inf - x = inf if x < inf */
218 if (matrix->entries[row_index * col_len + col_index] == INF_COSTS && value
221 matrix->entries[row_index * col_len + col_index] -= value;
225 num pbqp_matrix_get_row_min(pbqp_matrix_t *matrix, unsigned row_index, vector_t *flags)
230 unsigned len = flags->len;
232 assert(matrix->cols == len);
234 for (col_index = 0; col_index < len; ++col_index) {
237 /* Ignore virtual deleted columns. */
238 if (flags->entries[col_index].data == INF_COSTS) continue;
240 elem = matrix->entries[row_index * len + col_index];
250 unsigned pbqp_matrix_get_row_min_index(pbqp_matrix_t *matrix, unsigned row_index, vector_t *flags)
253 unsigned min_index = 0;
256 unsigned len = flags->len;
258 assert(matrix->cols == len);
260 for (col_index = 0; col_index < len; ++col_index) {
263 /* Ignore virtual deleted columns. */
264 if (flags->entries[col_index].data == INF_COSTS) continue;
266 elem = matrix->entries[row_index * len + col_index];
270 min_index = col_index;
277 void pbqp_matrix_sub_row_value(pbqp_matrix_t *matrix, unsigned row_index,
278 vector_t *flags, num value)
283 assert(matrix->cols == flags->len);
285 col_len = matrix->cols;
287 for (col_index = 0; col_index < col_len; ++col_index) {
288 if (flags->entries[col_index].data == INF_COSTS) {
289 matrix->entries[row_index * col_len + col_index] = 0;
292 /* inf - x = inf if x < inf */
293 if (matrix->entries[row_index * col_len + col_index] == INF_COSTS && value
296 matrix->entries[row_index * col_len + col_index] -= value;
300 int pbqp_matrix_is_zero(pbqp_matrix_t *mat, vector_t *src_vec, vector_t *tgt_vec)
307 assert(mat->cols = tgt_vec->len);
308 assert(mat->rows = src_vec->len);
313 for (row_index = 0; row_index < row_len; ++row_index) {
314 if (src_vec->entries[row_index].data == INF_COSTS) continue;
315 for (col_index = 0; col_index < col_len; ++col_index) {
316 if (tgt_vec->entries[col_index].data == INF_COSTS) continue;
318 if (mat->entries[row_index * col_len + col_index] != 0) {
327 void pbqp_matrix_add_to_all_cols(pbqp_matrix_t *mat, vector_t *vec)
334 assert(mat->rows == vec->len);
339 for (row_index = 0; row_index < row_len; ++row_index) {
340 num value = vec->entries[row_index].data;
341 for (col_index = 0; col_index < col_len; ++col_index) {
342 mat->entries[row_index * col_len + col_index] = pbqp_add(
343 mat->entries[row_index * col_len + col_index], value);
348 void pbqp_matrix_add_to_all_rows(pbqp_matrix_t *mat, vector_t *vec)
355 assert(mat->cols == vec->len);
360 for (row_index = 0; row_index < row_len; ++row_index) {
361 for (col_index = 0; col_index < col_len; ++col_index) {
362 num value = vec->entries[col_index].data;
364 mat->entries[row_index * col_len + col_index] = pbqp_add(mat->entries[row_index * col_len + col_index], value);