Log of pike.git/src/docode.c

1996-09-22

1996-09-22 19:40:33 by Fredrik Hübinette (Hubbe) <hubbe@hubbe.net>

06983fde1434ab5470b2fb656c40db32b2e6a971 (51 lines) (+29/-22) ^{[

Show
| Annotate

]}
Branch: 7.9

Pike

Rev: .cvsignore:1.1.1.1
Rev: README:1.1.1.1
Rev: bin/export.pike:1.1.1.1
Rev: bin/fixdepends.sh:1.1.1.1
Rev: bin/hilfe:1.1.1.1
Rev: bin/htmlify_docs.pike:1.1.1.1
Rev: bin/httpd.pike:1.1.1.1
Rev: bin/metatest:1.1.1.1
Rev: bin/mkpeep.pike:1.1.1.1
Rev: bin/rsif:1.1.1.1
Rev: doc/README:1.1.1.1
Rev: doc/builtin/_verify_internals:1.1.1.1
Rev: doc/builtin/add_constant:1.1.1.1
Rev: doc/builtin/aggregage_multiset:1.1.1.1
Rev: doc/builtin/aggregate:1.1.1.1
Rev: doc/builtin/aggregate_mapping:1.1.1.1
Rev: doc/builtin/alarm:1.1.1.1
Rev: doc/builtin/all_constants:1.1.1.1
Rev: doc/builtin/allocate:1.1.1.1
Rev: doc/builtin/arrayp:1.1.1.1
Rev: doc/builtin/backtrace:1.1.1.1
Rev: doc/builtin/call_function:1.1.1.1
Rev: doc/builtin/clone:1.1.1.1
Rev: doc/builtin/column:1.1.1.1
Rev: doc/builtin/combine_path:1.1.1.1
Rev: doc/builtin/compile_file:1.1.1.1
Rev: doc/builtin/compile_string:1.1.1.1
Rev: doc/builtin/copy_value:1.1.1.1
Rev: doc/builtin/crypt:1.1.1.1
Rev: doc/builtin/ctime:1.1.1.1
Rev: doc/builtin/destruct:1.1.1.1
Rev: doc/builtin/equal:1.1.1.1
Rev: doc/builtin/exit:1.1.1.1
Rev: doc/builtin/floatp:1.1.1.1
Rev: doc/builtin/function_name:1.1.1.1
Rev: doc/builtin/function_object:1.1.1.1
Rev: doc/builtin/functionp:1.1.1.1
Rev: doc/builtin/gc:1.1.1.1
Rev: doc/builtin/getpid:1.1.1.1
Rev: doc/builtin/glob:1.1.1.1
Rev: doc/builtin/hash:1.1.1.1
Rev: doc/builtin/indices:1.1.1.1
Rev: doc/builtin/intp:1.1.1.1
Rev: doc/builtin/kill:1.1.1.1
Rev: doc/builtin/localtime:1.1.1.1
Rev: doc/builtin/lower_case:1.1.1.1
Rev: doc/builtin/m_delete:1.1.1.1
Rev: doc/builtin/mappingp:1.1.1.1
Rev: doc/builtin/mkmapping:1.1.1.1
Rev: doc/builtin/multisetp:1.1.1.1
Rev: doc/builtin/next_object:1.1.1.1
Rev: doc/builtin/object_program:1.1.1.1
Rev: doc/builtin/objectp:1.1.1.1
Rev: doc/builtin/programp:1.1.1.1
Rev: doc/builtin/query_host_name:1.1.1.1
Rev: doc/builtin/query_num_arg:1.1.1.1
Rev: doc/builtin/random:1.1.1.1
Rev: doc/builtin/random_seed:1.1.1.1
Rev: doc/builtin/replace:1.1.1.1
Rev: doc/builtin/reverse:1.1.1.1
Rev: doc/builtin/rows:1.1.1.1
Rev: doc/builtin/rusage:1.1.1.1
Rev: doc/builtin/search:1.1.1.1
Rev: doc/builtin/signal:1.1.1.1
Rev: doc/builtin/signame:1.1.1.1
Rev: doc/builtin/signum:1.1.1.1
Rev: doc/builtin/sizeof:1.1.1.1
Rev: doc/builtin/sleep:1.1.1.1
Rev: doc/builtin/sort:1.1.1.1
Rev: doc/builtin/stringp:1.1.1.1
Rev: doc/builtin/this_object:1.1.1.1
Rev: doc/builtin/throw:1.1.1.1
Rev: doc/builtin/time:1.1.1.1
Rev: doc/builtin/trace:1.1.1.1
Rev: doc/builtin/ualarm:1.1.1.1
Rev: doc/builtin/upper_case:1.1.1.1
Rev: doc/builtin/values:1.1.1.1
Rev: doc/builtin/zero_type:1.1.1.1
Rev: doc/index.bmml:1.1.1.1
Rev: doc/manual/example1:1.1.1.1
Rev: doc/manual/example2:1.1.1.1
Rev: doc/manual/example3:1.1.1.1
Rev: doc/manual/tutorial:1.1.1.1
Rev: doc/operators/and:1.1.1.1
Rev: doc/operators/complement:1.1.1.1
Rev: doc/operators/divide:1.1.1.1
Rev: doc/operators/index:1.1.1.1
Rev: doc/operators/is_equal:1.1.1.1
Rev: doc/operators/is_greater_or_equal:1.1.1.1
Rev: doc/operators/is_greater_than:1.1.1.1
Rev: doc/operators/is_lesser_or_equal:1.1.1.1
Rev: doc/operators/is_lesser_than:1.1.1.1
Rev: doc/operators/logical_and:1.1.1.1
Rev: doc/operators/logical_or:1.1.1.1
Rev: doc/operators/minus:1.1.1.1
Rev: doc/operators/modulo:1.1.1.1
Rev: doc/operators/mult:1.1.1.1
Rev: doc/operators/not:1.1.1.1
Rev: doc/operators/not_equal:1.1.1.1
Rev: doc/operators/operators:1.1.1.1
Rev: doc/operators/or:1.1.1.1
Rev: doc/operators/plus:1.1.1.1
Rev: doc/operators/range:1.1.1.1
Rev: doc/operators/shift_left:1.1.1.1
Rev: doc/operators/shift_right:1.1.1.1
Rev: doc/operators/xor:1.1.1.1
Rev: doc/pike/all.bmml:1.1.1.1
Rev: doc/pike/cast:1.1.1.1
Rev: doc/pike/catch:1.1.1.1
Rev: doc/pike/class:1.1.1.1
Rev: doc/pike/command_line_options:1.1.1.1
Rev: doc/pike/control_structures/break:1.1.1.1
Rev: doc/pike/control_structures/catch:1.1.1.1
Rev: doc/pike/control_structures/continue:1.1.1.1
Rev: doc/pike/control_structures/do-while:1.1.1.1
Rev: doc/pike/control_structures/for:1.1.1.1
Rev: doc/pike/control_structures/foreach:1.1.1.1
Rev: doc/pike/control_structures/if-else:1.1.1.1
Rev: doc/pike/control_structures/return:1.1.1.1
Rev: doc/pike/control_structures/switch:1.1.1.1
Rev: doc/pike/control_structures/while:1.1.1.1
Rev: doc/pike/efuns.bmml:1.1.1.1
Rev: doc/pike/functions:1.1.1.1
Rev: doc/pike/gauge:1.1.1.1
Rev: doc/pike/hilfe:1.1.1.1
Rev: doc/pike/how_to_make_modules:1.1.1.1
Rev: doc/pike/inherit:1.1.1.1
Rev: doc/pike/lambda:1.1.1.1
Rev: doc/pike/modifier:1.1.1.1
Rev: doc/pike/preprocessor:1.1.1.1
Rev: doc/pike/reserved.bmml:1.1.1.1
Rev: doc/pike/sscanf:1.1.1.1
Rev: doc/pike/typeof:1.1.1.1
Rev: doc/pike/variables:1.1.1.1
Rev: doc/simulated/PI:1.1.1.1
Rev: doc/simulated/add_efun:1.1.1.1
Rev: doc/simulated/aggregage_list:1.1.1.1
Rev: doc/simulated/all_efuns:1.1.1.1
Rev: doc/simulated/capitalize:1.1.1.1
Rev: doc/simulated/describe_backtrace:1.1.1.1
Rev: doc/simulated/exec:1.1.1.1
Rev: doc/simulated/explode:1.1.1.1
Rev: doc/simulated/file_size:1.1.1.1
Rev: doc/simulated/filter:1.1.1.1
Rev: doc/simulated/filter_array:1.1.1.1
Rev: doc/simulated/get_function:1.1.1.1
Rev: doc/simulated/getenv:1.1.1.1
Rev: doc/simulated/implode:1.1.1.1
Rev: doc/simulated/l_sizeof:1.1.1.1
Rev: doc/simulated/listp:1.1.1.1
Rev: doc/simulated/m_indices:1.1.1.1
Rev: doc/simulated/m_sizeof:1.1.1.1
Rev: doc/simulated/m_values:1.1.1.1
Rev: doc/simulated/map:1.1.1.1
Rev: doc/simulated/map_array:1.1.1.1
Rev: doc/simulated/master:1.1.1.1
Rev: doc/simulated/member_array:1.1.1.1
Rev: doc/simulated/mklist:1.1.1.1
Rev: doc/simulated/mkmultiset:1.1.1.1
Rev: doc/simulated/perror:1.1.1.1
Rev: doc/simulated/popen:1.1.1.1
Rev: doc/simulated/previous_object:1.1.1.1
Rev: doc/simulated/putenv:1.1.1.1
Rev: doc/simulated/read_bytes:1.1.1.1
Rev: doc/simulated/regexp:1.1.1.1
Rev: doc/simulated/search_array:1.1.1.1
Rev: doc/simulated/sort_array:1.1.1.1
Rev: doc/simulated/spawn:1.1.1.1
Rev: doc/simulated/strlen:1.1.1.1
Rev: doc/simulated/strstr:1.1.1.1
Rev: doc/simulated/sum:1.1.1.1
Rev: doc/simulated/sum_arrays:1.1.1.1
Rev: doc/simulated/system:1.1.1.1
Rev: doc/simulated/this_function:1.1.1.1
Rev: doc/simulated/version:1.1.1.1
Rev: doc/simulated/write:1.1.1.1
Rev: doc/simulated/write_file:1.1.1.1
Rev: doc/types/array:1.1.1.1
Rev: doc/types/float:1.1.1.1
Rev: doc/types/function:1.1.1.1
Rev: doc/types/int:1.1.1.1
Rev: doc/types/mapping:1.1.1.1
Rev: doc/types/mixed:1.1.1.1
Rev: doc/types/multiset:1.1.1.1
Rev: doc/types/object:1.1.1.1
Rev: doc/types/program:1.1.1.1
Rev: doc/types/string:1.1.1.1
Rev: lib/include/array.h:1.1.1.1
Rev: lib/include/array.pre.pike:1.1.1.1
Rev: lib/include/process.h:1.1.1.1
Rev: lib/include/process.pre.pike:1.1.1.1
Rev: lib/include/simulate.h:1.1.1.1
Rev: lib/include/simulate.pre.pike:1.1.1.1
Rev: lib/include/stdio.h:1.1.1.1
Rev: lib/include/stdio.pre.pike:1.1.1.1
Rev: lib/master.pike:1.1.1.1
Rev: src/.cvsignore:1.1.1.1
Rev: src/BUGS:1.1.1.1
Rev: src/COPYING:1.1.1.1
Rev: src/COPYRIGHT:1.1.1.1
Rev: src/ChangeLog:1.1.1.1
Rev: src/DISCLAIMER:1.1.1.1
Rev: src/Makefile.src:1.1.1.1
Rev: src/README:1.1.1.1
Rev: src/alloca.c:1.1.1.1
Rev: src/array.c:1.1.1.1
Rev: src/array.h:1.1.1.1
Rev: src/backend.c:1.1.1.1
Rev: src/backend.h:1.1.1.1
Rev: src/build_modlist_h:1.1.1.1
Rev: src/builtin_functions.c:1.1.1.1
Rev: src/builtin_functions.h:1.1.1.1
Rev: src/callback.c:1.1.1.1
Rev: src/callback.h:1.1.1.1
Rev: src/compilation.h:1.1.1.1
Rev: src/config.cache:1.1.1.1
Rev: src/config.h:1.1.1.1
Rev: src/config.log:1.1.1.1
Rev: src/configure.in:1.1.1.1
Rev: src/constants.c:1.1.1.1
Rev: src/constants.h:1.1.1.1
Rev: src/docode.c:1.1.1.1
Rev: src/docode.h:1.1.1.1
Rev: src/dynamic_buffer.c:1.1.1.1
Rev: src/dynamic_buffer.h:1.1.1.1
Rev: src/efun.h:1.1.1.1
Rev: src/error.c:1.1.1.1
Rev: src/error.h:1.1.1.1
Rev: src/fd_control.c:1.1.1.1
Rev: src/fd_control.h:1.1.1.1
Rev: src/fsort.c:1.1.1.1
Rev: src/fsort.h:1.1.1.1
Rev: src/gc.c:1.1.1.1
Rev: src/gc.h:1.1.1.1
Rev: src/global.h:1.1.1.1
Rev: src/hashtable.c:1.1.1.1
Rev: src/hashtable.h:1.1.1.1
Rev: src/install-sh:1.1.1.1
Rev: src/interpret.c:1.1.1.1
Rev: src/interpret.h:1.1.1.1
Rev: src/language.y:1.1.1.1
Rev: src/las.c:1.1.1.1
Rev: src/las.h:1.1.1.1
Rev: src/lex.c:1.1.1.1
Rev: src/lex.h:1.1.1.1
Rev: src/machine.h.in:1.1.1.1
Rev: src/macros.h:1.1.1.1
Rev: src/main.c:1.1.1.1
Rev: src/main.h:1.1.1.1
Rev: src/mapping.c:1.1.1.1
Rev: src/mapping.h:1.1.1.1
Rev: src/memory.c:1.1.1.1
Rev: src/memory.h:1.1.1.1
Rev: src/module.c:1.1.1.1
Rev: src/module.h:1.1.1.1
Rev: src/modules/.cvsignore:1.1.1.1
Rev: src/modules/Makefile.src:1.1.1.1
Rev: src/modules/call_out/.cvsignore:1.1.1.1
Rev: src/modules/call_out/Makefile.src:1.1.1.1
Rev: src/modules/call_out/call_out.c:1.1.1.1
Rev: src/modules/call_out/configure.in:1.1.1.1
Rev: src/modules/call_out/doc/call_out:1.1.1.1
Rev: src/modules/call_out/doc/call_out_info:1.1.1.1
Rev: src/modules/call_out/doc/find_call_out:1.1.1.1
Rev: src/modules/call_out/doc/remove_call_out:1.1.1.1
Rev: src/modules/configure.in:1.1.1.1
Rev: src/modules/files/.cvsignore:1.1.1.1
Rev: src/modules/files/Makefile.src:1.1.1.1
Rev: src/modules/files/configure.in:1.1.1.1
Rev: src/modules/files/datagram.c:1.1.1.1
Rev: src/modules/files/doc/cd:1.1.1.1
Rev: src/modules/files/doc/errno:1.1.1.1
Rev: src/modules/files/doc/exece:1.1.1.1
Rev: src/modules/files/doc/file:1.1.1.1
Rev: src/modules/files/doc/file_stat:1.1.1.1
Rev: src/modules/files/doc/fork:1.1.1.1
Rev: src/modules/files/doc/get_dir:1.1.1.1
Rev: src/modules/files/doc/getcwd:1.1.1.1
Rev: src/modules/files/doc/mkdir:1.1.1.1
Rev: src/modules/files/doc/mv:1.1.1.1
Rev: src/modules/files/doc/port:1.1.1.1
Rev: src/modules/files/doc/rm:1.1.1.1
Rev: src/modules/files/doc/strerror:1.1.1.1
Rev: src/modules/files/doc/werror:1.1.1.1
Rev: src/modules/files/efuns.c:1.1.1.1
Rev: src/modules/files/file.c:1.1.1.1
Rev: src/modules/files/file.h:1.1.1.1
Rev: src/modules/files/file_machine.h.in:1.1.1.1
Rev: src/modules/files/socket.c:1.1.1.1
Rev: src/modules/gdbmmod/.cvsignore:1.1.1.1
Rev: src/modules/gdbmmod/Makefile.src:1.1.1.1
Rev: src/modules/gdbmmod/configure.in:1.1.1.1
Rev: src/modules/gdbmmod/doc/gdbm:1.1.1.1
Rev: src/modules/gdbmmod/gdbm_machine.h.in:1.1.1.1
Rev: src/modules/gdbmmod/gdbmmod.c:1.1.1.1
Rev: src/modules/gmpmod/.cvsignore:1.1.1.1
Rev: src/modules/gmpmod/Makefile.src:1.1.1.1
Rev: src/modules/gmpmod/configure.in:1.1.1.1
Rev: src/modules/gmpmod/doc/mpz:1.1.1.1
Rev: src/modules/gmpmod/gmp_machine.h.in:1.1.1.1
Rev: src/modules/gmpmod/mpz_glue.c:1.1.1.1
Rev: src/modules/image/Makefile.in:1.1.1.1
Rev: src/modules/image/Makefile.src:1.1.1.1
Rev: src/modules/image/configure:1.1.1.1
Rev: src/modules/image/configure.in:1.1.1.1
Rev: src/modules/image/dependencies:1.1.1.1
Rev: src/modules/image/doc.txt:1.1.1.1
Rev: src/modules/image/doc/image.html:1.1.1.1
Rev: src/modules/image/font.c:1.1.1.1
Rev: src/modules/image/image.c:1.1.1.1
Rev: src/modules/image/image.h:1.1.1.1
Rev: src/modules/image/lzw.c:1.1.1.1
Rev: src/modules/image/lzw.h:1.1.1.1
Rev: src/modules/image/quant.c:1.1.1.1
Rev: src/modules/image/togif.c:1.1.1.1
Rev: src/modules/math/.cvsignore:1.1.1.1
Rev: src/modules/math/Makefile.src:1.1.1.1
Rev: src/modules/math/configure.in:1.1.1.1
Rev: src/modules/math/doc/acos:1.1.1.1
Rev: src/modules/math/doc/asin:1.1.1.1
Rev: src/modules/math/doc/atan:1.1.1.1
Rev: src/modules/math/doc/ceil:1.1.1.1
Rev: src/modules/math/doc/cos:1.1.1.1
Rev: src/modules/math/doc/exp:1.1.1.1
Rev: src/modules/math/doc/floor:1.1.1.1
Rev: src/modules/math/doc/log:1.1.1.1
Rev: src/modules/math/doc/pow:1.1.1.1
Rev: src/modules/math/doc/sin:1.1.1.1
Rev: src/modules/math/doc/sqrt:1.1.1.1
Rev: src/modules/math/doc/tan:1.1.1.1
Rev: src/modules/math/math.c:1.1.1.1
Rev: src/modules/module_dir_marker:1.1.1.1
Rev: src/modules/pipe/Makefile.in:1.1.1.1
Rev: src/modules/pipe/Makefile.src:1.1.1.1
Rev: src/modules/pipe/config.h:1.1.1.1
Rev: src/modules/pipe/configure:1.1.1.1
Rev: src/modules/pipe/configure.in:1.1.1.1
Rev: src/modules/pipe/dependencies:1.1.1.1
Rev: src/modules/pipe/pipe.c:1.1.1.1
Rev: src/modules/readlinemod/.cvsignore:1.1.1.1
Rev: src/modules/readlinemod/Makefile.src:1.1.1.1
Rev: src/modules/readlinemod/configure.in:1.1.1.1
Rev: src/modules/readlinemod/doc/readline:1.1.1.1
Rev: src/modules/readlinemod/readline_machine.h.in:1.1.1.1
Rev: src/modules/readlinemod/readlinemod.c:1.1.1.1
Rev: src/modules/regexp/.cvsignore:1.1.1.1
Rev: src/modules/regexp/Makefile.src:1.1.1.1
Rev: src/modules/regexp/configure.in:1.1.1.1
Rev: src/modules/regexp/doc/regexp:1.1.1.1
Rev: src/modules/regexp/glue.c:1.1.1.1
Rev: src/modules/regexp/regexp.c:1.1.1.1
Rev: src/modules/regexp/regexp.h:1.1.1.1
Rev: src/modules/spider/Makefile.in:1.1.1.1
Rev: src/modules/spider/Makefile.src:1.1.1.1
Rev: src/modules/spider/configure:1.1.1.1
Rev: src/modules/spider/configure.in:1.1.1.1
Rev: src/modules/spider/defs.h:1.1.1.1
Rev: src/modules/spider/dependencies:1.1.1.1
Rev: src/modules/spider/discdate.c:1.1.1.1
Rev: src/modules/spider/encode_decode.c:1.1.1.1
Rev: src/modules/spider/http_parse.c:1.1.1.1
Rev: src/modules/spider/lock.c:1.1.1.1
Rev: src/modules/spider/lock.h:1.1.1.1
Rev: src/modules/spider/sdebug.c:1.1.1.1
Rev: src/modules/spider/shared_mem_mapping.c:1.1.1.1
Rev: src/modules/spider/sharedmem.c:1.1.1.1
Rev: src/modules/spider/sharedmem.h:1.1.1.1
Rev: src/modules/spider/spider.c:1.1.1.1
Rev: src/modules/spider/spider.h.in:1.1.1.1
Rev: src/modules/spider/stardate.c:1.1.1.1
Rev: src/modules/spider/streamed_parser.c:1.1.1.1
Rev: src/modules/spider/streamed_parser.h:1.1.1.1
Rev: src/modules/spider/tree.c:1.1.1.1
Rev: src/modules/sprintf/.cvsignore:1.1.1.1
Rev: src/modules/sprintf/Makefile.src:1.1.1.1
Rev: src/modules/sprintf/configure.in:1.1.1.1
Rev: src/modules/sprintf/doc/sprintf:1.1.1.1
Rev: src/modules/sprintf/sprintf.c:1.1.1.1
Rev: src/multiset.c:1.1.1.1
Rev: src/multiset.h:1.1.1.1
Rev: src/object.c:1.1.1.1
Rev: src/object.h:1.1.1.1
Rev: src/opcodes.c:1.1.1.1
Rev: src/opcodes.h:1.1.1.1
Rev: src/operators.c:1.1.1.1
Rev: src/operators.h:1.1.1.1
Rev: src/otable.h:1.1.1.1
Rev: src/peep.c:1.1.1.1
Rev: src/peep.h:1.1.1.1
Rev: src/peep.in:1.1.1.1
Rev: src/pike_types.c:1.1.1.1
Rev: src/pike_types.h:1.1.1.1
Rev: src/port.c:1.1.1.1
Rev: src/port.h:1.1.1.1
Rev: src/program.c:1.1.1.1
Rev: src/program.h:1.1.1.1
Rev: src/run_autoconfig:1.1.1.1
Rev: src/rusage.c:1.1.1.1
Rev: src/rusage.h:1.1.1.1
Rev: src/signal_handler.c:1.1.1.1
Rev: src/signal_handler.h:1.1.1.1
Rev: src/stamp-h:1.1.1.1
Rev: src/stralloc.c:1.1.1.1
Rev: src/stralloc.h:1.1.1.1
Rev: src/stuff.c:1.1.1.1
Rev: src/stuff.h:1.1.1.1
Rev: src/svalue.c:1.1.1.1
Rev: src/svalue.h:1.1.1.1
Rev: src/test/.cvsignore:1.1.1.1
Rev: src/test/create_testsuite:1.1.1.1
Rev: src/test/test_pike.pike:1.1.1.1
Rev: src/time_stuff.h:1.1.1.1
Rev: src/todo:1.1.1.1
Rev: src/types.h:1.1.1.1
Rev: src/ualarm.c:1.1.1.1

1:   /*\ - ||| This file a part of uLPC, and is copyright by Fredrik Hubinette - ||| uLPC is distributed as GPL (General Public License) + ||| This file a part of Pike, and is copyright by Fredrik Hubinette + ||| Pike is distributed as GPL (General Public License)   ||| See the files COPYING and DISCLAIMER for more information.   \*/   #include "global.h"   #include "las.h"   #include "program.h"   #include "language.h" - #include "lpc_types.h" + #include "pike_types.h"   #include "stralloc.h"   #include "interpret.h" - #include "add_efun.h" + #include "constants.h"   #include "array.h"   #include "macros.h"   #include "error.h"
18:   #include "svalue.h"   #include "main.h"   #include "lex.h" - #include "builtin_efuns.h" + #include "builtin_functions.h" + #include "peep.h" + #include "docode.h"    - int *break_stack=0; - static int current_break,break_stack_size; - int *continue_stack=0; - static int current_continue,continue_stack_size; + INT32 current_break=-1; + INT32 current_continue=-1;      static INT32 current_switch_case;   static INT32 current_switch_default;
45:    add_to_mem_block(area, (char *)&l, sizeof(INT16));   }    - static void upd_short(int offset, INT16 l) + /* + * Store an INT32. + */ + void ins_int(INT32 l,int area)   { - #ifdef HANDLES_UNALIGNED_MEMORY_ACCESS - *((INT16 *)(areas[A_PROGRAM].s.str+offset))=l; - #else - MEMCPY(areas[A_PROGRAM].s.str+offset, (char *)&l,sizeof(l)); - #endif + add_to_mem_block(area, (char *)&l+0, sizeof(INT32));   }    - static void upd_int(int offset, INT32 tmp) + void upd_int(int offset, INT32 tmp)   {   #ifdef HANDLES_UNALIGNED_MEMORY_ACCESS    *((int *)(areas[A_PROGRAM].s.str+offset))=tmp;
63:   #endif   }    - /* - * Store an INT32. - */ - void ins_long(INT32 l,int area) + INT32 read_int(int offset)   { - add_to_mem_block(area, (char *)&l+0, sizeof(INT32)); + INT32 tmp; + #ifdef HANDLES_UNALIGNED_MEMORY_ACCESS + tmp=*((int *)(areas[A_PROGRAM].s.str+offset)); + #else + MEMCPY((char *)&tmp, areas[A_PROGRAM].s.str+offset,sizeof(tmp)); + #endif + return tmp;   }      int store_linenumbers=1;    - static void low_ins_f_byte(unsigned int b) - { - if(store_linenumbers) store_linenumber(); - - #if defined(LASDEBUG) - if(lasdebug>1) - if(store_linenumbers) - fprintf(stderr,"Inserting f_byte %s (%d) at %ld\n", - get_instruction_name(b), b, - (long)PC); - #endif - b-=F_OFFSET; - #ifdef OPCPROF - if(store_linenumbers) add_compiled(b); - #endif - if(b>255) - { - switch(b >> 8) - { - case 1: low_ins_f_byte(F_ADD_256); break; - case 2: low_ins_f_byte(F_ADD_512); break; - case 3: low_ins_f_byte(F_ADD_768); break; - case 4: low_ins_f_byte(F_ADD_1024); break; - default: - low_ins_f_byte(F_ADD_256X); - ins_byte(b/256,A_PROGRAM); - } - b&=255; - } - ins_byte((unsigned char)b,A_PROGRAM); - } - - void ins_f_byte(unsigned int b) - { - #ifdef DEBUG - if(a_flag>2) - fprintf(stderr,">%6lx: %s\n",(long)PC,get_f_name(b)); - #endif - low_ins_f_byte(b); - } - - static void ins_f_byte_with_numerical_arg(unsigned int a,unsigned int b) - { - switch(b >> 8) - { - case 0 : break; - case 1 : low_ins_f_byte(F_PREFIX_256); break; - case 2 : low_ins_f_byte(F_PREFIX_512); break; - case 3 : low_ins_f_byte(F_PREFIX_768); break; - case 4 : low_ins_f_byte(F_PREFIX_1024); break; - default: - if( b < 256*256) - { - low_ins_f_byte(F_PREFIX_CHARX256); - ins_byte(b>>8, A_PROGRAM); - }else if(b < 256*256*256) { - low_ins_f_byte(F_PREFIX_WORDX256); - ins_byte(b >> 16, A_PROGRAM); - ins_byte(b >> 8, A_PROGRAM); - }else{ - low_ins_f_byte(F_PREFIX_24BITX256); - ins_byte(b >> 24, A_PROGRAM); - ins_byte(b >> 16, A_PROGRAM); - ins_byte(b >> 8, A_PROGRAM); - } - } - ins_f_byte(a); - #ifdef DEBUG - if(a_flag>2) - fprintf(stderr,">%6lx: argument = %u\n",(long)PC,b); - #endif - ins_byte(b, A_PROGRAM); - } - - - static void ins_int(int i) - { - switch(i) - { - case 0: ins_f_byte(F_CONST0); break; - case 1: ins_f_byte(F_CONST1); break; - case -1: ins_f_byte(F_CONST_1); break; - default: - if(i<0) - { - ins_f_byte_with_numerical_arg(F_NEG_NUMBER,-i); - }else{ - ins_f_byte_with_numerical_arg(F_NUMBER,i); - } - } - } - - static void ins_float(FLOAT_TYPE f) - { - ins_f_byte(F_FLOAT); - add_to_mem_block(A_PROGRAM,(char *)&f,sizeof(FLOAT_TYPE)); - } - +   /*    * A mechanism to remember addresses on a stack. The size of the stack is    * defined in config.h.
212:    return comp_stack[--comp_stackp];   }    - static void do_pop(int nr) - { - if(!nr) return; - if(nr==1) - { - ins_f_byte(F_POP_VALUE); - }else if(nr<256){ - ins_f_byte(F_POP_N_ELEMS); - ins_byte(nr,A_PROGRAM); - }else{ - ins_f_byte(F_POP_N_ELEMS); - ins_byte(255,A_PROGRAM); - do_pop(nr-255); - } - } +    - /* routines to optimize jumps */ + static int label_no=0;    - #define JUMP_CONDITIONAL 1 - #define JUMP_UNSET 2 + int alloc_label() { return ++label_no; }    - struct jump + int do_jump(int token,INT32 lbl)   { - INT32 relative; - INT32 whereto; - INT32 wherefrom; - INT32 address; - unsigned char flags; - short token; - }; - - static int jump_ptr=0, max_jumps=0; - static struct jump jumps[256]; - - static void low_set_branch(INT32 address,INT32 whereto,INT32 relative) - { - int j,e; - - if(address<0) return; - j=jump_ptr; - e=max_jumps; - while(e>=0) - { - if(jumps[j].address==address && (jumps[j].flags & JUMP_UNSET)) - break; - if(j) j--; else j=max_jumps; - e--; + if(lbl==-1) lbl=alloc_label(); + emit(token, lbl); + return lbl;   } - if(e<0) j=-1; /* not found */ +    - for(e=0;e<=max_jumps;e++) - { - if(jumps[e].flags & JUMP_UNSET) continue; - if(jumps[e].flags & JUMP_CONDITIONAL) continue; - if(jumps[e].wherefrom!=whereto) continue; - #if defined(LASDEBUG) - if(lasdebug>1) printf("Optimized Jump to a jump\n"); - #endif - whereto=jumps[e].whereto; - break; - } + static int do_docode2(node *n,int flags);    - if(j>=0) - { - if(!(jumps[j].flags & JUMP_CONDITIONAL)) - { - for(e=0;e<=max_jumps;e++) - { - if(jumps[e].flags & JUMP_UNSET) continue; - if(jumps[e].whereto==jumps[j].wherefrom) - { - upd_int(jumps[e].address,whereto - jumps[e].relative); - jumps[e].whereto=whereto; - #if defined(LASDEBUG) - if(lasdebug>1) printf("Optimized Jump to a jump\n"); - #endif - } - } - } - jumps[j].relative=relative; - jumps[j].whereto=whereto; - jumps[j].flags&=~JUMP_UNSET; - } - upd_int(address,whereto - relative); - } + #define ins_label(L) do_jump(F_LABEL, L)    - static void set_branch(INT32 address,INT32 whereto) + void do_pop(int x)   { - low_set_branch(address,whereto,address); - } - - static INT32 do_jump(int token,INT32 whereto) + switch(x)    { - jump_ptr=(jump_ptr+1)%NELEM(jumps); - if(jump_ptr>max_jumps) max_jumps=jump_ptr; - - jumps[jump_ptr].flags=JUMP_UNSET; - jumps[jump_ptr].whereto=-1; - jumps[jump_ptr].token=token; - - if(token!=F_BRANCH) - jumps[jump_ptr].flags|=JUMP_CONDITIONAL; - - if(token>=0) - { - jumps[jump_ptr].wherefrom=PC; - ins_f_byte(token); - }else{ - jumps[jump_ptr].wherefrom=-1; + case 0: return; + case 1: emit2(F_POP_VALUE); break; + default: emit(F_POP_N_ELEMS,x); break;    } - jumps[jump_ptr].relative=PC; - jumps[jump_ptr].address=PC; - ins_long(0, A_PROGRAM); - if(whereto!=-1) set_branch(jumps[jump_ptr].address, whereto); - return jumps[jump_ptr].address; +   } - - static void clean_jumptable() { max_jumps=jump_ptr=-1; } - - struct jump_list - { - int *stack; - int current; - int size; - }; - - static void push_break_stack(struct jump_list *x) - { - x->stack=break_stack; - x->current=current_break; - x->size=break_stack_size; - break_stack_size=10; - break_stack=(int *)xalloc(sizeof(int)*break_stack_size); - current_break=0; - } - - static void pop_break_stack(struct jump_list *x,int jump) - { - for(current_break--;current_break>=0;current_break--) - set_branch(break_stack[current_break],jump); - - free((char *)break_stack); - - break_stack_size=x->size; - current_break=x->current; - break_stack=x->stack; - } - - static void push_continue_stack(struct jump_list *x) - { - x->stack=continue_stack; - x->current=current_continue; - x->size=continue_stack_size; - continue_stack_size=10; - continue_stack=(int *)xalloc(sizeof(int)*continue_stack_size); - current_continue=0; - } - - static void pop_continue_stack(struct jump_list *x,int jump) - { - for(current_continue--;current_continue>=0;current_continue--) - set_branch(continue_stack[current_continue],jump); - - free((char *)continue_stack); - continue_stack_size=x->size; - current_continue=x->current; - continue_stack=x->stack; - } - - static int do_docode2(node *n,int flags); - - #define DO_LVALUE 1 - #define DO_NOT_COPY 2 - #define DO_POP 4 - +   #define DO_CODE_BLOCK(N) do_pop(do_docode(N,DO_NOT_COPY | DO_POP))    - static int do_docode(node *n,INT16 flags) + int do_docode(node *n,INT16 flags)   {    int i;    int save_current_line=current_line;
402:   }       - int docode(node *n) - { - clean_jumptable(); - return do_docode(n,0); - } + void do_jump_when_zero(node *n,int j);    - static INT32 do_jump_when_zero(node *n,int j); - - static int do_jump_when_non_zero(node *n,int j) + void do_jump_when_non_zero(node *n,int j)   {    if(!node_is_tossable(n))    {    if(node_is_true(n)) - return do_jump(F_BRANCH,j); + { + do_jump(F_BRANCH,j); + return; + }       if(node_is_false(n)) - return -1; + return;    }    - if(n->token == F_NOT) - return do_jump_when_zero(CAR(n), j); + switch(n->token) + { + case F_NOT: + do_jump_when_zero(CAR(n), j); + return; + case F_OR: + do_jump_when_non_zero(CAR(n), j); + do_jump_when_non_zero(CDR(n), j); + return; + }       if(do_docode(n, DO_NOT_COPY)!=1)    fatal("Infernal compiler skiterror.\n"); - return do_jump(F_BRANCH_WHEN_NON_ZERO,j); + do_jump(F_BRANCH_WHEN_NON_ZERO,j);   }    - static INT32 do_jump_when_zero(node *n,int j) + void do_jump_when_zero(node *n,int j)   {    if(!node_is_tossable(n))    {    if(node_is_true(n)) - return -1; + return;       if(node_is_false(n)) - return do_jump(F_BRANCH,j); + { + do_jump(F_BRANCH,j); + return;    } - + }    - if(n->token == F_NOT) - return do_jump_when_non_zero(CAR(n), j); + switch(n->token) + { + case F_NOT: + do_jump_when_non_zero(CAR(n), j); + return; + case F_AND: + do_jump_when_zero(CAR(n), j); + do_jump_when_zero(CDR(n), j); + return; + }       if(do_docode(n, DO_NOT_COPY)!=1)    fatal("Infernal compiler skiterror.\n"); - return do_jump(F_BRANCH_WHEN_ZERO,j); + do_jump(F_BRANCH_WHEN_ZERO,j);   }      static INT32 count_cases(node *n)
488:    {    default:    yyerror("Illegal lvalue."); - ins_int(0); + emit(F_NUMBER,0);    return 1;       case F_LVALUE_LIST:
509:    {    fatal("Internal compiler error, Yikes!\n");    } - ins_f_byte(F_PUSH_ARRAY); + emit2(F_PUSH_ARRAY);    return -0x7ffffff;       case '?':    { - + int adroppings , bdroppings; +    if(!CDDR(n))    { - tmp1=do_jump_when_zero(CAR(n), -1); + tmp1=alloc_label(); + do_jump_when_zero(CAR(n), tmp1);    DO_CODE_BLOCK(CADR(n)); - set_branch(tmp1, PC); + emit(F_LABEL, tmp1);    return 0;    }       if(!CADR(n))    { - tmp1=do_jump_when_non_zero(CAR(n), -1); + tmp1=alloc_label(); + do_jump_when_non_zero(CAR(n), tmp1);    DO_CODE_BLOCK(CDDR(n)); - set_branch(tmp1, PC); + emit(F_LABEL,tmp1);    return 0;    }    - tmp1=count_args(CDDR(n)); - tmp2=count_args(CADR(n)); + tmp1=alloc_label(); + do_jump_when_zero(CAR(n),tmp1);    - if(tmp2 < tmp1) tmp1=tmp2; + adroppings=do_docode(CADR(n), flags); + tmp3=emit(F_POP_N_ELEMS,0);    - tmp2=do_jump_when_zero(CAR(n),-1); + /* Else */ + tmp2=do_jump(F_BRANCH,-1); + emit(F_LABEL, tmp1);    - tmp3=do_docode(CADR(n), flags); - if(tmp3 < tmp1) fatal("Count arguments was wrong.\n"); - do_pop(tmp3 - tmp1); + bdroppings=do_docode(CDDR(n), flags); + if(adroppings < bdroppings) + { + do_pop(bdroppings - adroppings); + }    - tmp3=do_jump(F_BRANCH,-1); - set_branch(tmp2, PC); + if(adroppings > bdroppings) + { + update_arg(tmp3,adroppings-bdroppings); + adroppings=bdroppings; + }    - tmp2=do_docode(CDDR(n), flags); - if(tmp2 < tmp1) fatal("Count arguments was wrong.\n"); - do_pop(tmp2 - tmp1); - set_branch(tmp3, PC); - return tmp1; + emit(F_LABEL, tmp2); + return adroppings;    }       case F_AND_EQ:
571:    {    if(do_docode(CDR(n), 0)!=1)    fatal("Internal compiler error, shit happens\n"); - ins_f_byte(F_LTOSVAL2); + emit2(F_LTOSVAL2);    }else{ - ins_f_byte(F_LTOSVAL); + emit2(F_LTOSVAL);    if(do_docode(CDR(n), 0)!=1)    fatal("Internal compiler error, shit happens (again)\n");    }
581:       switch(n->token)    { - case F_ADD_EQ: ins_f_byte(F_ADD); break; - case F_AND_EQ: ins_f_byte(F_AND); break; - case F_OR_EQ: ins_f_byte(F_OR); break; - case F_XOR_EQ: ins_f_byte(F_XOR); break; - case F_LSH_EQ: ins_f_byte(F_LSH); break; - case F_RSH_EQ: ins_f_byte(F_RSH); break; - case F_SUB_EQ: ins_f_byte(F_SUBTRACT); break; - case F_MULT_EQ:ins_f_byte(F_MULTIPLY);break; - case F_MOD_EQ: ins_f_byte(F_MOD); break; - case F_DIV_EQ: ins_f_byte(F_DIVIDE); break; + case F_ADD_EQ: emit2(F_ADD); break; + case F_AND_EQ: emit2(F_AND); break; + case F_OR_EQ: emit2(F_OR); break; + case F_XOR_EQ: emit2(F_XOR); break; + case F_LSH_EQ: emit2(F_LSH); break; + case F_RSH_EQ: emit2(F_RSH); break; + case F_SUB_EQ: emit2(F_SUBTRACT); break; + case F_MULT_EQ:emit2(F_MULTIPLY);break; + case F_MOD_EQ: emit2(F_MOD); break; + case F_DIV_EQ: emit2(F_DIVIDE); break;    }       if(flags & DO_POP)    { - ins_f_byte(F_ASSIGN_AND_POP); + emit2(F_ASSIGN_AND_POP);    return 0;    }else{ - ins_f_byte(F_ASSIGN); + emit2(F_ASSIGN);    return 1;    }
622:    {    if(do_docode(CDAR(n),DO_NOT_COPY)!=1)    fatal("Infernal compiler error (dumpar core |ver hela mattan).\n"); - ins_f_byte(F_LTOSVAL2); + emit2(F_LTOSVAL2);    }else{ - ins_f_byte(F_LTOSVAL); + emit2(F_LTOSVAL);    if(do_docode(CDAR(n),DO_NOT_COPY)!=1)    fatal("Infernal compiler error (dumpar core).\n");    }    - ins_f_byte(CAR(n)->token); + emit2(CAR(n)->token);    - ins_f_byte(n->token); + emit2(n->token);    return n->token==F_ASSIGN;    }       default: - if(CDR(n)->token!=F_LOCAL && CDR(n)->token!=F_GLOBAL) - tmp1=do_docode(CDR(n),DO_LVALUE); - - if(do_docode(CAR(n),0)!=1) - yyerror("RHS is void!"); - +    switch(CDR(n)->token)    {    case F_LOCAL: - ins_f_byte(flags & DO_POP ? F_ASSIGN_LOCAL_AND_POP:F_ASSIGN_LOCAL); - ins_byte(CDR(n)->u.number,A_PROGRAM); + if(do_docode(CAR(n),0)!=1) yyerror("RHS is void!"); + emit(flags & DO_POP ? F_ASSIGN_LOCAL_AND_POP:F_ASSIGN_LOCAL, + CDR(n)->u.number );    break;    - case F_GLOBAL: - ins_f_byte(flags & DO_POP ? F_ASSIGN_GLOBAL_AND_POP:F_ASSIGN_GLOBAL); - ins_byte(CDR(n)->u.number,A_PROGRAM); + case F_IDENTIFIER: + if(ID_FROM_INT(& fake_program, CDR(n)->u.number)->flags & IDENTIFIER_FUNCTION) + { + yyerror("Cannot assign functions.\n"); + }else{ + if(do_docode(CAR(n),0)!=1) yyerror("RHS is void!"); + emit(flags & DO_POP ? F_ASSIGN_GLOBAL_AND_POP:F_ASSIGN_GLOBAL, + CDR(n)->u.number); + }    break;       default: - ins_f_byte(flags & DO_POP ? F_ASSIGN_AND_POP:F_ASSIGN); + tmp1=do_docode(CDR(n),DO_LVALUE); + if(do_docode(CAR(n),0)!=1) yyerror("RHS is void!"); + emit2(flags & DO_POP ? F_ASSIGN_AND_POP:F_ASSIGN);    break;    }    return flags & DO_POP ? 0 : 1;
668:    tmp1=do_jump(n->token,-1);    if(do_docode(CDR(n),0)!=1)    fatal("Compiler internal error.\n"); - set_branch(tmp1,PC); + emit(F_LABEL,tmp1);    return 1;       case F_EQ:    case F_NE: - if(flags & DO_POP) - { - do_pop(do_docode(CAR(n),DO_NOT_COPY|DO_POP)+ - do_docode(CDR(n),DO_NOT_COPY|DO_POP)); - return 0; - } - tmp1=do_docode(CAR(n),0); - if(do_docode(CDR(n),0)!=1) - fatal("Compiler internal error (gnng!).\n"); - ins_f_byte(n->token); - return tmp1; - +    case F_ADD:    case F_LT:    case F_LE:
699:    case F_XOR:    case F_OR:    case F_AND: - if(flags & DO_POP) - { - do_pop(do_docode(CAR(n),DO_NOT_COPY|DO_POP)+ - do_docode(CDR(n),DO_NOT_COPY|DO_POP)); - return 0; - } - tmp1=do_docode(CAR(n),DO_NOT_COPY); - if(do_docode(CDR(n),DO_NOT_COPY)!=1) - fatal("Compiler internal error.\n"); - ins_f_byte(n->token); - return tmp1; + case F_NOT: + case F_COMPL: + case F_NEGATE: + fatal("Optimizer errror.\n");       case F_RANGE:    tmp1=do_docode(CAR(n),DO_NOT_COPY);    if(do_docode(CDR(n),DO_NOT_COPY)!=2)    fatal("Compiler internal error.\n"); - ins_f_byte(n->token); + emit2(n->token);    return tmp1;       case F_INC:
728:       if(flags & DO_POP)    { - ins_f_byte(F_INC_AND_POP); + emit2(F_INC_AND_POP);    return 0;    }else{ - ins_f_byte(n->token); + emit2(n->token);    return 1;    }
744:   #endif    if(flags & DO_POP)    { - ins_f_byte(F_DEC_AND_POP); + emit2(F_DEC_AND_POP);    return 0;    }else{ - ins_f_byte(n->token); + emit2(n->token);    return 1;    }    - case F_NOT: - case F_COMPL: - case F_NEGATE: - tmp1=do_docode(CAR(n),DO_NOT_COPY | (flags & ~DO_LVALUE)); - if(flags & DO_POP) - { - do_pop(tmp1); - return 0; - } - ins_f_byte(n->token); - return tmp1; - +    case F_FOR:    { - struct jump_list brk,cnt; +    INT32 *prev_switch_jumptable = current_switch_jumptable; - + INT32 break_save = current_break; + INT32 continue_save = current_continue; +    current_switch_jumptable=0; - + current_break=alloc_label(); + current_continue=alloc_label();    - push_break_stack(&brk); - push_continue_stack(&cnt); +    if(CDR(n))    { - tmp1=do_jump(F_BRANCH,-1); - tmp2=PC; - if(CDR(n)) DO_CODE_BLOCK(CADR(n)); - pop_continue_stack(&cnt,PC); - if(CDR(n)) DO_CODE_BLOCK(CDDR(n)); - set_branch(tmp1,PC); + do_jump_when_zero(CAR(n),current_break); + tmp2=ins_label(-1); + DO_CODE_BLOCK(CADR(n)); + ins_label(current_continue); + DO_CODE_BLOCK(CDDR(n));    }else{ - tmp2=PC; + tmp2=ins_label(-1);    }    do_jump_when_non_zero(CAR(n),tmp2); - pop_break_stack(&brk,PC); + ins_label(current_break);       current_switch_jumptable = prev_switch_jumptable; - + current_break=break_save; + current_continue=continue_save;    return 0;    }
794:       case F_FOREACH:    { - struct jump_list cnt,brk; +    INT32 *prev_switch_jumptable = current_switch_jumptable; - + INT32 break_save = current_break; + INT32 continue_save = current_continue; +    current_switch_jumptable=0; - + current_break=alloc_label(); + current_continue=alloc_label();       tmp2=do_docode(CAR(n),DO_NOT_COPY); - ins_f_byte(F_CONST0); + emit2(F_CONST0);    tmp3=do_jump(F_BRANCH,-1); - tmp1=PC; - push_break_stack(&brk); - push_continue_stack(&cnt); + tmp1=ins_label(-1);    DO_CODE_BLOCK(CDR(n)); - pop_continue_stack(&cnt,PC); - set_branch(tmp3,PC); + ins_label(current_continue); + emit(F_LABEL,tmp3);    do_jump(n->token,tmp1); - pop_break_stack(&brk,PC); + ins_label(current_break);       current_switch_jumptable = prev_switch_jumptable; - + current_break=break_save; + current_continue=continue_save;    return 0;    }
819:    case F_INC_LOOP:    case F_DEC_LOOP:    { - struct jump_list cnt,brk; +    INT32 *prev_switch_jumptable = current_switch_jumptable; - + INT32 break_save = current_break; + INT32 continue_save = current_continue; +    current_switch_jumptable=0; - + current_break=alloc_label(); + current_continue=alloc_label();       tmp2=do_docode(CAR(n),0);    tmp3=do_jump(F_BRANCH,-1); - tmp1=PC; - push_break_stack(&brk); - push_continue_stack(&cnt); + tmp1=ins_label(-1); +    DO_CODE_BLOCK(CDR(n)); - pop_continue_stack(&cnt,PC); - set_branch(tmp3,PC); + ins_label(current_continue); + emit(F_LABEL,tmp3);    do_jump(n->token,tmp1); - pop_break_stack(&brk,PC); + ins_label(current_break);       current_switch_jumptable = prev_switch_jumptable; - + current_break=break_save; + current_continue=continue_save;    return 0;    }       case F_DO:    { - struct jump_list cnt,brk; +    INT32 *prev_switch_jumptable = current_switch_jumptable; - + INT32 break_save = current_break; + INT32 continue_save = current_continue; +    current_switch_jumptable=0; - + current_break=alloc_label(); + current_continue=alloc_label();    - tmp2=PC; - push_break_stack(&brk); - push_continue_stack(&cnt); + tmp2=ins_label(-1);    DO_CODE_BLOCK(CAR(n)); - pop_continue_stack(&cnt,PC); + ins_label(current_continue);    do_jump_when_non_zero(CDR(n),tmp2); - pop_break_stack(&brk,PC); + ins_label(current_break);       current_switch_jumptable = prev_switch_jumptable; - + current_break=break_save; + current_continue=continue_save;    return 0;    }
864:    }       tmp1=do_docode(CAR(n),0); - if(!tmp1) { ins_f_byte(F_CONST0); tmp1=1; } + if(!tmp1) { emit2(F_CONST0); tmp1=1; }    if(tmp1>1) do_pop(tmp1-1);       tmp1=store_prog_string(n->type); - ins_f_byte_with_numerical_arg(F_STRING,tmp1); - ins_f_byte(F_CAST); + emit(F_STRING,tmp1); + emit2(F_CAST);    return 1;       case F_APPLY: - ins_f_byte(F_MARK); +    if(CAR(n)->token == F_CONSTANT)    { - do_docode(CDR(n),0); - if(CAR(n)->u.sval.type == T_FUNCTION && - CAR(n)->u.sval.subtype != -1 && - CAR(n)->u.sval.u.object == &fake_object) + if(CAR(n)->u.sval.type == T_FUNCTION)    { - ins_f_byte_with_numerical_arg(F_CALL_LFUN, CAR(n)->u.sval.subtype); - }else{ + if(CAR(n)->u.sval.subtype == -1) /* driver fun? */ + { + if(!CAR(n)->u.sval.u.efun->docode || + !CAR(n)->u.sval.u.efun->docode(n)) + { + emit2(F_MARK); + do_docode(CDR(n),0);    tmp1=store_constant(& CAR(n)->u.sval,    !(CAR(n)->tree_info & OPT_EXTERNAL_DEPEND)); - ins_f_byte(F_MAX_OPCODE + tmp1); + emit(F_APPLY,tmp1); + }    if(n->type == void_type_string) return 0; - + return 1; + }else{ + if(CAR(n)->u.sval.u.object == &fake_object) + { + emit2(F_MARK); + do_docode(CDR(n),0); + emit(F_CALL_LFUN, CAR(n)->u.sval.subtype); + return 1;    } - + } + } + + emit2(F_MARK); + do_docode(CDR(n),0); + tmp1=store_constant(& CAR(n)->u.sval, + !(CAR(n)->tree_info & OPT_EXTERNAL_DEPEND)); + emit(F_APPLY,tmp1); +    return 1;    }    else if(CAR(n)->token == F_IDENTIFIER &&    ID_FROM_INT(& fake_program, CAR(n)->u.number)->flags & IDENTIFIER_FUNCTION)    { - + emit2(F_MARK);    do_docode(CDR(n),0); - ins_f_byte_with_numerical_arg(F_CALL_LFUN, CAR(n)->u.number); + emit(F_CALL_LFUN, CAR(n)->u.number);    return 1;    }    else    { - struct lpc_string *tmp; + struct pike_string *tmp;    struct efun *fun;    - + emit2(F_MARK);    tmp=make_shared_string("call_function");    if(!tmp) yyerror("No call_function efun.");    fun=lookup_efun(tmp);
911:    do_docode(CAR(n),0);    do_docode(CDR(n),0);    tmp1=store_constant(& fun->function, 1); - ins_f_byte(tmp1 + F_MAX_OPCODE); + emit(F_APPLY, tmp1);    return 1;    }
936:       case F_SWITCH:    { - struct jump_list brk; +    INT32 e,cases,*order;    INT32 *jumptable;    INT32 prev_switch_values_on_stack = current_switch_values_on_stack;    INT32 prev_switch_case = current_switch_case;    INT32 prev_switch_default = current_switch_default;    INT32 *prev_switch_jumptable = current_switch_jumptable; - + INT32 break_save = current_break;       if(do_docode(CAR(n),0)!=1)    fatal("Internal compiler error, time to panic\n");    - push_break_stack(&brk); + current_break=alloc_label();       cases=count_cases(CDR(n));    - ins_f_byte(F_SWITCH); - tmp1=PC; - ins_short(0, A_PROGRAM); - while(PC != (unsigned INT32)MY_ALIGN(PC)) - ins_byte(0, A_PROGRAM); - tmp2=PC; + tmp1=emit(F_SWITCH,0); + emit(F_ALIGN,sizeof(INT32)); +    current_switch_values_on_stack=0;    current_switch_case=0;    current_switch_default=-1;
965:       for(e=0; e<cases*2+1; e++)    { - jumptable[e]=do_jump(-1,-1); + jumptable[e]=emit(F_POINTER, 0);    current_switch_jumptable[e]=-1;    }
974:    DO_CODE_BLOCK(CDR(n));       f_aggregate(cases); - sp[-1].u.array=compact_array(sp[-1].u.array); +    order=get_switch_order(sp[-1].u.array);    - + /* Check for cases inside a range */    for(e=0; e<cases-1; e++)    { - if(current_switch_jumptable[order[e]*2+2] != -1) + if(current_switch_jumptable[ order[e]*2+2 ] != -1)    { - if(current_switch_jumptable[order[e]*2+2] != - current_switch_jumptable[order[e+1]*2+1]) + if(current_switch_jumptable[ order[e]*2+2 ] != + current_switch_jumptable[ order[e+1]*2+1 ])    yyerror("Case inside range.");    }    }    - if(current_switch_default < 0) current_switch_default = PC; + if(current_switch_default < 0) + current_switch_default = ins_label(-1);       for(e=0;e<cases*2+1;e++)    if(current_switch_jumptable[e]==-1)
999:    free((char *)order);       for(e=0; e<cases*2+1; e++) - low_set_branch(jumptable[e], current_switch_jumptable[e],tmp2); + update_arg(jumptable[e], current_switch_jumptable[e]);    - e=store_constant(sp-1,1); - upd_short(tmp1,e); + update_arg(tmp1, store_constant(sp-1,1));       pop_stack();    free((char *)jumptable);
1013:    current_switch_case = prev_switch_case;    current_switch_values_on_stack = prev_switch_values_on_stack ;    - pop_break_stack(&brk,PC); + emit(F_LABEL, current_break);    - + current_break=break_save;    return 0;    }
1039:    if(is_equal(sp-tmp1, sp-1))    yyerror("Duplicate case.");    - current_switch_jumptable[current_switch_case++]=PC; + current_switch_jumptable[current_switch_case++]=ins_label(-1);       if(CDR(n))    { - current_switch_jumptable[current_switch_case++]=PC; + if(!is_const(CDR(n))) + yyerror("Case label isn't constant."); + + current_switch_jumptable[current_switch_case+1]= + current_switch_jumptable[current_switch_case]= + current_switch_jumptable[current_switch_case-1]; + current_switch_case+=2;    tmp1=eval_low(CDR(n));    if(tmp1<1)    {
1056:    for(tmp1=current_switch_values_on_stack; tmp1 > 1; tmp1--)    if(is_equal(sp-tmp1, sp-1))    yyerror("Duplicate case."); - current_switch_jumptable[current_switch_case++]=PC; +    }    current_switch_jumptable[current_switch_case++]=-1;    }
1070:    }else if(current_switch_default!=-1){    yyerror("Duplicate switch default.");    }else{ - current_switch_default = PC; + current_switch_default = ins_label(-1);    }    return 0;       case F_BREAK: - if(!break_stack) + if(current_break == -1)    {    yyerror("Break outside loop or switch.");    }else{ - if(current_break>=break_stack_size) - { - break_stack_size*=2; - break_stack=(int *)realloc((char *)break_stack, - sizeof(int)*break_stack_size); - if(!break_stack) - fatal("Out of memory.\n"); + do_jump(F_BRANCH, current_break);    } - break_stack[current_break++]=do_jump(F_BRANCH,-1); - } +    return 0;       case F_CONTINUE: - if(!continue_stack) + if(current_continue == -1)    {    yyerror("continue outside loop or switch.");    }else{ - if(current_continue>=continue_stack_size) - { - continue_stack_size*=2; - continue_stack=(int *)realloc((char *)continue_stack, - sizeof(int)*continue_stack_size); + do_jump(F_BRANCH, current_continue);    } - continue_stack[current_continue++]=do_jump(F_BRANCH,-1); - } +    return 0;       case F_RETURN: - if(!CAR(n) || - (CAR(n)->token == F_CONSTANT && IS_ZERO(&CAR(n)->u.sval)) || - do_docode(CAR(n),0)<0) - { - ins_f_byte(F_RETURN_0); - }else{ - ins_f_byte(F_RETURN); - } + do_docode(CAR(n),0); + emit2(F_RETURN);    return 0;       case F_SSCANF:    tmp1=do_docode(CAR(n),DO_NOT_COPY);    tmp2=do_docode(CDR(n),DO_NOT_COPY | DO_LVALUE); - ins_f_byte_with_numerical_arg(F_SSCANF,tmp1+tmp2); + emit(F_SSCANF,tmp1+tmp2);    return 1;       case F_CATCH:    { - struct jump_list cnt,brk; + INT32 break_save = current_break; + INT32 continue_save = current_continue;    INT32 *prev_switch_jumptable = current_switch_jumptable; - +    current_switch_jumptable=0; - + current_break=alloc_label(); + current_continue=alloc_label();       tmp1=do_jump(F_CATCH,-1); - push_break_stack(&brk); - push_continue_stack(&cnt); +    DO_CODE_BLOCK(CAR(n)); - pop_continue_stack(&cnt,PC); - pop_break_stack(&brk,PC); - ins_f_byte(F_DUMB_RETURN); - set_branch(tmp1,PC); + ins_label(current_continue); + ins_label(current_break); + emit2(F_THROW_ZERO); + ins_label(tmp1);    - + current_break=break_save; + current_continue=continue_save;    current_switch_jumptable = prev_switch_jumptable;    return 1;    }
1156:    tmp1=do_docode(CAR(n), DO_NOT_COPY);    if(do_docode(CDR(n),DO_NOT_COPY) != 1)    fatal("Internal compiler error, please report this (1)."); - ins_f_byte(F_INDEX); + emit2(F_INDEX);    if(!(flags & DO_NOT_COPY))    {    while(n && n->token==F_INDEX) n=CAR(n);    if(n->token==F_CONSTANT && !(n->node_info & OPT_EXTERNAL_DEPEND)) - ins_f_byte(F_COPY_VALUE); + emit2(F_COPY_VALUE);    }    }    return tmp1;
1170:    switch(n->u.sval.type)    {    case T_INT: - ins_int(n->u.sval.u.integer); + emit(F_NUMBER,n->u.sval.u.integer);    return 1;    - case T_FLOAT: - ins_float(n->u.sval.u.float_number); - return 1; - +    case T_STRING:    tmp1=store_prog_string(n->u.sval.u.string); - ins_f_byte_with_numerical_arg(F_STRING,tmp1); + emit(F_STRING,tmp1);    return 1;       case T_FUNCTION:
1187:    {    if(n->u.sval.u.object == &fake_object)    { - ins_f_byte_with_numerical_arg(F_LFUN,n->u.sval.subtype); + emit(F_LFUN,n->u.sval.subtype);    return 1;    }    }       default:    tmp1=store_constant(&(n->u.sval),!(n->tree_info & OPT_EXTERNAL_DEPEND)); - ins_f_byte_with_numerical_arg(F_CONSTANT,tmp1); + emit(F_CONSTANT,tmp1);    return 1;       case T_ARRAY:    case T_MAPPING: - case T_LIST: + case T_MULTISET:    tmp1=store_constant(&(n->u.sval),!(n->tree_info & OPT_EXTERNAL_DEPEND)); - ins_f_byte_with_numerical_arg(F_CONSTANT,tmp1); + emit(F_CONSTANT,tmp1);       /* copy now or later ? */    if(!(flags & DO_NOT_COPY) && !(n->tree_info & OPT_EXTERNAL_DEPEND)) - ins_f_byte(F_COPY_VALUE); + emit2(F_COPY_VALUE);    return 1;       }
1213:    case F_LOCAL:    if(flags & DO_LVALUE)    { - ins_f_byte_with_numerical_arg(F_LOCAL_LVALUE,n->u.number); + emit(F_LOCAL_LVALUE,n->u.number);    return 2;    }else{ - ins_f_byte_with_numerical_arg(F_LOCAL,n->u.number); + emit(F_LOCAL,n->u.number);    return 1;    }
1227:    {    yyerror("Cannot assign functions.\n");    }else{ - ins_f_byte_with_numerical_arg(F_LFUN,n->u.number); + emit(F_LFUN,n->u.number);    }    }else{    if(flags & DO_LVALUE)    { - ins_f_byte_with_numerical_arg(F_GLOBAL_LVALUE,n->u.number); + emit(F_GLOBAL_LVALUE,n->u.number);    return 2;    }else{ - ins_f_byte_with_numerical_arg(F_GLOBAL,n->u.number); + emit(F_GLOBAL,n->u.number);    }    }    return 1;    - case F_EFUN: - ins_f_byte_with_numerical_arg(n->token,n->u.number); - return 1; - +    case F_VAL_LVAL:    return do_docode(CAR(n),flags)+do_docode(CDR(n),flags | DO_LVALUE);
1255:      void do_code_block(node *n)   { - clean_jumptable(); + init_bytecode(); + label_no=0;    DO_CODE_BLOCK(n); - + asm_opt(); + assemble();   } - + + int docode(node *n) + { + int tmp; + int label_no_save = label_no; + dynamic_buffer instrbuf_save = instrbuf; + + instrbuf.s.str=0; + label_no=0; + init_bytecode(); + + tmp=do_docode(n,0); + asm_opt(); + assemble(); + + instrbuf=instrbuf_save; + label_no = label_no_save; + return tmp; + }

pike.git/ src/ docode.c

1996-09-22

1996-09-22 19:40:33 by Fredrik Hübinette (Hubbe) <hubbe@hubbe.net>