File: alloc.c

package info (click to toggle)
oourafft 1.0-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 1,020 kB
  • sloc: ansic: 16,490; fortran: 7,269; makefile: 19
file content (153 lines) | stat: -rw-r--r-- 2,608 bytes parent folder | download
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
/* ---- memory allocation ---- */
#include "alloc.h"


#define alloc_error_check(p) { \
    if ((p) == NULL) { \
        fprintf(stderr, "Allocation Failure!\n"); \
        exit(1); \
    } \
}


int *alloc_1d_int(int n1)
{
    int *i;
    
    i = (int *) malloc(sizeof(int) * n1);
    alloc_error_check(i);
    return i;
}


void free_1d_int(int *i)
{
    free(i);
}


double *alloc_1d_double(int n1)
{
    double *d;
    
    d = (double *) malloc(sizeof(double) * n1);
    alloc_error_check(d);
    return d;
}


void free_1d_double(double *d)
{
    free(d);
}


int **alloc_2d_int(int n1, int n2)
{
    int **ii, *i;
    int j;
    
    ii = (int **) malloc(sizeof(int *) * n1);
    alloc_error_check(ii);
    i = (int *) malloc(sizeof(int) * n1 * n2);
    alloc_error_check(i);
    ii[0] = i;
    for (j = 1; j < n1; j++) {
        ii[j] = ii[j - 1] + n2;
    }
    return ii;
}


void free_2d_int(int **ii)
{
    free(ii[0]);
    free(ii);
}


double **alloc_2d_double(int n1, int n2)
{
    double **dd, *d;
    int j;
    
    dd = (double **) malloc(sizeof(double *) * n1);
    alloc_error_check(dd);
    d = (double *) malloc(sizeof(double) * n1 * n2);
    alloc_error_check(d);
    dd[0] = d;
    for (j = 1; j < n1; j++) {
        dd[j] = dd[j - 1] + n2;
    }
    return dd;
}


void free_2d_double(double **dd)
{
    free(dd[0]);
    free(dd);
}


int ***alloc_3d_int(int n1, int n2, int n3)
{
    int ***iii, **ii, *i;
    int j;
    
    iii = (int ***) malloc(sizeof(int **) * n1);
    alloc_error_check(iii);
    ii = (int **) malloc(sizeof(int *) * n1 * n2);
    alloc_error_check(ii);
    iii[0] = ii;
    for (j = 1; j < n1; j++) {
        iii[j] = iii[j - 1] + n2;
    }
    i = (int *) malloc(sizeof(int) * n1 * n2 * n3);
    alloc_error_check(i);
    ii[0] = i;
    for (j = 1; j < n1 * n2; j++) {
        ii[j] = ii[j - 1] + n3;
    }
    return iii;
}


void free_3d_int(int ***iii)
{
    free(iii[0][0]);
    free(iii[0]);
    free(iii);
}


double ***alloc_3d_double(int n1, int n2, int n3)
{
    double ***ddd, **dd, *d;
    int j;
    
    ddd = (double ***) malloc(sizeof(double **) * n1);
    alloc_error_check(ddd);
    dd = (double **) malloc(sizeof(double *) * n1 * n2);
    alloc_error_check(dd);
    ddd[0] = dd;
    for (j = 1; j < n1; j++) {
        ddd[j] = ddd[j - 1] + n2;
    }
    d = (double *) malloc(sizeof(double) * n1 * n2 * n3);
    alloc_error_check(d);
    dd[0] = d;
    for (j = 1; j < n1 * n2; j++) {
        dd[j] = dd[j - 1] + n3;
    }
    return ddd;
}


void free_3d_double(double ***ddd)
{
    free(ddd[0][0]);
    free(ddd[0]);
    free(ddd);
}