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 | */ |
a9de04fa | 54 | #define BYTE_CODE_SAFE 1 |
63639d44 | 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 | |
63639d44 | 79 | #else /* no BYTE_CODE_METER */ |
36f7ba0a | 80 | |
63639d44 | 81 | #define METER_CODE(last_code, this_code) |
044512ed | 82 | |
63639d44 | 83 | #endif /* no BYTE_CODE_METER */ |
36f7ba0a JB |
84 | \f |
85 | ||
86 | Lisp_Object Qbytecode; | |
b9598260 | 87 | extern Lisp_Object Qand_optional, Qand_rest; |
36f7ba0a JB |
88 | |
89 | /* Byte codes: */ | |
90 | ||
3e21b6a7 | 91 | #define Bstack_ref 0 /* Actually, Bstack_ref+0 is not implemented: use dup. */ |
36f7ba0a JB |
92 | #define Bvarref 010 |
93 | #define Bvarset 020 | |
94 | #define Bvarbind 030 | |
95 | #define Bcall 040 | |
96 | #define Bunbind 050 | |
97 | ||
98 | #define Bnth 070 | |
99 | #define Bsymbolp 071 | |
100 | #define Bconsp 072 | |
101 | #define Bstringp 073 | |
102 | #define Blistp 074 | |
103 | #define Beq 075 | |
104 | #define Bmemq 076 | |
105 | #define Bnot 077 | |
106 | #define Bcar 0100 | |
107 | #define Bcdr 0101 | |
108 | #define Bcons 0102 | |
109 | #define Blist1 0103 | |
110 | #define Blist2 0104 | |
111 | #define Blist3 0105 | |
112 | #define Blist4 0106 | |
113 | #define Blength 0107 | |
114 | #define Baref 0110 | |
115 | #define Baset 0111 | |
116 | #define Bsymbol_value 0112 | |
63639d44 | 117 | #define Bsymbol_function 0113 |
36f7ba0a | 118 | #define Bset 0114 |
63639d44 | 119 | #define Bfset 0115 |
36f7ba0a JB |
120 | #define Bget 0116 |
121 | #define Bsubstring 0117 | |
122 | #define Bconcat2 0120 | |
123 | #define Bconcat3 0121 | |
124 | #define Bconcat4 0122 | |
125 | #define Bsub1 0123 | |
126 | #define Badd1 0124 | |
127 | #define Beqlsign 0125 | |
128 | #define Bgtr 0126 | |
129 | #define Blss 0127 | |
130 | #define Bleq 0130 | |
131 | #define Bgeq 0131 | |
132 | #define Bdiff 0132 | |
133 | #define Bnegate 0133 | |
134 | #define Bplus 0134 | |
135 | #define Bmax 0135 | |
136 | #define Bmin 0136 | |
137 | #define Bmult 0137 | |
138 | ||
139 | #define Bpoint 0140 | |
3b841abc | 140 | /* Was Bmark in v17. */ |
e0f57e65 | 141 | #define Bsave_current_buffer 0141 /* Obsolete. */ |
36f7ba0a JB |
142 | #define Bgoto_char 0142 |
143 | #define Binsert 0143 | |
144 | #define Bpoint_max 0144 | |
145 | #define Bpoint_min 0145 | |
146 | #define Bchar_after 0146 | |
147 | #define Bfollowing_char 0147 | |
148 | #define Bpreceding_char 0150 | |
149 | #define Bcurrent_column 0151 | |
150 | #define Bindent_to 0152 | |
151 | #define Bscan_buffer 0153 /* No longer generated as of v18 */ | |
152 | #define Beolp 0154 | |
153 | #define Beobp 0155 | |
154 | #define Bbolp 0156 | |
155 | #define Bbobp 0157 | |
156 | #define Bcurrent_buffer 0160 | |
157 | #define Bset_buffer 0161 | |
80402f25 | 158 | #define Bsave_current_buffer_1 0162 /* Replacing Bsave_current_buffer. */ |
63639d44 | 159 | #define Bread_char 0162 /* No longer generated as of v19 */ |
36f7ba0a | 160 | #define Bset_mark 0163 /* this loser is no longer generated as of v18 */ |
e0f57e65 | 161 | #define Binteractive_p 0164 /* Obsolete. */ |
36f7ba0a JB |
162 | |
163 | #define Bforward_char 0165 | |
164 | #define Bforward_word 0166 | |
165 | #define Bskip_chars_forward 0167 | |
166 | #define Bskip_chars_backward 0170 | |
167 | #define Bforward_line 0171 | |
168 | #define Bchar_syntax 0172 | |
169 | #define Bbuffer_substring 0173 | |
170 | #define Bdelete_region 0174 | |
171 | #define Bnarrow_to_region 0175 | |
172 | #define Bwiden 0176 | |
63639d44 | 173 | #define Bend_of_line 0177 |
36f7ba0a JB |
174 | |
175 | #define Bconstant2 0201 | |
176 | #define Bgoto 0202 | |
177 | #define Bgotoifnil 0203 | |
178 | #define Bgotoifnonnil 0204 | |
179 | #define Bgotoifnilelsepop 0205 | |
180 | #define Bgotoifnonnilelsepop 0206 | |
181 | #define Breturn 0207 | |
182 | #define Bdiscard 0210 | |
183 | #define Bdup 0211 | |
184 | ||
185 | #define Bsave_excursion 0212 | |
e0f57e65 | 186 | #define Bsave_window_excursion 0213 /* Obsolete. */ |
36f7ba0a JB |
187 | #define Bsave_restriction 0214 |
188 | #define Bcatch 0215 | |
189 | ||
190 | #define Bunwind_protect 0216 | |
191 | #define Bcondition_case 0217 | |
3e21b6a7 SM |
192 | #define Btemp_output_buffer_setup 0220 /* Obsolete. */ |
193 | #define Btemp_output_buffer_show 0221 /* Obsolete. */ | |
36f7ba0a | 194 | |
e0f57e65 | 195 | #define Bunbind_all 0222 /* Obsolete. */ |
36f7ba0a | 196 | |
63639d44 JB |
197 | #define Bset_marker 0223 |
198 | #define Bmatch_beginning 0224 | |
199 | #define Bmatch_end 0225 | |
200 | #define Bupcase 0226 | |
201 | #define Bdowncase 0227 | |
202 | ||
36f7ba0a JB |
203 | #define Bstringeqlsign 0230 |
204 | #define Bstringlss 0231 | |
205 | #define Bequal 0232 | |
206 | #define Bnthcdr 0233 | |
207 | #define Belt 0234 | |
208 | #define Bmember 0235 | |
209 | #define Bassq 0236 | |
210 | #define Bnreverse 0237 | |
211 | #define Bsetcar 0240 | |
212 | #define Bsetcdr 0241 | |
213 | #define Bcar_safe 0242 | |
214 | #define Bcdr_safe 0243 | |
215 | #define Bnconc 0244 | |
216 | #define Bquo 0245 | |
217 | #define Brem 0246 | |
218 | #define Bnumberp 0247 | |
219 | #define Bintegerp 0250 | |
220 | ||
63639d44 JB |
221 | #define BRgoto 0252 |
222 | #define BRgotoifnil 0253 | |
223 | #define BRgotoifnonnil 0254 | |
224 | #define BRgotoifnilelsepop 0255 | |
225 | #define BRgotoifnonnilelsepop 0256 | |
226 | ||
227 | #define BlistN 0257 | |
228 | #define BconcatN 0260 | |
229 | #define BinsertN 0261 | |
230 | ||
b9598260 SM |
231 | /* Bstack_ref is code 0. */ |
232 | #define Bstack_set 0262 | |
233 | #define Bstack_set2 0263 | |
b9598260 SM |
234 | #define BdiscardN 0266 |
235 | ||
36f7ba0a JB |
236 | #define Bconstant 0300 |
237 | #define CONSTANTLIM 0100 | |
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 RS |
372 | #define MAYBE_GC() \ |
373 | if (consing_since_gc > gc_cons_threshold \ | |
374 | && consing_since_gc > gc_relative_threshold) \ | |
375 | { \ | |
376 | BEFORE_POTENTIAL_GC (); \ | |
377 | Fgarbage_collect (); \ | |
378 | AFTER_POTENTIAL_GC (); \ | |
379 | } \ | |
5e7ed093 RS |
380 | else |
381 | ||
3d5fc37b | 382 | /* Check for jumping out of range. */ |
7ca1e8b7 GM |
383 | |
384 | #ifdef BYTE_CODE_SAFE | |
385 | ||
4015b3c0 | 386 | #define CHECK_RANGE(ARG) \ |
3d5fc37b RS |
387 | if (ARG >= bytestr_length) abort () |
388 | ||
4015b3c0 | 389 | #else /* not BYTE_CODE_SAFE */ |
7ca1e8b7 GM |
390 | |
391 | #define CHECK_RANGE(ARG) | |
392 | ||
4015b3c0 | 393 | #endif /* not BYTE_CODE_SAFE */ |
7ca1e8b7 | 394 | |
e12ea64e GM |
395 | /* A version of the QUIT macro which makes sure that the stack top is |
396 | set before signaling `quit'. */ | |
397 | ||
398 | #define BYTE_CODE_QUIT \ | |
399 | do { \ | |
400 | if (!NILP (Vquit_flag) && NILP (Vinhibit_quit)) \ | |
401 | { \ | |
731475e7 | 402 | Lisp_Object flag = Vquit_flag; \ |
e12ea64e GM |
403 | Vquit_flag = Qnil; \ |
404 | BEFORE_POTENTIAL_GC (); \ | |
731475e7 | 405 | if (EQ (Vthrow_on_input, flag)) \ |
a8f0f551 | 406 | Fthrow (Vthrow_on_input, Qt); \ |
e12ea64e | 407 | Fsignal (Qquit, Qnil); \ |
892a8eb5 | 408 | AFTER_POTENTIAL_GC (); \ |
e12ea64e | 409 | } \ |
c0335e02 | 410 | ELSE_PENDING_SIGNALS \ |
e12ea64e GM |
411 | } while (0) |
412 | ||
7ca1e8b7 | 413 | |
b9598260 | 414 | DEFUN ("byte-code", Fbyte_code, Sbyte_code, 3, MANY, 0, |
39f624fa PJ |
415 | doc: /* Function used internally in byte-compiled code. |
416 | The first argument, BYTESTR, is a string of byte code; | |
417 | the second, VECTOR, a vector of constants; | |
418 | the third, MAXDEPTH, the maximum stack depth used in this function. | |
b9598260 SM |
419 | If the third argument is incorrect, Emacs may crash. |
420 | ||
421 | If ARGS-TEMPLATE is specified, it is an argument list specification, | |
422 | according to which any remaining arguments are pushed on the stack | |
423 | before executing BYTESTR. | |
424 | ||
425 | usage: (byte-code BYTESTR VECTOR MAXDEP &optional ARGS-TEMPLATE &rest ARGS) */) | |
0ee81a0c | 426 | (int nargs, Lisp_Object *args) |
b9598260 SM |
427 | { |
428 | Lisp_Object args_tmpl = nargs >= 4 ? args[3] : Qnil; | |
429 | int pnargs = nargs >= 4 ? nargs - 4 : 0; | |
430 | Lisp_Object *pargs = nargs >= 4 ? args + 4 : 0; | |
431 | return exec_byte_code (args[0], args[1], args[2], args_tmpl, pnargs, pargs); | |
432 | } | |
433 | ||
434 | /* Execute the byte-code in BYTESTR. VECTOR is the constant vector, and | |
435 | MAXDEPTH is the maximum stack depth used (if MAXDEPTH is incorrect, | |
436 | emacs may crash!). If ARGS_TEMPLATE is non-nil, it should be a lisp | |
437 | argument list (including &rest, &optional, etc.), and ARGS, of size | |
438 | NARGS, should be a vector of the actual arguments. The arguments in | |
439 | ARGS are pushed on the stack according to ARGS_TEMPLATE before | |
440 | executing BYTESTR. */ | |
441 | ||
442 | Lisp_Object | |
0ee81a0c SM |
443 | exec_byte_code (Lisp_Object bytestr, Lisp_Object vector, Lisp_Object maxdepth, |
444 | Lisp_Object args_template, int nargs, Lisp_Object *args) | |
36f7ba0a | 445 | { |
aed13378 | 446 | int count = SPECPDL_INDEX (); |
36f7ba0a JB |
447 | #ifdef BYTE_CODE_METER |
448 | int this_op = 0; | |
449 | int prev_op; | |
450 | #endif | |
7ca1e8b7 | 451 | int op; |
4015b3c0 | 452 | /* Lisp_Object v1, v2; */ |
089b985f | 453 | Lisp_Object *vectorp; |
36f7ba0a | 454 | #ifdef BYTE_CODE_SAFE |
7ca1e8b7 GM |
455 | int const_length = XVECTOR (vector)->size; |
456 | Lisp_Object *stacke; | |
36f7ba0a | 457 | #endif |
089b985f | 458 | int bytestr_length; |
7ca1e8b7 GM |
459 | struct byte_stack stack; |
460 | Lisp_Object *top; | |
4015b3c0 | 461 | Lisp_Object result; |
36f7ba0a | 462 | |
603a0937 | 463 | #if 0 /* CHECK_FRAME_FONT */ |
ad7de7d7 GM |
464 | { |
465 | struct frame *f = SELECTED_FRAME (); | |
466 | if (FRAME_X_P (f) | |
467 | && FRAME_FONT (f)->direction != 0 | |
468 | && FRAME_FONT (f)->direction != 1) | |
469 | abort (); | |
470 | } | |
471 | #endif | |
472 | ||
b7826503 | 473 | CHECK_STRING (bytestr); |
c616acb8 | 474 | CHECK_VECTOR (vector); |
b7826503 | 475 | CHECK_NUMBER (maxdepth); |
36f7ba0a | 476 | |
089b985f KH |
477 | if (STRING_MULTIBYTE (bytestr)) |
478 | /* BYTESTR must have been produced by Emacs 20.2 or the earlier | |
479 | because they produced a raw 8-bit string for byte-code and now | |
480 | such a byte-code string is loaded as multibyte while raw 8-bit | |
481 | characters converted to multibyte form. Thus, now we must | |
fbd98f82 | 482 | convert them back to the originally intended unibyte form. */ |
5274126b | 483 | bytestr = Fstring_as_unibyte (bytestr); |
089b985f | 484 | |
d5db4077 | 485 | bytestr_length = SBYTES (bytestr); |
089b985f KH |
486 | vectorp = XVECTOR (vector)->contents; |
487 | ||
7ca1e8b7 | 488 | stack.byte_string = bytestr; |
d5db4077 | 489 | stack.pc = stack.byte_string_start = SDATA (bytestr); |
7ca1e8b7 | 490 | stack.constants = vector; |
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 | { |
e2abe5a1 SM |
507 | int at = XINT (args_template); |
508 | int rest = at & 128; | |
509 | int mandatory = at & 127; | |
510 | int nonrest = at >> 8; | |
511 | eassert (mandatory <= nonrest); | |
512 | if (nargs <= nonrest) | |
513 | { | |
514 | int i; | |
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 | { | |
533 | int i; | |
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; | |
14c5155a | 632 | TOP = CAR (v1); |
4015b3c0 GM |
633 | break; |
634 | } | |
635 | ||
636 | case Beq: | |
637 | { | |
638 | Lisp_Object v1; | |
639 | v1 = POP; | |
640 | TOP = EQ (v1, TOP) ? Qt : Qnil; | |
641 | break; | |
642 | } | |
643 | ||
644 | case Bmemq: | |
645 | { | |
646 | Lisp_Object v1; | |
bf1de43e | 647 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
648 | v1 = POP; |
649 | TOP = Fmemq (TOP, v1); | |
bf1de43e | 650 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
651 | break; |
652 | } | |
653 | ||
654 | case Bcdr: | |
655 | { | |
656 | Lisp_Object v1; | |
657 | v1 = TOP; | |
14c5155a | 658 | TOP = CDR (v1); |
4015b3c0 GM |
659 | break; |
660 | } | |
36f7ba0a | 661 | |
620cc5fa GM |
662 | case Bvarset: |
663 | case Bvarset+1: | |
664 | case Bvarset+2: | |
665 | case Bvarset+3: | |
666 | case Bvarset+4: | |
667 | case Bvarset+5: | |
668 | op -= Bvarset; | |
36f7ba0a JB |
669 | goto varset; |
670 | ||
620cc5fa GM |
671 | case Bvarset+7: |
672 | op = FETCH2; | |
4015b3c0 GM |
673 | goto varset; |
674 | ||
675 | case Bvarset+6: | |
676 | op = FETCH; | |
36f7ba0a | 677 | varset: |
620cc5fa GM |
678 | { |
679 | Lisp_Object sym, val; | |
8e11578b | 680 | |
620cc5fa | 681 | sym = vectorp[op]; |
bf1de43e | 682 | val = TOP; |
620cc5fa GM |
683 | |
684 | /* Inline the most common case. */ | |
685 | if (SYMBOLP (sym) | |
686 | && !EQ (val, Qunbound) | |
ce5b453a SM |
687 | && !XSYMBOL (sym)->redirect |
688 | && !SYMBOL_CONSTANT_P (sym)) | |
689 | XSYMBOL (sym)->val.value = val; | |
620cc5fa | 690 | else |
bf1de43e GM |
691 | { |
692 | BEFORE_POTENTIAL_GC (); | |
94b612ad | 693 | set_internal (sym, val, Qnil, 0); |
bf1de43e GM |
694 | AFTER_POTENTIAL_GC (); |
695 | } | |
620cc5fa | 696 | } |
3789dcdf | 697 | (void) POP; |
36f7ba0a JB |
698 | break; |
699 | ||
4015b3c0 GM |
700 | case Bdup: |
701 | { | |
702 | Lisp_Object v1; | |
703 | v1 = TOP; | |
704 | PUSH (v1); | |
705 | break; | |
706 | } | |
707 | ||
708 | /* ------------------ */ | |
709 | ||
36f7ba0a JB |
710 | case Bvarbind+6: |
711 | op = FETCH; | |
712 | goto varbind; | |
713 | ||
714 | case Bvarbind+7: | |
715 | op = FETCH2; | |
716 | goto varbind; | |
717 | ||
fa9aabf6 GM |
718 | case Bvarbind: |
719 | case Bvarbind+1: | |
720 | case Bvarbind+2: | |
721 | case Bvarbind+3: | |
722 | case Bvarbind+4: | |
723 | case Bvarbind+5: | |
36f7ba0a JB |
724 | op -= Bvarbind; |
725 | varbind: | |
56b8eef5 GM |
726 | /* Specbind can signal and thus GC. */ |
727 | BEFORE_POTENTIAL_GC (); | |
36f7ba0a | 728 | specbind (vectorp[op], POP); |
56b8eef5 | 729 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
730 | break; |
731 | ||
732 | case Bcall+6: | |
733 | op = FETCH; | |
734 | goto docall; | |
735 | ||
736 | case Bcall+7: | |
737 | op = FETCH2; | |
738 | goto docall; | |
739 | ||
fa9aabf6 GM |
740 | case Bcall: |
741 | case Bcall+1: | |
742 | case Bcall+2: | |
743 | case Bcall+3: | |
744 | case Bcall+4: | |
745 | case Bcall+5: | |
36f7ba0a JB |
746 | op -= Bcall; |
747 | docall: | |
4015b3c0 | 748 | { |
fa9aabf6 | 749 | BEFORE_POTENTIAL_GC (); |
4015b3c0 | 750 | DISCARD (op); |
63639d44 | 751 | #ifdef BYTE_CODE_METER |
4015b3c0 GM |
752 | if (byte_metering_on && SYMBOLP (TOP)) |
753 | { | |
754 | Lisp_Object v1, v2; | |
755 | ||
756 | v1 = TOP; | |
757 | v2 = Fget (v1, Qbyte_code_meter); | |
758 | if (INTEGERP (v2) | |
f28e6371 | 759 | && XINT (v2) < MOST_POSITIVE_FIXNUM) |
4015b3c0 GM |
760 | { |
761 | XSETINT (v2, XINT (v2) + 1); | |
762 | Fput (v1, Qbyte_code_meter, v2); | |
763 | } | |
764 | } | |
63639d44 | 765 | #endif |
4015b3c0 GM |
766 | TOP = Ffuncall (op + 1, &TOP); |
767 | AFTER_POTENTIAL_GC (); | |
768 | break; | |
769 | } | |
36f7ba0a JB |
770 | |
771 | case Bunbind+6: | |
772 | op = FETCH; | |
773 | goto dounbind; | |
774 | ||
775 | case Bunbind+7: | |
776 | op = FETCH2; | |
777 | goto dounbind; | |
778 | ||
fa9aabf6 GM |
779 | case Bunbind: |
780 | case Bunbind+1: | |
781 | case Bunbind+2: | |
782 | case Bunbind+3: | |
783 | case Bunbind+4: | |
784 | case Bunbind+5: | |
36f7ba0a JB |
785 | op -= Bunbind; |
786 | dounbind: | |
7ca1e8b7 | 787 | BEFORE_POTENTIAL_GC (); |
aed13378 | 788 | unbind_to (SPECPDL_INDEX () - op, Qnil); |
7ca1e8b7 | 789 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
790 | break; |
791 | ||
e0f57e65 | 792 | case Bunbind_all: /* Obsolete. */ |
36f7ba0a | 793 | /* To unbind back to the beginning of this frame. Not used yet, |
63639d44 | 794 | but will be needed for tail-recursion elimination. */ |
7ca1e8b7 | 795 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 796 | unbind_to (count, Qnil); |
7ca1e8b7 | 797 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
798 | break; |
799 | ||
800 | case Bgoto: | |
14726871 | 801 | MAYBE_GC (); |
e12ea64e | 802 | BYTE_CODE_QUIT; |
36f7ba0a | 803 | op = FETCH2; /* pc = FETCH2 loses since FETCH2 contains pc++ */ |
3d5fc37b | 804 | CHECK_RANGE (op); |
7ca1e8b7 | 805 | stack.pc = stack.byte_string_start + op; |
36f7ba0a JB |
806 | break; |
807 | ||
36f7ba0a | 808 | case Bgotoifnonnil: |
21ed6de3 KR |
809 | { |
810 | Lisp_Object v1; | |
811 | MAYBE_GC (); | |
812 | op = FETCH2; | |
813 | v1 = POP; | |
814 | if (!NILP (v1)) | |
815 | { | |
816 | BYTE_CODE_QUIT; | |
817 | CHECK_RANGE (op); | |
818 | stack.pc = stack.byte_string_start + op; | |
819 | } | |
820 | break; | |
821 | } | |
36f7ba0a JB |
822 | |
823 | case Bgotoifnilelsepop: | |
14726871 | 824 | MAYBE_GC (); |
36f7ba0a | 825 | op = FETCH2; |
921a8935 | 826 | if (NILP (TOP)) |
36f7ba0a | 827 | { |
e12ea64e | 828 | BYTE_CODE_QUIT; |
3d5fc37b | 829 | CHECK_RANGE (op); |
7ca1e8b7 | 830 | stack.pc = stack.byte_string_start + op; |
36f7ba0a | 831 | } |
63639d44 | 832 | else DISCARD (1); |
36f7ba0a JB |
833 | break; |
834 | ||
835 | case Bgotoifnonnilelsepop: | |
14726871 | 836 | MAYBE_GC (); |
36f7ba0a | 837 | op = FETCH2; |
921a8935 | 838 | if (!NILP (TOP)) |
36f7ba0a | 839 | { |
e12ea64e | 840 | BYTE_CODE_QUIT; |
3d5fc37b | 841 | CHECK_RANGE (op); |
7ca1e8b7 | 842 | stack.pc = stack.byte_string_start + op; |
36f7ba0a | 843 | } |
63639d44 JB |
844 | else DISCARD (1); |
845 | break; | |
846 | ||
847 | case BRgoto: | |
14726871 | 848 | MAYBE_GC (); |
e12ea64e | 849 | BYTE_CODE_QUIT; |
7ca1e8b7 | 850 | stack.pc += (int) *stack.pc - 127; |
63639d44 JB |
851 | break; |
852 | ||
853 | case BRgotoifnil: | |
21ed6de3 KR |
854 | { |
855 | Lisp_Object v1; | |
856 | MAYBE_GC (); | |
857 | v1 = POP; | |
858 | if (NILP (v1)) | |
859 | { | |
860 | BYTE_CODE_QUIT; | |
861 | stack.pc += (int) *stack.pc - 128; | |
862 | } | |
863 | stack.pc++; | |
864 | break; | |
865 | } | |
63639d44 JB |
866 | |
867 | case BRgotoifnonnil: | |
21ed6de3 KR |
868 | { |
869 | Lisp_Object v1; | |
870 | MAYBE_GC (); | |
871 | v1 = POP; | |
872 | if (!NILP (v1)) | |
873 | { | |
874 | BYTE_CODE_QUIT; | |
875 | stack.pc += (int) *stack.pc - 128; | |
876 | } | |
877 | stack.pc++; | |
878 | break; | |
879 | } | |
63639d44 JB |
880 | |
881 | case BRgotoifnilelsepop: | |
14726871 | 882 | MAYBE_GC (); |
7ca1e8b7 | 883 | op = *stack.pc++; |
63639d44 JB |
884 | if (NILP (TOP)) |
885 | { | |
e12ea64e | 886 | BYTE_CODE_QUIT; |
7ca1e8b7 | 887 | stack.pc += op - 128; |
63639d44 JB |
888 | } |
889 | else DISCARD (1); | |
890 | break; | |
891 | ||
892 | case BRgotoifnonnilelsepop: | |
14726871 | 893 | MAYBE_GC (); |
7ca1e8b7 | 894 | op = *stack.pc++; |
63639d44 JB |
895 | if (!NILP (TOP)) |
896 | { | |
e12ea64e | 897 | BYTE_CODE_QUIT; |
7ca1e8b7 | 898 | stack.pc += op - 128; |
63639d44 JB |
899 | } |
900 | else DISCARD (1); | |
98bf0c8d JB |
901 | break; |
902 | ||
36f7ba0a | 903 | case Breturn: |
4015b3c0 | 904 | result = POP; |
36f7ba0a JB |
905 | goto exit; |
906 | ||
907 | case Bdiscard: | |
63639d44 | 908 | DISCARD (1); |
36f7ba0a JB |
909 | break; |
910 | ||
36f7ba0a JB |
911 | case Bconstant2: |
912 | PUSH (vectorp[FETCH2]); | |
913 | break; | |
914 | ||
915 | case Bsave_excursion: | |
fa9aabf6 GM |
916 | record_unwind_protect (save_excursion_restore, |
917 | save_excursion_save ()); | |
36f7ba0a JB |
918 | break; |
919 | ||
e0f57e65 | 920 | case Bsave_current_buffer: /* Obsolete. */ |
80402f25 | 921 | case Bsave_current_buffer_1: |
de404585 | 922 | record_unwind_protect (set_buffer_if_live, Fcurrent_buffer ()); |
3b841abc RS |
923 | break; |
924 | ||
e0f57e65 SM |
925 | case Bsave_window_excursion: /* Obsolete. */ |
926 | { | |
e0f57e65 | 927 | register int count = SPECPDL_INDEX (); |
e0f57e65 SM |
928 | record_unwind_protect (Fset_window_configuration, |
929 | Fcurrent_window_configuration (Qnil)); | |
930 | BEFORE_POTENTIAL_GC (); | |
931 | TOP = Fprogn (TOP); | |
932 | unbind_to (count, TOP); | |
933 | AFTER_POTENTIAL_GC (); | |
934 | break; | |
935 | } | |
36f7ba0a JB |
936 | |
937 | case Bsave_restriction: | |
fa9aabf6 GM |
938 | record_unwind_protect (save_restriction_restore, |
939 | save_restriction_save ()); | |
36f7ba0a JB |
940 | break; |
941 | ||
942 | case Bcatch: | |
4015b3c0 GM |
943 | { |
944 | Lisp_Object v1; | |
4015b3c0 | 945 | BEFORE_POTENTIAL_GC (); |
bf1de43e | 946 | v1 = POP; |
a0ee6f27 | 947 | TOP = internal_catch (TOP, eval_sub, v1); /* FIXME: lexbind */ |
4015b3c0 GM |
948 | AFTER_POTENTIAL_GC (); |
949 | break; | |
950 | } | |
36f7ba0a JB |
951 | |
952 | case Bunwind_protect: | |
defb1411 | 953 | record_unwind_protect (Fprogn, POP); /* FIXME: lexbind */ |
36f7ba0a JB |
954 | break; |
955 | ||
956 | case Bcondition_case: | |
4015b3c0 | 957 | { |
5c125a13 RS |
958 | Lisp_Object handlers, body; |
959 | handlers = POP; | |
960 | body = POP; | |
4015b3c0 | 961 | BEFORE_POTENTIAL_GC (); |
defb1411 | 962 | TOP = internal_lisp_condition_case (TOP, body, handlers); /* FIXME: lexbind */ |
4015b3c0 GM |
963 | AFTER_POTENTIAL_GC (); |
964 | break; | |
965 | } | |
36f7ba0a | 966 | |
3e21b6a7 | 967 | case Btemp_output_buffer_setup: /* Obsolete. */ |
4015b3c0 | 968 | BEFORE_POTENTIAL_GC (); |
b7826503 | 969 | CHECK_STRING (TOP); |
42a5b22f | 970 | temp_output_buffer_setup (SSDATA (TOP)); |
4015b3c0 | 971 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
972 | TOP = Vstandard_output; |
973 | break; | |
974 | ||
3e21b6a7 | 975 | case Btemp_output_buffer_show: /* Obsolete. */ |
4015b3c0 GM |
976 | { |
977 | Lisp_Object v1; | |
4015b3c0 | 978 | BEFORE_POTENTIAL_GC (); |
bf1de43e | 979 | v1 = POP; |
4015b3c0 GM |
980 | temp_output_buffer_show (TOP); |
981 | TOP = v1; | |
982 | /* pop binding of standard-output */ | |
aed13378 | 983 | unbind_to (SPECPDL_INDEX () - 1, Qnil); |
4015b3c0 GM |
984 | AFTER_POTENTIAL_GC (); |
985 | break; | |
986 | } | |
36f7ba0a JB |
987 | |
988 | case Bnth: | |
4015b3c0 GM |
989 | { |
990 | Lisp_Object v1, v2; | |
bf1de43e | 991 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
992 | v1 = POP; |
993 | v2 = TOP; | |
b7826503 | 994 | CHECK_NUMBER (v2); |
f5941bf8 | 995 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
996 | op = XINT (v2); |
997 | immediate_quit = 1; | |
14c5155a KS |
998 | while (--op >= 0 && CONSP (v1)) |
999 | v1 = XCDR (v1); | |
4015b3c0 | 1000 | immediate_quit = 0; |
14c5155a | 1001 | TOP = CAR (v1); |
4015b3c0 GM |
1002 | break; |
1003 | } | |
36f7ba0a JB |
1004 | |
1005 | case Bsymbolp: | |
617bd3f6 | 1006 | TOP = SYMBOLP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
1007 | break; |
1008 | ||
1009 | case Bconsp: | |
1010 | TOP = CONSP (TOP) ? Qt : Qnil; | |
1011 | break; | |
1012 | ||
1013 | case Bstringp: | |
617bd3f6 | 1014 | TOP = STRINGP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
1015 | break; |
1016 | ||
1017 | case Blistp: | |
921a8935 | 1018 | TOP = CONSP (TOP) || NILP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
1019 | break; |
1020 | ||
36f7ba0a | 1021 | case Bnot: |
921a8935 | 1022 | TOP = NILP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
1023 | break; |
1024 | ||
36f7ba0a | 1025 | case Bcons: |
4015b3c0 GM |
1026 | { |
1027 | Lisp_Object v1; | |
1028 | v1 = POP; | |
1029 | TOP = Fcons (TOP, v1); | |
1030 | break; | |
1031 | } | |
36f7ba0a JB |
1032 | |
1033 | case Blist1: | |
1034 | TOP = Fcons (TOP, Qnil); | |
1035 | break; | |
1036 | ||
1037 | case Blist2: | |
4015b3c0 GM |
1038 | { |
1039 | Lisp_Object v1; | |
1040 | v1 = POP; | |
1041 | TOP = Fcons (TOP, Fcons (v1, Qnil)); | |
1042 | break; | |
1043 | } | |
36f7ba0a JB |
1044 | |
1045 | case Blist3: | |
63639d44 | 1046 | DISCARD (2); |
36f7ba0a JB |
1047 | TOP = Flist (3, &TOP); |
1048 | break; | |
1049 | ||
1050 | case Blist4: | |
63639d44 | 1051 | DISCARD (3); |
36f7ba0a JB |
1052 | TOP = Flist (4, &TOP); |
1053 | break; | |
1054 | ||
63639d44 JB |
1055 | case BlistN: |
1056 | op = FETCH; | |
1057 | DISCARD (op - 1); | |
1058 | TOP = Flist (op, &TOP); | |
1059 | break; | |
1060 | ||
36f7ba0a | 1061 | case Blength: |
bf1de43e | 1062 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1063 | TOP = Flength (TOP); |
bf1de43e | 1064 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1065 | break; |
1066 | ||
1067 | case Baref: | |
4015b3c0 GM |
1068 | { |
1069 | Lisp_Object v1; | |
bf1de43e | 1070 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1071 | v1 = POP; |
1072 | TOP = Faref (TOP, v1); | |
bf1de43e | 1073 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1074 | break; |
1075 | } | |
36f7ba0a JB |
1076 | |
1077 | case Baset: | |
4015b3c0 GM |
1078 | { |
1079 | Lisp_Object v1, v2; | |
bf1de43e | 1080 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1081 | v2 = POP; v1 = POP; |
1082 | TOP = Faset (TOP, v1, v2); | |
bf1de43e | 1083 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1084 | break; |
1085 | } | |
36f7ba0a JB |
1086 | |
1087 | case Bsymbol_value: | |
bf1de43e | 1088 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1089 | TOP = Fsymbol_value (TOP); |
bf1de43e | 1090 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1091 | break; |
1092 | ||
1093 | case Bsymbol_function: | |
bf1de43e | 1094 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1095 | TOP = Fsymbol_function (TOP); |
bf1de43e | 1096 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1097 | break; |
1098 | ||
1099 | case Bset: | |
4015b3c0 GM |
1100 | { |
1101 | Lisp_Object v1; | |
bf1de43e | 1102 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1103 | v1 = POP; |
1104 | TOP = Fset (TOP, v1); | |
bf1de43e | 1105 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1106 | break; |
1107 | } | |
36f7ba0a JB |
1108 | |
1109 | case Bfset: | |
4015b3c0 GM |
1110 | { |
1111 | Lisp_Object v1; | |
bf1de43e | 1112 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1113 | v1 = POP; |
1114 | TOP = Ffset (TOP, v1); | |
bf1de43e | 1115 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1116 | break; |
1117 | } | |
36f7ba0a JB |
1118 | |
1119 | case Bget: | |
4015b3c0 GM |
1120 | { |
1121 | Lisp_Object v1; | |
bf1de43e | 1122 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1123 | v1 = POP; |
1124 | TOP = Fget (TOP, v1); | |
bf1de43e | 1125 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1126 | break; |
1127 | } | |
36f7ba0a JB |
1128 | |
1129 | case Bsubstring: | |
4015b3c0 GM |
1130 | { |
1131 | Lisp_Object v1, v2; | |
fa9aabf6 | 1132 | BEFORE_POTENTIAL_GC (); |
bf1de43e | 1133 | v2 = POP; v1 = POP; |
4015b3c0 | 1134 | TOP = Fsubstring (TOP, v1, v2); |
fa9aabf6 | 1135 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1136 | break; |
1137 | } | |
36f7ba0a JB |
1138 | |
1139 | case Bconcat2: | |
bf1de43e | 1140 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1141 | DISCARD (1); |
36f7ba0a | 1142 | TOP = Fconcat (2, &TOP); |
bf1de43e | 1143 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1144 | break; |
1145 | ||
1146 | case Bconcat3: | |
bf1de43e | 1147 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1148 | DISCARD (2); |
36f7ba0a | 1149 | TOP = Fconcat (3, &TOP); |
bf1de43e | 1150 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1151 | break; |
1152 | ||
1153 | case Bconcat4: | |
bf1de43e | 1154 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1155 | DISCARD (3); |
36f7ba0a | 1156 | TOP = Fconcat (4, &TOP); |
bf1de43e | 1157 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1158 | break; |
1159 | ||
63639d44 JB |
1160 | case BconcatN: |
1161 | op = FETCH; | |
bf1de43e | 1162 | BEFORE_POTENTIAL_GC (); |
63639d44 JB |
1163 | DISCARD (op - 1); |
1164 | TOP = Fconcat (op, &TOP); | |
bf1de43e | 1165 | AFTER_POTENTIAL_GC (); |
63639d44 JB |
1166 | break; |
1167 | ||
36f7ba0a | 1168 | case Bsub1: |
4015b3c0 GM |
1169 | { |
1170 | Lisp_Object v1; | |
1171 | v1 = TOP; | |
1172 | if (INTEGERP (v1)) | |
1173 | { | |
1174 | XSETINT (v1, XINT (v1) - 1); | |
1175 | TOP = v1; | |
1176 | } | |
1177 | else | |
e494eee5 MB |
1178 | { |
1179 | BEFORE_POTENTIAL_GC (); | |
1180 | TOP = Fsub1 (v1); | |
1181 | AFTER_POTENTIAL_GC (); | |
1182 | } | |
4015b3c0 GM |
1183 | break; |
1184 | } | |
36f7ba0a JB |
1185 | |
1186 | case Badd1: | |
4015b3c0 GM |
1187 | { |
1188 | Lisp_Object v1; | |
1189 | v1 = TOP; | |
1190 | if (INTEGERP (v1)) | |
1191 | { | |
1192 | XSETINT (v1, XINT (v1) + 1); | |
1193 | TOP = v1; | |
1194 | } | |
1195 | else | |
bf1de43e GM |
1196 | { |
1197 | BEFORE_POTENTIAL_GC (); | |
1198 | TOP = Fadd1 (v1); | |
1199 | AFTER_POTENTIAL_GC (); | |
1200 | } | |
4015b3c0 GM |
1201 | break; |
1202 | } | |
36f7ba0a JB |
1203 | |
1204 | case Beqlsign: | |
4015b3c0 GM |
1205 | { |
1206 | Lisp_Object v1, v2; | |
f5941bf8 | 1207 | BEFORE_POTENTIAL_GC (); |
bf1de43e | 1208 | v2 = POP; v1 = TOP; |
b7826503 PJ |
1209 | CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v1); |
1210 | CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v2); | |
f5941bf8 | 1211 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1212 | if (FLOATP (v1) || FLOATP (v2)) |
1213 | { | |
1214 | double f1, f2; | |
1215 | ||
1216 | f1 = (FLOATP (v1) ? XFLOAT_DATA (v1) : XINT (v1)); | |
1217 | f2 = (FLOATP (v2) ? XFLOAT_DATA (v2) : XINT (v2)); | |
1218 | TOP = (f1 == f2 ? Qt : Qnil); | |
1219 | } | |
1220 | else | |
4015b3c0 GM |
1221 | TOP = (XINT (v1) == XINT (v2) ? Qt : Qnil); |
1222 | break; | |
1223 | } | |
36f7ba0a JB |
1224 | |
1225 | case Bgtr: | |
4015b3c0 GM |
1226 | { |
1227 | Lisp_Object v1; | |
bf1de43e | 1228 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1229 | v1 = POP; |
1230 | TOP = Fgtr (TOP, v1); | |
bf1de43e | 1231 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1232 | break; |
1233 | } | |
36f7ba0a JB |
1234 | |
1235 | case Blss: | |
4015b3c0 GM |
1236 | { |
1237 | Lisp_Object v1; | |
bf1de43e | 1238 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1239 | v1 = POP; |
1240 | TOP = Flss (TOP, v1); | |
bf1de43e | 1241 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1242 | break; |
1243 | } | |
36f7ba0a JB |
1244 | |
1245 | case Bleq: | |
4015b3c0 GM |
1246 | { |
1247 | Lisp_Object v1; | |
bf1de43e | 1248 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1249 | v1 = POP; |
1250 | TOP = Fleq (TOP, v1); | |
bf1de43e | 1251 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1252 | break; |
1253 | } | |
36f7ba0a JB |
1254 | |
1255 | case Bgeq: | |
4015b3c0 GM |
1256 | { |
1257 | Lisp_Object v1; | |
d9c1f6f9 | 1258 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1259 | v1 = POP; |
1260 | TOP = Fgeq (TOP, v1); | |
d9c1f6f9 | 1261 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1262 | break; |
1263 | } | |
36f7ba0a JB |
1264 | |
1265 | case Bdiff: | |
bf1de43e | 1266 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1267 | DISCARD (1); |
36f7ba0a | 1268 | TOP = Fminus (2, &TOP); |
bf1de43e | 1269 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1270 | break; |
1271 | ||
1272 | case Bnegate: | |
4015b3c0 GM |
1273 | { |
1274 | Lisp_Object v1; | |
1275 | v1 = TOP; | |
1276 | if (INTEGERP (v1)) | |
1277 | { | |
1278 | XSETINT (v1, - XINT (v1)); | |
1279 | TOP = v1; | |
1280 | } | |
1281 | else | |
bf1de43e GM |
1282 | { |
1283 | BEFORE_POTENTIAL_GC (); | |
1284 | TOP = Fminus (1, &TOP); | |
1285 | AFTER_POTENTIAL_GC (); | |
1286 | } | |
4015b3c0 GM |
1287 | break; |
1288 | } | |
36f7ba0a JB |
1289 | |
1290 | case Bplus: | |
bf1de43e | 1291 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1292 | DISCARD (1); |
36f7ba0a | 1293 | TOP = Fplus (2, &TOP); |
bf1de43e | 1294 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1295 | break; |
1296 | ||
1297 | case Bmax: | |
bf1de43e | 1298 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1299 | DISCARD (1); |
36f7ba0a | 1300 | TOP = Fmax (2, &TOP); |
bf1de43e | 1301 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1302 | break; |
1303 | ||
1304 | case Bmin: | |
bf1de43e | 1305 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1306 | DISCARD (1); |
36f7ba0a | 1307 | TOP = Fmin (2, &TOP); |
bf1de43e | 1308 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1309 | break; |
1310 | ||
1311 | case Bmult: | |
bf1de43e | 1312 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1313 | DISCARD (1); |
36f7ba0a | 1314 | TOP = Ftimes (2, &TOP); |
bf1de43e | 1315 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1316 | break; |
1317 | ||
1318 | case Bquo: | |
bf1de43e | 1319 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1320 | DISCARD (1); |
36f7ba0a | 1321 | TOP = Fquo (2, &TOP); |
bf1de43e | 1322 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1323 | break; |
1324 | ||
1325 | case Brem: | |
4015b3c0 GM |
1326 | { |
1327 | Lisp_Object v1; | |
bf1de43e | 1328 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1329 | v1 = POP; |
1330 | TOP = Frem (TOP, v1); | |
bf1de43e | 1331 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1332 | break; |
1333 | } | |
36f7ba0a JB |
1334 | |
1335 | case Bpoint: | |
4015b3c0 GM |
1336 | { |
1337 | Lisp_Object v1; | |
1338 | XSETFASTINT (v1, PT); | |
1339 | PUSH (v1); | |
1340 | break; | |
1341 | } | |
36f7ba0a JB |
1342 | |
1343 | case Bgoto_char: | |
4015b3c0 | 1344 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1345 | TOP = Fgoto_char (TOP); |
4015b3c0 | 1346 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1347 | break; |
1348 | ||
1349 | case Binsert: | |
4015b3c0 | 1350 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1351 | TOP = Finsert (1, &TOP); |
4015b3c0 | 1352 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1353 | break; |
1354 | ||
63639d44 JB |
1355 | case BinsertN: |
1356 | op = FETCH; | |
4015b3c0 | 1357 | BEFORE_POTENTIAL_GC (); |
fa9aabf6 | 1358 | DISCARD (op - 1); |
63639d44 | 1359 | TOP = Finsert (op, &TOP); |
4015b3c0 | 1360 | AFTER_POTENTIAL_GC (); |
63639d44 JB |
1361 | break; |
1362 | ||
36f7ba0a | 1363 | case Bpoint_max: |
4015b3c0 GM |
1364 | { |
1365 | Lisp_Object v1; | |
1366 | XSETFASTINT (v1, ZV); | |
1367 | PUSH (v1); | |
1368 | break; | |
1369 | } | |
36f7ba0a JB |
1370 | |
1371 | case Bpoint_min: | |
4015b3c0 GM |
1372 | { |
1373 | Lisp_Object v1; | |
1374 | XSETFASTINT (v1, BEGV); | |
1375 | PUSH (v1); | |
1376 | break; | |
1377 | } | |
36f7ba0a JB |
1378 | |
1379 | case Bchar_after: | |
bf1de43e | 1380 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1381 | TOP = Fchar_after (TOP); |
bf1de43e | 1382 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1383 | break; |
1384 | ||
1385 | case Bfollowing_char: | |
4015b3c0 GM |
1386 | { |
1387 | Lisp_Object v1; | |
bf1de43e | 1388 | BEFORE_POTENTIAL_GC (); |
4015b3c0 | 1389 | v1 = Ffollowing_char (); |
bf1de43e | 1390 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1391 | PUSH (v1); |
1392 | break; | |
1393 | } | |
36f7ba0a JB |
1394 | |
1395 | case Bpreceding_char: | |
4015b3c0 GM |
1396 | { |
1397 | Lisp_Object v1; | |
bf1de43e | 1398 | BEFORE_POTENTIAL_GC (); |
4015b3c0 | 1399 | v1 = Fprevious_char (); |
bf1de43e | 1400 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1401 | PUSH (v1); |
1402 | break; | |
1403 | } | |
36f7ba0a JB |
1404 | |
1405 | case Bcurrent_column: | |
4015b3c0 GM |
1406 | { |
1407 | Lisp_Object v1; | |
96111f48 | 1408 | BEFORE_POTENTIAL_GC (); |
7831777b | 1409 | XSETFASTINT (v1, current_column ()); |
96111f48 | 1410 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1411 | PUSH (v1); |
1412 | break; | |
1413 | } | |
36f7ba0a JB |
1414 | |
1415 | case Bindent_to: | |
4015b3c0 | 1416 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1417 | TOP = Findent_to (TOP, Qnil); |
4015b3c0 | 1418 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1419 | break; |
1420 | ||
1421 | case Beolp: | |
1422 | PUSH (Feolp ()); | |
1423 | break; | |
1424 | ||
1425 | case Beobp: | |
1426 | PUSH (Feobp ()); | |
1427 | break; | |
1428 | ||
1429 | case Bbolp: | |
1430 | PUSH (Fbolp ()); | |
1431 | break; | |
1432 | ||
1433 | case Bbobp: | |
1434 | PUSH (Fbobp ()); | |
1435 | break; | |
1436 | ||
1437 | case Bcurrent_buffer: | |
1438 | PUSH (Fcurrent_buffer ()); | |
1439 | break; | |
1440 | ||
1441 | case Bset_buffer: | |
4015b3c0 | 1442 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1443 | TOP = Fset_buffer (TOP); |
4015b3c0 | 1444 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1445 | break; |
1446 | ||
e0f57e65 | 1447 | case Binteractive_p: /* Obsolete. */ |
36f7ba0a JB |
1448 | PUSH (Finteractive_p ()); |
1449 | break; | |
1450 | ||
1451 | case Bforward_char: | |
4015b3c0 | 1452 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1453 | TOP = Fforward_char (TOP); |
4015b3c0 | 1454 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1455 | break; |
1456 | ||
1457 | case Bforward_word: | |
4015b3c0 | 1458 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1459 | TOP = Fforward_word (TOP); |
4015b3c0 | 1460 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1461 | break; |
1462 | ||
1463 | case Bskip_chars_forward: | |
4015b3c0 GM |
1464 | { |
1465 | Lisp_Object v1; | |
4015b3c0 | 1466 | BEFORE_POTENTIAL_GC (); |
bf1de43e | 1467 | v1 = POP; |
4015b3c0 GM |
1468 | TOP = Fskip_chars_forward (TOP, v1); |
1469 | AFTER_POTENTIAL_GC (); | |
1470 | break; | |
1471 | } | |
36f7ba0a JB |
1472 | |
1473 | case Bskip_chars_backward: | |
4015b3c0 GM |
1474 | { |
1475 | Lisp_Object v1; | |
4015b3c0 | 1476 | BEFORE_POTENTIAL_GC (); |
bf1de43e | 1477 | v1 = POP; |
4015b3c0 GM |
1478 | TOP = Fskip_chars_backward (TOP, v1); |
1479 | AFTER_POTENTIAL_GC (); | |
1480 | break; | |
1481 | } | |
36f7ba0a JB |
1482 | |
1483 | case Bforward_line: | |
4015b3c0 | 1484 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1485 | TOP = Fforward_line (TOP); |
4015b3c0 | 1486 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1487 | break; |
1488 | ||
1489 | case Bchar_syntax: | |
9281d077 KH |
1490 | { |
1491 | int c; | |
1492 | ||
1493 | BEFORE_POTENTIAL_GC (); | |
1494 | CHECK_CHARACTER (TOP); | |
1495 | AFTER_POTENTIAL_GC (); | |
1496 | c = XFASTINT (TOP); | |
4b4deea2 | 1497 | if (NILP (BVAR (current_buffer, enable_multibyte_characters))) |
9281d077 KH |
1498 | MAKE_CHAR_MULTIBYTE (c); |
1499 | XSETFASTINT (TOP, syntax_code_spec[(int) SYNTAX (c)]); | |
8f924df7 | 1500 | } |
36f7ba0a JB |
1501 | break; |
1502 | ||
1503 | case Bbuffer_substring: | |
4015b3c0 GM |
1504 | { |
1505 | Lisp_Object v1; | |
4015b3c0 | 1506 | BEFORE_POTENTIAL_GC (); |
bf1de43e | 1507 | v1 = POP; |
4015b3c0 GM |
1508 | TOP = Fbuffer_substring (TOP, v1); |
1509 | AFTER_POTENTIAL_GC (); | |
1510 | break; | |
1511 | } | |
36f7ba0a JB |
1512 | |
1513 | case Bdelete_region: | |
4015b3c0 GM |
1514 | { |
1515 | Lisp_Object v1; | |
4015b3c0 | 1516 | BEFORE_POTENTIAL_GC (); |
bf1de43e | 1517 | v1 = POP; |
4015b3c0 GM |
1518 | TOP = Fdelete_region (TOP, v1); |
1519 | AFTER_POTENTIAL_GC (); | |
1520 | break; | |
1521 | } | |
36f7ba0a JB |
1522 | |
1523 | case Bnarrow_to_region: | |
4015b3c0 GM |
1524 | { |
1525 | Lisp_Object v1; | |
4015b3c0 | 1526 | BEFORE_POTENTIAL_GC (); |
bf1de43e | 1527 | v1 = POP; |
4015b3c0 GM |
1528 | TOP = Fnarrow_to_region (TOP, v1); |
1529 | AFTER_POTENTIAL_GC (); | |
1530 | break; | |
1531 | } | |
36f7ba0a JB |
1532 | |
1533 | case Bwiden: | |
4015b3c0 | 1534 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1535 | PUSH (Fwiden ()); |
4015b3c0 | 1536 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1537 | break; |
1538 | ||
63639d44 | 1539 | case Bend_of_line: |
4015b3c0 | 1540 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1541 | TOP = Fend_of_line (TOP); |
4015b3c0 | 1542 | AFTER_POTENTIAL_GC (); |
63639d44 JB |
1543 | break; |
1544 | ||
1545 | case Bset_marker: | |
4015b3c0 GM |
1546 | { |
1547 | Lisp_Object v1, v2; | |
bf1de43e | 1548 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1549 | v1 = POP; |
1550 | v2 = POP; | |
1551 | TOP = Fset_marker (TOP, v2, v1); | |
bf1de43e | 1552 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1553 | break; |
1554 | } | |
63639d44 JB |
1555 | |
1556 | case Bmatch_beginning: | |
bf1de43e | 1557 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1558 | TOP = Fmatch_beginning (TOP); |
bf1de43e | 1559 | AFTER_POTENTIAL_GC (); |
63639d44 JB |
1560 | break; |
1561 | ||
1562 | case Bmatch_end: | |
bf1de43e | 1563 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1564 | TOP = Fmatch_end (TOP); |
bf1de43e | 1565 | AFTER_POTENTIAL_GC (); |
63639d44 JB |
1566 | break; |
1567 | ||
1568 | case Bupcase: | |
bf1de43e | 1569 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1570 | TOP = Fupcase (TOP); |
bf1de43e | 1571 | AFTER_POTENTIAL_GC (); |
63639d44 JB |
1572 | break; |
1573 | ||
1574 | case Bdowncase: | |
bf1de43e | 1575 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1576 | TOP = Fdowncase (TOP); |
bf1de43e | 1577 | AFTER_POTENTIAL_GC (); |
63639d44 JB |
1578 | break; |
1579 | ||
36f7ba0a | 1580 | case Bstringeqlsign: |
4015b3c0 GM |
1581 | { |
1582 | Lisp_Object v1; | |
bf1de43e | 1583 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1584 | v1 = POP; |
1585 | TOP = Fstring_equal (TOP, v1); | |
bf1de43e | 1586 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1587 | break; |
1588 | } | |
36f7ba0a JB |
1589 | |
1590 | case Bstringlss: | |
4015b3c0 GM |
1591 | { |
1592 | Lisp_Object v1; | |
bf1de43e | 1593 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1594 | v1 = POP; |
1595 | TOP = Fstring_lessp (TOP, v1); | |
bf1de43e | 1596 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1597 | break; |
1598 | } | |
36f7ba0a JB |
1599 | |
1600 | case Bequal: | |
4015b3c0 GM |
1601 | { |
1602 | Lisp_Object v1; | |
1603 | v1 = POP; | |
1604 | TOP = Fequal (TOP, v1); | |
1605 | break; | |
1606 | } | |
36f7ba0a JB |
1607 | |
1608 | case Bnthcdr: | |
4015b3c0 GM |
1609 | { |
1610 | Lisp_Object v1; | |
bf1de43e | 1611 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1612 | v1 = POP; |
1613 | TOP = Fnthcdr (TOP, v1); | |
bf1de43e | 1614 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1615 | break; |
1616 | } | |
36f7ba0a JB |
1617 | |
1618 | case Belt: | |
4015b3c0 GM |
1619 | { |
1620 | Lisp_Object v1, v2; | |
1621 | if (CONSP (TOP)) | |
1622 | { | |
1623 | /* Exchange args and then do nth. */ | |
bf1de43e | 1624 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1625 | v2 = POP; |
1626 | v1 = TOP; | |
b7826503 | 1627 | CHECK_NUMBER (v2); |
f5941bf8 | 1628 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1629 | op = XINT (v2); |
1630 | immediate_quit = 1; | |
14c5155a KS |
1631 | while (--op >= 0 && CONSP (v1)) |
1632 | v1 = XCDR (v1); | |
4015b3c0 | 1633 | immediate_quit = 0; |
14c5155a | 1634 | TOP = CAR (v1); |
4015b3c0 GM |
1635 | } |
1636 | else | |
1637 | { | |
bf1de43e | 1638 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1639 | v1 = POP; |
1640 | TOP = Felt (TOP, v1); | |
bf1de43e | 1641 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1642 | } |
1643 | break; | |
1644 | } | |
36f7ba0a JB |
1645 | |
1646 | case Bmember: | |
4015b3c0 GM |
1647 | { |
1648 | Lisp_Object v1; | |
bf1de43e | 1649 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1650 | v1 = POP; |
1651 | TOP = Fmember (TOP, v1); | |
bf1de43e | 1652 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1653 | break; |
1654 | } | |
36f7ba0a JB |
1655 | |
1656 | case Bassq: | |
4015b3c0 GM |
1657 | { |
1658 | Lisp_Object v1; | |
bf1de43e | 1659 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1660 | v1 = POP; |
1661 | TOP = Fassq (TOP, v1); | |
bf1de43e | 1662 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1663 | break; |
1664 | } | |
36f7ba0a JB |
1665 | |
1666 | case Bnreverse: | |
bf1de43e | 1667 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1668 | TOP = Fnreverse (TOP); |
bf1de43e | 1669 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1670 | break; |
1671 | ||
1672 | case Bsetcar: | |
4015b3c0 GM |
1673 | { |
1674 | Lisp_Object v1; | |
bf1de43e | 1675 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1676 | v1 = POP; |
1677 | TOP = Fsetcar (TOP, v1); | |
bf1de43e | 1678 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1679 | break; |
1680 | } | |
36f7ba0a JB |
1681 | |
1682 | case Bsetcdr: | |
4015b3c0 GM |
1683 | { |
1684 | Lisp_Object v1; | |
bf1de43e | 1685 | BEFORE_POTENTIAL_GC (); |
4015b3c0 GM |
1686 | v1 = POP; |
1687 | TOP = Fsetcdr (TOP, v1); | |
bf1de43e | 1688 | AFTER_POTENTIAL_GC (); |
4015b3c0 GM |
1689 | break; |
1690 | } | |
36f7ba0a JB |
1691 | |
1692 | case Bcar_safe: | |
4015b3c0 GM |
1693 | { |
1694 | Lisp_Object v1; | |
1695 | v1 = TOP; | |
14c5155a | 1696 | TOP = CAR_SAFE (v1); |
4015b3c0 GM |
1697 | break; |
1698 | } | |
36f7ba0a JB |
1699 | |
1700 | case Bcdr_safe: | |
4015b3c0 GM |
1701 | { |
1702 | Lisp_Object v1; | |
1703 | v1 = TOP; | |
14c5155a | 1704 | TOP = CDR_SAFE (v1); |
4015b3c0 GM |
1705 | break; |
1706 | } | |
36f7ba0a JB |
1707 | |
1708 | case Bnconc: | |
bf1de43e | 1709 | BEFORE_POTENTIAL_GC (); |
63639d44 | 1710 | DISCARD (1); |
36f7ba0a | 1711 | TOP = Fnconc (2, &TOP); |
bf1de43e | 1712 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1713 | break; |
1714 | ||
1715 | case Bnumberp: | |
63639d44 | 1716 | TOP = (NUMBERP (TOP) ? Qt : Qnil); |
36f7ba0a JB |
1717 | break; |
1718 | ||
1719 | case Bintegerp: | |
617bd3f6 | 1720 | TOP = INTEGERP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
1721 | break; |
1722 | ||
1723 | #ifdef BYTE_CODE_SAFE | |
1724 | case Bset_mark: | |
f5941bf8 | 1725 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1726 | error ("set-mark is an obsolete bytecode"); |
f5941bf8 | 1727 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
1728 | break; |
1729 | case Bscan_buffer: | |
f5941bf8 | 1730 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 1731 | error ("scan-buffer is an obsolete bytecode"); |
f5941bf8 | 1732 | AFTER_POTENTIAL_GC (); |
36f7ba0a | 1733 | break; |
36f7ba0a JB |
1734 | #endif |
1735 | ||
876c194c SM |
1736 | case 0: |
1737 | /* Actually this is Bstack_ref with offset 0, but we use Bdup | |
1738 | for that instead. */ | |
1739 | /* case Bstack_ref: */ | |
1740 | abort (); | |
1741 | ||
b9598260 | 1742 | /* Handy byte-codes for lexical binding. */ |
b9598260 SM |
1743 | case Bstack_ref+1: |
1744 | case Bstack_ref+2: | |
1745 | case Bstack_ref+3: | |
1746 | case Bstack_ref+4: | |
1747 | case Bstack_ref+5: | |
3e21b6a7 SM |
1748 | { |
1749 | Lisp_Object *ptr = top - (op - Bstack_ref); | |
1750 | PUSH (*ptr); | |
1751 | break; | |
1752 | } | |
b9598260 | 1753 | case Bstack_ref+6: |
3e21b6a7 SM |
1754 | { |
1755 | Lisp_Object *ptr = top - (FETCH); | |
1756 | PUSH (*ptr); | |
1757 | break; | |
1758 | } | |
b9598260 | 1759 | case Bstack_ref+7: |
3e21b6a7 SM |
1760 | { |
1761 | Lisp_Object *ptr = top - (FETCH2); | |
1762 | PUSH (*ptr); | |
1763 | break; | |
1764 | } | |
1765 | /* stack-set-0 = discard; stack-set-1 = discard-1-preserve-tos. */ | |
b9598260 | 1766 | case Bstack_set: |
3e21b6a7 SM |
1767 | { |
1768 | Lisp_Object *ptr = top - (FETCH); | |
1769 | *ptr = POP; | |
1770 | break; | |
1771 | } | |
b9598260 | 1772 | case Bstack_set2: |
3e21b6a7 SM |
1773 | { |
1774 | Lisp_Object *ptr = top - (FETCH2); | |
1775 | *ptr = POP; | |
1776 | break; | |
1777 | } | |
b9598260 SM |
1778 | case BdiscardN: |
1779 | op = FETCH; | |
1780 | if (op & 0x80) | |
1781 | { | |
1782 | op &= 0x7F; | |
1783 | top[-op] = TOP; | |
1784 | } | |
1785 | DISCARD (op); | |
1786 | break; | |
c96d71f7 RS |
1787 | |
1788 | case 255: | |
36f7ba0a JB |
1789 | default: |
1790 | #ifdef BYTE_CODE_SAFE | |
1791 | if (op < Bconstant) | |
f5941bf8 | 1792 | { |
cc94f3b2 | 1793 | abort (); |
f5941bf8 | 1794 | } |
36f7ba0a | 1795 | if ((op -= Bconstant) >= const_length) |
f5941bf8 | 1796 | { |
cc94f3b2 | 1797 | abort (); |
f5941bf8 | 1798 | } |
36f7ba0a JB |
1799 | PUSH (vectorp[op]); |
1800 | #else | |
1801 | PUSH (vectorp[op - Bconstant]); | |
1802 | #endif | |
1803 | } | |
1804 | } | |
1805 | ||
1806 | exit: | |
7ca1e8b7 GM |
1807 | |
1808 | byte_stack_list = byte_stack_list->next; | |
1809 | ||
36f7ba0a | 1810 | /* Binds and unbinds are supposed to be compiled balanced. */ |
aed13378 | 1811 | if (SPECPDL_INDEX () != count) |
36f7ba0a JB |
1812 | #ifdef BYTE_CODE_SAFE |
1813 | error ("binding stack not balanced (serious byte compiler bug)"); | |
1814 | #else | |
1815 | abort (); | |
1816 | #endif | |
8e11578b | 1817 | |
4015b3c0 | 1818 | return result; |
36f7ba0a JB |
1819 | } |
1820 | ||
dfcf069d | 1821 | void |
971de7fb | 1822 | syms_of_bytecode (void) |
36f7ba0a | 1823 | { |
d67b4f80 | 1824 | Qbytecode = intern_c_string ("byte-code"); |
36f7ba0a JB |
1825 | staticpro (&Qbytecode); |
1826 | ||
1827 | defsubr (&Sbyte_code); | |
1828 | ||
1829 | #ifdef BYTE_CODE_METER | |
1830 | ||
29208e82 | 1831 | DEFVAR_LISP ("byte-code-meter", Vbyte_code_meter, |
39f624fa PJ |
1832 | doc: /* A vector of vectors which holds a histogram of byte-code usage. |
1833 | \(aref (aref byte-code-meter 0) CODE) indicates how many times the byte | |
1834 | opcode CODE has been executed. | |
1835 | \(aref (aref byte-code-meter CODE1) CODE2), where CODE1 is not 0, | |
1836 | indicates how many times the byte opcodes CODE1 and CODE2 have been | |
1837 | executed in succession. */); | |
8e11578b | 1838 | |
29208e82 | 1839 | DEFVAR_BOOL ("byte-metering-on", byte_metering_on, |
39f624fa PJ |
1840 | doc: /* If non-nil, keep profiling information on byte code usage. |
1841 | The variable byte-code-meter indicates how often each byte opcode is used. | |
1842 | If a symbol has a property named `byte-code-meter' whose value is an | |
1843 | integer, it is incremented each time that symbol's function is called. */); | |
36f7ba0a JB |
1844 | |
1845 | byte_metering_on = 0; | |
63639d44 | 1846 | Vbyte_code_meter = Fmake_vector (make_number (256), make_number (0)); |
d67b4f80 | 1847 | Qbyte_code_meter = intern_c_string ("byte-code-meter"); |
63639d44 | 1848 | staticpro (&Qbyte_code_meter); |
36f7ba0a JB |
1849 | { |
1850 | int i = 256; | |
1851 | while (i--) | |
63639d44 JB |
1852 | XVECTOR (Vbyte_code_meter)->contents[i] = |
1853 | Fmake_vector (make_number (256), make_number (0)); | |
36f7ba0a JB |
1854 | } |
1855 | #endif | |
1856 | } |