Annotation of gforth/engine/threaded.h, revision 1.30
1.1 anton 1: /* This file defines a number of threading schemes.
2:
1.27 anton 3: Copyright (C) 1995, 1996,1997,1999,2003,2004 Free Software Foundation, Inc.
1.1 anton 4:
5: This file is part of Gforth.
6:
7: Gforth is free software; you can redistribute it and/or
8: modify it under the terms of the GNU General Public License
9: as published by the Free Software Foundation; either version 2
10: of the License, or (at your option) any later version.
11:
12: This program is distributed in the hope that it will be useful,
13: but WITHOUT ANY WARRANTY; without even the implied warranty of
14: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15: GNU General Public License for more details.
16:
17: You should have received a copy of the GNU General Public License
18: along with this program; if not, write to the Free Software
1.7 anton 19: Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
1.1 anton 20:
21:
22: This files defines macros for threading. Many sets of macros are
23: defined. Functionally they have only one difference: Some implement
24: direct threading, some indirect threading. The other differences are
25: just variations to help GCC generate faster code for various
26: machines.
27:
28: (Well, to tell the truth, there actually is another functional
29: difference in some pathological cases: e.g., a '!' stores into the
30: cell where the next executed word comes from; or, the next word
31: executed comes from the top-of-stack. These differences are one of
32: the reasons why GCC cannot produce the right variation by itself. We
33: chose disallowing such practices and using the added implementation
34: freedom to achieve a significant speedup, because these practices
35: are not common in Forth (I have never heard of or seen anyone using
36: them), and it is easy to circumvent problems: A control flow change
37: will flush any prefetched words; you may want to do a "0
38: drop" before that to write back the top-of-stack cache.)
39:
40: These macro sets are used in the following ways: After translation
41: to C a typical primitive looks like
42:
43: ...
44: {
45: DEF_CA
46: other declarations
47: NEXT_P0;
48: main part of the primitive
49: NEXT_P1;
50: store results to stack
51: NEXT_P2;
52: }
53:
54: DEF_CA and all the NEXT_P* together must implement NEXT; In the main
55: part the instruction pointer can be read with IP, changed with
56: INC_IP(const_inc), and the cell right behind the presently executing
57: word (i.e. the value of *IP) is accessed with NEXT_INST.
58:
59: If a primitive does not fall through the main part, it has to do the
60: rest by itself. If it changes ip, it has to redo NEXT_P0 (perhaps we
61: should define a macro SET_IP).
62:
63: Some primitives (execute, dodefer) do not end with NEXT, but with
64: EXEC(.). If NEXT_P0 has been called earlier, it has to perform
65: "ip=IP;" to ensure that ip has the right value (NEXT_P0 may change
66: it).
67:
68: Finally, there is NEXT1_P1 and NEXT1_P2, which are parts of EXEC
69: (EXEC(XT) could be defined as "cfa=XT; NEXT1_P1; NEXT1_P2;" (is this
70: true?)) and are used for making docol faster.
71:
72: We can define the ways in which these macros are used with a regular
73: expression:
74:
75: For a primitive
76:
77: DEF_CA NEXT_P0 ( IP | INC_IP | NEXT_INST | ip=...; NEXT_P0 ) * ( NEXT_P1 NEXT_P2 | EXEC(...) )
78:
79: For a run-time routine, e.g., docol:
80: PFA1(cfa) ( NEXT_P0 NEXT | cfa=...; NEXT1_P1; NEXT1_P2 | EXEC(...) )
81:
82: This comment does not yet describe all the dependences that the
83: macros have to satisfy.
84:
85: To organize the former ifdef chaos, each path is separated
86: This gives a quite impressive number of paths, but you clearly
87: find things that go together.
88:
89: It should be possible to organize the whole thing in a way that
90: contains less redundancy and allows a simpler description.
91:
92: */
93:
1.29 anton 94: #ifdef GCC_PR15242_WORKAROUND
95: #define DO_GOTO goto before_goto
96: #else
97: #define DO_GOTO goto *real_ca
98: #endif
1.30 ! pazsan 99: #ifndef GOTO_ALIGN
! 100: #define GOTO_ALIGN
! 101: #endif
1.29 anton 102:
1.28 anton 103: #define GOTO(target) do {(real_ca=(target));} while(0)
104: #define NEXT_P2 do {NEXT_P1_5; DO_GOTO;} while(0)
105: #define EXEC(XT) do { EXEC1(XT); DO_GOTO;} while (0)
106: #define NEXT do {DEF_CA NEXT_P1; NEXT_P2;} while(0)
1.30 ! pazsan 107: #define FIRST_NEXT_P2 NEXT_P1_5; GOTO_ALIGN; \
! 108: before_goto: goto *real_ca; after_goto:
! 109: #define FIRST_NEXT DEF_CA NEXT_P1; FIRST_NEXT_P2;
1.28 anton 110: #define IPTOS NEXT_INST
111:
112:
1.1 anton 113: #ifdef DOUBLY_INDIRECT
1.19 pazsan 114: # ifndef DEBUG_DITC
115: # define DEBUG_DITC 0
116: # endif
117: /* define to 1 if you want to check consistency */
1.26 pazsan 118: # define NEXT_P0 do {cfa1=cfa; cfa=*ip;} while(0)
1.23 anton 119: # define CFA cfa1
120: # define MORE_VARS Xt cfa1;
1.1 anton 121: # define IP (ip)
1.26 pazsan 122: # define SET_IP(p) do {ip=(p); cfa=*ip;} while(0)
1.1 anton 123: # define NEXT_INST (cfa)
1.26 pazsan 124: # define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.1 anton 125: # define DEF_CA Label ca;
1.26 pazsan 126: # define NEXT_P1 do {\
1.19 pazsan 127: if (DEBUG_DITC && (cfa<=vm_prims+DOESJUMP || cfa>=vm_prims+npriminfos)) \
128: fprintf(stderr,"NEXT encountered prim %p at ip=%p\n", cfa, ip); \
1.26 pazsan 129: ip++;} while(0)
1.28 anton 130: # define NEXT_P1_5 do {ca=**cfa; GOTO(ca);} while(0)
131: # define EXEC1(XT) do {DEF_CA cfa=(XT);\
1.19 pazsan 132: if (DEBUG_DITC && (cfa>vm_prims+DOESJUMP && cfa<vm_prims+npriminfos)) \
1.14 anton 133: fprintf(stderr,"EXEC encountered xt %p at ip=%p, vm_prims=%p, xts=%p\n", cfa, ip, vm_prims, xts); \
1.28 anton 134: ca=**cfa; GOTO(ca);} while(0)
1.1 anton 135:
1.16 anton 136: #elif defined(NO_IP)
137:
138: #define NEXT_P0
1.25 anton 139: # define CFA cfa
1.16 anton 140: #define SET_IP(target) assert(0)
141: #define INC_IP(n) ((void)0)
142: #define DEF_CA
143: #define NEXT_P1
1.28 anton 144: #define NEXT_P1_5 do {goto *next_code;} while(0)
1.16 anton 145: /* set next_code to the return address before performing EXEC */
1.28 anton 146: #define EXEC1(XT) do {cfa=(XT); goto **cfa;} while(0)
1.16 anton 147:
148: #else /* !defined(DOUBLY_INDIRECT) && !defined(NO_IP) */
1.1 anton 149:
1.3 anton 150: #if defined(DIRECT_THREADED)
151:
1.17 anton 152: /* This lets the compiler know that cfa is dead before; we place it at
153: "goto *"s that perform direct threaded dispatch (i.e., not EXECUTE
154: etc.), and thus do not reach doers, which would use cfa; the only
155: way to a doer is through EXECUTE etc., which set the cfa
156: themselves.
157:
158: Some of these direct threaded schemes use "cfa" to hold the code
159: address in normal direct threaded code. Of course we cannot use
160: KILLS there.
161:
162: KILLS works by having an empty asm instruction, and claiming to the
163: compiler that it writes to cfa.
164:
165: KILLS is optional. You can write
166:
167: #define KILLS
168:
169: and lose just a little performance.
170: */
171: #define KILLS asm("":"=X"(cfa));
172:
1.20 anton 173: #ifndef THREADING_SCHEME
1.24 anton 174: #define THREADING_SCHEME 7
1.20 anton 175: #endif
176:
1.3 anton 177: #if THREADING_SCHEME==1
178: #warning direct threading scheme 1: autoinc, long latency, cfa live
1.26 pazsan 179: # define NEXT_P0 do {cfa1=cfa; cfa=*ip++;} while(0)
1.23 anton 180: # define CFA cfa1
181: # define MORE_VARS Xt cfa1;
1.1 anton 182: # define IP (ip-1)
1.26 pazsan 183: # define SET_IP(p) do {ip=(p); cfa=*ip++;} while(0)
1.1 anton 184: # define NEXT_INST (cfa)
1.26 pazsan 185: # define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.1 anton 186: # define DEF_CA
187: # define NEXT_P1
1.28 anton 188: # define NEXT_P1_5 do {GOTO(cfa);} while(0)
189: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 190: #endif
191:
1.3 anton 192: #if THREADING_SCHEME==2
193: #warning direct threading scheme 2: autoinc, long latency, cfa dead
1.1 anton 194: # define NEXT_P0 (ip++)
1.23 anton 195: # define CFA cfa
1.1 anton 196: # define IP (ip-1)
1.26 pazsan 197: # define SET_IP(p) do {ip=(p); NEXT_P0;} while(0)
1.1 anton 198: # define NEXT_INST (*(ip-1))
1.26 pazsan 199: # define INC_IP(const_inc) do { ip+=(const_inc);} while(0)
1.1 anton 200: # define DEF_CA
201: # define NEXT_P1
1.28 anton 202: # define NEXT_P1_5 do {KILLS GOTO(*(ip-1));} while(0)
203: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 204: #endif
205:
206:
1.3 anton 207: #if THREADING_SCHEME==3
208: #warning direct threading scheme 3: autoinc, low latency, cfa live
1.1 anton 209: # define NEXT_P0
1.23 anton 210: # define CFA cfa
1.1 anton 211: # define IP (ip)
1.26 pazsan 212: # define SET_IP(p) do {ip=(p); NEXT_P0;} while(0)
1.1 anton 213: # define NEXT_INST (*ip)
1.26 pazsan 214: # define INC_IP(const_inc) do {ip+=(const_inc);} while(0)
1.1 anton 215: # define DEF_CA
1.26 pazsan 216: # define NEXT_P1 do {cfa=*ip++;} while(0)
1.28 anton 217: # define NEXT_P1_5 do {GOTO(cfa);} while(0)
218: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 219: #endif
220:
1.3 anton 221: #if THREADING_SCHEME==4
222: #warning direct threading scheme 4: autoinc, low latency, cfa dead
1.1 anton 223: # define NEXT_P0
1.23 anton 224: # define CFA cfa
1.1 anton 225: # define IP (ip)
1.26 pazsan 226: # define SET_IP(p) do {ip=(p); NEXT_P0;} while(0)
1.1 anton 227: # define NEXT_INST (*ip)
1.26 pazsan 228: # define INC_IP(const_inc) do { ip+=(const_inc);} while(0)
1.1 anton 229: # define DEF_CA
230: # define NEXT_P1
1.28 anton 231: # define NEXT_P1_5 do {KILLS GOTO(*(ip++));} while(0)
232: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 233: #endif
234:
1.3 anton 235: #if THREADING_SCHEME==5
236: #warning direct threading scheme 5: long latency, cfa live
1.26 pazsan 237: # define NEXT_P0 do {cfa1=cfa; cfa=*ip;} while(0)
1.23 anton 238: # define CFA cfa1
239: # define MORE_VARS Xt cfa1;
1.1 anton 240: # define IP (ip)
1.26 pazsan 241: # define SET_IP(p) do {ip=(p); cfa=*ip;} while(0)
1.1 anton 242: # define NEXT_INST (cfa)
1.26 pazsan 243: # define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.1 anton 244: # define DEF_CA
245: # define NEXT_P1 (ip++)
1.28 anton 246: # define NEXT_P1_5 do {GOTO(cfa);} while(0)
247: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 248: #endif
249:
1.3 anton 250: #if THREADING_SCHEME==6
251: #warning direct threading scheme 6: long latency, cfa dead
1.1 anton 252: # define NEXT_P0
1.23 anton 253: # define CFA cfa
1.1 anton 254: # define IP (ip)
1.26 pazsan 255: # define SET_IP(p) do {ip=(p); NEXT_P0;} while(0)
1.1 anton 256: # define NEXT_INST (*ip)
1.26 pazsan 257: # define INC_IP(const_inc) do {ip+=(const_inc);} while(0)
1.1 anton 258: # define DEF_CA
259: # define NEXT_P1 (ip++)
1.28 anton 260: # define NEXT_P1_5 do {KILLS GOTO(*(ip-1));} while(0)
261: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 262: #endif
263:
264:
1.3 anton 265: #if THREADING_SCHEME==7
266: #warning direct threading scheme 7: low latency, cfa live
1.1 anton 267: # define NEXT_P0
1.23 anton 268: # define CFA cfa
1.1 anton 269: # define IP (ip)
1.26 pazsan 270: # define SET_IP(p) do {ip=(p); NEXT_P0;} while(0)
1.1 anton 271: # define NEXT_INST (*ip)
1.26 pazsan 272: # define INC_IP(const_inc) do {ip+=(const_inc);} while(0)
1.1 anton 273: # define DEF_CA
1.26 pazsan 274: # define NEXT_P1 do {cfa=*ip++;} while(0)
1.28 anton 275: # define NEXT_P1_5 do {GOTO(cfa);} while(0)
276: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 277: #endif
278:
1.3 anton 279: #if THREADING_SCHEME==8
280: #warning direct threading scheme 8: cfa dead, i386 hack
1.1 anton 281: # define NEXT_P0
1.23 anton 282: # define CFA cfa
1.1 anton 283: # define IP (ip)
1.26 pazsan 284: # define SET_IP(p) do {ip=(p); NEXT_P0;} while(0)
1.1 anton 285: # define NEXT_INST (*IP)
1.26 pazsan 286: # define INC_IP(const_inc) do { ip+=(const_inc);} while(0)
1.1 anton 287: # define DEF_CA
288: # define NEXT_P1 (ip++)
1.28 anton 289: # define NEXT_P1_5 do {KILLS GOTO(*(ip-1));} while(0)
290: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 291: #endif
292:
1.3 anton 293: #if THREADING_SCHEME==9
294: #warning direct threading scheme 9: Power/PPC hack, long latency
295: /* Power uses a prepare-to-branch instruction, and the latency between
296: this inst and the branch is 5 cycles on a PPC604; so we utilize this
297: to do some prefetching in between */
298: # define NEXT_P0
1.23 anton 299: # define CFA cfa
1.3 anton 300: # define IP ip
1.26 pazsan 301: # define SET_IP(p) do {ip=(p); next_cfa=*ip; NEXT_P0;} while(0)
1.3 anton 302: # define NEXT_INST (next_cfa)
1.26 pazsan 303: # define INC_IP(const_inc) do {next_cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.8 anton 304: # define DEF_CA
1.26 pazsan 305: # define NEXT_P1 do {cfa=next_cfa; ip++; next_cfa=*ip;} while(0)
1.28 anton 306: # define NEXT_P1_5 do {GOTO(cfa);} while(0)
307: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.3 anton 308: # define MORE_VARS Xt next_cfa;
309: #endif
1.1 anton 310:
1.3 anton 311: #if THREADING_SCHEME==10
312: #warning direct threading scheme 10: plain (no attempt at scheduling)
313: # define NEXT_P0
1.23 anton 314: # define CFA cfa
1.3 anton 315: # define IP (ip)
1.26 pazsan 316: # define SET_IP(p) do {ip=(p); NEXT_P0;} while(0)
1.3 anton 317: # define NEXT_INST (*ip)
1.26 pazsan 318: # define INC_IP(const_inc) do {ip+=(const_inc);} while(0)
1.3 anton 319: # define DEF_CA
320: # define NEXT_P1
1.28 anton 321: # define NEXT_P1_5 do {cfa=*ip++; GOTO(cfa);} while(0)
322: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.3 anton 323: #endif
1.1 anton 324:
1.3 anton 325: /* direct threaded */
326: #else
1.1 anton 327: /* indirect THREADED */
1.20 anton 328:
329: #ifndef THREADING_SCHEME
330: #define THREADING_SCHEME 6
331: #endif
1.1 anton 332:
1.3 anton 333: #if THREADING_SCHEME==1
334: #warning indirect threading scheme 1: autoinc, long latency, cisc
1.26 pazsan 335: # define NEXT_P0 do {cfa1=cfa; cfa=*ip++;} while(0)
1.23 anton 336: # define CFA cfa1
337: # define MORE_VARS Xt cfa1;
1.1 anton 338: # define IP (ip-1)
1.26 pazsan 339: # define SET_IP(p) do {ip=(p); cfa=*ip++;} while(0)
1.1 anton 340: # define NEXT_INST (cfa)
1.26 pazsan 341: # define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.1 anton 342: # define DEF_CA
343: # define NEXT_P1
1.28 anton 344: # define NEXT_P1_5 do {GOTO(*cfa);} while(0)
345: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 346: #endif
347:
1.3 anton 348: #if THREADING_SCHEME==2
349: #warning indirect threading scheme 2: autoinc, long latency
1.26 pazsan 350: # define NEXT_P0 do {cfa1=cfa; cfa=*ip++;} while(0)
1.23 anton 351: # define CFA cfa1
352: # define MORE_VARS Xt cfa1;
1.1 anton 353: # define IP (ip-1)
1.26 pazsan 354: # define SET_IP(p) do {ip=(p); cfa=*ip++;} while(0)
1.1 anton 355: # define NEXT_INST (cfa)
1.26 pazsan 356: # define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.1 anton 357: # define DEF_CA Label ca;
1.26 pazsan 358: # define NEXT_P1 do {ca=*cfa;} while(0)
1.28 anton 359: # define NEXT_P1_5 do {GOTO(ca);} while(0)
360: # define EXEC1(XT) do {DEF_CA cfa=(XT); ca=*cfa; GOTO(ca);} while(0)
1.1 anton 361: #endif
362:
363:
1.3 anton 364: #if THREADING_SCHEME==3
365: #warning indirect threading scheme 3: autoinc, low latency, cisc
1.1 anton 366: # define NEXT_P0
1.23 anton 367: # define CFA cfa
1.1 anton 368: # define IP (ip)
1.26 pazsan 369: # define SET_IP(p) do {ip=(p); NEXT_P0;} while(0)
1.1 anton 370: # define NEXT_INST (*ip)
1.26 pazsan 371: # define INC_IP(const_inc) do {ip+=(const_inc);} while(0)
1.1 anton 372: # define DEF_CA
373: # define NEXT_P1
1.28 anton 374: # define NEXT_P1_5 do {cfa=*ip++; GOTO(*cfa);} while(0)
375: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 376: #endif
377:
1.3 anton 378: #if THREADING_SCHEME==4
379: #warning indirect threading scheme 4: autoinc, low latency
1.26 pazsan 380: # define NEXT_P0 do {cfa1=cfa; cfa=*ip++;} while(0)
1.23 anton 381: # define CFA cfa1
382: # define MORE_VARS Xt cfa1;
1.1 anton 383: # define IP (ip-1)
1.26 pazsan 384: # define SET_IP(p) do {ip=(p); cfa=*ip++;} while(0)
1.1 anton 385: # define NEXT_INST (cfa)
1.26 pazsan 386: # define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.1 anton 387: # define DEF_CA Label ca;
1.26 pazsan 388: # define NEXT_P1 do {ca=*cfa;} while(0)
1.28 anton 389: # define NEXT_P1_5 do {GOTO(ca);} while(0)
390: # define EXEC1(XT) do {DEF_CA cfa=(XT); ca=*cfa; GOTO(ca);} while(0)
1.1 anton 391: #endif
392:
393:
1.3 anton 394: #if THREADING_SCHEME==5
395: #warning indirect threading scheme 5: long latency, cisc
1.26 pazsan 396: # define NEXT_P0 do {cfa1=cfa; cfa=*ip;} while(0)
1.23 anton 397: # define CFA cfa1
398: # define MORE_VARS Xt cfa1;
1.1 anton 399: # define IP (ip)
1.26 pazsan 400: # define SET_IP(p) do {ip=(p); cfa=*ip;} while(0)
1.1 anton 401: # define NEXT_INST (cfa)
1.26 pazsan 402: # define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.1 anton 403: # define DEF_CA
404: # define NEXT_P1 (ip++)
1.28 anton 405: # define NEXT_P1_5 do {GOTO(*cfa);} while(0)
406: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 407: #endif
408:
1.3 anton 409: #if THREADING_SCHEME==6
410: #warning indirect threading scheme 6: long latency
1.26 pazsan 411: # define NEXT_P0 do {cfa1=cfa; cfa=*ip;} while(0)
1.23 anton 412: # define CFA cfa1
413: # define MORE_VARS Xt cfa1;
1.1 anton 414: # define IP (ip)
1.26 pazsan 415: # define SET_IP(p) do {ip=(p); cfa=*ip;} while(0)
1.1 anton 416: # define NEXT_INST (cfa)
1.26 pazsan 417: # define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.1 anton 418: # define DEF_CA Label ca;
1.26 pazsan 419: # define NEXT_P1 do {ip++; ca=*cfa;} while(0)
1.28 anton 420: # define NEXT_P1_5 do {GOTO(ca);} while(0)
421: # define EXEC1(XT) do {DEF_CA cfa=(XT); ca=*cfa; GOTO(ca);} while(0)
1.1 anton 422: #endif
423:
1.3 anton 424: #if THREADING_SCHEME==7
425: #warning indirect threading scheme 7: low latency
1.26 pazsan 426: # define NEXT_P0 do {cfa1=cfa; cfa=*ip;} while(0)
1.23 anton 427: # define CFA cfa1
428: # define MORE_VARS Xt cfa1;
1.3 anton 429: # define IP (ip)
1.26 pazsan 430: # define SET_IP(p) do {ip=(p); cfa=*ip;} while(0)
1.3 anton 431: # define NEXT_INST (cfa)
1.26 pazsan 432: # define INC_IP(const_inc) do {cfa=IP[const_inc]; ip+=(const_inc);} while(0)
1.3 anton 433: # define DEF_CA Label ca;
1.26 pazsan 434: # define NEXT_P1 do {ip++; ca=*cfa;} while(0)
1.28 anton 435: # define NEXT_P1_5 do {GOTO(ca);} while(0)
436: # define EXEC1(XT) do {DEF_CA cfa=(XT); ca=*cfa; GOTO(ca);} while(0)
1.3 anton 437: #endif
1.1 anton 438:
1.3 anton 439: #if THREADING_SCHEME==8
440: #warning indirect threading scheme 8: low latency,cisc
1.1 anton 441: # define NEXT_P0
1.23 anton 442: # define CFA cfa
1.1 anton 443: # define IP (ip)
1.26 pazsan 444: # define SET_IP(p) do {ip=(p); NEXT_P0;} while(0)
1.1 anton 445: # define NEXT_INST (*ip)
1.26 pazsan 446: # define INC_IP(const_inc) do {ip+=(const_inc);} while(0)
1.1 anton 447: # define DEF_CA
448: # define NEXT_P1
1.28 anton 449: # define NEXT_P1_5 do {cfa=*ip++; GOTO(*cfa);} while(0)
450: # define EXEC1(XT) do {cfa=(XT); GOTO(*cfa);} while(0)
1.1 anton 451: #endif
452:
1.3 anton 453: /* indirect threaded */
1.1 anton 454: #endif
455:
1.16 anton 456: #endif /* !defined(DOUBLY_INDIRECT) && !defined(NO_IP) */
1.1 anton 457:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to threaded.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [gforth] / gforth / engine