bytecode.c 43.2 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Execution of byte code produced by bytecomp.el.
2 3
   Copyright (C) 1985-1988, 1993, 2000-2013 Free Software Foundation,
   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"
39
#include "character.h"
40
#include "buffer.h"
Jim Blandy's avatar
Jim Blandy committed
41
#include "syntax.h"
Stefan Monnier's avatar
Stefan Monnier committed
42
#include "window.h"
Jim Blandy's avatar
Jim Blandy committed
43

44 45 46 47 48
#ifdef CHECK_FRAME_FONT
#include "frame.h"
#include "xterm.h"
#endif

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

Tom Tromey's avatar
Tom Tromey committed
58 59 60 61
/* 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
62 63
#if (defined __GNUC__ && !defined __STRICT_ANSI__ \
     && !defined BYTE_CODE_SAFE && !defined BYTE_CODE_METER)
Tom Tromey's avatar
Tom Tromey committed
64 65 66
#define BYTE_CODE_THREADED
#endif

Jim Blandy's avatar
Jim Blandy committed
67 68 69

#ifdef BYTE_CODE_METER

70
Lisp_Object Qbyte_code_meter;
71 72
#define METER_2(code1, code2) AREF (AREF (Vbyte_code_meter, code1), code2)
#define METER_1(code) METER_2 (0, code)
73

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

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

/*  Byte codes: */

Tom Tromey's avatar
Tom Tromey committed
94 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 145 146 147 148 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
#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)							\
									\
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

287
#ifdef BYTE_CODE_SAFE
Tom Tromey's avatar
Tom Tromey committed
288
    Bscan_buffer = 0153, /* No longer generated as of v18.  */
Paul Eggert's avatar
Paul Eggert committed
289
    Bset_mark = 0163, /* this loser is no longer generated as of v18 */
290
#endif
Paul Eggert's avatar
Paul Eggert committed
291 292

    B__dummy__ = 0  /* Pacify C89.  */
Tom Tromey's avatar
Tom Tromey committed
293
};
Gerd Moellmann's avatar
Gerd Moellmann committed
294

295 296
/* Whether to maintain a `top' and `bottom' field in the stack frame.  */
#define BYTE_MAINTAIN_TOP (BYTE_CODE_SAFE || BYTE_MARK_STACK)
297

Gerd Moellmann's avatar
Gerd Moellmann committed
298 299 300 301 302 303 304
/* 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.  */
305
  const unsigned char *pc;
Gerd Moellmann's avatar
Gerd Moellmann committed
306 307 308

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

  /* 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;
317
  const unsigned char *byte_string_start;
Gerd Moellmann's avatar
Gerd Moellmann committed
318

319
#if BYTE_MARK_STACK
Gerd Moellmann's avatar
Gerd Moellmann committed
320 321 322
  /* 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;
323
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
324 325 326 327 328 329 330 331

  /* 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
   processing byte-code, and it removed the entry again when it is
Paul Eggert's avatar
Paul Eggert committed
332
   done.  Signaling an error truncates the list analogous to
Gerd Moellmann's avatar
Gerd Moellmann committed
333 334 335 336
   gcprolist.  */

struct byte_stack *byte_stack_list;

337

Gerd Moellmann's avatar
Gerd Moellmann committed
338 339
/* Mark objects on byte_stack_list.  Called during GC.  */

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

  for (stack = byte_stack_list; stack; stack = stack->next)
    {
349 350 351 352 353 354 355
      /* 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
356
      eassert (stack->top);
357

Gerd Moellmann's avatar
Gerd Moellmann committed
358
      for (obj = stack->bottom; obj <= stack->top; ++obj)
Kenichi Handa's avatar
Kenichi Handa committed
359
	mark_object (*obj);
360

Kenichi Handa's avatar
Kenichi Handa committed
361 362
      mark_object (stack->byte_string);
      mark_object (stack->constants);
Gerd Moellmann's avatar
Gerd Moellmann committed
363 364
    }
}
365
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
366

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

370
void
371
unmark_byte_stack (void)
Gerd Moellmann's avatar
Gerd Moellmann committed
372 373 374 375
{
  struct byte_stack *stack;

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

Jim Blandy's avatar
Jim Blandy committed
386

387
/* Fetch the next byte from the bytecode stream.  */
Jim Blandy's avatar
Jim Blandy committed
388

Gerd Moellmann's avatar
Gerd Moellmann committed
389
#define FETCH *stack.pc++
Jim Blandy's avatar
Jim Blandy committed
390

391
/* Fetch two bytes from the bytecode stream and make a 16-bit number
392
   out of them.  */
Jim Blandy's avatar
Jim Blandy committed
393 394 395

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

396 397 398 399
/* 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
400 401

#define PUSH(x) (top++, *top = (x))
Jim Blandy's avatar
Jim Blandy committed
402 403 404

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

Gerd Moellmann's avatar
Gerd Moellmann committed
405
#define POP (*top--)
Jim Blandy's avatar
Jim Blandy committed
406 407 408

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

Gerd Moellmann's avatar
Gerd Moellmann committed
409 410 411
#define DISCARD(n) (top -= (n))

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

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

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

419 420 421 422
#if !BYTE_MAINTAIN_TOP
#define BEFORE_POTENTIAL_GC()	((void)0)
#define AFTER_POTENTIAL_GC()	((void)0)
#else
Gerd Moellmann's avatar
Gerd Moellmann committed
423 424
#define BEFORE_POTENTIAL_GC()	stack.top = top
#define AFTER_POTENTIAL_GC()	stack.top = NULL
425
#endif
Jim Blandy's avatar
Jim Blandy committed
426

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

430 431 432 433 434
#define MAYBE_GC()		\
  do {				\
   BEFORE_POTENTIAL_GC ();	\
   maybe_gc ();			\
   AFTER_POTENTIAL_GC ();	\
435
 } while (0)
436

437
/* Check for jumping out of range.  */
Gerd Moellmann's avatar
Gerd Moellmann committed
438 439 440

#ifdef BYTE_CODE_SAFE

441
#define CHECK_RANGE(ARG) \
442
  if (ARG >= bytestr_length) emacs_abort ()
443

444
#else /* not BYTE_CODE_SAFE */
Gerd Moellmann's avatar
Gerd Moellmann committed
445 446 447

#define CHECK_RANGE(ARG)

448
#endif /* not BYTE_CODE_SAFE */
Gerd Moellmann's avatar
Gerd Moellmann committed
449

Gerd Moellmann's avatar
Gerd Moellmann committed
450 451 452 453 454 455 456
/* 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))	\
      {							\
457
        Lisp_Object flag = Vquit_flag;			\
Gerd Moellmann's avatar
Gerd Moellmann committed
458 459
	Vquit_flag = Qnil;				\
        BEFORE_POTENTIAL_GC ();				\
460
	if (EQ (Vthrow_on_input, flag))			\
461
	  Fthrow (Vthrow_on_input, Qt);			\
Gerd Moellmann's avatar
Gerd Moellmann committed
462
	Fsignal (Qquit, Qnil);				\
463
	AFTER_POTENTIAL_GC ();				\
Gerd Moellmann's avatar
Gerd Moellmann committed
464
      }							\
465 466
    else if (pending_signals)				\
      process_pending_signals ();			\
Gerd Moellmann's avatar
Gerd Moellmann committed
467 468
  } while (0)

Gerd Moellmann's avatar
Gerd Moellmann committed
469

Jim Blandy's avatar
Jim Blandy committed
470
DEFUN ("byte-code", Fbyte_code, Sbyte_code, 3, 3, 0,
471 472 473 474 475
       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
476
  (Lisp_Object bytestr, Lisp_Object vector, Lisp_Object maxdepth)
477
{
478
  return exec_byte_code (bytestr, vector, maxdepth, Qnil, 0, NULL);
479 480 481 482 483 484 485 486 487 488 489
}

/* 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
490
exec_byte_code (Lisp_Object bytestr, Lisp_Object vector, Lisp_Object maxdepth,
491
		Lisp_Object args_template, ptrdiff_t nargs, Lisp_Object *args)
Jim Blandy's avatar
Jim Blandy committed
492
{
493
  ptrdiff_t count = SPECPDL_INDEX ();
Jim Blandy's avatar
Jim Blandy committed
494 495 496 497
#ifdef BYTE_CODE_METER
  int this_op = 0;
  int prev_op;
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
498
  int op;
499
  /* Lisp_Object v1, v2; */
500
  Lisp_Object *vectorp;
Jim Blandy's avatar
Jim Blandy committed
501
#ifdef BYTE_CODE_SAFE
502
  ptrdiff_t const_length;
Gerd Moellmann's avatar
Gerd Moellmann committed
503
  Lisp_Object *stacke;
504
  ptrdiff_t bytestr_length;
505
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
506 507
  struct byte_stack stack;
  Lisp_Object *top;
508
  Lisp_Object result;
Jim Blandy's avatar
Jim Blandy committed
509

510
#if 0 /* CHECK_FRAME_FONT */
511 512 513 514 515
 {
   struct frame *f = SELECTED_FRAME ();
   if (FRAME_X_P (f)
       && FRAME_FONT (f)->direction != 0
       && FRAME_FONT (f)->direction != 1)
516
     emacs_abort ();
517 518 519
 }
#endif

520
  CHECK_STRING (bytestr);
Kim F. Storm's avatar
Kim F. Storm committed
521
  CHECK_VECTOR (vector);
522
  CHECK_NATNUM (maxdepth);
Jim Blandy's avatar
Jim Blandy committed
523

524
#ifdef BYTE_CODE_SAFE
525
  const_length = ASIZE (vector);
526 527
#endif

528 529 530 531 532
  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
533
       convert them back to the originally intended unibyte form.  */
534
    bytestr = Fstring_as_unibyte (bytestr);
535

536
#ifdef BYTE_CODE_SAFE
537
  bytestr_length = SBYTES (bytestr);
538
#endif
539 540
  vectorp = XVECTOR (vector)->contents;

Gerd Moellmann's avatar
Gerd Moellmann committed
541
  stack.byte_string = bytestr;
542
  stack.pc = stack.byte_string_start = SDATA (bytestr);
543
#if BYTE_MARK_STACK
Gerd Moellmann's avatar
Gerd Moellmann committed
544
  stack.constants = vector;
545
#endif
546
  if (MAX_ALLOCA / word_size <= XFASTINT (maxdepth))
547
    memory_full (SIZE_MAX);
548
  top = alloca ((XFASTINT (maxdepth) + 1) * sizeof *top);
549
#if BYTE_MAINTAIN_TOP
550
  stack.bottom = top + 1;
Gerd Moellmann's avatar
Gerd Moellmann committed
551
  stack.top = NULL;
552
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
553 554
  stack.next = byte_stack_list;
  byte_stack_list = &stack;
Jim Blandy's avatar
Jim Blandy committed
555

Gerd Moellmann's avatar
Gerd Moellmann committed
556 557 558
#ifdef BYTE_CODE_SAFE
  stacke = stack.bottom - 1 + XFASTINT (maxdepth);
#endif
559

560
  if (INTEGERP (args_template))
561
    {
562
      ptrdiff_t at = XINT (args_template);
563
      bool rest = (at & 128) != 0;
564
      int mandatory = at & 127;
565
      ptrdiff_t nonrest = at >> 8;
566 567 568
      eassert (mandatory <= nonrest);
      if (nargs <= nonrest)
	{
569
	  ptrdiff_t i;
570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587
	  for (i = 0 ; i < nargs; i++, args++)
	    PUSH (*args);
	  if (nargs < mandatory)
	    /* Too few arguments.  */
	    Fsignal (Qwrong_number_of_arguments,
		     Fcons (Fcons (make_number (mandatory),
				   rest ? Qand_rest : make_number (nonrest)),
			    Fcons (make_number (nargs), Qnil)));
	  else
	    {
	      for (; i < nonrest; i++)
		PUSH (Qnil);
	      if (rest)
		PUSH (Qnil);
	    }
	}
      else if (rest)
	{
588
	  ptrdiff_t i;
589 590 591 592 593 594
	  for (i = 0 ; i < nonrest; i++, args++)
	    PUSH (*args);
	  PUSH (Flist (nargs - nonrest, args));
	}
      else
	/* Too many arguments.  */
595
	Fsignal (Qwrong_number_of_arguments,
596 597 598 599 600 601 602 603
		 Fcons (Fcons (make_number (mandatory),
			       make_number (nonrest)),
			Fcons (make_number (nargs), Qnil)));
    }
  else if (! NILP (args_template))
    /* We should push some arguments on the stack.  */
    {
      error ("Unknown args template!");
604 605
    }

Jim Blandy's avatar
Jim Blandy committed
606 607 608
  while (1)
    {
#ifdef BYTE_CODE_SAFE
609
      if (top > stacke)
610
	emacs_abort ();
Gerd Moellmann's avatar
Gerd Moellmann committed
611
      else if (top < stack.bottom - 1)
612
	emacs_abort ();
Jim Blandy's avatar
Jim Blandy committed
613 614 615 616 617 618 619
#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
620
#ifndef BYTE_CODE_THREADED
621
      op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
622
#endif
Tom Tromey's avatar
Tom Tromey committed
623 624 625 626 627 628 629 630 631 632 633 634 635 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
#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
665

666
#if 4 < __GNUC__ + (6 <= __GNUC_MINOR__)
667 668
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Woverride-init"
669 670 671
#elif defined __clang__
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Winitializer-overrides"
672 673
#endif

Tom Tromey's avatar
Tom Tromey committed
674 675
      /* This is the dispatch table for the threaded interpreter.  */
      static const void *const targets[256] =
676
	{
Tom Tromey's avatar
Tom Tromey committed
677 678 679 680 681 682 683
	  [0 ... (Bconstant - 1)] = &&insn_default,
	  [Bconstant ... 255] = &&insn_Bconstant,

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

685
#if 4 < __GNUC__ + (6 <= __GNUC_MINOR__) || defined __clang__
686 687 688
# pragma GCC diagnostic pop
#endif

Tom Tromey's avatar
Tom Tromey committed
689 690 691 692 693 694
#endif


      FIRST
	{
	CASE (Bvarref7):
Jim Blandy's avatar
Jim Blandy committed
695 696 697
	  op = FETCH2;
	  goto varref;

Tom Tromey's avatar
Tom Tromey committed
698 699 700 701 702 703
	CASE (Bvarref):
	CASE (Bvarref1):
	CASE (Bvarref2):
	CASE (Bvarref3):
	CASE (Bvarref4):
	CASE (Bvarref5):
Jim Blandy's avatar
Jim Blandy committed
704
	  op = op - Bvarref;
705 706 707 708
	  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
709
	CASE (Bvarref6):
710
	  op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
711
	varref:
712 713 714 715 716 717
	  {
	    Lisp_Object v1, v2;

	    v1 = vectorp[op];
	    if (SYMBOLP (v1))
	      {
718 719 720
		if (XSYMBOL (v1)->redirect != SYMBOL_PLAINVAL
		    || (v2 = SYMBOL_VAL (XSYMBOL (v1)),
			EQ (v2, Qunbound)))
721 722 723 724 725
		  {
		    BEFORE_POTENTIAL_GC ();
		    v2 = Fsymbol_value (v1);
		    AFTER_POTENTIAL_GC ();
		  }
726 727
	      }
	    else
728 729 730 731 732
	      {
		BEFORE_POTENTIAL_GC ();
		v2 = Fsymbol_value (v1);
		AFTER_POTENTIAL_GC ();
	      }
733
	    PUSH (v2);
Tom Tromey's avatar
Tom Tromey committed
734
	    NEXT;
735 736
	  }

Tom Tromey's avatar
Tom Tromey committed
737
	CASE (Bgotoifnil):
738 739 740 741 742 743 744 745 746 747 748
	  {
	    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
749
	    NEXT;
750
	  }
Jim Blandy's avatar
Jim Blandy committed
751

Tom Tromey's avatar
Tom Tromey committed
752
	CASE (Bcar):
753 754 755
	  {
	    Lisp_Object v1;
	    v1 = TOP;
756 757 758 759 760 761 762 763 764
	    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
765
	    NEXT;
766 767
	  }

Tom Tromey's avatar
Tom Tromey committed
768
	CASE (Beq):
769 770 771 772
	  {
	    Lisp_Object v1;
	    v1 = POP;
	    TOP = EQ (v1, TOP) ? Qt : Qnil;
Tom Tromey's avatar
Tom Tromey committed
773
	    NEXT;
774 775
	  }

Tom Tromey's avatar
Tom Tromey committed
776
	CASE (Bmemq):
777 778
	  {
	    Lisp_Object v1;
779
	    BEFORE_POTENTIAL_GC ();
780 781
	    v1 = POP;
	    TOP = Fmemq (TOP, v1);
782
	    AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
783
	    NEXT;
784 785
	  }

Tom Tromey's avatar
Tom Tromey committed
786
	CASE (Bcdr):
787 788 789
	  {
	    Lisp_Object v1;
	    v1 = TOP;
790 791 792 793 794 795 796 797 798
	    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
799
	    NEXT;
800
	  }
Jim Blandy's avatar
Jim Blandy committed
801

Tom Tromey's avatar
Tom Tromey committed
802 803 804 805 806 807
	CASE (Bvarset):
	CASE (Bvarset1):
	CASE (Bvarset2):
	CASE (Bvarset3):
	CASE (Bvarset4):
	CASE (Bvarset5):
808
	  op -= Bvarset;
Jim Blandy's avatar
Jim Blandy committed
809 810
	  goto varset;

Tom Tromey's avatar
Tom Tromey committed
811
	CASE (Bvarset7):
812
	  op = FETCH2;
813 814
	  goto varset;

Tom Tromey's avatar
Tom Tromey committed
815
	CASE (Bvarset6):
816
	  op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
817
	varset:
818 819
	  {
	    Lisp_Object sym, val;
820

821
	    sym = vectorp[op];
822
	    val = TOP;
823 824 825 826

	    /* Inline the most common case.  */
	    if (SYMBOLP (sym)
		&& !EQ (val, Qunbound)
827 828
		&& !XSYMBOL (sym)->redirect
		&& !SYMBOL_CONSTANT_P (sym))
829
	      SET_SYMBOL_VAL (XSYMBOL (sym), val);
830
	    else
831 832
	      {
		BEFORE_POTENTIAL_GC ();
833
		set_internal (sym, val, Qnil, 0);
834 835
		AFTER_POTENTIAL_GC ();
	      }
836
	  }
837
	  (void) POP;
Tom Tromey's avatar
Tom Tromey committed
838
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
839

Tom Tromey's avatar
Tom Tromey committed
840
	CASE (Bdup):
841 842 843 844
	  {
	    Lisp_Object v1;
	    v1 = TOP;
	    PUSH (v1);
Tom Tromey's avatar
Tom Tromey committed
845
	    NEXT;
846 847 848 849
	  }

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

Tom Tromey's avatar
Tom Tromey committed
850
	CASE (Bvarbind6):
Jim Blandy's avatar
Jim Blandy committed
851 852 853
	  op = FETCH;
	  goto varbind;

Tom Tromey's avatar
Tom Tromey committed
854
	CASE (Bvarbind7):
Jim Blandy's avatar
Jim Blandy committed
855 856 857
	  op = FETCH2;
	  goto varbind;

Tom Tromey's avatar
Tom Tromey committed
858 859 860 861 862 863
	CASE (Bvarbind):
	CASE (Bvarbind1):
	CASE (Bvarbind2):
	CASE (Bvarbind3):
	CASE (Bvarbind4):
	CASE (Bvarbind5):
Jim Blandy's avatar
Jim Blandy committed
864 865
	  op -= Bvarbind;
	varbind:
866 867
	  /* Specbind can signal and thus GC.  */
	  BEFORE_POTENTIAL_GC ();
Jim Blandy's avatar
Jim Blandy committed
868
	  specbind (vectorp[op], POP);
869
	  AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
870
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
871

Tom Tromey's avatar
Tom Tromey committed
872
	CASE (Bcall6):
Jim Blandy's avatar
Jim Blandy committed
873 874 875
	  op = FETCH;
	  goto docall;

Tom Tromey's avatar
Tom Tromey committed
876
	CASE (Bcall7):
Jim Blandy's avatar
Jim Blandy committed
877 878 879
	  op = FETCH2;
	  goto docall;

Tom Tromey's avatar
Tom Tromey committed
880 881 882 883 884 885
	CASE (Bcall):
	CASE (Bcall1):
	CASE (Bcall2):
	CASE (Bcall3):
	CASE (Bcall4):
	CASE (Bcall5):
Jim Blandy's avatar
Jim Blandy committed
886 887
	  op -= Bcall;
	docall:
888
	  {
889
	    BEFORE_POTENTIAL_GC ();
890
	    DISCARD (op);
891
#ifdef BYTE_CODE_METER
892 893 894 895 896 897 898
	    if (byte_metering_on && SYMBOLP (TOP))
	      {
		Lisp_Object v1, v2;

		v1 = TOP;
		v2 = Fget (v1, Qbyte_code_meter);
		if (INTEGERP (v2)
899
		    && XINT (v2) < MOST_POSITIVE_FIXNUM)
900 901 902 903 904
		  {
		    XSETINT (v2, XINT (v2) + 1);
		    Fput (v1, Qbyte_code_meter, v2);
		  }
	      }
905
#endif
906 907
	    TOP = Ffuncall (op + 1, &TOP);
	    AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
908
	    NEXT;
909
	  }
Jim Blandy's avatar
Jim Blandy committed
910

Tom Tromey's avatar
Tom Tromey committed
911
	CASE (Bunbind6):
Jim Blandy's avatar
Jim Blandy committed
912 913 914
	  op = FETCH;
	  goto dounbind;

Tom Tromey's avatar
Tom Tromey committed
915
	CASE (Bunbind7):
Jim Blandy's avatar
Jim Blandy committed
916 917 918
	  op = FETCH2;
	  goto dounbind;

Tom Tromey's avatar
Tom Tromey committed
919 920 921 922 923 924
	CASE (Bunbind):
	CASE (Bunbind1):
	CASE (Bunbind2):
	CASE (Bunbind3):
	CASE (Bunbind4):
	CASE (Bunbind5):
Jim Blandy's avatar
Jim Blandy committed
925 926
	  op -= Bunbind;
	dounbind:
Gerd Moellmann's avatar
Gerd Moellmann committed
927
	  BEFORE_POTENTIAL_GC ();
Juanma Barranquero's avatar
Juanma Barranquero committed
928
	  unbind_to (SPECPDL_INDEX () - op, Qnil);
Gerd Moellmann's avatar
Gerd Moellmann committed
929
	  AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
930
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
931

Tom Tromey's avatar
Tom Tromey committed
932
	CASE (Bunbind_all):	/* Obsolete.  Never used.  */
Jim Blandy's avatar
Jim Blandy committed
933
	  /* To unbind back to the beginning of this frame.  Not used yet,
934
	     but will be needed for tail-recursion elimination.  */
Gerd Moellmann's avatar
Gerd Moellmann committed
935
	  BEFORE_POTENTIAL_GC ();
Jim Blandy's avatar
Jim Blandy committed
936
	  unbind_to (count, Qnil);
Gerd Moellmann's avatar
Gerd Moellmann committed
937
	  AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
938
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
939

Tom Tromey's avatar
Tom Tromey committed
940
	CASE (Bgoto):
Richard M. Stallman's avatar
Richard M. Stallman committed
941
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
942
	  BYTE_CODE_QUIT;
Jim Blandy's avatar
Jim Blandy committed
943
	  op = FETCH2;    /* pc = FETCH2 loses since FETCH2 contains pc++ */
944
	  CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
945
	  stack.pc = stack.byte_string_start + op;
Tom Tromey's avatar
Tom Tromey committed
946
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
947

Tom Tromey's avatar
Tom Tromey committed
948
	CASE (Bgotoifnonnil):
949 950 951 952 953 954 955 956 957 958 959
	  {
	    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
960
	    NEXT;
961
	  }
Jim Blandy's avatar
Jim Blandy committed
962

Tom Tromey's avatar
Tom Tromey committed
963
	CASE (Bgotoifnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
964
	  MAYBE_GC ();
Jim Blandy's avatar
Jim Blandy committed
965
	  op = FETCH2;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
966
	  if (NILP (TOP))
Jim Blandy's avatar
Jim Blandy committed
967
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
968
	      BYTE_CODE_QUIT;
969
	      CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
970
	      stack.pc = stack.byte_string_start + op;
Jim Blandy's avatar
Jim Blandy committed
971
	    }
972
	  else DISCARD (1);
Tom Tromey's avatar
Tom Tromey committed
973
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
974

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

Tom Tromey's avatar
Tom Tromey committed
987
	CASE (BRgoto):
Richard M. Stallman's avatar
Richard M. Stallman committed
988
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
989
	  BYTE_CODE_QUIT;
Gerd Moellmann's avatar
Gerd Moellmann committed
990
	  stack.pc += (int) *stack.pc - 127;
Tom Tromey's avatar
Tom Tromey committed
991
	  NEXT;
992

Tom Tromey's avatar
Tom Tromey committed
993
	CASE (BRgotoifnil):
994 995 996 997 998 999 1000 1001 1002 1003
	  {
	    Lisp_Object v1;
	    MAYBE_GC ();
	    v1 = POP;
	    if (NILP (v1))
	      {
		BYTE_CODE_QUIT;
		stack.pc += (int) *stack.pc - 128;
	      }
	    stack.pc++;
Tom Tromey's avatar
Tom Tromey committed
1004
	    NEXT;
1005
	  }
1006

Tom Tromey's avatar
Tom Tromey committed
1007
	CASE (BRgotoifnonnil):
1008 1009 1010 1011 1012 1013 1014 1015 1016 1017
	  {
	    Lisp_Object v1;
	    MAYBE_GC ();
	    v1 = POP;
	    if (!NILP (v1))
	      {
		BYTE_CODE_QUIT;
		stack.pc += (int) *stack.pc - 128;
	      }
	    stack.pc++;
Tom Tromey's avatar
Tom Tromey committed
1018
	    NEXT;
1019
	  }
1020

Tom Tromey's avatar
Tom Tromey committed
1021
	CASE (BRgotoifnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
1022
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
1023
	  op = *stack.pc++;
1024 1025
	  if (NILP (TOP))
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
1026
	      BYTE_CODE_QUIT;
Gerd Moellmann's avatar
Gerd Moellmann committed
1027
	      stack.pc += op - 128;
1028 1029
	    }
	  else DISCARD (1);
Tom Tromey's avatar
Tom Tromey committed
1030
	  NEXT;
1031

Tom Tromey's avatar
Tom Tromey committed
1032
	CASE (BRgotoifnonnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
1033
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
1034
	  op = *stack.pc++;
1035 1036
	  if (!NILP (TOP))
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
1037
	      BYTE_CODE_QUIT;
Gerd Moellmann's avatar
Gerd Moellmann committed
1038
	      stack.pc += op - 128;
1039 1040
	    }
	  else DISCARD (1);
Tom Tromey's avatar
Tom Tromey committed
1041
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
1042