source: to-imperative/trunk/runtime/rf_macros.hh @ 185

#ifndef __rf_macros_hh__
#define __rf_macros_hh__

namespace rfrt
{

#define ID(x) x
#define CID(x) x const
#define CRID(x) x const&
#define push_args(args...) (CRID(Stack))stack,##args
#define decl_args(args...) CID(Arg) ##args
#define decl_ress(args...) ID(Result) ,##args
#define pop_ress(args...) stack,##args
#define RM_PAREN(x...) x

#if 1
#define RF_CALL(f,args,ress) ({\
  Expr* __saved_top1 = stack.get_top(); \
  push_args args; \
  stack.set_top(__saved_top1); \
  RetVal __retval; \
  rf_func_t __p = (rf_func_t)(&rf_##f); \
  while (true) { \
    __retval = (*__p)(); \
    if (!__retval.is_tail()) break; \
    __p = __retval.get_ptr(); \
  } \
  if (__retval) {\
    stack.set_top(__saved_top1); \
    pop_ress ress; \
    stack.set_top(__saved_top1); \
  } \
  (bool)__retval; \
})

#else // Disable tail recursion

#define RF_CALL(f,args,ress) ({\
  Expr* __saved_top1 = stack.get_top(); \
  push_args args; \
  stack.set_top(__saved_top1); \
  RetVal __retval = rf_##f(); \
  if (__retval) {\
    stack.set_top(__saved_top1); \
    pop_ress ress; \
    stack.set_top(__saved_top1); \
  } \
  (bool)__retval; \
})

#endif

#define RF_TAILCALL(f,args,ress) \
  stack.set_top(__saved_top); \
  push_args args; \
  stack.set_top(__saved_top); \
  return (rf_func_t)rf_##f;

#define RF_FUNC(f,args,ress) \
  extern "C" RetVal rf_##f (void) { \
    Expr* __saved_top = stack.get_top(); \
    RM_PAREN args; \
    stack.set_top(__saved_top); \
    RM_PAREN ress;

#define RF_DECL(f) \
  extern "C" RetVal rf_##f (void)

#define RF_ARG Arg
#define RF_RES Result

#define RF_END \
    return true; \
  }

#define retfail \
  return __saved_top

#define func_decl(f) \
  extern "C" RetVal rf_##f ()

#define trap \
  Expr* __trap_top = stack.get_top(); try

#define with catch (Expr const& err)

#define cleanup stack.destroy_results(__trap_top)

#define error(x) throw Expr(x)

}

#endif // __rf_macros_hh__