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

This file is part of GNU Emacs.

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

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
17
along with GNU Emacs.  If not, see <http://www.gnu.org/licenses/>.  */
Jim Blandy's avatar
Jim Blandy committed
18

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

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

35
#include <config.h>
36
#include <setjmp.h>
Jim Blandy's avatar
Jim Blandy committed
37
#include "lisp.h"
38
#include "character.h"
39
#include "buffer.h"
Jim Blandy's avatar
Jim Blandy committed
40
#include "syntax.h"
Stefan Monnier's avatar
Stefan Monnier committed
41
#include "window.h"
Jim Blandy's avatar
Jim Blandy committed
42

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

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

Tom Tromey's avatar
Tom Tromey committed
57 58 59 60 61 62 63 64
/* 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
65 66 67

#ifdef BYTE_CODE_METER

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

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

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

Lisp_Object Qbytecode;

/*  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 289
    Bscan_buffer = 0153, /* No longer generated as of v18.  */
    Bset_mark = 0163 /* this loser is no longer generated as of v18 */
290
#endif
Tom Tromey's avatar
Tom Tromey committed
291
};
Gerd Moellmann's avatar
Gerd Moellmann committed
292

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

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

  /* 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;
315
  const unsigned char *byte_string_start;
Gerd Moellmann's avatar
Gerd Moellmann committed
316 317 318 319 320 321 322 323 324 325 326 327

  /* 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;

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

struct byte_stack *byte_stack_list;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

/* Get the value which is at the top of the execution stack, but don't
   pop it. */

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

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

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

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

426
#define MAYBE_GC()					\
427
 do {							\
428 429 430 431 432 433 434
  if (consing_since_gc > gc_cons_threshold		\
      && consing_since_gc > gc_relative_threshold)	\
    {							\
      BEFORE_POTENTIAL_GC ();				\
      Fgarbage_collect ();				\
      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 443
  if (ARG >= bytestr_length) abort ()

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
    ELSE_PENDING_SIGNALS				\
Gerd Moellmann's avatar
Gerd Moellmann committed
466 467
  } while (0)

Gerd Moellmann's avatar
Gerd Moellmann committed
468

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

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

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

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

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

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

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

Gerd Moellmann's avatar
Gerd Moellmann committed
540
  stack.byte_string = bytestr;
541
  stack.pc = stack.byte_string_start = SDATA (bytestr);
Gerd Moellmann's avatar
Gerd Moellmann committed
542
  stack.constants = vector;
543 544
  if (MAX_ALLOCA / sizeof (Lisp_Object) <= XFASTINT (maxdepth))
    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 561
      int rest = at & 128;
      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
	abort ();
Gerd Moellmann's avatar
Gerd Moellmann committed
608
      else if (top < stack.bottom - 1)
609
	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

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

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


      FIRST
	{
	CASE (Bvarref7):
Jim Blandy's avatar
Jim Blandy committed
679 680 681
	  op = FETCH2;
	  goto varref;

Tom Tromey's avatar
Tom Tromey committed
682 683 684 685 686 687
	CASE (Bvarref):
	CASE (Bvarref1):
	CASE (Bvarref2):
	CASE (Bvarref3):
	CASE (Bvarref4):
	CASE (Bvarref5):
Jim Blandy's avatar
Jim Blandy committed
688
	  op = op - Bvarref;
689 690 691 692
	  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
693
	CASE (Bvarref6):
694
	  op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
695
	varref:
696 697 698 699 700 701
	  {
	    Lisp_Object v1, v2;

	    v1 = vectorp[op];
	    if (SYMBOLP (v1))
	      {
702 703 704
		if (XSYMBOL (v1)->redirect != SYMBOL_PLAINVAL
		    || (v2 = SYMBOL_VAL (XSYMBOL (v1)),
			EQ (v2, Qunbound)))
705 706 707 708 709
		  {
		    BEFORE_POTENTIAL_GC ();
		    v2 = Fsymbol_value (v1);
		    AFTER_POTENTIAL_GC ();
		  }
710 711
	      }
	    else
712 713 714 715 716
	      {
		BEFORE_POTENTIAL_GC ();
		v2 = Fsymbol_value (v1);
		AFTER_POTENTIAL_GC ();
	      }
717
	    PUSH (v2);
Tom Tromey's avatar
Tom Tromey committed
718
	    NEXT;
719 720
	  }

Tom Tromey's avatar
Tom Tromey committed
721
	CASE (Bgotoifnil):
722 723 724 725 726 727 728 729 730 731 732
	  {
	    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
733
	    NEXT;
734
	  }
Jim Blandy's avatar
Jim Blandy committed
735

Tom Tromey's avatar
Tom Tromey committed
736
	CASE (Bcar):
737 738 739
	  {
	    Lisp_Object v1;
	    v1 = TOP;
740 741 742 743 744 745 746 747 748 749
	    if (CONSP (v1))
	      TOP = XCAR (v1);
	    else if (NILP (v1))
	      TOP = Qnil;
	    else
	      {
		BEFORE_POTENTIAL_GC ();
		wrong_type_argument (Qlistp, v1);
		AFTER_POTENTIAL_GC ();
	      }
Tom Tromey's avatar
Tom Tromey committed
750
	    NEXT;
751 752
	  }

Tom Tromey's avatar
Tom Tromey committed
753
	CASE (Beq):
754 755 756 757
	  {
	    Lisp_Object v1;
	    v1 = POP;
	    TOP = EQ (v1, TOP) ? Qt : Qnil;
Tom Tromey's avatar
Tom Tromey committed
758
	    NEXT;
759 760
	  }

Tom Tromey's avatar
Tom Tromey committed
761
	CASE (Bmemq):
762 763
	  {
	    Lisp_Object v1;
764
	    BEFORE_POTENTIAL_GC ();
765 766
	    v1 = POP;
	    TOP = Fmemq (TOP, v1);
767
	    AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
768
	    NEXT;
769 770
	  }

Tom Tromey's avatar
Tom Tromey committed
771
	CASE (Bcdr):
772 773 774
	  {
	    Lisp_Object v1;
	    v1 = TOP;
775 776 777 778 779 780 781 782 783 784
	    if (CONSP (v1))
	      TOP = XCDR (v1);
	    else if (NILP (v1))
	      TOP = Qnil;
	    else
	      {
		BEFORE_POTENTIAL_GC ();
		wrong_type_argument (Qlistp, v1);
		AFTER_POTENTIAL_GC ();
	      }
Tom Tromey's avatar
Tom Tromey committed
785
	    NEXT;
786
	  }
Jim Blandy's avatar
Jim Blandy committed
787

Tom Tromey's avatar
Tom Tromey committed
788 789 790 791 792 793
	CASE (Bvarset):
	CASE (Bvarset1):
	CASE (Bvarset2):
	CASE (Bvarset3):
	CASE (Bvarset4):
	CASE (Bvarset5):
794
	  op -= Bvarset;
Jim Blandy's avatar
Jim Blandy committed
795 796
	  goto varset;

Tom Tromey's avatar
Tom Tromey committed
797
	CASE (Bvarset7):
798
	  op = FETCH2;
799 800
	  goto varset;

Tom Tromey's avatar
Tom Tromey committed
801
	CASE (Bvarset6):
802
	  op = FETCH;
Jim Blandy's avatar
Jim Blandy committed
803
	varset:
804 805
	  {
	    Lisp_Object sym, val;
806

807
	    sym = vectorp[op];
808
	    val = TOP;
809 810 811 812

	    /* Inline the most common case.  */
	    if (SYMBOLP (sym)
		&& !EQ (val, Qunbound)
813 814 815
		&& !XSYMBOL (sym)->redirect
		&& !SYMBOL_CONSTANT_P (sym))
	      XSYMBOL (sym)->val.value = val;
816
	    else
817 818
	      {
		BEFORE_POTENTIAL_GC ();
819
		set_internal (sym, val, Qnil, 0);
820 821
		AFTER_POTENTIAL_GC ();
	      }
822
	  }
823
	  (void) POP;
Tom Tromey's avatar
Tom Tromey committed
824
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
825

Tom Tromey's avatar
Tom Tromey committed
826
	CASE (Bdup):
827 828 829 830
	  {
	    Lisp_Object v1;
	    v1 = TOP;
	    PUSH (v1);
Tom Tromey's avatar
Tom Tromey committed
831
	    NEXT;
832 833 834 835
	  }

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

Tom Tromey's avatar
Tom Tromey committed
836
	CASE (Bvarbind6):
Jim Blandy's avatar
Jim Blandy committed
837 838 839
	  op = FETCH;
	  goto varbind;

Tom Tromey's avatar
Tom Tromey committed
840
	CASE (Bvarbind7):
Jim Blandy's avatar
Jim Blandy committed
841 842 843
	  op = FETCH2;
	  goto varbind;

Tom Tromey's avatar
Tom Tromey committed
844 845 846 847 848 849
	CASE (Bvarbind):
	CASE (Bvarbind1):
	CASE (Bvarbind2):
	CASE (Bvarbind3):
	CASE (Bvarbind4):
	CASE (Bvarbind5):
Jim Blandy's avatar
Jim Blandy committed
850 851
	  op -= Bvarbind;
	varbind:
852 853
	  /* Specbind can signal and thus GC.  */
	  BEFORE_POTENTIAL_GC ();
Jim Blandy's avatar
Jim Blandy committed
854
	  specbind (vectorp[op], POP);
855
	  AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
856
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
857

Tom Tromey's avatar
Tom Tromey committed
858
	CASE (Bcall6):
Jim Blandy's avatar
Jim Blandy committed
859 860 861
	  op = FETCH;
	  goto docall;

Tom Tromey's avatar
Tom Tromey committed
862
	CASE (Bcall7):
Jim Blandy's avatar
Jim Blandy committed
863 864 865
	  op = FETCH2;
	  goto docall;

Tom Tromey's avatar
Tom Tromey committed
866 867 868 869 870 871
	CASE (Bcall):
	CASE (Bcall1):
	CASE (Bcall2):
	CASE (Bcall3):
	CASE (Bcall4):
	CASE (Bcall5):
Jim Blandy's avatar
Jim Blandy committed
872 873
	  op -= Bcall;
	docall:
874
	  {
875
	    BEFORE_POTENTIAL_GC ();
876
	    DISCARD (op);
877
#ifdef BYTE_CODE_METER
878 879 880 881 882 883 884
	    if (byte_metering_on && SYMBOLP (TOP))
	      {
		Lisp_Object v1, v2;

		v1 = TOP;
		v2 = Fget (v1, Qbyte_code_meter);
		if (INTEGERP (v2)
885
		    && XINT (v2) < MOST_POSITIVE_FIXNUM)
886 887 888 889 890
		  {
		    XSETINT (v2, XINT (v2) + 1);
		    Fput (v1, Qbyte_code_meter, v2);
		  }
	      }
891
#endif
892 893
	    TOP = Ffuncall (op + 1, &TOP);
	    AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
894
	    NEXT;
895
	  }
Jim Blandy's avatar
Jim Blandy committed
896

Tom Tromey's avatar
Tom Tromey committed
897
	CASE (Bunbind6):
Jim Blandy's avatar
Jim Blandy committed
898 899 900
	  op = FETCH;
	  goto dounbind;

Tom Tromey's avatar
Tom Tromey committed
901
	CASE (Bunbind7):
Jim Blandy's avatar
Jim Blandy committed
902 903 904
	  op = FETCH2;
	  goto dounbind;

Tom Tromey's avatar
Tom Tromey committed
905 906 907 908 909 910
	CASE (Bunbind):
	CASE (Bunbind1):
	CASE (Bunbind2):
	CASE (Bunbind3):
	CASE (Bunbind4):
	CASE (Bunbind5):
Jim Blandy's avatar
Jim Blandy committed
911 912
	  op -= Bunbind;
	dounbind:
Gerd Moellmann's avatar
Gerd Moellmann committed
913
	  BEFORE_POTENTIAL_GC ();
Juanma Barranquero's avatar
Juanma Barranquero committed
914
	  unbind_to (SPECPDL_INDEX () - op, Qnil);
Gerd Moellmann's avatar
Gerd Moellmann committed
915
	  AFTER_POTENTIAL_GC ();
Tom Tromey's avatar
Tom Tromey committed
916
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
917

Tom Tromey's avatar
Tom Tromey committed
918
	CASE (Bunbind_all):	/* Obsolete.  Never used.  */
Jim Blandy's avatar
Jim Blandy committed
919
	  /* To unbind back to the beginning of this frame.  Not used yet,
920
	     but will be needed for tail-recursion elimination.  */
Gerd Moellmann's avatar
Gerd Moellmann committed
921
	  BEFORE_POTENTIAL_GC ();
Jim Blandy's avatar
Jim Blandy committed
922
	  unbind_to (count, 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 (Bgoto):
Richard M. Stallman's avatar
Richard M. Stallman committed
927
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
928
	  BYTE_CODE_QUIT;
Jim Blandy's avatar
Jim Blandy committed
929
	  op = FETCH2;    /* pc = FETCH2 loses since FETCH2 contains pc++ */
930
	  CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
931
	  stack.pc = stack.byte_string_start + op;
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 (Bgotoifnonnil):
935 936 937 938 939 940 941 942 943 944 945
	  {
	    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
946
	    NEXT;
947
	  }
Jim Blandy's avatar
Jim Blandy committed
948

Tom Tromey's avatar
Tom Tromey committed
949
	CASE (Bgotoifnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
950
	  MAYBE_GC ();
Jim Blandy's avatar
Jim Blandy committed
951
	  op = FETCH2;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
952
	  if (NILP (TOP))
Jim Blandy's avatar
Jim Blandy committed
953
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
954
	      BYTE_CODE_QUIT;
955
	      CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
956
	      stack.pc = stack.byte_string_start + op;
Jim Blandy's avatar
Jim Blandy committed
957
	    }
958
	  else DISCARD (1);
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 (Bgotoifnonnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
962
	  MAYBE_GC ();
Jim Blandy's avatar
Jim Blandy committed
963
	  op = FETCH2;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
964
	  if (!NILP (TOP))
Jim Blandy's avatar
Jim Blandy committed
965
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
966
	      BYTE_CODE_QUIT;
967
	      CHECK_RANGE (op);
Gerd Moellmann's avatar
Gerd Moellmann committed
968
	      stack.pc = stack.byte_string_start + op;
Jim Blandy's avatar
Jim Blandy committed
969
	    }
970
	  else DISCARD (1);
Tom Tromey's avatar
Tom Tromey committed
971
	  NEXT;
972

Tom Tromey's avatar
Tom Tromey committed
973
	CASE (BRgoto):
Richard M. Stallman's avatar
Richard M. Stallman committed
974
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
975
	  BYTE_CODE_QUIT;
Gerd Moellmann's avatar
Gerd Moellmann committed
976
	  stack.pc += (int) *stack.pc - 127;
Tom Tromey's avatar
Tom Tromey committed
977
	  NEXT;
978

Tom Tromey's avatar
Tom Tromey committed
979
	CASE (BRgotoifnil):
980 981 982 983 984 985 986 987 988 989
	  {
	    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
990
	    NEXT;
991
	  }
992

Tom Tromey's avatar
Tom Tromey committed
993
	CASE (BRgotoifnonnil):
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 (BRgotoifnilelsepop):
Richard M. Stallman's avatar
Richard M. Stallman committed
1008
	  MAYBE_GC ();
Gerd Moellmann's avatar
Gerd Moellmann committed
1009
	  op = *stack.pc++;
1010 1011
	  if (NILP (TOP))
	    {
Gerd Moellmann's avatar
Gerd Moellmann committed
1012
	      BYTE_CODE_QUIT;
Gerd Moellmann's avatar
Gerd Moellmann committed
1013
	      stack.pc += op - 128;
1014 1015
	    }
	  else DISCARD (1);
Tom Tromey's avatar
Tom Tromey committed
1016
	  NEXT;
1017

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

Tom Tromey's avatar
Tom Tromey committed
1029
	CASE (Breturn):
1030
	  result = POP;
Jim Blandy's avatar
Jim Blandy committed
1031 1032
	  goto exit;

Tom Tromey's avatar
Tom Tromey committed
1033
	CASE (Bdiscard):
1034
	  DISCARD (1);
Tom Tromey's avatar
Tom Tromey committed
1035
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
1036

Tom Tromey's avatar
Tom Tromey committed
1037
	CASE (Bconstant2):
Jim Blandy's avatar
Jim Blandy committed
1038
	  PUSH (vectorp[FETCH2]);
Tom Tromey's avatar
Tom Tromey committed
1039
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
1040

Tom Tromey's avatar
Tom Tromey committed
1041
	CASE (Bsave_excursion):
1042 1043
	  record_unwind_protect (save_excursion_restore,
				 save_excursion_save ());
Tom Tromey's avatar
Tom Tromey committed
1044
	  NEXT;
Jim Blandy's avatar
Jim Blandy committed
1045

Tom Tromey's avatar
Tom Tromey committed
1046 1047
	CASE (Bsave_current_buffer): /* Obsolete since ??.  */
	CASE (Bsave_current_buffer_1):
1048
	  record_unwind_protect (set_buffer_if_live, Fcurrent_buffer ());
Tom Tromey's avatar
Tom Tromey committed
1049
	  NEXT;
1050

Tom Tromey's avatar
Tom Tromey committed
1051
	CASE (Bsave_window_excursion): /* Obsolete since 24.1.  */
1052
	  {
1053
	    register ptrdiff_t count1 = SPECPDL_INDEX ();
1054 1055 1056 1057
	    record_unwind_protect (Fset_window_configuration,
				   Fcurrent_window_configuration (Qnil));
	    BEFORE_POTENTIAL_GC ();
	    TOP = Fprogn (TOP);