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