1 /* Execution of byte code produced by bytecomp.el.
2 Copyright (C) 1985, 1986, 1987, 1988, 1993, 2000 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.
42 #ifdef CHECK_FRAME_FONT
48 * define BYTE_CODE_SAFE to enable some minor sanity checking (useful for
49 * debugging the byte compiler...)
51 * define BYTE_CODE_METER to enable generation of a byte-op usage histogram.
53 /* #define BYTE_CODE_SAFE */
54 /* #define BYTE_CODE_METER */
57 #ifdef BYTE_CODE_METER
59 Lisp_Object Vbyte_code_meter
, Qbyte_code_meter
;
62 #define METER_2(code1, code2) \
63 XFASTINT (XVECTOR (XVECTOR (Vbyte_code_meter)->contents[(code1)]) \
66 #define METER_1(code) METER_2 (0, (code))
68 #define METER_CODE(last_code, this_code) \
70 if (byte_metering_on) \
72 if (METER_1 (this_code) != ((1<<VALBITS)-1)) \
73 METER_1 (this_code)++; \
75 && METER_2 (last_code, this_code) != ((1<<VALBITS)-1))\
76 METER_2 (last_code, this_code)++; \
80 #else /* no BYTE_CODE_METER */
82 #define METER_CODE(last_code, this_code)
84 #endif /* no BYTE_CODE_METER */
87 Lisp_Object Qbytecode
;
115 #define Bsymbol_value 0112
116 #define Bsymbol_function 0113
120 #define Bsubstring 0117
121 #define Bconcat2 0120
122 #define Bconcat3 0121
123 #define Bconcat4 0122
126 #define Beqlsign 0125
139 /* Was Bmark in v17. */
140 #define Bsave_current_buffer 0141
141 #define Bgoto_char 0142
143 #define Bpoint_max 0144
144 #define Bpoint_min 0145
145 #define Bchar_after 0146
146 #define Bfollowing_char 0147
147 #define Bpreceding_char 0150
148 #define Bcurrent_column 0151
149 #define Bindent_to 0152
150 #define Bscan_buffer 0153 /* No longer generated as of v18 */
155 #define Bcurrent_buffer 0160
156 #define Bset_buffer 0161
157 #define Bsave_current_buffer_1 0162 /* Replacing Bsave_current_buffer. */
158 #define Bread_char 0162 /* No longer generated as of v19 */
159 #define Bset_mark 0163 /* this loser is no longer generated as of v18 */
160 #define Binteractive_p 0164 /* Needed since interactive-p takes unevalled args */
162 #define Bforward_char 0165
163 #define Bforward_word 0166
164 #define Bskip_chars_forward 0167
165 #define Bskip_chars_backward 0170
166 #define Bforward_line 0171
167 #define Bchar_syntax 0172
168 #define Bbuffer_substring 0173
169 #define Bdelete_region 0174
170 #define Bnarrow_to_region 0175
172 #define Bend_of_line 0177
174 #define Bconstant2 0201
176 #define Bgotoifnil 0203
177 #define Bgotoifnonnil 0204
178 #define Bgotoifnilelsepop 0205
179 #define Bgotoifnonnilelsepop 0206
181 #define Bdiscard 0210
184 #define Bsave_excursion 0212
185 #define Bsave_window_excursion 0213
186 #define Bsave_restriction 0214
189 #define Bunwind_protect 0216
190 #define Bcondition_case 0217
191 #define Btemp_output_buffer_setup 0220
192 #define Btemp_output_buffer_show 0221
194 #define Bunbind_all 0222
196 #define Bset_marker 0223
197 #define Bmatch_beginning 0224
198 #define Bmatch_end 0225
200 #define Bdowncase 0227
202 #define Bstringeqlsign 0230
203 #define Bstringlss 0231
209 #define Bnreverse 0237
212 #define Bcar_safe 0242
213 #define Bcdr_safe 0243
217 #define Bnumberp 0247
218 #define Bintegerp 0250
221 #define BRgotoifnil 0253
222 #define BRgotoifnonnil 0254
223 #define BRgotoifnilelsepop 0255
224 #define BRgotoifnonnilelsepop 0256
227 #define BconcatN 0260
228 #define BinsertN 0261
230 #define Bconstant 0300
231 #define CONSTANTLIM 0100
234 /* Structure describing a value stack used during byte-code execution
239 /* Program counter. This points into the byte_string below
240 and is relocated when that string is relocated. */
243 /* Top and bottom of stack. The bottom points to an area of memory
244 allocated with alloca in Fbyte_code. */
245 Lisp_Object
*top
, *bottom
;
247 /* The string containing the byte-code, and its current address.
248 Storing this here protects it from GC because mark_byte_stack
250 Lisp_Object byte_string
;
251 unsigned char *byte_string_start
;
253 /* The vector of constants used during byte-code execution. Storing
254 this here protects it from GC because mark_byte_stack marks it. */
255 Lisp_Object constants
;
257 /* Next entry in byte_stack_list. */
258 struct byte_stack
*next
;
261 /* A list of currently active byte-code execution value stacks.
262 Fbyte_code adds an entry to the head of this list before it starts
263 processing byte-code, and it removed the entry again when it is
264 done. Signalling an error truncates the list analoguous to
267 struct byte_stack
*byte_stack_list
;
270 /* Mark objects on byte_stack_list. Called during GC. */
275 struct byte_stack
*stack
;
278 for (stack
= byte_stack_list
; stack
; stack
= stack
->next
)
280 /* If STACK->top is null here, this means there's an opcode in
281 Fbyte_code that wasn't expected to GC, but did. To find out
282 which opcode this is, record the value of `stack', and walk
283 up the stack in a debugger, stopping in frames of Fbyte_code.
284 The culprit is found in the frame of Fbyte_code where the
285 address of its local variable `stack' is equal to the
286 recorded value of `stack' here. */
290 for (obj
= stack
->bottom
; obj
<= stack
->top
; ++obj
)
291 if (!XMARKBIT (*obj
))
297 if (!XMARKBIT (stack
->byte_string
))
299 mark_object (&stack
->byte_string
);
300 XMARK (stack
->byte_string
);
303 if (!XMARKBIT (stack
->constants
))
305 mark_object (&stack
->constants
);
306 XMARK (stack
->constants
);
312 /* Unmark objects in the stacks on byte_stack_list. Relocate program
313 counters. Called when GC has completed. */
318 struct byte_stack
*stack
;
321 for (stack
= byte_stack_list
; stack
; stack
= stack
->next
)
323 for (obj
= stack
->bottom
; obj
<= stack
->top
; ++obj
)
326 XUNMARK (stack
->byte_string
);
327 XUNMARK (stack
->constants
);
329 if (stack
->byte_string_start
!= XSTRING (stack
->byte_string
)->data
)
331 int offset
= stack
->pc
- stack
->byte_string_start
;
332 stack
->byte_string_start
= XSTRING (stack
->byte_string
)->data
;
333 stack
->pc
= stack
->byte_string_start
+ offset
;
339 /* Fetch the next byte from the bytecode stream */
341 #define FETCH *stack.pc++
343 /* Fetch two bytes from the bytecode stream and make a 16-bit number
346 #define FETCH2 (op = FETCH, op + (FETCH << 8))
348 /* Push x onto the execution stack. This used to be #define PUSH(x)
349 (*++stackp = (x)) This oddity is necessary because Alliant can't be
350 bothered to compile the preincrement operator properly, as of 4/91.
353 #define PUSH(x) (top++, *top = (x))
355 /* Pop a value off the execution stack. */
359 /* Discard n values from the execution stack. */
361 #define DISCARD(n) (top -= (n))
363 /* Get the value which is at the top of the execution stack, but don't
368 /* Actions that must be performed before and after calling a function
371 #define BEFORE_POTENTIAL_GC() stack.top = top
372 #define AFTER_POTENTIAL_GC() stack.top = NULL
374 /* Garbage collect if we have consed enough since the last time.
375 We do this at every branch, to avoid loops that never GC. */
378 if (consing_since_gc > gc_cons_threshold) \
380 BEFORE_POTENTIAL_GC (); \
381 Fgarbage_collect (); \
382 AFTER_POTENTIAL_GC (); \
386 /* Check for jumping out of range. */
388 #ifdef BYTE_CODE_SAFE
390 #define CHECK_RANGE(ARG) \
391 if (ARG >= bytestr_length) abort ()
393 #else /* not BYTE_CODE_SAFE */
395 #define CHECK_RANGE(ARG)
397 #endif /* not BYTE_CODE_SAFE */
400 DEFUN ("byte-code", Fbyte_code
, Sbyte_code
, 3, 3, 0,
401 "Function used internally in byte-compiled code.\n\
402 The first argument, BYTESTR, is a string of byte code;\n\
403 the second, VECTOR, a vector of constants;\n\
404 the third, MAXDEPTH, the maximum stack depth used in this function.\n\
405 If the third argument is incorrect, Emacs may crash.")
406 (bytestr
, vector
, maxdepth
)
407 Lisp_Object bytestr
, vector
, maxdepth
;
409 int count
= specpdl_ptr
- specpdl
;
410 #ifdef BYTE_CODE_METER
415 /* Lisp_Object v1, v2; */
416 Lisp_Object
*vectorp
;
417 #ifdef BYTE_CODE_SAFE
418 int const_length
= XVECTOR (vector
)->size
;
422 struct byte_stack stack
;
426 #ifdef CHECK_FRAME_FONT
428 struct frame
*f
= SELECTED_FRAME ();
430 && FRAME_FONT (f
)->direction
!= 0
431 && FRAME_FONT (f
)->direction
!= 1)
436 CHECK_STRING (bytestr
, 0);
437 if (!VECTORP (vector
))
438 vector
= wrong_type_argument (Qvectorp
, vector
);
439 CHECK_NUMBER (maxdepth
, 2);
441 if (STRING_MULTIBYTE (bytestr
))
442 /* BYTESTR must have been produced by Emacs 20.2 or the earlier
443 because they produced a raw 8-bit string for byte-code and now
444 such a byte-code string is loaded as multibyte while raw 8-bit
445 characters converted to multibyte form. Thus, now we must
446 convert them back to the original unibyte form. */
447 bytestr
= Fstring_as_unibyte (bytestr
);
449 bytestr_length
= STRING_BYTES (XSTRING (bytestr
));
450 vectorp
= XVECTOR (vector
)->contents
;
452 stack
.byte_string
= bytestr
;
453 stack
.pc
= stack
.byte_string_start
= XSTRING (bytestr
)->data
;
454 stack
.constants
= vector
;
455 stack
.bottom
= (Lisp_Object
*) alloca (XFASTINT (maxdepth
)
456 * sizeof (Lisp_Object
));
457 top
= stack
.bottom
- 1;
459 stack
.next
= byte_stack_list
;
460 byte_stack_list
= &stack
;
462 #ifdef BYTE_CODE_SAFE
463 stacke
= stack
.bottom
- 1 + XFASTINT (maxdepth
);
468 #ifdef BYTE_CODE_SAFE
471 else if (top
< stack
.bottom
- 1)
475 #ifdef BYTE_CODE_METER
477 this_op
= op
= FETCH
;
478 METER_CODE (prev_op
, op
);
498 /* This seems to be the most frequently executed byte-code
499 among the Bvarref's, so avoid a goto here. */
509 v2
= XSYMBOL (v1
)->value
;
510 if (MISCP (v2
) || EQ (v2
, Qunbound
))
512 BEFORE_POTENTIAL_GC ();
513 v2
= Fsymbol_value (v1
);
514 AFTER_POTENTIAL_GC ();
519 BEFORE_POTENTIAL_GC ();
520 v2
= Fsymbol_value (v1
);
521 AFTER_POTENTIAL_GC ();
534 stack
.pc
= stack
.byte_string_start
+ op
;
548 BEFORE_POTENTIAL_GC ();
549 Fcar (wrong_type_argument (Qlistp
, v1
));
550 AFTER_POTENTIAL_GC ();
559 TOP
= EQ (v1
, TOP
) ? Qt
: Qnil
;
566 BEFORE_POTENTIAL_GC ();
568 TOP
= Fmemq (TOP
, v1
);
569 AFTER_POTENTIAL_GC ();
583 BEFORE_POTENTIAL_GC ();
584 Fcdr (wrong_type_argument (Qlistp
, v1
));
585 AFTER_POTENTIAL_GC ();
607 Lisp_Object sym
, val
;
612 /* Inline the most common case. */
614 && !EQ (val
, Qunbound
)
615 && !MISCP (XSYMBOL (sym
)->value
)
616 /* I think this should either be checked in the byte
617 compiler, or there should be a flag indicating that
618 a symbol might be constant in Lisp_Symbol, instead
619 of checking this here over and over again. --gerd. */
622 && !(XSYMBOL (sym
)->name
->data
[0] == ':'
623 && EQ (XSYMBOL (sym
)->obarray
, initial_obarray
)
625 XSYMBOL (sym
)->value
= val
;
628 BEFORE_POTENTIAL_GC ();
629 set_internal (sym
, val
, current_buffer
, 0);
630 AFTER_POTENTIAL_GC ();
644 /* ------------------ */
662 /* Specbind can signal and thus GC. */
663 BEFORE_POTENTIAL_GC ();
664 specbind (vectorp
[op
], POP
);
665 AFTER_POTENTIAL_GC ();
685 BEFORE_POTENTIAL_GC ();
687 #ifdef BYTE_CODE_METER
688 if (byte_metering_on
&& SYMBOLP (TOP
))
693 v2
= Fget (v1
, Qbyte_code_meter
);
695 && XINT (v2
) != ((1<<VALBITS
)-1))
697 XSETINT (v2
, XINT (v2
) + 1);
698 Fput (v1
, Qbyte_code_meter
, v2
);
702 TOP
= Ffuncall (op
+ 1, &TOP
);
703 AFTER_POTENTIAL_GC ();
723 BEFORE_POTENTIAL_GC ();
724 unbind_to (specpdl_ptr
- specpdl
- op
, Qnil
);
725 AFTER_POTENTIAL_GC ();
729 /* To unbind back to the beginning of this frame. Not used yet,
730 but will be needed for tail-recursion elimination. */
731 BEFORE_POTENTIAL_GC ();
732 unbind_to (count
, Qnil
);
733 AFTER_POTENTIAL_GC ();
739 op
= FETCH2
; /* pc = FETCH2 loses since FETCH2 contains pc++ */
741 stack
.pc
= stack
.byte_string_start
+ op
;
751 stack
.pc
= stack
.byte_string_start
+ op
;
755 case Bgotoifnilelsepop
:
762 stack
.pc
= stack
.byte_string_start
+ op
;
767 case Bgotoifnonnilelsepop
:
774 stack
.pc
= stack
.byte_string_start
+ op
;
782 stack
.pc
+= (int) *stack
.pc
- 127;
790 stack
.pc
+= (int) *stack
.pc
- 128;
800 stack
.pc
+= (int) *stack
.pc
- 128;
805 case BRgotoifnilelsepop
:
811 stack
.pc
+= op
- 128;
816 case BRgotoifnonnilelsepop
:
822 stack
.pc
+= op
- 128;
836 PUSH (vectorp
[FETCH2
]);
839 case Bsave_excursion
:
840 record_unwind_protect (save_excursion_restore
,
841 save_excursion_save ());
844 case Bsave_current_buffer
:
845 case Bsave_current_buffer_1
:
846 record_unwind_protect (set_buffer_if_live
, Fcurrent_buffer ());
849 case Bsave_window_excursion
:
850 BEFORE_POTENTIAL_GC ();
851 TOP
= Fsave_window_excursion (TOP
);
852 AFTER_POTENTIAL_GC ();
855 case Bsave_restriction
:
856 record_unwind_protect (save_restriction_restore
,
857 save_restriction_save ());
863 BEFORE_POTENTIAL_GC ();
865 TOP
= internal_catch (TOP
, Feval
, v1
);
866 AFTER_POTENTIAL_GC ();
870 case Bunwind_protect
:
871 /* The function record_unwind_protect can GC. */
872 BEFORE_POTENTIAL_GC ();
873 record_unwind_protect (0, POP
);
874 AFTER_POTENTIAL_GC ();
875 (specpdl_ptr
- 1)->symbol
= Qnil
;
878 case Bcondition_case
:
882 v1
= Fcons (POP
, v1
);
883 BEFORE_POTENTIAL_GC ();
884 TOP
= Fcondition_case (Fcons (TOP
, v1
));
885 AFTER_POTENTIAL_GC ();
889 case Btemp_output_buffer_setup
:
890 BEFORE_POTENTIAL_GC ();
891 temp_output_buffer_setup (XSTRING (TOP
)->data
);
892 AFTER_POTENTIAL_GC ();
893 TOP
= Vstandard_output
;
896 case Btemp_output_buffer_show
:
899 BEFORE_POTENTIAL_GC ();
901 temp_output_buffer_show (TOP
);
903 /* pop binding of standard-output */
904 unbind_to (specpdl_ptr
- specpdl
- 1, Qnil
);
905 AFTER_POTENTIAL_GC ();
912 BEFORE_POTENTIAL_GC ();
915 CHECK_NUMBER (v2
, 0);
916 AFTER_POTENTIAL_GC ();
926 BEFORE_POTENTIAL_GC ();
927 v1
= wrong_type_argument (Qlistp
, v1
);
928 AFTER_POTENTIAL_GC ();
940 BEFORE_POTENTIAL_GC ();
941 Fcar (wrong_type_argument (Qlistp
, v1
));
942 AFTER_POTENTIAL_GC ();
948 TOP
= SYMBOLP (TOP
) ? Qt
: Qnil
;
952 TOP
= CONSP (TOP
) ? Qt
: Qnil
;
956 TOP
= STRINGP (TOP
) ? Qt
: Qnil
;
960 TOP
= CONSP (TOP
) || NILP (TOP
) ? Qt
: Qnil
;
964 TOP
= NILP (TOP
) ? Qt
: Qnil
;
971 TOP
= Fcons (TOP
, v1
);
976 TOP
= Fcons (TOP
, Qnil
);
983 TOP
= Fcons (TOP
, Fcons (v1
, Qnil
));
989 TOP
= Flist (3, &TOP
);
994 TOP
= Flist (4, &TOP
);
1000 TOP
= Flist (op
, &TOP
);
1004 BEFORE_POTENTIAL_GC ();
1005 TOP
= Flength (TOP
);
1006 AFTER_POTENTIAL_GC ();
1012 BEFORE_POTENTIAL_GC ();
1014 TOP
= Faref (TOP
, v1
);
1015 AFTER_POTENTIAL_GC ();
1022 BEFORE_POTENTIAL_GC ();
1024 TOP
= Faset (TOP
, v1
, v2
);
1025 AFTER_POTENTIAL_GC ();
1030 BEFORE_POTENTIAL_GC ();
1031 TOP
= Fsymbol_value (TOP
);
1032 AFTER_POTENTIAL_GC ();
1035 case Bsymbol_function
:
1036 BEFORE_POTENTIAL_GC ();
1037 TOP
= Fsymbol_function (TOP
);
1038 AFTER_POTENTIAL_GC ();
1044 BEFORE_POTENTIAL_GC ();
1046 TOP
= Fset (TOP
, v1
);
1047 AFTER_POTENTIAL_GC ();
1054 BEFORE_POTENTIAL_GC ();
1056 TOP
= Ffset (TOP
, v1
);
1057 AFTER_POTENTIAL_GC ();
1064 BEFORE_POTENTIAL_GC ();
1066 TOP
= Fget (TOP
, v1
);
1067 AFTER_POTENTIAL_GC ();
1074 BEFORE_POTENTIAL_GC ();
1076 TOP
= Fsubstring (TOP
, v1
, v2
);
1077 AFTER_POTENTIAL_GC ();
1082 BEFORE_POTENTIAL_GC ();
1084 TOP
= Fconcat (2, &TOP
);
1085 AFTER_POTENTIAL_GC ();
1089 BEFORE_POTENTIAL_GC ();
1091 TOP
= Fconcat (3, &TOP
);
1092 AFTER_POTENTIAL_GC ();
1096 BEFORE_POTENTIAL_GC ();
1098 TOP
= Fconcat (4, &TOP
);
1099 AFTER_POTENTIAL_GC ();
1104 BEFORE_POTENTIAL_GC ();
1106 TOP
= Fconcat (op
, &TOP
);
1107 AFTER_POTENTIAL_GC ();
1116 XSETINT (v1
, XINT (v1
) - 1);
1130 XSETINT (v1
, XINT (v1
) + 1);
1135 BEFORE_POTENTIAL_GC ();
1137 AFTER_POTENTIAL_GC ();
1145 BEFORE_POTENTIAL_GC ();
1147 CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v1
, 0);
1148 CHECK_NUMBER_OR_FLOAT_COERCE_MARKER (v2
, 0);
1149 AFTER_POTENTIAL_GC ();
1150 if (FLOATP (v1
) || FLOATP (v2
))
1154 f1
= (FLOATP (v1
) ? XFLOAT_DATA (v1
) : XINT (v1
));
1155 f2
= (FLOATP (v2
) ? XFLOAT_DATA (v2
) : XINT (v2
));
1156 TOP
= (f1
== f2
? Qt
: Qnil
);
1159 TOP
= (XINT (v1
) == XINT (v2
) ? Qt
: Qnil
);
1166 BEFORE_POTENTIAL_GC ();
1168 TOP
= Fgtr (TOP
, v1
);
1169 AFTER_POTENTIAL_GC ();
1176 BEFORE_POTENTIAL_GC ();
1178 TOP
= Flss (TOP
, v1
);
1179 AFTER_POTENTIAL_GC ();
1186 BEFORE_POTENTIAL_GC ();
1188 TOP
= Fleq (TOP
, v1
);
1189 AFTER_POTENTIAL_GC ();
1196 BEFORE_POTENTIAL_GC ();
1198 TOP
= Fgeq (TOP
, v1
);
1199 AFTER_POTENTIAL_GC ();
1204 BEFORE_POTENTIAL_GC ();
1206 TOP
= Fminus (2, &TOP
);
1207 AFTER_POTENTIAL_GC ();
1216 XSETINT (v1
, - XINT (v1
));
1221 BEFORE_POTENTIAL_GC ();
1222 TOP
= Fminus (1, &TOP
);
1223 AFTER_POTENTIAL_GC ();
1229 BEFORE_POTENTIAL_GC ();
1231 TOP
= Fplus (2, &TOP
);
1232 AFTER_POTENTIAL_GC ();
1236 BEFORE_POTENTIAL_GC ();
1238 TOP
= Fmax (2, &TOP
);
1239 AFTER_POTENTIAL_GC ();
1243 BEFORE_POTENTIAL_GC ();
1245 TOP
= Fmin (2, &TOP
);
1246 AFTER_POTENTIAL_GC ();
1250 BEFORE_POTENTIAL_GC ();
1252 TOP
= Ftimes (2, &TOP
);
1253 AFTER_POTENTIAL_GC ();
1257 BEFORE_POTENTIAL_GC ();
1259 TOP
= Fquo (2, &TOP
);
1260 AFTER_POTENTIAL_GC ();
1266 BEFORE_POTENTIAL_GC ();
1268 TOP
= Frem (TOP
, v1
);
1269 AFTER_POTENTIAL_GC ();
1276 XSETFASTINT (v1
, PT
);
1282 BEFORE_POTENTIAL_GC ();
1283 TOP
= Fgoto_char (TOP
);
1284 AFTER_POTENTIAL_GC ();
1288 BEFORE_POTENTIAL_GC ();
1289 TOP
= Finsert (1, &TOP
);
1290 AFTER_POTENTIAL_GC ();
1295 BEFORE_POTENTIAL_GC ();
1297 TOP
= Finsert (op
, &TOP
);
1298 AFTER_POTENTIAL_GC ();
1304 XSETFASTINT (v1
, ZV
);
1312 XSETFASTINT (v1
, BEGV
);
1318 BEFORE_POTENTIAL_GC ();
1319 TOP
= Fchar_after (TOP
);
1320 AFTER_POTENTIAL_GC ();
1323 case Bfollowing_char
:
1326 BEFORE_POTENTIAL_GC ();
1327 v1
= Ffollowing_char ();
1328 AFTER_POTENTIAL_GC ();
1333 case Bpreceding_char
:
1336 BEFORE_POTENTIAL_GC ();
1337 v1
= Fprevious_char ();
1338 AFTER_POTENTIAL_GC ();
1343 case Bcurrent_column
:
1346 BEFORE_POTENTIAL_GC ();
1347 XSETFASTINT (v1
, current_column ());
1348 AFTER_POTENTIAL_GC ();
1354 BEFORE_POTENTIAL_GC ();
1355 TOP
= Findent_to (TOP
, Qnil
);
1356 AFTER_POTENTIAL_GC ();
1375 case Bcurrent_buffer
:
1376 PUSH (Fcurrent_buffer ());
1380 BEFORE_POTENTIAL_GC ();
1381 TOP
= Fset_buffer (TOP
);
1382 AFTER_POTENTIAL_GC ();
1385 case Binteractive_p
:
1386 PUSH (Finteractive_p ());
1390 BEFORE_POTENTIAL_GC ();
1391 TOP
= Fforward_char (TOP
);
1392 AFTER_POTENTIAL_GC ();
1396 BEFORE_POTENTIAL_GC ();
1397 TOP
= Fforward_word (TOP
);
1398 AFTER_POTENTIAL_GC ();
1401 case Bskip_chars_forward
:
1404 BEFORE_POTENTIAL_GC ();
1406 TOP
= Fskip_chars_forward (TOP
, v1
);
1407 AFTER_POTENTIAL_GC ();
1411 case Bskip_chars_backward
:
1414 BEFORE_POTENTIAL_GC ();
1416 TOP
= Fskip_chars_backward (TOP
, v1
);
1417 AFTER_POTENTIAL_GC ();
1422 BEFORE_POTENTIAL_GC ();
1423 TOP
= Fforward_line (TOP
);
1424 AFTER_POTENTIAL_GC ();
1428 BEFORE_POTENTIAL_GC ();
1429 CHECK_NUMBER (TOP
, 0);
1430 AFTER_POTENTIAL_GC ();
1431 XSETFASTINT (TOP
, syntax_code_spec
[(int) SYNTAX (XINT (TOP
))]);
1434 case Bbuffer_substring
:
1437 BEFORE_POTENTIAL_GC ();
1439 TOP
= Fbuffer_substring (TOP
, v1
);
1440 AFTER_POTENTIAL_GC ();
1444 case Bdelete_region
:
1447 BEFORE_POTENTIAL_GC ();
1449 TOP
= Fdelete_region (TOP
, v1
);
1450 AFTER_POTENTIAL_GC ();
1454 case Bnarrow_to_region
:
1457 BEFORE_POTENTIAL_GC ();
1459 TOP
= Fnarrow_to_region (TOP
, v1
);
1460 AFTER_POTENTIAL_GC ();
1465 BEFORE_POTENTIAL_GC ();
1467 AFTER_POTENTIAL_GC ();
1471 BEFORE_POTENTIAL_GC ();
1472 TOP
= Fend_of_line (TOP
);
1473 AFTER_POTENTIAL_GC ();
1479 BEFORE_POTENTIAL_GC ();
1482 TOP
= Fset_marker (TOP
, v2
, v1
);
1483 AFTER_POTENTIAL_GC ();
1487 case Bmatch_beginning
:
1488 BEFORE_POTENTIAL_GC ();
1489 TOP
= Fmatch_beginning (TOP
);
1490 AFTER_POTENTIAL_GC ();
1494 BEFORE_POTENTIAL_GC ();
1495 TOP
= Fmatch_end (TOP
);
1496 AFTER_POTENTIAL_GC ();
1500 BEFORE_POTENTIAL_GC ();
1501 TOP
= Fupcase (TOP
);
1502 AFTER_POTENTIAL_GC ();
1506 BEFORE_POTENTIAL_GC ();
1507 TOP
= Fdowncase (TOP
);
1508 AFTER_POTENTIAL_GC ();
1511 case Bstringeqlsign
:
1514 BEFORE_POTENTIAL_GC ();
1516 TOP
= Fstring_equal (TOP
, v1
);
1517 AFTER_POTENTIAL_GC ();
1524 BEFORE_POTENTIAL_GC ();
1526 TOP
= Fstring_lessp (TOP
, v1
);
1527 AFTER_POTENTIAL_GC ();
1535 TOP
= Fequal (TOP
, v1
);
1542 BEFORE_POTENTIAL_GC ();
1544 TOP
= Fnthcdr (TOP
, v1
);
1545 AFTER_POTENTIAL_GC ();
1554 /* Exchange args and then do nth. */
1555 BEFORE_POTENTIAL_GC ();
1558 CHECK_NUMBER (v2
, 0);
1559 AFTER_POTENTIAL_GC ();
1566 else if (!NILP (v1
))
1569 BEFORE_POTENTIAL_GC ();
1570 v1
= wrong_type_argument (Qlistp
, v1
);
1571 AFTER_POTENTIAL_GC ();
1583 BEFORE_POTENTIAL_GC ();
1584 Fcar (wrong_type_argument (Qlistp
, v1
));
1585 AFTER_POTENTIAL_GC ();
1590 BEFORE_POTENTIAL_GC ();
1592 TOP
= Felt (TOP
, v1
);
1593 AFTER_POTENTIAL_GC ();
1601 BEFORE_POTENTIAL_GC ();
1603 TOP
= Fmember (TOP
, v1
);
1604 AFTER_POTENTIAL_GC ();
1611 BEFORE_POTENTIAL_GC ();
1613 TOP
= Fassq (TOP
, v1
);
1614 AFTER_POTENTIAL_GC ();
1619 BEFORE_POTENTIAL_GC ();
1620 TOP
= Fnreverse (TOP
);
1621 AFTER_POTENTIAL_GC ();
1627 BEFORE_POTENTIAL_GC ();
1629 TOP
= Fsetcar (TOP
, v1
);
1630 AFTER_POTENTIAL_GC ();
1637 BEFORE_POTENTIAL_GC ();
1639 TOP
= Fsetcdr (TOP
, v1
);
1640 AFTER_POTENTIAL_GC ();
1667 BEFORE_POTENTIAL_GC ();
1669 TOP
= Fnconc (2, &TOP
);
1670 AFTER_POTENTIAL_GC ();
1674 TOP
= (NUMBERP (TOP
) ? Qt
: Qnil
);
1678 TOP
= INTEGERP (TOP
) ? Qt
: Qnil
;
1681 #ifdef BYTE_CODE_SAFE
1683 BEFORE_POTENTIAL_GC ();
1684 error ("set-mark is an obsolete bytecode");
1685 AFTER_POTENTIAL_GC ();
1688 BEFORE_POTENTIAL_GC ();
1689 error ("scan-buffer is an obsolete bytecode");
1690 AFTER_POTENTIAL_GC ();
1699 #ifdef BYTE_CODE_SAFE
1704 if ((op
-= Bconstant
) >= const_length
)
1710 PUSH (vectorp
[op
- Bconstant
]);
1717 byte_stack_list
= byte_stack_list
->next
;
1719 /* Binds and unbinds are supposed to be compiled balanced. */
1720 if (specpdl_ptr
- specpdl
!= count
)
1721 #ifdef BYTE_CODE_SAFE
1722 error ("binding stack not balanced (serious byte compiler bug)");
1733 Qbytecode
= intern ("byte-code");
1734 staticpro (&Qbytecode
);
1736 defsubr (&Sbyte_code
);
1738 #ifdef BYTE_CODE_METER
1740 DEFVAR_LISP ("byte-code-meter", &Vbyte_code_meter
,
1741 "A vector of vectors which holds a histogram of byte-code usage.\n\
1742 (aref (aref byte-code-meter 0) CODE) indicates how many times the byte\n\
1743 opcode CODE has been executed.\n\
1744 (aref (aref byte-code-meter CODE1) CODE2), where CODE1 is not 0,\n\
1745 indicates how many times the byte opcodes CODE1 and CODE2 have been\n\
1746 executed in succession.");
1747 DEFVAR_BOOL ("byte-metering-on", &byte_metering_on
,
1748 "If non-nil, keep profiling information on byte code usage.\n\
1749 The variable byte-code-meter indicates how often each byte opcode is used.\n\
1750 If a symbol has a property named `byte-code-meter' whose value is an\n\
1751 integer, it is incremented each time that symbol's function is called.");
1753 byte_metering_on
= 0;
1754 Vbyte_code_meter
= Fmake_vector (make_number (256), make_number (0));
1755 Qbyte_code_meter
= intern ("byte-code-meter");
1756 staticpro (&Qbyte_code_meter
);
1760 XVECTOR (Vbyte_code_meter
)->contents
[i
] =
1761 Fmake_vector (make_number (256), make_number (0));