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