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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/* ----------------------------------------------------------------- */
/* The Speech Signal Processing Toolkit (SPTK) */
/* developed by SPTK Working Group */
/* http://sp-tk.sourceforge.net/ */
/* ----------------------------------------------------------------- */
/* */
/* Copyright (c) 1984-2007 Tokyo Institute of Technology */
/* Interdisciplinary Graduate School of */
/* Science and Engineering */
/* */
/* 1996-2015 Nagoya Institute of Technology */
/* Department of Computer Science */
/* */
/* All rights reserved. */
/* */
/* Redistribution and use in source and binary forms, with or */
/* without modification, are permitted provided that the following */
/* conditions are met: */
/* */
/* - Redistributions of source code must retain the above copyright */
/* notice, this list of conditions and the following disclaimer. */
/* - Redistributions in binary form must reproduce the above */
/* copyright notice, this list of conditions and the following */
/* disclaimer in the documentation and/or other materials provided */
/* with the distribution. */
/* - Neither the name of the SPTK working group nor the names of its */
/* contributors may be used to endorse or promote products derived */
/* from this software without specific prior written permission. */
/* */
/* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND */
/* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, */
/* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
/* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
/* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS */
/* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, */
/* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED */
/* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, */
/* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON */
/* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, */
/* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY */
/* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
/* POSSIBILITY OF SUCH DAMAGE. */
/* ----------------------------------------------------------------- */
/********************************************************************
$Id: getmem.c,v 1.19 2015/12/14 01:14:25 uratec Exp $
Memory Allocation Functions
short *sgetmem(leng)
long *lgetmem(leng)
double *dgetmem(leng)
float *fgetmem(leng)
real *rgetmem(leng)
float **fgetmem(leng)
double **ddgetmem(leng1, leng2)
int leng : data length
char *getmem(leng, size)
size_t leng : data length
size_t size : size of data type
**********************************************************************/
#include <stdio.h>
#include <stdlib.h>
#ifdef DOUBLE
#define real double
#else
#define real float
#endif
char *getmem(const size_t leng, const size_t size)
{
char *p = NULL;
if ((p = (char *) calloc(leng, size)) == NULL) {
fprintf(stderr, "Cannot allocate memory!\n");
exit(3);
}
return (p);
}
short *sgetmem(const int leng)
{
return ((short *) getmem((size_t) leng, sizeof(short)));
}
long *lgetmem(const int leng)
{
return ((long *) getmem((size_t) leng, sizeof(long)));
}
double *dgetmem(const int leng)
{
return ((double *) getmem((size_t) leng, sizeof(double)));
}
float *fgetmem(const int leng)
{
return ((float *) getmem((size_t) leng, sizeof(float)));
}
real *rgetmem(const int leng)
{
return ((real *) getmem((size_t) leng, sizeof(real)));
}
float **ffgetmem(const int leng)
{
return ((float **) getmem((size_t) leng, sizeof(float *)));
}
double **ddgetmem(const int leng1, const int leng2)
{
int i, j;
double **tmp, *tmp2;
tmp = (double **) getmem((size_t) leng1, sizeof(double *));
tmp2 = dgetmem(leng1 * leng2);
for (i = 0, j = 0; i < leng1; i++, j += leng2) {
tmp[i] = tmp2 + j;
}
return (tmp);
}
|
