interpretor/preprocessor/faust-0.9.47mr3/compiler/headers/contextor.hh

   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         HISTORY
  24         22/01/05 : corrected bug on bool signals cached in float variables
  25 *****************************************************************************/
  26
  27
  28 #include <stdio.h>
  29 #include <iostream>
  30 #include <sstream>
  31 #include <vector>
  32 #include <assert.h>
  33
  34 #ifndef __CONTEXTOR__
  35 #define __CONTEXTOR__
  36
  37 /**
  38  *      An automatic stack of contexts
  39  *
  40  */
  41 class contextor
  42 {
  43         static int      top;
  44         static int      pile[1024];
  45
  46  public:
  47         contextor(int n)        { top=0; pile[top]=n; } // contructor to be called only once at the
  48                                                                                                 // top level to initialize the stack
  49
  50         contextor()             { assert(top >= 0 && top < 1023); int n = pile[top++]; pile[top] = n;}
  51         ~contextor()            {top--; }
  52
  53         void set(int n) { pile[top] = n; }
  54         int get()       { return pile[top]; }
  55 };
  56
  57 #endif