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 GM |
227 | |
228 | /* Structure describing a value stack used during byte-code execution | |
229 | in Fbyte_code. */ | |
230 | ||
231 | struct byte_stack | |
232 | { | |
233 | /* Program counter. This points into the byte_string below | |
234 | and is relocated when that string is relocated. */ | |
235 | unsigned char *pc; | |
236 | ||
237 | /* Top and bottom of stack. The bottom points to an area of memory | |
238 | allocated with alloca in Fbyte_code. */ | |
239 | Lisp_Object *top, *bottom; | |
240 | ||
241 | /* The string containing the byte-code, and its current address. | |
242 | Storing this here protects it from GC because mark_byte_stack | |
243 | marks it. */ | |
244 | Lisp_Object byte_string; | |
245 | unsigned char *byte_string_start; | |
246 | ||
247 | /* The vector of constants used during byte-code execution. Storing | |
248 | this here protects it from GC because mark_byte_stack marks it. */ | |
249 | Lisp_Object constants; | |
250 | ||
251 | /* Next entry in byte_stack_list. */ | |
252 | struct byte_stack *next; | |
253 | }; | |
254 | ||
255 | /* A list of currently active byte-code execution value stacks. | |
256 | Fbyte_code adds an entry to the head of this list before it starts | |
257 | processing byte-code, and it removed the entry again when it is | |
258 | done. Signalling an error truncates the list analoguous to | |
259 | gcprolist. */ | |
260 | ||
261 | struct byte_stack *byte_stack_list; | |
262 | ||
263 | /* Mark objects on byte_stack_list. Called during GC. */ | |
264 | ||
265 | void | |
266 | mark_byte_stack () | |
267 | { | |
268 | struct byte_stack *stack; | |
269 | Lisp_Object *obj; | |
270 | ||
271 | for (stack = byte_stack_list; stack; stack = stack->next) | |
272 | { | |
273 | if (!stack->top) | |
274 | abort (); | |
275 | ||
276 | for (obj = stack->bottom; obj <= stack->top; ++obj) | |
277 | mark_object (obj); | |
278 | ||
279 | mark_object (&stack->byte_string); | |
280 | mark_object (&stack->constants); | |
281 | } | |
282 | } | |
283 | ||
284 | ||
285 | /* Relocate program counters in the stacks on byte_stack_list. Called | |
286 | when GC has completed. */ | |
287 | ||
288 | void | |
289 | relocate_byte_pcs () | |
290 | { | |
291 | struct byte_stack *stack; | |
292 | ||
293 | for (stack = byte_stack_list; stack; stack = stack->next) | |
294 | if (stack->byte_string_start != XSTRING (stack->byte_string)->data) | |
295 | { | |
296 | int offset = stack->pc - stack->byte_string_start; | |
297 | stack->byte_string_start = XSTRING (stack->byte_string)->data; | |
298 | stack->pc = stack->byte_string_start + offset; | |
299 | } | |
300 | } | |
301 | ||
302 | ||
36f7ba0a JB |
303 | \f |
304 | /* Fetch the next byte from the bytecode stream */ | |
305 | ||
7ca1e8b7 | 306 | #define FETCH *stack.pc++ |
36f7ba0a JB |
307 | |
308 | /* Fetch two bytes from the bytecode stream | |
309 | and make a 16-bit number out of them */ | |
310 | ||
311 | #define FETCH2 (op = FETCH, op + (FETCH << 8)) | |
312 | ||
313 | /* Push x onto the execution stack. */ | |
314 | ||
7ca1e8b7 GM |
315 | /* This used to be #define PUSH(x) (*++stackp = (x)) This oddity is |
316 | necessary because Alliant can't be bothered to compile the | |
317 | preincrement operator properly, as of 4/91. -JimB */ | |
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 | |
7ca1e8b7 GM |
334 | /* Actions that must performed before and after calling a function |
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 | ||
3d5fc37b RS |
356 | #define CHECK_RANGE(ARG) \ |
357 | if (ARG >= bytestr_length) abort () | |
358 | ||
7ca1e8b7 GM |
359 | #else |
360 | ||
361 | #define CHECK_RANGE(ARG) | |
362 | ||
363 | #endif | |
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 GM |
380 | int op; |
381 | Lisp_Object v1, v2; | |
382 | Lisp_Object *stackp; | |
383 | Lisp_Object *vectorp = XVECTOR (vector)->contents; | |
36f7ba0a | 384 | #ifdef BYTE_CODE_SAFE |
7ca1e8b7 GM |
385 | int const_length = XVECTOR (vector)->size; |
386 | Lisp_Object *stacke; | |
36f7ba0a | 387 | #endif |
fc932ac6 | 388 | int bytestr_length = STRING_BYTES (XSTRING (bytestr)); |
7ca1e8b7 GM |
389 | struct byte_stack stack; |
390 | Lisp_Object *top; | |
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); | |
426 | switch (op) | |
427 | #else | |
428 | switch (op = FETCH) | |
429 | #endif | |
430 | { | |
431 | case Bvarref+6: | |
432 | op = FETCH; | |
433 | goto varref; | |
434 | ||
435 | case Bvarref+7: | |
436 | op = FETCH2; | |
437 | goto varref; | |
438 | ||
439 | case Bvarref: case Bvarref+1: case Bvarref+2: case Bvarref+3: | |
440 | case Bvarref+4: case Bvarref+5: | |
441 | op = op - Bvarref; | |
442 | varref: | |
443 | v1 = vectorp[op]; | |
617bd3f6 | 444 | if (!SYMBOLP (v1)) |
36f7ba0a JB |
445 | v2 = Fsymbol_value (v1); |
446 | else | |
447 | { | |
448 | v2 = XSYMBOL (v1)->value; | |
677ad7fe KH |
449 | if (MISCP (v2) || EQ (v2, Qunbound)) |
450 | v2 = Fsymbol_value (v1); | |
36f7ba0a JB |
451 | } |
452 | PUSH (v2); | |
453 | break; | |
454 | ||
455 | case Bvarset+6: | |
456 | op = FETCH; | |
457 | goto varset; | |
458 | ||
459 | case Bvarset+7: | |
460 | op = FETCH2; | |
461 | goto varset; | |
462 | ||
463 | case Bvarset: case Bvarset+1: case Bvarset+2: case Bvarset+3: | |
464 | case Bvarset+4: case Bvarset+5: | |
465 | op -= Bvarset; | |
466 | varset: | |
467 | Fset (vectorp[op], POP); | |
468 | break; | |
469 | ||
470 | case Bvarbind+6: | |
471 | op = FETCH; | |
472 | goto varbind; | |
473 | ||
474 | case Bvarbind+7: | |
475 | op = FETCH2; | |
476 | goto varbind; | |
477 | ||
478 | case Bvarbind: case Bvarbind+1: case Bvarbind+2: case Bvarbind+3: | |
479 | case Bvarbind+4: case Bvarbind+5: | |
480 | op -= Bvarbind; | |
481 | varbind: | |
482 | specbind (vectorp[op], POP); | |
483 | break; | |
484 | ||
485 | case Bcall+6: | |
486 | op = FETCH; | |
487 | goto docall; | |
488 | ||
489 | case Bcall+7: | |
490 | op = FETCH2; | |
491 | goto docall; | |
492 | ||
493 | case Bcall: case Bcall+1: case Bcall+2: case Bcall+3: | |
494 | case Bcall+4: case Bcall+5: | |
495 | op -= Bcall; | |
496 | docall: | |
63639d44 JB |
497 | DISCARD (op); |
498 | #ifdef BYTE_CODE_METER | |
617bd3f6 | 499 | if (byte_metering_on && SYMBOLP (TOP)) |
63639d44 JB |
500 | { |
501 | v1 = TOP; | |
502 | v2 = Fget (v1, Qbyte_code_meter); | |
617bd3f6 | 503 | if (INTEGERP (v2) |
63639d44 JB |
504 | && XINT (v2) != ((1<<VALBITS)-1)) |
505 | { | |
506 | XSETINT (v2, XINT (v2) + 1); | |
507 | Fput (v1, Qbyte_code_meter, v2); | |
508 | } | |
509 | } | |
510 | #endif | |
7ca1e8b7 | 511 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 512 | TOP = Ffuncall (op + 1, &TOP); |
7ca1e8b7 | 513 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
514 | break; |
515 | ||
516 | case Bunbind+6: | |
517 | op = FETCH; | |
518 | goto dounbind; | |
519 | ||
520 | case Bunbind+7: | |
521 | op = FETCH2; | |
522 | goto dounbind; | |
523 | ||
524 | case Bunbind: case Bunbind+1: case Bunbind+2: case Bunbind+3: | |
525 | case Bunbind+4: case Bunbind+5: | |
526 | op -= Bunbind; | |
527 | dounbind: | |
7ca1e8b7 | 528 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 529 | unbind_to (specpdl_ptr - specpdl - op, Qnil); |
7ca1e8b7 | 530 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
531 | break; |
532 | ||
533 | case Bunbind_all: | |
534 | /* To unbind back to the beginning of this frame. Not used yet, | |
63639d44 | 535 | but will be needed for tail-recursion elimination. */ |
7ca1e8b7 | 536 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 537 | unbind_to (count, Qnil); |
7ca1e8b7 | 538 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
539 | break; |
540 | ||
541 | case Bgoto: | |
14726871 | 542 | MAYBE_GC (); |
36f7ba0a JB |
543 | QUIT; |
544 | op = FETCH2; /* pc = FETCH2 loses since FETCH2 contains pc++ */ | |
3d5fc37b | 545 | CHECK_RANGE (op); |
7ca1e8b7 | 546 | stack.pc = stack.byte_string_start + op; |
36f7ba0a JB |
547 | break; |
548 | ||
549 | case Bgotoifnil: | |
14726871 | 550 | MAYBE_GC (); |
36f7ba0a | 551 | op = FETCH2; |
921a8935 | 552 | if (NILP (POP)) |
36f7ba0a JB |
553 | { |
554 | QUIT; | |
3d5fc37b | 555 | CHECK_RANGE (op); |
7ca1e8b7 | 556 | stack.pc = stack.byte_string_start + op; |
36f7ba0a JB |
557 | } |
558 | break; | |
559 | ||
560 | case Bgotoifnonnil: | |
14726871 | 561 | MAYBE_GC (); |
36f7ba0a | 562 | op = FETCH2; |
921a8935 | 563 | if (!NILP (POP)) |
36f7ba0a JB |
564 | { |
565 | QUIT; | |
3d5fc37b | 566 | CHECK_RANGE (op); |
7ca1e8b7 | 567 | stack.pc = stack.byte_string_start + op; |
36f7ba0a JB |
568 | } |
569 | break; | |
570 | ||
571 | case Bgotoifnilelsepop: | |
14726871 | 572 | MAYBE_GC (); |
36f7ba0a | 573 | op = FETCH2; |
921a8935 | 574 | if (NILP (TOP)) |
36f7ba0a JB |
575 | { |
576 | QUIT; | |
3d5fc37b | 577 | CHECK_RANGE (op); |
7ca1e8b7 | 578 | stack.pc = stack.byte_string_start + op; |
36f7ba0a | 579 | } |
63639d44 | 580 | else DISCARD (1); |
36f7ba0a JB |
581 | break; |
582 | ||
583 | case Bgotoifnonnilelsepop: | |
14726871 | 584 | MAYBE_GC (); |
36f7ba0a | 585 | op = FETCH2; |
921a8935 | 586 | if (!NILP (TOP)) |
36f7ba0a JB |
587 | { |
588 | QUIT; | |
3d5fc37b | 589 | CHECK_RANGE (op); |
7ca1e8b7 | 590 | stack.pc = stack.byte_string_start + op; |
36f7ba0a | 591 | } |
63639d44 JB |
592 | else DISCARD (1); |
593 | break; | |
594 | ||
595 | case BRgoto: | |
14726871 | 596 | MAYBE_GC (); |
63639d44 | 597 | QUIT; |
7ca1e8b7 | 598 | stack.pc += (int) *stack.pc - 127; |
63639d44 JB |
599 | break; |
600 | ||
601 | case BRgotoifnil: | |
14726871 | 602 | MAYBE_GC (); |
63639d44 JB |
603 | if (NILP (POP)) |
604 | { | |
605 | QUIT; | |
7ca1e8b7 | 606 | stack.pc += (int) *stack.pc - 128; |
63639d44 | 607 | } |
7ca1e8b7 | 608 | stack.pc++; |
63639d44 JB |
609 | break; |
610 | ||
611 | case BRgotoifnonnil: | |
14726871 | 612 | MAYBE_GC (); |
63639d44 JB |
613 | if (!NILP (POP)) |
614 | { | |
615 | QUIT; | |
7ca1e8b7 | 616 | stack.pc += (int) *stack.pc - 128; |
63639d44 | 617 | } |
7ca1e8b7 | 618 | stack.pc++; |
63639d44 JB |
619 | break; |
620 | ||
621 | case BRgotoifnilelsepop: | |
14726871 | 622 | MAYBE_GC (); |
7ca1e8b7 | 623 | op = *stack.pc++; |
63639d44 JB |
624 | if (NILP (TOP)) |
625 | { | |
626 | QUIT; | |
7ca1e8b7 | 627 | stack.pc += op - 128; |
63639d44 JB |
628 | } |
629 | else DISCARD (1); | |
630 | break; | |
631 | ||
632 | case BRgotoifnonnilelsepop: | |
14726871 | 633 | MAYBE_GC (); |
7ca1e8b7 | 634 | op = *stack.pc++; |
63639d44 JB |
635 | if (!NILP (TOP)) |
636 | { | |
637 | QUIT; | |
7ca1e8b7 | 638 | stack.pc += op - 128; |
63639d44 JB |
639 | } |
640 | else DISCARD (1); | |
98bf0c8d JB |
641 | break; |
642 | ||
36f7ba0a JB |
643 | case Breturn: |
644 | v1 = POP; | |
645 | goto exit; | |
646 | ||
647 | case Bdiscard: | |
63639d44 | 648 | DISCARD (1); |
36f7ba0a JB |
649 | break; |
650 | ||
651 | case Bdup: | |
652 | v1 = TOP; | |
653 | PUSH (v1); | |
654 | break; | |
655 | ||
656 | case Bconstant2: | |
657 | PUSH (vectorp[FETCH2]); | |
658 | break; | |
659 | ||
660 | case Bsave_excursion: | |
661 | record_unwind_protect (save_excursion_restore, save_excursion_save ()); | |
662 | break; | |
663 | ||
3b841abc | 664 | case Bsave_current_buffer: |
80402f25 | 665 | case Bsave_current_buffer_1: |
de404585 | 666 | record_unwind_protect (set_buffer_if_live, Fcurrent_buffer ()); |
3b841abc RS |
667 | break; |
668 | ||
36f7ba0a JB |
669 | case Bsave_window_excursion: |
670 | TOP = Fsave_window_excursion (TOP); | |
671 | break; | |
672 | ||
673 | case Bsave_restriction: | |
674 | record_unwind_protect (save_restriction_restore, save_restriction_save ()); | |
675 | break; | |
676 | ||
677 | case Bcatch: | |
678 | v1 = POP; | |
679 | TOP = internal_catch (TOP, Feval, v1); | |
680 | break; | |
681 | ||
682 | case Bunwind_protect: | |
683 | record_unwind_protect (0, POP); | |
684 | (specpdl_ptr - 1)->symbol = Qnil; | |
685 | break; | |
686 | ||
687 | case Bcondition_case: | |
688 | v1 = POP; | |
689 | v1 = Fcons (POP, v1); | |
7ca1e8b7 | 690 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 691 | TOP = Fcondition_case (Fcons (TOP, v1)); |
7ca1e8b7 | 692 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
693 | break; |
694 | ||
695 | case Btemp_output_buffer_setup: | |
696 | temp_output_buffer_setup (XSTRING (TOP)->data); | |
697 | TOP = Vstandard_output; | |
698 | break; | |
699 | ||
700 | case Btemp_output_buffer_show: | |
701 | v1 = POP; | |
f054132a | 702 | temp_output_buffer_show (TOP); |
36f7ba0a JB |
703 | TOP = v1; |
704 | /* pop binding of standard-output */ | |
7ca1e8b7 | 705 | BEFORE_POTENTIAL_GC (); |
36f7ba0a | 706 | unbind_to (specpdl_ptr - specpdl - 1, Qnil); |
7ca1e8b7 | 707 | AFTER_POTENTIAL_GC (); |
36f7ba0a JB |
708 | break; |
709 | ||
710 | case Bnth: | |
711 | v1 = POP; | |
712 | v2 = TOP; | |
713 | nth_entry: | |
714 | CHECK_NUMBER (v2, 0); | |
715 | op = XINT (v2); | |
716 | immediate_quit = 1; | |
717 | while (--op >= 0) | |
718 | { | |
719 | if (CONSP (v1)) | |
70949dac | 720 | v1 = XCDR (v1); |
921a8935 | 721 | else if (!NILP (v1)) |
36f7ba0a JB |
722 | { |
723 | immediate_quit = 0; | |
724 | v1 = wrong_type_argument (Qlistp, v1); | |
725 | immediate_quit = 1; | |
726 | op++; | |
727 | } | |
728 | } | |
729 | immediate_quit = 0; | |
730 | goto docar; | |
731 | ||
732 | case Bsymbolp: | |
617bd3f6 | 733 | TOP = SYMBOLP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
734 | break; |
735 | ||
736 | case Bconsp: | |
737 | TOP = CONSP (TOP) ? Qt : Qnil; | |
738 | break; | |
739 | ||
740 | case Bstringp: | |
617bd3f6 | 741 | TOP = STRINGP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
742 | break; |
743 | ||
744 | case Blistp: | |
921a8935 | 745 | TOP = CONSP (TOP) || NILP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
746 | break; |
747 | ||
748 | case Beq: | |
749 | v1 = POP; | |
750 | TOP = EQ (v1, TOP) ? Qt : Qnil; | |
751 | break; | |
752 | ||
753 | case Bmemq: | |
754 | v1 = POP; | |
755 | TOP = Fmemq (TOP, v1); | |
756 | break; | |
757 | ||
758 | case Bnot: | |
921a8935 | 759 | TOP = NILP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
760 | break; |
761 | ||
762 | case Bcar: | |
763 | v1 = TOP; | |
764 | docar: | |
70949dac | 765 | if (CONSP (v1)) TOP = XCAR (v1); |
921a8935 | 766 | else if (NILP (v1)) TOP = Qnil; |
36f7ba0a JB |
767 | else Fcar (wrong_type_argument (Qlistp, v1)); |
768 | break; | |
769 | ||
770 | case Bcdr: | |
771 | v1 = TOP; | |
70949dac | 772 | if (CONSP (v1)) TOP = XCDR (v1); |
921a8935 | 773 | else if (NILP (v1)) TOP = Qnil; |
36f7ba0a JB |
774 | else Fcdr (wrong_type_argument (Qlistp, v1)); |
775 | break; | |
776 | ||
777 | case Bcons: | |
778 | v1 = POP; | |
779 | TOP = Fcons (TOP, v1); | |
780 | break; | |
781 | ||
782 | case Blist1: | |
783 | TOP = Fcons (TOP, Qnil); | |
784 | break; | |
785 | ||
786 | case Blist2: | |
787 | v1 = POP; | |
788 | TOP = Fcons (TOP, Fcons (v1, Qnil)); | |
789 | break; | |
790 | ||
791 | case Blist3: | |
63639d44 | 792 | DISCARD (2); |
36f7ba0a JB |
793 | TOP = Flist (3, &TOP); |
794 | break; | |
795 | ||
796 | case Blist4: | |
63639d44 | 797 | DISCARD (3); |
36f7ba0a JB |
798 | TOP = Flist (4, &TOP); |
799 | break; | |
800 | ||
63639d44 JB |
801 | case BlistN: |
802 | op = FETCH; | |
803 | DISCARD (op - 1); | |
804 | TOP = Flist (op, &TOP); | |
805 | break; | |
806 | ||
36f7ba0a JB |
807 | case Blength: |
808 | TOP = Flength (TOP); | |
809 | break; | |
810 | ||
811 | case Baref: | |
812 | v1 = POP; | |
813 | TOP = Faref (TOP, v1); | |
814 | break; | |
815 | ||
816 | case Baset: | |
817 | v2 = POP; v1 = POP; | |
818 | TOP = Faset (TOP, v1, v2); | |
819 | break; | |
820 | ||
821 | case Bsymbol_value: | |
822 | TOP = Fsymbol_value (TOP); | |
823 | break; | |
824 | ||
825 | case Bsymbol_function: | |
826 | TOP = Fsymbol_function (TOP); | |
827 | break; | |
828 | ||
829 | case Bset: | |
830 | v1 = POP; | |
831 | TOP = Fset (TOP, v1); | |
832 | break; | |
833 | ||
834 | case Bfset: | |
835 | v1 = POP; | |
836 | TOP = Ffset (TOP, v1); | |
837 | break; | |
838 | ||
839 | case Bget: | |
840 | v1 = POP; | |
841 | TOP = Fget (TOP, v1); | |
842 | break; | |
843 | ||
844 | case Bsubstring: | |
845 | v2 = POP; v1 = POP; | |
846 | TOP = Fsubstring (TOP, v1, v2); | |
847 | break; | |
848 | ||
849 | case Bconcat2: | |
63639d44 | 850 | DISCARD (1); |
36f7ba0a JB |
851 | TOP = Fconcat (2, &TOP); |
852 | break; | |
853 | ||
854 | case Bconcat3: | |
63639d44 | 855 | DISCARD (2); |
36f7ba0a JB |
856 | TOP = Fconcat (3, &TOP); |
857 | break; | |
858 | ||
859 | case Bconcat4: | |
63639d44 | 860 | DISCARD (3); |
36f7ba0a JB |
861 | TOP = Fconcat (4, &TOP); |
862 | break; | |
863 | ||
63639d44 JB |
864 | case BconcatN: |
865 | op = FETCH; | |
866 | DISCARD (op - 1); | |
867 | TOP = Fconcat (op, &TOP); | |
868 | break; | |
869 | ||
36f7ba0a JB |
870 | case Bsub1: |
871 | v1 = TOP; | |
617bd3f6 | 872 | if (INTEGERP (v1)) |
36f7ba0a JB |
873 | { |
874 | XSETINT (v1, XINT (v1) - 1); | |
875 | TOP = v1; | |
876 | } | |
877 | else | |
878 | TOP = Fsub1 (v1); | |
879 | break; | |
880 | ||
881 | case Badd1: | |
882 | v1 = TOP; | |
617bd3f6 | 883 | if (INTEGERP (v1)) |
36f7ba0a JB |
884 | { |
885 | XSETINT (v1, XINT (v1) + 1); | |
886 | TOP = v1; | |
887 | } | |
888 | else | |
889 | TOP = Fadd1 (v1); | |
890 | break; | |
891 | ||
892 | case Beqlsign: | |
893 | v2 = POP; v1 = TOP; | |
894 | CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v1, 0); | |
895 | CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v2, 0); | |
056c80f9 | 896 | #ifdef LISP_FLOAT_TYPE |
67c098ad | 897 | if (FLOATP (v1) || FLOATP (v2)) |
056c80f9 KH |
898 | { |
899 | double f1, f2; | |
900 | ||
70949dac KR |
901 | f1 = (FLOATP (v1) ? XFLOAT_DATA (v1) : XINT (v1)); |
902 | f2 = (FLOATP (v2) ? XFLOAT_DATA (v2) : XINT (v2)); | |
056c80f9 KH |
903 | TOP = (f1 == f2 ? Qt : Qnil); |
904 | } | |
905 | else | |
906 | #endif | |
26285784 | 907 | TOP = (XINT (v1) == XINT (v2) ? Qt : Qnil); |
36f7ba0a JB |
908 | break; |
909 | ||
910 | case Bgtr: | |
911 | v1 = POP; | |
912 | TOP = Fgtr (TOP, v1); | |
913 | break; | |
914 | ||
915 | case Blss: | |
916 | v1 = POP; | |
917 | TOP = Flss (TOP, v1); | |
918 | break; | |
919 | ||
920 | case Bleq: | |
921 | v1 = POP; | |
922 | TOP = Fleq (TOP, v1); | |
923 | break; | |
924 | ||
925 | case Bgeq: | |
926 | v1 = POP; | |
927 | TOP = Fgeq (TOP, v1); | |
928 | break; | |
929 | ||
930 | case Bdiff: | |
63639d44 | 931 | DISCARD (1); |
36f7ba0a JB |
932 | TOP = Fminus (2, &TOP); |
933 | break; | |
934 | ||
935 | case Bnegate: | |
936 | v1 = TOP; | |
617bd3f6 | 937 | if (INTEGERP (v1)) |
36f7ba0a JB |
938 | { |
939 | XSETINT (v1, - XINT (v1)); | |
940 | TOP = v1; | |
941 | } | |
942 | else | |
943 | TOP = Fminus (1, &TOP); | |
944 | break; | |
945 | ||
946 | case Bplus: | |
63639d44 | 947 | DISCARD (1); |
36f7ba0a JB |
948 | TOP = Fplus (2, &TOP); |
949 | break; | |
950 | ||
951 | case Bmax: | |
63639d44 | 952 | DISCARD (1); |
36f7ba0a JB |
953 | TOP = Fmax (2, &TOP); |
954 | break; | |
955 | ||
956 | case Bmin: | |
63639d44 | 957 | DISCARD (1); |
36f7ba0a JB |
958 | TOP = Fmin (2, &TOP); |
959 | break; | |
960 | ||
961 | case Bmult: | |
63639d44 | 962 | DISCARD (1); |
36f7ba0a JB |
963 | TOP = Ftimes (2, &TOP); |
964 | break; | |
965 | ||
966 | case Bquo: | |
63639d44 | 967 | DISCARD (1); |
36f7ba0a JB |
968 | TOP = Fquo (2, &TOP); |
969 | break; | |
970 | ||
971 | case Brem: | |
972 | v1 = POP; | |
36f7ba0a JB |
973 | TOP = Frem (TOP, v1); |
974 | break; | |
975 | ||
976 | case Bpoint: | |
6ec8bbd2 | 977 | XSETFASTINT (v1, PT); |
36f7ba0a JB |
978 | PUSH (v1); |
979 | break; | |
980 | ||
981 | case Bgoto_char: | |
982 | TOP = Fgoto_char (TOP); | |
983 | break; | |
984 | ||
985 | case Binsert: | |
986 | TOP = Finsert (1, &TOP); | |
987 | break; | |
988 | ||
63639d44 JB |
989 | case BinsertN: |
990 | op = FETCH; | |
991 | DISCARD (op - 1); | |
992 | TOP = Finsert (op, &TOP); | |
993 | break; | |
994 | ||
36f7ba0a | 995 | case Bpoint_max: |
117360cb | 996 | XSETFASTINT (v1, ZV); |
36f7ba0a JB |
997 | PUSH (v1); |
998 | break; | |
999 | ||
1000 | case Bpoint_min: | |
117360cb | 1001 | XSETFASTINT (v1, BEGV); |
36f7ba0a JB |
1002 | PUSH (v1); |
1003 | break; | |
1004 | ||
1005 | case Bchar_after: | |
1006 | TOP = Fchar_after (TOP); | |
1007 | break; | |
1008 | ||
1009 | case Bfollowing_char: | |
af09cb43 | 1010 | v1 = Ffollowing_char (); |
36f7ba0a JB |
1011 | PUSH (v1); |
1012 | break; | |
1013 | ||
1014 | case Bpreceding_char: | |
af09cb43 | 1015 | v1 = Fprevious_char (); |
36f7ba0a JB |
1016 | PUSH (v1); |
1017 | break; | |
1018 | ||
1019 | case Bcurrent_column: | |
117360cb | 1020 | XSETFASTINT (v1, current_column ()); |
36f7ba0a JB |
1021 | PUSH (v1); |
1022 | break; | |
1023 | ||
1024 | case Bindent_to: | |
1025 | TOP = Findent_to (TOP, Qnil); | |
1026 | break; | |
1027 | ||
1028 | case Beolp: | |
1029 | PUSH (Feolp ()); | |
1030 | break; | |
1031 | ||
1032 | case Beobp: | |
1033 | PUSH (Feobp ()); | |
1034 | break; | |
1035 | ||
1036 | case Bbolp: | |
1037 | PUSH (Fbolp ()); | |
1038 | break; | |
1039 | ||
1040 | case Bbobp: | |
1041 | PUSH (Fbobp ()); | |
1042 | break; | |
1043 | ||
1044 | case Bcurrent_buffer: | |
1045 | PUSH (Fcurrent_buffer ()); | |
1046 | break; | |
1047 | ||
1048 | case Bset_buffer: | |
1049 | TOP = Fset_buffer (TOP); | |
1050 | break; | |
1051 | ||
36f7ba0a JB |
1052 | case Binteractive_p: |
1053 | PUSH (Finteractive_p ()); | |
1054 | break; | |
1055 | ||
1056 | case Bforward_char: | |
36f7ba0a JB |
1057 | TOP = Fforward_char (TOP); |
1058 | break; | |
1059 | ||
1060 | case Bforward_word: | |
36f7ba0a JB |
1061 | TOP = Fforward_word (TOP); |
1062 | break; | |
1063 | ||
1064 | case Bskip_chars_forward: | |
36f7ba0a JB |
1065 | v1 = POP; |
1066 | TOP = Fskip_chars_forward (TOP, v1); | |
1067 | break; | |
1068 | ||
1069 | case Bskip_chars_backward: | |
36f7ba0a JB |
1070 | v1 = POP; |
1071 | TOP = Fskip_chars_backward (TOP, v1); | |
1072 | break; | |
1073 | ||
1074 | case Bforward_line: | |
36f7ba0a JB |
1075 | TOP = Fforward_line (TOP); |
1076 | break; | |
1077 | ||
1078 | case Bchar_syntax: | |
1079 | CHECK_NUMBER (TOP, 0); | |
117360cb | 1080 | XSETFASTINT (TOP, |
af09cb43 | 1081 | syntax_code_spec[(int) SYNTAX (XINT (TOP))]); |
36f7ba0a JB |
1082 | break; |
1083 | ||
1084 | case Bbuffer_substring: | |
1085 | v1 = POP; | |
1086 | TOP = Fbuffer_substring (TOP, v1); | |
1087 | break; | |
1088 | ||
1089 | case Bdelete_region: | |
1090 | v1 = POP; | |
36f7ba0a JB |
1091 | TOP = Fdelete_region (TOP, v1); |
1092 | break; | |
1093 | ||
1094 | case Bnarrow_to_region: | |
1095 | v1 = POP; | |
36f7ba0a JB |
1096 | TOP = Fnarrow_to_region (TOP, v1); |
1097 | break; | |
1098 | ||
1099 | case Bwiden: | |
1100 | PUSH (Fwiden ()); | |
1101 | break; | |
1102 | ||
63639d44 JB |
1103 | case Bend_of_line: |
1104 | TOP = Fend_of_line (TOP); | |
1105 | break; | |
1106 | ||
1107 | case Bset_marker: | |
1108 | v1 = POP; | |
1109 | v2 = POP; | |
1110 | TOP = Fset_marker (TOP, v2, v1); | |
1111 | break; | |
1112 | ||
1113 | case Bmatch_beginning: | |
1114 | TOP = Fmatch_beginning (TOP); | |
1115 | break; | |
1116 | ||
1117 | case Bmatch_end: | |
1118 | TOP = Fmatch_end (TOP); | |
1119 | break; | |
1120 | ||
1121 | case Bupcase: | |
1122 | TOP = Fupcase (TOP); | |
1123 | break; | |
1124 | ||
1125 | case Bdowncase: | |
1126 | TOP = Fdowncase (TOP); | |
1127 | break; | |
1128 | ||
36f7ba0a JB |
1129 | case Bstringeqlsign: |
1130 | v1 = POP; | |
36f7ba0a JB |
1131 | TOP = Fstring_equal (TOP, v1); |
1132 | break; | |
1133 | ||
1134 | case Bstringlss: | |
1135 | v1 = POP; | |
36f7ba0a JB |
1136 | TOP = Fstring_lessp (TOP, v1); |
1137 | break; | |
1138 | ||
1139 | case Bequal: | |
1140 | v1 = POP; | |
36f7ba0a JB |
1141 | TOP = Fequal (TOP, v1); |
1142 | break; | |
1143 | ||
1144 | case Bnthcdr: | |
1145 | v1 = POP; | |
36f7ba0a JB |
1146 | TOP = Fnthcdr (TOP, v1); |
1147 | break; | |
1148 | ||
1149 | case Belt: | |
617bd3f6 | 1150 | if (CONSP (TOP)) |
36f7ba0a JB |
1151 | { |
1152 | /* Exchange args and then do nth. */ | |
1153 | v2 = POP; | |
1154 | v1 = TOP; | |
1155 | goto nth_entry; | |
1156 | } | |
1157 | v1 = POP; | |
1158 | TOP = Felt (TOP, v1); | |
1159 | break; | |
1160 | ||
1161 | case Bmember: | |
1162 | v1 = POP; | |
36f7ba0a JB |
1163 | TOP = Fmember (TOP, v1); |
1164 | break; | |
1165 | ||
1166 | case Bassq: | |
1167 | v1 = POP; | |
36f7ba0a JB |
1168 | TOP = Fassq (TOP, v1); |
1169 | break; | |
1170 | ||
1171 | case Bnreverse: | |
1172 | TOP = Fnreverse (TOP); | |
1173 | break; | |
1174 | ||
1175 | case Bsetcar: | |
1176 | v1 = POP; | |
36f7ba0a JB |
1177 | TOP = Fsetcar (TOP, v1); |
1178 | break; | |
1179 | ||
1180 | case Bsetcdr: | |
1181 | v1 = POP; | |
36f7ba0a JB |
1182 | TOP = Fsetcdr (TOP, v1); |
1183 | break; | |
1184 | ||
1185 | case Bcar_safe: | |
1186 | v1 = TOP; | |
617bd3f6 | 1187 | if (CONSP (v1)) |
70949dac | 1188 | TOP = XCAR (v1); |
36f7ba0a JB |
1189 | else |
1190 | TOP = Qnil; | |
1191 | break; | |
1192 | ||
1193 | case Bcdr_safe: | |
1194 | v1 = TOP; | |
617bd3f6 | 1195 | if (CONSP (v1)) |
70949dac | 1196 | TOP = XCDR (v1); |
36f7ba0a JB |
1197 | else |
1198 | TOP = Qnil; | |
1199 | break; | |
1200 | ||
1201 | case Bnconc: | |
63639d44 | 1202 | DISCARD (1); |
36f7ba0a JB |
1203 | TOP = Fnconc (2, &TOP); |
1204 | break; | |
1205 | ||
1206 | case Bnumberp: | |
63639d44 | 1207 | TOP = (NUMBERP (TOP) ? Qt : Qnil); |
36f7ba0a JB |
1208 | break; |
1209 | ||
1210 | case Bintegerp: | |
617bd3f6 | 1211 | TOP = INTEGERP (TOP) ? Qt : Qnil; |
36f7ba0a JB |
1212 | break; |
1213 | ||
1214 | #ifdef BYTE_CODE_SAFE | |
1215 | case Bset_mark: | |
1216 | error ("set-mark is an obsolete bytecode"); | |
1217 | break; | |
1218 | case Bscan_buffer: | |
1219 | error ("scan-buffer is an obsolete bytecode"); | |
1220 | break; | |
36f7ba0a JB |
1221 | #endif |
1222 | ||
1223 | default: | |
1224 | #ifdef BYTE_CODE_SAFE | |
1225 | if (op < Bconstant) | |
1226 | error ("unknown bytecode %d (byte compiler bug)", op); | |
1227 | if ((op -= Bconstant) >= const_length) | |
1228 | error ("no constant number %d (byte compiler bug)", op); | |
1229 | PUSH (vectorp[op]); | |
1230 | #else | |
1231 | PUSH (vectorp[op - Bconstant]); | |
1232 | #endif | |
1233 | } | |
1234 | } | |
1235 | ||
1236 | exit: | |
7ca1e8b7 GM |
1237 | |
1238 | byte_stack_list = byte_stack_list->next; | |
1239 | ||
36f7ba0a JB |
1240 | /* Binds and unbinds are supposed to be compiled balanced. */ |
1241 | if (specpdl_ptr - specpdl != count) | |
1242 | #ifdef BYTE_CODE_SAFE | |
1243 | error ("binding stack not balanced (serious byte compiler bug)"); | |
1244 | #else | |
1245 | abort (); | |
1246 | #endif | |
7ca1e8b7 | 1247 | |
36f7ba0a JB |
1248 | return v1; |
1249 | } | |
1250 | ||
dfcf069d | 1251 | void |
36f7ba0a JB |
1252 | syms_of_bytecode () |
1253 | { | |
1254 | Qbytecode = intern ("byte-code"); | |
1255 | staticpro (&Qbytecode); | |
1256 | ||
1257 | defsubr (&Sbyte_code); | |
1258 | ||
1259 | #ifdef BYTE_CODE_METER | |
1260 | ||
1261 | DEFVAR_LISP ("byte-code-meter", &Vbyte_code_meter, | |
63639d44 JB |
1262 | "A vector of vectors which holds a histogram of byte-code usage.\n\ |
1263 | (aref (aref byte-code-meter 0) CODE) indicates how many times the byte\n\ | |
1264 | opcode CODE has been executed.\n\ | |
1265 | (aref (aref byte-code-meter CODE1) CODE2), where CODE1 is not 0,\n\ | |
1266 | indicates how many times the byte opcodes CODE1 and CODE2 have been\n\ | |
1267 | executed in succession."); | |
1268 | DEFVAR_BOOL ("byte-metering-on", &byte_metering_on, | |
1269 | "If non-nil, keep profiling information on byte code usage.\n\ | |
1270 | The variable byte-code-meter indicates how often each byte opcode is used.\n\ | |
1271 | If a symbol has a property named `byte-code-meter' whose value is an\n\ | |
1272 | integer, it is incremented each time that symbol's function is called."); | |
36f7ba0a JB |
1273 | |
1274 | byte_metering_on = 0; | |
63639d44 JB |
1275 | Vbyte_code_meter = Fmake_vector (make_number (256), make_number (0)); |
1276 | Qbyte_code_meter = intern ("byte-code-meter"); | |
1277 | staticpro (&Qbyte_code_meter); | |
36f7ba0a JB |
1278 | { |
1279 | int i = 256; | |
1280 | while (i--) | |
63639d44 JB |
1281 | XVECTOR (Vbyte_code_meter)->contents[i] = |
1282 | Fmake_vector (make_number (256), make_number (0)); | |
36f7ba0a JB |
1283 | } |
1284 | #endif | |
1285 | } |