3 /* xbt_matrix_t management functions */
5 /* Copyright (c) 2006 Martin Quinson. All rights reserved. */
7 /* This program is free software; you can redistribute it and/or modify it
8 * under the terms of the license (GNU LGPL) which comes with this package. */
11 #include "xbt/sysdep.h"
13 #include "xbt/matrix.h"
15 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_matrix, xbt, "2D data storage");
17 /** \brief constructor */
18 xbt_matrix_t xbt_matrix_new(int lines, int rows,
19 const unsigned long elmsize,
20 void_f_pvoid_t const free_f)
22 xbt_matrix_t res = xbt_new(s_xbt_matrix_t, 1);
25 res->elmsize = elmsize;
27 res->data = xbt_malloc(elmsize * lines * rows);
31 /** \brief Creates a matrix being a submatrix of another one */
32 xbt_matrix_t xbt_matrix_new_sub(xbt_matrix_t from,
35 pvoid_f_pvoid_t const cpy_f)
38 xbt_matrix_t res = xbt_matrix_new(lsize, rsize,
39 from->elmsize, from->free_f);
40 xbt_matrix_copy_values(res, from, lsize, rsize, 0, 0, lpos, rpos, cpy_f);
44 /** \brief destructor */
45 void xbt_matrix_free(xbt_matrix_t mat)
50 for (i = 0; i < (mat->lines * mat->rows); i++) {
51 (*(mat->free_f)) ((void *) &(mat->data[i * mat->elmsize]));
59 /** \brief Freeing function for containers of xbt_matrix_t */
60 void xbt_matrix_free_voidp(void *d)
62 xbt_matrix_free((xbt_matrix_t) * (void **) d);
66 /** \brief Display the content of a matrix (debugging purpose)
67 * \param coords: boolean indicating whether we should add the coords of each cell to the output*/
68 void xbt_matrix_dump(xbt_matrix_t matrix, const char *name, int coords,
69 void_f_pvoid_t display_fun)
73 fprintf(stderr, ">>> Matrix %s dump (%d x %d)\n", name, matrix->lines,
75 for (i = 0; i < matrix->lines; i++) {
77 for (j = 0; j < matrix->rows; j++) {
79 fprintf(stderr, " (%d,%d)=", i, j);
82 (*display_fun) (xbt_matrix_get_ptr(matrix, i, j));
84 fprintf(stderr, "\n");
86 fprintf(stderr, "<<< end_of_matrix %s dump\n", name);
89 void xbt_matrix_dump_display_double(void *d)
91 fprintf(stderr, "%.2f", *(double *) d);
94 /** \brief Copy the values from the matrix src into the matrix dst
95 * \param dest: destination
97 * \param lsize: number of lines to copy
98 * \param rsize: number of rows to copy
99 * \param lpos_dst: line offset on destination matrix
100 * \param rpos_dst: row offset on destination matrix
101 * \param lpos_src: line offset on destination matrix
102 * \param rpos_src: row offset on destination matrix
104 void xbt_matrix_copy_values(xbt_matrix_t dst, xbt_matrix_t src,
105 unsigned int lsize, unsigned int rsize,
106 unsigned int lpos_dst, unsigned int rpos_dst,
107 unsigned int lpos_src, unsigned int rpos_src,
108 pvoid_f_pvoid_t const cpy_f)
112 DEBUG10("Copy a %dx%d submatrix from %dx%d(of %dx%d) to %dx%d (of %dx%d)",
114 lpos_src, rpos_src, src->lines, src->rows,
115 lpos_dst, rpos_dst, dst->lines, dst->rows);
117 /* everybody knows that issue is between the chair and the screen (particulary in my office) */
118 xbt_assert(src->elmsize == dst->elmsize);
119 /* don't check free_f since the user may play weird games with this */
121 xbt_assert(lpos_src + lsize <= src->lines);
122 xbt_assert(rpos_src + rsize <= src->rows);
124 xbt_assert(lpos_dst + lsize <= dst->lines);
125 xbt_assert(rpos_dst + rsize <= dst->rows);
127 /* Lets get serious here */
128 for (i = 0; i < rsize; i++) {
130 for (j = 0; j < lsize; j++)
131 xbt_matrix_get_as(dst, j + lpos_dst, i + rpos_dst, void *) =
132 (*cpy_f) (xbt_matrix_get_ptr(src, j + rpos_src, i + lpos_src));
134 memcpy(xbt_matrix_get_ptr(dst, lpos_dst, i + rpos_dst),
135 xbt_matrix_get_ptr(src, lpos_src, i + rpos_src),
136 dst->elmsize * lsize);
142 /** \brief Creates a new matrix of double filled with zeros */
143 xbt_matrix_t xbt_matrix_double_new_zeros(int lines, int rows)
145 xbt_matrix_t res = xbt_matrix_new(lines, rows, sizeof(double), NULL);
147 memset(res->data, 0, res->elmsize * res->lines * res->rows);
151 /** \brief Creates a new matrix of double being the identity matrix */
152 xbt_matrix_t xbt_matrix_double_new_id(int lines, int rows)
154 xbt_matrix_t res = xbt_matrix_double_new_zeros(lines, rows);
157 for (i = 0; i < lines; i++)
158 xbt_matrix_get_as(res, i, i, double) = 1;
162 /** \brief Creates a new matrix of double randomly filled */
163 xbt_matrix_t xbt_matrix_double_new_rand(int lines, int rows)
165 xbt_matrix_t res = xbt_matrix_new(lines, rows, sizeof(double), NULL);
168 for (i = 0; i < lines; i++)
169 for (j = 0; j < rows; j++)
170 xbt_matrix_get_as(res, i, j, double) = (double) rand();
174 /** \brief Creates a new matrix of double randomly by subsequent numbers */
175 xbt_matrix_t xbt_matrix_double_new_seq(int lines, int rows)
177 xbt_matrix_t res = xbt_matrix_new(lines, rows, sizeof(double), NULL);
180 for (i = 0; i < lines * rows; i++)
181 *(double *) &res->data[i * res->elmsize] = i;
186 /** \brief Creates a new matrix being the multiplication of two others */
187 xbt_matrix_t xbt_matrix_double_new_mult(xbt_matrix_t A, xbt_matrix_t B)
189 xbt_matrix_t result = xbt_matrix_double_new_zeros(A->lines, B->rows);
191 xbt_matrix_double_addmult(A, B, result);
195 /** \brief add to C the result of A*B */
196 void xbt_matrix_double_addmult(xbt_matrix_t A, xbt_matrix_t B,
197 /*OUT*/ xbt_matrix_t C)
199 unsigned int i, j, k;
201 xbt_assert2(A->lines == C->lines,
202 "A->lines != C->lines (%d vs %d)", A->lines, C->lines);
203 xbt_assert(B->rows == C->rows);
205 for (i = 0; i < C->lines; i++)
206 for (j = 0; j < C->rows; j++)
207 for (k = 0; k < B->lines; k++)
208 xbt_matrix_get_as(C, i, j, double) +=
209 xbt_matrix_get_as(A, i, k, double) * xbt_matrix_get_as(B, k, j,