|
428
|
1 /* Execution of byte code produced by bytecomp.el.
|
|
|
2 Implementation of compiled-function objects.
|
|
|
3 Copyright (C) 1992, 1993 Free Software Foundation, Inc.
|
|
814
|
4 Copyright (C) 1995, 2002 Ben Wing.
|
|
428
|
5
|
|
|
6 This file is part of XEmacs.
|
|
|
7
|
|
|
8 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
9 under the terms of the GNU General Public License as published by the
|
|
|
10 Free Software Foundation; either version 2, or (at your option) any
|
|
|
11 later version.
|
|
|
12
|
|
|
13 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
16 for more details.
|
|
|
17
|
|
|
18 You should have received a copy of the GNU General Public License
|
|
|
19 along with XEmacs; see the file COPYING. If not, write to
|
|
|
20 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
21 Boston, MA 02111-1307, USA. */
|
|
|
22
|
|
|
23 /* Synched up with: Mule 2.0, FSF 19.30. */
|
|
|
24
|
|
|
25 /* This file has been Mule-ized. */
|
|
|
26
|
|
|
27
|
|
|
28 /* Authorship:
|
|
|
29
|
|
|
30 FSF: long ago.
|
|
|
31
|
|
|
32 hacked on by jwz@jwz.org 1991-06
|
|
|
33 o added a compile-time switch to turn on simple sanity checking;
|
|
|
34 o put back the obsolete byte-codes for error-detection;
|
|
|
35 o added a new instruction, unbind_all, which I will use for
|
|
|
36 tail-recursion elimination;
|
|
|
37 o made temp_output_buffer_show be called with the right number
|
|
|
38 of args;
|
|
|
39 o made the new bytecodes be called with args in the right order;
|
|
|
40 o added metering support.
|
|
|
41
|
|
|
42 by Hallvard:
|
|
|
43 o added relative jump instructions;
|
|
|
44 o all conditionals now only do QUIT if they jump.
|
|
|
45
|
|
|
46 Ben Wing: some changes for Mule, 1995-06.
|
|
|
47
|
|
|
48 Martin Buchholz: performance hacking, 1998-09.
|
|
|
49 See Internals Manual, Evaluation.
|
|
|
50 */
|
|
|
51
|
|
|
52 #include <config.h>
|
|
|
53 #include "lisp.h"
|
|
|
54 #include "backtrace.h"
|
|
|
55 #include "buffer.h"
|
|
|
56 #include "bytecode.h"
|
|
|
57 #include "opaque.h"
|
|
|
58 #include "syntax.h"
|
|
|
59
|
|
|
60 EXFUN (Ffetch_bytecode, 1);
|
|
|
61
|
|
|
62 Lisp_Object Qbyte_code, Qcompiled_functionp, Qinvalid_byte_code;
|
|
|
63
|
|
|
64 enum Opcode /* Byte codes */
|
|
|
65 {
|
|
|
66 Bvarref = 010,
|
|
|
67 Bvarset = 020,
|
|
|
68 Bvarbind = 030,
|
|
|
69 Bcall = 040,
|
|
|
70 Bunbind = 050,
|
|
|
71
|
|
|
72 Bnth = 070,
|
|
|
73 Bsymbolp = 071,
|
|
|
74 Bconsp = 072,
|
|
|
75 Bstringp = 073,
|
|
|
76 Blistp = 074,
|
|
|
77 Bold_eq = 075,
|
|
|
78 Bold_memq = 076,
|
|
|
79 Bnot = 077,
|
|
|
80 Bcar = 0100,
|
|
|
81 Bcdr = 0101,
|
|
|
82 Bcons = 0102,
|
|
|
83 Blist1 = 0103,
|
|
|
84 Blist2 = 0104,
|
|
|
85 Blist3 = 0105,
|
|
|
86 Blist4 = 0106,
|
|
|
87 Blength = 0107,
|
|
|
88 Baref = 0110,
|
|
|
89 Baset = 0111,
|
|
|
90 Bsymbol_value = 0112,
|
|
|
91 Bsymbol_function = 0113,
|
|
|
92 Bset = 0114,
|
|
|
93 Bfset = 0115,
|
|
|
94 Bget = 0116,
|
|
|
95 Bsubstring = 0117,
|
|
|
96 Bconcat2 = 0120,
|
|
|
97 Bconcat3 = 0121,
|
|
|
98 Bconcat4 = 0122,
|
|
|
99 Bsub1 = 0123,
|
|
|
100 Badd1 = 0124,
|
|
|
101 Beqlsign = 0125,
|
|
|
102 Bgtr = 0126,
|
|
|
103 Blss = 0127,
|
|
|
104 Bleq = 0130,
|
|
|
105 Bgeq = 0131,
|
|
|
106 Bdiff = 0132,
|
|
|
107 Bnegate = 0133,
|
|
|
108 Bplus = 0134,
|
|
|
109 Bmax = 0135,
|
|
|
110 Bmin = 0136,
|
|
|
111 Bmult = 0137,
|
|
|
112
|
|
|
113 Bpoint = 0140,
|
|
|
114 Beq = 0141, /* was Bmark,
|
|
|
115 but no longer generated as of v18 */
|
|
|
116 Bgoto_char = 0142,
|
|
|
117 Binsert = 0143,
|
|
|
118 Bpoint_max = 0144,
|
|
|
119 Bpoint_min = 0145,
|
|
|
120 Bchar_after = 0146,
|
|
|
121 Bfollowing_char = 0147,
|
|
|
122 Bpreceding_char = 0150,
|
|
|
123 Bcurrent_column = 0151,
|
|
|
124 Bindent_to = 0152,
|
|
|
125 Bequal = 0153, /* was Bscan_buffer,
|
|
|
126 but no longer generated as of v18 */
|
|
|
127 Beolp = 0154,
|
|
|
128 Beobp = 0155,
|
|
|
129 Bbolp = 0156,
|
|
|
130 Bbobp = 0157,
|
|
|
131 Bcurrent_buffer = 0160,
|
|
|
132 Bset_buffer = 0161,
|
|
|
133 Bsave_current_buffer = 0162, /* was Bread_char,
|
|
|
134 but no longer generated as of v19 */
|
|
|
135 Bmemq = 0163, /* was Bset_mark,
|
|
|
136 but no longer generated as of v18 */
|
|
|
137 Binteractive_p = 0164, /* Needed since interactive-p takes
|
|
|
138 unevalled args */
|
|
|
139 Bforward_char = 0165,
|
|
|
140 Bforward_word = 0166,
|
|
|
141 Bskip_chars_forward = 0167,
|
|
|
142 Bskip_chars_backward = 0170,
|
|
|
143 Bforward_line = 0171,
|
|
|
144 Bchar_syntax = 0172,
|
|
|
145 Bbuffer_substring = 0173,
|
|
|
146 Bdelete_region = 0174,
|
|
|
147 Bnarrow_to_region = 0175,
|
|
|
148 Bwiden = 0176,
|
|
|
149 Bend_of_line = 0177,
|
|
|
150
|
|
|
151 Bconstant2 = 0201,
|
|
|
152 Bgoto = 0202,
|
|
|
153 Bgotoifnil = 0203,
|
|
|
154 Bgotoifnonnil = 0204,
|
|
|
155 Bgotoifnilelsepop = 0205,
|
|
|
156 Bgotoifnonnilelsepop = 0206,
|
|
|
157 Breturn = 0207,
|
|
|
158 Bdiscard = 0210,
|
|
|
159 Bdup = 0211,
|
|
|
160
|
|
|
161 Bsave_excursion = 0212,
|
|
|
162 Bsave_window_excursion= 0213,
|
|
|
163 Bsave_restriction = 0214,
|
|
|
164 Bcatch = 0215,
|
|
|
165
|
|
|
166 Bunwind_protect = 0216,
|
|
|
167 Bcondition_case = 0217,
|
|
|
168 Btemp_output_buffer_setup = 0220,
|
|
|
169 Btemp_output_buffer_show = 0221,
|
|
|
170
|
|
|
171 Bunbind_all = 0222,
|
|
|
172
|
|
|
173 Bset_marker = 0223,
|
|
|
174 Bmatch_beginning = 0224,
|
|
|
175 Bmatch_end = 0225,
|
|
|
176 Bupcase = 0226,
|
|
|
177 Bdowncase = 0227,
|
|
|
178
|
|
|
179 Bstring_equal = 0230,
|
|
|
180 Bstring_lessp = 0231,
|
|
|
181 Bold_equal = 0232,
|
|
|
182 Bnthcdr = 0233,
|
|
|
183 Belt = 0234,
|
|
|
184 Bold_member = 0235,
|
|
|
185 Bold_assq = 0236,
|
|
|
186 Bnreverse = 0237,
|
|
|
187 Bsetcar = 0240,
|
|
|
188 Bsetcdr = 0241,
|
|
|
189 Bcar_safe = 0242,
|
|
|
190 Bcdr_safe = 0243,
|
|
|
191 Bnconc = 0244,
|
|
|
192 Bquo = 0245,
|
|
|
193 Brem = 0246,
|
|
|
194 Bnumberp = 0247,
|
|
|
195 Bintegerp = 0250,
|
|
|
196
|
|
|
197 BRgoto = 0252,
|
|
|
198 BRgotoifnil = 0253,
|
|
|
199 BRgotoifnonnil = 0254,
|
|
|
200 BRgotoifnilelsepop = 0255,
|
|
|
201 BRgotoifnonnilelsepop = 0256,
|
|
|
202
|
|
|
203 BlistN = 0257,
|
|
|
204 BconcatN = 0260,
|
|
|
205 BinsertN = 0261,
|
|
|
206 Bmember = 0266, /* new in v20 */
|
|
|
207 Bassq = 0267, /* new in v20 */
|
|
|
208
|
|
|
209 Bconstant = 0300
|
|
|
210 };
|
|
|
211 typedef enum Opcode Opcode;
|
|
|
212
|
|
|
213
|
|
|
214 Lisp_Object * execute_rare_opcode (Lisp_Object *stack_ptr,
|
|
442
|
215 const Opbyte *program_ptr,
|
|
428
|
216 Opcode opcode);
|
|
|
217
|
|
|
218 /* Define BYTE_CODE_METER to enable generation of a byte-op usage histogram.
|
|
|
219 This isn't defined in FSF Emacs and isn't defined in XEmacs v19. */
|
|
|
220 /* #define BYTE_CODE_METER */
|
|
|
221
|
|
|
222
|
|
|
223 #ifdef BYTE_CODE_METER
|
|
|
224
|
|
|
225 Lisp_Object Vbyte_code_meter, Qbyte_code_meter;
|
|
|
226 int byte_metering_on;
|
|
|
227
|
|
|
228 static void
|
|
|
229 meter_code (Opcode prev_opcode, Opcode this_opcode)
|
|
|
230 {
|
|
|
231 if (byte_metering_on)
|
|
|
232 {
|
|
|
233 Lisp_Object *p = XVECTOR_DATA (XVECTOR_DATA (Vbyte_code_meter)[this_opcode]);
|
|
|
234 p[0] = INT_PLUS1 (p[0]);
|
|
|
235 if (prev_opcode)
|
|
|
236 p[prev_opcode] = INT_PLUS1 (p[prev_opcode]);
|
|
|
237 }
|
|
|
238 }
|
|
|
239
|
|
|
240 #endif /* BYTE_CODE_METER */
|
|
|
241
|
|
|
242
|
|
|
243 static Lisp_Object
|
|
|
244 bytecode_negate (Lisp_Object obj)
|
|
|
245 {
|
|
|
246 retry:
|
|
|
247
|
|
|
248 if (INTP (obj)) return make_int (- XINT (obj));
|
|
|
249 #ifdef LISP_FLOAT_TYPE
|
|
|
250 if (FLOATP (obj)) return make_float (- XFLOAT_DATA (obj));
|
|
|
251 #endif
|
|
|
252 if (CHARP (obj)) return make_int (- ((int) XCHAR (obj)));
|
|
|
253 if (MARKERP (obj)) return make_int (- ((int) marker_position (obj)));
|
|
|
254
|
|
|
255 obj = wrong_type_argument (Qnumber_char_or_marker_p, obj);
|
|
|
256 goto retry;
|
|
|
257 }
|
|
|
258
|
|
|
259 static Lisp_Object
|
|
|
260 bytecode_nreverse (Lisp_Object list)
|
|
|
261 {
|
|
|
262 REGISTER Lisp_Object prev = Qnil;
|
|
|
263 REGISTER Lisp_Object tail = list;
|
|
|
264
|
|
|
265 while (!NILP (tail))
|
|
|
266 {
|
|
|
267 REGISTER Lisp_Object next;
|
|
|
268 CHECK_CONS (tail);
|
|
|
269 next = XCDR (tail);
|
|
|
270 XCDR (tail) = prev;
|
|
|
271 prev = tail;
|
|
|
272 tail = next;
|
|
|
273 }
|
|
|
274 return prev;
|
|
|
275 }
|
|
|
276
|
|
|
277
|
|
|
278 /* We have our own two-argument versions of various arithmetic ops.
|
|
|
279 Only two-argument arithmetic operations have their own byte codes. */
|
|
|
280 static int
|
|
|
281 bytecode_arithcompare (Lisp_Object obj1, Lisp_Object obj2)
|
|
|
282 {
|
|
|
283 retry:
|
|
|
284
|
|
|
285 #ifdef LISP_FLOAT_TYPE
|
|
|
286 {
|
|
|
287 EMACS_INT ival1, ival2;
|
|
|
288
|
|
|
289 if (INTP (obj1)) ival1 = XINT (obj1);
|
|
|
290 else if (CHARP (obj1)) ival1 = XCHAR (obj1);
|
|
|
291 else if (MARKERP (obj1)) ival1 = marker_position (obj1);
|
|
|
292 else goto arithcompare_float;
|
|
|
293
|
|
|
294 if (INTP (obj2)) ival2 = XINT (obj2);
|
|
|
295 else if (CHARP (obj2)) ival2 = XCHAR (obj2);
|
|
|
296 else if (MARKERP (obj2)) ival2 = marker_position (obj2);
|
|
|
297 else goto arithcompare_float;
|
|
|
298
|
|
|
299 return ival1 < ival2 ? -1 : ival1 > ival2 ? 1 : 0;
|
|
|
300 }
|
|
|
301
|
|
|
302 arithcompare_float:
|
|
|
303
|
|
|
304 {
|
|
|
305 double dval1, dval2;
|
|
|
306
|
|
|
307 if (FLOATP (obj1)) dval1 = XFLOAT_DATA (obj1);
|
|
|
308 else if (INTP (obj1)) dval1 = (double) XINT (obj1);
|
|
|
309 else if (CHARP (obj1)) dval1 = (double) XCHAR (obj1);
|
|
|
310 else if (MARKERP (obj1)) dval1 = (double) marker_position (obj1);
|
|
|
311 else
|
|
|
312 {
|
|
|
313 obj1 = wrong_type_argument (Qnumber_char_or_marker_p, obj1);
|
|
|
314 goto retry;
|
|
|
315 }
|
|
|
316
|
|
|
317 if (FLOATP (obj2)) dval2 = XFLOAT_DATA (obj2);
|
|
|
318 else if (INTP (obj2)) dval2 = (double) XINT (obj2);
|
|
|
319 else if (CHARP (obj2)) dval2 = (double) XCHAR (obj2);
|
|
|
320 else if (MARKERP (obj2)) dval2 = (double) marker_position (obj2);
|
|
|
321 else
|
|
|
322 {
|
|
|
323 obj2 = wrong_type_argument (Qnumber_char_or_marker_p, obj2);
|
|
|
324 goto retry;
|
|
|
325 }
|
|
|
326
|
|
|
327 return dval1 < dval2 ? -1 : dval1 > dval2 ? 1 : 0;
|
|
|
328 }
|
|
|
329 #else /* !LISP_FLOAT_TYPE */
|
|
|
330 {
|
|
|
331 EMACS_INT ival1, ival2;
|
|
|
332
|
|
|
333 if (INTP (obj1)) ival1 = XINT (obj1);
|
|
|
334 else if (CHARP (obj1)) ival1 = XCHAR (obj1);
|
|
|
335 else if (MARKERP (obj1)) ival1 = marker_position (obj1);
|
|
|
336 else
|
|
|
337 {
|
|
|
338 obj1 = wrong_type_argument (Qnumber_char_or_marker_p, obj1);
|
|
|
339 goto retry;
|
|
|
340 }
|
|
|
341
|
|
|
342 if (INTP (obj2)) ival2 = XINT (obj2);
|
|
|
343 else if (CHARP (obj2)) ival2 = XCHAR (obj2);
|
|
|
344 else if (MARKERP (obj2)) ival2 = marker_position (obj2);
|
|
|
345 else
|
|
|
346 {
|
|
|
347 obj2 = wrong_type_argument (Qnumber_char_or_marker_p, obj2);
|
|
|
348 goto retry;
|
|
|
349 }
|
|
|
350
|
|
|
351 return ival1 < ival2 ? -1 : ival1 > ival2 ? 1 : 0;
|
|
|
352 }
|
|
|
353 #endif /* !LISP_FLOAT_TYPE */
|
|
|
354 }
|
|
|
355
|
|
|
356 static Lisp_Object
|
|
|
357 bytecode_arithop (Lisp_Object obj1, Lisp_Object obj2, Opcode opcode)
|
|
|
358 {
|
|
|
359 #ifdef LISP_FLOAT_TYPE
|
|
|
360 EMACS_INT ival1, ival2;
|
|
|
361 int float_p;
|
|
|
362
|
|
|
363 retry:
|
|
|
364
|
|
|
365 float_p = 0;
|
|
|
366
|
|
|
367 if (INTP (obj1)) ival1 = XINT (obj1);
|
|
|
368 else if (CHARP (obj1)) ival1 = XCHAR (obj1);
|
|
|
369 else if (MARKERP (obj1)) ival1 = marker_position (obj1);
|
|
|
370 else if (FLOATP (obj1)) ival1 = 0, float_p = 1;
|
|
|
371 else
|
|
|
372 {
|
|
|
373 obj1 = wrong_type_argument (Qnumber_char_or_marker_p, obj1);
|
|
|
374 goto retry;
|
|
|
375 }
|
|
|
376
|
|
|
377 if (INTP (obj2)) ival2 = XINT (obj2);
|
|
|
378 else if (CHARP (obj2)) ival2 = XCHAR (obj2);
|
|
|
379 else if (MARKERP (obj2)) ival2 = marker_position (obj2);
|
|
|
380 else if (FLOATP (obj2)) ival2 = 0, float_p = 1;
|
|
|
381 else
|
|
|
382 {
|
|
|
383 obj2 = wrong_type_argument (Qnumber_char_or_marker_p, obj2);
|
|
|
384 goto retry;
|
|
|
385 }
|
|
|
386
|
|
|
387 if (!float_p)
|
|
|
388 {
|
|
|
389 switch (opcode)
|
|
|
390 {
|
|
|
391 case Bplus: ival1 += ival2; break;
|
|
|
392 case Bdiff: ival1 -= ival2; break;
|
|
|
393 case Bmult: ival1 *= ival2; break;
|
|
|
394 case Bquo:
|
|
|
395 if (ival2 == 0) Fsignal (Qarith_error, Qnil);
|
|
|
396 ival1 /= ival2;
|
|
|
397 break;
|
|
|
398 case Bmax: if (ival1 < ival2) ival1 = ival2; break;
|
|
|
399 case Bmin: if (ival1 > ival2) ival1 = ival2; break;
|
|
|
400 }
|
|
|
401 return make_int (ival1);
|
|
|
402 }
|
|
|
403 else
|
|
|
404 {
|
|
|
405 double dval1 = FLOATP (obj1) ? XFLOAT_DATA (obj1) : (double) ival1;
|
|
|
406 double dval2 = FLOATP (obj2) ? XFLOAT_DATA (obj2) : (double) ival2;
|
|
|
407 switch (opcode)
|
|
|
408 {
|
|
|
409 case Bplus: dval1 += dval2; break;
|
|
|
410 case Bdiff: dval1 -= dval2; break;
|
|
|
411 case Bmult: dval1 *= dval2; break;
|
|
|
412 case Bquo:
|
|
|
413 if (dval2 == 0) Fsignal (Qarith_error, Qnil);
|
|
|
414 dval1 /= dval2;
|
|
|
415 break;
|
|
|
416 case Bmax: if (dval1 < dval2) dval1 = dval2; break;
|
|
|
417 case Bmin: if (dval1 > dval2) dval1 = dval2; break;
|
|
|
418 }
|
|
|
419 return make_float (dval1);
|
|
|
420 }
|
|
|
421 #else /* !LISP_FLOAT_TYPE */
|
|
|
422 EMACS_INT ival1, ival2;
|
|
|
423
|
|
|
424 retry:
|
|
|
425
|
|
|
426 if (INTP (obj1)) ival1 = XINT (obj1);
|
|
|
427 else if (CHARP (obj1)) ival1 = XCHAR (obj1);
|
|
|
428 else if (MARKERP (obj1)) ival1 = marker_position (obj1);
|
|
|
429 else
|
|
|
430 {
|
|
|
431 obj1 = wrong_type_argument (Qnumber_char_or_marker_p, obj1);
|
|
|
432 goto retry;
|
|
|
433 }
|
|
|
434
|
|
|
435 if (INTP (obj2)) ival2 = XINT (obj2);
|
|
|
436 else if (CHARP (obj2)) ival2 = XCHAR (obj2);
|
|
|
437 else if (MARKERP (obj2)) ival2 = marker_position (obj2);
|
|
|
438 else
|
|
|
439 {
|
|
|
440 obj2 = wrong_type_argument (Qnumber_char_or_marker_p, obj2);
|
|
|
441 goto retry;
|
|
|
442 }
|
|
|
443
|
|
|
444 switch (opcode)
|
|
|
445 {
|
|
|
446 case Bplus: ival1 += ival2; break;
|
|
|
447 case Bdiff: ival1 -= ival2; break;
|
|
|
448 case Bmult: ival1 *= ival2; break;
|
|
|
449 case Bquo:
|
|
|
450 if (ival2 == 0) Fsignal (Qarith_error, Qnil);
|
|
|
451 ival1 /= ival2;
|
|
|
452 break;
|
|
|
453 case Bmax: if (ival1 < ival2) ival1 = ival2; break;
|
|
|
454 case Bmin: if (ival1 > ival2) ival1 = ival2; break;
|
|
|
455 }
|
|
|
456 return make_int (ival1);
|
|
|
457 #endif /* !LISP_FLOAT_TYPE */
|
|
|
458 }
|
|
|
459
|
|
|
460
|
|
|
461 /* Read next uint8 from the instruction stream. */
|
|
|
462 #define READ_UINT_1 ((unsigned int) (unsigned char) *program_ptr++)
|
|
|
463
|
|
|
464 /* Read next uint16 from the instruction stream. */
|
|
|
465 #define READ_UINT_2 \
|
|
|
466 (program_ptr += 2, \
|
|
|
467 (((unsigned int) (unsigned char) program_ptr[-1]) * 256 + \
|
|
|
468 ((unsigned int) (unsigned char) program_ptr[-2])))
|
|
|
469
|
|
|
470 /* Read next int8 from the instruction stream. */
|
|
|
471 #define READ_INT_1 ((int) (signed char) *program_ptr++)
|
|
|
472
|
|
|
473 /* Read next int16 from the instruction stream. */
|
|
|
474 #define READ_INT_2 \
|
|
|
475 (program_ptr += 2, \
|
|
|
476 (((int) ( signed char) program_ptr[-1]) * 256 + \
|
|
|
477 ((int) (unsigned char) program_ptr[-2])))
|
|
|
478
|
|
|
479 /* Read next int8 from instruction stream; don't advance program_pointer */
|
|
|
480 #define PEEK_INT_1 ((int) (signed char) program_ptr[0])
|
|
|
481
|
|
|
482 /* Read next int16 from instruction stream; don't advance program_pointer */
|
|
|
483 #define PEEK_INT_2 \
|
|
|
484 ((((int) ( signed char) program_ptr[1]) * 256) | \
|
|
|
485 ((int) (unsigned char) program_ptr[0]))
|
|
|
486
|
|
|
487 /* Do relative jumps from the current location.
|
|
|
488 We only do a QUIT if we jump backwards, for efficiency.
|
|
|
489 No infloops without backward jumps! */
|
|
|
490 #define JUMP_RELATIVE(jump) do { \
|
|
|
491 int JR_jump = (jump); \
|
|
|
492 if (JR_jump < 0) QUIT; \
|
|
|
493 program_ptr += JR_jump; \
|
|
|
494 } while (0)
|
|
|
495
|
|
|
496 #define JUMP JUMP_RELATIVE (PEEK_INT_2)
|
|
|
497 #define JUMPR JUMP_RELATIVE (PEEK_INT_1)
|
|
|
498
|
|
|
499 #define JUMP_NEXT ((void) (program_ptr += 2))
|
|
|
500 #define JUMPR_NEXT ((void) (program_ptr += 1))
|
|
|
501
|
|
|
502 /* Push x onto the execution stack. */
|
|
|
503 #define PUSH(x) (*++stack_ptr = (x))
|
|
|
504
|
|
|
505 /* Pop a value off the execution stack. */
|
|
|
506 #define POP (*stack_ptr--)
|
|
|
507
|
|
|
508 /* Discard n values from the execution stack. */
|
|
|
509 #define DISCARD(n) (stack_ptr -= (n))
|
|
|
510
|
|
|
511 /* Get the value which is at the top of the execution stack,
|
|
|
512 but don't pop it. */
|
|
|
513 #define TOP (*stack_ptr)
|
|
|
514
|
|
|
515 /* The actual interpreter for byte code.
|
|
|
516 This function has been seriously optimized for performance.
|
|
|
517 Don't change the constructs unless you are willing to do
|
|
|
518 real benchmarking and profiling work -- martin */
|
|
|
519
|
|
|
520
|
|
814
|
521 Lisp_Object
|
|
442
|
522 execute_optimized_program (const Opbyte *program,
|
|
428
|
523 int stack_depth,
|
|
|
524 Lisp_Object *constants_data)
|
|
|
525 {
|
|
|
526 /* This function can GC */
|
|
442
|
527 REGISTER const Opbyte *program_ptr = (Opbyte *) program;
|
|
428
|
528 REGISTER Lisp_Object *stack_ptr
|
|
|
529 = alloca_array (Lisp_Object, stack_depth + 1);
|
|
|
530 int speccount = specpdl_depth ();
|
|
|
531 struct gcpro gcpro1;
|
|
|
532
|
|
|
533 #ifdef BYTE_CODE_METER
|
|
|
534 Opcode this_opcode = 0;
|
|
|
535 Opcode prev_opcode;
|
|
|
536 #endif
|
|
|
537
|
|
|
538 #ifdef ERROR_CHECK_BYTE_CODE
|
|
|
539 Lisp_Object *stack_beg = stack_ptr;
|
|
|
540 Lisp_Object *stack_end = stack_beg + stack_depth;
|
|
|
541 #endif
|
|
|
542
|
|
|
543 /* Initialize all the objects on the stack to Qnil,
|
|
|
544 so we can GCPRO the whole stack.
|
|
|
545 The first element of the stack is actually a dummy. */
|
|
|
546 {
|
|
|
547 int i;
|
|
|
548 Lisp_Object *p;
|
|
|
549 for (i = stack_depth, p = stack_ptr; i--;)
|
|
|
550 *++p = Qnil;
|
|
|
551 }
|
|
|
552
|
|
|
553 GCPRO1 (stack_ptr[1]);
|
|
|
554 gcpro1.nvars = stack_depth;
|
|
|
555
|
|
|
556 while (1)
|
|
|
557 {
|
|
|
558 REGISTER Opcode opcode = (Opcode) READ_UINT_1;
|
|
|
559 #ifdef ERROR_CHECK_BYTE_CODE
|
|
|
560 if (stack_ptr > stack_end)
|
|
563
|
561 stack_overflow ("byte code stack overflow", Qunbound);
|
|
428
|
562 if (stack_ptr < stack_beg)
|
|
563
|
563 stack_overflow ("byte code stack underflow", Qunbound);
|
|
428
|
564 #endif
|
|
|
565
|
|
|
566 #ifdef BYTE_CODE_METER
|
|
|
567 prev_opcode = this_opcode;
|
|
|
568 this_opcode = opcode;
|
|
|
569 meter_code (prev_opcode, this_opcode);
|
|
|
570 #endif
|
|
|
571
|
|
|
572 switch (opcode)
|
|
|
573 {
|
|
|
574 REGISTER int n;
|
|
|
575
|
|
|
576 default:
|
|
|
577 if (opcode >= Bconstant)
|
|
|
578 PUSH (constants_data[opcode - Bconstant]);
|
|
|
579 else
|
|
|
580 stack_ptr = execute_rare_opcode (stack_ptr, program_ptr, opcode);
|
|
|
581 break;
|
|
|
582
|
|
|
583 case Bvarref:
|
|
|
584 case Bvarref+1:
|
|
|
585 case Bvarref+2:
|
|
|
586 case Bvarref+3:
|
|
|
587 case Bvarref+4:
|
|
|
588 case Bvarref+5: n = opcode - Bvarref; goto do_varref;
|
|
|
589 case Bvarref+7: n = READ_UINT_2; goto do_varref;
|
|
|
590 case Bvarref+6: n = READ_UINT_1; /* most common */
|
|
|
591 do_varref:
|
|
|
592 {
|
|
|
593 Lisp_Object symbol = constants_data[n];
|
|
|
594 Lisp_Object value = XSYMBOL (symbol)->value;
|
|
|
595 if (SYMBOL_VALUE_MAGIC_P (value))
|
|
|
596 value = Fsymbol_value (symbol);
|
|
|
597 PUSH (value);
|
|
|
598 break;
|
|
|
599 }
|
|
|
600
|
|
|
601 case Bvarset:
|
|
|
602 case Bvarset+1:
|
|
|
603 case Bvarset+2:
|
|
|
604 case Bvarset+3:
|
|
|
605 case Bvarset+4:
|
|
|
606 case Bvarset+5: n = opcode - Bvarset; goto do_varset;
|
|
|
607 case Bvarset+7: n = READ_UINT_2; goto do_varset;
|
|
|
608 case Bvarset+6: n = READ_UINT_1; /* most common */
|
|
|
609 do_varset:
|
|
|
610 {
|
|
|
611 Lisp_Object symbol = constants_data[n];
|
|
440
|
612 Lisp_Symbol *symbol_ptr = XSYMBOL (symbol);
|
|
428
|
613 Lisp_Object old_value = symbol_ptr->value;
|
|
|
614 Lisp_Object new_value = POP;
|
|
|
615 if (!SYMBOL_VALUE_MAGIC_P (old_value) || UNBOUNDP (old_value))
|
|
|
616 symbol_ptr->value = new_value;
|
|
|
617 else
|
|
|
618 Fset (symbol, new_value);
|
|
|
619 break;
|
|
|
620 }
|
|
|
621
|
|
|
622 case Bvarbind:
|
|
|
623 case Bvarbind+1:
|
|
|
624 case Bvarbind+2:
|
|
|
625 case Bvarbind+3:
|
|
|
626 case Bvarbind+4:
|
|
|
627 case Bvarbind+5: n = opcode - Bvarbind; goto do_varbind;
|
|
|
628 case Bvarbind+7: n = READ_UINT_2; goto do_varbind;
|
|
|
629 case Bvarbind+6: n = READ_UINT_1; /* most common */
|
|
|
630 do_varbind:
|
|
|
631 {
|
|
|
632 Lisp_Object symbol = constants_data[n];
|
|
440
|
633 Lisp_Symbol *symbol_ptr = XSYMBOL (symbol);
|
|
428
|
634 Lisp_Object old_value = symbol_ptr->value;
|
|
|
635 Lisp_Object new_value = POP;
|
|
|
636 if (!SYMBOL_VALUE_MAGIC_P (old_value) || UNBOUNDP (old_value))
|
|
|
637 {
|
|
|
638 specpdl_ptr->symbol = symbol;
|
|
|
639 specpdl_ptr->old_value = old_value;
|
|
|
640 specpdl_ptr->func = 0;
|
|
|
641 specpdl_ptr++;
|
|
|
642 specpdl_depth_counter++;
|
|
|
643
|
|
|
644 symbol_ptr->value = new_value;
|
|
|
645 }
|
|
|
646 else
|
|
|
647 specbind_magic (symbol, new_value);
|
|
|
648 break;
|
|
|
649 }
|
|
|
650
|
|
|
651 case Bcall:
|
|
|
652 case Bcall+1:
|
|
|
653 case Bcall+2:
|
|
|
654 case Bcall+3:
|
|
|
655 case Bcall+4:
|
|
|
656 case Bcall+5:
|
|
|
657 case Bcall+6:
|
|
|
658 case Bcall+7:
|
|
|
659 n = (opcode < Bcall+6 ? opcode - Bcall :
|
|
|
660 opcode == Bcall+6 ? READ_UINT_1 : READ_UINT_2);
|
|
|
661 DISCARD (n);
|
|
|
662 #ifdef BYTE_CODE_METER
|
|
|
663 if (byte_metering_on && SYMBOLP (TOP))
|
|
|
664 {
|
|
|
665 Lisp_Object val = Fget (TOP, Qbyte_code_meter, Qnil);
|
|
|
666 if (INTP (val))
|
|
|
667 Fput (TOP, Qbyte_code_meter, make_int (XINT (val) + 1));
|
|
|
668 }
|
|
|
669 #endif
|
|
|
670 TOP = Ffuncall (n + 1, &TOP);
|
|
|
671 break;
|
|
|
672
|
|
|
673 case Bunbind:
|
|
|
674 case Bunbind+1:
|
|
|
675 case Bunbind+2:
|
|
|
676 case Bunbind+3:
|
|
|
677 case Bunbind+4:
|
|
|
678 case Bunbind+5:
|
|
|
679 case Bunbind+6:
|
|
|
680 case Bunbind+7:
|
|
|
681 UNBIND_TO (specpdl_depth() -
|
|
|
682 (opcode < Bunbind+6 ? opcode-Bunbind :
|
|
|
683 opcode == Bunbind+6 ? READ_UINT_1 : READ_UINT_2));
|
|
|
684 break;
|
|
|
685
|
|
|
686
|
|
|
687 case Bgoto:
|
|
|
688 JUMP;
|
|
|
689 break;
|
|
|
690
|
|
|
691 case Bgotoifnil:
|
|
|
692 if (NILP (POP))
|
|
|
693 JUMP;
|
|
|
694 else
|
|
|
695 JUMP_NEXT;
|
|
|
696 break;
|
|
|
697
|
|
|
698 case Bgotoifnonnil:
|
|
|
699 if (!NILP (POP))
|
|
|
700 JUMP;
|
|
|
701 else
|
|
|
702 JUMP_NEXT;
|
|
|
703 break;
|
|
|
704
|
|
|
705 case Bgotoifnilelsepop:
|
|
|
706 if (NILP (TOP))
|
|
|
707 JUMP;
|
|
|
708 else
|
|
|
709 {
|
|
|
710 DISCARD (1);
|
|
|
711 JUMP_NEXT;
|
|
|
712 }
|
|
|
713 break;
|
|
|
714
|
|
|
715 case Bgotoifnonnilelsepop:
|
|
|
716 if (!NILP (TOP))
|
|
|
717 JUMP;
|
|
|
718 else
|
|
|
719 {
|
|
|
720 DISCARD (1);
|
|
|
721 JUMP_NEXT;
|
|
|
722 }
|
|
|
723 break;
|
|
|
724
|
|
|
725
|
|
|
726 case BRgoto:
|
|
|
727 JUMPR;
|
|
|
728 break;
|
|
|
729
|
|
|
730 case BRgotoifnil:
|
|
|
731 if (NILP (POP))
|
|
|
732 JUMPR;
|
|
|
733 else
|
|
|
734 JUMPR_NEXT;
|
|
|
735 break;
|
|
|
736
|
|
|
737 case BRgotoifnonnil:
|
|
|
738 if (!NILP (POP))
|
|
|
739 JUMPR;
|
|
|
740 else
|
|
|
741 JUMPR_NEXT;
|
|
|
742 break;
|
|
|
743
|
|
|
744 case BRgotoifnilelsepop:
|
|
|
745 if (NILP (TOP))
|
|
|
746 JUMPR;
|
|
|
747 else
|
|
|
748 {
|
|
|
749 DISCARD (1);
|
|
|
750 JUMPR_NEXT;
|
|
|
751 }
|
|
|
752 break;
|
|
|
753
|
|
|
754 case BRgotoifnonnilelsepop:
|
|
|
755 if (!NILP (TOP))
|
|
|
756 JUMPR;
|
|
|
757 else
|
|
|
758 {
|
|
|
759 DISCARD (1);
|
|
|
760 JUMPR_NEXT;
|
|
|
761 }
|
|
|
762 break;
|
|
|
763
|
|
|
764 case Breturn:
|
|
|
765 UNGCPRO;
|
|
|
766 #ifdef ERROR_CHECK_BYTE_CODE
|
|
|
767 /* Binds and unbinds are supposed to be compiled balanced. */
|
|
|
768 if (specpdl_depth() != speccount)
|
|
563
|
769 invalid_byte_code ("unbalanced specbinding stack", Qunbound);
|
|
428
|
770 #endif
|
|
|
771 return TOP;
|
|
|
772
|
|
|
773 case Bdiscard:
|
|
|
774 DISCARD (1);
|
|
|
775 break;
|
|
|
776
|
|
|
777 case Bdup:
|
|
|
778 {
|
|
|
779 Lisp_Object arg = TOP;
|
|
|
780 PUSH (arg);
|
|
|
781 break;
|
|
|
782 }
|
|
|
783
|
|
|
784 case Bconstant2:
|
|
|
785 PUSH (constants_data[READ_UINT_2]);
|
|
|
786 break;
|
|
|
787
|
|
|
788 case Bcar:
|
|
|
789 TOP = CONSP (TOP) ? XCAR (TOP) : Fcar (TOP);
|
|
|
790 break;
|
|
|
791
|
|
|
792 case Bcdr:
|
|
|
793 TOP = CONSP (TOP) ? XCDR (TOP) : Fcdr (TOP);
|
|
|
794 break;
|
|
|
795
|
|
|
796
|
|
|
797 case Bunbind_all:
|
|
|
798 /* To unbind back to the beginning of this frame. Not used yet,
|
|
|
799 but will be needed for tail-recursion elimination. */
|
|
771
|
800 unbind_to (speccount);
|
|
428
|
801 break;
|
|
|
802
|
|
|
803 case Bnth:
|
|
|
804 {
|
|
|
805 Lisp_Object arg = POP;
|
|
|
806 TOP = Fcar (Fnthcdr (TOP, arg));
|
|
|
807 break;
|
|
|
808 }
|
|
|
809
|
|
|
810 case Bsymbolp:
|
|
|
811 TOP = SYMBOLP (TOP) ? Qt : Qnil;
|
|
|
812 break;
|
|
|
813
|
|
|
814 case Bconsp:
|
|
|
815 TOP = CONSP (TOP) ? Qt : Qnil;
|
|
|
816 break;
|
|
|
817
|
|
|
818 case Bstringp:
|
|
|
819 TOP = STRINGP (TOP) ? Qt : Qnil;
|
|
|
820 break;
|
|
|
821
|
|
|
822 case Blistp:
|
|
|
823 TOP = LISTP (TOP) ? Qt : Qnil;
|
|
|
824 break;
|
|
|
825
|
|
|
826 case Bnumberp:
|
|
|
827 TOP = INT_OR_FLOATP (TOP) ? Qt : Qnil;
|
|
|
828 break;
|
|
|
829
|
|
|
830 case Bintegerp:
|
|
|
831 TOP = INTP (TOP) ? Qt : Qnil;
|
|
|
832 break;
|
|
|
833
|
|
|
834 case Beq:
|
|
|
835 {
|
|
|
836 Lisp_Object arg = POP;
|
|
|
837 TOP = EQ_WITH_EBOLA_NOTICE (TOP, arg) ? Qt : Qnil;
|
|
|
838 break;
|
|
|
839 }
|
|
|
840
|
|
|
841 case Bnot:
|
|
|
842 TOP = NILP (TOP) ? Qt : Qnil;
|
|
|
843 break;
|
|
|
844
|
|
|
845 case Bcons:
|
|
|
846 {
|
|
|
847 Lisp_Object arg = POP;
|
|
|
848 TOP = Fcons (TOP, arg);
|
|
|
849 break;
|
|
|
850 }
|
|
|
851
|
|
|
852 case Blist1:
|
|
|
853 TOP = Fcons (TOP, Qnil);
|
|
|
854 break;
|
|
|
855
|
|
|
856
|
|
|
857 case BlistN:
|
|
|
858 n = READ_UINT_1;
|
|
|
859 goto do_list;
|
|
|
860
|
|
|
861 case Blist2:
|
|
|
862 case Blist3:
|
|
|
863 case Blist4:
|
|
|
864 /* common case */
|
|
|
865 n = opcode - (Blist1 - 1);
|
|
|
866 do_list:
|
|
|
867 {
|
|
|
868 Lisp_Object list = Qnil;
|
|
|
869 list_loop:
|
|
|
870 list = Fcons (TOP, list);
|
|
|
871 if (--n)
|
|
|
872 {
|
|
|
873 DISCARD (1);
|
|
|
874 goto list_loop;
|
|
|
875 }
|
|
|
876 TOP = list;
|
|
|
877 break;
|
|
|
878 }
|
|
|
879
|
|
|
880
|
|
|
881 case Bconcat2:
|
|
|
882 case Bconcat3:
|
|
|
883 case Bconcat4:
|
|
|
884 n = opcode - (Bconcat2 - 2);
|
|
|
885 goto do_concat;
|
|
|
886
|
|
|
887 case BconcatN:
|
|
|
888 /* common case */
|
|
|
889 n = READ_UINT_1;
|
|
|
890 do_concat:
|
|
|
891 DISCARD (n - 1);
|
|
|
892 TOP = Fconcat (n, &TOP);
|
|
|
893 break;
|
|
|
894
|
|
|
895
|
|
|
896 case Blength:
|
|
|
897 TOP = Flength (TOP);
|
|
|
898 break;
|
|
|
899
|
|
|
900 case Baset:
|
|
|
901 {
|
|
|
902 Lisp_Object arg2 = POP;
|
|
|
903 Lisp_Object arg1 = POP;
|
|
|
904 TOP = Faset (TOP, arg1, arg2);
|
|
|
905 break;
|
|
|
906 }
|
|
|
907
|
|
|
908 case Bsymbol_value:
|
|
|
909 TOP = Fsymbol_value (TOP);
|
|
|
910 break;
|
|
|
911
|
|
|
912 case Bsymbol_function:
|
|
|
913 TOP = Fsymbol_function (TOP);
|
|
|
914 break;
|
|
|
915
|
|
|
916 case Bget:
|
|
|
917 {
|
|
|
918 Lisp_Object arg = POP;
|
|
|
919 TOP = Fget (TOP, arg, Qnil);
|
|
|
920 break;
|
|
|
921 }
|
|
|
922
|
|
|
923 case Bsub1:
|
|
|
924 TOP = INTP (TOP) ? INT_MINUS1 (TOP) : Fsub1 (TOP);
|
|
|
925 break;
|
|
|
926
|
|
|
927 case Badd1:
|
|
|
928 TOP = INTP (TOP) ? INT_PLUS1 (TOP) : Fadd1 (TOP);
|
|
|
929 break;
|
|
|
930
|
|
|
931
|
|
|
932 case Beqlsign:
|
|
|
933 {
|
|
|
934 Lisp_Object arg = POP;
|
|
|
935 TOP = bytecode_arithcompare (TOP, arg) == 0 ? Qt : Qnil;
|
|
|
936 break;
|
|
|
937 }
|
|
|
938
|
|
|
939 case Bgtr:
|
|
|
940 {
|
|
|
941 Lisp_Object arg = POP;
|
|
|
942 TOP = bytecode_arithcompare (TOP, arg) > 0 ? Qt : Qnil;
|
|
|
943 break;
|
|
|
944 }
|
|
|
945
|
|
|
946 case Blss:
|
|
|
947 {
|
|
|
948 Lisp_Object arg = POP;
|
|
|
949 TOP = bytecode_arithcompare (TOP, arg) < 0 ? Qt : Qnil;
|
|
|
950 break;
|
|
|
951 }
|
|
|
952
|
|
|
953 case Bleq:
|
|
|
954 {
|
|
|
955 Lisp_Object arg = POP;
|
|
|
956 TOP = bytecode_arithcompare (TOP, arg) <= 0 ? Qt : Qnil;
|
|
|
957 break;
|
|
|
958 }
|
|
|
959
|
|
|
960 case Bgeq:
|
|
|
961 {
|
|
|
962 Lisp_Object arg = POP;
|
|
|
963 TOP = bytecode_arithcompare (TOP, arg) >= 0 ? Qt : Qnil;
|
|
|
964 break;
|
|
|
965 }
|
|
|
966
|
|
|
967
|
|
|
968 case Bnegate:
|
|
|
969 TOP = bytecode_negate (TOP);
|
|
|
970 break;
|
|
|
971
|
|
|
972 case Bnconc:
|
|
|
973 DISCARD (1);
|
|
|
974 TOP = bytecode_nconc2 (&TOP);
|
|
|
975 break;
|
|
|
976
|
|
|
977 case Bplus:
|
|
|
978 {
|
|
|
979 Lisp_Object arg2 = POP;
|
|
|
980 Lisp_Object arg1 = TOP;
|
|
|
981 TOP = INTP (arg1) && INTP (arg2) ?
|
|
|
982 INT_PLUS (arg1, arg2) :
|
|
|
983 bytecode_arithop (arg1, arg2, opcode);
|
|
|
984 break;
|
|
|
985 }
|
|
|
986
|
|
|
987 case Bdiff:
|
|
|
988 {
|
|
|
989 Lisp_Object arg2 = POP;
|
|
|
990 Lisp_Object arg1 = TOP;
|
|
|
991 TOP = INTP (arg1) && INTP (arg2) ?
|
|
|
992 INT_MINUS (arg1, arg2) :
|
|
|
993 bytecode_arithop (arg1, arg2, opcode);
|
|
|
994 break;
|
|
|
995 }
|
|
|
996
|
|
|
997 case Bmult:
|
|
|
998 case Bquo:
|
|
|
999 case Bmax:
|
|
|
1000 case Bmin:
|
|
|
1001 {
|
|
|
1002 Lisp_Object arg = POP;
|
|
|
1003 TOP = bytecode_arithop (TOP, arg, opcode);
|
|
|
1004 break;
|
|
|
1005 }
|
|
|
1006
|
|
|
1007 case Bpoint:
|
|
|
1008 PUSH (make_int (BUF_PT (current_buffer)));
|
|
|
1009 break;
|
|
|
1010
|
|
|
1011 case Binsert:
|
|
|
1012 TOP = Finsert (1, &TOP);
|
|
|
1013 break;
|
|
|
1014
|
|
|
1015 case BinsertN:
|
|
|
1016 n = READ_UINT_1;
|
|
|
1017 DISCARD (n - 1);
|
|
|
1018 TOP = Finsert (n, &TOP);
|
|
|
1019 break;
|
|
|
1020
|
|
|
1021 case Baref:
|
|
|
1022 {
|
|
|
1023 Lisp_Object arg = POP;
|
|
|
1024 TOP = Faref (TOP, arg);
|
|
|
1025 break;
|
|
|
1026 }
|
|
|
1027
|
|
|
1028 case Bmemq:
|
|
|
1029 {
|
|
|
1030 Lisp_Object arg = POP;
|
|
|
1031 TOP = Fmemq (TOP, arg);
|
|
|
1032 break;
|
|
|
1033 }
|
|
|
1034
|
|
|
1035 case Bset:
|
|
|
1036 {
|
|
|
1037 Lisp_Object arg = POP;
|
|
|
1038 TOP = Fset (TOP, arg);
|
|
|
1039 break;
|
|
|
1040 }
|
|
|
1041
|
|
|
1042 case Bequal:
|
|
|
1043 {
|
|
|
1044 Lisp_Object arg = POP;
|
|
|
1045 TOP = Fequal (TOP, arg);
|
|
|
1046 break;
|
|
|
1047 }
|
|
|
1048
|
|
|
1049 case Bnthcdr:
|
|
|
1050 {
|
|
|
1051 Lisp_Object arg = POP;
|
|
|
1052 TOP = Fnthcdr (TOP, arg);
|
|
|
1053 break;
|
|
|
1054 }
|
|
|
1055
|
|
|
1056 case Belt:
|
|
|
1057 {
|
|
|
1058 Lisp_Object arg = POP;
|
|
|
1059 TOP = Felt (TOP, arg);
|
|
|
1060 break;
|
|
|
1061 }
|
|
|
1062
|
|
|
1063 case Bmember:
|
|
|
1064 {
|
|
|
1065 Lisp_Object arg = POP;
|
|
|
1066 TOP = Fmember (TOP, arg);
|
|
|
1067 break;
|
|
|
1068 }
|
|
|
1069
|
|
|
1070 case Bgoto_char:
|
|
|
1071 TOP = Fgoto_char (TOP, Qnil);
|
|
|
1072 break;
|
|
|
1073
|
|
|
1074 case Bcurrent_buffer:
|
|
|
1075 {
|
|
793
|
1076 Lisp_Object buffer = wrap_buffer (current_buffer);
|
|
|
1077
|
|
428
|
1078 PUSH (buffer);
|
|
|
1079 break;
|
|
|
1080 }
|
|
|
1081
|
|
|
1082 case Bset_buffer:
|
|
|
1083 TOP = Fset_buffer (TOP);
|
|
|
1084 break;
|
|
|
1085
|
|
|
1086 case Bpoint_max:
|
|
|
1087 PUSH (make_int (BUF_ZV (current_buffer)));
|
|
|
1088 break;
|
|
|
1089
|
|
|
1090 case Bpoint_min:
|
|
|
1091 PUSH (make_int (BUF_BEGV (current_buffer)));
|
|
|
1092 break;
|
|
|
1093
|
|
|
1094 case Bskip_chars_forward:
|
|
|
1095 {
|
|
|
1096 Lisp_Object arg = POP;
|
|
|
1097 TOP = Fskip_chars_forward (TOP, arg, Qnil);
|
|
|
1098 break;
|
|
|
1099 }
|
|
|
1100
|
|
|
1101 case Bassq:
|
|
|
1102 {
|
|
|
1103 Lisp_Object arg = POP;
|
|
|
1104 TOP = Fassq (TOP, arg);
|
|
|
1105 break;
|
|
|
1106 }
|
|
|
1107
|
|
|
1108 case Bsetcar:
|
|
|
1109 {
|
|
|
1110 Lisp_Object arg = POP;
|
|
|
1111 TOP = Fsetcar (TOP, arg);
|
|
|
1112 break;
|
|
|
1113 }
|
|
|
1114
|
|
|
1115 case Bsetcdr:
|
|
|
1116 {
|
|
|
1117 Lisp_Object arg = POP;
|
|
|
1118 TOP = Fsetcdr (TOP, arg);
|
|
|
1119 break;
|
|
|
1120 }
|
|
|
1121
|
|
|
1122 case Bnreverse:
|
|
|
1123 TOP = bytecode_nreverse (TOP);
|
|
|
1124 break;
|
|
|
1125
|
|
|
1126 case Bcar_safe:
|
|
|
1127 TOP = CONSP (TOP) ? XCAR (TOP) : Qnil;
|
|
|
1128 break;
|
|
|
1129
|
|
|
1130 case Bcdr_safe:
|
|
|
1131 TOP = CONSP (TOP) ? XCDR (TOP) : Qnil;
|
|
|
1132 break;
|
|
|
1133
|
|
|
1134 }
|
|
|
1135 }
|
|
|
1136 }
|
|
|
1137
|
|
|
1138 /* It makes a worthwhile performance difference (5%) to shunt
|
|
|
1139 lesser-used opcodes off to a subroutine, to keep the switch in
|
|
|
1140 execute_optimized_program small. If you REALLY care about
|
|
|
1141 performance, you want to keep your heavily executed code away from
|
|
|
1142 rarely executed code, to minimize cache misses.
|
|
|
1143
|
|
|
1144 Don't make this function static, since then the compiler might inline it. */
|
|
|
1145 Lisp_Object *
|
|
|
1146 execute_rare_opcode (Lisp_Object *stack_ptr,
|
|
442
|
1147 const Opbyte *program_ptr,
|
|
428
|
1148 Opcode opcode)
|
|
|
1149 {
|
|
|
1150 switch (opcode)
|
|
|
1151 {
|
|
|
1152
|
|
|
1153 case Bsave_excursion:
|
|
|
1154 record_unwind_protect (save_excursion_restore,
|
|
|
1155 save_excursion_save ());
|
|
|
1156 break;
|
|
|
1157
|
|
|
1158 case Bsave_window_excursion:
|
|
|
1159 {
|
|
|
1160 int count = specpdl_depth ();
|
|
|
1161 record_unwind_protect (save_window_excursion_unwind,
|
|
|
1162 Fcurrent_window_configuration (Qnil));
|
|
|
1163 TOP = Fprogn (TOP);
|
|
771
|
1164 unbind_to (count);
|
|
428
|
1165 break;
|
|
|
1166 }
|
|
|
1167
|
|
|
1168 case Bsave_restriction:
|
|
|
1169 record_unwind_protect (save_restriction_restore,
|
|
844
|
1170 save_restriction_save (current_buffer));
|
|
428
|
1171 break;
|
|
|
1172
|
|
|
1173 case Bcatch:
|
|
|
1174 {
|
|
|
1175 Lisp_Object arg = POP;
|
|
|
1176 TOP = internal_catch (TOP, Feval, arg, 0);
|
|
|
1177 break;
|
|
|
1178 }
|
|
|
1179
|
|
|
1180 case Bskip_chars_backward:
|
|
|
1181 {
|
|
|
1182 Lisp_Object arg = POP;
|
|
|
1183 TOP = Fskip_chars_backward (TOP, arg, Qnil);
|
|
|
1184 break;
|
|
|
1185 }
|
|
|
1186
|
|
|
1187 case Bunwind_protect:
|
|
|
1188 record_unwind_protect (Fprogn, POP);
|
|
|
1189 break;
|
|
|
1190
|
|
|
1191 case Bcondition_case:
|
|
|
1192 {
|
|
|
1193 Lisp_Object arg2 = POP; /* handlers */
|
|
|
1194 Lisp_Object arg1 = POP; /* bodyform */
|
|
|
1195 TOP = condition_case_3 (arg1, TOP, arg2);
|
|
|
1196 break;
|
|
|
1197 }
|
|
|
1198
|
|
|
1199 case Bset_marker:
|
|
|
1200 {
|
|
|
1201 Lisp_Object arg2 = POP;
|
|
|
1202 Lisp_Object arg1 = POP;
|
|
|
1203 TOP = Fset_marker (TOP, arg1, arg2);
|
|
|
1204 break;
|
|
|
1205 }
|
|
|
1206
|
|
|
1207 case Brem:
|
|
|
1208 {
|
|
|
1209 Lisp_Object arg = POP;
|
|
|
1210 TOP = Frem (TOP, arg);
|
|
|
1211 break;
|
|
|
1212 }
|
|
|
1213
|
|
|
1214 case Bmatch_beginning:
|
|
|
1215 TOP = Fmatch_beginning (TOP);
|
|
|
1216 break;
|
|
|
1217
|
|
|
1218 case Bmatch_end:
|
|
|
1219 TOP = Fmatch_end (TOP);
|
|
|
1220 break;
|
|
|
1221
|
|
|
1222 case Bupcase:
|
|
|
1223 TOP = Fupcase (TOP, Qnil);
|
|
|
1224 break;
|
|
|
1225
|
|
|
1226 case Bdowncase:
|
|
|
1227 TOP = Fdowncase (TOP, Qnil);
|
|
|
1228 break;
|
|
|
1229
|
|
|
1230 case Bfset:
|
|
|
1231 {
|
|
|
1232 Lisp_Object arg = POP;
|
|
|
1233 TOP = Ffset (TOP, arg);
|
|
|
1234 break;
|
|
|
1235 }
|
|
|
1236
|
|
|
1237 case Bstring_equal:
|
|
|
1238 {
|
|
|
1239 Lisp_Object arg = POP;
|
|
|
1240 TOP = Fstring_equal (TOP, arg);
|
|
|
1241 break;
|
|
|
1242 }
|
|
|
1243
|
|
|
1244 case Bstring_lessp:
|
|
|
1245 {
|
|
|
1246 Lisp_Object arg = POP;
|
|
|
1247 TOP = Fstring_lessp (TOP, arg);
|
|
|
1248 break;
|
|
|
1249 }
|
|
|
1250
|
|
|
1251 case Bsubstring:
|
|
|
1252 {
|
|
|
1253 Lisp_Object arg2 = POP;
|
|
|
1254 Lisp_Object arg1 = POP;
|
|
|
1255 TOP = Fsubstring (TOP, arg1, arg2);
|
|
|
1256 break;
|
|
|
1257 }
|
|
|
1258
|
|
|
1259 case Bcurrent_column:
|
|
|
1260 PUSH (make_int (current_column (current_buffer)));
|
|
|
1261 break;
|
|
|
1262
|
|
|
1263 case Bchar_after:
|
|
|
1264 TOP = Fchar_after (TOP, Qnil);
|
|
|
1265 break;
|
|
|
1266
|
|
|
1267 case Bindent_to:
|
|
|
1268 TOP = Findent_to (TOP, Qnil, Qnil);
|
|
|
1269 break;
|
|
|
1270
|
|
|
1271 case Bwiden:
|
|
|
1272 PUSH (Fwiden (Qnil));
|
|
|
1273 break;
|
|
|
1274
|
|
|
1275 case Bfollowing_char:
|
|
|
1276 PUSH (Ffollowing_char (Qnil));
|
|
|
1277 break;
|
|
|
1278
|
|
|
1279 case Bpreceding_char:
|
|
|
1280 PUSH (Fpreceding_char (Qnil));
|
|
|
1281 break;
|
|
|
1282
|
|
|
1283 case Beolp:
|
|
|
1284 PUSH (Feolp (Qnil));
|
|
|
1285 break;
|
|
|
1286
|
|
|
1287 case Beobp:
|
|
|
1288 PUSH (Feobp (Qnil));
|
|
|
1289 break;
|
|
|
1290
|
|
|
1291 case Bbolp:
|
|
|
1292 PUSH (Fbolp (Qnil));
|
|
|
1293 break;
|
|
|
1294
|
|
|
1295 case Bbobp:
|
|
|
1296 PUSH (Fbobp (Qnil));
|
|
|
1297 break;
|
|
|
1298
|
|
|
1299 case Bsave_current_buffer:
|
|
|
1300 record_unwind_protect (save_current_buffer_restore,
|
|
|
1301 Fcurrent_buffer ());
|
|
|
1302 break;
|
|
|
1303
|
|
|
1304 case Binteractive_p:
|
|
|
1305 PUSH (Finteractive_p ());
|
|
|
1306 break;
|
|
|
1307
|
|
|
1308 case Bforward_char:
|
|
|
1309 TOP = Fforward_char (TOP, Qnil);
|
|
|
1310 break;
|
|
|
1311
|
|
|
1312 case Bforward_word:
|
|
|
1313 TOP = Fforward_word (TOP, Qnil);
|
|
|
1314 break;
|
|
|
1315
|
|
|
1316 case Bforward_line:
|
|
|
1317 TOP = Fforward_line (TOP, Qnil);
|
|
|
1318 break;
|
|
|
1319
|
|
|
1320 case Bchar_syntax:
|
|
|
1321 TOP = Fchar_syntax (TOP, Qnil);
|
|
|
1322 break;
|
|
|
1323
|
|
|
1324 case Bbuffer_substring:
|
|
|
1325 {
|
|
|
1326 Lisp_Object arg = POP;
|
|
|
1327 TOP = Fbuffer_substring (TOP, arg, Qnil);
|
|
|
1328 break;
|
|
|
1329 }
|
|
|
1330
|
|
|
1331 case Bdelete_region:
|
|
|
1332 {
|
|
|
1333 Lisp_Object arg = POP;
|
|
|
1334 TOP = Fdelete_region (TOP, arg, Qnil);
|
|
|
1335 break;
|
|
|
1336 }
|
|
|
1337
|
|
|
1338 case Bnarrow_to_region:
|
|
|
1339 {
|
|
|
1340 Lisp_Object arg = POP;
|
|
|
1341 TOP = Fnarrow_to_region (TOP, arg, Qnil);
|
|
|
1342 break;
|
|
|
1343 }
|
|
|
1344
|
|
|
1345 case Bend_of_line:
|
|
|
1346 TOP = Fend_of_line (TOP, Qnil);
|
|
|
1347 break;
|
|
|
1348
|
|
|
1349 case Btemp_output_buffer_setup:
|
|
|
1350 temp_output_buffer_setup (TOP);
|
|
|
1351 TOP = Vstandard_output;
|
|
|
1352 break;
|
|
|
1353
|
|
|
1354 case Btemp_output_buffer_show:
|
|
|
1355 {
|
|
|
1356 Lisp_Object arg = POP;
|
|
|
1357 temp_output_buffer_show (TOP, Qnil);
|
|
|
1358 TOP = arg;
|
|
|
1359 /* GAG ME!! */
|
|
|
1360 /* pop binding of standard-output */
|
|
771
|
1361 unbind_to (specpdl_depth() - 1);
|
|
428
|
1362 break;
|
|
|
1363 }
|
|
|
1364
|
|
|
1365 case Bold_eq:
|
|
|
1366 {
|
|
|
1367 Lisp_Object arg = POP;
|
|
|
1368 TOP = HACKEQ_UNSAFE (TOP, arg) ? Qt : Qnil;
|
|
|
1369 break;
|
|
|
1370 }
|
|
|
1371
|
|
|
1372 case Bold_memq:
|
|
|
1373 {
|
|
|
1374 Lisp_Object arg = POP;
|
|
|
1375 TOP = Fold_memq (TOP, arg);
|
|
|
1376 break;
|
|
|
1377 }
|
|
|
1378
|
|
|
1379 case Bold_equal:
|
|
|
1380 {
|
|
|
1381 Lisp_Object arg = POP;
|
|
|
1382 TOP = Fold_equal (TOP, arg);
|
|
|
1383 break;
|
|
|
1384 }
|
|
|
1385
|
|
|
1386 case Bold_member:
|
|
|
1387 {
|
|
|
1388 Lisp_Object arg = POP;
|
|
|
1389 TOP = Fold_member (TOP, arg);
|
|
|
1390 break;
|
|
|
1391 }
|
|
|
1392
|
|
|
1393 case Bold_assq:
|
|
|
1394 {
|
|
|
1395 Lisp_Object arg = POP;
|
|
|
1396 TOP = Fold_assq (TOP, arg);
|
|
|
1397 break;
|
|
|
1398 }
|
|
|
1399
|
|
|
1400 default:
|
|
|
1401 abort();
|
|
|
1402 break;
|
|
|
1403 }
|
|
|
1404 return stack_ptr;
|
|
|
1405 }
|
|
|
1406
|
|
|
1407
|
|
563
|
1408 DOESNT_RETURN
|
|
665
|
1409 invalid_byte_code (const CIntbyte *reason, Lisp_Object frob)
|
|
428
|
1410 {
|
|
563
|
1411 signal_error (Qinvalid_byte_code, reason, frob);
|
|
428
|
1412 }
|
|
|
1413
|
|
|
1414 /* Check for valid opcodes. Change this when adding new opcodes. */
|
|
|
1415 static void
|
|
|
1416 check_opcode (Opcode opcode)
|
|
|
1417 {
|
|
|
1418 if ((opcode < Bvarref) ||
|
|
|
1419 (opcode == 0251) ||
|
|
|
1420 (opcode > Bassq && opcode < Bconstant))
|
|
563
|
1421 invalid_byte_code ("invalid opcode in instruction stream",
|
|
|
1422 make_int (opcode));
|
|
428
|
1423 }
|
|
|
1424
|
|
|
1425 /* Check that IDX is a valid offset into the `constants' vector */
|
|
|
1426 static void
|
|
|
1427 check_constants_index (int idx, Lisp_Object constants)
|
|
|
1428 {
|
|
|
1429 if (idx < 0 || idx >= XVECTOR_LENGTH (constants))
|
|
563
|
1430 signal_ferror
|
|
|
1431 (Qinvalid_byte_code,
|
|
|
1432 "reference %d to constants array out of range 0, %ld",
|
|
428
|
1433 idx, XVECTOR_LENGTH (constants) - 1);
|
|
|
1434 }
|
|
|
1435
|
|
|
1436 /* Get next character from Lisp instructions string. */
|
|
563
|
1437 #define READ_INSTRUCTION_CHAR(lvalue) do { \
|
|
|
1438 (lvalue) = charptr_emchar (ptr); \
|
|
|
1439 INC_CHARPTR (ptr); \
|
|
|
1440 *icounts_ptr++ = program_ptr - program; \
|
|
|
1441 if (lvalue > UCHAR_MAX) \
|
|
|
1442 invalid_byte_code \
|
|
|
1443 ("Invalid character in byte code string", make_char (lvalue)); \
|
|
428
|
1444 } while (0)
|
|
|
1445
|
|
|
1446 /* Get opcode from Lisp instructions string. */
|
|
|
1447 #define READ_OPCODE do { \
|
|
|
1448 unsigned int c; \
|
|
|
1449 READ_INSTRUCTION_CHAR (c); \
|
|
|
1450 opcode = (Opcode) c; \
|
|
|
1451 } while (0)
|
|
|
1452
|
|
|
1453 /* Get next operand, a uint8, from Lisp instructions string. */
|
|
|
1454 #define READ_OPERAND_1 do { \
|
|
|
1455 READ_INSTRUCTION_CHAR (arg); \
|
|
|
1456 argsize = 1; \
|
|
|
1457 } while (0)
|
|
|
1458
|
|
|
1459 /* Get next operand, a uint16, from Lisp instructions string. */
|
|
|
1460 #define READ_OPERAND_2 do { \
|
|
|
1461 unsigned int arg1, arg2; \
|
|
|
1462 READ_INSTRUCTION_CHAR (arg1); \
|
|
|
1463 READ_INSTRUCTION_CHAR (arg2); \
|
|
|
1464 arg = arg1 + (arg2 << 8); \
|
|
|
1465 argsize = 2; \
|
|
|
1466 } while (0)
|
|
|
1467
|
|
|
1468 /* Write 1 byte to PTR, incrementing PTR */
|
|
|
1469 #define WRITE_INT8(value, ptr) do { \
|
|
|
1470 *((ptr)++) = (value); \
|
|
|
1471 } while (0)
|
|
|
1472
|
|
|
1473 /* Write 2 bytes to PTR, incrementing PTR */
|
|
|
1474 #define WRITE_INT16(value, ptr) do { \
|
|
|
1475 WRITE_INT8 (((unsigned) (value)) & 0x00ff, (ptr)); \
|
|
|
1476 WRITE_INT8 (((unsigned) (value)) >> 8 , (ptr)); \
|
|
|
1477 } while (0)
|
|
|
1478
|
|
|
1479 /* We've changed our minds about the opcode we've already written. */
|
|
|
1480 #define REWRITE_OPCODE(new_opcode) ((void) (program_ptr[-1] = new_opcode))
|
|
|
1481
|
|
|
1482 /* Encode an op arg within the opcode, or as a 1 or 2-byte operand. */
|
|
|
1483 #define WRITE_NARGS(base_opcode) do { \
|
|
|
1484 if (arg <= 5) \
|
|
|
1485 { \
|
|
|
1486 REWRITE_OPCODE (base_opcode + arg); \
|
|
|
1487 } \
|
|
|
1488 else if (arg <= UCHAR_MAX) \
|
|
|
1489 { \
|
|
|
1490 REWRITE_OPCODE (base_opcode + 6); \
|
|
|
1491 WRITE_INT8 (arg, program_ptr); \
|
|
|
1492 } \
|
|
|
1493 else \
|
|
|
1494 { \
|
|
|
1495 REWRITE_OPCODE (base_opcode + 7); \
|
|
|
1496 WRITE_INT16 (arg, program_ptr); \
|
|
|
1497 } \
|
|
|
1498 } while (0)
|
|
|
1499
|
|
|
1500 /* Encode a constants reference within the opcode, or as a 2-byte operand. */
|
|
|
1501 #define WRITE_CONSTANT do { \
|
|
|
1502 check_constants_index(arg, constants); \
|
|
|
1503 if (arg <= UCHAR_MAX - Bconstant) \
|
|
|
1504 { \
|
|
|
1505 REWRITE_OPCODE (Bconstant + arg); \
|
|
|
1506 } \
|
|
|
1507 else \
|
|
|
1508 { \
|
|
|
1509 REWRITE_OPCODE (Bconstant2); \
|
|
|
1510 WRITE_INT16 (arg, program_ptr); \
|
|
|
1511 } \
|
|
|
1512 } while (0)
|
|
|
1513
|
|
|
1514 #define WRITE_OPCODE WRITE_INT8 (opcode, program_ptr)
|
|
|
1515
|
|
|
1516 /* Compile byte code instructions into free space provided by caller, with
|
|
|
1517 size >= (2 * string_char_length (instructions) + 1) * sizeof (Opbyte).
|
|
|
1518 Returns length of compiled code. */
|
|
|
1519 static void
|
|
|
1520 optimize_byte_code (/* in */
|
|
|
1521 Lisp_Object instructions,
|
|
|
1522 Lisp_Object constants,
|
|
|
1523 /* out */
|
|
442
|
1524 Opbyte * const program,
|
|
|
1525 int * const program_length,
|
|
|
1526 int * const varbind_count)
|
|
428
|
1527 {
|
|
647
|
1528 Bytecount instructions_length = XSTRING_LENGTH (instructions);
|
|
665
|
1529 Elemcount comfy_size = (Elemcount) (2 * instructions_length);
|
|
428
|
1530
|
|
442
|
1531 int * const icounts = alloca_array (int, comfy_size);
|
|
428
|
1532 int * icounts_ptr = icounts;
|
|
|
1533
|
|
|
1534 /* We maintain a table of jumps in the source code. */
|
|
|
1535 struct jump
|
|
|
1536 {
|
|
|
1537 int from;
|
|
|
1538 int to;
|
|
|
1539 };
|
|
442
|
1540 struct jump * const jumps = alloca_array (struct jump, comfy_size);
|
|
428
|
1541 struct jump *jumps_ptr = jumps;
|
|
|
1542
|
|
|
1543 Opbyte *program_ptr = program;
|
|
|
1544
|
|
665
|
1545 const Intbyte *ptr = XSTRING_DATA (instructions);
|
|
|
1546 const Intbyte * const end = ptr + instructions_length;
|
|
428
|
1547
|
|
|
1548 *varbind_count = 0;
|
|
|
1549
|
|
|
1550 while (ptr < end)
|
|
|
1551 {
|
|
|
1552 Opcode opcode;
|
|
|
1553 int arg;
|
|
|
1554 int argsize = 0;
|
|
|
1555 READ_OPCODE;
|
|
|
1556 WRITE_OPCODE;
|
|
|
1557
|
|
|
1558 switch (opcode)
|
|
|
1559 {
|
|
|
1560 Lisp_Object val;
|
|
|
1561
|
|
|
1562 case Bvarref+7: READ_OPERAND_2; goto do_varref;
|
|
|
1563 case Bvarref+6: READ_OPERAND_1; goto do_varref;
|
|
|
1564 case Bvarref: case Bvarref+1: case Bvarref+2:
|
|
|
1565 case Bvarref+3: case Bvarref+4: case Bvarref+5:
|
|
|
1566 arg = opcode - Bvarref;
|
|
|
1567 do_varref:
|
|
|
1568 check_constants_index (arg, constants);
|
|
|
1569 val = XVECTOR_DATA (constants) [arg];
|
|
|
1570 if (!SYMBOLP (val))
|
|
563
|
1571 invalid_byte_code ("variable reference to non-symbol", val);
|
|
428
|
1572 if (EQ (val, Qnil) || EQ (val, Qt) || (SYMBOL_IS_KEYWORD (val)))
|
|
563
|
1573 invalid_byte_code ("variable reference to constant symbol", val);
|
|
428
|
1574 WRITE_NARGS (Bvarref);
|
|
|
1575 break;
|
|
|
1576
|
|
|
1577 case Bvarset+7: READ_OPERAND_2; goto do_varset;
|
|
|
1578 case Bvarset+6: READ_OPERAND_1; goto do_varset;
|
|
|
1579 case Bvarset: case Bvarset+1: case Bvarset+2:
|
|
|
1580 case Bvarset+3: case Bvarset+4: case Bvarset+5:
|
|
|
1581 arg = opcode - Bvarset;
|
|
|
1582 do_varset:
|
|
|
1583 check_constants_index (arg, constants);
|
|
|
1584 val = XVECTOR_DATA (constants) [arg];
|
|
|
1585 if (!SYMBOLP (val))
|
|
563
|
1586 wtaerror ("attempt to set non-symbol", val);
|
|
428
|
1587 if (EQ (val, Qnil) || EQ (val, Qt))
|
|
563
|
1588 signal_error (Qsetting_constant, 0, val);
|
|
428
|
1589 /* Ignore assignments to keywords by converting to Bdiscard.
|
|
|
1590 For backward compatibility only - we'd like to make this an error. */
|
|
|
1591 if (SYMBOL_IS_KEYWORD (val))
|
|
|
1592 REWRITE_OPCODE (Bdiscard);
|
|
|
1593 else
|
|
|
1594 WRITE_NARGS (Bvarset);
|
|
|
1595 break;
|
|
|
1596
|
|
|
1597 case Bvarbind+7: READ_OPERAND_2; goto do_varbind;
|
|
|
1598 case Bvarbind+6: READ_OPERAND_1; goto do_varbind;
|
|
|
1599 case Bvarbind: case Bvarbind+1: case Bvarbind+2:
|
|
|
1600 case Bvarbind+3: case Bvarbind+4: case Bvarbind+5:
|
|
|
1601 arg = opcode - Bvarbind;
|
|
|
1602 do_varbind:
|
|
|
1603 (*varbind_count)++;
|
|
|
1604 check_constants_index (arg, constants);
|
|
|
1605 val = XVECTOR_DATA (constants) [arg];
|
|
|
1606 if (!SYMBOLP (val))
|
|
563
|
1607 wtaerror ("attempt to let-bind non-symbol", val);
|
|
428
|
1608 if (EQ (val, Qnil) || EQ (val, Qt) || (SYMBOL_IS_KEYWORD (val)))
|
|
563
|
1609 signal_error (Qsetting_constant,
|
|
|
1610 "attempt to let-bind constant symbol", val);
|
|
428
|
1611 WRITE_NARGS (Bvarbind);
|
|
|
1612 break;
|
|
|
1613
|
|
|
1614 case Bcall+7: READ_OPERAND_2; goto do_call;
|
|
|
1615 case Bcall+6: READ_OPERAND_1; goto do_call;
|
|
|
1616 case Bcall: case Bcall+1: case Bcall+2:
|
|
|
1617 case Bcall+3: case Bcall+4: case Bcall+5:
|
|
|
1618 arg = opcode - Bcall;
|
|
|
1619 do_call:
|
|
|
1620 WRITE_NARGS (Bcall);
|
|
|
1621 break;
|
|
|
1622
|
|
|
1623 case Bunbind+7: READ_OPERAND_2; goto do_unbind;
|
|
|
1624 case Bunbind+6: READ_OPERAND_1; goto do_unbind;
|
|
|
1625 case Bunbind: case Bunbind+1: case Bunbind+2:
|
|
|
1626 case Bunbind+3: case Bunbind+4: case Bunbind+5:
|
|
|
1627 arg = opcode - Bunbind;
|
|
|
1628 do_unbind:
|
|
|
1629 WRITE_NARGS (Bunbind);
|
|
|
1630 break;
|
|
|
1631
|
|
|
1632 case Bgoto:
|
|
|
1633 case Bgotoifnil:
|
|
|
1634 case Bgotoifnonnil:
|
|
|
1635 case Bgotoifnilelsepop:
|
|
|
1636 case Bgotoifnonnilelsepop:
|
|
|
1637 READ_OPERAND_2;
|
|
|
1638 /* Make program_ptr-relative */
|
|
|
1639 arg += icounts - (icounts_ptr - argsize);
|
|
|
1640 goto do_jump;
|
|
|
1641
|
|
|
1642 case BRgoto:
|
|
|
1643 case BRgotoifnil:
|
|
|
1644 case BRgotoifnonnil:
|
|
|
1645 case BRgotoifnilelsepop:
|
|
|
1646 case BRgotoifnonnilelsepop:
|
|
|
1647 READ_OPERAND_1;
|
|
|
1648 /* Make program_ptr-relative */
|
|
|
1649 arg -= 127;
|
|
|
1650 do_jump:
|
|
|
1651 /* Record program-relative goto addresses in `jumps' table */
|
|
|
1652 jumps_ptr->from = icounts_ptr - icounts - argsize;
|
|
|
1653 jumps_ptr->to = jumps_ptr->from + arg;
|
|
|
1654 jumps_ptr++;
|
|
|
1655 if (arg >= -1 && arg <= argsize)
|
|
563
|
1656 invalid_byte_code ("goto instruction is its own target", Qunbound);
|
|
428
|
1657 if (arg <= SCHAR_MIN ||
|
|
|
1658 arg > SCHAR_MAX)
|
|
|
1659 {
|
|
|
1660 if (argsize == 1)
|
|
|
1661 REWRITE_OPCODE (opcode + Bgoto - BRgoto);
|
|
|
1662 WRITE_INT16 (arg, program_ptr);
|
|
|
1663 }
|
|
|
1664 else
|
|
|
1665 {
|
|
|
1666 if (argsize == 2)
|
|
|
1667 REWRITE_OPCODE (opcode + BRgoto - Bgoto);
|
|
|
1668 WRITE_INT8 (arg, program_ptr);
|
|
|
1669 }
|
|
|
1670 break;
|
|
|
1671
|
|
|
1672 case Bconstant2:
|
|
|
1673 READ_OPERAND_2;
|
|
|
1674 WRITE_CONSTANT;
|
|
|
1675 break;
|
|
|
1676
|
|
|
1677 case BlistN:
|
|
|
1678 case BconcatN:
|
|
|
1679 case BinsertN:
|
|
|
1680 READ_OPERAND_1;
|
|
|
1681 WRITE_INT8 (arg, program_ptr);
|
|
|
1682 break;
|
|
|
1683
|
|
|
1684 default:
|
|
|
1685 if (opcode < Bconstant)
|
|
|
1686 check_opcode (opcode);
|
|
|
1687 else
|
|
|
1688 {
|
|
|
1689 arg = opcode - Bconstant;
|
|
|
1690 WRITE_CONSTANT;
|
|
|
1691 }
|
|
|
1692 break;
|
|
|
1693 }
|
|
|
1694 }
|
|
|
1695
|
|
|
1696 /* Fix up jumps table to refer to NEW offsets. */
|
|
|
1697 {
|
|
|
1698 struct jump *j;
|
|
|
1699 for (j = jumps; j < jumps_ptr; j++)
|
|
|
1700 {
|
|
|
1701 #ifdef ERROR_CHECK_BYTE_CODE
|
|
|
1702 assert (j->from < icounts_ptr - icounts);
|
|
|
1703 assert (j->to < icounts_ptr - icounts);
|
|
|
1704 #endif
|
|
|
1705 j->from = icounts[j->from];
|
|
|
1706 j->to = icounts[j->to];
|
|
|
1707 #ifdef ERROR_CHECK_BYTE_CODE
|
|
|
1708 assert (j->from < program_ptr - program);
|
|
|
1709 assert (j->to < program_ptr - program);
|
|
|
1710 check_opcode ((Opcode) (program[j->from-1]));
|
|
|
1711 #endif
|
|
|
1712 check_opcode ((Opcode) (program[j->to]));
|
|
|
1713 }
|
|
|
1714 }
|
|
|
1715
|
|
|
1716 /* Fixup jumps in byte-code until no more fixups needed */
|
|
|
1717 {
|
|
|
1718 int more_fixups_needed = 1;
|
|
|
1719
|
|
|
1720 while (more_fixups_needed)
|
|
|
1721 {
|
|
|
1722 struct jump *j;
|
|
|
1723 more_fixups_needed = 0;
|
|
|
1724 for (j = jumps; j < jumps_ptr; j++)
|
|
|
1725 {
|
|
|
1726 int from = j->from;
|
|
|
1727 int to = j->to;
|
|
|
1728 int jump = to - from;
|
|
|
1729 Opbyte *p = program + from;
|
|
|
1730 Opcode opcode = (Opcode) p[-1];
|
|
|
1731 if (!more_fixups_needed)
|
|
|
1732 check_opcode ((Opcode) p[jump]);
|
|
|
1733 assert (to >= 0 && program + to < program_ptr);
|
|
|
1734 switch (opcode)
|
|
|
1735 {
|
|
|
1736 case Bgoto:
|
|
|
1737 case Bgotoifnil:
|
|
|
1738 case Bgotoifnonnil:
|
|
|
1739 case Bgotoifnilelsepop:
|
|
|
1740 case Bgotoifnonnilelsepop:
|
|
|
1741 WRITE_INT16 (jump, p);
|
|
|
1742 break;
|
|
|
1743
|
|
|
1744 case BRgoto:
|
|
|
1745 case BRgotoifnil:
|
|
|
1746 case BRgotoifnonnil:
|
|
|
1747 case BRgotoifnilelsepop:
|
|
|
1748 case BRgotoifnonnilelsepop:
|
|
|
1749 if (jump > SCHAR_MIN &&
|
|
|
1750 jump <= SCHAR_MAX)
|
|
|
1751 {
|
|
|
1752 WRITE_INT8 (jump, p);
|
|
|
1753 }
|
|
|
1754 else /* barf */
|
|
|
1755 {
|
|
|
1756 struct jump *jj;
|
|
|
1757 for (jj = jumps; jj < jumps_ptr; jj++)
|
|
|
1758 {
|
|
|
1759 assert (jj->from < program_ptr - program);
|
|
|
1760 assert (jj->to < program_ptr - program);
|
|
|
1761 if (jj->from > from) jj->from++;
|
|
|
1762 if (jj->to > from) jj->to++;
|
|
|
1763 }
|
|
|
1764 p[-1] += Bgoto - BRgoto;
|
|
|
1765 more_fixups_needed = 1;
|
|
|
1766 memmove (p+1, p, program_ptr++ - p);
|
|
|
1767 WRITE_INT16 (jump, p);
|
|
|
1768 }
|
|
|
1769 break;
|
|
|
1770
|
|
|
1771 default:
|
|
|
1772 abort();
|
|
|
1773 break;
|
|
|
1774 }
|
|
|
1775 }
|
|
|
1776 }
|
|
|
1777 }
|
|
|
1778
|
|
|
1779 /* *program_ptr++ = 0; */
|
|
|
1780 *program_length = program_ptr - program;
|
|
|
1781 }
|
|
|
1782
|
|
|
1783 /* Optimize the byte code and store the optimized program, only
|
|
|
1784 understood by bytecode.c, in an opaque object in the
|
|
|
1785 instructions slot of the Compiled_Function object. */
|
|
|
1786 void
|
|
|
1787 optimize_compiled_function (Lisp_Object compiled_function)
|
|
|
1788 {
|
|
|
1789 Lisp_Compiled_Function *f = XCOMPILED_FUNCTION (compiled_function);
|
|
|
1790 int program_length;
|
|
|
1791 int varbind_count;
|
|
|
1792 Opbyte *program;
|
|
|
1793
|
|
|
1794 /* If we have not actually read the bytecode string
|
|
|
1795 and constants vector yet, fetch them from the file. */
|
|
|
1796 if (CONSP (f->instructions))
|
|
|
1797 Ffetch_bytecode (compiled_function);
|
|
|
1798
|
|
|
1799 if (STRINGP (f->instructions))
|
|
|
1800 {
|
|
826
|
1801 /* XSTRING_LENGTH() is more efficient than string_char_length(),
|
|
428
|
1802 which would be slightly more `proper' */
|
|
|
1803 program = alloca_array (Opbyte, 1 + 2 * XSTRING_LENGTH (f->instructions));
|
|
|
1804 optimize_byte_code (f->instructions, f->constants,
|
|
|
1805 program, &program_length, &varbind_count);
|
|
|
1806 f->specpdl_depth = XINT (Flength (f->arglist)) + varbind_count;
|
|
|
1807 f->instructions =
|
|
440
|
1808 make_opaque (program, program_length * sizeof (Opbyte));
|
|
428
|
1809 }
|
|
|
1810
|
|
|
1811 assert (OPAQUEP (f->instructions));
|
|
|
1812 }
|
|
|
1813
|
|
|
1814 /************************************************************************/
|
|
|
1815 /* The compiled-function object type */
|
|
|
1816 /************************************************************************/
|
|
|
1817 static void
|
|
|
1818 print_compiled_function (Lisp_Object obj, Lisp_Object printcharfun,
|
|
|
1819 int escapeflag)
|
|
|
1820 {
|
|
|
1821 /* This function can GC */
|
|
|
1822 Lisp_Compiled_Function *f =
|
|
|
1823 XCOMPILED_FUNCTION (obj); /* GC doesn't relocate */
|
|
|
1824 int docp = f->flags.documentationp;
|
|
|
1825 int intp = f->flags.interactivep;
|
|
|
1826 struct gcpro gcpro1, gcpro2;
|
|
|
1827 GCPRO2 (obj, printcharfun);
|
|
|
1828
|
|
826
|
1829 write_c_string (printcharfun, print_readably ? "#[" : "#<compiled-function ");
|
|
428
|
1830 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
|
1831 if (!print_readably)
|
|
|
1832 {
|
|
|
1833 Lisp_Object ann = compiled_function_annotation (f);
|
|
|
1834 if (!NILP (ann))
|
|
800
|
1835 write_fmt_string_lisp (printcharfun, "(from %S) ", 1, ann);
|
|
428
|
1836 }
|
|
|
1837 #endif /* COMPILED_FUNCTION_ANNOTATION_HACK */
|
|
|
1838 /* COMPILED_ARGLIST = 0 */
|
|
|
1839 print_internal (compiled_function_arglist (f), printcharfun, escapeflag);
|
|
|
1840
|
|
|
1841 /* COMPILED_INSTRUCTIONS = 1 */
|
|
826
|
1842 write_c_string (printcharfun, " ");
|
|
428
|
1843 {
|
|
|
1844 struct gcpro ngcpro1;
|
|
|
1845 Lisp_Object instructions = compiled_function_instructions (f);
|
|
|
1846 NGCPRO1 (instructions);
|
|
|
1847 if (STRINGP (instructions) && !print_readably)
|
|
|
1848 {
|
|
|
1849 /* We don't usually want to see that junk in the bytecode. */
|
|
800
|
1850 write_fmt_string (printcharfun, "\"...(%ld)\"",
|
|
826
|
1851 (long) string_char_length (instructions));
|
|
428
|
1852 }
|
|
|
1853 else
|
|
|
1854 print_internal (instructions, printcharfun, escapeflag);
|
|
|
1855 NUNGCPRO;
|
|
|
1856 }
|
|
|
1857
|
|
|
1858 /* COMPILED_CONSTANTS = 2 */
|
|
826
|
1859 write_c_string (printcharfun, " ");
|
|
428
|
1860 print_internal (compiled_function_constants (f), printcharfun, escapeflag);
|
|
|
1861
|
|
|
1862 /* COMPILED_STACK_DEPTH = 3 */
|
|
800
|
1863 write_fmt_string (printcharfun, " %d", compiled_function_stack_depth (f));
|
|
428
|
1864
|
|
|
1865 /* COMPILED_DOC_STRING = 4 */
|
|
|
1866 if (docp || intp)
|
|
|
1867 {
|
|
826
|
1868 write_c_string (printcharfun, " ");
|
|
428
|
1869 print_internal (compiled_function_documentation (f), printcharfun,
|
|
|
1870 escapeflag);
|
|
|
1871 }
|
|
|
1872
|
|
|
1873 /* COMPILED_INTERACTIVE = 5 */
|
|
|
1874 if (intp)
|
|
|
1875 {
|
|
826
|
1876 write_c_string (printcharfun, " ");
|
|
428
|
1877 print_internal (compiled_function_interactive (f), printcharfun,
|
|
|
1878 escapeflag);
|
|
|
1879 }
|
|
|
1880
|
|
|
1881 UNGCPRO;
|
|
826
|
1882 write_c_string (printcharfun, print_readably ? "]" : ">");
|
|
428
|
1883 }
|
|
|
1884
|
|
|
1885
|
|
|
1886 static Lisp_Object
|
|
|
1887 mark_compiled_function (Lisp_Object obj)
|
|
|
1888 {
|
|
|
1889 Lisp_Compiled_Function *f = XCOMPILED_FUNCTION (obj);
|
|
814
|
1890 int i;
|
|
428
|
1891
|
|
|
1892 mark_object (f->instructions);
|
|
|
1893 mark_object (f->arglist);
|
|
|
1894 mark_object (f->doc_and_interactive);
|
|
|
1895 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
|
1896 mark_object (f->annotated);
|
|
|
1897 #endif
|
|
814
|
1898 for (i = 0; i < f->args_in_array; i++)
|
|
|
1899 mark_object (f->args[i]);
|
|
|
1900
|
|
428
|
1901 /* tail-recurse on constants */
|
|
|
1902 return f->constants;
|
|
|
1903 }
|
|
|
1904
|
|
|
1905 static int
|
|
|
1906 compiled_function_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
1907 {
|
|
|
1908 Lisp_Compiled_Function *f1 = XCOMPILED_FUNCTION (obj1);
|
|
|
1909 Lisp_Compiled_Function *f2 = XCOMPILED_FUNCTION (obj2);
|
|
|
1910 return
|
|
|
1911 (f1->flags.documentationp == f2->flags.documentationp &&
|
|
|
1912 f1->flags.interactivep == f2->flags.interactivep &&
|
|
|
1913 f1->flags.domainp == f2->flags.domainp && /* I18N3 */
|
|
|
1914 internal_equal (compiled_function_instructions (f1),
|
|
|
1915 compiled_function_instructions (f2), depth + 1) &&
|
|
|
1916 internal_equal (f1->constants, f2->constants, depth + 1) &&
|
|
|
1917 internal_equal (f1->arglist, f2->arglist, depth + 1) &&
|
|
|
1918 internal_equal (f1->doc_and_interactive,
|
|
|
1919 f2->doc_and_interactive, depth + 1));
|
|
|
1920 }
|
|
|
1921
|
|
665
|
1922 static Hashcode
|
|
428
|
1923 compiled_function_hash (Lisp_Object obj, int depth)
|
|
|
1924 {
|
|
|
1925 Lisp_Compiled_Function *f = XCOMPILED_FUNCTION (obj);
|
|
|
1926 return HASH3 ((f->flags.documentationp << 2) +
|
|
|
1927 (f->flags.interactivep << 1) +
|
|
|
1928 f->flags.domainp,
|
|
|
1929 internal_hash (f->instructions, depth + 1),
|
|
|
1930 internal_hash (f->constants, depth + 1));
|
|
|
1931 }
|
|
|
1932
|
|
814
|
1933 static const struct lrecord_description lo_description_1[] = {
|
|
|
1934 { XD_LISP_OBJECT, 0 },
|
|
|
1935 { XD_END }
|
|
|
1936 };
|
|
|
1937
|
|
|
1938 static const struct struct_description lo_description = {
|
|
|
1939 sizeof (Lisp_Object),
|
|
|
1940 lo_description_1
|
|
|
1941 };
|
|
|
1942
|
|
428
|
1943 static const struct lrecord_description compiled_function_description[] = {
|
|
814
|
1944 { XD_INT, offsetof (Lisp_Compiled_Function, args_in_array) },
|
|
|
1945 { XD_STRUCT_PTR, offsetof (Lisp_Compiled_Function, args),
|
|
|
1946 XD_INDIRECT (0, 0), &lo_description },
|
|
440
|
1947 { XD_LISP_OBJECT, offsetof (Lisp_Compiled_Function, instructions) },
|
|
|
1948 { XD_LISP_OBJECT, offsetof (Lisp_Compiled_Function, constants) },
|
|
|
1949 { XD_LISP_OBJECT, offsetof (Lisp_Compiled_Function, arglist) },
|
|
|
1950 { XD_LISP_OBJECT, offsetof (Lisp_Compiled_Function, doc_and_interactive) },
|
|
428
|
1951 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
440
|
1952 { XD_LISP_OBJECT, offsetof (Lisp_Compiled_Function, annotated) },
|
|
428
|
1953 #endif
|
|
|
1954 { XD_END }
|
|
|
1955 };
|
|
|
1956
|
|
|
1957 DEFINE_BASIC_LRECORD_IMPLEMENTATION ("compiled-function", compiled_function,
|
|
|
1958 mark_compiled_function,
|
|
|
1959 print_compiled_function, 0,
|
|
|
1960 compiled_function_equal,
|
|
|
1961 compiled_function_hash,
|
|
|
1962 compiled_function_description,
|
|
|
1963 Lisp_Compiled_Function);
|
|
|
1964
|
|
|
1965 DEFUN ("compiled-function-p", Fcompiled_function_p, 1, 1, 0, /*
|
|
|
1966 Return t if OBJECT is a byte-compiled function object.
|
|
|
1967 */
|
|
|
1968 (object))
|
|
|
1969 {
|
|
|
1970 return COMPILED_FUNCTIONP (object) ? Qt : Qnil;
|
|
|
1971 }
|
|
|
1972
|
|
|
1973 /************************************************************************/
|
|
|
1974 /* compiled-function object accessor functions */
|
|
|
1975 /************************************************************************/
|
|
|
1976
|
|
|
1977 Lisp_Object
|
|
|
1978 compiled_function_arglist (Lisp_Compiled_Function *f)
|
|
|
1979 {
|
|
|
1980 return f->arglist;
|
|
|
1981 }
|
|
|
1982
|
|
|
1983 Lisp_Object
|
|
|
1984 compiled_function_instructions (Lisp_Compiled_Function *f)
|
|
|
1985 {
|
|
|
1986 if (! OPAQUEP (f->instructions))
|
|
|
1987 return f->instructions;
|
|
|
1988
|
|
|
1989 {
|
|
|
1990 /* Invert action performed by optimize_byte_code() */
|
|
|
1991 Lisp_Opaque *opaque = XOPAQUE (f->instructions);
|
|
|
1992
|
|
665
|
1993 Intbyte * const buffer =
|
|
|
1994 alloca_array (Intbyte, OPAQUE_SIZE (opaque) * MAX_EMCHAR_LEN);
|
|
|
1995 Intbyte *bp = buffer;
|
|
428
|
1996
|
|
442
|
1997 const Opbyte * const program = (const Opbyte *) OPAQUE_DATA (opaque);
|
|
|
1998 const Opbyte *program_ptr = program;
|
|
|
1999 const Opbyte * const program_end = program_ptr + OPAQUE_SIZE (opaque);
|
|
428
|
2000
|
|
|
2001 while (program_ptr < program_end)
|
|
|
2002 {
|
|
|
2003 Opcode opcode = (Opcode) READ_UINT_1;
|
|
|
2004 bp += set_charptr_emchar (bp, opcode);
|
|
|
2005 switch (opcode)
|
|
|
2006 {
|
|
|
2007 case Bvarref+7:
|
|
|
2008 case Bvarset+7:
|
|
|
2009 case Bvarbind+7:
|
|
|
2010 case Bcall+7:
|
|
|
2011 case Bunbind+7:
|
|
|
2012 case Bconstant2:
|
|
|
2013 bp += set_charptr_emchar (bp, READ_UINT_1);
|
|
|
2014 bp += set_charptr_emchar (bp, READ_UINT_1);
|
|
|
2015 break;
|
|
|
2016
|
|
|
2017 case Bvarref+6:
|
|
|
2018 case Bvarset+6:
|
|
|
2019 case Bvarbind+6:
|
|
|
2020 case Bcall+6:
|
|
|
2021 case Bunbind+6:
|
|
|
2022 case BlistN:
|
|
|
2023 case BconcatN:
|
|
|
2024 case BinsertN:
|
|
|
2025 bp += set_charptr_emchar (bp, READ_UINT_1);
|
|
|
2026 break;
|
|
|
2027
|
|
|
2028 case Bgoto:
|
|
|
2029 case Bgotoifnil:
|
|
|
2030 case Bgotoifnonnil:
|
|
|
2031 case Bgotoifnilelsepop:
|
|
|
2032 case Bgotoifnonnilelsepop:
|
|
|
2033 {
|
|
|
2034 int jump = READ_INT_2;
|
|
|
2035 Opbyte buf2[2];
|
|
|
2036 Opbyte *buf2p = buf2;
|
|
|
2037 /* Convert back to program-relative address */
|
|
|
2038 WRITE_INT16 (jump + (program_ptr - 2 - program), buf2p);
|
|
|
2039 bp += set_charptr_emchar (bp, buf2[0]);
|
|
|
2040 bp += set_charptr_emchar (bp, buf2[1]);
|
|
|
2041 break;
|
|
|
2042 }
|
|
|
2043
|
|
|
2044 case BRgoto:
|
|
|
2045 case BRgotoifnil:
|
|
|
2046 case BRgotoifnonnil:
|
|
|
2047 case BRgotoifnilelsepop:
|
|
|
2048 case BRgotoifnonnilelsepop:
|
|
|
2049 bp += set_charptr_emchar (bp, READ_INT_1 + 127);
|
|
|
2050 break;
|
|
|
2051
|
|
|
2052 default:
|
|
|
2053 break;
|
|
|
2054 }
|
|
|
2055 }
|
|
|
2056 return make_string (buffer, bp - buffer);
|
|
|
2057 }
|
|
|
2058 }
|
|
|
2059
|
|
|
2060 Lisp_Object
|
|
|
2061 compiled_function_constants (Lisp_Compiled_Function *f)
|
|
|
2062 {
|
|
|
2063 return f->constants;
|
|
|
2064 }
|
|
|
2065
|
|
|
2066 int
|
|
|
2067 compiled_function_stack_depth (Lisp_Compiled_Function *f)
|
|
|
2068 {
|
|
|
2069 return f->stack_depth;
|
|
|
2070 }
|
|
|
2071
|
|
|
2072 /* The compiled_function->doc_and_interactive slot uses the minimal
|
|
|
2073 number of conses, based on compiled_function->flags; it may take
|
|
|
2074 any of the following forms:
|
|
|
2075
|
|
|
2076 doc
|
|
|
2077 interactive
|
|
|
2078 domain
|
|
|
2079 (doc . interactive)
|
|
|
2080 (doc . domain)
|
|
|
2081 (interactive . domain)
|
|
|
2082 (doc . (interactive . domain))
|
|
|
2083 */
|
|
|
2084
|
|
|
2085 /* Caller must check flags.interactivep first */
|
|
|
2086 Lisp_Object
|
|
|
2087 compiled_function_interactive (Lisp_Compiled_Function *f)
|
|
|
2088 {
|
|
|
2089 assert (f->flags.interactivep);
|
|
|
2090 if (f->flags.documentationp && f->flags.domainp)
|
|
|
2091 return XCAR (XCDR (f->doc_and_interactive));
|
|
|
2092 else if (f->flags.documentationp)
|
|
|
2093 return XCDR (f->doc_and_interactive);
|
|
|
2094 else if (f->flags.domainp)
|
|
|
2095 return XCAR (f->doc_and_interactive);
|
|
|
2096 else
|
|
|
2097 return f->doc_and_interactive;
|
|
|
2098 }
|
|
|
2099
|
|
|
2100 /* Caller need not check flags.documentationp first */
|
|
|
2101 Lisp_Object
|
|
|
2102 compiled_function_documentation (Lisp_Compiled_Function *f)
|
|
|
2103 {
|
|
|
2104 if (! f->flags.documentationp)
|
|
|
2105 return Qnil;
|
|
|
2106 else if (f->flags.interactivep && f->flags.domainp)
|
|
|
2107 return XCAR (f->doc_and_interactive);
|
|
|
2108 else if (f->flags.interactivep)
|
|
|
2109 return XCAR (f->doc_and_interactive);
|
|
|
2110 else if (f->flags.domainp)
|
|
|
2111 return XCAR (f->doc_and_interactive);
|
|
|
2112 else
|
|
|
2113 return f->doc_and_interactive;
|
|
|
2114 }
|
|
|
2115
|
|
|
2116 /* Caller need not check flags.domainp first */
|
|
|
2117 Lisp_Object
|
|
|
2118 compiled_function_domain (Lisp_Compiled_Function *f)
|
|
|
2119 {
|
|
|
2120 if (! f->flags.domainp)
|
|
|
2121 return Qnil;
|
|
|
2122 else if (f->flags.documentationp && f->flags.interactivep)
|
|
|
2123 return XCDR (XCDR (f->doc_and_interactive));
|
|
|
2124 else if (f->flags.documentationp)
|
|
|
2125 return XCDR (f->doc_and_interactive);
|
|
|
2126 else if (f->flags.interactivep)
|
|
|
2127 return XCDR (f->doc_and_interactive);
|
|
|
2128 else
|
|
|
2129 return f->doc_and_interactive;
|
|
|
2130 }
|
|
|
2131
|
|
|
2132 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
|
2133
|
|
|
2134 Lisp_Object
|
|
|
2135 compiled_function_annotation (Lisp_Compiled_Function *f)
|
|
|
2136 {
|
|
|
2137 return f->annotated;
|
|
|
2138 }
|
|
|
2139
|
|
|
2140 #endif
|
|
|
2141
|
|
|
2142 /* used only by Snarf-documentation; there must be doc already. */
|
|
|
2143 void
|
|
|
2144 set_compiled_function_documentation (Lisp_Compiled_Function *f,
|
|
|
2145 Lisp_Object new_doc)
|
|
|
2146 {
|
|
|
2147 assert (f->flags.documentationp);
|
|
|
2148 assert (INTP (new_doc) || STRINGP (new_doc));
|
|
|
2149
|
|
|
2150 if (f->flags.interactivep && f->flags.domainp)
|
|
|
2151 XCAR (f->doc_and_interactive) = new_doc;
|
|
|
2152 else if (f->flags.interactivep)
|
|
|
2153 XCAR (f->doc_and_interactive) = new_doc;
|
|
|
2154 else if (f->flags.domainp)
|
|
|
2155 XCAR (f->doc_and_interactive) = new_doc;
|
|
|
2156 else
|
|
|
2157 f->doc_and_interactive = new_doc;
|
|
|
2158 }
|
|
|
2159
|
|
|
2160
|
|
|
2161 DEFUN ("compiled-function-arglist", Fcompiled_function_arglist, 1, 1, 0, /*
|
|
|
2162 Return the argument list of the compiled-function object FUNCTION.
|
|
|
2163 */
|
|
|
2164 (function))
|
|
|
2165 {
|
|
|
2166 CHECK_COMPILED_FUNCTION (function);
|
|
|
2167 return compiled_function_arglist (XCOMPILED_FUNCTION (function));
|
|
|
2168 }
|
|
|
2169
|
|
|
2170 DEFUN ("compiled-function-instructions", Fcompiled_function_instructions, 1, 1, 0, /*
|
|
|
2171 Return the byte-opcode string of the compiled-function object FUNCTION.
|
|
|
2172 */
|
|
|
2173 (function))
|
|
|
2174 {
|
|
|
2175 CHECK_COMPILED_FUNCTION (function);
|
|
|
2176 return compiled_function_instructions (XCOMPILED_FUNCTION (function));
|
|
|
2177 }
|
|
|
2178
|
|
|
2179 DEFUN ("compiled-function-constants", Fcompiled_function_constants, 1, 1, 0, /*
|
|
|
2180 Return the constants vector of the compiled-function object FUNCTION.
|
|
|
2181 */
|
|
|
2182 (function))
|
|
|
2183 {
|
|
|
2184 CHECK_COMPILED_FUNCTION (function);
|
|
|
2185 return compiled_function_constants (XCOMPILED_FUNCTION (function));
|
|
|
2186 }
|
|
|
2187
|
|
|
2188 DEFUN ("compiled-function-stack-depth", Fcompiled_function_stack_depth, 1, 1, 0, /*
|
|
444
|
2189 Return the maximum stack depth of the compiled-function object FUNCTION.
|
|
428
|
2190 */
|
|
|
2191 (function))
|
|
|
2192 {
|
|
|
2193 CHECK_COMPILED_FUNCTION (function);
|
|
|
2194 return make_int (compiled_function_stack_depth (XCOMPILED_FUNCTION (function)));
|
|
|
2195 }
|
|
|
2196
|
|
|
2197 DEFUN ("compiled-function-doc-string", Fcompiled_function_doc_string, 1, 1, 0, /*
|
|
|
2198 Return the doc string of the compiled-function object FUNCTION, if available.
|
|
|
2199 Functions that had their doc strings snarfed into the DOC file will have
|
|
|
2200 an integer returned instead of a string.
|
|
|
2201 */
|
|
|
2202 (function))
|
|
|
2203 {
|
|
|
2204 CHECK_COMPILED_FUNCTION (function);
|
|
|
2205 return compiled_function_documentation (XCOMPILED_FUNCTION (function));
|
|
|
2206 }
|
|
|
2207
|
|
|
2208 DEFUN ("compiled-function-interactive", Fcompiled_function_interactive, 1, 1, 0, /*
|
|
|
2209 Return the interactive spec of the compiled-function object FUNCTION, or nil.
|
|
|
2210 If non-nil, the return value will be a list whose first element is
|
|
|
2211 `interactive' and whose second element is the interactive spec.
|
|
|
2212 */
|
|
|
2213 (function))
|
|
|
2214 {
|
|
|
2215 CHECK_COMPILED_FUNCTION (function);
|
|
|
2216 return XCOMPILED_FUNCTION (function)->flags.interactivep
|
|
|
2217 ? list2 (Qinteractive,
|
|
|
2218 compiled_function_interactive (XCOMPILED_FUNCTION (function)))
|
|
|
2219 : Qnil;
|
|
|
2220 }
|
|
|
2221
|
|
|
2222 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
|
2223
|
|
826
|
2224 DEFUN ("compiled-function-annotation", Fcompiled_function_annotation, 1, 1, 0, /*
|
|
428
|
2225 Return the annotation of the compiled-function object FUNCTION, or nil.
|
|
|
2226 The annotation is a piece of information indicating where this
|
|
|
2227 compiled-function object came from. Generally this will be
|
|
|
2228 a symbol naming a function; or a string naming a file, if the
|
|
|
2229 compiled-function object was not defined in a function; or nil,
|
|
|
2230 if the compiled-function object was not created as a result of
|
|
|
2231 a `load'.
|
|
|
2232 */
|
|
|
2233 (function))
|
|
|
2234 {
|
|
|
2235 CHECK_COMPILED_FUNCTION (function);
|
|
|
2236 return compiled_function_annotation (XCOMPILED_FUNCTION (function));
|
|
|
2237 }
|
|
|
2238
|
|
|
2239 #endif /* COMPILED_FUNCTION_ANNOTATION_HACK */
|
|
|
2240
|
|
|
2241 DEFUN ("compiled-function-domain", Fcompiled_function_domain, 1, 1, 0, /*
|
|
|
2242 Return the domain of the compiled-function object FUNCTION, or nil.
|
|
|
2243 This is only meaningful if I18N3 was enabled when emacs was compiled.
|
|
|
2244 */
|
|
|
2245 (function))
|
|
|
2246 {
|
|
|
2247 CHECK_COMPILED_FUNCTION (function);
|
|
|
2248 return XCOMPILED_FUNCTION (function)->flags.domainp
|
|
|
2249 ? compiled_function_domain (XCOMPILED_FUNCTION (function))
|
|
|
2250 : Qnil;
|
|
|
2251 }
|
|
|
2252
|
|
|
2253
|
|
|
2254
|
|
|
2255 DEFUN ("fetch-bytecode", Ffetch_bytecode, 1, 1, 0, /*
|
|
|
2256 If the byte code for compiled function FUNCTION is lazy-loaded, fetch it now.
|
|
|
2257 */
|
|
|
2258 (function))
|
|
|
2259 {
|
|
|
2260 Lisp_Compiled_Function *f;
|
|
|
2261 CHECK_COMPILED_FUNCTION (function);
|
|
|
2262 f = XCOMPILED_FUNCTION (function);
|
|
|
2263
|
|
|
2264 if (OPAQUEP (f->instructions) || STRINGP (f->instructions))
|
|
|
2265 return function;
|
|
|
2266
|
|
|
2267 if (CONSP (f->instructions))
|
|
|
2268 {
|
|
|
2269 Lisp_Object tem = read_doc_string (f->instructions);
|
|
|
2270 if (!CONSP (tem))
|
|
563
|
2271 signal_error (Qinvalid_byte_code,
|
|
|
2272 "Invalid lazy-loaded byte code", tem);
|
|
428
|
2273 /* v18 or v19 bytecode file. Need to Ebolify. */
|
|
|
2274 if (f->flags.ebolified && VECTORP (XCDR (tem)))
|
|
|
2275 ebolify_bytecode_constants (XCDR (tem));
|
|
|
2276 f->instructions = XCAR (tem);
|
|
|
2277 f->constants = XCDR (tem);
|
|
|
2278 return function;
|
|
|
2279 }
|
|
|
2280 abort ();
|
|
801
|
2281 return Qnil; /* not (usually) reached */
|
|
428
|
2282 }
|
|
|
2283
|
|
|
2284 DEFUN ("optimize-compiled-function", Foptimize_compiled_function, 1, 1, 0, /*
|
|
|
2285 Convert compiled function FUNCTION into an optimized internal form.
|
|
|
2286 */
|
|
|
2287 (function))
|
|
|
2288 {
|
|
|
2289 Lisp_Compiled_Function *f;
|
|
|
2290 CHECK_COMPILED_FUNCTION (function);
|
|
|
2291 f = XCOMPILED_FUNCTION (function);
|
|
|
2292
|
|
|
2293 if (OPAQUEP (f->instructions)) /* Already optimized? */
|
|
|
2294 return Qnil;
|
|
|
2295
|
|
|
2296 optimize_compiled_function (function);
|
|
|
2297 return Qnil;
|
|
|
2298 }
|
|
|
2299
|
|
|
2300 DEFUN ("byte-code", Fbyte_code, 3, 3, 0, /*
|
|
|
2301 Function used internally in byte-compiled code.
|
|
|
2302 First argument INSTRUCTIONS is a string of byte code.
|
|
|
2303 Second argument CONSTANTS is a vector of constants.
|
|
|
2304 Third argument STACK-DEPTH is the maximum stack depth used in this function.
|
|
|
2305 If STACK-DEPTH is incorrect, Emacs may crash.
|
|
|
2306 */
|
|
|
2307 (instructions, constants, stack_depth))
|
|
|
2308 {
|
|
|
2309 /* This function can GC */
|
|
|
2310 int varbind_count;
|
|
|
2311 int program_length;
|
|
|
2312 Opbyte *program;
|
|
|
2313
|
|
|
2314 CHECK_STRING (instructions);
|
|
|
2315 CHECK_VECTOR (constants);
|
|
|
2316 CHECK_NATNUM (stack_depth);
|
|
|
2317
|
|
|
2318 /* Optimize the `instructions' string, just like when executing a
|
|
|
2319 regular compiled function, but don't save it for later since this is
|
|
|
2320 likely to only be executed once. */
|
|
|
2321 program = alloca_array (Opbyte, 1 + 2 * XSTRING_LENGTH (instructions));
|
|
|
2322 optimize_byte_code (instructions, constants, program,
|
|
|
2323 &program_length, &varbind_count);
|
|
|
2324 SPECPDL_RESERVE (varbind_count);
|
|
|
2325 return execute_optimized_program (program,
|
|
|
2326 XINT (stack_depth),
|
|
|
2327 XVECTOR_DATA (constants));
|
|
|
2328 }
|
|
|
2329
|
|
|
2330
|
|
|
2331 void
|
|
|
2332 syms_of_bytecode (void)
|
|
|
2333 {
|
|
442
|
2334 INIT_LRECORD_IMPLEMENTATION (compiled_function);
|
|
|
2335
|
|
|
2336 DEFERROR_STANDARD (Qinvalid_byte_code, Qinvalid_state);
|
|
563
|
2337 DEFSYMBOL (Qbyte_code);
|
|
|
2338 DEFSYMBOL_MULTIWORD_PREDICATE (Qcompiled_functionp);
|
|
428
|
2339
|
|
|
2340 DEFSUBR (Fbyte_code);
|
|
|
2341 DEFSUBR (Ffetch_bytecode);
|
|
|
2342 DEFSUBR (Foptimize_compiled_function);
|
|
|
2343
|
|
|
2344 DEFSUBR (Fcompiled_function_p);
|
|
|
2345 DEFSUBR (Fcompiled_function_instructions);
|
|
|
2346 DEFSUBR (Fcompiled_function_constants);
|
|
|
2347 DEFSUBR (Fcompiled_function_stack_depth);
|
|
|
2348 DEFSUBR (Fcompiled_function_arglist);
|
|
|
2349 DEFSUBR (Fcompiled_function_interactive);
|
|
|
2350 DEFSUBR (Fcompiled_function_doc_string);
|
|
|
2351 DEFSUBR (Fcompiled_function_domain);
|
|
|
2352 #ifdef COMPILED_FUNCTION_ANNOTATION_HACK
|
|
|
2353 DEFSUBR (Fcompiled_function_annotation);
|
|
|
2354 #endif
|
|
|
2355
|
|
|
2356 #ifdef BYTE_CODE_METER
|
|
563
|
2357 DEFSYMBOL (Qbyte_code_meter);
|
|
428
|
2358 #endif
|
|
|
2359 }
|
|
|
2360
|
|
|
2361 void
|
|
|
2362 vars_of_bytecode (void)
|
|
|
2363 {
|
|
|
2364 #ifdef BYTE_CODE_METER
|
|
|
2365
|
|
|
2366 DEFVAR_LISP ("byte-code-meter", &Vbyte_code_meter /*
|
|
|
2367 A vector of vectors which holds a histogram of byte code usage.
|
|
|
2368 \(aref (aref byte-code-meter 0) CODE) indicates how many times the byte
|
|
|
2369 opcode CODE has been executed.
|
|
|
2370 \(aref (aref byte-code-meter CODE1) CODE2), where CODE1 is not 0,
|
|
|
2371 indicates how many times the byte opcodes CODE1 and CODE2 have been
|
|
|
2372 executed in succession.
|
|
|
2373 */ );
|
|
|
2374 DEFVAR_BOOL ("byte-metering-on", &byte_metering_on /*
|
|
|
2375 If non-nil, keep profiling information on byte code usage.
|
|
|
2376 The variable `byte-code-meter' indicates how often each byte opcode is used.
|
|
|
2377 If a symbol has a property named `byte-code-meter' whose value is an
|
|
|
2378 integer, it is incremented each time that symbol's function is called.
|
|
|
2379 */ );
|
|
|
2380
|
|
|
2381 byte_metering_on = 0;
|
|
|
2382 Vbyte_code_meter = make_vector (256, Qzero);
|
|
|
2383 {
|
|
|
2384 int i = 256;
|
|
|
2385 while (i--)
|
|
|
2386 XVECTOR_DATA (Vbyte_code_meter)[i] = make_vector (256, Qzero);
|
|
|
2387 }
|
|
|
2388 #endif /* BYTE_CODE_METER */
|
|
|
2389 }
|
