1 /* Execution of byte code produced by bytecomp.el.
2 Copyright (C) 1985, 1986, 1987, 1988, 1993 Free Software Foundation, Inc.
4 This file is part of GNU Emacs.
6 GNU Emacs is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU Emacs is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU Emacs; see the file COPYING. If not, write to
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA.
21 hacked on by jwz@lucid.com 17-jun-91
22 o added a compile-time switch to turn on simple sanity checking;
23 o put back the obsolete byte-codes for error-detection;
24 o added a new instruction, unbind_all, which I will use for
25 tail-recursion elimination;
26 o made temp_output_buffer_show be called with the right number
28 o made the new bytecodes be called with args in the right order;
29 o added metering support.
32 o added relative jump instructions;
33 o all conditionals now only do QUIT if they jump.
43 * define BYTE_CODE_SAFE to enable some minor sanity checking (useful for
44 * debugging the byte compiler...)
46 * define BYTE_CODE_METER to enable generation of a byte-op usage histogram.
48 /* #define BYTE_CODE_SAFE */
49 /* #define BYTE_CODE_METER */
52 #ifdef BYTE_CODE_METER
54 Lisp_Object Vbyte_code_meter
, Qbyte_code_meter
;
57 #define METER_2(code1, code2) \
58 XFASTINT (XVECTOR (XVECTOR (Vbyte_code_meter)->contents[(code1)]) \
61 #define METER_1(code) METER_2 (0, (code))
63 #define METER_CODE(last_code, this_code) \
65 if (byte_metering_on) \
67 if (METER_1 (this_code) != ((1<<VALBITS)-1)) \
68 METER_1 (this_code)++; \
70 && METER_2 (last_code, this_code) != ((1<<VALBITS)-1))\
71 METER_2 (last_code, this_code)++; \
75 #else /* no BYTE_CODE_METER */
77 #define METER_CODE(last_code, this_code)
79 #endif /* no BYTE_CODE_METER */
82 Lisp_Object Qbytecode
;
110 #define Bsymbol_value 0112
111 #define Bsymbol_function 0113
115 #define Bsubstring 0117
116 #define Bconcat2 0120
117 #define Bconcat3 0121
118 #define Bconcat4 0122
121 #define Beqlsign 0125
134 /* Was Bmark in v17. */
135 #define Bsave_current_buffer 0141
136 #define Bgoto_char 0142
138 #define Bpoint_max 0144
139 #define Bpoint_min 0145
140 #define Bchar_after 0146
141 #define Bfollowing_char 0147
142 #define Bpreceding_char 0150
143 #define Bcurrent_column 0151
144 #define Bindent_to 0152
145 #define Bscan_buffer 0153 /* No longer generated as of v18 */
150 #define Bcurrent_buffer 0160
151 #define Bset_buffer 0161
152 #define Bsave_current_buffer_1 0162 /* Replacing Bsave_current_buffer. */
153 #define Bread_char 0162 /* No longer generated as of v19 */
154 #define Bset_mark 0163 /* this loser is no longer generated as of v18 */
155 #define Binteractive_p 0164 /* Needed since interactive-p takes unevalled args */
157 #define Bforward_char 0165
158 #define Bforward_word 0166
159 #define Bskip_chars_forward 0167
160 #define Bskip_chars_backward 0170
161 #define Bforward_line 0171
162 #define Bchar_syntax 0172
163 #define Bbuffer_substring 0173
164 #define Bdelete_region 0174
165 #define Bnarrow_to_region 0175
167 #define Bend_of_line 0177
169 #define Bconstant2 0201
171 #define Bgotoifnil 0203
172 #define Bgotoifnonnil 0204
173 #define Bgotoifnilelsepop 0205
174 #define Bgotoifnonnilelsepop 0206
176 #define Bdiscard 0210
179 #define Bsave_excursion 0212
180 #define Bsave_window_excursion 0213
181 #define Bsave_restriction 0214
184 #define Bunwind_protect 0216
185 #define Bcondition_case 0217
186 #define Btemp_output_buffer_setup 0220
187 #define Btemp_output_buffer_show 0221
189 #define Bunbind_all 0222
191 #define Bset_marker 0223
192 #define Bmatch_beginning 0224
193 #define Bmatch_end 0225
195 #define Bdowncase 0227
197 #define Bstringeqlsign 0230
198 #define Bstringlss 0231
204 #define Bnreverse 0237
207 #define Bcar_safe 0242
208 #define Bcdr_safe 0243
212 #define Bnumberp 0247
213 #define Bintegerp 0250
216 #define BRgotoifnil 0253
217 #define BRgotoifnonnil 0254
218 #define BRgotoifnilelsepop 0255
219 #define BRgotoifnonnilelsepop 0256
222 #define BconcatN 0260
223 #define BinsertN 0261
225 #define Bconstant 0300
226 #define CONSTANTLIM 0100
229 /* Structure describing a value stack used during byte-code execution
234 /* Program counter. This points into the byte_string below
235 and is relocated when that string is relocated. */
238 /* Top and bottom of stack. The bottom points to an area of memory
239 allocated with alloca in Fbyte_code. */
240 Lisp_Object
*top
, *bottom
;
242 /* The string containing the byte-code, and its current address.
243 Storing this here protects it from GC because mark_byte_stack
245 Lisp_Object byte_string
;
246 unsigned char *byte_string_start
;
248 /* The vector of constants used during byte-code execution. Storing
249 this here protects it from GC because mark_byte_stack marks it. */
250 Lisp_Object constants
;
252 /* Next entry in byte_stack_list. */
253 struct byte_stack
*next
;
256 /* A list of currently active byte-code execution value stacks.
257 Fbyte_code adds an entry to the head of this list before it starts
258 processing byte-code, and it removed the entry again when it is
259 done. Signalling an error truncates the list analoguous to
262 struct byte_stack
*byte_stack_list
;
265 /* Mark objects on byte_stack_list. Called during GC. */
270 struct byte_stack
*stack
;
273 for (stack
= byte_stack_list
; stack
; stack
= stack
->next
)
278 for (obj
= stack
->bottom
; obj
<= stack
->top
; ++obj
)
279 if (!XMARKBIT (*obj
))
285 if (!XMARKBIT (stack
->byte_string
))
287 mark_object (&stack
->byte_string
);
288 XMARK (stack
->byte_string
);
291 if (!XMARKBIT (stack
->constants
))
293 mark_object (&stack
->constants
);
294 XMARK (stack
->constants
);
300 /* Unmark objects in the stacks on byte_stack_list. Relocate program
301 counters. Called when GC has completed. */
306 struct byte_stack
*stack
;
309 for (stack
= byte_stack_list
; stack
; stack
= stack
->next
)
311 for (obj
= stack
->bottom
; obj
<= stack
->top
; ++obj
)
314 XUNMARK (stack
->byte_string
);
315 XUNMARK (stack
->constants
);
317 if (stack
->byte_string_start
!= XSTRING (stack
->byte_string
)->data
)
319 int offset
= stack
->pc
- stack
->byte_string_start
;
320 stack
->byte_string_start
= XSTRING (stack
->byte_string
)->data
;
321 stack
->pc
= stack
->byte_string_start
+ offset
;
327 /* Fetch the next byte from the bytecode stream */
329 #define FETCH *stack.pc++
331 /* Fetch two bytes from the bytecode stream and make a 16-bit number
334 #define FETCH2 (op = FETCH, op + (FETCH << 8))
336 /* Push x onto the execution stack. This used to be #define PUSH(x)
337 (*++stackp = (x)) This oddity is necessary because Alliant can't be
338 bothered to compile the preincrement operator properly, as of 4/91.
341 #define PUSH(x) (top++, *top = (x))
343 /* Pop a value off the execution stack. */
347 /* Discard n values from the execution stack. */
349 #define DISCARD(n) (top -= (n))
351 /* Get the value which is at the top of the execution stack, but don't
356 /* Actions that must be performed before and after calling a function
359 #define BEFORE_POTENTIAL_GC() stack.top = top
360 #define AFTER_POTENTIAL_GC() stack.top = NULL
362 /* Garbage collect if we have consed enough since the last time.
363 We do this at every branch, to avoid loops that never GC. */
366 if (consing_since_gc > gc_cons_threshold) \
368 BEFORE_POTENTIAL_GC (); \
369 Fgarbage_collect (); \
370 AFTER_POTENTIAL_GC (); \
374 /* Check for jumping out of range. */
376 #ifdef BYTE_CODE_SAFE
378 #define CHECK_RANGE(ARG) \
379 if (ARG >= bytestr_length) abort ()
381 #else /* not BYTE_CODE_SAFE */
383 #define CHECK_RANGE(ARG)
385 #endif /* not BYTE_CODE_SAFE */
388 DEFUN ("byte-code", Fbyte_code
, Sbyte_code
, 3, 3, 0,
389 "Function used internally in byte-compiled code.\n\
390 The first argument, BYTESTR, is a string of byte code;\n\
391 the second, VECTOR, a vector of constants;\n\
392 the third, MAXDEPTH, the maximum stack depth used in this function.\n\
393 If the third argument is incorrect, Emacs may crash.")
394 (bytestr
, vector
, maxdepth
)
395 Lisp_Object bytestr
, vector
, maxdepth
;
397 int count
= specpdl_ptr
- specpdl
;
398 #ifdef BYTE_CODE_METER
403 /* Lisp_Object v1, v2; */
404 Lisp_Object
*vectorp
= XVECTOR (vector
)->contents
;
405 #ifdef BYTE_CODE_SAFE
406 int const_length
= XVECTOR (vector
)->size
;
409 int bytestr_length
= STRING_BYTES (XSTRING (bytestr
));
410 struct byte_stack stack
;
414 CHECK_STRING (bytestr
, 0);
415 if (!VECTORP (vector
))
416 vector
= wrong_type_argument (Qvectorp
, vector
);
417 CHECK_NUMBER (maxdepth
, 2);
419 stack
.byte_string
= bytestr
;
420 stack
.pc
= stack
.byte_string_start
= XSTRING (bytestr
)->data
;
421 stack
.constants
= vector
;
422 stack
.bottom
= (Lisp_Object
*) alloca (XFASTINT (maxdepth
)
423 * sizeof (Lisp_Object
));
424 top
= stack
.bottom
- 1;
426 stack
.next
= byte_stack_list
;
427 byte_stack_list
= &stack
;
429 #ifdef BYTE_CODE_SAFE
430 stacke
= stack
.bottom
- 1 + XFASTINT (maxdepth
);
435 #ifdef BYTE_CODE_SAFE
438 else if (top
< stack
.bottom
- 1)
442 #ifdef BYTE_CODE_METER
444 this_op
= op
= FETCH
;
445 METER_CODE (prev_op
, op
);
465 /* This seems to be the most frequently executed byte-code
466 among the Bvarref's, so avoid a goto here. */
476 v2
= XSYMBOL (v1
)->value
;
477 if (MISCP (v2
) || EQ (v2
, Qunbound
))
479 BEFORE_POTENTIAL_GC ();
480 v2
= Fsymbol_value (v1
);
481 AFTER_POTENTIAL_GC ();
486 BEFORE_POTENTIAL_GC ();
487 v2
= Fsymbol_value (v1
);
488 AFTER_POTENTIAL_GC ();
501 stack
.pc
= stack
.byte_string_start
+ op
;
515 BEFORE_POTENTIAL_GC ();
516 Fcar (wrong_type_argument (Qlistp
, v1
));
517 AFTER_POTENTIAL_GC ();
526 TOP
= EQ (v1
, TOP
) ? Qt
: Qnil
;
533 BEFORE_POTENTIAL_GC ();
535 TOP
= Fmemq (TOP
, v1
);
536 AFTER_POTENTIAL_GC ();
550 BEFORE_POTENTIAL_GC ();
551 Fcdr (wrong_type_argument (Qlistp
, v1
));
552 AFTER_POTENTIAL_GC ();
574 Lisp_Object sym
, val
;
579 /* Inline the most common case. */
581 && !EQ (val
, Qunbound
)
582 && !MISCP (XSYMBOL (sym
)->value
)
583 /* I think this should either be checked in the byte
584 compiler, or there should be a flag indicating that
585 a symbol might be constant in Lisp_Symbol, instead
586 of checking this here over and over again. --gerd. */
589 && !(XSYMBOL (sym
)->name
->data
[0] == ':'
590 && EQ (XSYMBOL (sym
)->obarray
, initial_obarray
)
592 XSYMBOL (sym
)->value
= val
;
595 BEFORE_POTENTIAL_GC ();
596 set_internal (sym
, val
, current_buffer
, 0);
597 AFTER_POTENTIAL_GC ();
611 /* ------------------ */
629 specbind (vectorp
[op
], POP
);
649 BEFORE_POTENTIAL_GC ();
651 #ifdef BYTE_CODE_METER
652 if (byte_metering_on
&& SYMBOLP (TOP
))
657 v2
= Fget (v1
, Qbyte_code_meter
);
659 && XINT (v2
) != ((1<<VALBITS
)-1))
661 XSETINT (v2
, XINT (v2
) + 1);
662 Fput (v1
, Qbyte_code_meter
, v2
);
666 TOP
= Ffuncall (op
+ 1, &TOP
);
667 AFTER_POTENTIAL_GC ();
687 BEFORE_POTENTIAL_GC ();
688 unbind_to (specpdl_ptr
- specpdl
- op
, Qnil
);
689 AFTER_POTENTIAL_GC ();
693 /* To unbind back to the beginning of this frame. Not used yet,
694 but will be needed for tail-recursion elimination. */
695 BEFORE_POTENTIAL_GC ();
696 unbind_to (count
, Qnil
);
697 AFTER_POTENTIAL_GC ();
703 op
= FETCH2
; /* pc = FETCH2 loses since FETCH2 contains pc++ */
705 stack
.pc
= stack
.byte_string_start
+ op
;
715 stack
.pc
= stack
.byte_string_start
+ op
;
719 case Bgotoifnilelsepop
:
726 stack
.pc
= stack
.byte_string_start
+ op
;
731 case Bgotoifnonnilelsepop
:
738 stack
.pc
= stack
.byte_string_start
+ op
;
746 stack
.pc
+= (int) *stack
.pc
- 127;
754 stack
.pc
+= (int) *stack
.pc
- 128;
764 stack
.pc
+= (int) *stack
.pc
- 128;
769 case BRgotoifnilelsepop
:
775 stack
.pc
+= op
- 128;
780 case BRgotoifnonnilelsepop
:
786 stack
.pc
+= op
- 128;
800 PUSH (vectorp
[FETCH2
]);
803 case Bsave_excursion
:
804 record_unwind_protect (save_excursion_restore
,
805 save_excursion_save ());
808 case Bsave_current_buffer
:
809 case Bsave_current_buffer_1
:
810 record_unwind_protect (set_buffer_if_live
, Fcurrent_buffer ());
813 case Bsave_window_excursion
:
814 BEFORE_POTENTIAL_GC ();
815 TOP
= Fsave_window_excursion (TOP
);
816 AFTER_POTENTIAL_GC ();
819 case Bsave_restriction
:
820 record_unwind_protect (save_restriction_restore
,
821 save_restriction_save ());
827 BEFORE_POTENTIAL_GC ();
829 TOP
= internal_catch (TOP
, Feval
, v1
);
830 AFTER_POTENTIAL_GC ();
834 case Bunwind_protect
:
835 record_unwind_protect (0, POP
);
836 (specpdl_ptr
- 1)->symbol
= Qnil
;
839 case Bcondition_case
:
843 v1
= Fcons (POP
, v1
);
844 BEFORE_POTENTIAL_GC ();
845 TOP
= Fcondition_case (Fcons (TOP
, v1
));
846 AFTER_POTENTIAL_GC ();
850 case Btemp_output_buffer_setup
:
851 BEFORE_POTENTIAL_GC ();
852 temp_output_buffer_setup (XSTRING (TOP
)->data
);
853 AFTER_POTENTIAL_GC ();
854 TOP
= Vstandard_output
;
857 case Btemp_output_buffer_show
:
860 BEFORE_POTENTIAL_GC ();
862 temp_output_buffer_show (TOP
);
864 /* pop binding of standard-output */
865 unbind_to (specpdl_ptr
- specpdl
- 1, Qnil
);
866 AFTER_POTENTIAL_GC ();
873 BEFORE_POTENTIAL_GC ();
876 CHECK_NUMBER (v2
, 0);
877 AFTER_POTENTIAL_GC ();
887 BEFORE_POTENTIAL_GC ();
888 v1
= wrong_type_argument (Qlistp
, v1
);
889 AFTER_POTENTIAL_GC ();
901 BEFORE_POTENTIAL_GC ();
902 Fcar (wrong_type_argument (Qlistp
, v1
));
903 AFTER_POTENTIAL_GC ();
909 TOP
= SYMBOLP (TOP
) ? Qt
: Qnil
;
913 TOP
= CONSP (TOP
) ? Qt
: Qnil
;
917 TOP
= STRINGP (TOP
) ? Qt
: Qnil
;
921 TOP
= CONSP (TOP
) || NILP (TOP
) ? Qt
: Qnil
;
925 TOP
= NILP (TOP
) ? Qt
: Qnil
;
932 TOP
= Fcons (TOP
, v1
);
937 TOP
= Fcons (TOP
, Qnil
);
944 TOP
= Fcons (TOP
, Fcons (v1
, Qnil
));
950 TOP
= Flist (3, &TOP
);
955 TOP
= Flist (4, &TOP
);
961 TOP
= Flist (op
, &TOP
);
965 BEFORE_POTENTIAL_GC ();
967 AFTER_POTENTIAL_GC ();
973 BEFORE_POTENTIAL_GC ();
975 TOP
= Faref (TOP
, v1
);
976 AFTER_POTENTIAL_GC ();
983 BEFORE_POTENTIAL_GC ();
985 TOP
= Faset (TOP
, v1
, v2
);
986 AFTER_POTENTIAL_GC ();
991 BEFORE_POTENTIAL_GC ();
992 TOP
= Fsymbol_value (TOP
);
993 AFTER_POTENTIAL_GC ();
996 case Bsymbol_function
:
997 BEFORE_POTENTIAL_GC ();
998 TOP
= Fsymbol_function (TOP
);
999 AFTER_POTENTIAL_GC ();
1005 BEFORE_POTENTIAL_GC ();
1007 TOP
= Fset (TOP
, v1
);
1008 AFTER_POTENTIAL_GC ();
1015 BEFORE_POTENTIAL_GC ();
1017 TOP
= Ffset (TOP
, v1
);
1018 AFTER_POTENTIAL_GC ();
1025 BEFORE_POTENTIAL_GC ();
1027 TOP
= Fget (TOP
, v1
);
1028 AFTER_POTENTIAL_GC ();
1035 BEFORE_POTENTIAL_GC ();
1037 TOP
= Fsubstring (TOP
, v1
, v2
);
1038 AFTER_POTENTIAL_GC ();
1043 BEFORE_POTENTIAL_GC ();
1045 TOP
= Fconcat (2, &TOP
);
1046 AFTER_POTENTIAL_GC ();
1050 BEFORE_POTENTIAL_GC ();
1052 TOP
= Fconcat (3, &TOP
);
1053 AFTER_POTENTIAL_GC ();
1057 BEFORE_POTENTIAL_GC ();
1059 TOP
= Fconcat (4, &TOP
);
1060 AFTER_POTENTIAL_GC ();
1065 BEFORE_POTENTIAL_GC ();
1067 TOP
= Fconcat (op
, &TOP
);
1068 AFTER_POTENTIAL_GC ();
1077 XSETINT (v1
, XINT (v1
) - 1);
1091 XSETINT (v1
, XINT (v1
) + 1);
1096 BEFORE_POTENTIAL_GC ();
1098 AFTER_POTENTIAL_GC ();
1106 BEFORE_POTENTIAL_GC ();
1108 CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v1
, 0);
1109 CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v2
, 0);
1110 AFTER_POTENTIAL_GC ();
1111 if (FLOATP (v1
) || FLOATP (v2
))
1115 f1
= (FLOATP (v1
) ? XFLOAT_DATA (v1
) : XINT (v1
));
1116 f2
= (FLOATP (v2
) ? XFLOAT_DATA (v2
) : XINT (v2
));
1117 TOP
= (f1
== f2
? Qt
: Qnil
);
1120 TOP
= (XINT (v1
) == XINT (v2
) ? Qt
: Qnil
);
1127 BEFORE_POTENTIAL_GC ();
1129 TOP
= Fgtr (TOP
, v1
);
1130 AFTER_POTENTIAL_GC ();
1137 BEFORE_POTENTIAL_GC ();
1139 TOP
= Flss (TOP
, v1
);
1140 AFTER_POTENTIAL_GC ();
1147 BEFORE_POTENTIAL_GC ();
1149 TOP
= Fleq (TOP
, v1
);
1150 AFTER_POTENTIAL_GC ();
1158 TOP
= Fgeq (TOP
, v1
);
1163 BEFORE_POTENTIAL_GC ();
1165 TOP
= Fminus (2, &TOP
);
1166 AFTER_POTENTIAL_GC ();
1175 XSETINT (v1
, - XINT (v1
));
1180 BEFORE_POTENTIAL_GC ();
1181 TOP
= Fminus (1, &TOP
);
1182 AFTER_POTENTIAL_GC ();
1188 BEFORE_POTENTIAL_GC ();
1190 TOP
= Fplus (2, &TOP
);
1191 AFTER_POTENTIAL_GC ();
1195 BEFORE_POTENTIAL_GC ();
1197 TOP
= Fmax (2, &TOP
);
1198 AFTER_POTENTIAL_GC ();
1202 BEFORE_POTENTIAL_GC ();
1204 TOP
= Fmin (2, &TOP
);
1205 AFTER_POTENTIAL_GC ();
1209 BEFORE_POTENTIAL_GC ();
1211 TOP
= Ftimes (2, &TOP
);
1212 AFTER_POTENTIAL_GC ();
1216 BEFORE_POTENTIAL_GC ();
1218 TOP
= Fquo (2, &TOP
);
1219 AFTER_POTENTIAL_GC ();
1225 BEFORE_POTENTIAL_GC ();
1227 TOP
= Frem (TOP
, v1
);
1228 AFTER_POTENTIAL_GC ();
1235 XSETFASTINT (v1
, PT
);
1241 BEFORE_POTENTIAL_GC ();
1242 TOP
= Fgoto_char (TOP
);
1243 AFTER_POTENTIAL_GC ();
1247 BEFORE_POTENTIAL_GC ();
1248 TOP
= Finsert (1, &TOP
);
1249 AFTER_POTENTIAL_GC ();
1254 BEFORE_POTENTIAL_GC ();
1256 TOP
= Finsert (op
, &TOP
);
1257 AFTER_POTENTIAL_GC ();
1263 XSETFASTINT (v1
, ZV
);
1271 XSETFASTINT (v1
, BEGV
);
1277 BEFORE_POTENTIAL_GC ();
1278 TOP
= Fchar_after (TOP
);
1279 AFTER_POTENTIAL_GC ();
1282 case Bfollowing_char
:
1285 BEFORE_POTENTIAL_GC ();
1286 v1
= Ffollowing_char ();
1287 AFTER_POTENTIAL_GC ();
1292 case Bpreceding_char
:
1295 BEFORE_POTENTIAL_GC ();
1296 v1
= Fprevious_char ();
1297 AFTER_POTENTIAL_GC ();
1302 case Bcurrent_column
:
1305 XSETFASTINT (v1
, current_column ());
1311 BEFORE_POTENTIAL_GC ();
1312 TOP
= Findent_to (TOP
, Qnil
);
1313 AFTER_POTENTIAL_GC ();
1332 case Bcurrent_buffer
:
1333 PUSH (Fcurrent_buffer ());
1337 BEFORE_POTENTIAL_GC ();
1338 TOP
= Fset_buffer (TOP
);
1339 AFTER_POTENTIAL_GC ();
1342 case Binteractive_p
:
1343 PUSH (Finteractive_p ());
1347 BEFORE_POTENTIAL_GC ();
1348 TOP
= Fforward_char (TOP
);
1349 AFTER_POTENTIAL_GC ();
1353 BEFORE_POTENTIAL_GC ();
1354 TOP
= Fforward_word (TOP
);
1355 AFTER_POTENTIAL_GC ();
1358 case Bskip_chars_forward
:
1361 BEFORE_POTENTIAL_GC ();
1363 TOP
= Fskip_chars_forward (TOP
, v1
);
1364 AFTER_POTENTIAL_GC ();
1368 case Bskip_chars_backward
:
1371 BEFORE_POTENTIAL_GC ();
1373 TOP
= Fskip_chars_backward (TOP
, v1
);
1374 AFTER_POTENTIAL_GC ();
1379 BEFORE_POTENTIAL_GC ();
1380 TOP
= Fforward_line (TOP
);
1381 AFTER_POTENTIAL_GC ();
1385 BEFORE_POTENTIAL_GC ();
1386 CHECK_NUMBER (TOP
, 0);
1387 AFTER_POTENTIAL_GC ();
1388 XSETFASTINT (TOP
, syntax_code_spec
[(int) SYNTAX (XINT (TOP
))]);
1391 case Bbuffer_substring
:
1394 BEFORE_POTENTIAL_GC ();
1396 TOP
= Fbuffer_substring (TOP
, v1
);
1397 AFTER_POTENTIAL_GC ();
1401 case Bdelete_region
:
1404 BEFORE_POTENTIAL_GC ();
1406 TOP
= Fdelete_region (TOP
, v1
);
1407 AFTER_POTENTIAL_GC ();
1411 case Bnarrow_to_region
:
1414 BEFORE_POTENTIAL_GC ();
1416 TOP
= Fnarrow_to_region (TOP
, v1
);
1417 AFTER_POTENTIAL_GC ();
1422 BEFORE_POTENTIAL_GC ();
1424 AFTER_POTENTIAL_GC ();
1428 BEFORE_POTENTIAL_GC ();
1429 TOP
= Fend_of_line (TOP
);
1430 AFTER_POTENTIAL_GC ();
1436 BEFORE_POTENTIAL_GC ();
1439 TOP
= Fset_marker (TOP
, v2
, v1
);
1440 AFTER_POTENTIAL_GC ();
1444 case Bmatch_beginning
:
1445 BEFORE_POTENTIAL_GC ();
1446 TOP
= Fmatch_beginning (TOP
);
1447 AFTER_POTENTIAL_GC ();
1451 BEFORE_POTENTIAL_GC ();
1452 TOP
= Fmatch_end (TOP
);
1453 AFTER_POTENTIAL_GC ();
1457 BEFORE_POTENTIAL_GC ();
1458 TOP
= Fupcase (TOP
);
1459 AFTER_POTENTIAL_GC ();
1463 BEFORE_POTENTIAL_GC ();
1464 TOP
= Fdowncase (TOP
);
1465 AFTER_POTENTIAL_GC ();
1468 case Bstringeqlsign
:
1471 BEFORE_POTENTIAL_GC ();
1473 TOP
= Fstring_equal (TOP
, v1
);
1474 AFTER_POTENTIAL_GC ();
1481 BEFORE_POTENTIAL_GC ();
1483 TOP
= Fstring_lessp (TOP
, v1
);
1484 AFTER_POTENTIAL_GC ();
1492 TOP
= Fequal (TOP
, v1
);
1499 BEFORE_POTENTIAL_GC ();
1501 TOP
= Fnthcdr (TOP
, v1
);
1502 AFTER_POTENTIAL_GC ();
1511 /* Exchange args and then do nth. */
1512 BEFORE_POTENTIAL_GC ();
1515 CHECK_NUMBER (v2
, 0);
1516 AFTER_POTENTIAL_GC ();
1523 else if (!NILP (v1
))
1526 BEFORE_POTENTIAL_GC ();
1527 v1
= wrong_type_argument (Qlistp
, v1
);
1528 AFTER_POTENTIAL_GC ();
1540 BEFORE_POTENTIAL_GC ();
1541 Fcar (wrong_type_argument (Qlistp
, v1
));
1542 AFTER_POTENTIAL_GC ();
1547 BEFORE_POTENTIAL_GC ();
1549 TOP
= Felt (TOP
, v1
);
1550 AFTER_POTENTIAL_GC ();
1558 BEFORE_POTENTIAL_GC ();
1560 TOP
= Fmember (TOP
, v1
);
1561 AFTER_POTENTIAL_GC ();
1568 BEFORE_POTENTIAL_GC ();
1570 TOP
= Fassq (TOP
, v1
);
1571 AFTER_POTENTIAL_GC ();
1576 BEFORE_POTENTIAL_GC ();
1577 TOP
= Fnreverse (TOP
);
1578 AFTER_POTENTIAL_GC ();
1584 BEFORE_POTENTIAL_GC ();
1586 TOP
= Fsetcar (TOP
, v1
);
1587 AFTER_POTENTIAL_GC ();
1594 BEFORE_POTENTIAL_GC ();
1596 TOP
= Fsetcdr (TOP
, v1
);
1597 AFTER_POTENTIAL_GC ();
1624 BEFORE_POTENTIAL_GC ();
1626 TOP
= Fnconc (2, &TOP
);
1627 AFTER_POTENTIAL_GC ();
1631 TOP
= (NUMBERP (TOP
) ? Qt
: Qnil
);
1635 TOP
= INTEGERP (TOP
) ? Qt
: Qnil
;
1638 #ifdef BYTE_CODE_SAFE
1640 BEFORE_POTENTIAL_GC ();
1641 error ("set-mark is an obsolete bytecode");
1642 AFTER_POTENTIAL_GC ();
1645 BEFORE_POTENTIAL_GC ();
1646 error ("scan-buffer is an obsolete bytecode");
1647 AFTER_POTENTIAL_GC ();
1656 #ifdef BYTE_CODE_SAFE
1661 if ((op
-= Bconstant
) >= const_length
)
1667 PUSH (vectorp
[op
- Bconstant
]);
1674 byte_stack_list
= byte_stack_list
->next
;
1676 /* Binds and unbinds are supposed to be compiled balanced. */
1677 if (specpdl_ptr
- specpdl
!= count
)
1678 #ifdef BYTE_CODE_SAFE
1679 error ("binding stack not balanced (serious byte compiler bug)");
1690 Qbytecode
= intern ("byte-code");
1691 staticpro (&Qbytecode
);
1693 defsubr (&Sbyte_code
);
1695 #ifdef BYTE_CODE_METER
1697 DEFVAR_LISP ("byte-code-meter", &Vbyte_code_meter
,
1698 "A vector of vectors which holds a histogram of byte-code usage.\n\
1699 (aref (aref byte-code-meter 0) CODE) indicates how many times the byte\n\
1700 opcode CODE has been executed.\n\
1701 (aref (aref byte-code-meter CODE1) CODE2), where CODE1 is not 0,\n\
1702 indicates how many times the byte opcodes CODE1 and CODE2 have been\n\
1703 executed in succession.");
1704 DEFVAR_BOOL ("byte-metering-on", &byte_metering_on
,
1705 "If non-nil, keep profiling information on byte code usage.\n\
1706 The variable byte-code-meter indicates how often each byte opcode is used.\n\
1707 If a symbol has a property named `byte-code-meter' whose value is an\n\
1708 integer, it is incremented each time that symbol's function is called.");
1710 byte_metering_on
= 0;
1711 Vbyte_code_meter
= Fmake_vector (make_number (256), make_number (0));
1712 Qbyte_code_meter
= intern ("byte-code-meter");
1713 staticpro (&Qbyte_code_meter
);
1717 XVECTOR (Vbyte_code_meter
)->contents
[i
] =
1718 Fmake_vector (make_number (256), make_number (0));