HCoop / bpt / emacs.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
use dynwind_begin and dynwind_end
[bpt/emacs.git] / src / bytecode.c
1 /* Execution of byte code produced by bytecomp.el.
2 Copyright (C) 1985-1988, 1993, 2000-2014 Free Software Foundation,
3 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 3 of the License, or
10 (at your option) 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. If not, see <http://www.gnu.org/licenses/>. */
19
20 /*
21 hacked on by jwz@lucid.com 17-jun-91
22 o added a compile-time switch to turn on simple sanity checking;
23 o put back the obsolete byte-codes for error-detection;
24 o added a new instruction, unbind_all, which I will use for
25 tail-recursion elimination;
26 o made temp_output_buffer_show be called with the right number
27 of args;
28 o made the new bytecodes be called with args in the right order;
29 o added metering support.
30
31 by Hallvard:
32 o added relative jump instructions;
33 o all conditionals now only do QUIT if they jump.
34 */
35
36 #include <config.h>
37
38 #include "lisp.h"
39 #include "character.h"
40 #include "buffer.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 /* If BYTE_CODE_THREADED is defined, then the interpreter will be
59 indirect threaded, using GCC's computed goto extension. This code,
60 as currently implemented, is incompatible with BYTE_CODE_SAFE and
61 BYTE_CODE_METER. */
62 #if (defined __GNUC__ && !defined __STRICT_ANSI__ \
63 && !defined BYTE_CODE_SAFE && !defined BYTE_CODE_METER)
64 #define BYTE_CODE_THREADED
65 #endif
66
67 \f
68 #ifdef BYTE_CODE_METER
69
70 Lisp_Object Qbyte_code_meter;
71 #define METER_2(code1, code2) AREF (AREF (Vbyte_code_meter, code1), code2)
72 #define METER_1(code) METER_2 (0, code)
73
74 #define METER_CODE(last_code, this_code) \
75 { \
76 if (byte_metering_on) \
77 { \
78 if (XFASTINT (METER_1 (this_code)) < MOST_POSITIVE_FIXNUM) \
79 XSETFASTINT (METER_1 (this_code), \
80 XFASTINT (METER_1 (this_code)) + 1); \
81 if (last_code \
82 && (XFASTINT (METER_2 (last_code, this_code)) \
83 < MOST_POSITIVE_FIXNUM)) \
84 XSETFASTINT (METER_2 (last_code, this_code), \
85 XFASTINT (METER_2 (last_code, this_code)) + 1); \
86 } \
87 }
88
89 #endif /* BYTE_CODE_METER */
90 \f
91
92 /* Byte codes: */
93
94 #define BYTE_CODES \
95 DEFINE (Bstack_ref, 0) /* Actually, Bstack_ref+0 is not implemented: use dup. */ \
96 DEFINE (Bstack_ref1, 1) \
97 DEFINE (Bstack_ref2, 2) \
98 DEFINE (Bstack_ref3, 3) \
99 DEFINE (Bstack_ref4, 4) \
100 DEFINE (Bstack_ref5, 5) \
101 DEFINE (Bstack_ref6, 6) \
102 DEFINE (Bstack_ref7, 7) \
103 DEFINE (Bvarref, 010) \
104 DEFINE (Bvarref1, 011) \
105 DEFINE (Bvarref2, 012) \
106 DEFINE (Bvarref3, 013) \
107 DEFINE (Bvarref4, 014) \
108 DEFINE (Bvarref5, 015) \
109 DEFINE (Bvarref6, 016) \
110 DEFINE (Bvarref7, 017) \
111 DEFINE (Bvarset, 020) \
112 DEFINE (Bvarset1, 021) \
113 DEFINE (Bvarset2, 022) \
114 DEFINE (Bvarset3, 023) \
115 DEFINE (Bvarset4, 024) \
116 DEFINE (Bvarset5, 025) \
117 DEFINE (Bvarset6, 026) \
118 DEFINE (Bvarset7, 027) \
119 DEFINE (Bvarbind, 030) \
120 DEFINE (Bvarbind1, 031) \
121 DEFINE (Bvarbind2, 032) \
122 DEFINE (Bvarbind3, 033) \
123 DEFINE (Bvarbind4, 034) \
124 DEFINE (Bvarbind5, 035) \
125 DEFINE (Bvarbind6, 036) \
126 DEFINE (Bvarbind7, 037) \
127 DEFINE (Bcall, 040) \
128 DEFINE (Bcall1, 041) \
129 DEFINE (Bcall2, 042) \
130 DEFINE (Bcall3, 043) \
131 DEFINE (Bcall4, 044) \
132 DEFINE (Bcall5, 045) \
133 DEFINE (Bcall6, 046) \
134 DEFINE (Bcall7, 047) \
135 DEFINE (Bunbind, 050) \
136 DEFINE (Bunbind1, 051) \
137 DEFINE (Bunbind2, 052) \
138 DEFINE (Bunbind3, 053) \
139 DEFINE (Bunbind4, 054) \
140 DEFINE (Bunbind5, 055) \
141 DEFINE (Bunbind6, 056) \
142 DEFINE (Bunbind7, 057) \
143 \
144 DEFINE (Bpophandler, 060) \
145 DEFINE (Bpushconditioncase, 061) \
146 DEFINE (Bpushcatch, 062) \
147 \
148 DEFINE (Bnth, 070) \
149 DEFINE (Bsymbolp, 071) \
150 DEFINE (Bconsp, 072) \
151 DEFINE (Bstringp, 073) \
152 DEFINE (Blistp, 074) \
153 DEFINE (Beq, 075) \
154 DEFINE (Bmemq, 076) \
155 DEFINE (Bnot, 077) \
156 DEFINE (Bcar, 0100) \
157 DEFINE (Bcdr, 0101) \
158 DEFINE (Bcons, 0102) \
159 DEFINE (Blist1, 0103) \
160 DEFINE (Blist2, 0104) \
161 DEFINE (Blist3, 0105) \
162 DEFINE (Blist4, 0106) \
163 DEFINE (Blength, 0107) \
164 DEFINE (Baref, 0110) \
165 DEFINE (Baset, 0111) \
166 DEFINE (Bsymbol_value, 0112) \
167 DEFINE (Bsymbol_function, 0113) \
168 DEFINE (Bset, 0114) \
169 DEFINE (Bfset, 0115) \
170 DEFINE (Bget, 0116) \
171 DEFINE (Bsubstring, 0117) \
172 DEFINE (Bconcat2, 0120) \
173 DEFINE (Bconcat3, 0121) \
174 DEFINE (Bconcat4, 0122) \
175 DEFINE (Bsub1, 0123) \
176 DEFINE (Badd1, 0124) \
177 DEFINE (Beqlsign, 0125) \
178 DEFINE (Bgtr, 0126) \
179 DEFINE (Blss, 0127) \
180 DEFINE (Bleq, 0130) \
181 DEFINE (Bgeq, 0131) \
182 DEFINE (Bdiff, 0132) \
183 DEFINE (Bnegate, 0133) \
184 DEFINE (Bplus, 0134) \
185 DEFINE (Bmax, 0135) \
186 DEFINE (Bmin, 0136) \
187 DEFINE (Bmult, 0137) \
188 \
189 DEFINE (Bpoint, 0140) \
190 /* Was Bmark in v17. */ \
191 DEFINE (Bsave_current_buffer, 0141) /* Obsolete. */ \
192 DEFINE (Bgoto_char, 0142) \
193 DEFINE (Binsert, 0143) \
194 DEFINE (Bpoint_max, 0144) \
195 DEFINE (Bpoint_min, 0145) \
196 DEFINE (Bchar_after, 0146) \
197 DEFINE (Bfollowing_char, 0147) \
198 DEFINE (Bpreceding_char, 0150) \
199 DEFINE (Bcurrent_column, 0151) \
200 DEFINE (Bindent_to, 0152) \
201 DEFINE (Beolp, 0154) \
202 DEFINE (Beobp, 0155) \
203 DEFINE (Bbolp, 0156) \
204 DEFINE (Bbobp, 0157) \
205 DEFINE (Bcurrent_buffer, 0160) \
206 DEFINE (Bset_buffer, 0161) \
207 DEFINE (Bsave_current_buffer_1, 0162) /* Replacing Bsave_current_buffer. */ \
208 DEFINE (Binteractive_p, 0164) /* Obsolete since Emacs-24.1. */ \
209 \
210 DEFINE (Bforward_char, 0165) \
211 DEFINE (Bforward_word, 0166) \
212 DEFINE (Bskip_chars_forward, 0167) \
213 DEFINE (Bskip_chars_backward, 0170) \
214 DEFINE (Bforward_line, 0171) \
215 DEFINE (Bchar_syntax, 0172) \
216 DEFINE (Bbuffer_substring, 0173) \
217 DEFINE (Bdelete_region, 0174) \
218 DEFINE (Bnarrow_to_region, 0175) \
219 DEFINE (Bwiden, 0176) \
220 DEFINE (Bend_of_line, 0177) \
221 \
222 DEFINE (Bconstant2, 0201) \
223 DEFINE (Bgoto, 0202) \
224 DEFINE (Bgotoifnil, 0203) \
225 DEFINE (Bgotoifnonnil, 0204) \
226 DEFINE (Bgotoifnilelsepop, 0205) \
227 DEFINE (Bgotoifnonnilelsepop, 0206) \
228 DEFINE (Breturn, 0207) \
229 DEFINE (Bdiscard, 0210) \
230 DEFINE (Bdup, 0211) \
231 \
232 DEFINE (Bsave_excursion, 0212) \
233 DEFINE (Bsave_window_excursion, 0213) /* Obsolete since Emacs-24.1. */ \
234 DEFINE (Bsave_restriction, 0214) \
235 DEFINE (Bcatch, 0215) \
236 \
237 DEFINE (Bunwind_protect, 0216) \
238 DEFINE (Bcondition_case, 0217) \
239 DEFINE (Btemp_output_buffer_setup, 0220) /* Obsolete since Emacs-24.1. */ \
240 DEFINE (Btemp_output_buffer_show, 0221) /* Obsolete since Emacs-24.1. */ \
241 \
242 DEFINE (Bunbind_all, 0222) /* Obsolete. Never used. */ \
243 \
244 DEFINE (Bset_marker, 0223) \
245 DEFINE (Bmatch_beginning, 0224) \
246 DEFINE (Bmatch_end, 0225) \
247 DEFINE (Bupcase, 0226) \
248 DEFINE (Bdowncase, 0227) \
249 \
250 DEFINE (Bstringeqlsign, 0230) \
251 DEFINE (Bstringlss, 0231) \
252 DEFINE (Bequal, 0232) \
253 DEFINE (Bnthcdr, 0233) \
254 DEFINE (Belt, 0234) \
255 DEFINE (Bmember, 0235) \
256 DEFINE (Bassq, 0236) \
257 DEFINE (Bnreverse, 0237) \
258 DEFINE (Bsetcar, 0240) \
259 DEFINE (Bsetcdr, 0241) \
260 DEFINE (Bcar_safe, 0242) \
261 DEFINE (Bcdr_safe, 0243) \
262 DEFINE (Bnconc, 0244) \
263 DEFINE (Bquo, 0245) \
264 DEFINE (Brem, 0246) \
265 DEFINE (Bnumberp, 0247) \
266 DEFINE (Bintegerp, 0250) \
267 \
268 DEFINE (BRgoto, 0252) \
269 DEFINE (BRgotoifnil, 0253) \
270 DEFINE (BRgotoifnonnil, 0254) \
271 DEFINE (BRgotoifnilelsepop, 0255) \
272 DEFINE (BRgotoifnonnilelsepop, 0256) \
273 \
274 DEFINE (BlistN, 0257) \
275 DEFINE (BconcatN, 0260) \
276 DEFINE (BinsertN, 0261) \
277 \
278 /* Bstack_ref is code 0. */ \
279 DEFINE (Bstack_set, 0262) \
280 DEFINE (Bstack_set2, 0263) \
281 DEFINE (BdiscardN, 0266) \
282 \
283 DEFINE (Bconstant, 0300)
284
285 enum byte_code_op
286 {
287 #define DEFINE(name, value) name = value,
288 BYTE_CODES
289 #undef DEFINE
290
291 #ifdef BYTE_CODE_SAFE
292 Bscan_buffer = 0153, /* No longer generated as of v18. */
293 Bset_mark = 0163, /* this loser is no longer generated as of v18 */
294 #endif
295 };
296 \f
297 /* Structure describing a value stack used during byte-code execution
298 in Fbyte_code. */
299
300 struct byte_stack
301 {
302 /* Program counter. This points into the byte_string below
303 and is relocated when that string is relocated. */
304 const unsigned char *pc;
305
306 /* The string containing the byte-code, and its current address.
307 Storing this here protects it from GC because mark_byte_stack
308 marks it. */
309 Lisp_Object byte_string;
310 const unsigned char *byte_string_start;
311
312 #if BYTE_MARK_STACK
313 /* The vector of constants used during byte-code execution. Storing
314 this here protects it from GC because mark_byte_stack marks it. */
315 Lisp_Object constants;
316 #endif
317 };
318 \f
319 /* Fetch the next byte from the bytecode stream. */
320
321 #ifdef BYTE_CODE_SAFE
322 #define FETCH (eassert (stack.byte_string_start == SDATA (stack.byte_string)), *stack.pc++)
323 #else
324 #define FETCH *stack.pc++
325 #endif
326
327 /* Fetch two bytes from the bytecode stream and make a 16-bit number
328 out of them. */
329
330 #define FETCH2 (op = FETCH, op + (FETCH << 8))
331
332 /* Push x onto the execution stack. This used to be #define PUSH(x)
333 (*++stackp = (x)) This oddity is necessary because Alliant can't be
334 bothered to compile the preincrement operator properly, as of 4/91.
335 -JimB */
336
337 #define PUSH(x) (top++, *top = (x))
338
339 /* Pop a value off the execution stack. */
340
341 #define POP (*top--)
342
343 /* Discard n values from the execution stack. */
344
345 #define DISCARD(n) (top -= (n))
346
347 /* Get the value which is at the top of the execution stack, but don't
348 pop it. */
349
350 #define TOP (*top)
351
352 /* Actions that must be performed before and after calling a function
353 that might GC. */
354
355 #define BEFORE_POTENTIAL_GC() ((void)0)
356 #define AFTER_POTENTIAL_GC() ((void)0)
357
358 /* Garbage collect if we have consed enough since the last time.
359 We do this at every branch, to avoid loops that never GC. */
360
361 #define MAYBE_GC() \
362 do { \
363 BEFORE_POTENTIAL_GC (); \
364 maybe_gc (); \
365 AFTER_POTENTIAL_GC (); \
366 } while (0)
367
368 /* Check for jumping out of range. */
369
370 #ifdef BYTE_CODE_SAFE
371
372 #define CHECK_RANGE(ARG) \
373 if (ARG >= bytestr_length) emacs_abort ()
374
375 #else /* not BYTE_CODE_SAFE */
376
377 #define CHECK_RANGE(ARG)
378
379 #endif /* not BYTE_CODE_SAFE */
380
381 /* A version of the QUIT macro which makes sure that the stack top is
382 set before signaling `quit'. */
383
384 #define BYTE_CODE_QUIT \
385 do { \
386 if (!NILP (Vquit_flag) && NILP (Vinhibit_quit)) \
387 { \
388 Lisp_Object flag = Vquit_flag; \
389 Vquit_flag = Qnil; \
390 BEFORE_POTENTIAL_GC (); \
391 if (EQ (Vthrow_on_input, flag)) \
392 Fthrow (Vthrow_on_input, Qt); \
393 Fsignal (Qquit, Qnil); \
394 AFTER_POTENTIAL_GC (); \
395 } \
396 else if (pending_signals) \
397 process_pending_signals (); \
398 } while (0)
399
400
401 DEFUN ("byte-code", Fbyte_code, Sbyte_code, 3, 3, 0,
402 doc: /* Function used internally in byte-compiled code.
403 The first argument, BYTESTR, is a string of byte code;
404 the second, VECTOR, a vector of constants;
405 the third, MAXDEPTH, the maximum stack depth used in this function.
406 If the third argument is incorrect, Emacs may crash. */)
407 (Lisp_Object bytestr, Lisp_Object vector, Lisp_Object maxdepth)
408 {
409 return exec_byte_code (bytestr, vector, maxdepth, Qnil, 0, NULL);
410 }
411
412 static void
413 bcall0 (Lisp_Object f)
414 {
415 Ffuncall (1, &f);
416 }
417
418 /* Execute the byte-code in BYTESTR. VECTOR is the constant vector, and
419 MAXDEPTH is the maximum stack depth used (if MAXDEPTH is incorrect,
420 emacs may crash!). If ARGS_TEMPLATE is non-nil, it should be a lisp
421 argument list (including &rest, &optional, etc.), and ARGS, of size
422 NARGS, should be a vector of the actual arguments. The arguments in
423 ARGS are pushed on the stack according to ARGS_TEMPLATE before
424 executing BYTESTR. */
425
426 Lisp_Object
427 exec_byte_code (Lisp_Object bytestr, Lisp_Object vector, Lisp_Object maxdepth,
428 Lisp_Object args_template, ptrdiff_t nargs, Lisp_Object *args)
429 {
430 ptrdiff_t count = SPECPDL_INDEX ();
431 #ifdef BYTE_CODE_METER
432 int volatile this_op = 0;
433 int prev_op;
434 #endif
435 int op;
436 /* Lisp_Object v1, v2; */
437 Lisp_Object *vectorp;
438 #ifdef BYTE_CODE_SAFE
439 ptrdiff_t const_length;
440 Lisp_Object *stacke;
441 ptrdiff_t bytestr_length;
442 #endif
443 struct byte_stack stack;
444 Lisp_Object *top;
445 Lisp_Object result;
446 enum handlertype type;
447
448 #if 0 /* CHECK_FRAME_FONT */
449 {
450 struct frame *f = SELECTED_FRAME ();
451 if (FRAME_X_P (f)
452 && FRAME_FONT (f)->direction != 0
453 && FRAME_FONT (f)->direction != 1)
454 emacs_abort ();
455 }
456 #endif
457
458 CHECK_STRING (bytestr);
459 CHECK_VECTOR (vector);
460 CHECK_NATNUM (maxdepth);
461
462 #ifdef BYTE_CODE_SAFE
463 const_length = ASIZE (vector);
464 #endif
465
466 if (STRING_MULTIBYTE (bytestr))
467 /* BYTESTR must have been produced by Emacs 20.2 or the earlier
468 because they produced a raw 8-bit string for byte-code and now
469 such a byte-code string is loaded as multibyte while raw 8-bit
470 characters converted to multibyte form. Thus, now we must
471 convert them back to the originally intended unibyte form. */
472 bytestr = Fstring_as_unibyte (bytestr);
473
474 #ifdef BYTE_CODE_SAFE
475 bytestr_length = SBYTES (bytestr);
476 #endif
477 vectorp = XVECTOR (vector)->contents;
478
479 stack.byte_string = bytestr;
480 stack.pc = stack.byte_string_start = SDATA (bytestr);
481 #if BYTE_MARK_STACK
482 stack.constants = vector;
483 #endif
484 if (MAX_ALLOCA / word_size <= XFASTINT (maxdepth))
485 memory_full (SIZE_MAX);
486 top = alloca ((XFASTINT (maxdepth) + 1) * sizeof *top);
487
488 #ifdef BYTE_CODE_SAFE
489 stacke = stack.bottom - 1 + XFASTINT (maxdepth);
490 #endif
491
492 if (INTEGERP (args_template))
493 {
494 ptrdiff_t at = XINT (args_template);
495 bool rest = (at & 128) != 0;
496 int mandatory = at & 127;
497 ptrdiff_t nonrest = at >> 8;
498 eassert (mandatory <= nonrest);
499 if (nargs <= nonrest)
500 {
501 ptrdiff_t i;
502 for (i = 0 ; i < nargs; i++, args++)
503 PUSH (*args);
504 if (nargs < mandatory)
505 /* Too few arguments. */
506 Fsignal (Qwrong_number_of_arguments,
507 list2 (Fcons (make_number (mandatory),
508 rest ? Qand_rest : make_number (nonrest)),
509 make_number (nargs)));
510 else
511 {
512 for (; i < nonrest; i++)
513 PUSH (Qnil);
514 if (rest)
515 PUSH (Qnil);
516 }
517 }
518 else if (rest)
519 {
520 ptrdiff_t i;
521 for (i = 0 ; i < nonrest; i++, args++)
522 PUSH (*args);
523 PUSH (Flist (nargs - nonrest, args));
524 }
525 else
526 /* Too many arguments. */
527 Fsignal (Qwrong_number_of_arguments,
528 list2 (Fcons (make_number (mandatory), make_number (nonrest)),
529 make_number (nargs)));
530 }
531 else if (! NILP (args_template))
532 /* We should push some arguments on the stack. */
533 {
534 error ("Unknown args template!");
535 }
536
537 while (1)
538 {
539 #ifdef BYTE_CODE_SAFE
540 if (top > stacke)
541 emacs_abort ();
542 else if (top < stack.bottom - 1)
543 emacs_abort ();
544 #endif
545
546 #ifdef BYTE_CODE_METER
547 prev_op = this_op;
548 this_op = op = FETCH;
549 METER_CODE (prev_op, op);
550 #else
551 #ifndef BYTE_CODE_THREADED
552 op = FETCH;
553 #endif
554 #endif
555
556 /* The interpreter can be compiled one of two ways: as an
557 ordinary switch-based interpreter, or as a threaded
558 interpreter. The threaded interpreter relies on GCC's
559 computed goto extension, so it is not available everywhere.
560 Threading provides a performance boost. These macros are how
561 we allow the code to be compiled both ways. */
562 #ifdef BYTE_CODE_THREADED
563 /* The CASE macro introduces an instruction's body. It is
564 either a label or a case label. */
565 #define CASE(OP) insn_ ## OP
566 /* NEXT is invoked at the end of an instruction to go to the
567 next instruction. It is either a computed goto, or a
568 plain break. */
569 #define NEXT goto *(targets[op = FETCH])
570 /* FIRST is like NEXT, but is only used at the start of the
571 interpreter body. In the switch-based interpreter it is the
572 switch, so the threaded definition must include a semicolon. */
573 #define FIRST NEXT;
574 /* Most cases are labeled with the CASE macro, above.
575 CASE_DEFAULT is one exception; it is used if the interpreter
576 being built requires a default case. The threaded
577 interpreter does not, because the dispatch table is
578 completely filled. */
579 #define CASE_DEFAULT
580 /* This introduces an instruction that is known to call abort. */
581 #define CASE_ABORT CASE (Bstack_ref): CASE (default)
582 #else
583 /* See above for the meaning of the various defines. */
584 #define CASE(OP) case OP
585 #define NEXT break
586 #define FIRST switch (op)
587 #define CASE_DEFAULT case 255: default:
588 #define CASE_ABORT case 0
589 #endif
590
591 #ifdef BYTE_CODE_THREADED
592
593 /* A convenience define that saves us a lot of typing and makes
594 the table clearer. */
595 #define LABEL(OP) [OP] = &&insn_ ## OP
596
597 #if 4 < __GNUC__ + (6 <= __GNUC_MINOR__)
598 # pragma GCC diagnostic push
599 # pragma GCC diagnostic ignored "-Woverride-init"
600 #elif defined __clang__
601 # pragma GCC diagnostic push
602 # pragma GCC diagnostic ignored "-Winitializer-overrides"
603 #endif
604
605 /* This is the dispatch table for the threaded interpreter. */
606 static const void *const targets[256] =
607 {
608 [0 ... (Bconstant - 1)] = &&insn_default,
609 [Bconstant ... 255] = &&insn_Bconstant,
610
611 #define DEFINE(name, value) LABEL (name) ,
612 BYTE_CODES
613 #undef DEFINE
614 };
615
616 #if 4 < __GNUC__ + (6 <= __GNUC_MINOR__) || defined __clang__
617 # pragma GCC diagnostic pop
618 #endif
619
620 #endif
621
622
623 FIRST
624 {
625 CASE (Bvarref7):
626 op = FETCH2;
627 goto varref;
628
629 CASE (Bvarref):
630 CASE (Bvarref1):
631 CASE (Bvarref2):
632 CASE (Bvarref3):
633 CASE (Bvarref4):
634 CASE (Bvarref5):
635 op = op - Bvarref;
636 goto varref;
637
638 /* This seems to be the most frequently executed byte-code
639 among the Bvarref's, so avoid a goto here. */
640 CASE (Bvarref6):
641 op = FETCH;
642 varref:
643 {
644 Lisp_Object v1, v2;
645
646 v1 = vectorp[op];
647 if (SYMBOLP (v1))
648 {
649 if (XSYMBOL (v1)->redirect != SYMBOL_PLAINVAL
650 || (v2 = SYMBOL_VAL (XSYMBOL (v1)),
651 EQ (v2, Qunbound)))
652 {
653 BEFORE_POTENTIAL_GC ();
654 v2 = Fsymbol_value (v1);
655 AFTER_POTENTIAL_GC ();
656 }
657 }
658 else
659 {
660 BEFORE_POTENTIAL_GC ();
661 v2 = Fsymbol_value (v1);
662 AFTER_POTENTIAL_GC ();
663 }
664 PUSH (v2);
665 NEXT;
666 }
667
668 CASE (Bgotoifnil):
669 {
670 Lisp_Object v1;
671 MAYBE_GC ();
672 op = FETCH2;
673 v1 = POP;
674 if (NILP (v1))
675 {
676 BYTE_CODE_QUIT;
677 CHECK_RANGE (op);
678 stack.pc = stack.byte_string_start + op;
679 }
680 NEXT;
681 }
682
683 CASE (Bcar):
684 {
685 Lisp_Object v1;
686 v1 = TOP;
687 if (CONSP (v1))
688 TOP = XCAR (v1);
689 else if (NILP (v1))
690 TOP = Qnil;
691 else
692 {
693 BEFORE_POTENTIAL_GC ();
694 wrong_type_argument (Qlistp, v1);
695 }
696 NEXT;
697 }
698
699 CASE (Beq):
700 {
701 Lisp_Object v1;
702 v1 = POP;
703 TOP = EQ (v1, TOP) ? Qt : Qnil;
704 NEXT;
705 }
706
707 CASE (Bmemq):
708 {
709 Lisp_Object v1;
710 BEFORE_POTENTIAL_GC ();
711 v1 = POP;
712 TOP = Fmemq (TOP, v1);
713 AFTER_POTENTIAL_GC ();
714 NEXT;
715 }
716
717 CASE (Bcdr):
718 {
719 Lisp_Object v1;
720 v1 = TOP;
721 if (CONSP (v1))
722 TOP = XCDR (v1);
723 else if (NILP (v1))
724 TOP = Qnil;
725 else
726 {
727 BEFORE_POTENTIAL_GC ();
728 wrong_type_argument (Qlistp, v1);
729 }
730 NEXT;
731 }
732
733 CASE (Bvarset):
734 CASE (Bvarset1):
735 CASE (Bvarset2):
736 CASE (Bvarset3):
737 CASE (Bvarset4):
738 CASE (Bvarset5):
739 op -= Bvarset;
740 goto varset;
741
742 CASE (Bvarset7):
743 op = FETCH2;
744 goto varset;
745
746 CASE (Bvarset6):
747 op = FETCH;
748 varset:
749 {
750 Lisp_Object sym, val;
751
752 sym = vectorp[op];
753 val = TOP;
754
755 /* Inline the most common case. */
756 if (SYMBOLP (sym)
757 && !EQ (val, Qunbound)
758 && !XSYMBOL (sym)->redirect
759 && !SYMBOL_CONSTANT_P (sym))
760 SET_SYMBOL_VAL (XSYMBOL (sym), val);
761 else
762 {
763 BEFORE_POTENTIAL_GC ();
764 set_internal (sym, val, Qnil, 0);
765 AFTER_POTENTIAL_GC ();
766 }
767 }
768 (void) POP;
769 NEXT;
770
771 CASE (Bdup):
772 {
773 Lisp_Object v1;
774 v1 = TOP;
775 PUSH (v1);
776 NEXT;
777 }
778
779 /* ------------------ */
780
781 CASE (Bvarbind6):
782 op = FETCH;
783 goto varbind;
784
785 CASE (Bvarbind7):
786 op = FETCH2;
787 goto varbind;
788
789 CASE (Bvarbind):
790 CASE (Bvarbind1):
791 CASE (Bvarbind2):
792 CASE (Bvarbind3):
793 CASE (Bvarbind4):
794 CASE (Bvarbind5):
795 op -= Bvarbind;
796 varbind:
797 /* Specbind can signal and thus GC. */
798 BEFORE_POTENTIAL_GC ();
799 dynwind_begin ();
800 specbind (vectorp[op], POP);
801 AFTER_POTENTIAL_GC ();
802 NEXT;
803
804 CASE (Bcall6):
805 op = FETCH;
806 goto docall;
807
808 CASE (Bcall7):
809 op = FETCH2;
810 goto docall;
811
812 CASE (Bcall):
813 CASE (Bcall1):
814 CASE (Bcall2):
815 CASE (Bcall3):
816 CASE (Bcall4):
817 CASE (Bcall5):
818 op -= Bcall;
819 docall:
820 {
821 BEFORE_POTENTIAL_GC ();
822 DISCARD (op);
823 #ifdef BYTE_CODE_METER
824 if (byte_metering_on && SYMBOLP (TOP))
825 {
826 Lisp_Object v1, v2;
827
828 v1 = TOP;
829 v2 = Fget (v1, Qbyte_code_meter);
830 if (INTEGERP (v2)
831 && XINT (v2) < MOST_POSITIVE_FIXNUM)
832 {
833 XSETINT (v2, XINT (v2) + 1);
834 Fput (v1, Qbyte_code_meter, v2);
835 }
836 }
837 #endif
838 TOP = Ffuncall (op + 1, &TOP);
839 AFTER_POTENTIAL_GC ();
840 NEXT;
841 }
842
843 CASE (Bunbind6):
844 op = FETCH;
845 goto dounbind;
846
847 CASE (Bunbind7):
848 op = FETCH2;
849 goto dounbind;
850
851 CASE (Bunbind):
852 CASE (Bunbind1):
853 CASE (Bunbind2):
854 CASE (Bunbind3):
855 CASE (Bunbind4):
856 CASE (Bunbind5):
857 op -= Bunbind;
858 dounbind:
859 BEFORE_POTENTIAL_GC ();
860 for (int i = 0; i < op; i++)
861 dynwind_end ();
862 AFTER_POTENTIAL_GC ();
863 NEXT;
864
865 CASE (Bunbind_all): /* Obsolete. Never used. */
866 emacs_abort ();
867 NEXT;
868
869 CASE (Bgoto):
870 MAYBE_GC ();
871 BYTE_CODE_QUIT;
872 op = FETCH2; /* pc = FETCH2 loses since FETCH2 contains pc++ */
873 CHECK_RANGE (op);
874 stack.pc = stack.byte_string_start + op;
875 NEXT;
876
877 CASE (Bgotoifnonnil):
878 {
879 Lisp_Object v1;
880 MAYBE_GC ();
881 op = FETCH2;
882 v1 = POP;
883 if (!NILP (v1))
884 {
885 BYTE_CODE_QUIT;
886 CHECK_RANGE (op);
887 stack.pc = stack.byte_string_start + op;
888 }
889 NEXT;
890 }
891
892 CASE (Bgotoifnilelsepop):
893 MAYBE_GC ();
894 op = FETCH2;
895 if (NILP (TOP))
896 {
897 BYTE_CODE_QUIT;
898 CHECK_RANGE (op);
899 stack.pc = stack.byte_string_start + op;
900 }
901 else DISCARD (1);
902 NEXT;
903
904 CASE (Bgotoifnonnilelsepop):
905 MAYBE_GC ();
906 op = FETCH2;
907 if (!NILP (TOP))
908 {
909 BYTE_CODE_QUIT;
910 CHECK_RANGE (op);
911 stack.pc = stack.byte_string_start + op;
912 }
913 else DISCARD (1);
914 NEXT;
915
916 CASE (BRgoto):
917 MAYBE_GC ();
918 BYTE_CODE_QUIT;
919 stack.pc += (int) *stack.pc - 127;
920 NEXT;
921
922 CASE (BRgotoifnil):
923 {
924 Lisp_Object v1;
925 MAYBE_GC ();
926 v1 = POP;
927 if (NILP (v1))
928 {
929 BYTE_CODE_QUIT;
930 stack.pc += (int) *stack.pc - 128;
931 }
932 stack.pc++;
933 NEXT;
934 }
935
936 CASE (BRgotoifnonnil):
937 {
938 Lisp_Object v1;
939 MAYBE_GC ();
940 v1 = POP;
941 if (!NILP (v1))
942 {
943 BYTE_CODE_QUIT;
944 stack.pc += (int) *stack.pc - 128;
945 }
946 stack.pc++;
947 NEXT;
948 }
949
950 CASE (BRgotoifnilelsepop):
951 MAYBE_GC ();
952 op = *stack.pc++;
953 if (NILP (TOP))
954 {
955 BYTE_CODE_QUIT;
956 stack.pc += op - 128;
957 }
958 else DISCARD (1);
959 NEXT;
960
961 CASE (BRgotoifnonnilelsepop):
962 MAYBE_GC ();
963 op = *stack.pc++;
964 if (!NILP (TOP))
965 {
966 BYTE_CODE_QUIT;
967 stack.pc += op - 128;
968 }
969 else DISCARD (1);
970 NEXT;
971
972 CASE (Breturn):
973 result = POP;
974 goto exit;
975
976 CASE (Bdiscard):
977 DISCARD (1);
978 NEXT;
979
980 CASE (Bconstant2):
981 PUSH (vectorp[FETCH2]);
982 NEXT;
983
984 CASE (Bsave_excursion):
985 dynwind_begin ();
986 record_unwind_protect (save_excursion_restore,
987 save_excursion_save ());
988 NEXT;
989
990 CASE (Bsave_current_buffer): /* Obsolete since ??. */
991 CASE (Bsave_current_buffer_1):
992 dynwind_begin ();
993 record_unwind_current_buffer ();
994 NEXT;
995
996 CASE (Bsave_window_excursion): /* Obsolete since 24.1. */
997 {
998 dynwind_begin ();
999 record_unwind_protect (restore_window_configuration,
1000 Fcurrent_window_configuration (Qnil));
1001 BEFORE_POTENTIAL_GC ();
1002 TOP = Fprogn (TOP);
1003 dynwind_end ();
1004 AFTER_POTENTIAL_GC ();
1005 NEXT;
1006 }
1007
1008 CASE (Bsave_restriction):
1009 dynwind_begin ();
1010 record_unwind_protect (save_restriction_restore,
1011 save_restriction_save ());
1012 NEXT;
1013
1014 CASE (Bcatch): /* Obsolete since 24.4. */
1015 {
1016 Lisp_Object v1;
1017 BEFORE_POTENTIAL_GC ();
1018 v1 = POP;
1019 TOP = internal_catch (TOP, eval_sub, v1);
1020 AFTER_POTENTIAL_GC ();
1021 NEXT;
1022 }
1023
1024 CASE (Bpushcatch): /* New in 24.4. */
1025 type = CATCHER;
1026 goto pushhandler;
1027 CASE (Bpushconditioncase): /* New in 24.4. */
1028 {
1029 extern EMACS_INT lisp_eval_depth;
1030 extern int poll_suppress_count;
1031 extern int interrupt_input_blocked;
1032 struct handler *c;
1033 Lisp_Object tag;
1034 int dest;
1035
1036 type = CONDITION_CASE;
1037 pushhandler:
1038 tag = POP;
1039 dest = FETCH2;
1040
1041 PUSH_HANDLER (c, tag, type);
1042 c->bytecode_dest = dest;
1043 c->bytecode_top = top;
1044
1045 if (sys_setjmp (c->jmp))
1046 {
1047 struct handler *c = handlerlist;
1048 int dest;
1049 top = c->bytecode_top;
1050 dest = c->bytecode_dest;
1051 handlerlist = c->next;
1052 PUSH (c->val);
1053 CHECK_RANGE (dest);
1054 /* Might have been re-set by longjmp! */
1055 stack.byte_string_start = SDATA (stack.byte_string);
1056 stack.pc = stack.byte_string_start + dest;
1057 }
1058
1059 NEXT;
1060 }
1061
1062 CASE (Bpophandler): /* New in 24.4. */
1063 {
1064 handlerlist = handlerlist->next;
1065 NEXT;
1066 }
1067
1068 CASE (Bunwind_protect): /* FIXME: avoid closure for lexbind. */
1069 {
1070 Lisp_Object handler = POP;
1071 dynwind_begin ();
1072 /* Support for a function here is new in 24.4. */
1073 record_unwind_protect (NILP (Ffunctionp (handler))
1074 ? unwind_body : bcall0,
1075 handler);
1076 NEXT;
1077 }
1078
1079 CASE (Bcondition_case): /* Obsolete since 24.4. */
1080 {
1081 Lisp_Object handlers, body;
1082 handlers = POP;
1083 body = POP;
1084 BEFORE_POTENTIAL_GC ();
1085 TOP = internal_lisp_condition_case (TOP, body, handlers);
1086 AFTER_POTENTIAL_GC ();
1087 NEXT;
1088 }
1089
1090 CASE (Btemp_output_buffer_setup): /* Obsolete since 24.1. */
1091 BEFORE_POTENTIAL_GC ();
1092 CHECK_STRING (TOP);
1093 dynwind_begin ();
1094 temp_output_buffer_setup (SSDATA (TOP));
1095 AFTER_POTENTIAL_GC ();
1096 TOP = Vstandard_output;
1097 NEXT;
1098
1099 CASE (Btemp_output_buffer_show): /* Obsolete since 24.1. */
1100 {
1101 Lisp_Object v1;
1102 BEFORE_POTENTIAL_GC ();
1103 v1 = POP;
1104 temp_output_buffer_show (TOP);
1105 TOP = v1;
1106 /* pop binding of standard-output */
1107 dynwind_end ();
1108 AFTER_POTENTIAL_GC ();
1109 NEXT;
1110 }
1111
1112 CASE (Bnth):
1113 {
1114 Lisp_Object v1, v2;
1115 EMACS_INT n;
1116 BEFORE_POTENTIAL_GC ();
1117 v1 = POP;
1118 v2 = TOP;
1119 CHECK_NUMBER (v2);
1120 n = XINT (v2);
1121 immediate_quit = 1;
1122 while (--n >= 0 && CONSP (v1))
1123 v1 = XCDR (v1);
1124 immediate_quit = 0;
1125 TOP = CAR (v1);
1126 AFTER_POTENTIAL_GC ();
1127 NEXT;
1128 }
1129
1130 CASE (Bsymbolp):
1131 TOP = SYMBOLP (TOP) ? Qt : Qnil;
1132 NEXT;
1133
1134 CASE (Bconsp):
1135 TOP = CONSP (TOP) ? Qt : Qnil;
1136 NEXT;
1137
1138 CASE (Bstringp):
1139 TOP = STRINGP (TOP) ? Qt : Qnil;
1140 NEXT;
1141
1142 CASE (Blistp):
1143 TOP = CONSP (TOP) || NILP (TOP) ? Qt : Qnil;
1144 NEXT;
1145
1146 CASE (Bnot):
1147 TOP = NILP (TOP) ? Qt : Qnil;
1148 NEXT;
1149
1150 CASE (Bcons):
1151 {
1152 Lisp_Object v1;
1153 v1 = POP;
1154 TOP = Fcons (TOP, v1);
1155 NEXT;
1156 }
1157
1158 CASE (Blist1):
1159 TOP = list1 (TOP);
1160 NEXT;
1161
1162 CASE (Blist2):
1163 {
1164 Lisp_Object v1;
1165 v1 = POP;
1166 TOP = list2 (TOP, v1);
1167 NEXT;
1168 }
1169
1170 CASE (Blist3):
1171 DISCARD (2);
1172 TOP = Flist (3, &TOP);
1173 NEXT;
1174
1175 CASE (Blist4):
1176 DISCARD (3);
1177 TOP = Flist (4, &TOP);
1178 NEXT;
1179
1180 CASE (BlistN):
1181 op = FETCH;
1182 DISCARD (op - 1);
1183 TOP = Flist (op, &TOP);
1184 NEXT;
1185
1186 CASE (Blength):
1187 BEFORE_POTENTIAL_GC ();
1188 TOP = Flength (TOP);
1189 AFTER_POTENTIAL_GC ();
1190 NEXT;
1191
1192 CASE (Baref):
1193 {
1194 Lisp_Object v1;
1195 BEFORE_POTENTIAL_GC ();
1196 v1 = POP;
1197 TOP = Faref (TOP, v1);
1198 AFTER_POTENTIAL_GC ();
1199 NEXT;
1200 }
1201
1202 CASE (Baset):
1203 {
1204 Lisp_Object v1, v2;
1205 BEFORE_POTENTIAL_GC ();
1206 v2 = POP; v1 = POP;
1207 TOP = Faset (TOP, v1, v2);
1208 AFTER_POTENTIAL_GC ();
1209 NEXT;
1210 }
1211
1212 CASE (Bsymbol_value):
1213 BEFORE_POTENTIAL_GC ();
1214 TOP = Fsymbol_value (TOP);
1215 AFTER_POTENTIAL_GC ();
1216 NEXT;
1217
1218 CASE (Bsymbol_function):
1219 BEFORE_POTENTIAL_GC ();
1220 TOP = Fsymbol_function (TOP);
1221 AFTER_POTENTIAL_GC ();
1222 NEXT;
1223
1224 CASE (Bset):
1225 {
1226 Lisp_Object v1;
1227 BEFORE_POTENTIAL_GC ();
1228 v1 = POP;
1229 TOP = Fset (TOP, v1);
1230 AFTER_POTENTIAL_GC ();
1231 NEXT;
1232 }
1233
1234 CASE (Bfset):
1235 {
1236 Lisp_Object v1;
1237 BEFORE_POTENTIAL_GC ();
1238 v1 = POP;
1239 TOP = Ffset (TOP, v1);
1240 AFTER_POTENTIAL_GC ();
1241 NEXT;
1242 }
1243
1244 CASE (Bget):
1245 {
1246 Lisp_Object v1;
1247 BEFORE_POTENTIAL_GC ();
1248 v1 = POP;
1249 TOP = Fget (TOP, v1);
1250 AFTER_POTENTIAL_GC ();
1251 NEXT;
1252 }
1253
1254 CASE (Bsubstring):
1255 {
1256 Lisp_Object v1, v2;
1257 BEFORE_POTENTIAL_GC ();
1258 v2 = POP; v1 = POP;
1259 TOP = Fsubstring (TOP, v1, v2);
1260 AFTER_POTENTIAL_GC ();
1261 NEXT;
1262 }
1263
1264 CASE (Bconcat2):
1265 BEFORE_POTENTIAL_GC ();
1266 DISCARD (1);
1267 TOP = Fconcat (2, &TOP);
1268 AFTER_POTENTIAL_GC ();
1269 NEXT;
1270
1271 CASE (Bconcat3):
1272 BEFORE_POTENTIAL_GC ();
1273 DISCARD (2);
1274 TOP = Fconcat (3, &TOP);
1275 AFTER_POTENTIAL_GC ();
1276 NEXT;
1277
1278 CASE (Bconcat4):
1279 BEFORE_POTENTIAL_GC ();
1280 DISCARD (3);
1281 TOP = Fconcat (4, &TOP);
1282 AFTER_POTENTIAL_GC ();
1283 NEXT;
1284
1285 CASE (BconcatN):
1286 op = FETCH;
1287 BEFORE_POTENTIAL_GC ();
1288 DISCARD (op - 1);
1289 TOP = Fconcat (op, &TOP);
1290 AFTER_POTENTIAL_GC ();
1291 NEXT;
1292
1293 CASE (Bsub1):
1294 {
1295 Lisp_Object v1;
1296 v1 = TOP;
1297 if (INTEGERP (v1))
1298 {
1299 XSETINT (v1, XINT (v1) - 1);
1300 TOP = v1;
1301 }
1302 else
1303 {
1304 BEFORE_POTENTIAL_GC ();
1305 TOP = Fsub1 (v1);
1306 AFTER_POTENTIAL_GC ();
1307 }
1308 NEXT;
1309 }
1310
1311 CASE (Badd1):
1312 {
1313 Lisp_Object v1;
1314 v1 = TOP;
1315 if (INTEGERP (v1))
1316 {
1317 XSETINT (v1, XINT (v1) + 1);
1318 TOP = v1;
1319 }
1320 else
1321 {
1322 BEFORE_POTENTIAL_GC ();
1323 TOP = Fadd1 (v1);
1324 AFTER_POTENTIAL_GC ();
1325 }
1326 NEXT;
1327 }
1328
1329 CASE (Beqlsign):
1330 {
1331 Lisp_Object v1, v2;
1332 BEFORE_POTENTIAL_GC ();
1333 v2 = POP; v1 = TOP;
1334 CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v1);
1335 CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v2);
1336 AFTER_POTENTIAL_GC ();
1337 if (FLOATP (v1) || FLOATP (v2))
1338 {
1339 double f1, f2;
1340
1341 f1 = (FLOATP (v1) ? XFLOAT_DATA (v1) : XINT (v1));
1342 f2 = (FLOATP (v2) ? XFLOAT_DATA (v2) : XINT (v2));
1343 TOP = (f1 == f2 ? Qt : Qnil);
1344 }
1345 else
1346 TOP = (XINT (v1) == XINT (v2) ? Qt : Qnil);
1347 NEXT;
1348 }
1349
1350 CASE (Bgtr):
1351 {
1352 Lisp_Object v1;
1353 BEFORE_POTENTIAL_GC ();
1354 v1 = POP;
1355 TOP = arithcompare (TOP, v1, ARITH_GRTR);
1356 AFTER_POTENTIAL_GC ();
1357 NEXT;
1358 }
1359
1360 CASE (Blss):
1361 {
1362 Lisp_Object v1;
1363 BEFORE_POTENTIAL_GC ();
1364 v1 = POP;
1365 TOP = arithcompare (TOP, v1, ARITH_LESS);
1366 AFTER_POTENTIAL_GC ();
1367 NEXT;
1368 }
1369
1370 CASE (Bleq):
1371 {
1372 Lisp_Object v1;
1373 BEFORE_POTENTIAL_GC ();
1374 v1 = POP;
1375 TOP = arithcompare (TOP, v1, ARITH_LESS_OR_EQUAL);
1376 AFTER_POTENTIAL_GC ();
1377 NEXT;
1378 }
1379
1380 CASE (Bgeq):
1381 {
1382 Lisp_Object v1;
1383 BEFORE_POTENTIAL_GC ();
1384 v1 = POP;
1385 TOP = arithcompare (TOP, v1, ARITH_GRTR_OR_EQUAL);
1386 AFTER_POTENTIAL_GC ();
1387 NEXT;
1388 }
1389
1390 CASE (Bdiff):
1391 BEFORE_POTENTIAL_GC ();
1392 DISCARD (1);
1393 TOP = Fminus (2, &TOP);
1394 AFTER_POTENTIAL_GC ();
1395 NEXT;
1396
1397 CASE (Bnegate):
1398 {
1399 Lisp_Object v1;
1400 v1 = TOP;
1401 if (INTEGERP (v1))
1402 {
1403 XSETINT (v1, - XINT (v1));
1404 TOP = v1;
1405 }
1406 else
1407 {
1408 BEFORE_POTENTIAL_GC ();
1409 TOP = Fminus (1, &TOP);
1410 AFTER_POTENTIAL_GC ();
1411 }
1412 NEXT;
1413 }
1414
1415 CASE (Bplus):
1416 BEFORE_POTENTIAL_GC ();
1417 DISCARD (1);
1418 TOP = Fplus (2, &TOP);
1419 AFTER_POTENTIAL_GC ();
1420 NEXT;
1421
1422 CASE (Bmax):
1423 BEFORE_POTENTIAL_GC ();
1424 DISCARD (1);
1425 TOP = Fmax (2, &TOP);
1426 AFTER_POTENTIAL_GC ();
1427 NEXT;
1428
1429 CASE (Bmin):
1430 BEFORE_POTENTIAL_GC ();
1431 DISCARD (1);
1432 TOP = Fmin (2, &TOP);
1433 AFTER_POTENTIAL_GC ();
1434 NEXT;
1435
1436 CASE (Bmult):
1437 BEFORE_POTENTIAL_GC ();
1438 DISCARD (1);
1439 TOP = Ftimes (2, &TOP);
1440 AFTER_POTENTIAL_GC ();
1441 NEXT;
1442
1443 CASE (Bquo):
1444 BEFORE_POTENTIAL_GC ();
1445 DISCARD (1);
1446 TOP = Fquo (2, &TOP);
1447 AFTER_POTENTIAL_GC ();
1448 NEXT;
1449
1450 CASE (Brem):
1451 {
1452 Lisp_Object v1;
1453 BEFORE_POTENTIAL_GC ();
1454 v1 = POP;
1455 TOP = Frem (TOP, v1);
1456 AFTER_POTENTIAL_GC ();
1457 NEXT;
1458 }
1459
1460 CASE (Bpoint):
1461 {
1462 Lisp_Object v1;
1463 XSETFASTINT (v1, PT);
1464 PUSH (v1);
1465 NEXT;
1466 }
1467
1468 CASE (Bgoto_char):
1469 BEFORE_POTENTIAL_GC ();
1470 TOP = Fgoto_char (TOP);
1471 AFTER_POTENTIAL_GC ();
1472 NEXT;
1473
1474 CASE (Binsert):
1475 BEFORE_POTENTIAL_GC ();
1476 TOP = Finsert (1, &TOP);
1477 AFTER_POTENTIAL_GC ();
1478 NEXT;
1479
1480 CASE (BinsertN):
1481 op = FETCH;
1482 BEFORE_POTENTIAL_GC ();
1483 DISCARD (op - 1);
1484 TOP = Finsert (op, &TOP);
1485 AFTER_POTENTIAL_GC ();
1486 NEXT;
1487
1488 CASE (Bpoint_max):
1489 {
1490 Lisp_Object v1;
1491 XSETFASTINT (v1, ZV);
1492 PUSH (v1);
1493 NEXT;
1494 }
1495
1496 CASE (Bpoint_min):
1497 {
1498 Lisp_Object v1;
1499 XSETFASTINT (v1, BEGV);
1500 PUSH (v1);
1501 NEXT;
1502 }
1503
1504 CASE (Bchar_after):
1505 BEFORE_POTENTIAL_GC ();
1506 TOP = Fchar_after (TOP);
1507 AFTER_POTENTIAL_GC ();
1508 NEXT;
1509
1510 CASE (Bfollowing_char):
1511 {
1512 Lisp_Object v1;
1513 BEFORE_POTENTIAL_GC ();
1514 v1 = Ffollowing_char ();
1515 AFTER_POTENTIAL_GC ();
1516 PUSH (v1);
1517 NEXT;
1518 }
1519
1520 CASE (Bpreceding_char):
1521 {
1522 Lisp_Object v1;
1523 BEFORE_POTENTIAL_GC ();
1524 v1 = Fprevious_char ();
1525 AFTER_POTENTIAL_GC ();
1526 PUSH (v1);
1527 NEXT;
1528 }
1529
1530 CASE (Bcurrent_column):
1531 {
1532 Lisp_Object v1;
1533 BEFORE_POTENTIAL_GC ();
1534 XSETFASTINT (v1, current_column ());
1535 AFTER_POTENTIAL_GC ();
1536 PUSH (v1);
1537 NEXT;
1538 }
1539
1540 CASE (Bindent_to):
1541 BEFORE_POTENTIAL_GC ();
1542 TOP = Findent_to (TOP, Qnil);
1543 AFTER_POTENTIAL_GC ();
1544 NEXT;
1545
1546 CASE (Beolp):
1547 PUSH (Feolp ());
1548 NEXT;
1549
1550 CASE (Beobp):
1551 PUSH (Feobp ());
1552 NEXT;
1553
1554 CASE (Bbolp):
1555 PUSH (Fbolp ());
1556 NEXT;
1557
1558 CASE (Bbobp):
1559 PUSH (Fbobp ());
1560 NEXT;
1561
1562 CASE (Bcurrent_buffer):
1563 PUSH (Fcurrent_buffer ());
1564 NEXT;
1565
1566 CASE (Bset_buffer):
1567 BEFORE_POTENTIAL_GC ();
1568 TOP = Fset_buffer (TOP);
1569 AFTER_POTENTIAL_GC ();
1570 NEXT;
1571
1572 CASE (Binteractive_p): /* Obsolete since 24.1. */
1573 BEFORE_POTENTIAL_GC ();
1574 PUSH (call0 (intern ("interactive-p")));
1575 AFTER_POTENTIAL_GC ();
1576 NEXT;
1577
1578 CASE (Bforward_char):
1579 BEFORE_POTENTIAL_GC ();
1580 TOP = Fforward_char (TOP);
1581 AFTER_POTENTIAL_GC ();
1582 NEXT;
1583
1584 CASE (Bforward_word):
1585 BEFORE_POTENTIAL_GC ();
1586 TOP = Fforward_word (TOP);
1587 AFTER_POTENTIAL_GC ();
1588 NEXT;
1589
1590 CASE (Bskip_chars_forward):
1591 {
1592 Lisp_Object v1;
1593 BEFORE_POTENTIAL_GC ();
1594 v1 = POP;
1595 TOP = Fskip_chars_forward (TOP, v1);
1596 AFTER_POTENTIAL_GC ();
1597 NEXT;
1598 }
1599
1600 CASE (Bskip_chars_backward):
1601 {
1602 Lisp_Object v1;
1603 BEFORE_POTENTIAL_GC ();
1604 v1 = POP;
1605 TOP = Fskip_chars_backward (TOP, v1);
1606 AFTER_POTENTIAL_GC ();
1607 NEXT;
1608 }
1609
1610 CASE (Bforward_line):
1611 BEFORE_POTENTIAL_GC ();
1612 TOP = Fforward_line (TOP);
1613 AFTER_POTENTIAL_GC ();
1614 NEXT;
1615
1616 CASE (Bchar_syntax):
1617 {
1618 int c;
1619
1620 BEFORE_POTENTIAL_GC ();
1621 CHECK_CHARACTER (TOP);
1622 AFTER_POTENTIAL_GC ();
1623 c = XFASTINT (TOP);
1624 if (NILP (BVAR (current_buffer, enable_multibyte_characters)))
1625 MAKE_CHAR_MULTIBYTE (c);
1626 XSETFASTINT (TOP, syntax_code_spec[SYNTAX (c)]);
1627 }
1628 NEXT;
1629
1630 CASE (Bbuffer_substring):
1631 {
1632 Lisp_Object v1;
1633 BEFORE_POTENTIAL_GC ();
1634 v1 = POP;
1635 TOP = Fbuffer_substring (TOP, v1);
1636 AFTER_POTENTIAL_GC ();
1637 NEXT;
1638 }
1639
1640 CASE (Bdelete_region):
1641 {
1642 Lisp_Object v1;
1643 BEFORE_POTENTIAL_GC ();
1644 v1 = POP;
1645 TOP = Fdelete_region (TOP, v1);
1646 AFTER_POTENTIAL_GC ();
1647 NEXT;
1648 }
1649
1650 CASE (Bnarrow_to_region):
1651 {
1652 Lisp_Object v1;
1653 BEFORE_POTENTIAL_GC ();
1654 v1 = POP;
1655 TOP = Fnarrow_to_region (TOP, v1);
1656 AFTER_POTENTIAL_GC ();
1657 NEXT;
1658 }
1659
1660 CASE (Bwiden):
1661 BEFORE_POTENTIAL_GC ();
1662 PUSH (Fwiden ());
1663 AFTER_POTENTIAL_GC ();
1664 NEXT;
1665
1666 CASE (Bend_of_line):
1667 BEFORE_POTENTIAL_GC ();
1668 TOP = Fend_of_line (TOP);
1669 AFTER_POTENTIAL_GC ();
1670 NEXT;
1671
1672 CASE (Bset_marker):
1673 {
1674 Lisp_Object v1, v2;
1675 BEFORE_POTENTIAL_GC ();
1676 v1 = POP;
1677 v2 = POP;
1678 TOP = Fset_marker (TOP, v2, v1);
1679 AFTER_POTENTIAL_GC ();
1680 NEXT;
1681 }
1682
1683 CASE (Bmatch_beginning):
1684 BEFORE_POTENTIAL_GC ();
1685 TOP = Fmatch_beginning (TOP);
1686 AFTER_POTENTIAL_GC ();
1687 NEXT;
1688
1689 CASE (Bmatch_end):
1690 BEFORE_POTENTIAL_GC ();
1691 TOP = Fmatch_end (TOP);
1692 AFTER_POTENTIAL_GC ();
1693 NEXT;
1694
1695 CASE (Bupcase):
1696 BEFORE_POTENTIAL_GC ();
1697 TOP = Fupcase (TOP);
1698 AFTER_POTENTIAL_GC ();
1699 NEXT;
1700
1701 CASE (Bdowncase):
1702 BEFORE_POTENTIAL_GC ();
1703 TOP = Fdowncase (TOP);
1704 AFTER_POTENTIAL_GC ();
1705 NEXT;
1706
1707 CASE (Bstringeqlsign):
1708 {
1709 Lisp_Object v1;
1710 BEFORE_POTENTIAL_GC ();
1711 v1 = POP;
1712 TOP = Fstring_equal (TOP, v1);
1713 AFTER_POTENTIAL_GC ();
1714 NEXT;
1715 }
1716
1717 CASE (Bstringlss):
1718 {
1719 Lisp_Object v1;
1720 BEFORE_POTENTIAL_GC ();
1721 v1 = POP;
1722 TOP = Fstring_lessp (TOP, v1);
1723 AFTER_POTENTIAL_GC ();
1724 NEXT;
1725 }
1726
1727 CASE (Bequal):
1728 {
1729 Lisp_Object v1;
1730 v1 = POP;
1731 TOP = Fequal (TOP, v1);
1732 NEXT;
1733 }
1734
1735 CASE (Bnthcdr):
1736 {
1737 Lisp_Object v1;
1738 BEFORE_POTENTIAL_GC ();
1739 v1 = POP;
1740 TOP = Fnthcdr (TOP, v1);
1741 AFTER_POTENTIAL_GC ();
1742 NEXT;
1743 }
1744
1745 CASE (Belt):
1746 {
1747 Lisp_Object v1, v2;
1748 if (CONSP (TOP))
1749 {
1750 /* Exchange args and then do nth. */
1751 EMACS_INT n;
1752 BEFORE_POTENTIAL_GC ();
1753 v2 = POP;
1754 v1 = TOP;
1755 CHECK_NUMBER (v2);
1756 AFTER_POTENTIAL_GC ();
1757 n = XINT (v2);
1758 immediate_quit = 1;
1759 while (--n >= 0 && CONSP (v1))
1760 v1 = XCDR (v1);
1761 immediate_quit = 0;
1762 TOP = CAR (v1);
1763 }
1764 else
1765 {
1766 BEFORE_POTENTIAL_GC ();
1767 v1 = POP;
1768 TOP = Felt (TOP, v1);
1769 AFTER_POTENTIAL_GC ();
1770 }
1771 NEXT;
1772 }
1773
1774 CASE (Bmember):
1775 {
1776 Lisp_Object v1;
1777 BEFORE_POTENTIAL_GC ();
1778 v1 = POP;
1779 TOP = Fmember (TOP, v1);
1780 AFTER_POTENTIAL_GC ();
1781 NEXT;
1782 }
1783
1784 CASE (Bassq):
1785 {
1786 Lisp_Object v1;
1787 BEFORE_POTENTIAL_GC ();
1788 v1 = POP;
1789 TOP = Fassq (TOP, v1);
1790 AFTER_POTENTIAL_GC ();
1791 NEXT;
1792 }
1793
1794 CASE (Bnreverse):
1795 BEFORE_POTENTIAL_GC ();
1796 TOP = Fnreverse (TOP);
1797 AFTER_POTENTIAL_GC ();
1798 NEXT;
1799
1800 CASE (Bsetcar):
1801 {
1802 Lisp_Object v1;
1803 BEFORE_POTENTIAL_GC ();
1804 v1 = POP;
1805 TOP = Fsetcar (TOP, v1);
1806 AFTER_POTENTIAL_GC ();
1807 NEXT;
1808 }
1809
1810 CASE (Bsetcdr):
1811 {
1812 Lisp_Object v1;
1813 BEFORE_POTENTIAL_GC ();
1814 v1 = POP;
1815 TOP = Fsetcdr (TOP, v1);
1816 AFTER_POTENTIAL_GC ();
1817 NEXT;
1818 }
1819
1820 CASE (Bcar_safe):
1821 {
1822 Lisp_Object v1;
1823 v1 = TOP;
1824 TOP = CAR_SAFE (v1);
1825 NEXT;
1826 }
1827
1828 CASE (Bcdr_safe):
1829 {
1830 Lisp_Object v1;
1831 v1 = TOP;
1832 TOP = CDR_SAFE (v1);
1833 NEXT;
1834 }
1835
1836 CASE (Bnconc):
1837 BEFORE_POTENTIAL_GC ();
1838 DISCARD (1);
1839 TOP = Fnconc (2, &TOP);
1840 AFTER_POTENTIAL_GC ();
1841 NEXT;
1842
1843 CASE (Bnumberp):
1844 TOP = (NUMBERP (TOP) ? Qt : Qnil);
1845 NEXT;
1846
1847 CASE (Bintegerp):
1848 TOP = INTEGERP (TOP) ? Qt : Qnil;
1849 NEXT;
1850
1851 #ifdef BYTE_CODE_SAFE
1852 /* These are intentionally written using 'case' syntax,
1853 because they are incompatible with the threaded
1854 interpreter. */
1855
1856 case Bset_mark:
1857 BEFORE_POTENTIAL_GC ();
1858 error ("set-mark is an obsolete bytecode");
1859 AFTER_POTENTIAL_GC ();
1860 break;
1861 case Bscan_buffer:
1862 BEFORE_POTENTIAL_GC ();
1863 error ("scan-buffer is an obsolete bytecode");
1864 AFTER_POTENTIAL_GC ();
1865 break;
1866 #endif
1867
1868 CASE_ABORT:
1869 /* Actually this is Bstack_ref with offset 0, but we use Bdup
1870 for that instead. */
1871 /* CASE (Bstack_ref): */
1872 call3 (intern ("error"),
1873 build_string ("Invalid byte opcode: op=%s, ptr=%d"),
1874 make_number (op),
1875 make_number ((stack.pc - 1) - stack.byte_string_start));
1876
1877 /* Handy byte-codes for lexical binding. */
1878 CASE (Bstack_ref1):
1879 CASE (Bstack_ref2):
1880 CASE (Bstack_ref3):
1881 CASE (Bstack_ref4):
1882 CASE (Bstack_ref5):
1883 {
1884 Lisp_Object *ptr = top - (op - Bstack_ref);
1885 PUSH (*ptr);
1886 NEXT;
1887 }
1888 CASE (Bstack_ref6):
1889 {
1890 Lisp_Object *ptr = top - (FETCH);
1891 PUSH (*ptr);
1892 NEXT;
1893 }
1894 CASE (Bstack_ref7):
1895 {
1896 Lisp_Object *ptr = top - (FETCH2);
1897 PUSH (*ptr);
1898 NEXT;
1899 }
1900 CASE (Bstack_set):
1901 /* stack-set-0 = discard; stack-set-1 = discard-1-preserve-tos. */
1902 {
1903 Lisp_Object *ptr = top - (FETCH);
1904 *ptr = POP;
1905 NEXT;
1906 }
1907 CASE (Bstack_set2):
1908 {
1909 Lisp_Object *ptr = top - (FETCH2);
1910 *ptr = POP;
1911 NEXT;
1912 }
1913 CASE (BdiscardN):
1914 op = FETCH;
1915 if (op & 0x80)
1916 {
1917 op &= 0x7F;
1918 top[-op] = TOP;
1919 }
1920 DISCARD (op);
1921 NEXT;
1922
1923 CASE_DEFAULT
1924 CASE (Bconstant):
1925 #ifdef BYTE_CODE_SAFE
1926 if (op < Bconstant)
1927 {
1928 emacs_abort ();
1929 }
1930 if ((op -= Bconstant) >= const_length)
1931 {
1932 emacs_abort ();
1933 }
1934 PUSH (vectorp[op]);
1935 #else
1936 PUSH (vectorp[op - Bconstant]);
1937 #endif
1938 NEXT;
1939 }
1940 }
1941
1942 exit:
1943
1944 /* Binds and unbinds are supposed to be compiled balanced. */
1945 if (SPECPDL_INDEX () != count)
1946 {
1947 if (SPECPDL_INDEX () > count)
1948 unbind_to (count, Qnil);
1949 error ("binding stack not balanced (serious byte compiler bug)");
1950 }
1951
1952 return result;
1953 }
1954
1955 void
1956 syms_of_bytecode (void)
1957 {
1958 #include "bytecode.x"
1959
1960 #ifdef BYTE_CODE_METER
1961
1962 DEFVAR_LISP ("byte-code-meter", Vbyte_code_meter,
1963 doc: /* A vector of vectors which holds a histogram of byte-code usage.
1964 \(aref (aref byte-code-meter 0) CODE) indicates how many times the byte
1965 opcode CODE has been executed.
1966 \(aref (aref byte-code-meter CODE1) CODE2), where CODE1 is not 0,
1967 indicates how many times the byte opcodes CODE1 and CODE2 have been
1968 executed in succession. */);
1969
1970 DEFVAR_BOOL ("byte-metering-on", byte_metering_on,
1971 doc: /* If non-nil, keep profiling information on byte code usage.
1972 The variable byte-code-meter indicates how often each byte opcode is used.
1973 If a symbol has a property named `byte-code-meter' whose value is an
1974 integer, it is incremented each time that symbol's function is called. */);
1975
1976 byte_metering_on = 0;
1977 Vbyte_code_meter = Fmake_vector (make_number (256), make_number (0));
1978 DEFSYM (Qbyte_code_meter, "byte-code-meter");
1979 {
1980 int i = 256;
1981 while (i--)
1982 ASET (Vbyte_code_meter, i,
1983 Fmake_vector (make_number (256), make_number (0)));
1984 }
1985 #endif
1986 }
Unnamed repository; edit this file 'description' to name the repository.