#!/usr/bin/perl -w # # Regenerate (overwriting only if changed): # # opcode.h # opnames.h # pp.sym # # from information stored in the DATA section of this file, plus the # values hardcoded into this script in @raw_alias. # # Accepts the standard regen_lib -q and -v args. # # This script is normally invoked from regen.pl. use strict; BEGIN { # Get function prototypes require 'regen/regen_lib.pl'; } my $opcode_new = 'opcode.h-new'; my $opname_new = 'opnames.h-new'; my $oc = safer_open($opcode_new); my $on = safer_open($opname_new); select $oc; # Read data. my %seen; my (@ops, %desc, %check, %ckname, %flags, %args, %opnum); while () { chop; next unless $_; next if /^#/; my ($key, $desc, $check, $flags, $args) = split(/\t+/, $_, 5); $args = '' unless defined $args; warn qq[Description "$desc" duplicates $seen{$desc}\n] if $seen{$desc} and $key ne "transr"; die qq[Opcode "$key" duplicates $seen{$key}\n] if $seen{$key}; $seen{$desc} = qq[description of opcode "$key"]; $seen{$key} = qq[opcode "$key"]; push(@ops, $key); $opnum{$key} = $#ops; $desc{$key} = $desc; $check{$key} = $check; $ckname{$check}++; $flags{$key} = $flags; $args{$key} = $args; } # Set up aliases my %alias; # Format is "this function" => "does these op names" my @raw_alias = ( Perl_do_kv => [qw( keys values )], Perl_unimplemented_op => [qw(padany mapstart custom)], # All the ops with a body of { return NORMAL; } Perl_pp_null => [qw(scalar regcmaybe lineseq scope)], Perl_pp_goto => ['dump'], Perl_pp_require => ['dofile'], Perl_pp_untie => ['dbmclose'], Perl_pp_sysread => [qw(read recv)], Perl_pp_sysseek => ['seek'], Perl_pp_ioctl => ['fcntl'], Perl_pp_ssockopt => ['gsockopt'], Perl_pp_getpeername => ['getsockname'], Perl_pp_stat => ['lstat'], Perl_pp_ftrowned => [qw(fteowned ftzero ftsock ftchr ftblk ftfile ftdir ftpipe ftsuid ftsgid ftsvtx)], Perl_pp_fttext => ['ftbinary'], Perl_pp_gmtime => ['localtime'], Perl_pp_semget => [qw(shmget msgget)], Perl_pp_semctl => [qw(shmctl msgctl)], Perl_pp_ghostent => [qw(ghbyname ghbyaddr)], Perl_pp_gnetent => [qw(gnbyname gnbyaddr)], Perl_pp_gprotoent => [qw(gpbyname gpbynumber)], Perl_pp_gservent => [qw(gsbyname gsbyport)], Perl_pp_gpwent => [qw(gpwnam gpwuid)], Perl_pp_ggrent => [qw(ggrnam ggrgid)], Perl_pp_ftis => [qw(ftsize ftmtime ftatime ftctime)], Perl_pp_chown => [qw(unlink chmod utime kill)], Perl_pp_link => ['symlink'], Perl_pp_ftrread => [qw(ftrwrite ftrexec fteread ftewrite fteexec)], Perl_pp_shmwrite => [qw(shmread msgsnd msgrcv semop)], Perl_pp_send => ['syswrite'], Perl_pp_defined => [qw(dor dorassign)], Perl_pp_and => ['andassign'], Perl_pp_or => ['orassign'], Perl_pp_ucfirst => ['lcfirst'], Perl_pp_sle => [qw(slt sgt sge)], Perl_pp_print => ['say'], Perl_pp_index => ['rindex'], Perl_pp_oct => ['hex'], Perl_pp_shift => ['pop'], Perl_pp_sin => [qw(cos exp log sqrt)], Perl_pp_bit_or => ['bit_xor'], Perl_pp_rv2av => ['rv2hv'], Perl_pp_akeys => ['avalues'], Perl_pp_rkeys => [qw(rvalues reach)], Perl_pp_trans => [qw(trans transr)], ); while (my ($func, $names) = splice @raw_alias, 0, 2) { foreach (@$names) { $alias{$_} = $func; } } # Emit defines. print <<"END"; /* -*- buffer-read-only: t -*- * * opcode.h * * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, * 2001, 2002, 2003, 2004, 2005, 2006, 2007 by Larry Wall and others * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the README file. * * !!!!!!! DO NOT EDIT THIS FILE !!!!!!! * This file is built by regen/opcode.pl from its data. Any changes made * here will be lost! */ #ifndef PERL_GLOBAL_STRUCT_INIT #define Perl_pp_i_preinc Perl_pp_preinc #define Perl_pp_i_predec Perl_pp_predec #define Perl_pp_i_postinc Perl_pp_postinc #define Perl_pp_i_postdec Perl_pp_postdec PERL_PPDEF(Perl_unimplemented_op) END print $on <<"END"; /* -*- buffer-read-only: t -*- * * opnames.h * * Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, * 2007, 2008 by Larry Wall and others * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the README file. * * * !!!!!!! DO NOT EDIT THIS FILE !!!!!!! * This file is built by regen/opcode.pl from its data. Any changes made * here will be lost! */ typedef enum opcode { END my $i = 0; for (@ops) { # print $on "\t", &tab(3,"OP_\U$_,"), "/* ", $i++, " */\n"; print $on "\t", &tab(3,"OP_\U$_"), " = ", $i++, ",\n"; } print $on "\t", &tab(3,"OP_max"), "\n"; print $on "} opcode;\n"; print $on "\n#define MAXO ", scalar @ops, "\n"; print $on "#define OP_phoney_INPUT_ONLY -1\n"; print $on "#define OP_phoney_OUTPUT_ONLY -2\n\n"; # Emit op names and descriptions. print < 1, # needs stack mark 'f' => 2, # fold constants 's' => 4, # always produces scalar 't' => 8, # needs target scalar 'T' => 8 | 16, # ... which may be lexical 'i' => 0, # always produces integer (unused since e7311069) 'I' => 32, # has corresponding int op 'd' => 64, # danger, unknown side effects 'u' => 128, # defaults to $_ ); my %OP_IS_SOCKET; my %OP_IS_FILETEST; my %OP_IS_FT_ACCESS; my $OCSHIFT = 8; my $OASHIFT = 12; for my $op (@ops) { my $argsum = 0; my $flags = $flags{$op}; for my $flag (keys %opflags) { if ($flags =~ s/$flag//) { die "Flag collision for '$op' ($flags{$op}, $flag)\n" if $argsum & $opflags{$flag}; $argsum |= $opflags{$flag}; } } die qq[Opcode '$op' has no class indicator ($flags{$op} => $flags)\n] unless exists $opclass{$flags}; $argsum |= $opclass{$flags} << $OCSHIFT; my $argshift = $OASHIFT; for my $arg (split(' ',$args{$op})) { if ($arg =~ /^F/) { # record opnums of these opnames $OP_IS_SOCKET{$op} = $opnum{$op} if $arg =~ s/s//; $OP_IS_FILETEST{$op} = $opnum{$op} if $arg =~ s/-//; $OP_IS_FT_ACCESS{$op} = $opnum{$op} if $arg =~ s/\+//; } my $argnum = ($arg =~ s/\?//) ? 8 : 0; die "op = $op, arg = $arg\n" unless exists $argnum{$arg}; $argnum += $argnum{$arg}; die "Argument overflow for '$op'\n" if $argshift >= $ARGBITS || $argnum > ((1 << ($ARGBITS - $argshift)) - 1); $argsum += $argnum << $argshift; $argshift += 4; } $argsum = sprintf("0x%08x", $argsum); print "\t", &tab(3, "$argsum,"), "/* $op */\n"; } print < table. opcode.pl verifies the range contiguity. */ EO_OP_IS_COMMENT gen_op_is_macro( \%OP_IS_SOCKET, 'OP_IS_SOCKET'); gen_op_is_macro( \%OP_IS_FILETEST, 'OP_IS_FILETEST'); gen_op_is_macro( \%OP_IS_FT_ACCESS, 'OP_IS_FILETEST_ACCESS'); sub gen_op_is_macro { my ($op_is, $macname) = @_; if (keys %$op_is) { # get opnames whose numbers are lowest and highest my ($first, @rest) = sort { $op_is->{$a} <=> $op_is->{$b} } keys %$op_is; my $last = pop @rest; # @rest slurped, get its last die "Invalid range of ops: $first .. $last\n" unless $last; print $on "#define $macname(op) \\\n\t("; # verify that op-ct matches 1st..last range (and fencepost) # (we know there are no dups) if ( $op_is->{$last} - $op_is->{$first} == scalar @rest + 1) { # contiguous ops -> optimized version print $on "(op) >= OP_" . uc($first) . " && (op) <= OP_" . uc($last); print $on ")\n\n"; } else { print $on join(" || \\\n\t ", map { "(op) == OP_" . uc() } sort keys %$op_is); print $on ")\n\n"; } } } print $oc "/* ex: set ro: */\n"; print $on "/* ex: set ro: */\n"; safer_close($oc); safer_close($on); rename_if_different $opcode_new, 'opcode.h'; rename_if_different $opname_new, 'opnames.h'; my $pp_sym_new = 'pp.sym-new'; my $ppsym = safer_open($pp_sym_new); print $ppsym <<"END"; # -*- buffer-read-only: t -*- # # !!!!!!! DO NOT EDIT THIS FILE !!!!!!! # This file is built by regen/opcode.pl from its data. Any changes made # here will be lost! # END for (sort keys %ckname) { print $ppsym "Perl_$_\n"; #OP *\t", &tab(3,$_),"(OP* o);\n"; } for (@ops) { next if /^i_(pre|post)(inc|dec)$/; next if /^custom$/; print $ppsym "Perl_pp_$_\n"; } print $ppsym "\n# ex: set ro:\n"; safer_close($ppsym); rename_if_different $pp_sym_new, 'pp.sym'; END { foreach ('opcode.h', 'opnames.h', 'pp.sym') { 1 while unlink "$_-old"; } } ########################################################################### sub tab { my ($l, $t) = @_; $t .= "\t" x ($l - (length($t) + 1) / 8); $t; } ########################################################################### # Some comments about 'T' opcode classifier: # Safe to set if the ppcode uses: # tryAMAGICbin, tryAMAGICun, SETn, SETi, SETu, PUSHn, PUSHTARG, SETTARG, # SETs(TARG), XPUSHn, XPUSHu, # Unsafe to set if the ppcode uses dTARG or [X]RETPUSH[YES|NO|UNDEF] # lt and friends do SETs (including ncmp, but not scmp) # Additional mode of failure: the opcode can modify TARG before it "used" # all the arguments (or may call an external function which does the same). # If the target coincides with one of the arguments ==> kaboom. # pp.c pos substr each not OK (RETPUSHUNDEF) # substr vec also not OK due to LV to target (are they???) # ref not OK (RETPUSHNO) # trans not OK (dTARG; TARG = sv_newmortal();) # ucfirst etc not OK: TMP arg processed inplace # quotemeta not OK (unsafe when TARG == arg) # each repeat not OK too due to list context # pack split - unknown whether they are safe # sprintf: is calling do_sprintf(TARG,...) which can act on TARG # before other args are processed. # Suspicious wrt "additional mode of failure" (and only it): # schop, chop, postinc/dec, bit_and etc, negate, complement. # Also suspicious: 4-arg substr, sprintf, uc/lc (POK_only), reverse, pack. # substr/vec: doing TAINT_off()??? # pp_hot.c # readline - unknown whether it is safe # match subst not OK (dTARG) # grepwhile not OK (not always setting) # join not OK (unsafe when TARG == arg) # Suspicious wrt "additional mode of failure": concat (dealt with # in ck_sassign()), join (same). # pp_ctl.c # mapwhile flip caller not OK (not always setting) # pp_sys.c # backtick glob warn die not OK (not always setting) # warn not OK (RETPUSHYES) # open fileno getc sysread syswrite ioctl accept shutdown # ftsize(etc) readlink telldir fork alarm getlogin not OK (RETPUSHUNDEF) # umask select not OK (XPUSHs(&PL_sv_undef);) # fileno getc sysread syswrite tell not OK (meth("FILENO" "GETC")) # sselect shm* sem* msg* syscall - unknown whether they are safe # gmtime not OK (list context) # Suspicious wrt "additional mode of failure": warn, die, select. __END__ # New ops always go at the end # The restriction on having custom as the last op has been removed # A recapitulation of the format of this file: # The file consists of five columns: the name of the op, an English # description, the name of the "check" routine used to optimize this # operation, some flags, and a description of the operands. # The flags consist of options followed by a mandatory op class signifier # The classes are: # baseop - 0 unop - 1 binop - 2 # logop - | listop - @ pmop - / # padop/svop - $ padop - # (unused) loop - { # baseop/unop - % loopexop - } filestatop - - # pvop/svop - " cop - ; # Other options are: # needs stack mark - m # needs constant folding - f # produces a scalar - s # produces an integer - i # needs a target - t # target can be in a pad - T # has a corresponding integer version - I # has side effects - d # uses $_ if no argument given - u # Values for the operands are: # scalar - S list - L array - A # hash - H sub (CV) - C file - F # socket - Fs filetest - F- filetest_access - F-+ # reference - R # "?" denotes an optional operand. # Nothing. null null operation ck_null 0 stub stub ck_null 0 scalar scalar ck_fun s% S # Pushy stuff. pushmark pushmark ck_null s0 wantarray wantarray ck_null is0 const constant item ck_svconst s$ gvsv scalar variable ck_null ds$ gv glob value ck_null ds$ gelem glob elem ck_null d2 S S padsv private variable ck_null ds0 padav private array ck_null d0 padhv private hash ck_null d0 padany private value ck_null d0 pushre push regexp ck_null d/ # References and stuff. rv2gv ref-to-glob cast ck_rvconst ds1 rv2sv scalar dereference ck_rvconst ds1 av2arylen array length ck_null is1 rv2cv subroutine dereference ck_rvconst d1 anoncode anonymous subroutine ck_anoncode $ prototype subroutine prototype ck_null s% S refgen reference constructor ck_spair m1 L srefgen single ref constructor ck_null fs1 S ref reference-type operator ck_fun stu% S? bless bless ck_fun s@ S S? # Pushy I/O. backtick quoted execution (``, qx) ck_open tu% S? # glob defaults its first arg to $_ glob glob ck_glob t@ S? readline ck_readline t% F? rcatline append I/O operator ck_null t$ # Bindable operators. regcmaybe regexp internal guard ck_fun s1 S regcreset regexp internal reset ck_fun s1 S regcomp regexp compilation ck_null s| S match pattern match (m//) ck_match d/ qr pattern quote (qr//) ck_match s/ subst substitution (s///) ck_match dis/ S substcont substitution iterator ck_null dis| trans transliteration (tr///) ck_match is" S # transr (the /r version) is further down. # Lvalue operators. # sassign is special-cased for op class sassign scalar assignment ck_sassign s0 aassign list assignment ck_null t2 L L chop chop ck_spair mts% L schop scalar chop ck_null stu% S? chomp chomp ck_spair mTs% L schomp scalar chomp ck_null sTu% S? defined defined operator ck_defined isu% S? undef undef operator ck_lfun s% S? study study ck_fun su% S? pos match position ck_lfun stu% S? preinc preincrement (++) ck_lfun dIs1 S i_preinc integer preincrement (++) ck_lfun dis1 S predec predecrement (--) ck_lfun dIs1 S i_predec integer predecrement (--) ck_lfun dis1 S postinc postincrement (++) ck_lfun dIst1 S i_postinc integer postincrement (++) ck_lfun disT1 S postdec postdecrement (--) ck_lfun dIst1 S i_postdec integer postdecrement (--) ck_lfun disT1 S # Ordinary operators. pow exponentiation (**) ck_null fsT2 S S multiply multiplication (*) ck_null IfsT2 S S i_multiply integer multiplication (*) ck_null ifsT2 S S divide division (/) ck_null IfsT2 S S i_divide integer division (/) ck_null ifsT2 S S modulo modulus (%) ck_null IifsT2 S S i_modulo integer modulus (%) ck_null ifsT2 S S repeat repeat (x) ck_repeat mt2 L S add addition (+) ck_null IfsT2 S S i_add integer addition (+) ck_null ifsT2 S S subtract subtraction (-) ck_null IfsT2 S S i_subtract integer subtraction (-) ck_null ifsT2 S S concat concatenation (.) or string ck_concat fsT2 S S stringify string ck_fun fsT@ S left_shift left bitshift (<<) ck_bitop fsT2 S S right_shift right bitshift (>>) ck_bitop fsT2 S S lt numeric lt (<) ck_null Iifs2 S S i_lt integer lt (<) ck_null ifs2 S S gt numeric gt (>) ck_null Iifs2 S S i_gt integer gt (>) ck_null ifs2 S S le numeric le (<=) ck_null Iifs2 S S i_le integer le (<=) ck_null ifs2 S S ge numeric ge (>=) ck_null Iifs2 S S i_ge integer ge (>=) ck_null ifs2 S S eq numeric eq (==) ck_null Iifs2 S S i_eq integer eq (==) ck_null ifs2 S S ne numeric ne (!=) ck_null Iifs2 S S i_ne integer ne (!=) ck_null ifs2 S S ncmp numeric comparison (<=>) ck_null Iifst2 S S i_ncmp integer comparison (<=>) ck_null ifst2 S S slt string lt ck_null ifs2 S S sgt string gt ck_null ifs2 S S sle string le ck_null ifs2 S S sge string ge ck_null ifs2 S S seq string eq ck_null ifs2 S S sne string ne ck_null ifs2 S S scmp string comparison (cmp) ck_null ifst2 S S bit_and bitwise and (&) ck_bitop fst2 S S bit_xor bitwise xor (^) ck_bitop fst2 S S bit_or bitwise or (|) ck_bitop fst2 S S negate negation (-) ck_null Ifst1 S i_negate integer negation (-) ck_null ifsT1 S not not ck_null ifs1 S complement 1's complement (~) ck_bitop fst1 S smartmatch smart match ck_smartmatch s2 # High falutin' math. atan2 atan2 ck_fun fsT@ S S sin sin ck_fun fsTu% S? cos cos ck_fun fsTu% S? rand rand ck_fun sT% S? srand srand ck_fun sT% S? exp exp ck_fun fsTu% S? log log ck_fun fsTu% S? sqrt sqrt ck_fun fsTu% S? # Lowbrow math. int int ck_fun fsTu% S? hex hex ck_fun fsTu% S? oct oct ck_fun fsTu% S? abs abs ck_fun fsTu% S? # String stuff. length length ck_fun ifsTu% S? substr substr ck_substr st@ S S S? S? vec vec ck_fun ist@ S S S index index ck_index isT@ S S S? rindex rindex ck_index isT@ S S S? sprintf sprintf ck_fun fmst@ S L formline formline ck_fun ms@ S L ord ord ck_fun ifsTu% S? chr chr ck_fun fsTu% S? crypt crypt ck_fun fsT@ S S ucfirst ucfirst ck_fun fstu% S? lcfirst lcfirst ck_fun fstu% S? uc uc ck_fun fstu% S? lc lc ck_fun fstu% S? quotemeta quotemeta ck_fun fstu% S? # Arrays. rv2av array dereference ck_rvconst dt1 aelemfast constant array element ck_null s$ A S aelem array element ck_null s2 A S aslice array slice ck_null m@ A L aeach each on array ck_each % A akeys keys on array ck_each t% A avalues values on array ck_each t% A # Hashes. each each ck_each % H values values ck_each t% H keys keys ck_each t% H delete delete ck_delete % S exists exists ck_exists is% S rv2hv hash dereference ck_rvconst dt1 helem hash element ck_null s2 H S hslice hash slice ck_null m@ H L boolkeys boolkeys ck_fun % H # Explosives and implosives. unpack unpack ck_unpack @ S S? pack pack ck_fun mst@ S L split split ck_split t@ S S S join join or string ck_join mst@ S L # List operators. list list ck_null m@ L lslice list slice ck_null 2 H L L anonlist anonymous list ([]) ck_fun ms@ L anonhash anonymous hash ({}) ck_fun ms@ L splice splice ck_push m@ A S? S? L push push ck_push imsT@ A L pop pop ck_shift s% A? shift shift ck_shift s% A? unshift unshift ck_push imsT@ A L sort sort ck_sort dm@ C? L reverse reverse ck_fun mt@ L grepstart grep ck_grep dm@ C L grepwhile grep iterator ck_null dt| mapstart map ck_grep dm@ C L mapwhile map iterator ck_null dt| # Range stuff. range flipflop ck_null | S S flip range (or flip) ck_null 1 S S flop range (or flop) ck_null 1 # Control. and logical and (&&) ck_null | or logical or (||) ck_null | xor logical xor ck_null fs2 S S dor defined or (//) ck_null | cond_expr conditional expression ck_null d| andassign logical and assignment (&&=) ck_null s| orassign logical or assignment (||=) ck_null s| dorassign defined or assignment (//=) ck_null s| method method lookup ck_method d1 entersub subroutine entry ck_subr dmt1 L leavesub subroutine exit ck_null 1 leavesublv lvalue subroutine return ck_null 1 caller caller ck_fun t% S? warn warn ck_fun imst@ L die die ck_die dimst@ L reset symbol reset ck_fun is% S? lineseq line sequence ck_null @ nextstate next statement ck_null s; dbstate debug next statement ck_null s; unstack iteration finalizer ck_null s0 enter block entry ck_null 0 leave block exit ck_null @ scope block ck_null @ enteriter foreach loop entry ck_null d{ iter foreach loop iterator ck_null 0 enterloop loop entry ck_null d{ leaveloop loop exit ck_null 2 return return ck_return dm@ L last last ck_null ds} next next ck_null ds} redo redo ck_null ds} dump dump ck_null ds} goto goto ck_null ds} exit exit ck_exit ds% S? method_named method with known name ck_null d$ entergiven given() ck_null d| leavegiven leave given block ck_null 1 enterwhen when() ck_null d| leavewhen leave when block ck_null 1 break break ck_null 0 continue continue ck_null 0 # I/O. open open ck_open ismt@ F S? L close close ck_fun is% F? pipe_op pipe ck_fun is@ F F fileno fileno ck_fun ist% F umask umask ck_fun ist% S? binmode binmode ck_fun s@ F S? tie tie ck_fun idms@ R S L untie untie ck_fun is% R tied tied ck_fun s% R dbmopen dbmopen ck_fun is@ H S S dbmclose dbmclose ck_fun is% H sselect select system call ck_select t@ S S S S select select ck_select st@ F? getc getc ck_eof st% F? read read ck_fun imst@ F R S S? enterwrite write ck_fun dis% F? leavewrite write exit ck_null 1 prtf printf ck_listiob ims@ F? L print print ck_listiob ims@ F? L say say ck_listiob ims@ F? L sysopen sysopen ck_fun s@ F S S S? sysseek sysseek ck_fun s@ F S S sysread sysread ck_fun imst@ F R S S? syswrite syswrite ck_fun imst@ F S S? S? eof eof ck_eof is% F? tell tell ck_fun st% F? seek seek ck_fun s@ F S S # truncate really behaves as if it had both "S S" and "F S" truncate truncate ck_trunc is@ S S fcntl fcntl ck_fun st@ F S S ioctl ioctl ck_fun st@ F S S flock flock ck_fun isT@ F S # Sockets. OP_IS_SOCKET wants them consecutive (so moved 1st 2) send send ck_fun imst@ Fs S S S? recv recv ck_fun imst@ Fs R S S socket socket ck_fun is@ Fs S S S sockpair socketpair ck_fun is@ Fs Fs S S S bind bind ck_fun is@ Fs S connect connect ck_fun is@ Fs S listen listen ck_fun is@ Fs S accept accept ck_fun ist@ Fs Fs shutdown shutdown ck_fun ist@ Fs S gsockopt getsockopt ck_fun is@ Fs S S ssockopt setsockopt ck_fun is@ Fs S S S getsockname getsockname ck_fun is% Fs getpeername getpeername ck_fun is% Fs # Stat calls. OP_IS_FILETEST wants them consecutive. lstat lstat ck_ftst u- F stat stat ck_ftst u- F ftrread -R ck_ftst isu- F-+ ftrwrite -W ck_ftst isu- F-+ ftrexec -X ck_ftst isu- F-+ fteread -r ck_ftst isu- F-+ ftewrite -w ck_ftst isu- F-+ fteexec -x ck_ftst isu- F-+ ftis -e ck_ftst isu- F- ftsize -s ck_ftst istu- F- ftmtime -M ck_ftst stu- F- ftatime -A ck_ftst stu- F- ftctime -C ck_ftst stu- F- ftrowned -O ck_ftst isu- F- fteowned -o ck_ftst isu- F- ftzero -z ck_ftst isu- F- ftsock -S ck_ftst isu- F- ftchr -c ck_ftst isu- F- ftblk -b ck_ftst isu- F- ftfile -f ck_ftst isu- F- ftdir -d ck_ftst isu- F- ftpipe -p ck_ftst isu- F- ftsuid -u ck_ftst isu- F- ftsgid -g ck_ftst isu- F- ftsvtx -k ck_ftst isu- F- ftlink -l ck_ftst isu- F- fttty -t ck_ftst is- F- fttext -T ck_ftst isu- F- ftbinary -B ck_ftst isu- F- # File calls. # chdir really behaves as if it had both "S?" and "F?" chdir chdir ck_chdir isT% S? chown chown ck_fun imsT@ L chroot chroot ck_fun isTu% S? unlink unlink ck_fun imsTu@ L chmod chmod ck_fun imsT@ L utime utime ck_fun imsT@ L rename rename ck_fun isT@ S S link link ck_fun isT@ S S symlink symlink ck_fun isT@ S S readlink readlink ck_fun stu% S? mkdir mkdir ck_fun isTu@ S? S? rmdir rmdir ck_fun isTu% S? # Directory calls. open_dir opendir ck_fun is@ F S readdir readdir ck_fun % F telldir telldir ck_fun st% F seekdir seekdir ck_fun s@ F S rewinddir rewinddir ck_fun s% F closedir closedir ck_fun is% F # Process control. fork fork ck_null ist0 wait wait ck_null isT0 waitpid waitpid ck_fun isT@ S S system system ck_exec imsT@ S? L exec exec ck_exec dimsT@ S? L kill kill ck_fun dimsT@ L getppid getppid ck_null isT0 getpgrp getpgrp ck_fun isT% S? setpgrp setpgrp ck_fun isT@ S? S? getpriority getpriority ck_fun isT@ S S setpriority setpriority ck_fun isT@ S S S # Time calls. # NOTE: MacOS patches the 'i' of time() away later when the interpreter # is created because in MacOS time() is already returning times > 2**31-1, # that is, non-integers. time time ck_null isT0 tms times ck_null 0 localtime localtime ck_fun t% S? gmtime gmtime ck_fun t% S? alarm alarm ck_fun istu% S? sleep sleep ck_fun isT% S? # Shared memory. shmget shmget ck_fun imst@ S S S shmctl shmctl ck_fun imst@ S S S shmread shmread ck_fun imst@ S S S S shmwrite shmwrite ck_fun imst@ S S S S # Message passing. msgget msgget ck_fun imst@ S S msgctl msgctl ck_fun imst@ S S S msgsnd msgsnd ck_fun imst@ S S S msgrcv msgrcv ck_fun imst@ S S S S S # Semaphores. semop semop ck_fun imst@ S S semget semget ck_fun imst@ S S S semctl semctl ck_fun imst@ S S S S # Eval. require require ck_require du% S? dofile do "file" ck_fun d1 S hintseval eval hints ck_svconst s$ entereval eval "string" ck_eval d% S leaveeval eval "string" exit ck_null 1 S #evalonce eval constant string ck_null d1 S entertry eval {block} ck_eval d% leavetry eval {block} exit ck_null @ # Get system info. ghbyname gethostbyname ck_fun % S ghbyaddr gethostbyaddr ck_fun @ S S ghostent gethostent ck_null 0 gnbyname getnetbyname ck_fun % S gnbyaddr getnetbyaddr ck_fun @ S S gnetent getnetent ck_null 0 gpbyname getprotobyname ck_fun % S gpbynumber getprotobynumber ck_fun @ S gprotoent getprotoent ck_null 0 gsbyname getservbyname ck_fun @ S S gsbyport getservbyport ck_fun @ S S gservent getservent ck_null 0 shostent sethostent ck_fun is% S snetent setnetent ck_fun is% S sprotoent setprotoent ck_fun is% S sservent setservent ck_fun is% S ehostent endhostent ck_null is0 enetent endnetent ck_null is0 eprotoent endprotoent ck_null is0 eservent endservent ck_null is0 gpwnam getpwnam ck_fun % S gpwuid getpwuid ck_fun % S gpwent getpwent ck_null 0 spwent setpwent ck_null is0 epwent endpwent ck_null is0 ggrnam getgrnam ck_fun % S ggrgid getgrgid ck_fun % S ggrent getgrent ck_null 0 sgrent setgrent ck_null is0 egrent endgrent ck_null is0 getlogin getlogin ck_null st0 # Miscellaneous. syscall syscall ck_fun imst@ S L # For multi-threading lock lock ck_rfun s% R # For state support once once ck_null | custom unknown custom operator ck_null 0 # For smart dereference for each/keys/values reach each on reference ck_each % S rkeys keys on reference ck_each t% S rvalues values on reference ck_each t% S # y///r transr transliteration (tr///) ck_match is" S