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
|
#include "storage.h"
#include "ggets.h"
#include <stdlib.h>
#include <stdio.h>
#include "xpplim.h"
float **storage;
double *WORK;
extern int MAXSTOR,storind;
int IWORK[10000];
extern int NODE,NMarkov;
extern int METHOD;
#define BACKEUL 7
#define VOLTERRA 6
#define STIFF 9
#define GEAR 5
#define RB23 13
#define SYMPLECT 14
typedef struct
{
int nvec,node;
double *x;
} XPPVEC;
extern XPPVEC xpv;
void init_alloc_info()
{
int i;
xpv.node=NODE+NMarkov;
xpv.nvec=0; /* this is just for now */
xpv.x=(double *)malloc((xpv.nvec+xpv.node)*sizeof(double));
/* plintf(" node=%d nvec=%d \n",xpv.node,xpv.nvec); */
for(i=xpv.node;i<(xpv.nvec+xpv.node);i++)
xpv.x[i]=0.0;
}
void alloc_meth()
{
int nn=xpv.node+xpv.nvec;
int sz=30*nn;
switch(METHOD){
case STIFF:
sz=2*nn*nn+13*nn+100;
break;
case GEAR:
sz=30*nn+nn*nn+100;
break;
case BACKEUL:
case VOLTERRA:
sz=10*nn+nn*nn+100;
break;
case RB23:
sz=12*nn+100+nn*nn;
break;
}
if(WORK)
free(WORK);
WORK=(double *)malloc(sz*sizeof(double));
/* plintf(" I have allocated %d doubles \n",sz); */
}
int reallocstor(int ncol,int nrow)
{
int i=0;
while((storage[i]=(float *)realloc(storage[i],nrow*sizeof(float)))!=NULL){
i++;
if(i==ncol)return 1;
}
err_msg("Cannot allocate sufficient storage");
return 0;
}
void init_stor(nrow,ncol)
int nrow,ncol;
{
int i;
/* WORK=(double *)malloc(WORKSIZE*sizeof(double));
if(WORK!=NULL){ */
WORK=NULL;
storage=(float **)malloc((MAXODE+1)*sizeof(float *));
MAXSTOR=nrow;
storind=0;
if(storage!=NULL){
i=0;
while((storage[i]=(float *)malloc(nrow*sizeof(float)))!=NULL){
i++;
if(i==ncol)return;
}
}
/* } */
/* plintf("col=%d\n",i); */
err_msg("Cannot allocate sufficient storage");
exit(0);
}
void free_storage(ncol)
int ncol;
{
int i;
for(i=0;i<ncol;i++)free(storage[i]);
free(storage);
if(WORK)free(WORK);
}
|
