[BACK]Return to function.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / parse

Diff for /OpenXM_contrib2/asir2000/parse/function.c between version 1.3 and 1.5

version 1.3, 2000/08/22 05:04:26 version 1.5, 2004/06/28 01:50:22
Line 45 
Line 45 
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,   * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.   * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *   *
  * $OpenXM: OpenXM_contrib2/asir2000/parse/function.c,v 1.2 2000/08/21 08:31:46 noro Exp $   * $OpenXM: OpenXM_contrib2/asir2000/parse/function.c,v 1.4 2003/05/16 09:34:49 noro Exp $
 */  */
 #include "ca.h"  #include "ca.h"
 #include "parse.h"  #include "parse.h"
Line 61  int argc;
Line 61  int argc;
   
         t = (FUNC)MALLOC(sizeof(struct oFUNC));          t = (FUNC)MALLOC(sizeof(struct oFUNC));
         t->name = name; t->id = A_BIN; t->argc = argc; t->f.binf = func;          t->name = name; t->id = A_BIN; t->argc = argc; t->f.binf = func;
           t->fullname = name;
         MKNODE(n,t,*flistp); *flistp = n;          MKNODE(n,t,*flistp); *flistp = n;
 }  }
   
Line 75  int type;
Line 76  int type;
   
         t = (FUNC)MALLOC(sizeof(struct oFUNC));          t = (FUNC)MALLOC(sizeof(struct oFUNC));
         t->name = name; t->id = A_PARI; t->type = type; t->f.binf = (void (*)())func;          t->name = name; t->id = A_PARI; t->type = type; t->f.binf = (void (*)())func;
           t->fullname = name;
         MKNODE(n,t,*flistp); *flistp = n;          MKNODE(n,t,*flistp); *flistp = n;
 }  }
   
Line 94  int argc;
Line 96  int argc;
         appendbinf(&ubinf,name,func,argc);          appendbinf(&ubinf,name,func,argc);
 }  }
   
   int comp_dcp(DCP *a,DCP *b)
   {
           int c;
   
           c = arf_comp(CO,(Obj)(*a)->c,(Obj)(*b)->c);
           if ( c > 0 ) return 1;
           else if ( c < 0 ) return -1;
           else return 0;
   }
   
 void dcptolist(dc,listp)  void dcptolist(dc,listp)
 DCP dc;  DCP dc;
 LIST *listp;  LIST *listp;
 {  {
         NODE node,tnode,ln0,ln1;          NODE node,tnode,ln0,ln1;
         LIST l;          LIST l;
           DCP *w,t;
           int i,n;
   
         for ( node = 0; dc; dc = NEXT(dc) ) {          for ( n = 0, t = dc; t; t = NEXT(t), n++ );
           w = (DCP *)ALLOCA(n*sizeof(DCP));
           for ( i = 0, t = dc; i < n; t = NEXT(t), i++ )
                   w[i] = t;
           qsort(w,n,sizeof(DCP),(int (*)(const void *,const void *))comp_dcp);
           for ( node = 0, i = 0; i < n; i++ ) {
                 NEXTNODE(node,tnode);                  NEXTNODE(node,tnode);
                 MKNODE(ln1,DEG(dc),0); MKNODE(ln0,COEF(dc),ln1);                  MKNODE(ln1,DEG(w[i]),0); MKNODE(ln0,COEF(w[i]),ln1);
                 MKLIST(l,ln0); BDY(tnode) = (pointer)l;                  MKLIST(l,ln0); BDY(tnode) = (pointer)l;
         }          }
         NEXT(tnode) = 0; MKLIST(l,node); *listp = l;          NEXT(tnode) = 0; MKLIST(l,node); *listp = l;
Legend:
Removed from v.1.3  
changed lines
  Added in v.1.5
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>