dmtree.c File Reference

#include <string.h>
#include <stdlib.h>
#include "machine.h"
#include "MALLOC.h"

Include dependency graph for dmtree.c:

Go to the source code of this file.

Functions
void	cerro ()
void C2F()	dmtree (int *i0, int *la1, int *lp1, int *ls1, int *m, int *n, int *pred, int *w)

---

Function Documentation

void cerro

(

)

void C2F() dmtree	(	int *	i0,
		int*	la1,
		int*	lp1,
		int*	ls1,
		int*	m,
		int*	n,
		int*	pred,
		int*	w
	)

Definition at line 13 of file dmtree.c.

References cerro(), f(), F2C(), FREE, g, i, ind, int, m, MALLOC, n, NULL, w, and z.

{
  int i,nndim;
  int *alphi,*beta,*f,*g,*ind,*pred1;
  double *z,*zsom;
  int isize,dsize;
  isize = sizeof(int); dsize = sizeof(double);

  nndim = 2 * *n;
  if ((alphi = (int *)MALLOC(nndim * isize)) == NULL) {
    cerro("Running out of memory");
    return;
  }
  if ((beta = (int *)MALLOC(nndim * isize)) == NULL) {
    cerro("Running out of memory");
    return;
  }
  if ((f = (int *)MALLOC(nndim * isize)) == NULL) {
    cerro("Running out of memory");
    return;
  }
  if ((g = (int *)MALLOC(nndim * isize)) == NULL) {
    cerro("Running out of memory");
    return;
  }
  if ((ind = (int *)MALLOC(nndim * isize)) == NULL) {
    cerro("Running out of memory");
    return;
  }
  if ((pred1 = (int *)MALLOC(nndim * isize)) == NULL) {
    cerro("Running out of memory");
    return;
  }
  if ((z = (double *)MALLOC(nndim * dsize)) == NULL) {
    cerro("Running out of memory");
    return;
  }
  if ((zsom = (double *)MALLOC(nndim * dsize)) == NULL) {
    cerro("Running out of memory");
    return;
  }

  F2C(arbor)(alphi,beta,f,g,i0,ind,la1,lp1,ls1,m,n,&nndim,pred1,w,z,zsom);

  for (i = 0; i < *n; i++) pred[i] = pred1[i];

  FREE(alphi); FREE(beta); FREE(f); FREE(g); FREE(ind);
  FREE(pred1); FREE(z); FREE(zsom);
}

Here is the call graph for this function:

---