1 /* xbt_matrix_t management functions */
3 /* Copyright (c) 2006, 2007, 2008, 2009, 2010. The SimGrid Team.
4 * All rights reserved. */
6 /* This program is free software; you can redistribute it and/or modify it
7 * under the terms of the license (GNU LGPL) which comes with this package. */
10 #include "xbt/sysdep.h"
12 #include "xbt/matrix.h"
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_matrix, xbt, "2D data storage");
16 /** \brief constructor */
17 xbt_matrix_t xbt_matrix_new(int lines, int rows,
18 const unsigned long elmsize,
19 void_f_pvoid_t const free_f)
21 xbt_matrix_t res = xbt_new(s_xbt_matrix_t, 1);
24 res->elmsize = elmsize;
26 res->data = xbt_malloc(elmsize * lines * rows);
30 /** \brief Creates a matrix being a submatrix of another one */
31 xbt_matrix_t xbt_matrix_new_sub(xbt_matrix_t from,
34 pvoid_f_pvoid_t const cpy_f)
37 xbt_matrix_t res = xbt_matrix_new(lsize, rsize,
38 from->elmsize, from->free_f);
39 xbt_matrix_copy_values(res, from, lsize, rsize, 0, 0, lpos, rpos, cpy_f);
43 /** \brief destructor */
44 void xbt_matrix_free(xbt_matrix_t mat)
49 for (i = 0; i < (mat->lines * mat->rows); i++) {
50 (*(mat->free_f)) ((void *) &(mat->data[i * mat->elmsize]));
58 /** \brief Freeing function for containers of xbt_matrix_t */
59 void xbt_matrix_free_voidp(void *d)
61 xbt_matrix_free((xbt_matrix_t) * (void **) d);
65 /** \brief Display the content of a matrix (debugging purpose)
66 * \param coords: boolean indicating whether we should add the coords of each cell to the output*/
67 void xbt_matrix_dump(xbt_matrix_t matrix, const char *name, int coords,
68 void_f_pvoid_t display_fun)
72 fprintf(stderr, ">>> Matrix %s dump (%d x %d)\n", name, matrix->lines,
74 for (i = 0; i < matrix->lines; i++) {
76 for (j = 0; j < matrix->rows; j++) {
78 fprintf(stderr, " (%d,%d)=", i, j);
81 (*display_fun) (xbt_matrix_get_ptr(matrix, i, j));
83 fprintf(stderr, "\n");
85 fprintf(stderr, "<<< end_of_matrix %s dump\n", name);
88 void xbt_matrix_dump_display_double(void *d)
90 fprintf(stderr, "%.2f", *(double *) d);
93 /** \brief Copy the values from the matrix src into the matrix dst
94 * \param dest: destination
96 * \param lsize: number of lines to copy
97 * \param rsize: number of rows to copy
98 * \param lpos_dst: line offset on destination matrix
99 * \param rpos_dst: row offset on destination matrix
100 * \param lpos_src: line offset on destination matrix
101 * \param rpos_src: row offset on destination matrix
103 void xbt_matrix_copy_values(xbt_matrix_t dst, xbt_matrix_t src,
104 unsigned int lsize, unsigned int rsize,
105 unsigned int lpos_dst, unsigned int rpos_dst,
106 unsigned int lpos_src, unsigned int rpos_src,
107 pvoid_f_pvoid_t const cpy_f)
112 ("Copy a %dx%d submatrix from %dx%d(of %dx%d) to %dx%d (of %dx%d)",
113 lsize, rsize, lpos_src, rpos_src, src->lines, src->rows, lpos_dst,
114 rpos_dst, dst->lines, dst->rows);
116 /* everybody knows that issue is between the chair and the screen (particulary in my office) */
117 xbt_assert(src->elmsize == dst->elmsize);
118 /* don't check free_f since the user may play weird games with this */
120 xbt_assert(lpos_src + lsize <= src->lines);
121 xbt_assert(rpos_src + rsize <= src->rows);
123 xbt_assert(lpos_dst + lsize <= dst->lines);
124 xbt_assert(rpos_dst + rsize <= dst->rows);
126 /* Lets get serious here */
127 for (i = 0; i < rsize; i++) {
129 for (j = 0; j < lsize; j++)
130 xbt_matrix_get_as(dst, j + lpos_dst, i + rpos_dst, void *) =
131 (*cpy_f) (xbt_matrix_get_ptr(src, j + rpos_src, i + lpos_src));
133 memcpy(xbt_matrix_get_ptr(dst, lpos_dst, i + rpos_dst),
134 xbt_matrix_get_ptr(src, lpos_src, i + rpos_src),
135 dst->elmsize * lsize);
141 /** \brief Creates a new matrix of double filled with zeros */
142 xbt_matrix_t xbt_matrix_double_new_zeros(int lines, int rows)
144 xbt_matrix_t res = xbt_matrix_new(lines, rows, sizeof(double), NULL);
146 memset(res->data, 0, res->elmsize * res->lines * res->rows);
150 /** \brief Creates a new matrix of double being the identity matrix */
151 xbt_matrix_t xbt_matrix_double_new_id(int lines, int rows)
153 xbt_matrix_t res = xbt_matrix_double_new_zeros(lines, rows);
156 for (i = 0; i < lines; i++)
157 xbt_matrix_get_as(res, i, i, double) = 1;
161 /** \brief Creates a new matrix of double randomly filled */
162 xbt_matrix_t xbt_matrix_double_new_rand(int lines, int rows)
164 xbt_matrix_t res = xbt_matrix_new(lines, rows, sizeof(double), NULL);
167 for (i = 0; i < lines; i++)
168 for (j = 0; j < rows; j++)
169 xbt_matrix_get_as(res, i, j, double) = (double) rand();
173 /** \brief Creates a new matrix of double containing the sequence of numbers in order */
174 xbt_matrix_t xbt_matrix_double_new_seq(int lines, int rows)
176 xbt_matrix_t res = xbt_matrix_new(lines, rows, sizeof(double), NULL);
179 for (i = 0; i < lines * rows; i++)
180 *(double *) &res->data[i * res->elmsize] = i;
185 /** \brief Checks whether the matrix contains the sequence of numbers */
186 int xbt_matrix_double_is_seq(xbt_matrix_t mat)
190 for (i = 0; i < mat->lines * mat->rows; i++) {
191 double val = xbt_matrix_get_as(mat, i, 0, double);
199 /** \brief Creates a new matrix being the multiplication of two others */
200 xbt_matrix_t xbt_matrix_double_new_mult(xbt_matrix_t A, xbt_matrix_t B)
202 xbt_matrix_t result = xbt_matrix_double_new_zeros(A->lines, B->rows);
204 xbt_matrix_double_addmult(A, B, result);
208 /** \brief add to C the result of A*B */
209 void xbt_matrix_double_addmult(xbt_matrix_t A, xbt_matrix_t B,
210 /*OUT*/ xbt_matrix_t C)
212 unsigned int i, j, k;
214 xbt_assert2(A->lines == C->lines,
215 "A->lines != C->lines (%d vs %d)", A->lines, C->lines);
216 xbt_assert(B->rows == C->rows);
218 for (i = 0; i < C->lines; i++)
219 for (j = 0; j < C->rows; j++)
220 for (k = 0; k < B->lines; k++)
221 xbt_matrix_get_as(C, i, j, double) +=
222 xbt_matrix_get_as(A, i, k, double) * xbt_matrix_get_as(B, k, j,