interpretor/preprocessor/faust-0.9.47mr3/compiler/signals/prim2.cpp

   1 /************************************************************************
   2  ************************************************************************
   3     FAUST compiler
   4         Copyright (C) 2003-2004 GRAME, Centre National de Creation Musicale
   5     ---------------------------------------------------------------------
   6     This program is free software; you can redistribute it and/or modify
   7     it under the terms of the GNU General Public License as published by
   8     the Free Software Foundation; either version 2 of the License, or
   9     (at your option) any later version.
  10
  11     This program is distributed in the hope that it will be useful,
  12     but WITHOUT ANY WARRANTY; without even the implied warranty of
  13     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14     GNU General Public License for more details.
  15
  16     You should have received a copy of the GNU General Public License
  17     along with this program; if not, write to the Free Software
  18     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  19  ************************************************************************
  20  ************************************************************************/
  21
  22
  23
  24 #include "prim2.hh"
  25 #include "stdlib.h"
  26
  27 Sym FFUN = symbol ("ForeignFunction");
  28
  29 Tree ffunction (Tree signature, Tree incfile, Tree libfile)
  30 {
  31         return tree(FFUN, signature, incfile, libfile);
  32 }
  33
  34 bool isffunction(Tree t)
  35 {
  36         return t->node() == Node(FFUN);
  37 }
  38
  39 Tree ffsignature(Tree ff)
  40 {
  41         return ff->branch(0);
  42 }
  43
  44 const char* ffincfile(Tree ff)
  45 {
  46         return tree2str(ff->branch(1));
  47 }
  48
  49 const char* fflibfile(Tree ff)
  50 {
  51         return tree2str(ff->branch(2));
  52 }
  53
  54 int ffrestype(Tree t)
  55 {
  56         return tree2int(hd(ffsignature(t)));
  57 }
  58
  59 const char* ffname(Tree t)
  60 {
  61         return tree2str(nth(ffsignature(t),1));
  62 }
  63
  64 int ffarity(Tree t)
  65 {
  66         return len(ffsignature(t))-2;
  67 }
  68
  69 int ffargtype(Tree t, int i)
  70 {
  71         return tree2int(nth(ffsignature(t), i+2));
  72 }