|
0
|
1 /* Execution of byte code produced by bytecomp.el.
|
|
|
2 Copyright (C) 1992, 1993 Free Software Foundation, Inc.
|
|
|
3
|
|
|
4 This file is part of XEmacs.
|
|
|
5
|
|
|
6 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
7 under the terms of the GNU General Public License as published by the
|
|
|
8 Free Software Foundation; either version 2, or (at your option) any
|
|
|
9 later version.
|
|
|
10
|
|
|
11 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
14 for more details.
|
|
|
15
|
|
|
16 You should have received a copy of the GNU General Public License
|
|
|
17 along with XEmacs; see the file COPYING. If not, write to
|
|
|
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
19 Boston, MA 02111-1307, USA. */
|
|
|
20
|
|
|
21 /* Synched up with: Mule 2.0, FSF 19.30. */
|
|
|
22
|
|
70
|
23 /* This file has been Mule-ized. */
|
|
|
24
|
|
|
25
|
|
0
|
26 /* Authorship:
|
|
|
27
|
|
|
28 FSF: long ago.
|
|
|
29
|
|
149
|
30 hacked on by jwz@netscape.com 17-jun-91
|
|
0
|
31 o added a compile-time switch to turn on simple sanity checking;
|
|
|
32 o put back the obsolete byte-codes for error-detection;
|
|
173
|
33 o added a new instruction, unbind_all, which I will use for
|
|
0
|
34 tail-recursion elimination;
|
|
|
35 o made temp_output_buffer_show be called with the right number
|
|
|
36 of args;
|
|
|
37 o made the new bytecodes be called with args in the right order;
|
|
|
38 o added metering support.
|
|
|
39
|
|
|
40 by Hallvard:
|
|
|
41 o added relative jump instructions;
|
|
|
42 o all conditionals now only do QUIT if they jump.
|
|
70
|
43
|
|
|
44 Ben Wing: some changes for Mule, June 1995.
|
|
0
|
45 */
|
|
|
46
|
|
|
47 #include <config.h>
|
|
|
48 #include "lisp.h"
|
|
|
49 #include "buffer.h"
|
|
|
50 #include "syntax.h"
|
|
|
51
|
|
|
52 /*
|
|
173
|
53 * define BYTE_CODE_SAFE to enable some minor sanity checking (useful for
|
|
0
|
54 * debugging the byte compiler...) Somewhat surprisingly, defining this
|
|
|
55 * makes Fbyte_code about 8% slower.
|
|
|
56 *
|
|
173
|
57 * define BYTE_CODE_METER to enable generation of a byte-op usage histogram.
|
|
0
|
58 */
|
|
255
|
59 /* This isn't defined in FSF Emacs and isn't defined in XEmacs v19 */
|
|
|
60 #ifdef DEBUG_XEMACS
|
|
70
|
61 #define BYTE_CODE_SAFE
|
|
255
|
62 #endif
|
|
0
|
63 /* #define BYTE_CODE_METER */
|
|
|
64
|
|
|
65
|
|
|
66 #ifdef BYTE_CODE_METER
|
|
|
67
|
|
|
68 Lisp_Object Vbyte_code_meter, Qbyte_code_meter;
|
|
|
69 int byte_metering_on;
|
|
|
70
|
|
|
71 #define METER_2(code1, code2) \
|
|
173
|
72 XINT (XVECTOR_DATA (XVECTOR_DATA (Vbyte_code_meter)[(code1)])[(code2)])
|
|
0
|
73
|
|
|
74 #define METER_1(code) METER_2 (0, (code))
|
|
|
75
|
|
|
76 #define METER_CODE(last_code, this_code) \
|
|
|
77 { \
|
|
|
78 if (byte_metering_on) \
|
|
|
79 { \
|
|
|
80 if (METER_1 (this_code) != ((1<<VALBITS)-1)) \
|
|
|
81 METER_1 (this_code)++; \
|
|
|
82 if (last_code \
|
|
|
83 && METER_2 (last_code, this_code) != ((1<<VALBITS)-1))\
|
|
|
84 METER_2 (last_code, this_code)++; \
|
|
|
85 } \
|
|
|
86 }
|
|
|
87
|
|
|
88 #endif /* no BYTE_CODE_METER */
|
|
|
89
|
|
|
90
|
|
|
91 Lisp_Object Qbyte_code;
|
|
|
92
|
|
|
93 /* Byte codes: */
|
|
|
94
|
|
|
95 #define Bvarref 010
|
|
|
96 #define Bvarset 020
|
|
|
97 #define Bvarbind 030
|
|
|
98 #define Bcall 040
|
|
|
99 #define Bunbind 050
|
|
|
100
|
|
|
101 #define Bnth 070
|
|
|
102 #define Bsymbolp 071
|
|
|
103 #define Bconsp 072
|
|
|
104 #define Bstringp 073
|
|
|
105 #define Blistp 074
|
|
70
|
106 #define Bold_eq 075
|
|
|
107 #define Bold_memq 076
|
|
0
|
108 #define Bnot 077
|
|
|
109 #define Bcar 0100
|
|
|
110 #define Bcdr 0101
|
|
|
111 #define Bcons 0102
|
|
|
112 #define Blist1 0103
|
|
|
113 #define Blist2 0104
|
|
|
114 #define Blist3 0105
|
|
|
115 #define Blist4 0106
|
|
|
116 #define Blength 0107
|
|
|
117 #define Baref 0110
|
|
|
118 #define Baset 0111
|
|
|
119 #define Bsymbol_value 0112
|
|
|
120 #define Bsymbol_function 0113
|
|
|
121 #define Bset 0114
|
|
|
122 #define Bfset 0115
|
|
|
123 #define Bget 0116
|
|
|
124 #define Bsubstring 0117
|
|
|
125 #define Bconcat2 0120
|
|
|
126 #define Bconcat3 0121
|
|
|
127 #define Bconcat4 0122
|
|
|
128 #define Bsub1 0123
|
|
|
129 #define Badd1 0124
|
|
|
130 #define Beqlsign 0125
|
|
|
131 #define Bgtr 0126
|
|
|
132 #define Blss 0127
|
|
|
133 #define Bleq 0130
|
|
|
134 #define Bgeq 0131
|
|
|
135 #define Bdiff 0132
|
|
|
136 #define Bnegate 0133
|
|
|
137 #define Bplus 0134
|
|
|
138 #define Bmax 0135
|
|
|
139 #define Bmin 0136
|
|
|
140 #define Bmult 0137
|
|
|
141
|
|
|
142 #define Bpoint 0140
|
|
70
|
143 #define Beq 0141 /* was Bmark, but no longer generated as of v18 */
|
|
0
|
144 #define Bgoto_char 0142
|
|
|
145 #define Binsert 0143
|
|
|
146 #define Bpoint_max 0144
|
|
|
147 #define Bpoint_min 0145
|
|
|
148 #define Bchar_after 0146
|
|
|
149 #define Bfollowing_char 0147
|
|
|
150 #define Bpreceding_char 0150
|
|
|
151 #define Bcurrent_column 0151
|
|
|
152 #define Bindent_to 0152
|
|
70
|
153 #define Bequal 0153 /* was Bscan_buffer, but no longer generated as of v18 */
|
|
0
|
154 #define Beolp 0154
|
|
|
155 #define Beobp 0155
|
|
|
156 #define Bbolp 0156
|
|
|
157 #define Bbobp 0157
|
|
|
158 #define Bcurrent_buffer 0160
|
|
|
159 #define Bset_buffer 0161
|
|
161
|
160 #define Bsave_current_buffer 0162 /* was Bread_char, but no longer
|
|
|
161 generated as of v19 */
|
|
70
|
162 #define Bmemq 0163 /* was Bset_mark, but no longer generated as of v18 */
|
|
0
|
163 #define Binteractive_p 0164 /* Needed since interactive-p takes unevalled args */
|
|
|
164
|
|
|
165 #define Bforward_char 0165
|
|
|
166 #define Bforward_word 0166
|
|
|
167 #define Bskip_chars_forward 0167
|
|
|
168 #define Bskip_chars_backward 0170
|
|
|
169 #define Bforward_line 0171
|
|
|
170 #define Bchar_syntax 0172
|
|
|
171 #define Bbuffer_substring 0173
|
|
|
172 #define Bdelete_region 0174
|
|
|
173 #define Bnarrow_to_region 0175
|
|
|
174 #define Bwiden 0176
|
|
|
175 #define Bend_of_line 0177
|
|
|
176
|
|
|
177 #define Bconstant2 0201
|
|
|
178 #define Bgoto 0202
|
|
|
179 #define Bgotoifnil 0203
|
|
|
180 #define Bgotoifnonnil 0204
|
|
|
181 #define Bgotoifnilelsepop 0205
|
|
|
182 #define Bgotoifnonnilelsepop 0206
|
|
|
183 #define Breturn 0207
|
|
|
184 #define Bdiscard 0210
|
|
|
185 #define Bdup 0211
|
|
|
186
|
|
|
187 #define Bsave_excursion 0212
|
|
|
188 #define Bsave_window_excursion 0213
|
|
|
189 #define Bsave_restriction 0214
|
|
|
190 #define Bcatch 0215
|
|
|
191
|
|
|
192 #define Bunwind_protect 0216
|
|
|
193 #define Bcondition_case 0217
|
|
|
194 #define Btemp_output_buffer_setup 0220
|
|
|
195 #define Btemp_output_buffer_show 0221
|
|
|
196
|
|
|
197 #define Bunbind_all 0222
|
|
|
198
|
|
|
199 #define Bset_marker 0223
|
|
|
200 #define Bmatch_beginning 0224
|
|
|
201 #define Bmatch_end 0225
|
|
|
202 #define Bupcase 0226
|
|
|
203 #define Bdowncase 0227
|
|
|
204
|
|
|
205 #define Bstringeqlsign 0230
|
|
|
206 #define Bstringlss 0231
|
|
70
|
207 #define Bold_equal 0232
|
|
0
|
208 #define Bnthcdr 0233
|
|
|
209 #define Belt 0234
|
|
70
|
210 #define Bold_member 0235
|
|
|
211 #define Bold_assq 0236
|
|
0
|
212 #define Bnreverse 0237
|
|
|
213 #define Bsetcar 0240
|
|
|
214 #define Bsetcdr 0241
|
|
|
215 #define Bcar_safe 0242
|
|
|
216 #define Bcdr_safe 0243
|
|
|
217 #define Bnconc 0244
|
|
|
218 #define Bquo 0245
|
|
|
219 #define Brem 0246
|
|
|
220 #define Bnumberp 0247
|
|
|
221 #define Bintegerp 0250
|
|
|
222
|
|
|
223 #define BRgoto 0252
|
|
|
224 #define BRgotoifnil 0253
|
|
|
225 #define BRgotoifnonnil 0254
|
|
|
226 #define BRgotoifnilelsepop 0255
|
|
|
227 #define BRgotoifnonnilelsepop 0256
|
|
|
228
|
|
|
229 #define BlistN 0257
|
|
|
230 #define BconcatN 0260
|
|
|
231 #define BinsertN 0261
|
|
70
|
232 #define Bmember 0266 /* new in v20 */
|
|
|
233 #define Bassq 0267 /* new in v20 */
|
|
0
|
234
|
|
|
235 #define Bconstant 0300
|
|
|
236 #define CONSTANTLIM 0100
|
|
|
237
|
|
|
238 /* Fetch the next byte from the bytecode stream */
|
|
|
239
|
|
|
240 #define FETCH (massaged_code[pc++])
|
|
|
241
|
|
|
242 /* Fetch two bytes from the bytecode stream
|
|
|
243 and make a 16-bit number out of them */
|
|
|
244
|
|
|
245 #define FETCH2 (op = FETCH, op + (FETCH << 8))
|
|
|
246
|
|
|
247 /* Push x onto the execution stack. */
|
|
|
248
|
|
|
249 /* This used to be #define PUSH(x) (*++stackp = (x))
|
|
|
250 This oddity is necessary because Alliant can't be bothered to
|
|
|
251 compile the preincrement operator properly, as of 4/91. -JimB */
|
|
|
252 #define PUSH(x) (stackp++, *stackp = (x))
|
|
|
253
|
|
|
254 /* Pop a value off the execution stack. */
|
|
|
255
|
|
|
256 #define POP (*stackp--)
|
|
|
257
|
|
|
258 /* Discard n values from the execution stack. */
|
|
|
259
|
|
|
260 #define DISCARD(n) (stackp -= (n))
|
|
|
261
|
|
|
262 /* Get the value which is at the top of the execution stack,
|
|
|
263 but don't pop it. */
|
|
|
264
|
|
|
265 #define TOP (*stackp)
|
|
|
266
|
|
20
|
267 DEFUN ("byte-code", Fbyte_code, 3, 3, 0, /*
|
|
0
|
268 Function used internally in byte-compiled code.
|
|
|
269 The first argument is a string of byte code; the second, a vector of constants;
|
|
|
270 the third, the maximum stack depth used in this function.
|
|
|
271 If the third argument is incorrect, Emacs may crash.
|
|
20
|
272 */
|
|
|
273 (bytestr, vector, maxdepth))
|
|
0
|
274 {
|
|
|
275 /* This function can GC */
|
|
|
276 struct gcpro gcpro1, gcpro2, gcpro3;
|
|
|
277 int speccount = specpdl_depth ();
|
|
|
278 #ifdef BYTE_CODE_METER
|
|
|
279 int this_op = 0;
|
|
|
280 int prev_op;
|
|
|
281 #endif
|
|
|
282 REGISTER int op;
|
|
|
283 int pc;
|
|
|
284 Lisp_Object *stack;
|
|
|
285 REGISTER Lisp_Object *stackp;
|
|
|
286 Lisp_Object *stacke;
|
|
|
287 REGISTER Lisp_Object v1, v2;
|
|
173
|
288 REGISTER Lisp_Object *vectorp = XVECTOR_DATA (vector);
|
|
0
|
289 #ifdef BYTE_CODE_SAFE
|
|
173
|
290 REGISTER int const_length = XVECTOR_LENGTH (vector);
|
|
0
|
291 #endif
|
|
|
292 REGISTER Emchar *massaged_code;
|
|
|
293 int massaged_code_len;
|
|
|
294
|
|
|
295 CHECK_STRING (bytestr);
|
|
|
296 if (!VECTORP (vector))
|
|
|
297 vector = wrong_type_argument (Qvectorp, vector);
|
|
|
298 CHECK_NATNUM (maxdepth);
|
|
|
299
|
|
185
|
300 stackp = alloca_array (Lisp_Object, XINT (maxdepth));
|
|
0
|
301 memset (stackp, 0, XINT (maxdepth) * sizeof (Lisp_Object));
|
|
|
302 GCPRO3 (bytestr, vector, *stackp);
|
|
|
303 gcpro3.nvars = XINT (maxdepth);
|
|
|
304
|
|
|
305 --stackp;
|
|
|
306 stack = stackp;
|
|
|
307 stacke = stackp + XINT (maxdepth);
|
|
|
308
|
|
|
309 /* Initialize the pc-register and convert the string into a fixed-width
|
|
|
310 format for easier processing. */
|
|
272
|
311 massaged_code = alloca_array (Emchar, 1 + XSTRING_CHAR_LENGTH (bytestr));
|
|
0
|
312 massaged_code_len =
|
|
16
|
313 convert_bufbyte_string_into_emchar_string (XSTRING_DATA (bytestr),
|
|
|
314 XSTRING_LENGTH (bytestr),
|
|
0
|
315 massaged_code);
|
|
|
316 massaged_code[massaged_code_len] = 0;
|
|
|
317 pc = 0;
|
|
173
|
318
|
|
0
|
319 while (1)
|
|
|
320 {
|
|
|
321 #ifdef BYTE_CODE_SAFE
|
|
|
322 if (stackp > stacke)
|
|
173
|
323 error ("Byte code stack overflow (byte compiler bug), pc %d, depth %ld",
|
|
|
324 pc, (long) (stacke - stackp));
|
|
0
|
325 if (stackp < stack)
|
|
|
326 error ("Byte code stack underflow (byte compiler bug), pc %d",
|
|
|
327 pc);
|
|
|
328 #endif
|
|
|
329
|
|
|
330 #ifdef BYTE_CODE_METER
|
|
|
331 prev_op = this_op;
|
|
|
332 this_op = op = FETCH;
|
|
|
333 METER_CODE (prev_op, op);
|
|
|
334 switch (op)
|
|
|
335 #else
|
|
|
336 switch (op = FETCH)
|
|
|
337 #endif
|
|
|
338 {
|
|
|
339 case Bvarref+6:
|
|
|
340 op = FETCH;
|
|
|
341 goto varref;
|
|
|
342
|
|
|
343 case Bvarref+7:
|
|
|
344 op = FETCH2;
|
|
|
345 goto varref;
|
|
|
346
|
|
|
347 case Bvarref: case Bvarref+1: case Bvarref+2: case Bvarref+3:
|
|
|
348 case Bvarref+4: case Bvarref+5:
|
|
|
349 op = op - Bvarref;
|
|
|
350 varref:
|
|
|
351 v1 = vectorp[op];
|
|
|
352 if (!SYMBOLP (v1))
|
|
|
353 v2 = Fsymbol_value (v1);
|
|
|
354 else
|
|
|
355 {
|
|
|
356 v2 = XSYMBOL (v1)->value;
|
|
|
357 if (SYMBOL_VALUE_MAGIC_P (v2))
|
|
|
358 v2 = Fsymbol_value (v1);
|
|
|
359 }
|
|
|
360 PUSH (v2);
|
|
|
361 break;
|
|
|
362
|
|
|
363 case Bvarset+6:
|
|
|
364 op = FETCH;
|
|
|
365 goto varset;
|
|
|
366
|
|
|
367 case Bvarset+7:
|
|
|
368 op = FETCH2;
|
|
|
369 goto varset;
|
|
|
370
|
|
|
371 case Bvarset: case Bvarset+1: case Bvarset+2: case Bvarset+3:
|
|
|
372 case Bvarset+4: case Bvarset+5:
|
|
|
373 op -= Bvarset;
|
|
|
374 varset:
|
|
|
375 Fset (vectorp[op], POP);
|
|
|
376 break;
|
|
|
377
|
|
|
378 case Bvarbind+6:
|
|
|
379 op = FETCH;
|
|
|
380 goto varbind;
|
|
|
381
|
|
|
382 case Bvarbind+7:
|
|
|
383 op = FETCH2;
|
|
|
384 goto varbind;
|
|
|
385
|
|
|
386 case Bvarbind: case Bvarbind+1: case Bvarbind+2: case Bvarbind+3:
|
|
|
387 case Bvarbind+4: case Bvarbind+5:
|
|
|
388 op -= Bvarbind;
|
|
|
389 varbind:
|
|
|
390 specbind (vectorp[op], POP);
|
|
|
391 break;
|
|
|
392
|
|
|
393 case Bcall+6:
|
|
|
394 op = FETCH;
|
|
|
395 goto docall;
|
|
|
396
|
|
|
397 case Bcall+7:
|
|
|
398 op = FETCH2;
|
|
|
399 goto docall;
|
|
|
400
|
|
|
401 case Bcall: case Bcall+1: case Bcall+2: case Bcall+3:
|
|
|
402 case Bcall+4: case Bcall+5:
|
|
|
403 op -= Bcall;
|
|
|
404 docall:
|
|
|
405 DISCARD (op);
|
|
|
406 #ifdef BYTE_CODE_METER
|
|
|
407 if (byte_metering_on && SYMBOLP (TOP))
|
|
|
408 {
|
|
|
409 v1 = TOP;
|
|
|
410 v2 = Fget (v1, Qbyte_code_meter, Qnil);
|
|
|
411 if (INTP (v2)
|
|
|
412 && XINT (v2) != ((1<<VALBITS)-1))
|
|
|
413 {
|
|
|
414 XSETINT (v2, XINT (v2) + 1);
|
|
|
415 Fput (v1, Qbyte_code_meter, v2);
|
|
|
416 }
|
|
|
417 }
|
|
16
|
418 #endif /* BYTE_CODE_METER */
|
|
0
|
419 TOP = Ffuncall (op + 1, &TOP);
|
|
|
420 break;
|
|
|
421
|
|
|
422 case Bunbind+6:
|
|
|
423 op = FETCH;
|
|
|
424 goto dounbind;
|
|
|
425
|
|
|
426 case Bunbind+7:
|
|
|
427 op = FETCH2;
|
|
|
428 goto dounbind;
|
|
|
429
|
|
|
430 case Bunbind: case Bunbind+1: case Bunbind+2: case Bunbind+3:
|
|
|
431 case Bunbind+4: case Bunbind+5:
|
|
|
432 op -= Bunbind;
|
|
|
433 dounbind:
|
|
|
434 unbind_to (specpdl_depth () - op, Qnil);
|
|
|
435 break;
|
|
|
436
|
|
|
437 case Bunbind_all:
|
|
|
438 /* To unbind back to the beginning of this frame. Not used yet,
|
|
|
439 but will be needed for tail-recursion elimination. */
|
|
|
440 unbind_to (speccount, Qnil);
|
|
|
441 break;
|
|
|
442
|
|
|
443 case Bgoto:
|
|
|
444 QUIT;
|
|
|
445 op = FETCH2; /* pc = FETCH2 loses since FETCH2 contains pc++ */
|
|
|
446 pc = op;
|
|
|
447 break;
|
|
|
448
|
|
|
449 case Bgotoifnil:
|
|
|
450 op = FETCH2;
|
|
|
451 if (NILP (POP))
|
|
|
452 {
|
|
|
453 QUIT;
|
|
|
454 pc = op;
|
|
|
455 }
|
|
|
456 break;
|
|
|
457
|
|
|
458 case Bgotoifnonnil:
|
|
|
459 op = FETCH2;
|
|
|
460 if (!NILP (POP))
|
|
|
461 {
|
|
|
462 QUIT;
|
|
|
463 pc = op;
|
|
|
464 }
|
|
|
465 break;
|
|
|
466
|
|
|
467 case Bgotoifnilelsepop:
|
|
|
468 op = FETCH2;
|
|
|
469 if (NILP (TOP))
|
|
|
470 {
|
|
|
471 QUIT;
|
|
|
472 pc = op;
|
|
|
473 }
|
|
|
474 else DISCARD (1);
|
|
|
475 break;
|
|
|
476
|
|
|
477 case Bgotoifnonnilelsepop:
|
|
|
478 op = FETCH2;
|
|
|
479 if (!NILP (TOP))
|
|
|
480 {
|
|
|
481 QUIT;
|
|
|
482 pc = op;
|
|
|
483 }
|
|
|
484 else DISCARD (1);
|
|
|
485 break;
|
|
|
486
|
|
|
487 case BRgoto:
|
|
|
488 QUIT;
|
|
|
489 pc += massaged_code[pc] - 127;
|
|
|
490 break;
|
|
|
491
|
|
|
492 case BRgotoifnil:
|
|
|
493 if (NILP (POP))
|
|
|
494 {
|
|
|
495 QUIT;
|
|
|
496 pc += massaged_code[pc] - 128;
|
|
|
497 }
|
|
|
498 pc++;
|
|
|
499 break;
|
|
|
500
|
|
|
501 case BRgotoifnonnil:
|
|
|
502 if (!NILP (POP))
|
|
|
503 {
|
|
|
504 QUIT;
|
|
|
505 pc += massaged_code[pc] - 128;
|
|
|
506 }
|
|
|
507 pc++;
|
|
|
508 break;
|
|
|
509
|
|
|
510 case BRgotoifnilelsepop:
|
|
|
511 op = FETCH;
|
|
|
512 if (NILP (TOP))
|
|
|
513 {
|
|
|
514 QUIT;
|
|
|
515 pc += op - 128;
|
|
|
516 }
|
|
|
517 else DISCARD (1);
|
|
|
518 break;
|
|
|
519
|
|
|
520 case BRgotoifnonnilelsepop:
|
|
|
521 op = FETCH;
|
|
|
522 if (!NILP (TOP))
|
|
|
523 {
|
|
|
524 QUIT;
|
|
|
525 pc += op - 128;
|
|
|
526 }
|
|
|
527 else DISCARD (1);
|
|
|
528 break;
|
|
|
529
|
|
|
530 case Breturn:
|
|
|
531 v1 = POP;
|
|
|
532 goto exit;
|
|
|
533
|
|
|
534 case Bdiscard:
|
|
|
535 DISCARD (1);
|
|
|
536 break;
|
|
|
537
|
|
|
538 case Bdup:
|
|
|
539 v1 = TOP;
|
|
|
540 PUSH (v1);
|
|
|
541 break;
|
|
|
542
|
|
|
543 case Bconstant2:
|
|
|
544 PUSH (vectorp[FETCH2]);
|
|
|
545 break;
|
|
|
546
|
|
|
547 case Bsave_excursion:
|
|
|
548 record_unwind_protect (save_excursion_restore,
|
|
|
549 save_excursion_save ());
|
|
|
550 break;
|
|
|
551
|
|
|
552 case Bsave_window_excursion:
|
|
|
553 {
|
|
|
554 int count = specpdl_depth ();
|
|
|
555 record_unwind_protect (save_window_excursion_unwind,
|
|
|
556 Fcurrent_window_configuration (Qnil));
|
|
|
557 TOP = Fprogn (TOP);
|
|
|
558 unbind_to (count, Qnil);
|
|
|
559 break;
|
|
|
560 }
|
|
|
561
|
|
|
562 case Bsave_restriction:
|
|
|
563 record_unwind_protect (save_restriction_restore,
|
|
|
564 save_restriction_save ());
|
|
|
565 break;
|
|
|
566
|
|
|
567 case Bcatch:
|
|
|
568 v1 = POP;
|
|
|
569 TOP = internal_catch (TOP, Feval, v1, 0);
|
|
|
570 break;
|
|
|
571
|
|
|
572 case Bunwind_protect:
|
|
|
573 record_unwind_protect (Fprogn, POP);
|
|
|
574 break;
|
|
|
575
|
|
|
576 case Bcondition_case:
|
|
|
577 v1 = POP; /* handlers */
|
|
|
578 v2 = POP; /* bodyform */
|
|
272
|
579 TOP = condition_case_3 (v2, TOP, v1);
|
|
0
|
580 break;
|
|
|
581
|
|
|
582 case Btemp_output_buffer_setup:
|
|
16
|
583 temp_output_buffer_setup ((char *) XSTRING_DATA (TOP));
|
|
0
|
584 TOP = Vstandard_output;
|
|
|
585 break;
|
|
|
586
|
|
|
587 case Btemp_output_buffer_show:
|
|
|
588 v1 = POP;
|
|
|
589 temp_output_buffer_show (TOP, Qnil);
|
|
|
590 TOP = v1;
|
|
|
591 /* GAG ME!! */
|
|
|
592 /* pop binding of standard-output */
|
|
|
593 unbind_to (specpdl_depth() - 1, Qnil);
|
|
|
594 break;
|
|
|
595
|
|
|
596 case Bnth:
|
|
|
597 v1 = POP;
|
|
|
598 v2 = TOP;
|
|
|
599 /* nth_entry: */
|
|
|
600 CHECK_INT (v2);
|
|
|
601 op = XINT (v2);
|
|
|
602 while (--op >= 0)
|
|
|
603 {
|
|
|
604 if (CONSP (v1))
|
|
|
605 v1 = XCDR (v1);
|
|
|
606 else if (!NILP (v1))
|
|
|
607 {
|
|
|
608 v1 = wrong_type_argument (Qlistp, v1);
|
|
|
609 op++;
|
|
|
610 }
|
|
|
611 QUIT;
|
|
|
612 }
|
|
|
613 goto docar;
|
|
|
614
|
|
|
615 case Bsymbolp:
|
|
272
|
616 TOP = SYMBOLP (TOP) ? Qt : Qnil;
|
|
0
|
617 break;
|
|
|
618
|
|
|
619 case Bconsp:
|
|
272
|
620 TOP = CONSP (TOP) ? Qt : Qnil;
|
|
0
|
621 break;
|
|
|
622
|
|
|
623 case Bstringp:
|
|
272
|
624 TOP = STRINGP (TOP) ? Qt : Qnil;
|
|
0
|
625 break;
|
|
|
626
|
|
|
627 case Blistp:
|
|
272
|
628 TOP = LISTP (TOP) ? Qt : Qnil;
|
|
0
|
629 break;
|
|
|
630
|
|
|
631 case Beq:
|
|
|
632 v1 = POP;
|
|
272
|
633 TOP = EQ_WITH_EBOLA_NOTICE (v1, TOP) ? Qt : Qnil;
|
|
70
|
634 break;
|
|
|
635
|
|
|
636 case Bold_eq:
|
|
|
637 v1 = POP;
|
|
272
|
638 TOP = HACKEQ_UNSAFE (v1, TOP) ? Qt : Qnil;
|
|
0
|
639 break;
|
|
|
640
|
|
|
641 case Bmemq:
|
|
|
642 v1 = POP;
|
|
|
643 TOP = Fmemq (TOP, v1);
|
|
|
644 break;
|
|
|
645
|
|
70
|
646 case Bold_memq:
|
|
|
647 v1 = POP;
|
|
|
648 TOP = Fold_memq (TOP, v1);
|
|
|
649 break;
|
|
|
650
|
|
0
|
651 case Bnot:
|
|
|
652 TOP = NILP (TOP) ? Qt : Qnil;
|
|
|
653 break;
|
|
|
654
|
|
|
655 case Bcar:
|
|
|
656 v1 = TOP;
|
|
|
657 docar:
|
|
|
658 if (CONSP (v1)) TOP = XCAR (v1);
|
|
|
659 else if (NILP (v1)) TOP = Qnil;
|
|
|
660 else Fcar (wrong_type_argument (Qlistp, v1));
|
|
|
661 break;
|
|
|
662
|
|
|
663 case Bcdr:
|
|
|
664 v1 = TOP;
|
|
|
665 if (CONSP (v1)) TOP = XCDR (v1);
|
|
|
666 else if (NILP (v1)) TOP = Qnil;
|
|
|
667 else Fcdr (wrong_type_argument (Qlistp, v1));
|
|
|
668 break;
|
|
|
669
|
|
|
670 case Bcons:
|
|
|
671 v1 = POP;
|
|
|
672 TOP = Fcons (TOP, v1);
|
|
|
673 break;
|
|
|
674
|
|
|
675 case Blist1:
|
|
|
676 TOP = Fcons (TOP, Qnil);
|
|
|
677 break;
|
|
|
678
|
|
|
679 case Blist2:
|
|
|
680 v1 = POP;
|
|
|
681 TOP = Fcons (TOP, Fcons (v1, Qnil));
|
|
|
682 break;
|
|
|
683
|
|
|
684 case Blist3:
|
|
|
685 DISCARD (2);
|
|
|
686 TOP = Flist (3, &TOP);
|
|
|
687 break;
|
|
|
688
|
|
|
689 case Blist4:
|
|
|
690 DISCARD (3);
|
|
|
691 TOP = Flist (4, &TOP);
|
|
|
692 break;
|
|
|
693
|
|
|
694 case BlistN:
|
|
|
695 op = FETCH;
|
|
|
696 DISCARD (op - 1);
|
|
|
697 TOP = Flist (op, &TOP);
|
|
|
698 break;
|
|
|
699
|
|
|
700 case Blength:
|
|
|
701 TOP = Flength (TOP);
|
|
|
702 break;
|
|
|
703
|
|
|
704 case Baref:
|
|
|
705 v1 = POP;
|
|
|
706 TOP = Faref (TOP, v1);
|
|
|
707 break;
|
|
|
708
|
|
|
709 case Baset:
|
|
|
710 v2 = POP; v1 = POP;
|
|
|
711 TOP = Faset (TOP, v1, v2);
|
|
|
712 break;
|
|
|
713
|
|
|
714 case Bsymbol_value:
|
|
|
715 TOP = Fsymbol_value (TOP);
|
|
|
716 break;
|
|
|
717
|
|
|
718 case Bsymbol_function:
|
|
|
719 TOP = Fsymbol_function (TOP);
|
|
|
720 break;
|
|
|
721
|
|
|
722 case Bset:
|
|
|
723 v1 = POP;
|
|
|
724 TOP = Fset (TOP, v1);
|
|
|
725 break;
|
|
|
726
|
|
|
727 case Bfset:
|
|
|
728 v1 = POP;
|
|
|
729 TOP = Ffset (TOP, v1);
|
|
|
730 break;
|
|
|
731
|
|
|
732 case Bget:
|
|
|
733 v1 = POP;
|
|
|
734 TOP = Fget (TOP, v1, Qnil);
|
|
|
735 break;
|
|
|
736
|
|
|
737 case Bsubstring:
|
|
|
738 v2 = POP; v1 = POP;
|
|
|
739 TOP = Fsubstring (TOP, v1, v2);
|
|
|
740 break;
|
|
|
741
|
|
|
742 case Bconcat2:
|
|
|
743 DISCARD (1);
|
|
|
744 TOP = Fconcat (2, &TOP);
|
|
|
745 break;
|
|
|
746
|
|
|
747 case Bconcat3:
|
|
|
748 DISCARD (2);
|
|
|
749 TOP = Fconcat (3, &TOP);
|
|
|
750 break;
|
|
|
751
|
|
|
752 case Bconcat4:
|
|
|
753 DISCARD (3);
|
|
|
754 TOP = Fconcat (4, &TOP);
|
|
|
755 break;
|
|
|
756
|
|
|
757 case BconcatN:
|
|
|
758 op = FETCH;
|
|
|
759 DISCARD (op - 1);
|
|
|
760 TOP = Fconcat (op, &TOP);
|
|
|
761 break;
|
|
|
762
|
|
|
763 case Bsub1:
|
|
|
764 v1 = TOP;
|
|
|
765 if (INTP (v1))
|
|
|
766 {
|
|
|
767 XSETINT (v1, XINT (v1) - 1);
|
|
|
768 TOP = v1;
|
|
|
769 }
|
|
|
770 else
|
|
|
771 TOP = Fsub1 (v1);
|
|
|
772 break;
|
|
|
773
|
|
|
774 case Badd1:
|
|
|
775 v1 = TOP;
|
|
|
776 if (INTP (v1))
|
|
|
777 {
|
|
|
778 XSETINT (v1, XINT (v1) + 1);
|
|
|
779 TOP = v1;
|
|
|
780 }
|
|
|
781 else
|
|
|
782 TOP = Fadd1 (v1);
|
|
|
783 break;
|
|
|
784
|
|
|
785 case Beqlsign:
|
|
|
786 v2 = POP; v1 = TOP;
|
|
|
787 CHECK_INT_OR_FLOAT_COERCE_CHAR_OR_MARKER (v1);
|
|
|
788 CHECK_INT_OR_FLOAT_COERCE_CHAR_OR_MARKER (v2);
|
|
|
789 #ifdef LISP_FLOAT_TYPE
|
|
|
790 if (FLOATP (v1) || FLOATP (v2))
|
|
|
791 {
|
|
272
|
792 double f1 = (FLOATP (v1) ? float_data (XFLOAT (v1)) : XINT (v1));
|
|
|
793 double f2 = (FLOATP (v2) ? float_data (XFLOAT (v2)) : XINT (v2));
|
|
0
|
794 TOP = (f1 == f2 ? Qt : Qnil);
|
|
|
795 }
|
|
|
796 else
|
|
16
|
797 #endif /* LISP_FLOAT_TYPE */
|
|
0
|
798 TOP = (XINT (v1) == XINT (v2) ? Qt : Qnil);
|
|
|
799 break;
|
|
|
800
|
|
|
801 case Bgtr:
|
|
|
802 v1 = POP;
|
|
|
803 TOP = Fgtr (TOP, v1);
|
|
|
804 break;
|
|
|
805
|
|
|
806 case Blss:
|
|
|
807 v1 = POP;
|
|
|
808 TOP = Flss (TOP, v1);
|
|
|
809 break;
|
|
|
810
|
|
|
811 case Bleq:
|
|
|
812 v1 = POP;
|
|
|
813 TOP = Fleq (TOP, v1);
|
|
|
814 break;
|
|
|
815
|
|
|
816 case Bgeq:
|
|
|
817 v1 = POP;
|
|
|
818 TOP = Fgeq (TOP, v1);
|
|
|
819 break;
|
|
|
820
|
|
|
821 case Bdiff:
|
|
|
822 DISCARD (1);
|
|
|
823 TOP = Fminus (2, &TOP);
|
|
|
824 break;
|
|
|
825
|
|
|
826 case Bnegate:
|
|
|
827 v1 = TOP;
|
|
|
828 if (INTP (v1))
|
|
|
829 {
|
|
|
830 XSETINT (v1, - XINT (v1));
|
|
|
831 TOP = v1;
|
|
|
832 }
|
|
|
833 else
|
|
|
834 TOP = Fminus (1, &TOP);
|
|
|
835 break;
|
|
|
836
|
|
|
837 case Bplus:
|
|
|
838 DISCARD (1);
|
|
|
839 TOP = Fplus (2, &TOP);
|
|
|
840 break;
|
|
|
841
|
|
|
842 case Bmax:
|
|
|
843 DISCARD (1);
|
|
|
844 TOP = Fmax (2, &TOP);
|
|
|
845 break;
|
|
|
846
|
|
|
847 case Bmin:
|
|
|
848 DISCARD (1);
|
|
|
849 TOP = Fmin (2, &TOP);
|
|
|
850 break;
|
|
|
851
|
|
|
852 case Bmult:
|
|
|
853 DISCARD (1);
|
|
|
854 TOP = Ftimes (2, &TOP);
|
|
|
855 break;
|
|
|
856
|
|
|
857 case Bquo:
|
|
|
858 DISCARD (1);
|
|
|
859 TOP = Fquo (2, &TOP);
|
|
|
860 break;
|
|
|
861
|
|
|
862 case Brem:
|
|
|
863 v1 = POP;
|
|
|
864 TOP = Frem (TOP, v1);
|
|
|
865 break;
|
|
|
866
|
|
|
867 case Bpoint:
|
|
|
868 v1 = make_int (BUF_PT (current_buffer));
|
|
|
869 PUSH (v1);
|
|
|
870 break;
|
|
|
871
|
|
|
872 case Bgoto_char:
|
|
223
|
873 TOP = Fgoto_char (TOP, Qnil);
|
|
0
|
874 break;
|
|
|
875
|
|
|
876 case Binsert:
|
|
|
877 TOP = Finsert (1, &TOP);
|
|
|
878 break;
|
|
|
879
|
|
|
880 case BinsertN:
|
|
|
881 op = FETCH;
|
|
|
882 DISCARD (op - 1);
|
|
|
883 TOP = Finsert (op, &TOP);
|
|
|
884 break;
|
|
|
885
|
|
|
886 case Bpoint_max:
|
|
|
887 v1 = make_int (BUF_ZV (current_buffer));
|
|
|
888 PUSH (v1);
|
|
|
889 break;
|
|
|
890
|
|
|
891 case Bpoint_min:
|
|
|
892 v1 = make_int (BUF_BEGV (current_buffer));
|
|
|
893 PUSH (v1);
|
|
|
894 break;
|
|
|
895
|
|
|
896 case Bchar_after:
|
|
223
|
897 TOP = Fchar_after (TOP, Qnil);
|
|
0
|
898 break;
|
|
|
899
|
|
|
900 case Bfollowing_char:
|
|
223
|
901 v1 = Ffollowing_char (Qnil);
|
|
0
|
902 PUSH (v1);
|
|
|
903 break;
|
|
|
904
|
|
|
905 case Bpreceding_char:
|
|
223
|
906 v1 = Fpreceding_char (Qnil);
|
|
0
|
907 PUSH (v1);
|
|
|
908 break;
|
|
|
909
|
|
|
910 case Bcurrent_column:
|
|
|
911 v1 = make_int (current_column (current_buffer));
|
|
|
912 PUSH (v1);
|
|
|
913 break;
|
|
|
914
|
|
|
915 case Bindent_to:
|
|
223
|
916 TOP = Findent_to (TOP, Qnil, Qnil);
|
|
0
|
917 break;
|
|
|
918
|
|
|
919 case Beolp:
|
|
223
|
920 PUSH (Feolp (Qnil));
|
|
0
|
921 break;
|
|
|
922
|
|
|
923 case Beobp:
|
|
223
|
924 PUSH (Feobp (Qnil));
|
|
0
|
925 break;
|
|
|
926
|
|
|
927 case Bbolp:
|
|
223
|
928 PUSH (Fbolp (Qnil));
|
|
0
|
929 break;
|
|
|
930
|
|
|
931 case Bbobp:
|
|
223
|
932 PUSH (Fbobp (Qnil));
|
|
0
|
933 break;
|
|
|
934
|
|
|
935 case Bcurrent_buffer:
|
|
|
936 PUSH (Fcurrent_buffer ());
|
|
|
937 break;
|
|
|
938
|
|
|
939 case Bset_buffer:
|
|
|
940 TOP = Fset_buffer (TOP);
|
|
|
941 break;
|
|
|
942
|
|
161
|
943 case Bsave_current_buffer:
|
|
169
|
944 record_unwind_protect (save_current_buffer_restore,
|
|
|
945 Fcurrent_buffer ());
|
|
|
946 break;
|
|
0
|
947
|
|
|
948 case Binteractive_p:
|
|
|
949 PUSH (Finteractive_p ());
|
|
|
950 break;
|
|
|
951
|
|
|
952 case Bforward_char:
|
|
223
|
953 TOP = Fforward_char (TOP, Qnil);
|
|
0
|
954 break;
|
|
|
955
|
|
|
956 case Bforward_word:
|
|
223
|
957 TOP = Fforward_word (TOP, Qnil);
|
|
0
|
958 break;
|
|
|
959
|
|
|
960 case Bskip_chars_forward:
|
|
|
961 v1 = POP;
|
|
223
|
962 TOP = Fskip_chars_forward (TOP, v1, Qnil);
|
|
0
|
963 break;
|
|
|
964
|
|
|
965 case Bskip_chars_backward:
|
|
|
966 v1 = POP;
|
|
223
|
967 TOP = Fskip_chars_backward (TOP, v1, Qnil);
|
|
0
|
968 break;
|
|
|
969
|
|
|
970 case Bforward_line:
|
|
223
|
971 TOP = Fforward_line (TOP, Qnil);
|
|
0
|
972 break;
|
|
|
973
|
|
|
974 case Bchar_syntax:
|
|
195
|
975 #if 0
|
|
0
|
976 CHECK_CHAR_COERCE_INT (TOP);
|
|
|
977 TOP = make_char (syntax_code_spec
|
|
16
|
978 [(int) SYNTAX
|
|
70
|
979 (XCHAR_TABLE
|
|
|
980 (current_buffer->mirror_syntax_table),
|
|
|
981 XCHAR (TOP))]);
|
|
195
|
982 #endif
|
|
|
983 /*v1 = POP;*/
|
|
|
984 TOP = Fchar_syntax(TOP, Qnil);
|
|
0
|
985 break;
|
|
|
986
|
|
|
987 case Bbuffer_substring:
|
|
|
988 v1 = POP;
|
|
223
|
989 TOP = Fbuffer_substring (TOP, v1, Qnil);
|
|
0
|
990 break;
|
|
|
991
|
|
|
992 case Bdelete_region:
|
|
|
993 v1 = POP;
|
|
223
|
994 TOP = Fdelete_region (TOP, v1, Qnil);
|
|
0
|
995 break;
|
|
|
996
|
|
|
997 case Bnarrow_to_region:
|
|
|
998 v1 = POP;
|
|
223
|
999 TOP = Fnarrow_to_region (TOP, v1, Qnil);
|
|
0
|
1000 break;
|
|
|
1001
|
|
|
1002 case Bwiden:
|
|
223
|
1003 PUSH (Fwiden (Qnil));
|
|
0
|
1004 break;
|
|
|
1005
|
|
|
1006 case Bend_of_line:
|
|
223
|
1007 TOP = Fend_of_line (TOP, Qnil);
|
|
0
|
1008 break;
|
|
|
1009
|
|
|
1010 case Bset_marker:
|
|
|
1011 v1 = POP;
|
|
|
1012 v2 = POP;
|
|
|
1013 TOP = Fset_marker (TOP, v2, v1);
|
|
|
1014 break;
|
|
|
1015
|
|
|
1016 case Bmatch_beginning:
|
|
|
1017 TOP = Fmatch_beginning (TOP);
|
|
|
1018 break;
|
|
|
1019
|
|
|
1020 case Bmatch_end:
|
|
|
1021 TOP = Fmatch_end (TOP);
|
|
|
1022 break;
|
|
|
1023
|
|
|
1024 case Bupcase:
|
|
223
|
1025 TOP = Fupcase (TOP, Qnil);
|
|
0
|
1026 break;
|
|
|
1027
|
|
|
1028 case Bdowncase:
|
|
223
|
1029 TOP = Fdowncase (TOP, Qnil);
|
|
0
|
1030 break;
|
|
|
1031
|
|
|
1032 case Bstringeqlsign:
|
|
|
1033 v1 = POP;
|
|
|
1034 TOP = Fstring_equal (TOP, v1);
|
|
|
1035 break;
|
|
|
1036
|
|
|
1037 case Bstringlss:
|
|
|
1038 v1 = POP;
|
|
|
1039 TOP = Fstring_lessp (TOP, v1);
|
|
|
1040 break;
|
|
|
1041
|
|
|
1042 case Bequal:
|
|
|
1043 v1 = POP;
|
|
|
1044 TOP = Fequal (TOP, v1);
|
|
|
1045 break;
|
|
|
1046
|
|
70
|
1047 case Bold_equal:
|
|
|
1048 v1 = POP;
|
|
|
1049 TOP = Fold_equal (TOP, v1);
|
|
|
1050 break;
|
|
|
1051
|
|
0
|
1052 case Bnthcdr:
|
|
|
1053 v1 = POP;
|
|
|
1054 TOP = Fnthcdr (TOP, v1);
|
|
|
1055 break;
|
|
|
1056
|
|
|
1057 case Belt:
|
|
|
1058 #if 0
|
|
|
1059 /* probably this code is OK, but nth_entry is commented
|
|
|
1060 out above --ben */
|
|
207
|
1061 /* #### will not work if cons type is an lrecord. */
|
|
185
|
1062 if (XTYPE (TOP) == Lisp_Type_Cons)
|
|
0
|
1063 {
|
|
|
1064 /* Exchange args and then do nth. */
|
|
|
1065 v2 = POP;
|
|
|
1066 v1 = TOP;
|
|
|
1067 goto nth_entry;
|
|
|
1068 }
|
|
|
1069 #endif
|
|
|
1070 v1 = POP;
|
|
|
1071 TOP = Felt (TOP, v1);
|
|
|
1072 break;
|
|
|
1073
|
|
|
1074 case Bmember:
|
|
|
1075 v1 = POP;
|
|
|
1076 TOP = Fmember (TOP, v1);
|
|
|
1077 break;
|
|
|
1078
|
|
70
|
1079 case Bold_member:
|
|
|
1080 v1 = POP;
|
|
|
1081 TOP = Fold_member (TOP, v1);
|
|
|
1082 break;
|
|
|
1083
|
|
0
|
1084 case Bassq:
|
|
|
1085 v1 = POP;
|
|
|
1086 TOP = Fassq (TOP, v1);
|
|
|
1087 break;
|
|
|
1088
|
|
70
|
1089 case Bold_assq:
|
|
|
1090 v1 = POP;
|
|
|
1091 TOP = Fold_assq (TOP, v1);
|
|
|
1092 break;
|
|
|
1093
|
|
0
|
1094 case Bnreverse:
|
|
|
1095 TOP = Fnreverse (TOP);
|
|
|
1096 break;
|
|
|
1097
|
|
|
1098 case Bsetcar:
|
|
|
1099 v1 = POP;
|
|
|
1100 TOP = Fsetcar (TOP, v1);
|
|
|
1101 break;
|
|
|
1102
|
|
|
1103 case Bsetcdr:
|
|
|
1104 v1 = POP;
|
|
|
1105 TOP = Fsetcdr (TOP, v1);
|
|
|
1106 break;
|
|
|
1107
|
|
|
1108 case Bcar_safe:
|
|
|
1109 v1 = TOP;
|
|
|
1110 if (CONSP (v1))
|
|
|
1111 TOP = XCAR (v1);
|
|
|
1112 else
|
|
|
1113 TOP = Qnil;
|
|
|
1114 break;
|
|
|
1115
|
|
|
1116 case Bcdr_safe:
|
|
|
1117 v1 = TOP;
|
|
|
1118 if (CONSP (v1))
|
|
|
1119 TOP = XCDR (v1);
|
|
|
1120 else
|
|
|
1121 TOP = Qnil;
|
|
|
1122 break;
|
|
|
1123
|
|
|
1124 case Bnconc:
|
|
|
1125 DISCARD (1);
|
|
|
1126 TOP = Fnconc (2, &TOP);
|
|
|
1127 break;
|
|
|
1128
|
|
|
1129 case Bnumberp:
|
|
272
|
1130 TOP = INT_OR_FLOATP (TOP) ? Qt : Qnil;
|
|
0
|
1131 break;
|
|
|
1132
|
|
|
1133 case Bintegerp:
|
|
272
|
1134 TOP = INTP (TOP) ? Qt : Qnil;
|
|
0
|
1135 break;
|
|
|
1136
|
|
|
1137 default:
|
|
|
1138 #ifdef BYTE_CODE_SAFE
|
|
|
1139 if (op < Bconstant)
|
|
|
1140 error ("unknown bytecode %d (byte compiler bug)", op);
|
|
|
1141 if ((op -= Bconstant) >= const_length)
|
|
|
1142 error ("no constant number %d (byte compiler bug)", op);
|
|
|
1143 PUSH (vectorp[op]);
|
|
|
1144 #else
|
|
|
1145 PUSH (vectorp[op - Bconstant]);
|
|
|
1146 #endif
|
|
|
1147 }
|
|
|
1148 }
|
|
|
1149
|
|
|
1150 exit:
|
|
|
1151 UNGCPRO;
|
|
|
1152 /* Binds and unbinds are supposed to be compiled balanced. */
|
|
|
1153 if (specpdl_depth() != speccount)
|
|
|
1154 /* FSF: abort() if BYTE_CODE_SAFE not defined */
|
|
|
1155 error ("binding stack not balanced (serious byte compiler bug)");
|
|
|
1156 return v1;
|
|
|
1157 }
|
|
|
1158
|
|
|
1159 void
|
|
|
1160 syms_of_bytecode (void)
|
|
|
1161 {
|
|
|
1162 defsymbol (&Qbyte_code, "byte-code");
|
|
20
|
1163 DEFSUBR (Fbyte_code);
|
|
0
|
1164 #ifdef BYTE_CODE_METER
|
|
|
1165 defsymbol (&Qbyte_code_meter, "byte-code-meter");
|
|
|
1166 #endif
|
|
|
1167 }
|
|
|
1168
|
|
|
1169 void
|
|
|
1170 vars_of_bytecode (void)
|
|
|
1171 {
|
|
|
1172 #ifdef BYTE_CODE_METER
|
|
|
1173
|
|
|
1174 DEFVAR_LISP ("byte-code-meter", &Vbyte_code_meter /*
|
|
|
1175 A vector of vectors which holds a histogram of byte-code usage.
|
|
272
|
1176 \(aref (aref byte-code-meter 0) CODE) indicates how many times the byte
|
|
0
|
1177 opcode CODE has been executed.
|
|
272
|
1178 \(aref (aref byte-code-meter CODE1) CODE2), where CODE1 is not 0,
|
|
0
|
1179 indicates how many times the byte opcodes CODE1 and CODE2 have been
|
|
|
1180 executed in succession.
|
|
|
1181 */ );
|
|
|
1182 DEFVAR_BOOL ("byte-metering-on", &byte_metering_on /*
|
|
|
1183 If non-nil, keep profiling information on byte code usage.
|
|
|
1184 The variable byte-code-meter indicates how often each byte opcode is used.
|
|
|
1185 If a symbol has a property named `byte-code-meter' whose value is an
|
|
|
1186 integer, it is incremented each time that symbol's function is called.
|
|
|
1187 */ );
|
|
|
1188
|
|
|
1189 byte_metering_on = 0;
|
|
|
1190 Vbyte_code_meter = make_vector (256, Qzero);
|
|
|
1191 {
|
|
|
1192 int i = 256;
|
|
|
1193 while (i--)
|
|
173
|
1194 XVECTOR_DATA (Vbyte_code_meter)[i] =
|
|
0
|
1195 make_vector (256, Qzero);
|
|
|
1196 }
|
|
|
1197 #endif
|
|
|
1198 }
|
