bytecode.c 43 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 62 63 64 65
/* 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.  */
#if defined (__GNUC__) && !defined (BYTE_CODE_SAFE) && !defined (BYTE_CODE_METER)
#define BYTE_CODE_THREADED
#endif

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

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

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

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

/*  Byte codes: */

Tom Tromey's avatar
Tom Tromey committed
93 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
#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

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

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

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

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

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

  /* 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
329
   done.  Signaling an error truncates the list analogous to
Gerd Moellmann's avatar
Gerd Moellmann committed
330 331 332 333
   gcprolist.  */

struct byte_stack *byte_stack_list;

334

Gerd Moellmann's avatar
Gerd Moellmann committed
335 336
/* Mark objects on byte_stack_list.  Called during GC.  */

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

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

Gerd Moellmann's avatar
Gerd Moellmann committed
355
      for (obj = stack->bottom; obj <= stack->top; ++obj)
Kenichi Handa's avatar
Kenichi Handa committed
356
	mark_object (*obj);
357

Kenichi Handa's avatar
Kenichi Handa committed
358 359
      mark_object (stack->byte_string);
      mark_object (stack->constants);
Gerd Moellmann's avatar
Gerd Moellmann committed
360 361
    }
}
362
#endif
Gerd Moellmann's avatar
Gerd Moellmann committed
363

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

367
void
368
unmark_byte_stack (void)
Gerd Moellmann's avatar
Gerd Moellmann committed
369 370 371 372
{
  struct byte_stack *stack;

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

Jim Blandy's avatar
Jim Blandy committed
383

384
/* Fetch the next byte from the bytecode stream.  */
Jim Blandy's avatar
Jim Blandy committed
385

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

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

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

393 394 395 396
/* 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
397 398

#define PUSH(x) (top++, *top = (x))
Jim Blandy's avatar
Jim Blandy committed
399 400 401

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

Gerd Moellmann's avatar
Gerd Moellmann committed
402
#define POP (*top--)
Jim Blandy's avatar
Jim Blandy committed
403 404 405

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

Gerd Moellmann's avatar
Gerd Moellmann committed
406 407 408
#define DISCARD(n) (top -= (n))

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

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

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

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

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

427 428 429 430 431
#define MAYBE_GC()		\
  do {				\
   BEFORE_POTENTIAL_GC ();	\
   maybe_gc ();			\
   AFTER_POTENTIAL_GC ();	\
432
 } while (0)
433

434
/* Check for jumping out of range.  */
Gerd Moellmann's avatar
Gerd Moellmann committed
435 436 437

#ifdef BYTE_CODE_SAFE

438
#define CHECK_RANGE(ARG) \
439
  if (ARG >= bytestr_length) emacs_abort ()
440

441
#else /* not BYTE_CODE_SAFE */
Gerd Moellmann's avatar
Gerd Moellmann committed
442 443 444

#define CHECK_RANGE(ARG)

445
#endif /* not BYTE_CODE_SAFE */
Gerd Moellmann's avatar
Gerd Moellmann committed
446

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

Gerd Moellmann's avatar
Gerd Moellmann committed
466

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

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

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

517
  CHECK_STRING (bytestr);
Kim F. Storm's avatar
Kim F. Storm committed
518
  CHECK_VECTOR (vector);
519
  CHECK_NATNUM (maxdepth);
Jim Blandy's avatar
Jim Blandy committed
520

521
#ifdef BYTE_CODE_SAFE
522
  const_length = ASIZE (vector);
523 524
#endif

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

533
#ifdef BYTE_CODE_SAFE
534
  bytestr_length = SBYTES (bytestr);
535
#endif
536 537
  vectorp = XVECTOR (vector)->contents;

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

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

557
  if (INTEGERP (args_template))
558
    {
559
      ptrdiff_t at = XINT (args_template);
560
      bool rest = (at & 128) != 0;
561
      int mandatory = at & 127;
562
      ptrdiff_t nonrest = at >> 8;
563 564 565
      eassert (mandatory <= nonrest);
      if (nargs <= nonrest)
	{
566
	  ptrdiff_t i;
567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584
	  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)
	{
585
	  ptrdiff_t i;
586 587 588 589 590 591
	  for (i = 0 ; i < nonrest; i++, args++)
	    PUSH (*args);
	  PUSH (Flist (nargs - nonrest, args));
	}
      else
	/* Too many arguments.  */
592
	Fsignal (Qwrong_number_of_arguments,
593 594 595 596 597 598 599 600
		 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!");
601 602
    }

Jim Blandy's avatar
Jim Blandy committed
603 604 605
  while (1)
    {
#ifdef BYTE_CODE_SAFE
606
      if (top > stacke)
607
	emacs_abort ();
Gerd Moellmann's avatar
Gerd Moellmann committed
608
      else if (top < stack.bottom - 1)
609
	emacs_abort ();
Jim Blandy's avatar
Jim Blandy committed
610 611 612 613 614 615 616
#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
617
#ifndef BYTE_CODE_THREADED
618
      op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
619
#endif
Tom Tromey's avatar
Tom Tromey committed
620 621 622 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
#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
662

663
#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6)
664 665 666 667
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Woverride-init"
#endif

Tom Tromey's avatar
Tom Tromey committed
668 669
      /* This is the dispatch table for the threaded interpreter.  */
      static const void *const targets[256] =
670
	{
Tom Tromey's avatar
Tom Tromey committed
671 672 673 674 675 676 677
	  [0 ... (Bconstant - 1)] = &&insn_default,
	  [Bconstant ... 255] = &&insn_Bconstant,

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

679
#if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6)
680 681 682
# pragma GCC diagnostic pop
#endif

Tom Tromey's avatar
Tom Tromey committed
683 684 685 686 687 688
#endif


      FIRST
	{
	CASE (Bvarref7):
Jim Blandy's avatar
Jim Blandy committed
689 690 691
	  op = FETCH2;
	  goto varref;

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

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

Tom Tromey's avatar
Tom Tromey committed
731
	CASE (Bgotoifnil):
732 733 734 735 736 737 738 739 740 741 742
	  {
	    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
743
	    NEXT;
744
	  }
Jim Blandy's avatar
Jim Blandy committed
745

Tom Tromey's avatar
Tom Tromey committed
746
	CASE (Bcar):
747 748 749
	  {
	    Lisp_Object v1;
	    v1 = TOP;
750 751 752 753 754 755 756 757 758
	    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
759
	    NEXT;
760 761
	  }

Tom Tromey's avatar
Tom Tromey committed
762
	CASE (Beq):
763 764 765 766
	  {
	    Lisp_Object v1;
	    v1 = POP;
	    TOP = EQ (v1, TOP) ? Qt : Qnil;
Tom Tromey's avatar
Tom Tromey committed
767
	    NEXT;
768 769
	  }

Tom Tromey's avatar
Tom Tromey committed
770
	CASE (Bmemq):
771 772
	  {
	    Lisp_Object v1;
773
	    BEFORE_POTENTIAL_GC ();
774 775
	    v1 = POP;
	    TOP = Fmemq (TOP, v1);
776
	    AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
777
	    NEXT;
778 779
	  }

Tom Tromey's avatar
Tom Tromey committed
780
	CASE (Bcdr):
781 782 783
	  {
	    Lisp_Object v1;
	    v1 = TOP;
784 785 786 787 788 789 790 791 792
	    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
793
	    NEXT;
794
	  }
Jim Blandy's avatar
Jim Blandy committed
795

Tom Tromey's avatar
Tom Tromey committed
796 797 798 799 800 801
	CASE (Bvarset):
	CASE (Bvarset1):
	CASE (Bvarset2):
	CASE (Bvarset3):
	CASE (Bvarset4):
	CASE (Bvarset5):
802
	  op -= Bvarset;
Jim Blandy's avatar
Jim Blandy committed
803 804
	  goto varset;

Tom Tromey's avatar
Tom Tromey committed
805
	CASE (Bvarset7):
806
	  op = FETCH2;
807 808
	  goto varset;

Tom Tromey's avatar
Tom Tromey committed
809
	CASE (Bvarset6):
810
	  op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
811
	varset:
812 813
	  {
	    Lisp_Object sym, val;
814

815
	    sym = vectorp[op];
816
	    val = TOP;
817 818 819 820

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

Tom Tromey's avatar
Tom Tromey committed
834
	CASE (Bdup):
835 836 837 838
	  {
	    Lisp_Object v1;
	    v1 = TOP;
	    PUSH (v1);
Tom Tromey's avatar
Tom Tromey committed
839
	    NEXT;
840 841 842 843
	  }

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

Tom Tromey's avatar
Tom Tromey committed
844
	CASE (Bvarbind6):
Jim Blandy's avatar
Jim Blandy committed
845 846 847
	  op = FETCH;
	  goto varbind;

Tom Tromey's avatar
Tom Tromey committed
848
	CASE (Bvarbind7):
Jim Blandy's avatar
Jim Blandy committed
849 850 851
	  op = FETCH2;
	  goto varbind;

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

Tom Tromey's avatar
Tom Tromey committed
866
	CASE (Bcall6):
Jim Blandy's avatar
Jim Blandy committed
867 868 869
	  op = FETCH;
	  goto docall;

Tom Tromey's avatar
Tom Tromey committed
870
	CASE (Bcall7):
Jim Blandy's avatar
Jim Blandy committed
871 872 873
	  op = FETCH2;
	  goto docall;

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

		v1 = TOP;
		v2 = Fget (v1, Qbyte_code_meter);
		if (INTEGERP (v2)
893
		    && XINT (v2) < MOST_POSITIVE_FIXNUM)
894 895 896 897 898
		  {
		    XSETINT (v2, XINT (v2) + 1);
		    Fput (v1, Qbyte_code_meter, v2);
		  }
	      }
899
#endif
900 901
	    TOP = Ffuncall (op + 1, &TOP);
	    AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
902
	    NEXT;
903
	  }
Jim Blandy's avatar
Jim Blandy committed
904

Tom Tromey's avatar
Tom Tromey committed
905
	CASE (Bunbind6):
Jim Blandy's avatar
Jim Blandy committed
906 907 908
	  op = FETCH;
	  goto dounbind;

Tom Tromey's avatar
Tom Tromey committed
909
	CASE (Bunbind7):
Jim Blandy's avatar
Jim Blandy committed
910 911 912
	  op = FETCH2;
	  goto dounbind;

Tom Tromey's avatar
Tom Tromey committed
913 914 915 916 917 918
	CASE (Bunbind):
	CASE (Bunbind1):
	CASE (Bunbind2):
	CASE (Bunbind3):
	CASE (Bunbind4):
	CASE (Bunbind5):
Jim Blandy's avatar
Jim Blandy committed
919 920
	  op -= Bunbind;
	dounbind:
Gerd Moellmann's avatar
Gerd Moellmann committed
921
	  BEFORE_POTENTIAL_GC ();
Juanma Barranquero's avatar
Juanma Barranquero committed
922
	  unbind_to (SPECPDL_INDEX () - op, Qnil);
Gerd Moellmann's avatar
Gerd Moellmann committed
923
	  AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
924
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
925

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

Tom Tromey's avatar
Tom Tromey committed
934
	CASE (Bgoto):
Richard M. Stallman's avatar
Richard M. Stallman committed
935
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
936
	  BYTE_CODE_QUIT;
Jim Blandy's avatar
Jim Blandy committed
937
	  op = FETCH2;    /* pc = FETCH2 loses since FETCH2 contains pc++ */
938
	  CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
939
	  stack.pc = stack.byte_string_start + op;
Tom Tromey's avatar
Tom Tromey committed
940
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
941

Tom Tromey's avatar
Tom Tromey committed
942
	CASE (Bgotoifnonnil):
943 944 945 946 947 948 949 950 951 952 953
	  {
	    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
954
	    NEXT;
955
	  }
Jim Blandy's avatar
Jim Blandy committed
956

Tom Tromey's avatar
Tom Tromey committed
957
	CASE (Bgotoifnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
958
	  MAYBE_GC ();
Jim Blandy's avatar
Jim Blandy committed
959
	  op = FETCH2;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
960
	  if (NILP (TOP))
Jim Blandy's avatar
Jim Blandy committed
961
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
962
	      BYTE_CODE_QUIT;
963
	      CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
964
	      stack.pc = stack.byte_string_start + op;
Jim Blandy's avatar
Jim Blandy committed
965
	    }
966
	  else DISCARD (1);
Tom Tromey's avatar
Tom Tromey committed
967
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
968

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

Tom Tromey's avatar
Tom Tromey committed
981
	CASE (BRgoto):
Richard M. Stallman's avatar
Richard M. Stallman committed
982
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
983
	  BYTE_CODE_QUIT;
Gerd Moellmann's avatar
Gerd Moellmann committed
984
	  stack.pc += (int) *stack.pc - 127;
Tom Tromey's avatar
Tom Tromey committed
985
	  NEXT;
986

Tom Tromey's avatar
Tom Tromey committed
987
	CASE (BRgotoifnil):
988 989 990 991 992 993 994 995 996 997
	  {
	    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
998
	    NEXT;
999
	  }
1000

Tom Tromey's avatar
Tom Tromey committed
1001
	CASE (BRgotoifnonnil):
1002 1003 1004 1005 1006 1007 1008 1009 1010 1011
	  {
	    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
1012
	    NEXT;
1013
	  }
1014

Tom Tromey's avatar
Tom Tromey committed
1015
	CASE (BRgotoifnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
1016
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
1017
	  op = *stack.pc++;
1018 1019
	  if (NILP (TOP))
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
1020
	      BYTE_CODE_QUIT;
Gerd Moellmann's avatar
Gerd Moellmann committed
1021
	      stack.pc += op - 128