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