Log of pike.git/src/builtin

1996-09-22

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

06983fde1434ab5470b2fb656c40db32b2e6a971 (1506 lines) (+1506/-0) ^{[

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 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 "interpret.h" + #include "svalue.h" + #include "macros.h" + #include "object.h" + #include "program.h" + #include "array.h" + #include "error.h" + #include "constants.h" + #include "mapping.h" + #include "stralloc.h" + #include "lex.h" + #include "multiset.h" + #include "pike_types.h" + #include "rusage.h" + #include "operators.h" + #include "fsort.h" + #include "callback.h" + #include "gc.h" + #include "backend.h" + #include "main.h" + #include "memory.h" + #include "time_stuff.h" + #include <math.h> + #include <ctype.h> - + #ifdef HAVE_CRYPT_H + #include <crypt.h> + #endif + + + void f_equal(INT32 args) + { + int i; + if(args < 2) + error("Too few arguments to equal.\n"); + + i=is_equal(sp-2,sp-1); + pop_n_elems(args); + push_int(i); + } + + void f_aggregate(INT32 args) + { + struct array *a; + #ifdef DEBUG + if(args < 0) fatal("Negative args to f_aggregate()\n"); + #endif + + a=aggregate_array(args); + push_array(a); /* beware, macro */ + } + + void f_trace(INT32 args) + { + extern int t_flag; + int old_t_flag; + + if(args < 1) + error("Too few arguments to trace()\n"); + + if(sp[-args].type != T_INT) + error("Bad argument 1 to trace()\n"); + + old_t_flag=t_flag; + t_flag=sp[-args].u.integer; + sp[-args].u.integer=old_t_flag; + pop_n_elems(args-1); + } + + void f_hash(INT32 args) + { + INT32 i; + if(!args) + error("Too few arguments to hash()\n"); + if(sp[-args].type != T_STRING) + error("Bad argument 1 to hash()\n"); + i=hashstr((unsigned char *)sp[-args].u.string->str,100); + + if(args > 1) + { + if(sp[1-args].type != T_INT) + error("Bad argument 2 to hash()\n"); + + if(!sp[1-args].u.integer) + error("Modulo by zero in hash()\n"); + + i%=(unsigned INT32)sp[1-args].u.integer; + } + pop_n_elems(args); + push_int(i); + } + + void f_copy_value(INT32 args) + { + if(!args) + error("Too few arguments to copy_value()\n"); + + pop_n_elems(args-1); + copy_svalues_recursively_no_free(sp,sp-1,1,0); + free_svalue(sp-1); + sp[-1]=sp[0]; + } + + void f_ctime(INT32 args) + { + INT32 i; + if(!args) + error("Too few arguments to ctime()\n"); + if(sp[-args].type != T_INT) + error("Bad argument 1 to ctime()\n"); + i=sp[-args].u.integer; + pop_n_elems(args); + push_string(make_shared_string(ctime((time_t *)&i))); + } + + void f_lower_case(INT32 args) + { + INT32 i; + struct pike_string *ret; + if(!args) + error("Too few arguments to lower_case()\n"); + if(sp[-args].type != T_STRING) + error("Bad argument 1 to lower_case()\n"); + + ret=begin_shared_string(sp[-args].u.string->len); + MEMCPY(ret->str, sp[-args].u.string->str,sp[-args].u.string->len); + + for (i = sp[-args].u.string->len-1; i>=0; i--) + if (isupper(ret->str[i])) + ret->str[i] = tolower(ret->str[i]); + + pop_n_elems(args); + push_string(end_shared_string(ret)); + } + + void f_upper_case(INT32 args) + { + INT32 i; + struct pike_string *ret; + if(!args) + error("Too few arguments to upper_case()\n"); + if(sp[-args].type != T_STRING) + error("Bad argument 1 to upper_case()\n"); + + ret=begin_shared_string(sp[-args].u.string->len); + MEMCPY(ret->str, sp[-args].u.string->str,sp[-args].u.string->len); + + for (i = sp[-args].u.string->len-1; i>=0; i--) + if (islower(ret->str[i])) + ret->str[i] = toupper(ret->str[i]); + + pop_n_elems(args); + push_string(end_shared_string(ret)); + } + + void f_random(INT32 args) + { + if(!args) + error("Too few arguments to random()\n"); + if(sp[-args].type != T_INT) + error("Bad argument 1 to random()\n"); + + if(sp[-args].u.integer <= 0) + { + sp[-args].u.integer = 0; + }else{ + sp[-args].u.integer = my_rand() % sp[-args].u.integer; + } + pop_n_elems(args-1); + } + + void f_random_seed(INT32 args) + { + if(!args) + error("Too few arguments to random_seed()\n"); + if(sp[-args].type != T_INT) + error("Bad argument 1 to random_seed()\n"); + + my_srand(sp[-args].u.integer); + pop_n_elems(args); + } + + void f_query_num_arg(INT32 args) + { + pop_n_elems(args); + push_int(fp ? fp->args : 0); + } + + void f_search(INT32 args) + { + INT32 start; + + if(args < 2) + error("Too few arguments to search().\n"); + + switch(sp[-args].type) + { + case T_STRING: + { + char *ptr; + INT32 len; + if(sp[1-args].type != T_STRING) + error("Bad argument 2 to search()\n"); + + start=0; + if(args > 2) + { + if(sp[2-args].type!=T_INT) + error("Bad argument 3 to search()\n"); + + start=sp[2-args].u.integer; + } + len=sp[-args].u.string->len - start; + + if(len>0 && (ptr=my_memmem(sp[1-args].u.string->str, + sp[1-args].u.string->len, + sp[-args].u.string->str+start, + len))) + { + start=ptr-sp[-args].u.string->str; + }else{ + start=-1; + } + pop_n_elems(args); + push_int(start); + break; + } + + case T_ARRAY: + start=0; + if(args > 2) + { + if(sp[2-args].type!=T_INT) + error("Bad argument 3 to search()\n"); + + start=sp[2-args].u.integer; + } + start=array_search(sp[-args].u.array,sp+1-args,start); + pop_n_elems(args); + push_int(start); + break; + + case T_MAPPING: + if(args > 2) + mapping_search_no_free(sp,sp[-args].u.mapping,sp+1-args,sp+2-args); + else + mapping_search_no_free(sp,sp[-args].u.mapping,sp+1-args,0); + free_svalue(sp-args); + sp[-args]=*sp; + pop_n_elems(args-1); + return; + + default: + error("Bad argument 2 to search()\n"); + } + } + + void f_clone(INT32 args) + { + struct object *o; + + if(args<1) + error("Too few arguments to clone.\n"); + + if(sp[-args].type != T_PROGRAM) + error("Bad argument 1 to clone.\n"); + + o=clone(sp[-args].u.program,args-1); + pop_stack(); + push_object(o); + } + + void f_call_function(INT32 args) + { + INT32 expected_stack=sp-args+2-evaluator_stack; + + strict_apply_svalue(sp-args, args - 1); + if(sp < expected_stack + evaluator_stack) + { + #ifdef DEBUG + if(sp+1 != expected_stack + evaluator_stack) + fatal("Stack underflow!\n"); + #endif + + pop_stack(); + push_int(0); + }else{ + free_svalue(sp-2); + sp[-2]=sp[-1]; + sp--; + } + } + + void f_backtrace(INT32 args) + { + INT32 frames; + struct frame *f; + struct array *a,*i; + + frames=0; + if(args) pop_n_elems(args); + for(f=fp;f;f=f->parent_frame) frames++; + + sp->type=T_ARRAY; + sp->u.array=a=allocate_array_no_init(frames,0); + sp++; + + for(f=fp;f;f=f->parent_frame) + { + char *program_name; + + frames--; + + if(f->current_object && f->current_object->prog) + { + ITEM(a)[frames].u.array=i=allocate_array_no_init(3,0); + ITEM(a)[frames].type=T_ARRAY; + ITEM(i)[2].type=T_FUNCTION; + ITEM(i)[2].subtype=f->fun; + ITEM(i)[2].u.object=f->current_object; + f->current_object->refs++; + + if(f->pc) + { + program_name=get_line(f->pc, f->context.prog, & ITEM(i)[1].u.integer); + ITEM(i)[1].subtype=NUMBER_NUMBER; + ITEM(i)[1].type=T_INT; + + ITEM(i)[0].u.string=make_shared_string(program_name); + #ifdef __CHECKER__ + ITEM(i)[0].subtype=0; + #endif + ITEM(i)[0].type=T_STRING; + }else{ + ITEM(i)[1].u.integer=0; + ITEM(i)[1].subtype=NUMBER_NUMBER; + ITEM(i)[1].type=T_INT; + + ITEM(i)[0].u.integer=0; + ITEM(i)[0].subtype=NUMBER_NUMBER; + ITEM(i)[0].type=T_INT; + } + i->type_field = BIT_FUNCTION | BIT_INT | BIT_STRING; + }else{ + ITEM(a)[frames].type=T_INT; + ITEM(a)[frames].u.integer=0; + } + } + a->type_field = BIT_ARRAY | BIT_INT; + } + + void f_add_constant(INT32 args) + { + if(args<1) + error("Too few arguments to add_efun.\n"); + + if(sp[-args].type!=T_STRING) + error("Bad argument 1 to add_efun.\n"); + + if(args>1) + { + low_add_efun(sp[-args].u.string, sp-args+1); + }else{ + low_add_efun(sp[-args].u.string, 0); + } + pop_n_elems(args); + } + + void f_compile_file(INT32 args) + { + struct program *p; + if(args<1) + error("Too few arguments to compile_file.\n"); + + if(sp[-args].type!=T_STRING) + error("Bad argument 1 to compile_file.\n"); + + p=compile_file(sp[-args].u.string); + pop_n_elems(args); + push_program(p); + } + + static char *combine_path(char *cwd,char *file) + { + /* cwd is supposed to be combined already */ + char *ret; + register char *from,*to; + char *my_cwd; + my_cwd=0; + + + if(file[0]=='/') + { + cwd="/"; + file++; + } + #ifdef DEBUG + if(!cwd) + fatal("No cwd in combine_path!\n"); + #endif + + if(cwd[strlen(cwd)-1]=='/') + { + ret=(char *)xalloc(strlen(cwd)+strlen(file)+1); + strcpy(ret,cwd); + strcat(ret,file); + }else{ + ret=(char *)xalloc(strlen(cwd)+strlen(file)+2); + strcpy(ret,cwd); + strcat(ret,"/"); + strcat(ret,file); + } + + from=to=ret; + + while(( *to = *from )) + { + if(*from == '/') + { + while(from[1] == '/') from++; + if(from[1] == '.') + { + switch(from[2]) + { + case '.': + if(from[3] == '/' || from[3] == 0) + { + from+=3; + if(to != ret) + { + for(--to;*to!='/' && to>ret;to--); + } + if(!*from && to==ret && *to=='/') to++; + continue; + } + break; + + case '/': + case 0: + from+=2; + continue; + } + } + } + from++; + to++; + } + + if(my_cwd) free(my_cwd); + return ret; + } + + void f_combine_path(INT32 args) + { + char *path; + if(args<2) + error("Too few arguments to combine_path.\n"); + + if(sp[-args].type != T_STRING) + error("Bad argument 1 to combine_path.\n"); + + if(sp[1-args].type != T_STRING) + error("Bad argument 2 to combine_path.\n"); + + path=combine_path(sp[-args].u.string->str,sp[1-args].u.string->str); + pop_n_elems(args); + + sp->u.string=make_shared_string(path); + sp->type=T_STRING; + sp++; + free(path); + } + + void f_function_object(INT32 args) + { + if(args < 1) + error("Too few arguments to function_object()\n"); + if(sp[-args].type != T_FUNCTION) + error("Bad argument 1 to function_object.\n"); + + if(sp[-args].subtype == -1) + { + pop_n_elems(args); + push_int(0); + }else{ + pop_n_elems(args-1); + sp[-1].type=T_OBJECT; + } + } + + void f_function_name(INT32 args) + { + struct pike_string *s; + if(args < 1) + error("Too few arguments to function_object()\n"); + if(sp[-args].type != T_FUNCTION) + error("Bad argument 1 to function_object.\n"); + + if(sp[-args].subtype == -1) + { + pop_n_elems(args); + push_int(0); + }else{ + if(!sp[-args].u.object->prog) + error("function_name on destructed object.\n"); + + copy_shared_string(s,ID_FROM_INT(sp[-args].u.object->prog, + sp[-args].subtype)->name); + pop_n_elems(args); + + sp->type=T_STRING; + sp->u.string=s; + sp++; + } + } + + void f_zero_type(INT32 args) + { + if(args < 1) + error("Too few arguments to zero_type()\n"); + if(sp[-args].type != T_INT) + error("Bad argument 1 to zero_type.\n"); + + pop_n_elems(args-1); + sp[-1].u.integer=sp[-1].subtype; + sp[-1].subtype=NUMBER_NUMBER; + } + + void f_all_constants(INT32 args) + { + INT32 stack_size; + pop_n_elems(args); + stack_size=sp - evaluator_stack; + push_all_efuns_on_stack(); + f_aggregate_mapping(sp - evaluator_stack - stack_size); + } + + void f_allocate(INT32 args) + { + INT32 size; + + if(args < 1) + error("Too few arguments to allocate.\n"); + + if(sp[-args].type!=T_INT) + error("Bad argument 1 to allocate.\n"); + + + size=sp[-args].u.integer; + if(size < 0) + error("Allocate on negative number.\n"); + pop_n_elems(args); + push_array( allocate_array(size) ); + } + + void f_rusage(INT32 args) + { + INT32 *rus,e; + struct array *v; + pop_n_elems(args); + rus=low_rusage(); + if(!rus) + error("System rusage information not available.\n"); + v=allocate_array_no_init(29,0); + + for(e=0;e<29;e++) + { + ITEM(v)[e].type=T_INT; + ITEM(v)[e].subtype=NUMBER_NUMBER; + ITEM(v)[e].u.integer=rus[e]; + } + + sp->u.array=v; + sp->type=T_ARRAY; + sp++; + } + + void f_this_object(INT32 args) + { + pop_n_elems(args); + if(fp) + { + sp->u.object=fp->current_object; + sp->type=T_OBJECT; + fp->current_object->refs++; + sp++; + }else{ + push_int(0); + } + } + + void f_throw(INT32 args) + { + if(args < 1) + error("Too few arguments to throw()\n"); + pop_n_elems(args-1); + throw_value=sp[-1]; + sp--; + throw(); + } + + static struct callback *exit_callbacks=0; + + struct callback *add_exit_callback(callback_func call, + void *arg, + callback_func free_func) + { + return add_to_callback(&exit_callbacks, call, arg, free_func); + } + + void f_exit(INT32 args) + { + int i; + if(args < 1) + error("Too few arguments to exit.\n"); + + if(sp[-args].type != T_INT) + error("Bad argument 1 to exit.\n"); + + call_callback(&exit_callbacks, (void *)0); + free_callback(&exit_callbacks); + + i=sp[-args].u.integer; + #ifdef DEBUG + exit_modules(); + #endif + + exit(i); + } + + void f_query_host_name(INT32 args) + { + char hostname[1000]; + pop_n_elems(args); + gethostname(hostname,1000); + push_string(make_shared_string(hostname)); + } + + void f_time(INT32 args) + { + pop_n_elems(args); + if(args) + push_int(current_time.tv_sec); + else + push_int((INT32)TIME(0)); + } + + void f_crypt(INT32 args) + { + char salt[2]; + char *ret, *saltp; + char *choise = + "cbhisjKlm4k65p7qrJfLMNQOPxwzyAaBDFgnoWXYCZ0123tvdHueEGISRTUV89./"; + + if(args < 1) + error("Too few arguments to crypt()\n"); + + if(sp[-args].type != T_STRING) + error("Bad argument 1 to crypt()\n"); + + + if(args>1) + { + if(sp[1-args].type != T_STRING || + sp[1-args].u.string->len < 2) + error("Bad argument 2 to crypt()\n"); + + saltp=sp[1-args].u.string->str; + } else { + salt[0] = choise[my_rand()%strlen(choise)]; + salt[1] = choise[my_rand()%strlen(choise)]; + saltp=salt; + } + #ifdef HAVE_CRYPT + ret = (char *)crypt(sp[-args].u.string->str, saltp); + #else + #ifdef HAVE__CRYPT + ret = (char *)_crypt(sp[-args].u.string->str, saltp); + #else + ret = sp[-args].u.string->str; + #endif + #endif + if(args < 2) + { + pop_n_elems(args); + push_string(make_shared_string(ret)); + }else{ + int i; + i=!strcmp(ret,sp[1-args].u.string->str); + pop_n_elems(args); + push_int(i); + } + } + + void f_destruct(INT32 args) + { + struct object *o; + if(args) + { + if(sp[-args].type != T_OBJECT) + error("Bad arguments 1 to destruct()\n"); + + o=sp[-args].u.object; + }else{ + if(!fp) + error("Destruct called without argument from callback function.\n"); + + o=fp->current_object; + } + destruct(o); + pop_n_elems(args); + } + + void f_indices(INT32 args) + { + INT32 size; + struct array *a; + if(args < 1) + error("Too few arguments to indices()\n"); + + switch(sp[-args].type) + { + case T_STRING: + size=sp[-args].u.string->len; + goto qjump; + + case T_ARRAY: + size=sp[-args].u.array->size; + + qjump: + a=allocate_array_no_init(size,0); + while(--size>=0) + { + ITEM(a)[size].type=T_INT; + ITEM(a)[size].subtype=NUMBER_NUMBER; + ITEM(a)[size].u.integer=size; + } + break; + + case T_MAPPING: + a=mapping_indices(sp[-args].u.mapping); + break; + + case T_MULTISET: + a=copy_array(sp[-args].u.multiset->ind); + break; + + case T_OBJECT: + a=object_indices(sp[-args].u.object); + break; + + default: + error("Bad argument 1 to indices()\n"); + return; /* make apcc happy */ + } + pop_n_elems(args); + push_array(a); + } + + void f_values(INT32 args) + { + INT32 size; + struct array *a; + if(args < 1) + error("Too few arguments to values()\n"); + + switch(sp[-args].type) + { + case T_STRING: + size=sp[-args].u.string->len; + a=allocate_array_no_init(size,0); + while(--size>=0) + { + ITEM(a)[size].type=T_INT; + ITEM(a)[size].subtype=NUMBER_NUMBER; + ITEM(a)[size].u.integer=EXTRACT_UCHAR(sp[-args].u.string->str+size); + } + break; + + case T_ARRAY: + a=copy_array(sp[-args].u.array); + break; + + case T_MAPPING: + a=mapping_values(sp[-args].u.mapping); + break; + + case T_MULTISET: + size=sp[-args].u.multiset->ind->size; + a=allocate_array_no_init(size,0); + while(--size>=0) + { + ITEM(a)[size].type=T_INT; + ITEM(a)[size].subtype=NUMBER_NUMBER; + ITEM(a)[size].u.integer=1; + } + break; + + case T_OBJECT: + a=object_values(sp[-args].u.object); + break; + + default: + error("Bad argument 1 to values()\n"); + return; /* make apcc happy */ + } + pop_n_elems(args); + push_array(a); + } + + void f_next_object(INT32 args) + { + struct object *o; + if(args < 1) + { + o=first_object; + }else{ + if(sp[-args].type != T_OBJECT) + error("Bad argument 1 to next_object()\n"); + o=sp[-args].u.object->next; + } + pop_n_elems(args); + if(!o) + { + push_int(0); + }else{ + o->refs++; + push_object(o); + } + } + + void f_object_program(INT32 args) + { + struct program *p; + if(args < 1) + error("Too few argumenets to object_program()\n"); + + if(sp[-args].type != T_OBJECT) + error("Bad argument 1 to object_program()\n"); + + p=sp[-args].u.object->prog; + pop_n_elems(args); + + if(!p) + { + push_int(0); + }else{ + p->refs++; + push_program(p); + } + } + + void f_reverse(INT32 args) + { + if(args < 1) + error("Too few arguments to reverse()\n"); + + switch(sp[-args].type) + { + case T_STRING: + { + INT32 e; + struct pike_string *s; + s=begin_shared_string(sp[-args].u.string->len); + for(e=0;e<sp[-args].u.string->len;e++) + s->str[e]=sp[-args].u.string->str[sp[-args].u.string->len-1-e]; + s=end_shared_string(s); + pop_n_elems(args); + push_string(s); + break; + } + + case T_INT: + { + INT32 e; + e=sp[-args].u.integer; + e=((e & 0x55555555UL)<<1) + ((e & 0xaaaaaaaaUL)>>1); + e=((e & 0x33333333UL)<<2) + ((e & 0xccccccccUL)>>2); + e=((e & 0x0f0f0f0fUL)<<4) + ((e & 0xf0f0f0f0UL)>>4); + e=((e & 0x00ff00ffUL)<<8) + ((e & 0xff00ff00UL)>>8); + e=((e & 0x0000ffffUL)<<16)+ ((e & 0xffff0000UL)>>16); + sp[-args].u.integer=e; + pop_n_elems(args-1); + break; + } + + case T_ARRAY: + { + struct array *a; + a=reverse_array(sp[-args].u.array); + pop_n_elems(args); + push_array(a); + break; + } + + default: + error("Bad argument 1 to reverse()\n"); + + } + } + + struct tupel + { + struct pike_string *ind,*val; + }; + + static int replace_sortfun(void *a,void *b) + { + return my_quick_strcmp( ((struct tupel *)a)->ind, ((struct tupel *)b)->ind); + } + + static struct pike_string * replace_many(struct pike_string *str, + struct array *from, + struct array *to) + { + char *s; + INT32 length,e; + + struct tupel *v; + + int set_start[256]; + int set_end[256]; + + if(from->size != to->size) + error("Replace must have equal-sized from and to arrays.\n"); + + if(!from->size) + { + reference_shared_string(str); + return str; + } + + v=(struct tupel *)xalloc(sizeof(struct tupel)*from->size); + + for(e=0;e<from->size;e++) + { + if(ITEM(from)[e].type != T_STRING) + error("Replace: from array not string *\n"); + v[e].ind=ITEM(from)[e].u.string; + } + + for(e=0;e<to->size;e++) + { + if(ITEM(to)[e].type != T_STRING) + error("Replace: to array not string *\n"); + v[e].val=ITEM(to)[e].u.string; + } + + fsort((char *)v,from->size,sizeof(struct tupel),(fsortfun)replace_sortfun); + + for(e=0;e<256;e++) + set_end[e]=set_start[e]=0; + + for(e=0;e<from->size;e++) + { + set_start[EXTRACT_UCHAR(v[from->size-1-e].ind->str)]=from->size-e-1; + set_end[EXTRACT_UCHAR(v[e].ind->str)]=e+1; + } + + init_buf(); + + length=str->len; + s=str->str; + + for(;length > 0;) + { + INT32 a,b,c; + if((b=set_end[EXTRACT_UCHAR(s)])) + { + a=set_start[EXTRACT_UCHAR(s)]; + while(a<b) + { + c=(a+b)/2; + + if(low_quick_binary_strcmp(v[c].ind->str,v[c].ind->len,s,length) <=0) + { + if(a==c) break; + a=c; + }else{ + b=c; + } + } + if(a<from->size && + length >= v[a].ind->len && + !low_quick_binary_strcmp(v[a].ind->str,v[a].ind->len, + s,v[a].ind->len)) + { + c=v[a].ind->len; + if(!c) c=1; + s+=c; + length-=c; + my_binary_strcat(v[a].val->str,v[a].val->len); + continue; + } + } + my_putchar(*s); + s++; + length--; + } + + free((char *)v); + return free_buf(); + } + + void f_replace(INT32 args) + { + if(args < 3) + error("Too few arguments to replace()\n"); + + switch(sp[-args].type) + { + case T_ARRAY: + { + array_replace(sp[-args].u.array,sp+1-args,sp+2-args); + pop_n_elems(args-1); + break; + } + + case T_MAPPING: + { + mapping_replace(sp[-args].u.mapping,sp+1-args,sp+2-args); + pop_n_elems(args-1); + break; + } + + case T_STRING: + { + struct pike_string *s; + switch(sp[1-args].type) + { + default: + error("Bad argument 2 to replace()\n"); + + case T_STRING: + if(sp[2-args].type != T_STRING) + error("Bad argument 3 to replace()\n"); + + s=string_replace(sp[-args].u.string, + sp[1-args].u.string, + sp[2-args].u.string); + break; + + case T_ARRAY: + if(sp[2-args].type != T_ARRAY) + error("Bad argument 3 to replace()\n"); + + s=replace_many(sp[-args].u.string, + sp[1-args].u.array, + sp[2-args].u.array); + + } + pop_n_elems(args); + push_string(s); + break; + } + + default: + error("Bad argument 1 to replace().\n"); + } + } + + void f_compile_string(INT32 args) + { + + struct program *p; + if(args < 1) + error("Too few arguments to compile_string()\n"); + + if(sp[-args].type != T_STRING) + error("Bad argument 1 to compile_string()\n"); + + if(args < 2) + { + push_string(make_shared_string("-")); + args++; + } + + if(sp[1-args].type != T_STRING) + error("Bad argument 2 to compile_string()\n"); + + p=compile_string(sp[-args].u.string,sp[1-args].u.string); + pop_n_elems(args); + push_program(p); + } + + void f_mkmapping(INT32 args) + { + struct mapping *m; + if(args<2) + error("Too few arguments to mkmapping.\n"); + if(sp[-args].type!=T_ARRAY) + error("Bad argument 1 to mkmapping.\n"); + if(sp[1-args].type!=T_ARRAY) + error("Bad argument 2 to mkmapping.\n"); + + m=mkmapping(sp[-args].u.array, sp[1-args].u.array); + pop_n_elems(args); + push_mapping(m); + } + + void f_objectp(INT32 args) + { + if(args<1) error("Too few arguments to objectp.\n"); + if(sp[-args].type != T_OBJECT || !sp[-args].u.object->prog) + { + pop_n_elems(args); + push_int(0); + }else{ + pop_n_elems(args); + push_int(1); + } + } + + void f_functionp(INT32 args) + { + if(args<1) error("Too few arguments to functionp.\n"); + if(sp[-args].type != T_FUNCTION || + (sp[-args].subtype != -1 && !sp[-args].u.object->prog)) + { + pop_n_elems(args); + push_int(0); + }else{ + pop_n_elems(args); + push_int(1); + } + } + + void f_sleep(INT32 args) + { + struct timeval t1,t2,t3; + INT32 a,b; + + if(!args) + error("Too few arguments to sleep.\n"); + + GETTIMEOFDAY(&t1); + + switch(sp[-args].type) + { + case T_INT: + t2.tv_sec=sp[-args].u.integer; + t2.tv_usec=0; + break; + + case T_FLOAT: + { + FLOAT_TYPE f; + f=sp[-args].u.float_number; + t2.tv_sec=floor(f); + t2.tv_usec=(long)(1000000.0*(f-floor(f))); + break; + } + + default: + error("Bad argument 1 to sleep.\n"); + } + + my_add_timeval(&t1, &t2); + + pop_n_elems(args); + while(1) + { + GETTIMEOFDAY(&t2); + if(my_timercmp(&t1, <= , &t2)) + break; + + t3=t1; + my_subtract_timeval(&t3, &t2); + + select(0,0,0,0,&t3); + check_threads_etc(); + } + } + + #ifdef GC2 + void f_gc(INT32 args) + { + INT32 tmp; + pop_n_elems(args); + tmp=num_objects; + do_gc(); + push_int(tmp - num_objects); + } + #endif + + #ifdef TYPEP + #undef TYPEP + #endif + + #define TYPEP(ID,NAME,TYPE) \ + void ID(INT32 args) \ + { \ + int t; \ + if(args<1) error("Too few arguments to %s.\n",NAME); \ + t=sp[-args].type == TYPE; \ + pop_n_elems(args); \ + push_int(t); \ + } + + TYPEP(f_programp, "programp", T_PROGRAM) + TYPEP(f_intp, "intpp", T_INT) + TYPEP(f_mappingp, "mappingp", T_MAPPING) + TYPEP(f_arrayp, "arrayp", T_ARRAY) + TYPEP(f_multisetp, "multisetp", T_MULTISET) + TYPEP(f_stringp, "stringp", T_STRING) + TYPEP(f_floatp, "floatp", T_FLOAT) + + void f_sort(INT32 args) + { + INT32 e,*order; + + if(args < 0) + fatal("Too few arguments to sort().\n"); + + for(e=0;e<args;e++) + { + if(sp[e-args].type != T_ARRAY) + error("Bad argument %ld to sort().\n",(long)(e+1)); + + if(sp[e-args].u.array->size != sp[-args].u.array->size) + error("Argument %ld to sort() has wrong size.\n",(long)(e+1)); + } + + if(args > 1) + { + order=get_alpha_order(sp[-args].u.array); + for(e=0;e<args;e++) order_array(sp[e-args].u.array,order); + free((char *)order); + pop_n_elems(args-1); + } else { + sort_array_destructively(sp[-args].u.array); + } + } + + void f_rows(INT32 args) + { + INT32 e; + struct array *a,*tmp; + + if(args < 2) + error("Too few arguments to rows().\n"); + + if(sp[1-args].type!=T_ARRAY) + error("Bad argument 1 to rows().\n"); + + tmp=sp[1-args].u.array; + push_array(a=allocate_array(tmp->size)); + + for(e=0;e<a->size;e++) + index_no_free(ITEM(a)+e, sp-args-1, ITEM(tmp)+e); + + a->refs++; + pop_n_elems(args+1); + push_array(a); + } + + void f_column(INT32 args) + { + INT32 e; + struct array *a,*tmp; + + if(args < 2) + error("Too few arguments to column().\n"); + + if(sp[-args].type!=T_ARRAY) + error("Bad argument 1 to column().\n"); + + tmp=sp[-args].u.array; + push_array(a=allocate_array(tmp->size)); + + for(e=0;e<a->size;e++) + index_no_free(ITEM(a)+e, ITEM(tmp)+e, sp-args); + + a->refs++; + pop_n_elems(args+1); + push_array(a); + } + + #ifdef DEBUG + void f__verify_internals(INT32 args) + { + INT32 tmp; + tmp=d_flag; + d_flag=0x7fffffff; + do_debug(); + d_flag=tmp; + pop_n_elems(args); + } + + #endif + + #ifdef HAVE_LOCALTIME + void f_localtime(INT32 args) + { + struct tm *tm; + time_t t; + if (args<1 || sp[-1].type!=T_INT) + error("Illegal argument to localtime"); + + t=sp[-1].u.integer; + tm=localtime(&t); + pop_n_elems(args); + + push_string(make_shared_string("sec")); + push_int(tm->tm_sec); + push_string(make_shared_string("min")); + push_int(tm->tm_min); + push_string(make_shared_string("hour")); + push_int(tm->tm_hour); + + push_string(make_shared_string("mday")); + push_int(tm->tm_mday); + push_string(make_shared_string("mon")); + push_int(tm->tm_mon); + push_string(make_shared_string("year")); + push_int(tm->tm_year); + + push_string(make_shared_string("wday")); + push_int(tm->tm_wday); + push_string(make_shared_string("yday")); + push_int(tm->tm_yday); + push_string(make_shared_string("isdst")); + push_int(tm->tm_isdst); + + #ifdef HAVE_EXTERNAL_TIMEZONE + push_string(make_shared_string("timezone")); + push_int(timezone); + f_aggregate_mapping(20); + #else + #ifdef STRUCT_TM_HAS_GMTOFF + push_string(make_shared_string("timezone")); + push_int(tm->tm_gmtoff); + f_aggregate_mapping(20); + #else + f_aggregate_mapping(18); + #endif + #endif + } + #endif + + + /* Check if the glob s[0..len[ matches the string m[0..mlen[ */ + static int does_match(char *s, int len, char *m, int mlen) + { + int i,j; + for (i=j=0; i<mlen && j<len; i++,j++) + { + switch (m[i]) + { + case '?': break; + + case '*': + i++; + if (i==mlen) return 1; /* slut */ + + for (;j<len;j++) + if (does_match(s+j,len-j,m+i,mlen-i)) + return 1; + + return 0; + + default: + if (m[i]!=s[j]) return 0; + } + } + if (i==mlen && j==len) return 1; + return 0; + } + + void f_glob(INT32 args) + { + INT32 i,matches; + struct array *a; + struct svalue *sval, tmp; + struct pike_string *glob; + + if(args < 2) + error("Too few arguments to glob().\n"); + + if(args > 2) pop_n_elems(args-2); + args=2; + + if (sp[-args].type!=T_STRING) + error("Bad argument 2 to glob().\n"); + + glob=sp[-args].u.string; + + switch(sp[1-args].type) + { + case T_STRING: + i=does_match(sp[1-args].u.string->str, + sp[1-args].u.string->len, + glob->str, + glob->len); + pop_n_elems(2); + push_int(i); + break; + + case T_ARRAY: + a=sp[1-args].u.array; + matches=0; + for(i=0;i<a->size;i++) + { + if(does_match(ITEM(a)[i].u.string->str, + ITEM(a)[i].u.string->len, + glob->str, + glob->len)) + { + ITEM(a)[i].u.string->refs++; + push_string(ITEM(a)[i].u.string); + matches++; + } + } + f_aggregate(matches); + tmp=sp[-1]; + sp--; + pop_n_elems(2); + sp[0]=tmp; + sp++; + break; + + default: + error("Bad argument 2 to glob().\n"); + } + } + + void init_builtin_efuns() + { + init_operators(); + + add_efun("add_constant",f_add_constant,"function(string,void|mixed:void)",OPT_SIDE_EFFECT); + add_efun("aggregate",f_aggregate,"function(mixed ...:mixed *)",OPT_TRY_OPTIMIZE); + add_efun("aggregate_multiset",f_aggregate_multiset,"function(mixed ...:multiset)",OPT_TRY_OPTIMIZE); + add_efun("aggregate_mapping",f_aggregate_mapping,"function(mixed ...:mapping)",OPT_TRY_OPTIMIZE); + add_efun("all_constants",f_all_constants,"function(:mapping(string:mixed))",OPT_EXTERNAL_DEPEND); + add_efun("allocate", f_allocate, "function(int, string|void:mixed *)", 0); + add_efun("arrayp", f_arrayp, "function(mixed:int)",0); + add_efun("backtrace",f_backtrace,"function(:array(array(function|int|string)))",OPT_EXTERNAL_DEPEND); + add_efun("call_function",f_call_function,"function(mixed,mixed ...:mixed)",OPT_SIDE_EFFECT | OPT_EXTERNAL_DEPEND); + add_efun("clone",f_clone,"function(program,mixed...:object)",OPT_EXTERNAL_DEPEND); + add_efun("column",f_column,"function(array,mixed:array)",0); + add_efun("combine_path",f_combine_path,"function(string,string:string)",0); + add_efun("compile_file",f_compile_file,"function(string:program)",OPT_EXTERNAL_DEPEND); + add_efun("compile_string",f_compile_string,"function(string,string|void:program)",OPT_EXTERNAL_DEPEND); + add_efun("copy_value",f_copy_value,"function(mixed:mixed)",0); + add_efun("crypt",f_crypt,"function(string:string)|function(string,string:int)",OPT_EXTERNAL_DEPEND); + add_efun("ctime",f_ctime,"function(int:string)",OPT_TRY_OPTIMIZE); + add_efun("destruct",f_destruct,"function(object|void:void)",OPT_SIDE_EFFECT); + add_efun("equal",f_equal,"function(mixed,mixed:int)",OPT_TRY_OPTIMIZE); + add_efun("exit",f_exit,"function(int:void)",OPT_SIDE_EFFECT); + add_efun("floatp", f_floatp, "function(mixed:int)",OPT_TRY_OPTIMIZE); + add_efun("function_name",f_function_name,"function(function:string)",OPT_TRY_OPTIMIZE); + add_efun("function_object",f_function_object,"function(function:object)",OPT_TRY_OPTIMIZE); + add_efun("functionp", f_functionp, "function(mixed:int)",OPT_TRY_OPTIMIZE); + add_efun("glob",f_glob,"function(string,string:int)|function(string,string*:array(string))",OPT_TRY_OPTIMIZE); + add_efun("hash",f_hash,"function(string,int|void:int)",OPT_TRY_OPTIMIZE); + add_efun("indices",f_indices,"function(string|array:int*)|function(mapping|multiset:mixed*)|function(object:string*)",0); + add_efun("intp", f_intp, "function(mixed:int)",OPT_TRY_OPTIMIZE); + add_efun("multisetp", f_multisetp, "function(mixed:int)",OPT_TRY_OPTIMIZE); + add_efun("lower_case",f_lower_case,"function(string:string)",OPT_TRY_OPTIMIZE); + add_efun("m_delete",f_m_delete,"function(mapping,mixed:mapping)",0); + add_efun("mappingp",f_mappingp,"function(mixed:int)",OPT_TRY_OPTIMIZE); + add_efun("mkmapping",f_mkmapping,"function(mixed *,mixed *:mapping)",OPT_TRY_OPTIMIZE); + add_efun("next_object",f_next_object,"function(void|object:object)",OPT_EXTERNAL_DEPEND); + add_efun("object_program",f_object_program,"function(object:program)",0); + add_efun("objectp", f_objectp, "function(mixed:int)",0); + add_efun("programp",f_programp,"function(mixed:int)",0); + add_efun("query_host_name",f_query_host_name,"function(:string)",0); + add_efun("query_num_arg",f_query_num_arg,"function(:int)",OPT_EXTERNAL_DEPEND); + add_efun("random",f_random,"function(int:int)",OPT_EXTERNAL_DEPEND); + add_efun("random_seed",f_random_seed,"function(int:void)",OPT_SIDE_EFFECT); + add_efun("replace",f_replace,"function(string,string,string:string)|function(string,string*,string*:string)|function(array,mixed,mixed:array)|function(mapping,mixed,mixed:array)",0); + add_efun("reverse",f_reverse,"function(int:int)|function(string:string)|function(array:array)",0); + add_efun("rows",f_rows,"function(mixed,array:array)",0); + add_efun("rusage", f_rusage, "function(:int *)",OPT_EXTERNAL_DEPEND); + add_efun("search",f_search,"function(string,string,void|int:int)|function(array,mixed,void|int:int)|function(mapping,mixed:mixed)",0); + add_efun("sleep", f_sleep, "function(float|int:void)",OPT_SIDE_EFFECT); + add_efun("sort",f_sort,"function(array(mixed),array(mixed)...:array(mixed))",OPT_SIDE_EFFECT); + add_efun("stringp", f_stringp, "function(mixed:int)",0); + add_efun("this_object", f_this_object, "function(:object)",OPT_EXTERNAL_DEPEND); + add_efun("throw",f_throw,"function(mixed:void)",0); + add_efun("time",f_time,"function(void|int:int)",OPT_EXTERNAL_DEPEND); + add_efun("trace",f_trace,"function(int:int)",OPT_SIDE_EFFECT); + add_efun("upper_case",f_upper_case,"function(string:string)",0); + add_efun("values",f_values,"function(string|multiset:int*)|function(array|mapping|object:mixed*)",0); + add_efun("zero_type",f_zero_type,"function(int:int)",0); + + #ifdef HAVE_LOCALTIME + add_efun("localtime",f_localtime,"function(int:mapping(string:int))",OPT_EXTERNAL_DEPEND); + #endif + + #ifdef DEBUG + add_efun("_verify_internals",f__verify_internals,"function(:void)",OPT_SIDE_EFFECT|OPT_EXTERNAL_DEPEND); + #endif + + #ifdef GC2 + add_efun("gc",f_gc,"function(:int)",OPT_SIDE_EFFECT); + #endif + } + Newline at end of file added.

pike.git/ src/ builtin_functions.c

1996-09-22

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