/* IndexMem.C   LAST MODIFIED:  04/11/97  */
/* Memory allocation subroutines from the */
/* test Numerical Computation Using C by  */
/* R. Glassey and elsewhere...            */

# include "Index.h"

double *vecalloc(int nr)
{
  double *x;
  x=(double *) calloc((unsigned) nr,sizeof(double));
  if (x==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
  return x;
}

long *lvecalloc(int nr)
{
  long *x;
  x=(long *) calloc((unsigned) nr,sizeof(long));
  if (x==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
  return x;
}

/* See page 50 of Programs and Data Structures in C by Ammeraal */
/* for example from which the two following routines where drawn. */
char **cvecalloc(int nr)
{
  char **x;
  x=(char **) malloc(nr * sizeof(char *));
  if (x==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
  return x;
}

char *charalloc(int nr)
{
  char *x;
  x=(char *) malloc(nr);
  if (x==NULL){
    fprintf(stderr, "Unable to allocate dynamic memory");
    exit(-1);
  }
  return x;
}

/* Alloc mem for the linked list structure.  */
/* See Ammeraal, pg 102 */
node **nvecalloc(int nr)
{
  node **x;
  x=(node **) malloc(nr * sizeof(node *));
  if (x==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
  return x;
}

/* see Ammeraal, p 102 */
void AddNode(node **ND, char *zip, double gsamp, int nodenum)
{
  node *p=ND[nodenum];
  ND[nodenum]=(node *)malloc(sizeof(node));
  if (ND[nodenum]==NULL) {
    printf("Unable to allocate dynamic memory");
    exit(-1);
  }
  ND[nodenum]->zip=charalloc(strlen(zip));
  strcpy(ND[nodenum]->zip,zip);
  ND[nodenum]->gsamp=gsamp;
  ND[nodenum]->var=0.0;
  ND[nodenum]->sigma=0.0;
  ND[nodenum]->accept=0;
  ND[nodenum]->index=0;
  ND[nodenum]->next=p;
  /* Uncomment to verify: */
  /* printf("AddNode:  %s \t  %2.0f \t at %i\n",
     ND[nodenum]->zip,ND[nodenum]->index,nodenum); */
}

float *fvecalloc(int nr)
{
  float *x;
  x=(float *) calloc((unsigned) nr,sizeof(float));
  if (x==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
  return x;
}

int *ivecalloc(int nr)
{
  int *x;
  x=(int *) calloc((unsigned) nr,sizeof(int));
  if (x==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
  return x;
}

double **matalloc(int nr, int nc)
{
int k;
double **x;
x=(double **) calloc((unsigned) nr, sizeof(double *));
if (x==NULL){
  fprintf(stderr,"Unable to allocate dynamic memory");
  exit(-1);
}
for (k=0;k<nr;k++){
  x[k]=(double *) calloc((unsigned) nc, sizeof(double));
  if (x[k]==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
}
return x;
}

float **fmatalloc(int nr, int nc)
{
int k;
float **x;
x=(float **) calloc((unsigned) nr, sizeof(float *));
if (x==NULL){
  fprintf(stderr,"Unable to allocate dynamic memory");
  exit(-1);
}
for (k=0;k<nr;k++){
  x[k]=(float *) calloc((unsigned) nc, sizeof(float));
  if (x[k]==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
}
return x;
}


int  **imatalloc(int nr, int nc)
{
int k;
int **x;
x=(int **) calloc((unsigned) nr, sizeof(int *));
if (x==NULL){
  fprintf(stderr,"Unable to allocate dynamic memory");
  exit(-1);
}
for (k=0;k<nr;k++){
  x[k]=(int *) calloc((unsigned) nc, sizeof(int));
  if (x[k]==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
}
return x;
}

/* following routine from K&R book, page 101  */

static char allocbuf[ALLOCSIZE];
static char *allocp = allocbuf;

char *alloc(int n)
{
  if (allocbuf + ALLOCSIZE - allocp >= n) {
    allocp += n;
    return allocp - n;
  }
  else
    return 0;
}



double ****fouralloc(int nr1, int nc1, int nr2, int nc2)
{
int k, l, m;
double ****x;
x=(double ****) calloc((unsigned) nr1, sizeof(double ***));
if (x==NULL){
  fprintf(stderr,"Unable to allocate dynamic memory");
  exit(-1);
}
for (k=0;k<nr1;k++){
  x[k]=(double ***) calloc((unsigned) nc1, sizeof(double **));
  if (x[k]==NULL){
    fprintf(stderr,"Unable to allocate dynamic memory");
    exit(-1);
  }
  for (l=0;l<nc1;l++){
    x[k][l]=(double **) calloc((unsigned) nr2, sizeof(double *));
    if (x[k][l]==NULL){
      fprintf(stderr,"Unable to allocate dynamic memory");
      exit(-1);
    }
    for (m=0;m<nr2;m++){
      x[k][l][m]=(double *) calloc((unsigned) nc2, sizeof(double));
      if (x[k][l][m]==NULL){
	fprintf(stderr,"Unable to allocate dynamic memory");
	exit(-1);
      }
    } /* end of for m */
  }   /* end of for l */
}     /* end of for k */
return x;
}