bytecode.c 44.6 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Execution of byte code produced by bytecomp.el.
Paul Eggert's avatar
Paul Eggert committed
2
   Copyright (C) 1985-1988, 1993, 2000-2015 Free Software Foundation,
3
   Inc.
Jim Blandy's avatar
Jim Blandy committed
4 5 6

This file is part of GNU Emacs.

7
GNU Emacs is free software: you can redistribute it and/or modify
Jim Blandy's avatar
Jim Blandy committed
8
it under the terms of the GNU General Public License as published by
9 10
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Jim Blandy's avatar
Jim Blandy committed
11 12 13 14 15 16 17

GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
18
along with GNU Emacs.  If not, see <http://www.gnu.org/licenses/>.  */
Jim Blandy's avatar
Jim Blandy committed
19

20
/*
21
hacked on by jwz@lucid.com 17-jun-91
Jim Blandy's avatar
Jim Blandy committed
22 23
  o  added a compile-time switch to turn on simple sanity checking;
  o  put back the obsolete byte-codes for error-detection;
24
  o  added a new instruction, unbind_all, which I will use for
Jim Blandy's avatar
Jim Blandy committed
25
     tail-recursion elimination;
26
  o  made temp_output_buffer_show be called with the right number
Jim Blandy's avatar
Jim Blandy committed
27 28 29 30 31
     of args;
  o  made the new bytecodes be called with args in the right order;
  o  added metering support.

by Hallvard:
32
  o  added relative jump instructions;
Jim Blandy's avatar
Jim Blandy committed
33 34 35
  o  all conditionals now only do QUIT if they jump.
 */

36
#include <config.h>
37

Jim Blandy's avatar
Jim Blandy committed
38
#include "lisp.h"
Paul Eggert's avatar
Paul Eggert committed
39
#include "blockinput.h"
40
#include "character.h"
41
#include "buffer.h"
Paul Eggert's avatar
Paul Eggert committed
42
#include "keyboard.h"
Jim Blandy's avatar
Jim Blandy committed
43
#include "syntax.h"
Stefan Monnier's avatar
Stefan Monnier committed
44
#include "window.h"
Jim Blandy's avatar
Jim Blandy committed
45

46 47 48 49 50
#ifdef CHECK_FRAME_FONT
#include "frame.h"
#include "xterm.h"
#endif

51
/*
52
 * define BYTE_CODE_SAFE to enable some minor sanity checking (useful for
53 54
 * debugging the byte compiler...)
 *
55
 * define BYTE_CODE_METER to enable generation of a byte-op usage histogram.
Jim Blandy's avatar
Jim Blandy committed
56
 */
57 58
/* #define BYTE_CODE_SAFE */
/* #define BYTE_CODE_METER */
Jim Blandy's avatar
Jim Blandy committed
59

Tom Tromey's avatar
Tom Tromey committed
60 61 62 63
/* If BYTE_CODE_THREADED is defined, then the interpreter will be
   indirect threaded, using GCC's computed goto extension.  This code,
   as currently implemented, is incompatible with BYTE_CODE_SAFE and
   BYTE_CODE_METER.  */
Paul Eggert's avatar
Paul Eggert committed
64 65
#if (defined __GNUC__ && !defined __STRICT_ANSI__ \
     && !defined BYTE_CODE_SAFE && !defined BYTE_CODE_METER)
Tom Tromey's avatar
Tom Tromey committed
66 67 68
#define BYTE_CODE_THREADED
#endif

Jim Blandy's avatar
Jim Blandy committed
69 70 71

#ifdef BYTE_CODE_METER

72 73
#define METER_2(code1, code2) AREF (AREF (Vbyte_code_meter, code1), code2)
#define METER_1(code) METER_2 (0, code)
74

75 76 77 78
#define METER_CODE(last_code, this_code)				\
{									\
  if (byte_metering_on)							\
    {									\
79 80 81
      if (XFASTINT (METER_1 (this_code)) < MOST_POSITIVE_FIXNUM)	\
        XSETFASTINT (METER_1 (this_code),				\
		     XFASTINT (METER_1 (this_code)) + 1);		\
82
      if (last_code							\
83 84 85 86
	  && (XFASTINT (METER_2 (last_code, this_code))			\
	      < MOST_POSITIVE_FIXNUM))					\
        XSETFASTINT (METER_2 (last_code, this_code),			\
		     XFASTINT (METER_2 (last_code, this_code)) + 1);	\
87
    }									\
88
}
Jim Blandy's avatar
Jim Blandy committed
89

90
#endif /* BYTE_CODE_METER */
Jim Blandy's avatar
Jim Blandy committed
91 92 93 94


/*  Byte codes: */

Tom Tromey's avatar
Tom Tromey committed
95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144
#define BYTE_CODES							\
DEFINE (Bstack_ref, 0) /* Actually, Bstack_ref+0 is not implemented: use dup.  */ \
DEFINE (Bstack_ref1, 1)							\
DEFINE (Bstack_ref2, 2)							\
DEFINE (Bstack_ref3, 3)							\
DEFINE (Bstack_ref4, 4)							\
DEFINE (Bstack_ref5, 5)							\
DEFINE (Bstack_ref6, 6)							\
DEFINE (Bstack_ref7, 7)							\
DEFINE (Bvarref, 010)							\
DEFINE (Bvarref1, 011)							\
DEFINE (Bvarref2, 012)							\
DEFINE (Bvarref3, 013)							\
DEFINE (Bvarref4, 014)							\
DEFINE (Bvarref5, 015)							\
DEFINE (Bvarref6, 016)							\
DEFINE (Bvarref7, 017)							\
DEFINE (Bvarset, 020)							\
DEFINE (Bvarset1, 021)							\
DEFINE (Bvarset2, 022)							\
DEFINE (Bvarset3, 023)							\
DEFINE (Bvarset4, 024)							\
DEFINE (Bvarset5, 025)							\
DEFINE (Bvarset6, 026)							\
DEFINE (Bvarset7, 027)							\
DEFINE (Bvarbind, 030)							\
DEFINE (Bvarbind1, 031)							\
DEFINE (Bvarbind2, 032)							\
DEFINE (Bvarbind3, 033)							\
DEFINE (Bvarbind4, 034)							\
DEFINE (Bvarbind5, 035)							\
DEFINE (Bvarbind6, 036)							\
DEFINE (Bvarbind7, 037)							\
DEFINE (Bcall, 040)							\
DEFINE (Bcall1, 041)							\
DEFINE (Bcall2, 042)							\
DEFINE (Bcall3, 043)							\
DEFINE (Bcall4, 044)							\
DEFINE (Bcall5, 045)							\
DEFINE (Bcall6, 046)							\
DEFINE (Bcall7, 047)							\
DEFINE (Bunbind, 050)							\
DEFINE (Bunbind1, 051)							\
DEFINE (Bunbind2, 052)							\
DEFINE (Bunbind3, 053)							\
DEFINE (Bunbind4, 054)							\
DEFINE (Bunbind5, 055)							\
DEFINE (Bunbind6, 056)							\
DEFINE (Bunbind7, 057)							\
									\
145 146 147 148
DEFINE (Bpophandler, 060)						\
DEFINE (Bpushconditioncase, 061)					\
DEFINE (Bpushcatch, 062)						\
									\
Tom Tromey's avatar
Tom Tromey committed
149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291
DEFINE (Bnth, 070)							\
DEFINE (Bsymbolp, 071)							\
DEFINE (Bconsp, 072)							\
DEFINE (Bstringp, 073)							\
DEFINE (Blistp, 074)							\
DEFINE (Beq, 075)							\
DEFINE (Bmemq, 076)							\
DEFINE (Bnot, 077)							\
DEFINE (Bcar, 0100)							\
DEFINE (Bcdr, 0101)							\
DEFINE (Bcons, 0102)							\
DEFINE (Blist1, 0103)							\
DEFINE (Blist2, 0104)							\
DEFINE (Blist3, 0105)							\
DEFINE (Blist4, 0106)							\
DEFINE (Blength, 0107)							\
DEFINE (Baref, 0110)							\
DEFINE (Baset, 0111)							\
DEFINE (Bsymbol_value, 0112)						\
DEFINE (Bsymbol_function, 0113)						\
DEFINE (Bset, 0114)							\
DEFINE (Bfset, 0115)							\
DEFINE (Bget, 0116)							\
DEFINE (Bsubstring, 0117)						\
DEFINE (Bconcat2, 0120)							\
DEFINE (Bconcat3, 0121)							\
DEFINE (Bconcat4, 0122)							\
DEFINE (Bsub1, 0123)							\
DEFINE (Badd1, 0124)							\
DEFINE (Beqlsign, 0125)							\
DEFINE (Bgtr, 0126)							\
DEFINE (Blss, 0127)							\
DEFINE (Bleq, 0130)							\
DEFINE (Bgeq, 0131)							\
DEFINE (Bdiff, 0132)							\
DEFINE (Bnegate, 0133)							\
DEFINE (Bplus, 0134)							\
DEFINE (Bmax, 0135)							\
DEFINE (Bmin, 0136)							\
DEFINE (Bmult, 0137)							\
									\
DEFINE (Bpoint, 0140)							\
/* Was Bmark in v17.  */						\
DEFINE (Bsave_current_buffer, 0141) /* Obsolete.  */			\
DEFINE (Bgoto_char, 0142)						\
DEFINE (Binsert, 0143)							\
DEFINE (Bpoint_max, 0144)						\
DEFINE (Bpoint_min, 0145)						\
DEFINE (Bchar_after, 0146)						\
DEFINE (Bfollowing_char, 0147)						\
DEFINE (Bpreceding_char, 0150)						\
DEFINE (Bcurrent_column, 0151)						\
DEFINE (Bindent_to, 0152)						\
DEFINE (Beolp, 0154)							\
DEFINE (Beobp, 0155)							\
DEFINE (Bbolp, 0156)							\
DEFINE (Bbobp, 0157)							\
DEFINE (Bcurrent_buffer, 0160)						\
DEFINE (Bset_buffer, 0161)						\
DEFINE (Bsave_current_buffer_1, 0162) /* Replacing Bsave_current_buffer.  */ \
DEFINE (Binteractive_p, 0164) /* Obsolete since Emacs-24.1.  */		\
									\
DEFINE (Bforward_char, 0165)						\
DEFINE (Bforward_word, 0166)						\
DEFINE (Bskip_chars_forward, 0167)					\
DEFINE (Bskip_chars_backward, 0170)					\
DEFINE (Bforward_line, 0171)						\
DEFINE (Bchar_syntax, 0172)						\
DEFINE (Bbuffer_substring, 0173)					\
DEFINE (Bdelete_region, 0174)						\
DEFINE (Bnarrow_to_region, 0175)					\
DEFINE (Bwiden, 0176)							\
DEFINE (Bend_of_line, 0177)						\
									\
DEFINE (Bconstant2, 0201)						\
DEFINE (Bgoto, 0202)							\
DEFINE (Bgotoifnil, 0203)						\
DEFINE (Bgotoifnonnil, 0204)						\
DEFINE (Bgotoifnilelsepop, 0205)					\
DEFINE (Bgotoifnonnilelsepop, 0206)					\
DEFINE (Breturn, 0207)							\
DEFINE (Bdiscard, 0210)							\
DEFINE (Bdup, 0211)							\
									\
DEFINE (Bsave_excursion, 0212)						\
DEFINE (Bsave_window_excursion, 0213) /* Obsolete since Emacs-24.1.  */	\
DEFINE (Bsave_restriction, 0214)					\
DEFINE (Bcatch, 0215)							\
									\
DEFINE (Bunwind_protect, 0216)						\
DEFINE (Bcondition_case, 0217)						\
DEFINE (Btemp_output_buffer_setup, 0220) /* Obsolete since Emacs-24.1.  */ \
DEFINE (Btemp_output_buffer_show, 0221)  /* Obsolete since Emacs-24.1.  */ \
									\
DEFINE (Bunbind_all, 0222)	/* Obsolete.  Never used.  */		\
									\
DEFINE (Bset_marker, 0223)						\
DEFINE (Bmatch_beginning, 0224)						\
DEFINE (Bmatch_end, 0225)						\
DEFINE (Bupcase, 0226)							\
DEFINE (Bdowncase, 0227)						\
									\
DEFINE (Bstringeqlsign, 0230)						\
DEFINE (Bstringlss, 0231)						\
DEFINE (Bequal, 0232)							\
DEFINE (Bnthcdr, 0233)							\
DEFINE (Belt, 0234)							\
DEFINE (Bmember, 0235)							\
DEFINE (Bassq, 0236)							\
DEFINE (Bnreverse, 0237)						\
DEFINE (Bsetcar, 0240)							\
DEFINE (Bsetcdr, 0241)							\
DEFINE (Bcar_safe, 0242)						\
DEFINE (Bcdr_safe, 0243)						\
DEFINE (Bnconc, 0244)							\
DEFINE (Bquo, 0245)							\
DEFINE (Brem, 0246)							\
DEFINE (Bnumberp, 0247)							\
DEFINE (Bintegerp, 0250)						\
									\
DEFINE (BRgoto, 0252)							\
DEFINE (BRgotoifnil, 0253)						\
DEFINE (BRgotoifnonnil, 0254)						\
DEFINE (BRgotoifnilelsepop, 0255)					\
DEFINE (BRgotoifnonnilelsepop, 0256)					\
									\
DEFINE (BlistN, 0257)							\
DEFINE (BconcatN, 0260)							\
DEFINE (BinsertN, 0261)							\
									\
/* Bstack_ref is code 0.  */						\
DEFINE (Bstack_set,  0262)						\
DEFINE (Bstack_set2, 0263)						\
DEFINE (BdiscardN,   0266)						\
									\
DEFINE (Bconstant, 0300)

enum byte_code_op
{
#define DEFINE(name, value) name = value,
    BYTE_CODES
#undef DEFINE

292
#ifdef BYTE_CODE_SAFE
Tom Tromey's avatar
Tom Tromey committed
293
    Bscan_buffer = 0153, /* No longer generated as of v18.  */
Paul Eggert's avatar
Paul Eggert committed
294
    Bset_mark = 0163, /* this loser is no longer generated as of v18 */
295
#endif
Tom Tromey's avatar
Tom Tromey committed
296
};
Gerd Moellmann's avatar
Gerd Moellmann committed
297

298 299
/* Whether to maintain a `top' and `bottom' field in the stack frame.  */
#define BYTE_MAINTAIN_TOP (BYTE_CODE_SAFE || BYTE_MARK_STACK)
300

Gerd Moellmann's avatar
Gerd Moellmann committed
301 302 303 304 305 306 307
/* Structure describing a value stack used during byte-code execution
   in Fbyte_code.  */

struct byte_stack
{
  /* Program counter.  This points into the byte_string below
     and is relocated when that string is relocated.  */
308
  const unsigned char *pc;
Gerd Moellmann's avatar
Gerd Moellmann committed
309 310 311

  /* Top and bottom of stack.  The bottom points to an area of memory
     allocated with alloca in Fbyte_code.  */
312
#if BYTE_MAINTAIN_TOP
Gerd Moellmann's avatar
Gerd Moellmann committed
313
  Lisp_Object *top, *bottom;
314
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
315 316 317 318 319

  /* The string containing the byte-code, and its current address.
     Storing this here protects it from GC because mark_byte_stack
     marks it.  */
  Lisp_Object byte_string;
320
  const unsigned char *byte_string_start;
Gerd Moellmann's avatar
Gerd Moellmann committed
321

322
#if BYTE_MARK_STACK
Gerd Moellmann's avatar
Gerd Moellmann committed
323 324 325
  /* The vector of constants used during byte-code execution.  Storing
     this here protects it from GC because mark_byte_stack marks it.  */
  Lisp_Object constants;
326
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
327 328 329 330 331 332 333

  /* Next entry in byte_stack_list.  */
  struct byte_stack *next;
};

/* A list of currently active byte-code execution value stacks.
   Fbyte_code adds an entry to the head of this list before it starts
334
   processing byte-code, and it removes the entry again when it is
Paul Eggert's avatar
Paul Eggert committed
335
   done.  Signaling an error truncates the list analogous to
Gerd Moellmann's avatar
Gerd Moellmann committed
336 337 338 339
   gcprolist.  */

struct byte_stack *byte_stack_list;

340

Gerd Moellmann's avatar
Gerd Moellmann committed
341 342
/* Mark objects on byte_stack_list.  Called during GC.  */

343
#if BYTE_MARK_STACK
Gerd Moellmann's avatar
Gerd Moellmann committed
344
void
345
mark_byte_stack (void)
Gerd Moellmann's avatar
Gerd Moellmann committed
346 347 348 349 350 351
{
  struct byte_stack *stack;
  Lisp_Object *obj;

  for (stack = byte_stack_list; stack; stack = stack->next)
    {
352 353 354 355 356 357 358
      /* If STACK->top is null here, this means there's an opcode in
	 Fbyte_code that wasn't expected to GC, but did.  To find out
	 which opcode this is, record the value of `stack', and walk
	 up the stack in a debugger, stopping in frames of Fbyte_code.
	 The culprit is found in the frame of Fbyte_code where the
	 address of its local variable `stack' is equal to the
	 recorded value of `stack' here.  */
Kenichi Handa's avatar
Kenichi Handa committed
359
      eassert (stack->top);
360

Gerd Moellmann's avatar
Gerd Moellmann committed
361
      for (obj = stack->bottom; obj <= stack->top; ++obj)
Kenichi Handa's avatar
Kenichi Handa committed
362
	mark_object (*obj);
363

Kenichi Handa's avatar
Kenichi Handa committed
364 365
      mark_object (stack->byte_string);
      mark_object (stack->constants);
Gerd Moellmann's avatar
Gerd Moellmann committed
366 367
    }
}
368
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
369

370 371
/* Unmark objects in the stacks on byte_stack_list.  Relocate program
   counters.  Called when GC has completed.  */
Gerd Moellmann's avatar
Gerd Moellmann committed
372

373
void
374
unmark_byte_stack (void)
Gerd Moellmann's avatar
Gerd Moellmann committed
375 376 377 378
{
  struct byte_stack *stack;

  for (stack = byte_stack_list; stack; stack = stack->next)
379
    {
380
      if (stack->byte_string_start != SDATA (stack->byte_string))
381
	{
382
	  ptrdiff_t offset = stack->pc - stack->byte_string_start;
383
	  stack->byte_string_start = SDATA (stack->byte_string);
384 385 386
	  stack->pc = stack->byte_string_start + offset;
	}
    }
Gerd Moellmann's avatar
Gerd Moellmann committed
387 388
}

Jim Blandy's avatar
Jim Blandy committed
389

390
/* Fetch the next byte from the bytecode stream.  */
Jim Blandy's avatar
Jim Blandy committed
391

392 393 394
#ifdef BYTE_CODE_SAFE
#define FETCH (eassert (stack.byte_string_start == SDATA (stack.byte_string)), *stack.pc++)
#else
Gerd Moellmann's avatar
Gerd Moellmann committed
395
#define FETCH *stack.pc++
396
#endif
Jim Blandy's avatar
Jim Blandy committed
397

398
/* Fetch two bytes from the bytecode stream and make a 16-bit number
399
   out of them.  */
Jim Blandy's avatar
Jim Blandy committed
400 401 402

#define FETCH2 (op = FETCH, op + (FETCH << 8))

403 404 405 406
/* Push x onto the execution stack.  This used to be #define PUSH(x)
   (*++stackp = (x)) This oddity is necessary because Alliant can't be
   bothered to compile the preincrement operator properly, as of 4/91.
   -JimB */
Gerd Moellmann's avatar
Gerd Moellmann committed
407 408

#define PUSH(x) (top++, *top = (x))
Jim Blandy's avatar
Jim Blandy committed
409 410 411

/* Pop a value off the execution stack.  */

Gerd Moellmann's avatar
Gerd Moellmann committed
412
#define POP (*top--)
Jim Blandy's avatar
Jim Blandy committed
413 414 415

/* Discard n values from the execution stack.  */

Gerd Moellmann's avatar
Gerd Moellmann committed
416 417 418
#define DISCARD(n) (top -= (n))

/* Get the value which is at the top of the execution stack, but don't
419
   pop it.  */
Gerd Moellmann's avatar
Gerd Moellmann committed
420 421

#define TOP (*top)
Jim Blandy's avatar
Jim Blandy committed
422

423
/* Actions that must be performed before and after calling a function
Gerd Moellmann's avatar
Gerd Moellmann committed
424
   that might GC.  */
Jim Blandy's avatar
Jim Blandy committed
425

426 427 428 429
#if !BYTE_MAINTAIN_TOP
#define BEFORE_POTENTIAL_GC()	((void)0)
#define AFTER_POTENTIAL_GC()	((void)0)
#else
Gerd Moellmann's avatar
Gerd Moellmann committed
430 431
#define BEFORE_POTENTIAL_GC()	stack.top = top
#define AFTER_POTENTIAL_GC()	stack.top = NULL
432
#endif
Jim Blandy's avatar
Jim Blandy committed
433

Richard M. Stallman's avatar
Richard M. Stallman committed
434 435 436
/* Garbage collect if we have consed enough since the last time.
   We do this at every branch, to avoid loops that never GC.  */

437 438 439 440 441
#define MAYBE_GC()		\
  do {				\
   BEFORE_POTENTIAL_GC ();	\
   maybe_gc ();			\
   AFTER_POTENTIAL_GC ();	\
442
 } while (0)
443

444
/* Check for jumping out of range.  */
Gerd Moellmann's avatar
Gerd Moellmann committed
445 446 447

#ifdef BYTE_CODE_SAFE

448
#define CHECK_RANGE(ARG) \
449
  if (ARG >= bytestr_length) emacs_abort ()
450

451
#else /* not BYTE_CODE_SAFE */
Gerd Moellmann's avatar
Gerd Moellmann committed
452 453 454

#define CHECK_RANGE(ARG)

455
#endif /* not BYTE_CODE_SAFE */
Gerd Moellmann's avatar
Gerd Moellmann committed
456

Gerd Moellmann's avatar
Gerd Moellmann committed
457 458 459 460 461 462 463
/* A version of the QUIT macro which makes sure that the stack top is
   set before signaling `quit'.  */

#define BYTE_CODE_QUIT					\
  do {							\
    if (!NILP (Vquit_flag) && NILP (Vinhibit_quit))	\
      {							\
464
        Lisp_Object flag = Vquit_flag;			\
Gerd Moellmann's avatar
Gerd Moellmann committed
465 466
	Vquit_flag = Qnil;				\
        BEFORE_POTENTIAL_GC ();				\
467
	if (EQ (Vthrow_on_input, flag))			\
468
	  Fthrow (Vthrow_on_input, Qt);			\
Gerd Moellmann's avatar
Gerd Moellmann committed
469
	Fsignal (Qquit, Qnil);				\
470
	AFTER_POTENTIAL_GC ();				\
Gerd Moellmann's avatar
Gerd Moellmann committed
471
      }							\
472 473
    else if (pending_signals)				\
      process_pending_signals ();			\
Gerd Moellmann's avatar
Gerd Moellmann committed
474 475
  } while (0)

Gerd Moellmann's avatar
Gerd Moellmann committed
476

Jim Blandy's avatar
Jim Blandy committed
477
DEFUN ("byte-code", Fbyte_code, Sbyte_code, 3, 3, 0,
478 479 480 481 482
       doc: /* Function used internally in byte-compiled code.
The first argument, BYTESTR, is a string of byte code;
the second, VECTOR, a vector of constants;
the third, MAXDEPTH, the maximum stack depth used in this function.
If the third argument is incorrect, Emacs may crash.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
483
  (Lisp_Object bytestr, Lisp_Object vector, Lisp_Object maxdepth)
484
{
485
  return exec_byte_code (bytestr, vector, maxdepth, Qnil, 0, NULL);
486 487
}

488 489 490 491 492 493
static void
bcall0 (Lisp_Object f)
{
  Ffuncall (1, &f);
}

494 495 496 497 498 499 500 501 502
/* Execute the byte-code in BYTESTR.  VECTOR is the constant vector, and
   MAXDEPTH is the maximum stack depth used (if MAXDEPTH is incorrect,
   emacs may crash!).  If ARGS_TEMPLATE is non-nil, it should be a lisp
   argument list (including &rest, &optional, etc.), and ARGS, of size
   NARGS, should be a vector of the actual arguments.  The arguments in
   ARGS are pushed on the stack according to ARGS_TEMPLATE before
   executing BYTESTR.  */

Lisp_Object
Stefan Monnier's avatar
Stefan Monnier committed
503
exec_byte_code (Lisp_Object bytestr, Lisp_Object vector, Lisp_Object maxdepth,
504
		Lisp_Object args_template, ptrdiff_t nargs, Lisp_Object *args)
Jim Blandy's avatar
Jim Blandy committed
505
{
506
  ptrdiff_t count = SPECPDL_INDEX ();
Jim Blandy's avatar
Jim Blandy committed
507
#ifdef BYTE_CODE_METER
508
  int volatile this_op = 0;
Jim Blandy's avatar
Jim Blandy committed
509 510
  int prev_op;
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
511
  int op;
512
  /* Lisp_Object v1, v2; */
513
  Lisp_Object *vectorp;
Jim Blandy's avatar
Jim Blandy committed
514
#ifdef BYTE_CODE_SAFE
515 516 517
  ptrdiff_t const_length;
  Lisp_Object *stacke;
  ptrdiff_t bytestr_length;
518
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
519 520
  struct byte_stack stack;
  Lisp_Object *top;
521
  Lisp_Object result;
522
  enum handlertype type;
Jim Blandy's avatar
Jim Blandy committed
523

524
#if 0 /* CHECK_FRAME_FONT */
525 526 527 528 529
 {
   struct frame *f = SELECTED_FRAME ();
   if (FRAME_X_P (f)
       && FRAME_FONT (f)->direction != 0
       && FRAME_FONT (f)->direction != 1)
530
     emacs_abort ();
531 532 533
 }
#endif

534
  CHECK_STRING (bytestr);
Kim F. Storm's avatar
Kim F. Storm committed
535
  CHECK_VECTOR (vector);
536
  CHECK_NATNUM (maxdepth);
Jim Blandy's avatar
Jim Blandy committed
537

538
#ifdef BYTE_CODE_SAFE
539
  const_length = ASIZE (vector);
540 541
#endif

542 543 544 545 546
  if (STRING_MULTIBYTE (bytestr))
    /* BYTESTR must have been produced by Emacs 20.2 or the earlier
       because they produced a raw 8-bit string for byte-code and now
       such a byte-code string is loaded as multibyte while raw 8-bit
       characters converted to multibyte form.  Thus, now we must
547
       convert them back to the originally intended unibyte form.  */
548
    bytestr = Fstring_as_unibyte (bytestr);
549

550
#ifdef BYTE_CODE_SAFE
551
  bytestr_length = SBYTES (bytestr);
552
#endif
Paul Eggert's avatar
Paul Eggert committed
553
  vectorp = XVECTOR (vector)->contents;
554

Gerd Moellmann's avatar
Gerd Moellmann committed
555
  stack.byte_string = bytestr;
556
  stack.pc = stack.byte_string_start = SDATA (bytestr);
557
#if BYTE_MARK_STACK
Gerd Moellmann's avatar
Gerd Moellmann committed
558
  stack.constants = vector;
559
#endif
560
  if (MAX_ALLOCA / word_size <= XFASTINT (maxdepth))
561
    memory_full (SIZE_MAX);
562
  top = alloca ((XFASTINT (maxdepth) + 1) * sizeof *top);
563
#if BYTE_MAINTAIN_TOP
564
  stack.bottom = top + 1;
Gerd Moellmann's avatar
Gerd Moellmann committed
565
  stack.top = NULL;
566
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
567 568
  stack.next = byte_stack_list;
  byte_stack_list = &stack;
Jim Blandy's avatar
Jim Blandy committed
569

Gerd Moellmann's avatar
Gerd Moellmann committed
570 571 572
#ifdef BYTE_CODE_SAFE
  stacke = stack.bottom - 1 + XFASTINT (maxdepth);
#endif
573

574
  if (INTEGERP (args_template))
575
    {
576
      ptrdiff_t at = XINT (args_template);
577
      bool rest = (at & 128) != 0;
578
      int mandatory = at & 127;
579
      ptrdiff_t nonrest = at >> 8;
580 581 582
      eassert (mandatory <= nonrest);
      if (nargs <= nonrest)
	{
583
	  ptrdiff_t i;
584 585 586 587 588
	  for (i = 0 ; i < nargs; i++, args++)
	    PUSH (*args);
	  if (nargs < mandatory)
	    /* Too few arguments.  */
	    Fsignal (Qwrong_number_of_arguments,
589
		     list2 (Fcons (make_number (mandatory),
590
				   rest ? Qand_rest : make_number (nonrest)),
591
			    make_number (nargs)));
592 593 594 595 596 597 598 599 600 601
	  else
	    {
	      for (; i < nonrest; i++)
		PUSH (Qnil);
	      if (rest)
		PUSH (Qnil);
	    }
	}
      else if (rest)
	{
602
	  ptrdiff_t i;
603 604 605 606 607 608
	  for (i = 0 ; i < nonrest; i++, args++)
	    PUSH (*args);
	  PUSH (Flist (nargs - nonrest, args));
	}
      else
	/* Too many arguments.  */
609
	Fsignal (Qwrong_number_of_arguments,
610 611
		 list2 (Fcons (make_number (mandatory), make_number (nonrest)),
			make_number (nargs)));
612 613 614 615 616
    }
  else if (! NILP (args_template))
    /* We should push some arguments on the stack.  */
    {
      error ("Unknown args template!");
617 618
    }

Jim Blandy's avatar
Jim Blandy committed
619 620 621
  while (1)
    {
#ifdef BYTE_CODE_SAFE
622
      if (top > stacke)
623
	emacs_abort ();
Gerd Moellmann's avatar
Gerd Moellmann committed
624
      else if (top < stack.bottom - 1)
625
	emacs_abort ();
Jim Blandy's avatar
Jim Blandy committed
626 627 628 629 630 631 632
#endif

#ifdef BYTE_CODE_METER
      prev_op = this_op;
      this_op = op = FETCH;
      METER_CODE (prev_op, op);
#else
Tom Tromey's avatar
Tom Tromey committed
633
#ifndef BYTE_CODE_THREADED
634
      op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
635
#endif
Tom Tromey's avatar
Tom Tromey committed
636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677
#endif

      /* The interpreter can be compiled one of two ways: as an
	 ordinary switch-based interpreter, or as a threaded
	 interpreter.  The threaded interpreter relies on GCC's
	 computed goto extension, so it is not available everywhere.
	 Threading provides a performance boost.  These macros are how
	 we allow the code to be compiled both ways.  */
#ifdef BYTE_CODE_THREADED
      /* The CASE macro introduces an instruction's body.  It is
	 either a label or a case label.  */
#define CASE(OP) insn_ ## OP
      /* NEXT is invoked at the end of an instruction to go to the
	 next instruction.  It is either a computed goto, or a
	 plain break.  */
#define NEXT goto *(targets[op = FETCH])
      /* FIRST is like NEXT, but is only used at the start of the
	 interpreter body.  In the switch-based interpreter it is the
	 switch, so the threaded definition must include a semicolon.  */
#define FIRST NEXT;
      /* Most cases are labeled with the CASE macro, above.
	 CASE_DEFAULT is one exception; it is used if the interpreter
	 being built requires a default case.  The threaded
	 interpreter does not, because the dispatch table is
	 completely filled.  */
#define CASE_DEFAULT
      /* This introduces an instruction that is known to call abort.  */
#define CASE_ABORT CASE (Bstack_ref): CASE (default)
#else
      /* See above for the meaning of the various defines.  */
#define CASE(OP) case OP
#define NEXT break
#define FIRST switch (op)
#define CASE_DEFAULT case 255: default:
#define CASE_ABORT case 0
#endif

#ifdef BYTE_CODE_THREADED

      /* A convenience define that saves us a lot of typing and makes
	 the table clearer.  */
#define LABEL(OP) [OP] = &&insn_ ## OP
Jim Blandy's avatar
Jim Blandy committed
678

679
#if 4 < __GNUC__ + (6 <= __GNUC_MINOR__)
680 681
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Woverride-init"
682 683 684
#elif defined __clang__
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Winitializer-overrides"
685 686
#endif

Tom Tromey's avatar
Tom Tromey committed
687 688
      /* This is the dispatch table for the threaded interpreter.  */
      static const void *const targets[256] =
689
	{
Tom Tromey's avatar
Tom Tromey committed
690 691 692 693 694 695 696
	  [0 ... (Bconstant - 1)] = &&insn_default,
	  [Bconstant ... 255] = &&insn_Bconstant,

#define DEFINE(name, value) LABEL (name) ,
	  BYTE_CODES
#undef DEFINE
	};
697

698
#if 4 < __GNUC__ + (6 <= __GNUC_MINOR__) || defined __clang__
699 700 701
# pragma GCC diagnostic pop
#endif

Tom Tromey's avatar
Tom Tromey committed
702 703 704 705 706 707
#endif


      FIRST
	{
	CASE (Bvarref7):
Jim Blandy's avatar
Jim Blandy committed
708 709 710
	  op = FETCH2;
	  goto varref;

Tom Tromey's avatar
Tom Tromey committed
711 712 713 714 715 716
	CASE (Bvarref):
	CASE (Bvarref1):
	CASE (Bvarref2):
	CASE (Bvarref3):
	CASE (Bvarref4):
	CASE (Bvarref5):
Jim Blandy's avatar
Jim Blandy committed
717
	  op = op - Bvarref;
718 719 720 721
	  goto varref;

	/* This seems to be the most frequently executed byte-code
	   among the Bvarref's, so avoid a goto here.  */
Tom Tromey's avatar
Tom Tromey committed
722
	CASE (Bvarref6):
723
	  op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
724
	varref:
725 726 727 728 729 730
	  {
	    Lisp_Object v1, v2;

	    v1 = vectorp[op];
	    if (SYMBOLP (v1))
	      {
731 732 733
		if (XSYMBOL (v1)->redirect != SYMBOL_PLAINVAL
		    || (v2 = SYMBOL_VAL (XSYMBOL (v1)),
			EQ (v2, Qunbound)))
734 735 736 737 738
		  {
		    BEFORE_POTENTIAL_GC ();
		    v2 = Fsymbol_value (v1);
		    AFTER_POTENTIAL_GC ();
		  }
739 740
	      }
	    else
741 742 743 744 745
	      {
		BEFORE_POTENTIAL_GC ();
		v2 = Fsymbol_value (v1);
		AFTER_POTENTIAL_GC ();
	      }
746
	    PUSH (v2);
Tom Tromey's avatar
Tom Tromey committed
747
	    NEXT;
748 749
	  }

Tom Tromey's avatar
Tom Tromey committed
750
	CASE (Bgotoifnil):
751 752 753 754 755 756 757 758 759 760 761
	  {
	    Lisp_Object v1;
	    MAYBE_GC ();
	    op = FETCH2;
	    v1 = POP;
	    if (NILP (v1))
	      {
		BYTE_CODE_QUIT;
		CHECK_RANGE (op);
		stack.pc = stack.byte_string_start + op;
	      }
Tom Tromey's avatar
Tom Tromey committed
762
	    NEXT;
763
	  }
Jim Blandy's avatar
Jim Blandy committed
764

Tom Tromey's avatar
Tom Tromey committed
765
	CASE (Bcar):
766 767 768
	  {
	    Lisp_Object v1;
	    v1 = TOP;
769 770 771 772 773 774 775 776 777
	    if (CONSP (v1))
	      TOP = XCAR (v1);
	    else if (NILP (v1))
	      TOP = Qnil;
	    else
	      {
		BEFORE_POTENTIAL_GC ();
		wrong_type_argument (Qlistp, v1);
	      }
Tom Tromey's avatar
Tom Tromey committed
778
	    NEXT;
779 780
	  }

Tom Tromey's avatar
Tom Tromey committed
781
	CASE (Beq):
782 783 784 785
	  {
	    Lisp_Object v1;
	    v1 = POP;
	    TOP = EQ (v1, TOP) ? Qt : Qnil;
Tom Tromey's avatar
Tom Tromey committed
786
	    NEXT;
787 788
	  }

Tom Tromey's avatar
Tom Tromey committed
789
	CASE (Bmemq):
790 791
	  {
	    Lisp_Object v1;
792
	    BEFORE_POTENTIAL_GC ();
793 794
	    v1 = POP;
	    TOP = Fmemq (TOP, v1);
795
	    AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
796
	    NEXT;
797 798
	  }

Tom Tromey's avatar
Tom Tromey committed
799
	CASE (Bcdr):
800 801 802
	  {
	    Lisp_Object v1;
	    v1 = TOP;
803 804 805 806 807 808 809 810 811
	    if (CONSP (v1))
	      TOP = XCDR (v1);
	    else if (NILP (v1))
	      TOP = Qnil;
	    else
	      {
		BEFORE_POTENTIAL_GC ();
		wrong_type_argument (Qlistp, v1);
	      }
Tom Tromey's avatar
Tom Tromey committed
812
	    NEXT;
813
	  }
Jim Blandy's avatar
Jim Blandy committed
814

Tom Tromey's avatar
Tom Tromey committed
815 816 817 818 819 820
	CASE (Bvarset):
	CASE (Bvarset1):
	CASE (Bvarset2):
	CASE (Bvarset3):
	CASE (Bvarset4):
	CASE (Bvarset5):
821
	  op -= Bvarset;
Jim Blandy's avatar
Jim Blandy committed
822 823
	  goto varset;

Tom Tromey's avatar
Tom Tromey committed
824
	CASE (Bvarset7):
825
	  op = FETCH2;
826 827
	  goto varset;

Tom Tromey's avatar
Tom Tromey committed
828
	CASE (Bvarset6):
829
	  op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
830
	varset:
831 832
	  {
	    Lisp_Object sym, val;
833

834
	    sym = vectorp[op];
835
	    val = TOP;
836 837 838 839

	    /* Inline the most common case.  */
	    if (SYMBOLP (sym)
		&& !EQ (val, Qunbound)
840 841
		&& !XSYMBOL (sym)->redirect
		&& !SYMBOL_CONSTANT_P (sym))
842
	      SET_SYMBOL_VAL (XSYMBOL (sym), val);
843
	    else
844 845
	      {
		BEFORE_POTENTIAL_GC ();
846
		set_internal (sym, val, Qnil, 0);
847 848
		AFTER_POTENTIAL_GC ();
	      }
849
	  }
850
	  (void) POP;
Tom Tromey's avatar
Tom Tromey committed
851
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
852

Tom Tromey's avatar
Tom Tromey committed
853
	CASE (Bdup):
854 855 856 857
	  {
	    Lisp_Object v1;
	    v1 = TOP;
	    PUSH (v1);
Tom Tromey's avatar
Tom Tromey committed
858
	    NEXT;
859 860 861 862
	  }

	/* ------------------ */

Tom Tromey's avatar
Tom Tromey committed
863
	CASE (Bvarbind6):
Jim Blandy's avatar
Jim Blandy committed
864 865 866
	  op = FETCH;
	  goto varbind;

Tom Tromey's avatar
Tom Tromey committed
867
	CASE (Bvarbind7):
Jim Blandy's avatar
Jim Blandy committed
868 869 870
	  op = FETCH2;
	  goto varbind;

Tom Tromey's avatar
Tom Tromey committed
871 872 873 874 875 876
	CASE (Bvarbind):
	CASE (Bvarbind1):
	CASE (Bvarbind2):
	CASE (Bvarbind3):
	CASE (Bvarbind4):
	CASE (Bvarbind5):
Jim Blandy's avatar
Jim Blandy committed
877 878
	  op -= Bvarbind;
	varbind:
879 880
	  /* Specbind can signal and thus GC.  */
	  BEFORE_POTENTIAL_GC ();
Jim Blandy's avatar
Jim Blandy committed
881
	  specbind (vectorp[op], POP);
882
	  AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
883
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
884

Tom Tromey's avatar
Tom Tromey committed
885
	CASE (Bcall6):
Jim Blandy's avatar
Jim Blandy committed
886 887 888
	  op = FETCH;
	  goto docall;

Tom Tromey's avatar
Tom Tromey committed
889
	CASE (Bcall7):
Jim Blandy's avatar
Jim Blandy committed
890 891 892
	  op = FETCH2;
	  goto docall;

Tom Tromey's avatar
Tom Tromey committed
893 894 895 896 897 898
	CASE (Bcall):
	CASE (Bcall1):
	CASE (Bcall2):
	CASE (Bcall3):
	CASE (Bcall4):
	CASE (Bcall5):
Jim Blandy's avatar
Jim Blandy committed
899 900
	  op -= Bcall;
	docall:
901
	  {
902
	    BEFORE_POTENTIAL_GC ();
903
	    DISCARD (op);
904
#ifdef BYTE_CODE_METER
905 906 907 908 909 910 911
	    if (byte_metering_on && SYMBOLP (TOP))
	      {
		Lisp_Object v1, v2;

		v1 = TOP;
		v2 = Fget (v1, Qbyte_code_meter);
		if (INTEGERP (v2)
912
		    && XINT (v2) < MOST_POSITIVE_FIXNUM)
913 914 915 916 917
		  {
		    XSETINT (v2, XINT (v2) + 1);
		    Fput (v1, Qbyte_code_meter, v2);
		  }
	      }
918
#endif
919 920
	    TOP = Ffuncall (op + 1, &TOP);
	    AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
921
	    NEXT;
922
	  }
Jim Blandy's avatar
Jim Blandy committed
923

Tom Tromey's avatar
Tom Tromey committed
924
	CASE (Bunbind6):
Jim Blandy's avatar
Jim Blandy committed
925 926 927
	  op = FETCH;
	  goto dounbind;

Tom Tromey's avatar
Tom Tromey committed
928
	CASE (Bunbind7):
Jim Blandy's avatar
Jim Blandy committed
929 930 931
	  op = FETCH2;
	  goto dounbind;

Tom Tromey's avatar
Tom Tromey committed
932 933 934 935 936 937
	CASE (Bunbind):
	CASE (Bunbind1):
	CASE (Bunbind2):
	CASE (Bunbind3):
	CASE (Bunbind4):
	CASE (Bunbind5):
Jim Blandy's avatar
Jim Blandy committed
938 939
	  op -= Bunbind;
	dounbind:
Gerd Moellmann's avatar
Gerd Moellmann committed
940
	  BEFORE_POTENTIAL_GC ();
Juanma Barranquero's avatar
Juanma Barranquero committed
941
	  unbind_to (SPECPDL_INDEX () - op, Qnil);
Gerd Moellmann's avatar
Gerd Moellmann committed
942
	  AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
943
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
944

Tom Tromey's avatar
Tom Tromey committed
945
	CASE (Bunbind_all):	/* Obsolete.  Never used.  */
Jim Blandy's avatar
Jim Blandy committed
946
	  /* To unbind back to the beginning of this frame.  Not used yet,
947
	     but will be needed for tail-recursion elimination.  */
Gerd Moellmann's avatar
Gerd Moellmann committed
948
	  BEFORE_POTENTIAL_GC ();
Jim Blandy's avatar
Jim Blandy committed
949
	  unbind_to (count, Qnil);
Gerd Moellmann's avatar
Gerd Moellmann committed
950
	  AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
951
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
952

Tom Tromey's avatar
Tom Tromey committed
953
	CASE (Bgoto):
Richard M. Stallman's avatar
Richard M. Stallman committed
954
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
955
	  BYTE_CODE_QUIT;
Jim Blandy's avatar
Jim Blandy committed
956
	  op = FETCH2;    /* pc = FETCH2 loses since FETCH2 contains pc++ */
957
	  CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
958
	  stack.pc = stack.byte_string_start + op;
Tom Tromey's avatar
Tom Tromey committed
959
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
960

Tom Tromey's avatar
Tom Tromey committed
961
	CASE (Bgotoifnonnil):
962 963 964 965 966 967 968 969 970 971 972
	  {
	    Lisp_Object v1;
	    MAYBE_GC ();
	    op = FETCH2;
	    v1 = POP;
	    if (!NILP (v1))
	      {
		BYTE_CODE_QUIT;
		CHECK_RANGE (op);
		stack.pc = stack.byte_string_start + op;
	      }
Tom Tromey's avatar
Tom Tromey committed
973
	    NEXT;
974
	  }
Jim Blandy's avatar
Jim Blandy committed
975

Tom Tromey's avatar
Tom Tromey committed
976
	CASE (Bgotoifnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
977
	  MAYBE_GC ();
Jim Blandy's avatar
Jim Blandy committed
978
	  op = FETCH2;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
979
	  if (NILP (TOP))
Jim Blandy's avatar
Jim Blandy committed
980
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
981
	      BYTE_CODE_QUIT;
982
	      CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
983
	      stack.pc = stack.byte_string_start + op;
Jim Blandy's avatar
Jim Blandy committed
984
	    }
985
	  else DISCARD (1);
Tom Tromey's avatar
Tom Tromey committed
986
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
987

Tom Tromey's avatar
Tom Tromey committed
988
	CASE (Bgotoifnonnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
989
	  MAYBE_GC ();
Jim Blandy's avatar
Jim Blandy committed
990
	  op = FETCH2;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
991
	  if (!NILP (TOP))
Jim Blandy's avatar
Jim Blandy committed
992
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
993
	      BYTE_CODE_QUIT;
994
	      CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
995
	      stack.pc = stack.byte_string_start + op;
Jim Blandy's avatar
Jim Blandy committed
996
	    }
997
	  else DISCARD (1);
Tom Tromey's avatar
Tom Tromey committed
998
	  NEXT;
999

Tom Tromey's avatar
Tom Tromey committed
1000
	CASE (BRgoto):
Richard M. Stallman's avatar
Richard M. Stallman committed
1001
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
1002
	  BYTE_CODE_QUIT;
Gerd Moellmann's avatar
Gerd Moellmann committed
1003
	  stack.pc += (int) *stack.pc - 127;
Tom Tromey's avatar
Tom Tromey committed
1004
	  NEXT;