/* Execution of byte code produced by bytecomp.el.
- Copyright (C) 1985, 1986, 1987, 1988 Free Software Foundation, Inc.
+ Copyright (C) 1985, 1986, 1987, 1988, 1993 Free Software Foundation, Inc.
This file is part of GNU Emacs.
GNU Emacs is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
-the Free Software Foundation; either version 1, or (at your option)
+the Free Software Foundation; either version 2, or (at your option)
any later version.
GNU Emacs is distributed in the hope that it will be useful,
hacked on by jwz@lucid.com 17-jun-91
o added a compile-time switch to turn on simple sanity checking;
o put back the obsolete byte-codes for error-detection;
- o put back fset, symbol-function, and read-char because I don't
- see any reason for them to have been removed;
o added a new instruction, unbind_all, which I will use for
tail-recursion elimination;
- o made temp_output_buffer_show() be called with the right number
+ o made temp_output_buffer_show be called with the right number
of args;
o made the new bytecodes be called with args in the right order;
o added metering support.
by Hallvard:
- o added relative jump instructions.
+ o added relative jump instructions;
o all conditionals now only do QUIT if they jump.
*/
-
-#include "config.h"
+#include <config.h>
#include "lisp.h"
#include "buffer.h"
#include "syntax.h"
*
* define BYTE_CODE_METER to enable generation of a byte-op usage histogram.
*/
-#define BYTE_CODE_SAFE
-#define BYTE_CODE_METER
+/* #define BYTE_CODE_SAFE */
+/* #define BYTE_CODE_METER */
\f
#ifdef BYTE_CODE_METER
Lisp_Object Vbyte_code_meter, Qbyte_code_meter;
int byte_metering_on;
-# define METER_2(code1,code2) \
+#define METER_2(code1, code2) \
XFASTINT (XVECTOR (XVECTOR (Vbyte_code_meter)->contents[(code1)]) \
->contents[(code2)])
-# define METER_1(code) METER_2 (0,(code))
-
-# define METER_CODE(last_code, this_code) { \
- if (byte_metering_on) { \
- if (METER_1 (this_code) != ((1<<VALBITS)-1)) \
- METER_1 (this_code) ++; \
- if (last_code && \
- METER_2 (last_code,this_code) != ((1<<VALBITS)-1)) \
- METER_2 (last_code,this_code) ++; \
- } \
- }
+#define METER_1(code) METER_2 (0, (code))
+
+#define METER_CODE(last_code, this_code) \
+{ \
+ if (byte_metering_on) \
+ { \
+ if (METER_1 (this_code) != ((1<<VALBITS)-1)) \
+ METER_1 (this_code)++; \
+ if (last_code \
+ && METER_2 (last_code, this_code) != ((1<<VALBITS)-1))\
+ METER_2 (last_code, this_code)++; \
+ } \
+}
-#else /* ! BYTE_CODE_METER */
+#else /* no BYTE_CODE_METER */
-# define meter_code(last_code, this_code)
+#define METER_CODE(last_code, this_code)
-#endif
+#endif /* no BYTE_CODE_METER */
\f
Lisp_Object Qbytecode;
#define BlistN 0257
#define BconcatN 0260
+#define BinsertN 0261
#define Bconstant 0300
#define CONSTANTLIM 0100
{
#ifdef BYTE_CODE_SAFE
if (stackp > stacke)
- error (
- "Stack overflow in byte code (byte compiler bug), pc = %d, depth = %d",
+ error ("Byte code stack overflow (byte compiler bug), pc %d, depth %d",
pc - XSTRING (string_saved)->data, stacke - stackp);
if (stackp < stack)
- error ("Stack underflow in byte code (byte compiler bug), pc = %d",
+ error ("Byte code stack underflow (byte compiler bug), pc %d",
pc - XSTRING (string_saved)->data);
#endif
- if (string_saved != bytestr)
+ if (! EQ (string_saved, bytestr))
{
pc = pc - XSTRING (string_saved)->data + XSTRING (bytestr)->data;
string_saved = bytestr;
case Bcall+4: case Bcall+5:
op -= Bcall;
docall:
- DISCARD(op);
+ DISCARD (op);
#ifdef BYTE_CODE_METER
if (byte_metering_on && XTYPE (TOP) == Lisp_Symbol)
{
v1 = TOP;
v2 = Fget (v1, Qbyte_code_meter);
- if (XTYPE (v2) == Lisp_Int)
+ if (XTYPE (v2) == Lisp_Int
+ && XINT (v2) != ((1<<VALBITS)-1))
{
XSETINT (v2, XINT (v2) + 1);
Fput (v1, Qbyte_code_meter, v2);
case Bunbind_all:
/* To unbind back to the beginning of this frame. Not used yet,
- but wil be needed for tail-recursion elimination.
- */
+ but will be needed for tail-recursion elimination. */
unbind_to (count, Qnil);
break;
case Bgotoifnil:
op = FETCH2;
- if (NULL (POP))
+ if (NILP (POP))
{
QUIT;
pc = XSTRING (string_saved)->data + op;
case Bgotoifnonnil:
op = FETCH2;
- if (!NULL (POP))
+ if (!NILP (POP))
{
QUIT;
pc = XSTRING (string_saved)->data + op;
case Bgotoifnilelsepop:
op = FETCH2;
- if (NULL (TOP))
+ if (NILP (TOP))
{
QUIT;
pc = XSTRING (string_saved)->data + op;
}
- else DISCARD(1);
+ else DISCARD (1);
break;
case Bgotoifnonnilelsepop:
op = FETCH2;
- if (!NULL (TOP))
+ if (!NILP (TOP))
{
QUIT;
pc = XSTRING (string_saved)->data + op;
}
- else DISCARD(1);
+ else DISCARD (1);
break;
case BRgoto:
break;
case BRgotoifnil:
- if (NULL (POP))
+ if (NILP (POP))
{
QUIT;
pc += *pc - 128;
break;
case BRgotoifnonnil:
- if (!NULL (POP))
+ if (!NILP (POP))
{
QUIT;
pc += *pc - 128;
case BRgotoifnilelsepop:
op = *pc++;
- if (NULL (TOP))
+ if (NILP (TOP))
{
QUIT;
pc += op - 128;
}
- else DISCARD(1);
+ else DISCARD (1);
break;
case BRgotoifnonnilelsepop:
op = *pc++;
- if (!NULL (TOP))
+ if (!NILP (TOP))
{
QUIT;
pc += op - 128;
}
- else DISCARD(1);
+ else DISCARD (1);
break;
case Breturn:
goto exit;
case Bdiscard:
- DISCARD(1);
+ DISCARD (1);
break;
case Bdup:
case Btemp_output_buffer_show:
v1 = POP;
- temp_output_buffer_show (TOP, Qnil);
+ temp_output_buffer_show (TOP);
TOP = v1;
/* pop binding of standard-output */
unbind_to (specpdl_ptr - specpdl - 1, Qnil);
{
if (CONSP (v1))
v1 = XCONS (v1)->cdr;
- else if (!NULL (v1))
+ else if (!NILP (v1))
{
immediate_quit = 0;
v1 = wrong_type_argument (Qlistp, v1);
break;
case Blistp:
- TOP = CONSP (TOP) || NULL (TOP) ? Qt : Qnil;
+ TOP = CONSP (TOP) || NILP (TOP) ? Qt : Qnil;
break;
case Beq:
break;
case Bnot:
- TOP = NULL (TOP) ? Qt : Qnil;
+ TOP = NILP (TOP) ? Qt : Qnil;
break;
case Bcar:
v1 = TOP;
docar:
if (CONSP (v1)) TOP = XCONS (v1)->car;
- else if (NULL (v1)) TOP = Qnil;
+ else if (NILP (v1)) TOP = Qnil;
else Fcar (wrong_type_argument (Qlistp, v1));
break;
case Bcdr:
v1 = TOP;
if (CONSP (v1)) TOP = XCONS (v1)->cdr;
- else if (NULL (v1)) TOP = Qnil;
+ else if (NILP (v1)) TOP = Qnil;
else Fcdr (wrong_type_argument (Qlistp, v1));
break;
break;
case Blist3:
- DISCARD(2);
+ DISCARD (2);
TOP = Flist (3, &TOP);
break;
case Blist4:
- DISCARD(3);
+ DISCARD (3);
TOP = Flist (4, &TOP);
break;
break;
case Bconcat2:
- DISCARD(1);
+ DISCARD (1);
TOP = Fconcat (2, &TOP);
break;
case Bconcat3:
- DISCARD(2);
+ DISCARD (2);
TOP = Fconcat (3, &TOP);
break;
case Bconcat4:
- DISCARD(3);
+ DISCARD (3);
TOP = Fconcat (4, &TOP);
break;
break;
case Bdiff:
- DISCARD(1);
+ DISCARD (1);
TOP = Fminus (2, &TOP);
break;
break;
case Bplus:
- DISCARD(1);
+ DISCARD (1);
TOP = Fplus (2, &TOP);
break;
case Bmax:
- DISCARD(1);
+ DISCARD (1);
TOP = Fmax (2, &TOP);
break;
case Bmin:
- DISCARD(1);
+ DISCARD (1);
TOP = Fmin (2, &TOP);
break;
case Bmult:
- DISCARD(1);
+ DISCARD (1);
TOP = Ftimes (2, &TOP);
break;
case Bquo:
- DISCARD(1);
+ DISCARD (1);
TOP = Fquo (2, &TOP);
break;
TOP = Finsert (1, &TOP);
break;
+ case BinsertN:
+ op = FETCH;
+ DISCARD (op - 1);
+ TOP = Finsert (op, &TOP);
+ break;
+
case Bpoint_max:
XFASTINT (v1) = ZV;
PUSH (v1);
break;
case Bnconc:
- DISCARD(1);
+ DISCARD (1);
TOP = Fnconc (2, &TOP);
break;
case Bnumberp:
- TOP = (XTYPE (TOP) == Lisp_Int || XTYPE (TOP) == Lisp_Float
- ? Qt : Qnil);
+ TOP = (NUMBERP (TOP) ? Qt : Qnil);
break;
case Bintegerp:
error ("scan-buffer is an obsolete bytecode");
break;
case Bmark:
- error("mark is an obsolete bytecode");
+ error ("mark is an obsolete bytecode");
break;
#endif
#ifdef BYTE_CODE_METER
DEFVAR_LISP ("byte-code-meter", &Vbyte_code_meter,
- "a vector of vectors which holds a histogram of byte-code usage.");
- DEFVAR_BOOL ("byte-metering-on", &byte_metering_on, "");
+ "A vector of vectors which holds a histogram of byte-code usage.\n\
+(aref (aref byte-code-meter 0) CODE) indicates how many times the byte\n\
+opcode CODE has been executed.\n\
+(aref (aref byte-code-meter CODE1) CODE2), where CODE1 is not 0,\n\
+indicates how many times the byte opcodes CODE1 and CODE2 have been\n\
+executed in succession.");
+ DEFVAR_BOOL ("byte-metering-on", &byte_metering_on,
+ "If non-nil, keep profiling information on byte code usage.\n\
+The variable byte-code-meter indicates how often each byte opcode is used.\n\
+If a symbol has a property named `byte-code-meter' whose value is an\n\
+integer, it is incremented each time that symbol's function is called.");
byte_metering_on = 0;
- Vbyte_code_meter = Fmake_vector(make_number(256), make_number(0));
+ Vbyte_code_meter = Fmake_vector (make_number (256), make_number (0));
+ Qbyte_code_meter = intern ("byte-code-meter");
staticpro (&Qbyte_code_meter);
{
int i = 256;
while (i--)
- XVECTOR(Vbyte_code_meter)->contents[i] =
- Fmake_vector(make_number(256), make_number(0));
+ XVECTOR (Vbyte_code_meter)->contents[i] =
+ Fmake_vector (make_number (256), make_number (0));
}
#endif
}