--- gforth/engine/threaded.h 2001/12/09 19:12:46 1.12 +++ gforth/engine/threaded.h 2007/12/31 18:40:25 1.38 @@ -1,12 +1,12 @@ /* This file defines a number of threading schemes. - Copyright (C) 1995, 1996,1997,1999 Free Software Foundation, Inc. + Copyright (C) 1995, 1996,1997,1999,2003,2004,2005,2007 Free Software Foundation, Inc. This file is part of Gforth. Gforth is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License - as published by the Free Software Foundation; either version 2 + as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, @@ -15,8 +15,7 @@ GNU General Public License for more details. You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. + along with this program; if not, see http://www.gnu.org/licenses/. This files defines macros for threading. Many sets of macros are @@ -91,306 +90,132 @@ */ -/* CFA_NEXT: if NEXT uses cfa, you have to #define CFA_NEXT, to get - * cfa declared in engine. - */ +#if !defined(GCC_PR15242_WORKAROUND) +#if __GNUC__ == 3 +/* various gcc-3.x version have problems (including PR15242) that are + solved with this workaround */ +#define GCC_PR15242_WORKAROUND 1 +#else +/* other gcc versions are better off without the workaround for + primitives that are not relocatable */ +#define GCC_PR15242_WORKAROUND 0 +#endif +#endif + +#if GCC_PR15242_WORKAROUND +#define DO_GOTO goto before_goto +#else +#define DO_GOTO goto *real_ca +#endif + +#ifndef GOTO_ALIGN +#define GOTO_ALIGN +#endif + +#define GOTO(target) do {(real_ca=(target));} while(0) +#define NEXT_P2 do {NEXT_P1_5; DO_GOTO;} while(0) +#define EXEC(XT) do { real_ca=EXEC1(XT); DO_GOTO;} while (0) +#define VM_JUMP(target) do {GOTO(target);} while (0) +#define NEXT do {DEF_CA NEXT_P1; NEXT_P2;} while(0) +#define FIRST_NEXT_P2 NEXT_P1_5; GOTO_ALIGN; \ +before_goto: goto *real_ca; after_goto: +#define FIRST_NEXT do {DEF_CA NEXT_P1; FIRST_NEXT_P2;} while(0) +#define IPTOS NEXT_INST + #ifdef DOUBLY_INDIRECT -# define CFA_NEXT -# define NEXT_P0 ({cfa=*ip;}) +# ifndef DEBUG_DITC +# define DEBUG_DITC 0 +# endif +/* define to 1 if you want to check consistency */ +# define NEXT_P0 do {cfa1=cfa; cfa=*ip;} while(0) +# define CFA cfa1 +# define MORE_VARS Xt cfa1; # define IP (ip) -# define SET_IP(p) ({ip=(p); NEXT_P0;}) +# define SET_IP(p) do {ip=(p); cfa=*ip;} while(0) # define NEXT_INST (cfa) -# define INC_IP(const_inc) ({cfa=IP[const_inc]; ip+=(const_inc);}) +# define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0) # define DEF_CA Label ca; -# define NEXT_P1 ({ip++; ca=**cfa;}) -# define NEXT_P2 ({goto *ca;}) -# define EXEC(XT) ({DEF_CA cfa=(XT); ca=**cfa; goto *ca;}) -# define NEXT1_P1 ({ca = **cfa;}) -# define NEXT1_P2 ({goto *ca;}) +# define NEXT_P1 do {\ + if (DEBUG_DITC && (cfa<=vm_prims+DOESJUMP || cfa>=vm_prims+npriminfos)) \ + fprintf(stderr,"NEXT encountered prim %p at ip=%p\n", cfa, ip); \ + ip++;} while(0) +# define NEXT_P1_5 do {ca=**cfa; GOTO(ca);} while(0) +# define EXEC1(XT) ({DEF_CA cfa=(XT);\ + if (DEBUG_DITC && (cfa>vm_prims+DOESJUMP && cfa