Mercurial > hg > xemacs-beta
view man/lispref/range-tables.texi @ 4921:17362f371cc2
add more byte-code assertions and better failure output
-------------------- ChangeLog entries follow: --------------------
src/ChangeLog addition:
2010-02-03 Ben Wing <ben@xemacs.org>
* alloc.c (Fmake_byte_code):
* bytecode.h:
* lisp.h:
* lread.c:
* lread.c (readevalloop):
* lread.c (Fread):
* lread.c (Fread_from_string):
* lread.c (read_list_conser):
* lread.c (read_list):
* lread.c (vars_of_lread):
* symbols.c:
* symbols.c (Fdefine_function):
Turn on the "compiled-function annotation hack". Implement it
properly by hooking into Fdefalias(). Note in the docstring to
`defalias' that we do this. Remove some old broken code and
change code that implemented the old kludgy way of hooking into
the Lisp reader into bracketed by `#ifdef
COMPILED_FUNCTION_ANNOTATION_HACK_OLD_WAY', which is not enabled.
Also enable byte-code metering when DEBUG_XEMACS -- this is a form
of profiling for computing histograms of which sequences of two
bytecodes are used most often.
* bytecode-ops.h:
* bytecode-ops.h (OPCODE):
New file. Extract out all the opcodes and declare them using
OPCODE(), a bit like frame slots and such. This way the file can
be included multiple times if necessary to iterate multiple times
over the byte opcodes.
* bytecode.c:
* bytecode.c (NUM_REMEMBERED_BYTE_OPS):
* bytecode.c (OPCODE):
* bytecode.c (assert_failed_with_remembered_ops):
* bytecode.c (READ_UINT_2):
* bytecode.c (READ_INT_1):
* bytecode.c (READ_INT_2):
* bytecode.c (PEEK_INT_1):
* bytecode.c (PEEK_INT_2):
* bytecode.c (JUMP_RELATIVE):
* bytecode.c (JUMP_NEXT):
* bytecode.c (PUSH):
* bytecode.c (POP_WITH_MULTIPLE_VALUES):
* bytecode.c (DISCARD):
* bytecode.c (UNUSED):
* bytecode.c (optimize_byte_code):
* bytecode.c (optimize_compiled_function):
* bytecode.c (Fbyte_code):
* bytecode.c (vars_of_bytecode):
* bytecode.c (init_opcode_table_multi_op):
* bytecode.c (reinit_vars_of_bytecode):
* emacs.c (main_1):
* eval.c (funcall_compiled_function):
* symsinit.h:
Any time we change either the instruction pointer or the stack
pointer, assert that we're going to move it to a valid location.
This should catch failures right when they occur rather than
sometime later. This requires that we pass in another couple of
parameters into some functions (only with error-checking enabled,
see below).
Also keep track, using a circular queue, of the last 100 byte
opcodes seen, and when we hit an assert failure during byte-code
execution, output the contents of the queue in a nice readable
fashion. This requires that bytecode-ops.h be included a second
time so that a table mapping opcodes to the name of their operation
can be constructed. This table is constructed in new function
reinit_vars_of_bytecode().
Everything in the last two paras happens only when
ERROR_CHECK_BYTE_CODE.
Add some longish comments describing how the arrays that hold the
stack and instructions, and the pointers used to access them, work.
* gc.c:
Import some code from my `latest-fix' workspace to mark the
staticpro's in order from lowest to highest, rather than highest to
lowest, so it's easier to debug when something goes wrong.
* lisp.h (abort_with_message): Renamed from abort_with_msg().
* symbols.c (defsymbol_massage_name_1):
* symbols.c (defsymbol_nodump):
* symbols.c (defsymbol):
* symbols.c (defkeyword):
* symeval.h (DEFVAR_SYMVAL_FWD_OBJECT):
Make the various calls to staticpro() instead call staticpro_1(),
passing in the name of the C var being staticpro'ed, so that it
shows up in staticpro_names. Otherwise staticpro_names just has
1000+ copies of the word `location'.
author | Ben Wing <ben@xemacs.org> |
---|---|
date | Wed, 03 Feb 2010 08:01:55 -0600 |
parents | 6772ce4d982b |
children | 9fae6227ede5 |
line wrap: on
line source
@c -*-texinfo-*- @c This is part of the XEmacs Lisp Reference Manual. @c Copyright (C) 1996 Ben Wing. @c See the file lispref.texi for copying conditions. @setfilename ../../info/range-tables.info @node Range Tables, Databases, Hash Tables, top @chapter Range Tables @cindex Range Tables A range table is a table that efficiently associates values with ranges of fixnums. Note that range tables have a read syntax, like this: @example #s(range-table type start-closed-end-open data ((-3 2) foo (5 20) bar)) @end example This maps integers in the range [-3, 2) to @code{foo} and integers in the range [5, 20) to @code{bar}. By default, range tables have a @var{type} of @code{start-closed-end-open}. (@strong{NOTE}: This is a change from 21.4 and earlier, where there was no @var{type} and range tables were always closed on both ends.) This makes them work like text properties. @defun range-table-p object Return non-@code{nil} if @var{object} is a range table. @end defun @menu * Introduction to Range Tables:: Range tables efficiently map ranges of integers to values. * Working With Range Tables:: Range table functions. @end menu @node Introduction to Range Tables @section Introduction to Range Tables @defun make-range-table &optional type Make a new, empty range table. @var{type} is a symbol indicating how ranges are assumed to function at their ends. It can be one of @example SYMBOL RANGE-START RANGE-END ------ ----------- --------- `start-closed-end-open' (the default) closed open `start-closed-end-closed' closed closed `start-open-end-open' open open `start-open-end-closed' open closed @end example A @dfn{closed} endpoint of a range means that the number at that end is included in the range. For an @dfn{open} endpoint, the number would not be included. For example, a closed-open range from 5 to 20 would be indicated as @samp{[5, 20)} where a bracket indicates a closed end and a parenthesis an open end, and would mean `all the numbers between 5 and 20', including 5 but not 20. This seems a little strange at first but is in fact extremely common in the outside world as well as in computers and makes things work sensibly. For example, if I say "there are seven days between today and next week today", I'm including today but not next week today; if I included both, there would be eight days. Similarly, there are 15 (= 20 - 5) elements in the range @samp{[5, 20)}, but 16 in the range @samp{[5, 20]}. @end defun @defun copy-range-table range-table This function returns a new range table which contains the same values for the same ranges as @var{range-table}. The values will not themselves be copied. @end defun @node Working With Range Tables @section Working With Range Tables @defun get-range-table pos range-table &optional default This function finds value for position @var{pos} in @var{range-table}. If there is no corresponding value, return @var{default} (defaults to @code{nil}). @strong{NOTE}: If you are working with ranges that are closed at the start and open at the end (the default), and you put a value for a range with @var{start} equal to @var{end}, @code{get-range-table} will @strong{not} return that value! You would need to set @var{end} one greater than @var{start}. @end defun @defun put-range-table start end value range-table This function sets the value for range (@var{start}, @var{end}) to be @var{value} in @var{range-table}. @strong{NOTE}: Unless you are working with ranges that are closed at both ends, nothing will happen if @var{start} equals @var{end}. @end defun @defun remove-range-table start end range-table This function removes the value for range (@var{start}, @var{end}) in @var{range-table}. @end defun @defun clear-range-table range-table This function flushes @var{range-table}. @end defun @defun map-range-table function range-table This function maps @var{function} over entries in @var{range-table}, calling it with three args, the beginning and end of the range and the corresponding value. @end defun