intmacr2tree.h File Reference

#include <string.h>
#include <stdio.h>
#include <math.h>
#include "machine.h"
#include "stack-c.h"
#include "Funtab.h"

Include dependency graph for intmacr2tree.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Defines
#define	idstk(x, y)   (C2F(vstk).idstk+(x-1)+(y-1)*nsiz)
#define	CvNameL(id, str, jobptr, str_len)   C2F(cvnamel)(id,str,jobptr,str_len);
#define	CvStr(n, line, str, jobptr, str_len)   C2F(cvstr)(n,line,str,jobptr,str_len);
Functions
void	str2sci (char **x, int n, int m)
void C2F()	itosci (int *intptr, int *nbrows, int *nbcols)
void C2F()	dtosci (double *dbleptr, int *nbrows, int *nbcols)
int C2F()	cvnamel (int *id, char *str, int *jobptr, int *str_len)
int C2F()	mklist (int *nbitems)
int C2F()	mktlist (int *nbitems)
int	C2F (macr2tree) _PARAMS((char *fname
static int	CreateVariableTList (char **varname)
static int	CreateEOLList (void)
static int	AddVar (char *name)
static int	IsDefinedVar (char *name)
static int	GetInstruction (int *data, int *index, int *nblines, int *addinstr)
static int	GetControlInstruction (int *data, int *index, int *nblines)
static int	CreateCsteTList (char *type, int *data, int *index)
static int	CreateOperationTList (int *data, int *index)
static int	CreateFuncallTList (char *fromwhat, int *data, int *index)
static int	CreateEqualTList (char *fromwhat, int *data, int *index)
static int	CreateCommentTList (int *data, int *index)
static int	CreateRecursiveIndexList (int *data, int *index)
static int	VCopyObj (char *fname, int *orig, int *dest, unsigned long fname_length)
int	complexity (int *data, int *index, int *lgth)
Variables
int unsigned long	fname_len

---

Define Documentation

#define CvNameL	(	id,
		str,
		jobptr,
		str_len		)	C2F(cvnamel)(id,str,jobptr,str_len);

Definition at line 40 of file intmacr2tree.h.

Referenced by C2F(), CreateCsteTList(), CreateEqualTList(), CreateFuncallTList(), GetControlInstruction(), and GetInstruction().

#define CvStr	(	n,
		line,
		str,
		jobptr,
		str_len		)	C2F(cvstr)(n,line,str,jobptr,str_len);

Definition at line 41 of file intmacr2tree.h.

Referenced by CreateCommentTList(), and CreateCsteTList().

#define idstk	(	x,
		y		)	(C2F(vstk).idstk+(x-1)+(y-1)*nsiz)

Definition at line 39 of file intmacr2tree.h.

Referenced by C2F(), parse(), and run().

---

Function Documentation

static int AddVar

(

char *

name

)

[static]

Referenced by CreateVariableTList().

Here is the caller graph for this function:

int C2F

(

macr2tree

)

int complexity	(	int *	data,
		int *	index,
		int *	lgth
	)

Definition at line 1802 of file intmacr2tree.c.

References count, nsiz, and sciprint().

Referenced by C2F().

{
  int count = 0;
  
  int cur_ind = *index2+1;

  int last_eol=0;

  int nbop = 0; /* Number of value stored on stack */

  while(cur_ind<=*lgth+*index2)
    {
      switch(data[cur_ind])
        {
        case 0: /* Deleted operation */
          cur_ind = cur_ind + data[cur_ind+1] + 1;
          break;
        case 1: /* Stack put (Obsolete) */
          cur_ind = cur_ind + nsiz + 1;
          count++;
          break;
        case 2: /* Stack get */
          cur_ind = cur_ind + nsiz + 3;
          nbop++;
          break;
        case 3: /* String */
          cur_ind = cur_ind + 2 + data[cur_ind+1];
          nbop++;
          break;
        case 4: /* Empty matrix */
          cur_ind++;
          nbop++;
          break;
        case 5: /* Operations */
          if( (data[cur_ind+1]==4) && (last_eol==nbop-2) ) /* rc with a EOL */
            {
              nbop--;
              count--;
            }
          nbop = nbop - data[cur_ind+2];
          cur_ind = cur_ind + 4;
          nbop++;
          break;
        case 6: /* Number */
          cur_ind = cur_ind + 3;
          nbop++;
          break;
        case 7: /* 'for' control instruction */
          cur_ind = cur_ind + data[cur_ind+1] + 2;
          cur_ind = cur_ind + 1 + nsiz + data[cur_ind];
          count++;
          break;
        case 8: /* 'if-then-else' control instruction */
          if(data[cur_ind+1]>0)
            {
              cur_ind = cur_ind + 2;
              cur_ind = cur_ind + 3 + data[cur_ind] + data[cur_ind+1] + data[cur_ind+2];
            }
          else
            {
              cur_ind = cur_ind - data[cur_ind+1];
            }
          count++;
          break;
        case 9: /* 'while' control instruction */
          if(data[cur_ind+1]>0)
            {
              cur_ind = cur_ind + 2;
              cur_ind = cur_ind + 3 + data[cur_ind] + data[cur_ind+1] + data[cur_ind+2];
            }
          else
            {
              cur_ind = cur_ind - data[cur_ind+1];
            }
          count++;
          break;
        case 10: /* 'select-case' control instruction */
          cur_ind = cur_ind + data[cur_ind+1];
          count++;
          break;
        case 11: /* 'try-catch' control instruction */
          cur_ind = cur_ind + data[cur_ind+1] + data[cur_ind+2] + 3;
          count++;
          break;
        case 12: /* pause */
          cur_ind++;
          count++;
          break;
        case 13: /* break */
          cur_ind++;
          count++;
          break;
        case 14: /* abort */
          cur_ind++;
          count++;
          break;
        case 15: /* EOL */
          cur_ind++;
          last_eol = nbop;
          nbop++;
          count++;
          break;
        case 16: /* Set line number */
          cur_ind = cur_ind + 2;
          break;
        case 17: /* quit (Should never append) */
          cur_ind++;
          count++;
          break;
        case 18: /* Mark named variable */
          cur_ind = cur_ind + 1 + nsiz;
          break;
        case 19: /* Form recursive index2 list */
          nbop = nbop - data[cur_ind+1] + 1;
          cur_ind = cur_ind + 3;
          break;
        case 20: /* exit */
          cur_ind++;
          count++;
          break;
        case 21: /* Beginning of rhs */
          cur_ind = cur_ind + 1;
          break;
        case 22: /* Set print mode (ignored ?) */
          cur_ind = cur_ind + 2;
          break;
        case 23: /* Create variable from name */
          cur_ind = cur_ind + 1 + nsiz;
          nbop++;
          break;
        case 24: /* Create an object with type 0 */
          cur_ind = cur_ind + 1;
          break;
        case 25: /* Compute profiling data */
          cur_ind = cur_ind + 3;
          break;
        case 26: /* Vector of strings */
          cur_ind = cur_ind + 5 + data[cur_ind+1]*data[cur_ind+2] + data[cur_ind+4+data[cur_ind+1]*data[cur_ind+2]] - 1;
          break;
        case 27: /* varfunptr ??? */
          cur_ind = cur_ind + 3 + nsiz;
          break;
        case 28: /* continue */
          cur_ind++;
          count++;
          break;
        case 29: /* Affectation */
          nbop = 0;
          cur_ind = cur_ind + 2 + (data[cur_ind+1])*(nsiz+1) + 1;
          count++;
          break;
        case 30: /* Expression evaluation short circuiting */
          /* This code is ignored */
          cur_ind = cur_ind + 3;
          break;
        case 31: /* comment */
          cur_ind = cur_ind + 2 + data[cur_ind+1];
          count++;
          break;
        case 99: /* return */
          cur_ind++;
          count++;
          break;
        default:
          if(data[cur_ind]/100*100==data[cur_ind])
            {
              cur_ind = cur_ind + 4;
            }
          else
            {
              sciprint("complexity: wrong code %d\r\n",data[cur_ind]);
              return -1;
            }
          break;
        }
    }
  return count;
  
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int CreateCommentTList	(	int *	data,
		int *	index
	)			[static]

Referenced by GetInstruction().

Here is the caller graph for this function:

static int CreateCsteTList	(	char *	type,
		int *	data,
		int *	index
	)			[static]

Referenced by GetInstruction().

Here is the caller graph for this function:

static int CreateEOLList

(

void

)

[static]

Referenced by GetInstruction().

Here is the caller graph for this function:

static int CreateEqualTList	(	char *	fromwhat,
		int *	data,
		int *	index
	)			[static]

Referenced by GetControlInstruction(), and GetInstruction().

Here is the caller graph for this function:

static int CreateFuncallTList	(	char *	fromwhat,
		int *	data,
		int *	index
	)			[static]

Referenced by GetInstruction().

Here is the caller graph for this function:

static int CreateOperationTList	(	int *	data,
		int *	index
	)			[static]

Referenced by GetInstruction().

Here is the caller graph for this function:

static int CreateRecursiveIndexList	(	int *	data,
		int *	index
	)			[static]

static int CreateVariableTList

(

char **

varname

)

[static]

Referenced by C2F(), CreateEqualTList(), GetControlInstruction(), and GetInstruction().

Here is the caller graph for this function:

int C2F() cvnamel	(	int *	id,
		char *	str,
		int *	jobptr,
		int *	str_len
	)

void C2F() dtosci	(	double *	dbleptr,
		int *	nbrows,
		int *	nbcols
	)

Referenced by CreateCsteTList(), CreateFuncallTList(), sciblk2(), and sciblk2i().

Here is the caller graph for this function:

static int GetControlInstruction	(	int *	data,
		int *	index,
		int *	nblines
	)			[static]

Referenced by GetInstruction().

Here is the caller graph for this function:

static int GetInstruction	(	int *	data,
		int *	index,
		int *	nblines,
		int *	addinstr
	)			[static]

Referenced by C2F(), and GetControlInstruction().

Here is the caller graph for this function:

static int IsDefinedVar

(

char *

name

)

[static]

Referenced by AddVar(), and GetInstruction().

Here is the caller graph for this function:

void C2F() itosci	(	int *	intptr,
		int *	nbrows,
		int *	nbcols
	)

Referenced by C2F(), sciblk2(), and sciblk2i().

Here is the caller graph for this function:

int C2F() mklist

(

int *

nbitems

)

int C2F() mktlist

(

int *

nbitems

)

Referenced by C2F(), createblklist(), CreateCommentTList(), CreateCsteTList(), CreateEqualTList(), CreateFuncallTList(), CreateOperationTList(), CreateVariableTList(), GetControlInstruction(), and intgetscicosvarsc().

Here is the caller graph for this function:

void str2sci	(	char **	x,
		int	n,
		int	m
	)

Definition at line 6 of file str2sci.c.

Referenced by C2F(), createblklist(), CreateCommentTList(), CreateCsteTList(), CreateEOLList(), CreateEqualTList(), CreateFuncallTList(), CreateOperationTList(), CreateVariableTList(), GetControlInstruction(), and intgetscicosvarsc().

{
      
  int l=0,il=0,zero=0,err,n1,i,m1=0;
      
  if (Top >= Bot) {
    i=18;
    C2F(error)(&i);
  } else {
    Top = Top + 1;
    il = iadr(*Lstk(Top));
    l = sadr(il+6);
  }
  
  err = l + n*m - *Lstk(Bot);
  if (err > 0) {
    i=17;
    C2F(error)(&i);
    return;
  }
  *istk(il) = 10;
  *istk(il+1) = n;
  *istk(il+2) = m;
  *istk(il+3) = 0;
  *istk(il+4) = 1;
  for (i = 1; i <= n*m; i++){
          n1=strlen(x[i-1]);
          *istk(il+4+i) =  *istk(il+4+i-1)+n1;
          if (n1 > 0) 
                  C2F(cvstr)(&n1,istk(il+m*n+5 -1 + *istk(il+3+i)),x[i-1],&zero,(unsigned long) n1);
          m1=m1+n1;
  }
  *Lstk(Top+1) = l + m1;      
                
} 

Here is the caller graph for this function:

static int VCopyObj	(	char *	fname,
		int *	orig,
		int *	dest,
		unsigned long	fname_length
	)			[static]

Referenced by CreateEqualTList(), CreateFuncallTList(), and CreateOperationTList().

Here is the caller graph for this function:

---

Variable Documentation

int unsigned long fname_len

Definition at line 69 of file intmacr2tree.h.

---