src/bytecode.c

   1 /* Execution of byte code produced by bytecomp.el.
   2    Copyright (C) 1985, 1986, 1987, 1988, 1993, 2000, 2001, 2002, 2003
   3    Free Software Foundation, Inc.
   4
   5 This file is part of GNU Emacs.
   6
   7 GNU Emacs is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 2, or (at your option)
  10 any later version.
  11
  12 GNU Emacs is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GNU Emacs; see the file COPYING.  If not, write to
  19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  20 Boston, MA 02111-1307, USA.
  21
  22 hacked on by jwz@lucid.com 17-jun-91
  23   o  added a compile-time switch to turn on simple sanity checking;
  24   o  put back the obsolete byte-codes for error-detection;
  25   o  added a new instruction, unbind_all, which I will use for
  26      tail-recursion elimination;
  27   o  made temp_output_buffer_show be called with the right number
  28      of args;
  29   o  made the new bytecodes be called with args in the right order;
  30   o  added metering support.
  31
  32 by Hallvard:
  33   o  added relative jump instructions;
  34   o  all conditionals now only do QUIT if they jump.
  35  */
  36
  37 #include <config.h>
  38 #include "lisp.h"
  39 #include "buffer.h"
  40 #include "charset.h"
  41 #include "syntax.h"
  42 #include "window.h"
  43
  44 #ifdef CHECK_FRAME_FONT
  45 #include "frame.h"
  46 #include "xterm.h"
  47 #endif
  48
  49 /*
  50  * define BYTE_CODE_SAFE to enable some minor sanity checking (useful for
  51  * debugging the byte compiler...)
  52  *
  53  * define BYTE_CODE_METER to enable generation of a byte-op usage histogram.
  54  */
  55 /* #define BYTE_CODE_SAFE */
  56 /* #define BYTE_CODE_METER */
  57
  58 \f
  59 #ifdef BYTE_CODE_METER
  60
  61 Lisp_Object Vbyte_code_meter, Qbyte_code_meter;
  62 int byte_metering_on;
  63
  64 #define METER_2(code1, code2) \
  65   XFASTINT (XVECTOR (XVECTOR (Vbyte_code_meter)->contents[(code1)]) \
  66             ->contents[(code2)])
  67
  68 #define METER_1(code) METER_2 (0, (code))
  69
  70 #define METER_CODE(last_code, this_code)                                \
  71 {                                                                       \
  72   if (byte_metering_on)                                                 \
  73     {                                                                   \
  74       if (METER_1 (this_code) < MOST_POSITIVE_FIXNUM)                   \
  75         METER_1 (this_code)++;                                          \
  76       if (last_code                                                     \
  77           && METER_2 (last_code, this_code) < MOST_POSITIVE_FIXNUM)     \
  78         METER_2 (last_code, this_code)++;                               \
  79     }                                                                   \
  80 }
  81
  82 #else /* no BYTE_CODE_METER */
  83
  84 #define METER_CODE(last_code, this_code)
  85
  86 #endif /* no BYTE_CODE_METER */
  87 \f
  88
  89 Lisp_Object Qbytecode;
  90
  91 /*  Byte codes: */
  92
  93 #define Bvarref 010
  94 #define Bvarset 020
  95 #define Bvarbind 030
  96 #define Bcall 040
  97 #define Bunbind 050
  98
  99 #define Bnth 070
 100 #define Bsymbolp 071
 101 #define Bconsp 072
 102 #define Bstringp 073
 103 #define Blistp 074
 104 #define Beq 075
 105 #define Bmemq 076
 106 #define Bnot 077
 107 #define Bcar 0100
 108 #define Bcdr 0101
 109 #define Bcons 0102
 110 #define Blist1 0103
 111 #define Blist2 0104
 112 #define Blist3 0105
 113 #define Blist4 0106
 114 #define Blength 0107
 115 #define Baref 0110
 116 #define Baset 0111
 117 #define Bsymbol_value 0112
 118 #define Bsymbol_function 0113
 119 #define Bset 0114
 120 #define Bfset 0115
 121 #define Bget 0116
 122 #define Bsubstring 0117
 123 #define Bconcat2 0120
 124 #define Bconcat3 0121
 125 #define Bconcat4 0122
 126 #define Bsub1 0123
 127 #define Badd1 0124
 128 #define Beqlsign 0125
 129 #define Bgtr 0126
 130 #define Blss 0127
 131 #define Bleq 0130
 132 #define Bgeq 0131
 133 #define Bdiff 0132
 134 #define Bnegate 0133
 135 #define Bplus 0134
 136 #define Bmax 0135
 137 #define Bmin 0136
 138 #define Bmult 0137
 139
 140 #define Bpoint 0140
 141 /* Was Bmark in v17.  */
 142 #define Bsave_current_buffer 0141
 143 #define Bgoto_char 0142
 144 #define Binsert 0143
 145 #define Bpoint_max 0144
 146 #define Bpoint_min 0145
 147 #define Bchar_after 0146
 148 #define Bfollowing_char 0147
 149 #define Bpreceding_char 0150
 150 #define Bcurrent_column 0151
 151 #define Bindent_to 0152
 152 #define Bscan_buffer 0153 /* No longer generated as of v18 */
 153 #define Beolp 0154
 154 #define Beobp 0155
 155 #define Bbolp 0156
 156 #define Bbobp 0157
 157 #define Bcurrent_buffer 0160
 158 #define Bset_buffer 0161
 159 #define Bsave_current_buffer_1 0162 /* Replacing Bsave_current_buffer.  */
 160 #define Bread_char 0162 /* No longer generated as of v19 */
 161 #define Bset_mark 0163 /* this loser is no longer generated as of v18 */
 162 #define Binteractive_p 0164 /* Needed since interactive-p takes unevalled args */
 163
 164 #define Bforward_char 0165
 165 #define Bforward_word 0166
 166 #define Bskip_chars_forward 0167
 167 #define Bskip_chars_backward 0170
 168 #define Bforward_line 0171
 169 #define Bchar_syntax 0172
 170 #define Bbuffer_substring 0173
 171 #define Bdelete_region 0174
 172 #define Bnarrow_to_region 0175
 173 #define Bwiden 0176
 174 #define Bend_of_line 0177
 175
 176 #define Bconstant2 0201
 177 #define Bgoto 0202
 178 #define Bgotoifnil 0203
 179 #define Bgotoifnonnil 0204
 180 #define Bgotoifnilelsepop 0205
 181 #define Bgotoifnonnilelsepop 0206
 182 #define Breturn 0207
 183 #define Bdiscard 0210
 184 #define Bdup 0211
 185
 186 #define Bsave_excursion 0212
 187 #define Bsave_window_excursion 0213
 188 #define Bsave_restriction 0214
 189 #define Bcatch 0215
 190
 191 #define Bunwind_protect 0216
 192 #define Bcondition_case 0217
 193 #define Btemp_output_buffer_setup 0220
 194 #define Btemp_output_buffer_show 0221
 195
 196 #define Bunbind_all 0222
 197
 198 #define Bset_marker 0223
 199 #define Bmatch_beginning 0224
 200 #define Bmatch_end 0225
 201 #define Bupcase 0226
 202 #define Bdowncase 0227
 203
 204 #define Bstringeqlsign 0230
 205 #define Bstringlss 0231
 206 #define Bequal 0232
 207 #define Bnthcdr 0233
 208 #define Belt 0234
 209 #define Bmember 0235
 210 #define Bassq 0236
 211 #define Bnreverse 0237
 212 #define Bsetcar 0240
 213 #define Bsetcdr 0241
 214 #define Bcar_safe 0242
 215 #define Bcdr_safe 0243
 216 #define Bnconc 0244
 217 #define Bquo 0245
 218 #define Brem 0246
 219 #define Bnumberp 0247
 220 #define Bintegerp 0250
 221
 222 #define BRgoto 0252
 223 #define BRgotoifnil 0253
 224 #define BRgotoifnonnil 0254
 225 #define BRgotoifnilelsepop 0255
 226 #define BRgotoifnonnilelsepop 0256
 227
 228 #define BlistN 0257
 229 #define BconcatN 0260
 230 #define BinsertN 0261
 231
 232 #define Bconstant 0300
 233 #define CONSTANTLIM 0100
 234
 235 \f
 236 /* Structure describing a value stack used during byte-code execution
 237    in Fbyte_code.  */
 238
 239 struct byte_stack
 240 {
 241   /* Program counter.  This points into the byte_string below
 242      and is relocated when that string is relocated.  */
 243   const unsigned char *pc;
 244
 245   /* Top and bottom of stack.  The bottom points to an area of memory
 246      allocated with alloca in Fbyte_code.  */
 247   Lisp_Object *top, *bottom;
 248
 249   /* The string containing the byte-code, and its current address.
 250      Storing this here protects it from GC because mark_byte_stack
 251      marks it.  */
 252   Lisp_Object byte_string;
 253   const unsigned char *byte_string_start;
 254
 255   /* The vector of constants used during byte-code execution.  Storing
 256      this here protects it from GC because mark_byte_stack marks it.  */
 257   Lisp_Object constants;
 258
 259   /* Next entry in byte_stack_list.  */
 260   struct byte_stack *next;
 261 };
 262
 263 /* A list of currently active byte-code execution value stacks.
 264    Fbyte_code adds an entry to the head of this list before it starts
 265    processing byte-code, and it removed the entry again when it is
 266    done.  Signalling an error truncates the list analoguous to
 267    gcprolist.  */
 268
 269 struct byte_stack *byte_stack_list;
 270
 271 \f
 272 /* Mark objects on byte_stack_list.  Called during GC.  */
 273
 274 void
 275 mark_byte_stack ()
 276 {
 277   struct byte_stack *stack;
 278   Lisp_Object *obj;
 279
 280   for (stack = byte_stack_list; stack; stack = stack->next)
 281     {
 282       /* If STACK->top is null here, this means there's an opcode in
 283          Fbyte_code that wasn't expected to GC, but did.  To find out
 284          which opcode this is, record the value of `stack', and walk
 285          up the stack in a debugger, stopping in frames of Fbyte_code.
 286          The culprit is found in the frame of Fbyte_code where the
 287          address of its local variable `stack' is equal to the
 288          recorded value of `stack' here.  */
 289       eassert (stack->top);
 290
 291       for (obj = stack->bottom; obj <= stack->top; ++obj)
 292         mark_object (*obj);
 293
 294       mark_object (stack->byte_string);
 295       mark_object (stack->constants);
 296     }
 297 }
 298
 299
 300 /* Unmark objects in the stacks on byte_stack_list.  Relocate program
 301    counters.  Called when GC has completed.  */
 302
 303 void
 304 unmark_byte_stack ()
 305 {
 306   struct byte_stack *stack;
 307
 308   for (stack = byte_stack_list; stack; stack = stack->next)
 309     {
 310       if (stack->byte_string_start != SDATA (stack->byte_string))
 311         {
 312           int offset = stack->pc - stack->byte_string_start;
 313           stack->byte_string_start = SDATA (stack->byte_string);
 314           stack->pc = stack->byte_string_start + offset;
 315         }
 316     }
 317 }
 318
 319 \f
 320 /* Fetch the next byte from the bytecode stream */
 321
 322 #define FETCH *stack.pc++
 323
 324 /* Fetch two bytes from the bytecode stream and make a 16-bit number
 325    out of them */
 326
 327 #define FETCH2 (op = FETCH, op + (FETCH << 8))
 328
 329 /* Push x onto the execution stack.  This used to be #define PUSH(x)
 330    (*++stackp = (x)) This oddity is necessary because Alliant can't be
 331    bothered to compile the preincrement operator properly, as of 4/91.
 332    -JimB */
 333
 334 #define PUSH(x) (top++, *top = (x))
 335
 336 /* Pop a value off the execution stack.  */
 337
 338 #define POP (*top--)
 339
 340 /* Discard n values from the execution stack.  */
 341
 342 #define DISCARD(n) (top -= (n))
 343
 344 /* Get the value which is at the top of the execution stack, but don't
 345    pop it. */
 346
 347 #define TOP (*top)
 348
 349 /* Actions that must be performed before and after calling a function
 350    that might GC.  */
 351
 352 #define BEFORE_POTENTIAL_GC()   stack.top = top
 353 #define AFTER_POTENTIAL_GC()    stack.top = NULL
 354
 355 /* Garbage collect if we have consed enough since the last time.
 356    We do this at every branch, to avoid loops that never GC.  */
 357
 358 #define MAYBE_GC()                              \
 359   if (consing_since_gc > gc_cons_threshold)     \
 360     {                                           \
 361       BEFORE_POTENTIAL_GC ();                   \
 362       Fgarbage_collect ();                      \
 363       AFTER_POTENTIAL_GC ();                    \
 364     }                                           \
 365   else
 366
 367 /* Check for jumping out of range.  */
 368
 369 #ifdef BYTE_CODE_SAFE
 370
 371 #define CHECK_RANGE(ARG) \
 372   if (ARG >= bytestr_length) abort ()
 373
 374 #else /* not BYTE_CODE_SAFE */
 375
 376 #define CHECK_RANGE(ARG)
 377
 378 #endif /* not BYTE_CODE_SAFE */
 379
 380 /* A version of the QUIT macro which makes sure that the stack top is
 381    set before signaling `quit'.  */
 382
 383 #define BYTE_CODE_QUIT                                  \
 384   do {                                                  \
 385     if (!NILP (Vquit_flag) && NILP (Vinhibit_quit))     \
 386       {                                                 \
 387         Vquit_flag = Qnil;                              \
 388         BEFORE_POTENTIAL_GC ();                         \
 389         Fsignal (Qquit, Qnil);                          \
 390       }                                                 \
 391   } while (0)
 392
 393
 394 DEFUN ("byte-code", Fbyte_code, Sbyte_code, 3, 3, 0,
 395        doc: /* Function used internally in byte-compiled code.
 396 The first argument, BYTESTR, is a string of byte code;
 397 the second, VECTOR, a vector of constants;
 398 the third, MAXDEPTH, the maximum stack depth used in this function.
 399 If the third argument is incorrect, Emacs may crash.  */)
 400      (bytestr, vector, maxdepth)
 401      Lisp_Object bytestr, vector, maxdepth;
 402 {
 403   int count = SPECPDL_INDEX ();
 404 #ifdef BYTE_CODE_METER
 405   int this_op = 0;
 406   int prev_op;
 407 #endif
 408   int op;
 409   /* Lisp_Object v1, v2; */
 410   Lisp_Object *vectorp;
 411 #ifdef BYTE_CODE_SAFE
 412   int const_length = XVECTOR (vector)->size;
 413   Lisp_Object *stacke;
 414 #endif
 415   int bytestr_length;
 416   struct byte_stack stack;
 417   Lisp_Object *top;
 418   Lisp_Object result;
 419
 420 #ifdef CHECK_FRAME_FONT
 421  {
 422    struct frame *f = SELECTED_FRAME ();
 423    if (FRAME_X_P (f)
 424        && FRAME_FONT (f)->direction != 0
 425        && FRAME_FONT (f)->direction != 1)
 426      abort ();
 427  }
 428 #endif
 429
 430   CHECK_STRING (bytestr);
 431   if (!VECTORP (vector))
 432     vector = wrong_type_argument (Qvectorp, vector);
 433   CHECK_NUMBER (maxdepth);
 434
 435   if (STRING_MULTIBYTE (bytestr))
 436     /* BYTESTR must have been produced by Emacs 20.2 or the earlier
 437        because they produced a raw 8-bit string for byte-code and now
 438        such a byte-code string is loaded as multibyte while raw 8-bit
 439        characters converted to multibyte form.  Thus, now we must
 440        convert them back to the originally intended unibyte form.  */
 441     bytestr = Fstring_as_unibyte (bytestr);
 442
 443   bytestr_length = SBYTES (bytestr);
 444   vectorp = XVECTOR (vector)->contents;
 445
 446   stack.byte_string = bytestr;
 447   stack.pc = stack.byte_string_start = SDATA (bytestr);
 448   stack.constants = vector;
 449   stack.bottom = (Lisp_Object *) alloca (XFASTINT (maxdepth)
 450                                          * sizeof (Lisp_Object));
 451   top = stack.bottom - 1;
 452   stack.top = NULL;
 453   stack.next = byte_stack_list;
 454   byte_stack_list = &stack;
 455
 456 #ifdef BYTE_CODE_SAFE
 457   stacke = stack.bottom - 1 + XFASTINT (maxdepth);
 458 #endif
 459
 460   while (1)
 461     {
 462 #ifdef BYTE_CODE_SAFE
 463       if (top > stacke)
 464         abort ();
 465       else if (top < stack.bottom - 1)
 466         abort ();
 467 #endif
 468
 469 #ifdef BYTE_CODE_METER
 470       prev_op = this_op;
 471       this_op = op = FETCH;
 472       METER_CODE (prev_op, op);
 473 #else
 474       op = FETCH;
 475 #endif
 476
 477       switch (op)
 478         {
 479         case Bvarref + 7:
 480           op = FETCH2;
 481           goto varref;
 482
 483         case Bvarref:
 484         case Bvarref + 1:
 485         case Bvarref + 2:
 486         case Bvarref + 3:
 487         case Bvarref + 4:
 488         case Bvarref + 5:
 489           op = op - Bvarref;
 490           goto varref;
 491
 492         /* This seems to be the most frequently executed byte-code
 493            among the Bvarref's, so avoid a goto here.  */
 494         case Bvarref+6:
 495           op = FETCH;
 496         varref:
 497           {
 498             Lisp_Object v1, v2;
 499
 500             v1 = vectorp[op];
 501             if (SYMBOLP (v1))
 502               {
 503                 v2 = SYMBOL_VALUE (v1);
 504                 if (MISCP (v2) || EQ (v2, Qunbound))
 505                   {
 506                     BEFORE_POTENTIAL_GC ();
 507                     v2 = Fsymbol_value (v1);
 508                     AFTER_POTENTIAL_GC ();
 509                   }
 510               }
 511             else
 512               {
 513                 BEFORE_POTENTIAL_GC ();
 514                 v2 = Fsymbol_value (v1);
 515                 AFTER_POTENTIAL_GC ();
 516               }
 517             PUSH (v2);
 518             break;
 519           }
 520
 521         case Bgotoifnil:
 522           MAYBE_GC ();
 523           op = FETCH2;
 524           if (NILP (POP))
 525             {
 526               BYTE_CODE_QUIT;
 527               CHECK_RANGE (op);
 528               stack.pc = stack.byte_string_start + op;
 529             }
 530           break;
 531
 532         case Bcar:
 533           {
 534             Lisp_Object v1;
 535             v1 = TOP;
 536             if (CONSP (v1))
 537               TOP = XCAR (v1);
 538             else if (NILP (v1))
 539               TOP = Qnil;
 540             else
 541               {
 542                 BEFORE_POTENTIAL_GC ();
 543                 Fcar (wrong_type_argument (Qlistp, v1));
 544                 AFTER_POTENTIAL_GC ();
 545               }
 546             break;
 547           }
 548
 549         case Beq:
 550           {
 551             Lisp_Object v1;
 552             v1 = POP;
 553             TOP = EQ (v1, TOP) ? Qt : Qnil;
 554             break;
 555           }
 556
 557         case Bmemq:
 558           {
 559             Lisp_Object v1;
 560             BEFORE_POTENTIAL_GC ();
 561             v1 = POP;
 562             TOP = Fmemq (TOP, v1);
 563             AFTER_POTENTIAL_GC ();
 564             break;
 565           }
 566
 567         case Bcdr:
 568           {
 569             Lisp_Object v1;
 570             v1 = TOP;
 571             if (CONSP (v1))
 572               TOP = XCDR (v1);
 573             else if (NILP (v1))
 574               TOP = Qnil;
 575             else
 576               {
 577                 BEFORE_POTENTIAL_GC ();
 578                 Fcdr (wrong_type_argument (Qlistp, v1));
 579                 AFTER_POTENTIAL_GC ();
 580               }
 581             break;
 582           }
 583
 584         case Bvarset:
 585         case Bvarset+1:
 586         case Bvarset+2:
 587         case Bvarset+3:
 588         case Bvarset+4:
 589         case Bvarset+5:
 590           op -= Bvarset;
 591           goto varset;
 592
 593         case Bvarset+7:
 594           op = FETCH2;
 595           goto varset;
 596
 597         case Bvarset+6:
 598           op = FETCH;
 599         varset:
 600           {
 601             Lisp_Object sym, val;
 602
 603             sym = vectorp[op];
 604             val = TOP;
 605
 606             /* Inline the most common case.  */
 607             if (SYMBOLP (sym)
 608                 && !EQ (val, Qunbound)
 609                 && !XSYMBOL (sym)->indirect_variable
 610                 && !XSYMBOL (sym)->constant
 611                 && !MISCP (XSYMBOL (sym)->value))
 612               XSYMBOL (sym)->value = val;
 613             else
 614               {
 615                 BEFORE_POTENTIAL_GC ();
 616                 set_internal (sym, val, current_buffer, 0);
 617                 AFTER_POTENTIAL_GC ();
 618               }
 619           }
 620           (void) POP;
 621           break;
 622
 623         case Bdup:
 624           {
 625             Lisp_Object v1;
 626             v1 = TOP;
 627             PUSH (v1);
 628             break;
 629           }
 630
 631         /* ------------------ */
 632
 633         case Bvarbind+6:
 634           op = FETCH;
 635           goto varbind;
 636
 637         case Bvarbind+7:
 638           op = FETCH2;
 639           goto varbind;
 640
 641         case Bvarbind:
 642         case Bvarbind+1:
 643         case Bvarbind+2:
 644         case Bvarbind+3:
 645         case Bvarbind+4:
 646         case Bvarbind+5:
 647           op -= Bvarbind;
 648         varbind:
 649           /* Specbind can signal and thus GC.  */
 650           BEFORE_POTENTIAL_GC ();
 651           specbind (vectorp[op], POP);
 652           AFTER_POTENTIAL_GC ();
 653           break;
 654
 655         case Bcall+6:
 656           op = FETCH;
 657           goto docall;
 658
 659         case Bcall+7:
 660           op = FETCH2;
 661           goto docall;
 662
 663         case Bcall:
 664         case Bcall+1:
 665         case Bcall+2:
 666         case Bcall+3:
 667         case Bcall+4:
 668         case Bcall+5:
 669           op -= Bcall;
 670         docall:
 671           {
 672             BEFORE_POTENTIAL_GC ();
 673             DISCARD (op);
 674 #ifdef BYTE_CODE_METER
 675             if (byte_metering_on && SYMBOLP (TOP))
 676               {
 677                 Lisp_Object v1, v2;
 678
 679                 v1 = TOP;
 680                 v2 = Fget (v1, Qbyte_code_meter);
 681                 if (INTEGERP (v2)
 682                     && XINT (v2) < MOST_POSITIVE_FIXNUM)
 683                   {
 684                     XSETINT (v2, XINT (v2) + 1);
 685                     Fput (v1, Qbyte_code_meter, v2);
 686                   }
 687               }
 688 #endif
 689             TOP = Ffuncall (op + 1, &TOP);
 690             AFTER_POTENTIAL_GC ();
 691             break;
 692           }
 693
 694         case Bunbind+6:
 695           op = FETCH;
 696           goto dounbind;
 697
 698         case Bunbind+7:
 699           op = FETCH2;
 700           goto dounbind;
 701
 702         case Bunbind:
 703         case Bunbind+1:
 704         case Bunbind+2:
 705         case Bunbind+3:
 706         case Bunbind+4:
 707         case Bunbind+5:
 708           op -= Bunbind;
 709         dounbind:
 710           BEFORE_POTENTIAL_GC ();
 711           unbind_to (SPECPDL_INDEX () - op, Qnil);
 712           AFTER_POTENTIAL_GC ();
 713           break;
 714
 715         case Bunbind_all:
 716           /* To unbind back to the beginning of this frame.  Not used yet,
 717              but will be needed for tail-recursion elimination.  */
 718           BEFORE_POTENTIAL_GC ();
 719           unbind_to (count, Qnil);
 720           AFTER_POTENTIAL_GC ();
 721           break;
 722
 723         case Bgoto:
 724           MAYBE_GC ();
 725           BYTE_CODE_QUIT;
 726           op = FETCH2;    /* pc = FETCH2 loses since FETCH2 contains pc++ */
 727           CHECK_RANGE (op);
 728           stack.pc = stack.byte_string_start + op;
 729           break;
 730
 731         case Bgotoifnonnil:
 732           MAYBE_GC ();
 733           op = FETCH2;
 734           if (!NILP (POP))
 735             {
 736               BYTE_CODE_QUIT;
 737               CHECK_RANGE (op);
 738               stack.pc = stack.byte_string_start + op;
 739             }
 740           break;
 741
 742         case Bgotoifnilelsepop:
 743           MAYBE_GC ();
 744           op = FETCH2;
 745           if (NILP (TOP))
 746             {
 747               BYTE_CODE_QUIT;
 748               CHECK_RANGE (op);
 749               stack.pc = stack.byte_string_start + op;
 750             }
 751           else DISCARD (1);
 752           break;
 753
 754         case Bgotoifnonnilelsepop:
 755           MAYBE_GC ();
 756           op = FETCH2;
 757           if (!NILP (TOP))
 758             {
 759               BYTE_CODE_QUIT;
 760               CHECK_RANGE (op);
 761               stack.pc = stack.byte_string_start + op;
 762             }
 763           else DISCARD (1);
 764           break;
 765
 766         case BRgoto:
 767           MAYBE_GC ();
 768           BYTE_CODE_QUIT;
 769           stack.pc += (int) *stack.pc - 127;
 770           break;
 771
 772         case BRgotoifnil:
 773           MAYBE_GC ();
 774           if (NILP (POP))
 775             {
 776               BYTE_CODE_QUIT;
 777               stack.pc += (int) *stack.pc - 128;
 778             }
 779           stack.pc++;
 780           break;
 781
 782         case BRgotoifnonnil:
 783           MAYBE_GC ();
 784           if (!NILP (POP))
 785             {
 786               BYTE_CODE_QUIT;
 787               stack.pc += (int) *stack.pc - 128;
 788             }
 789           stack.pc++;
 790           break;
 791
 792         case BRgotoifnilelsepop:
 793           MAYBE_GC ();
 794           op = *stack.pc++;
 795           if (NILP (TOP))
 796             {
 797               BYTE_CODE_QUIT;
 798               stack.pc += op - 128;
 799             }
 800           else DISCARD (1);
 801           break;
 802
 803         case BRgotoifnonnilelsepop:
 804           MAYBE_GC ();
 805           op = *stack.pc++;
 806           if (!NILP (TOP))
 807             {
 808               BYTE_CODE_QUIT;
 809               stack.pc += op - 128;
 810             }
 811           else DISCARD (1);
 812           break;
 813
 814         case Breturn:
 815           result = POP;
 816           goto exit;
 817
 818         case Bdiscard:
 819           DISCARD (1);
 820           break;
 821
 822         case Bconstant2:
 823           PUSH (vectorp[FETCH2]);
 824           break;
 825
 826         case Bsave_excursion:
 827           record_unwind_protect (save_excursion_restore,
 828                                  save_excursion_save ());
 829           break;
 830
 831         case Bsave_current_buffer:
 832         case Bsave_current_buffer_1:
 833           record_unwind_protect (set_buffer_if_live, Fcurrent_buffer ());
 834           break;
 835
 836         case Bsave_window_excursion:
 837           BEFORE_POTENTIAL_GC ();
 838           TOP = Fsave_window_excursion (TOP);
 839           AFTER_POTENTIAL_GC ();
 840           break;
 841
 842         case Bsave_restriction:
 843           record_unwind_protect (save_restriction_restore,
 844                                  save_restriction_save ());
 845           break;
 846
 847         case Bcatch:
 848           {
 849             Lisp_Object v1;
 850             BEFORE_POTENTIAL_GC ();
 851             v1 = POP;
 852             TOP = internal_catch (TOP, Feval, v1);
 853             AFTER_POTENTIAL_GC ();
 854             break;
 855           }
 856
 857         case Bunwind_protect:
 858           record_unwind_protect (Fprogn, POP);
 859           break;
 860
 861         case Bcondition_case:
 862           {
 863             Lisp_Object v1;
 864             v1 = POP;
 865             v1 = Fcons (POP, v1);
 866             BEFORE_POTENTIAL_GC ();
 867             TOP = Fcondition_case (Fcons (TOP, v1));
 868             AFTER_POTENTIAL_GC ();
 869             break;
 870           }
 871
 872         case Btemp_output_buffer_setup:
 873           BEFORE_POTENTIAL_GC ();
 874           CHECK_STRING (TOP);
 875           temp_output_buffer_setup (SDATA (TOP));
 876           AFTER_POTENTIAL_GC ();
 877           TOP = Vstandard_output;
 878           break;
 879
 880         case Btemp_output_buffer_show:
 881           {
 882             Lisp_Object v1;
 883             BEFORE_POTENTIAL_GC ();
 884             v1 = POP;
 885             temp_output_buffer_show (TOP);
 886             TOP = v1;
 887             /* pop binding of standard-output */
 888             unbind_to (SPECPDL_INDEX () - 1, Qnil);
 889             AFTER_POTENTIAL_GC ();
 890             break;
 891           }
 892
 893         case Bnth:
 894           {
 895             Lisp_Object v1, v2;
 896             BEFORE_POTENTIAL_GC ();
 897             v1 = POP;
 898             v2 = TOP;
 899             CHECK_NUMBER (v2);
 900             AFTER_POTENTIAL_GC ();
 901             op = XINT (v2);
 902             immediate_quit = 1;
 903             while (--op >= 0)
 904               {
 905                 if (CONSP (v1))
 906                   v1 = XCDR (v1);
 907                 else if (!NILP (v1))
 908                   {
 909                     immediate_quit = 0;
 910                     BEFORE_POTENTIAL_GC ();
 911                     v1 = wrong_type_argument (Qlistp, v1);
 912                     AFTER_POTENTIAL_GC ();
 913                     immediate_quit = 1;
 914                     op++;
 915                   }
 916               }
 917             immediate_quit = 0;
 918             if (CONSP (v1))
 919               TOP = XCAR (v1);
 920             else if (NILP (v1))
 921               TOP = Qnil;
 922             else
 923               {
 924                 BEFORE_POTENTIAL_GC ();
 925                 Fcar (wrong_type_argument (Qlistp, v1));
 926                 AFTER_POTENTIAL_GC ();
 927               }
 928             break;
 929           }
 930
 931         case Bsymbolp:
 932           TOP = SYMBOLP (TOP) ? Qt : Qnil;
 933           break;
 934
 935         case Bconsp:
 936           TOP = CONSP (TOP) ? Qt : Qnil;
 937           break;
 938
 939         case Bstringp:
 940           TOP = STRINGP (TOP) ? Qt : Qnil;
 941           break;
 942
 943         case Blistp:
 944           TOP = CONSP (TOP) || NILP (TOP) ? Qt : Qnil;
 945           break;
 946
 947         case Bnot:
 948           TOP = NILP (TOP) ? Qt : Qnil;
 949           break;
 950
 951         case Bcons:
 952           {
 953             Lisp_Object v1;
 954             v1 = POP;
 955             TOP = Fcons (TOP, v1);
 956             break;
 957           }
 958
 959         case Blist1:
 960           TOP = Fcons (TOP, Qnil);
 961           break;
 962
 963         case Blist2:
 964           {
 965             Lisp_Object v1;
 966             v1 = POP;
 967             TOP = Fcons (TOP, Fcons (v1, Qnil));
 968             break;
 969           }
 970
 971         case Blist3:
 972           DISCARD (2);
 973           TOP = Flist (3, &TOP);
 974           break;
 975
 976         case Blist4:
 977           DISCARD (3);
 978           TOP = Flist (4, &TOP);
 979           break;
 980
 981         case BlistN:
 982           op = FETCH;
 983           DISCARD (op - 1);
 984           TOP = Flist (op, &TOP);
 985           break;
 986
 987         case Blength:
 988           BEFORE_POTENTIAL_GC ();
 989           TOP = Flength (TOP);
 990           AFTER_POTENTIAL_GC ();
 991           break;
 992
 993         case Baref:
 994           {
 995             Lisp_Object v1;
 996             BEFORE_POTENTIAL_GC ();
 997             v1 = POP;
 998             TOP = Faref (TOP, v1);
 999             AFTER_POTENTIAL_GC ();
1000             break;
1001           }
1002
1003         case Baset:
1004           {
1005             Lisp_Object v1, v2;
1006             BEFORE_POTENTIAL_GC ();
1007             v2 = POP; v1 = POP;
1008             TOP = Faset (TOP, v1, v2);
1009             AFTER_POTENTIAL_GC ();
1010             break;
1011           }
1012
1013         case Bsymbol_value:
1014           BEFORE_POTENTIAL_GC ();
1015           TOP = Fsymbol_value (TOP);
1016           AFTER_POTENTIAL_GC ();
1017           break;
1018
1019         case Bsymbol_function:
1020           BEFORE_POTENTIAL_GC ();
1021           TOP = Fsymbol_function (TOP);
1022           AFTER_POTENTIAL_GC ();
1023           break;
1024
1025         case Bset:
1026           {
1027             Lisp_Object v1;
1028             BEFORE_POTENTIAL_GC ();
1029             v1 = POP;
1030             TOP = Fset (TOP, v1);
1031             AFTER_POTENTIAL_GC ();
1032             break;
1033           }
1034
1035         case Bfset:
1036           {
1037             Lisp_Object v1;
1038             BEFORE_POTENTIAL_GC ();
1039             v1 = POP;
1040             TOP = Ffset (TOP, v1);
1041             AFTER_POTENTIAL_GC ();
1042             break;
1043           }
1044
1045         case Bget:
1046           {
1047             Lisp_Object v1;
1048             BEFORE_POTENTIAL_GC ();
1049             v1 = POP;
1050             TOP = Fget (TOP, v1);
1051             AFTER_POTENTIAL_GC ();
1052             break;
1053           }
1054
1055         case Bsubstring:
1056           {
1057             Lisp_Object v1, v2;
1058             BEFORE_POTENTIAL_GC ();
1059             v2 = POP; v1 = POP;
1060             TOP = Fsubstring (TOP, v1, v2);
1061             AFTER_POTENTIAL_GC ();
1062             break;
1063           }
1064
1065         case Bconcat2:
1066           BEFORE_POTENTIAL_GC ();
1067           DISCARD (1);
1068           TOP = Fconcat (2, &TOP);
1069           AFTER_POTENTIAL_GC ();
1070           break;
1071
1072         case Bconcat3:
1073           BEFORE_POTENTIAL_GC ();
1074           DISCARD (2);
1075           TOP = Fconcat (3, &TOP);
1076           AFTER_POTENTIAL_GC ();
1077           break;
1078
1079         case Bconcat4:
1080           BEFORE_POTENTIAL_GC ();
1081           DISCARD (3);
1082           TOP = Fconcat (4, &TOP);
1083           AFTER_POTENTIAL_GC ();
1084           break;
1085
1086         case BconcatN:
1087           op = FETCH;
1088           BEFORE_POTENTIAL_GC ();
1089           DISCARD (op - 1);
1090           TOP = Fconcat (op, &TOP);
1091           AFTER_POTENTIAL_GC ();
1092           break;
1093
1094         case Bsub1:
1095           {
1096             Lisp_Object v1;
1097             v1 = TOP;
1098             if (INTEGERP (v1))
1099               {
1100                 XSETINT (v1, XINT (v1) - 1);
1101                 TOP = v1;
1102               }
1103             else
1104               {
1105                 BEFORE_POTENTIAL_GC ();
1106                 TOP = Fsub1 (v1);
1107                 AFTER_POTENTIAL_GC ();
1108               }
1109             break;
1110           }
1111
1112         case Badd1:
1113           {
1114             Lisp_Object v1;
1115             v1 = TOP;
1116             if (INTEGERP (v1))
1117               {
1118                 XSETINT (v1, XINT (v1) + 1);
1119                 TOP = v1;
1120               }
1121             else
1122               {
1123                 BEFORE_POTENTIAL_GC ();
1124                 TOP = Fadd1 (v1);
1125                 AFTER_POTENTIAL_GC ();
1126               }
1127             break;
1128           }
1129
1130         case Beqlsign:
1131           {
1132             Lisp_Object v1, v2;
1133             BEFORE_POTENTIAL_GC ();
1134             v2 = POP; v1 = TOP;
1135             CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v1);
1136             CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v2);
1137             AFTER_POTENTIAL_GC ();
1138             if (FLOATP (v1) || FLOATP (v2))
1139               {
1140                 double f1, f2;
1141
1142                 f1 = (FLOATP (v1) ? XFLOAT_DATA (v1) : XINT (v1));
1143                 f2 = (FLOATP (v2) ? XFLOAT_DATA (v2) : XINT (v2));
1144                 TOP = (f1 == f2 ? Qt : Qnil);
1145               }
1146             else
1147               TOP = (XINT (v1) == XINT (v2) ? Qt : Qnil);
1148             break;
1149           }
1150
1151         case Bgtr:
1152           {
1153             Lisp_Object v1;
1154             BEFORE_POTENTIAL_GC ();
1155             v1 = POP;
1156             TOP = Fgtr (TOP, v1);
1157             AFTER_POTENTIAL_GC ();
1158             break;
1159           }
1160
1161         case Blss:
1162           {
1163             Lisp_Object v1;
1164             BEFORE_POTENTIAL_GC ();
1165             v1 = POP;
1166             TOP = Flss (TOP, v1);
1167             AFTER_POTENTIAL_GC ();
1168             break;
1169           }
1170
1171         case Bleq:
1172           {
1173             Lisp_Object v1;
1174             BEFORE_POTENTIAL_GC ();
1175             v1 = POP;
1176             TOP = Fleq (TOP, v1);
1177             AFTER_POTENTIAL_GC ();
1178             break;
1179           }
1180
1181         case Bgeq:
1182           {
1183             Lisp_Object v1;
1184             BEFORE_POTENTIAL_GC ();
1185             v1 = POP;
1186             TOP = Fgeq (TOP, v1);
1187             AFTER_POTENTIAL_GC ();
1188             break;
1189           }
1190
1191         case Bdiff:
1192           BEFORE_POTENTIAL_GC ();
1193           DISCARD (1);
1194           TOP = Fminus (2, &TOP);
1195           AFTER_POTENTIAL_GC ();
1196           break;
1197
1198         case Bnegate:
1199           {
1200             Lisp_Object v1;
1201             v1 = TOP;
1202             if (INTEGERP (v1))
1203               {
1204                 XSETINT (v1, - XINT (v1));
1205                 TOP = v1;
1206               }
1207             else
1208               {
1209                 BEFORE_POTENTIAL_GC ();
1210                 TOP = Fminus (1, &TOP);
1211                 AFTER_POTENTIAL_GC ();
1212               }
1213             break;
1214           }
1215
1216         case Bplus:
1217           BEFORE_POTENTIAL_GC ();
1218           DISCARD (1);
1219           TOP = Fplus (2, &TOP);
1220           AFTER_POTENTIAL_GC ();
1221           break;
1222
1223         case Bmax:
1224           BEFORE_POTENTIAL_GC ();
1225           DISCARD (1);
1226           TOP = Fmax (2, &TOP);
1227           AFTER_POTENTIAL_GC ();
1228           break;
1229
1230         case Bmin:
1231           BEFORE_POTENTIAL_GC ();
1232           DISCARD (1);
1233           TOP = Fmin (2, &TOP);
1234           AFTER_POTENTIAL_GC ();
1235           break;
1236
1237         case Bmult:
1238           BEFORE_POTENTIAL_GC ();
1239           DISCARD (1);
1240           TOP = Ftimes (2, &TOP);
1241           AFTER_POTENTIAL_GC ();
1242           break;
1243
1244         case Bquo:
1245           BEFORE_POTENTIAL_GC ();
1246           DISCARD (1);
1247           TOP = Fquo (2, &TOP);
1248           AFTER_POTENTIAL_GC ();
1249           break;
1250
1251         case Brem:
1252           {
1253             Lisp_Object v1;
1254             BEFORE_POTENTIAL_GC ();
1255             v1 = POP;
1256             TOP = Frem (TOP, v1);
1257             AFTER_POTENTIAL_GC ();
1258             break;
1259           }
1260
1261         case Bpoint:
1262           {
1263             Lisp_Object v1;
1264             XSETFASTINT (v1, PT);
1265             PUSH (v1);
1266             break;
1267           }
1268
1269         case Bgoto_char:
1270           BEFORE_POTENTIAL_GC ();
1271           TOP = Fgoto_char (TOP);
1272           AFTER_POTENTIAL_GC ();
1273           break;
1274
1275         case Binsert:
1276           BEFORE_POTENTIAL_GC ();
1277           TOP = Finsert (1, &TOP);
1278           AFTER_POTENTIAL_GC ();
1279           break;
1280
1281         case BinsertN:
1282           op = FETCH;
1283           BEFORE_POTENTIAL_GC ();
1284           DISCARD (op - 1);
1285           TOP = Finsert (op, &TOP);
1286           AFTER_POTENTIAL_GC ();
1287           break;
1288
1289         case Bpoint_max:
1290           {
1291             Lisp_Object v1;
1292             XSETFASTINT (v1, ZV);
1293             PUSH (v1);
1294             break;
1295           }
1296
1297         case Bpoint_min:
1298           {
1299             Lisp_Object v1;
1300             XSETFASTINT (v1, BEGV);
1301             PUSH (v1);
1302             break;
1303           }
1304
1305         case Bchar_after:
1306           BEFORE_POTENTIAL_GC ();
1307           TOP = Fchar_after (TOP);
1308           AFTER_POTENTIAL_GC ();
1309           break;
1310
1311         case Bfollowing_char:
1312           {
1313             Lisp_Object v1;
1314             BEFORE_POTENTIAL_GC ();
1315             v1 = Ffollowing_char ();
1316             AFTER_POTENTIAL_GC ();
1317             PUSH (v1);
1318             break;
1319           }
1320
1321         case Bpreceding_char:
1322           {
1323             Lisp_Object v1;
1324             BEFORE_POTENTIAL_GC ();
1325             v1 = Fprevious_char ();
1326             AFTER_POTENTIAL_GC ();
1327             PUSH (v1);
1328             break;
1329           }
1330
1331         case Bcurrent_column:
1332           {
1333             Lisp_Object v1;
1334             BEFORE_POTENTIAL_GC ();
1335             XSETFASTINT (v1, (int) current_column ()); /* iftc */
1336             AFTER_POTENTIAL_GC ();
1337             PUSH (v1);
1338             break;
1339           }
1340
1341         case Bindent_to:
1342           BEFORE_POTENTIAL_GC ();
1343           TOP = Findent_to (TOP, Qnil);
1344           AFTER_POTENTIAL_GC ();
1345           break;
1346
1347         case Beolp:
1348           PUSH (Feolp ());
1349           break;
1350
1351         case Beobp:
1352           PUSH (Feobp ());
1353           break;
1354
1355         case Bbolp:
1356           PUSH (Fbolp ());
1357           break;
1358
1359         case Bbobp:
1360           PUSH (Fbobp ());
1361           break;
1362
1363         case Bcurrent_buffer:
1364           PUSH (Fcurrent_buffer ());
1365           break;
1366
1367         case Bset_buffer:
1368           BEFORE_POTENTIAL_GC ();
1369           TOP = Fset_buffer (TOP);
1370           AFTER_POTENTIAL_GC ();
1371           break;
1372
1373         case Binteractive_p:
1374           PUSH (Finteractive_p ());
1375           break;
1376
1377         case Bforward_char:
1378           BEFORE_POTENTIAL_GC ();
1379           TOP = Fforward_char (TOP);
1380           AFTER_POTENTIAL_GC ();
1381           break;
1382
1383         case Bforward_word:
1384           BEFORE_POTENTIAL_GC ();
1385           TOP = Fforward_word (TOP);
1386           AFTER_POTENTIAL_GC ();
1387           break;
1388
1389         case Bskip_chars_forward:
1390           {
1391             Lisp_Object v1;
1392             BEFORE_POTENTIAL_GC ();
1393             v1 = POP;
1394             TOP = Fskip_chars_forward (TOP, v1);
1395             AFTER_POTENTIAL_GC ();
1396             break;
1397           }
1398
1399         case Bskip_chars_backward:
1400           {
1401             Lisp_Object v1;
1402             BEFORE_POTENTIAL_GC ();
1403             v1 = POP;
1404             TOP = Fskip_chars_backward (TOP, v1);
1405             AFTER_POTENTIAL_GC ();
1406             break;
1407           }
1408
1409         case Bforward_line:
1410           BEFORE_POTENTIAL_GC ();
1411           TOP = Fforward_line (TOP);
1412           AFTER_POTENTIAL_GC ();
1413           break;
1414
1415         case Bchar_syntax:
1416           BEFORE_POTENTIAL_GC ();
1417           CHECK_NUMBER (TOP);
1418           AFTER_POTENTIAL_GC ();
1419           XSETFASTINT (TOP, syntax_code_spec[(int) SYNTAX (XINT (TOP))]);
1420           break;
1421
1422         case Bbuffer_substring:
1423           {
1424             Lisp_Object v1;
1425             BEFORE_POTENTIAL_GC ();
1426             v1 = POP;
1427             TOP = Fbuffer_substring (TOP, v1);
1428             AFTER_POTENTIAL_GC ();
1429             break;
1430           }
1431
1432         case Bdelete_region:
1433           {
1434             Lisp_Object v1;
1435             BEFORE_POTENTIAL_GC ();
1436             v1 = POP;
1437             TOP = Fdelete_region (TOP, v1);
1438             AFTER_POTENTIAL_GC ();
1439             break;
1440           }
1441
1442         case Bnarrow_to_region:
1443           {
1444             Lisp_Object v1;
1445             BEFORE_POTENTIAL_GC ();
1446             v1 = POP;
1447             TOP = Fnarrow_to_region (TOP, v1);
1448             AFTER_POTENTIAL_GC ();
1449             break;
1450           }
1451
1452         case Bwiden:
1453           BEFORE_POTENTIAL_GC ();
1454           PUSH (Fwiden ());
1455           AFTER_POTENTIAL_GC ();
1456           break;
1457
1458         case Bend_of_line:
1459           BEFORE_POTENTIAL_GC ();
1460           TOP = Fend_of_line (TOP);
1461           AFTER_POTENTIAL_GC ();
1462           break;
1463
1464         case Bset_marker:
1465           {
1466             Lisp_Object v1, v2;
1467             BEFORE_POTENTIAL_GC ();
1468             v1 = POP;
1469             v2 = POP;
1470             TOP = Fset_marker (TOP, v2, v1);
1471             AFTER_POTENTIAL_GC ();
1472             break;
1473           }
1474
1475         case Bmatch_beginning:
1476           BEFORE_POTENTIAL_GC ();
1477           TOP = Fmatch_beginning (TOP);
1478           AFTER_POTENTIAL_GC ();
1479           break;
1480
1481         case Bmatch_end:
1482           BEFORE_POTENTIAL_GC ();
1483           TOP = Fmatch_end (TOP);
1484           AFTER_POTENTIAL_GC ();
1485           break;
1486
1487         case Bupcase:
1488           BEFORE_POTENTIAL_GC ();
1489           TOP = Fupcase (TOP);
1490           AFTER_POTENTIAL_GC ();
1491           break;
1492
1493         case Bdowncase:
1494           BEFORE_POTENTIAL_GC ();
1495           TOP = Fdowncase (TOP);
1496           AFTER_POTENTIAL_GC ();
1497         break;
1498
1499         case Bstringeqlsign:
1500           {
1501             Lisp_Object v1;
1502             BEFORE_POTENTIAL_GC ();
1503             v1 = POP;
1504             TOP = Fstring_equal (TOP, v1);
1505             AFTER_POTENTIAL_GC ();
1506             break;
1507           }
1508
1509         case Bstringlss:
1510           {
1511             Lisp_Object v1;
1512             BEFORE_POTENTIAL_GC ();
1513             v1 = POP;
1514             TOP = Fstring_lessp (TOP, v1);
1515             AFTER_POTENTIAL_GC ();
1516             break;
1517           }
1518
1519         case Bequal:
1520           {
1521             Lisp_Object v1;
1522             v1 = POP;
1523             TOP = Fequal (TOP, v1);
1524             break;
1525           }
1526
1527         case Bnthcdr:
1528           {
1529             Lisp_Object v1;
1530             BEFORE_POTENTIAL_GC ();
1531             v1 = POP;
1532             TOP = Fnthcdr (TOP, v1);
1533             AFTER_POTENTIAL_GC ();
1534             break;
1535           }
1536
1537         case Belt:
1538           {
1539             Lisp_Object v1, v2;
1540             if (CONSP (TOP))
1541               {
1542                 /* Exchange args and then do nth.  */
1543                 BEFORE_POTENTIAL_GC ();
1544                 v2 = POP;
1545                 v1 = TOP;
1546                 CHECK_NUMBER (v2);
1547                 AFTER_POTENTIAL_GC ();
1548                 op = XINT (v2);
1549                 immediate_quit = 1;
1550                 while (--op >= 0)
1551                   {
1552                     if (CONSP (v1))
1553                       v1 = XCDR (v1);
1554                     else if (!NILP (v1))
1555                       {
1556                         immediate_quit = 0;
1557                         BEFORE_POTENTIAL_GC ();
1558                         v1 = wrong_type_argument (Qlistp, v1);
1559                         AFTER_POTENTIAL_GC ();
1560                         immediate_quit = 1;
1561                         op++;
1562                       }
1563                   }
1564                 immediate_quit = 0;
1565                 if (CONSP (v1))
1566                   TOP = XCAR (v1);
1567                 else if (NILP (v1))
1568                   TOP = Qnil;
1569                 else
1570                   {
1571                     BEFORE_POTENTIAL_GC ();
1572                     Fcar (wrong_type_argument (Qlistp, v1));
1573                     AFTER_POTENTIAL_GC ();
1574                   }
1575               }
1576             else
1577               {
1578                 BEFORE_POTENTIAL_GC ();
1579                 v1 = POP;
1580                 TOP = Felt (TOP, v1);
1581                 AFTER_POTENTIAL_GC ();
1582               }
1583             break;
1584           }
1585
1586         case Bmember:
1587           {
1588             Lisp_Object v1;
1589             BEFORE_POTENTIAL_GC ();
1590             v1 = POP;
1591             TOP = Fmember (TOP, v1);
1592             AFTER_POTENTIAL_GC ();
1593             break;
1594           }
1595
1596         case Bassq:
1597           {
1598             Lisp_Object v1;
1599             BEFORE_POTENTIAL_GC ();
1600             v1 = POP;
1601             TOP = Fassq (TOP, v1);
1602             AFTER_POTENTIAL_GC ();
1603             break;
1604           }
1605
1606         case Bnreverse:
1607           BEFORE_POTENTIAL_GC ();
1608           TOP = Fnreverse (TOP);
1609           AFTER_POTENTIAL_GC ();
1610           break;
1611
1612         case Bsetcar:
1613           {
1614             Lisp_Object v1;
1615             BEFORE_POTENTIAL_GC ();
1616             v1 = POP;
1617             TOP = Fsetcar (TOP, v1);
1618             AFTER_POTENTIAL_GC ();
1619             break;
1620           }
1621
1622         case Bsetcdr:
1623           {
1624             Lisp_Object v1;
1625             BEFORE_POTENTIAL_GC ();
1626             v1 = POP;
1627             TOP = Fsetcdr (TOP, v1);
1628             AFTER_POTENTIAL_GC ();
1629             break;
1630           }
1631
1632         case Bcar_safe:
1633           {
1634             Lisp_Object v1;
1635             v1 = TOP;
1636             if (CONSP (v1))
1637               TOP = XCAR (v1);
1638             else
1639               TOP = Qnil;
1640             break;
1641           }
1642
1643         case Bcdr_safe:
1644           {
1645             Lisp_Object v1;
1646             v1 = TOP;
1647             if (CONSP (v1))
1648               TOP = XCDR (v1);
1649             else
1650               TOP = Qnil;
1651             break;
1652           }
1653
1654         case Bnconc:
1655           BEFORE_POTENTIAL_GC ();
1656           DISCARD (1);
1657           TOP = Fnconc (2, &TOP);
1658           AFTER_POTENTIAL_GC ();
1659           break;
1660
1661         case Bnumberp:
1662           TOP = (NUMBERP (TOP) ? Qt : Qnil);
1663           break;
1664
1665         case Bintegerp:
1666           TOP = INTEGERP (TOP) ? Qt : Qnil;
1667           break;
1668
1669 #ifdef BYTE_CODE_SAFE
1670         case Bset_mark:
1671           BEFORE_POTENTIAL_GC ();
1672           error ("set-mark is an obsolete bytecode");
1673           AFTER_POTENTIAL_GC ();
1674           break;
1675         case Bscan_buffer:
1676           BEFORE_POTENTIAL_GC ();
1677           error ("scan-buffer is an obsolete bytecode");
1678           AFTER_POTENTIAL_GC ();
1679           break;
1680 #endif
1681
1682         case 0:
1683           abort ();
1684
1685         case 255:
1686         default:
1687 #ifdef BYTE_CODE_SAFE
1688           if (op < Bconstant)
1689             {
1690               abort ();
1691             }
1692           if ((op -= Bconstant) >= const_length)
1693             {
1694               abort ();
1695             }
1696           PUSH (vectorp[op]);
1697 #else
1698           PUSH (vectorp[op - Bconstant]);
1699 #endif
1700         }
1701     }
1702
1703  exit:
1704
1705   byte_stack_list = byte_stack_list->next;
1706
1707   /* Binds and unbinds are supposed to be compiled balanced.  */
1708   if (SPECPDL_INDEX () != count)
1709 #ifdef BYTE_CODE_SAFE
1710     error ("binding stack not balanced (serious byte compiler bug)");
1711 #else
1712     abort ();
1713 #endif
1714
1715   return result;
1716 }
1717
1718 void
1719 syms_of_bytecode ()
1720 {
1721   Qbytecode = intern ("byte-code");
1722   staticpro (&Qbytecode);
1723
1724   defsubr (&Sbyte_code);
1725
1726 #ifdef BYTE_CODE_METER
1727
1728   DEFVAR_LISP ("byte-code-meter", &Vbyte_code_meter,
1729                doc: /* A vector of vectors which holds a histogram of byte-code usage.
1730 \(aref (aref byte-code-meter 0) CODE) indicates how many times the byte
1731 opcode CODE has been executed.
1732 \(aref (aref byte-code-meter CODE1) CODE2), where CODE1 is not 0,
1733 indicates how many times the byte opcodes CODE1 and CODE2 have been
1734 executed in succession.  */);
1735
1736   DEFVAR_BOOL ("byte-metering-on", &byte_metering_on,
1737                doc: /* If non-nil, keep profiling information on byte code usage.
1738 The variable byte-code-meter indicates how often each byte opcode is used.
1739 If a symbol has a property named `byte-code-meter' whose value is an
1740 integer, it is incremented each time that symbol's function is called.  */);
1741
1742   byte_metering_on = 0;
1743   Vbyte_code_meter = Fmake_vector (make_number (256), make_number (0));
1744   Qbyte_code_meter = intern ("byte-code-meter");
1745   staticpro (&Qbyte_code_meter);
1746   {
1747     int i = 256;
1748     while (i--)
1749       XVECTOR (Vbyte_code_meter)->contents[i] =
1750         Fmake_vector (make_number (256), make_number (0));
1751   }
1752 #endif
1753 }
1754
1755 /* arch-tag: b9803b6f-1ed6-4190-8adf-33fd3a9d10e9
1756    (do not change this comment) */