File: dmtree.c

package info (click to toggle)
scilab 4.0-12
  • links: PTS
  • area: non-free
  • in suites: etch, etch-m68k
  • size: 100,640 kB
  • ctags: 57,333
  • sloc: ansic: 377,889; fortran: 242,862; xml: 179,819; tcl: 42,062; sh: 10,593; ml: 9,441; makefile: 4,377; cpp: 1,354; java: 621; csh: 260; yacc: 247; perl: 130; lex: 126; asm: 72; lisp: 30
file content (71 lines) | stat: -rw-r--r-- 1,632 bytes parent folder | download | duplicates (2)
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
#include <string.h>

#ifdef __STDC__
#include <stdlib.h>
#else
#include <malloc.h>
#endif

extern void cerro();

#include "../machine.h"
#ifdef WIN32
#include "../os_specific/win_mem_alloc.h" /* MALLOC */
#else
#include "../os_specific/sci_mem_alloc.h" /* MALLOC */
#endif

#if WIN32
extern int F2C(arbor)();
#endif

void C2F(dmtree)(i0,la1,lp1,ls1,m,n,pred,w)
int *i0,*la1,*lp1,*ls1,*m,*n,*pred,*w;
{
  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);
}