File: fctransp.c

package info (click to toggle)
modemp3d 0.1-5
  • links: PTS
  • area: main
  • in suites: sarge
  • size: 1,688 kB
  • ctags: 1,472
  • sloc: ansic: 12,007; sh: 2,838; makefile: 341; yacc: 285; sed: 93; lex: 33; perl: 31; xml: 10
file content (61 lines) | stat: -rw-r--r-- 1,608 bytes parent folder | download | duplicates (14)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/*
 * Matrix operations library
 *
 * Copyright (C) 1999-2000
 *   Thomas Sailer, <sailer@ife.ee.ethz.ch>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

/* AIX requires this to be the first thing in the file.  */
#ifndef __GNUC__
# if HAVE_ALLOCA_H
#  include <alloca.h>
# else
#  ifdef _AIX
#pragma alloca
#  else
#   ifndef alloca /* predefined by HP cc +Olibcalls */
char *alloca ();
#   endif
#  endif
# endif
#endif

#include <string.h>
#include "mat.h"

/* Transpose a matrix (a el C^{d1 x d2}, b el C^{d2 x d1}) */

void fctranspose(cplxfloat_t *b, const cplxfloat_t *a, unsigned int d1, unsigned int d2)
{
	const cplxfloat_t *c = a;
	unsigned int ci, bi, i, j;

	if (b == a) {
		c = alloca(d1 * d2 * sizeof(c[0]));
		memcpy((void *)c, a, d1 * d2 * sizeof(c[0]));
	}
	for (i = 0; i < d1; i++)
		for (j = 0; j < d2; j++) {
			ci = i*d2+j;
			bi = j*d1+i;
			b[bi] = c[ci];
		}
}