./ruby-0.64/ 40755 150 1 0 5704463033 11066 5ustar matzdaemon./ruby-0.64/C-IF100644 150 1 12615 5675246572 11627 0ustar matzdaemon.\" C-IF - -*- Text -*- created at: Tue Oct 12 14:15:00 JST 1993 Ruby-C インターフェース 型 VALUE Rubyオブジェクトを表現する型. 必要に応じてキャストして用いる. 組み 込み型を表現するCの型はruby.hに記述してあるRで始まる構造体である. VALUE型をこれらにキャストするためにRで始まる構造体名を全て大文字に した名前のマクロが用意されている. 変数・定数 Qnil 定数: nilオブジェクト Qself 変数: 現在のselfオブジェクトの値. 一般にメソッドにはselfを指す引数 が与えられるので, この変数にアクセスする必要はない. この変数の値を 変更する時は以後のselfの値そのものが変わってしまうので, 特別な事情 がない限り代入してはならない. 注意: ヘッダファイル"env.h"をインクルードしていないファイルでは, Qselfは定数であり, 代入は文法エラーとなる. TRUE 定数: tオブジェクト(真のデフォルト値) FALSE 定数: nilオブジェクト クラス・モジュール定義 VALUE rb_define_class(char *name, VALUE super) superのサブクラスとして新しいRubyクラスを定義する. VALUE rb_define_module(char *name) Rubyモジュールを定義する. void rb_include_module(VALUE class, VALUE module) モジュールをインクルードする. classがすでにmoduleをインクルードして いる時には何もしない(多重インクルードの禁止). 大域変数 void rb_define_variable(char *name, VALUE *var, VALUE (*get_hook), VALUE (*set_hook)(), void *data) RubyとCとで共有するグローバル変数を定義する. get_hookがQnilでない時, 変数参照の際にget_hookにセットされた関数が呼ばれる. set_hookがQnil でない時には代入の時にset_hookが呼ばれる. hook関数には変数名を示す ID，(set hookの場合新しい値も)とともにdataで与えたデータが引数とし て渡される. 変数名が`$'で始まらない時には自動的に追加される. 変数名としてrubyの 識別子として許されない文字(例えば` ')を含む場合にはrubyプログラムか らアクセスできなくなる. void rb_global_variable(VALUE *var) GCのためRubyからはアクセスされないが, Rubyオブジェクトを含む大域変 数をマークする. void rb_read_only_hook() 読み出し専用の変数のためのset_hook関数. 値を設定しようとすると例外 を発生させる. クラス定数 void rb_define_const(VALUE class, char *name, VALUE val) クラス定数を定義する. メソッド定義 rb_define_method(VALUE class, char *name, VALUE (*func)(), int argc) メソッドを定義する. argcはselfを除く引数の数. argcが-1の時, 関数に は引数の数(selfを含まない)を第1引数, 引数の配列を第2引数とする形式 で与えられる. argcが-2の時, 引数はself, args(argsは引数を含むrubyの 配列)という形式で与えられる. rb_define_single_method(VALUE class, char *name, VALUE (*func)(), int argc) 特異メソッドを定義する. 引数はrb_define_method()と同じ. rb_scan_args(VALUE args, char *fmt, ...) args形式で与えられた引数を分解する. fmtは必須引数の数, 付加引数の数, 残りの引数があるかを指定する文字列で, "数字数字*"という形式である. 2 番目の数字と"*"はそれぞれ省略可能である. 第3引数以降は変数へのポ インタで, 該当する要素がその変数に格納される. 付加引数に対応する引 数が与えられていない場合は変数にQnilが代入される. Rubyメソッド呼び出し VALUE rb_funcall(VALUE recv, ID mid, int narg, ...) メソッド呼び出し. 文字列からmidを得るためにはrb_intern()を使う. rb_call_super(VALUE args) スーパークラスのメソッドを呼び出す. argsは引数リストとなる配列. args がQnilの時は現在のメソッドの引数をそのまま引き継ぐ. 文字列 <-> ID変換 ID rb_intern(char *name) 文字列に対応するIDを返す. char *rb_id2name(ID id) IDに対応する文字列を返す(デバッグ用). char *rb_class2name(VALUE class) classの名前を返す(デバッグ用). classが名前を持たない時には, 一番近 い名前を持つクラスの名前を返す. インスタンス変数 VALUE rb_iv_get(VALUE obj, char *name) objのインスタンス変数の値を得る. `@'で始まらないインスタンス変数は Rubyプログラムからアクセスできない. VALUE rb_iv_set(VALUE obj, char *name, VALUE val) objのインスタンス変数をvalにセットする. 制御構造 VALUE rb_iterate(VALUE (*func1)(), char *arg1, VALUE (*func2)(), char *arg2) func2をブロックとして設定し, func1をイテレータとして呼ぶ. func1に は arg1が引数として渡され, func2には第1引数にイテレータから与えられ た値, 第2引数にarg2が渡される. VALUE rb_yield(VALUE val) valを値としてイテレータブロックを呼び出す. VALUE rb_resque(VALUE (*func1)(), char *arg1, VALUE (*func2)(), char *arg2) 関数func1をarg1を引数に呼び出す. func1の実行中に例外が発生した時に は func2をarg2を引数として呼ぶ. 戻り値は例外が発生しなかった時は func1の戻り値, 例外が発生した時にはfunc2の戻り値である. VALUE rb_ensure(VALUE (*func1)(), char *arg1, VALUE (*func2)(), char *arg2) 関数func1をarg1を引数として実行し, 実行終了後(たとえ例外が発生して も) func2をarg2を引数として実行する. 戻り値はfunc1の戻り値である(例 外が発生した時は戻らない). 例外・エラー void Warning(char *fmt, ...) 標準エラー出力に警告情報を表示する. 引数はprintf()と同じ. void Fail(char *fmt, ...) 例外を発生させる. 引数はprintf()と同じ. void Fatal(char *fmt, ...) 致命的例外を発生させる. 通常の例外処理は行なわれず, インタープリタ が終了する(ただしensureで指定されたコードは終了前に実行される). void Bug(char *fmt, ...) インタープリタなどプログラムのバグでしか発生するはずのない状況の時 呼ぶ. インタープリタはコアダンプし直ちに終了する. 例外処理は一切行 なわれない. rubyの初期化・実行 void ruby_init(int argc, char **argv, char **envp) rubyインタプリタの初期化を行なう. void ruby_run() rubyインタプリタを実行する. void ruby_script(char *name) rubyのスクリプト名($0)を設定する. /* * Local variables: * fill-column: 70 * end: */ ./ruby-0.64/ChangeLog100644 150 1 7577 5704462325 12760 0ustar matzdaemonTue Jan 10 00:58:20 1995 Yukihiro Matsumoto (matz@dyna) * eval.c: レシーバと引数は常にiterではない． * cons.c(aref,aset): negative offset対応． Mon Jan 9 14:40:39 1995 Yukihiro Matsumoto (matz@ix-02) * parse.y: foo{..}の形式において，fooをローカル変数やクラス名では なく，引数なしの関数型メソッド呼び出しとみなすようにした． * list.c -> cons.c: 名称変更(クラス名も)． * list.c: a::b::c::nilをリスト(a b c)とみなすlisp形式から，a::b::c をリスト(a b c)とみなすruby形式に変更．[], []=, eachもそれに会わ せた仕様とする． * list.c: consペアとしての機能を強調．仕様変更． Sat Jan 7 01:26:26 1995 Yukihiro Matsumoto (matz@dyna) * eval.c: 自己代入の不具合修正． * eval.c(masign): 多重代入が配列もリストもとれるようにした． * list.c: assocを2要素の配列からList(CONSペア)に変更した． Fri Jan 6 13:42:12 1995 Yukihiro Matsumoto (matz@ix-02) * parse.y: a[b]+=cやa.b+=cなどの自己代入形式で，aやbを2度評価しな くなった． * eval.c: iterator設定のバグフィックス． * list.c: Listクラスを新設． Thu Jan 5 13:55:00 1995 Yukihiro Matsumoto (matz@ix-02) * parse.y: SCOPEのメモリリークをなくした． * eval.c: built-inメソッドへの引数の引き渡し方を変更して，配列の生 成数を減らした． * re.c: match-dataを毎回生成することをやめた．`$~'をアクセスした時 にon-demandで生成する． * string.c etc: 不必要なmemmoveをmemcpyに置換． * parse.y: =~, !~は副作用があるのでコンパイル時に展開できない． Tue Jan 3 02:04:36 1995 Yukihiro Matsumoto (matz@dyna) * eval.c: rest引数のbug fix. * eval.c,gc.c: scopeをオブジェクトにした． * eval.c: envとscopeの扱いを変更した． Wed Dec 28 09:46:57 1994 Yukihiro Matsumoto (matz@ix-02) * parse.y: evalでローカル変数が追加された場合に対応した． * parse.y: 演算子を含むaliasのbug fix. Tue Dec 27 16:45:20 1994 Yukihiro Matsumoto (matz@ix-02) * parse.y: def A Bをalias A Bに変更． * eval.c: alias関係のbug修正．nodeをオブジェクト化した時にenbugし たようだ． * signal.c: システムコールの再定義を止めた． * io.c(select): write/exceptのフラグ設定にバグ． * Makefile.in: static link用オプションをMake変数として独立させた． Tue Dec 20 00:46:19 1994 Yukihiro Matsumoto (matz@dyna) * 0.63 released * eval.c(rb_call): superの呼び出しで落ちる．argc, argvの設定を忘れ ていた． * parse.y(read_escape): 展開エラー． * variable.c: 定義済みの変数のhookを変更しないように． Mon Dec 19 12:01:10 1994 Yukihiro Matsumoto (matz@ix-02) * parse.y(cond): 条件式に代入式が置かれた場合，`-v'オプションで警 告が出るように． * parse.y(**): 冪乗演算子`**'の優先順位を単項演算子より高くした． * parse.y(and,or): 優先順位の低い演算子`and', `or'. * 0.62 released. * eval.c: 不必要になったPUSH_ENV, POP_ENVを減らした． * env.h: ENVIONからselfをはずした．PUSH_ENVはsuperの準備のためだけ に用いることにした． * eval.c: 下記のオブジェクト化で遅くなった実行速度をもとに戻した． Mon Dec 17 23:01:10 1994 Yukihiro Matsumoto (matz@ix-02) * eval.c: env.{argv,argc}とscope.local_varsのオブジェクト化． * eval.c: 1スコープ内で複数Blockを生成したときのバグを修正． Fri Dec 16 15:52:06 1994 Yukihiro Matsumoto (matz@ix-02) * parse.y: `&&'と`||'の両辺はいつでも条件式とした． Thu Dec 15 00:16:04 1994 Yukihiro Matsumoto (matz@dyna) * eval.c(Block): Blockオブジェクトを実現． * node.h: NODE_QLISTはなくなった． * eval.c(rb_call): 引数への代入を名前で一つずつ代入するのをやめて， 一度にコピーするようにした． * eval.c(rb_call): rubyで記述されたメソッドへの引数渡しをinline化． * eval.c: イテレータ判定処理の全面書き換え．不適切なイテレータ呼び 出しをなくした．例えば「[foo(),bar()]{i|baz(i)}」でfooもbarもイ テレータとして呼び出され*ない*． * eval.c(rb_call): SCOPE処理をinline化．メソッド呼び出しの若干の高 速化． Wed Dec 14 18:09:33 1994 Yukihiro Matsumoto (matz@ix-02) * node.h: nodeもオブジェクトにする．よってGCで回収される． Thu Dec 8 14:17:29 1994 Yukihiro Matsumoto (matz@ix-02) * 0.60 released - alpha test baseline. ./ruby-0.64/FAQ100644 150 1 4754 5674170241 11531 0ustar matzdaemon.\" FAQ - -*- Indented-Text -*- created at: Tue Jan 4 12:48:12 JST 1994 これはRubyに関するFAQ(Frequently Asked Question)をまとめたものです. Emacsでこのファイルを見ている場合にはM-2 C-x $で質問の部分だけを読むこ とができます. C-x $で全てを読む状態に戻せます. ------------------------------ 1) Rubyの名称の由来は Rubyは何かの略称ではなく, 赤い宝石の名前をとって名付けられました. perl(pearlは6月の誕生石)の次を目指す(Rubyは7月の誕生石)という意味 があります. 更に美しく価値あるものであって欲しいという願いも含まれ ています. ------------------------------ 2) Rubyが影響を受けた言語は? Rubyの言語仕様はC, Perl, Eiffelの各言語にこの順に影響を受けていま す. その他に影響を受けた言語としてはtcl, AWK, bourne shell, CLU, Icon, Sather, Smalltalk, Emacs Lispなどがあります. ------------------------------ 3) Rubyの特徴は? 以下に箇条書にします. + インタプリタであり, 手軽にプログラムできる. + 変数宣言が要らない. + ファイルやストリームなどへのUNIX的な操作が簡単にできる. + バイナリファイルも扱える. + きちんとしたオブジェクト指向言語である. + 特異メソッドの機能が提供されている. + モジュールによる機能の共有ができる. + 例外処理機能がある. + GCがあるのでメモリ管理を気にしなくて済む. + 一貫性のある言語仕様. + 複雑なデータ構造も扱える. + ダイナミックロードをサポートする(システムによる). 逆に欠点は - 発展途上で機能が少ない. - デバッガが(まだ)ない. - 遅い. ことでしょうか. ------------------------------ 4) Rubyに変数宣言がないことのメリットは? ある変数がどのスコープに属するかが一目で分かるので, プログラムの読み 易さ, 理解し易さが増すことが最大のメリットです. またトータルのタイプ 量が減るので書き易さ, 手軽さにも貢献します. ------------------------------ 5) RubyとPerlの違いは? RubyとPerlはテキスト操作に優れたスクリプト言語であるという点で, カ バーする範囲が近く, 一見するとライバルに見えます. 確かにRubyの設計 において「Perlにできることはできるように」ということは, 一つの重要 な目標でした. しかし, Rubyの真の目的はあくまでも「手軽なオブジェク ト指向言語」であり, また, Ruby設計の3大目標である, 機能性・一貫性・ 拡張性の結果として, RubyはPerlとは異なる言語になりました. RubyはPerlほど「何でもあり」ではありませんし, ほとんどの場合Perlよ り処理速度が遅いです. しかし, Rubyのオブジェクト指向機能はPerlでは 満足できない人たちにアピールすると思います. ------------------------------ Local variables: fill-column: 70 end: ./ruby-0.64/Makefile.in100644 150 1 10151 5704462326 13252 0ustar matzdaemonSHELL = /bin/sh #### Start of system configuration section. #### srcdir = @srcdir@ VPATH = @srcdir@ CC = @CC@ DBMCC = cc YACC = @YACC@ INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ PURIFY= CFLAGS = -g STATIC = @STATIC@ LDFLAGS = $(CFLAGS) LIBS = @LIBS@ MISSING = @LIBOBJS@ @ALLOCA@ prefix = /usr/local binprefix = exec_prefix = $(prefix) bindir = $(exec_prefix)/bin #### End of system configuration section. #### HDRS = defines.h \ dln.h \ getopt.h \ ident.h \ io.h \ node.h \ re.h \ regex.h \ ruby.h \ st.h \ version.h OBJS = array.o \ bignum.o \ class.o \ compar.o \ cons.o \ dbm.o \ dict.o \ dir.o \ dln.o \ enum.o \ error.o \ etc.o \ eval.o \ file.o \ fnmatch.o \ gc.o \ getopt.o \ getopt1.o \ glob.o \ gnuglob.o \ inits.o \ io.o \ main.o \ math.o \ numeric.o \ object.o \ pack.o \ parse.o \ process.o \ random.o \ range.o \ re.o \ regex.o \ ruby.o \ signal.o \ socket.o \ sprintf.o \ st.o \ string.o \ struct.o \ time.o \ variable.o \ version.o \ $(MISSING) PROGRAM = ruby all: $(PROGRAM) $(PROGRAM): $(OBJS) @rm -f $(PROGRAM) $(PURIFY) $(CC) $(STATIC) $(LDFLAGS) $(OBJS) $(LIBS) -o $(PROGRAM) $(bindir)/$(PROGRAM): $(PROGRAM) $(INSTALL_PROGRAM) $(PROGRAM) $(bindir)/$(PROGRAM) install: $(bindir)/$(PROGRAM) clean:; @rm -f $(OBJS) realclean:; @rm -f $(OBJS) @rm -f core ruby *~ config.status Makefile .c.o: $(CC) $(CFLAGS) $(CPPFLAGS) -c $< dbm.o:dbm.c $(DBMCC) $(CFLAGS) $(CPPFLAGS) -c dbm.c alloca.o: missing/alloca.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c missing/alloca.c memmove.o: missing/memmove.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/memmove.c mkdir.o: missing/mkdir.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/mkdir.c strerror.o: missing/strerror.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strerror.c strdup.o: missing/strdup.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strdup.c strftime.o: missing/strftime.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c missing/strftime.c strstr.o: missing/strstr.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strstr.c strtol.o: missing/strtol.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strtol.c strtoul.o: missing/strtoul.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strtoul.c # Prevent GNU make v3 from overflowing arg limit on SysV. .NOEXPORT: ### parse.o : parse.y ruby.h defines.h config.h env.h node.h st.h ident.h regex.h ### array.o: array.c ruby.h config.h defines.h bignum.o: bignum.c ruby.h config.h defines.h class.o: class.c ruby.h config.h defines.h env.h node.h st.h compar.o: compar.c ruby.h config.h defines.h dbm.o: dbm.c ruby.h config.h defines.h dict.o: dict.c ruby.h config.h defines.h st.h dir.o: dir.c ruby.h config.h defines.h dln.o: dln.c defines.h dln.h enum.o: enum.c ruby.h config.h defines.h error.o: error.c ruby.h config.h defines.h env.h etc.o: etc.c ruby.h config.h defines.h eval.o: eval.c ruby.h config.h defines.h ident.h env.h node.h st.h file.o: file.c ruby.h config.h defines.h io.h fnmatch.o: fnmatch.c fnmatch.h gc.o: gc.c ruby.h config.h defines.h env.h st.h glob.o: glob.c ruby.h config.h defines.h fnmatch.h gnuglob.o: gnuglob.c fnmatch.h inits.o: inits.c ruby.h config.h defines.h io.o: io.c ruby.h config.h defines.h io.h main.o: main.c math.o: math.c ruby.h config.h defines.h numeric.o: numeric.c ruby.h config.h defines.h env.h object.o: object.c ruby.h config.h defines.h env.h node.h st.h pack.o: pack.c ruby.h config.h defines.h process.o: process.c ruby.h config.h defines.h st.h random.o: random.c ruby.h config.h defines.h range.o: range.c ruby.h config.h defines.h re.o: re.c ruby.h config.h defines.h re.h regex.h regex.o: regex.c defines.h regex.h ruby.o: ruby.c ruby.h config.h defines.h re.h regex.h getopt.h socket.o: socket.c ruby.h config.h defines.h io.h sprintf.o: sprintf.c ruby.h config.h defines.h st.o: st.c st.h string.o: string.c ruby.h config.h defines.h re.h regex.h struct.o: struct.c ruby.h config.h defines.h env.h time.o: time.c ruby.h config.h defines.h variable.o: variable.c ruby.h config.h defines.h env.h node.h ident.h st.h version.o: version.c ruby.h config.h defines.h version.h ./ruby-0.64/README100644 150 1 4317 5674170241 12052 0ustar matzdaemon.\" README - -*- Text -*- created at: Wed Aug 3 11:57:36 JST 1994 コンパイル・インストール 1. configureを実行してMakefileを生成する. 2. (必要ならば)defines.hを編集する. 3. makeを実行してコンパイルする 4. make install もし, コンパイル時にエラーが発生した場合にはエラーのログとマ シン, OSの種類を含むできるだけ詳しいレポートを作者に送ってい ただきたい. 機能追加 Cコードを書くことによって, 簡単にrubyに機能を追加できる. そのおおまかな手順は以下の通りである. * 関数的メソッドを追加する場合 (1) Cで関数を書く (2) rb_define_method()でカーネルクラスのメソッドとして関 数をrubyに登録する関数を書く (3) init.cを編集して, 登録する関数を呼び出す * クラスを追加する場合 (1) クラスを設計する (2) メソッドをCで記述する (3) rb_define_class()でクラスを生成するコードを書く (4) rb_define_method()でメソッドを登録するコードを書く (5) init.cを編集して, 初期化する関数を呼び出す 詳しくはC-IFを参照. 移植 UNIXであればconfigureがほとんどの差異を吸収してくれるはず だが, 思わぬ見落としがあった場合(あるに違いない), 作者にレ ポートすれば, 解決できるかも知れない. アークテクチャにもっとも依存するのはGC部である. rubyのGCは 対象のアーキテクチャがsetjmp()によって, 全てのレジスタを jmp_bufに格納することと, jmp_bufとスタックが32bitアライン メントされていることを仮定している. 前者が真実でない場合の 移植は困難を極めるだろう. 後者は割と簡単に解決できる. gc.c のスタックをマークする部分にアラインメントのバイト数だけず らしてマークするコードを追加するだけで済む. sparc以外のレジスタウィンドウを持つCPUでは, レジスタウィン ドウをフラッシュするコードを追加する必要があるかも知れない. 配布条件 Rubyは最終的にはGNU Public Licenseにしたがった条件で配布さ れる予定だが, 現時点では以下の条件で配布する. * 更新 いかなる目的であれ自由である. ただし, バグ修正は作者への フィードバックを期待する(強制ではない) * 他のプログラムへの引用 いかなる目的であれ自由である. ただし, 配布したコードに含 まれる他の作者によるコードは, それぞれの作者の意向による 制限が加えられる. * 再配布 禁止する. 入手したい人は作者に直接連絡をとること. これは Rubyの言語仕様が不安定な状態のまま広く流布するのを制限す るためであり, 言語仕様が安定した時点で再配布自由とする. ./ruby-0.64/ToDo100644 150 1 421 5674170241 11732 0ustar matzdaemon* format機能 * here document * perlのようなsetuid check * trからBSDコードを取り除く(またはcopyrightをはっきりさせる) * 適切なsignal handling * dlnのCOFF対応 * rubyで定義する変数hookの実現 * write debugger for ruby * re-write regex code for speeding * byte code interpretor ./ruby-0.64/array.c100644 150 1 44016 5704462327 12477 0ustar matzdaemon/************************************************ array.c - $Author: matz $ $Date: 1995/01/10 10:42:18 $ created at: Fri Aug 6 09:46:12 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" VALUE C_Array; VALUE rb_to_a(); #define ARY_DEFAULT_SIZE 16 VALUE ary_new2(len) { NEWOBJ(ary, struct RArray); OBJSETUP(ary, C_Array, T_ARRAY); ary->len = 0; ary->capa = len; ary->ptr = ALLOC_N(VALUE, len); return (VALUE)ary; } VALUE ary_new() { return ary_new2(ARY_DEFAULT_SIZE); } #include VALUE ary_new3(n, va_alist) int n; va_dcl { va_list ar; struct RArray* ary; int len, i; if (n < 0) { Fail("Negative number of items(%d)", n); } ary = (struct RArray*)ary_new2(nptr[i] = va_arg(ar, VALUE); } va_end(ar); ary->len = n; return (VALUE)ary; } VALUE ary_new4(n, elts) int n; VALUE *elts; { struct RArray* ary; ary = (struct RArray*)ary_new2(n); MEMCPY(ary->ptr, elts, VALUE, n); ary->len = n; return (VALUE)ary; } #if 0 VALUE assoc_new(elm1, elm2) VALUE elm1, elm2; { struct RArray *ary; ary = (struct RArray*)ary_new2(2); ary->ptr[0] = elm1; ary->ptr[1] = elm2; ary->len = 2; return (VALUE)ary; } #endif static VALUE Sary_new(class) VALUE class; { NEWOBJ(ary, struct RArray); OBJSETUP(ary, class, T_ARRAY); ary->len = 0; ary->capa = ARY_DEFAULT_SIZE; ary->ptr = ALLOC_N(VALUE, ARY_DEFAULT_SIZE); return (VALUE)ary; } static void astore(ary, idx, val) struct RArray *ary; int idx; VALUE val; { if (idx < 0) { Fail("negative index for array"); } if (idx >= ary->capa) { ary->capa = idx + ary->capa/5; REALLOC_N(ary->ptr, VALUE, ary->capa); } if (idx > ary->len) { MEMZERO(ary->ptr+ary->len, VALUE, idx-ary->len+1); } if (idx >= ary->len) { ary->len = idx + 1; } ary->ptr[idx] = val; } VALUE ary_push(ary, item) struct RArray *ary; VALUE item; { astore(ary, ary->len, item); return (VALUE)ary; } static VALUE Fary_append(ary, item) struct RArray *ary; VALUE item; { astore(ary, ary->len, item); return (VALUE)ary; } VALUE ary_pop(ary) struct RArray *ary; { if (ary->len == 0) return Qnil; return ary->ptr[--ary->len]; } VALUE ary_shift(ary) struct RArray *ary; { VALUE top; if (ary->len == 0) return Qnil; top = ary->ptr[0]; ary->len--; /* sliding items */ memmove(ary->ptr, ary->ptr+1, sizeof(VALUE)*(ary->len)); return top; } VALUE ary_unshift(ary, item) struct RArray *ary; { VALUE top; if (ary->len >= ary->capa) { ary->capa+=ARY_DEFAULT_SIZE; REALLOC_N(ary->ptr, VALUE, ary->capa); } /* sliding items */ memmove(ary->ptr+1, ary->ptr, sizeof(VALUE)*(ary->len)); ary->len++; return ary->ptr[0] = item; } VALUE ary_entry(ary, offset) struct RArray *ary; int offset; { if (ary->len == 0) return Qnil; if (offset < 0) { offset = ary->len + offset; } if (offset < 0 || ary->len <= offset) { return Qnil; } return ary->ptr[offset]; } static VALUE ary_subseq(ary, beg, len) struct RArray *ary; int beg, len; { struct RArray *ary2; VALUE *ptr; if (beg < 0) { beg = ary->len + beg; if (beg < 0) beg = 0; } if (len < 0) { Fail("negative length for sub-array(size: %d)", ary->len); } if (len == 0) { return ary_new(); } if (beg + len > ary->len) { len = ary->len - beg; } ary2 = (struct RArray*)ary_new2(len); MEMCPY(ary2->ptr, ary->ptr+beg, VALUE, len); ary2->len = len; return (VALUE)ary2; } extern VALUE C_Range; static void range_beg_end(range, begp, lenp, len) VALUE range; int *begp, *lenp; int len; { int beg, end; beg = rb_iv_get(range, "start"); beg = NUM2INT(beg); end = rb_iv_get(range, "end"); end = NUM2INT(end); if (beg < 0) { beg = len + beg; if (beg < 0) beg = 0; } if (end < 0) { end = len + end; if (end < 0) end = 0; } if (beg > end) { int tmp; if (verbose) { Warning("start %d is bigger than end %d", beg, end); } tmp = beg; beg = end; end = tmp; } *begp = beg; *lenp = end - beg + 1; } static VALUE Fary_aref(argc, argv, ary) int argc; VALUE *argv; struct RArray *ary; { VALUE arg1, arg2; if (rb_scan_args(argc, argv, "11", &arg1, &arg2) == 2) { int beg, len; beg = NUM2INT(arg1); len = NUM2INT(arg2); if (len <= 0) { return ary_new(); } return ary_subseq(ary, beg, len); } /* special case - speeding up */ if (FIXNUM_P(arg1)) { return ary_entry(ary, NUM2INT(arg1)); } /* check if idx is Range */ if (obj_is_kind_of(arg1, C_Range)) { int beg, len; range_beg_end(arg1, &beg, &len, ary->len); return ary_subseq(ary, beg, len); } return ary_entry(ary, NUM2INT(arg1)); } static VALUE Fary_index(ary, val) struct RArray *ary; VALUE val; { int i; for (i=0; ilen; i++) { if (rb_equal(ary->ptr[i], val)) return INT2FIX(i); } return Qnil; } static VALUE Fary_indexes(ary, args) struct RArray *ary, *args; { VALUE *p, *pend; VALUE new; int i = 0; if (!args || args->len == 1) { args = (struct RArray*)rb_to_a(args->ptr[0]); } new = ary_new2(args->len); p = args->ptr; pend = p + args->len; while (p < pend) { astore(new, i++, ary_entry(ary, NUM2INT(*p))); p++; } return new; } static VALUE Fary_aset(argc, argv, ary) int argc; VALUE *argv; struct RArray *ary; { VALUE arg1, arg2; struct RArray *arg3; int offset; if (rb_scan_args(argc, argv, "21", &arg1, &arg2, &arg3) == 3) { int beg, len; beg = NUM2INT(arg1); if (TYPE(arg3) != T_ARRAY) { arg3 = (struct RArray*)rb_to_a(arg3); } if (beg < 0) { beg = ary->len + beg; if (beg < 0) { Fail("negative index for array(size: %d)", ary->len); } } if (beg >= ary->len) { len = beg + arg3->len; if (len >= ary->capa) { ary->capa=len; REALLOC_N(ary->ptr, VALUE, ary->capa); } MEMZERO(ary->ptr+ary->len, VALUE, beg-ary->len); MEMCPY(ary->ptr+beg, arg3->ptr, VALUE, arg3->len); ary->len = len; } else { int alen; len = NUM2INT(arg2); if (beg + len > ary->len) { len = ary->len - beg; } if (len < 0) { Fail("negative length for sub-array(size: %d)", ary->len); } alen = ary->len + arg3->len - len; if (alen >= ary->capa) { ary->capa=alen; REALLOC_N(ary->ptr, VALUE, ary->capa); } memmove(ary->ptr+beg+arg3->len, ary->ptr+beg+len, sizeof(VALUE)*(ary->len-(beg+len))); memcpy(ary->ptr+beg, arg3->ptr, sizeof(VALUE)*arg3->len); ary->len = alen; } return (VALUE)arg3; } /* check if idx is Range */ if (obj_is_kind_of(arg1, C_Range)) { int beg, len; Check_Type(arg2, T_ARRAY); range_beg_end(arg1, &beg, &len, ary->len); if (ary->len < beg) { len = beg + RARRAY(arg2)->len; if (len >= ary->capa) { ary->capa=len; REALLOC_N(ary->ptr, VALUE, ary->capa); } MEMZERO(ary->ptr+ary->len, VALUE, beg-ary->len); MEMCPY(ary->ptr+beg, RARRAY(arg2)->ptr, VALUE, RARRAY(arg2)->len); ary->len = len; } else { int alen; alen = ary->len + RARRAY(arg2)->len - len; if (alen >= ary->capa) { ary->capa=alen; REALLOC_N(ary->ptr, VALUE, ary->capa); } memmove(ary->ptr+beg+RARRAY(arg2)->len, ary->ptr+beg+len, sizeof(VALUE)*(ary->len-(beg+len))); memcpy(ary->ptr+beg, RARRAY(arg2)->ptr, sizeof(VALUE)*RARRAY(arg2)->len); ary->len = alen; } return arg2; } offset = NUM2INT(arg1); if (offset < 0) { offset = ary->len + offset; } astore(ary, offset, arg2); return arg2; } static VALUE Fary_each(ary) struct RArray *ary; { int i; if (iterator_p()) { for (i=0; ilen; i++) { rb_yield(ary->ptr[i]); } } else { return (VALUE)ary; } } static VALUE Fary_each_index(ary) struct RArray *ary; { int i; for (i=0; ilen; i++) { rb_yield(INT2FIX(i)); } } static VALUE Fary_length(ary) struct RArray *ary; { return INT2FIX(ary->len); } static VALUE ary_clone(ary) struct RArray *ary; { VALUE ary2 = ary_new2(ary->len); CLONESETUP(ary2, ary); MEMCPY(RARRAY(ary2)->ptr, ary->ptr, VALUE, ary->len); RARRAY(ary2)->len = ary->len; return ary2; } extern VALUE OFS; VALUE ary_join(ary, sep) struct RArray *ary; struct RString *sep; { int i; VALUE result, tmp; if (ary->len == 0) return str_new(0, 0); if (TYPE(ary->ptr[0]) == T_STRING) result = str_clone(ary->ptr[0]); else result = obj_as_string(ary->ptr[0]); for (i=1; ilen; i++) { tmp = ary->ptr[i]; switch (TYPE(tmp)) { case T_STRING: break; case T_ARRAY: tmp = ary_join(tmp, sep); break; default: tmp = obj_as_string(tmp); } if (sep) str_cat(result, sep->ptr, sep->len); str_cat(result, RSTRING(tmp)->ptr, RSTRING(tmp)->len); } return result; } static VALUE Fary_join(argc, argv, ary) int argc; VALUE *argv; struct RArray *ary; { VALUE sep; rb_scan_args(argc, argv, "01", &sep); if (sep == Qnil) sep = OFS; if (sep != Qnil) Check_Type(sep, T_STRING); return ary_join(ary, sep); } VALUE Fary_to_s(ary) VALUE ary; { VALUE str = ary_join(ary, OFS); if (str == Qnil) return str_new(0, 0); return str; } VALUE Fary_print_on(ary, port) struct RArray *ary; VALUE port; { int i; for (i=0; ilen; i++) { if (OFS && i>1) { io_write(port, OFS); } io_write(port, ary->ptr[i]); } return port; } #define INSPECT_MAX 10 static VALUE Fary_inspect(ary) struct RArray *ary; { int i, len; VALUE str; char *p; ary = (struct RArray*)ary_clone(ary); len = ary->len; for (i=0; i INSPECT_MAX) break; ary->ptr[i] = rb_funcall(ary->ptr[i], rb_intern("_inspect"), 0, Qnil); } str = str_new2(", "); str = ary_join(ary, str); if (str == Qnil) return str_new2("[]"); len = RSTRING(str)->len; if (ary->len > INSPECT_MAX) str_grow(str, len+5); else str_grow(str, len+2); p = RSTRING(str)->ptr; memmove(p+1, p, len); p[0] = '['; if (ary->len > INSPECT_MAX) strcpy(p+len, "...]"); else p[len+1] = ']'; return str; } static VALUE Fary_to_a(ary) VALUE ary; { return ary; } VALUE rb_to_a(obj) VALUE obj; { if (TYPE(obj) == T_ARRAY) return obj; obj = rb_funcall(obj, rb_intern("to_a"), 0); if (TYPE(obj) != T_ARRAY) { Bug("`to_a' did not return Array"); } return obj; } static VALUE Fary_reverse(ary) struct RArray *ary; { VALUE ary2 = ary_new2(ary->len); int i, j; for (i=ary->len-1, j=0; i >=0; i--, j++) { RARRAY(ary2)->ptr[j] = ary->ptr[i]; } RARRAY(ary2)->len = ary->len; return ary2; } static ID cmp; static int sort_1(a, b) VALUE *a, *b; { VALUE retval = rb_yield(assoc_new(*a, *b)); return NUM2INT(retval); } static int sort_2(a, b) VALUE *a, *b; { VALUE retval = rb_funcall(*a, cmp, 1, *b); return NUM2INT(retval); } VALUE Fary_sort(ary) struct RArray *ary; { qsort(ary->ptr, ary->len, sizeof(VALUE), iterator_p()?sort_1:sort_2); return (VALUE)ary; } static VALUE Fary_delete(ary, item) struct RArray *ary; VALUE item; { int i1, i2; for (i1 = i2 = 0; i1 < ary->len; i1++) { if (rb_equal(ary->ptr[i1], item)) continue; if (i1 != i2) { ary->ptr[i2] = ary->ptr[i1]; } i2++; } ary->len = i2; return (VALUE)ary; } static VALUE Fary_delete_if(ary) struct RArray *ary; { int i1, i2; for (i1 = i2 = 0; i1 < ary->len; i1++) { if (rb_yield(ary->ptr[i1])) continue; if (i1 != i2) { ary->ptr[i2] = ary->ptr[i1]; } i2++; } ary->len = i2; return (VALUE)ary; } static VALUE Fary_clear(ary) struct RArray *ary; { ary->len = 0; return (VALUE)ary; } static VALUE Fary_fill(argc, argv, ary) int argc; VALUE *argv; struct RArray *ary; { VALUE item, arg1, arg2; int beg, len, end; VALUE *p, *pend; rb_scan_args(argc, argv, "12", &item, &arg1, &arg2); if (arg2 == Qnil && obj_is_kind_of(arg1, C_Range)) { range_beg_end(arg1, &beg, &len, ary->len); } else { beg = NUM2INT(arg1); if (beg < 0) { beg = ary->len + beg; if (beg < 0) beg = 0; } if (arg2) { len = NUM2INT(arg2); } else { len = ary->len - beg; } } end = beg + len; if (end > ary->len) { if (end >= ary->capa) { ary->capa=end; REALLOC_N(ary->ptr, VALUE, ary->capa); } if (beg > ary->len) { MEMZERO(ary->ptr+ary->len, VALUE, end-ary->len); } ary->len = end; } p = ary->ptr + beg; pend = p + len; while (p < pend) { *p++ = item; } return (VALUE)ary; } static VALUE Fary_plus(x, y) struct RArray *x, *y; { struct RArray *z; switch (TYPE(y)) { case T_ARRAY: z = (struct RArray*)ary_new2(x->len + y->len); MEMCPY(z->ptr, x->ptr, VALUE, x->len); MEMCPY(z->ptr+x->len, y->ptr, VALUE, y->len); z->len = x->len + RARRAY(y)->len; break; default: z = (struct RArray*)ary_clone(x); ary_push(z, y); break; } return (VALUE)z; } static VALUE Fary_times(ary, times) struct RArray *ary; VALUE times; { struct RArray *ary2; int i, len; len = NUM2INT(times) * ary->len; ary2 = (struct RArray*)ary_new2(len); ary2->len = len; for (i=0; ilen) { MEMCPY(ary2->ptr+i, ary->ptr, VALUE, ary->len); } return (VALUE)ary2; } VALUE Fary_assoc(ary, key) struct RArray *ary; VALUE key; { VALUE *p, *pend; p = ary->ptr; pend = p + ary->len; while (p < pend) { if (TYPE(*p) == T_CONS && rb_equal(RCONS(*p)->car, key)) return *p; } return Qnil; } VALUE Fary_rassoc(ary, value) struct RArray *ary; VALUE value; { VALUE *p, *pend; p = ary->ptr; pend = p + ary->len; while (p < pend) { if (TYPE(*p) == T_CONS && rb_equal(RCONS(*p)->cdr, value)) return *p; } return Qnil; } static VALUE Fary_equal(ary1, ary2) struct RArray *ary1, *ary2; { int i; if (TYPE(ary2) != T_ARRAY) return FALSE; if (ary1->len != ary2->len) return FALSE; for (i=0; ilen; i++) { if (!rb_equal(ary1->ptr[i], ary2->ptr[i])) return FALSE; } return TRUE; } static VALUE Fary_hash(ary) struct RArray *ary; { int i, h; ID hash = rb_intern("hash"); h = 0; for (i=0; ilen; i++) { h += rb_funcall(ary->ptr[i], hash, 0); } h += ary->len; return INT2FIX(h); } static VALUE Fary_includes(ary, item) struct RArray *ary; VALUE item; { int i; for (i=0; ilen; i++) { if (rb_equal(ary->ptr[i], item)) { return TRUE; } } return FALSE; } static VALUE Fary_diff(ary1, ary2) struct RArray *ary1, *ary2; { VALUE ary3; int i, j; Check_Type(ary2, T_ARRAY); ary3 = ary_new(); for (i=0; ilen; i++) { if (Fary_includes(ary2, ary1->ptr[i])) continue; if (Fary_includes(ary3, ary1->ptr[i])) continue; ary_push(ary3, ary1->ptr[i]); } return ary3; } static VALUE Fary_and(ary1, ary2) struct RArray *ary1, *ary2; { VALUE ary3; int i, j; Check_Type(ary2, T_ARRAY); ary3 = ary_new(); for (i=0; ilen; i++) { if (Fary_includes(ary2, ary1->ptr[i]) && !Fary_includes(ary3, ary1->ptr[i])) { ary_push(ary3, ary1->ptr[i]); } } return ary3; } static VALUE Fary_or(ary1, ary2) struct RArray *ary1, *ary2; { VALUE ary3; int i; if (TYPE(ary2) != T_ARRAY) { if (Fary_includes(ary1, ary2)) return (VALUE)ary1; else return Fary_plus(ary1, ary2); } ary3 = ary_new(); for (i=0; ilen; i++) { if (!Fary_includes(ary3, ary1->ptr[i])) ary_push(ary3, ary1->ptr[i]); } for (i=0; ilen; i++) { if (!Fary_includes(ary3, ary2->ptr[i])) ary_push(ary3, ary2->ptr[i]); } return ary3; } extern VALUE C_Kernel; extern VALUE M_Enumerable; Init_Array() { C_Array = rb_define_class("Array", C_Object); rb_include_module(C_Array, M_Enumerable); rb_define_single_method(C_Array, "new", Sary_new, 0); rb_define_method(C_Array, "to_s", Fary_to_s, 0); rb_define_method(C_Array, "_inspect", Fary_inspect, 0); rb_define_method(C_Array, "to_a", Fary_to_a, 0); rb_define_method(C_Array, "print_on", Fary_print_on, 1); rb_define_method(C_Array, "==", Fary_equal, 1); rb_define_method(C_Array, "hash", Fary_hash, 0); rb_define_method(C_Array, "[]", Fary_aref, -1); rb_define_method(C_Array, "[]=", Fary_aset, -1); rb_define_method(C_Array, "<<", Fary_append, 1); rb_define_method(C_Array, "push", ary_push, 1); rb_define_method(C_Array, "pop", ary_pop, 0); rb_define_method(C_Array, "shift", ary_shift, 0); rb_define_method(C_Array, "unshift", ary_unshift, 1); rb_define_method(C_Array, "each", Fary_each, 0); rb_define_method(C_Array, "each_index", Fary_each_index, 0); rb_define_method(C_Array, "length", Fary_length, 0); rb_define_alias(C_Array, "size", "length"); rb_define_method(C_Array, "index", Fary_index, 1); rb_define_method(C_Array, "indexes", Fary_indexes, -2); rb_define_method(C_Array, "clone", ary_clone, 0); rb_define_method(C_Array, "join", Fary_join, -1); rb_define_method(C_Array, "reverse", Fary_reverse, 0); rb_define_method(C_Array, "sort", Fary_sort, 0); rb_define_method(C_Array, "delete", Fary_delete, 1); rb_define_method(C_Array, "delete_if", Fary_delete_if, 0); rb_define_method(C_Array, "clear", Fary_clear, 0); rb_define_method(C_Array, "fill", Fary_fill, -1); rb_define_method(C_Array, "includes", Fary_includes, 1); rb_define_method(C_Array, "assoc", Fary_assoc, 1); rb_define_method(C_Array, "rassoc", Fary_rassoc, 1); rb_define_method(C_Array, "+", Fary_plus, 1); rb_define_method(C_Array, "*", Fary_times, 1); rb_define_method(C_Array, "-", Fary_diff, 1); rb_define_method(C_Array, "&", Fary_and, 1); rb_define_method(C_Array, "|", Fary_or, 1); cmp = rb_intern("<=>"); } ./ruby-0.64/bignum.c100644 150 1 47640 5704462330 12642 0ustar matzdaemon/************************************************ bignum.c - $Author: matz $ $Date: 1995/01/10 10:42:19 $ created at: Fri Jun 10 00:48:55 JST 1994 ************************************************/ #include "ruby.h" #include #include extern VALUE C_Integer; VALUE C_Bignum; #define BDIGITS(x) RBIGNUM(x)->digits #define BITSPERDIG (sizeof(USHORT)*CHAR_BIT) #define BIGRAD (1L << BITSPERDIG) #define DIGSPERLONG ((UINT)(sizeof(long)/sizeof(USHORT))) #define BIGUP(x) ((unsigned long)(x) << BITSPERDIG) #define BIGDN(x) ((x) >> BITSPERDIG) #define BIGLO(x) ((x) & (BIGRAD-1)) #define MAX(a,b) ((a)>(b)?(a):(b)) #define MIN(a,b) ((a)<(b)?(a):(b)) static VALUE bignew_1(class, len, sign) VALUE class; UINT len; char sign; { NEWOBJ(big, struct RBignum); OBJSETUP(big, C_Bignum, T_BIGNUM); big->sign = sign; big->len = len; BDIGITS(big) = ALLOC_N(USHORT, len); return (VALUE)big; } #define bignew(len,sign) bignew_1(C_Bignum,len,sign) static VALUE Sbig_new(class, y) VALUE class; struct RBignum *y; { Check_Type(y, T_BIGNUM); return bignew_1(class, y->len, y->sign); } VALUE big_clone(x) struct RBignum *x; { VALUE z = bignew_1(CLASS_OF(x), x->len, x->sign); MEMCPY(BDIGITS(z), BDIGITS(x), USHORT, x->len); return (VALUE)z; } void big_2comp(x) /* get 2's complement */ struct RBignum *x; { UINT i = x->len; USHORT *ds = BDIGITS(x); long num; while (i--) ds[i] = ~ds[i]; i = 0; num = 1; do { num += (long)ds[i]; ds[i++] = BIGLO(num); num = BIGDN(num); } while (i < x->len); } VALUE bignorm(x) struct RBignum *x; { UINT len = x->len; USHORT *ds = BDIGITS(x); while (len-- && !ds[len]) ; x->len = ++len; if (len*sizeof(USHORT) < sizeof(VALUE) || (len*sizeof(USHORT) == sizeof(VALUE) && ds[sizeof(VALUE)/sizeof(USHORT)-1] <= 0x3fff)) { long num = 0; while (len--) { num = BIGUP(num) + ds[len]; } if (x->sign) { if (POSFIXABLE(num)) return INT2FIX(num); } else if (NEGFIXABLE(-num)) return INT2FIX(-num); } return (VALUE)x; } VALUE uint2big(n) UINT n; { UINT i = 0; USHORT *digits; struct RBignum *big; i = 0; big = (struct RBignum*)bignew(DIGSPERLONG, 1); digits = BDIGITS(big); while (i < DIGSPERLONG) { digits[i++] = BIGLO(n); n = BIGDN(n); } i = DIGSPERLONG; while (i-- && !digits[i]) ; big->len = i+1; return (VALUE)big; } VALUE int2big(n) int n; { int neg = 0; struct RBignum *big; if (n < 0) { n = -n; neg = 1; } big = (struct RBignum*)uint2big(n); if (neg) { big->sign = FALSE; } return (VALUE)big; } VALUE uint2inum(n) UINT n; { if (POSFIXABLE(n)) return INT2FIX(n); return uint2big(n); } VALUE int2inum(n) int n; { if (FIXABLE(n)) return INT2FIX(n); return int2big(n); } VALUE str2inum(str, base) char *str; int base; { char sign = 1, c; unsigned long num; UINT len, blen = 1, i; VALUE z; USHORT *zds; while (isspace(*str)) str++; if (*str == '-') { str++; sign = 0; } if (base == 0) { if (*str == '0') { str++; if (*str == 'x' || *str == 'X') { str++; base = 16; } else { base = 8; } if (*str == '\0') return INT2FIX(0); } else { base = 10; } } len = strlen(str); if (base == 8) { len = 3*len*sizeof(char); } else { /* base == 10 or 16 */ len = 4*len*sizeof(char); } if (len <= (sizeof(VALUE)*CHAR_BIT)) { int result = strtoul(str, Qnil, base); if (!sign) result = -result; if (FIXABLE(result)) return INT2FIX(result); return int2big(result); } len = (len/(sizeof(USHORT)*CHAR_BIT))+1; z = bignew(len, sign); zds = BDIGITS(z); for (i=len;i--;) zds[i]=0; while (c = *str++) { switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': c = c - '0'; break; case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': c = c - 'a' + 10; break; case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': c = c - 'A' + 10; break; default: c = base; break; } if (c >= base) break; i = 0; num = c; for (;;) { while (ilen; if (x->len == 0) return str_new2("0"); if (base == 10) { j = (sizeof(USHORT)/sizeof(char)*CHAR_BIT*i*241L)/800+2; hbase = 10000; } else if (base == 16) { j = (sizeof(USHORT)/sizeof(char)*CHAR_BIT*i)/4+2; hbase = 0x10000; } else if (base == 8) { j = (sizeof(USHORT)/sizeof(char)*CHAR_BIT*i)+2; hbase = 010000; } else if (base == 2) { j = (sizeof(USHORT)*CHAR_BIT*i)+2; hbase = 020; } else { Fail("bignum cannot treat base %d", base); } t = big_clone(x); ds = BDIGITS(t); ss = str_new(0, j); s = RSTRING(ss)->ptr; s[0] = x->sign ? '+' : '-'; while (i && j) { int k = i; unsigned long num = 0; while (k--) { num = BIGUP(num) + ds[k]; ds[k] = num / hbase; num %= hbase; } if (ds[i-1] == 0) i--; k = 4; while (k--) { c = num % base; s[--j] = hexmap[(int)c]; num /= base; if (i == 0 && num == 0) break; } } while (s[j] == '0') j++; RSTRING(ss)->len -= x->sign?j:j-1; memmove(x->sign?s:s+1, s+j, RSTRING(ss)->len); s[RSTRING(ss)->len] = '\0'; return ss; } static VALUE Fbig_to_s(x) struct RBignum *x; { return big2str(x, 10); } int big2int(x) struct RBignum *x; { unsigned long num; UINT len = x->len; USHORT *ds; if (len > sizeof(long)/sizeof(USHORT)) Fail("Bignum too big to convert into fixnum"); ds = BDIGITS(x); num = 0; while (len--) { num = BIGUP(num); num += ds[len]; } if (!x->sign) return -num; return num; } VALUE Fbig_to_i(x) VALUE x; { int v = big2int(x); if (FIXABLE(v)) { return INT2FIX(v); } return x; } VALUE dbl2big(d) double d; { UINT i = 0; long c; USHORT *digits; VALUE z; double u = (d < 0)?-d:d; while (0 != (long)u) { u /= BIGRAD; i++; } z = bignew(i, d>=0); digits = BDIGITS(z); while (i--) { u *= BIGRAD; c = (long)u; u -= c; digits[i] = c; } return bignorm(z); } double big2dbl(x) struct RBignum *x; { double d = 0.0; UINT i = x->len; USHORT *ds = BDIGITS(x); while (i--) d = ds[i] + BIGRAD*d; if (!x->sign) d = -d; return d; } VALUE Fbig_to_f(x) VALUE x; { return float_new(big2dbl(x)); } static VALUE Fbig_uminus(x) struct RBignum *x; { VALUE z = big_clone(x); RBIGNUM(z)->sign = !x->sign; return bignorm(z); } static VALUE bigadd(x, y, sign) struct RBignum *x, *y; char sign; { struct RBignum *z; USHORT *zds; long num; UINT i, len; len = MAX(x->len, y->len) + 1; z = (struct RBignum*)bignew(len, sign==y->sign); zds = BDIGITS(z); i = len; while (i--) zds[i] = 0; i = y->len; while (i--) zds[i] = BDIGITS(y)[i]; i = 0; num = 0; if (x->sign == z->sign) { do { num += (long)zds[i] + BDIGITS(x)[i]; zds[i++] = BIGLO(num); num = BIGDN(num); } while (i < x->len); if (num) { while (i < y->len) { num += zds[i]; zds[i++] = BIGLO(num); num = BIGDN(num); } BDIGITS(z)[i] = num; } } else { do { num += (long)zds[i] - BDIGITS(x)[i]; if (num < 0) { zds[i] = num + BIGRAD; num = -1; } else { zds[i] = BIGLO(num); num = 0; } } while (++i < x->len); if (num && x->len == y->len) { num = 1; i = 0; z->sign = 1; do { num += (BIGRAD-1) - zds[i]; zds[i++] = BIGLO(num); num = BIGDN(num); } while (i < y->len); } else while (i < y->len) { num += zds[i]; if (num < 0) { zds[i++] = num + BIGRAD; num = -1; } else { zds[i++] = BIGLO(num); num = 0; } } } return bignorm(z); } VALUE Fbig_plus(x, y) VALUE x, y; { VALUE z; if (FIXNUM_P(y)) y = int2big(FIX2INT(y)); else { Check_Type(x, T_BIGNUM); } z = bigadd(x, y, 1); return z; } VALUE Fbig_minus(x, y) VALUE x, y; { if (FIXNUM_P(y)) y = int2big(FIX2INT(y)); else { Check_Type(y, T_BIGNUM); } x = bigadd(x, y, 0); return x; } VALUE Fbig_mul(x, y) struct RBignum *x, *y; { UINT i = 0, j; unsigned long n = 0; VALUE z; USHORT *zds; if (FIXNUM_P(x)) x = (struct RBignum*)int2big(FIX2INT(x)); if (FIXNUM_P(y)) y = (struct RBignum*)int2big(FIX2INT(y)); else { Check_Type(y, T_BIGNUM); } j = x->len + y->len + 1; z = bignew(j, x->sign==y->sign); zds = BDIGITS(z); while (j--) zds[j] = 0; do { j = 0; if (BDIGITS(x)[i]) { do { n += zds[i + j] + ((unsigned long)BDIGITS(x)[i]*BDIGITS(y)[j]); zds[i + j++] = BIGLO(n); n = BIGDN(n); } while (j < y->len); if (n) { zds[i + j] = n; n = 0; } } } while (++i < x->len); return bignorm(z); } static void bigdivmod(x, y, div, mod) struct RBignum *x, *y; VALUE *div, *mod; { UINT nx = x->len, ny = y->len, i, j; VALUE z; USHORT *xds, *yds, *zds, *tds; unsigned long t2; long num; USHORT dd, q; yds = BDIGITS(y); if (ny == 0 && yds[0] == 0) Fail("divided by 0"); if (nx < ny) { if (div) *div = INT2FIX(0); if (mod) *mod = bignorm(x); return; } xds = BDIGITS(x); if (ny == 1) { dd = yds[0]; z = big_clone(x); zds = BDIGITS(z); t2 = 0; i = nx; while(i--) { t2 = BIGUP(t2) + zds[i]; zds[i] = t2 / dd; t2 %= dd; } if (div) *div = bignorm(z); if (mod) { if (!y->sign) t2 = -t2; *mod = FIX2INT(t2); } return; } z = bignew(nx==ny?nx+2:nx+1, x->sign==y->sign); zds = BDIGITS(z); if (nx==ny) zds[nx+1] = 0; while (!yds[ny-1]) ny--; if ((dd = BIGRAD/(yds[ny-1]+1)) != 1) { y = (struct RBignum*)big_clone(y); tds = BDIGITS(y); j = 0; num = 0; while (j= ny); if (div) { /* move quotient down in z */ *div = big_clone(z); zds = BDIGITS(*div); j = (nx==ny ? nx+2 : nx+1) - ny; for (i = 0;i < j;i++) zds[i] = zds[i+ny]; RBIGNUM(*div)->len = i; *div = bignorm(*div); } if (mod) { /* just normalize remainder */ *mod = big_clone(z); if (dd) { zds = BDIGITS(*mod); t2 = 0; i = ny; while(i--) { t2 = BIGUP(t2) + zds[i]; zds[i] = t2 / dd; t2 %= dd; } } RBIGNUM(*mod)->len = ny; RBIGNUM(*mod)->sign = y->sign; *mod = bignorm(*mod); } } static VALUE Fbig_div(x, y) VALUE x, y; { VALUE z; if (FIXNUM_P(y)) y = int2big(FIX2INT(y)); else { Check_Type(y, T_BIGNUM); } bigdivmod(x, y, &z, Qnil); return z; } static VALUE Fbig_mod(x, y) VALUE x, y; { VALUE z; if (FIXNUM_P(y)) y = int2big(FIX2INT(y)); else { Check_Type(y, T_BIGNUM); } bigdivmod(x, y, Qnil, &z); return z; } static VALUE Fbig_divmod(x, y) VALUE x, y; { VALUE div, mod; if (FIXNUM_P(y)) y = int2big(FIX2INT(y)); else { Check_Type(y, T_BIGNUM); } bigdivmod(x, y, &div, &mod); return assoc_new(div, mod);; } VALUE Fbig_pow(x, y) VALUE x, y; { double d1, d2; VALUE z; int n; if (TYPE(y) == T_FLOAT) { return float_new(pow(big2dbl(x), RFLOAT(y)->value)); } n = NUM2INT(y); if (n == 0) return INT2FIX(1); if (n < 0) { return float_new(pow(big2dbl(x), (double)n)); } z = x; while (--n) { while (!(n % 2)) { n = n /2; x = Fbig_mul(x, x); } z = Fbig_mul(z, x); } return z; } VALUE Fbig_and(x, y) struct RBignum *x, *y; { VALUE z; USHORT *ds1, *ds2, *zds; UINT i, l1, l2; char sign; if (FIXNUM_P(y)) { y = (struct RBignum*)int2big(FIX2INT(y)); } else { Check_Type(y, T_BIGNUM); } if (!y->sign) { y = (struct RBignum*)big_clone(y); big_2comp(y); } if (!x->sign) { x = (struct RBignum*)big_clone(x); big_2comp(x); } if (x->len > y->len) { l1 = y->len; l2 = x->len; ds1 = BDIGITS(y); ds2 = BDIGITS(x); sign = y->sign; } else { l1 = x->len; l2 = y->len; ds1 = BDIGITS(x); ds2 = BDIGITS(y); sign = x->sign; } z = bignew(l2, x->sign && y->sign); zds = BDIGITS(z); for (i=0; isign) big_2comp(z); return bignorm(z); } VALUE Fbig_or(x, y) struct RBignum *x, *y; { VALUE z; USHORT *ds1, *ds2, *zds; UINT i, l1, l2; char sign; if (FIXNUM_P(y)) { y = (struct RBignum*)int2big(FIX2INT(y)); } else { Check_Type(y, T_BIGNUM); } if (!y->sign) { y = (struct RBignum*)big_clone(y); big_2comp(y); } if (!x->sign) { x = (struct RBignum*)big_clone(x); big_2comp(x); } if (x->len > y->len) { l1 = y->len; l2 = x->len; ds1 = BDIGITS(y); ds2 = BDIGITS(x); sign = y->sign; } else { l1 = x->len; l2 = y->len; ds1 = BDIGITS(x); ds2 = BDIGITS(y); sign = x->sign; } z = bignew(l2, x->sign || y->sign); zds = BDIGITS(z); for (i=0; isign) big_2comp(z); return bignorm(z); } VALUE Fbig_xor(x, y) struct RBignum *x, *y; { VALUE z; USHORT *ds1, *ds2, *zds; UINT i, l1, l2; char sign; if (FIXNUM_P(y)) { y = (struct RBignum*)int2big(FIX2INT(y)); } else { Check_Type(y, T_BIGNUM); } if (!y->sign) { y = (struct RBignum*)big_clone(y); big_2comp(y); } if (!x->sign) { x = (struct RBignum*)big_clone(x); big_2comp(x); } if (x->len > y->len) { l1 = y->len; l2 = x->len; ds1 = BDIGITS(y); ds2 = BDIGITS(x); sign = y->sign; } else { l1 = x->len; l2 = y->len; ds1 = BDIGITS(x); ds2 = BDIGITS(y); sign = x->sign; } x->sign = x->sign?1:0; y->sign = y->sign?1:0; z = bignew(l2, !(x->sign ^ y->sign)); zds = BDIGITS(z); for (i=0; isign) big_2comp(z); return bignorm(z); } static VALUE Fbig_neg(x) struct RBignum *x; { VALUE z = big_clone(x); UINT i = x->len; USHORT *ds = BDIGITS(z); if (!x->sign) big_2comp(z); while (i--) ds[i] = ~ds[i]; if (x->sign) big_2comp(z); RBIGNUM(z)->sign = !RBIGNUM(z)->sign; return bignorm(z); } static VALUE Fbig_rshift(); VALUE Fbig_lshift(x, y) struct RBignum *x; VALUE y; { USHORT *xds, *zds; UINT shift = NUM2INT(y); UINT s1 = shift/(sizeof(USHORT)*CHAR_BIT); UINT s2 = shift%(sizeof(USHORT)*CHAR_BIT); VALUE z; unsigned long num = 0; UINT len, i; if (shift < 0) return Fbig_rshift(x, INT2FIX(-shift)); xds = BDIGITS(x); len = x->len; z = bignew(len+s1+1, x->sign); zds = BDIGITS(z); for (i=0; ilen, j; if (shift < 0) return Fbig_lshift(x, INT2FIX(-shift)); if (s1 > x->len) { if (x->sign) return INT2FIX(0); else return INT2FIX(-1); } xds = BDIGITS(x); i = x->len; j = i - s1; z = bignew(j, x->sign); zds = BDIGITS(z); while (i--, j--) { num = (num | xds[i]) >> s2; zds[j] = BIGLO(num); num = BIGUP(xds[i]); } return bignorm(z); } static VALUE Fbig_aref(x, y) struct RBignum *x; VALUE y; { USHORT *xds; int shift = NUM2INT(y); UINT s1, s2; if (shift < 0) return INT2FIX(0); s1 = shift/(sizeof(USHORT)*CHAR_BIT); s2 = shift%(sizeof(USHORT)*CHAR_BIT); if (!x->sign) { if (s1 >= x->len) return INT2FIX(1); x = (struct RBignum*)big_clone(x); big_2comp(x); } else { if (s1 >= x->len) return INT2FIX(0); } xds = BDIGITS(x); if (xds[s1] & (1<len; Check_Type(x, T_BIGNUM); if (x->sign > y->sign) return INT2FIX(1); if (x->sign < y->sign) return INT2FIX(-1); if (xlen < y->len) return (x->sign) ? INT2FIX(-1) : INT2FIX(1); if (xlen > y->len) return (x->sign) ? INT2FIX(1) : INT2FIX(-1); while(xlen-- && (BDIGITS(x)[xlen]==BDIGITS(y)[xlen])); if (-1 == xlen) return INT2FIX(0); return (BDIGITS(x)[xlen] < BDIGITS(y)[xlen]) ? (x->sign ? INT2FIX(1) : INT2FIX(-1)) : (x->sign ? INT2FIX(-1) : INT2FIX(1)); } static VALUE Fbig_hash(x) struct RBignum *x; { int i, len, key; USHORT *digits; key = 0; digits = BDIGITS(x); for (i=0,len=x->len; ilen; i++) { key ^= *digits++; } return INT2FIX(key); } static VALUE Fbig_coerce(x, y) struct RBignum *x; VALUE y; { if (FIXNUM_P(y)) { return int2big(FIX2INT(y)); } else { Fail("can't coerce %s to Bignum", rb_class2name(CLASS_OF(y))); } /* not reached */ return Qnil; } static VALUE Fbig_abs(x) struct RBignum *x; { if (!x->sign) { x = (struct RBignum*)big_clone(x); x->sign = 1; } return (VALUE)x; } Init_Bignum() { C_Bignum = rb_define_class("Bignum", C_Integer); rb_define_single_method(C_Bignum, "new", Sbig_new, 1); rb_define_method(C_Bignum, "to_s", Fbig_to_s, 0); rb_define_method(C_Bignum, "coerce", Fbig_coerce, 1); rb_define_method(C_Bignum, "-@", Fbig_uminus, 0); rb_define_method(C_Bignum, "+", Fbig_plus, 1); rb_define_method(C_Bignum, "-", Fbig_minus, 1); rb_define_method(C_Bignum, "*", Fbig_mul, 1); rb_define_method(C_Bignum, "/", Fbig_div, 1); rb_define_method(C_Bignum, "%", Fbig_mod, 1); rb_define_method(C_Bignum, "divmod", Fbig_divmod, 1); rb_define_method(C_Bignum, "**", Fbig_pow, 1); rb_define_method(C_Bignum, "&", Fbig_and, 1); rb_define_method(C_Bignum, "|", Fbig_or, 1); rb_define_method(C_Bignum, "^", Fbig_xor, 1); rb_define_method(C_Bignum, "~", Fbig_neg, 0); rb_define_method(C_Bignum, "<<", Fbig_lshift, 1); rb_define_method(C_Bignum, ">>", Fbig_rshift, 1); rb_define_method(C_Bignum, "[]", Fbig_aref, 1); rb_define_method(C_Bignum, "<=>", Fbig_cmp, 1); rb_define_method(C_Bignum, "hash", Fbig_hash, 0); rb_define_method(C_Bignum, "to_i", Fbig_to_i, 0); rb_define_method(C_Bignum, "to_f", Fbig_to_f, 0); rb_define_method(C_Bignum, "abs_f", Fbig_abs, 0); } ./ruby-0.64/class.c100644 150 1 15561 5704462331 12464 0ustar matzdaemon/************************************************ class.c - $Author: matz $ $Date: 1995/01/10 10:42:21 $ created at: Tue Aug 10 15:05:44 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "env.h" #include "node.h" #include "st.h" struct st_table *new_idhash(); extern VALUE C_Class; extern VALUE C_Module; VALUE class_new(super) struct RClass *super; { NEWOBJ(cls, struct RClass); OBJSETUP(cls, C_Class, T_CLASS); cls->super = super; cls->m_tbl = new_idhash(); cls->c_tbl = Qnil; return (VALUE)cls; } VALUE single_class_new(super) struct RClass *super; { struct RClass *cls = (struct RClass*)class_new(super); FL_SET(cls, FL_SINGLE); return (VALUE)cls; } static int clone_method(mid, body, tbl) ID mid; NODE *body; st_table *tbl; { st_insert(tbl, mid, NEW_METHOD(body->nd_body, body->nd_noex)); return ST_CONTINUE; } VALUE single_class_clone(class) struct RClass *class; { if (!FL_TEST(class, FL_SINGLE)) return (VALUE)class; else { /* copy single(unnamed) class */ NEWOBJ(clone, struct RClass); CLONESETUP(clone, class); clone->super = class->super; clone->m_tbl = new_idhash(); st_foreach(class->m_tbl, clone_method, clone->m_tbl); clone->c_tbl = Qnil; FL_SET(clone, FL_SINGLE); return (VALUE)clone; } } VALUE rb_define_class_id(id, super) ID id; struct RBasic *super; { struct RClass *cls = (struct RClass*)class_new(super); rb_name_class(cls, id); /* make metaclass */ RBASIC(cls)->class = single_class_new(super?super->class:C_Class); return (VALUE)cls; } VALUE rb_define_class(name, super) char *name; VALUE super; { return rb_define_class_id(rb_intern(name), super); } VALUE module_new() { NEWOBJ(mdl, struct RClass); OBJSETUP(mdl, C_Module, T_MODULE); mdl->super = Qnil; mdl->m_tbl = new_idhash(); mdl->c_tbl = Qnil; return (VALUE)mdl; } VALUE rb_define_module_id(id) ID id; { struct RClass *mdl = (struct RClass*)module_new(); rb_name_class(mdl, id); return (VALUE)mdl; } VALUE rb_define_module(name) char *name; { return rb_define_module_id(rb_intern(name)); } static struct RClass * include_class_new(module, super) struct RClass *module, *super; { struct RClass *p; NEWOBJ(cls, struct RClass); OBJSETUP(cls, C_Class, T_ICLASS); cls->m_tbl = module->m_tbl; cls->c_tbl = module->c_tbl; cls->super = super; if (TYPE(module) == T_ICLASS) { RBASIC(cls)->class = RBASIC(module)->class; } else { RBASIC(cls)->class = (VALUE)module; } return cls; } void rb_include_module(class, module) struct RClass *class, *module; { struct RClass *p; int added = FALSE; Check_Type(module, T_MODULE); while (module) { /* ignore if module included already in superclasses */ for (p = class->super; p; p = p->super) { if (BUILTIN_TYPE(p) == T_ICLASS && p->m_tbl == module->m_tbl) goto ignore_module; } class->super = include_class_new(module, class->super); added = TRUE; class = class->super; ignore_module: module = module->super; } if (added) { rb_clear_cache2(class); } } void rb_add_method(class, mid, node, noex) struct RClass *class; ID mid; NODE *node; int noex; { NODE *body; if (class == Qnil) class = (struct RClass*)C_Object; if (st_lookup(class->m_tbl, mid, &body)) { if (verbose) { Warning("redefine %s", rb_id2name(mid)); } rb_clear_cache(body); } body = NEW_METHOD(node, noex); st_insert(class->m_tbl, mid, body); } void rb_define_method(class, name, func, argc) struct RClass *class; char *name; VALUE (*func)(); int argc; { rb_add_method(class, rb_intern(name), NEW_CFUNC(func, argc), 0); } void rb_undef_method(class, name) struct RClass *class; char *name; { rb_add_method(class, rb_intern(name), Qnil, 0); } void rb_define_private_method(class, name, func, argc) struct RClass *class; char *name; VALUE (*func)(); int argc; { rb_add_method(class, rb_intern(name), NEW_CFUNC(func, argc), 1); } VALUE rb_single_class(obj) struct RBasic *obj; { switch (TYPE(obj)) { case T_OBJECT: case T_CLASS: case T_MODULE: case T_STRUCT: break; default: Fail("can't define single method for built-in class"); break; } if (FL_TEST(obj->class, FL_SINGLE)) { return (VALUE)obj->class; } return obj->class = single_class_new(obj->class); } void rb_define_single_method(obj, name, func, argc) VALUE obj; char *name; VALUE (*func)(); int argc; { rb_define_method(rb_single_class(obj), name, func, argc); } void rb_define_module_function(module, name, func, argc) VALUE module; char *name; VALUE (*func)(); int argc; { rb_define_private_method(module, name, func, argc); rb_define_single_method(module, name, func, argc); } void rb_define_alias(class, name1, name2) struct RClass *class; char *name1, *name2; { rb_alias(class, rb_intern(name1), rb_intern(name2)); } void rb_define_attr(class, name, pub) struct RClass *class; char *name; int pub; { char *buf; ID attr, attreq, attriv; attr = rb_intern(name); buf = ALLOCA_N(char,strlen(name)+2); sprintf(buf, "%s=", name); attreq = rb_intern(buf); sprintf(buf, "@%s", name); attriv = rb_intern(buf); if (rb_method_boundp(class, attr) == Qnil) { rb_add_method(class, attr, NEW_IVAR(attriv), 0); } if (pub && rb_method_boundp(class, attreq) == Qnil) { rb_add_method(class, attreq, NEW_ATTRSET(attriv), 0); } } void rb_define_single_attr(obj, name, pub) VALUE obj; char *name; int pub; { rb_define_attr(rb_single_class(obj), name, pub); } #include #include int rb_scan_args(argc, argv, fmt, va_alist) int argc; VALUE *argv; char *fmt; va_dcl { int n, i; char *p = fmt; VALUE *var; va_list vargs; va_start(vargs); if (*p == '*') { var = va_arg(vargs, VALUE*); *var = ary_new4(argc, argv); return argc; } if (isdigit(*p)) { n = *p - '0'; if (n > argc) Fail("Wrong number of arguments (%d for %d)", argc, n); for (i=0; i i) { *var = argv[i]; } else { *var = Qnil; } } p++; } if(*p == '*') { var = va_arg(vargs, VALUE*); if (argc > i) { *var = ary_new4(argc-i, argv+i); } else { *var = ary_new(); } } else if (*p == '\0') { if (argc > i) { Fail("Wrong # of arguments(%d for %d)", argc, i); } } else { goto error; } va_end(vargs); return argc; error: Fail("bad scan arg format: %s", fmt); } ./ruby-0.64/compar.c100644 150 1 3377 5674170241 12624 0ustar matzdaemon/************************************************ compar.c - $Author: matz $ $Date: 1994/10/14 06:19:05 $ created at: Thu Aug 26 14:39:48 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" VALUE M_Comparable; static ID cmp; static VALUE Fcmp_eq(x, y) VALUE x, y; { VALUE c = rb_funcall(x, cmp, 1, y); int t = NUM2INT(c); if (t == 0) return TRUE; return FALSE; } static VALUE Fcmp_gt(x, y) VALUE x, y; { VALUE c = rb_funcall(x, cmp, 1, y); int t = NUM2INT(c); if (t > 0) return y; return FALSE; } static VALUE Fcmp_ge(x, y) VALUE x, y; { VALUE c = rb_funcall(x, cmp, 1, y); int t = NUM2INT(c); if (t >= 0) return y; return FALSE; } static VALUE Fcmp_lt(x, y) VALUE x, y; { VALUE c = rb_funcall(x, cmp, 1, y); int t = NUM2INT(c); if (t < 0) return y; return FALSE; } static VALUE Fcmp_le(x, y) VALUE x, y; { VALUE c = rb_funcall(x, cmp, 1, y); int t = NUM2INT(c); if (t <= 0) return y; return FALSE; } static VALUE Fcmp_between(x, min, max) VALUE x, min, max; { VALUE c = rb_funcall(x, cmp, 1, min); int t = NUM2INT(c); if (t < 0) return FALSE; c = rb_funcall(x, cmp, 1, min); t = NUM2INT(c); if (t > 0) return FALSE; return TRUE; } Init_Comparable() { M_Comparable = rb_define_module("Comparable"); rb_define_method(M_Comparable, "==", Fcmp_eq, 1); rb_define_method(M_Comparable, ">", Fcmp_gt, 1); rb_define_method(M_Comparable, ">=", Fcmp_ge, 1); rb_define_method(M_Comparable, "<", Fcmp_lt, 1); rb_define_method(M_Comparable, "<=", Fcmp_le, 1); rb_define_method(M_Comparable, "between", Fcmp_between, 2); cmp = rb_intern("<=>"); } ./ruby-0.64/configure100755 150 1 76366 5675456154 13151 0ustar matzdaemon#!/bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated automatically using autoconf. # Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. # Usage: configure [--srcdir=DIR] [--host=HOST] [--gas] [--nfp] # [--prefix=PREFIX] [--exec-prefix=PREFIX] [--with-PACKAGE[=VALUE]] # Ignores all args except --srcdir, --prefix, --exec-prefix, and # --with-PACKAGE[=VALUE] unless this script has special code to handle it. for arg do # Handle --exec-prefix with a space before the argument. if test x$next_exec_prefix = xyes; then exec_prefix=$arg; next_exec_prefix= # Handle --host with a space before the argument. elif test x$next_host = xyes; then next_host= # Handle --prefix with a space before the argument. elif test x$next_prefix = xyes; then prefix=$arg; next_prefix= # Handle --srcdir with a space before the argument. elif test x$next_srcdir = xyes; then srcdir=$arg; next_srcdir= else case $arg in # For backward compatibility, recognize -exec-prefix and --exec_prefix. -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* | --exec=* | --exe=* | --ex=* | --e=*) exec_prefix=`echo $arg | sed 's/[-a-z_]*=//'` ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- | --exec | --exe | --ex | --e) next_exec_prefix=yes ;; -gas | --gas | --ga | --g) ;; -host=* | --host=* | --hos=* | --ho=* | --h=*) ;; -host | --host | --hos | --ho | --h) next_host=yes ;; -nfp | --nfp | --nf) ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=`echo $arg | sed 's/[-a-z_]*=//'` ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) next_prefix=yes ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=* | --s=*) srcdir=`echo $arg | sed 's/[-a-z_]*=//'` ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr | --s) next_srcdir=yes ;; -with-* | --with-*) package=`echo $arg|sed -e 's/-*with-//' -e 's/=.*//'` # Reject names that aren't valid shell variable names. if test -n "`echo $package| sed 's/[-a-zA-Z0-9_]//g'`"; then echo "configure: $package: invalid package name" >&2; exit 1 fi package=`echo $package| sed 's/-/_/g'` case "$arg" in *=*) val="`echo $arg|sed 's/[^=]*=//'`" ;; *) val=1 ;; esac eval "with_$package='$val'" ;; -v | -verbose | --verbose | --verbos | --verbo | --verb | --ver | --ve | --v) verbose=yes ;; *) ;; esac fi done trap 'rm -fr conftest* confdefs* core; exit 1' 1 3 15 trap 'rm -f confdefs*' 0 # NLS nuisances. # These must not be set unconditionally because not all systems understand # e.g. LANG=C (notably SCO). if test "${LC_ALL+set}" = 'set' ; then LC_ALL=C; export LC_ALL; fi if test "${LANG+set}" = 'set' ; then LANG=C; export LANG; fi rm -f conftest* confdefs.h # AIX cpp loses on an empty file, so make sure it contains at least a newline. echo > confdefs.h compile='${CC-cc} $CFLAGS conftest.c -o conftest $LIBS >/dev/null 2>&1' # A filename unique to this package, relative to the directory that # configure is in, which we can look for to find out if srcdir is correct. unique_file=ruby.h # Find the source files, if location was not specified. if test -z "$srcdir"; then srcdirdefaulted=yes # Try the directory containing this script, then `..'. prog=$0 confdir=`echo $prog|sed 's%/[^/][^/]*$%%'` test "X$confdir" = "X$prog" && confdir=. srcdir=$confdir if test ! -r $srcdir/$unique_file; then srcdir=.. fi fi if test ! -r $srcdir/$unique_file; then if test x$srcdirdefaulted = xyes; then echo "configure: Can not find sources in \`${confdir}' or \`..'." 1>&2 else echo "configure: Can not find sources in \`${srcdir}'." 1>&2 fi exit 1 fi # Preserve a srcdir of `.' to avoid automounter screwups with pwd. # But we can't avoid them for `..', to make subdirectories work. case $srcdir in .|/*|~*) ;; *) srcdir=`cd $srcdir; pwd` ;; # Make relative path absolute. esac # Save the original args to write them into config.status later. configure_args="$*" PROGS="ruby" if test -z "$CC"; then # Extract the first word of `gcc', so it can be a program name with args. set dummy gcc; word=$2 echo checking for $word IFS="${IFS= }"; saveifs="$IFS"; IFS="${IFS}:" for dir in $PATH; do test -z "$dir" && dir=. if test -f $dir/$word; then CC="gcc" break fi done IFS="$saveifs" fi test -z "$CC" && CC="cc" test -n "$CC" && test -n "$verbose" && echo " setting CC to $CC" # Find out if we are using GNU C, under whatever name. cat > conftest.c < conftest.out 2>&1 if egrep yes conftest.out >/dev/null 2>&1; then GCC=1 # For later tests. fi rm -f conftest* echo checking how to run the C preprocessor if test -z "$CPP"; then # This must be in double quotes, not single quotes, because CPP may get # substituted into the Makefile and ``${CC-cc}'' will simply confuse # make. It must be expanded now. CPP="${CC-cc} -E" cat > conftest.c < Syntax Error EOF err=`eval "($CPP conftest.c >/dev/null) 2>&1"` if test -z "$err"; then : else rm -rf conftest* CPP=/lib/cpp fi rm -f conftest* fi test ".${verbose}" != "." && echo " setting CPP to $CPP" if test -n "$GCC"; then echo checking whether -traditional is needed pattern="Autoconf.*'x'" prog='#include Autoconf TIOCGETP' cat > conftest.c < conftest.out 2>&1" if egrep "$pattern" conftest.out >/dev/null 2>&1; then rm -rf conftest* need_trad=1 fi rm -f conftest* if test -z "$need_trad"; then prog='#include Autoconf TCGETA' cat > conftest.c < conftest.out 2>&1" if egrep "$pattern" conftest.out >/dev/null 2>&1; then rm -rf conftest* need_trad=1 fi rm -f conftest* fi test -n "$need_trad" && CC="$CC -traditional" fi if test "$HOSTTYPE" = sparc; then if test "$GCC" = 1 ; then STATIC=-static else STATIC=-Bstatic fi else STATIC= fi for p in 'bison -y' byacc do if test -z "$YACC"; then # Extract the first word of `$p', so it can be a program name with args. set dummy $p; word=$2 echo checking for $word IFS="${IFS= }"; saveifs="$IFS"; IFS="${IFS}:" for dir in $PATH; do test -z "$dir" && dir=. if test -f $dir/$word; then YACC="$p" break fi done IFS="$saveifs" fi test -n "$YACC" && test -n "$verbose" && echo " setting YACC to $YACC" test -n "$YACC" && break done test -n "$YACC" || YACC="yacc" # Make sure to not get the incompatible SysV /etc/install and # /usr/sbin/install, which might be in PATH before a BSD-like install, # or the SunOS /usr/etc/install directory, or the AIX /bin/install, # or the AFS install, which mishandles nonexistent args, or # /usr/ucb/install on SVR4, which tries to use the nonexistent group # `staff'. On most BSDish systems install is in /usr/bin, not /usr/ucb # anyway. Sigh. if test "z${INSTALL}" = "z" ; then echo checking for install IFS="${IFS= }"; saveifs="$IFS"; IFS="${IFS}:" for dir in $PATH; do test -z "$dir" && dir=. case $dir in /etc|/usr/sbin|/usr/etc|/usr/afsws/bin|/usr/ucb) ;; *) if test -f $dir/installbsd; then INSTALL="$dir/installbsd -c" # OSF1 INSTALL_PROGRAM='$(INSTALL)' INSTALL_DATA='$(INSTALL) -m 644' break fi if test -f $dir/install; then if grep dspmsg $dir/install >/dev/null 2>&1; then : # AIX else INSTALL="$dir/install -c" INSTALL_PROGRAM='$(INSTALL)' INSTALL_DATA='$(INSTALL) -m 644' break fi fi ;; esac done IFS="$saveifs" fi INSTALL=${INSTALL-cp} test -n "$verbose" && echo " setting INSTALL to $INSTALL" INSTALL_PROGRAM=${INSTALL_PROGRAM-'$(INSTALL)'} test -n "$verbose" && echo " setting INSTALL_PROGRAM to $INSTALL_PROGRAM" INSTALL_DATA=${INSTALL_DATA-'$(INSTALL)'} test -n "$verbose" && echo " setting INSTALL_DATA to $INSTALL_DATA" for hdr in unistd.h stdlib.h syscall.h a.out.h dirent.h\ string.h strings.h do trhdr=HAVE_`echo $hdr | tr '[a-z]./' '[A-Z]__'` echo checking for ${hdr} cat > conftest.c < EOF err=`eval "($CPP conftest.c >/dev/null) 2>&1"` if test -z "$err"; then rm -rf conftest* { test -n "$verbose" && \ echo " defining ${trhdr}" echo "#define" ${trhdr} 1 >> confdefs.h DEFS="$DEFS -D${trhdr}=1" } fi rm -f conftest* done echo checking for directory library header dirheader= if test -z "$dirheader"; then echo checking for dirent.h cat > conftest.c < #include int main() { exit(0); } int t() { DIR *dirp = 0; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining DIRENT" echo "#define" DIRENT 1 >> confdefs.h DEFS="$DEFS -DDIRENT=1" } dirheader=dirent.h fi rm -f conftest* fi if test -z "$dirheader"; then echo checking for sys/ndir.h cat > conftest.c < #include int main() { exit(0); } int t() { DIR *dirp = 0; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining SYSNDIR" echo "#define" SYSNDIR 1 >> confdefs.h DEFS="$DEFS -DSYSNDIR=1" } dirheader=sys/ndir.h fi rm -f conftest* fi if test -z "$dirheader"; then echo checking for sys/dir.h cat > conftest.c < #include int main() { exit(0); } int t() { DIR *dirp = 0; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining SYSDIR" echo "#define" SYSDIR 1 >> confdefs.h DEFS="$DEFS -DSYSDIR=1" } dirheader=sys/dir.h fi rm -f conftest* fi if test -z "$dirheader"; then echo checking for ndir.h cat > conftest.c < #include int main() { exit(0); } int t() { DIR *dirp = 0; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining NDIR" echo "#define" NDIR 1 >> confdefs.h DEFS="$DEFS -DNDIR=1" } dirheader=ndir.h fi rm -f conftest* fi echo checking for closedir return value cat > conftest.c < #include <$dirheader> int closedir(); main() { exit(closedir(opendir(".")) != 0); } EOF eval $compile if test -s conftest && (./conftest; exit) 2>/dev/null; then : else { test -n "$verbose" && \ echo " defining VOID_CLOSEDIR" echo "#define" VOID_CLOSEDIR 1 >> confdefs.h DEFS="$DEFS -DVOID_CLOSEDIR=1" } fi rm -fr conftest* echo checking for uid_t in sys/types.h echo '#include "confdefs.h" #include ' > conftest.c eval "$CPP conftest.c > conftest.out 2>&1" if egrep "uid_t" conftest.out >/dev/null 2>&1; then : else rm -rf conftest* { test -n "$verbose" && \ echo " defining" uid_t to be int echo "#define" uid_t int >> confdefs.h DEFS="$DEFS -Duid_t=int" } { test -n "$verbose" && \ echo " defining" gid_t to be int echo "#define" gid_t int >> confdefs.h DEFS="$DEFS -Dgid_t=int" } fi rm -f conftest* echo checking for type of array argument to getgroups prog='/* Thanks to Mike Rendell for this test. */ #include #define NGID 256 #undef MAX #define MAX(x,y) ((x) > (y) ? (x) : (y)) main() { gid_t gidset[NGID]; int i, n; union { gid_t gval; long lval; } val; val.lval = -1; for (i = 0; i < NGID; i++) gidset[i] = val.gval; n = getgroups (sizeof (gidset) / MAX (sizeof (int), sizeof (gid_t)) - 1, gidset); /* Exit non-zero if getgroups seems to require an array of ints. This happens when gid_t is short but getgroups modifies an array of ints. */ exit ((n > 0 && gidset[n] != val.gval) ? 1 : 0); }' cat > conftest.c </dev/null; then { test -n "$verbose" && \ echo " defining" GETGROUPS_T to be gid_t echo "#define" GETGROUPS_T gid_t >> confdefs.h DEFS="$DEFS -DGETGROUPS_T=gid_t" } else { test -n "$verbose" && \ echo " defining" GETGROUPS_T to be int echo "#define" GETGROUPS_T int >> confdefs.h DEFS="$DEFS -DGETGROUPS_T=int" } fi rm -fr conftest* echo checking for return type of signal handlers cat > conftest.c < #include #ifdef signal #undef signal #endif extern void (*signal ()) (); int main() { exit(0); } int t() { int i; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining" RETSIGTYPE to be void echo "#define" RETSIGTYPE void >> confdefs.h DEFS="$DEFS -DRETSIGTYPE=void" } else rm -rf conftest* { test -n "$verbose" && \ echo " defining" RETSIGTYPE to be int echo "#define" RETSIGTYPE int >> confdefs.h DEFS="$DEFS -DRETSIGTYPE=int" } fi rm -f conftest* LIBS_save="${LIBS}" LIBS="${LIBS} -lm" have_lib="" echo checking for -lm cat > conftest.c < conftest.c < conftest.c < conftest.c < conftest.c < int main() { exit(0); } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_${func}) || defined (__stub___${func}) choke me #else /* Override any gcc2 internal prototype to avoid an error. */ extern char ${func}(); ${func}(); #endif } EOF if eval $compile; then : else rm -rf conftest* LIBOBJS="$LIBOBJS ${func}.o" test -n "$verbose" && echo " using ${func}.o instead" fi rm -f conftest* done for func in fmod killpg socket random wait4 waitpid syscall getcwd\ setruid seteuid setreuid setrgid setegid setregid\ getpriority sigprocmask do trfunc=HAVE_`echo $func | tr '[a-z]' '[A-Z]'` echo checking for ${func} cat > conftest.c < int main() { exit(0); } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_${func}) || defined (__stub___${func}) choke me #else /* Override any gcc2 internal prototype to avoid an error. */ extern char ${func}(); ${func}(); #endif } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining ${trfunc}" echo "#define" ${trfunc} 1 >> confdefs.h DEFS="$DEFS -D${trfunc}=1" } fi rm -f conftest* done echo checking for setenv cat > conftest.c < int main() { exit(0); } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_setenv) || defined (__stub___setenv) choke me #else /* Override any gcc2 internal prototype to avoid an error. */ extern char setenv(); setenv(); #endif } EOF if eval $compile; then : else rm -rf conftest* for func in putenv do trfunc=HAVE_`echo $func | tr 'a-z' 'A-Z'` echo checking for ${func} cat > conftest.c < int main() { exit(0); } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_${func}) || defined (__stub___${func}) choke me #else /* Override any gcc2 internal prototype to avoid an error. */ extern char ${func}(); ${func}(); #endif } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining ${trfunc}" echo "#define" ${trfunc} 1 >> confdefs.h DEFS="$DEFS -D${trfunc}=1" } fi rm -f conftest* done fi rm -f conftest* case "$LIBOBJS" in *) ;; *strftime*) echo checking for struct tm in time.h cat > conftest.c < #include int main() { exit(0); } int t() { struct tm *tp; tp->tm_sec; } EOF if eval $compile; then : else rm -rf conftest* { test -n "$verbose" && \ echo " defining TM_IN_SYS_TIME" echo "#define" TM_IN_SYS_TIME 1 >> confdefs.h DEFS="$DEFS -DTM_IN_SYS_TIME=1" } fi rm -f conftest* decl='#include ' case "$DEFS" in *TM_IN_SYS_TIME*) decl="$decl #include " ;; *) decl="$decl #include " ;; esac echo checking for tm_zone in struct tm cat > conftest.c <> confdefs.h DEFS="$DEFS -DHAVE_TM_ZONE=1" } else rm -rf conftest* no_tm_zone=1 fi rm -f conftest* if test -n "$no_tm_zone"; then echo checking for tzname cat > conftest.c < #ifndef tzname /* For SGI. */ extern char *tzname[]; /* RS6000 and others want it this way. */ #endif int main() { exit(0); } int t() { atoi(*tzname); } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining HAVE_TZNAME" echo "#define" HAVE_TZNAME 1 >> confdefs.h DEFS="$DEFS -DHAVE_TZNAME=1" } fi rm -f conftest* fi echo checking for daylight cat > conftest.c <> confdefs.h DEFS="$DEFS -DHAVE_DAYLIGHT=1" } fi rm -f conftest* ;; esac # The Ultrix 4.2 mips builtin alloca declared by alloca.h only works # for constant arguments. Useless! echo checking for working alloca.h cat > conftest.c < int main() { exit(0); } int t() { char *p = alloca(2 * sizeof(int)); } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining HAVE_ALLOCA_H" echo "#define" HAVE_ALLOCA_H 1 >> confdefs.h DEFS="$DEFS -DHAVE_ALLOCA_H=1" } fi rm -f conftest* decl="#ifdef __GNUC__ #define alloca __builtin_alloca #else #if HAVE_ALLOCA_H #include #else #ifdef _AIX #pragma alloca #else char *alloca (); #endif #endif #endif " echo checking for alloca cat > conftest.c < conftest.c < conftest.out 2>&1" if egrep "winnitude" conftest.out >/dev/null 2>&1; then rm -rf conftest* echo checking for _getb67 cat > conftest.c < int main() { exit(0); } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub__getb67) || defined (__stub____getb67) choke me #else /* Override any gcc2 internal prototype to avoid an error. */ extern char _getb67(); _getb67(); #endif } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining" CRAY_STACKSEG_END to be _getb67 echo "#define" CRAY_STACKSEG_END _getb67 >> confdefs.h DEFS="$DEFS -DCRAY_STACKSEG_END=_getb67" } else rm -rf conftest* echo checking for GETB67 cat > conftest.c < int main() { exit(0); } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_GETB67) || defined (__stub___GETB67) choke me #else /* Override any gcc2 internal prototype to avoid an error. */ extern char GETB67(); GETB67(); #endif } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining" CRAY_STACKSEG_END to be GETB67 echo "#define" CRAY_STACKSEG_END GETB67 >> confdefs.h DEFS="$DEFS -DCRAY_STACKSEG_END=GETB67" } else rm -rf conftest* echo checking for getb67 cat > conftest.c < int main() { exit(0); } int t() { /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined (__stub_getb67) || defined (__stub___getb67) choke me #else /* Override any gcc2 internal prototype to avoid an error. */ extern char getb67(); getb67(); #endif } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining" CRAY_STACKSEG_END to be getb67 echo "#define" CRAY_STACKSEG_END getb67 >> confdefs.h DEFS="$DEFS -DCRAY_STACKSEG_END=getb67" } fi rm -f conftest* fi rm -f conftest* fi rm -f conftest* fi rm -f conftest* fi rm -f conftest* if test -n "$alloca_missing"; then # The SVR3 libPW and SVR4 libucb both contain incompatible functions # that cause trouble. Some versions do not even contain alloca or # contain a buggy version. If you still want to use their alloca, # use ar to extract alloca.o from them instead of compiling alloca.c. ALLOCA=alloca.o { test -n "$verbose" && \ echo " defining C_ALLOCA" echo "#define" C_ALLOCA 1 >> confdefs.h DEFS="$DEFS -DC_ALLOCA=1" } echo 'checking stack direction for C alloca' echo checking whether cross-compiling # If we cannot run a trivial program, we must be cross compiling. cat > conftest.c </dev/null; then : else cross_compiling=1 fi rm -fr conftest* if test -n "$cross_compiling" then { test -n "$verbose" && \ echo " defining" STACK_DIRECTION to be 0 echo "#define" STACK_DIRECTION 0 >> confdefs.h DEFS="$DEFS -DSTACK_DIRECTION=0" } else cat > conftest.c < addr) ? 1 : -1; } main () { exit (find_stack_direction() < 0); } EOF eval $compile if test -s conftest && (./conftest; exit) 2>/dev/null; then { test -n "$verbose" && \ echo " defining" STACK_DIRECTION to be 1 echo "#define" STACK_DIRECTION 1 >> confdefs.h DEFS="$DEFS -DSTACK_DIRECTION=1" } else { test -n "$verbose" && \ echo " defining" STACK_DIRECTION to be -1 echo "#define" STACK_DIRECTION -1 >> confdefs.h DEFS="$DEFS -DSTACK_DIRECTION=-1" } fi fi rm -fr conftest* fi echo checking byte ordering cat > conftest.c </dev/null; then : else { test -n "$verbose" && \ echo " defining WORDS_BIGENDIAN" echo "#define" WORDS_BIGENDIAN 1 >> confdefs.h DEFS="$DEFS -DWORDS_BIGENDIAN=1" } fi rm -fr conftest* echo checking for st_blksize in struct stat cat > conftest.c < #include int main() { exit(0); } int t() { struct stat s; s.st_blksize; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining HAVE_ST_BLKSIZE" echo "#define" HAVE_ST_BLKSIZE 1 >> confdefs.h DEFS="$DEFS -DHAVE_ST_BLKSIZE=1" } fi rm -f conftest* echo checking for st_blocks in struct stat cat > conftest.c < #include int main() { exit(0); } int t() { struct stat s; s.st_blocks; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining HAVE_ST_BLOCKS" echo "#define" HAVE_ST_BLOCKS 1 >> confdefs.h DEFS="$DEFS -DHAVE_ST_BLOCKS=1" } else rm -rf conftest* LIBOBJS="$LIBOBJS fileblocks.o" fi rm -f conftest* echo checking for st_rdev in struct stat cat > conftest.c < #include int main() { exit(0); } int t() { struct stat s; s.st_rdev; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining HAVE_ST_RDEV" echo "#define" HAVE_ST_RDEV 1 >> confdefs.h DEFS="$DEFS -DHAVE_ST_RDEV=1" } fi rm -f conftest* echo checking for std stdio cat > conftest.c < int main() { exit(0); } int t() { stdin->_cnt > 0; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining STDSTDIO" echo "#define" STDSTDIO 1 >> confdefs.h DEFS="$DEFS -DSTDSTDIO=1" } fi rm -f conftest* echo checking for pw_change in struct passwd cat > conftest.c < int main() { exit(0); } int t() { struct passwd pw; pw.pw_change; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining PW_CHANGE" echo "#define" PW_CHANGE 1 >> confdefs.h DEFS="$DEFS -DPW_CHANGE=1" } fi rm -f conftest* echo checking for pw_quota in struct passwd cat > conftest.c < int main() { exit(0); } int t() { struct passwd pw; pw.pw_quota; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining PW_QUOTA" echo "#define" PW_QUOTA 1 >> confdefs.h DEFS="$DEFS -DPW_QUOTA=1" } fi rm -f conftest* echo checking for pw_age in struct passwd cat > conftest.c < int main() { exit(0); } int t() { struct passwd pw; pw.pw_age; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining PW_AGE" echo "#define" PW_AGE 1 >> confdefs.h DEFS="$DEFS -DPW_AGE=1" } fi rm -f conftest* echo checking for pw_class in struct passwd cat > conftest.c < int main() { exit(0); } int t() { struct passwd pw; pw.pw_class; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining PW_CLASSS" echo "#define" PW_CLASSS 1 >> confdefs.h DEFS="$DEFS -DPW_CLASSS=1" } fi rm -f conftest* echo checking for pw_comment in struct passwd cat > conftest.c < int main() { exit(0); } int t() { struct passwd pw; pw.pw_comment; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining PW_COMMENT" echo "#define" PW_COMMENT 1 >> confdefs.h DEFS="$DEFS -DPW_COMMENT=1" } fi rm -f conftest* echo checking for pw_expire in struct passwd cat > conftest.c < int main() { exit(0); } int t() { struct passwd pw; pw.pw_expire; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining PW_EXPIRE" echo "#define" PW_EXPIRE 1 >> confdefs.h DEFS="$DEFS -DPW_EXPIRE=1" } fi rm -f conftest* # Set default prefixes. if test -n "$prefix"; then test -z "$exec_prefix" && exec_prefix='${prefix}' prsub="s%^prefix\\([ ]*\\)=\\([ ]*\\).*$%prefix\\1=\\2$prefix%" fi if test -n "$exec_prefix"; then prsub="$prsub s%^exec_prefix\\([ ]*\\)=\\([ ]*\\).*$%exec_prefix\\1=\\2$exec_prefix%" fi # Quote sed substitution magic chars in DEFS. cat >conftest.def < config.status </dev/null | sed 1q`: # # $0 $configure_args for arg do case "\$arg" in -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) echo running \${CONFIG_SHELL-/bin/sh} $0 $configure_args exec \${CONFIG_SHELL-/bin/sh} $0 $configure_args ;; *) echo "Usage: config.status --recheck" 2>&1; exit 1 ;; esac done trap 'rm -f Makefile; exit 1' 1 3 15 PROGS='$PROGS' CC='$CC' CPP='$CPP' STATIC='$STATIC' YACC='$YACC' INSTALL='$INSTALL' INSTALL_PROGRAM='$INSTALL_PROGRAM' INSTALL_DATA='$INSTALL_DATA' LIBOBJS='$LIBOBJS' ALLOCA='$ALLOCA' LIBS='$LIBS' srcdir='$srcdir' DEFS='$DEFS' prefix='$prefix' exec_prefix='$exec_prefix' prsub='$prsub' extrasub='$extrasub' EOF cat >> config.status <<\EOF top_srcdir=$srcdir CONFIG_FILES=${CONFIG_FILES-"Makefile"} for file in .. ${CONFIG_FILES}; do if test "x$file" != x..; then srcdir=$top_srcdir # Remove last slash and all that follows it. Not all systems have dirname. dir=`echo $file|sed 's%/[^/][^/]*$%%'` if test "$dir" != "$file"; then test "$top_srcdir" != . && srcdir=$top_srcdir/$dir test ! -d $dir && mkdir $dir fi echo creating $file rm -f $file echo "# Generated automatically from `echo $file|sed 's|.*/||'`.in by configure." > $file sed -e " $prsub $extrasub s%@PROGS@%$PROGS%g s%@CC@%$CC%g s%@CPP@%$CPP%g s%@STATIC@%$STATIC%g s%@YACC@%$YACC%g s%@INSTALL@%$INSTALL%g s%@INSTALL_PROGRAM@%$INSTALL_PROGRAM%g s%@INSTALL_DATA@%$INSTALL_DATA%g s%@LIBOBJS@%$LIBOBJS%g s%@ALLOCA@%$ALLOCA%g s%@LIBS@%$LIBS%g s%@srcdir@%$srcdir%g s%@DEFS@%$DEFS% " $top_srcdir/${file}.in >> $file fi; done exit 0 EOF chmod +x config.status ${CONFIG_SHELL-/bin/sh} config.status mv confdefs.h config.h ./ruby-0.64/configure.in100644 150 1 3766 5704462332 13511 0ustar matzdaemondnl Process this file with autoconf to produce a configure script. AC_INIT(ruby.h) PROGS="ruby" AC_SUBST(PROGS)dnl AC_PROG_CC AC_GCC_TRADITIONAL if test "$HOSTTYPE" = sparc; then if test "$GCC" = 1 ; then STATIC=-static else STATIC=-Bstatic fi else STATIC= fi AC_SUBST(STATIC)dnl AC_PROG_YACC AC_PROG_INSTALL AC_HAVE_HEADERS(unistd.h stdlib.h syscall.h a.out.h dirent.h\ string.h strings.h) AC_DIR_HEADER AC_GETGROUPS_T AC_RETSIGTYPE AC_HAVE_LIBRARY(m, [LIBS="$LIBS -lm"]) AC_HAVE_LIBRARY(dbm, [LIBS="$LIBS -ldbm"]) AC_HAVE_LIBRARY(socket, [LIBS="$LIBS -lsocket"]) AC_HAVE_LIBRARY(crypt, [LIBS="$LIBS -lcrypt"]) AC_VFORK AC_REPLACE_FUNCS(memmove mkdir strerror strftime\ strstr strtol strtoul strdup) AC_HAVE_FUNCS(fmod killpg socket random wait4 waitpid syscall getcwd\ setruid seteuid setreuid setrgid setegid setregid\ getpriority sigprocmask) AC_FUNC_CHECK(setenv, [], AC_HAVE_FUNCS(putenv)) case "$LIBOBJS" in *) ;; *strftime*) AC_TIMEZONE AC_COMPILE_CHECK([daylight], [], [extern int daylight; int i = daylight;], AC_DEFINE(HAVE_DAYLIGHT));; esac AC_ALLOCA AC_WORDS_BIGENDIAN AC_ST_BLKSIZE AC_ST_BLOCKS AC_ST_RDEV AC_COMPILE_CHECK([std stdio], [#include ], [stdin->_cnt > 0;], AC_DEFINE(STDSTDIO)) AC_COMPILE_CHECK([pw_change in struct passwd], [#include ], [struct passwd pw; pw.pw_change;], AC_DEFINE(PW_CHANGE)) AC_COMPILE_CHECK([pw_quota in struct passwd], [#include ], [struct passwd pw; pw.pw_quota;], AC_DEFINE(PW_QUOTA)) AC_COMPILE_CHECK([pw_age in struct passwd], [#include ], [struct passwd pw; pw.pw_age;], AC_DEFINE(PW_AGE)) AC_COMPILE_CHECK([pw_class in struct passwd], [#include ], [struct passwd pw; pw.pw_class;], AC_DEFINE(PW_CLASSS)) AC_COMPILE_CHECK([pw_comment in struct passwd], [#include ], [struct passwd pw; pw.pw_comment;], AC_DEFINE(PW_COMMENT)) AC_COMPILE_CHECK([pw_expire in struct passwd], [#include ], [struct passwd pw; pw.pw_expire;], AC_DEFINE(PW_EXPIRE)) AC_OUTPUT(Makefile) mv confdefs.h config.h ./ruby-0.64/cons.c100644 150 1 11647 5704457740 12332 0ustar matzdaemon/************************************************ cons.c - $Author: matz $ $Date: 1995/01/10 10:22:24 $ created at: Fri Jan 6 10:10:36 JST 1995 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" VALUE C_Cons; static ID eq; VALUE rb_to_a(); VALUE assoc_new(car, cdr) VALUE car, cdr; { NEWOBJ(cons, struct RCons); OBJSETUP(cons, C_Cons, T_CONS); cons->car = car; cons->cdr = cdr; return (VALUE)cons; } #define cons_new assoc_new static VALUE Fcons_car(cons) struct RCons *cons; { return cons->car; } static VALUE Fcons_cdr(cons) struct RCons *cons; { return cons->cdr; } static VALUE Fcons_set_car(cons, val) struct RCons *cons; VALUE val; { return cons->car = val; } static VALUE Fcons_set_cdr(cons, val) struct RCons *cons; VALUE val; { return cons->cdr = val; } static int cons_length(list) struct RCons *list; { int len = 1; while (TYPE(list) == T_CONS) { len++; list = RCONS(list->cdr); } return len; } static VALUE Fcons_length(list) struct RCons *list; { int len = cons_length(list); return INT2FIX(len); } static VALUE cons_aref(list, nth) struct RCons *list; int nth; { if (nth == 0) return list->car; list = RCONS(list->cdr); if (TYPE(list) != T_CONS) { if (nth == 1) return (VALUE)list; return Qnil; } return cons_aref(list, nth-1); } static VALUE Fcons_aref(list, nth) struct RCons *list; VALUE nth; { int n = NUM2INT(nth); if (n < 0) { n = cons_length(list)+n; if (n < 0) return Qnil; } return cons_aref(list, n); } static VALUE cons_aset(list, nth, val) struct RCons *list; int nth; VALUE val; { if (nth == 0) return list->car = val; if (TYPE(list->cdr) != T_CONS) { if (nth > 2) { Fail("list too short"); } if (nth == 1) list->cdr = val; else list->cdr = cons_new(list->cdr, val); return val; } return cons_aset(list->cdr, nth-1, val); } static VALUE Fcons_aset(list, nth, val) struct RCons *list; VALUE nth, val; { int n = NUM2INT(nth); if (n < 0) { n = cons_length(list)+n; if (n < 0) { Fail("negative offset too big"); } } return cons_aset(list, n, val); } static VALUE Fcons_each(list) struct RCons *list; { rb_yield(list->car); if (TYPE(list->cdr) != T_CONS) { rb_yield(list->cdr); return Qnil; } return Fcons_each(list->cdr); } static VALUE Fcons_equal(cons1, cons2) struct RCons *cons1, *cons2; { if (TYPE(cons2) != T_CONS) return FALSE; if (!rb_equal(cons1->car, cons2->car)) return FALSE; return rb_equal(cons1->cdr, cons2->cdr); } static ID hash; static VALUE Fcons_hash(cons) struct RCons *cons; { int key; key = rb_funcall(cons->car, hash, 0, 0); key ^= rb_funcall(cons->cdr, hash, 0, 0); return INT2FIX(key); } static VALUE Fcons_to_s(cons) struct RCons *cons; { VALUE str1, str2; ID to_s = rb_intern("to_s"); str1 = rb_funcall(cons->car, to_s, 0); cons = RCONS(cons->cdr); while (cons) { if (TYPE(cons) != T_CONS) { str2 = rb_funcall(cons, to_s, 0); str_cat(str1, RSTRING(str2)->ptr, RSTRING(str2)->len); break; } str2 = rb_funcall(cons->car, to_s, 0); str_cat(str1, RSTRING(str2)->ptr, RSTRING(str2)->len); cons = RCONS(cons->cdr); } return str1; } static VALUE Fcons_inspect(cons) struct RCons *cons; { VALUE str1, str2; ID inspect = rb_intern("_inspect"); str1 = rb_funcall(cons->car, inspect, 0, 0); str2 = rb_funcall(cons->cdr, inspect, 0, 0); str_cat(str1, "::", 2); str_cat(str1, RSTRING(str2)->ptr, RSTRING(str2)->len); return str1; } static VALUE Fcons_copy(list) struct RCons *list; { VALUE cdr = list->cdr; if (TYPE(cdr) == T_CONS) return cons_new(list->car, Fcons_copy(list->cdr)); else return cons_new(list->car, cdr); } extern VALUE C_Kernel; extern VALUE M_Enumerable; Init_Cons() { C_Cons = rb_define_class("Cons", C_Object); rb_undef_method(CLASS_OF(C_Cons), "new"); rb_undef_method(C_Cons, "clone"); rb_include_module(C_Cons, M_Enumerable); rb_define_method(C_Cons, "car", Fcons_car, 0); rb_define_method(C_Cons, "cdr", Fcons_cdr, 0); rb_define_method(C_Cons, "car=", Fcons_set_car, 1); rb_define_method(C_Cons, "cdr=", Fcons_set_cdr, 1); rb_define_method(C_Cons, "==", Fcons_equal, 1); rb_define_method(C_Cons, "hash", Fcons_hash, 0); hash = rb_intern("hash"); rb_define_method(C_Cons, "length", Fcons_length, 0); rb_define_method(C_Cons, "to_s", Fcons_to_s, 0); rb_define_method(C_Cons, "_inspect", Fcons_inspect, 0); /* methods to access as list */ rb_define_method(C_Cons, "[]", Fcons_aref, 1); rb_define_method(C_Cons, "[]=", Fcons_aset, 2); rb_define_method(C_Cons, "each", Fcons_each, 0); rb_define_method(C_Cons, "copy", Fcons_copy, 0); rb_define_method(C_Kernel, "::", assoc_new, 1); } ./ruby-0.64/dbm.c100644 150 1 20317 5704462333 12116 0ustar matzdaemon/************************************************ dbm.c - $Author: matz $ $Date: 1995/01/10 10:42:24 $ created at: Mon Jan 24 15:59:52 JST 1994 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #ifdef USE_DBM #include #include #include VALUE C_DBM; static ID id_dbm; extern VALUE M_Enumerable; static void closeddbm() { Fail("closed DBM file"); } #define GetDBM(obj, dbmp) {\ DBM **_dbm;\ Get_Data_Struct(obj, id_dbm, DBM*, _dbm);\ dbmp = *_dbm;\ if (dbmp == Qnil) closeddbm();\ } static void free_dbm(dbmp) DBM **dbmp; { if (*dbmp) dbm_close(*dbmp); } #define MakeDBM(obj, dp) {\ DBM **_dbm;\ Make_Data_Struct(obj,id_dbm,DBM*,Qnil,free_dbm,_dbm);\ *_dbm=dp;\ } static VALUE Sdbm_open(argc, argv, class) int argc; VALUE *argv; VALUE class; { VALUE file, vmode; DBM *dbm, **dbm2; int mode; VALUE obj; if (rb_scan_args(argc, argv, "11", &file, &vmode) == 1) { mode = 0666; /* default value */ } else if (NIL_P(vmode)) { mode = -1; /* return nil if DB not exist */ } else { mode = NUM2INT(vmode); } Check_Type(file, T_STRING); dbm = Qnil; if (mode >= 0) dbm = dbm_open(RSTRING(file)->ptr, O_RDWR|O_CREAT, mode); if (!dbm) dbm = dbm_open(RSTRING(file)->ptr, O_RDWR, mode); if (!dbm) dbm = dbm_open(RSTRING(file)->ptr, O_RDONLY, mode); if (!dbm) { if (mode == -1) return Qnil; rb_sys_fail(RSTRING(file)->ptr); } obj = obj_alloc(class); MakeDBM(obj, dbm); return obj; } static VALUE Fdbm_close(obj) VALUE obj; { DBM **dbmp; Get_Data_Struct(obj, id_dbm, DBM*, dbmp); if (*dbmp == Qnil) Fail("already closed DBM file"); dbm_close(*dbmp); *dbmp = Qnil; return Qnil; } static VALUE Fdbm_fetch(obj, keystr) VALUE obj, keystr; { datum key, value; DBM *dbm; Check_Type(keystr, T_STRING); key.dptr = RSTRING(keystr)->ptr; key.dsize = RSTRING(keystr)->len; GetDBM(obj, dbm); value = dbm_fetch(dbm, key); if (value.dptr == Qnil) { return Qnil; } return str_new(value.dptr, value.dsize); } static VALUE Fdbm_indexes(obj, args) VALUE obj; struct RArray *args; { VALUE *p, *pend; struct RArray *new; int i = 0; if (!args || args->len == 1 && TYPE(args->ptr) != T_ARRAY) { args = (struct RArray*)rb_to_a(args->ptr[0]); } new = (struct RArray*)ary_new2(args->len); p = args->ptr; pend = p + args->len; while (p < pend) { new->ptr[i++] = Fdbm_fetch(obj, *p++); new->len = i; } return (VALUE)new; } static VALUE Fdbm_delete(obj, keystr) VALUE obj, keystr; { datum key; DBM *dbm; Check_Type(keystr, T_STRING); key.dptr = RSTRING(keystr)->ptr; key.dsize = RSTRING(keystr)->len; GetDBM(obj, dbm); if (dbm_delete(dbm, key)) { Fail("dbm_delete failed"); } return obj; } static VALUE Fdbm_delete_if(obj) VALUE obj; { datum key, val; DBM *dbm; VALUE keystr, valstr; GetDBM(obj, dbm); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); keystr = str_new(key.dptr, key.dsize); valstr = str_new(val.dptr, val.dsize); if (rb_yield(assoc_new(keystr, valstr)) && dbm_delete(dbm, key)) { Fail("dbm_delete failed"); } } return obj; } static VALUE Fdbm_clear(obj) VALUE obj; { datum key; DBM *dbm; GetDBM(obj, dbm); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { if (dbm_delete(dbm, key)) { Fail("dbm_delete failed"); } } return obj; } static VALUE Fdbm_store(obj, keystr, valstr) VALUE obj, keystr, valstr; { datum key, val; DBM *dbm; if (valstr == Qnil) { Fdbm_delete(obj, keystr); return Qnil; } Check_Type(keystr, T_STRING); key.dptr = RSTRING(keystr)->ptr; key.dsize = RSTRING(keystr)->len; Check_Type(valstr, T_STRING); val.dptr = RSTRING(valstr)->ptr; val.dsize = RSTRING(valstr)->len; GetDBM(obj, dbm); if (dbm_store(dbm, key, val, DBM_REPLACE)) { dbm_clearerr(dbm); if (errno == EPERM) rb_sys_fail(Qnil); Fail("dbm_store failed"); } return valstr; } static VALUE Fdbm_length(obj) VALUE obj; { datum key; DBM *dbm; int i = 0; GetDBM(obj, dbm); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { i++; } return INT2FIX(i); } static VALUE Fdbm_each_value(obj) VALUE obj; { datum key, val; DBM *dbm; GetDBM(obj, dbm); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); rb_yield(str_new(val.dptr, val.dsize)); } return obj; } static VALUE Fdbm_each_key(obj) VALUE obj; { datum key; DBM *dbm; GetDBM(obj, dbm); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { rb_yield(str_new(key.dptr, key.dsize)); } return obj; } static VALUE Fdbm_each_pair(obj) VALUE obj; { datum key, val; DBM *dbm; VALUE keystr, valstr; GetDBM(obj, dbm); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); keystr = str_new(key.dptr, key.dsize); valstr = str_new(val.dptr, val.dsize); rb_yield(assoc_new(keystr, valstr)); } return obj; } static VALUE Fdbm_keys(obj) VALUE obj; { datum key; DBM *dbm; VALUE ary; ary = ary_new(); GetDBM(obj, dbm); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { ary_push(ary, str_new(key.dptr, key.dsize)); } return ary; } static VALUE Fdbm_values(obj) VALUE obj; { datum key, val; DBM *dbm; VALUE ary; ary = ary_new(); GetDBM(obj, dbm); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); ary_push(ary, str_new(val.dptr, val.dsize)); } return ary; } static VALUE Fdbm_has_key(obj, keystr) VALUE obj, keystr; { datum key, val; DBM *dbm; Check_Type(keystr, T_STRING); key.dptr = RSTRING(keystr)->ptr; key.dsize = RSTRING(keystr)->len; GetDBM(obj, dbm); val = dbm_fetch(dbm, key); if (val.dptr) return TRUE; return FALSE; } static VALUE Fdbm_has_value(obj, valstr) VALUE obj, valstr; { datum key, val; DBM *dbm; Check_Type(valstr, T_STRING); val.dptr = RSTRING(valstr)->ptr; val.dsize = RSTRING(valstr)->len; GetDBM(obj, dbm); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); if (val.dsize == RSTRING(valstr)->len && memcmp(val.dptr, RSTRING(valstr)->ptr, val.dsize) == 0) return TRUE; } return FALSE; } static VALUE Fdbm_to_a(obj) VALUE obj; { datum key, val; DBM *dbm; VALUE ary; GetDBM(obj, dbm); ary = ary_new(); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); ary_push(ary, assoc_new(str_new(key.dptr, key.dsize), str_new(val.dptr, val.dsize))); } return ary; } Init_DBM() { C_DBM = rb_define_class("DBM", C_Object); rb_include_module(C_DBM, M_Enumerable); rb_define_single_method(C_DBM, "open", Sdbm_open, -1); rb_define_method(C_DBM, "close", Fdbm_close, 0); rb_define_method(C_DBM, "[]", Fdbm_fetch, 1); rb_define_method(C_DBM, "[]=", Fdbm_store, 2); rb_define_method(C_DBM, "indexes", Fdbm_indexes, -2); rb_define_method(C_DBM, "length", Fdbm_length, 0); rb_define_alias(C_DBM, "size", "length"); rb_define_method(C_DBM, "each", Fdbm_each_pair, 0); rb_define_method(C_DBM, "each_value", Fdbm_each_value, 0); rb_define_method(C_DBM, "each_key", Fdbm_each_key, 0); rb_define_method(C_DBM, "each_pair", Fdbm_each_pair, 0); rb_define_method(C_DBM, "keys", Fdbm_keys, 0); rb_define_method(C_DBM, "values", Fdbm_values, 0); rb_define_method(C_DBM, "delete", Fdbm_delete, 1); rb_define_method(C_DBM, "delete_if", Fdbm_delete_if, 0); rb_define_method(C_DBM, "clear", Fdbm_clear, 0); rb_define_method(C_DBM, "includes", Fdbm_has_key, 1); rb_define_method(C_DBM, "has_key", Fdbm_has_key, 1); rb_define_method(C_DBM, "has_value", Fdbm_has_value, 1); rb_define_method(C_DBM, "to_a", Fdbm_to_a, 0); id_dbm = rb_intern("dbm"); } #endif /* USE_DBM */ ./ruby-0.64/defines.h100644 150 1 1131 5704462334 12750 0ustar matzdaemon/************************************************ defines.h - $Author: matz $ $Date: 1995/01/10 10:42:25 $ created at: Wed May 18 00:21:44 JST 1994 ************************************************/ #ifndef DEFINES_H #define DEFINES_H #define RUBY /* define EUC/SJIS for default kanji-code */ #define EUC #undef SJIS #ifdef HAVE_A_OUT_H /* define USE_DLN to load object file(.o). */ #define USE_DLN #ifdef USE_DLN #define LIBC_NAME "libc.a" #define DLN_DEFAULT_PATH "/lib:/usr/lib:." #endif #endif /* define USE_DBM to use dbm class. */ #define USE_DBM #define SAFE_SIGHANDLE #endif ./ruby-0.64/dict.c100644 150 1 24737 5704462336 12314 0ustar matzdaemon/************************************************ dict.c - $Author: matz $ $Date: 1995/01/10 10:42:26 $ created at: Mon Nov 22 18:51:18 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "st.h" VALUE C_Dict; static VALUE envtbl; static ID hash; VALUE Fgetenv(), Fsetenv(); static VALUE rb_cmp(a, b) VALUE a, b; { return rb_equal(a, b)?0:1; } static VALUE rb_hash(a, mod) VALUE a; int mod; { return rb_funcall(a, hash, 0) % mod; } #define ASSOC_KEY(a) RCONS(a)->car #define ASSOC_VAL(a) RCONS(a)->cdr static VALUE Sdic_new(class) VALUE class; { int i, max; NEWOBJ(dic, struct RDict); OBJSETUP(dic, class, T_DICT); dic->tbl = st_init_table(rb_cmp, rb_hash); return (VALUE)dic; } VALUE dic_new() { return Sdic_new(C_Dict); } static VALUE Fdic_clone(dic) struct RDict *dic; { NEWOBJ(dic2, struct RDict); CLONESETUP(dic2, dic); dic2->tbl = (st_table*)st_copy(dic->tbl); return (VALUE)dic2; } static VALUE Fdic_aref(dic, key) struct RDict *dic; VALUE key; { VALUE val = Qnil; if (!st_lookup(dic->tbl, key, &val)) { return Qnil; } return val; } static VALUE Fdic_indexes(dic, args) struct RDict *dic; struct RArray *args; { VALUE *p, *pend; struct RArray *new; int i = 0; if (!args || args->len == 0) { Fail("wrong # of argment"); } else if (args->len == 1) { if (TYPE(args->ptr[0])) { args = (struct RArray*)rb_to_a(args->ptr[0]); } else { args = (struct RArray*)args->ptr[0]; } } new = (struct RArray*)ary_new2(args->len); p = args->ptr; pend = p + args->len; while (p < pend) { new->ptr[i++] = Fdic_aref(dic, *p++); } new->len = i; return (VALUE)new; } static VALUE Fdic_delete(dic, key) struct RDict *dic; VALUE key; { VALUE val; if (st_delete(dic->tbl, &key, &val)) return val; return Qnil; } static int dic_delete_if(key, value) VALUE key, value; { if (rb_yield(assoc_new(key, value))) return ST_DELETE; return ST_CONTINUE; } static VALUE Fdic_delete_if(dic) struct RDict *dic; { st_foreach(dic->tbl, dic_delete_if, Qnil); return (VALUE)dic; } static dic_clear(key, value) VALUE key, value; { return ST_DELETE; } static VALUE Fdic_clear(dic) struct RDict *dic; { st_foreach(dic->tbl, dic_clear, Qnil); return (VALUE)dic; } VALUE Fdic_aset(dic, key, val) struct RDict *dic; VALUE key, val; { if (val == Qnil) { Fdic_delete(dic, key); return Qnil; } st_insert(dic->tbl, key, val); return val; } static VALUE Fdic_length(dic) struct RDict *dic; { return INT2FIX(dic->tbl->num_entries); } static dic_each_value(key, value) VALUE key, value; { rb_yield(value); return ST_CONTINUE; } static VALUE Fdic_each_value(dic) struct RDict *dic; { st_foreach(dic->tbl, dic_each_value); return (VALUE)dic; } static dic_each_key(key, value) VALUE key, value; { rb_yield(key); return ST_CONTINUE; } static VALUE Fdic_each_key(dic) struct RDict *dic; { st_foreach(dic->tbl, dic_each_key); return (VALUE)dic; } static dic_each_pair(key, value) VALUE key, value; { rb_yield(assoc_new(key, value)); return ST_CONTINUE; } static VALUE Fdic_each_pair(dic) struct RDict *dic; { st_foreach(dic->tbl, dic_each_pair); return (VALUE)dic; } static dic_to_a(key, value, ary) VALUE key, value, ary; { ary_push(ary, assoc_new(key, value)); return ST_CONTINUE; } static VALUE Fdic_to_a(dic) struct RDict *dic; { VALUE ary; ary = ary_new(); st_foreach(dic->tbl, dic_to_a, ary); return ary; } static dic_inspect(key, value, str) VALUE key, value; struct RString *str; { VALUE str2; ID inspect = rb_intern("_inspect"); if (str->len > 1) { str_cat(str, ", ", 2); } str2 = rb_funcall(key, inspect, 0, Qnil); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); str_cat(str, "=>", 2); str2 = rb_funcall(value, inspect, 0, Qnil); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); return ST_CONTINUE; } static VALUE Fdic_inspect(dic) struct RDict *dic; { VALUE str; str = str_new2("{"); st_foreach(dic->tbl, dic_inspect, str); str_cat(str, "}", 1); return str; } static VALUE Fdic_to_s(dic) VALUE dic; { return Fary_to_s(Fdic_to_a(dic)); } static dic_keys(key, value, ary) VALUE key, value, ary; { ary_push(ary, key); return ST_CONTINUE; } static VALUE Fdic_keys(dic) struct RDict *dic; { VALUE ary; ary = ary_new(); st_foreach(dic->tbl, dic_keys, ary); return ary; } static dic_values(key, value, ary) VALUE key, value, ary; { ary_push(ary, key); return ST_CONTINUE; } static VALUE Fdic_values(dic) struct RDict *dic; { VALUE ary; ary = ary_new(); st_foreach(dic->tbl, dic_values, ary); return ary; } static VALUE Fdic_has_key(dic, key) struct RDict *dic; VALUE key; { VALUE val; if (st_lookup(dic->tbl, key, &val)) return TRUE; return FALSE; } static int dic_search_value(key, value, data) VALUE key, value, *data; { if (rb_equal(value, data[1])) { data[0] = TRUE; return ST_STOP; } return ST_CONTINUE; } static VALUE Fdic_has_value(dic, val) struct RDict *dic; VALUE val; { VALUE data[2]; data[0] = FALSE; data[1] = val; st_foreach(dic->tbl, dic_search_value, data); return data[0]; } struct equal_data { int result; st_table *tbl; }; static int dic_equal(key, val1, data) VALUE key, val1; struct equal_data *data; { VALUE val2; if (!st_lookup(data->tbl, key, &val2)) { data->result = FALSE; return ST_STOP; } if (!rb_equal(val1, val2)) { data->result = FALSE; return ST_STOP; } return ST_CONTINUE; } static VALUE Fdic_equal(dic1, dic2) struct RDict *dic1, *dic2; { struct equal_data data; if (TYPE(dic2) != T_DICT) return FALSE; if (dic1->tbl->num_entries != dic2->tbl->num_entries) return FALSE; data.tbl = dic2->tbl; data.result = TRUE; st_foreach(dic1->tbl, dic_equal, &data); return data.result; } static int dic_hash(key, val, data) VALUE key, val; int *data; { *data ^= rb_funcall(key, hash, 0); *data ^= rb_funcall(val, hash, 0); return ST_CONTINUE; } static VALUE Fdic_hash(dic) struct RDict *dic; { int h; st_foreach(dic->tbl, dic_hash, &h); return INT2FIX(h); } char *strchr(); extern VALUE rb_readonly_hook(); extern char **environ; static VALUE Fenv_each(dic) VALUE dic; { char **env; env = environ; while (*env) { VALUE var, val; char *s = strchr(*env, '='); var = str_new(*env, s-*env); val = str_new2(s+1); rb_yield(assoc_new(var, val)); env++; } return dic; } static VALUE Fenv_delete(obj, name) VALUE obj; struct RString *name; { int i, len; char *nam, *val = Qnil; Check_Type(name, T_STRING); nam = name->ptr; len = strlen(nam); for(i=0; environ[i]; i++) { if (strncmp(environ[i], nam, len) == 0 && environ[i][len] == '=') { val = environ[i]+len+1; break; } } while (environ[i]) { environ[i] = environ[i+1]; i++; } if (val) { return str_new2(val); } return Qnil; } VALUE Fgetenv(obj, name) VALUE obj; struct RString *name; { extern char *getenv(); char *env; Check_Type(name, T_STRING); if (strlen(name->ptr) != name->len) Fail("Bad environment name"); env = getenv(name->ptr); if (env) { return str_new2(env); } return Qnil; } VALUE Fsetenv(obj, name, value) VALUE obj; struct RString *name, *value; { Check_Type(name, T_STRING); if (value == Qnil) { Fenv_delete(obj, name); return Qnil; } Check_Type(value, T_STRING); if (strlen(name->ptr) != name->len) Fail("Bad environment name"); if (strlen(value->ptr) != value->len) Fail("Bad environment value"); #ifdef HAVE_SETENV if (setenv(name->ptr, value->ptr, 1) == 0) return TRUE; #else #ifdef HAVE_PUTENV { char *str; int len; str = ALLOC_N(char, name->len + value->len + 2); sprintf("%s=%s", name->ptr, value->ptr); if (putenv(str) == 0) return TRUE; } #else Fail("setenv is not supported on this system"); #endif #endif Fail("setenv failed"); return FALSE; /* not reached */ } static VALUE Fenv_to_s() { return str_new2("$ENV"); } Init_Dict() { extern VALUE C_Kernel; extern VALUE M_Enumerable; hash = rb_intern("hash"); C_Dict = rb_define_class("Dict", C_Object); rb_name_class(C_Dict, rb_intern("Hash")); /* alias */ rb_include_module(C_Dict, M_Enumerable); rb_define_single_method(C_Dict, "new", Sdic_new, 0); rb_define_method(C_Dict,"clone", Fdic_clone, 0); rb_define_method(C_Dict,"to_a", Fdic_to_a, 0); rb_define_method(C_Dict,"to_s", Fdic_to_s, 0); rb_define_method(C_Dict,"_inspect", Fdic_inspect, 0); rb_define_method(C_Dict,"==", Fdic_equal, 1); rb_define_method(C_Dict,"hash", Fdic_hash, 0); rb_define_method(C_Dict,"[]", Fdic_aref, 1); rb_define_method(C_Dict,"[]=", Fdic_aset, 2); rb_define_method(C_Dict,"indexes", Fdic_indexes, -2); rb_define_method(C_Dict,"length", Fdic_length, 0); rb_define_alias(C_Dict, "size", "length"); rb_define_method(C_Dict,"each", Fdic_each_pair, 0); rb_define_method(C_Dict,"each_value", Fdic_each_value, 0); rb_define_method(C_Dict,"each_key", Fdic_each_key, 0); rb_define_method(C_Dict,"each_pair", Fdic_each_pair, 0); rb_define_method(C_Dict,"keys", Fdic_keys, 0); rb_define_method(C_Dict,"values", Fdic_values, 0); rb_define_method(C_Dict,"delete", Fdic_delete, 1); rb_define_method(C_Dict,"delete_if", Fdic_delete_if, 0); rb_define_method(C_Dict,"clear", Fdic_clear, 0); rb_define_method(C_Dict,"includes", Fdic_has_key, 1); rb_define_method(C_Dict,"has_key", Fdic_has_key, 1); rb_define_method(C_Dict,"has_value", Fdic_has_value, 1); envtbl = obj_alloc(C_Object); rb_define_single_method(envtbl,"[]", Fgetenv, 1); rb_define_single_method(envtbl,"[]=", Fsetenv, 2); rb_define_single_method(envtbl,"each", Fenv_each, 0); rb_define_single_method(envtbl,"delete", Fenv_delete, 1); rb_define_single_method(envtbl,"to_s", Fenv_to_s, 0); rb_include_module(CLASS_OF(envtbl), M_Enumerable); rb_define_variable("$ENV", &envtbl, Qnil, rb_readonly_hook, 0); rb_define_private_method(C_Kernel, "getenv", Fgetenv, 1); rb_define_private_method(C_Kernel, "setenv", Fsetenv, 2); } ./ruby-0.64/dir.c100644 150 1 11604 5704462340 12127 0ustar matzdaemon/************************************************ dir.c - $Author: matz $ $Date: 1995/01/10 10:42:28 $ created at: Wed Jan 5 09:51:01 JST 1994 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include #include "ruby.h" #include #ifdef HAVE_UNISTD_H #include #endif /* unistd.h defines _POSIX_VERSION on POSIX.1 systems. */ #if defined(DIRENT) || defined(_POSIX_VERSION) #include #define NLENGTH(dirent) (strlen((dirent)->d_name)) #else /* not (DIRENT or _POSIX_VERSION) */ #define dirent direct #define NLENGTH(dirent) ((dirent)->d_namlen) #ifdef SYSNDIR #include #endif /* SYSNDIR */ #ifdef SYSDIR #include #endif /* SYSDIR */ #ifdef NDIR #include #endif /* NDIR */ #endif /* not (DIRENT or _POSIX_VERSION) */ static VALUE C_Dir; static ID id_dir; static void free_dir(dir) DIR **dir; { if (dir && *dir) closedir(*dir); } static VALUE Sdir_open(dir_class, dirname) VALUE dir_class; struct RString *dirname; { VALUE obj; DIR *dirp, **d; Check_Type(dirname, T_STRING); dirp = opendir(dirname->ptr); if (dirp == NULL) Fail("Can't open directory %s", dirname->ptr); obj = obj_alloc(dir_class); Make_Data_Struct(obj, id_dir, DIR*, Qnil, free_dir, d); *d = dirp; return obj; } static void closeddir() { Fail("closed directory"); } #define GetDIR(obj, dirp) {\ DIR **_dp;\ Get_Data_Struct(obj, id_dir, DIR*, _dp);\ dirp = *_dp;\ if (dirp == NULL) closeddir();\ } static VALUE Fdir_each(dir) VALUE dir; { extern VALUE rb_lastline; DIR *dirp; struct dirent *dp; GetDIR(dir, dirp); for (dp = readdir(dirp); dp != NULL; dp = readdir(dirp)) { rb_lastline = str_new(dp->d_name, NLENGTH(dp)); rb_yield(rb_lastline); } return dir; } static VALUE Fdir_tell(dir) VALUE dir; { DIR *dirp; int pos; GetDIR(dir, dirp); pos = telldir(dirp); return int2inum(pos); } static VALUE Fdir_seek(dir, pos) VALUE dir, pos; { DIR *dirp; GetDIR(dir, dirp); seekdir(dirp, NUM2INT(pos)); return dir; } static VALUE Fdir_rewind(dir) VALUE dir; { DIR *dirp; GetDIR(dir, dirp); rewinddir(dirp); return dir; } static VALUE Fdir_close(dir) VALUE dir; { DIR **dirpp; Get_Data_Struct(dir, id_dir, DIR*, dirpp); if (*dirpp == NULL) Fail("already closed directory"); closedir(*dirpp); *dirpp = NULL; return Qnil; } char *getenv(); static VALUE Sdir_chdir(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE path; char *dist = ""; rb_scan_args(argc, argv, "01", &path); if (path) { Check_Type(path, T_STRING); dist = RSTRING(path)->ptr; } else { dist = getenv("HOME"); if (!dist) { dist = getenv("LOGDIR"); } } if (chdir(dist) < 0) rb_sys_fail(Qnil); return INT2FIX(0); } static VALUE Sdir_getwd(dir) VALUE dir; { extern char *getwd(); char path[MAXPATHLEN]; #ifdef HAVE_GETCWD if (getcwd(path, sizeof(path)) == 0) Fail(path); #else if (getwd(path) == 0) Fail(path); #endif return str_new2(path); } static VALUE Sdir_chroot(dir, path) VALUE dir, path; { Check_Type(path, T_STRING); if (chroot(RSTRING(path)->ptr) == -1) rb_sys_fail(Qnil); return INT2FIX(0); } static VALUE Sdir_mkdir(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE path, vmode; int mode; if (rb_scan_args(argc, argv, "11", &path, &vmode) == 2) { mode = NUM2INT(vmode); } else { mode = 0777; } Check_Type(path, T_STRING); if (mkdir(RSTRING(path)->ptr, mode) == -1) rb_sys_fail(RSTRING(path)->ptr); return INT2FIX(0); } static VALUE Sdir_rmdir(obj, dir) VALUE obj; struct RString *dir; { Check_Type(dir, T_STRING); if (rmdir(dir->ptr) < 0) rb_sys_fail(dir->ptr); return TRUE; } Init_Dir() { extern VALUE M_Enumerable; C_Dir = rb_define_class("Directory", C_Object); rb_name_class(C_Dir, rb_intern("Dir")); /* alias */ rb_include_module(C_Dir, M_Enumerable); rb_define_single_method(C_Dir, "open", Sdir_open, 1); rb_define_method(C_Dir,"each", Fdir_each, 0); rb_define_method(C_Dir,"rewind", Fdir_rewind, 0); rb_define_method(C_Dir,"tell", Fdir_tell, 0); rb_define_method(C_Dir,"seek", Fdir_seek, 1); rb_define_method(C_Dir,"close", Fdir_close, 0); rb_define_single_method(C_Dir,"chdir", Sdir_chdir, -1); rb_define_single_method(C_Dir,"getwd", Sdir_getwd, 0); rb_define_single_method(C_Dir,"pwd", Sdir_getwd, 0); rb_define_single_method(C_Dir,"chroot", Sdir_chroot, 1); rb_define_single_method(C_Dir,"mkdir", Sdir_mkdir, -1); rb_define_single_method(C_Dir,"rmdir", Sdir_rmdir, 1); rb_define_single_method(C_Dir,"delete", Sdir_rmdir, 1); rb_define_single_method(C_Dir,"unlink", Sdir_rmdir, 1); id_dir = rb_intern("dir"); } ./ruby-0.64/dln.c100644 150 1 52674 5674170242 12145 0ustar matzdaemon/************************************************ dln.c - $Author: matz $ $Date: 1994/12/09 01:28:23 $ created at: Tue Jan 18 17:05:06 JST 1994 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include #include #include #include "config.h" #include "defines.h" #include "dln.h" #include #ifdef HAVE_UNISTD_H #include #endif char *strdup(); extern int errno; int dln_errno; static int dln_init_p = 0; #include static char fbuf[MAXPATHLEN]; static char *dln_find_1(); char *getenv(); char *strchr(); int strcmp(); char * dln_find_exe(fname, path) char *fname; char *path; { if (!path) path = getenv("PATH"); if (!path) path = "/usr/local/bin:/usr/ucb:/usr/bin:/bin:."; return dln_find_1(fname, path, 1); } char * dln_find_file(fname, path) char *fname; char *path; { if (!path) path = "."; return dln_find_1(fname, path, 0); } static char * dln_find_1(fname, path, exe_flag) char *fname; char *path; int exe_flag; /* non 0 if looking for executable. */ { register char *dp; register char *ep; register char *bp; struct stat st; if (fname[0] == '/') return fname; for (dp = path;; dp = ++ep) { register int l; int i; int fspace; /* extract a component */ ep = strchr(dp, ':'); if (ep == NULL) ep = dp+strlen(dp); /* find the length of that component */ l = ep - dp; bp = fbuf; fspace = sizeof fbuf - 2; if (l > 0) { /* ** If the length of the component is zero length, ** start from the current directory. If the ** component begins with "~", start from the ** user's $HOME environment variable. Otherwise ** take the path literally. */ if (*dp == '~' && (l == 1 || dp[1] == '/')) { char *home; home = getenv("HOME"); if (home != NULL) { i = strlen(home); if ((fspace -= i) < 0) goto toolong; memcpy(bp, home, i); bp += i; } dp++; l--; } if (l > 0) { if ((fspace -= l) < 0) goto toolong; memcpy(bp, dp, l); bp += l; } /* add a "/" between directory and filename */ if (ep[-1] != '/') *bp++ = '/'; } /* now append the file name */ i = strlen(fname); if ((fspace -= i) < 0) { toolong: fprintf(stderr, "openpath: pathname too long (ignored)\n"); *bp = '\0'; fprintf(stderr, "\tDirectory \"%s\"\n", fbuf); fprintf(stderr, "\tFile \"%s\"\n", fname); continue; } memcpy(bp, fname, i + 1); if (stat(fbuf, &st) == 0) { if (exe_flag == 0) return fbuf; /* looking for executable */ #ifdef RUBY if (eaccess(fbuf, X_OK) == 0) return fbuf; #else { uid_t uid = getuid(); gid_t gid = getgid(); if (uid == st.st_uid && (st.st_mode & S_IEXEC) || gid == st.st_gid && (st.st_mode & (S_IEXEC>>3)) || st.st_mode & (S_IEXEC>>6)) { return fbuf; } } #endif } /* if not, and no other alternatives, life is bleak */ if (*ep == '\0') { dln_errno = DLN_ENOENT; return NULL; } /* otherwise try the next component in the search path */ } } #ifdef USE_DLN #include "st.h" #include #include #ifndef N_COMM # define N_COMM 0x12 #endif #ifndef N_MAGIC # define N_MAGIC(x) (x).a_magic #endif #define INVALID_OBJECT(h) (N_MAGIC(h) != OMAGIC) static st_table *sym_tbl; static st_table *undef_tbl; static int dln_load_header(fd, hdrp, disp) int fd; struct exec *hdrp; long disp; { int size; lseek(fd, disp, 0); size = read(fd, hdrp, sizeof(*hdrp)); if (size == -1) { dln_errno = errno; return -1; } if (size != sizeof(*hdrp) || N_BADMAG(*hdrp)) { dln_errno = DLN_ENOEXEC; return -1; } return 0; } #if defined(sun) && defined(sparc) /* Sparc (Sun 4) macros */ # undef relocation_info # define relocation_info reloc_info_sparc # define R_RIGHTSHIFT(r) (reloc_r_rightshift[(r)->r_type]) # define R_BITSIZE(r) (reloc_r_bitsize[(r)->r_type]) # define R_LENGTH(r) (reloc_r_length[(r)->r_type]) static int reloc_r_rightshift[] = { 0, 0, 0, 0, 0, 0, 2, 2, 10, 0, 0, 0, 0, 0, 0, }; static int reloc_r_bitsize[] = { 8, 16, 32, 8, 16, 32, 30, 22, 22, 22, 13, 10, 32, 32, 16, }; static int reloc_r_length[] = { 0, 1, 2, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, }; # define R_PCREL(r) \ ((r)->r_type >= RELOC_DISP8 && (r)->r_type <= RELOC_WDISP22) # define R_SYMBOL(r) ((r)->r_index) #else # define R_LENGTH(r) ((r)->r_length) # define R_PCREL(r) ((r)->r_pcrel) # define R_SYMBOL(r) ((r)->r_symbolnum) #endif static struct relocation_info * dln_load_reloc(fd, hdrp, disp) int fd; struct exec *hdrp; long disp; { struct relocation_info * reloc; int size; lseek(fd, disp + N_TXTOFF(*hdrp) + hdrp->a_text + hdrp->a_data, 0); size = hdrp->a_trsize + hdrp->a_drsize; reloc = (struct relocation_info*)xmalloc(size); if (reloc == NULL) { dln_errno = errno; return NULL; } if (read(fd, reloc, size) != size) { dln_errno = errno; free(reloc); return NULL; } return reloc; } static struct nlist * dln_load_sym(fd, hdrp, disp) int fd; struct exec *hdrp; long disp; { struct nlist * buffer; struct nlist * sym; struct nlist * end; long displ; int size; st_table *tbl; lseek(fd, N_SYMOFF(*hdrp) + hdrp->a_syms + disp, 0); if (read(fd, &size, sizeof(int)) != sizeof(int)) { goto err_noexec; } buffer = (struct nlist*)xmalloc(hdrp->a_syms + size); if (buffer == NULL) { dln_errno = errno; return NULL; } lseek(fd, disp + N_SYMOFF(*hdrp), 0); if (read(fd, buffer, hdrp->a_syms + size) != hdrp->a_syms + size) { free(buffer); goto err_noexec; } sym = buffer; end = sym + hdrp->a_syms / sizeof(struct nlist); displ = (long)buffer + (long)(hdrp->a_syms); while (sym < end) { sym->n_un.n_name = (char*)sym->n_un.n_strx + displ; sym++; } return buffer; err_noexec: dln_errno = DLN_ENOEXEC; return NULL; } static st_table * dln_sym_hash(hdrp, syms) struct exec *hdrp; struct nlist *syms; { st_table *tbl; struct nlist *sym = syms; struct nlist *end = syms + (hdrp->a_syms / sizeof(struct nlist)); tbl = st_init_table(strcmp, st_strhash); if (tbl == NULL) { dln_errno = errno; return NULL; } while (sym < end) { st_insert(tbl, sym->n_un.n_name, sym); sym++; } return tbl; } int dln_init(prog) char *prog; { char *file; int fd, size; struct exec hdr; struct nlist *syms; if (dln_init_p == 1) return; file = dln_find_exe(prog, NULL); if (file == NULL) return -1; if ((fd = open(file, O_RDONLY)) < 0) { dln_errno = errno; return -1; } if (dln_load_header(fd, &hdr, 0) == -1) return -1; syms = dln_load_sym(fd, &hdr, 0); if (syms == NULL) { close(fd); return -1; } sym_tbl = dln_sym_hash(&hdr, syms); if (sym_tbl == NULL) { /* file may be start with #! */ char c = '\0'; char buf[MAXPATHLEN]; char *p; free(syms); lseek(fd, 0L, 0); if (read(fd, &c, 1) == -1) { dln_errno = errno; return -1; } if (c != '#') goto err_noexec; if (read(fd, &c, 1) == -1) { dln_errno = errno; return -1; } if (c != '!') goto err_noexec; p = buf; /* skip forwading spaces */ while (read(fd, &c, 1) == 1) { if (c == '\n') goto err_noexec; if (c != '\t' && c != ' ') { *p++ = c; break; } } /* read in command name */ while (read(fd, p, 1) == 1) { if (*p == '\n' || *p == '\t' || *p == ' ') break; p++; } *p = '\0'; printf("%s\n", buf); return dln_init(buf); } dln_init_p = 1; undef_tbl = st_init_table(strcmp, st_strhash); close(fd); return 0; err_noexec: close(fd); dln_errno = DLN_ENOEXEC; return -1; } long dln_load_text_data(fd, hdrp, bss, disp) int fd; struct exec *hdrp; int bss; long disp; { int size; unsigned char* addr; lseek(fd, disp + N_TXTOFF(*hdrp), 0); size = hdrp->a_text + hdrp->a_data; if (bss == -1) size += hdrp->a_bss; else if (bss > 1) size += bss; addr = (unsigned char*)xmalloc(size); if (addr == NULL) { dln_errno = errno; return 0; } if (read(fd, addr, size) != size) { dln_errno = errno; free(addr); return 0; } if (bss == -1) { memset(addr + hdrp->a_text + hdrp->a_data, 0, hdrp->a_bss); } else if (bss > 0) { memset(addr + hdrp->a_text + hdrp->a_data, 0, bss); } return (long)addr; } static int undef_print(key, value) char *key, *value; { fprintf(stderr, " %s\n", key); return ST_CONTINUE; } static dln_undefined() { fprintf(stderr, "dln: Calling undefined function\n"); fprintf(stderr, " Undefined symbols:\n"); st_foreach(undef_tbl, undef_print, NULL); #ifdef RUBY rb_exit(1); #else exit(1); #endif } struct undef { char *name; struct relocation_info reloc; long base; char *addr; union { char c; short s; long l; } u; }; static st_table *reloc_tbl = NULL; static void link_undef(name, base, reloc) char *name; long base; struct relocation_info *reloc; { static int u_no = 0; struct undef *obj; char *addr = (char*)(reloc->r_address + base); obj = (struct undef*)xmalloc(sizeof(struct undef)); obj->name = strdup(name); obj->reloc = *reloc; obj->base = base; switch (R_LENGTH(reloc)) { case 0: /* byte */ obj->u.c = *addr; break; case 1: /* word */ obj->u.s = *(short*)addr; break; case 2: /* long */ obj->u.l = *(long*)addr; break; } if (reloc_tbl == NULL) { reloc_tbl = st_init_table(ST_NUMCMP, ST_NUMHASH); } st_insert(reloc_tbl, u_no++, obj); } struct reloc_arg { char *name; long value; }; static int reloc_undef(no, undef, arg) int no; struct undef *undef; struct reloc_arg *arg; { int datum; char *address; #if defined(sun) && defined(sparc) unsigned int mask = 0; #endif if (strcmp(arg->name, undef->name) != 0) return ST_CONTINUE; address = (char*)(undef->base + undef->reloc.r_address); datum = arg->value; if (R_PCREL(&(undef->reloc))) datum -= undef->base; #if defined(sun) && defined(sparc) datum += undef->reloc.r_addend; datum >>= R_RIGHTSHIFT(&(undef->reloc)); mask = 1 << R_BITSIZE(&(undef->reloc)) - 1; mask |= mask -1; datum &= mask; switch (R_LENGTH(&(undef->reloc))) { case 0: *address = undef->u.c; *address &= ~mask; *address |= datum; break; case 1: *(short *)address = undef->u.s; *(short *)address &= ~mask; *(short *)address |= datum; break; case 2: *(long *)address = undef->u.l; *(long *)address &= ~mask; *(long *)address |= datum; break; } #else switch (R_LENGTH(&(undef->reloc))) { case 0: /* byte */ *address = undef->u.c + datum; break; case 1: /* word */ *(short *)address = undef->u.s + datum; break; case 2: /* long */ *(long *)address = undef->u.l + datum; break; } #endif free(undef->name); free(undef); return ST_DELETE; } static int unlink_undef(name, value) char *name; long value; { struct reloc_arg arg; arg.name = name; arg.value = value; st_foreach(reloc_tbl, reloc_undef, &arg); } static int dln_load_1(fd, disp, need_init) int fd; long disp; int need_init; { static char *libc = LIBC_NAME; struct exec hdr; struct relocation_info *reloc = NULL; long block = 0; long new_common = 0; /* Length of new common */ struct nlist *syms = NULL; struct nlist *sym; struct nlist *end; int init_p = 0; if (dln_load_header(fd, &hdr, disp) == -1) return -1; if (INVALID_OBJECT(hdr)) { dln_errno = DLN_ENOEXEC; return -1; } reloc = dln_load_reloc(fd, &hdr, disp); if (reloc == NULL) return -1; syms = dln_load_sym(fd, &hdr, disp); if (syms == NULL) return -1; sym = syms; end = syms + (hdr.a_syms / sizeof(struct nlist)); while (sym < end) { struct nlist *old_sym; int value = sym->n_value; if (sym->n_type == (N_UNDF | N_EXT)) { if (st_lookup(sym_tbl, sym->n_un.n_name, &old_sym) == 0) { old_sym = NULL; } if (value) { if (old_sym) { sym->n_type = N_EXT | N_COMM; sym->n_value = old_sym->n_value; } else { int rnd = value >= sizeof(double) ? sizeof(double) - 1 : value >= sizeof(long) ? sizeof(long) - 1 : sizeof(short) - 1; sym->n_type = N_COMM; new_common += rnd; new_common &= ~(long)rnd; sym->n_value = new_common; new_common += value; } } else { if (old_sym) { sym->n_type = N_EXT | N_COMM; sym->n_value = old_sym->n_value; } else { sym->n_value = (long)dln_undefined; st_insert(undef_tbl, strdup(sym->n_un.n_name), NULL); } } } sym++; } block = dln_load_text_data(fd, &hdr, hdr.a_bss + new_common, disp); if (block == 0) goto err_exit; sym = syms; while (sym < end) { struct nlist *new_sym; char *key; switch (sym->n_type) { case N_COMM: sym->n_value += hdr.a_text + hdr.a_data; case N_TEXT|N_EXT: case N_DATA|N_EXT: sym->n_value += block; if (st_lookup(sym_tbl, sym->n_un.n_name, &new_sym) != 0 && new_sym->n_value != (long)dln_undefined) { dln_errno = DLN_ECONFL; goto err_exit; } key = sym->n_un.n_name; if (st_delete(undef_tbl, &key, NULL) != 0) { unlink_undef(key, sym->n_value); free(key); } new_sym = (struct nlist*)xmalloc(sizeof(struct nlist)); *new_sym = *sym; new_sym->n_un.n_name = strdup(sym->n_un.n_name); st_insert(sym_tbl, new_sym->n_un.n_name, new_sym); } sym++; } /* * First comes the text-relocation */ { struct relocation_info * rel = reloc; struct relocation_info * rel_beg = reloc + (hdr.a_trsize/sizeof(struct relocation_info)); struct relocation_info * rel_end = reloc + (hdr.a_trsize+hdr.a_drsize)/sizeof(struct relocation_info); while (rel < rel_end) { char *address = (char*)(rel->r_address + block); long datum = 0; #if defined(sun) && defined(sparc) unsigned int mask = 0; #endif if(rel >= rel_beg) address += hdr.a_text; if (rel->r_extern) { /* Look it up in symbol-table */ sym = &(syms[R_SYMBOL(rel)]); switch (sym->n_type) { case N_EXT|N_UNDF: link_undef(sym->n_un.n_name, block, rel); case N_EXT|N_COMM: case N_COMM: datum = sym->n_value; break; default: goto err_exit; } } /* end.. look it up */ else { /* is static */ switch (R_SYMBOL(rel) & N_TYPE) { case N_TEXT: case N_DATA: datum = block; break; case N_BSS: datum = block + new_common; break; case N_ABS: break; } } /* end .. is static */ if (R_PCREL(rel)) datum -= block; #if defined(sun) && defined(sparc) datum += rel->r_addend; datum >>= R_RIGHTSHIFT(rel); mask = 1 << R_BITSIZE(rel) - 1; mask |= mask -1; datum &= mask; switch (R_LENGTH(rel)) { case 0: *address &= ~mask; *address |= datum; break; case 1: *(short *)address &= ~mask; *(short *)address |= datum; break; case 2: *(long *)address &= ~mask; *(long *)address |= datum; break; } #else switch (R_LENGTH(rel)) { case 0: /* byte */ if (datum < -128 || datum > 127) goto err_exit; *address += datum; break; case 1: /* word */ *(short *)address += datum; break; case 2: /* long */ *(long *)address += datum; break; } #endif rel++; } } if (need_init) { if (undef_tbl->num_entries > 0) { if (dln_load_lib(libc) == -1) goto err_exit; } sym = syms; while (sym < end) { char *name = sym->n_un.n_name; if (name[0] == '_' && sym->n_value >= block && ((bcmp (name, "_Init_", 6) == 0 || bcmp (name, "_init_", 6) == 0) && name[6] != '_')) { init_p = 1; ((int (*)())sym->n_value)(); } sym++; } } free(reloc); free(syms); if (need_init) { if (init_p == 0) { dln_errno = DLN_ENOINIT; return -1; } if (undef_tbl->num_entries > 0) { if (dln_load_lib(libc) == -1) goto err_exit; if (undef_tbl->num_entries > 0) { dln_errno = DLN_EUNDEF; return -1; } } } return 0; err_exit: if (syms) free(syms); if (reloc) free(reloc); if (block) free(block); return -1; } int dln_load(file) char *file; { int fd; int result; if (dln_init_p == 0) { dln_errno = DLN_ENOINIT; return -1; } fd = open(file, O_RDONLY); if (fd == -1) { dln_errno = errno; return -1; } result = dln_load_1(fd, 0, 1); close(fd); return result; } struct symdef { int str_index; int lib_offset; }; static int target_offset; static int search_undef(key, value, lib_tbl) char *key; int value; st_table *lib_tbl; { static char *last = ""; int offset; if (st_lookup(lib_tbl, key, &offset) == 0) return ST_CONTINUE; if (strcmp(last, key) != 0) { last = key; target_offset = offset; } return ST_STOP; } char *dln_library_path = DLN_DEFAULT_PATH; int dln_load_lib(lib) char *lib; { char *path, *file; char armagic[SARMAG]; int fd, size; struct ar_hdr ahdr; st_table *lib_tbl = NULL; int *data, nsym; struct symdef *base; char *name_base; if (dln_init_p == 0) { dln_errno = DLN_ENOINIT; return -1; } if (undef_tbl->num_entries == 0) return 0; dln_errno = DLN_EBADLIB; /* library search path: */ /* look for environment variable DLN_LIBRARY_PATH first. */ /* then variable dln_library_path. */ /* if path is still NULL, use "." for path. */ path = getenv("DLN_LIBRARY_PATH"); if (path == NULL) path = dln_library_path; file = dln_find_file(lib, path); fd = open(file, O_RDONLY); if (fd == -1) goto syserr; size = read(fd, armagic, SARMAG); if (fd == -1) goto syserr; if (size != SARMAG) { dln_errno = DLN_ENOTLIB; goto badlib; } size = read(fd, &ahdr, sizeof(ahdr)); if (size == -1) goto syserr; if (size != sizeof(ahdr) || sscanf(ahdr.ar_size, "%d", &size) != 1) { goto badlib; } if (strncmp(ahdr.ar_name, "__.SYMDEF", 9) == 0 && ahdr.ar_name[9] == ' ') { /* make hash table from __.SYMDEF */ lib_tbl = st_init_table(strcmp, st_strhash); data = (int*)xmalloc(size); if (data == NULL) goto syserr; size = read(fd, data, size); nsym = *data / sizeof(struct symdef); base = (struct symdef*)(data + 1); name_base = (char*)(base + nsym) + sizeof(int); while (nsym > 0) { char *name = name_base + base->str_index; st_insert(lib_tbl, name, base->lib_offset + sizeof(ahdr)); nsym--; base++; } for (;;) { target_offset = -1; st_foreach(undef_tbl, search_undef, lib_tbl); if (target_offset == -1) break; if (dln_load_1(fd, target_offset, 0) == -1) { st_free_table(lib_tbl); free(data); goto badlib; } if (undef_tbl->num_entries == 0) break; } free(data); st_free_table(lib_tbl); } else { /* linear library, need to scan (FUTURE) */ for (;;) { int offset = SARMAG; int found = 0; struct exec hdr; struct nlist *syms, *sym, *end; while (undef_tbl->num_entries > 0) { found = 0; lseek(fd, offset, 0); size = read(fd, &ahdr, sizeof(ahdr)); if (size == -1) goto syserr; if (size == 0) break; if (size != sizeof(ahdr) || sscanf(ahdr.ar_size, "%d", &size) != 1) { goto badlib; } offset += sizeof(ahdr); if (dln_load_header(fd, &hdr, offset) == -1) goto badlib; syms = dln_load_sym(fd, &hdr, offset); if (syms == NULL) goto badlib; sym = syms; end = syms + (hdr.a_syms / sizeof(struct nlist)); while (sym < end) { if (sym->n_type == N_EXT|N_TEXT && st_lookup(undef_tbl, sym->n_un.n_name, NULL)) { break; } sym++; } if (sym < end) { found++; free(syms); if (dln_load_1(fd, offset, 0) == -1) { goto badlib; } } offset += size; if (offset & 1) offset++; } if (found) break; } } close(fd); return 0; syserr: dln_errno = errno; badlib: if (fd >= 0) close(fd); return -1; } char * dln_strerror() { char *strerror(); switch (dln_errno) { case DLN_ECONFL: return "Symbol name conflict"; case DLN_ENOINIT: return "No inititalizer given"; case DLN_EUNDEF: return "Unresolved symbols"; case DLN_ENOTLIB: return "Not a library file"; case DLN_EBADLIB: return "Malformed library file"; case DLN_EINIT: return "Not initialized"; default: return strerror(dln_errno); } } dln_perror(str) char *str; { fprintf(stderr, "%s: %s\n", str, dln_strerror()); } void* dln_get_sym(name) char *name; { struct nlist *sym; if (st_lookup(sym_tbl, name, &sym)) return (void*)sym->n_value; return NULL; } #ifdef TEST xmalloc(size) int size; { return malloc(size); } xcalloc(size, n) int size, n; { return calloc(size, n); } main(argc, argv) int argc; char **argv; { if (dln_init(argv[0]) == -1) { dln_perror("dln_init"); exit(1); } while (argc > 1) { printf("obj: %s\n", argv[1]); if (dln_load(argv[1]) == -1) { dln_perror("dln_load"); exit(1); } argc--; argv++; } if (dln_load_lib("libdln.a") == -1) { dln_perror("dln_init"); exit(1); } if (dln_get_sym("_foo")) printf("_foo defined\n"); else printf("_foo undefined\n"); } #endif /* TEST */ #else /* USE_DLN */ int dln_init(file) char *file; { return 0; } int dln_load(file) char *file; { return 0; } int dln_load_lib(file) char *file; { return 0; } #endif /* USE_DLN */ ./ruby-0.64/dln.h100644 150 1 1433 5674170242 12115 0ustar matzdaemon/************************************************ dln.h - $Author: matz $ $Revision: 1.2 $ $Date: 1994/08/12 04:47:17 $ created at: Wed Jan 19 16:53:09 JST 1994 ************************************************/ #ifndef DLN_H #define DLN_H #include int dln_init(); int dln_load(); int dln_load_lib(); extern int dln_errno; #define DLN_ENOENT ENOENT /* No such file or directory */ #define DLN_ENOEXEC ENOEXEC /* Exec format error */ #define DLN_ECONFL 101 /* Symbol name conflict */ #define DLN_ENOINIT 102 /* No inititalizer given */ #define DLN_EUNDEF 103 /* Undefine symbol remains */ #define DLN_ENOTLIB 104 /* Not a library file */ #define DLN_EBADLIB 105 /* Malformed library file */ #define DLN_EINIT 106 /* Not initialized */ char *dln_strerror(); #endif ./ruby-0.64/enum.c100644 150 1 11525 5704462341 12320 0ustar matzdaemon/************************************************ enum.c - $Author: matz $ $Date: 1995/01/10 10:42:29 $ created at: Fri Oct 1 15:15:19 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" VALUE M_Enumerable; static ID id_each, id_match, id_cmp; void rb_each(obj) VALUE obj; { rb_funcall(obj, id_each, 0, Qnil); } static void enum_grep(i, arg) VALUE i, *arg; { if (rb_funcall(arg[0], id_match, 1, i)) { ary_push(arg[1], i); } } static void enum_grep2(i, pat) VALUE i, pat; { if (rb_funcall(pat, id_match, 1, i)) { rb_yield(i); } } static VALUE Fenum_grep(obj, pat) VALUE obj; { if (iterator_p()) { rb_iterate(rb_each, obj, enum_grep2, pat); return obj; } else { VALUE tmp, arg[2]; arg[0] = pat; arg[1] = tmp = ary_new(); rb_iterate(rb_each, obj, enum_grep, arg); return tmp; } } static void enum_find(i, foundp) VALUE i; int *foundp; { if (rb_yield(i)) { *foundp = TRUE; rb_break(); } } static VALUE Fenum_find(obj) VALUE obj; { int enum_found; enum_found = FALSE; rb_iterate(rb_each, obj, enum_find, &enum_found); return enum_found; } static void enum_find_all(i, tmp) VALUE i; { if (rb_yield(i)) { ary_push(tmp, i); } } static VALUE Fenum_find_all(obj) VALUE obj; { VALUE tmp; tmp = ary_new(); rb_iterate(rb_each, obj, enum_find_all, Qnil); return tmp; } static void enum_collect(i, tmp) VALUE i; { VALUE retval; retval = rb_yield(i); if (retval) { ary_push(tmp, retval); } } static VALUE Fenum_collect(obj) VALUE obj; { VALUE tmp; tmp = ary_new(); rb_iterate(rb_each, obj, enum_collect, tmp); return tmp; } static void enum_reverse(i, tmp) VALUE i, tmp; { ary_unshift(tmp, i); } static VALUE Fenum_reverse(obj) VALUE obj; { VALUE tmp; tmp = ary_new(); rb_iterate(rb_each, obj, enum_reverse, tmp); return tmp; } static void enum_all(i, ary) VALUE i, ary; { ary_push(ary, i); } static VALUE Fenum_to_a(obj) VALUE obj; { VALUE ary; ary = ary_new(); rb_iterate(rb_each, obj, enum_all, ary); return ary; } static VALUE Fenum_sort(obj) VALUE obj; { VALUE ary; ary = Fenum_to_a(obj); Fary_sort(ary); return ary; } static void enum_min(i, min) VALUE i, *min; { VALUE cmp; if (*min == Qnil) *min = i; else { cmp = rb_funcall(i, id_cmp, 1, *min); if (FIX2INT(cmp) < 0) *min = i; } } static VALUE Fenum_min(obj) VALUE obj; { VALUE min = Qnil; rb_iterate(rb_each, obj, enum_min, &min); return min; } static void enum_max(i, max) VALUE i, *max; { VALUE cmp; if (*max == Qnil) *max = i; else { cmp = rb_funcall(i, id_cmp, 1, *max); if (FIX2INT(cmp) > 0) *max = i; } } static VALUE Fenum_max(obj) VALUE obj; { VALUE max = Qnil; rb_iterate(rb_each, obj, enum_max, &max); return max; } struct i_v_pair { int i; VALUE v; int found; }; static void enum_index(item, iv) VALUE item; struct i_v_pair *iv; { if (rb_equal(item, 1, iv->v)) { iv->found = 1; rb_break(); } else { iv->i++; } } static VALUE Fenum_index(obj, val) VALUE obj; { struct i_v_pair iv; iv.i = 0; iv.v = val; iv.found = 0; rb_iterate(rb_each, obj, enum_index, &iv); if (iv.found) return INT2FIX(iv.i); return Qnil; /* not found */ } static void enum_includes(item, iv) VALUE item; struct i_v_pair *iv; { if (rb_equal(item, iv->v)) { iv->i = 1; rb_break(); } } static VALUE Fenum_includes(obj, val) VALUE obj; { struct i_v_pair iv; iv.i = 0; iv.v = val; rb_iterate(rb_each, obj, enum_includes, &iv); if (iv.i) return TRUE; return FALSE; } static void enum_length(i, length) VALUE i; int *length; { (*length)++; } static VALUE Fenum_length(obj) VALUE obj; { int length = 0; rb_iterate(rb_each, obj, enum_length, &length); return INT2FIX(length); } Init_Enumerable() { M_Enumerable = rb_define_module("Enumerable"); rb_define_method(M_Enumerable,"to_a", Fenum_to_a, 0); rb_define_method(M_Enumerable,"grep", Fenum_grep, 1); rb_define_method(M_Enumerable,"find", Fenum_find, 0); rb_define_method(M_Enumerable,"find_all", Fenum_find_all, 0); rb_define_method(M_Enumerable,"collect", Fenum_collect, 0); rb_define_method(M_Enumerable,"reverse", Fenum_reverse, 0); rb_define_method(M_Enumerable,"min", Fenum_min, 0); rb_define_method(M_Enumerable,"max", Fenum_max, 0); rb_define_method(M_Enumerable,"index", Fenum_index, 1); rb_define_method(M_Enumerable,"includes", Fenum_includes, 1); rb_define_method(M_Enumerable,"length", Fenum_length, 0); id_each = rb_intern("each"); id_match = rb_intern("=~"); id_cmp = rb_intern("<=>"); } ./ruby-0.64/env.h100644 150 1 1106 5704462343 12125 0ustar matzdaemon/************************************************ env.h - $Author: matz $ $Revision: 1.8 $ $Date: 1995/01/10 10:42:30 $ created at: Mon Jul 11 11:53:03 JST 1994 ************************************************/ #ifndef ENV_H #define ENV_H extern struct ENVIRON { int argc; VALUE *argv; ID last_func; struct RClass *last_class; struct ENVIRON *prev; } *the_env; struct SCOPE { struct RBasic super; ID *local_tbl; VALUE *local_vars; int flags; } *the_scope; #define SCOPE_MALLOCED (1<<0) extern int rb_in_eval; #endif /* ENV_H */ ./ruby-0.64/error.c100644 150 1 5253 5704462344 12471 0ustar matzdaemon/************************************************ error.c - $Author: matz $ $Date: 1995/01/10 10:42:31 $ created at: Mon Aug 9 16:11:34 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "env.h" #include #include extern char *sourcefile; extern int sourceline; int nerrs; static void err_sprintf(buf, fmt, args) char *buf, *fmt; va_list args; { sprintf(buf, "%s:%d: ", sourcefile, sourceline); vsprintf((char*)buf+strlen(buf), fmt, args); if (buf[strlen(buf)-1] != '\n') strcat(buf, "\n"); } static void err_print(fmt, args) char *fmt; va_list args; { extern errstr; char buf[BUFSIZ]; err_sprintf(buf, fmt, args); if (rb_in_eval) { if (errstr == Qnil) { errstr = str_new2(buf); } else { str_cat(errstr, buf, strlen(buf)); } } else { fputs(buf, stderr); } } void yyerror(msg) char *msg; { static char *f; static int line; if (line == sourceline && strcmp(f, sourcefile) == 0) return; f = sourcefile; line = sourceline; Error("%s", msg); } Error(fmt, va_alist) char *fmt; va_dcl { va_list args; va_start(args); err_print(fmt, args); va_end(args); nerrs++; } Warning(fmt, va_alist) char *fmt; va_dcl { char buf[BUFSIZ]; va_list args; sprintf(buf, "warning: %s", fmt); va_start(args); err_print(buf, args); va_end(args); } Fatal(fmt, va_alist) char *fmt; va_dcl { va_list args; va_start(args); err_print(fmt, args); va_end(args); rb_exit(1); } Bug(fmt, va_alist) char *fmt; va_dcl { char buf[BUFSIZ]; va_list args; sprintf(buf, "[BUG] %s", fmt); va_start(args); err_print(buf, args); va_end(args); abort(); } Fail(fmt, va_alist) char *fmt; va_dcl { va_list args; char buf[BUFSIZ]; va_start(args); vsprintf(buf, fmt, args); va_end(args); rb_fail(str_new2(buf)); } rb_sys_fail(mesg) char *mesg; { char buf[BUFSIZ]; extern int errno; if (mesg == Qnil) sprintf(buf, "%s\n", strerror(errno)); else sprintf(buf, "%s - %s\n", strerror(errno), mesg); errno = 0; rb_fail(str_new2(buf)); } static char *builtin_types[] = { "Nil", "Object", "Class", "iClass", "Module", "Float", "String", "Regexp", "Array", "Fixnum", "Dict", "Data", "Method", "Struct", "Bignum", "Node", "Scope", "Cons", "Data", }; WrongType(x, t) VALUE x; int t; { Fail("wrong argument type %s (expected %s)", rb_class2name(CLASS_OF(x)), builtin_types[t]); } ./ruby-0.64/etc.c100644 150 1 7411 5704462345 12112 0ustar matzdaemon/************************************************ etc.c - $Author: matz $ $Date: 1995/01/10 10:42:32 $ created at: Tue Mar 22 18:39:19 JST 1994 ************************************************/ #include "ruby.h" #include #include char *getlogin(); static VALUE Fetc_getlogin(obj) VALUE obj; { char *login = getlogin(); if (login) return str_new2(login); return Qnil; } static VALUE setup_passwd(pwd) struct passwd *pwd; { if (pwd == Qnil) rb_sys_fail("/etc/passwd"); return struct_new("passwd", "name", str_new2(pwd->pw_name), "passwd", str_new2(pwd->pw_passwd), "uid", INT2FIX(pwd->pw_uid), "gid", INT2FIX(pwd->pw_gid), "gecos", str_new2(pwd->pw_gecos), "dir", str_new2(pwd->pw_dir), "shell", str_new2(pwd->pw_shell), #ifdef PW_CHANGE "change", INT2FIX(pwd->pw_change), #endif #ifdef PW_QUOTA "quota", INT2FIX(pwd->pw_quota), #endif #ifdef PW_AGE "age", INT2FIX(pwd->pw_age), #endif #ifdef PW_CLASS "class", str_new2(pwd->pw_class), #endif #ifdef PW_COMMENT "comment", str_new2(pwd->pw_comment), #endif #ifdef PW_EXPIRE "expire", INT2FIX(pwd->pw_expire), #endif Qnil); } static VALUE Fetc_getpwuid(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE id; int uid; struct passwd *pwd; if (rb_scan_args(argc, argv, "01", &id) == 1) { uid = NUM2INT(id); } else { uid = getuid(); } pwd = getpwuid(uid); if (pwd == Qnil) Fail("can't find user for %d", uid); return setup_passwd(pwd); } static VALUE Fetc_getpwnam(obj, nam) VALUE obj, nam; { struct passwd *pwd; Check_Type(nam, T_STRING); pwd = getpwnam(RSTRING(nam)->ptr); if (pwd == Qnil) Fail("can't find user for %s", RSTRING(nam)->ptr); return setup_passwd(pwd); } static VALUE Fetc_passwd(obj) VALUE obj; { struct passwd *pw; if (iterator_p()) { setpwent(); while (pw = getpwent()) { rb_yield(setup_passwd(pw)); } endpwent(); return obj; } pw = getpwent(); if (pw == Qnil) Fail("can't fetch next -- /etc/passwd"); return setup_passwd(pw); } static VALUE setup_group(grp) struct group *grp; { VALUE mem; char **tbl; mem = ary_new(); tbl = grp->gr_mem; while (*tbl) { ary_push(mem, str_new2(*tbl)); tbl++; } return struct_new("group", "name", str_new2(grp->gr_name), "passwd", str_new2(grp->gr_passwd), "gid", INT2FIX(grp->gr_gid), "mem", mem, Qnil); } static VALUE Fetc_getgrgid(obj, id) VALUE obj, id; { int gid; struct group *grp; gid = NUM2INT(id); grp = getgrgid(gid); if (grp == Qnil) Fail("can't find group for %d", gid); return setup_group(grp); } static VALUE Fetc_getgrnam(obj, nam) VALUE obj, nam; { struct group *grp; Check_Type(nam, T_STRING); grp = getgrnam(RSTRING(nam)->ptr); if (grp == Qnil) Fail("can't find group for %s", RSTRING(nam)->ptr); return setup_group(grp); } static VALUE Fetc_group(obj) VALUE obj; { struct group *grp; if (iterator_p()) { setgrent(); while (grp = getgrent()) { rb_yield(setup_group(grp)); } endgrent(); return obj; } return setup_group(getgrent()); } VALUE M_Etc; Init_Etc() { M_Etc = rb_define_module("Etc"); rb_define_module_function(M_Etc, "getlogin", Fetc_getlogin, 0); rb_define_module_function(M_Etc, "getpwuid", Fetc_getpwuid, -1); rb_define_module_function(M_Etc, "getpwnam", Fetc_getpwnam, 1); rb_define_module_function(M_Etc, "passwd", Fetc_passwd, 0); rb_define_module_function(M_Etc, "getgrgid", Fetc_getgrgid, 1); rb_define_module_function(M_Etc, "getgrnam", Fetc_getgrnam, 1); rb_define_module_function(M_Etc, "group", Fetc_group, 0); } ./ruby-0.64/eval.c100644 150 1 125775 5704462347 12346 0ustar matzdaemon/************************************************ eval.c - $Author: matz $ $Date: 1995/01/10 10:42:34 $ created at: Thu Jun 10 14:22:17 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "ident.h" #include "env.h" #include "node.h" #include #include #include "st.h" void rb_clear_cache(); /* #define TEST /* prints cache miss */ #ifdef TEST #include #endif #define CACHE_SIZE 0x200 #define CACHE_MASK 0x1ff #define EXPR1(c,m) ((((int)(c)>>3)^(m))&CACHE_MASK) struct cache_entry { /* method hash table. */ ID mid; /* method's id */ struct RClass *class; /* receiver's class */ struct RClass *origin; /* where method defined */ NODE *method; int noex; }; static struct cache_entry cache[CACHE_SIZE]; static NODE* search_method(class, id, origin) struct RClass *class, **origin; ID id; { NODE *body; while (!st_lookup(class->m_tbl, id, &body)) { class = class->super; if (class == Qnil) return Qnil; } *origin = class; return body; } static NODE* rb_get_method_body(classp, idp, noexp) struct RClass **classp; ID *idp; int *noexp; { int pos, i; ID id = *idp; struct RClass *class = *classp; NODE *body; struct RClass *origin; struct cache_entry *ent; if ((body = search_method(class, id, &origin)) == Qnil) { return Qnil; } if (body->nd_body == Qnil) return Qnil; ent = cache + EXPR1(class, id); #ifdef TEST if (ent->mid != 0) { fprintf(stderr, "0x%x 0x%x %x\n", class, id, EXPR1(class, id)); } #endif /* store in cache */ ent->class = class; ent->noex = body->nd_noex; body = body->nd_body; if (nd_type(body) == NODE_FBODY) { *classp = ent->origin = (struct RClass*)body->nd_orig; *idp = ent->mid = body->nd_mid; body = ent->method = body->nd_head; } else { *classp = ent->origin = origin; ent->mid = id; ent->method = body; } if (noexp) *noexp = ent->noex; return body; } void rb_alias(class, name, def) struct RClass *class; ID name, def; { struct RClass *origin; NODE *body, *old; if (name == def) return; body = search_method(class, def, &origin); if (body == Qnil || body->nd_body == Qnil) { Fail("undefined method `%s' for class `%s'", rb_id2name(def), rb_class2name(class)); } if (st_lookup(class->m_tbl, name, &old)) { if (verbose) { Warning("redefine %s", rb_id2name(name)); } rb_clear_cache(old->nd_body); } st_insert(class->m_tbl, name, NEW_METHOD(NEW_FBODY(body->nd_body, def, origin), body->nd_noex)); } void rb_export_method(class, name, noex) struct RClass *class; ID name; int noex; { NODE *body; struct RClass *origin; body = search_method(class, name, &origin); if (body == Qnil) { Fail("undefined method `%s' for class `%s'", rb_id2name(name), rb_class2name(class)); } if (body->nd_noex != noex) { if (class == origin) { body->nd_noex = noex; } else { rb_add_method(class, name, NEW_ZSUPER(), noex); } } } VALUE rb_method_boundp(class, id) struct RClass *class; ID id; { if (rb_get_method_body(&class, &id, 0)) return TRUE; return FALSE; } void rb_clear_cache(body) NODE *body; { struct cache_entry *ent, *end; ent = cache; end = ent + CACHE_SIZE; while (ent < end) { if (ent->method == body) { ent->class = Qnil; ent->mid = Qnil; } ent++; } } void rb_clear_cache2(class) struct RClass *class; { struct cache_entry *ent, *end; ent = cache; end = ent + CACHE_SIZE; while (ent < end) { if (ent->origin == class) { ent->class = Qnil; ent->mid = Qnil; } ent++; } } static ID match, each, aref, aset; VALUE errstr, errat; extern NODE *eval_tree; extern int nerrs; extern VALUE TopSelf; VALUE Qself; #define PUSH_SELF(s) { \ VALUE __saved_self__ = Qself; \ Qself = s; \ #define POP_SELF() Qself = __saved_self__; } struct ENVIRON *the_env, *top_env; struct SCOPE *the_scope, *top_scope; #define PUSH_ENV() { \ struct ENVIRON _env; \ _env.prev = the_env; \ the_env = &_env; \ #define POP_ENV() the_env = _env.prev; } struct BLOCK { NODE *var; NODE *body; VALUE self; struct ENVIRON env; struct SCOPE *scope; int level; VALUE block; int iter; struct BLOCK *prev; } *the_block; #define PUSH_BLOCK(v,b) { \ struct BLOCK _block; \ _block.level = tag_level; \ _block.var=v; \ _block.body = b; \ _block.self = Qself; \ _block.env = *the_env; \ _block.scope = the_scope; \ _block.block = Qnil; \ _block.prev = the_block; \ the_block = &_block; \ #define PUSH_BLOCK2(b) { \ b->prev = the_block; \ the_block = b; \ #define POP_BLOCK() the_block = the_block->prev; } static struct iter { int iter; struct iter *prev; } *iter; #define ITER_NOT 0 #define ITER_PRE 1 #define ITER_CUR 2 #define PUSH_ITER(i) { \ struct iter _iter; \ _iter.prev = iter; \ _iter.iter = (i); \ iter = &_iter; \ #define POP_ITER() \ iter = _iter.prev; \ } static int tag_level, target_level; static struct tag { int level; jmp_buf buf; struct gc_list *gclist; VALUE self; struct ENVIRON *env; struct iter *iter; struct tag *prev; } *prot_tag; #define PUSH_TAG() { \ struct tag _tag; \ _tag.level= ++tag_level; \ _tag.self = Qself; \ _tag.env = the_env; \ _tag.iter = iter; \ _tag.prev = prot_tag; \ prot_tag = &_tag; \ #define EXEC_TAG() (setjmp(prot_tag->buf)) #define JUMP_TAG(val) { \ the_env = prot_tag->env; \ iter = prot_tag->iter; \ longjmp(prot_tag->buf,(val)); \ } #define POP_TAG() \ tag_level--; \ prot_tag = _tag.prev; \ } #define TAG_RETURN 1 #define TAG_BREAK 2 #define TAG_CONTINUE 3 #define TAG_RETRY 4 #define TAG_REDO 5 #define TAG_FAIL 6 #define TAG_EXIT 7 #define IN_BLOCK 0x08 static struct RClass *the_class; struct class_link { struct RClass *class; struct class_link *prev; } *class_link; #define PUSH_CLASS() { \ struct class_link _link; \ _link.class = the_class; \ _link.prev = class_link; \ class_link = &_link \ #define POP_CLASS() \ the_class = class_link->class; \ class_link = _link.prev; } #define PUSH_SCOPE() { \ struct SCOPE *_old; \ NEWOBJ(_scope, struct SCOPE); \ OBJSETUP(_scope, Qnil, T_SCOPE); \ _old = the_scope; \ the_scope = _scope; \ #define POP_SCOPE() the_scope = _old; } static VALUE rb_eval(); static VALUE Feval(); static VALUE rb_call(); VALUE rb_apply(); VALUE rb_xstring(); void rb_fail(); static VALUE masign(); static void asign(); static VALUE last_val; extern VALUE rb_stderr; extern int sourceline; extern char *sourcefile; VALUE rb_self() { return Qself; } static ID last_func; static void error_print() { if (errat) { fwrite(RSTRING(errat)->ptr, 1, RSTRING(errat)->len, stderr); if (last_func) { fprintf(stderr, ":in method `%s': ", rb_id2name(last_func)); } else { fprintf(stderr, ": "); } } if (errstr) { fwrite(RSTRING(errstr)->ptr, 1, RSTRING(errstr)->len, stderr); } else { fprintf(stderr, "unhandled failure.\n"); } rb_trap_exit(); exit(1); } void ruby_init(argc, argv, envp) int argc; char **argv, **envp; { int state; static struct ENVIRON env; the_env = top_env = &env; PUSH_SCOPE(); the_scope->local_vars = Qnil; the_scope->local_tbl = Qnil; top_scope = the_scope; PUSH_TAG(); PUSH_ITER(ITER_NOT); if ((state = EXEC_TAG()) == 0) { ruby_init0(argc, argv, envp); } POP_ITER(); POP_TAG(); POP_SCOPE(); the_scope = top_scope; if (state) { PUSH_TAG(); error_print(); POP_TAG(); } } VALUE rb_readonly_hook(); static VALUE Eval(toplevel) int toplevel; { VALUE result; NODE *tree; int state; tree = eval_tree; eval_tree = Qnil; sourcefile = tree->file; PUSH_TAG(); if ((state = EXEC_TAG()) == 0) { result = rb_eval(tree); } POP_TAG(); if (state) JUMP_TAG(state); return result; } ruby_run() { int state; if (nerrs > 0) exit(nerrs); Init_stack(); rb_define_variable("$!", &errstr, Qnil, Qnil, 0); errat = Qnil; /* clear for execution */ PUSH_TAG(); PUSH_ITER(ITER_NOT); if ((state = EXEC_TAG()) == 0) { the_class = (struct RClass*)C_Object; Eval(1); } POP_ITER(); POP_TAG(); switch (state) { case 0: break; case TAG_RETURN: Fatal("unexpected return"); break; case TAG_CONTINUE: Fatal("unexpected continue"); break; case TAG_BREAK: Fatal("unexpected break"); break; case TAG_REDO: Fatal("unexpected redo"); break; case TAG_RETRY: Fatal("retry outside of protect clause"); break; case TAG_FAIL: PUSH_TAG(); error_print(); POP_TAG(); break; case TAG_EXIT: rb_trap_exit(); exit(FIX2UINT(last_val)); break; default: Bug("Unknown longjmp status %d", state); break; } exit(0); } void rb_trap_eval(cmd) VALUE cmd; { int state; struct SCOPE *saved_scope; PUSH_SELF(TopSelf); PUSH_CLASS(); PUSH_TAG(); saved_scope = the_scope; the_scope = top_scope; the_class = (struct RClass*)C_Object; if ((state = EXEC_TAG()) == 0) { Feval(Qself, cmd); } the_scope = saved_scope; POP_TAG(); POP_CLASS(); POP_SELF(); switch (state) { case 0: break; case TAG_RETURN: Fatal("unexpected return"); break; case TAG_CONTINUE: Fatal("unexpected continue"); break; case TAG_BREAK: Fatal("unexpected break"); break; case TAG_REDO: Fatal("unexpected redo"); break; case TAG_RETRY: Fatal("retry outside of protect clause"); break; default: #ifdef SAFE_SIGHANDLE trap_immediate = 0; #endif JUMP_TAG(state); break; } } #define SETUP_ARGS {\ NODE *n = node->nd_args;\ if (!n) {\ argc = 0;\ argv = Qnil;\ }\ else if (/*nd_type(n) == NODE_LIST ||*/ nd_type(n) == NODE_ARRAY) {\ argc=n->nd_alen;\ if (argc > 0) {\ int i;\ n = node->nd_args;\ argv = ALLOCA_N(VALUE,argc);\ for (i=0;ind_head);\ n=n->nd_next;\ }\ }\ }\ else {\ VALUE args = rb_eval(n);\ if (TYPE(args) != T_ARRAY)\ args = rb_to_a(args);\ argc = RARRAY(args)->len;\ argv = ALLOCA_N(VALUE, argc);\ MEMCPY(argv, RARRAY(args)->ptr, VALUE, argc);\ }\ } static VALUE rb_eval(node) register NODE *node; { int state; int go_out; VALUE result; again: if (node == Qnil) return Qnil; sourceline = node->line; #ifdef SAFE_SIGHANDLE { extern int trap_pending; if (trap_pending) { rb_trap_exec(); } } #endif switch (nd_type(node)) { case NODE_BLOCK: while (node->nd_next) { rb_eval(node->nd_head); node = node->nd_next; } node = node->nd_head; goto again; case NODE_SELF: return Qself; case NODE_NIL: return Qnil; case NODE_IF: if (rb_eval(node->nd_cond)) { node = node->nd_body; } else { node = node->nd_else; } if (node) goto again; return Qnil; case NODE_CASE: { VALUE val; val = rb_eval(node->nd_head); node = node->nd_body; while (node) { if (nd_type(node) == NODE_WHEN) { NODE *tag = node->nd_head; while (tag) { if (rb_funcall(rb_eval(tag->nd_head), match, 1, val)){ return rb_eval(node->nd_body); } tag = tag->nd_next; } } else { return rb_eval(node); } node = node->nd_next; } } return Qnil; case NODE_EXNOT: { VALUE res; PUSH_TAG(); switch (state = EXEC_TAG()) { case 0: res = rb_eval(node->nd_cond); go_out = 0; break; case TAG_FAIL: res = Qnil; go_out = 0; break; default: go_out = 1; } POP_TAG(); if (go_out) JUMP_TAG(state); if (res) return FALSE; return TRUE; } case NODE_WHILE: PUSH_TAG(); switch (state = EXEC_TAG()) { case 0: while_cont: while (rb_eval(node->nd_cond)) { while_redo: rb_eval(node->nd_body); } go_out = 0; break; case TAG_REDO: goto while_redo; case TAG_CONTINUE: goto while_cont; default: go_out = 1; break; case TAG_BREAK: go_out = 0; break; } while_out: POP_TAG(); if (go_out) JUMP_TAG(state); return Qnil; case NODE_WHILE2: PUSH_TAG(); switch (state = EXEC_TAG()) { case 0: while2_cont: do { while2_redo: rb_eval(node->nd_body); } while (rb_eval(node->nd_cond)); go_out = 0; break; case TAG_REDO: goto while2_redo; case TAG_CONTINUE: goto while2_cont; default: go_out = 1; case TAG_BREAK: break; } while2_out: POP_TAG(); if (go_out) JUMP_TAG(state); return Qnil; case NODE_ITER: case NODE_FOR: { PUSH_BLOCK(node->nd_var, node->nd_body); PUSH_TAG(); state = EXEC_TAG(); if (state == 0) { if (nd_type(node) == NODE_ITER) { PUSH_ITER(ITER_PRE); result = rb_eval(node->nd_iter); POP_ITER(); } else { VALUE recv; recv = rb_eval(node->nd_iter); PUSH_ITER(ITER_PRE); result = rb_call(CLASS_OF(recv),recv,each,0,Qnil,0); POP_ITER(); } } POP_TAG(); POP_BLOCK(); switch (state) { case 0: break; case IN_BLOCK|TAG_BREAK: if (target_level != tag_level) { JUMP_TAG(state); } result = Qnil; break; case IN_BLOCK|TAG_RETRY: case IN_BLOCK|TAG_RETURN: if (target_level == tag_level) { state &= ~IN_BLOCK; } /* fall through */ default: JUMP_TAG(state); } } return result; case NODE_FAIL: { VALUE mesg = rb_eval(node->nd_stts); if (mesg) Check_Type(mesg, T_STRING); rb_fail(mesg); return Qnil; /* not reached */ } case NODE_YIELD: { VALUE val; val = rb_eval(node->nd_stts); result = rb_yield(val); } return result; case NODE_PROT: PUSH_TAG(); switch (state = EXEC_TAG()) { case 0: retry_entry: result = rb_eval(node->nd_head); break; case TAG_FAIL: if (node->nd_resq) { if (node->nd_resq == (NODE*)1) { state = 0; } else { PUSH_TAG(); state = EXEC_TAG(); if (state == 0) result = rb_eval(node->nd_resq); POP_TAG(); if (state == TAG_RETRY) { goto retry_entry; } } if (state == 0) { errstr = errat = Qnil; last_func = 0; } } break; } POP_TAG(); /* ensure clause */ rb_eval(node->nd_ensr); if (state != 0) { JUMP_TAG(state); } return result; case NODE_AND: if ((result = rb_eval(node->nd_1st)) == Qnil) return result; node = node->nd_2nd; goto again; case NODE_OR: if ((result = rb_eval(node->nd_1st)) != Qnil) return result; node = node->nd_2nd; goto again; case NODE_DOT3: if (node->nd_state == 0) { if (rb_eval(node->nd_beg)) { node->nd_state = 1; return TRUE; } return FALSE; } else { if (rb_eval(node->nd_end)) { node->nd_state = 0; } return TRUE; } break; case NODE_BREAK: JUMP_TAG(TAG_BREAK); break; case NODE_CONTINUE: JUMP_TAG(TAG_CONTINUE); break; case NODE_REDO: JUMP_TAG(TAG_REDO); break; case NODE_RETRY: JUMP_TAG(TAG_RETRY); break; case NODE_RETURN: if (node->nd_stts) last_val = rb_eval(node->nd_stts); JUMP_TAG(TAG_RETURN); break; case NODE_CALL: { VALUE recv; int argc; VALUE *argv; /* used in SETUP_ARGS */ PUSH_ITER(ITER_NOT); recv = node->nd_recv?rb_eval(node->nd_recv):Qself; SETUP_ARGS; POP_ITER(); return rb_call(CLASS_OF(recv),recv,node->nd_mid,argc,argv, node->nd_recv?0:1); } break; case NODE_SUPER: case NODE_ZSUPER: { int i; int argc; VALUE *argv; /* used in SETUP_ARGS */ if (nd_type(node) == NODE_ZSUPER) { argc = the_env->argc; argv = the_env->argv; } else { PUSH_ITER(ITER_NOT); SETUP_ARGS; POP_ITER(); } PUSH_ITER(iter->iter?ITER_PRE:ITER_NOT); result = rb_call(the_env->last_class->super, Qself, the_env->last_func, argc, argv, 1); POP_ITER(); } return result; case NODE_SCOPE: { VALUE result; PUSH_SCOPE(); PUSH_TAG(); if (node->nd_cnt > 0) { the_scope->local_vars = ALLOCA_N(VALUE, node->nd_cnt); MEMZERO(the_scope->local_vars, VALUE, node->nd_cnt); the_scope->local_tbl = node->nd_tbl; } else { the_scope->local_vars = Qnil; the_scope->local_tbl = Qnil; } if ((state = EXEC_TAG()) == 0) { result = rb_eval(node->nd_body); } POP_TAG(); if (!(the_scope->flags & SCOPE_MALLOCED)) { the_scope->local_vars = Qnil; the_scope->local_tbl = Qnil; } POP_SCOPE(); if (state != 0) JUMP_TAG(state); return result; } case NODE_OP_ASGN1: { VALUE recv, args, val; NODE *rval; recv = rb_eval(node->nd_recv); rval = node->nd_args->nd_head; args = rb_eval(node->nd_args->nd_next); val = rb_apply(recv, aref, args); val = rb_funcall(val, node->nd_mid, 1, rb_eval(rval)); ary_push(args, val); return rb_apply(recv, aset, args); } case NODE_OP_ASGN2: { ID id = node->nd_aid; VALUE recv, val; recv = rb_funcall(rb_eval(node->nd_recv), id, 0); id &= ~ID_SCOPE_MASK; id |= ID_ATTRSET; val = rb_eval(node->nd_value); return rb_funcall(recv, id, 1, val); } case NODE_MASGN: { VALUE val = rb_eval(node->nd_value); return masign(node, val); } case NODE_LASGN: if (the_scope->local_vars == Qnil) Bug("unexpected local variable asignment"); return the_scope->local_vars[node->nd_cnt] = rb_eval(node->nd_value); case NODE_GASGN: { VALUE val; val = rb_eval(node->nd_value); rb_gvar_set(node->nd_entry, val); return val; } case NODE_IASGN: { VALUE val; val = rb_eval(node->nd_value); rb_ivar_set(node->nd_vid, val); return val; } case NODE_CASGN: { VALUE val; val = rb_eval(node->nd_value); rb_const_set(the_class, node->nd_vid, val); return val; } break; case NODE_LVAR: if (the_scope->local_vars == Qnil) Bug("unexpected local variable"); return the_scope->local_vars[node->nd_cnt]; case NODE_GVAR: return rb_gvar_get(node->nd_entry); case NODE_IVAR: return rb_ivar_get(node->nd_vid); case NODE_MVAR: if (the_scope->flags & SCOPE_MALLOCED) { ID id = node->nd_vid, *tbl = the_scope->local_tbl; int i, len = tbl[0]; tbl++; for (i=0; ilocal_vars[i]; } } return rb_mvar_get(node->nd_vid); case NODE_CVAR: { VALUE val = rb_const_get(node->nd_vid); nd_set_type(node, NODE_CONST); node->nd_cval = val; return val; } case NODE_CONST: return node->nd_cval; case NODE_HASH: { NODE *list; VALUE hash = dic_new(); VALUE key, val; list = node->nd_head; while (list) { key = rb_eval(list->nd_head); list = list->nd_next; if (list == Qnil) Bug("odd number list for hash"); val = rb_eval(list->nd_head); list = list->nd_next; Fdic_aset(hash, key, val); } return hash; } break; case NODE_ZARRAY: /* zero length list */ return ary_new(); case NODE_ARRAY: { VALUE ary; int i; NODE *list; i = node->nd_alen; ary = ary_new2(i); for (i=0;node;node=node->nd_next) { RARRAY(ary)->ptr[i++] = rb_eval(node->nd_head); RARRAY(ary)->len = i; } return ary; } break; case NODE_STR: return str_new3(node->nd_lit); case NODE_STR2: case NODE_XSTR2: case NODE_DREGX: case NODE_DGLOB: { VALUE str, str2; NODE *list = node->nd_next; str = str_new3(node->nd_lit); while (list) { if (nd_type(list->nd_head) == NODE_STR) { str2 = list->nd_head->nd_lit; } else { str2 = rb_eval(list->nd_head); } if (str2) { str2 = obj_as_string(str2); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); } list = list->nd_next; } if (nd_type(node) == NODE_DREGX) { return regexp_new(RSTRING(str)->ptr, RSTRING(str)->len); } if (nd_type(node) == NODE_XSTR2) { return rb_xstring(str); } if (nd_type(node) == NODE_DGLOB) { return glob_new(str); } return str; } case NODE_XSTR: return rb_xstring(node->nd_lit); case NODE_LIT: return node->nd_lit; case NODE_ATTRSET: if (the_env->argc != 1) Fail("Wrong # of arguments(%d for 1)", the_env->argc); return rb_ivar_set(node->nd_vid, the_env->argv[0]); case NODE_DEFN: { if (node->nd_defn) { rb_add_method(the_class,node->nd_mid,node->nd_defn, node->nd_noex); } } return Qnil; case NODE_DEFS: { if (node->nd_defn) { VALUE recv = rb_eval(node->nd_recv); if (recv == Qnil) { Fail("Can't define method \"%s\" for nil", rb_id2name(node->nd_mid)); } rb_add_method(rb_single_class(recv), node->nd_mid, node->nd_defn, 0); } } return Qnil; case NODE_UNDEF: { rb_add_method(the_class, node->nd_mid, Qnil, 0); } return Qnil; case NODE_ALIAS: { rb_alias(the_class, node->nd_new, node->nd_old); } return Qnil; case NODE_CLASS: { VALUE super, class; if (node->nd_super) { super = rb_id2class(node->nd_super); if (super == Qnil) { Fail("undefined superclass %s", rb_id2name(node->nd_super)); } } else { super = C_Object; } if (class = rb_id2class(node->nd_cname)) { if (verbose) { Warning("redefine class %s", rb_id2name(node->nd_cname)); } } PUSH_SELF((VALUE)the_class); PUSH_CLASS(); the_class = (struct RClass*) rb_define_class_id(node->nd_cname, super); PUSH_TAG(); if ((state = EXEC_TAG()) == 0) { rb_eval(node->nd_body); } POP_TAG(); POP_CLASS(); POP_SELF(); if (state) JUMP_TAG(state); } return Qnil; case NODE_MODULE: { VALUE module; if (module = rb_id2class(node->nd_cname)) { if (verbose) { Warning("redefine module %s", rb_id2name(node->nd_cname)); } } PUSH_SELF((VALUE)the_class); PUSH_CLASS(); the_class = (struct RClass*)rb_define_module_id(node->nd_cname); PUSH_TAG(); if ((state = EXEC_TAG()) == 0) { rb_eval(node->nd_body); } POP_TAG(); POP_CLASS(); POP_SELF(); if (state) JUMP_TAG(state); } return Qnil; case NODE_INC: { struct RClass *module; module = (struct RClass*)rb_id2class(node->nd_modl); if (module == Qnil) { Fail("undefined module %s", rb_id2name(node->nd_modl)); } rb_include_module(the_class, module); } return Qnil; default: Bug("unknown node type %d", nd_type(node)); } return Qnil; /* not reached */ } VALUE obj_responds_to(obj, msg) VALUE obj; struct RString *msg; { ID id; if (FIXNUM_P(msg)) { id = FIX2INT(msg); } else { Check_Type(msg, T_STRING); id = rb_intern(msg->ptr); } if (rb_method_boundp(CLASS_OF(obj), id)) { return TRUE; } return FALSE; } void rb_exit(status) int status; { last_val = INT2FIX(status); if (prot_tag) JUMP_TAG(TAG_EXIT); exit(FIX2UINT(last_val)); } static VALUE Fexit(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE status; if (rb_scan_args(argc, argv, "01", &status) == 1) { Need_Fixnum(status); } else { status = INT2FIX(0); } last_val = status; JUMP_TAG(TAG_EXIT); return Qnil; /* not reached */ } void rb_break() { JUMP_TAG(TAG_BREAK); } void rb_redo() { JUMP_TAG(TAG_REDO); } void rb_retry() { JUMP_TAG(TAG_RETRY); } void rb_fail(mesg) VALUE mesg; { char buf[BUFSIZ]; if (errat == Qnil || sourcefile) { if (the_env->last_func) { last_func = the_env->last_func; } sprintf(buf, "%s:%d", sourcefile, sourceline); errat = str_new2(buf); } if (mesg) { if (RSTRING(mesg)->ptr[RSTRING(mesg)->len - 1] == '\n') { errstr = mesg; } else { errstr = str_clone(mesg); str_cat(errstr, "\n", 1); } } if (prot_tag->level == 0) error_print(); JUMP_TAG(TAG_FAIL); } VALUE iterator_p() { if (iter->iter) return TRUE; return FALSE; } static VALUE Fiterator_p() { if (iter->prev && iter->prev->iter) return TRUE; return FALSE; } VALUE rb_yield(val) VALUE val; { struct BLOCK *block; NODE *node; int state; VALUE result; struct ENVIRON *old_env; struct SCOPE *old_scope; if (!iterator_p()) { Fail("yield called out of iterator"); } block = the_block; old_env = the_env; the_env = &(block->env); old_scope = the_scope; the_scope = block->scope; the_block = block->prev; if (block->var) { if (nd_type(block->var) == NODE_MASGN) masign(block->var, val); else asign(block->var, val); } PUSH_ITER(block->iter); PUSH_SELF(block->self); PUSH_TAG(); node = block->body; switch (state = EXEC_TAG()) { redo: case 0: if (nd_type(node) == NODE_CFUNC) { result = (*node->nd_cfnc)(val,node->nd_argc); } else { result = rb_eval(node); } break; case TAG_REDO: goto redo; case TAG_CONTINUE: state = 0; break; case TAG_RETRY: case TAG_BREAK: case TAG_RETURN: target_level = block->level; state = IN_BLOCK|state; break; } POP_TAG(); POP_SELF(); POP_ITER(); the_block = block; the_env = old_env; the_scope = old_scope; if (state) JUMP_TAG(state); return result; } static VALUE masign(node, val) NODE *node; VALUE val; { NODE *list; int i, len; list = node->nd_head; if (val) { if (TYPE(val) != T_ARRAY) { val = rb_to_a(val); } len = RARRAY(val)->len; for (i=0; list && ind_head, RARRAY(val)->ptr[i]); list = list->nd_next; } if (node->nd_args) { if (!list && ind_args, ary_new4(len-i, RARRAY(val)->ptr+i)); } else { asign(node->nd_args, Qnil); } } } else if (node->nd_args) { asign(node->nd_args, Qnil); } while (list) { asign(list->nd_head, Qnil); list = list->nd_next; } return val; } static void asign(lhs, val) NODE *lhs; VALUE val; { switch (nd_type(lhs)) { case NODE_GASGN: rb_gvar_set(lhs->nd_entry, val); break; case NODE_IASGN: rb_ivar_set(lhs->nd_vid, val); break; case NODE_LASGN: if (the_scope->local_vars == Qnil) Bug("unexpected iterator variable asignment"); the_scope->local_vars[lhs->nd_cnt] = val; break; case NODE_CASGN: rb_const_set(the_class, lhs->nd_vid, val); break; case NODE_CALL: { VALUE recv; recv = rb_eval(lhs->nd_recv); if (lhs->nd_args->nd_head == Qnil) { /* attr set */ rb_funcall(recv, lhs->nd_mid, 1, val); } else { /* array set */ VALUE args; args = rb_eval(lhs->nd_args); RARRAY(args)->ptr[RARRAY(args)->len-1] = val; rb_apply(recv, lhs->nd_mid, args); } } break; default: Bug("bug in iterator variable asignment"); break; } } VALUE rb_iterate(it_proc, data1, bl_proc, data2) VALUE (*it_proc)(), (*bl_proc)(); char *data1, *data2; { int state; VALUE retval; NODE *node = NEW_CFUNC(bl_proc, data2); struct BLOCK block; PUSH_ITER(ITER_PRE); PUSH_BLOCK(Qnil, node); PUSH_TAG(); state = EXEC_TAG(); if (state == 0) { retval = (*it_proc)(data1); } POP_TAG(); POP_BLOCK(); POP_ITER(); switch (state) { case 0: break; case IN_BLOCK|TAG_BREAK: if (target_level != tag_level) { JUMP_TAG(state); } retval = Qnil; break; case IN_BLOCK|TAG_RETRY: case IN_BLOCK|TAG_RETURN: if (target_level == tag_level) { state &= ~IN_BLOCK; } /* fall through */ default: JUMP_TAG(state); } return retval; } VALUE rb_resque(b_proc, data1, r_proc, data2) VALUE (*b_proc)(), (*r_proc)(); char *data1, *data2; { int state; int go_out; VALUE result; PUSH_TAG(); switch (state = EXEC_TAG()) { case 0: retry_entry: result = (*b_proc)(data1); go_out = 0; break; case TAG_FAIL: if (r_proc) { PUSH_TAG(); state = EXEC_TAG(); if (state == 0) { result = (*r_proc)(data2); } POP_TAG(); switch (state) { case TAG_RETRY: goto retry_entry; case 0: go_out = 0; break; default: go_out = 1; break; } } if (state == 0) { errstr = errat = Qnil; } break; default: go_out = 1; break; } POP_TAG(); if (go_out) JUMP_TAG(state); return result; } VALUE rb_ensure(b_proc, data1, e_proc, data2) VALUE (*b_proc)(), (*e_proc)(); char *data1, *data2; { int state; VALUE result; PUSH_TAG(); if ((state = EXEC_TAG()) == 0) { result = (*b_proc)(data1); } POP_TAG(); (*e_proc)(data2); if (state != 0) { JUMP_TAG(state); } return result; } struct st_table *new_idhash(); static void rb_undefined(obj, id, noex) VALUE obj; ID id; int noex; { VALUE desc = obj_as_string(obj); char *format; if (RSTRING(desc)->len > 160) { desc = Fkrn_to_s(obj); } if (noex) format = "method `%s' not available for \"%s\"(%s)"; else format = "undefined method `%s' for \"%s\"(%s)"; Fail(format, rb_id2name(id), RSTRING(desc)->ptr, rb_class2name(CLASS_OF(obj))); } static VALUE rb_call(class, recv, mid, argc, argv, func) struct RClass *class; VALUE recv; ID mid; int argc; VALUE *argv; int func; { NODE *body; int noex; VALUE result; struct cache_entry *ent; int itr; /* is it in the method cache? */ ent = cache + EXPR1(class, mid); if (ent->mid == mid && ent->class == class) { /* if (ent->method == Qnil) rb_undefined(recv, mid, 0); */ class = ent->origin; mid = ent->mid; body = ent->method; noex = ent->noex; } else { ID id = mid; if ((body = rb_get_method_body(&class, &id, &noex)) == Qnil) { rb_undefined(recv, mid, 0); } mid = id; } if (!func && noex) rb_undefined(recv, mid, 1); switch (iter->iter) { case ITER_PRE: itr = ITER_CUR; break; case ITER_CUR: default: itr = ITER_NOT; break; } PUSH_ITER(itr); PUSH_SELF(recv); PUSH_ENV(); the_env->last_func = mid; the_env->last_class = class; the_env->argc = argc; the_env->argv = argv; switch (nd_type(body)) { case NODE_CFUNC: { int len = body->nd_argc; if (len >= 0 && argc != len) { Fail("Wrong # of arguments(%d for %d)", argc, len); } switch (len) { case -2: result = (*body->nd_cfnc)(recv, ary_new4(argc, argv)); break; case -1: result = (*body->nd_cfnc)(argc, argv, recv); break; case 0: result = (*body->nd_cfnc)(recv); break; case 1: result = (*body->nd_cfnc)(recv, argv[0]); break; case 2: result = (*body->nd_cfnc)(recv, argv[0], argv[1]); break; case 3: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2]); break; case 4: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3]); break; case 5: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4]); break; case 6: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5]); break; case 7: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6]); break; case 8: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7]); break; case 9: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8]); break; case 10: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8], argv[6], argv[7], argv[8], argv[9]); break; case 11: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8], argv[6], argv[7], argv[8], argv[9], argv[10]); break; case 12: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8], argv[6], argv[7], argv[8], argv[9], argv[10], argv[11]); break; case 13: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8], argv[6], argv[7], argv[8], argv[9], argv[10], argv[11], argv[12]); break; case 14: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8], argv[6], argv[7], argv[8], argv[9], argv[10], argv[11], argv[12], argv[13]); break; case 15: result = (*body->nd_cfnc)(recv, argv[0], argv[1], argv[2], argv[3], argv[4], argv[5], argv[6], argv[7], argv[8], argv[6], argv[7], argv[8], argv[9], argv[10], argv[11], argv[12], argv[13], argv[14]); break; default: if (len < 0) { Bug("bad argc(%d) specified for `%s(%s)'", len, rb_class2name(class), rb_id2name(mid)); } else { Fail("too many arguments(%d)", len); } break; } } break; /* for attr get/set */ case NODE_ATTRSET: case NODE_IVAR: return rb_eval(body); default: { int state; VALUE *local_vars; sourcefile = body->file; PUSH_SCOPE(); PUSH_TAG(); if (body->nd_cnt > 0) { local_vars = ALLOCA_N(VALUE, body->nd_cnt); MEMZERO(local_vars, VALUE, body->nd_cnt); the_scope->local_tbl = body->nd_tbl; the_scope->local_vars = local_vars; } else { local_vars = the_scope->local_vars = Qnil; the_scope->local_tbl = Qnil; } body = body->nd_body; if (nd_type(body) == NODE_BLOCK) { NODE *node = body->nd_head; NODE *local; int i; if (nd_type(node) != NODE_ARGS) { Bug("no argument-node"); } body = body->nd_next; i = node->nd_cnt; if (i > argc || (node->nd_rest == -1 && i < argc)) Fail("Wrong # of arguments(%d for %d)", argc, i); if (local_vars) { if (i > 0) { MEMCPY(local_vars, argv, VALUE, i); } if (node->nd_rest >= 0) { if (argc == 0) local_vars[node->nd_rest] = ary_new(); else local_vars[node->nd_rest] = ary_new4(argc-i, argv+i); } } } state = EXEC_TAG(); if (state == 0) { result = rb_eval(body); } POP_TAG(); if (!(the_scope->flags & SCOPE_MALLOCED)) { the_scope->local_vars = Qnil; the_scope->local_tbl = Qnil; } POP_SCOPE(); switch (state) { case 0: break; case TAG_CONTINUE: Fatal("unexpected continue"); break; case TAG_BREAK: Fatal("unexpected break"); break; case TAG_REDO: Fatal("unexpected redo"); break; case TAG_RETRY: Fatal("retry outside of protect clause"); break; case TAG_RETURN: result = last_val; break; default: JUMP_TAG(state); } } } POP_ENV(); POP_SELF(); POP_ITER(); return result; } VALUE rb_apply(recv, mid, args) VALUE recv; struct RArray *args; ID mid; { int argc; VALUE *argv; argc = RARRAY(args)->len; argv = ALLOCA_N(VALUE, argc); MEMCPY(argv, RARRAY(args)->ptr, VALUE, argc); return rb_call(CLASS_OF(recv), recv, mid, argc, argv, 1); } static VALUE Fapply(argc, argv, recv) int argc; VALUE *argv; VALUE recv; { VALUE vid, rest; ID mid; rb_scan_args(argc, argv, "1*", &vid, &rest); if (TYPE(vid) == T_STRING) { mid = rb_intern(RSTRING(vid)->ptr); } else { mid = NUM2INT(vid); } return rb_apply(recv, mid, rest); } #include VALUE rb_funcall(recv, mid, n, va_alist) VALUE recv; ID mid; int n; va_dcl { va_list ar; VALUE *argv; if (n > 0) { int i; argv = ALLOCA_N(VALUE, n); va_start(ar); for (i=0;iclass; } if ((state = EXEC_TAG()) == 0) { lex_setsrc("(eval)", src->ptr, src->len); eval_tree = Qnil; yyparse(); sourcefile = oldsrc; if (nerrs == 0) { result = Eval(0); } } eval_tree = node; POP_CLASS(); POP_TAG(); if (state) JUMP_TAG(state); if (nerrs > 0) { VALUE mesg; mesg = errstr; nerrs = 0; errstr = str_new2("syntax error in eval():\n"); str_cat(errstr, RSTRING(mesg)->ptr, RSTRING(mesg)->len); rb_fail(errstr); } return result; } VALUE rb_load_path; char *dln_find_file(); static char* find_file(file) char *file; { extern VALUE rb_load_path; VALUE sep, vpath; char *path, *found; if (file[0] == '/') return file; if (rb_load_path) { Check_Type(rb_load_path, T_ARRAY); sep = str_new2(":"); vpath = ary_join(rb_load_path, sep); path = RSTRING(vpath)->ptr; sep = Qnil; } else { path = Qnil; } found = dln_find_file(file, path); if (found == Qnil) Fail("No such file to load -- %s", file); return found; } VALUE Fload(obj, fname) VALUE obj; struct RString *fname; { int state, in_eval = rb_in_eval; NODE *node; char *file; Check_Type(fname, T_STRING); file = find_file(fname->ptr); #ifdef USE_DLN { static int rb_dln_init = 0; extern char *rb_dln_argv0; int len = strlen(file); if (len > 2 && file[len-1] == 'o' && file[len-2] == '.') { if (rb_dln_init == 0 && dln_init(rb_dln_argv0) == -1) { Fail("%s: %s", rb_dln_argv0, dln_strerror()); } if (dln_load(file) == -1) Fail(dln_strerror()); return TRUE; } } #endif PUSH_SELF(TopSelf); PUSH_TAG(); PUSH_CLASS(); the_class = (struct RClass*)C_Object; the_scope->local_vars = top_scope->local_vars; the_scope->local_tbl = top_scope->local_tbl; rb_in_eval = 1; state = EXEC_TAG(); if (state == 0) { rb_load_file(file); if (nerrs == 0) { Eval(0); } } POP_CLASS(); POP_TAG(); POP_SELF(); rb_in_eval = in_eval; if (nerrs > 0) { rb_fail(errstr); } if (state) JUMP_TAG(state); return TRUE; } static VALUE rb_loadfiles; Frequire(obj, fname) VALUE obj; struct RString *fname; { char *file; VALUE *p, *pend; Check_Type(fname, T_STRING); file = find_file(fname->ptr); p = RARRAY(rb_loadfiles)->ptr; pend = p + RARRAY(rb_loadfiles)->len; while (p < pend) { Check_Type(*p, T_STRING); if (strcmp(RSTRING(*p)->ptr, file) == 0) return FALSE; } ary_push(rb_loadfiles, str_new2(file)); Fload(obj, fname); return TRUE; } char *getenv(); char *strchr(); #ifndef RUBY_LIB #define RUBY_LIB "/usr/local/lib/ruby:." #endif #define RUBY_LIB_SEP ':' static void addpath(path) char *path; { char *p, *s; if (path == Qnil) return; p = s = path; while (*p) { while (*p == RUBY_LIB_SEP) p++; if (s = strchr(p, RUBY_LIB_SEP)) { ary_push(rb_load_path, str_new(p, (int)(s-p))); p = s + 1; } else { ary_push(rb_load_path, str_new2(p)); break; } } } extern VALUE C_Kernel; Init_load() { char *path; rb_load_path = ary_new(); rb_define_variable("$:", &rb_load_path, Qnil, rb_readonly_hook, 0); rb_define_variable("$LOAD_PATH", &rb_load_path, Qnil, rb_readonly_hook, 0); rb_loadfiles = ary_new(); rb_define_variable("$\"", &rb_load_path, Qnil, rb_readonly_hook, 0); rb_define_variable("$LOAD_FILES", &rb_load_path, Qnil, rb_readonly_hook,0); addpath(getenv("RUBYLIB")); addpath(RUBY_LIB); rb_define_private_method(C_Kernel, "load", Fload, 1); rb_define_private_method(C_Kernel, "require", Frequire, 1); } Init_eval() { match = rb_intern("=~"); each = rb_intern("each"); aref = rb_intern("[]"); aset = rb_intern("[]="); rb_global_variable(&top_scope); rb_global_variable(&eval_tree); rb_define_private_method(C_Kernel, "exit", Fexit, -1); rb_define_private_method(C_Kernel, "eval", Feval, 1); rb_define_private_method(C_Kernel, "iterator_p", Fiterator_p, 0); rb_define_method(C_Kernel, "apply", Fapply, -1); } void scope_dup(scope) struct SCOPE *scope; { ID *tbl; VALUE *vars; if (scope->flags & SCOPE_MALLOCED) return; if (!scope->local_tbl) return; tbl = scope->local_tbl; scope->local_tbl = ALLOC_N(ID, tbl[0]+1); MEMCPY(scope->local_tbl, tbl, ID, tbl[0]+1); vars = scope->local_vars; scope->local_vars = ALLOC_N(VALUE, tbl[0]); MEMCPY(scope->local_vars, vars, VALUE, tbl[0]); scope->flags |= SCOPE_MALLOCED; } VALUE C_Block; static ID blkdata; static void blk_mark(data) struct BLOCK *data; { gc_mark_env(&data->env); gc_mark(data->scope); gc_mark(data->var); gc_mark(data->body); gc_mark(data->self); } static void blk_free(data) struct BLOCK *data; { free(data->env.argv); } static VALUE Sblk_new(class) { VALUE blk; struct BLOCK *data; struct SCOPE *scope; if (!iterator_p() && !Fiterator_p()) { Fail("tryed to create Block out of iterator"); } if (the_block->block) return the_block->block; blk = obj_alloc(class); Make_Data_Struct(blk, blkdata, struct BLOCK, Qnil, blk_free, data); MEMCPY(data, the_block, struct BLOCK, 1); data->env.argv = ALLOC_N(VALUE, data->env.argc); MEMCPY(data->env.argv, the_block->env.argv, VALUE, data->env.argc); scope_dup(data->scope); the_block->block = blk; return blk; } VALUE blk_new() { return Sblk_new(C_Block); } static VALUE Fblk_do(blk, args) VALUE blk, args; { struct BLOCK *data; VALUE result; int state; switch (RARRAY(args)->len) { case 0: args = Qnil; break; case 1: args = RARRAY(args)->ptr[0]; break; } Get_Data_Struct(blk, blkdata, struct BLOCK, data); /* PUSH BLOCK from data */ PUSH_BLOCK2(data); PUSH_ITER(ITER_CUR); PUSH_TAG(); state = EXEC_TAG(); if (state == 0) { result = rb_yield(args); } POP_TAG(); POP_ITER(); POP_BLOCK(); switch (state) { case 0: break; case TAG_RETRY: case IN_BLOCK|TAG_RETRY: Fail("retry from block-closure"); break; case TAG_BREAK: case IN_BLOCK|TAG_BREAK: Fail("break from block-closure"); break; case TAG_RETURN: case IN_BLOCK|TAG_RETURN: Fail("return from block-closure"); break; default: JUMP_TAG(state); } return result; } Init_Block() { C_Block = rb_define_class("Block", C_Object); rb_define_single_method(C_Block, "new", Sblk_new, 0); rb_define_method(C_Block, "do", Fblk_do, -2); blkdata = rb_intern("blk"); } ./ruby-0.64/file.c100644 150 1 54730 5704462351 12301 0ustar matzdaemon /************************************************ file.c - $Author: matz $ $Date: 1995/01/10 10:42:36 $ created at: Mon Nov 15 12:24:34 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include #include #include "ruby.h" #include "io.h" #ifdef HAVE_UNISTD_H #include #endif char *strdup(); extern VALUE C_IO; VALUE C_File; VALUE M_FileTest; VALUE time_new(); VALUE file_open(fname, mode) char *fname, *mode; { VALUE port; OpenFile *fptr; port = obj_alloc(C_File); MakeOpenFile(port, fptr); fptr->mode = io_mode_flags(mode); fptr->f = fopen(fname, mode); if (fptr->f == NULL) { if (errno == EMFILE) { gc(); fptr->f = fopen(fname, mode); } if (fptr->f == NULL) { rb_sys_fail(fname); } } fptr->path = strdup(fname); return port; } static int apply2files0(func, args, arg, gl) void (*func)(); struct RArray *args; void *arg; int gl; { int i, n; VALUE path; for (i=n=0; ilen; i++) { path = args->ptr[i]; if (TYPE(path) == T_STRING) { if (gl) { char buf[MAXPATHLEN]; char *p, *s; s = buf; p = RSTRING(path)->ptr; while (*p) { switch (*s = *p++) { case '*': case '?': case '[': case '{': path = glob_new(path); goto glob; case '\\': if (*p == '\0') break; *s = *p++; } s++; } *s = '\0'; (*func)(buf, arg); } else { (*func)(RSTRING(path)->ptr, arg); } n++; } else { extern VALUE C_Glob; if (!obj_is_kind_of(path, C_Glob)) { WrongType(path, T_STRING); } glob: n += apply2files0(func, rb_to_a(path), arg, 0); } } return n; } #define apply2files(func,args,arg) apply2files0(func,args,arg,1) static VALUE Ffile_tell(obj) VALUE obj; { OpenFile *fptr; long pos; GetOpenFile(obj, fptr); pos = ftell(fptr->f); if (ferror(fptr->f) != 0) rb_sys_fail(Qnil); return int2inum(pos); } static VALUE Ffile_seek(obj, offset, ptrname) VALUE obj, offset, ptrname; { OpenFile *fptr; long pos; GetOpenFile(obj, fptr); pos = fseek(fptr->f, NUM2INT(offset), NUM2INT(ptrname)); if (pos != 0) rb_sys_fail(Qnil); clearerr(fptr->f); return obj; } static VALUE Ffile_set_pos(obj, offset) VALUE obj, offset; { OpenFile *fptr; long pos; GetOpenFile(obj, fptr); pos = fseek(fptr->f, NUM2INT(offset), 0); if (pos != 0) rb_sys_fail(Qnil); clearerr(fptr->f); return obj; } static VALUE Ffile_rewind(obj) VALUE obj; { OpenFile *fptr; GetOpenFile(obj, fptr); if (fseek(fptr->f, 0L, 0) != 0) rb_sys_fail(Qnil); clearerr(fptr->f); return obj; } static VALUE Ffile_eof(obj) VALUE obj; { OpenFile *fptr; GetOpenFile(obj, fptr); if (feof(fptr->f) == 0) return FALSE; return TRUE; } static VALUE Ffile_path(obj) VALUE obj; { OpenFile *fptr; GetOpenFile(obj, fptr); return str_new2(fptr->path); } static VALUE Ffile_isatty(obj) VALUE obj; { return FALSE; } #include #include #include static VALUE stat_new(st) struct stat *st; { if (st == Qnil) Bug("stat_new() called with nil"); return struct_new("stat", "dev", INT2FIX((int)st->st_dev), "ino", INT2FIX((int)st->st_ino), "mode", INT2FIX((int)st->st_mode), "nlink", INT2FIX((int)st->st_nlink), "uid", INT2FIX((int)st->st_uid), "gid", INT2FIX((int)st->st_gid), #ifdef HAVE_ST_RDEV "rdev", INT2FIX((int)st->st_rdev), #else "rdev", INT2FIX(0), #endif "size", INT2FIX((int)st->st_size), #ifdef HAVE_ST_BLKSIZE "blksize", INT2FIX((int)st->st_blksize), #else "blksize", INT2FIX(0), #endif #ifdef HAVE_ST_BLOCKS "blocks", INT2FIX((int)st->st_blocks), #else "blocks", INT2FIX(0), #endif "atime", time_new(st->st_atime, 0), "mtime", time_new(st->st_mtime, 0), "ctime", time_new(st->st_ctime, 0), Qnil); } static char lastpath[MAXPATHLEN]; static struct stat laststat; cache_stat(path, st) char *path; struct stat *st; { if (strcmp(lastpath, path) == 0) { *st = laststat; return 0; } if (stat(path, st) == -1) return -1; strcpy(lastpath, path); laststat = *st; return 0; } static VALUE Sfile_stat(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) == -1) { rb_sys_fail(fname->ptr); } return stat_new(&st); } static VALUE Ffile_stat(obj) VALUE obj; { OpenFile *fptr; struct stat st; GetOpenFile(obj, fptr); if (fstat(fileno(fptr->f), &st) == -1) { rb_sys_fail(fptr->path); } return stat_new(&st); } static VALUE Sfile_lstat(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (lstat(fname->ptr, &st) == -1) { rb_sys_fail(fname->ptr); } return stat_new(&st); } static VALUE Ffile_lstat(obj) VALUE obj; { OpenFile *fptr; struct stat st; GetOpenFile(obj, fptr); if (lstat(fptr->path, &st) == -1) { rb_sys_fail(fptr->path); } return stat_new(&st); } #define HAS_GETGROUPS static int group_member(gid) GETGROUPS_T gid; { GETGROUPS_T egid; if (getgid() == gid || getegid() == gid) return TRUE; #ifdef HAS_GETGROUPS #ifndef NGROUPS #define NGROUPS 32 #endif { GETGROUPS_T gary[NGROUPS]; int anum; anum = getgroups(NGROUPS, gary); while (--anum >= 0) if (gary[anum] == gid) return TRUE; } #endif return FALSE; } #ifndef S_IXUGO # define S_IXUGO (S_IXUSR | S_IXGRP | S_IXOTH) #endif int eaccess(path, mode) char *path; int mode; { extern int group_member (); struct stat st; static int euid = -1; if (cache_stat(path, &st) < 0) return (-1); if (euid == -1) euid = geteuid (); if (euid == 0) { /* Root can read or write any file. */ if (mode != X_OK) return 0; /* Root can execute any file that has any one of the execute bits set. */ if (st.st_mode & S_IXUGO) return 0; } if (st.st_uid == euid) /* owner */ mode <<= 6; else if (group_member (st.st_gid)) mode <<= 3; if (st.st_mode & mode) return 0; return -1; } static VALUE Ftest_d(obj, fname) VALUE obj; struct RString *fname; { #ifndef S_ISDIR # define S_ISDIR(m) ((m & S_IFMT) == S_IFDIR) #endif struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (S_ISDIR(st.st_mode)) return TRUE; return FALSE; } static VALUE Ftest_p(obj, fname) VALUE obj; struct RString *fname; { #ifdef S_IFIFO # ifndef S_ISFIFO # define S_ISFIFO(m) ((m & S_IFMT) == S_IFIFO) # endif struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (S_ISFIFO(st.st_mode)) return TRUE; #endif return FALSE; } static VALUE Ftest_l(obj, fname) VALUE obj; struct RString *fname; { #ifndef S_ISLNK # ifdef _S_ISLNK # define S_ISLNK(m) _S_ISLNK(m) # else # ifdef _S_IFLNK # define S_ISLNK(m) ((m & S_IFMT) == _S_IFLNK) # else # ifdef S_IFLNK # define S_ISLNK(m) ((m & S_IFMT) == S_IFLNK) # endif # endif # endif #endif #ifdef S_ISLNK struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (S_ISLNK(st.st_mode)) return TRUE; #endif return FALSE; } Ftest_S(obj, fname) VALUE obj; struct RString *fname; { #ifndef S_ISSOCK # ifdef _S_ISSOCK # define S_ISSOCK(m) _S_ISSOCK(m) # else # ifdef _S_IFSOCK # define S_ISSOCK(m) ((m & S_IFMT) == _S_IFSOCK) # else # ifdef S_IFSOCK # define S_ISSOCK(m) ((m & S_IFMT) == S_IFSOCK) # endif # endif # endif #endif #ifdef S_ISSOCK struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (S_ISSOCK(st.st_mode)) return TRUE; #endif return FALSE; } static VALUE Ftest_b(obj, fname) VALUE obj; struct RString *fname; { #ifndef S_ISBLK # ifdef S_IFBLK # define S_ISBLK(m) ((m & S_IFMT) == S_IFBLK) # endif #endif #ifdef S_ISBLK struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (S_ISBLK(st.st_mode)) return TRUE; #endif return FALSE; } static VALUE Ftest_c(obj, fname) VALUE obj; struct RString *fname; { #ifndef S_ISCHR # define S_ISCHR(m) ((m & S_IFMT) == S_IFCHR) #endif struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (S_ISBLK(st.st_mode)) return TRUE; return FALSE; } static VALUE Ftest_e(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; return TRUE; } static VALUE Ftest_r(obj, fname) VALUE obj; struct RString *fname; { Check_Type(fname, T_STRING); if (eaccess(fname->ptr, R_OK) < 0) return FALSE; return TRUE; } static VALUE Ftest_R(obj, fname) VALUE obj; struct RString *fname; { Check_Type(fname, T_STRING); if (access(fname->ptr, R_OK) < 0) return FALSE; return TRUE; } static VALUE Ftest_w(obj, fname) VALUE obj; struct RString *fname; { Check_Type(fname, T_STRING); if (eaccess(fname->ptr, W_OK) < 0) return FALSE; return TRUE; } static VALUE Ftest_W(obj, fname) VALUE obj; struct RString *fname; { Check_Type(fname, T_STRING); if (access(fname->ptr, W_OK) < 0) return FALSE; return TRUE; } static VALUE Ftest_x(obj, fname) VALUE obj; struct RString *fname; { Check_Type(fname, T_STRING); if (eaccess(fname->ptr, X_OK) < 0) return FALSE; return TRUE; } static VALUE Ftest_X(obj, fname) VALUE obj; struct RString *fname; { Check_Type(fname, T_STRING); if (access(fname->ptr, X_OK) < 0) return FALSE; return TRUE; } static VALUE Ftest_f(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (S_ISREG(st.st_mode)) return TRUE; return FALSE; } static VALUE Ftest_z(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (st.st_size == 0) return TRUE; return FALSE; } static VALUE Ftest_s(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (st.st_size == 0) return FALSE; return int2inum(st.st_size); } static VALUE Ftest_owned(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (st.st_uid == geteuid()) return TRUE; return FALSE; } static VALUE Ftest_grpowned(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) return FALSE; if (st.st_gid == getegid()) return TRUE; return FALSE; } #if defined(S_ISUID) || defined(S_ISGID) || defined(S_ISVTX) static VALUE check3rdbyte(file, mode) char *file; int mode; { struct stat st; if (cache_stat(file, &st) < 0) return FALSE; if (st.st_mode & mode) return TRUE; return FALSE; } #endif static VALUE Ftest_suid(obj, fname) VALUE obj; struct RString *fname; { Check_Type(fname, T_STRING); #ifdef S_ISUID return check3rdbyte(fname->ptr, S_ISUID); #else return FALSE; #endif } static VALUE Ftest_sgid(obj, fname) VALUE obj; struct RString *fname; { Check_Type(fname, T_STRING); #ifdef S_ISGID return check3rdbyte(fname->ptr, S_ISGID); #else return FALSE; #endif } static VALUE Ftest_sticky(obj, fname) VALUE obj; struct RString *fname; { Check_Type(fname, T_STRING); #ifdef S_ISVTX return check3rdbyte(fname->ptr, S_ISVTX); #else return FALSE; #endif } static VALUE Sfile_type(obj, fname) VALUE obj; struct RString *fname; { struct stat st; char *t; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) rb_sys_fail(fname->ptr); if (S_ISREG(st.st_mode)) { t = "file"; } else if (S_ISDIR(st.st_mode)) { t = "directory"; } else if (S_ISCHR(st.st_mode)) { t = "characterSpecial"; } #ifdef S_ISBLK else if (S_ISBLK(st.st_mode)) { t = "blockSpecial"; } #endif #ifndef S_ISFIFO else if (S_ISFIFO(st.st_mode)) { t = "fifo"; } #endif #ifdef S_ISLNK else if (S_ISLNK(st.st_mode)) { t = "link"; } #endif #ifdef S_ISSOCK else if (S_ISSOCK(st.st_mode)) { t = "socket"; } #endif else { t = "unknown"; } return str_new2(t); } static VALUE Sfile_atime(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) rb_sys_fail(fname->ptr); return time_new(st.st_atime, 0); } static VALUE Ffile_atime(obj) VALUE obj; { OpenFile *fptr; struct stat st; GetOpenFile(obj, fptr); if (fstat(fileno(fptr->f), &st) == -1) { rb_sys_fail(fptr->path); } return time_new(st.st_atime, 0); } static VALUE Sfile_mtime(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) rb_sys_fail(fname->ptr); return time_new(st.st_mtime, 0); } static VALUE Ffile_mtime(obj) VALUE obj; { OpenFile *fptr; struct stat st; GetOpenFile(obj, fptr); if (fstat(fileno(fptr->f), &st) == -1) { rb_sys_fail(fptr->path); } return time_new(st.st_mtime, 0); } static VALUE Sfile_ctime(obj, fname) VALUE obj; struct RString *fname; { struct stat st; Check_Type(fname, T_STRING); if (cache_stat(fname->ptr, &st) < 0) rb_sys_fail(fname->ptr); return time_new(st.st_ctime, 0); } static VALUE Ffile_ctime(obj) VALUE obj; { OpenFile *fptr; struct stat st; GetOpenFile(obj, fptr); if (fstat(fileno(fptr->f), &st) == -1) { rb_sys_fail(fptr->path); } return time_new(st.st_ctime, 0); } static void chmod_internal(path, mode) char *path; int mode; { if (chmod(path, mode) == -1) rb_sys_fail(path); } static VALUE Sfile_chmod(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE vmode; VALUE rest; int mode, n; VALUE path; rb_scan_args(argc, argv, "1*", &vmode, &rest); mode = NUM2INT(vmode); n = apply2files(chmod_internal, rest, mode); return INT2FIX(n); } static VALUE Ffile_chmod(obj, vmode) VALUE obj, vmode; { OpenFile *fptr; int mode; mode = NUM2INT(vmode); GetOpenFile(obj, fptr); if (fchmod(fileno(fptr->f), mode) == -1) rb_sys_fail(fptr->path); return INT2FIX(0); } struct chown_args { int owner, group; }; static void chown_internal(path, args) char *path; struct chown_args *args; { if (chown(path, args->owner, args->group) < 0) rb_sys_fail(path); } static VALUE Sfile_chown(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE o, g, rest; struct chown_args arg; int n; rb_scan_args(argc, argv, "2*", &o, &g, &rest); if (o == Qnil) { arg.owner = -1; } else { arg.owner = NUM2INT(o); } if (g == Qnil) { arg.group = -1; } else { arg.group = NUM2INT(g); } n = apply2files(chown_internal, rest, &arg); return INT2FIX(n); } Ffile_chown(obj, owner, group) VALUE obj, owner, group; { OpenFile *fptr; int mode; GetOpenFile(obj, fptr); if (fchown(fileno(fptr->f), NUM2INT(owner), NUM2INT(group)) == -1) rb_sys_fail(fptr->path); return INT2FIX(0); } struct timeval *time_timeval(); static void utime_internal(path, tvp) char *path; struct timeval tvp[]; { if (utimes(path, tvp) < 0) rb_sys_fail(path); } static VALUE Sfile_utime(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE atime, mtime, rest; struct timeval tvp[2]; int n; rb_scan_args(argc, argv, "2*", &atime, &mtime, &rest); tvp[0] = *time_timeval(atime); tvp[1] = *time_timeval(mtime); n = apply2files(utime_internal, rest, tvp); return INT2FIX(n); } static VALUE Sfile_link(obj, from, to) VALUE obj; struct RString *from, *to; { Check_Type(from, T_STRING); Check_Type(to, T_STRING); if (link(from->ptr, to->ptr) < 0) rb_sys_fail(from->ptr); return INT2FIX(0); } static VALUE Sfile_symlink(obj, from, to) VALUE obj; struct RString *from, *to; { Check_Type(from, T_STRING); Check_Type(to, T_STRING); if (symlink(from->ptr, to->ptr) < 0) rb_sys_fail(from->ptr); return TRUE; } static VALUE Sfile_readlink(obj, path) VALUE obj; struct RString *path; { char buf[MAXPATHLEN]; int cc; Check_Type(path, T_STRING); if ((cc = readlink(path->ptr, buf, MAXPATHLEN)) < 0) rb_sys_fail(path->ptr); return str_new(buf, cc); } static void unlink_internal(path) char *path; { if (unlink(path) < 0) rb_sys_fail(path); } static VALUE Sfile_unlink(obj, args) VALUE obj; struct RArray *args; { int n; n = apply2files(unlink_internal, args, Qnil); return INT2FIX(n); } static VALUE Sfile_rename(obj, from, to) VALUE obj; struct RString *from, *to; { Check_Type(from, T_STRING); Check_Type(to, T_STRING); if (rename(from->ptr, to->ptr) == -1) rb_sys_fail(from->ptr); return INT2FIX(0); } static VALUE Sfile_umask(argc, argv) int argc; VALUE *argv; { VALUE mask; int omask; if (argc == 0) { int omask = umask(0); umask(omask); } else if (argc == 1) { omask = umask(NUM2INT(argv[1])); } else { Fail("wrong # of argument"); } return INT2FIX(omask); } static VALUE Sfile_truncate(obj, path, len) VALUE obj, len; struct RString *path; { Check_Type(path, T_STRING); if (truncate(path->ptr, NUM2INT(len)) < 0) rb_sys_fail(path->ptr); return TRUE; } static VALUE Ffile_truncate(obj, len) VALUE obj, len; { OpenFile *fptr; GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_WRITABLE)) { Fail("not opened for writing"); } if (ftruncate(fileno(fptr->f), NUM2INT(len)) < 0) rb_sys_fail(fptr->path); return TRUE; } static VALUE Ffile_fcntl(obj, req, arg) VALUE obj, req; struct RString *arg; { io_ctl(obj, req, arg, 0); return obj; } Init_File() { M_FileTest = rb_define_module("FileTest"); rb_define_method(M_FileTest, "d", Ftest_d, 1); rb_define_method(M_FileTest, "isdirectory", Ftest_d, 1); rb_define_method(M_FileTest, "a", Ftest_e, 1); rb_define_method(M_FileTest, "e", Ftest_e, 1); rb_define_method(M_FileTest, "exists", Ftest_e, 1); rb_define_method(M_FileTest, "r", Ftest_r, 1); rb_define_method(M_FileTest, "readable", Ftest_r, 1); rb_define_method(M_FileTest, "R", Ftest_R, 1); rb_define_method(M_FileTest, "w", Ftest_w, 1); rb_define_method(M_FileTest, "writable", Ftest_w, 1); rb_define_method(M_FileTest, "W", Ftest_W, 1); rb_define_method(M_FileTest, "x", Ftest_x, 1); rb_define_method(M_FileTest, "executable", Ftest_x, 1); rb_define_method(M_FileTest, "X", Ftest_X, 1); rb_define_method(M_FileTest, "f", Ftest_f, 1); rb_define_method(M_FileTest, "isfile", Ftest_f, 1); rb_define_method(M_FileTest, "z", Ftest_z, 1); rb_define_method(M_FileTest, "s", Ftest_s, 1); rb_define_method(M_FileTest, "size", Ftest_s, 1); rb_define_method(M_FileTest, "O", Ftest_owned, 1); rb_define_method(M_FileTest, "owned", Ftest_owned, 1); rb_define_method(M_FileTest, "G", Ftest_grpowned, 1); rb_define_method(M_FileTest, "p", Ftest_p, 1); rb_define_method(M_FileTest, "ispipe", Ftest_p, 1); rb_define_method(M_FileTest, "l", Ftest_l, 1); rb_define_method(M_FileTest, "issymlink", Ftest_l, 1); rb_define_method(M_FileTest, "S", Ftest_S, 1); rb_define_method(M_FileTest, "issocket", Ftest_S, 1); rb_define_method(M_FileTest, "b", Ftest_b, 1); rb_define_method(M_FileTest, "c", Ftest_c, 1); rb_define_method(M_FileTest, "u", Ftest_suid, 1); rb_define_method(M_FileTest, "setuid", Ftest_suid, 1); rb_define_method(M_FileTest, "g", Ftest_sgid, 1); rb_define_method(M_FileTest, "setgid", Ftest_sgid, 1); rb_define_method(M_FileTest, "k", Ftest_sticky, 1); C_File = rb_define_class("File", C_IO); rb_define_single_method(C_File, "stat", Sfile_stat, 1); rb_define_single_method(C_File, "lstat", Sfile_lstat, 1); rb_define_single_method(C_File, "type", Sfile_type, 1); rb_define_single_method(C_File, "atime", Sfile_atime, 1); rb_define_single_method(C_File, "mtime", Sfile_mtime, 1); rb_define_single_method(C_File, "ctime", Sfile_ctime, 1); rb_define_single_method(C_File, "utime", Sfile_utime, -1); rb_define_single_method(C_File, "chmod", Sfile_chmod, -1); rb_define_single_method(C_File, "chown", Sfile_chown, -1); rb_define_single_method(C_File, "link", Sfile_link, 2); rb_define_single_method(C_File, "symlink", Sfile_symlink, 2); rb_define_single_method(C_File, "readlink", Sfile_readlink, 1); rb_define_single_method(C_File, "unlink", Sfile_unlink, -2); rb_define_single_method(C_File, "delete", Sfile_unlink, -2); rb_define_single_method(C_File, "rename", Sfile_rename, 2); rb_define_single_method(C_File, "umask", Sfile_umask, -1); rb_define_single_method(C_File, "truncate", Sfile_truncate, 2); rb_include_module(CLASS_OF(C_File), M_FileTest); rb_define_method(C_File, "stat", Ffile_stat, 0); rb_define_method(C_File, "lstat", Ffile_lstat, 0); rb_define_method(C_File, "atime", Ffile_atime, 0); rb_define_method(C_File, "mtime", Ffile_mtime, 0); rb_define_method(C_File, "ctime", Ffile_ctime, 0); rb_define_method(C_File, "chmod", Ffile_chmod, 1); rb_define_method(C_File, "chown", Ffile_chown, 2); rb_define_method(C_File, "truncate", Ffile_truncate, 1); rb_define_method(C_File, "tell", Ffile_tell, 0); rb_define_method(C_File, "seek", Ffile_seek, 2); rb_define_method(C_File, "pos", Ffile_tell, 0); rb_define_method(C_File, "pos=", Ffile_set_pos, 1); rb_define_method(C_File, "rewind", Ffile_rewind, 0); rb_define_method(C_File, "isatty", Ffile_isatty, 0); rb_define_method(C_File, "eof", Ffile_eof, 0); rb_define_method(C_IO, "fcntl", Ffile_fcntl, 2); rb_define_method(C_File, "path", Ffile_path, 0); } ./ruby-0.64/fnmatch.c100644 150 1 10303 5674170243 12770 0ustar matzdaemon/* Copyright (C) 1991 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with the GNU C Library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include "config.h" #include #include "fnmatch.h" #if !defined (__GNU_LIBRARY__) && !defined (STDC_HEADERS) # if !defined (errno) extern int errno; # endif /* !errno */ #endif /* Match STRING against the filename pattern PATTERN, returning zero if it matches, FNM_NOMATCH if not. */ int fnmatch (pattern, string, flags) char *pattern; char *string; int flags; { register char *p = pattern, *n = string; register char c; if ((flags & ~__FNM_FLAGS) != 0) { errno = EINVAL; return (-1); } while ((c = *p++) != '\0') { switch (c) { case '?': if (*n == '\0') return (FNM_NOMATCH); else if ((flags & FNM_PATHNAME) && *n == '/') return (FNM_NOMATCH); else if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_PATHNAME) && n[-1] == '/'))) return (FNM_NOMATCH); break; case '\\': if (!(flags & FNM_NOESCAPE)) c = *p++; if (*n != c) return (FNM_NOMATCH); break; case '*': if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_PATHNAME) && n[-1] == '/'))) return (FNM_NOMATCH); for (c = *p++; c == '?' || c == '*'; c = *p++, ++n) if (((flags & FNM_PATHNAME) && *n == '/') || (c == '?' && *n == '\0')) return (FNM_NOMATCH); if (c == '\0') return (0); { char c1 = (!(flags & FNM_NOESCAPE) && c == '\\') ? *p : c; for (--p; *n != '\0'; ++n) if ((c == '[' || *n == c1) && fnmatch (p, n, flags & ~FNM_PERIOD) == 0) return (0); return (FNM_NOMATCH); } case '[': { /* Nonzero if the sense of the character class is inverted. */ register int not; if (*n == '\0') return (FNM_NOMATCH); if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_PATHNAME) && n[-1] == '/'))) return (FNM_NOMATCH); /* Make sure there is a closing `]'. If there isn't, the `[' is just a character to be matched. */ { register char *np; for (np = p; np && *np && *np != ']'; np++); if (np && !*np) { if (*n != '[') return (FNM_NOMATCH); goto next_char; } } not = (*p == '!' || *p == '^'); if (not) ++p; c = *p++; for (;;) { register char cstart = c, cend = c; if (!(flags & FNM_NOESCAPE) && c == '\\') cstart = cend = *p++; if (c == '\0') /* [ (unterminated) loses. */ return (FNM_NOMATCH); c = *p++; if ((flags & FNM_PATHNAME) && c == '/') /* [/] can never match. */ return (FNM_NOMATCH); if (c == '-' && *p != ']') { cend = *p++; if (!(flags & FNM_NOESCAPE) && cend == '\\') cend = *p++; if (cend == '\0') return (FNM_NOMATCH); c = *p++; } if (*n >= cstart && *n <= cend) goto matched; if (c == ']') break; } if (!not) return (FNM_NOMATCH); next_char: break; matched: /* Skip the rest of the [...] that already matched. */ while (c != ']') { if (c == '\0') /* [... (unterminated) loses. */ return (FNM_NOMATCH); c = *p++; if (!(flags & FNM_NOESCAPE) && c == '\\') /* 1003.2d11 is unclear if this is right. %%% */ ++p; } if (not) return (FNM_NOMATCH); } break; default: if (c != *n) return (FNM_NOMATCH); } ++n; } if (*n == '\0') return (0); return (FNM_NOMATCH); } ./ruby-0.64/fnmatch.h100644 150 1 2645 5674170243 12767 0ustar matzdaemon/* Copyright (C) 1991 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with the GNU C Library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _FNMATCH_H #define _FNMATCH_H 1 /* Bits set in the FLAGS argument to `fnmatch'. */ #define FNM_PATHNAME (1 << 0)/* No wildcard can ever match `/'. */ #define FNM_NOESCAPE (1 << 1)/* Backslashes don't quote special chars. */ #define FNM_PERIOD (1 << 2)/* Leading `.' is matched only explicitly. */ #define __FNM_FLAGS (FNM_PATHNAME|FNM_NOESCAPE|FNM_PERIOD) /* Value returned by `fnmatch' if STRING does not match PATTERN. */ #define FNM_NOMATCH 1 /* Match STRING against the filename pattern PATTERN, returning zero if it matches, FNM_NOMATCH if not. */ extern int fnmatch(); #endif /* fnmatch.h */ ./ruby-0.64/gc.c100644 150 1 30074 5704462353 11750 0ustar matzdaemon/************************************************ gc.c - $Author: matz $ $Date: 1995/01/10 10:42:37 $ created at: Tue Oct 5 09:44:46 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "env.h" #include "st.h" #include "node.h" #include #include void *malloc(); void *calloc(); void *realloc(); void gc(); void gc_mark(); void * xmalloc(size) unsigned long size; { void *mem; if (size == 0) size = 1; mem = malloc(size); if (mem == Qnil) { gc(); mem = malloc(size); if (mem == Qnil) Fatal("failed to allocate memory"); } return mem; } void * xcalloc(n, size) unsigned long n, size; { void *mem; mem = xmalloc(n * size); memset(mem, 0, n * size); return mem; } void * xrealloc(ptr, size) void *ptr; unsigned long size; { void *mem; mem = realloc(ptr, size); if (mem == Qnil) { gc(); mem = realloc(ptr, size); if (mem == Qnil) Fatal("failed to allocate memory(realloc)"); } return mem; } /* The way of garbage collecting which allows use of the cstack is due to */ /* Scheme In One Defun, but in C this time. * COPYRIGHT (c) 1989 BY * * PARADIGM ASSOCIATES INCORPORATED, CAMBRIDGE, MASSACHUSETTS. * * ALL RIGHTS RESERVED * Permission to use, copy, modify, distribute and sell this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of Paradigm Associates Inc not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. PARADIGM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL PARADIGM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. gjc@paradigm.com Paradigm Associates Inc Phone: 617-492-6079 29 Putnam Ave, Suite 6 Cambridge, MA 02138 */ #ifdef sparc #define FLUSH_REGISTER_WINDOWS asm("ta 3") #else #define FLUSH_REGISTER_WINDOWS /* empty */ #endif static int dont_gc; VALUE Sgc_enable() { int old = dont_gc; dont_gc = Qnil; return old; } VALUE Sgc_disable() { int old = dont_gc; dont_gc = TRUE; return old; } #include #include static Fgc_begin() { return Qnil; } static Fgc_end() { return Qnil; } VALUE M_GC; static struct gc_list { int n; VALUE *varptr; struct gc_list *next; } *Global_List = Qnil; void rb_global_variable(var) VALUE *var; { struct gc_list *tmp; tmp = (struct gc_list*)xmalloc(sizeof(struct gc_list)); tmp->next = Global_List; tmp->varptr = var; tmp->n = 1; Global_List = tmp; } struct RVALUE { union { struct { UINT flag; /* always 0 for freed obj */ struct RVALUE *next; } free; struct RBasic basic; struct RObject object; struct RClass class; struct RFloat flonum; struct RString string; struct RArray array; struct RRegexp regexp; struct RDict dict; struct RData data; struct RStruct rstruct; struct RBignum bignum; struct RNode node; struct RCons cons; struct SCOPE scope; } as; } *freelist = Qnil; struct heap_block { struct heap_block *next; struct RVALUE *beg; struct RVALUE *end; struct RVALUE body[1]; } *heap_link = Qnil; #define SEG_SLOTS 10000 #define SEG_SIZE (SEG_SLOTS*sizeof(struct RVALUE)) #define FREE_MIN 512 static void add_heap() { struct heap_block *block; struct RVALUE *p, *pend; block = (struct heap_block*)malloc(sizeof(*block) + SEG_SIZE); if (block == Qnil) Fatal("can't alloc memory"); block->next = heap_link; block->beg = &block->body[0]; block->end = block->beg + SEG_SLOTS; p = block->beg; pend = block->end; while (p < pend) { p->as.free.flag = 0; p->as.free.next = freelist; freelist = p; p++; } heap_link = block; } struct RBasic * newobj() { struct RBasic *obj; if (heap_link == Qnil) add_heap(); if (freelist) { retry: obj = (struct RBasic*)freelist; freelist = freelist->as.free.next; memset(obj, 0, sizeof(struct RVALUE)); return obj; } if (dont_gc) add_heap(); else gc(); goto retry; } VALUE data_new(datap, dfree, dmark) VALUE *datap; void (*dfree)(); void (*dmark)(); { extern VALUE C_Data; struct RData *data = (struct RData*)newobj(); OBJSETUP(data, C_Data, T_DATA); data->data = datap; data->dfree = dfree; data->dmark = dmark; return (VALUE)data; } extern st_table *rb_class_tbl; static VALUE *stack_start_ptr; static long looks_pointerp(p) struct RVALUE *p; { struct heap_block *heap = heap_link; if (FIXNUM_P(p)) return FALSE; while (heap) { if (heap->beg <= p && p < heap->end && ((((char*)p)-((char*)heap->beg))%sizeof(struct RVALUE)) == 0) return TRUE; heap = heap->next; } return FALSE; } static void mark_locations_array(x, n) VALUE *x; long n; { int j; VALUE p; for(j=0;j end) { tmp = start; start = end; end = tmp; } n = end - start; mark_locations_array(start,n); } static mark_entry(key, value) ID key; VALUE value; { gc_mark(value); return ST_CONTINUE; } static mark_tbl(tbl) st_table *tbl; { st_foreach(tbl, mark_entry, 0); } static mark_dicentry(key, value) ID key; VALUE value; { gc_mark(key); gc_mark(value); return ST_CONTINUE; } static mark_dict(tbl) st_table *tbl; { st_foreach(tbl, mark_dicentry, 0); } void gc_mark_maybe(obj) void *obj; { if (looks_pointerp(obj)) { gc_mark(obj); } } void gc_mark(obj) register struct RVALUE *obj; { if (obj == Qnil) return; if (FIXNUM_P(obj)) return; if (obj->as.basic.flags & FL_MARK) return; obj->as.basic.flags |= FL_MARK; switch (obj->as.basic.flags & T_MASK) { case T_NIL: case T_FIXNUM: Bug("gc_mark() called for broken object"); break; } switch (obj->as.basic.flags & T_MASK) { case T_ICLASS: gc_mark(obj->as.class.super); if (obj->as.class.c_tbl) mark_tbl(obj->as.class.c_tbl); mark_tbl(obj->as.class.m_tbl); break; case T_CLASS: gc_mark(obj->as.class.super); case T_MODULE: if (obj->as.class.c_tbl) mark_tbl(obj->as.class.c_tbl); mark_tbl(obj->as.class.m_tbl); gc_mark(obj->as.basic.class); break; case T_ARRAY: { int i, len = obj->as.array.len; VALUE *ptr = obj->as.array.ptr; for (i=0; i < len; i++) gc_mark(ptr[i]); } break; case T_DICT: mark_dict(obj->as.dict.tbl); break; case T_STRING: if (obj->as.string.orig) gc_mark(obj->as.string.orig); break; case T_DATA: if (obj->as.data.dmark) (*obj->as.data.dmark)(DATA_PTR(obj)); break; case T_OBJECT: case T_REGEXP: case T_FLOAT: case T_BIGNUM: break; case T_STRUCT: { int i, len = obj->as.rstruct.len; struct kv_pair *ptr = obj->as.rstruct.tbl; for (i=0; i < len; i++) gc_mark(ptr[i].value); } break; case T_SCOPE: { struct SCOPE *scope = (struct SCOPE*)obj; if (scope->local_vars) mark_locations_array(scope->local_vars, scope->local_tbl[0]); } break; case T_CONS: gc_mark(obj->as.cons.car); gc_mark(obj->as.cons.cdr); break; case T_NODE: gc_mark_maybe(obj->as.node.u1.node); gc_mark_maybe(obj->as.node.u2.node); gc_mark_maybe(obj->as.node.u3.node); return; /* no need to mark class & tbl */ default: Bug("gc_mark(): unknown data type %d", obj->as.basic.flags & T_MASK); } if (obj->as.basic.iv_tbl) mark_tbl(obj->as.basic.iv_tbl); gc_mark(obj->as.basic.class); } #define MIN_FREE_OBJ 512 static void obj_free(); static void gc_sweep() { struct heap_block *heap = heap_link; int freed = 0; freelist = Qnil; while (heap) { struct RVALUE *p, *pend; struct RVALUE *nfreelist; int n = 0; nfreelist = freelist; p = heap->beg; pend = heap->end; while (p < pend) { if (!(p->as.basic.flags & FL_MARK)) { if (p->as.basic.flags) obj_free(p); p->as.free.flag = 0; p->as.free.next = nfreelist; nfreelist = p; n++; } RBASIC(p)->flags &= ~FL_MARK; p++; } if (n == SEG_SLOTS) { struct heap_block *link = heap_link; if (heap != link) { while (link) { if (link->next && link->next == heap) { link->next = heap->next; break; } link = link->next; } if (link == Qnil) { Bug("non-existing heap at 0x%x", heap); } } free(heap); heap = link; } else { freed += n; freelist = nfreelist; } heap = heap->next; } if (freed < FREE_MIN) { add_heap(); } } static void obj_free(obj) struct RVALUE *obj; { switch (obj->as.basic.flags & T_MASK) { case T_NIL: case T_FIXNUM: Bug("obj_free() called for broken object"); break; } switch (obj->as.basic.flags & T_MASK) { case T_OBJECT: break; case T_MODULE: case T_CLASS: rb_clear_cache2(obj); st_free_table(obj->as.class.m_tbl); if (obj->as.class.c_tbl) st_free_table(obj->as.class.c_tbl); break; case T_STRING: if (obj->as.string.orig == Qnil) free(obj->as.string.ptr); break; case T_ARRAY: free(obj->as.array.ptr); break; case T_DICT: st_free_table(obj->as.dict.tbl); break; case T_REGEXP: reg_free(obj->as.regexp.ptr); free(obj->as.regexp.str); break; case T_DATA: if (obj->as.data.dfree) (*obj->as.data.dfree)(DATA_PTR(obj)); free(DATA_PTR(obj)); break; case T_ICLASS: /* iClass shares table with the module */ case T_FLOAT: case T_CONS: break; case T_STRUCT: free(obj->as.rstruct.name); free(obj->as.rstruct.tbl); break; case T_BIGNUM: free(obj->as.bignum.digits); break; case T_NODE: if (nd_type(obj) == NODE_SCOPE && obj->as.node.nd_tbl) { free(obj->as.node.nd_tbl); } return; /* no need to free iv_tbl */ case T_SCOPE: { struct SCOPE *scope = (struct SCOPE*)obj; if (scope->local_vars) free(scope->local_vars); if (scope->local_tbl) free(scope->local_tbl); } break; default: Bug("gc_sweep(): unknown data type %d", obj->as.basic.flags & T_MASK); } if (obj->as.basic.iv_tbl) st_free_table(obj->as.basic.iv_tbl); } void gc_mark_env(env) struct ENVIRON *env; { mark_locations_array(env->argv, env->argc); } void gc() { struct gc_list *list; struct ENVIRON *env; int i, max; jmp_buf save_regs_gc_mark; VALUE stack_end; if (dont_gc) return; dont_gc++; #ifdef C_ALLOCA alloca(0); #endif /* mark env stack */ for (env = the_env; env; env = env->prev) { gc_mark_env(env); } FLUSH_REGISTER_WINDOWS; /* This assumes that all registers are saved into the jmp_buf */ setjmp(save_regs_gc_mark); mark_locations((VALUE*)save_regs_gc_mark, (VALUE*)(((char*)save_regs_gc_mark)+sizeof(save_regs_gc_mark))); mark_locations(stack_start_ptr, (VALUE*) &stack_end); #if defined(THINK_C) mark_locations((VALUE*)((char*)stack_start_ptr + 2), (VALUE*)((char*)&stack_end + 2)); #endif /* mark protected global variables */ for (list = Global_List; list; list = list->next) { gc_mark(*list->varptr); } gc_mark_global_tbl(); mark_tbl(rb_class_tbl); gc_mark_trap_list(); gc_sweep(); dont_gc--; } Init_stack() { VALUE start; stack_start_ptr = &start; } Init_GC() { M_GC = rb_define_module("GC"); rb_define_single_method(M_GC, "start", gc, 0); rb_define_single_method(M_GC, "enable", Sgc_enable, 0); rb_define_single_method(M_GC, "disable", Sgc_disable, 0); rb_define_method(M_GC, "garbage_collect", gc, 0); } ./ruby-0.64/getopt.c100644 150 1 44163 5674170243 12665 0ustar matzdaemon/* Getopt for GNU. NOTE: getopt is now part of the C library, so if you don't know what "Keep this file name-space clean" means, talk to roland@gnu.ai.mit.edu before changing it! Copyright (C) 1987, 88, 89, 90, 91, 1992 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU Library General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include "config.h" #include /* This needs to come after some library #include to get __GNU_LIBRARY__ defined. */ #ifdef __GNU_LIBRARY__ #include #include #endif /* GNU C library. */ #ifndef __STDC__ #define const #endif /* If GETOPT_COMPAT is defined, `+' as well as `--' can introduce a long-named option. Because this is not POSIX.2 compliant, it is being phased out. */ #define GETOPT_COMPAT /* This version of `getopt' appears to the caller like standard Unix `getopt' but it behaves differently for the user, since it allows the user to intersperse the options with the other arguments. As `getopt' works, it permutes the elements of ARGV so that, when it is done, all the options precede everything else. Thus all application programs are extended to handle flexible argument order. Setting the environment variable POSIXLY_CORRECT disables permutation. Then the behavior is completely standard. GNU application programs can use a third alternative mode in which they can distinguish the relative order of options and other arguments. */ #include "getopt.h" /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ char *optarg = 0; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns EOF, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ int optind = 0; /* The next char to be scanned in the option-element in which the last option character we returned was found. This allows us to pick up the scan where we left off. If this is zero, or a null string, it means resume the scan by advancing to the next ARGV-element. */ static char *nextchar; /* Callers store zero here to inhibit the error message for unrecognized options. */ int opterr = 1; /* Describe how to deal with options that follow non-option ARGV-elements. If the caller did not specify anything, the default is REQUIRE_ORDER if the environment variable POSIXLY_CORRECT is defined, PERMUTE otherwise. REQUIRE_ORDER means don't recognize them as options; stop option processing when the first non-option is seen. This is what Unix does. This mode of operation is selected by either setting the environment variable POSIXLY_CORRECT, or using `+' as the first character of the list of option characters. PERMUTE is the default. We permute the contents of ARGV as we scan, so that eventually all the non-options are at the end. This allows options to be given in any order, even with programs that were not written to expect this. RETURN_IN_ORDER is an option available to programs that were written to expect options and other ARGV-elements in any order and that care about the ordering of the two. We describe each non-option ARGV-element as if it were the argument of an option with character code 1. Using `-' as the first character of the list of option characters selects this mode of operation. The special argument `--' forces an end of option-scanning regardless of the value of `ordering'. In the case of RETURN_IN_ORDER, only `--' can cause `getopt' to return EOF with `optind' != ARGC. */ static enum { REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER } ordering; #ifdef __GNU_LIBRARY__ #include #define my_index strchr #define my_bcopy(src, dst, n) memcpy ((dst), (src), (n)) #else /* Avoid depending on library functions or files whose names are inconsistent. */ char *getenv (); static char * my_index (string, chr) char *string; int chr; { while (*string) { if (*string == chr) return string; string++; } return 0; } static void my_bcopy (from, to, size) char *from, *to; int size; { int i; for (i = 0; i < size; i++) to[i] = from[i]; } #endif /* GNU C library. */ /* Handle permutation of arguments. */ /* Describe the part of ARGV that contains non-options that have been skipped. `first_nonopt' is the index in ARGV of the first of them; `last_nonopt' is the index after the last of them. */ static int first_nonopt; static int last_nonopt; /* Exchange two adjacent subsequences of ARGV. One subsequence is elements [first_nonopt,last_nonopt) which contains all the non-options that have been skipped so far. The other is elements [last_nonopt,optind), which contains all the options processed since those non-options were skipped. `first_nonopt' and `last_nonopt' are relocated so that they describe the new indices of the non-options in ARGV after they are moved. */ static void exchange (argv) char **argv; { int nonopts_size = (last_nonopt - first_nonopt) * sizeof (char *); char **temp = (char **) malloc (nonopts_size); /* Interchange the two blocks of data in ARGV. */ my_bcopy (&argv[first_nonopt], temp, nonopts_size); my_bcopy (&argv[last_nonopt], &argv[first_nonopt], (optind - last_nonopt) * sizeof (char *)); my_bcopy (temp, &argv[first_nonopt + optind - last_nonopt], nonopts_size); free(temp); /* Update records for the slots the non-options now occupy. */ first_nonopt += (optind - last_nonopt); last_nonopt = optind; } /* Scan elements of ARGV (whose length is ARGC) for option characters given in OPTSTRING. If an element of ARGV starts with '-', and is not exactly "-" or "--", then it is an option element. The characters of this element (aside from the initial '-') are option characters. If `getopt' is called repeatedly, it returns successively each of the option characters from each of the option elements. If `getopt' finds another option character, it returns that character, updating `optind' and `nextchar' so that the next call to `getopt' can resume the scan with the following option character or ARGV-element. If there are no more option characters, `getopt' returns `EOF'. Then `optind' is the index in ARGV of the first ARGV-element that is not an option. (The ARGV-elements have been permuted so that those that are not options now come last.) OPTSTRING is a string containing the legitimate option characters. If an option character is seen that is not listed in OPTSTRING, return '?' after printing an error message. If you set `opterr' to zero, the error message is suppressed but we still return '?'. If a char in OPTSTRING is followed by a colon, that means it wants an arg, so the following text in the same ARGV-element, or the text of the following ARGV-element, is returned in `optarg'. Two colons mean an option that wants an optional arg; if there is text in the current ARGV-element, it is returned in `optarg', otherwise `optarg' is set to zero. If OPTSTRING starts with `-' or `+', it requests different methods of handling the non-option ARGV-elements. See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above. Long-named options begin with `--' instead of `-'. Their names may be abbreviated as long as the abbreviation is unique or is an exact match for some defined option. If they have an argument, it follows the option name in the same ARGV-element, separated from the option name by a `=', or else the in next ARGV-element. When `getopt' finds a long-named option, it returns 0 if that option's `flag' field is nonzero, the value of the option's `val' field if the `flag' field is zero. The elements of ARGV aren't really const, because we permute them. But we pretend they're const in the prototype to be compatible with other systems. LONGOPTS is a vector of `struct option' terminated by an element containing a name which is zero. LONGIND returns the index in LONGOPT of the long-named option found. It is only valid when a long-named option has been found by the most recent call. If LONG_ONLY is nonzero, '-' as well as '--' can introduce long-named options. */ int _getopt_internal (argc, argv, optstring, longopts, longind, long_only) int argc; char *const *argv; const char *optstring; const struct option *longopts; int *longind; int long_only; { int option_index; optarg = 0; /* Initialize the internal data when the first call is made. Start processing options with ARGV-element 1 (since ARGV-element 0 is the program name); the sequence of previously skipped non-option ARGV-elements is empty. */ if (optind == 0) { first_nonopt = last_nonopt = optind = 1; nextchar = NULL; /* Determine how to handle the ordering of options and nonoptions. */ if (optstring[0] == '-') { ordering = RETURN_IN_ORDER; ++optstring; } else if (optstring[0] == '+') { ordering = REQUIRE_ORDER; ++optstring; } else if (getenv ("POSIXLY_CORRECT") != NULL) ordering = REQUIRE_ORDER; else ordering = PERMUTE; } if (nextchar == NULL || *nextchar == '\0') { if (ordering == PERMUTE) { /* If we have just processed some options following some non-options, exchange them so that the options come first. */ if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (last_nonopt != optind) first_nonopt = optind; /* Now skip any additional non-options and extend the range of non-options previously skipped. */ while (optind < argc && (argv[optind][0] != '-' || argv[optind][1] == '\0') #ifdef GETOPT_COMPAT && (longopts == NULL || argv[optind][0] != '+' || argv[optind][1] == '\0') #endif /* GETOPT_COMPAT */ ) optind++; last_nonopt = optind; } /* Special ARGV-element `--' means premature end of options. Skip it like a null option, then exchange with previous non-options as if it were an option, then skip everything else like a non-option. */ if (optind != argc && !strcmp (argv[optind], "--")) { optind++; if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (first_nonopt == last_nonopt) first_nonopt = optind; last_nonopt = argc; optind = argc; } /* If we have done all the ARGV-elements, stop the scan and back over any non-options that we skipped and permuted. */ if (optind == argc) { /* Set the next-arg-index to point at the non-options that we previously skipped, so the caller will digest them. */ if (first_nonopt != last_nonopt) optind = first_nonopt; return EOF; } /* If we have come to a non-option and did not permute it, either stop the scan or describe it to the caller and pass it by. */ if ((argv[optind][0] != '-' || argv[optind][1] == '\0') #ifdef GETOPT_COMPAT && (longopts == NULL || argv[optind][0] != '+' || argv[optind][1] == '\0') #endif /* GETOPT_COMPAT */ ) { if (ordering == REQUIRE_ORDER) return EOF; optarg = argv[optind++]; return 1; } /* We have found another option-ARGV-element. Start decoding its characters. */ nextchar = (argv[optind] + 1 + (longopts != NULL && argv[optind][1] == '-')); } if (longopts != NULL && ((argv[optind][0] == '-' && (argv[optind][1] == '-' || long_only)) #ifdef GETOPT_COMPAT || argv[optind][0] == '+' #endif /* GETOPT_COMPAT */ )) { const struct option *p; char *s = nextchar; int exact = 0; int ambig = 0; const struct option *pfound = NULL; int indfound = 0; extern int strncmp(); while (*s && *s != '=') s++; /* Test all options for either exact match or abbreviated matches. */ for (p = longopts, option_index = 0; p->name; p++, option_index++) if (!strncmp (p->name, nextchar, s - nextchar)) { if (s - nextchar == strlen (p->name)) { /* Exact match found. */ pfound = p; indfound = option_index; exact = 1; break; } else if (pfound == NULL) { /* First nonexact match found. */ pfound = p; indfound = option_index; } else /* Second nonexact match found. */ ambig = 1; } if (ambig && !exact) { if (opterr) fprintf (stderr, "%s: option `%s' is ambiguous\n", argv[0], argv[optind]); nextchar += strlen (nextchar); optind++; return '?'; } if (pfound != NULL) { option_index = indfound; optind++; if (*s) { /* Don't test has_arg with >, because some C compilers don't allow it to be used on enums. */ if (pfound->has_arg) optarg = s + 1; else { if (opterr) { if (argv[optind - 1][1] == '-') /* --option */ fprintf (stderr, "%s: option `--%s' doesn't allow an argument\n", argv[0], pfound->name); else /* +option or -option */ fprintf (stderr, "%s: option `%c%s' doesn't allow an argument\n", argv[0], argv[optind - 1][0], pfound->name); } nextchar += strlen (nextchar); return '?'; } } else if (pfound->has_arg == 1) { if (optind < argc) optarg = argv[optind++]; else { if (opterr) fprintf (stderr, "%s: option `%s' requires an argument\n", argv[0], argv[optind - 1]); nextchar += strlen (nextchar); return '?'; } } nextchar += strlen (nextchar); if (longind != NULL) *longind = option_index; if (pfound->flag) { *(pfound->flag) = pfound->val; return 0; } return pfound->val; } /* Can't find it as a long option. If this is not getopt_long_only, or the option starts with '--' or is not a valid short option, then it's an error. Otherwise interpret it as a short option. */ if (!long_only || argv[optind][1] == '-' #ifdef GETOPT_COMPAT || argv[optind][0] == '+' #endif /* GETOPT_COMPAT */ || my_index (optstring, *nextchar) == NULL) { if (opterr) { if (argv[optind][1] == '-') /* --option */ fprintf (stderr, "%s: unrecognized option `--%s'\n", argv[0], nextchar); else /* +option or -option */ fprintf (stderr, "%s: unrecognized option `%c%s'\n", argv[0], argv[optind][0], nextchar); } nextchar = (char *) ""; optind++; return '?'; } } /* Look at and handle the next option-character. */ { char c = *nextchar++; char *temp = my_index (optstring, c); /* Increment `optind' when we start to process its last character. */ if (*nextchar == '\0') ++optind; if (temp == NULL || c == ':') { if (opterr) { if (c < 040 || c >= 0177) fprintf (stderr, "%s: unrecognized option, character code 0%o\n", argv[0], c); else fprintf (stderr, "%s: unrecognized option `-%c'\n", argv[0], c); } return '?'; } if (temp[1] == ':') { if (temp[2] == ':') { /* This is an option that accepts an argument optionally. */ if (*nextchar != '\0') { optarg = nextchar; optind++; } else optarg = 0; nextchar = NULL; } else { /* This is an option that requires an argument. */ if (*nextchar != '\0') { optarg = nextchar; /* If we end this ARGV-element by taking the rest as an arg, we must advance to the next element now. */ optind++; } else if (optind == argc) { if (opterr) fprintf (stderr, "%s: option `-%c' requires an argument\n", argv[0], c); c = '?'; } else /* We already incremented `optind' once; increment it again when taking next ARGV-elt as argument. */ optarg = argv[optind++]; nextchar = NULL; } } return c; } } int getopt (argc, argv, optstring) int argc; char *const *argv; const char *optstring; { return _getopt_internal (argc, argv, optstring, (const struct option *) 0, (int *) 0, 0); } #ifdef TEST /* Compile with -DTEST to make an executable for use in testing the above definition of `getopt'. */ int main (argc, argv) int argc; char **argv; { int c; int digit_optind = 0; while (1) { int this_option_optind = optind ? optind : 1; c = getopt (argc, argv, "abc:d:0123456789"); if (c == EOF) break; switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (digit_optind != 0 && digit_optind != this_option_optind) printf ("digits occur in two different argv-elements.\n"); digit_optind = this_option_optind; printf ("option %c\n", c); break; case 'a': printf ("option a\n"); break; case 'b': printf ("option b\n"); break; case 'c': printf ("option c with value `%s'\n", optarg); break; case '?': break; default: printf ("?? getopt returned character code 0%o ??\n", c); } } if (optind < argc) { printf ("non-option ARGV-elements: "); while (optind < argc) printf ("%s ", argv[optind++]); printf ("\n"); } exit (0); } #endif /* TEST */ ./ruby-0.64/getopt.h100644 150 1 10371 5674170243 12664 0ustar matzdaemon/* Declarations for getopt. Copyright (C) 1989, 1990, 1991, 1992 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU Library General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _GETOPT_H #define _GETOPT_H 1 #ifdef __cplusplus extern "C" { #endif /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ extern char *optarg; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns EOF, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ extern int optind; /* Callers store zero here to inhibit the error message `getopt' prints for unrecognized options. */ extern int opterr; /* Describe the long-named options requested by the application. The LONG_OPTIONS argument to getopt_long or getopt_long_only is a vector of `struct option' terminated by an element containing a name which is zero. The field `has_arg' is: no_argument (or 0) if the option does not take an argument, required_argument (or 1) if the option requires an argument, optional_argument (or 2) if the option takes an optional argument. If the field `flag' is not NULL, it points to a variable that is set to the value given in the field `val' when the option is found, but left unchanged if the option is not found. To have a long-named option do something other than set an `int' to a compiled-in constant, such as set a value from `optarg', set the option's `flag' field to zero and its `val' field to a nonzero value (the equivalent single-letter option character, if there is one). For long options that have a zero `flag' field, `getopt' returns the contents of the `val' field. */ struct option { #if __STDC__ const char *name; #else char *name; #endif /* has_arg can't be an enum because some compilers complain about type mismatches in all the code that assumes it is an int. */ int has_arg; int *flag; int val; }; /* Names for the values of the `has_arg' field of `struct option'. */ enum _argtype { no_argument, required_argument, optional_argument }; #if __STDC__ #if defined(__GNU_LIBRARY__) /* Many other libraries have conflicting prototypes for getopt, with differences in the consts, in stdlib.h. To avoid compilation errors, only prototype getopt for the GNU C library. */ extern int getopt (int argc, char *const *argv, const char *shortopts); #else /* not __GNU_LIBRARY__ */ extern int getopt (); #endif /* not __GNU_LIBRARY__ */ extern int getopt_long (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind); extern int getopt_long_only (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind); /* Internal only. Users should not call this directly. */ extern int _getopt_internal (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind, int long_only); #else /* not __STDC__ */ extern int getopt (); extern int getopt_long (); extern int getopt_long_only (); extern int _getopt_internal (); #endif /* not __STDC__ */ #ifdef __cplusplus } #endif #endif /* _GETOPT_H */ ./ruby-0.64/getopt1.c100644 150 1 7043 5674170243 12722 0ustar matzdaemon/* Getopt for GNU. Copyright (C) 1987, 88, 89, 90, 91, 1992 Free Software Foundation, Inc. This file is part of the libiberty library. Libiberty is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. Libiberty is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with libiberty; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include "config.h" #ifdef LIBC /* For when compiled as part of the GNU C library. */ #include #endif #include "getopt.h" #ifndef __STDC__ #define const #endif #if defined(STDC_HEADERS) || defined(__GNU_LIBRARY__) || defined (LIBC) #include #else /* STDC_HEADERS or __GNU_LIBRARY__ */ char *getenv (); #endif /* STDC_HEADERS or __GNU_LIBRARY__ */ #if !defined (NULL) #define NULL 0 #endif int getopt_long (argc, argv, options, long_options, opt_index) int argc; char *const *argv; const char *options; const struct option *long_options; int *opt_index; { return _getopt_internal (argc, argv, options, long_options, opt_index, 0); } /* Like getopt_long, but '-' as well as '--' can indicate a long option. If an option that starts with '-' (not '--') doesn't match a long option, but does match a short option, it is parsed as a short option instead. */ int getopt_long_only (argc, argv, options, long_options, opt_index) int argc; char *const *argv; const char *options; const struct option *long_options; int *opt_index; { return _getopt_internal (argc, argv, options, long_options, opt_index, 1); } #ifdef TEST #include int main (argc, argv) int argc; char **argv; { int c; int digit_optind = 0; while (1) { int this_option_optind = optind ? optind : 1; int option_index = 0; static struct option long_options[] = { {"add", 1, 0, 0}, {"append", 0, 0, 0}, {"delete", 1, 0, 0}, {"verbose", 0, 0, 0}, {"create", 0, 0, 0}, {"file", 1, 0, 0}, {0, 0, 0, 0} }; c = getopt_long (argc, argv, "abc:d:0123456789", long_options, &option_index); if (c == EOF) break; switch (c) { case 0: printf ("option %s", long_options[option_index].name); if (optarg) printf (" with arg %s", optarg); printf ("\n"); break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (digit_optind != 0 && digit_optind != this_option_optind) printf ("digits occur in two different argv-elements.\n"); digit_optind = this_option_optind; printf ("option %c\n", c); break; case 'a': printf ("option a\n"); break; case 'b': printf ("option b\n"); break; case 'c': printf ("option c with value `%s'\n", optarg); break; case 'd': printf ("option d with value `%s'\n", optarg); break; case '?': break; default: printf ("?? getopt returned character code 0%o ??\n", c); } } if (optind < argc) { printf ("non-option ARGV-elements: "); while (optind < argc) printf ("%s ", argv[optind++]); printf ("\n"); } exit (0); } #endif /* TEST */ ./ruby-0.64/glob.c100644 150 1 6411 5674170243 12260 0ustar matzdaemon/************************************************ glob.c - $Author: matz $ $Date: 1994/12/09 09:47:52 $ created at: Mon Sep 12 18:56:43 JST 1994 ************************************************/ #include #include "ruby.h" #include "fnmatch.h" char *strdup(); VALUE C_Glob; struct glob_data { char **globs; }; static ID id_data; static void glob_free(data) struct glob_data *data; { char **globs = data->globs; while (*globs) { free(*globs); globs++; } free(data->globs); } #define isdelim(c) ((c)==' '||(c)=='\t'||(c)=='\n'||(c)=='\0') char *strchr(); char *strdup(); static int expand_brace(s, data, len) char *s; struct glob_data *data; int len; { char org[MAXPATHLEN], path[MAXPATHLEN]; char *pre, *post, *head, *p, *t; strcpy(org, s); pre = strchr(org, '{'); if (pre) post = strchr(pre, '}'); if (!pre || !post) { data->globs[len++] = strdup(s); REALLOC_N(data->globs, char*, len+1); return len; } memcpy(path, org, pre - org); p = org + (pre - org) + 1; head = path + (pre - org); while (p < post) { t = p; while (t < post) { if (*t == ',') break; t++; } memcpy(head, p, t-p); strcpy(head+(t-p), post+1); len = expand_brace(path, data, len); p = t + 1; } return len; } static VALUE glob_new0(class, str) VALUE class; struct RString *str; { VALUE new; struct glob_data *data; char *p1, *p2, *pend, *s; int len = 0; new = obj_alloc(class); Make_Data_Struct(new, id_data, struct glob_data, Qnil, glob_free, data); data->globs = ALLOC_N(char*, 1); p1 = p2 = str->ptr; pend = p1 + str->len; while (p1 < pend) { char s[MAXPATHLEN]; int d; while (isdelim(*p1)) p1++; p2 = p1; while (!isdelim(*p2)) p2++; d = p2 - p1; memcpy(s, p1, d); s[d] = '\0'; len = expand_brace(s, data, len); p1 = p2; } data->globs[len] = Qnil; return new; } VALUE glob_new(str) struct RString *str; { return glob_new0(C_Glob, str); } char **glob_filename(); static VALUE Fglob_each(glob) VALUE glob; { struct glob_data *data; char **patv, **fnames, **ff; Get_Data_Struct(glob, id_data, struct glob_data, data); for (patv = data->globs; *patv; patv++) { if (!glob_pattern_p(*patv)) { rb_yield(str_new2(*patv)); continue; } fnames = glob_filename(*patv); if (fnames == (char**)-1) rb_sys_fail(*patv); if (fnames[0] == Qnil) { rb_yield(str_new2(*patv)); } else { ff = fnames; while (*ff) { rb_yield(str_new2(*ff)); free(*ff); ff++; } } free(fnames); } return Qnil; } VALUE Fglob_match(glob, str) VALUE glob; struct RString *str; { struct glob_data *data; char **patv; Check_Type(str, T_STRING); Get_Data_Struct(glob, id_data, struct glob_data, data); patv = data->globs; while (*patv) { if (fnmatch(*patv, str->ptr, 0) != FNM_NOMATCH) return TRUE; patv++; } return FALSE; } extern VALUE M_Enumerable; Init_Glob() { C_Glob = rb_define_class("Glob", C_Object); rb_include_module(C_Glob, M_Enumerable); rb_define_single_method(C_Glob, "new", glob_new0, 1); rb_define_method(C_Glob, "each", Fglob_each, 0); rb_define_method(C_Glob, "=~", Fglob_match, 1); id_data = rb_intern("data"); } ./ruby-0.64/gnuglob.c100644 150 1 34407 5674170243 13020 0ustar matzdaemon/* File-name wildcard pattern matching for GNU. Copyright (C) 1985, 1988, 1989 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* To whomever it may concern: I have never seen the code which most Unix programs use to perform this function. I wrote this from scratch based on specifications for the pattern matching. --RMS. */ #include "config.h" #if defined (SHELL) # if defined (HAVE_STDLIB_H) # include # else # include "ansi_stdlib.h" # endif /* HAVE_STDLIB_H */ # include #endif #include #if !defined (SHELL) && (defined (_POSIX_VERSION) || defined (USGr3)) # if !defined (HAVE_DIRENT_H) # define HAVE_DIRENT_H # endif /* !HAVE_DIRENT_H */ #endif /* !SHELL && (_POSIX_VERSION || USGr3) */ #if defined (HAVE_DIRENT_H) # include # if !defined (direct) # define direct dirent # endif /* !direct */ # define D_NAMLEN(d) strlen ((d)->d_name) #else /* !HAVE_DIRENT_H */ # define D_NAMLEN(d) ((d)->d_namlen) # if defined (USG) # if defined (Xenix) # include # else /* !Xenix (but USG...) */ # include "ndir.h" # endif /* !Xenix */ # else /* !USG */ # include # endif /* !USG */ #endif /* !HAVE_DIRENT_H */ #if defined (_POSIX_SOURCE) /* Posix does not require that the d_ino field be present, and some systems do not provide it. */ # define REAL_DIR_ENTRY(dp) 1 #else # define REAL_DIR_ENTRY(dp) (dp->d_ino != 0) #endif /* _POSIX_SOURCE */ #if defined (USG) || defined (NeXT) # if !defined (HAVE_STRING_H) # define HAVE_STRING_H # endif /* !HAVE_STRING_H */ #endif /* USG || NeXT */ #if defined (HAVE_STRING_H) # include #else /* !HAVE_STRING_H */ # include #endif /* !HAVE_STRING_H */ #if defined (USG) # if !defined (isc386) # include # endif /* !isc386 */ # if defined (RISC6000) extern void bcopy (); # else /* !RISC6000 */ # define bcopy(s, d, n) ((void) memcpy ((d), (s), (n))) # endif /* !RISC6000 */ #endif /* USG */ #if defined(HAVE_ALLOCA_H) && !defined(__GNUC__) #include #else char *alloca (); #endif #include "fnmatch.h" /* If the opendir () on your system lets you open non-directory files, then we consider that not robust. Define OPENDIR_NOT_ROBUST in the SYSDEP_CFLAGS for your machines entry in machines.h. */ #if defined (OPENDIR_NOT_ROBUST) # if defined (SHELL) # include "posixstat.h" # else /* !SHELL */ # include # endif /* !SHELL */ #endif /* OPENDIR_NOT_ROBUST */ extern void *xmalloc (), *xrealloc (); #if !defined (HAVE_STDLIB_H) extern void free (); #endif /* !HAVE_STDLIB_H */ #if !defined (NULL) # if defined (__STDC__) # define NULL ((void *) 0) # else # define NULL 0x0 # endif /* __STDC__ */ #endif /* !NULL */ #if defined (SHELL) extern int interrupt_state; #endif /* SHELL */ /* Global variable which controls whether or not * matches .*. Non-zero means don't match .*. */ int noglob_dot_filenames = 1; /* Global variable to return to signify an error in globbing. */ char *glob_error_return; /* Return nonzero if PATTERN has any special globbing chars in it. */ int glob_pattern_p (pattern) char *pattern; { register char *p = pattern; register char c; int open = 0; while ((c = *p++) != '\0') switch (c) { case '?': case '*': return (1); case '[': /* Only accept an open brace if there is a close */ open++; /* brace to match it. Bracket expressions must be */ continue; /* complete, according to Posix.2 */ case ']': if (open) return (1); continue; case '\\': if (*p++ == '\0') return (0); } return (0); } /* Remove backslashes quoting characters in PATHNAME by modifying PATHNAME. */ static void dequote_pathname (pathname) char *pathname; { register int i, j; for (i = j = 0; pathname && pathname[i]; ) { if (pathname[i] == '\\') i++; pathname[j++] = pathname[i++]; if (!pathname[i - 1]) break; } pathname[j] = '\0'; } /* Return a vector of names of files in directory DIR whose names match glob pattern PAT. The names are not in any particular order. Wildcards at the beginning of PAT do not match an initial period. The vector is terminated by an element that is a null pointer. To free the space allocated, first free the vector's elements, then free the vector. Return 0 if cannot get enough memory to hold the pointer and the names. Return -1 if cannot access directory DIR. Look in errno for more information. */ char ** glob_vector (pat, dir) char *pat; char *dir; { struct globval { struct globval *next; char *name; }; DIR *d; register struct direct *dp; struct globval *lastlink; register struct globval *nextlink; register char *nextname; unsigned int count; int lose, skip; register char **name_vector; register unsigned int i; #if defined (OPENDIR_NOT_ROBUST) struct stat finfo; if (stat (dir, &finfo) < 0) return ((char **) &glob_error_return); if (!S_ISDIR (finfo.st_mode)) return ((char **) &glob_error_return); #endif /* OPENDIR_NOT_ROBUST */ d = opendir (dir); if (d == NULL) return ((char **) &glob_error_return); lastlink = 0; count = 0; lose = 0; skip = 0; /* If PAT is empty, skip the loop, but return one (empty) filename. */ if (!pat || !*pat) { nextlink = (struct globval *)alloca (sizeof (struct globval)); nextlink->next = lastlink; nextname = (char *) xmalloc (1); if (!nextname) lose = 1; else { lastlink = nextlink; nextlink->name = nextname; nextname[0] = '\0'; count++; } skip = 1; } /* Scan the directory, finding all names that match. For each name that matches, allocate a struct globval on the stack and store the name in it. Chain those structs together; lastlink is the front of the chain. */ while (!skip) { int flags; /* Flags passed to fnmatch (). */ #if defined (SHELL) /* Make globbing interruptible in the bash shell. */ if (interrupt_state) { closedir (d); lose = 1; goto lost; } #endif /* SHELL */ dp = readdir (d); if (dp == NULL) break; /* If this directory entry is not to be used, try again. */ if (!REAL_DIR_ENTRY (dp)) continue; /* If a dot must be explicity matched, check to see if they do. */ if (noglob_dot_filenames && dp->d_name[0] == '.' && pat[0] != '.') continue; flags = (noglob_dot_filenames ? FNM_PERIOD : 0) | FNM_PATHNAME; if (fnmatch (pat, dp->d_name, flags) != FNM_NOMATCH) { nextlink = (struct globval *) alloca (sizeof (struct globval)); nextlink->next = lastlink; nextname = (char *) xmalloc (D_NAMLEN (dp) + 1); if (nextname == NULL) { lose = 1; break; } lastlink = nextlink; nextlink->name = nextname; bcopy (dp->d_name, nextname, D_NAMLEN (dp) + 1); ++count; } } (void) closedir (d); if (!lose) { name_vector = (char **) xmalloc ((count + 1) * sizeof (char *)); lose |= name_vector == NULL; } /* Have we run out of memory? */ lost: if (lose) { /* Here free the strings we have got. */ while (lastlink) { free (lastlink->name); lastlink = lastlink->next; } #if defined (SHELL) if (interrupt_state) throw_to_top_level (); #endif /* SHELL */ return (NULL); } /* Copy the name pointers from the linked list into the vector. */ for (i = 0; i < count; ++i) { name_vector[i] = lastlink->name; lastlink = lastlink->next; } name_vector[count] = NULL; return (name_vector); } /* Return a new array which is the concatenation of each string in ARRAY to DIR. This function expects you to pass in an allocated ARRAY, and it takes care of free()ing that array. Thus, you might think of this function as side-effecting ARRAY. */ static char ** glob_dir_to_array (dir, array) char *dir, **array; { register unsigned int i, l; int add_slash; char **result; l = strlen (dir); if (l == 0) return (array); add_slash = dir[l - 1] != '/'; i = 0; while (array[i] != NULL) ++i; result = (char **) xmalloc ((i + 1) * sizeof (char *)); if (result == NULL) return (NULL); for (i = 0; array[i] != NULL; i++) { result[i] = (char *) xmalloc (l + (add_slash ? 1 : 0) + strlen (array[i]) + 1); if (result[i] == NULL) return (NULL); sprintf (result[i], "%s%s%s", dir, add_slash ? "/" : "", array[i]); } result[i] = NULL; /* Free the input array. */ for (i = 0; array[i] != NULL; i++) free (array[i]); free ((char *) array); return (result); } /* Do globbing on PATHNAME. Return an array of pathnames that match, marking the end of the array with a null-pointer as an element. If no pathnames match, then the array is empty (first element is null). If there isn't enough memory, then return NULL. If a file system error occurs, return -1; `errno' has the error code. */ char ** glob_filename (pathname) char *pathname; { char *strrchr(); char **result; unsigned int result_size; char *directory_name, *filename; unsigned int directory_len; result = (char **) xmalloc (sizeof (char *)); result_size = 1; if (result == NULL) return (NULL); result[0] = NULL; /* Find the filename. */ filename = strrchr (pathname, '/'); if (filename == NULL) { filename = pathname; directory_name = ""; directory_len = 0; } else { directory_len = (filename - pathname) + 1; directory_name = (char *) alloca (directory_len + 1); bcopy (pathname, directory_name, directory_len); directory_name[directory_len] = '\0'; ++filename; } /* If directory_name contains globbing characters, then we have to expand the previous levels. Just recurse. */ if (glob_pattern_p (directory_name)) { char **directories; register unsigned int i; if (directory_name[directory_len - 1] == '/') directory_name[directory_len - 1] = '\0'; directories = glob_filename (directory_name); if (directories == NULL) goto memory_error; else if (directories == (char **)&glob_error_return) return ((char **) &glob_error_return); else if (*directories == NULL) { free ((char *) directories); return ((char **) &glob_error_return); } /* We have successfully globbed the preceding directory name. For each name in DIRECTORIES, call glob_vector on it and FILENAME. Concatenate the results together. */ for (i = 0; directories[i] != NULL; ++i) { char **temp_results; /* Scan directory even on a NULL pathname. That way, `*h/' returns only directories ending in `h', instead of all files ending in `h' with a `/' appended. */ temp_results = glob_vector (filename, directories[i]); /* Handle error cases. */ if (temp_results == NULL) goto memory_error; else if (temp_results == (char **)&glob_error_return) /* This filename is probably not a directory. Ignore it. */ ; else { char **array; register unsigned int l; array = glob_dir_to_array (directories[i], temp_results); l = 0; while (array[l] != NULL) ++l; result = (char **)xrealloc(result, (result_size + l) * sizeof (char *)); if (result == NULL) goto memory_error; for (l = 0; array[l] != NULL; ++l) result[result_size++ - 1] = array[l]; result[result_size - 1] = NULL; /* Note that the elements of ARRAY are not freed. */ free ((char *) array); } } /* Free the directories. */ for (i = 0; directories[i]; i++) free (directories[i]); free ((char *) directories); return (result); } /* If there is only a directory name, return it. */ if (*filename == '\0') { result = (char **) xrealloc ((char *) result, 2 * sizeof (char *)); if (result == NULL) return (NULL); result[0] = (char *) xmalloc (directory_len + 1); if (result[0] == NULL) goto memory_error; bcopy (directory_name, result[0], directory_len + 1); result[1] = NULL; return (result); } else { char **temp_results; /* There are no unquoted globbing characters in DIRECTORY_NAME. Dequote it before we try to open the directory since there may be quoted globbing characters which should be treated verbatim. */ if (directory_len > 0) dequote_pathname (directory_name); /* We allocated a small array called RESULT, which we won't be using. Free that memory now. */ free (result); /* Just return what glob_vector () returns appended to the directory name. */ temp_results = glob_vector (filename, (directory_len == 0 ? "." : directory_name)); if (temp_results == NULL || temp_results == (char **)&glob_error_return) return (temp_results); return (glob_dir_to_array (directory_name, temp_results)); } /* We get to memory_error if the program has run out of memory, or if this is the shell, and we have been interrupted. */ memory_error: if (result != NULL) { register unsigned int i; for (i = 0; result[i] != NULL; ++i) free (result[i]); free ((char *) result); } #if defined (SHELL) if (interrupt_state) throw_to_top_level (); #endif /* SHELL */ return (NULL); } #if defined (TEST) main (argc, argv) int argc; char **argv; { unsigned int i; for (i = 1; i < argc; ++i) { char **value = glob_filename (argv[i]); if (value == NULL) puts ("Out of memory."); else if (value == &glob_error_return) perror (argv[i]); else for (i = 0; value[i] != NULL; i++) puts (value[i]); } exit (0); } #endif /* TEST. */ ./ruby-0.64/ident.h100644 150 1 746 5674170243 12432 0ustar matzdaemon/************************************************ ident.h - $Author: matz $ $Revision: 1.2 $ $Date: 1994/08/12 04:47:29 $ created at: Mon Jan 31 16:23:19 JST 1994 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #ifndef IDENT_H #define IDENT_H #define ID_SCOPE_MASK 0x07 #define ID_LOCAL 0x00 #define ID_ATTRSET 0x04 #define ID_INSTANCE 0x02 #define ID_GLOBAL 0x03 #define ID_CONST 0x06 #define ID_VARMASK 0x02 #endif ./ruby-0.64/inits.c100644 150 1 1663 5704462354 12470 0ustar matzdaemon/************************************************ inits.c - $Author: matz $ $Date: 1995/01/10 10:42:38 $ created at: Tue Dec 28 16:01:58 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" rb_call_inits() { Init_sym(); Init_var_tables(); Init_Object(); Init_GC(); Init_eval(); Init_Comparable(); Init_Enumerable(); Init_Numeric(); Init_Bignum(); Init_Array(); Init_Dict(); Init_Struct(); Init_String(); Init_Regexp(); Init_Glob(); Init_pack(); Init_Cons(); Init_Range(); Init_IO(); Init_Dir(); Init_Time(); Init_Random(); Init_process(); Init_Etc(); Init_load(); Init_Block(); Init_Math(); #ifdef USE_DBM Init_DBM(); #endif #ifdef HAVE_SOCKET Init_Socket(); #endif /* new Inits comes between here.. */ /* .. and here. */ Init_version(); } ./ruby-0.64/io.c100644 150 1 66001 5704462356 11770 0ustar matzdaemon/************************************************ io.c - $Author: matz $ $Date: 1995/01/10 10:42:39 $ created at: Fri Oct 15 18:08:59 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "io.h" #include #include #include #include #include #include VALUE rb_ad_string(); VALUE C_IO; extern VALUE C_File; VALUE rb_stdin, rb_stdout, rb_stderr, rb_defout; VALUE FS, OFS; VALUE RS, ORS; static VALUE argf; ID id_write, id_fd, id_print_on; extern char *inplace; /* writing functions */ VALUE io_write(obj, str) VALUE obj; struct RString *str; { OpenFile *fptr; FILE *f; VALUE out; int n; if (TYPE(str) != T_STRING) str = (struct RString*)obj_as_string(str); GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_WRITABLE)) { Fail("not opened for writing"); } f = (fptr->f2) ? fptr->f2 : fptr->f; if (f == NULL) Fail("closed stream"); if (str->len == 0) return INT2FIX(0); n = fwrite(str->ptr, sizeof(char), str->len, f); if (n == 0 || ferror(f)) { rb_sys_fail(fptr->path); } if (fptr->mode & FMODE_SYNC) { fflush(f); } return INT2FIX(n); } static VALUE Fio_puts(obj, str) VALUE obj, str; { io_write(obj, str); return obj; } static VALUE Fio_flush(obj) VALUE obj; { OpenFile *fptr; FILE *f; GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_WRITABLE)) { Fail("not opend for writing"); } f = (fptr->f2) ? fptr->f2 : fptr->f; if (f == NULL) Fail("closed stream"); if (fflush(f) == EOF) rb_sys_fail(Qnil); return obj; } static VALUE Fio_eof(obj) VALUE obj; { OpenFile *fptr; int ch; GetOpenFile(obj, fptr); #ifdef STDSTDIO /* (the code works without this) */ if (fptr->f->_cnt > 0) /* cheat a little, since */ return FALSE; /* this is the most usual case */ #endif TRAP_BEG; ch = getc(fptr->f); TRAP_END; if (ch != EOF) { (void)ungetc(ch, fptr->f); return FALSE; } #ifdef STDSTDIO if (fptr->f->_cnt < -1) fptr->f->_cnt = -1; #endif return TRUE; } static VALUE Fio_sync(obj) VALUE obj; { OpenFile *fptr; GetOpenFile(obj, fptr); return (fptr->mode & FMODE_SYNC) ? TRUE : FALSE; } static VALUE Fio_set_sync(obj, mode) VALUE obj, mode; { OpenFile *fptr; GetOpenFile(obj, fptr); if (mode) { fptr->mode |= FMODE_SYNC; } else { fptr->mode &= ~FMODE_SYNC; } return mode; } static VALUE Fio_fileno(obj) VALUE obj; { OpenFile *fptr; int fd; GetOpenFile(obj, fptr); fd = fileno(fptr->f); return INT2FIX(fd); } /* reading functions */ static VALUE read_all(port) VALUE port; { OpenFile *fptr; VALUE str; char buf[BUFSIZ]; int n; GetOpenFile(port, fptr); if (!(fptr->mode & FMODE_READABLE)) { Fail("not opend for reading"); } if (fptr->f == NULL) Fail("closed stream"); str = str_new(0, 0); for (;;) { TRAP_BEG; n = fread(buf, 1, BUFSIZ, fptr->f); TRAP_END; if (n == 0) { if (feof(fptr->f)) break; rb_sys_fail(Qnil); } str_cat(str, buf, n); } return str; } static VALUE Fio_read(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { OpenFile *fptr; int n, lgt; VALUE len, str; if (rb_scan_args(argc, argv, "01", &len) == 0) { return read_all(obj); } lgt = NUM2INT(len); GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_READABLE)) { Fail("not opend for reading"); } if (fptr->f == NULL) Fail("closed stream"); str = str_new(0, lgt); TRAP_BEG; n = fread(RSTRING(str)->ptr, 1, RSTRING(str)->len, fptr->f); TRAP_END; if (n == 0) { if (feof(fptr->f)) return Qnil; rb_sys_fail(Qnil); } RSTRING(str)->len = n; RSTRING(str)->ptr[n] = '\0'; return str; } VALUE rb_lastline; static VALUE lineno; static VALUE Fio_gets(obj) VALUE obj; { OpenFile *fptr; FILE *f; struct RString *str; int c, newline; int rslen; GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_READABLE)) { Fail("not opend for reading"); } f = fptr->f; if (f == NULL) Fail("closed stream"); if (RS) { rslen = RSTRING(RS)->len; if (rslen == 0) { newline = '\n'; } else { newline = RSTRING(RS)->ptr[rslen-1]; } } else { newline = 0777; /* non matching char */ rslen = 1; } if (rslen == 0 && c == '\n') { do { TRAP_BEG; c = getc(f); TRAP_END; if (c != '\n') { ungetc(c,f); break; } } while (c != EOF); } { char buf[8192]; char *bp, *bpe = buf + sizeof buf - 3; char *ptr; int append = 0; again: bp = buf; TRAP_BEG; while ((c = getc(f)) != EOF && (*bp++ = c) != newline && bp < bpe) ; TRAP_END; if (c == EOF && !append && bp == buf) { str = Qnil; goto return_gets; } if (append) str_cat(str, buf, bp - buf); else str = (struct RString*)str_new(buf, bp - buf); if (c != EOF && (c != newline || (rslen > 1 && (str->len < rslen || memcmp(str->ptr+str->len-rslen, RSTRING(RS)->ptr, rslen) ) ) ) ) { append = 1; goto again; } } return_gets: if (rslen == 0 && c == '\n') { while (c != EOF) { TRAP_BEG; c = getc(f); TRAP_END; if (c != '\n') { ungetc(c, f); break; } } } if (str) { fptr->lineno++; lineno = INT2FIX(fptr->lineno); return rb_lastline = (VALUE)str; } return Qnil; } static VALUE Fio_each(obj) VALUE obj; { VALUE str; while (str = Fio_gets(obj)) { rb_yield(str); } return Qnil; } static VALUE Fio_each_byte(obj) VALUE obj; { OpenFile *fptr; FILE *f; int c; GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_READABLE)) { Fail("not opend for reading"); } f = fptr->f; if (f == NULL) Fail("closed stream"); for (;;) { TRAP_BEG; c = getc(f); TRAP_END; if (c == EOF) break; rb_yield(INT2FIX(c & 0xff)); } if (ferror(f) != 0) rb_sys_fail(Qnil); return obj; } static VALUE Fio_getc(obj) VALUE obj; { OpenFile *fptr; FILE *f; int c; GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_READABLE)) { Fail("not opend for reading"); } f = fptr->f; if (f == NULL) Fail("closed stream"); TRAP_BEG; c = getc(f); TRAP_END; if (c == EOF) { if (ferror(f) != 0) rb_sys_fail(Qnil); return Qnil; } return INT2FIX(c & 0xff); } static VALUE Fio_isatty(obj) VALUE obj; { OpenFile *fptr; GetOpenFile(obj, fptr); if (fptr->f == NULL) Fail("closed stream"); if (isatty(fileno(fptr->f)) == 0) return FALSE; return TRUE; } static VALUE Fio_close(obj) VALUE obj; { OpenFile *fptr; GetOpenFile(obj, fptr); if (fptr->f2 != NULL) { fclose(fptr->f2); } if (fptr->f != NULL) { fclose(fptr->f); } fptr->f = fptr->f2 = NULL; if (fptr->pid) { rb_syswait(fptr->pid); fptr->pid = 0; } return Qnil; } static VALUE Fio_syswrite(obj, str) VALUE obj, str; { OpenFile *fptr; FILE *f; int n; if (TYPE(str) != T_STRING) str = obj_as_string(str); GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_WRITABLE)) { Fail("not opend for writing"); } f = (fptr->f2) ? fptr->f2 : fptr->f; if (f == NULL) Fail("closed stream"); n = write(fileno(f), RSTRING(str)->ptr, RSTRING(str)->len); if (n == -1) rb_sys_fail(Qnil); return INT2FIX(n); } static VALUE Fio_sysread(obj, len) VALUE obj, len; { OpenFile *fptr; int n, ilen; VALUE str; ilen = NUM2INT(len); GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_READABLE)) { Fail("not opend for reading"); } if (fptr->f == NULL) Fail("closed stream"); str = str_new(0, ilen); TRAP_BEG; n = read(fileno(fptr->f), RSTRING(str)->ptr, RSTRING(str)->len); TRAP_END; if (n == -1) rb_sys_fail(Qnil); if (n == 0) return Qnil; /* EOF */ RSTRING(str)->len = n; RSTRING(str)->ptr[n] = '\0'; return str; } void io_free_OpenFile(fptr) OpenFile *fptr; { if (fptr->f != NULL) { fclose(fptr->f); } if (fptr->f2 != NULL) { fclose(fptr->f2); } if (fptr->path) { free(fptr->path); } if (fptr->pid) { rb_syswait(fptr->pid); } } static VALUE Fio_binmode(obj) VALUE obj; { #ifdef MSDOS OpenFile *fptr; GetOpenFile(obj, fptr); if (setmode(fileno(fptr), O_BINARY) == -1) rb_sys_fail(Qnil); #endif return obj; } VALUE obj_alloc(); io_mode_flags(mode) char *mode; { int flags = 0; switch (mode[0]) { case 'r': flags |= FMODE_READABLE; break; case 'w': flags |= FMODE_WRITABLE; break; case 'a': flags |= FMODE_WRITABLE; break; default: Fail("illegal access mode"); } if (mode[1] == '+') { flags |= FMODE_READABLE | FMODE_WRITABLE; } return flags; } FILE * rb_fdopen(fd, mode) int fd; char *mode; { FILE *f; f = fdopen(fd, mode); if (f == NULL) { if (errno = EMFILE) { gc(); f = fdopen(fd, mode); } if (f == NULL) { rb_sys_fail(Qnil); } } return f; } static VALUE pipe_open(pname, mode) char *pname, *mode; { VALUE port; OpenFile *fptr; int pid, pr[2], pw[2]; int doexec; port = obj_alloc(C_IO); MakeOpenFile(port, fptr); fptr->mode = io_mode_flags(mode); if (((fptr->mode & FMODE_READABLE) && pipe(pr) == -1) || ((fptr->mode & FMODE_WRITABLE) && pipe(pw) == -1)) rb_sys_fail(Qnil); doexec = (strcmp("-", pname) != 0); if (!doexec) { fflush(stdin); /* is it really needed? */ fflush(stdout); fflush(stderr); } retry: switch (pid = (doexec?vfork():fork())) { case 0: /* child */ if (fptr->mode & FMODE_READABLE) { close(pr[0]); dup2(pr[1], 1); close(pr[1]); } if (fptr->mode & FMODE_WRITABLE) { close(pw[1]); dup2(pw[0], 0); close(pw[0]); } if (doexec) { rb_proc_exec(pname); _exit(127); } return Qnil; case -1: /* fork failed */ if (errno == EAGAIN) { sleep(5); goto retry; } break; default: /* parent */ if (fptr->mode & FMODE_READABLE) close(pr[1]); if (fptr->mode & FMODE_WRITABLE) close(pw[0]); } if (pid == -1) { close(pr[0]); close(pw[1]); rb_sys_fail(Qnil); } fptr->pid = pid; if (fptr->mode & FMODE_READABLE) fptr->f = rb_fdopen(pr[0], "r"); if (fptr->mode & FMODE_WRITABLE) fptr->f2 = rb_fdopen(pw[1], "w"); return port; } static VALUE io_open(fname, mode) char *fname, *mode; { int pipe = 0; if (fname[0] == '|') { return pipe_open(fname+1, mode); } else { return file_open(fname, mode); } } static VALUE Fopen(argc, argv, self) int argc; VALUE *argv; VALUE self; { char *mode; VALUE port; int pipe = 0; VALUE pname, pmode; rb_scan_args(argc, argv, "11", &pname, &pmode); Check_Type(pname, T_STRING); if (pmode == Qnil) { mode = "r"; } else { Check_Type(pmode, T_STRING); if (RSTRING(pmode)->len == 0 || RSTRING(pmode)->len > 2) Fail("illegal access mode"); mode = RSTRING(pmode)->ptr; } return io_open(RSTRING(pname)->ptr, mode); } static VALUE Fprintf(argc, argv) int argc; VALUE argv[]; { VALUE out; if (argc == 0) return Qnil; if (TYPE(argv[0]) == T_STRING) { out = rb_defout; } else if (obj_responds_to(argv[0], INT2FIX(id_write))) { out = argv[0]; argv++; argc--; } else { Fail("output must responds to `write'"); } rb_funcall(out, id_write, 1, Fsprintf(argc, argv)); return Qnil; } static VALUE Fprint(argc, argv, self) int argc; VALUE *argv; VALUE self; { int i; /* if no argument given, print recv */ if (argc == 0) { rb_funcall(self, id_print_on, 1, rb_defout); } else { for (i=0; i0) { io_write(rb_defout, OFS); } switch (TYPE(argv[i])) { case T_STRING: io_write(rb_defout, argv[i]); break; case T_ARRAY: Fary_print_on(argv[i], rb_defout); break; default: rb_funcall(argv[i], id_print_on, 1, rb_defout); break; } } } if (ORS) { io_write(rb_defout, ORS); } return Qnil; } static VALUE io_defset(obj, val) VALUE obj, val; { if (TYPE(val) == T_STRING) { val = io_open(RSTRING(val)->ptr, "w"); } if (!obj_is_kind_of(val, C_IO)) { Fail("$< must be a file, %s given", rb_class2name(CLASS_OF(val))); } return rb_defout = val; } static VALUE Fprint_on(obj, port) VALUE obj, port; { return io_write(port, obj); } static VALUE prep_stdio(f, mode) FILE *f; int mode; { VALUE obj = obj_alloc(C_IO); OpenFile *fp; MakeOpenFile(obj, fp); fp->f = f; fp->mode = mode; return obj; } static VALUE filename, file; static int gets_lineno; static int init_p = 0, next_p = 0; static int next_argv() { extern VALUE Argv; char *fn; if (init_p == 0) { if (RARRAY(Argv)->len > 0) { next_p = 1; } else { next_p = -1; file = rb_stdin; } init_p = 1; gets_lineno = 0; } retry: if (next_p == 1) { next_p = 0; if (RARRAY(Argv)->len > 0) { filename = ary_shift(Argv); fn = RSTRING(filename)->ptr; if (RSTRING(filename)->len == 1 && fn[0] == '-') { file = rb_stdin; if (inplace) { rb_defout = rb_stdout; } } else { FILE *fr = fopen(fn, "r"); if (inplace) { struct stat st, st2; VALUE str; FILE *fw; if (!*inplace) { Fatal("Can't do inplace edit without backup"); } if (rb_defout != rb_stdout) { Fio_close(rb_defout); } fstat(fileno(fr), &st); str = str_new2(fn); str_cat(str, inplace, strlen(inplace)); if (rename(fn, RSTRING(str)->ptr) < 0) { Warning("Can't rename %s to %s: %s, skipping file", fn, RSTRING(str)->ptr, strerror(errno)); fclose(fr); goto retry; } fw = fopen(fn, "w"); fstat(fileno(fw), &st2); fchmod(fileno(fw), st.st_mode); if (st.st_uid!=st2.st_uid || st.st_gid!=st2.st_gid) { fchown(fileno(fw), st.st_uid, st.st_gid); } rb_defout = prep_stdio(fw, FMODE_WRITABLE); } file = prep_stdio(fr, FMODE_READABLE); } } else { init_p = 0; return FALSE; } } return TRUE; } static VALUE Fgets() { VALUE line; retry: if (!next_argv()) return Qnil; line = Fio_gets(file); if (line == Qnil && next_p != -1) { Fio_close(file); next_p = 1; goto retry; } gets_lineno++; lineno = INT2FIX(gets_lineno); return line; } static VALUE Feof() { if (init_p == 0 && !next_argv()) return TRUE; if (Fio_eof(file)) { next_p = 1; return TRUE; } return FALSE; } static VALUE Fgetc() { return Fio_getc(rb_stdin); } static VALUE Freadlines(obj) VALUE obj; { VALUE line, ary; ary = ary_new(); while (line = Fgets(obj)) { ary_push(ary, line); } return ary; } VALUE rb_check_str(val, id) VALUE val; ID id; { if (val == Qnil) return TRUE; if (TYPE(val) != T_STRING) { Fail("value of %s must be String", rb_id2name(id)); } return TRUE; } VALUE rb_xstring(str) struct RString *str; { VALUE port, result; OpenFile *fptr; int mask; Check_Type(str, T_STRING); port = pipe_open(str->ptr, "r"); result = read_all(port); GetOpenFile(port, fptr); rb_syswait(fptr->pid); fptr->pid = 0; return result; } struct timeval *time_timeval(); #ifdef STDSTDIO # define READ_PENDING(fp) ((fp)->_cnt != 0) #else # ifdef __SLBF # define READ_PENDING(fp) ((fp)->_r > 0) # else # ifdef __linux__ # ifdef _other_gbase # define READ_PENDING(fp) ((fp)->_IO_read_ptr < (fp)->_IO_read_end) # else # define READ_PENDING(fp) ((fp)->_gptr < (fp)->_egptr) # endif # else --------------> You Lose <-------------- # endif # endif #endif static VALUE Fselect(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE read, write, except, timeout, res, list; fd_set rset, wset, eset, pset; fd_set *rp, *wp, *ep; struct timeval time, *tp, timerec; OpenFile *fptr; int i, max = 0, n; int interrupt = 0; rb_scan_args(argc, argv, argv, "13", &read, &write, &except, &timeout); if (timeout) { tp = time_timeval(timeout); } else { tp = NULL; } FD_ZERO(&pset); if (read) { int pending = 0; Check_Type(read, T_ARRAY); rp = &rset; FD_ZERO(rp); for (i=0; ilen; i++) { GetOpenFile(RARRAY(read)->ptr[i], fptr); FD_SET(fileno(fptr->f), rp); if (READ_PENDING(fptr->f)) { /* check for buffered data */ pending++; FD_SET(fileno(fptr->f), &pset); } if (max < fileno(fptr->f)) max = fileno(fptr->f); } if (pending) { /* no blocking if there's buffered data */ timerec.tv_sec = timerec.tv_usec = 0; tp = &timerec; } } else rp = NULL; if (write) { Check_Type(write, T_ARRAY); wp = &wset; FD_ZERO(wp); for (i=0; ilen; i++) { GetOpenFile(RARRAY(write)->ptr[i], fptr); FD_SET(fileno(fptr->f), wp); if (max > fileno(fptr->f)) max = fileno(fptr->f); if (fptr->f2) { FD_SET(fileno(fptr->f2), wp); if (max < fileno(fptr->f2)) max = fileno(fptr->f2); } } } else wp = NULL; if (except) { Check_Type(except, T_ARRAY); ep = &eset; FD_ZERO(ep); for (i=0; ilen; i++) { GetOpenFile(RARRAY(except)->ptr[i], fptr); FD_SET(fileno(fptr->f), ep); if (max < fileno(fptr->f)) max = fileno(fptr->f); if (fptr->f2) { FD_SET(fileno(fptr->f2), ep); if (max > fileno(fptr->f2)) max = fileno(fptr->f2); } } } else ep = NULL; max++; retry: TRAP_BEG; n = select(max, rp, wp, ep, tp); TRAP_END; if (n < 0) { if (errno == EINTR) { if (tp == NULL) goto retry; interrupt = 1; } rb_sys_fail(Qnil); } if (n == 0) return Qnil; res = ary_new2(3); RARRAY(res)->ptr[0] = rp?ary_new():Qnil; RARRAY(res)->len++; RARRAY(res)->ptr[1] = wp?ary_new():Qnil; RARRAY(res)->len++; RARRAY(res)->ptr[2] = ep?ary_new():Qnil; RARRAY(res)->len++; if (interrupt == 0) { if (rp) { list = RARRAY(res)->ptr[0]; for (i=0; i< RARRAY(read)->len; i++) { GetOpenFile(RARRAY(read)->ptr[i], fptr); if (FD_ISSET(fileno(fptr->f), rp) || FD_ISSET(fileno(fptr->f), &pset)) { ary_push(list, RARRAY(read)->ptr[i]); } } } if (wp) { list = RARRAY(res)->ptr[1]; for (i=0; i< RARRAY(write)->len; i++) { GetOpenFile(RARRAY(write)->ptr[i], fptr); if (FD_ISSET(fileno(fptr->f), wp)) { ary_push(list, RARRAY(write)->ptr[i]); } else if (fptr->f2 && FD_ISSET(fileno(fptr->f2), wp)) { ary_push(list, RARRAY(write)->ptr[i]); } } } if (ep) { list = RARRAY(res)->ptr[2]; for (i=0; i< RARRAY(except)->len; i++) { GetOpenFile(RARRAY(except)->ptr[i], fptr); if (FD_ISSET(fileno(fptr->f), ep)) { ary_push(list, RARRAY(except)->ptr[i]); } else if (fptr->f2 && FD_ISSET(fileno(fptr->f2), ep)) { ary_push(list, RARRAY(except)->ptr[i]); } } } } return res; } void io_ctl(obj, req, arg, io_p) VALUE obj, req; struct RString *arg; int io_p; { int cmd = NUM2INT(req); OpenFile *fptr; int len, fd; GetOpenFile(obj, fptr); #ifdef IOCPARM_MASK #ifndef IOCPARM_LEN #define IOCPARM_LEN(x) (((x) >> 16) & IOCPARM_MASK) #endif #endif #ifdef IOCPARM_LEN len = IOCPARM_LEN(cmd); /* on BSDish systes we're safe */ #else len = 256; /* otherwise guess at what's safe */ #endif Check_Type(arg, T_STRING); str_modify(arg); if (arg->len < len) { str_grow(arg, len+1); } arg->ptr[len] = 17; fd = fileno(fptr->f); if ((io_p?ioctl(fd, cmd, arg->ptr):fcntl(fd, cmd, arg->ptr))<0) { rb_sys_fail(fptr->path); } if (arg->ptr[len] != 17) { Fail("Return value overflowed string"); } } static VALUE Fio_ioctl(obj, req, arg) VALUE obj, req; struct RString *arg; { io_ctl(obj, req, arg, 1); return obj; } static VALUE Fsyscall(argc, argv) int argc; VALUE *argv; { #ifdef HAVE_SYSCALL #ifdef atarist unsigned long arg[14]; /* yes, we really need that many ! */ #else unsigned long arg[8]; #endif int retval = -1; int i = 0; int items = argc - 1; /* This probably won't work on machines where sizeof(long) != sizeof(int) * or where sizeof(long) != sizeof(char*). But such machines will * not likely have syscall implemented either, so who cares? */ arg[0] = NUM2INT(argv[0]); argv++; while (items--) { if (FIXNUM_P(*argv)) { arg[i] = (unsigned long)NUM2INT(*argv); argv++; } else { Check_Type(*argv, T_STRING); str_modify(*argv); arg[i] = (unsigned long)RSTRING(*argv)->ptr; argv++; } i++; } switch (argc) { case 0: Fail("Too few args to syscall"); case 1: retval = syscall(arg[0]); break; case 2: retval = syscall(arg[0],arg[1]); break; case 3: retval = syscall(arg[0],arg[1],arg[2]); break; case 4: retval = syscall(arg[0],arg[1],arg[2],arg[3]); break; case 5: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4]); break; case 6: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5]); break; case 7: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6]); break; case 8: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6], arg[7]); break; #ifdef atarist case 9: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6], arg[7], arg[8]); break; case 10: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6], arg[7], arg[8], arg[9]); break; case 11: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6], arg[7], arg[8], arg[9], arg[10]); break; case 12: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6], arg[7], arg[8], arg[9], arg[10], arg[11]); break; case 13: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6], arg[7], arg[8], arg[9], arg[10], arg[11], arg[12]); break; case 14: retval = syscall(arg[0],arg[1],arg[2],arg[3],arg[4],arg[5],arg[6], arg[7], arg[8], arg[9], arg[10], arg[11], arg[12], arg[13]); break; #endif /* atarist */ } if (retval == -1) rb_sys_fail(0); return INT2FIX(0); #else Fail("syscall() unimplemented"); #endif } static VALUE Farg_read(obj) VALUE obj; { VALUE str, str2; str = str_new(0, 0); for (;;) { retry: if (!next_argv()) return Qnil; str2 = Fio_read(0, Qnil, file); if (str2 == Qnil && next_p != -1) { Fio_close(file); next_p = 1; goto retry; } if (str2 == Qnil) break; str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); } return str; } static VALUE Farg_getc() { VALUE byte; retry: if (!next_argv()) return Qnil; byte = Fio_getc(file); if (byte == Qnil && next_p != -1) { Fio_close(file); next_p = 1; goto retry; } return byte; } static VALUE Farg_each() { VALUE str; while (str = Fgets()) { rb_yield(str); } return Qnil; } static VALUE Farg_each_byte() { VALUE byte; while (byte = Farg_getc()) { rb_yield(byte); } return Qnil; } static VALUE Farg_filename() { return filename; } static VALUE Farg_file() { return file; } extern VALUE M_Enumerable; VALUE rb_readonly_hook(); Init_IO() { extern VALUE C_Kernel; id_write = rb_intern("write"); id_fd = rb_intern("fd"); id_print_on = rb_intern("print_on"); rb_define_private_method(C_Kernel, "syscall", Fsyscall, -1); rb_define_private_method(C_Kernel, "open", Fopen, -1); rb_define_private_method(C_Kernel, "printf", Fprintf, -1); rb_define_private_method(C_Kernel, "gets", Fgets, 0); rb_define_alias(C_Kernel,"readline", "gets"); rb_define_private_method(C_Kernel, "eof", Feof, 0); rb_define_private_method(C_Kernel, "getc", Fgetc, 0); rb_define_private_method(C_Kernel, "select", Fselect, -1); rb_define_private_method(C_Kernel, "readlines", Freadlines, 0); rb_define_method(C_Kernel, "print_on", Fprint_on, 1); rb_define_method(C_Kernel, "print", Fprint, -1); C_IO = rb_define_class("IO", C_Object); rb_include_module(C_IO, M_Enumerable); rb_define_variable("$;", &FS, Qnil, rb_check_str, 0); rb_define_variable("$,", &OFS, Qnil, rb_check_str, 0); RS = str_new2("\n"); rb_define_variable("$/", &RS, Qnil, rb_check_str, 0); rb_define_variable("$\\", &ORS, Qnil, rb_check_str, 0); rb_define_variable("$.", &lineno, Qnil, Qnil, 0); rb_define_variable("$_", &rb_lastline, Qnil, Qnil, 0); rb_define_method(C_IO, "each", Fio_each, 0); rb_define_method(C_IO, "each_byte", Fio_each_byte, 0); rb_define_method(C_IO, "syswrite", Fio_syswrite, 1); rb_define_method(C_IO, "sysread", Fio_sysread, 1); rb_define_method(C_IO, "fileno", Fio_fileno, 0); rb_define_alias(C_IO, "to_i", "fileno"); rb_define_method(C_IO, "sync", Fio_sync, 0); rb_define_method(C_IO, "sync=", Fio_set_sync, 1); rb_define_alias(C_IO, "readlines", "to_a"); rb_define_method(C_IO, "read", Fio_read, -2); rb_define_method(C_IO, "write", io_write, 1); rb_define_method(C_IO, "gets", Fio_gets, 0); rb_define_alias(C_IO, "readline", "gets"); rb_define_method(C_IO, "getc", Fio_getc, 0); rb_define_method(C_IO, "puts", Fio_puts, 1); rb_define_method(C_IO, "<<", Fio_puts, 1); rb_define_method(C_IO, "flush", Fio_flush, 0); rb_define_method(C_IO, "eof", Fio_eof, 0); rb_define_method(C_IO, "close", Fio_close, 0); rb_define_method(C_IO, "isatty", Fio_isatty, 0); rb_define_method(C_IO, "binmode", Fio_binmode, 0); rb_define_method(C_IO, "ioctl", Fio_ioctl, 2); rb_stdin = prep_stdio(stdin, FMODE_READABLE); rb_define_variable("$stdin", &rb_stdin, Qnil, rb_readonly_hook, 0); rb_stdout = prep_stdio(stdout, FMODE_WRITABLE); rb_define_variable("$stdout", &rb_stdout, Qnil, rb_readonly_hook, 0); rb_stderr = prep_stdio(stderr, FMODE_WRITABLE); rb_define_variable("$stderr", &rb_stderr, Qnil, rb_readonly_hook, 0); rb_defout = rb_stdout; rb_define_variable("$>", &rb_defout, Qnil, io_defset, 0); argf = obj_alloc(C_Object); rb_define_variable("$<", &argf, Qnil, rb_readonly_hook, 0); rb_define_variable("$ARGF", &argf, Qnil, rb_readonly_hook, 0); rb_define_single_method(argf, "each", Farg_each, 0); rb_define_single_method(argf, "each_byte", Farg_each_byte, 0); rb_define_single_method(argf, "read", Farg_read, 0); rb_define_single_method(argf, "readlines", Freadlines, 0); rb_define_single_method(argf, "gets", Fgets, 0); rb_define_single_method(argf, "readline", Fgets, 0); rb_define_single_method(argf, "getc", Farg_getc, 0); rb_define_single_method(argf, "eof", Feof, 0); rb_define_single_method(argf, "to_s", Farg_filename, 0); rb_define_single_method(argf, "filename", Farg_filename, 0); rb_define_single_method(argf, "file", Farg_file, 0); rb_include_module(CLASS_OF(argf), M_Enumerable); filename = str_new2("-"); rb_define_variable("$FILENAME", &filename, Qnil, rb_readonly_hook, 0); file = rb_stdin; rb_global_variable(&file); Init_File(); } ./ruby-0.64/io.h100644 150 1 2052 5674170243 11746 0ustar matzdaemon/************************************************ io.h - $Author: matz $ $Revision: 1.3 $ $Date: 1994/08/12 11:06:42 $ created at: Fri Nov 12 16:47:09 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #ifndef IO_H #define IO_H #include #include typedef struct { FILE *f; /* stdio ptr for read/write */ FILE *f2; /* additional ptr for rw pipes */ int mode; /* mode flags */ int pid; /* child's pid (for pipes) */ int lineno; /* number of lines read */ char *path; /* pathname for file */ } OpenFile; #define FMODE_READABLE 1 #define FMODE_WRITABLE 2 #define FMODE_READWRITE 3 #define FMODE_SYNC 4 extern ID id_fd; #define GetOpenFile(obj,fp) Get_Data_Struct(obj, id_fd, OpenFile, fp) void io_free_OpenFile(); #define MakeOpenFile(obj, fp) {\ Make_Data_Struct(obj, id_fd, OpenFile, Qnil, io_free_OpenFile, fp);\ fp->f = fp->f2 = NULL;\ fp->mode = 0;\ fp->pid = 0;\ fp->lineno = 0;\ fp->path = NULL;\ } #endif ./ruby-0.64/main.c100644 150 1 502 5674170243 12234 0ustar matzdaemon/************************************************ main.c - $Author: matz $ $Date: 1994/08/19 09:32:03 $ created at: Fri Aug 19 13:19:58 JST 1994 ************************************************/ main(argc, argv, envp) int argc; char **argv, **envp; { ruby_init(argc, argv, envp); ruby_run(); } ./ruby-0.64/math.c100644 150 1 4245 5674170243 12271 0ustar matzdaemon/************************************************ math.c - $Author: matz $ $Date: 1994/11/01 08:28:03 $ created at: Tue Jan 25 14:12:56 JST 1994 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include VALUE M_Math; VALUE float_new(); #define Need_Float(x) \ if (FIXNUM_P(x)) {\ (x) = (struct RFloat*)float_new((double)FIX2INT(x));\ } else {\ Check_Type(x, T_FLOAT);\ } #define Need_Float2(x,y) {\ Need_Float(x);\ Need_Float(y);\ } static VALUE Fmath_atan2(obj, x, y) VALUE obj; struct RFloat *x, *y; { Need_Float2(x, y); return float_new(atan2(x->value, x->value)); } static VALUE Fmath_cos(obj, x) VALUE obj; struct RFloat *x; { Need_Float(x); return float_new(cos(x->value)); } static VALUE Fmath_sin(obj, x) VALUE obj; struct RFloat *x; { Need_Float(x); return float_new(sin(x->value)); } static VALUE Fmath_tan(obj, x) VALUE obj; struct RFloat *x; { Need_Float(x); return float_new(tan(x->value)); } static VALUE Fmath_exp(obj, x) VALUE obj; struct RFloat *x; { Need_Float(x); return float_new(exp(x->value)); } static VALUE Fmath_log(obj, x) VALUE obj; struct RFloat *x; { Need_Float(x); return float_new(log(x->value)); } static VALUE Fmath_log10(obj, x) VALUE obj; struct RFloat *x; { Need_Float(x); return float_new(log10(x->value)); } static VALUE Fmath_sqrt(obj, x) VALUE obj; struct RFloat *x; { Need_Float(x); if (x->value < 0.0) Fail("square root for negative number"); return float_new(sqrt(x->value)); } Init_Math() { M_Math = rb_define_module("Math"); rb_define_module_function(M_Math, "atan2", Fmath_atan2, 2); rb_define_module_function(M_Math, "cos", Fmath_cos, 1); rb_define_module_function(M_Math, "sin", Fmath_sin, 1); rb_define_module_function(M_Math, "tan", Fmath_tan, 1); rb_define_module_function(M_Math, "exp", Fmath_exp, 1); rb_define_module_function(M_Math, "log", Fmath_log, 1); rb_define_module_function(M_Math, "log10", Fmath_log10, 1); rb_define_module_function(M_Math, "sqrt", Fmath_sqrt, 1); } ./ruby-0.64/node.h100644 150 1 14257 5704462357 12322 0ustar matzdaemon/************************************************ node.h - $Author: matz $ $Date: 1995/01/10 10:42:41 $ created at: Fri May 28 15:14:02 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #ifndef NODE_H #define NODE_H enum node_type { NODE_METHOD, NODE_FBODY, NODE_CFUNC, NODE_SCOPE, NODE_BLOCK, NODE_IF, NODE_CASE, NODE_WHEN, NODE_WHILE, NODE_WHILE2, NODE_EXNOT, NODE_ITER, NODE_FOR, NODE_PROT, NODE_AND, NODE_OR, NODE_MASGN, NODE_LASGN, NODE_GASGN, NODE_IASGN, NODE_CASGN, NODE_OP_ASGN1, NODE_OP_ASGN2, NODE_CALL, NODE_SUPER, NODE_ZSUPER, NODE_ARRAY, NODE_ZARRAY, NODE_HASH, NODE_REDO, NODE_BREAK, NODE_CONTINUE, NODE_RETURN, NODE_RETRY, NODE_FAIL, NODE_YIELD, NODE_LVAR, NODE_GVAR, NODE_IVAR, NODE_MVAR, NODE_CVAR, NODE_CONST, NODE_LIT, NODE_STR, NODE_STR2, NODE_XSTR, NODE_XSTR2, NODE_DREGX, NODE_DGLOB, NODE_ARGS, NODE_DEFN, NODE_DEFS, NODE_ALIAS, NODE_UNDEF, NODE_CLASS, NODE_MODULE, NODE_INC, NODE_DOT3, NODE_ATTRSET, NODE_SELF, NODE_NIL, }; typedef struct RNode { UINT flags; char *file; unsigned int line; union { struct RNode *node; ID id; VALUE value; VALUE (*cfunc)(); ID *tbl; } u1; union { struct RNode *node; ID id; int argc; } u2; union { struct RNode *node; ID id; int state; struct global_entry *entry; int cnt; VALUE value; } u3; } NODE; #define RNODE(obj) (R_CAST(RNode)(obj)) #define nd_type(n) (((RNODE(n))->flags>>10)&0xff) #define nd_set_type(n,t) \ RNODE(n)->flags=((RNODE(n)->flags&~FL_UMASK)|(((t)<<10)&FL_UMASK)) #define nd_head u1.node #define nd_alen u2.argc #define nd_next u3.node #define nd_cond u1.node #define nd_body u2.node #define nd_else u3.node #define nd_break u3.state #define nd_orig u3.value #define nd_resq u2.node #define nd_ensr u3.node #define nd_1st u1.node #define nd_2nd u2.node #define nd_stts u1.node #define nd_entry u3.entry #define nd_vid u1.id #define nd_cflag u2.id #define nd_cval u3.value #define nd_cnt u3.cnt #define nd_tbl u1.tbl #define nd_var u1.node #define nd_ibdy u2.node #define nd_iter u3.node #define nd_value u2.node #define nd_aid u3.id #define nd_lit u1.value #define nd_frml u1.node #define nd_rest u2.argc #define nd_recv u1.node #define nd_mid u2.id #define nd_args u3.node #define nd_noex u1.id #define nd_defn u3.node #define nd_new u2.id #define nd_old u3.id #define nd_cfnc u1.cfunc #define nd_argc u2.argc #define nd_cname u1.id #define nd_super u3.id #define nd_modl u1.id #define nd_beg u1.node #define nd_end u2.node #define nd_state u3.state #define nd_rval u3.node #define NEW_METHOD(n,x) newnode(NODE_METHOD,x,n,Qnil) #define NEW_FBODY(n,i,o) newnode(NODE_FBODY,n,i,o) #define NEW_DEFN(i,d,p) newnode(NODE_DEFN,p,i,d) #define NEW_DEFS(r,i,d) newnode(NODE_DEFS,r,i,d) #define NEW_CFUNC(f,c) newnode(NODE_CFUNC,f,c,Qnil) #define NEW_RFUNC(b1,b2) NEW_SCOPE(block_append(b1,b2)) #define NEW_SCOPE(b) newnode(NODE_SCOPE,local_tbl(),(b),local_cnt(0)) #define NEW_BLOCK(a) newnode(NODE_BLOCK,a,1,Qnil) #define NEW_IF(c,t,e) newnode(NODE_IF,c,t,e) #define NEW_EXNOT(c) newnode(NODE_EXNOT,c,Qnil,Qnil) #define NEW_UNLESS(c,t,e) newnode(NODE_IF,NEW_EXNOT(c),t,e) #define NEW_CASE(h,b) newnode(NODE_CASE,h,b,Qnil) #define NEW_WHEN(c,t,e) newnode(NODE_WHEN,c,t,e) #define NEW_WHILE(c,b) newnode(NODE_WHILE,c,b,Qnil) #define NEW_UNTIL(c,b) newnode(NODE_WHILE,NEW_EXNOT(c),b,Qnil) #define NEW_WHILE2(c,b) newnode(NODE_WHILE2,c,b,Qnil) #define NEW_UNTIL2(c,b) newnode(NODE_WHILE2,NEW_EXNOT(c),b,Qnil) #define NEW_FOR(v,i,b) newnode(NODE_FOR,v,b,i) #define NEW_ITER(v,i,b) newnode(NODE_ITER,v,b,i) #define NEW_PROT(b,ex,en) newnode(NODE_PROT,b,ex,en) #define NEW_REDO() newnode(NODE_REDO,Qnil,Qnil,Qnil) #define NEW_BREAK() newnode(NODE_BREAK,Qnil,Qnil,Qnil) #define NEW_CONT() newnode(NODE_CONTINUE,Qnil,Qnil,Qnil) #define NEW_RETRY() newnode(NODE_RETRY,Qnil,Qnil,Qnil) #define NEW_RET(s) newnode(NODE_RETURN,s,Qnil,Qnil) #define NEW_FAIL(s) newnode(NODE_FAIL,s,Qnil,Qnil) #define NEW_YIELD(a) newnode(NODE_YIELD,a,Qnil,Qnil) #define NEW_LIST(a) NEW_ARRAY(a) #define NEW_ARRAY(a) newnode(NODE_ARRAY,a,1,Qnil) #define NEW_ZARRAY() newnode(NODE_ZARRAY,Qnil,Qnil,Qnil) #define NEW_HASH(a) newnode(NODE_HASH,a,Qnil,Qnil) #define NEW_AND(a,b) newnode(NODE_AND,a,b,Qnil) #define NEW_OR(a,b) newnode(NODE_OR,a,b,Qnil) #define NEW_MASGN(l,r) newnode(NODE_MASGN,l,r,Qnil) #define NEW_GASGN(v,val) newnode(NODE_GASGN,v,val,rb_global_entry(v)) #define NEW_LASGN(v,val) newnode(NODE_LASGN,v,val,local_cnt(v)) #define NEW_IASGN(v,val) newnode(NODE_IASGN,v,val,Qnil) #define NEW_CASGN(v,val) newnode(NODE_CASGN,v,val,Qnil) #define NEW_OP_ASGN1(p,id,a) newnode(NODE_OP_ASGN1,p,id,a) #define NEW_OP_ASGN2(r,i,val) newnode(NODE_OP_ASGN1,r,val,i) #define NEW_GVAR(v) newnode(NODE_GVAR,v,Qnil,rb_global_entry(v)) #define NEW_LVAR(v) newnode(NODE_LVAR,v,Qnil,local_cnt(v)) #define NEW_IVAR(v) newnode(NODE_IVAR,v,Qnil,Qnil) #define NEW_MVAR(v) newnode(NODE_MVAR,v,Qnil,Qnil) #define NEW_CVAR(v) newnode(NODE_CVAR,v,Qnil,Qnil) #define NEW_LIT(l) newnode(NODE_LIT,l,Qnil,Qnil) #define NEW_STR(s) newnode(NODE_STR,s,Qnil,Qnil) #define NEW_STR2(s) newnode(NODE_STR2,s,Qnil,Qnil) #define NEW_XSTR(s) newnode(NODE_XSTR,s,Qnil,Qnil) #define NEW_XSTR2(s) newnode(NODE_XSTR2,s,Qnil,Qnil) #define NEW_CALL(r,m,a) newnode(NODE_CALL,r,m,a) #define NEW_SUPER(a) newnode(NODE_SUPER,Qnil,Qnil,a) #define NEW_ZSUPER() newnode(NODE_ZSUPER,Qnil,Qnil,Qnil) #define NEW_ARGS(f,r) newnode(NODE_ARGS,Qnil,r,f) #define NEW_ALIAS(n,o) newnode(NODE_ALIAS,Qnil,n,o) #define NEW_UNDEF(i) newnode(NODE_UNDEF,Qnil,i,Qnil) #define NEW_CLASS(n,b,s) newnode(NODE_CLASS,n,NEW_SCOPE(b),s) #define NEW_MODULE(n,b) newnode(NODE_MODULE,n,NEW_SCOPE(b),Qnil) #define NEW_INC(m) newnode(NODE_INC,m,Qnil,Qnil) #define NEW_DOT3(b,e) newnode(NODE_DOT3,b,e,0) #define NEW_ATTRSET(a) newnode(NODE_ATTRSET,a,Qnil,Qnil) #define NEW_SELF() newnode(NODE_SELF,Qnil,Qnil,Qnil) #define NEW_NIL() newnode(NODE_NIL,Qnil,Qnil,Qnil) NODE *newnode(); VALUE rb_method_booundp(); #endif ./ruby-0.64/numeric.c100644 150 1 42653 5704462361 13026 0ustar matzdaemon/************************************************ numeric.c - $Author: matz $ $Date: 1995/01/10 10:42:42 $ created at: Fri Aug 13 18:33:09 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "env.h" #include static ID coerce; static ID to_i; VALUE C_Numeric; VALUE C_Float; VALUE C_Integer; VALUE C_Fixnum; double big2dbl(); VALUE float_new(d) double d; { NEWOBJ(flt, struct RFloat); OBJSETUP(flt, C_Float, T_FLOAT); flt->value = d; return (VALUE)flt; } static num_coerce_bin(x, y) VALUE x, y; { return rb_funcall(rb_funcall(y, coerce, 1, x), the_env->last_func, 1, y); } static VALUE Fnum_uplus(num) VALUE num; { return num; } static VALUE Fnum_uminus(num) VALUE num; { return rb_funcall(rb_funcall(num, coerce, 1, INT2FIX(0)), 1, num); } static VALUE Fnum_dot2(left, right) VALUE left, right; { Need_Fixnum(left); Need_Fixnum(right); return range_new(left, right); } static VALUE Fnum_next(num) VALUE num; { num = rb_funcall(num, rb_intern("to_i"), 0); return rb_funcall(num, '+', 1, INT2FIX(1)); } VALUE Fnum_upto(from, to) VALUE from, to; { int i, end; end = NUM2INT(to); for (i = NUM2INT(from); i <= end; i++) { rb_yield(INT2FIX(i)); } return from; } static VALUE Fnum_downto(from, to) VALUE from, to; { int i, end; end = NUM2INT(to); for (i=NUM2INT(from); i >= end; i--) { rb_yield(INT2FIX(i)); } return from; } static VALUE Fnum_step(from, to, step) VALUE from, to; { int i, end, diff; end = NUM2INT(to); diff = NUM2INT(step); if (diff == 0) { Fail("step cannot be 0"); } else if (diff > 0) { for (i=NUM2INT(from); i <= end; i+=diff) { rb_yield(INT2FIX(i)); } } else { for (i=NUM2INT(from); i >= end; i+=diff) { rb_yield(INT2FIX(i)); } } return from; } static VALUE Fnum_dotimes(num) VALUE num; { int i, end; end = NUM2INT(num); for (i=0; ivalue); if (RFLOAT(div)->value > d) { div = float_new(d); } } mod = rb_funcall(x, '%', 1, y); return assoc_new(div, mod); } static VALUE Fnum_is_int(num) VALUE num; { return FALSE; } static VALUE Fflo_to_s(flt) struct RFloat *flt; { char buf[32]; sprintf(buf, "%g", flt->value); return str_new2(buf); } static VALUE Fflo_coerce(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: return float_new((double)FIX2INT(y)); case T_FLOAT: return y; case T_BIGNUM: return Fbig_to_f(y); default: Fail("can't coerce %s to Float", rb_class2name(CLASS_OF(y))); } /* not reached */ return Qnil; } static VALUE Fflo_uminus(flt) struct RFloat *flt; { return float_new(-flt->value); } static VALUE Fflo_plus(x, y) struct RFloat *x, *y; { switch (TYPE(y)) { case T_FIXNUM: return float_new(x->value + (double)FIX2INT(y)); case T_BIGNUM: return float_new(x->value + big2dbl(y)); case T_FLOAT: return float_new(x->value + y->value); case T_STRING: return Fstr_plus(obj_as_string(x), y); default: return num_coerce_bin(x, y); } } static VALUE Fflo_minus(x, y) struct RFloat *x, *y; { switch (TYPE(y)) { case T_FIXNUM: return float_new(x->value - (double)FIX2INT(y)); case T_BIGNUM: return float_new(x->value - big2dbl(y)); case T_FLOAT: return float_new(x->value - y->value); default: return num_coerce_bin(x, y); } } static VALUE Fflo_mul(x, y) struct RFloat *x, *y; { switch (TYPE(y)) { case T_FIXNUM: return float_new(x->value * (double)FIX2INT(y)); case T_BIGNUM: return float_new(x->value * big2dbl(y)); case T_FLOAT: return float_new(x->value * y->value); case T_STRING: return Fstr_times(y, INT2FIX((int)x->value)); default: return num_coerce_bin(x, y); } } static VALUE Fflo_div(x, y) struct RFloat *x, *y; { int f_y; double d; switch (TYPE(y)) { case T_FIXNUM: f_y = FIX2INT(y); if (f_y == 0) Fail("devided by 0"); return float_new(x->value / (double)f_y); case T_BIGNUM: d = big2dbl(y); if (d == 0.0) Fail("devided by 0"); return float_new(x->value + d); case T_FLOAT: if (y->value == 0.0) Fail("devided by 0"); return float_new(x->value / y->value); default: return num_coerce_bin(x, y); } } static VALUE Fflo_mod(x, y) struct RFloat *x, *y; { double value; switch (TYPE(y)) { case T_FIXNUM: value = (double)FIX2INT(y); break; case T_BIGNUM: value = big2dbl(y); break; case T_FLOAT: value = y->value; break; default: return num_coerce_bin(x, y); } #ifdef HAVE_FMOD { value = fmod(x->value, value); } #else { double value1 = x->value; double value2; modf(value1/value, &value2); value = value1 - value2 * value; } #endif return float_new(value); } Fflo_pow(x, y) struct RFloat *x, *y; { switch (TYPE(y)) { case T_FIXNUM: return float_new(pow(x->value, (double)FIX2INT(y))); case T_BIGNUM: return float_new(pow(x->value, big2dbl(y))); case T_FLOAT: return float_new(pow(x->value, y->value)); default: return num_coerce_bin(x, y); } } static VALUE Fflo_eq(x, y) struct RFloat *x, *y; { switch (TYPE(y)) { case T_NIL: return Qnil; case T_FIXNUM: if (x->value == FIX2INT(y)) return TRUE; return FALSE; case T_BIGNUM: return float_new(x->value == big2dbl(y)); case T_FLOAT: return (x->value == y->value)?TRUE:FALSE; default: return num_coerce_bin(x, y); } } static VALUE Fflo_hash(num) struct RFloat *num; { double d; char *c; int i, hash; d = num->value; c = (char*)&d; for (hash=0, i=0; ivalue; switch (TYPE(y)) { case T_FIXNUM: b = (double)FIX2INT(y); break; case T_BIGNUM: b = big2dbl(y); break; case T_FLOAT: b = y->value; break; default: return num_coerce_bin(x, y); } if (a == b) return INT2FIX(0); if (a > b) return INT2FIX(1); return INT2FIX(-1); } static VALUE Fflo_to_i(num) struct RFloat *num; { double f = num->value; int val; if (!FIXABLE(f)) { return dbl2big(f); } val = f; return INT2FIX(val); } static VALUE Fflo_to_f(num) VALUE num; { return num; } static VALUE Fflo_abs(flt) struct RFloat *flt; { double val = fabs(flt->value); return float_new(val); } static VALUE to_integer(val) VALUE val; { return rb_funcall(val, to_i, 0); } static VALUE fail_to_integer(val) VALUE val; { Fail("failed to convert %s into integer", rb_class2name(CLASS_OF(val))); } int num2int(val) VALUE val; { if (val == Qnil) return 0; switch (TYPE(val)) { case T_FIXNUM: return FIX2INT(val); break; case T_FLOAT: if (RFLOAT(val)->value <= (double) LONG_MAX && RFLOAT(val)->value >= (double) LONG_MIN) { return (int)(RFLOAT(val)->value); } else { Fail("float %g out of rang of integer", RFLOAT(val)->value); } break; case T_BIGNUM: return big2int(val); default: val = rb_resque(to_integer, val, fail_to_integer, val); return NUM2INT(val); } } VALUE num2fix(val) VALUE val; { int v; if (val == Qnil) return INT2FIX(0); switch (TYPE(val)) { case T_FIXNUM: return val; case T_FLOAT: case T_BIGNUM: default: v = num2int(val); if (!FIXABLE(v)) Fail("integer %d out of rang of Fixnum", v); return INT2FIX(v); } } static VALUE Fint_is_int(num) VALUE num; { return TRUE; } static VALUE Fint_chr(num) VALUE num; { char c; int i = NUM2INT(num); if (i < 0 || 0xff < i) Fail("%d out of char range", i); c = i; return str_new(&c, 1); } static VALUE Ffix_uminus(num) VALUE num; { return int2inum(-FIX2INT(num)); } VALUE fix2str(x, base) VALUE x; int base; { char fmt[3], buf[12]; fmt[0] = '%'; fmt[2] = '\0'; if (base == 10) fmt[1] = 'd'; else if (base == 16) fmt[1] = 'x'; else if (base == 8) fmt[1] = 'o'; else Fail("fixnum cannot treat base %d", base); sprintf(buf, fmt, FIX2INT(x)); return str_new2(buf); } VALUE Ffix_to_s(in) VALUE in; { return fix2str(in, 10); } static VALUE Ffix_plus(x, y) VALUE x; struct RFloat *y; { switch (TYPE(y)) { case T_FIXNUM: { int a, b, c; VALUE r; a = FIX2INT(x); b = FIX2INT(y); c = a + b; r = INT2FIX(c); if (FIX2INT(r) != c) { r = Fbig_plus(int2big(a), int2big(b)); } return r; } case T_FLOAT: return float_new((double)FIX2INT(x) + y->value); default: return num_coerce_bin(x, y); } } static VALUE Ffix_minus(x, y) VALUE x; struct RFloat *y; { switch (TYPE(y)) { case T_FIXNUM: { int a, b, c; VALUE r; a = FIX2INT(x); b = FIX2INT(y); c = a - b; r = INT2FIX(c); if (FIX2INT(r) != c) { r = Fbig_minus(int2big(a), int2big(b)); } return r; } case T_FLOAT: return float_new((double)FIX2INT(x) - y->value); default: return num_coerce_bin(x, y); } } static VALUE Ffix_mul(x, y) VALUE x; struct RFloat *y; { switch (TYPE(y)) { case T_FIXNUM: { int a = FIX2INT(x), b = FIX2INT(y); int c = a * b; VALUE r = INT2FIX(c); if (FIX2INT(r) != c) { r = Fbig_mul(int2big(a), int2big(b)); } return r; } case T_FLOAT: return float_new((double)FIX2INT(x) * y->value); default: return num_coerce_bin(x, y); } } static VALUE Ffix_div(x, y) VALUE x; struct RFloat *y; { int i; if (TYPE(y) == T_FIXNUM) { i = FIX2INT(y); if (i == 0) Fail("devided by 0"); i = FIX2INT(x)/i; return INT2FIX(i); } return num_coerce_bin(x, y); } static VALUE Ffix_mod(x, y) VALUE x, y; { int mod, i; if (TYPE(y) == T_FIXNUM) { i = FIX2INT(y); if (i == 0) Fail("devided by 0"); i = FIX2INT(x)%i; return INT2FIX(i); } return num_coerce_bin(x, y); } static VALUE Ffix_pow(x, y) VALUE x, y; { extern double pow(); if (FIXNUM_P(y)) { int a, b; b = FIX2INT(y); if (b == 0) return INT2FIX(1); a = FIX2INT(x); if (b > 0) { return Fbig_pow(int2big(a), y); } return float_new(pow((double)a, (double)b)); } else if (NIL_P(y)) { return INT2FIX(1); } return num_coerce_bin(x, y); } static VALUE Ffix_equal(x, y) VALUE x, y; { if (FIXNUM_P(y)) { return (FIX2INT(x) == FIX2INT(y))?TRUE:FALSE; } else if (NIL_P(y)) { return Qnil; } else { return num_coerce_bin(x, y); } } static VALUE Ffix_cmp(x, y) VALUE x, y; { if (FIXNUM_P(y)) { int a = FIX2INT(x), b = FIX2INT(y); if (a == b) return INT2FIX(0); if (a > b) return INT2FIX(1); return INT2FIX(-1); } else { return num_coerce_bin(x, y); } } static VALUE Ffix_gt(x, y) VALUE x, y; { if (FIXNUM_P(y)) { int a = FIX2INT(x), b = FIX2INT(y); if (a > b) return TRUE; return FALSE; } else { return num_coerce_bin(x, y); } } static VALUE Ffix_ge(x, y) VALUE x, y; { if (FIXNUM_P(y)) { int a = FIX2INT(x), b = FIX2INT(y); if (a >= b) return TRUE; return FALSE; } else { return num_coerce_bin(x, y); } } static VALUE Ffix_lt(x, y) VALUE x, y; { if (FIXNUM_P(y)) { int a = FIX2INT(x), b = FIX2INT(y); if (a < b) return TRUE; return FALSE; } else { return num_coerce_bin(x, y); } } static VALUE Ffix_le(x, y) VALUE x, y; { if (FIXNUM_P(y)) { int a = FIX2INT(x), b = FIX2INT(y); if (a <= b) return TRUE; return FALSE; } else { return num_coerce_bin(x, y); } } static VALUE Ffix_dot2(left, right) VALUE left, right; { Need_Fixnum(right); return range_new(left, right); } static VALUE Ffix_rev(num) VALUE num; { unsigned long val = FIX2UINT(num); val = ~val; return INT2FIX(val); } static VALUE Ffix_and(x, y) VALUE x, y; { long val; if (TYPE(y) == T_BIGNUM) { return Fbig_and(y, x); } val = NUM2INT(x) & NUM2INT(y); return int2inum(val); } static VALUE Ffix_or(x, y) VALUE x, y; { long val; if (TYPE(y) == T_BIGNUM) { return Fbig_or(y, x); } val = NUM2INT(x) | NUM2INT(y); return INT2FIX(val); } static VALUE Ffix_xor(x, y) VALUE x, y; { long val; if (TYPE(y) == T_BIGNUM) { return Fbig_xor(y, x); } val = NUM2INT(x) ^ NUM2INT(y); return INT2FIX(val); } static VALUE Ffix_lshift(x, y) VALUE x, y; { long val, width; val = NUM2INT(x); width = NUM2INT(y); if (width > (sizeof(VALUE)*CHAR_BIT-1) || (unsigned)val>>(sizeof(VALUE)*CHAR_BIT-width) > 0) { return Fbig_lshift(int2big(val), y); } val = val << width; return int2inum(val); } static VALUE Ffix_rshift(x, y) VALUE x, y; { long val; val = RSHIFT(NUM2INT(x), NUM2INT(y)); return INT2FIX(val); } static VALUE Ffix_aref(fix, idx) VALUE fix, idx; { unsigned long val = FIX2INT(fix); int i = FIX2INT(idx); if (i < 0 || sizeof(VALUE)*CHAR_BIT-1 < i) return INT2FIX(0); if (val & (1<", Ffix_cmp, 1); rb_define_method(C_Fixnum, ">", Ffix_gt, 1); rb_define_method(C_Fixnum, ">=", Ffix_ge, 1); rb_define_method(C_Fixnum, "<", Ffix_lt, 1); rb_define_method(C_Fixnum, "<=", Ffix_le, 1); rb_define_method(C_Fixnum, "..", Ffix_dot2, 1); rb_define_method(C_Fixnum, "~", Ffix_rev, 0); rb_define_method(C_Fixnum, "&", Ffix_and, 1); rb_define_method(C_Fixnum, "|", Ffix_or, 1); rb_define_method(C_Fixnum, "^", Ffix_xor, 1); rb_define_method(C_Fixnum, "[]", Ffix_aref, 1); rb_define_method(C_Fixnum, "<<", Ffix_lshift, 1); rb_define_method(C_Fixnum, ">>", Ffix_rshift, 1); rb_define_method(C_Fixnum, "to_i", Ffix_to_i, 0); rb_define_method(C_Fixnum, "to_f", Ffix_to_f, 0); rb_define_method(C_Fixnum, "next", Ffix_next, 0); C_Float = rb_define_class("Float", C_Numeric); rb_define_method(C_Float, "to_s", Fflo_to_s, 0); rb_define_method(C_Float, "coerce", Fflo_coerce, 1); rb_define_method(C_Float, "-@", Fflo_uminus, 0); rb_define_method(C_Float, "+", Fflo_plus, 1); rb_define_method(C_Float, "-", Fflo_minus, 1); rb_define_method(C_Float, "*", Fflo_mul, 1); rb_define_method(C_Float, "/", Fflo_div, 1); rb_define_method(C_Float, "%", Fflo_mod, 1); rb_define_method(C_Float, "**", Fflo_pow, 1); rb_define_method(C_Float, "==", Fflo_eq, 1); rb_define_method(C_Float, "<=>", Fflo_cmp, 1); rb_define_method(C_Float, "hash", Fflo_hash, 0); rb_define_method(C_Float, "to_i", Fflo_to_i, 0); rb_define_method(C_Float, "to_f", Fflo_to_f, 0); rb_define_method(C_Float, "abs", Fflo_abs, 0); } ./ruby-0.64/object.c100644 150 1 23412 5704462362 12623 0ustar matzdaemon/************************************************ object.c - $Author: matz $ $Date: 1995/01/10 10:42:44 $ created at: Thu Jul 15 12:01:24 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "env.h" #include "node.h" #include "st.h" #include VALUE C_Kernel; VALUE C_Object; VALUE C_Module; VALUE C_Class; VALUE C_Nil; VALUE C_Data; struct st_table *new_idhash(); VALUE Fsprintf(); VALUE obj_responds_to(); VALUE obj_alloc(); static ID eq, match; static VALUE P_true(obj) VALUE obj; { return TRUE; } static VALUE P_false(obj) VALUE obj; { return FALSE; } VALUE rb_equal(obj1, obj2) VALUE obj1, obj2; { return rb_funcall(obj1, eq, 1, obj2); } static VALUE Fkrn_equal(obj1, obj2) VALUE obj1, obj2; { if (obj1 == obj2) return TRUE; return FALSE; } static VALUE Fkrn_to_a(obj) VALUE obj; { return ary_new3(1, obj); } static VALUE Fkrn_id(obj) VALUE obj; { return obj | FIXNUM_FLAG; } static VALUE Fkrn_noteq(obj, other) VALUE obj, other; { if (rb_equal(obj, other)) { return FALSE; } return TRUE; } static VALUE Fkrn_nmatch(obj, other) VALUE obj, other; { if (rb_funcall(obj, match, 1, other)) { return FALSE; } return TRUE; } static VALUE Fkrn_class(obj) struct RBasic *obj; { return obj->class; } VALUE Fkrn_to_s(obj) VALUE obj; { char buf[256]; sprintf(buf, "#<%s: 0x%x>", rb_class2name(CLASS_OF(obj)), obj); return str_new2(buf); } VALUE Fkrn_inspect(obj) VALUE obj; { return rb_funcall(obj, rb_intern("to_s"), 0, Qnil); } static obj_inspect(id, value, str) ID id; VALUE value; struct RString *str; { VALUE str2; char *ivname; if (str->ptr[0] == '-') { str->ptr[0] = '#'; } else { str_cat(str, ", ", 2); } ivname = rb_id2name(id); str_cat(str, ivname, strlen(ivname)); str_cat(str, "=", 1); str2 = rb_funcall(value, rb_intern("_inspect"), 0, Qnil); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); return ST_CONTINUE; } static VALUE Fobj_inspect(obj) struct RBasic *obj; { VALUE str; char buf[256]; if (FIXNUM_P(obj) || !obj->iv_tbl) return Fkrn_to_s(obj); sprintf(buf, "-<%s: ", rb_class2name(CLASS_OF(obj))); str = str_new2(buf); st_foreach(obj->iv_tbl, obj_inspect, str); str_cat(str, ">", 1); return str; } VALUE obj_is_member_of(obj, c) VALUE obj, c; { struct RClass *class = (struct RClass*)CLASS_OF(obj); switch (TYPE(c)) { case T_MODULE: case T_CLASS: break; default: Fail("class or module required"); } while (FL_TEST(class, FL_SINGLE)) { class = class->super; } if (c == (VALUE)class) return TRUE; return FALSE; } VALUE obj_is_kind_of(obj, c) VALUE obj, c; { struct RClass *class = (struct RClass*)CLASS_OF(obj); switch (TYPE(c)) { case T_MODULE: case T_CLASS: break; default: Fail("class or module required"); } while (class) { if ((VALUE)class == c || RCLASS(class)->m_tbl == RCLASS(c)->m_tbl) return TRUE; class = class->super; } return FALSE; } static VALUE Fobj_clone(obj) VALUE obj; { VALUE clone; Check_Type(obj, T_OBJECT); clone = obj_alloc(RBASIC(obj)->class); if (RBASIC(obj)->iv_tbl) { RBASIC(clone)->iv_tbl = st_copy(RBASIC(obj)->iv_tbl); } RBASIC(clone)->class = single_class_clone(RBASIC(obj)->class); return clone; } static VALUE Fnil_to_s(obj) VALUE obj; { return str_new2("nil"); } static VALUE Fnil_class(nil) VALUE nil; { return C_Nil; } static VALUE Fnil_plus(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: case T_FLOAT: case T_BIGNUM: case T_STRING: case T_ARRAY: return y; default: Fail("tried to add %s(%s) to nil", RSTRING(obj_as_string(y))->ptr, rb_class2name(CLASS_OF(y))); } return Qnil; /* not reached */ } static VALUE Fmain_to_s(obj) VALUE obj; { return str_new2("main"); } static VALUE Ftrue_to_s(obj) VALUE obj; { return str_new2("t"); } VALUE obj_alloc(class) VALUE class; { NEWOBJ(obj, struct RObject); OBJSETUP(obj, class, T_OBJECT); return (VALUE)obj; } static VALUE Fcls_new(argc, argv, class) int argc; VALUE *argv; VALUE class; { return obj_alloc(class); } static VALUE Fcls_to_s(class) VALUE class; { return str_new2(rb_class2name(class)); } static VALUE Fcls_attr(argc, argv, class) int argc; VALUE *argv; VALUE class; { VALUE name, pub; rb_scan_args(argc, argv, "11", &name, &pub); Check_Type(name, T_STRING); rb_define_attr(class, RSTRING(name)->ptr, pub); return Qnil; } static VALUE Fcls_export_internal(argc, argv, ex) int argc; VALUE *argv; int ex; { VALUE self = Qself; int i; ID id; for (i=0; iptr); } rb_export_method(self, id, ex); } return Qnil; } static VALUE Fcls_export(argc, argv) int argc; VALUE *argv; { Fcls_export_internal(argc, argv, 0); return Qnil; } static VALUE Fcls_unexport(argc, argv) int argc; VALUE *argv; { Fcls_export_internal(argc, argv, 1); return Qnil; } static VALUE Fcant_clone(obj) VALUE obj; { Fail("can't clone %s", rb_class2name(CLASS_OF(obj))); } static VALUE Fdata_class(data) VALUE data; { return C_Data; } static VALUE boot_defclass(name, super) char *name; VALUE super; { struct RClass *obj = (struct RClass*)class_new(super); rb_name_class(obj, rb_intern(name)); return (VALUE)obj; } Fdo() { return rb_yield(Qnil); } VALUE TopSelf; VALUE TRUE = 1; Init_Object() { VALUE metaclass; C_Kernel = boot_defclass("Kernel", Qnil); C_Object = boot_defclass("Object", C_Kernel); C_Module = boot_defclass("Module", C_Object); C_Class = boot_defclass("Class", C_Module); metaclass = RBASIC(C_Kernel)->class = single_class_new(C_Class); metaclass = RBASIC(C_Object)->class = single_class_new(metaclass); metaclass = RBASIC(C_Module)->class = single_class_new(metaclass); metaclass = RBASIC(C_Class)->class = single_class_new(metaclass); /* * Ruby's Class Hierarchy Chart * * +-------nil +---------------------+ * | ^ | | * | | | | * | Kernel----->(Kernel) | * | ^ ^ ^ ^ | * | | | | | | * | +---+ +----+ | +---+ | * | | +-----|----+ | | * | | | | | | * +->Nil->(Nil) Object---->(Object) | * ^ ^ ^ ^ | * | | | | | * | | +-------+ | | * | | | | | * | +---------+ +------+ | * | | | | | * +---------+ | Module--->(Module) | * | | ^ ^ | * OtherClass-->(OtherClass) | | | * Class---->(Class) | * ^ | * | | * +----------------+ * * + All metaclasses are instances of the class `Class'. */ rb_define_method(C_Kernel, "is_nil", P_false, 0); rb_define_method(C_Kernel, "!", P_false, 0); rb_define_method(C_Kernel, "==", Fkrn_equal, 1); rb_define_alias(C_Kernel, "equal", "=="); rb_define_method(C_Kernel, "hash", Fkrn_id, 0); rb_define_method(C_Kernel, "id", Fkrn_id, 0); rb_define_method(C_Kernel, "class", Fkrn_class, 0); rb_define_method(C_Kernel, "!=", Fkrn_noteq, 1); rb_define_alias(C_Kernel, "=~", "=="); rb_define_method(C_Kernel, "!~", Fkrn_nmatch, 1); rb_define_method(C_Kernel, "to_a", Fkrn_to_a, 0); rb_define_method(C_Kernel, "to_s", Fkrn_to_s, 0); rb_define_method(C_Kernel, "_inspect", Fkrn_inspect, 0); rb_define_private_method(C_Kernel, "sprintf", Fsprintf, -1); rb_define_alias(C_Kernel, "format", "sprintf"); rb_define_private_method(C_Kernel, "do", Fdo, 0); rb_define_method(C_Object, "_inspect", Fobj_inspect, 0); rb_define_method(C_Object, "responds_to", obj_responds_to, 1); rb_define_method(C_Object, "is_member_of", obj_is_member_of, 1); rb_define_method(C_Object, "is_kind_of", obj_is_kind_of, 1); rb_define_method(C_Object, "clone", Fobj_clone, 0); rb_define_method(C_Module, "to_s", Fcls_to_s, 0); rb_define_method(C_Module, "clone", Fcant_clone, 0); rb_define_private_method(C_Module, "attr", Fcls_attr, -1); rb_define_method(C_Module, "export", Fcls_export, -1); rb_define_method(C_Module, "unexport", Fcls_unexport, -1); rb_define_method(C_Class, "new", Fcls_new, -1); C_Nil = rb_define_class("Nil", C_Kernel); rb_define_method(C_Nil, "to_s", Fnil_to_s, 0); rb_define_method(C_Nil, "clone", P_false, 0); rb_define_method(C_Nil, "class", Fnil_class, 0); rb_define_method(C_Nil, "is_nil", P_true, 0); rb_define_method(C_Nil, "!", P_true, 0); /* default addition */ rb_define_method(C_Nil, "+", Fnil_plus, 1); C_Data = rb_define_class("Data", C_Kernel); rb_define_method(C_Data, "clone", Fcant_clone, 0); rb_define_method(C_Data, "class", Fdata_class, 0); eq = rb_intern("=="); match = rb_intern("=~"); Qself = TopSelf = obj_alloc(C_Object); rb_define_single_method(TopSelf, "to_s", Fmain_to_s, 0); TRUE = obj_alloc(C_Object); rb_define_single_method(TRUE, "to_s", Ftrue_to_s, 0); rb_define_const(C_Kernel, "%TRUE", TRUE); rb_define_const(C_Kernel, "%FALSE", FALSE); } ./ruby-0.64/pack.c100644 150 1 35705 5674170243 12303 0ustar matzdaemon/************************************************ pack.c - $Author: matz $ $Date: 1994/12/09 09:40:22 $ created at: Thu Feb 10 15:17:05 JST 1994 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include #include #define swaps(x) ((((x)&0xFF)<<8) + (((x)>>8)&0xFF)) #define swapl(x) ((((x)&0xFF)<<24) \ +(((x)>>24)&0xFF) \ +(((x)&0x0000FF00)<<8) \ +(((x)&0x00FF0000)>>8) ) #ifdef WORDS_BIGENDIAN #define ntohs(x) (x) #define ntohl(x) (x) #define htons(x) (x) #define htonl(x) (x) #define htovs(x) swaps(x) #define htovl(x) swapl(x) #define vtohs(x) swaps(x) #define vtohl(x) swapl(x) #else /* LITTLE ENDIAN */ #define ntohs(x) swaps(x) #define ntohl(x) swapl(x) #define htons(x) swaps(x) #define htonl(x) swapl(x) #define htovs(x) (x) #define htovl(x) (x) #define vtohs(x) (x) #define vtohl(x) (x) #endif extern VALUE C_String, C_Array; double atof(); static char *toofew = "too few arguments"; int strtoul(); static void encodes(); static VALUE Fpck_pack(ary, fmt) struct RArray *ary; struct RString *fmt; { static char *nul10 = "\0\0\0\0\0\0\0\0\0\0"; static char *spc10 = " "; char *p, *pend; VALUE res, from; char type; int items, len, idx; char *ptr; int plen; Check_Type(fmt, T_STRING); p = fmt->ptr; pend = fmt->ptr + fmt->len; res = str_new(0, 0); items = ary->len; idx = 0; #define NEXTFROM (items-- > 0 ? ary->ptr[idx++] : Fail(toofew)) while (p < pend) { type = *p++; /* get data type */ if (*p == '*') { /* set data length */ len = strchr("@Xxu", type) ? 0 : items; p++; } else if (isdigit(*p)) { len = strtoul(p, &p, 10); } else { len = 1; } switch (type) { case 'A': case 'a': case 'B': case 'b': case 'H': case 'h': from = NEXTFROM; if (from == Qnil) { ptr = Qnil; plen = 0; } else { from = obj_as_string(from); ptr = RSTRING(from)->ptr; plen = RSTRING(from)->len; } if (p[-1] == '*') len = plen; switch (type) { case 'a': if (plen > len) str_cat(res, ptr, len); else { str_cat(res, ptr, plen); len == plen; while (len >= 10) { str_cat(res, nul10, 10); len -= 10; } str_cat(res, nul10, len); } break; case 'A': if (plen > len) str_cat(res, ptr, len); else { str_cat(res, ptr, plen); len == plen; while (len >= 10) { str_cat(res, spc10, 10); len -= 10; } str_cat(res, spc10, len); } break; case 'b': { int byte = 0; int i; for (i=0; i++ < len; ptr++) { if (*ptr & 1) byte |= 128; if (i & 7) byte >>= 1; else { char c = byte & 0xff; str_cat(res, &c, 1); byte = 0; } } if (len & 7) { char c; byte >>= 7 - (len & 7); c = byte & 0xff; str_cat(res, &c, 1); } } break; case 'B': { int byte = 0; int i; for (i=0; i++ < len; ptr++) { byte |= *ptr & 1; if (i & 7) byte <<= 1; else { char c = byte & 0xff; str_cat(res, &c, 1); byte = 0; } } if (len & 7) { char c; byte <<= 7 - (len & 7); c = byte & 0xff; str_cat(res, &c, 1); } } break; case 'h': { int byte = 0; int i; for (i=0; i++ < len; ptr++) { if (isxdigit(*ptr)) { if (isalpha(*ptr)) byte |= (((*ptr & 15) + 9) & 15) << 4; else byte |= (*ptr & 15) << 4; if (i & 1) byte >>= 4; else { char c = byte & 0xff; str_cat(res, &c, 1); byte = 0; } } } if (len & 1) { char c = byte & 0xff; str_cat(res, &c, 1); } } break; case 'H': { int byte = 0; int i; for (i=0; i++ < len; ptr++) { if (isxdigit(*ptr)) { if (isalpha(*ptr)) byte |= ((*ptr & 15) + 9) & 15; else byte |= *ptr & 15; if (i & 1) byte <<= 4; else { char c = byte & 0xff; str_cat(res, &c, 1); byte = 0; } } } if (len & 1) { char c = byte & 0xff; str_cat(res, &c, 1); } } break; } break; case 'c': case 'C': while (len-- > 0) { char c; from = NEXTFROM; if (from == Qnil) c = 0; else { c = NUM2INT(from); } str_cat(res, &c, sizeof(char)); } break; case 's': case 'S': while (len-- > 0) { short s; from = NEXTFROM; if (from == Qnil) s = 0; else { s = NUM2INT(from); } str_cat(res, &s, sizeof(short)); } break; case 'i': case 'I': while (len-- > 0) { int i; from = NEXTFROM; if (from == Qnil) i = 0; else { i = NUM2INT(from); } str_cat(res, &i, sizeof(int)); } break; case 'l': case 'L': while (len-- > 0) { long l; from = NEXTFROM; if (from == Qnil) l = 0; else { l = NUM2INT(from); } str_cat(res, &l, sizeof(long)); } break; case 'n': while (len-- > 0) { short s; from = NEXTFROM; if (from == Qnil) s = 0; else { s = NUM2INT(from); } s = htons(s); str_cat(res, &s, sizeof(short)); } break; case 'N': while (len-- > 0) { long l; from = NEXTFROM; if (from == Qnil) l = 0; else { l = NUM2INT(from); } l = htonl(l); str_cat(res, &l, sizeof(long)); } break; case 'f': case 'F': while (len-- > 0) { float f; from = NEXTFROM; switch (TYPE(from)) { case T_FLOAT: f = RFLOAT(from)->value; break; case T_STRING: f = atof(RSTRING(from)->ptr); default: f = (float)NUM2INT(from); break; } str_cat(res, &f, sizeof(float)); } break; case 'd': case 'D': while (len-- > 0) { double d; from = NEXTFROM; switch (TYPE(from)) { case T_FLOAT: d = RFLOAT(from)->value; break; case T_STRING: d = atof(RSTRING(from)->ptr); default: d = (double)NUM2INT(from); break; } str_cat(res, &d, sizeof(double)); } break; case 'v': while (len-- > 0) { short s; from = NEXTFROM; if (from == Qnil) s = 0; else { s = NUM2INT(from); } s = htovs(s); str_cat(res, &s, sizeof(short)); } break; case 'V': while (len-- > 0) { long l; from = NEXTFROM; if (from == Qnil) l = 0; else { l = NUM2INT(from); } l = htovl(l); str_cat(res, &l, sizeof(long)); } break; case 'x': grow: while (len >= 10) { str_cat(res, nul10, 10); len -= 10; } str_cat(res, nul10, len); break; case 'X': shrink: if (RSTRING(res)->len < len) Fail("X outside of string"); RSTRING(res)->len -= len; RSTRING(res)->ptr[RSTRING(res)->len] = '\0'; break; case '@': len -= RSTRING(res)->len; if (len > 0) goto grow; len = -len; if (len > 0) goto shrink; break; case '%': Fail("% may only be used in unpack"); break; case 'u': from = obj_as_string(NEXTFROM); ptr = RSTRING(from)->ptr; plen = RSTRING(from)->len; if (len <= 1) len = 45; else len = len / 3 * 3; while (plen > 0) { int todo; if (plen > len) todo = len; else todo = plen; encodes(res, ptr, todo); plen -= todo; ptr += todo; } break; default: break; } } return res; } static void encodes(str, s, len) struct RString *str; char *s; int len; { char hunk[4]; char *p, *pend; p = str->ptr + str->len; *hunk = len + ' '; str_cat(str, hunk, 1); while (len > 0) { hunk[0] = ' ' + (077 & (*s >> 2)); hunk[1] = ' ' + (077 & (((*s << 4) & 060) | ((s[1] >> 4) & 017))); hunk[2] = ' ' + (077 & (((s[1] << 2) & 074) | ((s[2] >> 6) & 03))); hunk[3] = ' ' + (077 & (s[2] & 077)); str_cat(str, hunk, 4); s += 3; len -= 3; } pend = str->ptr + str->len; while (p < pend) { if (*p == ' ') *p = '`'; p++; } str_cat(str, "\n", 1); } static VALUE Fpck_unpack(str, fmt) struct RString *str, *fmt; { static char *hexdigits = "0123456789abcdef0123456789ABCDEFx"; char *s, *send; char *p, *pend; VALUE ary; char type; int len; Check_Type(fmt, T_STRING); s = str->ptr; send = s + str->len; p = fmt->ptr; pend = p + fmt->len; ary = ary_new(); while (p < pend) { retry: type = *p++; if (*p == '*') { len = send - s; p++; } else if (isdigit(*p)) { len = strtoul(p, &p, 10); } else { len = (type != '@'); } switch (type) { case '%': Fail("% is not supported(yet)"); break; case 'A': if (len > send - s) len = send - s; { char *t = s + len - 1; while (t >= s) { if (*t != ' ' && *t != '\0') break; t--; len--; } } case 'a': if (len > send - s) len = send - s; ary_push(ary, str_new(s, len)); s += len; break; case 'b': { VALUE bitstr; char *t; int bits, i; if (p[-1] == '*' || len > (send - s) * 8) len = (send - s) * 8; ary_push(ary, bitstr = str_new(0, len + 1)); t = RSTRING(bitstr)->ptr; for (i=0; i>= 1; else bits = *s++; *t++ = (bits & 1) ? '1' : '0'; } *t = '\0'; } break; case 'B': { VALUE bitstr; char *t; int bits, i; if (p[-1] == '*' || len > (send - s) * 8) len = (send - s) * 8; ary_push(ary, bitstr = str_new(0, len + 1)); t = RSTRING(bitstr)->ptr; for (i=0; i (send - s) * 2) len = (send - s) * 2; ary_push(ary, bitstr = str_new(0, len + 1)); t = RSTRING(bitstr)->ptr; for (i=0; i>= 4; else bits = *s++; *t++ = hexdigits[bits & 15]; } *t = '\0'; } break; case 'H': { VALUE bitstr; char *t; int bits, i; if (p[-1] == '*' || len > (send - s) * 2) len = (send - s) * 2; ary_push(ary, bitstr = str_new(0, len + 1)); t = RSTRING(bitstr)->ptr; for (i=0; i> 4) & 15]; } *t = '\0'; } break; case 'c': if (len > send - s) len = send - s; while (len-- > 0) { char c = *s++; ary_push(ary, INT2FIX(c)); } break; case 'C': if (len > send - s) len = send - s; while (len-- > 0) { unsigned char c = *s++; ary_push(ary, INT2FIX(c)); } break; case 's': if (len >= (send - s) / sizeof(short)) len = (send - s) / sizeof(short); while (len-- > 0) { short tmp; memcpy(&tmp, s, sizeof(short)); s += sizeof(short); ary_push(ary, INT2FIX(tmp)); } break; case 'S': if (len >= (send - s) / sizeof(unsigned short)) len = (send - s) / sizeof(unsigned short); while (len-- > 0) { unsigned short tmp; memcpy(&tmp, s, sizeof(unsigned short)); s += sizeof(unsigned short); ary_push(ary, INT2FIX(tmp)); } break; case 'i': if (len >= (send - s) / sizeof(int)) len = (send - s) / sizeof(int); while (len-- > 0) { int tmp; memcpy(&tmp, s, sizeof(int)); s += sizeof(int); ary_push(ary, int2inum(tmp)); } break; case 'I': if (len >= (send - s) / sizeof(unsigned int)) len = (send - s) / sizeof(unsigned int); while (len-- > 0) { unsigned int tmp; memcpy(&tmp, s, sizeof(unsigned int)); s += sizeof(unsigned int); ary_push(ary, int2inum(tmp)); } break; case 'l': if (len >= (send - s) / sizeof(long)) len = (send - s) / sizeof(long); while (len-- > 0) { long tmp; memcpy(&tmp, s, sizeof(long)); s += sizeof(long); ary_push(ary, int2inum(tmp)); } break; case 'L': if (len >= (send - s) / sizeof(unsigned long)) len = (send - s) / sizeof(unsigned long); while (len-- > 0) { unsigned long tmp; memcpy(&tmp, s, sizeof(unsigned long)); s += sizeof(unsigned long); ary_push(ary, int2inum(tmp)); } break; case 'n': if (len >= (send - s) / sizeof(short)) len = (send - s) / sizeof(short); while (len-- > 0) { short tmp; memcpy(&tmp, s, sizeof(short)); s += sizeof(short); tmp = ntohs(tmp); ary_push(ary, int2inum(tmp)); } break; case 'N': if (len >= (send - s) / sizeof(long)) len = (send - s) / sizeof(long); while (len-- > 0) { long tmp; memcpy(&tmp, s, sizeof(long)); s += sizeof(long); tmp = ntohl(tmp); ary_push(ary, int2inum(tmp)); } break; case 'F': case 'f': if (len >= (send - s) / sizeof(float)) len = (send - s) / sizeof(float); while (len-- > 0) { float tmp; memcpy(&tmp, s, sizeof(float)); s += sizeof(float); ary_push(ary, float_new((double)tmp)); } break; case 'D': case 'd': if (len >= (send - s) / sizeof(double)) len = (send - s) / sizeof(double); while (len-- > 0) { double tmp; memcpy(&tmp, s, sizeof(double)); s += sizeof(double); ary_push(ary, float_new(tmp)); } break; case 'v': if (len >= (send - s) / sizeof(short)) len = (send - s) / sizeof(short); while (len-- > 0) { short tmp; memcpy(&tmp, s, sizeof(short)); s += sizeof(short); tmp = vtohs(tmp); ary_push(ary, int2inum(tmp)); } break; case 'V': if (len >= (send - s) / sizeof(long)) len = (send - s) / sizeof(long); while (len-- > 0) { long tmp; memcpy(&tmp, s, sizeof(long)); s += sizeof(long); tmp = vtohl(tmp); ary_push(ary, int2inum(tmp)); } break; case 'u': { VALUE str = str_new(0, (send - s)*3/4); char *ptr = RSTRING(str)->ptr; int total = 0; while (s < send && *s > ' ' && *s < 'a') { long a,b,c,d; char hunk[4]; hunk[3] = '\0'; len = (*s++ - ' ') & 077; total += len; while (len > 0) { if (s < send && *s >= ' ') a = (*s++ - ' ') & 077; else a = 0; if (s < send && *s >= ' ') b = (*s++ - ' ') & 077; else b = 0; if (s < send && *s >= ' ') c = (*s++ - ' ') & 077; else c = 0; if (s < send && *s >= ' ') d = (*s++ - ' ') & 077; else d = 0; hunk[0] = a << 2 | b >> 4; hunk[1] = b << 4 | c >> 2; hunk[2] = c << 6 | d; memcpy(ptr, hunk, len > 3 ? 3 : len); ptr += 3; len -= 3; } if (*s == '\n') s++; else if (s[1] == '\n') /* possible checksum byte */ s += 2; } RSTRING(str)->len = total; ary_push(ary, str); } break; case '@': s = str->ptr + len; break; case 'X': if (len > s - str->ptr) Fail("X outside of string"); s -= len; break; case 'x': if (len > send - s) Fail("x outside of string"); s += len; break; default: break; } } return ary; } Init_pack() { rb_define_method(C_Array, "pack", Fpck_pack, 1); rb_define_method(C_String, "unpack", Fpck_unpack, 1); } ./ruby-0.64/parse.y100644 150 1 143676 5704462363 12555 0ustar matzdaemon/************************************************ parse.y - $Author: matz $ $Date: 1995/01/10 10:42:45 $ created at: Fri May 28 18:02:42 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ %{ #define YYDEBUG 1 #include "ruby.h" #include "env.h" #include "node.h" #include "st.h" #include #include "ident.h" #define is_id_nonop(id) ((id)>LAST_TOKEN) #define is_local_id(id) (is_id_nonop(id)&&((id)&ID_SCOPE_MASK)==ID_LOCAL) #define is_global_id(id) (is_id_nonop(id)&&((id)&ID_SCOPE_MASK)==ID_GLOBAL) #define is_instance_id(id) (is_id_nonop(id)&&((id)&ID_SCOPE_MASK)==ID_INSTANCE) #define is_variable_id(id) (is_id_nonop(id)&&((id)&ID_VARMASK)) #define is_attrset_id(id) (is_id_nonop(id)&&((id)&ID_SCOPE_MASK)==ID_ATTRSET) #define is_const_id(id) (is_id_nonop(id)&&((id)&ID_SCOPE_MASK)==ID_CONST) struct op_tbl { ID token; char *name; }; NODE *eval_tree = Qnil; char *sourcefile; /* current source file */ int sourceline; /* current line no. */ static int yylex(); static enum lex_state { EXPR_BEG, /* ignore newline, +/- is a sign. */ EXPR_MID, /* newline significant, +/- is a sign. */ EXPR_END, /* newline significant, +/- is a operator. */ EXPR_FNAME, /* ignore newline, +/- is a operator. */ } lex_state; static ID cur_class = Qnil, cur_mid = Qnil; static int in_module, in_single; static void value_expr(); static NODE *cond(); static NODE *cond2(); static NODE *block_append(); static NODE *list_append(); static NODE *list_concat(); static NODE *list_copy(); static NODE *expand_op(); static NODE *call_op(); static NODE *gettable(); static NODE *asignable(); static NODE *aryset(); static NODE *attrset(); static void push_local(); static void pop_local(); static int local_cnt(); static int local_id(); static ID *local_tbl(); struct global_entry* rb_global_entry(); static void init_top_local(); static void setup_top_local(); %} %union { NODE *node; VALUE val; ID id; int num; } %token CLASS MODULE DEF UNDEF INCLUDE IF THEN ELSIF ELSE CASE WHEN UNLESS UNTIL WHILE FOR IN PROTECT RESQUE ENSURE END REDO BREAK CONTINUE RETURN FAIL YIELD SUPER RETRY SELF NIL AND OR _FILE_ _LINE_ IF_MOD UNLESS_MOD WHILE_MOD UNTIL_MOD ALIAS %token IDENTIFIER GVAR IVAR CONSTANT %token INTEGER FLOAT STRING XSTRING REGEXP GLOB %token STRING2 XSTRING2 DREGEXP DGLOB %type singleton inc_list %type literal numeric %type compstmts stmts stmt stmt0 expr expr0 var_ref %type if_tail opt_else case_body cases resque ensure %type call_args call_args0 args args2 array %type f_arglist f_args assoc_list assocs assoc %type mlhs mlhs_head mlhs_tail lhs iter_var opt_iter_var %type superclass variable symbol %type fname op rest_arg %type f_arg %token UPLUS /* unary+ */ %token UMINUS /* unary- */ %token POW /* ** */ %token CMP /* <=> */ %token EQ /* == */ %token NEQ /* != <> */ %token GEQ /* >= */ %token LEQ /* <= */ %token ANDOP OROP /* && and || */ %token MATCH NMATCH /* =~ and !~ */ %token DOT2 DOT3 /* .. and ... */ %token AREF ASET /* [] and []= */ %token LSHFT RSHFT /* << and >> */ %token COLON2 /* :: */ %token OP_ASGN /* +=, -= etc. */ %token ASSOC /* => */ %token LPAREN LBRACK LBRACE /* * precedence table */ %left OR %left AND %left YIELD RETURN FAIL %right '=' OP_ASGN %right COLON2 %nonassoc DOT2 DOT3 %left OROP %left ANDOP %nonassoc CMP EQ NEQ MATCH NMATCH %left '>' GEQ '<' LEQ %left '|' '^' %left '&' %left LSHFT RSHFT %left '+' '-' %left '*' '/' '%' %right '!' '~' UPLUS UMINUS %right POW %token LAST_TOKEN %% program : { lex_state = EXPR_BEG; init_top_local(); } compstmts { eval_tree = block_append(eval_tree, $2); setup_top_local(); } compstmts : stmts opt_term stmts : /* none */ { $$ = Qnil; } | stmt | stmts term stmt { $$ = block_append($1, $3); } | stmts error { lex_state = EXPR_BEG; } stmt { yyerrok; $$ = block_append($1, $4); } stmt : CLASS IDENTIFIER superclass { if (cur_class || cur_mid || in_single) Error("nested class definition"); cur_class = $2; push_local(); } compstmts END { $$ = NEW_CLASS($2, $5, $3); pop_local(); cur_class = Qnil; } | MODULE IDENTIFIER { if (cur_class != Qnil) Error("nested module definition"); cur_class = $2; in_module = 1; push_local(); } compstmts END { $$ = NEW_MODULE($2, $4); pop_local(); cur_class = Qnil; in_module = 0; } | DEF fname { if (cur_mid || in_single) Error("nested method definition"); cur_mid = $2; push_local(); } f_arglist compstmts END { $$ = NEW_DEFN($2, NEW_RFUNC($4, $5), cur_class?0:1); pop_local(); cur_mid = Qnil; } | DEF singleton '.' fname { value_expr($2); in_single++; push_local(); } f_arglist compstmts END { $$ = NEW_DEFS($2, $4, NEW_RFUNC($6, $7)); pop_local(); in_single--; } | UNDEF fname { $$ = NEW_UNDEF($2); } | ALIAS fname {lex_state = EXPR_FNAME;} fname { $$ = NEW_ALIAS($2, $4); } | INCLUDE inc_list { if (cur_mid || in_single) Error("include appeared in method definition"); $$ = $2; } | stmt0 IF_MOD stmt0 { $$ = NEW_IF(cond($3), $1, Qnil); } | stmt0 UNLESS_MOD stmt0 { $$ = NEW_UNLESS(cond($3), $1, Qnil); } | stmt0 WHILE_MOD stmt0 { $$ = NEW_WHILE2(cond($3), $1); } | stmt0 UNTIL_MOD stmt0 { $$ = NEW_UNTIL2(cond($3), $1); } | stmt AND stmt { $$ = NEW_AND(cond($1), cond($3)); } | stmt OR stmt { $$ = NEW_OR(cond($1), cond($3)); } | stmt0 stmt0 : mlhs '=' args2 { $1->nd_value = $3; $$ = $1; } | REDO { $$ = NEW_REDO(); } | BREAK { $$ = NEW_BREAK(); } | CONTINUE { $$ = NEW_CONT(); } | RETRY { $$ = NEW_RETRY(); } | RETURN args2 { value_expr($2); if (!cur_mid && !in_single) Error("return appeared outside of method"); $$ = NEW_RET($2); } | RETURN { if (!cur_mid && !in_single) Error("return appeared outside of method"); $$ = NEW_RET(Qnil); } | FAIL args2 { value_expr($2); $$ = NEW_FAIL($2); } | YIELD args2 { value_expr($2); $$ = NEW_YIELD($2); } | IDENTIFIER call_args0 { $$ = NEW_CALL(Qnil, $1, $2); } | expr0 '.' IDENTIFIER call_args0 { value_expr($1); $$ = NEW_CALL($1, $3, $4); } | SUPER call_args0 { if (!cur_mid && !in_single) Error("super called outside of method"); $$ = NEW_SUPER($2); } | expr mlhs : mlhs_head { $$ = NEW_MASGN(NEW_LIST($1),Qnil); } | mlhs_head '*' lhs { $$ = NEW_MASGN(NEW_LIST($1),$3); } | mlhs_head mlhs_tail { $$ = NEW_MASGN(list_concat(NEW_LIST($1),$2),Qnil); } | mlhs_head mlhs_tail comma '*' lhs { $$ = NEW_MASGN(list_concat(NEW_LIST($1),$2),$5); } mlhs_head : variable comma { $$ = asignable($1, Qnil); } | expr0 '[' args rbracket comma { $$ = aryset($1, $3, Qnil); } | expr0 '.' IDENTIFIER comma { $$ = attrset($1, $3, Qnil); } mlhs_tail : lhs { $$ = NEW_LIST($1); } | mlhs_tail comma lhs { $$ = list_append($1, $3); } lhs : variable { $$ = asignable($1, Qnil); } | expr0 '[' args rbracket { $$ = aryset($1, $3, Qnil); } | expr0 '.' IDENTIFIER { $$ = attrset($1, $3, Qnil); } superclass : /* none */ { $$ = Qnil; } | ':' IDENTIFIER { $$ = $2; } inc_list : IDENTIFIER { $$ = NEW_INC($1); } | inc_list comma IDENTIFIER { $$ = block_append($1, NEW_INC($3)); } | error { lex_state = EXPR_BEG; $$ = Qnil; } | inc_list comma error { lex_state = EXPR_BEG; $$ = $1; } fname : IDENTIFIER | op { lex_state = EXPR_END; $$ = $1; } op : COLON2 { $$ = COLON2; } | DOT2 { $$ = DOT2; } | '|' { $$ = '|'; } | '^' { $$ = '^'; } | '&' { $$ = '&'; } | CMP { $$ = CMP; } | EQ { $$ = EQ; } | NEQ { $$ = NEQ; } | MATCH { $$ = MATCH; } | NMATCH { $$ = NMATCH; } | '>' { $$ = '>'; } | GEQ { $$ = GEQ; } | '<' { $$ = '<'; } | LEQ { $$ = LEQ; } | LSHFT { $$ = LSHFT; } | RSHFT { $$ = RSHFT; } | '+' { $$ = '+'; } | '-' { $$ = '-'; } | '*' { $$ = '*'; } | '/' { $$ = '/'; } | '%' { $$ = '%'; } | POW { $$ = POW; } | '!' { $$ = '!'; } | '~' { $$ = '~'; } | UPLUS { $$ = UMINUS; } | UMINUS { $$ = UPLUS; } | AREF { $$ = AREF; } | ASET { $$ = ASET; } f_arglist : '(' f_args rparen { $$ = $2; } | term { $$ = NEW_ARGS(0, -1); } f_args : /* no arg */ { $$ = NEW_ARGS(0, -1); } | f_arg { $$ = NEW_ARGS($1, -1); } | f_arg comma rest_arg { $$ = NEW_ARGS($1, $3); } | rest_arg { $$ = NEW_ARGS(Qnil, $1); } | f_arg error { lex_state = EXPR_BEG; $$ = NEW_ARGS($1, -1); } | error { lex_state = EXPR_BEG; $$ = NEW_ARGS(0, -1); } f_arg : IDENTIFIER { if (!is_local_id($1)) Error("formal argument must be local variable"); local_cnt($1); $$ = 1; } | f_arg comma IDENTIFIER { if (!is_local_id($3)) Error("formal argument must be local variable"); local_cnt($3); $$ += 1; } rest_arg : '*' IDENTIFIER { if (!is_local_id($2)) Error("rest argument must be local variable"); $$ = local_cnt($2); } singleton : var_ref { if (nd_type($1) == NODE_SELF) { $$ = NEW_SELF(); } else if (nd_type($1) == NODE_NIL) { Error("Can't define single method for nil."); $$ = Qnil; } else { $$ = $1; } } | LPAREN compstmts rparen { switch (nd_type($2)) { case NODE_STR: case NODE_STR2: case NODE_XSTR: case NODE_XSTR2: case NODE_DREGX: case NODE_DGLOB: case NODE_LIT: case NODE_ARRAY: case NODE_ZARRAY: Error("Can't define single method for literals."); default: break; } $$ = $2; } expr : variable '=' expr { value_expr($3); $$ = asignable($1, $3); } | expr0 '[' args rbracket '=' expr { value_expr($6); $$ = aryset($1, $3, $6); } | expr0 '.' IDENTIFIER '=' expr { value_expr($5); $$ = attrset($1, $3, $5); } | variable OP_ASGN expr { NODE *val; value_expr($3); if (is_local_id($1)) { val = NEW_LVAR($1); } else if (is_global_id($1)) { val = NEW_GVAR($1); } else if (is_instance_id($1)) { val = NEW_IVAR($1); } else { val = NEW_CVAR($1); } $$ = asignable($1, call_op(val, $2, 1, $3)); } | expr0 '[' args rbracket OP_ASGN expr { $$ = NEW_OP_ASGN1($1,$5,list_concat(NEW_LIST($6),$3)); } | expr0 '.' IDENTIFIER OP_ASGN expr { $$ = NEW_OP_ASGN2($1, $4, $5); } | expr DOT2 expr { $$ = call_op($1, DOT2, 1, $3); } | expr DOT3 expr { $$ = NEW_DOT3(cond2($1), cond2($3)); } | expr '+' expr { $$ = Qnil; if ($1 && $3 && (nd_type($3) == NODE_LIT || nd_type($3) == NODE_STR) && nd_type($1) == NODE_CALL && $1->nd_mid == '+') { if ($1->nd_args->nd_head == Qnil) Bug("bad operand for `+'"); if (nd_type($1->nd_args->nd_head) == NODE_LIT || nd_type($1->nd_args->nd_head) == NODE_STR) { $1->nd_args->nd_head = expand_op($1->nd_args->nd_head, '+', $3); $$ = $1; } } if ($$ == Qnil) { $$ = call_op($1, '+', 1, $3); } } | expr '-' expr { $$ = call_op($1, '-', 1, $3); } | expr '*' expr { $$ = call_op($1, '*', 1, $3); } | expr '/' expr { $$ = call_op($1, '/', 1, $3); } | expr '%' expr { $$ = call_op($1, '%', 1, $3); } | expr POW expr { $$ = call_op($1, POW, 1, $3); } | UPLUS expr { $$ = call_op($2, UPLUS, 0); } | UMINUS expr { $$ = call_op($2, UMINUS, 0); } | expr '|' expr { $$ = call_op($1, '|', 1, $3); } | expr '^' expr { $$ = call_op($1, '^', 1, $3); } | expr '&' expr { $$ = call_op($1, '&', 1, $3); } | expr CMP expr { $$ = call_op($1, CMP, 1, $3); } | expr '>' expr { $$ = call_op($1, '>', 1, $3); } | expr GEQ expr { $$ = call_op($1, GEQ, 1, $3); } | expr '<' expr { $$ = call_op($1, '<', 1, $3); } | expr LEQ expr { $$ = call_op($1, LEQ, 1, $3); } | expr EQ expr { $$ = call_op($1, EQ, 1, $3); } | expr NEQ expr { $$ = call_op($1, NEQ, 1, $3); } | expr MATCH expr { $$ = NEW_CALL($1, MATCH, NEW_LIST($3)); } | expr NMATCH expr { $$ = NEW_CALL($1, NMATCH, NEW_LIST($3)); } | '!' expr { $$ = call_op($2, '!', 0); } | '~' expr { if ($2 && (nd_type($2) == NODE_STR || (nd_type($2) == NODE_LIT && (TYPE($2->nd_lit) == T_REGEXP || TYPE($2->nd_lit) == T_STRING)))) { $$ = NEW_CALL($2, '~', Qnil); } else { $$ = call_op($2, '~', 0); } } | expr LSHFT expr { $$ = call_op($1, LSHFT, 1, $3); } | expr RSHFT expr { $$ = call_op($1, RSHFT, 1, $3); } | expr COLON2 expr { $$ = call_op($1, COLON2, 1, $3); } | expr ANDOP expr { $$ = NEW_AND(cond($1), cond($3)); } | expr OROP expr { $$ = NEW_OR(cond($1), cond($3)); } |expr0 { $$ = $1; } call_args : /* none */ { $$ = Qnil; } | call_args0 | '*' expr { $$ = $2; } call_args0 : args | args comma '*' expr { $$ = call_op($1, '+', 1, $4); } args : expr { value_expr($1); $$ = NEW_LIST($1); } | args comma expr { value_expr($3); $$ = list_append($1, $3); } args2 : args { if ($1 && $1->nd_next == Qnil) { $$ = $1->nd_head; } else { $$ = $1; } } expr0 : literal { $$ = NEW_LIT($1); } | STRING { $$ = NEW_STR($1); } | STRING2 | XSTRING { $$ = NEW_XSTR($1); } | XSTRING2 | DREGEXP | DGLOB | var_ref | IDENTIFIER '(' call_args rparen { $$ = NEW_CALL(Qnil, $1, $3); } | SUPER '(' call_args rparen { if (!cur_mid && !in_single) Error("super called outside of method"); $$ = NEW_SUPER($3); } | SUPER { if (!cur_mid && !in_single) Error("super called outside of method"); $$ = NEW_ZSUPER(); } | expr0 '[' args rbracket { value_expr($1); $$ = NEW_CALL($1, AREF, $3); } | LBRACK array rbracket { if ($2 == Qnil) $$ = NEW_ZARRAY(); /* zero length array*/ else { $$ = $2; } } | LBRACE assoc_list rbrace { $$ = NEW_HASH($2); } | FAIL '(' args2 ')' { value_expr($3); $$ = NEW_FAIL($3); } | FAIL '(' ')' { $$ = NEW_FAIL(Qnil); } | FAIL { $$ = NEW_FAIL(Qnil); } | YIELD '(' args2 ')' { value_expr($3); $$ = NEW_YIELD($3); } | YIELD '(' ')' { $$ = NEW_YIELD(Qnil); } | YIELD { $$ = NEW_YIELD(Qnil); } | expr0 '{' opt_iter_var '|' compstmts rbrace { if (nd_type($1) == NODE_LVAR || nd_type($1) == NODE_MVAR) { $1 = NEW_CALL(Qnil, $1->nd_vid, Qnil); } $$ = NEW_ITER($3, $1, $5); } | expr0 '.' IDENTIFIER '(' call_args rparen { value_expr($1); $$ = NEW_CALL($1, $3, $5); } | expr0 '.' IDENTIFIER { value_expr($1); $$ = NEW_CALL($1, $3, Qnil); } | IF stmt0 then compstmts if_tail END { $$ = NEW_IF(cond($2), $4, $5); } | UNLESS stmt0 then compstmts opt_else END { $$ = NEW_UNLESS(cond($2), $4, $5); } | WHILE stmt0 term compstmts END { $$ = NEW_WHILE(cond($2), $4); } | UNTIL stmt0 term compstmts END { $$ = NEW_UNTIL(cond($2), $4); } | CASE compstmts case_body END { value_expr($2); $$ = NEW_CASE($2, $3); } | FOR iter_var IN stmt0 term compstmts END { value_expr($4); $$ = NEW_FOR($2, $4, $6); } | PROTECT compstmts resque ensure END { if ($3 == Qnil && $4 == Qnil) { Warning("useless protect clause"); $$ = $2; } else { $$ = NEW_PROT($2, $3, $4); } } | LPAREN compstmts rparen { $$ = $2; } then : term | THEN | term THEN if_tail : opt_else | ELSIF stmt0 then compstmts if_tail { $$ = NEW_IF(cond($2), $4, $5); } opt_else : /* none */ { $$ = Qnil; } | ELSE compstmts { $$ = $2; } iter_var : lhs | mlhs opt_iter_var : /* none */ { $$ = Qnil; } | iter_var case_body : WHEN args then compstmts cases { $$ = NEW_WHEN($2, $4, $5); } cases : opt_else | WHEN args then compstmts cases { $$ = NEW_WHEN($2, $4, $5); } resque : /* none */ { $$ = Qnil; } | RESQUE compstmts { if ($2 == Qnil) $$ = (NODE*)1; else $$ = $2; } ensure : /* none */ { $$ = Qnil; } | ENSURE compstmts { $$ = $2; } array : /* none */ { $$ = Qnil; } | args literal : numeric | '\\' symbol { $$ = INT2FIX($2); } | REGEXP | GLOB symbol : fname | IVAR | GVAR | CONSTANT numeric : INTEGER | FLOAT variable : IDENTIFIER | IVAR | GVAR | CONSTANT | NIL { $$ = NIL; } | SELF { $$ = SELF; } var_ref : variable { $$ = gettable($1); } assoc_list : /* none */ { $$ = Qnil; } | assocs assocs : assoc | assocs comma assoc { $$ = list_concat($1, $3); } assoc : expr ASSOC expr { $$ = list_append(NEW_LIST($1), $3); } opt_term : /* none */ | term term : sc | nl sc : ';' { yyerrok; } nl : '\n' { yyerrok; } rparen : ')' { yyerrok; } rbracket : ']' { yyerrok; } rbrace : '}' { yyerrok; } comma : ',' { yyerrok; } %% #include #include #include "regex.h" #define is_identchar(c) ((c)!=-1&&(isalnum(c) || (c) == '_' || ismbchar(c))) static char *tokenbuf = NULL; static int tokidx, toksiz = 0; VALUE newregexp(); VALUE newstring(); VALUE newfloat(); VALUE newinteger(); char *strdup(); #define EXPAND_B 1 #define LEAVE_BS 2 static NODE *var_extend(); static void read_escape(); static char *lex_p; static int lex_len; void lex_setsrc(src, ptr, len) char *src; char *ptr; int len; { sourcefile = (char*)strdup(src); sourceline = 1; lex_p = ptr; lex_len = len; } #define nextc() ((--lex_len>=0)?(*lex_p++):-1) #define pushback() (lex_len++, lex_p--) #define tokfix() (tokenbuf[tokidx]='\0') #define tok() tokenbuf #define toklen() tokidx #define toknow() &toknbuf[tokidx] char * newtok() { tokidx = 0; if (!tokenbuf) { toksiz = 60; tokenbuf = ALLOC_N(char, 60); } if (toksiz > 1024) { REALLOC_N(tokenbuf, char, 60); } return tokenbuf; } void tokadd(c) char c; { if (tokidx >= toksiz) { toksiz *= 2; REALLOC_N(tokenbuf, char, toksiz); } tokenbuf[tokidx++] = c; } static int parse_regx() { register int c; int in_brack = 0; int re_start = sourceline; NODE *list = Qnil; newtok(); while (c = nextc()) { switch (c) { case '[': in_brack = 1; break; case ']': in_brack = 0; break; case '#': list = var_extend(list, '/'); if (list == (NODE*)-1) return 0; continue; case '\\': if ((c = nextc()) == -1) { sourceline = re_start; Error("unterminated regexp meets end of file"); return 0; } else if (c == '\n') { sourceline++; } else if (in_brack && c == 'b') { tokadd('\b'); } else if (isdigit(c)) { tokadd('\\'); tokadd(c); } else { pushback(); read_escape(LEAVE_BS); } continue; case '/': /* end of the regexp */ if (in_brack) break; tokfix(); lex_state = EXPR_END; if (list) { if (toklen() > 0) { VALUE ss = str_new(tok(), toklen()); list_append(list, NEW_STR(ss)); } nd_set_type(list, NODE_DREGX); yylval.node = list; return DREGEXP; } else { yylval.val = regexp_new(tok(), toklen()); return REGEXP; } case -1: Error("unterminated regexp"); return 0; default: if (ismbchar(c)) { tokadd(c); c = nextc(); } break; } tokadd(c); } } static int parse_string(term) int term; { int c; NODE *list = Qnil; ID id; int strstart; strstart = sourceline; newtok(); while ((c = nextc()) != term) { if (c == -1) { unterm_str: sourceline = strstart; Error("unterminated string meets end of file"); return 0; } if (ismbchar(c)) { tokadd(c); c = nextc(); } else if (c == '\n') { sourceline++; } else if (c == '#') { list = var_extend(list, term); if (list == (NODE*)-1) goto unterm_str; continue; } else if (c == '\\') { c = nextc(); if (c == '\n') { sourceline++; } else if (c == term) { tokadd(c); } else { int flags = EXPAND_B; if (term != '"') flags |= LEAVE_BS; pushback(); read_escape(flags); } continue; } tokadd(c); } tokfix(); lex_state = EXPR_END; if (list == Qnil) { yylval.val = str_new(tok(), toklen()); return (term == '`') ? XSTRING : STRING; } else { if (toklen() > 0) { VALUE ss = str_new(tok(), toklen()); list_append(list, NEW_STR(ss)); } yylval.node = list; if (term == '`') { nd_set_type(list, NODE_XSTR2); return XSTRING2; } else { return STRING2; } } } #define LAST(v) ((v)-1 + sizeof(v)/sizeof(v[0])) static struct kwtable { char *name; int id; enum lex_state state; } kwtable [] = { "__END__", 0, EXPR_BEG, "__FILE__", _FILE_, EXPR_END, "__LINE__", _LINE_, EXPR_END, "alias", ALIAS, EXPR_FNAME, "and", AND, EXPR_BEG, "break", BREAK, EXPR_END, "case", CASE, EXPR_BEG, "class", CLASS, EXPR_BEG, "continue", CONTINUE, EXPR_END, "def", DEF, EXPR_FNAME, "else", ELSE, EXPR_BEG, "elsif", ELSIF, EXPR_BEG, "end", END, EXPR_END, "ensure", ENSURE, EXPR_BEG, "fail", FAIL, EXPR_END, "for", FOR, EXPR_BEG, "if", IF, EXPR_BEG, "in", IN, EXPR_BEG, "include", INCLUDE, EXPR_BEG, "module", MODULE, EXPR_BEG, "nil", NIL, EXPR_END, "or", OR, EXPR_BEG, "protect", PROTECT, EXPR_BEG, "redo", REDO, EXPR_END, "resque", RESQUE, EXPR_BEG, "retry", RETRY, EXPR_END, "return", RETURN, EXPR_MID, "self", SELF, EXPR_END, "super", SUPER, EXPR_END, "then", THEN, EXPR_BEG, "undef", UNDEF, EXPR_FNAME, "unless", UNLESS, EXPR_BEG, "until", UNTIL, EXPR_BEG, "when", WHEN, EXPR_BEG, "while", WHILE, EXPR_BEG, "yield", YIELD, EXPR_END, }; static int yylex() { register int c; struct kwtable *low = kwtable, *mid, *high = LAST(kwtable); int last; retry: switch (c = nextc()) { case '\0': /* NUL */ case '\004': /* ^D */ case '\032': /* ^Z */ case -1: /* end of script. */ return 0; /* white spaces */ case ' ': case '\t': case '\f': case '\r': case '\13': /* '\v' */ goto retry; case '#': /* it's a comment */ while ((c = nextc()) != '\n') { if (c == -1) return 0; } /* fall through */ case '\n': sourceline++; if (lex_state == EXPR_BEG || lex_state == EXPR_FNAME) goto retry; lex_state = EXPR_BEG; return '\n'; case '*': lex_state = EXPR_BEG; if ((c = nextc()) == '*') { if (nextc() == '=') { yylval.id = POW; return OP_ASGN; } pushback(); return POW; } else if (c == '=') { yylval.id = '*'; return OP_ASGN; } pushback(); return '*'; case '!': if (lex_state == EXPR_FNAME) { if ((c = nextc()) == '@') { lex_state = EXPR_BEG; return '!'; } pushback(); } lex_state = EXPR_BEG; if ((c = nextc()) == '=') { return NEQ; } if (c == '~') { return NMATCH; } pushback(); return '!'; case '=': lex_state = EXPR_BEG; if ((c = nextc()) == '=') { return EQ; } if (c == '~') { return MATCH; } else if (c == '>') { return ASSOC; } pushback(); return '='; case '<': if (lex_state == EXPR_BEG) { if (parse_string('>') == STRING) { yylval.val = glob_new(yylval.val); return GLOB; } nd_set_type(yylval.node, NODE_DGLOB); return DGLOB; } lex_state = EXPR_BEG; if ((c = nextc()) == '=') { if ((c = nextc()) == '>') { return CMP; } pushback(); return LEQ; } if (c == '<') { if (nextc() == '=') { yylval.id = LSHFT; return OP_ASGN; } pushback(); return LSHFT; } pushback(); return '<'; case '>': lex_state = EXPR_BEG; if ((c = nextc()) == '=') { return GEQ; } if (c == '>') { if (nextc() == '=') { yylval.id = RSHFT; return OP_ASGN; } pushback(); return RSHFT; } pushback(); return '>'; case '"': case '`': return parse_string(c); case '\'': { int strstart; strstart = sourceline; newtok(); while ((c = nextc()) != '\'') { if (c == -1) { sourceline = strstart; Error("unterminated string meets end of file"); return 0; } if (ismbchar(c)) { tokadd(c); c = nextc(); } else if (c == '\n') { sourceline++; } else if (c == '\\') { c = nextc(); switch (c) { case '\n': sourceline++; continue; case '\'': c = '\''; break; case '\\': c = '\\'; break; default: tokadd('\\'); } } tokadd(c); } tokfix(); yylval.val = str_new(tok(), toklen()); lex_state = EXPR_END; return STRING; } case '?': if ((c = nextc()) == '\\') { newtok(); read_escape(EXPAND_B); c = tok()[0]; } c &= 0xff; yylval.val = INT2FIX(c); lex_state = EXPR_END; return INTEGER; case '&': lex_state = EXPR_BEG; if ((c = nextc()) == '&') { return ANDOP; } else if (c == '=') { yylval.id = '&'; return OP_ASGN; } pushback(); return '&'; case '|': lex_state = EXPR_BEG; if ((c = nextc()) == '|') { return OROP; } else if (c == '=') { yylval.id = '|'; return OP_ASGN; } pushback(); return '|'; case '+': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { c = nextc(); pushback(); if (isdigit(c)) { goto start_num; } lex_state = EXPR_BEG; return UPLUS; } else if (lex_state == EXPR_FNAME) { if ((c = nextc()) == '@') { return UPLUS; } pushback(); return '+'; } lex_state = EXPR_BEG; if ((c = nextc()) == '=') { yylval.id = '+'; return OP_ASGN; } pushback(); return '+'; case '-': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { c = nextc(); pushback(); if (isdigit(c)) { c = '-'; goto start_num; } lex_state = EXPR_BEG; return UMINUS; } else if (lex_state == EXPR_FNAME) { if ((c = nextc()) == '@') { return UMINUS; } pushback(); return '-'; } lex_state = EXPR_BEG; if ((c = nextc()) == '=') { yylval.id = '-'; return OP_ASGN; } pushback(); return '-'; case '.': lex_state = EXPR_BEG; if ((c = nextc()) == '.') { if ((c = nextc()) == '.') { return DOT3; } pushback(); return DOT2; } pushback(); if (!isdigit(c)) { return '.'; } c = '.'; /* fall through */ start_num: case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': { int is_float, seen_point, seen_e; lex_state = EXPR_END; newtok(); if (c == '0') { c = nextc(); if (c == 'x' || c == 'X') { /* hexadecimal */ while (c = nextc()) { if (!isxdigit(c)) break; tokadd(c); } pushback(); tokfix(); yylval.val = str2inum(tok(), 16); return INTEGER; } else if (c >= '0' && c <= '9') { /* octal */ do { tokadd(c); c = nextc(); } while (c >= '0' && c <= '9'); pushback(); tokfix(); yylval.val = str2inum(tok(), 8); return INTEGER; } } if (c == '-' || c == '+') { tokadd(c); c = nextc(); } is_float = seen_point = seen_e = 0; for (;;) { switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': tokadd(c); break; case '.': if (seen_point) { goto decode_num; } c = nextc(); if (!isdigit(c)) { pushback(); goto decode_num; } tokadd('.'); tokadd(c); is_float++; seen_point++; break; case 'e': case 'E': if (seen_e) { goto decode_num; } tokadd(c); seen_e++; is_float++; if ((c = nextc()) == '-' || c == '+') tokadd(c); else continue; break; case '_': /* `_' in decimal just ignored */ break; default: goto decode_num; } c = nextc(); } decode_num: pushback(); tokfix(); if (is_float) { double atof(); yylval.val = float_new(atof(tok())); return FLOAT; } yylval.val = str2inum(tok(), 10); return INTEGER; } case ']': case '}': case ')': lex_state = EXPR_END; return c; case ':': lex_state = EXPR_BEG; if (nextc() == ':') { return COLON2; } pushback(); return ':'; case '/': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { return parse_regx(); } lex_state = EXPR_BEG; if (nextc() == '=') { yylval.id = '/'; return OP_ASGN; } pushback(); return c; case '^': lex_state = EXPR_BEG; if (nextc() == '=') { yylval.id = '^'; return OP_ASGN; } pushback(); return c; case ',': case ';': lex_state = EXPR_BEG; return c; case '~': if (lex_state == EXPR_FNAME) { if ((c = nextc()) != '@') { pushback(); } } lex_state = EXPR_BEG; return c; case '(': if (lex_state != EXPR_END) c = LPAREN; lex_state = EXPR_BEG; return c; case '[': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) c = LBRACK; else if (lex_state == EXPR_FNAME) { if ((c = nextc()) == ']') { if ((c = nextc()) == '=') { return ASET; } pushback(); return AREF; } pushback(); return '['; } lex_state = EXPR_BEG; return c; case '{': if (lex_state != EXPR_END) c = LBRACE; lex_state = EXPR_BEG; return c; case '\\': c = nextc(); if (c == '\n') goto retry; /* skip \\n */ lex_state = EXPR_FNAME; pushback(); return '\\'; case '%': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { /* class constant */ newtok(); tokadd('%'); c = nextc(); break; } else { lex_state = EXPR_BEG; if (nextc() == '=') { yylval.id = '%'; return OP_ASGN; } pushback(); return c; } case '$': newtok(); tokadd(c); c = nextc(); switch (c) { case '*': /* $*: argv */ case '$': /* $$: pid */ case '?': /* $?: last status */ case '!': /* $!: error string */ case '@': /* $@: error position */ case '/': /* $/: input record separator */ case '\\': /* $\: output record separator */ case ',': /* $,: output field separator */ case '.': /* $.: last read line number */ case '_': /* $_: last read line string */ case '&': /* $&: last match */ case '`': /* $&: string before last match */ case '\'': /* $&: string after last match */ case '+': /* $&: string matches last paren. */ case '~': /* $~: match-data */ case '=': /* $=: ignorecase */ case ':': /* $:: load path */ case '<': /* $<: reading filename */ case '>': /* $>: default output handle */ case '"': /* $": already loaded files */ tokadd(c); tokadd('\0'); goto id_fetch; default: if (is_identchar(c)) break; pushback(); return tok()[0]; } break; case '@': c = nextc(); if (!is_identchar(c)) { pushback(); return '@'; } newtok(); tokadd('@'); break; default: if (c != '_' && !isalpha(c) && !ismbchar(c)) { Error("Invalid char '%c' in expression", c); goto retry; } newtok(); break; } while (is_identchar(c)) { tokadd(c); if (ismbchar(c)) { c = nextc(); tokadd(c); } c = nextc(); } pushback(); tokfix(); /* See if it is a reserved word. */ while (low <= high) { mid = low + (high - low)/2; if (( c = strcmp(mid->name, tok())) == 0) { enum lex_state state = lex_state; lex_state = mid->state; if (state != EXPR_BEG) { if (mid->id == IF) return IF_MOD; if (mid->id == UNLESS) return UNLESS_MOD; if (mid->id == WHILE) return WHILE_MOD; if (mid->id == UNTIL) return UNTIL_MOD; } return mid->id; } else if (c < 0) { low = mid + 1; } else { high = mid - 1; } } id_fetch: { enum lex_state state = lex_state; lex_state = EXPR_END; yylval.id = rb_intern(tok()); switch (tok()[0]) { case '%': return CONSTANT; case '$': return GVAR; case '@': return IVAR; default: if (state == EXPR_FNAME) { if ((c = nextc()) == '=') { yylval.id &= ~ID_SCOPE_MASK; yylval.id |= ID_ATTRSET; } else { pushback(); } } return IDENTIFIER; } } } static NODE* var_extend(list, term) NODE *list; char term; { int c, t; VALUE ss; ID id; c = nextc(); switch (c) { default: tokadd('#'); pushback(); return list; case '@': case '%': t = nextc(); pushback(); if (!is_identchar(t)) { tokadd('#'); tokadd(c); return list; } case '$': case '{': break; } ss = str_new(tok(), toklen()); if (list == Qnil) { list = NEW_STR2(ss); } else if (toklen() > 0) { list_append(list, NEW_STR(ss)); } newtok(); if (c == '{') { while ((c = nextc()) != '}') { if (c == -1) { return (NODE*)-1; } if (isspace(c)) { Error("Invalid variable name in string"); break; } if (c == term) { Error("Inmature variable name in string"); pushback(); return list; } tokadd(c); } } else { switch (c) { case '$': tokadd(c); c = nextc(); if (c == -1) return (NODE*)-1; if (!is_identchar(c)) { tokadd(c); goto fetch_id; } /* through */ case '@': case '%': tokadd(c); c = nextc(); break; } while (is_identchar(c)) { tokadd(c); if (ismbchar(c)) { c = nextc(); tokadd(c); } c = nextc(); } pushback(); } fetch_id: tokfix(); if (strcmp("__LINE__", tok()) == 0) id = _LINE_; else if (strcmp("__FILE__", tok()) == 0) id = _FILE_; else id = rb_intern(tok()); list_append(list, gettable(id)); newtok(); return list; } static void read_escape(flag) int flag; { char c; switch (c = nextc()) { case '\\': /* Backslash */ tokadd('\\'); break; case 'n': /* newline */ tokadd('\n'); break; case 't': /* horizontal tab */ tokadd('\t'); break; case 'r': /* carriage-return */ tokadd('\r'); break; case 'f': /* form-feed */ tokadd('\f'); break; case 'v': /* vertical tab */ tokadd('\13'); break; case 'a': /* alarm(bell) */ tokadd('\007'); break; case 'e': /* escape */ tokadd(033); break; case 'M': if ((c = nextc()) != '-') { Error("Invalid escape character syntax"); tokadd('\0'); return; } if ((c = nextc()) == '\\') { read_escape(flag); tokenbuf[tokidx-1] |= 0200; /* kludge */ } else { tokadd((c & 0xff) | 0200); } break; case 'C': if ((c = nextc()) != '-') { Error("Invalid escape character syntax"); tokadd('\0'); return; } case '^': if ((c = nextc())== '\\') { read_escape (flag); tokenbuf[tokidx-1] &= 0237; /* kludge */ } else if (c == '?') tokadd(0177); else tokadd(c & 0237); break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': { /* octal constant */ register int i = c - '0'; register int count = 0; while (++count < 3) { if ((c = nextc()) >= '0' && c <= '7') { i *= 8; i += c - '0'; } else { pushback(); break; } } tokadd(i&0xff); } break; case 'x': /* hex constant */ { register int i = 0; register int count = 0; while (++count < 3) { if ((c = nextc()) >= '0' && c <= '9') { i *= 16; i += c - '0'; } else if ((int)strchr("abcdefABCDEF", (c = nextc()))) { i *= 16; i += toupper(c) - 'A' + 10; } else { pushback(); break; } } tokadd(i&0xff); } break; case 'b': /* backspace */ if (flag & EXPAND_B) { tokadd('\b'); return; } /* go turough */ default: if (flag & LEAVE_BS) { tokadd('\\'); } case '#': tokadd(c); break; } } NODE* newnode(type, a0, a1, a2) enum node_type type; NODE *a0, *a1, *a2; { NODE *n = (NODE*)newobj(); n->flags |= T_NODE; nd_set_type(n, type); n->line = sourceline; n->file = sourcefile; n->u1.node = a0; n->u2.node = a1; n->u3.node = a2; return n; } enum node_type nodetype(node) /* for debug */ NODE *node; { return (enum node_type)nd_type(node); } static NODE* block_append(head, tail) NODE *head, *tail; { extern int verbose; NODE *last; if (tail == Qnil) return head; if (head == Qnil) return tail; if (nd_type(head) != NODE_BLOCK) head = last = NEW_BLOCK(head); else { last = head; while (last->nd_next) { last = last->nd_next; } } if (verbose) { switch (nd_type(last->nd_head)) { case NODE_BREAK: case NODE_CONTINUE: case NODE_REDO: case NODE_RETURN: case NODE_RETRY: Warning("statement not reached"); break; default: break; } } if (nd_type(tail) != NODE_BLOCK) { tail = NEW_BLOCK(tail); } last->nd_next = tail; head->nd_alen += tail->nd_alen; return head; } static NODE* list_append(head, tail) NODE *head, *tail; { NODE *last; if (head == Qnil) return NEW_LIST(tail); last = head; while (last->nd_next) { last = last->nd_next; } last->nd_next = NEW_LIST(tail); head->nd_alen += 1; return head; } static NODE* list_concat(head, tail) NODE *head, *tail; { NODE *last; #if 0 if (nd_type(head) != NODE_ARRAY || nd_type(tail) != NODE_ARRAY) Bug("list_concat() called with non-list"); #endif last = head; while (last->nd_next) { last = last->nd_next; } last->nd_next = tail; head->nd_alen += tail->nd_alen; return head; } static NODE* list_copy(list) NODE *list; { NODE *tmp; if (list == Qnil) return Qnil; tmp = Qnil; while(list) { tmp = list_append(tmp, list->nd_head); list = list->nd_next; } return tmp; } struct call_arg { ID id; VALUE recv; int narg; VALUE arg; }; static VALUE call_lit(arg) struct call_arg *arg; { return rb_funcall(arg->recv, arg->id, arg->narg, arg->arg); } static VALUE except_lit() { extern VALUE errstr; Error("%s", RSTRING(errstr)->ptr); return Qnil; } static NODE * expand_op(recv, id, arg) NODE *recv, *arg; ID id; { struct call_arg arg_data; VALUE val; NODE *result; arg_data.recv = recv->nd_lit; arg_data.id = id; arg_data.narg = arg?1:0; arg_data.arg = arg->nd_lit; val = rb_resque(call_lit, &arg_data, except_lit, Qnil); if (TYPE(val) == T_STRING) { result = NEW_STR(val); } else { result = NEW_LIT(val); } return result; } #define NODE_IS_CONST(n) (nd_type(n) == NODE_LIT || nd_type(n) == NODE_STR) static NODE * call_op(recv, id, narg, arg1) NODE *recv; ID id; int narg; NODE *arg1; { value_expr(recv); if (narg == 1) { value_expr(arg1); } if (NODE_IS_CONST(recv) && (narg == 0 || NODE_IS_CONST(arg1))) { return expand_op(recv, id, (narg == 1)?arg1:Qnil); } return NEW_CALL(recv, id, narg==1?NEW_LIST(arg1):Qnil); } static NODE* gettable(id) ID id; { if (id == SELF) { return NEW_SELF(); } else if (id == NIL) { return NEW_NIL(); } else if (id == _LINE_) { return NEW_LIT(INT2FIX(sourceline)); } else if (id == _FILE_) { VALUE s = str_new2(sourcefile); return NEW_STR(s); } else if (is_local_id(id)) { if (local_id(id)) return NEW_LVAR(id); else return NEW_MVAR(id); } else if (is_global_id(id)) { return NEW_GVAR(id); } else if (is_instance_id(id)) { return NEW_IVAR(id); } else if (is_const_id(id)) { return NEW_CVAR(id); } } static NODE* asignable(id, val) ID id; NODE *val; { NODE *lhs; if (id == SELF) { lhs = Qnil; Error("Can't change the value of self"); } else if (id == NIL) { lhs = Qnil; Error("Can't asign to nil"); } else if (id == _LINE_ || id == _FILE_) { Error("Can't asign to special identifier"); } else if (is_local_id(id)) { lhs = NEW_LASGN(id, val); } else if (is_global_id(id)) { lhs = NEW_GASGN(id, val); } else if (is_instance_id(id)) { lhs = NEW_IASGN(id, val); } else if (is_const_id(id)) { if (cur_mid || in_single) Error("class constant asigned in method body"); lhs = NEW_CASGN(id, val); } else { Bug("bad id for variable"); } return lhs; } static NODE * aryset(recv, idx, val) NODE *recv, *idx, *val; { value_expr(recv); return NEW_CALL(recv, ASET, list_append(idx, val)); } static NODE * attrset(recv, id, val) NODE *recv, *val; ID id; { value_expr(recv); id &= ~ID_SCOPE_MASK; id |= ID_ATTRSET; return NEW_CALL(recv, id, NEW_ARRAY(val)); } static void value_expr(node) NODE *node; { if (node == Qnil) return; switch (nd_type(node)) { case NODE_RETURN: case NODE_CONTINUE: case NODE_BREAK: case NODE_REDO: case NODE_RETRY: case NODE_WHILE: case NODE_WHILE2: case NODE_INC: case NODE_CLASS: case NODE_MODULE: Error("void value expression"); break; case NODE_BLOCK: while (node->nd_next) { node = node->nd_next; } if (node) { value_expr(node->nd_head); } break; default: break; } } static NODE* cond0(node) NODE *node; { enum node_type type = nd_type(node); if (type == NODE_STR || type == NODE_STR2 || type == NODE_DREGX) { return call_op(NEW_GVAR(rb_intern("$_")),MATCH,1,node); } else if (type == NODE_LIT && TYPE(node->nd_lit) == T_REGEXP) { return call_op(node,MATCH,1,NEW_GVAR(rb_intern("$_"))); } return node; } static NODE* cond(node) NODE *node; { enum node_type type = nd_type(node); value_expr(node); switch (type) { case NODE_MASGN: case NODE_LASGN: case NODE_GASGN: case NODE_IASGN: case NODE_CASGN: if (verbose) { Warning("asignment in condition"); } break; } node = cond0(node); if (type == NODE_CALL && node->nd_mid == '!') { if (node->nd_args || node->nd_recv == Qnil) { Bug("method `!' called with wrong # of operand"); } node->nd_recv = cond0(node->nd_recv); } return node; } static NODE* cond2(node) NODE *node; { node = cond(node); if (nd_type(node) == NODE_LIT && FIXNUM_P(node->nd_lit)) { return call_op(node,EQ,1,NEW_GVAR(rb_intern("$."))); } return node; } st_table *new_idhash(); static struct local_vars { ID *tbl; int cnt; struct local_vars *prev; } *lvtbl; static void push_local() { struct local_vars *local; local = ALLOC(struct local_vars); local->prev = lvtbl; local->cnt = 0; local->tbl = Qnil; lvtbl = local; } static void pop_local() { struct local_vars *local = lvtbl; lvtbl = local->prev; if (local->tbl) local->tbl[0] = local->cnt; free(local); } static ID* local_tbl() { return lvtbl->tbl; } static int local_cnt(id) ID id; { int cnt, max; if (id == 0) return lvtbl->cnt; for (cnt=0, max=lvtbl->cnt; cnttbl[cnt+1] == id) return cnt; } if (lvtbl->tbl == Qnil) { lvtbl->tbl = ALLOC_N(ID, 2); lvtbl->tbl[0] = 0; } else { REALLOC_N(lvtbl->tbl, ID, lvtbl->cnt+2); } lvtbl->tbl[lvtbl->cnt+1] = id; return lvtbl->cnt++; } static int local_id(id) ID id; { int i, max; if (lvtbl == Qnil) return FALSE; for (i=1, max=lvtbl->cnt+1; itbl[i] == id) return TRUE; } return FALSE; } static void init_top_local() { if (lvtbl == Qnil) { push_local(); } else if (the_scope->local_tbl) { lvtbl->cnt = the_scope->local_tbl[0]; } else { lvtbl->cnt = 0; } if (lvtbl->cnt > 0) { lvtbl->tbl = ALLOC_N(ID, lvtbl->cnt); MEMCPY(lvtbl->tbl, the_scope->local_tbl, VALUE, lvtbl->cnt); } else { lvtbl->tbl = Qnil; } } static void setup_top_local() { int len = lvtbl->cnt; int i; if (len > 0) { i = lvtbl->tbl[0]; if (i < len) { if (the_scope->flags & SCOPE_MALLOCED) { VALUE *vars = the_scope->local_vars; REALLOC_N(the_scope->local_vars, VALUE, len); MEMZERO(the_scope->local_vars+i, VALUE, len-i); free(the_scope->local_tbl); } else { VALUE *vars = the_scope->local_vars; the_scope->local_vars = ALLOC_N(VALUE, len); if (vars) { MEMCPY(the_scope->local_vars, vars, VALUE, i); MEMZERO(the_scope->local_vars+i, VALUE, len-i); } else { MEMZERO(the_scope->local_vars, VALUE, len); } } lvtbl->tbl[0] = len; the_scope->local_tbl = lvtbl->tbl; the_scope->flags |= SCOPE_MALLOCED; } else if (lvtbl->tbl) { free(lvtbl->tbl); } } } void yyappend_print() { eval_tree = block_append(eval_tree, NEW_CALL(Qnil, rb_intern("print"), NEW_ARRAY(NEW_GVAR(rb_intern("$_"))))); } void yywhole_loop(chop, split) int chop, split; { if (split) { eval_tree = block_append(NEW_GASGN(rb_intern("$F"), NEW_CALL(NEW_GVAR(rb_intern("$_")), rb_intern("split"), Qnil)), eval_tree); } if (chop) { eval_tree = block_append(NEW_CALL(NEW_GVAR(rb_intern("$_")), rb_intern("chop"), Qnil), eval_tree); } eval_tree = NEW_WHILE(NEW_CALL(0,rb_intern("gets"),0),eval_tree); } static struct op_tbl rb_op_tbl[] = { DOT2, "..", '+', "+", '-', "-", '+', "+(binary)", '-', "-(binary)", '*', "*", '/', "/", '%', "%", POW, "**", UPLUS, "+(unary)", UMINUS, "-(unary)", UPLUS, "+@", UMINUS, "-@", '|', "|", '^', "^", '&', "&", CMP, "<=>", '>', ">", GEQ, ">=", '<', "<", LEQ, "<=", EQ, "==", NEQ, "!=", MATCH, "=~", NMATCH, "!~", '!', "!", '~', "~", '!', "!(unary)", '~', "~(unary)", '!', "!@", '~', "~@", AREF, "[]", ASET, "[]=", LSHFT, "<<", RSHFT, ">>", COLON2, "::", Qnil, Qnil, }; char *rb_id2name(); char *rb_class2name(); st_table *rb_symbol_tbl; #define sym_tbl rb_symbol_tbl void Init_sym() { int strcmp(); sym_tbl = st_init_table(strcmp, st_strhash); } ID rb_intern(name) char *name; { static ID last_id = LAST_TOKEN; int id; int last; if (st_lookup(sym_tbl, name, &id)) return id; id = ++last_id; id <<= 3; switch (name[0]) { case '$': id |= ID_GLOBAL; break; case '@': id |= ID_INSTANCE; break; case '%': if (name[1] != '\0') { id |= ID_CONST; break; } /* fall through */ default: if (name[0] != '_' && !isalpha(name[0]) && !ismbchar(name[0])) { /* operator */ int i; id = Qnil; for (i=0; rb_op_tbl[i].token; i++) { if (strcmp(rb_op_tbl[i].name, name) == 0) { id = rb_op_tbl[i].token; break; } } if (id == Qnil) Bug("Unknown operator `%s'", name); break; } last = strlen(name)-1; if (name[last] == '=') { /* attribute asignment */ char *buf = ALLOCA_N(char,last+1); strncpy(buf, name, last); buf[last] = '\0'; id = rb_intern(buf); id &= ~ID_SCOPE_MASK; id |= ID_ATTRSET; } else { id |= ID_LOCAL; } break; } st_add_direct(sym_tbl, strdup(name), id); return id; } static char *find_ok; static id_find(name, id1, id2) char *name; ID id1, id2; { if (id1 == id2) { find_ok = name; return ST_STOP; } return ST_CONTINUE; } char * rb_id2name(id) ID id; { find_ok = Qnil; if (id < LAST_TOKEN) { int i = 0; for (i=0; rb_op_tbl[i].token; i++) { if (rb_op_tbl[i].token == id) return rb_op_tbl[i].name; } } st_foreach(sym_tbl, id_find, id); if (!find_ok && is_attrset_id(id)) { char *res; ID id2; id2 = (id & ~ID_SCOPE_MASK) | ID_LOCAL; res = rb_id2name(id2); if (res) { char *buf = ALLOCA_N(char,strlen(res)+2); strcpy(buf, res); strcat(buf, "="); rb_intern(buf); return rb_id2name(id); } } return find_ok; } char * rb_class2name(class) struct RClass *class; { extern st_table *rb_class_tbl; find_ok = Qnil; switch (TYPE(class)) { case T_ICLASS: class = (struct RClass*)RBASIC(class)->class; break; case T_CLASS: case T_MODULE: break; default: Fail("0x%x is not a class/module", class); } if (FL_TEST(class, FL_SINGLE)) { class = (struct RClass*)class->super; } while (TYPE(class) == T_ICLASS) { class = (struct RClass*)class->super; } st_foreach(rb_class_tbl, id_find, class); if (find_ok) { return rb_id2name((ID)find_ok); } Bug("class 0x%x not named", class); } ./ruby-0.64/process.c100644 150 1 23206 5704462365 13037 0ustar matzdaemon/************************************************ process.c - $Author: matz $ $Date: 1995/01/10 10:42:47 $ created at: Tue Aug 10 14:30:50 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include #include #include #include #include #include #ifdef HAVE_VFORK_H #include #endif #include "st.h" static VALUE get_pid() { return INT2FIX(getpid()); } static VALUE get_ppid() { return INT2FIX(getppid()); } static VALUE status; #if !defined(HAVE_WAITPID) && !defined(HAVE_WAIT4) static st_table *pid_tbl; #else # define WAIT_CALL #endif int rb_waitpid(pid, flags) int pid; int flags; { int result, st; #ifdef HAVE_WAITPID result = waitpid(pid, &st, flags); #else #ifdef HAVE_WAIT4 result = wait4(pid, &st, flags, NULL); #else if (pid_tbl && st_lookup(pid_tbl, pid, &st)) { status = INT2FIX(st); st_delete(pid_tbl, &pid, NULL); return pid; } if (flags) Fail("Can't do waitpid with flags"); for (;;) { result = wait(&st); if (result < 0) return -1; if (result == pid) { break; } if (!pid_tbl) pid_tbl = st_init_table(ST_NUMCMP, ST_NUMHASH); st_insert(pid_tbl, pid, st); } #endif #endif status = INT2FIX(st); return result; } #ifndef WAIT_CALL static int wait_pid; static int wait_status; static wait_each(key, value) int key, value; { if (wait_status != -1) return ST_STOP; wait_pid = key; wait_status = value; return ST_DELETE; } #endif static VALUE Fwait(obj) { int pid, state; #ifndef WAIT_CALL wait_status = -1; st_foreach(pid_tbl, wait_each, NULL); if (wait_status != -1) { status = wait_status; return wait_pid; } #endif if ((pid = wait(&state)) < 0) { if (errno == ECHILD) return Qnil; rb_sys_fail(Qnil); } status = INT2FIX(state); return INT2FIX(pid); } static VALUE Fwaitpid(obj, vpid, vflags) VALUE obj, vpid, vflags; { int pid, flags; if (vflags == Qnil) flags = Qnil; else flags = FIX2UINT(vflags); if ((pid = rb_waitpid(FIX2UINT(vpid), flags)) < 0) rb_sys_fail(Qnil); return INT2FIX(pid); } char *strtok(); rb_proc_exec(str) char *str; { char *s = str, *t; char **argv, **a; for (s=str; *s; s++) { if (*s != ' ' && !isalpha(*s) && strchr("*?{}[]<>()~&|\\$;'`\"\n",*s)) { execl("/bin/sh", "sh", "-c", str, (char *)NULL); return -1; } } a = argv = ALLOCA_N(char*, (s-str)/2+2); s = ALLOCA_N(char, s-str+1); strcpy(s, str); if (*a++ = strtok(s, " \t")) { while (t = strtok(NULL, " \t")) { *a++ = t; } *a = NULL; } if (argv[0]) { execvp(argv[0], argv); } return -1; } static VALUE Fexec(obj, str) VALUE obj; struct RString *str; { Check_Type(str, T_STRING); rb_proc_exec(str->ptr); rb_sys_fail(str->ptr); } static VALUE Ffork(obj) VALUE obj; { int pid; switch (pid = fork()) { case 0: return INT2FIX(0); case -1: rb_sys_fail("fork(2)"); break; default: return INT2FIX(pid); } } static VALUE F_exit(obj, status) VALUE obj, status; { int code = -1; if (FIXNUM_P(status)) { code = INT2FIX(status); } _exit(code); /* not reached */ return Qnil; } void rb_syswait(pid) int pid; { RETSIGTYPE (*hfunc)(), (*ifunc)(), (*qfunc)(); hfunc = signal(SIGHUP, SIG_IGN); ifunc = signal(SIGINT, SIG_IGN); qfunc = signal(SIGQUIT, SIG_IGN); if (rb_waitpid(pid, 0) < 0) rb_sys_fail("wait"); signal(SIGHUP, hfunc); signal(SIGINT, ifunc); signal(SIGQUIT, qfunc); } static VALUE Fsystem(obj, str) VALUE obj; struct RString *str; { int pid, w; Check_Type(str, T_STRING); fflush(stdin); /* is it really needed? */ fflush(stdout); fflush(stderr); if (*str->ptr == '\0') return INT2FIX(0); retry: switch (pid = vfork()) { case 0: rb_proc_exec(str->ptr); _exit(127); break; /* not reached */ case -1: if (errno == EAGAIN) { sleep(5); goto retry; } rb_sys_fail(str->ptr); break; default: rb_syswait(pid); } return status; } Fsleep(argc, argv) int argc; VALUE *argv; { int beg, end; beg = time(0); if (argc == 0) { sleep((32767<<16)+32767); } else if (argc == 1) { sleep(NUM2INT(argv[0])); } else { Fail("wrong # of arguments"); } end = time(0) - beg; return int2inum(end); } static VALUE Fproc_getpgrp(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE vpid; int pid, pgrp; rb_scan_args(argc, argv, "01", &vpid); if (vpid == Qnil) { pid = 0; } else { pid = NUM2INT(vpid); } pgrp = getpgrp(pid); return INT2FIX(pgrp); } static VALUE Fproc_setpgrp(obj, pid, pgrp) VALUE obj, pid, pgrp; { int ipid, ipgrp; ipid = NUM2INT(pid); ipgrp = NUM2INT(pgrp); if (getpgrp(ipid, ipgrp) == -1) rb_sys_fail(Qnil); return INT2FIX(0); } static VALUE Fproc_getpriority(obj, which, who) VALUE obj, which, who; { #ifdef HAVE_GETPRIORITY int prio, iwhich, iwho; iwhich = NUM2INT(which); iwho = NUM2INT(who); prio = getpriority(iwhich, iwho); if (prio == -1) rb_sys_fail(Qnil); return INT2FIX(prio); #else Fail("The getpriority() function is unimplemented on this machine"); #endif } static VALUE Fproc_setpriority(obj, which, who, prio) VALUE obj, which, who, prio; { #ifdef HAVE_GETPRIORITY int iwhich, iwho, iprio; iwhich = NUM2INT(which); iwho = NUM2INT(who); iprio = NUM2INT(prio); if (setpriority(iwhich, iwho, iprio) == -1) rb_sys_fail(Qnil); return INT2FIX(0); #else Fail("The setpriority() function is unimplemented on this machine"); #endif } static VALUE Fproc_getuid(obj) VALUE obj; { int uid = getuid(); return INT2FIX(uid); } static VALUE Fproc_setuid(obj, id) VALUE obj, id; { int uid; uid = NUM2INT(id); #ifdef HAVE_SETRUID setruid(uid); #else #ifdef HAVE_SETREUID setreuid(uid, -1); #else { if (geteuid() == uid) setuid(uid); else Fail("getruid not implemented"); } #endif #endif return INT2FIX(uid); } static VALUE Fproc_getgid(obj) VALUE obj; { int gid = getgid(); return INT2FIX(gid); } static VALUE Fproc_setgid(obj, id) VALUE obj, id; { int gid; gid = NUM2INT(id); #ifdef HAS_SETRGID setrgid((GIDTYPE)gid); #else #ifdef HAVE_SETREGID setregid(gid, -1); #else { if (getegid() == gid) setgid(gid); else Fail("getrgid not implemented"); } #endif #endif return INT2FIX(gid); } static VALUE Fproc_geteuid(obj) VALUE obj; { int euid = geteuid(); return INT2FIX(euid); } static VALUE Fproc_seteuid(obj, euid) VALUE obj, euid; { #ifdef HAVE_SETEUID if (seteuid(NUM2INT(euid)) == -1) rb_sys_fail(Qnil); #else #ifdef HAVE_SETREUID if (setreuid(-1, NUM2INT(euid)) == -1) rb_sys_fail(Qnil); #else euid = NUM2INT(euid); if (euid == getuid()) setuid(euid); else Fail("seteuid() not implemented"); #endif #endif return euid; } static VALUE Fproc_getegid(obj) VALUE obj; { int egid = getegid(); return INT2FIX(egid); } static VALUE Fproc_setegid(obj, egid) VALUE obj, egid; { #ifdef HAVE_SETEGID if (setegid(NUM2INT(egid)) == -1) rb_sys_fail(Qnil); #else #ifdef HAVE_SETREGID if (setregid(-1, NUM2INT(egid)) == -1) rb_sys_fail(Qnil); #else egid = NUM2INT(egid); if (egid == getgid()) setgid(egid); else Fail("setegid() not implemented"); #endif #endif return egid; } VALUE rb_readonly_hook(); VALUE M_Process; extern VALUE Fkill(); Init_process() { extern VALUE C_Kernel; rb_define_variable("$$", Qnil, get_pid, Qnil, 0); rb_define_variable("$?", &status, Qnil, rb_readonly_hook, 0); rb_define_private_method(C_Kernel, "exec", Fexec, 1); rb_define_private_method(C_Kernel, "fork", Ffork, 0); rb_define_private_method(C_Kernel, "_exit", Ffork, 1); rb_define_private_method(C_Kernel, "wait", Fwait, 0); rb_define_private_method(C_Kernel, "waitpid", Fwaitpid, 2); rb_define_private_method(C_Kernel, "system", Fsystem, 1); rb_define_private_method(C_Kernel, "sleep", Fsleep, -1); M_Process = rb_define_module("Process"); rb_define_single_method(M_Process, "fork", Ffork, 0); rb_define_single_method(M_Process, "_exit", Ffork, 1); rb_define_single_method(M_Process, "wait", Fwait, 0); rb_define_single_method(M_Process, "waitpid", Fwaitpid, 2); rb_define_single_method(M_Process, "kill", Fkill, -1); rb_define_module_function(M_Process, "pid", get_pid, 0); rb_define_module_function(M_Process, "ppid", get_ppid, 0); rb_define_module_function(M_Process, "getpgrp", Fproc_getpgrp, -1); rb_define_module_function(M_Process, "setpgrp", Fproc_setpgrp, 2); rb_define_module_function(M_Process, "getpriority", Fproc_getpriority, 2); rb_define_module_function(M_Process, "setpriority", Fproc_setpriority, 3); rb_define_const(M_Process, "%PRIO_PROCESS", INT2FIX(PRIO_PROCESS)); rb_define_const(M_Process, "%PRIO_PGRP", INT2FIX(PRIO_PGRP)); rb_define_const(M_Process, "%PRIO_USER", INT2FIX(PRIO_USER)); rb_define_module_function(M_Process, "uid", Fproc_getuid, 0); rb_define_module_function(M_Process, "uid=", Fproc_setuid, 1); rb_define_module_function(M_Process, "gid", Fproc_getgid, 0); rb_define_module_function(M_Process, "gid=", Fproc_setgid, 1); rb_define_module_function(M_Process, "euid", Fproc_geteuid, 0); rb_define_module_function(M_Process, "euid=", Fproc_seteuid, 1); rb_define_module_function(M_Process, "egid", Fproc_getegid, 0); rb_define_module_function(M_Process, "egid=", Fproc_setegid, 1); } ./ruby-0.64/random.c100644 150 1 2500 5704462366 12614 0ustar matzdaemon/************************************************ random.c - $Author: matz $ $Date: 1995/01/10 10:42:48 $ created at: Fri Dec 24 16:39:21 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" static int first = 1; static char state[256]; static VALUE Fsrand(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { int seed, old; #ifdef HAVE_RANDOM static int saved_seed; #endif if (rb_scan_args(argc, argv, "01", &seed) == 0) { seed = time(0); } else { seed = NUM2INT(seed); } #ifdef HAVE_RANDOM if (first == 1) { initstate(1, state, sizeof state); first = 0; } else { setstate(state); } srandom(seed); old = saved_seed; saved_seed = seed; return int2inum(old); #else old = srand(seed); return int2inum(old); #endif } static VALUE Frand(obj, max) VALUE obj, max; { int val; #ifdef HAVE_RANDOM if (first == 1) { initstate(1, state, sizeof state); first = 0; } val = random() % NUM2INT(max); #else val = rand() % NUM2INT(max); #endif if (val < 0) val = -val; return int2inum(val); } Init_Random() { extern VALUE C_Kernel; rb_define_private_method(C_Kernel, "srand", Fsrand, -1); rb_define_private_method(C_Kernel, "rand", Frand, 1); } ./ruby-0.64/range.c100644 150 1 5413 5674170244 12433 0ustar matzdaemon/************************************************ range.c - $Author: matz $ $Date: 1994/12/06 09:30:12 $ created at: Thu Aug 19 17:46:47 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" VALUE M_Comparable; VALUE C_Range; static ID next, eq; static VALUE Srng_new(class, start, end) VALUE class, start, end; { VALUE obj; if (!obj_is_kind_of(start, M_Comparable) || TYPE(start) != TYPE(end)) { Fail("bad value for range"); } obj = obj_alloc(class); rb_iv_set(obj, "start", start); rb_iv_set(obj, "end", end); return obj; } VALUE range_new(start, end) VALUE start, end; { return Srng_new(C_Range, start, end); } static VALUE Frng_match(rng, obj) VALUE rng, obj; { VALUE beg, end; beg = rb_iv_get(rng, "start"); end = rb_iv_get(rng, "end"); if (FIXNUM_P(beg) && FIXNUM_P(obj)) { if (FIX2INT(beg) <= FIX2INT(obj) && FIX2INT(obj) <= FIX2INT(end)) { return TRUE; } return FALSE; } else { if (rb_funcall(beg, rb_intern("<="), 1, obj) && rb_funcall(end, rb_intern(">="), 1, obj)) { return TRUE; } return FALSE; } } struct upto_data { VALUE beg; VALUE end; }; static rng_upto(data) struct upto_data *data; { return rb_funcall(data->beg, rb_intern("upto"), 1, data->end); } static rng_upto_yield(v) VALUE v; { rb_yield(v); return Qnil; } static VALUE Frng_each(obj) VALUE obj; { VALUE b, e, current; b = rb_iv_get(obj, "start"); e = rb_iv_get(obj, "end"); if (FIXNUM_P(b)) { /* fixnum is a special case(for performance) */ Fnum_upto(b, e); } else if (TYPE(b) == T_STRING) { Fstr_upto(b, e); } else { struct upto_data data; data.beg = b; data.end = e; rb_iterate(rng_upto, &data, rng_upto_yield, Qnil); } return Qnil; } static VALUE Frng_start(obj) VALUE obj; { VALUE b; b = rb_iv_get(obj, "start"); return b; } static VALUE Frng_end(obj) VALUE obj; { VALUE e; e = rb_iv_get(obj, "end"); return e; } static VALUE Frng_to_s(obj) VALUE obj; { VALUE args[4]; args[0] = str_new2("%d..%d"); args[1] = rb_iv_get(obj, "start"); args[2] = rb_iv_get(obj, "end"); return Fsprintf(3, args); } extern VALUE M_Enumerable; Init_Range() { C_Range = rb_define_class("Range", C_Object); rb_include_module(C_Range, M_Enumerable); rb_define_single_method(C_Range, "new", Srng_new, 2); rb_define_method(C_Range, "=~", Frng_match, 1); rb_define_method(C_Range, "each", Frng_each, 0); rb_define_method(C_Range, "start", Frng_start, 0); rb_define_method(C_Range, "end", Frng_end, 0); rb_define_method(C_Range, "to_s", Frng_to_s, 0); eq = rb_intern("=="); next = rb_intern("next"); } ./ruby-0.64/re.c100644 150 1 32042 5704462367 11767 0ustar matzdaemon/************************************************ re.c - $Author: matz $ $Date: 1995/01/10 10:42:49 $ created at: Mon Aug 9 18:24:49 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "re.h" /* Generate compiled regular expressions */ #if 'a' == 97 /* it's ascii */ static char casetable[] = { '\000', '\001', '\002', '\003', '\004', '\005', '\006', '\007', '\010', '\011', '\012', '\013', '\014', '\015', '\016', '\017', '\020', '\021', '\022', '\023', '\024', '\025', '\026', '\027', '\030', '\031', '\032', '\033', '\034', '\035', '\036', '\037', /* ' ' '!' '"' '#' '$' '%' '&' ''' */ '\040', '\041', '\042', '\043', '\044', '\045', '\046', '\047', /* '(' ')' '*' '+' ',' '-' '.' '/' */ '\050', '\051', '\052', '\053', '\054', '\055', '\056', '\057', /* '0' '1' '2' '3' '4' '5' '6' '7' */ '\060', '\061', '\062', '\063', '\064', '\065', '\066', '\067', /* '8' '9' ':' ';' '<' '=' '>' '?' */ '\070', '\071', '\072', '\073', '\074', '\075', '\076', '\077', /* '@' 'A' 'B' 'C' 'D' 'E' 'F' 'G' */ '\100', '\141', '\142', '\143', '\144', '\145', '\146', '\147', /* 'H' 'I' 'J' 'K' 'L' 'M' 'N' 'O' */ '\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157', /* 'P' 'Q' 'R' 'S' 'T' 'U' 'V' 'W' */ '\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167', /* 'X' 'Y' 'Z' '[' '\' ']' '^' '_' */ '\170', '\171', '\172', '\133', '\134', '\135', '\136', '\137', /* '`' 'a' 'b' 'c' 'd' 'e' 'f' 'g' */ '\140', '\141', '\142', '\143', '\144', '\145', '\146', '\147', /* 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' */ '\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157', /* 'p' 'q' 'r' 's' 't' 'u' 'v' 'w' */ '\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167', /* 'x' 'y' 'z' '{' '|' '}' '~' */ '\170', '\171', '\172', '\173', '\174', '\175', '\176', '\177', '\200', '\201', '\202', '\203', '\204', '\205', '\206', '\207', '\210', '\211', '\212', '\213', '\214', '\215', '\216', '\217', '\220', '\221', '\222', '\223', '\224', '\225', '\226', '\227', '\230', '\231', '\232', '\233', '\234', '\235', '\236', '\237', '\240', '\241', '\242', '\243', '\244', '\245', '\246', '\247', '\250', '\251', '\252', '\253', '\254', '\255', '\256', '\257', '\260', '\261', '\262', '\263', '\264', '\265', '\266', '\267', '\270', '\271', '\272', '\273', '\274', '\275', '\276', '\277', '\300', '\301', '\302', '\303', '\304', '\305', '\306', '\307', '\310', '\311', '\312', '\313', '\314', '\315', '\316', '\317', '\320', '\321', '\322', '\323', '\324', '\325', '\326', '\327', '\330', '\331', '\332', '\333', '\334', '\335', '\336', '\337', '\340', '\341', '\342', '\343', '\344', '\345', '\346', '\347', '\350', '\351', '\352', '\353', '\354', '\355', '\356', '\357', '\360', '\361', '\362', '\363', '\364', '\365', '\366', '\367', '\370', '\371', '\372', '\373', '\374', '\375', '\376', '\377', }; #else >>> "You lose. You will need a translation table for your character set." <<< #endif #define min(a,b) (((a)>(b))?(b):(a)) int str_cicmp(str1, str2) struct RString *str1, *str2; { int len, i; char *p1, *p2; len = min(str1->len, str2->len); p1 = str1->ptr; p2 = str2->ptr; for (i = 0; i < len; i++, p1++, p2++) { if (casetable[*p1] != casetable[*p2]) return casetable[*p1] - casetable[*p2]; } return str1->len - str2->len; } Regexp* make_regexp(s, len) char *s; int len; { Regexp *rp; char *err; register int c; /* Handle escaped characters first. */ /* Build a copy of the string (in dest) with the escaped characters translated, and generate the regex from that. */ rp = ALLOC(Regexp); MEMZERO((char *)rp, Regexp, 1); rp->pat.buffer = ALLOC_N(char, 16); rp->pat.allocated = 16; rp->pat.fastmap = ALLOC_N(char, 256); if ((err = re_compile_pattern(s, (size_t)len, &(rp->pat))) != NULL) Fail("%s: /%s/", err, s); return rp; } struct match { UINT len; char *ptr; struct re_registers regs; }; struct match last_match; int research(reg, str, start, ignorecase) struct RRegexp *reg; struct RString *str; int start; int ignorecase; { int result; if (FL_TEST(reg, FL_USER1)) { /* case-flag set for the object */ ignorecase = FL_TEST(reg, FL_USER2); /* case-flag */ } if (ignorecase) reg->ptr->pat.translate = casetable; else reg->ptr->pat.translate = NULL; if (start >= str->len) return -1; result = re_search(&(reg->ptr->pat), str->ptr, str->len, start, str->len - start, &(reg->ptr->regs)); if (result >= 0) { last_match.len = str->len; if (last_match.ptr == Qnil) { last_match.ptr = ALLOC_N(char, str->len+1); } else { REALLOC_N(last_match.ptr, char, str->len+1); } memcpy(last_match.ptr, str->ptr, last_match.len); last_match.ptr[last_match.len] = '\0'; last_match.regs = reg->ptr->regs; } return result; } static VALUE nth_match(nth) int nth; { int start, end, len; if (nth >= RE_NREGS) { Fail("match out of range %d, %d", nth, RE_NREGS); } start = last_match.regs.start[nth]; if (start == -1) return Qnil; end = last_match.regs.end[nth]; len = end - start; return str_new(last_match.ptr + start, len); } VALUE re_last_match(id) ID id; { return nth_match(0); } static VALUE re_match_pre() { struct match *match; if (last_match.regs.start[0] == -1) return Qnil; return str_new(last_match.ptr, last_match.regs.start[0]); } static VALUE re_match_post() { struct match *match; if (last_match.regs.start[0] == -1) return Qnil; return str_new(last_match.ptr+last_match.regs.end[0], last_match.len-last_match.regs.end[0]); } static VALUE re_match_last() { struct match *match; int i; if (last_match.regs.start[0] == -1) return Qnil; for (i=0; iptr); } static VALUE get_match() { struct match *data; int beg, i; data = ALLOC(struct match); data->len = last_match.len; data->ptr = ALLOC_N(char, last_match.len+1); memcpy(data->ptr, last_match.ptr, data->len+1); data->regs = last_match.regs; return data_new(data, free_match, Qnil); } static VALUE set_match(val) struct RArray *val; { struct match *match; Check_Type(val, T_DATA); match = (struct match*)DATA_PTR(val); last_match.len = match->len; if (last_match.len == 0) { if (last_match.ptr) { free(last_match.ptr); last_match.ptr = Qnil; } } else { if (last_match.ptr == Qnil) { last_match.ptr = ALLOC_N(char, match->len+1); } else { REALLOC_N(last_match.ptr, char, match->len+1); } } memcpy(last_match.ptr, match->ptr, last_match.len+1); last_match.regs = match->regs; return (VALUE)val; } void reg_free(rp) Regexp *rp; { free(rp->pat.buffer); free(rp->pat.fastmap); free(rp); } void reg_error(s) const char *s; { Fail(s); } VALUE ignorecase; VALUE C_Regexp; static VALUE regexp_new_1(class, s, len) VALUE class; char *s; int len; { NEWOBJ(re, struct RRegexp); OBJSETUP(re, class, T_REGEXP); re->ptr = make_regexp(s, len); re->str = ALLOC_N(char, len+1); memcpy(re->str, s, len); re->str[len] = '\0'; re->len = len; return (VALUE)re; } VALUE regexp_new(s, len) char *s; int len; { return regexp_new_1(C_Regexp, s, len); } static VALUE str_cache, reg_cache; VALUE re_regcomp(str) struct RString *str; { if (str_cache && RSTRING(str_cache)->len == str->len && memcmp(RSTRING(str_cache)->ptr, str->ptr, str->len)) return reg_cache; str_cache = (VALUE)str; return reg_cache = regexp_new(str->ptr, str->len); } VALUE Freg_match(re, str) struct RRegexp *re; struct RString *str; { int start; Check_Type(str, T_STRING); start = research(re, str, 0, ignorecase); if (start == -1) { return Qnil; } return INT2FIX(start); } VALUE Freg_match2(re) struct RRegexp *re; { extern VALUE rb_lastline; int start; if (TYPE(rb_lastline) != T_STRING) Fail("$_ is not a string"); start = research(re, rb_lastline, 0, ignorecase); if (start == -1) { return Qnil; } return INT2FIX(start); } static VALUE Sreg_new(argc, argv, self) int argc; VALUE *argv; VALUE self; { VALUE src, reg; if (argc == 0 || argc > 2) { Fail("wrong # of argument"); } src = argv[0]; switch (TYPE(src)) { case T_STRING: reg = regexp_new_1(self, RREGEXP(src)->ptr, RREGEXP(src)->len); case T_REGEXP: reg = regexp_new_1(self, RREGEXP(src)->str, RREGEXP(src)->len); default: Check_Type(src, T_STRING); } if (argc == 2) { FL_SET(reg, FL_USER1); if (argv[1]) { FL_SET(reg, FL_USER2); } else { FL_UNSET(reg, FL_USER2); } } return Qnil; } static VALUE Freg_clone(re) struct RRegexp *re; { return regexp_new_1(CLASS_OF(re), re->str, re->len); } VALUE re_regsub(str) struct RString *str; { VALUE val = Qnil; char *p, *s, *e, c; int no, len; p = s = str->ptr; e = s + str->len; while (s < e) { char *ss = s; c = *s++; if (c == '&') no = 0; else if (c == '\\' && '0' <= *s && *s <= '9') no = *s++ - '0'; else no = -1; if (no >= 0) { if (val == Qnil) { val = str_new(p, ss-p); } else { str_cat(val, p, ss-p); } p = s; } if (no < 0) { /* Ordinary character. */ if (c == '\\' && (*s == '\\' || *s == '&')) p = ++s; } else { #define BEG(no) last_match.regs.start[no] #define END(no) last_match.regs.end[no] if (BEG(no) == -1) continue; str_cat(val, last_match.ptr+BEG(no), END(no)-BEG(no)); } } if (val == Qnil) return (VALUE)str; if (p < e) { str_cat(val, p, e-p); } if (RSTRING(val)->len == 0) { return (VALUE)str; } return val; } void rb_set_kanjicode(code) char *code; { if (code == Qnil) goto set_no_conversion; switch (code[0]) { case 'E': case 'e': obscure_syntax &= ~RE_MBCTYPE_MASK; obscure_syntax |= RE_MBCTYPE_EUC; break; case 'S': case 's': obscure_syntax &= ~RE_MBCTYPE_MASK; obscure_syntax |= RE_MBCTYPE_SJIS; break; default: case 'N': case 'n': set_no_conversion: obscure_syntax &= ~RE_MBCTYPE_MASK; break; } re_set_syntax(obscure_syntax); } static VALUE kanji_var_get() { switch (obscure_syntax & RE_MBCTYPE_MASK) { case RE_MBCTYPE_SJIS: return str_new2("SJIS"); case RE_MBCTYPE_EUC: return str_new2("EUC"); default: return Qnil; } } static void kanji_var_set(val) struct RString *val; { if (val == Qnil) rb_set_kanjicode(Qnil); Check_Type(val, T_STRING); rb_set_kanjicode(val->ptr); } void Init_Regexp() { int i; obscure_syntax = RE_NO_BK_PARENS | RE_NO_BK_VBAR | RE_CONTEXT_INDEP_OPS | RE_INTERVALS | RE_NO_BK_CURLY_BRACES | RE_MBCTYPE_EUC; for (i=0; i #include #include "regex.h" typedef struct Regexp { struct re_pattern_buffer pat; struct re_registers regs; } Regexp; VALUE re_regcomp(); VALUE re_regsub(); #endif ./ruby-0.64/regex.c100644 150 1 273354 5674170244 12524 0ustar matzdaemon/* Extended regular expression matching and search library. Copyright (C) 1985, 1989-90 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Multi-byte extension added May, 1993 by t^2 (Takahiro Tanimoto) Last change: May 21, 1993 by t^2 */ /* To test, compile with -Dtest. This Dtestable feature turns this into a self-contained program which reads a pattern, describes how it compiles, then reads a string and searches for it. On the other hand, if you compile with both -Dtest and -Dcanned you can run some tests we've already thought of. */ #include "config.h" /* We write fatal error messages on standard error. */ #include /* isalpha(3) etc. are used for the character classes. */ #include #ifdef emacs /* The `emacs' switch turns on certain special matching commands that make sense only in emacs. */ #include "lisp.h" #include "buffer.h" #include "syntax.h" #else /* not emacs */ #include "defines.h" #include #ifdef __STDC__ #define P(s) s #define MALLOC_ARG_T size_t #else #define P(s) () #define MALLOC_ARG_T unsigned #define volatile #define const #endif /* #define NO_ALLOCA /* try it out for now */ #ifndef NO_ALLOCA /* Make alloca work the best possible way. */ #ifdef __GNUC__ #ifndef atarist #ifndef alloca #define alloca __builtin_alloca #endif #endif /* atarist */ #else #if defined(sparc) && !defined(__GNUC__) #include #else char *alloca (); #endif #endif /* __GNUC__ */ #define FREE_AND_RETURN_VOID(stackb) return #define FREE_AND_RETURN(stackb,val) return(val) #define DOUBLE_STACK(stackx,stackb,len) \ (stackx = (unsigned char **) alloca (2 * len \ * sizeof (unsigned char *)),\ /* Only copy what is in use. */ \ (unsigned char **) memcpy (stackx, stackb, len * sizeof (char *))) #else /* NO_ALLOCA defined */ #define FREE_AND_RETURN_VOID(stackb) free(stackb);return #define FREE_AND_RETURN(stackb,val) free(stackb);return(val) #define DOUBLE_STACK(stackx,stackb,len) \ (unsigned char **)xrealloc (stackb, 2 * len * sizeof (unsigned char *)) #endif /* NO_ALLOCA */ static void store_jump P((char *, int, char *)); static void insert_jump P((int, char *, char *, char *)); static void store_jump_n P((char *, int, char *, unsigned)); static void insert_jump_n P((int, char *, char *, char *, unsigned)); static void insert_op_2 P((int, char *, char *, int, int )); static int memcmp_translate P((unsigned char *, unsigned char *, int, unsigned char *)); long re_set_syntax P((long)); /* Define the syntax stuff, so we can do the \<, \>, etc. */ /* This must be nonzero for the wordchar and notwordchar pattern commands in re_match_2. */ #ifndef Sword #define Sword 1 #endif #define SYNTAX(c) re_syntax_table[c] #ifdef SYNTAX_TABLE char *re_syntax_table; #else /* not SYNTAX_TABLE */ static char re_syntax_table[256]; static void init_syntax_once P((void)); static void init_syntax_once () { register int c; static int done = 0; if (done) return; memset (re_syntax_table, 0, sizeof re_syntax_table); for (c = 'a'; c <= 'z'; c++) re_syntax_table[c] = Sword; for (c = 'A'; c <= 'Z'; c++) re_syntax_table[c] = Sword; for (c = '0'; c <= '9'; c++) re_syntax_table[c] = Sword; /* Add specific syntax for ISO Latin-1. */ for (c = 0300; c <= 0377; c++) re_syntax_table[c] = Sword; re_syntax_table[0327] = 0; re_syntax_table[0367] = 0; done = 1; } #endif /* SYNTAX_TABLE */ #undef P #endif /* emacs */ /* Sequents are missing isgraph. */ #ifndef isgraph #define isgraph(c) (isprint((c)) && !isspace((c))) #endif /* Get the interface, including the syntax bits. */ #include "regex.h" /* These are the command codes that appear in compiled regular expressions, one per byte. Some command codes are followed by argument bytes. A command code can specify any interpretation whatsoever for its arguments. Zero-bytes may appear in the compiled regular expression. The value of `exactn' is needed in search.c (search_buffer) in emacs. So regex.h defines a symbol `RE_EXACTN_VALUE' to be 1; the value of `exactn' we use here must also be 1. */ enum regexpcode { unused=0, exactn=1, /* Followed by one byte giving n, then by n literal bytes. */ begline, /* Fail unless at beginning of line. */ endline, /* Fail unless at end of line. */ jump, /* Followed by two bytes giving relative address to jump to. */ on_failure_jump, /* Followed by two bytes giving relative address of place to resume at in case of failure. */ finalize_jump, /* Throw away latest failure point and then jump to address. */ maybe_finalize_jump, /* Like jump but finalize if safe to do so. This is used to jump back to the beginning of a repeat. If the command that follows this jump is clearly incompatible with the one at the beginning of the repeat, such that we can be sure that there is no use backtracking out of repetitions already completed, then we finalize. */ dummy_failure_jump, /* Jump, and push a dummy failure point. This failure point will be thrown away if an attempt is made to use it for a failure. A + construct makes this before the first repeat. Also use it as an intermediary kind of jump when compiling an or construct. */ succeed_n, /* Used like on_failure_jump except has to succeed n times; then gets turned into an on_failure_jump. The relative address following it is useless until then. The address is followed by two bytes containing n. */ jump_n, /* Similar to jump, but jump n times only; also the relative address following is in turn followed by yet two more bytes containing n. */ set_number_at, /* Set the following relative location to the subsequent number. */ anychar, /* Matches any (more or less) one character. */ charset, /* Matches any one char belonging to specified set. First following byte is number of bitmap bytes. Then come bytes for a bitmap saying which chars are in. Bits in each byte are ordered low-bit-first. A character is in the set if its bit is 1. A character too large to have a bit in the map is automatically not in the set. */ charset_not, /* Same parameters as charset, but match any character that is not one of those specified. */ start_memory, /* Start remembering the text that is matched, for storing in a memory register. Followed by one byte containing the register number. Register numbers must be in the range 0 through RE_NREGS. */ stop_memory, /* Stop remembering the text that is matched and store it in a memory register. Followed by one byte containing the register number. Register numbers must be in the range 0 through RE_NREGS. */ duplicate, /* Match a duplicate of something remembered. Followed by one byte containing the index of the memory register. */ before_dot, /* Succeeds if before point. */ at_dot, /* Succeeds if at point. */ after_dot, /* Succeeds if after point. */ begbuf, /* Succeeds if at beginning of buffer. */ endbuf, /* Succeeds if at end of buffer. */ wordchar, /* Matches any word-constituent character. */ notwordchar, /* Matches any char that is not a word-constituent. */ wordbeg, /* Succeeds if at word beginning. */ wordend, /* Succeeds if at word end. */ wordbound, /* Succeeds if at a word boundary. */ notwordbound,/* Succeeds if not at a word boundary. */ syntaxspec, /* Matches any character whose syntax is specified. followed by a byte which contains a syntax code, e.g., Sword. */ notsyntaxspec /* Matches any character whose syntax differs from that specified. */ }; /* Number of failure points to allocate space for initially, when matching. If this number is exceeded, more space is allocated, so it is not a hard limit. */ #ifndef NFAILURES #define NFAILURES 80 #endif #ifdef CHAR_UNSIGNED #define SIGN_EXTEND_CHAR(c) ((c)>(char)127?(c)-256:(c)) /* for IBM RT */ #endif #ifndef SIGN_EXTEND_CHAR #define SIGN_EXTEND_CHAR(x) (x) #endif /* Store NUMBER in two contiguous bytes starting at DESTINATION. */ #define STORE_NUMBER(destination, number) \ { (destination)[0] = (number) & 0377; \ (destination)[1] = (number) >> 8; } /* Same as STORE_NUMBER, except increment the destination pointer to the byte after where the number is stored. Watch out that values for DESTINATION such as p + 1 won't work, whereas p will. */ #define STORE_NUMBER_AND_INCR(destination, number) \ { STORE_NUMBER(destination, number); \ (destination) += 2; } /* Put into DESTINATION a number stored in two contingous bytes starting at SOURCE. */ #define EXTRACT_NUMBER(destination, source) \ { (destination) = *(source) & 0377; \ (destination) += SIGN_EXTEND_CHAR (*(char *)((source) + 1)) << 8; } /* Same as EXTRACT_NUMBER, except increment the pointer for source to point to second byte of SOURCE. Note that SOURCE has to be a value such as p, not, e.g., p + 1. */ #define EXTRACT_NUMBER_AND_INCR(destination, source) \ { EXTRACT_NUMBER (destination, source); \ (source) += 2; } /* Specify the precise syntax of regexps for compilation. This provides for compatibility for various utilities which historically have different, incompatible syntaxes. The argument SYNTAX is a bit-mask comprised of the various bits defined in regex.h. */ long re_set_syntax (syntax) long syntax; { long ret; ret = obscure_syntax; obscure_syntax = syntax; return ret; } /* Set by re_set_syntax to the current regexp syntax to recognize. */ #ifdef EUC #define DEFAULT_MBCTYPE RE_MBCTYPE_EUC #else #ifdef SJIS #define DEFAULT_MBCTYPE RE_MBCTYPE_SJIS #else #define DEFAULT_MBCTYPE 0 #endif #endif long obscure_syntax = DEFAULT_MBCTYPE; /* Macros for re_compile_pattern, which is found below these definitions. */ #define CHAR_CLASS_MAX_LENGTH 6 /* Fetch the next character in the uncompiled pattern, translating it if necessary. */ #define PATFETCH(c) \ {if (p == pend) goto end_of_pattern; \ c = * (unsigned char *) p++; \ if (translate && !ismbchar (c)) \ c = (unsigned char) translate[(unsigned char) c]; } /* Fetch the next character in the uncompiled pattern, with no translation. */ #define PATFETCH_RAW(c) \ {if (p == pend) goto end_of_pattern; \ c = * (unsigned char *) p++; } #define PATUNFETCH p-- /* If the buffer isn't allocated when it comes in, use this. */ #define INIT_BUF_SIZE 28 /* Make sure we have at least N more bytes of space in buffer. */ #define GET_BUFFER_SPACE(n) \ { \ while (b - bufp->buffer + (n) >= bufp->allocated) \ EXTEND_BUFFER; \ } /* Make sure we have one more byte of buffer space and then add CH to it. */ #define BUFPUSH(ch) \ { \ GET_BUFFER_SPACE (1); \ *b++ = (char) (ch); \ } /* Extend the buffer by twice its current size via reallociation and reset the pointers that pointed into the old allocation to point to the correct places in the new allocation. If extending the buffer results in it being larger than 1 << 16, then flag memory exhausted. */ #define EXTEND_BUFFER \ { char *old_buffer = bufp->buffer; \ if (bufp->allocated == (1L<<16)) goto too_big; \ bufp->allocated *= 2; \ if (bufp->allocated > (1L<<16)) bufp->allocated = (1L<<16); \ bufp->buffer = (char *) xrealloc (bufp->buffer, bufp->allocated); \ if (bufp->buffer == 0) \ goto memory_exhausted; \ b = (b - old_buffer) + bufp->buffer; \ if (fixup_jump) \ fixup_jump = (fixup_jump - old_buffer) + bufp->buffer; \ if (laststart) \ laststart = (laststart - old_buffer) + bufp->buffer; \ begalt = (begalt - old_buffer) + bufp->buffer; \ if (pending_exact) \ pending_exact = (pending_exact - old_buffer) + bufp->buffer; \ } /* Set the bit for character C in a character set list. */ #define SET_LIST_BIT(c) \ (b[(unsigned char) (c) / BYTEWIDTH] \ |= 1 << ((unsigned char) (c) % BYTEWIDTH)) /* Get the next unsigned number in the uncompiled pattern. */ #define GET_UNSIGNED_NUMBER(num) \ { if (p != pend) \ { \ PATFETCH (c); \ while (isdigit (c)) \ { \ if (num < 0) \ num = 0; \ num = num * 10 + c - '0'; \ if (p == pend) \ break; \ PATFETCH (c); \ } \ } \ } /* Subroutines for re_compile_pattern. */ /* static void store_jump (), insert_jump (), store_jump_n (), insert_jump_n (), insert_op_2 (); */ #define STORE_MBC(p, c) \ ((p)[0] = (unsigned char)(c >> 8), (p)[1] = (unsigned char)(c)) #define STORE_MBC_AND_INCR(p, c) \ (*(p)++ = (unsigned char)(c >> 8), *(p)++ = (unsigned char)(c)) #define EXTRACT_MBC(p) \ ((unsigned char)(p)[0] << 8 | (unsigned char)(p)[1]) #define EXTRACT_MBC_AND_INCR(p) \ ((p) += 2, (unsigned char)(p)[-2] << 8 | (unsigned char)(p)[-1]) #define EXTRACT_UNSIGNED(p) \ ((unsigned char)(p)[0] | (unsigned char)(p)[1] << 8) #define EXTRACT_UNSIGNED_AND_INCR(p) \ ((p) += 2, (unsigned char)(p)[-2] | (unsigned char)(p)[-1] << 8) /* Handle (mb)?charset(_not)?. Structure of mbcharset(_not)? in compiled pattern. struct { unsinged char id; mbcharset(_not)? unsigned char sbc_size; unsigned char sbc_map[sbc_size]; same as charset(_not)? up to here. unsigned short mbc_size; number of intervals. struct { unsigned short beg; beginning of interval. unsigned short end; end of interval. } intervals[mbc_size]; }; */ static void #ifdef __STDC__ set_list_bits (unsigned short c1, unsigned short c2, unsigned char *b, const unsigned char *translate) #else set_list_bits (c1, c2, b, translate) unsigned short c1, c2; unsigned char *b; const unsigned char *translate; #endif { enum regexpcode op = (enum regexpcode) b[-2]; unsigned char sbc_size = b[-1]; unsigned short mbc_size = EXTRACT_UNSIGNED (&b[sbc_size]); unsigned short c, beg, end, upb; if (c1 > c2) return; if (c1 < 1 << BYTEWIDTH) { upb = c2; if (1 << BYTEWIDTH <= upb) upb = (1 << BYTEWIDTH) - 1; /* The last single-byte char */ if (sbc_size <= upb / BYTEWIDTH) { /* Allocate maximum size so it never happens again. */ /* NOTE: memcpy() would not work here. */ memmove (&b[(1 << BYTEWIDTH) / BYTEWIDTH], &b[sbc_size], 2 + mbc_size*4); memset (&b[sbc_size], 0, (1 << BYTEWIDTH) / BYTEWIDTH - sbc_size); b[-1] = sbc_size = (1 << BYTEWIDTH) / BYTEWIDTH; } if (!translate) { for (; c1 <= upb; c1++) if (!ismbchar (c1)) SET_LIST_BIT (c1); } else for (; c1 <= upb; c1++) if (!ismbchar (c1)) SET_LIST_BIT (translate[c1]); if (c2 < 1 << BYTEWIDTH) return; c1 = 0x8000; /* The first wide char */ } b = &b[sbc_size + 2]; for (beg = 0, upb = mbc_size; beg < upb; ) { unsigned short mid = (beg + upb) >> 1; if (c1 - 1 > EXTRACT_MBC (&b[mid*4 + 2])) beg = mid + 1; else upb = mid; } for (end = beg, upb = mbc_size; end < upb; ) { unsigned short mid = (end + upb) >> 1; if (c2 >= EXTRACT_MBC (&b[mid*4]) - 1) end = mid + 1; else upb = mid; } if (beg != end) { if (c1 > EXTRACT_MBC (&b[beg*4])) c1 = EXTRACT_MBC (&b[beg*4]); if (c2 < EXTRACT_MBC (&b[(end - 1)*4])) c2 = EXTRACT_MBC (&b[(end - 1)*4]); } if (end < mbc_size && end != beg + 1) /* NOTE: memcpy() would not work here. */ memmove (&b[(beg + 1)*4], &b[end*4], (mbc_size - end)*4); STORE_MBC (&b[beg*4 + 0], c1); STORE_MBC (&b[beg*4 + 2], c2); mbc_size += beg + 1 - end; STORE_NUMBER (&b[-2], mbc_size); } static int #ifdef __STDC__ is_in_list (unsigned short c, const unsigned char *b) #else is_in_list (c, b) unsigned short c; const unsigned char *b; #endif { unsigned short size; int in = (enum regexpcode) b[-1] == charset_not; size = *b++; if (c < 1 << BYTEWIDTH) { if (c / BYTEWIDTH < size && b[c / BYTEWIDTH] & 1 << c % BYTEWIDTH) in = !in; } else { unsigned short i, j; b += size + 2; size = EXTRACT_UNSIGNED (&b[-2]); for (i = 0, j = size; i < j; ) { unsigned short k = (i + j) >> 1; if (c > EXTRACT_MBC (&b[k*4 + 2])) i = k + 1; else j = k; } if (i < size && EXTRACT_MBC (&b[i*4]) <= c && ((unsigned char) c != '\n' && (unsigned char) c != '\0')) in = !in; } return in; } /* re_compile_pattern takes a regular-expression string and converts it into a buffer full of byte commands for matching. PATTERN is the address of the pattern string SIZE is the length of it. BUFP is a struct re_pattern_buffer * which points to the info on where to store the byte commands. This structure contains a char * which points to the actual space, which should have been obtained with malloc. re_compile_pattern may use realloc to grow the buffer space. The number of bytes of commands can be found out by looking in the `struct re_pattern_buffer' that bufp pointed to, after re_compile_pattern returns. */ char * re_compile_pattern (pattern, size, bufp) char *pattern; size_t size; struct re_pattern_buffer *bufp; { register char *b = bufp->buffer; register char *p = pattern; char *pend = pattern + size; register unsigned c, c1; char *p0; unsigned char *translate = (unsigned char *) bufp->translate; /* Address of the count-byte of the most recently inserted `exactn' command. This makes it possible to tell whether a new exact-match character can be added to that command or requires a new `exactn' command. */ char *pending_exact = 0; /* Address of the place where a forward-jump should go to the end of the containing expression. Each alternative of an `or', except the last, ends with a forward-jump of this sort. */ char *fixup_jump = 0; /* Address of start of the most recently finished expression. This tells postfix * where to find the start of its operand. */ char *laststart = 0; /* In processing a repeat, 1 means zero matches is allowed. */ char zero_times_ok; /* In processing a repeat, 1 means many matches is allowed. */ char many_times_ok; /* Address of beginning of regexp, or inside of last \(. */ char *begalt = b; /* In processing an interval, at least this many matches must be made. */ int lower_bound; /* In processing an interval, at most this many matches can be made. */ int upper_bound; /* Place in pattern (i.e., the {) to which to go back if the interval is invalid. */ char *beg_interval = 0; /* Stack of information saved by \( and restored by \). Four stack elements are pushed by each \(: First, the value of b. Second, the value of fixup_jump. Third, the value of regnum. Fourth, the value of begalt. */ int stackb[40]; int *stackp = stackb; int *stacke = stackb + 40; int *stackt; /* Counts \('s as they are encountered. Remembered for the matching \), where it becomes the register number to put in the stop_memory command. */ int regnum = 1; bufp->fastmap_accurate = 0; #ifndef emacs #ifndef SYNTAX_TABLE /* Initialize the syntax table. */ init_syntax_once(); #endif #endif if (bufp->allocated == 0) { bufp->allocated = INIT_BUF_SIZE; if (bufp->buffer) /* EXTEND_BUFFER loses when bufp->allocated is 0. */ bufp->buffer = (char *) xrealloc (bufp->buffer, INIT_BUF_SIZE); else /* Caller did not allocate a buffer. Do it for them. */ bufp->buffer = (char *) xmalloc (INIT_BUF_SIZE); if (!bufp->buffer) goto memory_exhausted; begalt = b = bufp->buffer; } while (p != pend) { PATFETCH (c); switch (c) { case '$': { char *p1 = p; /* When testing what follows the $, look past the \-constructs that don't consume anything. */ if (! (obscure_syntax & RE_CONTEXT_INDEP_OPS)) while (p1 != pend) { if (*p1 == '\\' && p1 + 1 != pend && (p1[1] == '<' || p1[1] == '>' || p1[1] == '`' || p1[1] == '\'' #ifdef emacs || p1[1] == '=' #endif || p1[1] == 'b' || p1[1] == 'B')) p1 += 2; else break; } if (obscure_syntax & RE_TIGHT_VBAR) { if (! (obscure_syntax & RE_CONTEXT_INDEP_OPS) && p1 != pend) goto normal_char; /* Make operand of last vbar end before this `$'. */ if (fixup_jump) store_jump (fixup_jump, jump, b); fixup_jump = 0; BUFPUSH (endline); break; } /* $ means succeed if at end of line, but only in special contexts. If validly in the middle of a pattern, it is a normal character. */ if ((obscure_syntax & RE_CONTEXTUAL_INVALID_OPS) && p1 != pend) goto invalid_pattern; if (p1 == pend || *p1 == '\n' || (obscure_syntax & RE_CONTEXT_INDEP_OPS) || (obscure_syntax & RE_NO_BK_PARENS ? *p1 == ')' : *p1 == '\\' && p1[1] == ')') || (obscure_syntax & RE_NO_BK_VBAR ? *p1 == '|' : *p1 == '\\' && p1[1] == '|')) { BUFPUSH (endline); break; } goto normal_char; } case '^': /* ^ means succeed if at beg of line, but only if no preceding pattern. */ if ((obscure_syntax & RE_CONTEXTUAL_INVALID_OPS) && laststart) goto invalid_pattern; if (laststart && p - 2 >= pattern && p[-2] != '\n' && !(obscure_syntax & RE_CONTEXT_INDEP_OPS)) goto normal_char; if (obscure_syntax & RE_TIGHT_VBAR) { if (p != pattern + 1 && ! (obscure_syntax & RE_CONTEXT_INDEP_OPS)) goto normal_char; BUFPUSH (begline); begalt = b; } else BUFPUSH (begline); break; case '+': case '?': if ((obscure_syntax & RE_BK_PLUS_QM) || (obscure_syntax & RE_LIMITED_OPS)) goto normal_char; handle_plus: case '*': /* If there is no previous pattern, char not special. */ if (!laststart) { if (obscure_syntax & RE_CONTEXTUAL_INVALID_OPS) goto invalid_pattern; else if (! (obscure_syntax & RE_CONTEXT_INDEP_OPS)) goto normal_char; } /* If there is a sequence of repetition chars, collapse it down to just one. */ zero_times_ok = 0; many_times_ok = 0; while (1) { zero_times_ok |= c != '+'; many_times_ok |= c != '?'; if (p == pend) break; PATFETCH (c); if (c == '*') ; else if (!(obscure_syntax & RE_BK_PLUS_QM) && (c == '+' || c == '?')) ; else if ((obscure_syntax & RE_BK_PLUS_QM) && c == '\\') { /* int c1; */ PATFETCH (c1); if (!(c1 == '+' || c1 == '?')) { PATUNFETCH; PATUNFETCH; break; } c = c1; } else { PATUNFETCH; break; } } /* Star, etc. applied to an empty pattern is equivalent to an empty pattern. */ if (!laststart) break; /* Now we know whether or not zero matches is allowed and also whether or not two or more matches is allowed. */ if (many_times_ok) { /* If more than one repetition is allowed, put in at the end a backward relative jump from b to before the next jump we're going to put in below (which jumps from laststart to after this jump). */ GET_BUFFER_SPACE (3); store_jump (b, maybe_finalize_jump, laststart - 3); b += 3; /* Because store_jump put stuff here. */ } /* On failure, jump from laststart to b + 3, which will be the end of the buffer after this jump is inserted. */ GET_BUFFER_SPACE (3); insert_jump (on_failure_jump, laststart, b + 3, b); pending_exact = 0; b += 3; if (!zero_times_ok) { /* At least one repetition is required, so insert a dummy-failure before the initial on-failure-jump instruction of the loop. This effects a skip over that instruction the first time we hit that loop. */ GET_BUFFER_SPACE (6); insert_jump (dummy_failure_jump, laststart, laststart + 6, b); b += 3; } break; case '.': laststart = b; BUFPUSH (anychar); break; case '[': if (p == pend) goto invalid_pattern; while (b - bufp->buffer > bufp->allocated - 9 - (1 << BYTEWIDTH) / BYTEWIDTH) EXTEND_BUFFER; laststart = b; if (*p == '^') { BUFPUSH (charset_not); p++; } else BUFPUSH (charset); p0 = p; BUFPUSH ((1 << BYTEWIDTH) / BYTEWIDTH); /* Clear the whole map */ memset (b, 0, (1 << BYTEWIDTH) / BYTEWIDTH + 2); if ((obscure_syntax & RE_HAT_NOT_NEWLINE) && b[-2] == charset_not) SET_LIST_BIT ('\n'); /* Read in characters and ranges, setting map bits. */ while (1) { int size; if ((size = EXTRACT_UNSIGNED (&b[(1 << BYTEWIDTH) / BYTEWIDTH]))) { /* Ensure the space is enough to hold another interval of multi-byte chars in charset(_not)?. */ size = (1 << BYTEWIDTH) / BYTEWIDTH + 2 + size*4 + 4; while (b + size + 1 > bufp->buffer + bufp->allocated) EXTEND_BUFFER; } /* Don't translate while fetching, in case it's a range bound. When we set the bit for the character, we translate it. */ PATFETCH_RAW (c); /* If set, \ escapes characters when inside [...]. */ if ((obscure_syntax & RE_AWK_CLASS_HACK) && c == '\\') { PATFETCH(c1); if (ismbchar (c1)) { unsigned char c2; PATFETCH_RAW (c2); c1 = c1 << 8 | c2; set_list_bits (c1, c1, (unsigned char *) b, translate); continue; } SET_LIST_BIT (c1); continue; } if (c == ']') { if (p == p0 + 1) { /* If this is an empty bracket expression. */ if ((obscure_syntax & RE_NO_EMPTY_BRACKETS) && p == pend) goto invalid_pattern; } else /* Stop if this isn't merely a ] inside a bracket expression, but rather the end of a bracket expression. */ break; } if (ismbchar (c)) { unsigned char c2; PATFETCH_RAW (c2); c = c << 8 | c2; } /* Get a range. */ if (p[0] == '-' && p[1] != ']') { PATFETCH_RAW (c1); /* Don't translate the range bounds while fetching them. */ PATFETCH_RAW (c1); if (ismbchar (c)) { unsigned char c2; PATFETCH_RAW (c2); c1 = c1 << 8 | c2; } if ((obscure_syntax & RE_NO_EMPTY_RANGES) && c > c1) goto invalid_pattern; if ((obscure_syntax & RE_NO_HYPHEN_RANGE_END) && c1 == '-' && *p != ']') goto invalid_pattern; set_list_bits (c, c1, (unsigned char *) b, translate); } else if ((obscure_syntax & RE_CHAR_CLASSES) && c == '[' && p[0] == ':') { /* Longest valid character class word has six characters. */ char str[CHAR_CLASS_MAX_LENGTH]; PATFETCH_RAW (c); c1 = 0; /* If no ] at end. */ if (p == pend) goto invalid_pattern; while (1) { /* Don't translate the ``character class'' characters. */ PATFETCH_RAW (c); if (c == ':' || c == ']' || p == pend || c1 == CHAR_CLASS_MAX_LENGTH) break; str[c1++] = c; } str[c1] = '\0'; if (p == pend || c == ']' /* End of the bracket expression. */ || p[0] != ']' || p + 1 == pend || (strcmp (str, "alpha") != 0 && strcmp (str, "upper") != 0 && strcmp (str, "lower") != 0 && strcmp (str, "digit") != 0 && strcmp (str, "alnum") != 0 && strcmp (str, "xdigit") != 0 && strcmp (str, "space") != 0 && strcmp (str, "print") != 0 && strcmp (str, "punct") != 0 && strcmp (str, "graph") != 0 && strcmp (str, "cntrl") != 0)) { /* Undo the ending character, the letters, and leave the leading : and [ (but set bits for them). */ c1++; while (c1--) PATUNFETCH; #if 1 /* The original was: */ SET_LIST_BIT ('['); SET_LIST_BIT (':'); #else /* I think this is the right way. */ if (translate) { SET_LIST_BIT (translate['[']); SET_LIST_BIT (trasnlate[':']); } else { SET_LIST_BIT ('['); SET_LIST_BIT (':'); } #endif } else { /* The ] at the end of the character class. */ PATFETCH (c); if (c != ']') goto invalid_pattern; for (c = 0; c < (1 << BYTEWIDTH); c++) { if ((strcmp (str, "alpha") == 0 && isalpha (c)) || (strcmp (str, "upper") == 0 && isupper (c)) || (strcmp (str, "lower") == 0 && islower (c)) || (strcmp (str, "digit") == 0 && isdigit (c)) || (strcmp (str, "alnum") == 0 && isalnum (c)) || (strcmp (str, "xdigit") == 0 && isxdigit (c)) || (strcmp (str, "space") == 0 && isspace (c)) || (strcmp (str, "print") == 0 && isprint (c)) || (strcmp (str, "punct") == 0 && ispunct (c)) || (strcmp (str, "graph") == 0 && isgraph (c)) || (strcmp (str, "cntrl") == 0 && iscntrl (c))) SET_LIST_BIT (c); } } } else if (translate && c < 1 << BYTEWIDTH) SET_LIST_BIT (translate[c]); else set_list_bits (c, c, (unsigned char *) b, translate); } /* Discard any character set/class bitmap bytes that are all 0 at the end of the map. Decrement the map-length byte too. */ while ((int) b[-1] > 0 && b[b[-1] - 1] == 0) b[-1]--; if (b[-1] != (1 << BYTEWIDTH) / BYTEWIDTH) memmove (&b[b[-1]], &b[(1 << BYTEWIDTH) / BYTEWIDTH], 2 + EXTRACT_UNSIGNED (&b[(1 << BYTEWIDTH) / BYTEWIDTH])*4); b += b[-1] + 2 + EXTRACT_UNSIGNED (&b[b[-1]])*4; break; case '(': if (! (obscure_syntax & RE_NO_BK_PARENS)) goto normal_char; else goto handle_open; case ')': if (! (obscure_syntax & RE_NO_BK_PARENS)) goto normal_char; else goto handle_close; case '\n': if (! (obscure_syntax & RE_NEWLINE_OR)) goto normal_char; else goto handle_bar; case '|': if ((obscure_syntax & RE_CONTEXTUAL_INVALID_OPS) && (! laststart || p == pend)) goto invalid_pattern; else if (! (obscure_syntax & RE_NO_BK_VBAR)) goto normal_char; else goto handle_bar; case '{': if (! ((obscure_syntax & RE_NO_BK_CURLY_BRACES) && (obscure_syntax & RE_INTERVALS))) goto normal_char; else goto handle_interval; case '\\': if (p == pend) goto invalid_pattern; PATFETCH_RAW (c); switch (c) { case '(': if (obscure_syntax & RE_NO_BK_PARENS) goto normal_backsl; handle_open: if (stackp == stacke) goto nesting_too_deep; /* Laststart should point to the start_memory that we are about to push (unless the pattern has RE_NREGS or more ('s). */ *stackp++ = b - bufp->buffer; if (regnum < RE_NREGS) { BUFPUSH (start_memory); BUFPUSH (regnum); } *stackp++ = fixup_jump ? fixup_jump - bufp->buffer + 1 : 0; *stackp++ = regnum++; *stackp++ = begalt - bufp->buffer; fixup_jump = 0; laststart = 0; begalt = b; break; case ')': if (obscure_syntax & RE_NO_BK_PARENS) goto normal_backsl; handle_close: if (stackp == stackb) goto unmatched_close; begalt = *--stackp + bufp->buffer; if (fixup_jump) store_jump (fixup_jump, jump, b); if (stackp[-1] < RE_NREGS) { BUFPUSH (stop_memory); BUFPUSH (stackp[-1]); } stackp -= 2; fixup_jump = *stackp ? *stackp + bufp->buffer - 1 : 0; laststart = *--stackp + bufp->buffer; break; case '|': if ((obscure_syntax & RE_LIMITED_OPS) || (obscure_syntax & RE_NO_BK_VBAR)) goto normal_backsl; handle_bar: if (obscure_syntax & RE_LIMITED_OPS) goto normal_char; /* Insert before the previous alternative a jump which jumps to this alternative if the former fails. */ GET_BUFFER_SPACE (6); insert_jump (on_failure_jump, begalt, b + 6, b); pending_exact = 0; b += 3; /* The alternative before the previous alternative has a jump after it which gets executed if it gets matched. Adjust that jump so it will jump to the previous alternative's analogous jump (put in below, which in turn will jump to the next (if any) alternative's such jump, etc.). The last such jump jumps to the correct final destination. */ if (fixup_jump) store_jump (fixup_jump, jump, b); /* Leave space for a jump after previous alternative---to be filled in later. */ fixup_jump = b; b += 3; laststart = 0; begalt = b; break; case '{': if (! (obscure_syntax & RE_INTERVALS) /* Let \{ be a literal. */ || ((obscure_syntax & RE_INTERVALS) && (obscure_syntax & RE_NO_BK_CURLY_BRACES)) /* If it's the string "\{". */ || (p - 2 == pattern && p == pend)) goto normal_backsl; handle_interval: beg_interval = p - 1; /* The {. */ /* If there is no previous pattern, this isn't an interval. */ if (!laststart) { if (obscure_syntax & RE_CONTEXTUAL_INVALID_OPS) goto invalid_pattern; else goto normal_backsl; } /* It also isn't an interval if not preceded by an re matching a single character or subexpression, or if the current type of intervals can't handle back references and the previous thing is a back reference. */ if (! (*laststart == anychar || *laststart == charset || *laststart == charset_not || *laststart == start_memory || (*laststart == exactn && laststart[1] == 1) || (! (obscure_syntax & RE_NO_BK_REFS) && *laststart == duplicate))) { if (obscure_syntax & RE_NO_BK_CURLY_BRACES) goto normal_char; /* Posix extended syntax is handled in previous statement; this is for Posix basic syntax. */ if (obscure_syntax & RE_INTERVALS) goto invalid_pattern; goto normal_backsl; } lower_bound = -1; /* So can see if are set. */ upper_bound = -1; GET_UNSIGNED_NUMBER (lower_bound); if (c == ',') { GET_UNSIGNED_NUMBER (upper_bound); if (upper_bound < 0) upper_bound = RE_DUP_MAX; } if (upper_bound < 0) upper_bound = lower_bound; if (! (obscure_syntax & RE_NO_BK_CURLY_BRACES)) { if (c != '\\') goto invalid_pattern; PATFETCH (c); } if (c != '}' || lower_bound < 0 || upper_bound > RE_DUP_MAX || lower_bound > upper_bound || ((obscure_syntax & RE_NO_BK_CURLY_BRACES) && p != pend && *p == '{')) { if (obscure_syntax & RE_NO_BK_CURLY_BRACES) goto unfetch_interval; else goto invalid_pattern; } /* If upper_bound is zero, don't want to succeed at all; jump from laststart to b + 3, which will be the end of the buffer after this jump is inserted. */ if (upper_bound == 0) { GET_BUFFER_SPACE (3); insert_jump (jump, laststart, b + 3, b); b += 3; } /* Otherwise, after lower_bound number of succeeds, jump to after the jump_n which will be inserted at the end of the buffer, and insert that jump_n. */ else { /* Set to 5 if only one repetition is allowed and hence no jump_n is inserted at the current end of the buffer; then only space for the succeed_n is needed. Otherwise, need space for both the succeed_n and the jump_n. */ unsigned slots_needed = upper_bound == 1 ? 5 : 10; GET_BUFFER_SPACE (slots_needed); /* Initialize the succeed_n to n, even though it will be set by its attendant set_number_at, because re_compile_fastmap will need to know it. Jump to what the end of buffer will be after inserting this succeed_n and possibly appending a jump_n. */ insert_jump_n (succeed_n, laststart, b + slots_needed, b, lower_bound); b += 5; /* Just increment for the succeed_n here. */ /* More than one repetition is allowed, so put in at the end of the buffer a backward jump from b to the succeed_n we put in above. By the time we've gotten to this jump when matching, we'll have matched once already, so jump back only upper_bound - 1 times. */ if (upper_bound > 1) { store_jump_n (b, jump_n, laststart, upper_bound - 1); b += 5; /* When hit this when matching, reset the preceding jump_n's n to upper_bound - 1. */ BUFPUSH (set_number_at); GET_BUFFER_SPACE (2); STORE_NUMBER_AND_INCR (b, -5); STORE_NUMBER_AND_INCR (b, upper_bound - 1); } /* When hit this when matching, set the succeed_n's n. */ GET_BUFFER_SPACE (5); insert_op_2 (set_number_at, laststart, b, 5, lower_bound); b += 5; } pending_exact = 0; beg_interval = 0; break; unfetch_interval: /* If an invalid interval, match the characters as literals. */ if (beg_interval) p = beg_interval; else { fprintf (stderr, "regex: no interval beginning to which to backtrack.\n"); exit (1); } beg_interval = 0; PATFETCH (c); /* normal_char expects char in `c'. */ goto normal_char; break; #ifdef emacs case '=': BUFPUSH (at_dot); break; case 's': laststart = b; BUFPUSH (syntaxspec); PATFETCH (c); BUFPUSH (syntax_spec_code[c]); break; case 'S': laststart = b; BUFPUSH (notsyntaxspec); PATFETCH (c); BUFPUSH (syntax_spec_code[c]); break; #endif /* emacs */ #ifdef RUBY case 's': case 'S': case 'd': case 'D': while (b - bufp->buffer > bufp->allocated - 9 - (1 << BYTEWIDTH) / BYTEWIDTH) EXTEND_BUFFER; laststart = b; if (c == 's' || c == 'd') { BUFPUSH (charset); } else { BUFPUSH (charset_not); } BUFPUSH ((1 << BYTEWIDTH) / BYTEWIDTH); memset (b, 0, (1 << BYTEWIDTH) / BYTEWIDTH + 2); if (c == 's' || c == 'S') { SET_LIST_BIT (' '); SET_LIST_BIT ('\t'); SET_LIST_BIT ('\n'); SET_LIST_BIT ('\r'); SET_LIST_BIT ('\f'); } else { char cc; for (cc = '0'; cc <= '9'; cc++) { SET_LIST_BIT (cc); } } while ((int) b[-1] > 0 && b[b[-1] - 1] == 0) b[-1]--; if (b[-1] != (1 << BYTEWIDTH) / BYTEWIDTH) memmove (&b[b[-1]], &b[(1 << BYTEWIDTH) / BYTEWIDTH], 2 + EXTRACT_UNSIGNED (&b[(1 << BYTEWIDTH) / BYTEWIDTH])*4); b += b[-1] + 2 + EXTRACT_UNSIGNED (&b[b[-1]])*4; break; #endif /* RUBY */ case 'w': laststart = b; BUFPUSH (wordchar); break; case 'W': laststart = b; BUFPUSH (notwordchar); break; #ifndef RUBY case '<': BUFPUSH (wordbeg); break; case '>': BUFPUSH (wordend); break; #endif /* RUBY */ case 'b': BUFPUSH (wordbound); break; case 'B': BUFPUSH (notwordbound); break; case '`': BUFPUSH (begbuf); break; case '\'': BUFPUSH (endbuf); break; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (obscure_syntax & RE_NO_BK_REFS) goto normal_char; c1 = c - '0'; if (c1 >= regnum) { if (obscure_syntax & RE_NO_EMPTY_BK_REF) goto invalid_pattern; else goto normal_char; } /* Can't back reference to a subexpression if inside of it. */ for (stackt = stackp - 2; stackt > stackb; stackt -= 4) if (*stackt == c1) goto normal_char; laststart = b; BUFPUSH (duplicate); BUFPUSH (c1); break; case '+': case '?': if (obscure_syntax & RE_BK_PLUS_QM) goto handle_plus; else goto normal_backsl; break; default: normal_backsl: /* You might think it would be useful for \ to mean not to translate; but if we don't translate it it will never match anything. */ if (translate && !ismbchar (c)) c = (unsigned char) translate[c]; goto normal_char; } break; default: normal_char: /* Expects the character in `c'. */ c1 = 0; if (ismbchar (c)) { c1 = c; PATFETCH_RAW (c); } if (!pending_exact || pending_exact + *pending_exact + 1 != b || *pending_exact >= (c1 ? 0176 : 0177) || *p == '*' || *p == '^' || ((obscure_syntax & RE_BK_PLUS_QM) ? *p == '\\' && (p[1] == '+' || p[1] == '?') : (*p == '+' || *p == '?')) || ((obscure_syntax & RE_INTERVALS) && ((obscure_syntax & RE_NO_BK_CURLY_BRACES) ? *p == '{' : (p[0] == '\\' && p[1] == '{')))) { laststart = b; BUFPUSH (exactn); pending_exact = b; BUFPUSH (0); } if (c1) { BUFPUSH (c1); (*pending_exact)++; } BUFPUSH (c); (*pending_exact)++; } } if (fixup_jump) store_jump (fixup_jump, jump, b); if (stackp != stackb) goto unmatched_open; bufp->used = b - bufp->buffer; return 0; invalid_pattern: return "Invalid regular expression"; unmatched_open: return "Unmatched \\("; unmatched_close: return "Unmatched \\)"; end_of_pattern: return "Premature end of regular expression"; nesting_too_deep: return "Nesting too deep"; too_big: return "Regular expression too big"; memory_exhausted: return "Memory exhausted"; } /* Store a jump of the form . Store in the location FROM a jump operation to jump to relative address FROM - TO. OPCODE is the opcode to store. */ static void store_jump (from, opcode, to) char *from, *to; int opcode; { from[0] = (char)opcode; STORE_NUMBER(from + 1, to - (from + 3)); } /* Open up space before char FROM, and insert there a jump to TO. CURRENT_END gives the end of the storage not in use, so we know how much data to copy up. OP is the opcode of the jump to insert. If you call this function, you must zero out pending_exact. */ static void insert_jump (op, from, to, current_end) int op; char *from, *to, *current_end; { register char *pfrom = current_end; /* Copy from here... */ register char *pto = current_end + 3; /* ...to here. */ while (pfrom != from) *--pto = *--pfrom; store_jump (from, op, to); } /* Store a jump of the form . Store in the location FROM a jump operation to jump to relative address FROM - TO. OPCODE is the opcode to store, N is a number the jump uses, say, to decide how many times to jump. If you call this function, you must zero out pending_exact. */ static void store_jump_n (from, opcode, to, n) char *from, *to; int opcode; unsigned n; { from[0] = (char)opcode; STORE_NUMBER (from + 1, to - (from + 3)); STORE_NUMBER (from + 3, n); } /* Similar to insert_jump, but handles a jump which needs an extra number to handle minimum and maximum cases. Open up space at location FROM, and insert there a jump to TO. CURRENT_END gives the end of the storage in use, so we know how much data to copy up. OP is the opcode of the jump to insert. If you call this function, you must zero out pending_exact. */ static void insert_jump_n (op, from, to, current_end, n) int op; char *from, *to, *current_end; unsigned n; { register char *pfrom = current_end; /* Copy from here... */ register char *pto = current_end + 5; /* ...to here. */ while (pfrom != from) *--pto = *--pfrom; store_jump_n (from, op, to, n); } /* Open up space at location THERE, and insert operation OP followed by NUM_1 and NUM_2. CURRENT_END gives the end of the storage in use, so we know how much data to copy up. If you call this function, you must zero out pending_exact. */ static void insert_op_2 (op, there, current_end, num_1, num_2) int op; char *there, *current_end; int num_1, num_2; { register char *pfrom = current_end; /* Copy from here... */ register char *pto = current_end + 5; /* ...to here. */ while (pfrom != there) *--pto = *--pfrom; there[0] = (char)op; STORE_NUMBER (there + 1, num_1); STORE_NUMBER (there + 3, num_2); } /* Given a pattern, compute a fastmap from it. The fastmap records which of the (1 << BYTEWIDTH) possible characters can start a string that matches the pattern. This fastmap is used by re_search to skip quickly over totally implausible text. The caller must supply the address of a (1 << BYTEWIDTH)-byte data area as bufp->fastmap. The other components of bufp describe the pattern to be used. */ void re_compile_fastmap (bufp) struct re_pattern_buffer *bufp; { unsigned char *pattern = (unsigned char *) bufp->buffer; int size = bufp->used; register char *fastmap = bufp->fastmap; register unsigned char *p = pattern; register unsigned char *pend = pattern + size; register int j, k; unsigned char *translate = (unsigned char *) bufp->translate; unsigned is_a_succeed_n; #ifndef NO_ALLOCA unsigned char *stackb[NFAILURES]; unsigned char **stackp = stackb; #else unsigned char **stackb; unsigned char **stackp; stackb = (unsigned char **) xmalloc (NFAILURES * sizeof (unsigned char *)); stackp = stackb; #endif /* NO_ALLOCA */ memset (fastmap, 0, (1 << BYTEWIDTH)); bufp->fastmap_accurate = 1; bufp->can_be_null = 0; while (p) { is_a_succeed_n = 0; if (p == pend) { bufp->can_be_null = 1; break; } #ifdef SWITCH_ENUM_BUG switch ((int) ((enum regexpcode) *p++)) #else switch ((enum regexpcode) *p++) #endif { case exactn: #if 0 /* The original was: */ if (translate) fastmap[translate[p[1]]] = 1; else fastmap[p[1]] = 1; #else /* The compiled pattern has already been translated. */ fastmap[p[1]] = 1; #endif break; case begline: case before_dot: case at_dot: case after_dot: case begbuf: case endbuf: case wordbound: case notwordbound: case wordbeg: case wordend: continue; case endline: if (translate) fastmap[translate['\n']] = 1; else fastmap['\n'] = 1; if (bufp->can_be_null != 1) bufp->can_be_null = 2; break; case jump_n: case finalize_jump: case maybe_finalize_jump: case jump: case dummy_failure_jump: EXTRACT_NUMBER_AND_INCR (j, p); p += j; if (j > 0) continue; /* Jump backward reached implies we just went through the body of a loop and matched nothing. Opcode jumped to should be an on_failure_jump. Just treat it like an ordinary jump. For a * loop, it has pushed its failure point already; If so, discard that as redundant. */ if ((enum regexpcode) *p != on_failure_jump && (enum regexpcode) *p != succeed_n) continue; p++; EXTRACT_NUMBER_AND_INCR (j, p); p += j; if (stackp != stackb && *stackp == p) stackp--; continue; case on_failure_jump: handle_on_failure_jump: EXTRACT_NUMBER_AND_INCR (j, p); *++stackp = p + j; if (is_a_succeed_n) EXTRACT_NUMBER_AND_INCR (k, p); /* Skip the n. */ continue; case succeed_n: is_a_succeed_n = 1; /* Get to the number of times to succeed. */ p += 2; /* Increment p past the n for when k != 0. */ EXTRACT_NUMBER_AND_INCR (k, p); if (k == 0) { p -= 4; goto handle_on_failure_jump; } continue; case set_number_at: p += 4; continue; case start_memory: case stop_memory: p++; continue; case duplicate: bufp->can_be_null = 1; fastmap['\n'] = 1; case anychar: for (j = 0; j < (1 << BYTEWIDTH); j++) if (j != '\n') fastmap[j] = 1; if (bufp->can_be_null) { FREE_AND_RETURN_VOID(stackb); } /* Don't return; check the alternative paths so we can set can_be_null if appropriate. */ break; case wordchar: for (j = 0; j < (1 << BYTEWIDTH); j++) if (SYNTAX (j) == Sword) fastmap[j] = 1; break; case notwordchar: for (j = 0; j < (1 << BYTEWIDTH); j++) if (SYNTAX (j) != Sword) fastmap[j] = 1; break; #ifdef emacs case syntaxspec: k = *p++; for (j = 0; j < (1 << BYTEWIDTH); j++) if (SYNTAX (j) == (enum syntaxcode) k) fastmap[j] = 1; break; case notsyntaxspec: k = *p++; for (j = 0; j < (1 << BYTEWIDTH); j++) if (SYNTAX (j) != (enum syntaxcode) k) fastmap[j] = 1; break; #else /* not emacs */ case syntaxspec: case notsyntaxspec: break; #endif /* not emacs */ case charset: /* NOTE: Charset for single-byte chars never contain multi-byte char. See set_list_bits(). */ for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--) if (p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH))) { #if 0 /* The original was: */ if (translate) fastmap[translate[j]] = 1; else fastmap[j] = 1; #else /* The compiled pattern has already been translated. */ fastmap[j] = 1; #endif } { unsigned short size; unsigned char c, end; p += p[-1] + 2; size = EXTRACT_UNSIGNED (&p[-2]); for (j = 0; j < size; j++) /* set bits for 1st bytes of multi-byte chars. */ for (c = (unsigned char) p[j*4], end = (unsigned char) p[j*4 + 2]; c <= end; c++) /* NOTE: Charset for multi-byte chars might contain single-byte chars. We must reject them. */ if (ismbchar (c)) fastmap[c] = 1; } break; case charset_not: /* S: set of all single-byte chars. M: set of all first bytes that can start multi-byte chars. s: any set of single-byte chars. m: any set of first bytes that can start multi-byte chars. We assume S+M = U. ___ _ _ s+m = (S*s+M*m). */ /* Chars beyond end of map must be allowed */ /* NOTE: Charset_not for single-byte chars might contain multi-byte chars. See set_list_bits(). */ for (j = *p * BYTEWIDTH; j < (1 << BYTEWIDTH); j++) if (!ismbchar (j)) fastmap[j] = 1; for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--) if (!(p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH)))) { if (!ismbchar (j)) fastmap[j] = 1; } { unsigned short size; unsigned char c, beg; p += p[-1] + 2; size = EXTRACT_UNSIGNED (&p[-2]); c = 0x8000; for (j = 0; j < size; j++) { for (beg = (unsigned char) p[j*4 + 0]; c < beg; c++) if (ismbchar (c)) fastmap[c] = 1; c = (unsigned char) p[j*4 + 2] + 1; } } break; case unused: /* pacify gcc -Wall */ break; } /* Get here means we have successfully found the possible starting characters of one path of the pattern. We need not follow this path any farther. Instead, look at the next alternative remembered in the stack. */ if (stackp != stackb) p = *stackp--; else break; } FREE_AND_RETURN_VOID(stackb); } /* Like re_search_2, below, but only one string is specified, and doesn't let you say where to stop matching. */ int re_search (pbufp, string, size, startpos, range, regs) struct re_pattern_buffer *pbufp; char *string; int size, startpos, range; struct re_registers *regs; { return re_search_2 (pbufp, (char *) 0, 0, string, size, startpos, range, regs, size); } /* Using the compiled pattern in PBUFP->buffer, first tries to match the virtual concatenation of STRING1 and STRING2, starting first at index STARTPOS, then at STARTPOS + 1, and so on. RANGE is the number of places to try before giving up. If RANGE is negative, it searches backwards, i.e., the starting positions tried are STARTPOS, STARTPOS - 1, etc. STRING1 and STRING2 are of SIZE1 and SIZE2, respectively. In REGS, return the indices of the virtual concatenation of STRING1 and STRING2 that matched the entire PBUFP->buffer and its contained subexpressions. Do not consider matching one past the index MSTOP in the virtual concatenation of STRING1 and STRING2. The value returned is the position in the strings at which the match was found, or -1 if no match was found, or -2 if error (such as failure stack overflow). */ int re_search_2 (pbufp, string1, size1, string2, size2, startpos, range, regs, mstop) struct re_pattern_buffer *pbufp; char *string1, *string2; int size1, size2; int startpos; register int range; struct re_registers *regs; int mstop; { register char *fastmap = pbufp->fastmap; register unsigned char *translate = (unsigned char *) pbufp->translate; int total_size = size1 + size2; int endpos = startpos + range; int val; /* Check for out-of-range starting position. */ if (startpos < 0 || startpos > total_size) return -1; /* Fix up range if it would eventually take startpos outside of the virtual concatenation of string1 and string2. */ if (endpos < -1) range = -1 - startpos; else if (endpos > total_size) range = total_size - startpos; /* Update the fastmap now if not correct already. */ if (fastmap && !pbufp->fastmap_accurate) re_compile_fastmap (pbufp); /* If the search isn't to be a backwards one, don't waste time in a long search for a pattern that says it is anchored. */ if (pbufp->used > 0 && (enum regexpcode) pbufp->buffer[0] == begbuf && range > 0) { if (startpos > 0) return -1; else range = 1; } while (1) { /* If a fastmap is supplied, skip quickly over characters that cannot possibly be the start of a match. Note, however, that if the pattern can possibly match the null string, we must test it at each starting point so that we take the first null string we get. */ if (fastmap && startpos < total_size && pbufp->can_be_null != 1) { if (range > 0) /* Searching forwards. */ { register int lim = 0; register unsigned char *p, c; int irange = range; if (startpos < size1 && startpos + range >= size1) lim = range - (size1 - startpos); p = ((unsigned char *) &(startpos >= size1 ? string2 - size1 : string1)[startpos]); while (range > lim) { c = *p++; if (ismbchar (c)) { if (fastmap[c]) break; p++; range--; } else if (fastmap[translate ? translate[c] : c]) break; range--; } startpos += irange - range; } else /* Searching backwards. */ { register unsigned char c; if (string1 == 0 || startpos >= size1) c = string2[startpos - size1]; else c = string1[startpos]; c &= 0xff; if (translate ? !fastmap[translate[c]] : !fastmap[c]) goto advance; } } if (range >= 0 && startpos == total_size && fastmap && pbufp->can_be_null == 0) return -1; val = re_match_2 (pbufp, string1, size1, string2, size2, startpos, regs, mstop); if (val >= 0) return startpos; if (val == -2) return -2; #ifndef NO_ALLOCA #ifdef C_ALLOCA alloca (0); #endif /* C_ALLOCA */ #endif /* NO_ALLOCA */ advance: if (!range) break; else if (range > 0) { const char *d = ((startpos >= size1 ? string2 - size1 : string1) + startpos); if (ismbchar (*d)) { range--, startpos++; if (!range) break; } range--, startpos++; } else { range++, startpos--; { const char *s, *d, *p; if (startpos < size1) s = string1, d = string1 + startpos; else s = string2, d = string2 + startpos - size1; for (p = d; p-- > s && ismbchar(*p); ) /* --p >= s would not work on 80[12]?86. (when the offset of s equals 0 other than huge model.) */ ; if (!((d - p) & 1)) { if (!range) break; range++, startpos--; } } } } return -1; } #ifndef emacs /* emacs never uses this. */ int re_match (pbufp, string, size, pos, regs) struct re_pattern_buffer *pbufp; char *string; int size, pos; struct re_registers *regs; { return re_match_2 (pbufp, (char *) 0, 0, string, size, pos, regs, size); } #endif /* not emacs */ /* The following are used for re_match_2, defined below: */ /* Roughly the maximum number of failure points on the stack. Would be exactly that if always pushed MAX_NUM_FAILURE_ITEMS each time we failed. */ int re_max_failures = 2000; /* Routine used by re_match_2. */ /* static int memcmp_translate (); *//* already declared */ /* Structure and accessing macros used in re_match_2: */ struct register_info { unsigned is_active : 1; unsigned matched_something : 1; }; #define IS_ACTIVE(R) ((R).is_active) #define MATCHED_SOMETHING(R) ((R).matched_something) /* Macros used by re_match_2: */ /* I.e., regstart, regend, and reg_info. */ #define NUM_REG_ITEMS 3 /* We push at most this many things on the stack whenever we fail. The `+ 2' refers to PATTERN_PLACE and STRING_PLACE, which are arguments to the PUSH_FAILURE_POINT macro. */ #define MAX_NUM_FAILURE_ITEMS (RE_NREGS * NUM_REG_ITEMS + 2) /* We push this many things on the stack whenever we fail. */ #define NUM_FAILURE_ITEMS (last_used_reg * NUM_REG_ITEMS + 2) /* This pushes most of the information about the current state we will want if we ever fail back to it. */ #define PUSH_FAILURE_POINT(pattern_place, string_place) \ { \ long last_used_reg, this_reg; \ \ /* Find out how many registers are active or have been matched. \ (Aside from register zero, which is only set at the end.) */ \ for (last_used_reg = RE_NREGS - 1; last_used_reg > 0; last_used_reg--)\ if (regstart[last_used_reg] != (unsigned char *)(-1L)) \ break; \ \ if (stacke - stackp < NUM_FAILURE_ITEMS) \ { \ unsigned char **stackx; \ unsigned int len = stacke - stackb; \ if (len > re_max_failures * MAX_NUM_FAILURE_ITEMS) \ { \ FREE_AND_RETURN(stackb,(-2)); \ } \ \ /* Roughly double the size of the stack. */ \ stackx = DOUBLE_STACK(stackx,stackb,len); \ /* Rearrange the pointers. */ \ stackp = stackx + (stackp - stackb); \ stackb = stackx; \ stacke = stackb + 2 * len; \ } \ \ /* Now push the info for each of those registers. */ \ for (this_reg = 1; this_reg <= last_used_reg; this_reg++) \ { \ *stackp++ = regstart[this_reg]; \ *stackp++ = regend[this_reg]; \ *stackp++ = (unsigned char *) ®_info[this_reg]; \ } \ \ /* Push how many registers we saved. */ \ *stackp++ = (unsigned char *) last_used_reg; \ \ *stackp++ = pattern_place; \ *stackp++ = string_place; \ } /* This pops what PUSH_FAILURE_POINT pushes. */ #define POP_FAILURE_POINT() \ { \ int temp; \ stackp -= 2; /* Remove failure points. */ \ temp = (int) *--stackp; /* How many regs pushed. */ \ temp *= NUM_REG_ITEMS; /* How much to take off the stack. */ \ stackp -= temp; /* Remove the register info. */ \ } #define MATCHING_IN_FIRST_STRING (dend == end_match_1) /* Is true if there is a first string and if PTR is pointing anywhere inside it or just past the end. */ #define IS_IN_FIRST_STRING(ptr) \ (size1 && string1 <= (ptr) && (ptr) <= string1 + size1) /* Call before fetching a character with *d. This switches over to string2 if necessary. */ #define PREFETCH \ while (d == dend) \ { \ /* end of string2 => fail. */ \ if (dend == end_match_2) \ goto fail; \ /* end of string1 => advance to string2. */ \ d = string2; \ dend = end_match_2; \ } /* Call this when have matched something; it sets `matched' flags for the registers corresponding to the subexpressions of which we currently are inside. */ #define SET_REGS_MATCHED \ { unsigned this_reg; \ for (this_reg = 0; this_reg < RE_NREGS; this_reg++) \ { \ if (IS_ACTIVE(reg_info[this_reg])) \ MATCHED_SOMETHING(reg_info[this_reg]) = 1; \ else \ MATCHED_SOMETHING(reg_info[this_reg]) = 0; \ } \ } /* Test if at very beginning or at very end of the virtual concatenation of string1 and string2. If there is only one string, we've put it in string2. */ #define AT_STRINGS_BEG (d == (size1 ? string1 : string2) || !size2) #define AT_STRINGS_END (d == end2) #define AT_WORD_BOUNDARY \ (AT_STRINGS_BEG || AT_STRINGS_END || IS_A_LETTER (d - 1) != IS_A_LETTER (d)) /* We have two special cases to check for: 1) if we're past the end of string1, we have to look at the first character in string2; 2) if we're before the beginning of string2, we have to look at the last character in string1; we assume there is a string1, so use this in conjunction with AT_STRINGS_BEG. */ #define IS_A_LETTER(d) \ (SYNTAX ((d) == end1 ? *string2 : (d) == string2 - 1 ? *(end1 - 1) : *(d))\ == Sword) /* Match the pattern described by PBUFP against the virtual concatenation of STRING1 and STRING2, which are of SIZE1 and SIZE2, respectively. Start the match at index POS in the virtual concatenation of STRING1 and STRING2. In REGS, return the indices of the virtual concatenation of STRING1 and STRING2 that matched the entire PBUFP->buffer and its contained subexpressions. Do not consider matching one past the index MSTOP in the virtual concatenation of STRING1 and STRING2. If pbufp->fastmap is nonzero, then it had better be up to date. The reason that the data to match are specified as two components which are to be regarded as concatenated is so this function can be used directly on the contents of an Emacs buffer. -1 is returned if there is no match. -2 is returned if there is an error (such as match stack overflow). Otherwise the value is the length of the substring which was matched. */ int re_match_2 (pbufp, string1_arg, size1, string2_arg, size2, pos, regs, mstop) struct re_pattern_buffer *pbufp; char *string1_arg, *string2_arg; int size1, size2; int pos; struct re_registers *regs; int mstop; { register unsigned char *p = (unsigned char *) pbufp->buffer; /* Pointer to beyond end of buffer. */ register unsigned char *pend = p + pbufp->used; unsigned char *string1 = (unsigned char *) string1_arg; unsigned char *string2 = (unsigned char *) string2_arg; unsigned char *end1; /* Just past end of first string. */ unsigned char *end2; /* Just past end of second string. */ /* Pointers into string1 and string2, just past the last characters in each to consider matching. */ unsigned char *end_match_1, *end_match_2; register unsigned char *d, *dend; register int mcnt; /* Multipurpose. */ unsigned char *translate = (unsigned char *) pbufp->translate; unsigned is_a_jump_n = 0; /* Failure point stack. Each place that can handle a failure further down the line pushes a failure point on this stack. It consists of restart, regend, and reg_info for all registers corresponding to the subexpressions we're currently inside, plus the number of such registers, and, finally, two char *'s. The first char * is where to resume scanning the pattern; the second one is where to resume scanning the strings. If the latter is zero, the failure point is a ``dummy''; if a failure happens and the failure point is a dummy, it gets discarded and the next next one is tried. */ #ifndef NO_ALLOCA unsigned char *initial_stack[MAX_NUM_FAILURE_ITEMS * NFAILURES]; #endif unsigned char **stackb; unsigned char **stackp; unsigned char **stacke; /* Information on the contents of registers. These are pointers into the input strings; they record just what was matched (on this attempt) by a subexpression part of the pattern, that is, the regnum-th regstart pointer points to where in the pattern we began matching and the regnum-th regend points to right after where we stopped matching the regnum-th subexpression. (The zeroth register keeps track of what the whole pattern matches.) */ unsigned char *regstart[RE_NREGS]; unsigned char *regend[RE_NREGS]; /* The is_active field of reg_info helps us keep track of which (possibly nested) subexpressions we are currently in. The matched_something field of reg_info[reg_num] helps us tell whether or not we have matched any of the pattern so far this time through the reg_num-th subexpression. These two fields get reset each time through any loop their register is in. */ struct register_info reg_info[RE_NREGS]; /* The following record the register info as found in the above variables when we find a match better than any we've seen before. This happens as we backtrack through the failure points, which in turn happens only if we have not yet matched the entire string. */ unsigned best_regs_set = 0; unsigned char *best_regstart[RE_NREGS]; unsigned char *best_regend[RE_NREGS]; /* Initialize the stack. */ #ifdef NO_ALLOCA stackb = (unsigned char **) xmalloc (MAX_NUM_FAILURE_ITEMS * NFAILURES * sizeof (char *)); #else stackb = initial_stack; #endif stackp = stackb; stacke = &stackb[MAX_NUM_FAILURE_ITEMS * NFAILURES]; #ifdef DEBUG_REGEX fprintf (stderr, "Entering re_match_2(%s%s)\n", string1_arg, string2_arg); #endif /* Initialize subexpression text positions to -1 to mark ones that no \( or ( and \) or ) has been seen for. Also set all registers to inactive and mark them as not having matched anything or ever failed. */ for (mcnt = 0; mcnt < RE_NREGS; mcnt++) { regstart[mcnt] = regend[mcnt] = (unsigned char *) (-1L); IS_ACTIVE (reg_info[mcnt]) = 0; MATCHED_SOMETHING (reg_info[mcnt]) = 0; } if (regs) for (mcnt = 0; mcnt < RE_NREGS; mcnt++) regs->start[mcnt] = regs->end[mcnt] = -1; /* Set up pointers to ends of strings. Don't allow the second string to be empty unless both are empty. */ if (size2 == 0) { string2 = string1; size2 = size1; string1 = 0; size1 = 0; } end1 = string1 + size1; end2 = string2 + size2; /* Compute where to stop matching, within the two strings. */ if (mstop <= size1) { end_match_1 = string1 + mstop; end_match_2 = string2; } else { end_match_1 = end1; end_match_2 = string2 + mstop - size1; } /* `p' scans through the pattern as `d' scans through the data. `dend' is the end of the input string that `d' points within. `d' is advanced into the following input string whenever necessary, but this happens before fetching; therefore, at the beginning of the loop, `d' can be pointing at the end of a string, but it cannot equal string2. */ if (size1 != 0 && pos <= size1) d = string1 + pos, dend = end_match_1; else d = string2 + pos - size1, dend = end_match_2; /* This loops over pattern commands. It exits by returning from the function if match is complete, or it drops through if match fails at this starting point in the input data. */ while (1) { #ifdef DEBUG_REGEX fprintf (stderr, "regex loop(%d): matching 0x%02d\n", p - (unsigned char *) pbufp->buffer, *p); #endif is_a_jump_n = 0; /* End of pattern means we might have succeeded. */ if (p == pend) { /* If not end of string, try backtracking. Otherwise done. */ if (d != end_match_2) { if (stackp != stackb) { /* More failure points to try. */ unsigned in_same_string = IS_IN_FIRST_STRING (best_regend[0]) == MATCHING_IN_FIRST_STRING; /* If exceeds best match so far, save it. */ if (! best_regs_set || (in_same_string && d > best_regend[0]) || (! in_same_string && ! MATCHING_IN_FIRST_STRING)) { best_regs_set = 1; best_regend[0] = d; /* Never use regstart[0]. */ for (mcnt = 1; mcnt < RE_NREGS; mcnt++) { best_regstart[mcnt] = regstart[mcnt]; best_regend[mcnt] = regend[mcnt]; } } goto fail; } /* If no failure points, don't restore garbage. */ else if (best_regs_set) { restore_best_regs: /* Restore best match. */ d = best_regend[0]; for (mcnt = 0; mcnt < RE_NREGS; mcnt++) { regstart[mcnt] = best_regstart[mcnt]; regend[mcnt] = best_regend[mcnt]; } } } /* If caller wants register contents data back, convert it to indices. */ if (regs) { regs->start[0] = pos; if (MATCHING_IN_FIRST_STRING) regs->end[0] = d - string1; else regs->end[0] = d - string2 + size1; for (mcnt = 1; mcnt < RE_NREGS; mcnt++) { if (regend[mcnt] == (unsigned char *)(-1L)) { regs->start[mcnt] = -1; regs->end[mcnt] = -1; continue; } if (IS_IN_FIRST_STRING (regstart[mcnt])) regs->start[mcnt] = regstart[mcnt] - string1; else regs->start[mcnt] = regstart[mcnt] - string2 + size1; if (IS_IN_FIRST_STRING (regend[mcnt])) regs->end[mcnt] = regend[mcnt] - string1; else regs->end[mcnt] = regend[mcnt] - string2 + size1; } } FREE_AND_RETURN(stackb, (d - pos - (MATCHING_IN_FIRST_STRING ? string1 : string2 - size1))); } /* Otherwise match next pattern command. */ #ifdef SWITCH_ENUM_BUG switch ((int) ((enum regexpcode) *p++)) #else switch ((enum regexpcode) *p++) #endif { /* \( [or `(', as appropriate] is represented by start_memory, \) by stop_memory. Both of those commands are followed by a register number in the next byte. The text matched within the \( and \) is recorded under that number. */ case start_memory: regstart[*p] = d; IS_ACTIVE (reg_info[*p]) = 1; MATCHED_SOMETHING (reg_info[*p]) = 0; p++; break; case stop_memory: regend[*p] = d; IS_ACTIVE (reg_info[*p]) = 0; /* If just failed to match something this time around with a sub- expression that's in a loop, try to force exit from the loop. */ if ((! MATCHED_SOMETHING (reg_info[*p]) || (enum regexpcode) p[-3] == start_memory) && (p + 1) != pend) { register unsigned char *p2 = p + 1; mcnt = 0; switch (*p2++) { case jump_n: is_a_jump_n = 1; case finalize_jump: case maybe_finalize_jump: case jump: case dummy_failure_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p2); if (is_a_jump_n) p2 += 2; break; } p2 += mcnt; /* If the next operation is a jump backwards in the pattern to an on_failure_jump, exit from the loop by forcing a failure after pushing on the stack the on_failure_jump's jump in the pattern, and d. */ if (mcnt < 0 && (enum regexpcode) *p2++ == on_failure_jump) { EXTRACT_NUMBER_AND_INCR (mcnt, p2); PUSH_FAILURE_POINT (p2 + mcnt, d); goto fail; } } p++; break; /* \ has been turned into a `duplicate' command which is followed by the numeric value of as the register number. */ case duplicate: { int regno = *p++; /* Get which register to match against */ register unsigned char *d2, *dend2; /* Where in input to try to start matching. */ d2 = regstart[regno]; /* Where to stop matching; if both the place to start and the place to stop matching are in the same string, then set to the place to stop, otherwise, for now have to use the end of the first string. */ dend2 = ((IS_IN_FIRST_STRING (regstart[regno]) == IS_IN_FIRST_STRING (regend[regno])) ? regend[regno] : end_match_1); while (1) { /* If necessary, advance to next segment in register contents. */ while (d2 == dend2) { if (dend2 == end_match_2) break; if (dend2 == regend[regno]) break; d2 = string2, dend2 = regend[regno]; /* end of string1 => advance to string2. */ } /* At end of register contents => success */ if (d2 == dend2) break; /* If necessary, advance to next segment in data. */ PREFETCH; /* How many characters left in this segment to match. */ mcnt = dend - d; /* Want how many consecutive characters we can match in one shot, so, if necessary, adjust the count. */ if (mcnt > dend2 - d2) mcnt = dend2 - d2; /* Compare that many; failure if mismatch, else move past them. */ if (translate ? memcmp_translate (d, d2, mcnt, translate) : memcmp ((char *)d, (char *)d2, mcnt)) goto fail; d += mcnt, d2 += mcnt; } } break; case anychar: PREFETCH; /* Fetch a data character. */ /* Match anything but a newline, maybe even a null. */ if (ismbchar (*d)) { if (d + 1 == dend || d[1] == '\n' || d[1] == '\0') goto fail; SET_REGS_MATCHED; d += 2; break; } if ((translate ? translate[*d] : *d) == '\n' || ((obscure_syntax & RE_DOT_NOT_NULL) && (translate ? translate[*d] : *d) == '\000')) goto fail; SET_REGS_MATCHED; d++; break; case charset: case charset_not: { int not; /* Nonzero for charset_not. */ register int c; if (*(p - 1) == (unsigned char) charset_not) not = 1; PREFETCH; /* Fetch a data character. */ c = (unsigned char) *d; if (ismbchar (c)) { c <<= 8; if (d + 1 != dend) c |= (unsigned char) d[1]; } else if (translate) c = (unsigned char) translate[c]; not = is_in_list (c, p); p += 1 + *p + 2 + EXTRACT_UNSIGNED (&p[1 + *p])*4; if (!not) goto fail; SET_REGS_MATCHED; d++; if (d != dend && c >= 1 << BYTEWIDTH) d++; break; } case begline: if ((size1 != 0 && d == string1) || (size1 == 0 && size2 != 0 && d == string2) || (d && d[-1] == '\n') || (size1 == 0 && size2 == 0)) break; else goto fail; case endline: if (d == end2 || (d == end1 ? (size2 == 0 || *string2 == '\n') : *d == '\n')) break; goto fail; /* `or' constructs are handled by starting each alternative with an on_failure_jump that points to the start of the next alternative. Each alternative except the last ends with a jump to the joining point. (Actually, each jump except for the last one really jumps to the following jump, because tensioning the jumps is a hassle.) */ /* The start of a stupid repeat has an on_failure_jump that points past the end of the repeat text. This makes a failure point so that on failure to match a repetition, matching restarts past as many repetitions have been found with no way to fail and look for another one. */ /* A smart repeat is similar but loops back to the on_failure_jump so that each repetition makes another failure point. */ case on_failure_jump: on_failure: EXTRACT_NUMBER_AND_INCR (mcnt, p); PUSH_FAILURE_POINT (p + mcnt, d); break; /* The end of a smart repeat has a maybe_finalize_jump back. Change it either to a finalize_jump or an ordinary jump. */ case maybe_finalize_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); { register unsigned char *p2 = p; /* Compare what follows with the beginning of the repeat. If we can establish that there is nothing that they would both match, we can change to finalize_jump. */ while (p2 + 1 != pend && (*p2 == (unsigned char) stop_memory || *p2 == (unsigned char) start_memory)) p2 += 2; /* Skip over reg number. */ if (p2 == pend) p[-3] = (unsigned char) finalize_jump; else if (*p2 == (unsigned char) exactn || *p2 == (unsigned char) endline) { register int c = *p2 == (unsigned char) endline ? '\n' : p2[2]; register unsigned char *p1 = p + mcnt; /* p1[0] ... p1[2] are an on_failure_jump. Examine what follows that. */ if (p1[3] == (unsigned char) exactn && p1[5] != c) p[-3] = (unsigned char) finalize_jump; else if (p1[3] == (unsigned char) charset || p1[3] == (unsigned char) charset_not) { if (ismbchar (c)) c = c << 8 | p2[3]; /* `is_in_list()' is TRUE if c would match */ /* That means it is not safe to finalize. */ if (!is_in_list (c, p1 + 4)) p[-3] = (unsigned char) finalize_jump; } } } p -= 2; /* Point at relative address again. */ if (p[-1] != (unsigned char) finalize_jump) { p[-1] = (unsigned char) jump; goto nofinalize; } /* Note fall through. */ /* The end of a stupid repeat has a finalize_jump back to the start, where another failure point will be made which will point to after all the repetitions found so far. */ /* Take off failure points put on by matching on_failure_jump because didn't fail. Also remove the register information put on by the on_failure_jump. */ case finalize_jump: POP_FAILURE_POINT (); /* Note fall through. */ /* Jump without taking off any failure points. */ case jump: nofinalize: EXTRACT_NUMBER_AND_INCR (mcnt, p); p += mcnt; break; case dummy_failure_jump: /* Normally, the on_failure_jump pushes a failure point, which then gets popped at finalize_jump. We will end up at finalize_jump, also, and with a pattern of, say, `a+', we are skipping over the on_failure_jump, so we have to push something meaningless for finalize_jump to pop. */ PUSH_FAILURE_POINT (0, 0); goto nofinalize; /* Have to succeed matching what follows at least n times. Then just handle like an on_failure_jump. */ case succeed_n: EXTRACT_NUMBER (mcnt, p + 2); /* Originally, this is how many times we HAVE to succeed. */ if (mcnt) { mcnt--; p += 2; STORE_NUMBER_AND_INCR (p, mcnt); } else if (mcnt == 0) { p[2] = unused; p[3] = unused; goto on_failure; } else { fprintf (stderr, "regex: the succeed_n's n is not set.\n"); exit (1); } break; case jump_n: EXTRACT_NUMBER (mcnt, p + 2); /* Originally, this is how many times we CAN jump. */ if (mcnt) { mcnt--; STORE_NUMBER(p + 2, mcnt); goto nofinalize; /* Do the jump without taking off any failure points. */ } /* If don't have to jump any more, skip over the rest of command. */ else p += 4; break; case set_number_at: { register unsigned char *p1; EXTRACT_NUMBER_AND_INCR (mcnt, p); p1 = p + mcnt; EXTRACT_NUMBER_AND_INCR (mcnt, p); STORE_NUMBER (p1, mcnt); break; } /* Ignore these. Used to ignore the n of succeed_n's which currently have n == 0. */ case unused: break; case wordbound: if (AT_WORD_BOUNDARY) break; goto fail; case notwordbound: if (AT_WORD_BOUNDARY) goto fail; break; case wordbeg: if (IS_A_LETTER (d) && (AT_STRINGS_BEG || !IS_A_LETTER (d - 1))) break; goto fail; case wordend: /* Have to check if AT_STRINGS_BEG before looking at d - 1. */ if (!AT_STRINGS_BEG && IS_A_LETTER (d - 1) && (!IS_A_LETTER (d) || AT_STRINGS_END)) break; goto fail; #ifdef emacs case before_dot: if (PTR_CHAR_POS (d) >= point) goto fail; break; case at_dot: if (PTR_CHAR_POS (d) != point) goto fail; break; case after_dot: if (PTR_CHAR_POS (d) <= point) goto fail; break; case wordchar: mcnt = (int) Sword; goto matchsyntax; case syntaxspec: mcnt = *p++; matchsyntax: PREFETCH; if (SYNTAX (*d++) != (enum syntaxcode) mcnt) goto fail; SET_REGS_MATCHED; break; case notwordchar: mcnt = (int) Sword; goto matchnotsyntax; case notsyntaxspec: mcnt = *p++; matchnotsyntax: PREFETCH; if (SYNTAX (*d++) == (enum syntaxcode) mcnt) goto fail; SET_REGS_MATCHED; break; #else /* not emacs */ case wordchar: PREFETCH; if (!IS_A_LETTER (d)) goto fail; d++; SET_REGS_MATCHED; break; case notwordchar: PREFETCH; if (IS_A_LETTER (d)) goto fail; d++; SET_REGS_MATCHED; break; case before_dot: case at_dot: case after_dot: case syntaxspec: case notsyntaxspec: break; #endif /* not emacs */ case begbuf: if (AT_STRINGS_BEG) break; goto fail; case endbuf: if (AT_STRINGS_END) break; goto fail; case exactn: /* Match the next few pattern characters exactly. mcnt is how many characters to match. */ mcnt = *p++; /* This is written out as an if-else so we don't waste time testing `translate' inside the loop. */ if (translate) { do { unsigned char c; PREFETCH; c = *d++; if (ismbchar (c)) { if (c != (unsigned char) *p++ || !--mcnt /* パターンが正しくコンパイルさ れている限り, このチェックは 冗長だが念のため. */ || d == dend || (unsigned char) *d++ != (unsigned char) *p++) goto fail; continue; } if ((unsigned char) translate[c] != (unsigned char) *p++) goto fail; } while (--mcnt); } else { do { #if 0 /* this code suppose that multi-byte chars are not splited in string1 and string2. If you want to check this with speed cost, change `#if 0' here and next to `#if 1'. */ unsigned char c; #endif PREFETCH; #if 0 c = *d++; if (ismbchar (c)) { if (c != (unsigned char) *p++ || !--mcnt || d == dend) goto fail; c = *d++; } if (c != (unsigned char) *p++) goto fail; #else if (*d++ != *p++) goto fail; #endif } while (--mcnt); } SET_REGS_MATCHED; break; } continue; /* Successfully executed one pattern command; keep going. */ /* Jump here if any matching operation fails. */ fail: if (stackp != stackb) /* A restart point is known. Restart there and pop it. */ { short last_used_reg, this_reg; /* If this failure point is from a dummy_failure_point, just skip it. */ if (!stackp[-2]) { POP_FAILURE_POINT (); goto fail; } d = *--stackp; p = *--stackp; if (d >= string1 && d <= end1) dend = end_match_1; /* Restore register info. */ last_used_reg = (long) *--stackp; /* Make the ones that weren't saved -1 or 0 again. */ for (this_reg = RE_NREGS - 1; this_reg > last_used_reg; this_reg--) { regend[this_reg] = (unsigned char *) (-1L); regstart[this_reg] = (unsigned char *) (-1L); IS_ACTIVE (reg_info[this_reg]) = 0; MATCHED_SOMETHING (reg_info[this_reg]) = 0; } /* And restore the rest from the stack. */ for ( ; this_reg > 0; this_reg--) { reg_info[this_reg] = *(struct register_info *) *--stackp; regend[this_reg] = *--stackp; regstart[this_reg] = *--stackp; } } else break; /* Matching at this starting point really fails. */ } if (best_regs_set) goto restore_best_regs; FREE_AND_RETURN(stackb,(-1)); /* Failure to match. */ } static int memcmp_translate (s1, s2, len, translate) unsigned char *s1, *s2; register int len; unsigned char *translate; { register unsigned char *p1 = s1, *p2 = s2, c; while (len) { c = *p1++; if (ismbchar (c)) { if (c != *p2++ || !--len || *p1++ != *p2++) return 1; } else if (translate[c] != translate[*p2++]) return 1; len--; } return 0; } /* Entry points compatible with 4.2 BSD regex library. */ #if !defined(emacs) && !defined(GAWK) && !defined(RUBY) static struct re_pattern_buffer re_comp_buf; char * re_comp (s) char *s; { if (!s) { if (!re_comp_buf.buffer) return "No previous regular expression"; return 0; } if (!re_comp_buf.buffer) { if (!(re_comp_buf.buffer = (char *) xmalloc (200))) return "Memory exhausted"; re_comp_buf.allocated = 200; if (!(re_comp_buf.fastmap = (char *) xmalloc (1 << BYTEWIDTH))) return "Memory exhausted"; } return re_compile_pattern (s, strlen (s), &re_comp_buf); } int re_exec (s) char *s; { int len = strlen (s); return 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0); } #endif /* not emacs && not GAWK && not RUBY */ #ifdef test #ifdef atarist long _stksize = 2L; /* reserve memory for stack */ #endif #include /* Indexed by a character, gives the upper case equivalent of the character. */ char upcase[0400] = { 000, 001, 002, 003, 004, 005, 006, 007, 010, 011, 012, 013, 014, 015, 016, 017, 020, 021, 022, 023, 024, 025, 026, 027, 030, 031, 032, 033, 034, 035, 036, 037, 040, 041, 042, 043, 044, 045, 046, 047, 050, 051, 052, 053, 054, 055, 056, 057, 060, 061, 062, 063, 064, 065, 066, 067, 070, 071, 072, 073, 074, 075, 076, 077, 0100, 0101, 0102, 0103, 0104, 0105, 0106, 0107, 0110, 0111, 0112, 0113, 0114, 0115, 0116, 0117, 0120, 0121, 0122, 0123, 0124, 0125, 0126, 0127, 0130, 0131, 0132, 0133, 0134, 0135, 0136, 0137, 0140, 0101, 0102, 0103, 0104, 0105, 0106, 0107, 0110, 0111, 0112, 0113, 0114, 0115, 0116, 0117, 0120, 0121, 0122, 0123, 0124, 0125, 0126, 0127, 0130, 0131, 0132, 0173, 0174, 0175, 0176, 0177, 0200, 0201, 0202, 0203, 0204, 0205, 0206, 0207, 0210, 0211, 0212, 0213, 0214, 0215, 0216, 0217, 0220, 0221, 0222, 0223, 0224, 0225, 0226, 0227, 0230, 0231, 0232, 0233, 0234, 0235, 0236, 0237, 0240, 0241, 0242, 0243, 0244, 0245, 0246, 0247, 0250, 0251, 0252, 0253, 0254, 0255, 0256, 0257, 0260, 0261, 0262, 0263, 0264, 0265, 0266, 0267, 0270, 0271, 0272, 0273, 0274, 0275, 0276, 0277, 0300, 0301, 0302, 0303, 0304, 0305, 0306, 0307, 0310, 0311, 0312, 0313, 0314, 0315, 0316, 0317, 0320, 0321, 0322, 0323, 0324, 0325, 0326, 0327, 0330, 0331, 0332, 0333, 0334, 0335, 0336, 0337, 0340, 0341, 0342, 0343, 0344, 0345, 0346, 0347, 0350, 0351, 0352, 0353, 0354, 0355, 0356, 0357, 0360, 0361, 0362, 0363, 0364, 0365, 0366, 0367, 0370, 0371, 0372, 0373, 0374, 0375, 0376, 0377 }; #ifdef canned #include "tests.h" typedef enum { extended_test, basic_test } test_type; /* Use this to run the tests we've thought of. */ void main () { test_type t = extended_test; if (t == basic_test) { printf ("Running basic tests:\n\n"); test_posix_basic (); } else if (t == extended_test) { printf ("Running extended tests:\n\n"); test_posix_extended (); } } #else /* not canned */ /* Use this to run interactive tests. */ int main (argc, argv) int argc; char **argv; { char pat[80]; struct re_pattern_buffer buf; int i; char c; char fastmap[(1 << BYTEWIDTH)]; /* Allow a command argument to specify the style of syntax. */ if (argc > 1) obscure_syntax = atol (argv[1]); buf.allocated = 40; buf.buffer = (char *) xmalloc (buf.allocated); buf.fastmap = fastmap; buf.translate = upcase; while (1) { gets (pat); if (*pat) { re_compile_pattern (pat, strlen(pat), &buf); for (i = 0; i < buf.used; i++) printchar (buf.buffer[i]); putchar ('\n'); printf ("%d allocated, %d used.\n", buf.allocated, buf.used); re_compile_fastmap (&buf); printf ("Allowed by fastmap: "); for (i = 0; i < (1 << BYTEWIDTH); i++) if (fastmap[i]) printchar (i); putchar ('\n'); } gets (pat); /* Now read the string to match against */ i = re_match (&buf, pat, strlen (pat), 0, 0); printf ("Match value %d.\n", i); } } #endif #ifdef NOTDEF print_buf (bufp) struct re_pattern_buffer *bufp; { int i; printf ("buf is :\n----------------\n"); for (i = 0; i < bufp->used; i++) printchar (bufp->buffer[i]); printf ("\n%d allocated, %d used.\n", bufp->allocated, bufp->used); printf ("Allowed by fastmap: "); for (i = 0; i < (1 << BYTEWIDTH); i++) if (bufp->fastmap[i]) printchar (i); printf ("\nAllowed by translate: "); if (bufp->translate) for (i = 0; i < (1 << BYTEWIDTH); i++) if (bufp->translate[i]) printchar (i); printf ("\nfastmap is%s accurate\n", bufp->fastmap_accurate ? "" : "n't"); printf ("can %s be null\n----------", bufp->can_be_null ? "" : "not"); } #endif /* NOTDEF */ printchar (c) char c; { if (c < 040 || c >= 0177) { putchar ('\\'); putchar (((c >> 6) & 3) + '0'); putchar (((c >> 3) & 7) + '0'); putchar ((c & 7) + '0'); } else putchar (c); } error (string) char *string; { puts (string); exit (1); } #endif /* test */ ./ruby-0.64/regex.h100644 150 1 23770 5674170244 12504 0ustar matzdaemon/* Definitions for data structures callers pass the regex library. Copyright (C) 1985, 1989-90 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Multi-byte extension added May, 1993 by t^2 (Takahiro Tanimoto) Last change: May 21, 1993 by t^2 */ #ifndef __REGEXP_LIBRARY #define __REGEXP_LIBRARY /* Define number of parens for which we record the beginnings and ends. This affects how much space the `struct re_registers' type takes up. */ #ifndef RE_NREGS #define RE_NREGS 10 #endif #define BYTEWIDTH 8 /* Maximum number of duplicates an interval can allow. */ #ifndef RE_DUP_MAX #define RE_DUP_MAX ((1 << 15) - 1) #endif /* This defines the various regexp syntaxes. */ extern long obscure_syntax; /* The following bits are used in the obscure_syntax variable to choose among alternative regexp syntaxes. */ /* If this bit is set, plain parentheses serve as grouping, and backslash parentheses are needed for literal searching. If not set, backslash-parentheses are grouping, and plain parentheses are for literal searching. */ #define RE_NO_BK_PARENS 1L /* If this bit is set, plain | serves as the `or'-operator, and \| is a literal. If not set, \| serves as the `or'-operator, and | is a literal. */ #define RE_NO_BK_VBAR (1L << 1) /* If this bit is not set, plain + or ? serves as an operator, and \+, \? are literals. If set, \+, \? are operators and plain +, ? are literals. */ #define RE_BK_PLUS_QM (1L << 2) /* If this bit is set, | binds tighter than ^ or $. If not set, the contrary. */ #define RE_TIGHT_VBAR (1L << 3) /* If this bit is set, then treat newline as an OR operator. If not set, treat it as a normal character. */ #define RE_NEWLINE_OR (1L << 4) /* If this bit is set, then special characters may act as normal characters in some contexts. Specifically, this applies to: ^ -- only special at the beginning, or after ( or |; $ -- only special at the end, or before ) or |; *, +, ? -- only special when not after the beginning, (, or |. If this bit is not set, special characters (such as *, ^, and $) always have their special meaning regardless of the surrounding context. */ #define RE_CONTEXT_INDEP_OPS (1L << 5) /* If this bit is not set, then \ before anything inside [ and ] is taken as a real \. If set, then such a \ escapes the following character. This is a special case for awk. */ #define RE_AWK_CLASS_HACK (1L << 6) /* If this bit is set, then \{ and \} or { and } serve as interval operators. If not set, then \{ and \} and { and } are treated as literals. */ #define RE_INTERVALS (1L << 7) /* If this bit is not set, then \{ and \} serve as interval operators and { and } are literals. If set, then { and } serve as interval operators and \{ and \} are literals. */ #define RE_NO_BK_CURLY_BRACES (1L << 8) /* If this bit is set, then character classes are supported; they are: [:alpha:], [:upper:], [:lower:], [:digit:], [:alnum:], [:xdigit:], [:space:], [:print:], [:punct:], [:graph:], and [:cntrl:]. If not set, then character classes are not supported. */ #define RE_CHAR_CLASSES (1L << 9) /* If this bit is set, then the dot re doesn't match a null byte. If not set, it does. */ #define RE_DOT_NOT_NULL (1L << 10) /* If this bit is set, then [^...] doesn't match a newline. If not set, it does. */ #define RE_HAT_NOT_NEWLINE (1L << 11) /* If this bit is set, back references are recognized. If not set, they aren't. */ #define RE_NO_BK_REFS (1L << 12) /* If this bit is set, back references must refer to a preceding subexpression. If not set, a back reference to a nonexistent subexpression is treated as literal characters. */ #define RE_NO_EMPTY_BK_REF (1L << 13) /* If this bit is set, bracket expressions can't be empty. If it is set, they can be empty. */ #define RE_NO_EMPTY_BRACKETS (1L << 14) /* If this bit is set, then *, +, ? and { cannot be first in an re or immediately after a |, or a (. Furthermore, a | cannot be first or last in an re, or immediately follow another | or a (. Also, a ^ cannot appear in a nonleading position and a $ cannot appear in a nontrailing position (outside of bracket expressions, that is). */ #define RE_CONTEXTUAL_INVALID_OPS (1L << 15) /* If this bit is set, then +, ? and | aren't recognized as operators. If it's not, they are. */ #define RE_LIMITED_OPS (1L << 16) /* If this bit is set, then an ending range point has to collate higher or equal to the starting range point. If it's not set, then when the ending range point collates higher than the starting range point, the range is just considered empty. */ #define RE_NO_EMPTY_RANGES (1L << 17) /* If this bit is set, then a hyphen (-) can't be an ending range point. If it isn't, then it can. */ #define RE_NO_HYPHEN_RANGE_END (1L << 18) /* Define combinations of bits for the standard possibilities. */ #define RE_SYNTAX_POSIX_AWK (RE_NO_BK_PARENS | RE_NO_BK_VBAR \ | RE_CONTEXT_INDEP_OPS) #define RE_SYNTAX_AWK (RE_NO_BK_PARENS | RE_NO_BK_VBAR | RE_AWK_CLASS_HACK) #define RE_SYNTAX_EGREP (RE_NO_BK_PARENS | RE_NO_BK_VBAR \ | RE_CONTEXT_INDEP_OPS | RE_NEWLINE_OR) #define RE_SYNTAX_GREP (RE_BK_PLUS_QM | RE_NEWLINE_OR) #define RE_SYNTAX_EMACS 0 #define RE_SYNTAX_POSIX_BASIC (RE_INTERVALS | RE_BK_PLUS_QM \ | RE_CHAR_CLASSES | RE_DOT_NOT_NULL \ | RE_HAT_NOT_NEWLINE | RE_NO_EMPTY_BK_REF \ | RE_NO_EMPTY_BRACKETS | RE_LIMITED_OPS \ | RE_NO_EMPTY_RANGES | RE_NO_HYPHEN_RANGE_END) #define RE_SYNTAX_POSIX_EXTENDED (RE_INTERVALS | RE_NO_BK_CURLY_BRACES \ | RE_NO_BK_VBAR | RE_NO_BK_PARENS \ | RE_HAT_NOT_NEWLINE | RE_CHAR_CLASSES \ | RE_NO_EMPTY_BRACKETS | RE_CONTEXTUAL_INVALID_OPS \ | RE_NO_BK_REFS | RE_NO_EMPTY_RANGES \ | RE_NO_HYPHEN_RANGE_END) /* For multi-byte char support */ #define RE_MBCTYPE_EUC (1L << 19) #define RE_MBCTYPE_SJIS (1L << 20) #define RE_MBCTYPE_MASK (RE_MBCTYPE_EUC | RE_MBCTYPE_SJIS) #undef ismbchar #define ismbchar(c) \ (obscure_syntax & RE_MBCTYPE_EUC \ ? ((unsigned char) (c) >= 0x80) \ : (obscure_syntax & RE_MBCTYPE_SJIS \ ? (( 0x80 <= (unsigned char) (c) \ && (unsigned char) (c) <= 0x9f) \ || (0xe0 <= (unsigned char) (c))) \ : 0)) /* This data structure is used to represent a compiled pattern. */ struct re_pattern_buffer { char *buffer; /* Space holding the compiled pattern commands. */ long allocated; /* Size of space that `buffer' points to. */ long used; /* Length of portion of buffer actually occupied */ char *fastmap; /* Pointer to fastmap, if any, or zero if none. */ /* re_search uses the fastmap, if there is one, to skip over totally implausible characters. */ char *translate; /* Translate table to apply to all characters before comparing, or zero for no translation. The translation is applied to a pattern when it is compiled and to data when it is matched. */ char fastmap_accurate; /* Set to zero when a new pattern is stored, set to one when the fastmap is updated from it. */ char can_be_null; /* Set to one by compiling fastmap if this pattern might match the null string. It does not necessarily match the null string in that case, but if this is zero, it cannot. 2 as value means can match null string but at end of range or before a character listed in the fastmap. */ }; /* search.c (search_buffer) needs this one value. It is defined both in regex.c and here. */ #define RE_EXACTN_VALUE 1 /* Structure to store register contents data in. Pass the address of such a structure as an argument to re_match, etc., if you want this information back. For i from 1 to RE_NREGS - 1, start[i] records the starting index in the string of where the ith subexpression matched, and end[i] records one after the ending index. start[0] and end[0] are analogous, for the entire pattern. */ struct re_registers { int start[RE_NREGS]; int end[RE_NREGS]; }; #ifdef __STDC__ extern char *re_compile_pattern (char *, size_t, struct re_pattern_buffer *); /* Is this really advertised? */ extern void re_compile_fastmap (struct re_pattern_buffer *); extern int re_search (struct re_pattern_buffer *, char*, int, int, int, struct re_registers *); extern int re_search_2 (struct re_pattern_buffer *, char *, int, char *, int, int, int, struct re_registers *, int); extern int re_match (struct re_pattern_buffer *, char *, int, int, struct re_registers *); extern int re_match_2 (struct re_pattern_buffer *, char *, int, char *, int, int, struct re_registers *, int); extern long re_set_syntax (long syntax); #ifndef RUBY /* 4.2 bsd compatibility. */ extern char *re_comp (char *); extern int re_exec (char *); #endif #else /* !__STDC__ */ extern char *re_compile_pattern (); /* Is this really advertised? */ extern void re_compile_fastmap (); extern int re_search (), re_search_2 (); extern int re_match (), re_match_2 (); extern long re_set_syntax(); #ifndef RUBY /* 4.2 bsd compatibility. */ extern char *re_comp (); extern int re_exec (); #endif #endif /* __STDC__ */ #ifdef SYNTAX_TABLE extern char *re_syntax_table; #endif #endif /* !__REGEXP_LIBRARY */ ./ruby-0.64/ruby.1100644 150 1 13401 5674170244 12252 0ustar matzdaemon.\"ruby.1 - -*- Nroff -*- .\" $Author: matz $ .\" $Date: 1994/11/22 01:22:40 $ .\" created at: Tue Apr 12 01:45:04 JST 1994 .TH RUBY 1 "\*(RP" .UC .SH NAME ruby \- オブジェクト指向スクリプト言語 .SH SYNOPSIS .B ruby [ .B options ] filename args .SH DESCRIPTION .B Ruby は, 手軽なオブジェクト指向プログラミングを実現するための種々 の機能を持つオブジェクト指向スクリプト言語である．その設計の 基本原則は, 以下の通りである. .IP 機能性 オブジェクト指向プログラミングとスクリプトプログラミングのた めに必要な機能を十分に備える. 特にテキスト処理関係の機能を豊 富に持つ。また, 純粋なオブジェクト指向言語でありながら, 必要 であれば手続き型プログラミングも可能である. .IP 拡張性 必要に応じて容易に機能を拡張できる. クラスを自由に追加できる ことは勿論, Cプログラムのリンクによってインタプリタにあらゆ る機能を追加できる. さらにプラットフォームによっては, 動的に オブジェクトコードをリンクする機能も提供する. .IP 一貫性 少数の原則が全体に適用されるような一貫性のある言語仕様を持つ. これによって「パズルの楽しさ」は減少したかも知れない. ただし, 一貫性のため使いやすさを犠牲にすることはない. .PP .B Ruby はshやperlを知っている人にとっての常識にできる限り従ったので, それらの言語に精通している人にとっては習得が(多分)容易だろう. .SH OPTIONS .B ruby インタプリタは以下の引数を受け付ける. .TP 5 .B \-a `\-n'や`\-p'とともに用いて, オートスプリットモードをONにする. オートスプリットモードでは各ループの先頭で, .nf .ne 2 $F = $_.split .fi が実行される. `\-n'か`\-p'オプションが同時に指定されない限り, このオプションは意味を持たない. .TP 5 .B \-c スクリプトの内部形式へのコンパイルのみを行い, 実行しない. コ ンパイル終了後, 文法エラーが無ければ, "Syntax OK"と出力する. .TP 5 .B \-C " code" .B ruby の処理する漢字コードを指定する. .B ruby は指定した文字列が `E'または`e'から始まる場合は文字列やアク セスするファイルがEUCで記述されていると仮定する. 同様に`S'ま たは`s'の場合はSJISとして処理する. `N'は漢字を処理しない. デ フォルトはEUC. .nf .ne 2 ruby -C EUC -e 'print "テスト"' ruby -Ceuc -e 'print "テスト"' ruby -C 'Shift JIS' -e 'print "テスト"' ruby -CN 'print "テスト"' .fi このオプションは将来文字コードの自動判別機能が追加された場合 等には変更される. .TP 5 .B \-d, \-\-debug デバッグモードをonにする. このフラグがセットされるとシステム 変数$DEBUGがセットされる. .TP 5 .B \-e " script" コマンドラインからスクリプトを指定する. \-eオプションを付け た時には引数からスクリプトファイル名を取らない. .TP 5 .B \-F " 文字列" 入力フィールドセパレータ(`$;')の値を文字列にセットする. awk の同名のオプションと同じ働きをする. .TP 5 .B \-i " extension" 引数で指定されたファイルの内容を置き換える(in-place edit)こ とを指定する. 元のファイルは拡張子をつけた形で保存される. .nf 例: .ne 2 % echo matz > /tmp/junk % cat /tmp/junk matz % ruby -p -i.bak -e '$_.upcase' /tmp/junk % cat /tmp/junk MATZ % cat /tmp/junk.bak matz .fi .TP 5 .B \-I " directory" ファイルをロードするパスを指定(追加)する. 指定されたディレク トリは .B ruby の配列変数$LOAD_PATHに追加される. .TP 5 .B \-l `$\\'を`$/'と同じ値に設定し, print()での出力時に改行を付加す る. また, \-nまたは\-pとともに用いられると, 入力された各行の 最後の文字をchopする. .TP 5 .B \-n このフラグがセットされるとプログラム全体が .nf .ne 2 while gets() \.\.\. end .fi で囲まれているように動作する. .TP 5 .B \-p `\-n'フラグと同じだが, 各ループの最後に変数`$_'の値を出力する. .nf 例: .ne 2 % echo matz | ruby \-p \-e '$_\.tr "a-z", "A-Z"' MATZ .fi .TP 5 .B \-R 文字列(または8進数) 入力レコードセパレータ(`$/')の値を文字列にセットする. 文字列 がすべて数字(0-7まで)から構成されている時には, その8進数で指 定されたコードをもつ文字をセパレータとする. この場合, \-R0で, パラグラフモード, \-R777で(そのコードを持 つ文字は存在しないので)全ファイルを一度に読み込むモードに設 定できる. .TP 5 .B \-s スクリプト名に続く, \-で始まる引数を解釈して, 同名の大域変数 に値を設定する. `\-\-'なる引数以降は解釈を行なわない. 該当す る引数は$ARGVから取り除かれる. .nf 例: .ne 2 #! /usr/local/bin/ruby \-s # \-xyzオプションが与えられると"true"を表示する. print "true\n" if $xyz .fi .TP 5 .B \-S スクリプト名が`/'で始まっていない場合, 環境変数`PATH'の値を 使ってスクリプトを探す. .TP 5 .B \-v, \-\-verbose 冗長モード. 起動時にバージョン番号の表示を行い, システム変数 $VERBOSEをセットする. この変数がセットされている時, いくつか のメソッドは実行時に冗長なメッセージを出力する. \-v オプショ ンが指定されてq, オプション以外の引数がない時にはバージョン を表示した後, 実行を終了する(標準入力からのスクリプトを待た ない). .TP 5 .B \-\-version .B ruby のバージョンを表示する. .nf 表示例: .ne 2 ruby - version 0.56 (94/11/19) .fi .TP 5 .B \-x メッセージ中のスクリプトを取り出して実行する. #!で始まり, "ruby"という文字列を含む行までを読み飛ばす. スクリプトの終り はEOF(ファイルの終り), ^D(コントロールD), ^Z(コントロールZ) または予約語``__END__''で指定する. .TP 5 .B \-X " directory" スクリプト実行前に指定されたディレクトリに移る. .TP 5 .B \-y, \-\-yydebug コンパイラデバッグモード. コンパイル時の構文解析の過程を表示 する. この表示は非常に冗長なので, コンパイラそのものをデバッ グする人以外は表示させない方が良いと思う. .SH BUGS .PP 遅い. 単純な処理の場合perlやawkなどの2,3倍の実行時間がかかる. これらの言語と異なり, その提供する機能のほとんどがメソッド呼 び出しを介することが原因だが, 他の言語でも関数呼び出しが多く なるような処理ではメソッドキャッシュの分だけ .B ruby が有利になるし, データ構造が複雑になれば, オブジェクト指向の メリットが活かせるので, まあ許せるかも知れない. .PP perlより記述量が多い. これは .B ruby が一貫性を追求した結果である. だが, その結果, .B ruby スクリプトはperlより読みやすいはずで, 若干の記述量を犠牲に理 解しやすさと可読性を得ていると思って欲しい. .PP ドキュメントが不十分. 必要な情報を得るためにはソースを読んで 欲しい. .PP テストが不十分. バグにつき当たったら, できれば自分で直して, こっそり私に教えて欲しい. 無理ならば, せめてバグが再現する条 件を明確にしてレポートして欲しい. .SH AUTHOR 松本 行弘 (matz@caelum.co.jp) ./ruby-0.64/ruby.c100644 150 1 16506 5704462370 12343 0ustar matzdaemon/************************************************ ruby.c - $Author: matz $ $Date: 1995/01/10 10:42:51 $ created at: Tue Aug 10 12:47:31 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "re.h" #include #include #include #include #include #include "getopt.h" static int version, copyright; static struct option long_options[] = { {"debug", 0, 0, 'd'}, {"yydebug", 0, 0, 'y'}, {"verbose", 0, 0, 'v'}, {"version", 0, &version, 1}, {"copyright", 0, ©right, 1}, {0, 0, 0, 0} }; int debug = 0; int verbose = 0; static int sflag = FALSE; char *inplace = Qnil; char *strdup(); char *strstr(); char *strchr(); char *dln_find_file(); extern int yydebug; extern int nerrs; int xflag = FALSE; #ifdef USE_DLN char *rb_dln_argv0; #endif static void load_stdin(); void rb_load_file(); static int do_loop = FALSE, do_print = FALSE; static int do_check = FALSE, do_line = FALSE; static int do_split = FALSE; static char *script; static void proc_options(argcp, argvp) int *argcp; char ***argvp; { int argc = *argcp; char **argv = *argvp; extern VALUE rb_load_path; extern char *optarg; extern int optind; int c, i, j, script_given, do_search, opt_index; extern VALUE RS, ORS, FS; char *src; if (argc == 0) return; version = FALSE; script_given = FALSE; do_search = FALSE; optind = 0; while ((c = getopt_long(argc, argv, "+acC:de:F:i:I:lnpR:svxX:yS", long_options, &opt_index)) != EOF) { switch (c) { case 'p': do_print = TRUE; /* through */ case 'n': do_loop = TRUE; break; case 'd': debug = TRUE; break; case 'y': yydebug = 1; break; case 'v': verbose = TRUE; show_version(); break; case 'e': script_given++; if (script == 0) script = "-e"; lex_setsrc("-e", optarg, strlen(optarg)); yyparse(); break; case 'i': inplace = strdup(optarg); break; case 'c': do_check = TRUE; break; case 'x': xflag = TRUE; break; case 'X': if (chdir(optarg) < 0) Fatal("Can't chdir to %s", optarg); break; case 's': sflag = TRUE; break; case 'l': do_line = TRUE; ORS = RS; break; case 'R': { char *p = optarg; while (*p) { if (*p < '0' || '7' < *p) { break; } p++; } if (*p) { RS = str_new2(optarg); } else { int i = strtoul(optarg, Qnil, 8); if (i == 0) RS = str_new(0, 0); else if (i > 0xff) RS = Qnil; else { char c = i; RS = str_new(&c, 1); } } } break; case 'F': FS = str_new2(optarg); break; case 'a': do_split = TRUE; break; case 'C': rb_set_kanjicode(optarg); break; case 'S': do_search = TRUE; break; case 'I': ary_unshift(rb_load_path, str_new2(optarg)); break; default: break; } } if (version) { show_version(); exit(0); } if (copyright) { show_copyright(); } if (argv[0] == Qnil) return; if (script_given == 0) { if (argc == optind) { /* no more args */ if (verbose) exit(0); script = "-"; load_stdin(); } else { script = argv[optind]; if (do_search) { script = dln_find_file(script, getenv("PATH")); if (!script) script = argv[optind]; } rb_load_file(script); optind++; } } xflag = FALSE; *argvp += optind; *argcp -= optind; if (sflag) { char *s; argc = *argcp; argv = *argvp; for (; argc > 0 && argv[0][0] == '-'; argc--,argv++) { if (argv[0][1] == '-') { argc--,argv++; break; } argv[0][0] = '$'; if (s = strchr(argv[0], '=')) { *s++ = '\0'; rb_gvar_set2((*argvp)[0], str_new2(s)); } else { rb_gvar_set2((*argvp)[0], TRUE); } } *argcp = argc; *argvp = argv; } } static void readin(fd, fname) int fd; char *fname; { struct stat st; char *ptr, *p, *pend; if (fstat(fd, &st) < 0) rb_sys_fail(fname); if (!S_ISREG(st.st_mode)) Fail("script is not a regular file - %s", fname); p = ptr = ALLOC_N(char, st.st_size+1); if (read(fd, ptr, st.st_size) != st.st_size) { free(ptr); rb_sys_fail(fname); } pend = p + st.st_size; if (xflag) { char *s = p; *pend = '\0'; xflag = FALSE; while (p < pend) { while (s < pend && *s != '\n') s++; if (*s != '\n') break; *s = '\0'; if (p[0] == '#' && p[1] == '!' && strstr(p, "ruby")) { if (p = strstr(p, "ruby -")) { int argc; char *argv[2]; char **argvp = argv; argc = 2; argv[0] = Qnil; argv[1] = p + 5; proc_options(&argc, &argvp); } xflag = TRUE; p = s + 1; goto start_read; } p = s + 1; } free(ptr); Fail("No Ruby script found in input"); } start_read: lex_setsrc(fname, p, pend - p); yyparse(); free(ptr); } void rb_load_file(fname) char *fname; { int fd; char *ptr; if (fname[0] == '\0') { load_stdin(); return; } fd = open(fname, O_RDONLY, 0); if (fd < 0) rb_sys_fail(fname); readin(fd, fname); close(fd); } static void load_stdin() { char buf[32]; FILE *f; char c; int fd; sprintf(buf, "/tmp/ruby-f%d", getpid()); f = fopen(buf, "w"); fd = open(buf, O_RDONLY, 0); if (fd < 0) rb_sys_fail(buf); unlink(buf); while ((c = getchar()) != EOF) { putc(c, f); } fclose(f); if (fd < 0) rb_sys_fail(buf); readin(fd, "-"); } static VALUE Progname; VALUE Argv; static int origargc; static char **origargv, **origenvp; static VALUE set_arg0(val, id) VALUE val; ID id; { char *s; int i; static int len; Check_Type(val, T_STRING); if (len == 0) { s = origargv[0]; s += strlen(s); /* See if all the arguments are contiguous in memory */ for (i = 1; i < origargc; i++) { if (origargv[i] == s + 1) s += strlen(++s); /* this one is ok too */ } len = s - origargv[0]; } s = RSTRING(val)->ptr; i = RSTRING(val)->len; if (i > len) { memcpy(origargv[0], s, len); origargv[0][len] = '\0'; } else { memcpy(origargv[0], s, i); s = origargv[0]+i; *s++ = '\0'; while (++i < len) *s++ = ' '; } Progname = str_new2(origargv[0]); return val; } void ruby_script(name) char *name; { if (name) { Progname = str_new2(name); } } void ruby_init0(argc, argv, envp) int argc; char **argv, **envp; { extern VALUE errat; int i; origargc = argc; origargv = argv; origenvp = envp; rb_call_inits(); rb_define_variable("$@", &errat, Qnil, Qnil, 0); errat = str_new2(argv[0]); rb_define_variable("$VERBOSE", &verbose, Qnil, Qnil, 0); rb_define_variable("$DEBUG", &debug, Qnil, Qnil, 0); #ifdef USE_DLN rb_dln_argv0 = argv[0]; #endif proc_options(&argc, &argv); if (do_check && nerrs == 0) { printf("Syntax OK\n"); exit(0); } if (do_print) { yyappend_print(); } if (do_loop) { yywhole_loop(do_line, do_split); } rb_define_variable("$0", &Progname, Qnil, set_arg0, 0); ruby_script(script); rb_define_variable("$ARGV", &Argv, Qnil, Qnil, 0); rb_define_variable("$*", &Argv, Qnil, Qnil, 0); Argv = ary_new2(argc); for (i=0; i < argc; i++) { ary_push(Argv, str_new2(argv[i])); } } ./ruby-0.64/ruby.h100644 150 1 14322 5704462371 12343 0ustar matzdaemon/************************************************ ruby.h - $Author: matz $ $Date: 1995/01/10 10:42:52 $ created at: Thu Jun 10 14:26:32 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto *************************************************/ #ifndef RUBY_H #define RUBY_H #include "config.h" #include "defines.h" #ifdef __STDC__ #else #define volatile #define const #endif #if defined(HAVE_ALLOCA_H) && !defined(__GNUC__) #include #endif typedef unsigned int UINT; typedef UINT VALUE; typedef UINT ID; typedef unsigned short USHORT; #ifdef __STDC__ # include #else # ifndef LONG_MAX # if !defined(LONG_MAX) || !defined(CHAR_BIT) # include # endif # endif # ifndef LONG_MIN # if (0 != ~0) # define LONG_MIN (-LONG_MAX-1) # else # define LONG_MIN (-LONG_MAX) # endif # endif #endif #ifndef CHAR_BIT # define CHAR_BIT 8 #endif # define FIXNUM_MAX (LONG_MAX>>1) # define FIXNUM_MIN RSHIFT((long)LONG_MIN,1) #define FIXNUM_FLAG 0x01 #define INT2FIX(i) (VALUE)(((int)(i))<<1 | FIXNUM_FLAG) #if (-1==(((-1)<<1)&FIXNUM_FLAG)>>1) # define RSHIFT(x,y) ((x)>>y) #else # define RSHIFT(x,y) (((x)<0) ? ~((~(x))>>y) : (x)>>y) #endif #define FIX2INT(x) RSHIFT((int)x,1) #define FIX2UINT(f) ((unsigned int)(f)>>1) #define FIXNUM_P(f) (((int)(f))&FIXNUM_FLAG) #define POSFIXABLE(f) ((f) <= FIXNUM_MAX) #define NEGFIXABLE(f) ((f) >= FIXNUM_MIN) #define FIXABLE(f) (POSFIXABLE(f) && NEGFIXABLE(f)) #define POINTER(p) (p) #define NIL_P(p) ((p) == Qnil) #undef TRUE extern VALUE TRUE; #define FALSE Qnil extern VALUE C_Object; extern VALUE C_Nil; extern VALUE C_Fixnum; extern VALUE C_Data; #define CLASS_OF(obj) (FIXNUM_P(obj)?C_Fixnum: NIL_P(obj)?C_Nil:\ RBASIC(obj)->class) #define T_NIL 0x00 #define T_OBJECT 0x01 #define T_CLASS 0x02 #define T_ICLASS 0x03 #define T_MODULE 0x04 #define T_FLOAT 0x05 #define T_STRING 0x06 #define T_REGEXP 0x07 #define T_ARRAY 0x08 #define T_FIXNUM 0x09 #define T_DICT 0x0a #define T_STRUCT 0x0b #define T_BIGNUM 0x0c #define T_NODE 0x0d #define T_SCOPE 0x0e #define T_CONS 0x0f #define T_DATA 0x10 #define T_MASK 0xff #define BUILTIN_TYPE(x) (((struct RBasic*)(x))->flags & T_MASK) #define TYPE(x) (FIXNUM_P(x)?T_FIXNUM:NIL_P(x)?T_NIL:BUILTIN_TYPE(x)) #define Check_Type(x,t) {if (TYPE(x)!=(t)) WrongType(x,t);} #define Need_Fixnum(x) {if (!FIXNUM_P(x)) (x) = num2fix(x);} #define NUM2INT(x) (FIXNUM_P(x)?FIX2INT(x):num2int(x)) VALUE num2fix(); int num2int(); #define NEWOBJ(obj,type) type *obj = (type*)newobj() #define OBJSETUP(obj,c,t) {\ RBASIC(obj)->class = (c);\ RBASIC(obj)->flags |= (t);\ } #define CLONESETUP(obj1,obj2) \ OBJSETUP(obj1,RBASIC(obj2)->class,RBASIC(obj2)->flags&T_MASK); struct RBasic { UINT flags; VALUE class; struct st_table *iv_tbl; }; struct RObject { struct RBasic basic; }; struct RClass { struct RBasic basic; struct st_table *m_tbl; struct st_table *c_tbl; struct RClass *super; }; struct RFloat { struct RBasic basic; double value; }; struct RString { struct RBasic basic; UINT len; char *ptr; struct RString *orig; }; struct RArray { struct RBasic basic; UINT len, capa; VALUE *ptr; }; struct RRegexp { struct RBasic basic; struct Regexp *ptr; UINT len; char *str; }; struct RDict { struct RBasic basic; struct st_table *tbl; }; struct RData { struct RBasic basic; void (*dmark)(); void (*dfree)(); VALUE *data; }; #define DATA_PTR(dta) (RDATA(dta)->data) VALUE data_new(); VALUE rb_ivar_get_1(); VALUE rb_ivar_set_1(); #define Get_Data_Struct(obj, iv, type, sval) {\ VALUE _data_;\ _data_ = rb_ivar_get_1(obj, iv);\ Check_Type(_data_, T_DATA);\ sval = (type*)DATA_PTR(_data_);\ } #define Make_Data_Struct(obj, iv, type, mark, free, sval) {\ VALUE _new_;\ sval = ALLOC(type);\ _new_ = data_new(sval,free,mark);\ memset(sval, 0, sizeof(type));\ rb_ivar_set_1(obj, iv, _new_);\ } struct RStruct { struct RBasic basic; UINT len; struct kv_pair { ID key; VALUE value; } *tbl; char *name; }; struct RBignum { struct RBasic basic; char sign; UINT len; USHORT *digits; }; struct RCons { struct RBasic basic; VALUE car, cdr; }; #define R_CAST(st) (struct st*) #define RBASIC(obj) (R_CAST(RBasic)(obj)) #define ROBJECT(obj) (R_CAST(RObject)(obj)) #define RCLASS(obj) (R_CAST(RClass)(obj)) #define RFLOAT(obj) (R_CAST(RFloat)(obj)) #define RSTRING(obj) (R_CAST(RString)(obj)) #define RREGEXP(obj) (R_CAST(RRegexp)(obj)) #define RARRAY(obj) (R_CAST(RArray)(obj)) #define RDICT(obj) (R_CAST(RDict)(obj)) #define RDATA(obj) (R_CAST(RData)(obj)) #define RSTRUCT(obj) (R_CAST(RStruct)(obj)) #define RBIGNUM(obj) (R_CAST(RBignum)(obj)) #define RCONS(obj) (R_CAST(RCons)(obj)) #define FL_SINGLE (1<<8) #define FL_MARK (1<<9) #define FL_USER0 (1<<10) #define FL_USER1 (1<<11) #define FL_USER2 (1<<12) #define FL_USER3 (1<<13) #define FL_USER4 (1<<14) #define FL_USER5 (1<<15) #define FL_USER6 (1<<16) #define FL_USER7 (1<<17) #define FL_UMASK (0xff<<10) #define FL_ABLE(x) (!(FIXNUM_P(x)||NIL_P(x))) #define FL_TEST(x,f) (FL_ABLE(x)?(RBASIC(x)->flags&(f)):0) #define FL_SET(x,f) if (FL_ABLE(x)) {RBASIC(x)->flags |= (f);} #define FL_UNSET(x,f) if(FL_ABLE(x)){RBASIC(x)->flags &= ~(f);} extern VALUE Qself; #define Qnil 0 #define ALLOC_N(type,n) (type*)xmalloc(sizeof(type)*(n)) #define ALLOC(type) (type*)xmalloc(sizeof(type)) #define REALLOC_N(var,type,n) (var)=(type*)xrealloc((char*)(var),sizeof(type)*(n)) #define ALLOCA_N(type,n) (type*)alloca(sizeof(type)*(n)) #define MEMZERO(p,type,n) memset((p), 0, sizeof(type)*(n)) #define MEMCPY(p1,p2,type,n) memcpy((p1), (p2), sizeof(type)*(n)) #ifdef SAFE_SIGHANDLE extern int trap_immediate; # define TRAP_BEG (trap_immediate=1) # define TRAP_END (trap_immediate=0) #else # define TRAP_BEG # define TRAP_END #endif VALUE rb_define_class(); VALUE rb_define_module(); void rb_define_variable(); void rb_define_const(); void rb_define_method(); void rb_define_single_method(); void rb_undef_method(); void rb_define_alias(); void rb_define_attr(); ID rb_intern(); char *rb_id2name(); VALUE rb_funcall(); int rb_scan_args(); VALUE rb_yield(); extern int verbose, debug; #endif ./ruby-0.64/signal.c100644 150 1 14111 5704462372 12627 0ustar matzdaemon/************************************************ signal.c - $Author: matz $ $Date: 1995/01/10 10:42:53 $ created at: Tue Dec 20 10:13:44 JST 1994 ************************************************/ #include "ruby.h" #include #include static struct signals { char *signm; int signo; } siglist [] = { #ifdef SIGHUP "HUP", SIGHUP, #endif #ifdef SIGINT "INT", SIGINT, #endif #ifdef SIGQUIT "QUIT", SIGQUIT, #endif #ifdef SIGILL "ILL", SIGILL, #endif #ifdef SIGTRAP "TRAP", SIGTRAP, #endif #ifdef SIGIOT "IOT", SIGIOT, #endif #ifdef SIGABRT "ABRT", SIGABRT, #endif #ifdef SIGEMT "EMT", SIGEMT, #endif #ifdef SIGFPE "FPE", SIGFPE, #endif #ifdef SIGKILL "KILL", SIGKILL, #endif #ifdef SIGBUS "BUS", SIGBUS, #endif #ifdef SIGSEGV "SEGV", SIGSEGV, #endif #ifdef SIGSYS "SYS", SIGSYS, #endif #ifdef SIGPIPE "PIPE", SIGPIPE, #endif #ifdef SIGALRM "ALRM", SIGALRM, #endif #ifdef SIGTERM "TERM", SIGTERM, #endif #ifdef SIGURG "URG", SIGURG, #endif #ifdef SIGSTOP "STOP", SIGSTOP, #endif #ifdef SIGTSTP "TSTP", SIGTSTP, #endif #ifdef SIGCONT "CONT", SIGCONT, #endif #ifdef SIGCHLD "CHLD", SIGCHLD, #endif #ifdef SIGCLD "CLD", SIGCLD, #else # ifdef SIGCHLD "CLD", SIGCHLD, # endif #endif #ifdef SIGTTIN "TTIN", SIGTTIN, #endif #ifdef SIGTTOU "TTOU", SIGTTOU, #endif #ifdef SIGIO "IO", SIGIO, #endif #ifdef SIGXCPU "XCPU", SIGXCPU, #endif #ifdef SIGXFSZ "XFSZ", SIGXFSZ, #endif #ifdef SIGVTALRM "VTALRM", SIGVTALRM, #endif #ifdef SIGPROF "PROF", SIGPROF, #endif #ifdef SIGWINCH "WINCH", SIGWINCH, #endif #ifdef SIGUSR1 "USR1", SIGUSR1, #endif #ifdef SIGUSR2 "USR2", SIGUSR2, #endif #ifdef SIGLOST "LOST", SIGLOST, #endif #ifdef SIGMSG "MSG", SIGMSG, #endif #ifdef SIGPWR "PWR", SIGPWR, #endif #ifdef SIGPOLL "POLL", SIGPOLL, #endif #ifdef SIGDANGER "DANGER", SIGDANGER, #endif #ifdef SIGMIGRATE "MIGRATE", SIGMIGRATE, #endif #ifdef SIGPRE "PRE", SIGPRE, #endif #ifdef SIGGRANT "GRANT", SIGGRANT, #endif #ifdef SIGRETRACT "RETRACT", SIGRETRACT, #endif #ifdef SIGSOUND "SOUND", SIGSOUND, #endif NULL, 0, }; static int signm2signo(nm) char *nm; { struct signals *sigs; for (sigs = siglist; sigs->signm; sigs++) if (strcmp(sigs->signm, nm) == 0) return sigs->signo; return 0; } VALUE Fkill(argc, argv) int argc; VALUE *argv; { int sig; int i; if (argc < 2) Fail("wrong # of arguments -- kill(sig, pid...)"); switch (TYPE(argv[0])) { case T_FIXNUM: sig = FIX2UINT(argv[0]); break; case T_STRING: { int negative = 0; char *s = RSTRING(argv[0])->ptr; if (*s == '-') { negative++; s++; } if (strncmp("SIG", s, 3) == 0) s += 3; if((sig = signm2signo(s)) == 0) Fail("Unrecognized signal name `%s'", s); if (negative) sig = -sig; } break; default: Fail("bad signal type %s", rb_class2name(CLASS_OF(argv[0]))); break; } if (sig < 0) { sig = -sig; for (i=1; i= NSIG || trap_list[sig] == Qnil) Fail("trap_handler: Bad signal %d", sig); #ifndef HAVE_BSD_SIGNALS signal(sig, sighandle); #endif #ifdef SAFE_SIGHANDLE if (trap_immediate) { rb_trap_eval(trap_list[sig]); } else { trap_pending++; trap_pending_list[sig]++; } #else rb_trap_eval(trap_list[sig]); #endif } void rb_trap_exit() { if (trap_list[0]) rb_trap_eval(trap_list[0]); } #ifdef SAFE_SIGHANDLE rb_trap_exec() { int i; trap_pending = 0; for (i=0; ilen == 0) { func = SIG_IGN; } else if (RSTRING(argv[0])->len == 7) { if (strncmp(RSTRING(argv[0])->ptr, "SIG_IGN", 7) == 0) { func = SIG_IGN; } else if (strncmp(RSTRING(argv[0])->ptr, "SIG_DFL", 7) == 0) { func = SIG_DFL; } else if (strncmp(RSTRING(argv[0])->ptr, "DEFAULT", 7) == 0) { func = SIG_DFL; } } else if (RSTRING(argv[0])->len == 6) { if (strncmp(RSTRING(argv[0])->ptr, "IGNORE", 6) == 0) { func = SIG_IGN; } } } if (func == SIG_IGN || func == SIG_DFL) command = Qnil; for (i=1; iptr; if (strncmp("SIG", s, 3) == 0) s += 3; sig = signm2signo(s); if (sig == 0 && strcmp(s, "EXIT") != 0) Fail("Invalid signal SIG%s", s); } else { sig = NUM2INT(argv[i]); } if (sig < 0 || sig > NSIG) Fail("Invalid signal no %d", sig); signal(sig, sighandle); trap_list[sig] = command; /* enable at least specified signal. */ #ifdef HAVE_SIGPROCMASK sigdelset(&mask, sig); #else mask &= ~sigmask(sig); #endif } /* disable interrupt */ #ifdef HAVE_SIGPROCMASK sigprocmask(SIG_SETMASK, &mask, NULL); #else sigsetmask(mask); #endif return Qnil; } ./ruby-0.64/socket.c100644 150 1 41167 5704462373 12656 0ustar matzdaemon/************************************************ socket.c - $Author: matz $ $Date: 1995/01/10 10:42:55 $ created at: Thu Mar 31 12:21:29 JST 1994 ************************************************/ #include "ruby.h" #ifdef HAVE_SOCKET #include "io.h" #include #include #include #include #include #include #include extern VALUE C_IO; VALUE C_BasicSocket; VALUE C_TCPsocket; VALUE C_TCPserver; VALUE C_UNIXsocket; VALUE C_UNIXserver; VALUE C_Socket; FILE *rb_fdopen(); char *strdup(); static VALUE sock_new(class, fd) VALUE class; int fd; { VALUE sock = obj_alloc(class); OpenFile *fp; MakeOpenFile(sock, fp); fp->f = rb_fdopen(fd, "r"); setbuf(fp->f, NULL); fp->f2 = rb_fdopen(fd, "w"); fp->mode = FMODE_READWRITE|FMODE_SYNC; return sock; } static VALUE Fbsock_shutdown(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { VALUE howto; int how; OpenFile *fptr; rb_scan_args(argc, argv, "01", &howto); if (howto == Qnil) how = 2; else { how = NUM2INT(howto); if (how < 0 && how > 2) how = 2; } GetOpenFile(sock, fptr); if (shutdown(fileno(fptr->f), how) == -1) rb_sys_fail(Qnil); return INT2FIX(0); } static VALUE Fbsock_setopt(sock, lev, optname, val) VALUE sock, lev, optname; struct RString *val; { int level, option; OpenFile *fptr; level = NUM2INT(lev); option = NUM2INT(optname); Check_Type(val, T_STRING); GetOpenFile(sock, fptr); if (setsockopt(fileno(fptr->f), level, option, val->ptr, val->len) < 0) rb_sys_fail(fptr->path); return INT2FIX(0); } static VALUE Fbsock_getopt(sock, lev, optname) VALUE sock, lev, optname; { int level, option, len; struct RString *val; OpenFile *fptr; level = NUM2INT(lev); option = NUM2INT(optname); len = 256; val = (struct RString*)str_new(0, len); Check_Type(val, T_STRING); GetOpenFile(sock, fptr); if (getsockopt(fileno(fptr->f), level, option, val->ptr, &len) < 0) rb_sys_fail(fptr->path); val->len = len; return (VALUE)val; } static VALUE Fbsock_getsockname(sock) VALUE sock; { char buf[1024]; int len = sizeof buf; OpenFile *fptr; GetOpenFile(sock, fptr); if (getsockname(fileno(fptr->f), (struct sockaddr*)buf, &len) < 0) rb_sys_fail("getsockname(2)"); return str_new(buf, len); } static VALUE Fbsock_getpeername(sock) VALUE sock; { char buf[1024]; int len = sizeof buf; OpenFile *fptr; GetOpenFile(sock, fptr); if (getpeername(fileno(fptr->f), (struct sockaddr*)buf, &len) < 0) rb_sys_fail("getpeername(2)"); return str_new(buf, len); } static VALUE open_inet(class, h, serv, server) VALUE class, h, serv; int server; { char *host; struct hostent *hostent, _hostent; struct servent *servent, _servent; struct protoent *protoent; struct sockaddr_in sockaddr; int fd, status; int hostaddr, hostaddrPtr[2]; int servport; char *syscall; VALUE sock; if (h) { Check_Type(h, T_STRING); host = RSTRING(h)->ptr; hostent = gethostbyname(host); if (hostent == NULL) { hostaddr = inet_addr(host); if (hostaddr == -1) { if (server && !strlen(host)) hostaddr = INADDR_ANY; else rb_sys_fail(host); } _hostent.h_addr_list = (char **)hostaddrPtr; _hostent.h_addr_list[0] = (char *)&hostaddr; _hostent.h_addr_list[1] = NULL; _hostent.h_length = sizeof(hostaddr); _hostent.h_addrtype = AF_INET; hostent = &_hostent; } } servent = NULL; if (FIXNUM_P(serv)) { servport = FIX2UINT(serv); goto setup_servent; } Check_Type(serv, T_STRING); servent = getservbyname(RSTRING(serv)->ptr, "tcp"); if (servent == NULL) { servport = strtoul(RSTRING(serv)->ptr, Qnil, 0); if (servport == -1) Fail("no such servce %s", RSTRING(serv)->ptr); setup_servent: _servent.s_port = servport; _servent.s_proto = "tcp"; servent = &_servent; } protoent = getprotobyname(servent->s_proto); if (protoent == NULL) Fail("no such proto %s", servent->s_proto); fd = socket(PF_INET, SOCK_STREAM, protoent->p_proto); sockaddr.sin_family = AF_INET; if (h == Qnil) { sockaddr.sin_addr.s_addr = INADDR_ANY; } else { memcpy((char *)&(sockaddr.sin_addr.s_addr), (char *) hostent->h_addr_list[0], (size_t) hostent->h_length); } sockaddr.sin_port = servent->s_port; if (server) { status = bind(fd, (struct sockaddr*)&sockaddr, sizeof(sockaddr)); syscall = "bind(2)"; } else { status = connect(fd, (struct sockaddr*)&sockaddr, sizeof(sockaddr)); syscall = "connect(2)"; } if (status < 0) { close (fd); rb_sys_fail(syscall); } if (server) listen(fd, 5); /* create new instance */ sock = sock_new(class, fd); return sock; } static VALUE Stcp_sock_open(class, host, serv) VALUE class, host, serv; { Check_Type(host, T_STRING); return open_inet(class, host, serv, 0); } static VALUE Stcp_svr_open(argc, argv, class) int argc; VALUE *argv; VALUE class; { VALUE arg1, arg2; if (rb_scan_args(argc, argv, "11", &arg1, &arg2) == 2) return open_inet(class, arg1, arg2, 1); else return open_inet(class, Qnil, arg1, 1); } static VALUE sock_accept(class, fd, sockaddr, len) VALUE class; int fd; struct sockaddr *sockaddr; int *len; { int fd2; retry: fd2 = accept(fd, sockaddr, len); if (fd2 < 0) { if (errno == EINTR) goto retry; rb_sys_fail(Qnil); } return sock_new(class, fd2); } static VALUE Ftcp_accept(sock) VALUE sock; { OpenFile *fptr; struct sockaddr_in from; int fromlen; GetOpenFile(sock, fptr); fromlen = sizeof(struct sockaddr_in); return sock_accept(C_TCPsocket, fileno(fptr->f), (struct sockaddr*)&from, &fromlen); } static VALUE open_unix(class, path, server) VALUE class; struct RString *path; int server; { struct sockaddr_un sockaddr; int fd, status; char *syscall; VALUE sock; OpenFile *fptr; Check_Type(path, T_STRING); fd = socket(PF_UNIX, SOCK_STREAM, 0); if (fd < 0) rb_sys_fail("socket(2)"); sockaddr.sun_family = AF_UNIX; strncpy(sockaddr.sun_path, path->ptr, sizeof(sockaddr.sun_path)-1); sockaddr.sun_path[sizeof(sockaddr.sun_path)-1] = '\0'; if (server) { status = bind(fd, (struct sockaddr*)&sockaddr, sizeof(sockaddr)); syscall = "bind(2)"; } else { status = connect(fd, (struct sockaddr*)&sockaddr, sizeof(sockaddr)); syscall = "connect(2)"; } if (status < 0) { close (fd); rb_sys_fail(syscall); } if (server) listen(fd, 5); sock = sock_new(class, fd); GetOpenFile(sock, fptr); fptr->path = strdup(path->ptr); return sock; } static VALUE tcp_addr(sockaddr) struct sockaddr_in *sockaddr; { VALUE family, port, addr; VALUE ary; struct hostent *hostent; family = str_new2("AF_INET"); hostent = gethostbyaddr((char*)&sockaddr->sin_addr.s_addr, sizeof(sockaddr->sin_addr), AF_INET); if (hostent) { addr = str_new2(hostent->h_name); } else { char buf[16]; char *a = (char*)&sockaddr->sin_addr; sprintf(buf, "%d.%d.%d.%d", a[0], a[1], a[2], a[3]); addr = str_new2(buf); } port = INT2FIX(sockaddr->sin_port); ary = ary_new3(3, family, port, addr); return ary; } static VALUE Ftcp_addr(sock) VALUE sock; { OpenFile *fptr; struct sockaddr_in addr; int len = sizeof addr; GetOpenFile(sock, fptr); if (getsockname(fileno(fptr->f), (struct sockaddr*)&addr, &len) < 0) rb_sys_fail("getsockname(2)"); return tcp_addr(&addr); } static VALUE Ftcp_peeraddr(sock) VALUE sock; { OpenFile *fptr; struct sockaddr_in addr; int len = sizeof addr; GetOpenFile(sock, fptr); if (getpeername(fileno(fptr->f), (struct sockaddr*)&addr, &len) < 0) rb_sys_fail("getsockname(2)"); return tcp_addr(&addr); } static VALUE Sunix_sock_open(sock, path) VALUE sock, path; { return open_unix(sock, path, 0); } static VALUE Funix_path(sock) VALUE sock; { OpenFile *fptr; GetOpenFile(sock, fptr); if (fptr->path == Qnil) { struct sockaddr_un addr; int len = sizeof(addr); if (getsockname(fileno(fptr->f), (struct sockaddr*)&addr, &len) < 0) rb_sys_fail(Qnil); fptr->path = strdup(addr.sun_path); } return str_new2(fptr->path); } static VALUE Sunix_svr_open(class, path) VALUE class, path; { return open_unix(class, path, 1); } static VALUE Funix_accept(sock) VALUE sock; { OpenFile *fptr; struct sockaddr_un from; int fromlen; GetOpenFile(sock, fptr); fromlen = sizeof(struct sockaddr_un); return sock_accept(C_UNIXsocket, fileno(fptr->f), (struct sockaddr*)&from, &fromlen); } static VALUE unix_addr(sockaddr) struct sockaddr_un *sockaddr; { return assoc_new(str_new2("AF_UNIX"),str_new2(sockaddr->sun_path)); } static VALUE Funix_addr(sock) VALUE sock; { OpenFile *fptr; struct sockaddr_un addr; int len = sizeof addr; GetOpenFile(sock, fptr); if (getsockname(fileno(fptr->f), (struct sockaddr*)&addr, &len) < 0) rb_sys_fail("getsockname(2)"); return unix_addr(&addr); } static VALUE Funix_peeraddr(sock) VALUE sock; { OpenFile *fptr; struct sockaddr_un addr; int len = sizeof addr; GetOpenFile(sock, fptr); if (getpeername(fileno(fptr->f), (struct sockaddr*)&addr, &len) < 0) rb_sys_fail("getsockname(2)"); return unix_addr(&addr); } static void setup_domain_and_type(domain, dv, type, tv) VALUE domain, type; int *dv, *tv; { char *ptr; if (TYPE(domain) == T_STRING) { ptr = RSTRING(domain)->ptr; if (strcmp(ptr, "PF_UNIX") == 0) *dv = PF_UNIX; else if (strcmp(ptr, "PF_INET") == 0) *dv = PF_INET; #ifdef PF_IMPLINK else if (strcmp(ptr, "PF_IMPLINK") == 0) *dv = PF_IMPLINK; #endif #ifdef PF_AX25 else if (strcmp(ptr, "PF_AX25") == 0) *dv = PF_AX25; #endif #ifdef PF_IPX else if (strcmp(ptr, "PF_IPX") == 0) *dv = PF_IPX; #endif else Fail("Unknown socket domain %s", ptr); } else { *dv = NUM2INT(domain); } if (TYPE(type) == T_STRING) { ptr = RSTRING(type)->ptr; if (strcmp(ptr, "SOCK_STREAM") == 0) *tv = SOCK_STREAM; else if (strcmp(ptr, "SOCK_DGRAM") == 0) *tv = SOCK_DGRAM; #ifdef SOCK_RAW else if (strcmp(ptr, "SOCK_RAW") == 0) *tv = SOCK_RAW; #endif #ifdef SOCK_SEQPACKET else if (strcmp(ptr, "SOCK_SEQPACKET") == 0) *tv = SOCK_SEQPACKET; #endif #ifdef SOCK_RDM else if (strcmp(ptr, "SOCK_RDM") == 0) *tv = SOCK_RDM; #endif #ifdef SOCK_PACKET else if (strcmp(ptr, "SOCK_PACKET") == 0) *tv = SOCK_PACKET; #endif else Fail("Unknown socket type %s", ptr); } else { *tv = NUM2INT(type); } } static VALUE Ssock_open(class, domain, type, protocol) VALUE class, domain, type, protocol; { int fd; int d, t; setup_domain_and_type(domain, &d, type, &t); fd = socket(d, t, NUM2INT(protocol)); if (fd < 0) rb_sys_fail("socke(2)"); return sock_new(class, fd); } static VALUE Ssock_for_fd(class, fd) VALUE class, fd; { return sock_new(class, NUM2INT(fd)); } static VALUE Ssock_socketpair(class, domain, type, protocol) VALUE class, domain, type, protocol; { int fd; int d, t, sp[2]; setup_domain_and_type(domain, &d, type, &t); if (socketpair(d, t, NUM2INT(protocol), sp) < 0) rb_sys_fail("socketpair(2)"); return assoc_new(sock_new(class, sp[0]), sock_new(class, sp[1])); } static VALUE Fsock_connect(sock, addr) VALUE sock; struct RString *addr; { OpenFile *fptr; Check_Type(addr, T_STRING); str_modify(addr); GetOpenFile(sock, fptr); if (connect(fileno(fptr->f), (struct sockaddr*)addr->ptr, addr->len) < 0) rb_sys_fail("connect(2)"); return INT2FIX(0); } static VALUE Fsock_bind(sock, addr) VALUE sock; struct RString *addr; { OpenFile *fptr; Check_Type(addr, T_STRING); str_modify(addr); GetOpenFile(sock, fptr); if (bind(fileno(fptr->f), (struct sockaddr*)addr->ptr, addr->len) < 0) rb_sys_fail("bind(2)"); return INT2FIX(0); } static VALUE Fsock_listen(sock, log) VALUE sock, log; { OpenFile *fptr; GetOpenFile(sock, fptr); if (listen(fileno(fptr->f), NUM2INT(log)) < 0) rb_sys_fail("listen(2)"); return INT2FIX(0); } static VALUE Fsock_accept(sock) VALUE sock; { OpenFile *fptr; VALUE addr, sock2; char buf[1024]; int len = sizeof buf; GetOpenFile(sock, fptr); sock2 = sock_accept(C_Socket,fileno(fptr->f),(struct sockaddr*)buf,&len); return assoc_new(sock2, str_new(buf, len)); } static VALUE Fsock_send(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { struct RString *msg, *to; VALUE flags; OpenFile *fptr; FILE *f; int fd, n; rb_scan_args(argc, argv, "21", &msg, &flags, &to); Check_Type(msg, T_STRING); GetOpenFile(sock, fptr); f = fptr->f2?fptr->f2:fptr->f; fd = fileno(f); if (to) { Check_Type(to, T_STRING); n = sendto(fd, msg->ptr, msg->len, NUM2INT(flags), (struct sockaddr*)to->ptr, to->len); } else { n = send(fd, msg->ptr, msg->len, NUM2INT(flags)); } if (n < 0) { rb_sys_fail("send(2)"); } return INT2FIX(n); } static VALUE sock_recv(sock, argc, argv, from) VALUE sock; int argc; VALUE *argv; int from; { OpenFile *fptr; FILE f; struct RString *str; char buf[1024]; int fd, alen = sizeof buf; VALUE len, flg; int flags; rb_scan_args(argc, argv, "11", &len, &flg); if (flg == Qnil) flags = 0; else flags = NUM2INT(flg); str = (struct RString*)str_new(0, NUM2INT(len)); GetOpenFile(sock, fptr); fd = fileno(fptr->f); if ((str->len = recvfrom(fd, str->ptr, str->len, flags, (struct sockaddr*)buf, &alen)) < 0) { rb_sys_fail("recvfrom(2)"); } if (from) return assoc_new(str, str_new(buf, alen)); else return (VALUE)str; } static VALUE Fsock_recv(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { return sock_recv(sock, argc, argv, 0); } static VALUE Fsock_recvfrom(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { return sock_recv(sock, argc, argv, 1); } Init_Socket () { C_BasicSocket = rb_define_class("BasicSocket", C_IO); rb_undef_method(C_BasicSocket, "new"); rb_define_method(C_BasicSocket, "shutdown", Fbsock_shutdown, -1); rb_define_method(C_BasicSocket, "setopt", Fbsock_setopt, 3); rb_define_method(C_BasicSocket, "getopt", Fbsock_getopt, 2); rb_define_method(C_BasicSocket, "getsockname", Fbsock_getsockname, 0); rb_define_method(C_BasicSocket, "getpeername", Fbsock_getpeername, 0); C_TCPsocket = rb_define_class("TCPsocket", C_BasicSocket); rb_define_single_method(C_TCPsocket, "open", Stcp_sock_open, 2); rb_define_single_method(C_TCPsocket, "new", Stcp_sock_open, 2); rb_define_method(C_TCPsocket, "addr", Ftcp_addr, 0); rb_define_method(C_TCPsocket, "peeraddr", Ftcp_peeraddr, 0); C_TCPserver = rb_define_class("TCPserver", C_TCPsocket); rb_define_single_method(C_TCPserver, "open", Stcp_svr_open, -1); rb_define_single_method(C_TCPserver, "new", Stcp_svr_open, -1); rb_define_method(C_TCPserver, "accept", Ftcp_accept, 0); C_UNIXsocket = rb_define_class("UNIXsocket", C_BasicSocket); rb_define_single_method(C_UNIXsocket, "open", Sunix_sock_open, 1); rb_define_single_method(C_UNIXsocket, "new", Sunix_sock_open, 1); rb_define_method(C_UNIXsocket, "path", Funix_path, 0); rb_define_method(C_UNIXsocket, "addr", Funix_addr, 0); rb_define_method(C_UNIXsocket, "peeraddr", Funix_peeraddr, 0); C_UNIXserver = rb_define_class("UNIXserver", C_UNIXsocket); rb_define_single_method(C_UNIXserver, "open", Sunix_svr_open, 1); rb_define_single_method(C_UNIXserver, "new", Sunix_svr_open, 1); rb_define_method(C_UNIXserver, "accept", Funix_accept, 0); C_Socket = rb_define_class("Socket", C_BasicSocket); rb_define_single_method(C_Socket, "open", Ssock_open, 3); rb_define_single_method(C_Socket, "new", Ssock_open, 3); rb_define_single_method(C_Socket, "for_fd", Ssock_for_fd, 1); rb_define_method(C_Socket, "connect", Fsock_connect, 1); rb_define_method(C_Socket, "bind", Fsock_bind, 1); rb_define_method(C_Socket, "listen", Fsock_listen, 1); rb_define_method(C_Socket, "accept", Fsock_accept, 0); rb_define_method(C_Socket, "send", Fsock_send, -1); rb_define_method(C_Socket, "recv", Fsock_recv, -1); rb_define_method(C_Socket, "recvfrom", Fsock_recv, -1); rb_define_single_method(C_Socket, "socketpair", Ssock_socketpair, 3); } #endif /* HAVE_SOCKET */ ./ruby-0.64/spec100644 150 1 264762 5704462375 12131 0ustar matzdaemon.\" spec - -*- Indented-Text -*- created at: Tue May 25 15:18:26 JST 1993 * はじめに(なぜRubyか?) Rubyは「UNIXで手軽にオブジェクト指向プログラミング」をしたいという望み を実現するために生まれた．そのために必要だと思われた性質は: * 文法や機能が単純である． * オブジェクト指向プログラミングをサポートする機能を 持つ言語として設計されている． * ターンアラウンドタイムが短い(インタプリタである)． * OS(UNIX)の機能が簡単に利用できる． * スクリプト言語として使える． * 処理系がfreeである． などである．オブジェクト指向言語として一般的であるSmalltalkやC++などは 上の条件の一部を満たしてはいるが，特に手軽なプログラミングという点に欠 けており，以上の条件の全てを満たすものではなかった．一方スクリプト言語 であるPerlや Tclにオブジェクト指向機能を追加したシステムも存在するが， これらは「手軽にプログラミング」という性質は満たしてはいても，逆にオブ ジェクト指向機能に不備や不満があった．よって，これらの条件を満たすため に設計されたRubyの特徴は: * インタプリタである． * 単純で例外の少ない文法． * 十分なオブジェクト指向機能を持つ． * できるだけ書きやすい(演算子形式など)． * ガーベージコレクタがある． * 例外処理機能がある． * 十分に強力なクラスが組み込まれている． * OSをアクセスする機能が提供される． * 拡張しやすい． などである．RubyはshやPerlを知っている人にとっての常識になるたけ従った ので，それらの言語からの自然な移行が可能であると思われる．プログラマが Rubyのオブジェクト指向機能について学べば，より強力なこともできるように なるだろう． 更にC言語でクラスやメソッドを記述し，追加することでRubyを更に強力にす ることができる．一部のプラットフォームではRubyは動的にオブジェクトファ イルをリンクできるし，そうでなくてもRubyを再コンパイルして組み込みクラ スを追加するのは容易である(Perlなどよりもはるかに容易である)． * Rubyの文法 ここではRuby言語の文法を解説する．Rubyの基本的な部分は小さく，文法に例 外が少ないので身につけるのはさほど難しくないだろう． ** コメント スクリプト言語の習慣にならい，文字列中以外の'#'から行末まではコメント と見なす． ** 区切り記号 空白文字(タブとスペース)および改行(\n)が区切り記号となる．更に 改行は a + b のように行が式(文)の途中で終り，次の行に続くことが明白な場合以外は文の 区切りとしても認識される． ** 予約語 予約語は以下の通りである alias elsif module self yield and end nil super __END__ break ensure or then __FILE__ case fail protect undef __LINE__ class for redo unless continue if resque until def in retry when else include return while 予約語はクラス名，メソッド名，変数名などに用いることはできない． ** 式 Rubyプログラムを構成する要素は式と文である．まず，式から解説する． *** リテラル プログラム中に直接記述できるオブジェクトをリテラルと呼ぶ．Rubyのリテラ ルには文字列，正規表現，数値というリテラルがある． **** 文字列リテラル "..." # バックスラッシュの解釈と変数展開あり '...' # バックスラッシュの解釈なし(\\と\'は解釈する) **** バックスラッシュ記法 \t タブ(0x09) \n 改行文字(0x0a) \r 復帰文字(0x0d) \f 改ページ文字(0x0c) \b バックスペース(0x08) \a ベル(0x07) \e エスケープ(0x1b) \# 文字`#'そのもの \nnn 8進数表記(nは0-7) \xnn 16進数表記(nは0-9,a-f) \^c コントロール文字(cはASCII文字) \C-c コントロール文字(同上) \M-c メタ文字(c|0x80) \それ以外 文字そのもの **** 変数展開 ダブルクォート(`"')で囲まれた文字列と正規表現の中では `#{変数名}'とい う形式で変数の内容を展開することができる．変数が変数記号(`$',`@',`%') で始まる場合には`#変数名'という形式でも展開できる．文字`#'に続く文字 が `{',`$',`@',`%'でなければ，そのまま`#'として解釈される． **** 正規表現リテラル /.../ ^ 行頭 $ 行末 . 任意の1文字 \w 英数字．[0-9A-Za-z_]と同じ \W 非英数字 \s 空白文字．[ \t\n\r\f]と同じ \S 非空白文字 \d 数字．[0-9] と同じ \D 非数字 \b 語境界文字(文字クラス外) \B 非語境界文字 \b 後退(0x08)(文字クラス内) [ ] 文字クラス指定 * 直前の表現の0回以上の繰り返し + 直前の表現の1回以上の繰り返し {m,n} m回からn回の繰り返し ? 0または1回 | 選択 ( ) 正規表現をまとめる その他に文字列と同じバックスラッシュ記法も有効である． **** ワイルドカードリテラル <...> * 任意の文字列(空文字列を含む)と一致 ? 任意の1文字と一致 [ ] []内のいずれか1文字と一致 {..} {}内のいずれかの文字列と一致 **** 数値リテラル 123 整数 -123 整数(符合つき数) 1_234 整数(10進数は`_'を含むことができる) 123.45 浮動小数点数 1.2e-3 浮動小数点数 0xffff 16進整数 0377 8進整数 ?a 文字`a'のコード(97) ?\C-a コントロールaのコード(1) ?\M-a メタaのコード(225) ?\M-\C-a メタ-コントロールaのコード(129) \シンボル 識別子/変数名と一対一対応する整数．applyなどでメソッ ドを指定するのに使う． ?表現では全てのバックスラッシュ記法が有効である． *** コマンドの出力 Rubyではshのようにコマンドの実行結果を文字列リテラルのように使うことが できる．``で囲まれた文字列は，ダブルクォートと同様にバックスラッシュ記 法の解釈と変数展開が行なわれた後，コマンドとして実行され，その実行結果 が文字列として与えられる．コマンドは評価されるたびに実行される． *** 変数参照 Rubyの変数はスコープ(有効範囲)と寿命(有効期限)によって4種類に分類され， その種類は変数名の最初の一文字で決定される．通常の変数の2文字目以降は 英数時または`_'であるが，システム変数の一部は「`$'+1文字の記号」という 変数がある．変数名の長さに関して特別な制限はない． 変数のスコープに関わらず，初期化されていない変数を参照した時の値はnil である． **** グローバル変数 `$'で始まる変数のスコープはグローバルであり，プログラムのどこからでも 参照できる．その寿命はプログラムの寿命と等しい． **** インスタンス変数 `@'で始まる変数はインスタンス変数であり，そのクラスまたはサブクラスの メソッドから参照できる．スコープはメソッド内であり，その寿命はオブジェ クトの寿命に等しい． **** クラス名/モジュール名/ローカル変数 アルファベットまたは`_'で始まる変数は識別子とも呼ばれ，ローカル変数， クラス名またはモジュール名である． 初期状態では識別子はクラス/モジュール名とみなされるが(該当するクラスが 存在しない場合の値はnil)，代入式の左辺に現れた識別子は，そのスコープ内 ではローカル変数として見なされ，同名のクラスやモジュールは隠される．こ の意味で識別子への代入は宣言としての働きも持つ． Array # 配列クラス Array Array = 15 # 代入．以後Arrayはローカル変数 print Array, "\n" # `15'が出力される この宣言としての代入の解釈はコンパイル時に行なわれるため，識別子への代 入式が実際に実行されてもされなくても，以降のスコープ内ではその識別子は ローカル変数とみなされる． Array # 配列クラス Array if %FALSE Array = 15 # このコードは実行されないが， # 以降Arrayはローカル変数とみなされる． end print Array, "\n" # `nil'が出力される このルールは一見複雑だが，クラス/モジュール名とローカル変数名が重複し ない限り，未初期化のローカル変数の値はnilであると考えても差し支えはな い．Rubyの組み込みクラスは大文字のアルファベットで始まる名前がついて おり，ユーザもクラス/モジュール名には大文字で始まる識別子を，ローカル 変数名には小文字または`_'で始まる識別子を使うことを強く推奨する． ローカル変数のスコープも寿命もそのブロックの終りまで(トップレベルのロー カル変数はプログラムの終了まで)である． **** クラス変数(定数) `%'で始まる変数はクラス変数であり，そのクラスと全てのサブクラスのイン スタンスから参照できる．この変数への代入はトップレベル，すなわちメソッ ドが定義できるレベルでのみ可能である．この変数はクラス間で値が共有され， 一度代入するとメソッドからは値を変更することができないので，定数として 用いられる． **** 疑似変数 通常の変数以外に疑似変数と呼ばれる特殊な変数が4つある． self | 現在のメソッドの実行主体 nil | Nilクラスの唯一のインスタンス(偽を表す) __FILE__ | スクリプトのファイル名(文字列) __LINE__ | 現在の行番号(整数) これらの疑似変数は代入によってその値を変更することはできない．これらの 変数への代入は例外を発生させる． *** メッセージ式 オブジェクトにメッセージを送る基本的な構文がメッセージ式であり，その基 本形式は以下の通りである． 式1 '.' メソッド名 '(' 引数1... [',' '*' 引数n ]')' 式1を評価して得られるオブジェクトの，識別子で指定されるメソッドを呼び 出す．一番最後の引数が'*'に続く(単一の)式である場合，その式を評価した 結果(配列である必要がある)を展開して，引数として追加する． 引数が一つもない時には括弧を省略できる． メソッド名としては任意の識別子を用いることができる．変数名とは識別子の 名前空間が違うので重複しても構わない． メッセージ式で，レシーバがselfの場合，レシーバを省略して通常のプログラ ミング言語における関数のような形式でメソッドを呼び出すことができる．こ の場合引数が1つもない時でも括弧の省略はできない． クラス定義文の外で指定されたメソッドとクラスModuleのnoexportメソッドで 指定されたメソッドは関数的メソッドと呼ばれ，関数形式でしか呼び出すこと ができない． *** スーパークラスのメソッド呼び出し メッセージ式の特殊なケースとしてスーパークラスのメソッドの呼び出しがあ る．この形式はメソッドを再定義した時にスーパークラスの定義を利用するた めに使う． super 現在のメソッドに与えられた引数のままスーパクラスの同名のメソッドを呼び 出す． super'(' 引数... ')' 引数とともにスーパークラスの同名のメソッドを呼び出す．一番最後の引数が `*'に続く場合は通常のメソッド呼び出しと同様に渡される． *** 配列式/連想配列式 配列のオブジェクトを生成する式の形式は以下の形式である． '[' 式, ... ']' それぞれの式を評価した結果を含む配列を返す．要素数が0の空配列を生成す るためには空の配列式 '[' ']' を用いる． ** 連想配列式 連想配列とは任意のオブジェクトをキー(添字)として持てる配列である．Ruby では連想配列はSmalltalkの用語を借りてDict(辞書)とも呼ばれる．詳細はク ラスDictの項を参照されたい．連想配列を生成する連想配列式は以下の形式で ある． '{' 式 '=>' 式... '}' それぞれの式を評価した結果をキーと値とする連想配列オブジェクトを返す． 要素数が0の連想配列を生成するためには空の連想配列式 '{' '}' を用いる． *** 配列参照，配列代入 配列(連想配列を含む)の要素の参照は以下の形式で行なう． 式1 '[' 式2... ']' この形式は内部的に，式1に"[]"というメッセージを送ると解釈される．この 動作を疑似的なコードで記述すれば以下のようになる． 式1"[]"(式2...) 一方，配列要素の代入は 式1 '[' 式2... ']' '=' 式n という形式で行なわれ， 式1."[]="(式2...) という形式として解釈される． *** 演算子形式 プログラミングの利便のために一部のメソッド呼び出しと制御構造は演算子形 式をとる．Rubyには以下にあげる演算子がある．上のものほど結合順位が強く， 同じ列の演算子の結合順位は同じである． 強 -(unary) +(unary) ! ~ ** * / % + - << >> & | ^ > >= < <= <=> == != =~ !~ && || .. ..． :: =(代入) 自己代入(+=, -=, ..) and 弱 or ほとんどの演算式にはメソッド呼び出しとして解釈される(クラス毎に再定義 できる)が，一部再定義できない特殊なものがある．再定義できない特殊演算 子は &&(論理積), ||(論理和), =(代入), ...(範囲指定), and, or の6つである． 上であげた特殊演算子以外の演算子形式はメソッド呼び出しと見なされる． 単項演算子(+, -, !, ~)は 式1."演算子"() という形式に，それ以外の2項演算子は 式1."演算子"(式2) に解釈される． ** 代入 代入には変数に対する代入(真の代入)と，プログラムを簡単にするためのシン タックスシュガーとしての代入がある．真の代入は以下の形式である． 変数 '=' 式 これは式を評価し，変数の値として代入する．クラスやモジュールや疑似変数 には代入できない．クラスやモジュールの定義を変更するためにはclass文， module文を用いる．代入式は演算子形式をとっているが，メソッドではないの で再定義することはできない． シンタックスシュガーとしての代入式は以下のものがある． 配列要素への代入 式1'[' 式2... ' ]' '=' 式n 式1を評価して得られるオブジェクトに，式2から式nまでを引数として，"[]=" というメソッドを呼び出す． 属性代入 式1 '.' 識別子 '=' 式2 式1を評価して得られるオブジェクトに対して"識別子="というメソッドを，式 2を引数として呼び出す． 自己代入 式1 op= 式2 # 式1は代入可能でなければならない． この形式は内部的に「式1 = 式1 op 式2」と同様に評価される．ただし，式1 は1回しか評価されないので，式1に副作用がある場合は，「式1 = 式1 op 式2」 とは動作が異なる結果となる．opとして使える演算子は +, -, *, /, %, **, &, |, ^, <<, >> の11種類である．演算子と`='の間にスペースを空けてはいけない． *** 条件分岐式 式の値によって分岐する式は以下に示すif式，unless式，case式の複合文型が 3種類と演算子型が3種類ある．Rubyではnilが偽，それ以外が真と評価される． CやPerlなどとは異なり，0や ""(空文字列)は偽とは評価されないので気をつ けること． if式 if 式1 [then] 文1 [elsif 式2 [then] 文2 ]... [else 文n ] end 条件判断式．式1が真の場合に文1を評価する．それ以外の場合は文2を評価す る．Rubyのif式はelse ifでもelifでもなくelsifでifの連続を行なうことに注 意すること． unless式 unless 式1 [then] 文1 [else 文2 ] end 式1が偽(nil)を返すか，式2の評価中に例外が発生した場合に文1を評価する． それ以外の場合は文2を評価する． case式 case 式0 [when 式1 [, 式2]... [then] 文1 ]..． [else 文n ] end 条件分岐，CのswitchよりもPascalのcaseに似ている．breakで脱出することも 後ろの文に継続することもないので注意． 条件の一致は「式n =~ 式0]で行なわれる．つまり， case expr0 when expr1, expr2 stmt1 when expr3, expr4 stmt2 else stmt3 end は以下のif文とほぼ等価である． _tmp = expr0 if expr1 =~ _tmp || expr2 =~ _tmp stmt1 elsif expr3 =~ _tmp || expr4 =~ _tmp stmt2 else stmt3 end 演算子型 式1 '&&' 式2 式1 'and' 式2 式1を評価し，その値が真(nil以外)であれば，式2を評価する．`and'は優先順 位が低い別名である． 式1 '||' 式2 式1 'or 式2 式1を評価し，その値が偽であれば，式2を評価する．`or'は優先順位が低い別 名である． 式1 '...' 式2 式1が真になるまでは偽を返し，その後は式2が真を返すまでは真を返す．式2 が真になれば状態は偽に戻る *** 繰り返し式(単純型) ループを構成する式．これらの式の値は常にnilである．オブジェクトに合わ せたループを行なうためには次に述べるイテレータを用いる． while式 while 式 文 end 条件が真の間，文を繰り返し実行する． until式 until 式 文 end 式1 until 式2 式が偽(nil)を返すか，式の評価中に例外が発生する間，文を繰り返し実行す る． *** 条件式について if，unless，while，untilの条件判断部の式，および特殊演算子`&&', `||', `...'の両辺の式は条件式と呼ばれる．条件式では文字列と正規表現リテラル は式「$_=~リテラル」の省略であるとみなされる．更に演算子`...'の両辺で は整数定数が「$.==定数」の省略と解釈される．条件式に現れる`!'演算子の オペランドも条件式とみなされる． 注意: 演算子`!'は特殊演算子ではないので，再定義を行なう場合に気をつけ ること．条件式の中で ! 文字列リテラル ! 正規表現リテラル の形で呼び出されるメソッドの引数は，リテラルの表すオブジェクトではなく， 上記の比較の結果が与えられる．このため，原則的に`!'メソッドは再定義し ない方が良い． *** イテレータ(繰り返し子) イテレータとは制御構造(特にループ)の抽象化のために用いられるメソッドの 一種である．コードの断片(ブロックと呼ばれる)を指定してイテレータを呼び 出すと，イテレータは適当な値をセットしてブロックを評価する(おそらくは 複数回)．イテレータからのブロックの呼び出しはyield式を用いる(後述)． イテレータの呼び出しは以下の構文で行なわれる． イテレータとは制御構造(特にループ)の抽象化のために用いられるメソッドの 一種である．イテレータの呼び出しは以下の構文で行なわれる． 式 '{' 変数... '|' 文... '}' 「文」をブロックとして設定し，「式」のメソッドをイテレータとして評価す る．「式」のトップレベルのメソッドだけがイテレータとして呼び出され， レシーバを表す式や，引数の式はイテレータとしては呼び出されない．「式」 が複数の式を含む時，各々がイテレータとして順に呼ばれる． イテレータ内でyield文が実行されると，そこで指定された値がdo文で指定さ れた変数に代入され，ブロックが実行される．ブロックの実行が終了するとそ の値は yield文の値として返される．あるメソッドがイテレータとして呼び出 されたかどうかはメソッドiterator_p()の戻り値で知ることができる．中には Enumerableモジュールのgrepメソッドのようにイテレータとして呼ばれた時と 普通のメソッドとして呼ばれた時とで動作が異なるメソッドもある． オブジェクトの各要素に対して操作を行なうための形式も提供されている．形 式は以下の通り． for 変数.. in 式 文 end 式の各要素に対し文を実行する．これは以下の式と等価である． (式).each '{' 変数.. '|' 文 '}' よって式の値のオブジェクトがメソッドeachを持たない場合，forを実行する と例外が発生する． *** イテレータの中でのブロック呼び出し yield '(' [式 [',' 式...]]) yield イテレータの中でブロックの呼び出しを行なう．yieldを実行したメソッドが イテレータとして呼び出されていない時には例外が発生する．yield の値はブ ロックの戻り値である． *** 例外処理 処理中に予期しない事態が発生した時には例外が発生する．Rubyでは例外を途 中で捕捉して，再試行したり，後処理を行なったりすることができる． protect 文1 [resque 文2 ] [ensure 文3] end 文1を実行し，その実行中に例外が発生すればresque節で指定された文2を実行 する．更にensure節が存在する時はprotect文を終了する前に必ず(正常終了時 だけでなく，例外, return, break, continue, redoなどによる脱出でも)文3 を実行する． unless文，until文は条件を評価する時に例外が発生した場合，評価結果が偽 であると見なすので，暗黙の例外処理を行なっていることになる． *** グルーピング 式は括弧によってグルーピングすることができる． '(' 式 ')' 更に括弧を用いて，文(または文の並び)を式にすることもできる． '(' 文 ';' 文... ')' 文の並びの値は最後に評価した式の値である．つまりの値は最後に評価した文 の値になる． ** 文 Rubyプログラムを構成するもう一つの要素は文である．文には単純文，制御文， 宣言文がある．一般に文の値を用いることはないが，式として用いられる場合 もあるので，値を持つ．通常は文の値はnilである． *** 式 式は単純文である． *** 多重代入 同時に複数の変数に代入を行なうことができる．その形式は以下の通りである． 変数 ',' [変数 ',' ...] ['*' 変数]= 式 [, 式...] 右辺の式が一つしかない場合は，その値を配列として(必要ならばto_aメソッ ドで配列に変換して)，要素をそれぞれ変数に代入する．それ以外の場合には， それぞれの式の値が変数に代入される．左辺の変数の数と右辺の要素の数が合 わない時には足りない変数には nilが代入され，余った要素は無視される．多 重代入の最後の要素の前に`*'がある場合，残りの全て引数が配列として代入 される． foo, bar = [1, 2] # foo = 1; bar = 2 foo, bar = 1, 2 # foo = 1; bar = 2 foo, bar = 1 # foo = 1; bar = nil foo, bar, baz = 1, 2 # foo = 1; bar = 2; baz = nil foo, bar = 1, 2, 3 # foo = 1; bar = 2 foo,*bar = 1, 2, 3 # foo = 1; bar = [2, 3] 多重代入は単純文である．その値は(配列に変換された)右辺である． *** 制御文 制御の流れを変更する以下の文がある．これらは単純文である． return文 return [式[',' 式...]] 式の値を戻り値としてメソッドの実行を終了する．式が2つ以上与えられた時 には，それらを要素とする配列をメソッドの戻り値とする．式が一つもない場 合には nil が戻り値となる． ループ制御文 continue redo break 上記3つはループ中で使う． continueはもっとも内側のループの次の繰り返しを始める．redoはループ条件 のチェックを行なわず，現在の繰り返しをやり直す．break はループを脱出す る．Cと違い，breakはもっとも内側のループを脱出する作用だけを持ち，case を抜ける作用は持たない． retry文 retry protect文のresque節で使い，protect文を始めから実行する．例外処理を行なっ てから再試行するのに使う．resque節以外でretryが用いられた場合例外が発 生する． fail文 fail '(' [メッセージ] ')' fail [メッセージ] 例外を発生させる．メッセージが与えられた場合には発生したソースファイル 名，行番号をシステム変数`$@'に，メッセージを`$!'にセットする． yield文 yield 式 [',' 式...] 文としてyieldを用いることもできる．この場合は式を括弧で括る必要はない． *** メソッド呼び出し文 1つ以上の引数を持つメソッド呼び出す場合には曖昧さがなければ，引数を括 弧で括る必要はない．その形式は以下の通りである． 式 '.' メソッド名 引数1 ',' [引数2...]['*' 引数n] メソッド名 引数1 ',' [引数2...]['*' 引数n] super 引数1 ',' [引数2... ]['*' 引数n] 構文解析時に，式のように解釈できる場合は式としての解釈が優先される． foo bar+baz # メソッド呼び出しfoo(bar+baz) foo (bar)+baz # メソッド呼び出しfoo(bar) + bar foo 1 # メソッド呼び出しfoo(1) foo -1 # ローカル変数foo - 1 括弧のないメソッド呼び出し文は単純文である． *** 制御修飾子 単純文に制御修飾子を付加したものは文である(単純文ではない)．修飾子は以 下の4種類である． 単純文 if 式 単純文 unless 式 単純文 while 式 単純文 until 式 条件修飾子(if/unless)の式は先行する文に先だって評価される．動作も対応 する条件分岐式と同様である． 繰り返し修飾子(while/until)はまず先行する文を評価してから条件式を評価 するので，最低一度は文を実行することになる． *** クラス宣言文 クラスを定義する構文は以下の通りである． class クラス名 [':' スーパークラス名 ] 定義実体 end クラス名は任意の識別子である(大文字で始めることを推奨する)．クラス定義 のネストはできないので他の定義文内ではクラスを定義できない． *** モジュール定義文 モジュールを定義する構文は以下の通りである． module クラス名 定義実体 end モジュール名は大文字で始まる識別子である．クラス同様，モジュール定義も ネストできない． *** インクルード文 モジュールをインクルードすることによって，クラスまたはモジュールに機能 を追加できる．モジュールをインクルードした場合，そのモジュール(および そのモジュールが更にインクルードしているモジュール)の全てのメソッドを 受け継ぐ．別のいい方をすればインクルードは限定された多重継承といえる． 他のモジュールをインクルードする構文は以下の通りである． include モジュール名 [',' モジュール名...] 現在の定義中のクラスまたはモジュール(トップレベルではObjectクラス)に指 定したモジュールをインクルードする． *** メソッド定義文 通常(特異メソッドでない)メソッド定義の形式は以下の通りである．通常メソッ ド定義はネストできないので，メソッド定義文中ではメソッド定義文を再び呼 び出せない． def メソッド名 ['(' 引数 [',' 引数...][',' '*'引数 ] ')'] 定義実体 end メソッド名は識別子または文字列である．演算子の再定義をする時には文字列 で指定する．仮引数並びの最後に`*'がある場合，仮引数より多く与えられた 実引数は，最後の引数に配列として与えられる(足りない時にはエラー)． メソッドには関数的メソッドと通常メソッドがある．関数的メソッドは関数形 式でしか呼び出すことができず，よって該当するクラスとそのサブクラスのメ ソッドからしか呼び出すことができない．クラス定義文の外にあるdef文は関 数的メソッドを定義し，クラス定義文の中にあるdef文は通常のメソッドを定 義する．メソッドの可視性はModuleクラスのexport/noexportメソッドを使っ て変更する． ** 特異メソッド定義文 メソッド定義にはもう一つ特異メソッドの定義がある．特異メソッドとはある 特定のオブジェクトに固有のメソッドである．形式は以下の通りである． def 式 '.' メソッド名 ['(' 引数 [',' 引数...][',' '*'引数 ] ')'] 定義実体 end この形式は式の値であるオブジェクトに特異メソッドを定義する．式の値は (ビルトインクラスでない)通常オブジェクトか，クラスまたはモジュールであ る必要がある．通常メソッド定義とは異なり，特異メソッドはメソッド本体内 でもネストして定義することができる． 特異メソッドは通常は継承しえないが，例外としてクラスの特異メソッドはそ のサブクラスにも継承される．言い替えればクラスの特異メソッドは他のオブ ジェクト指向システムにおけるクラスメソッドの働きをする． *** メソッドの別名定義文 以下の形式でメソッドに別名をつけることができる． alias メソッド名1 メソッド名2 別名を付けられたメソッドは，その時点でのメソッド定義を引き継ぎ，元のメ ソッドが再定義されても，古いメソッドが呼び出されたのと全く同じ働きをす る． *** メソッド定義取り消し文 メソッドの定義を取り消すためにはundefを用いる． undef メソッド名 識別子または文字列で指定したメソッドの定義を取り消す． defによる別名定義とundefによる定義取り消しを使うとクラスのインタフェー スをスーパークラスと独立に変更することができる．ただし，メソッドがself にメッセージを送っている場合にはよく注意しないと既存のメソッドが動作し なくなる可能性がある． ------------------------------------------------------- * Rubyの組み込み機能 Rubyプログラミングの基本はクラス，モジュールとそのメソッドの習得である． Rubyには処理系そのものに以下の機能が組み込まれている．ライブラリをロー ドすることによって機能は増えるが，それらに関してはそれぞれのライブラリ のドキュメントを参照してもらいたい． ** 関数 Rubyには厳密な意味では関数はないがKernelクラスの関数メソッドは(全ての 通常クラスから関数形式で呼び出せるので)，関数的に用いられる．関数的に 用いられるメソッドを以下にあげる．これらのメソッドを再定義する際には互 換性を考えて行なうべきである． _exit(status) プログラムの実行を終了する．整数statusを終了ステータスとする． exit()とは違って，例外処理などは一切行なわない．fork()の後，子 プロセスを終了させる時などに用いる． do() ブロックを1度だけ実行するイテレータ．ブロックをまとめるためだ けに存在する．使い方の例: do { foobar() } while (baz()) eof() コマンドラインからの入力がEOFに到達している場合，真を返す． eval(expr) exprとして与えられた文字列をrubyプログラムとして解釈，実行する． exec(command) 現在実行しているプロセスを終了して，command文字列で指定される 別プロセスを起動する． exit([status]) プログラムの実行を終了する．statusとして整数が与えられた場合， その値をRubyコマンドの終了ステータスとする．デフォルトは0． fork() forkシステムコールを実行し，子プロセスを生成する．詳細は fork(2)を参照のこと．親プロセス側では子プロセスのプロセスidを 返し，子プロセス側ではnilを返す．何らかの原因で子プロセスの生 成に失敗した時には例外が発生する． format(format, ...) フォーマットとして与えられた文字列をC言語のsprintfと同じように 解釈し，引数を展開した文字列を返す．メソッドsprintf()の別名． Rubyにおけるformat指定子の拡張についてはsprintf()の項を参照の こと． getc() 標準入力から一文字取り出す．戻り値は読み込んだ文字の文字コード (ASCII)を表すFixnumである． getenv(name) nameに該当する環境変数を取り出す．$ENV[name]と同義． gets() 引数として与えられたファイル(なければ標準入力)で構成される仮想 的なファイル(システム変数`$<'でアクセスできる)から一行読み込ん で，読み込みに成功した時にはその文字列を返す．ファイルの終りに 到達した時にはnilを返す．行の区切りはシステム変数`$/'によって 変更できる．読み込んだ文字列はシステム変数`$_'にもセットされる． gsub(pattern, replace) システム変数`$_'の指す文字列に対して置換を行なう．文字列内で patternにマッチする部分を全てreplaceに置き換える．Stringクラス のgsubメソッドの解説を参照のこと．gsubメソッドは`$_'の値を更新 する． iterator_p() メソッドがイテレータとして呼び出された時に真，そうでない時に偽 を返す述語． kill(signal, pid...) pidで指定されたプロセスにシグナルを送る．シグナルはシグナル番 号か名前で指定する．負の値を持つシグナル(あるいはシグナル名の 前に`-')を与えるとプロセスではなくプロセスグループにシグナルを 送る． load(file) fileをロードする．fileをロードするパスはシステム変数$LOAD_PATH で決定される． open(file[, mode]) fileをオープンして，Fileオブジェクトを返す．ファイル名はオープ ンするファイルを示す．ファイル名が`|'で始まる時には続く文字列 をコマンドとして起動し，パイプラインを生成する． コマンド名が"-"である時，open()はRubyの子プロセスを生成し，そ の子プロセスとのパイプを返す． modeはファイルのアクセスモードを指定する．これは以下のうちのい ずれかの文字列である． r 読み込み専用．openするファイルはあらかじめ存在している 必要がある． r+ 読み書き両用．openするファイルはあらかじめ存在している 必要がある． w 書き込み専用．ファイルが存在していた場合，長さを0にす る．存在していなければ新たにファイルを作成する． w+ 読み書き両用．読み込みが行なえること以外は"w"と同じ働き をする． a 追加書き込み専用．ファイルはあらかじめ存在している必要 がある．書き込みはファイルの最後に追加される． a+ 読み書き両用．ファイルが存在していなければ新たに作成す る．アクセス位置はファイルの最後に初期化される． モードが省略された場合のデフォルトは"r"である． print(arg1, ..., argn) 引数を順に出力する．引数が与えられない時にはレシーバを出力する． 文字列以外のオブジェクトが引数として与えられた場合には，当該オ ブジェクトのto_sメソッドによって文字列に変換してから出力される． システム変数`$;'(出力フィールドセパレータ)にnilでない値がセッ トされている時には，各引数の間にその文字列を出力する．システム 変数`$\'(出力フィールドセパレータ)にnil でない値がセットされて いる時には，最後にそれを出力する． printf([port, ]format, arg1, ..., argn) C言語のprintf()と同じformatに従い引数を文字列に変換し，出力す る．第1引数がIOのサブクラスのインスタンスであった場合はそのオ ブジェクトに対して出力を行なう．デフォルトは$stdoutに出力する． Rubyにおけるformat指定子の拡張についてはsprintf()の項を参照の こと． rand(max) 0からmaxを越えない範囲の整数の乱数を発生する．戻り値はFixnum． require(file) fileをロードする．loadとの動作の違いはrequireはロードしたファ イルのフルパスを変数`$"'に覚えていて，既にロードしたファイルは 再ロードしない点である．実際にロードした時には%TRUE，既にロー ドされている時には%FALSEを返す． select(reads[, writes[, execpts[, timeout]]]) select(2)を実行する．reads/writes/execptsにはIO(またはそのサブ クラス)のインスタンスの配列を与える．timeoutはFixnum / Float / Timeのいずれかで指定する．戻り値はtimeoutが成立した場合には nil，そうでないときは3要素の配列を返し，その各要素が入力/出力/ 例外待ちのオブジェクトを要素として持つ． setenv(name, value) nameで指定される環境変数をvalueにセットする．$ENV[name]=value と同じ働きをする． sleep([sec]) sec秒だけプログラムの実行を停止する．secが省略された場合，プロ セスにSIGALRMが送られない限り，永久にスリープする．実際にスリー プした秒数を返す． sprintf(format, ...) format文字列をC言語のsprintfと同じように解釈し，引数を展開した 文字列を返す．メソッドformat()の別名． format指定子はC言語のsprintf()が受け付けるもの(ただし，Rubyに は unsignedがないので，%uは除く)に加えて, %b, %B, %O, %Xを使う ことができる．%bは数値の2進表示，%B, %O, %Xはそれぞれ2進，8進， 16進数の表示を行なうが，負の数の処理の際に2の補数表現ではなく， その絶対値表記の先頭に`-'をつけたものを表示する． srand([初期値]) 乱数の初期値を設定し，古い初期値を返す．初期値が省略された時に はtime(3)の返す値をデフォルトとする． sub(pattern, replace) システム変数`$_'の指す文字列に対して置換を行なう．文字列内で最 初にpatternにマッチする部分をreplaceに置き換える．subメソッド は`$_'の値を更新する．その他の詳細に関してはStringクラスのsub メソッドの解説を参照のこと． syscall(num, arg...) numで指定された番号のシステムコールを実行する．第2引数以降をシ ステムコールの引数として渡す．引数は文字列または整数でなければ ならない． system(command) コマンドを実行し，その終了ステータスを返す． trap(command, signal...) signalの割り込みがかかった時にcommandを実行する．signalはシグ ナル名かシグナルの番号．commandとして"SIG_IGN"または"IGNORE"を 指定した時にはそのシグナルを無視する(可能ならば)．"SIG_DFL"ま たは"DEFAULT"を指定した時はデフォルトの動作を行なう． wait() 子プロセスが終了するのを待ち，終了した子プロセスのpidを返す． 子プロセスが一つもなければnilを返す． waitpid(pid, flags) 特定の子プロセスの終了を待ち，そのプロセスが終了した時に真を返 す．子プロセスが存在しないか，ノンブロッキングモードで子プロセ スがまだ終了していない時にはnilを返す．waitpid(2)かwait4(2)の 実装されていないマシンではflagsはいつもnilまたは0でなければな らない． ** システム変数 $! エラーメッセージ．failで設定する． $@ エラーが発生した時点のファイル名と行番号が "ファイル:行番号[:メソッド名(あれば)]" の形式で格納される． $& 最後に成功したパターンマッチ $` 最後のパターンマッチでマッチした文字列の前の文字列 $' 最後のパターンマッチでマッチした文字列の後に続く文字列 $+ 最後の検索パターンでマッチした最後の括弧 $1..$9 最後に成功したパターンマッチでn番目の括弧にマッチした 値が格納される．該当する括弧がなければnilが入っている． $~ 最後のマッチに関する情報．これをセットすると$&や$1..$9 の値が変化する． $= この変数の値がnilでない時，パターンマッチや文字列の比 較でアルファベットの大文字小文字を区別しない．デフォル トはnil(区別する)． $/ 入力レコードセパレータ．ファイルや文字列に対してeachを 行なう時の分割文字を指定する．$/に空文字列("")を指定す ると段落単位で入力を行ない，nilを指定すると全体を一度 に読み込む．$/には正規表現は使えない．デフォルトは "\n"． $\ 出力レコードセパレータ．この変数に文字列を指定すると write()やprint()の度に最後にこの文字列を付加して出力す る．デフォルトはnil(なにも追加しない)． $, Array:join()のデフォルトの区切り文字列．print()の各引 数の間に出力される文字列． $; String:split()のデフォルトの区切り文字． $. 最後に読んだ入力ファイルの行番号． $< 引数(なければ標準入力)で構成される仮想ファイル．つまり gets()は$<.gets()と同じ意味である．$<.fileで現在読み込 み中のファイルオブジェクトが，$<.filenameでそのファイ ル名が得られる．(覚え方: `<'はシェルの入力元指定) $> printやprintfのデフォルトの出力先．初期値は$stdout．-i オプションを指定した場合には読み込み元と同じ名前のファ イル．(覚え方: `>'はシェルの出力先指定) $_ 最後にgets()などで読み込んだ文字列． $0 rubyスクリプトの名前．この変数に代入するとps(1)の出力 が変化する． $* rubyスクリプトに与えられた引数．ruby自身に対する引数は 取り除かれている． $$ 現在実行中のrubyプロセスのpid． $? 最後に実行した子プロセスのstatus． $: ファイルをロードする時に検索するディレクトリへのパスを 含む配列．起動時にはデフォルト値(コンパイル時に指定す る)に加えて，環境変数RUBYLIBの値とruby起動時の-Iオプショ ンで指定された値が追加される．(覚え方: コロンは環境変 数PATHの区切り文字である) $" 既にロードされたファイル名を含む配列．require()で同じ ファイルを2回ロードしないために用いられる．(覚え方: prevent files to be doubly quoted(loaded)) $ARGF $<の別名． $ARGV $*の別名． $DEBUG `-d'フラグの状態(真偽値)． $ENV 環境変数にアクセスする連想配列．文字列をキーとして与え ると対応する環境変数の値が得られる．環境変数が存在しな い場合はnilが返る． $FILENAME 仮想ファイル`$<'で現在読み込み中の(メソッドgets()が今 読んでいる)ファイル名．$<.filenameと同じ． $LOAD_PATH $:の別名． $stdin 標準入力 $stdout 標準出力 $stderr 標準エラー出力 $VERBOSE `-v'フラグの状態(真偽値) $VERSION rubyのバージョンを示す文字列 ** システム定数 %TRUE t %FALSE nil それぞれ真偽値を表す．条件判断はnilを偽，それ以外の全ての値を 真として判断するため，%TRUEの値は代表的な真の値という以上の意 味を持たない．よって，あるメソッドの返値が真であるということと， それが%TRUEを返すということは厳密には同じではない(述語的に用い られるメソッドは大抵真の値として%TRUEを返すようにはなっている が)．つまり if some.method() then .. else .. end と if some.method() == %TRUE then .. else .. end は完全には同義ではない．%FALSEに関しては，このような問題は生じ ない． ** クラス/モジュール *** Array(クラス) 数字を添字とした配列のクラスである．生成は一般的には配列式``[...]''で 行なわれる． SuperClass: Object Included Modules: Enumerable Methods: self[nth] self[start..end] self[start, length] 配列の要素にアクセスする．最初の形式では配列のnth番目の要素を 返し，2番目の形式ではstart番目の要素からend番目の要素を含む部 分配列を返す．3番目の形式ではstart番目からlength個の要素を含む 部分配列を返す． self[nth] = val self[start..end] = val self[start, length] = val 配列の要素を変更する．最初の形式では配列のnth番目の要素をvalに 変更する．2番目の形式はstart番目の要素からend番目の要素までを valに変更する．3番目の形式ではstart番目からlength個の要素をval に変更する． 2番目，3番目の形式ではvalは配列でなければならない． 例: ary = [1, 2, 3, 4, 5] ary[0..2] = [0, 0] # 配列の内容は [0, 0, 4, 5] ary[1, 0] = [7] # 配列の内容は [0, 7, 0, 6, 5] self + other 配列の連結．selfとotherの両方の配列の内容を繋げた新しい配列を 返す． self * times 配列の繰り返し． self - other 集合の差演算．selfからotherの要素を取り除いた内容の新しい配列 を返す．重複する要素は1度だけ現れる． self * other 集合の積演算．両方の配列に含まれる要素からなる新しい配列を返す． 重複する要素は1度だけ現れる． self | other 集合の和演算．両方の配列にいずれかに含まれる要素を全て含む新し い配列を返す．重複する要素は1度だけ現れる． self << obj objを配列の末尾に追加する．selfを返すのでC++的に連鎖できる． assoc(key) 連想リスト(CONSペアを要素とする配列)を検索し，第1要素がkeyと等 しい("=="で比較する)配列を返す． clear 配列の大きさを0にする． delete(val) valと一致する要素を削除する． delete_if 要素を削除するイテレータ．ブロックを評価した値が真の時，対応す る要素を配列から削除する． each 配列の各要素を順に与えるイテレータ． fill(val) fill(val, start[, length]) fill(val, start..end) 配列(の指定された部分)の要素の値をvalに設定する．2番めの形式で lengthが省略された時は配列の終りまでの長さをとる．指定された部 分配列が元の配列の範囲を越える時は自動的に拡張される． index(val) valと等しい最初の要素のインデックスを返す．該当する要素が存在 しない場合はnilを返す． indexes(ary) indexes(index-1, ..., index-n) 1番目の形式では整数の配列を引数として受けて，その要素をインデッ クスとする要素を含む配列を返す．2番目の形式では各引数の値をイ ンデックスとする要素を含む配列を返す． join([sep]) 配列の要素を連結した文字列を返す．各要素は文字列に変換され，間 にsepを挟んで連結される．sepが省略された時にはシステム変数`$,' の値が用いられる． length size 配列の長さ(要素数)を返す． push(obj) objを配列の末尾に追加する． pack(template) 配列の内容をtemplate文字列にしたがって，1つの文字列にパックす る．パックした文字列を返す．テンプレートは型指定文字列とその長 さ(省略時は1)を並べたものである．長さとして`*'が指定された時は 「残りのデータ全て」の長さを表す． 型指定文字は以下のものがある． a ASCII文字列(null文字を詰める) A ASCII文字列(スペースを詰める) b ビットストリング(下位ビットから上位ビット) B ビットストリング(上位ビットから下位ビット) h 16進文字列(下位ニブルが先) H 16進文字列(上位ニブルが先) c char C unsigned char s sort S unsigned sort i int I unsigned int l long L unsigned int n ネットワークバイトオーダーのshort N ネットワークバイトオーダーのlong f 単精度浮動小数点数(機種依存) d 倍精度浮動小数点数(機種依存) x ナルバイト X 1バイト後退 @ 絶対位置への移動 pop 配列の末尾の要素を取り除いて，それを返す． rassoc(value) 連想リスト(2要素の配列を要素とする配列)を検索し，第2要素が valueと等しい("=="で比較する)配列を返す． shift 配列の先頭の要素を取り除いて，それを返す． sort 配列の内容をソートする．イテレータとして呼び出された場合はブロッ クを評価した値で要素の大小を決定する．大きい時に正，等しい時に 0，小さき時に負．通常のメソッドとして呼び出された場合は各要素 を`<=>'で比較する． to_a 自分自身を返す．対称性のために用意されているメソッドであまり面 白くない． unshift(obj) objを配列の先頭に追加する． *** Bignum(クラス) 無限多倍長整数のクラス．演算の結果がこのFixnumの範囲内である場合には自 動的にクラスはFixnumに変換される．一般的にRubyプログラムではFixnumと Bignumの変換は暗黙のうちに行われるので，意識する必要は無い．Floatとの 混合に関しては，Bignumより Floatの方がgenericityが高いのにも関わらず， Bignumの方が，大きな値を表現できるので，変換時に桁落ちが生じる可能性が ある． SuperClass: Integer Methods: self + other self - other self * other self / other self % other self ** other 算術演算．それぞれ和，差，積，商，剰余，冪乗を返す． ~ self self | other self & other self ^ other ビット演算．それぞれビット反転，論理和，論理積，排他的論理和を 返す． self << bits self >> bits シフト演算．それぞれbitsビットだけ左右にビットシフトを行なう． divmod(other) 商と剰余の2要素の配列を返す． *** Block(クラス) イテレータに渡される手続きをまとめたオブジェクト．実行するコードだけで なくコンテキスト(ローカル変数)なども保存する． SuperClass: Object Methods: do(arg[, ...]) ブロックを実行する． Single Methods: new 新しいブロックを生成する．yieldを実行できる場所でこのメソッド が呼ばれると，その時点で実行されるべきコードを包み込んだオブジェ クト(Block)を生成する． *** Class(クラス) クラスのクラス．より厳密に説明するとクラスは特異メソッドを継承するため に，それぞれメタクラスと呼ばれる名前のないクラスをクラスとして持ち， Classはそのメタクラスのクラスである(分かったかな?)．が，この解説が理解 できなくても，Rubyを使うことに何の支障もない．クラスには特異メソッドを 定義できる事と，スーパークラスで定義された特異メソッドはそのサブクラス でも有効である事を知れば十分である． SuperClass: Module Private Methods: attr(name[, public]) そのクラスのインスタンスに対してnameで指定される属性を定義する． 詳しくはModuleのattrメソッドの項を参照のこと． Methods: new(...) クラスのインスタンスを生成する．多くの場合このメソッドはサブク ラスの特異メソッドによってオーバーライドされ，クラスによって引 数が異なる． *** Comparable(モジュール) 比較演算を許すクラスのためのMixin．このモジュールをインクルードするこ とによって，`<=>'演算子を定義するだけで他の演算子はその定義を利用して 派生できる． Methods: self == other selfがotherと等しい時真を返す． self > other selfがotherより大きい時真を返す． self >= other selfがotherより大きいか等しい時真を返す． self < other selfがotherより小さい時真を返す． self <= other selfがotherより小さいか等しい時真を返す． between(min, max) selfがminとmaxの範囲内にある時真を返す． *** Cons(クラス) データの組(ペア)を表現するクラス．通常，生成は`::'演算子を用いて行なわ れる．LispのCONSペアと同様にListを構成する形で用いられることもある． Consクラスのメソッド`[]',`[]=',`each'はCONSペアからなるリストに対して も動作するように設計されている． 例: a=1::2::3 a[0] # a[0] => 1 a[2] = 5 # a => 1::5::3 for i in a print i end # prints `153' SuperClass: Object Included Modules: Enumerable Methods: self [nth] CONSペアからなるリストのnth番目の要素を返す．対応する要素が存 在しない場合はnilを返す． self [nth]= val CONSペアからなるリストのnth番目の要素を変更する．リストの長さ がnthで指定した長さよりも短くて，対応する要素が存在しない場合 は例外が発生する．nthがリストの長さと等しい時にはリストの末尾 に要素を追加する． car CONSペアのデータのCAR部を返す． car=(val) CONSペアのCAR部のデータを変更する． cdr CONSペアのデータのCDR部を返す． cdr=(val) CONSペアのCDR部のデータを変更する． copy CONSペアからなるリストの複製を返す(shallow copy)． each CONSペアからなるリストの各要素を与えるイテレータ． *** DBM(クラス) NDBMファイルをアクセスするクラス．キー，データともに文字列でなければな らないという制限と，データがファイルに保存されるという点を除いては Dictクラスと全く同様に扱うことができる．NDBMを備えていないシステムでは このクラスは定義されない． SuperClass: Object Included Modules: Enumerable Methods: self [key] keyをキーとする値を返す． self [key]= value keyをキーとして，valueを格納する．valueとしてnilを指定すると， keyに対する項目の削除となる． clear DBMファイルの中身を空にする． close DBMファイルをクローズする．以後の操作は例外を発生させる． delete(key) keyをキーとする組を削除する． delete_if 要素を削除するイテレータ．key::valueというペアを与えて，ブロッ クを評価した値が真の時，該当する項目を削除する． each each_pair key::valueなるペアを与えるイテレータ． each_key 全てのkeyに対して繰り返すイテレータ． each_value 全てのvalueに対して繰り返すイテレータ． has_key(key) includes(key) keyがデータベース中に存在する時，真を返す has_value(value) valueを値とする組がデータベース中に存在する時，真を 返す indexes(ary) indexes(key-1, ..., key-n) 1番目の形式では文字列の配列を引数として受けて，その要素をキー とする要素を含む配列を返す．2番目の形式では各引数の値をキーと する要素を含む配列を返す. keys データベース中に存在するキー全てを含む配列を返す． length size データベース中の要素の数を返す．(注意:現在の実現では要素数を数 えるためにデータベースを全部検索するので，結構コストが高い．気 をつけて使うこと.) to_a データベース中のkey-valueペアを要素とする配列を返す． values データベース中に存在する値全てを含む配列を返す． Single Methods: open(dbname[, mode]) dbnameで指定したデータベースをモードをmodeに設定してオープンす る．modeの省略値は0666である．modeとしてnilを指定するとデータ ベースが既に存在しない時には新たにオープンせず，nilを返す． *** Dict(クラス) 辞書あるいは連想配列．任意のオブジェクトを添字とできる配列のクラスであ る．Hashという名前でもアクセスできる．連想配列オブジェクトの生成は一般 的には連想配列式``{a=>b,..}'' で行なわれる． SuperClass: Object Included Modules: Enumerable Methods: self [key] keyをキーとする値を返す． self [key]= value keyをキーとして，valueを格納する．valueとしてnilを指定するとそ のkeyに対する項目の削除となる．つまり，Dictは値としてnilを持つ ことはできない． clear 連想配列を空にする． delete(key) keyをキーとする組を削除する． delete_if 要素を削除するイテレータ．key::valueというペアを与えて，ブロッ クを評価した値が真の時，該当する項目を削除する． each each_pair key::valueなるペアを与えるイテレータ． each_key 全てのkeyに対して繰り返すイテレータ． each_value 全てのvalueに対して繰り返すイテレータ． has_key(key) includes(key) keyが辞書中に存在する時，真を返す has_value(value) valueを値とする組が辞書中に存在する時，真を返す indexes(ary) indexes(key-1, ..., key-n) 1番目の形式では配列を引数として受けて，その要素をキーとする要 素を含む配列を返す．2番目の形式では各引数の値をキーとする要素 を含む配列を返す． keys 辞書中に存在するキー全てを含む配列を返す． length size 辞書中の要素の数を返す． to_a 辞書中のkey-valueペアを要素とする配列を返す． values 辞書中に存在する値全てを含む配列を返す． Single Methods: new 新しい(空の)辞書オブジェクトを返す． *** Directory(クラス) ディレクトリ内の要素を順に返すディレクトリストリーム操作のためのクラス． Dirという名前でもアクセスできる． SuperClass: Object Included Modules: Enumerable Methods: close ディレクトリストリームをクローズする．以後の操作は例外を発生さ せる． each ディレクトリ内の各要素を順に与えるイテレータ． getwd pwd カレントディレクトリを返す． rewind ディレクトリストリームを先頭にリセットする． seek(pos) ディレクトリストリームの位置をposに設定する． tell ディレクトリストリームの現在の位置を返す． Single Methods: chdir(path) カレントディレクトリをpathに変更する． chroot(path) プロセスのルートディレクトリを変更する，同名のシステムコールと 同じ働きをする．この操作は実効uidがスーパユーザである時だけに 制限されている．ルートディレクトリを元に戻す(ルートディレクト リを上方に変更する)方法は提供されていない． mkdir(path[, mode]) modeで指定されたモードを持つディレクトリpathを作成する．モード はumaskによって修正される．modeのデフォルト値は0777． open(path) pathに対するディレクトリストリームをオープンする． rmdir(path) pathで指定されたディレクトリを削除する．ディレクトリは空である 必要がある． *** Enumerable(モジュール) 要素に対する繰り返しを行なうクラスのためのMixin．このモジュールをイン クルードするためには，メソッド`each'を定義する必要がある． Methods: collect 各要素に対してブロックを評価した結果を全て含む配列を返す find 要素の対してブロックを評価した値が真になった最初の要素を返す． find_all 各要素に対してブロックを評価した値が真であった要素を全て含む配 列を返す． grep(pattern) 「要素 =~ pattern」が成立する全ての要素を含む配列を返す．イテ レータとして用いられた時は上記の条件の成立した要素に対してブロッ クを実行する． includes(val) valと`=='の関係にある要素を持つ時，真を返す． index(val) valと`=='の関係にあるオブジェクトが何番目に現れたかを返す．一 番最初の要素が0になる．要素が存在しない時にはnilを返す．順序の ないクラスに対してはあまり意味がない． length 要素の数を返す． min 最小の要素を返す．全ての要素がお互いに`<=>'メソッドで比較でき ることを仮定している． max 最大の要素を返す．各要素が`<=>'メソッドで比較できることを仮定 している． reverse 全ての要素を逆順に並べた配列を返す． sort 全ての要素をソートした配列を返す． *** Etc(モジュール) /etcディレクトリ以下の情報を得るためのモジュール．クラスにインクルード して使うこともできる． Methods: Single Methods: getlogin 自分のlogin名を返す．これが失敗した場合はgetpwuid()を用いると 良い． getpwnam(name) /etc/passwdファイル(あるいはDBMファイルやNISデータベース)を検 索し，nameの名前を持つpasswdエントリを返す．戻り値はpasswd構造 体で以下のメンバを持つ． struct passwd name # ユーザ名(文字列) passwd # パスワード(文字列) uid # ユーザID(整数) gid # グループID(整数) gecos # gecosフィールド(文字列) dir # ホームディレクトリ(文字列) shell # ログインシェル(文字列) # 以降のメンバはシステムによっては提供されない． change # パスワード変更時間(整数) quota # クォータ(整数) age # エージ(整数) class # ユーザアクセスクラス(文字列) comment # コメント(文字列) expire # アカウント有効期限(整数) end 詳細はgetpwnam(3)を参照のこと． getpwuid([uid]) uidをユーザIDとするpasswdエントリを返す．戻り値はgetpwnam()と 同様である．引数を省略した場合にはgetuid()の値を用いる．詳細は getpwuid(3)を参照のこと． getgrgid(gid) /etc/groupファイル(あるいは…getpwnam参照)を検索し，gidをグルー プIDとするグループエントリを返す．戻り値はgroup構造体で以下の メンバを持つ． struct group name # グループ名(文字列) passwd # グループのパスワード(文字列) gid # グループID(整数) mem # グループメンバ名の配列 end 詳細はgetgrgid(3)を参照のこと． getgrnam(name) nameという名前のグループエントリを返す．戻り値はgetgrgid()と同 様である．詳細はgetgrnam(3)を参照． group 全てのグループエントリを順にアクセスするためのイテレータ． passwd 全てのpasswdエントリを順にアクセスするためのイテレータ． *** File(クラス) ファイルアクセスのためのクラス．メソッドopen()で生成される．また，この クラスの特異メソッドとしてtestのファイルテスト演算子相当のメソッドが定 義されている(FileTestモジュールのメソッド郡)． SuperClass: IO Methods: atime ファイルの最終アクセス時刻を返す． ctime ファイルの最終ステータス変更時刻を返す． chmod(mode) ファイルのパーミッションを変更する(cf chmod(2))． chown(owner, group) ファイルの所有者とグループを変更する(cf chown(2))．nilか-1を 指定することによって所有者やグループを現在のまま変えないでおく ことができる． eof ファイルの終端に到達した時に真を返す． lstat ファイルに関するStat構造体を返す．lstatはファイルがシンボリッ クリンクであればリンクそのものに関するStat構造体を返す．構造体 の内容についてはstatを参照のこと． mtime ファイルの最終修正時刻を返す． rewind ファイルのファイルポインタの位置を先頭に移動する． path ファイルのパス名を返す． seek(offset, ptrname) ファイルのファイルポインタの位置をoffsetに移動する．ptrnameは 0，1，2のいずれかであって，それぞれファイルの先頭，現在位置， ファイルの終端のうちのいずれかからの相対を示す． stat ファイルに関するStat構造体を返す(Struct を参照)． struct stat dev # ファイルの存在するデバイス ino # ファイルのi-node番号 mode # モード nlink # ハードリンクの数 uid # 所有者のユーザID gid # 所有者のグループID rdev # デバイスのID(スペシャルファイルのみ) size # ファイルサイズ(byte数) blksize # ファイルシステムにおいて適切なブロックサイズ blocks # ブロック数 atime # 最終アクセス時間 mtime # 最終更新時間 ctime # 最終状態変更時間 end 詳細な説明はfstat(2)を参照のこと．システム上で定義されている stat構造体に該当するメンバがない場合は0が設定されている． tell ファイルの現在のファイルポインタの位置を返す． truncate(length) ファイルを切り捨てて最大lengthバイトにする．ファイルはwriteモー ドでオープンされていなければならない． Single Methods: atime(filename) filenameの最終アクセス時刻を返す． ctime(filename) filenameの最終ステータス変更時刻を返す． chmod(mode, path, file...) ファイルのパーミッションを変更する(cf chmod(2))．変更したファ イル数を返す．fileにはワイルドカードも許す． chown(owner, group, file...) ファイルの所有者とグループを変更する(cf chown(2))．nilか-1を指 定することによって所有者やグループを現在のまま変えないでおくこ とができる．変更したファイル数を返す．fileにはワイルドカードも 許す． link(old, new) oldへのハードリンクnewを生成する．link(2)と同じ制限がある． mtime(filename) filenameの最終修正時刻を返す． readlink(path) シンボリックリンクpathの内容を文字列として返す． rename(from, to) ファイル名fromをtoに変更する．rename(2)参照．既にtoという名前 のファイルが存在する時にはまずそのファイルが削除される． stat(filename) filenameのファイルのStat構造体を返す． symlink(old, new) oldへのシンボリックリンクnewを生成する． truncate(path, length) pathで指定されたファイルを切り捨てて最大lengthバイトにする． type(filename) filenameのファイルのタイプを表す文字列を返す．文字列は"file"， "directory"，"characterSpecial"，"blockSpecial"，"fifo"， "link"，"socket"のうちのいずれか一つである． unlink(file...) ファイルを削除する．ディレクトリの削除にはDir.rmdirを使うこと． fileにはワイルドカードも許す． utime(atime, mtime, file...) ファイルのアクセス時刻をatimeに，修正時刻をmtimeに設定する． atime，mtimeは数またはTimeクラスのインスタンスでなければならな い．fileにはワイルドカードも許す． これ以外にFileTestモジュールのメソッドも特異メソッドとして持つ． *** FileTest(モジュール) ファイルテスト用メソッドを集めたモジュール．インクルードして用いること もできる． Methods: Single Methods: b(filename) filenameのファイルがブロックスペシャルファイルである時，真を返 す． c(filename) filenameのファイルがキャラクタスペシャルファイルである時，真を 返す． executable(filename) x(filename) filenameのファイルが実行可能の時，真を返す． exists(filename) e(filename) a(filename) filenameのファイルが存在する時，真を返す． G(filename) filenameのファイルのgidが実効グループのgidと同じ時，真を返す． isdirectory(filename) d(filename) filenameがディレクトリの時，真を返す． isfile(filename) f(filename) filenameのファイルが通常ファイルの時，真を返す． islink(filename) l(filename) filenameのファイルがシンボリックリンクである時，真を返す． ispipe(filename) p(filename) filenameのファイルが名前つきパイプ(FIFO)である時，真を返す． issocket(filename) S(filename) filenameのファイルがソケットである時，真を返す． owned(filename) O(filename) filenameのファイルを実効ユーザが所有している時，真を返す． readable(filename) r(filename) filenameのファイルを読みとり可能の時，真を返す． R(filename) filenameのファイルを実uid/gidで読みとり可能の時，真を返す． setuid(filename) u(filename) filenameのファイルのsetuidビットがセットされている時，真を返す． setuid(filename) g(filename) filenameのファイルのsetuidビットがセットされている時，真を返す． size(filename) s(filename) filenameのファイルが存在する時，ファイルの大きさを返す．存在し ない時はnilを返す． sticky(filename) g(filename) filenameのファイルのstickyビットがセットされている時，真を返す． writable(filename) w(filename) filenameのファイルが実uid/gidで書き込み可能の時，真を返す． W(filename) filenameのファイルが書き込み可能の時，真を返す． z(filename) filenameのファイルが存在し，大きさが0である時，真を返す． *** Fixnum(クラス) 31bit(マシンのlongの長さ-1 bit)整数のクラス．builtin classである．この クラスはpointer内の即値であるためcall by valueで呼び出される点が特徴的 である(他のクラスはcall by reference)．演算の結果が31bitを越える場合に は自動的にBignum(無限多倍長整数)に拡張される． イテレータupto()，downto()，step()は繰り返しのために用いられ，一般に Rangeクラスを用いるより高速である． SuperClass: Integer Methods: self + other self - other self * other self / other self % other self ** other 算術演算．それぞれ和，差，積，商，剰余，冪乗を返す． ~ self self | other self & other self ^ other ビット演算．それぞれビット反転，論理和，論理積，排他的論理和を 返す． self << bits self >> bits シフト演算．それぞれbitsビットだけ左右にビットシフトを行なう． self .. max 範囲指定．self から maxまでの範囲オブジェクトを返す． downto(min) イテレータ．selfからminまで下向きに繰り返す． id2name 整数値をIDだとみなして，相当する文字列を返す．相当する文字列が 存在しない場合はnilを返す． step(max, step) イテレータ．selfからmaxまでstepずつ変化しながら，繰り返す． to_f selfをFloatに変換したものを返す． to_i selfをそのまま返す． upto(max) イテレータ．selfからmaxまで繰り返す． *** Float(クラス) 浮動小数点数のクラス． SuperClass: Numeric Methods: self + other self - other self * other self / other self % other self ** other 算術演算．それぞれ和，差，積，商，剰余，冪乗を返す． self == other self > other 比較演算． coerce(num) numをfloatに変換する．ただし現時点でFloatが理解できる他の数は FixnumとBignumだけである． to_f selfをそのまま返す． to_i selfを整数に変換した結果を返す． Single Methods: new(float) floatと同じ値を持つ新しいFloatオブジェクトを返す． *** GC(モジュール) Ruby組み込みのgarbage collectorの制御を行なうためのモジュール．このモ ジュールのメソッドをを用いることによって，一時的にGCを止めたり，GCの起 きるタイミングを制御したりできる． Methods: garbage_collect GCを開始する．「GC.start」と同義． Single Methods: disable GCを禁止する． enable GCを許可する． start GCを開始する． *** Glob(クラス) ワイルドカードのクラス．ワイルドカードのリテラルは<...>という形式であ る．正規表現とほぼ同じように使えるが，こちらは機能が少ない．ただし，ワ イルドカードの展開機能がある． SuperClass: Object Included Modules: Enumerable Methods: self =~ string ワイルドカードが文字列にマッチした場合には真を，しない場合は nilを返す． each ワイルドカードにマッチするファイル名を与えるイテレータ． Single Methods: new(string) 文字列をワイルドカードに変換したオブジェクトを返す． *** Integer(クラス) 整数クラス．実際はその大きさによってFixnumとBignumいう二つのサブクラス で実現されている．Integerはそれらのスーパークラスとなる抽象クラスであ る．Rubyではほとんどの場合，FixnumとBignumの区別は必要なく，相互の変換 は自動的に行なわれる．整数をビット列だとみなす場合には，無限の長さをも つビット列と考えて構わない． SuperClass: Numeric Methods: self[idx] 整数のidxビット目がセットされていれば1，セットされていなければ 0を返す． chr その数をコードとする文字だけを含む1文字の文字列を返す．一般に 長さ1以上の文字列について，次の関係が常に成立する． str[0].chr == str[0,1] 整数が文字の範囲内(0..255)になければ例外が発生する． is_integer いつも真を返す． *** IO(クラス) 入出力のための基本クラス． SuperClass: Object Included Modules: Enumerable Methods: self << object objectを出力する．objectが文字列でない時にはメソッドto_sを用い て文字列に変換する．selfを戻り値とするので，C++のような`<<'の 連鎖を使える． 例: $stdout << 1 << " is a " << Fixnum << "\n" close 入出力ポートをクローズする．以後のこのオブジェクトに対する入出 力操作はエラーになる． each 一行ずつ読み込んでくるためのイテレータ．行の区切りはシステム変 数`$/'によって変更できる．読み込んだ文字列はシステム変数`$_'に もセットされる． each_byte() 一文字ずつ読み込んでくるためのイテレータ．文字は文字コードを表 すFixnumである． fileno to_i IOオブジェクトが使っているファイルディスクリプタ(Fixnum)を返す． flush バッファをフラッシュする． getc 一行読み込んで，読み込みに成功した時にはその文字列を返す．ファ イルの終りに到達した時にはnilを返す．カーネルメソッドgetc()は $stdin.getcと同じ意味である． gets 一行読み込んで，読み込みに成功した時にはその文字列を返す．ファ イルの終りに到達した時にはnilを返す． isatty 入出力ポートがttyである時，真を返す． puts(obj) objを出力する．「self << obj」と同じ意味である． read([length]) lengthバイト読み込んで，その文字列を返す．lengthが省略された時 には，全てのデータを読み込む． readlines ファイルを全て読み込んで各行を要素としてもつ配列を返す． sync 現在の出力同期モードを真偽値で返す．同期モードが真の時は出力関 数の呼出毎にバッファがフラッシュされる． sync=(newstate) 出力同期モードを設定する． sysread(length) stdioを経由せずにread(2)を用いて入力を行なう．入力されたデータ を含む文字列を返す．ファイルの終りに到達した時にはnilを返す． read(2)の性質により必ずlengthバイトの文字列が読み込まれるわけ ではない．gets()やgetc()などstdioを経由するメソッドと混用する ことはバッファリングの不整合などで思わぬ動作をすることがある． syswrite(str) stdioを経由せずに，write(2)を用いて出力を行なう．このメソッド はバッファリングなどstdioがしてくれることは一切行なわない． syswriteは実際に書き込んだバイト数を返す．print()やprintf()と syswrite()を混用するのは推奨できない． write(str) strを出力する．出力したバイト数を返す． *** Kernel(クラス) 全てのクラスの基底クラス．Ruby組み込みの全ての関数メソッドはこのクラス で定義されている．関数メソッドについては「関数」の項目を参照のこと． SuperClass: なし Methods: ! self 否定．Non-nilのオブジェクトの場合常に偽(nil)を返す．このメソッ ドはNilクラスでは再定義され真を返す． self == other equal(other) オブジェクトの一致判定．レシーバと引数の引数が一致する時，真を 返す．Kernelクラスの定義では双方のオブジェクトが同一の時真を返 す．"=="メソッドは各オブジェクトの性質に応じて再定義する必要が ある．"=="メソッドを再定義した時には，hashメソッドもそれに合わ せて再定義する必要がある． equal()メソッドは"=="メソッドの別名で，"=="を再定義した後でも オブジェクトの同一性判定を行なうために用いられる．よって equal()メソッドはサブクラスで再定義するべきではない． self != other "=="の否定．内部で"=="メソッドを呼び出しているので，こちらは再 定義する必要はない． self =~ other マッチ．デフォルトの動作は"=="と同じである．"=~"はcaseの比較に も用いられる． !~ "=~"の否定．内部で"=~"メソッドを呼び出しているので，こちらは再 定義する必要はない． self :: other selfとotherを要素とするCONSペアを返す．この演算子は右結合であ るので，a::b::c は (a::(b::c)) と解釈される． is_nil オブジェクトがnilであるかどうか．Kernelクラスの定義では真を返 す．Nilクラスで再定義されている． id 各オブジェクトに対して一意のFixnumを返す．が，Fixnumは自分自身を返 すので，idが一致しても同じオブジェクトであることは保証されない． つまり， obj1.id == obj2.id が成立しても，どちらかがFixnumであれば，obj1とobj2が同じである とは限らない．ただし，両方がFixnumでないことが保証できれば，2 つのオブジェクトが同一であることは確実である． hash オブジェクトのハッシュ値(Fixnum)を返す．Dictクラスでキーとなる オブジェクトを格納するのに用いられている.「A == B」が成立する 時は必ず「A.hash == B.hash」が成立する必要があるので，"=="を再 定義した時には必ずこちらもそれに合わせて再定義すること． *** Math(モジュール) 浮動小数点演算をサポートするクラス．Mathモジュールは同じ定義のメソッド と特異メソッドとの両方が定義されているので，特異メソッドを呼び出して使 う使い方と，クラスにインクルードして使う使い方との両方ができる． 例: pi = Math.atan2(1, 1) * 4; include Math pi2 = atan2(1, 1) Methods: Single Methods: atan2(x, y) π〜-πの範囲でX/Yのアークタンジェントを返す． cos(x) sin(x) tan(x) ラジアンで表されたxの三角関数の値を返す． exp(x) xの指数関数の値を返す． log(x) xの自然対数を返す． log10(x) xの常用対数を返す． sqrt(x) xの平方根を返す．xの値が負である時には例外を発生させる． cbrt(x) xの立方根を返す． *** Module(クラス) モジュールのクラス． SuperClass: Object Private Methods: attr(name[, public]) そのモジュールをインクルードしたクラスのインスタンスに対して nameで指定される属性を付加し，属性に対するアクセスメソッドを定 義する．attr("attr")はクラス定義に以下に示すコードを追加するの とほぼ同義である． def attr; @attr; end 省略可能な第2引数publicが与えられて，かつその値がnilでない時に はその属性には属性設定メソッドも用意され，外部から代入可能にな る．attr("attr", %TRUE)はクラス定義に以下のコードを追加するの とほぼ同義である． def attr; @attr; end def attr=(val); @attr = val; end 属性を構成するメソッドを再定義することによって，アクセス時の動 作を変更できる．例えば attr("test", %TRUE) def test=(val) print("test was ", @test, "\n") print("and now is ", @test = val, "\n") end のように設定時に属性の値を表示するようなことが可能である．attr はアクセスメソッドがすでに定義されている場合は，デフォルトのア クセスメソッドを定義しない． Methods: export(name[, name..]) nameで指定されたメソッドを通常形式で呼び出し可能にする．すでに 通常メソッドである場合には何もしない． to_s モジュールの文字列表現を返す．モジュールの場合の文字列表現はモ ジュール名である． unexport(name[, name..]) nameで指定されたメソッドを関数形式でだけ呼び出し可能にする．す でに関数メソッドである場合には何もしない． *** Nil(クラス) 偽を表すオブジェクトnilのクラス．偽変数(の値)nilはNilクラスの唯一のイ ンスタンスである． SuperClass: Kernel Methods: self + other otherが整数，浮動小数点数，文字列，配列である時，otherを返す． ! self 常に真を返す． is_nil 常に真を返す． *** Numeric(クラス) 数一般の性質を表す抽象クラス． SuperClass: Object Included Modules: Comparable Methods: + self オブジェクトselfそのものを返す - self 「0 - self」の値を返す．サブクラスでより効率的に再定義されるこ とが期待される． abs 絶対値を返す． divmod(other) 商と剰余のペアを返す． next 次の数を返す．次の数とはその数を越える最小の整数である． *** Object(クラス) 全ての通常クラスのスーパクラス．通常クラスのインスタンスの一般的な振舞 いを定義している．このクラスのサブクラスでないクラスはKernelとNilと， 組み込み関数を定義しているBuiltinだけである． SuperClass: Builtin Methods: is_member_of(class) オブジェクトselfがクラスclassのインスタンスである時，真を返す． is_kind_of(class) オブジェクトselfがクラスclassかそのサブクラスのインスタンスで ある時，真を返す． clone オブジェクトの複製を作る．インスタンスが即値であるFixnumクラス 以外のクラスの場合，「obj.equal(obj.clone)」は偽であるが，多く の場合「obj == obj.clone」は真である． to_s オブジェクトの文字列表現を返す．このメソッドは内部的にprint() やformat()メソッドで用いられている． to_a オブジェクトを配列に変換する．カーネルクラスで定義されているデ フォルトは，そのオブジェクト自身を含む1要素の配列を返す． *** Process(モジュール) プロセスに関する操作を行なうためのモジュール．Mathモジュールと同様に全 てのメソッドは特異メソッドとしても通常のメソッドとしても使える． Processはプロセスオブジェクトのクラスではなくて，プロセス操作のメソッ ドをまとめたものであることに注意すること． Methods: Single Methods: egid プロセスの現在の実効GIDを返す． egid=(gid) プロセスの現在の実効GIDをgidにセットする． euid プロセスの現在の実効UIDを返す． euid=(uid) プロセスの現在の実効UIDをuidにセットする． getpgrp([pid]) pidで指定されたプロセスが現在所属しているプロセスグループのid を返す．pidを省略した時とpidに0を与えた時は現在実行しているプ ロセスを対象にする． getpriority(which, who) whichとwhoで指定されるプロセス，プロセスグループ，ユーザの現在 の優先順位を返す．詳細はgetpriority(2)を参照．Processモジュー ルではwhichとして指定できる定数%PRIO_PROCESS，%PRIO_PGRP， %PRIO_USERが定義されている． gid プロセスの現在の実GIDを返す． gid= プロセスの現在の実GIDをgidにセットする. pid プロセスのプロセスIDを返す．これはシステム変数`$$'の値と同じで ある． ppid 親プロセスのプロセスのプロセスIDを返す．UNIXでは直接の親プロセ スが終了した場合，親プロセスのpidは1(initのpid)になる． setpgrp(pid, pgrp) pidで指定されたプロセスのプロセスグループをpgrpにする．pidに0 を与えると現在実行中のプロセスを対象にする． setpriority(which, who, prio) whichとwhoで指定されるプロセス，プロセスグループ，ユーザの現在 の優先順位をprioに設定する．詳細はsetpriority(2)を参照のこと． uid プロセスの現在の実UIDを返す． uid= プロセスの現在の実UIDをuidにセットする. *** Range(クラス) 範囲オブジェクトのクラス．範囲オブジェクトは`..'演算子によって生成され， 一般的には以下のような使い方をする for i in 1..5 ... end しかし，この場合は以下の方が速い. do 1.upto(5) ... end 範囲オブジェクトを生成する`..'演算子の両辺はComparableを含むクラスのイ ンスタンスであれば何でも構わない．範囲は始点と終点を含むことに注意する こと. SuperClass: Object Included Modules: Enumerable Methods: self =~ other selfがotherと同じクラスに対する範囲オブジェクトで，その範囲内 にotherがある時(start <= other <= end)，真を返す．これはcase文 で範囲指定する時に便利である．例えば case i when 1, 3..5 ... end case のようなコードを書くことができる． each 範囲内に存在するオブジェクトを与えるイテレータ．主にfor文のた めに用いられる． end 範囲の終点を返す start 範囲の始点を返す． *** Socket(クラス) SuperClass: BasicSocket ソケットそのものに対するシステムコールレベルのアクセスを提供するクラス． Perlのソケットに対するアクセスと同レベルの機能を提供している．このクラ スではソケットアドレスはpackされた文字列で，指定する．UDPソケットはこ のクラスを使って利用する． Methods: accept 新しい接続を受け付けて，新しい接続に対するソケットとアドレスの ペアを返す．accept(2)を参照． bind(addr) bind(2)と同じ働きをする．addrはpackされたソケットアドレス構造 体である． connect(addr) connect(2)と同じ働きをする．addrはpackされたソケットアドレス構 造体である． listen(backlog) listen(2)と同じ働きをする． recv(len[, flags]) ソケットからデータを受け取り，文字列として返す．lenは受け取る 最大の長さを指定する．flagsについてはrecv(2)を参照．flagsのデ フォルト値は0である． recvfrom(len[, flags]) recvと同様にソケットからデータを受け取るが，戻り値は文字列と相 手ソケットのアドレスのペアである．引数についてはrecvと同様． send(mesg, flags[, to]) ソケットを介してデータを送る．flagsに関してはsend(2)を参照の事． connectしていないソケットに対しては送り先であるtoを指定する必 要がある．実際に送ったデータの長さを返す． Single Methods: open(domain, type, protocol) new(domain, type, protocol) 新しいソケットを生成する．domain，type，protocolはインクルード ファイルで定義されている定数値で指定する．domainとtypeに関して は，文字列で指定できるが，すべてをカバーしている保証はない． socketpair(domain, type, protocol) ソケットのペアを返す．引数の指定は openと同じである． *** Regexp(クラス) 正規表現のクラス．正規表現のリテラルは/.../という形式で表すが，動的に 生成するためには Regexp.new(文字列) とする．ただし，Stringクラスの`=~'を始めとして多くのメソッドは正規表現 の替わりに文字列が与えられた時には内部的に正規表現を生成するので，生成 コストを節約したいと思う時や，正規表現の大文字小文字の区別を明示的に指 定したい時など以外は明示的に生成したいと思うことは少ないはずだ． SuperClass: Object Methods: self =~ string 正規表現が文字列にマッチした場合，マッチした位置を返す．マッチ しない場合はnilを返す． ~ self 「$_ =~ self」と同義． Single Methods: complie(string[, casefold]) new(string[, casefold]) 文字列を正規表現に変換したオブジェクトを返す．省略可能な第2引 数が与えられた時には，生成される正規表現オブジェクトはシステム 変数`$='の値に関わらず，真の時は大文字小文字を無視し，偽の時は 区別する．設定されない場合はマッチを行なった時点のシステム変数 `$='の値によって区別するかしないかが決定される． *** BasicSocket(クラス) ソケットを表す抽象クラス．具体的なソケット操作はサブクラスで定義される． 例えばインターネットドメインの場合はTCPsocketを用いる． SuperClass: IO Methods: getopt(level, optname) ソケットのオプションを取得する．getsockopt(2)を参照のこと．取 得したオプションの内容を含む文字列を返す． getpeername 接続の相手先のソケットの情報を得る．パックされたsockaddr構造体 をベタにダンプした文字列が返される．getpeername(2)を参照のこと． getsockname ソケットの情報を得る．パックされたsockaddr構造体をベタにダンプ した文字列が返される．getsockname(2)を参照のこと． setopt(level, optname, optval) ソケットのオプションを設定する．setsockopt(2)を参照のこと． shutdown(how) ソケットの以降の接続を終了させる．howが0である時，以降の受信が， howが1である時は，以降の送信が拒否される．howが2の時には，それ 以降の送信，受信ともに拒否される．shutdown(2)を参照． *** String(クラス) 文字列クラス．Rubyの文字列はヌルターミネートではないので，バイナリデー タも扱える．従ってどちらかというと単なる文字列というよりバイト列である． その思想に基づいて，正規表現に関するメソッド以外は2byte系の文字を意識 していない．これは作者の手抜きではなく意図的にそうしているのである(信 じてくれ)． SuperClass: Object Included Modules: Comparable, Enumerable Methods: self + other 文字列の連結．連結された文字列を返す． self * times 文字列の繰り返し．例えば "x" * 4 == "xxxx" である． self == other self > other 文字列の比較．システム変数$=がnilでない時には大文字小文字を区 別せずに比較を行なう． self =~ other 文字列のマッチ．otherは正規表現か文字列．otherが文字列の場合に は動的に正規表現に変換される．マッチした場合はマッチした位置， しなかった場合はnilが返る． ~ self 「$_ =~ self」と同義． self[nth] self[beg..end] self[beg,len] 内容の取り出し．1番目の形式ではnthバイト目のデータをFixnumとし て返す．2番目の形式ではbegバイト目からendバイト目までの部分文 字列を返す(両端を含む)．3番目の形式ではbegバイト目からlenバイ ト分の部分文字列を返す． self[nth] = val self[beg..end] = val self[beg,len] = val 内容の更新．1番目の形式ではnthバイト目のデータをval (整数)に変 更する．2番目の形式はbegバイト目からendバイト目までの部分文字 列をvalとして与えられた文字列で置き換える．3番目の形式はbegバ イト目からlenバイト分の部分文字列をvalとして与えられた文字列で 置き換える． capitalize 文字列中の最初の文字を(それがアルファベットであれば)，大文字に 変換し，残る文字列中のアルファベットを小文字に置き換える． chop 文字列の最後のバイトを切り落とす．元の文字列を変更することに注 意すること． crypt(salt) crypt(3)を用いて暗号化した文字列を返す．saltは2バイト以上の長 さの任意の文字列である． delete(str) 文字列のうち，strに含まれる文字を削除する．文字列の指定はtrと 同様であり，a-bでaからbまでの範囲を，先頭の^で文字列の否定(含 まれてないものを指定)を意味する．元の文字列を変更することに注 意すること． downcase 文字列中のアルファベットを全て小文字に置き換えた文字列を返す． each 文字列から1行ずつ読み込んでくるイテレータ． each_byte 文字列のそれぞれのバイトについて繰り返すイテレータ． gsub(pattern, replace) 文字列中でpatternにマッチする部分を全てreplaceに置き換える． 置換文字列replace中の&と\0はマッチした文字列に，\1..\9はn番目 の括弧の内容に置き換えられる． hex 文字列を16進数を表す文字列と解釈して，整数に変換する． index(substr[, pos]) substrが最初に出現する位置を返す．posを与えるとその位置から検 索を開始する．見つからない時にはnilを返す． intern 文字列に一意に対応する整数を返す．文字列はナル文字を含んではな らない． length size 文字列の長さ(バイト数)を返す． ljust(width) rjust(width) center(width) 文字列をそれぞれ，右詰め，左詰め，真中寄せした幅widthの文字列 を返す．文字列長がwidthより長い場合は元の文字列を返し，切り詰 めない． next selfからendまで「次の」文字列を返す．次の文字列とは数字は数字 として，英文字は英文字として増加し，桁上がりの処理が行なわれた ものである． "aa".next => "ab" "99".next => "100" "a9".next => "b0" oct 文字列を8進数を表す文字列と解釈して，整数に変換する．8進数の 定義は/[0-7]+/であり，文字列の先頭からこのパターンにマッチする 部分を整数に変換する．この定義に全く当てはまらない文字列に対し ては0を返す．perlとは違って文字列が0xから始まっているからといっ て 16進数だと見なしてくれたりはしない．それらは先頭の0が8進数 と認識され，0を返す． reverse 文字列の各バイトを逆順に並べた文字列を返す．文字列が2バイトで 構成される文字を含んでいてもお構いなしにバイト単位で反転する． splitは2バイト文字を理解するので，2バイト文字を含む文字列を文 字単位に反転するには "全角文字列".split(//).reverse.join("") とすればよい． rindex(substr[, pos]) 文字列substrが最後に出現する位置を返す．posを与えるとその位置 で検索を終了する．見つからない時にはnilを返す．indexとの相違点 は1)文字列の末尾から検索する．2)substrとして正規表現を受け付け ない．の2点である． split([sep[, limit]]) 文字列をsepで指定されたパターンによって，フィールドに分割する． sepが省略された時のデフォルトはシステム変数`$;'の値が用いられ る．limitが指定された時には最大limit個のフィールドに分割する． split()は分割された文字列を含む配列を返す．sepで指定されたパター ンが空文字列とマッチする場合は文字列が1文字ずつに分割される． squeeze([str]) 文字列のうち，strに含まれる文字が連続していた場合，一文字に圧 縮する．strが省略された場合，すべての文字を対象とする．文字列 の指定はtrと同様であり，`a-b'でaからbまでの範囲を，先頭の`^'で 文字列の否定(含まれてないものを指定)を意味する．元の文字列を変 更することに注意すること． strip 文字列の前後の空白を取り除く． sub(pattern, replace) 文字列中でpatternにマッチする部分をreplaceに置き換える．置換文 字列replace中の&と\0はマッチした文字列に，\1..\9は n番目の括弧 の内容に置き換えられる．sub()はgsub()と異なり，最初のマッチだ けを置換する． sum([bits]) 文字列のbitsビットのチェックサムを得る．省略値は16である．ruby では以下のコードでSystem Vの`sum'プログラムと同じ値を得られる． while gets() sum += $_.sum end sum %= 65536 swapcase 文字列中のアルファベットのうち大文字を小文字に，小文字を大文字 に置き換える． to_f 文字列をFloatに変換する． to_i 文字列を10進数を表す文字列と解釈して，整数に変換する． toupper 文字列中のアルファベットを全て大文字に置き換えた文字列を返す． tr("a-z", "A-Z")より少し速い． tolower 文字列中のアルファベットを全て小文字に置き換えた文字列を返す． tr("A-Z", "a-z")より少し速い． tr(search, replace) 文字列の中にsearch文字列に含まれる文字が存在すれば，replace文 字列の対応する文字で置き換える．replace文字列が省略された場合 は空文字列が与えられたと見なす．replace文字列がsearch文字列よ りも短い時はreplace文字列の最後の文字が繰り返されていると見な す．search文字列の方が短い時には対応する文字のないreplace部は 単に無視される(BSDのtrの動作)． search文字列，replace文字列中に`a-b'という形式が現れた場合，そ のaからbまでの範囲の文字をASCIIの昇順で指定したことになる．ま た，search文字列の最初の文字が`^'である場合，続く文字列に*含ま れない*文字列が置換の対象になる． tr(1)の機能のうち，文字を削除する機能，連続する文字を圧縮する 機能は別のメソッドに分割されている．それらの機能については delete，squeezeを参照のこと． 簡便のため，str.tr(src,repl).squeeze(repl)に相当するメソッド tr_s(src,repl) が提供されている． unpack(template) 文字列をtemplate文字列にしたがってアンパックし，それらの要素を 含む配列を返す．template文字列はArrayクラスのpackメソッドとほ ぼ同様である． a ASCII文字列(後続するnull文字やスペースを残す) A ASCII文字列(後続するnull文字やスペースを削除) b ビットストリング(下位ビットから上位ビット) B ビットストリング(上位ビットから下位ビット) h 16進文字列(下位ニブルが先) H 16進文字列(上位ニブルが先) c char C unsigned char s sort S unsigned sort i int I unsigned int l long L unsigned int n ネットワークバイトオーダーのshort N ネットワークバイトオーダーのlong f 単精度浮動小数点数(機種依存) d 倍精度浮動小数点数(機種依存) x 1バイト読み飛ばす X 1バイト後退 @ 絶対位置への移動 rubyのunpackはperlと違ってチェックサムの計算機能がないことに注 意すること． upcase 文字列中のアルファベットを全て大文字に置き換えた文字列を返す． upto(end) selfから始まって，endまで「次の」文字列を順に与えるイテレータ． 次の文字列とはstr.nextで与えられる文字列である． このメソッドはRange:eachで用いられているので，以下のような処理 が可能である． for i in "a" .. "ba" print(i, "\n"); end これはa, b, c, .. aa, .. az, baまでを各行に出力する． 気を付けなければいけないのは，この終了判定は大小関係ではなく `=='で判定されているため，`..'演算子の左辺の値に続く文字列に右 辺の文字列が含まれていない，以下の例のような場合は無限ループに 陥ってしまう． for i in "0" .. "1a" print(i, "\n"); end 作者はこう書くことによって責任を逃れてようとしていると考える人 もいるかもしれない．その推測は正しい． Single Methods: new(string) stringと同じ内容を持つ新しい文字列を返す． *** Struct(クラス) 構造体クラス．複数のデータをまとめる時に用いられる(例: Time::times)． データをまとめる時には配列クラスが用いられることもあるが(例: select)， 構造体を使うべき時は以下のような場合である． (1) 要素の数が固定 要素の数が変動するものは構造体を使うのには向かない． (2) 要素の数が多い 人間が一度に容易に扱える概念の数は7つまでであるという仮説がある． この仮説に従えば，要素が4つ以上あるデータの場合は配列を用いた場 合，要素数*2(つまりオフセットとその意味)が7を越える．よって，そ のような場合には構造体を使った方が理解しやすいと思われる． (3) 同時に大量に生成されない 構造体は配列よりも若干生成コストが高いので，速度が問題になる場合 (例えば同時に大量に生成される場合など)は構造体の使用が適切でない 可能性がある． 各構造体にはメンバ名と同名の引数のないメソッドが定義される． 本ドキュメント内で，構造体を表現するためには以下の形式を使う． struct 構造体名 メンバ ..． end しかし，プログラム中でこの形式で構造体を生成するわけではない． SuperClass: Object Included Modules: Enumerable Methods: self[idx] idxが数の時はidx番目の要素を返す．idxが文字列の時はidxと同じ名 前のメンバの要素を返す． values 構造体のメンバの値を要素に持つ配列を返す．例えば以下のコードで 自分のpasswdエントリを出力することができる． print(Etc.getpwuid().values.join(":"), "\n") この出力は`grep "$USER" /etc/passwd'の出力と余分なフィールドい くつか(システムによって異なる)がある以外は同じである． Single Methods: new(name, member::value...) nameという名前を持つ構造体を生成する．memberは構造体のメンバを 表す文字列であり，valueはその値である．生成された構造体はメン バで指定された名前の特異メソッドが定義されていて，そのメソッド によってメンバの内容を得ることができる． *** TCPserver(クラス) TCP/IPストリーム型接続のサーバ側のソケットのクラス．このクラスによって 簡単にソケットを利用したサーバのプログラミングができる．例えばechoサー バは以下のようになる． gs = TCPserver.open(4444) socks = [gs] while %TRUE nsock = select(socks); if nsock == nil; continue end for s in nsock[0] if s == gs socks.push(s.accept) else if s.eof s.close socks.delete(s) else str = s.gets s.write(str) end end end end SuperClass: TCPsocket Methods: accept クライアントからの接続要求を受け付け，接続したTCPsocketのイン スタンスを返す． Single Methods: new([host, ]service) open([host, ]service) serviceは/etc/services(またはNIS)に登録されているサービス名か ポート番号で指定する．hostを指定した時は指定したホストからの接 続だけを受け付ける．省略時は全てのホストからの接続要求を受け付 ける． *** TCPsocket インターネットドメインのストリーム型ソケットのクラス．通常のIOクラスの サブクラスと同様の入出力ができる．このクラスによってソケットを用いたク ライアントを簡単に記述できる．ユーザの入力をそのままサーバに転送するプ ログラムは以下のようになる． s = TCPsocket("localhost", 4444) while gets() s.write($_) print(s.read) end SuperClass: BasicSocket Methods: addr ソケットの接続情報を表す配列を返す．その配列の各要素は第1要素 が文字列 "AF_INET"，第2要素がport番号，第3要素がホストを表す文 字列である． peeraddr 接続相手先ソケットの情報を表す配列を返す．その配列の各要素は addrメソッドが返す配列と同じである． Single Methods: open(host, service) new(host, service) hostで指定したホストのserviceで指定したポートと接続したソケッ トを返す．hostはホスト名，またはインターネットアドレスを示す文 字列，serviceは/etc/services(またはNIS)に登録されているサービ ス名かポート番号である． *** Time(クラス) 時間を表すクラス．大小比較などができる．Time.nowで現在の時間を得ること ができる．またファイルのタイムスタンプを得るメソッドの戻り値もこのクラ スのインスタンスである． SuperClass: Object Included Modules: Comparable Methods: self <=> other otherはTimeのインスタンスか整数．整数が与えられた場 合には1970年 1月 1日 00:00:00 GMTからの秒数であると して時刻との比較を行なう． asctime ctime to_s 時刻をdate(1)形式の文字列に変換する． gmtime タイムゾーンの修正を行なわないGMTでの時刻を得る．このメソッド を受けとったTimeクラスのインスタンスは，以後の時刻変換をGMTで 行なう．gmtimeは自分自身を返す． ロンドンの時刻を表示するには print(Time.now.gmtime, "\n") とすればよい． localtime タイムゾーンの修正を行なった時刻を得る(デフォルト)．localtime は自分自身を返す． to_i tv_sec 1970年 1月 1日 00:00:00 GMTから時刻までの秒数を整数で返す．時 刻のsecondの部分でもある． sec min hour mday year wday yday zone isdst 内部的に保持しているtm構造体の内容を返す．zone以外は整数を返す． zoneはタイムゾーンを表す文字列を返す．(cf localtime(3)) strftime(format) 時刻をformat文字列に従って文字列に変換した結果を返す．format 文字列として指定できるものは 以下の通りである． %A 曜日の名称(Sunday, Monday,...) %a 曜日の省略名(Sun, Mon,...) %B 月の名称(January, February,...) %b 月の省略名(Jan, Feb,...) %c 時刻表現(cf ctime(3)) %d 十進数での日(01-31) %H 24時間制の時(00-23) %I 12時間制の時(01-12) %j 年中の通算日(001-366) %M 分(00-59) %m 月を表す数字(01-12) %p 午前または午後(AM,PM) %S 秒(00-61) %U 週を表す数字．最初の日曜日が第1週の 始まり(00-53) %W 週を表す数字．最初の月曜日が第1週の 始まり(00-53) %w 曜日を表す数字．日曜日が0(0-6) %X 時刻(例: 15:01:06) %x 日付(例: Fri Jan 14 1994) %Y 西暦を表す数字 %y 西暦の下2桁(00-99) %Z タイムゾーン %% %自身 usec tv_usec 時刻のmicro secondの部分を返す． Single Methods: now 現在の時刻を表すTimeクラスのインスタンスを生成する． at(time) timeと同じ時刻を表すTimeクラスのインスタンスを生成する．timeは Timeクラスのインスタンスかあるいは数(整数/浮動小数点数)であり， 数の場合は1970年 1月 1日 00:00:00 GMTからの秒数であるとして時 刻を計算する． times 現在のプロセスとその子プロセスが消費したユーザ/システムCPUタイ ムの積算を構造体として返す(Structを参照)． struct tms utime # プロセスのユーザ時間 stime # プロセスのシステム時間 cutime # 子プロセスのユーザ時間 cstime # 子プロセスのシステム時間 end 時間の単位は秒であり，浮動小数点数で与えられる．詳細は times(3)を参照のこと． *** UNIXserver UNIXストリーム型接続のサーバ側のソケットのクラス． SuperClass: UNIXsocket Methods: accept クライアントからの接続要求を受け付け，接続したUNIXsocketのイン スタンスを返す． *** UNIXsocket UNIXドメインのストリーム型ソケットのクラス．通常のIOクラスのサブクラス と同様の入出力ができる． SuperClass: BasicSocket Methods: addr ソケットの接続情報を表す配列を返す．その配列の各要素は第1要素 が文字列 "AF_UNIX"，第2要素がpathである． path UNIXソケットのパスを返す． peeraddr 接続相手先ソケットの情報を表す配列を返す．その配列の各要素は addrメソッドが返す配列と同じである． Single Methods: open(path) new(path) pathで指定したパス名を用いて接続したソケットを返す． ------------------------------------------------------- Local variables: fill-column: 70 end: ./ruby-0.64/sprintf.c100644 150 1 16725 5704462376 13060 0ustar matzdaemon/************************************************ sprintf.c - $Author: matz $ $Date: 1995/01/10 10:42:59 $ created at: Fri Oct 15 10:39:26 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include static void fmt_setup(); VALUE Fsprintf(argc, argv) int argc; VALUE *argv; { struct RString *fmt; char *buf, *p, *end; int i, blen, bsiz; VALUE result; #define FNONE 0 #define FSHARP 1 #define FMINUS 2 #define FPLUS 4 #define FZERO 8 #define FWIDTH 16 #define FPREC 32 int width, prec, flags = FNONE; VALUE str; #define CHECK(l) {\ while (blen + (l) >= bsiz) {\ REALLOC_N(buf, char, bsiz*2);\ bsiz*=2;\ }\ } #define PUSH(s, l) { \ CHECK(l);\ memcpy(&buf[blen], s, l);\ blen += (l);\ } #define GETARG() \ ((argc == 0)?Fail("too few argument."):(argc--, (argv++)[0])) fmt = (struct RString*)GETARG(); Check_Type(fmt, T_STRING); blen = 0; bsiz = 120; buf = ALLOC_N(char, bsiz); end = fmt->ptr + fmt->len; for (p = fmt->ptr; p < end; p++) { char *t; for (t = p; t < end && *t != '%'; t++) ; CHECK(t - p); PUSH(p, t - p); if (t >= end) { /* end of fmt string */ goto sprint_exit; } p = t + 1; /* skip `%' */ retry: switch (*p) { default: if (isprint(*p)) Fail("malformed format string - %%%c", *p); else Fail("malformed format string"); break; case ' ': p++; goto retry; case '#': flags |= FSHARP; p++; goto retry; case '+': flags |= FPLUS; p++; goto retry; case '-': flags |= FMINUS; p++; goto retry; case '0': flags |= FZERO; p++; goto retry; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': flags |= FWIDTH; width = 0; for (p; p < end && isdigit(*p); p++) { width = 10 * width + (*p - '0'); } if (p >= end) { Fail("malformed format string - %%[0-9]"); } goto retry; case '*': if (flags & FWIDTH) { Fail("width given twice"); } flags |= FWIDTH; width = GETARG(); width = NUM2INT(width); if (width < 0) { flags |= FMINUS; width = - width; } p++; goto retry; case '.': if (flags & FPREC) { Fail("precision given twice"); } prec = 0; p++; if (*p == '0') flags |= FZERO; if (*p == '*') { prec = GETARG(); prec = NUM2INT(prec); if (prec > 0) flags |= FPREC; p++; goto retry; } for (p; p < end && isdigit(*p); p++) { prec = 10 * prec + (*p - '0'); } if (p >= end) { Fail("malformed format string - %%.[0-9]"); } if (prec > 0) flags |= FPREC; goto retry; case '%': PUSH("%", 1); break; case 'c': { VALUE val = GETARG(); char c; c = NUM2INT(val) & 0xff; PUSH(&c, 1); } break; case 's': { VALUE arg = GETARG(); int len; char fbuf[32]; #define MIN(a,b) ((a)<(b)?(a):(b)) str = obj_as_string(arg); fmt_setup(fbuf, 's', flags, width, prec); if (flags&FPREC) { CHECK(prec); } else if ((flags&FWIDTH) && width > RSTRING(str)->len) { CHECK(width); } else { CHECK(RSTRING(str)->len); } sprintf(&buf[blen], fbuf, RSTRING(str)->ptr); blen += strlen(&buf[blen]); } break; case 'b': case 'B': case 'o': case 'x': { VALUE val = GETARG(); char fbuf[32], *s, *t, *end; int v, base; bin_retry: switch (TYPE(val)) { case T_FIXNUM: v = FIX2INT(val); val = int2big(v); break; case T_FLOAT: v = RFLOAT(val)->value; val = int2big(v); break; case T_STRING: val = str2inum(RSTRING(val)->ptr, 0); goto bin_retry; case T_BIGNUM: val = big_clone(val); break; default: WrongType(val, T_FIXNUM); break; } if (*p == 'x') base = 16; else if (*p == 'o') base = 8; else if (*p == 'b' || *p == 'B') base = 2; if (*p != 'B' && !RBIGNUM(val)->sign) big_2comp(val); val = big2str(val, base); fmt_setup(fbuf, 's', flags, width, prec); s = t = RSTRING(val)->ptr; end = s + RSTRING(val)->len; if (*s == '-' && *p != 'B') { s++; t++; if (base == 16) { while (tptr; if (flags&FPREC) { CHECK(prec); } else if ((flags&FWIDTH) && width > end - s) { CHECK(width); } else { CHECK(s - end); } sprintf(&buf[blen], fbuf, s); blen += strlen(&buf[blen]); } break; case 'd': case 'D': case 'O': case 'X': { VALUE val = GETARG(); char fbuf[32], c = *p; int bignum = 0, base; int v; if (c == 'D') c = 'd'; int_retry: switch (TYPE(val)) { case T_FIXNUM: v = FIX2INT(val); break; case T_FLOAT: v = RFLOAT(val)->value; break; case T_STRING: val = str2inum(RSTRING(val)->ptr, 0); goto int_retry; case T_BIGNUM: if (c == 'd') base = 10; else if (c == 'X') base = 16; else if (c == 'O') base = 8; val = big2str(val, base); bignum = 1; break; default: val = num2fix(val); goto int_retry; } if (bignum) { fmt_setup(fbuf, 's', flags, width, prec); if (flags&FPREC) { CHECK(prec); } else if ((flags&FWIDTH) && width > RSTRING(val)->len) { CHECK(width); } else { CHECK(RSTRING(val)->len); } sprintf(&buf[blen], fbuf, RSTRING(val)->ptr); blen += strlen(&buf[blen]); } else { fmt_setup(fbuf, c, flags, width, prec); CHECK(11); if (v < 0 && (c == 'X' || c == 'O')) { v = -v; PUSH("-", 1); } sprintf(&buf[blen], fbuf, v); blen += strlen(&buf[blen]); } } break; case 'f': case 'g': case 'e': { VALUE val = GETARG(); double fval; char fbuf[32]; double big2dbl(); double atof(); switch (TYPE(val)) { case T_FIXNUM: fval = FIX2INT(val); break; case T_FLOAT: fval = RFLOAT(val)->value; break; case T_BIGNUM: fval = big2dbl(val); break; case T_STRING: fval = atof(RSTRING(val)->ptr); break; default: WrongType(val, T_FLOAT); break; } fmt_setup(fbuf, *p, flags, width, prec); CHECK(22); sprintf(&buf[blen], fbuf, fval); blen += strlen(&buf[blen]); } break; } flags = FNONE; } sprint_exit: if (verbose && argc > 1) { Fail("too many argument for format string"); } result = str_new(buf, blen); free(buf); return result; } static void fmt_setup(buf, c, flags, width, prec) char *buf, c; int flags, width, prec; { *buf++ = '%'; if (flags & FSHARP) *buf++ = '#'; if (flags & FPLUS) *buf++ = '+'; if (flags & FMINUS) *buf++ = '-'; if (flags & FZERO) *buf++ = '0'; if (flags & FWIDTH) { sprintf(buf, "%d", width); buf += strlen(buf); } if (flags & FPREC) { sprintf(buf, ".%d", prec); buf += strlen(buf); } *buf++ = c; *buf = '\0'; } ./ruby-0.64/st.c100644 150 1 20177 5674170244 12011 0ustar matzdaemon/* This is a general purpose hash table package written by Peter Moore @ UCB. */ static char sccsid[] = "@(#) st.c 5.1 89/12/14 Crucible"; #ifndef lint static char *rcsid = "$Header: /usr/ext/cvsroot/ruby/st.c,v 1.3 1994/12/09 01:28:33 matz Exp $"; #endif #include "config.h" #include #include "st.h" extern void *xmalloc(); static rehash(); #define max(a,b) ((a) > (b) ? (a) : (b)) #define nil(type) ((type *) 0) #define alloc(type) (type *)xmalloc((unsigned)sizeof(type)) #define Calloc(n,s) (char *)xcalloc((n),(s)) /* * DEFAULT_MAX_DENSITY is the default for the largest we allow the * average number of items per bin before increasing the number of * bins * * DEFAULT_INIT_TABLE_SIZE is the default for the number of bins * allocated initially * * DEFAULT_GROW_FACTOR is the amount the hash table is expanded after * the density has reached max_density */ #define EQUAL(func, x, y) \ ((func == ST_NUMCMP) ? ((x) == (y)) : ((*func)((x), (y)) == 0)) /*#define do_hash(key, table) (*table->hash)(key, table->num_bins)*/ #define do_hash(key, table)\ ((table->hash == ST_PTRHASH) ? (((int) (key) >> 2) % table->num_bins) :\ (table->hash == ST_NUMHASH) ? ((int) (key) % table->num_bins) :\ (*table->hash)((key), table->num_bins)) st_table *st_init_table_with_params(compare, hash, size, density, grow_factor, reorder_flag) int (*compare)(); int (*hash)(); int size; int density; double grow_factor; int reorder_flag; { st_table *tbl; tbl = alloc(st_table); tbl->compare = compare; tbl->hash = hash; tbl->num_entries = 0; tbl->max_density = density; tbl->grow_factor = grow_factor; tbl->reorder_flag = reorder_flag; tbl->num_bins = size; tbl->bins = (st_table_entry **) Calloc((unsigned)size, sizeof(st_table_entry *)); return tbl; } st_table *st_init_table(compare, hash) int (*compare)(); int (*hash)(); { return st_init_table_with_params(compare, hash, ST_DEFAULT_INIT_TABLE_SIZE, ST_DEFAULT_MAX_DENSITY, ST_DEFAULT_GROW_FACTOR, ST_DEFAULT_REORDER_FLAG); } st_free_table(table) st_table *table; { register st_table_entry *ptr, *next; int i; for(i = 0; i < table->num_bins ; i++) { ptr = table->bins[i]; while (ptr != nil(st_table_entry)) { next = ptr->next; free((char *) ptr); ptr = next; } } free((char *) table->bins); free((char *) table); } #define PTR_NOT_EQUAL(table, ptr, key)\ (ptr != nil(st_table_entry) && !EQUAL(table->compare, key, (ptr)->key)) #define FIND_ENTRY(table, ptr, hash_val)\ ptr = (table)->bins[hash_val];\ if (PTR_NOT_EQUAL(table, ptr, key)) {\ while (PTR_NOT_EQUAL(table, ptr->next, key)) {\ ptr = ptr->next;\ }\ if (ptr->next != nil(st_table_entry) && (table)->reorder_flag) {\ st_table_entry *_tmp = (ptr)->next;\ (ptr)->next = (ptr)->next->next;\ _tmp->next = (table)->bins[hash_val];\ (table)->bins[hash_val] = _tmp;\ ptr = _tmp;\ } else {\ ptr = ptr->next;\ }\ } st_lookup(table, key, value) st_table *table; register char *key; char **value; { int hash_val; register st_table_entry *ptr; hash_val = do_hash(key, table); FIND_ENTRY(table, ptr, hash_val); if (ptr == nil(st_table_entry)) { return 0; } else { if (value != nil(char *)) *value = ptr->record; return 1; } } #define ADD_DIRECT(table, key, value, hash_val, tbl)\ {\ if (table->num_entries/table->num_bins > table->max_density) {\ rehash(table);\ hash_val = do_hash(key,table);\ }\ \ tbl = alloc(st_table_entry);\ \ tbl->key = key;\ tbl->record = value;\ tbl->next = table->bins[hash_val];\ table->bins[hash_val] = tbl;\ table->num_entries++;\ } st_insert(table, key, value) register st_table *table; register char *key; char *value; { int hash_val; st_table_entry *tbl; register st_table_entry *ptr; hash_val = do_hash(key, table); FIND_ENTRY(table, ptr, hash_val); if (ptr == nil(st_table_entry)) { ADD_DIRECT(table,key,value,hash_val,tbl); return 0; } else { ptr->record = value; return 1; } } st_add_direct(table, key, value) st_table *table; char *key; char *value; { int hash_val; st_table_entry *tbl; hash_val = do_hash(key, table); ADD_DIRECT(table, key, value, hash_val, tbl); } st_find_or_add(table, key, slot) st_table *table; char *key; char ***slot; { int hash_val; st_table_entry *tbl, *ptr; hash_val = do_hash(key, table); FIND_ENTRY(table, ptr, hash_val); if (ptr == nil(st_table_entry)) { ADD_DIRECT(table, key, (char *)0, hash_val, tbl) if (slot != nil(char **)) *slot = &tbl->record; return 0; } else { if (slot != nil(char **)) *slot = &ptr->record; return 1; } } static rehash(table) register st_table *table; { register st_table_entry *ptr, *next, **old_bins = table->bins; int i, old_num_bins = table->num_bins, hash_val; table->num_bins = table->grow_factor*old_num_bins; if (table->num_bins%2 == 0) { table->num_bins += 1; } table->num_entries = 0; table->bins = (st_table_entry **) Calloc((unsigned) table->num_bins, sizeof(st_table_entry *)); for(i = 0; i < old_num_bins ; i++) { ptr = old_bins[i]; while (ptr != nil(st_table_entry)) { next = ptr->next; hash_val = do_hash(ptr->key, table); ptr->next = table->bins[hash_val]; table->bins[hash_val] = ptr; table->num_entries++; ptr = next; } } free((char *) old_bins); } st_table *st_copy(old_table) st_table *old_table; { st_table *new_table; st_table_entry *ptr, *tbl; int i, num_bins = old_table->num_bins; new_table = alloc(st_table); if (new_table == nil(st_table)) { return nil(st_table); } *new_table = *old_table; new_table->bins = (st_table_entry **) Calloc((unsigned) num_bins, sizeof(st_table_entry *)); if (new_table->bins == nil(st_table_entry *)) { free((char *) new_table); return nil(st_table); } for(i = 0; i < num_bins ; i++) { new_table->bins[i] = nil(st_table_entry); ptr = old_table->bins[i]; while (ptr != nil(st_table_entry)) { tbl = alloc(st_table_entry); if (tbl == nil(st_table_entry)) { free((char *) new_table->bins); free((char *) new_table); return nil(st_table); } *tbl = *ptr; tbl->next = new_table->bins[i]; new_table->bins[i] = tbl; ptr = ptr->next; } } return new_table; } st_delete(table, key, value) register st_table *table; register char **key; char **value; { int hash_val; st_table_entry *tmp; register st_table_entry *ptr; hash_val = do_hash(*key, table); ptr = table->bins[hash_val]; if (ptr == nil(st_table_entry)) { if (value != nil(char *)) *value = nil(char); return 0; } if (EQUAL(table->compare, *key, ptr->key)) { table->bins[hash_val] = ptr->next; table->num_entries--; if (value != nil(char *)) *value = ptr->record; *key = ptr->key; free((char *) ptr); return 1; } for(; ptr->next != nil(st_table_entry); ptr = ptr->next) { if (EQUAL(table->compare, ptr->next->key, *key)) { tmp = ptr->next; ptr->next = ptr->next->next; table->num_entries--; if (value != nil(char *)) *value = tmp->record; *key = tmp->key; free((char *) tmp); return 1; } } return 0; } st_foreach(table, func, arg) st_table *table; enum st_retval (*func)(); char *arg; { st_table_entry *ptr, *last, *tmp; enum st_retval retval; int i; for(i = 0; i < table->num_bins; i++) { last = nil(st_table_entry); for(ptr = table->bins[i]; ptr != nil(st_table_entry);) { retval = (*func)(ptr->key, ptr->record, arg); switch (retval) { case ST_CONTINUE: last = ptr; ptr = ptr->next; break; case ST_STOP: return; case ST_DELETE: tmp = ptr; if (last == nil(st_table_entry)) { table->bins[i] = ptr->next; } else { last->next = ptr->next; } ptr = ptr->next; free((char *) tmp); } } } } st_strhash(string, modulus) register char *string; int modulus; { register int val = 0; register int c; while ((c = *string++) != '\0') { val = val*997 + c; } return ((val < 0) ? -val : val)%modulus; } ./ruby-0.64/st.h100644 150 1 2362 5674170244 11772 0ustar matzdaemon/* This is a general purpose hash table package written by Peter Moore @ UCB. */ /* @(#) st.h 5.1 89/12/14 */ #ifndef ST_INCLUDED #define ST_INCLUDED typedef struct st_table_entry st_table_entry; struct st_table_entry { char *key; char *record; st_table_entry *next; }; typedef struct st_table st_table; struct st_table { int (*compare)(); int (*hash)(); int num_bins; int num_entries; int max_density; int reorder_flag; double grow_factor; st_table_entry **bins; }; #define st_is_member(table,key) st_lookup(table,key,(char **) 0) enum st_retval {ST_CONTINUE, ST_STOP, ST_DELETE}; int st_delete(), st_insert(), st_foreach(), st_free_table(); int st_lookup(), st_find_or_add(), st_add_direct(); st_table *st_init_table(), *st_init_table_with_params(); st_table *st_copy(); #define ST_NUMCMP ((int (*)()) 0) #define ST_NUMHASH ((int (*)()) -2) #define ST_PTRCMP ((int (*)()) 0) #define ST_PTRHASH ((int (*)()) -1) #define st_numcmp ST_NUMCMP #define st_numhash ST_NUMHASH #define st_ptrcmp ST_PTRCMP #define st_ptrhash ST_PTRHASH #define ST_DEFAULT_MAX_DENSITY 5 #define ST_DEFAULT_INIT_TABLE_SIZE 11 #define ST_DEFAULT_GROW_FACTOR 2.0 #define ST_DEFAULT_REORDER_FLAG 0 int st_strhash(); #endif ST_INCLUDED ./ruby-0.64/string.c100644 150 1 76053 5704462401 12666 0ustar matzdaemon/************************************************ string.c - $Author: matz $ $Date: 1995/01/10 10:43:01 $ created at: Mon Aug 9 17:12:58 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "re.h" #include #include VALUE C_String; #define STRLEN(s) RSTRING(s)->len VALUE str_new(ptr, len) char *ptr; UINT len; { NEWOBJ(str, struct RString); OBJSETUP(str, C_String, T_STRING); str->len = len; str->orig = Qnil; str->ptr = ALLOC_N(char,len+1); if (ptr) { memcpy(str->ptr, ptr, len); } str->ptr[len] = '\0'; return (VALUE)str; } VALUE str_new2(ptr) char *ptr; { return str_new(ptr, strlen(ptr)); } VALUE str_new3(str) struct RString *str; { NEWOBJ(str2, struct RString); OBJSETUP(str2, C_String, T_STRING); str2->len = str->len; str2->ptr = str->ptr; str2->orig = str; return (VALUE)str2; } #define as_str(str) (struct RString*)obj_as_string(str) static ID pr_str; VALUE obj_as_string(obj) VALUE obj; { VALUE str; if (TYPE(obj) == T_STRING) { return obj; } str = rb_funcall(obj, pr_str, 0); if (TYPE(str) != T_STRING) return Fkrn_to_s(obj); return str; } VALUE str_clone(str) struct RString *str; { VALUE obj; if (str->orig) obj = str_new3(str->orig); else obj = str_new(str->ptr, str->len); CLONESETUP(obj, str); return obj; } static VALUE Sstr_new(class, str) VALUE class; struct RString *str; { Check_Type(str, T_STRING); { NEWOBJ(str2, struct RString); OBJSETUP(str2, class, T_STRING); str2->len = str->len; str2->ptr = ALLOC_N(char, str->len+1); if (str2->ptr) { memcpy(str2->ptr, str->ptr, str->len); } str2->ptr[str->len] = '\0'; str2->orig = Qnil; return (VALUE)str2; } } static VALUE Fstr_length(str) struct RString *str; { return INT2FIX(str->len); } VALUE Fstr_plus(str1, str2) struct RString *str1, *str2; { struct RString *str3; str2 = as_str(str2); str3 = (struct RString*)str_new(0, str1->len+str2->len); memcpy(str3->ptr, str1->ptr, str1->len); memcpy(str3->ptr+str1->len, str2->ptr, str2->len); str3->ptr[str3->len] = '\0'; return (VALUE)str3; } VALUE Fstr_times(str, times) struct RString *str; VALUE times; { struct RString *str2; int i; times = NUM2INT(times); str2 = (struct RString*)str_new(0, str->len*times); for (i=0; iptr+(i*str->len), str->ptr, str->len); } str2->ptr[str2->len] = '\0'; return (VALUE)str2; } extern VALUE C_Range; static VALUE Fstr_dot2(left, right) VALUE left, right; { extern VALUE C_Range; VALUE str; Check_Type(right, T_STRING); str = range_new(left, right); return str; } VALUE str_substr(str, start, len) struct RString *str; int start, len; { struct RString *str2; if (start < 0) { start = str->len + start; } if (str->len <= start) { Fail("index %d out of range [0..%d]", start, str->len-1); } if (len < 0) { Fail("Negative length %d", len); } str2 = (struct RString*)str_new(str->ptr+start, len); return (VALUE)str2; } VALUE str_subseq(str, beg, end) struct RString *str; int beg, end; { int len; if (beg < 0) { beg = str->len + beg; if (beg < 0) beg = 0; } if (end < 0) { end = str->len + end; if (end < 0) end = 0; } if (beg > end) { int tmp; if (verbose) { Warning("start %d is bigger than end %d", beg, end); } tmp = beg; beg = end; end = tmp; } if (beg >= str->len) { return str_new(0, 0); } if (str->len < end) { end = str->len; } len = end - beg + 1; if (len < 0) { Fail("end %d too small(size %d)", end, str->len); } return str_substr(str, beg, len); } extern VALUE ignorecase; void str_modify(str) struct RString *str; { if (str->orig == Qnil) return; str->ptr = ALLOC_N(char, str->len+1); if (str->ptr) { memcpy(str->ptr, str->orig->ptr, str->len+1); } str->orig = Qnil; } VALUE str_grow(str, len) struct RString *str; UINT len; { str_modify(str); if (len > 0) { REALLOC_N(str->ptr, char, len + 1); str->len = len; str->ptr[len] = '\0'; /* sentinel */ } return (VALUE)str; } VALUE str_cat(str, ptr, len) struct RString *str; char *ptr; UINT len; { str_modify(str); if (len > 0) { REALLOC_N(str->ptr, char, str->len + len + 1); if (ptr) memcpy(str->ptr + str->len, ptr, len); str->len += len; str->ptr[str->len] = '\0'; /* sentinel */ } return (VALUE)str; } static VALUE Fstr_concat(str1, str2) struct RString *str1, *str2; { str2 = as_str(str2); str_cat(str1, str2->ptr, str2->len); return (VALUE)str1; } static str_hash(str) struct RString *str; { int len = str->len; unsigned char *p = (unsigned char*)str->ptr; int key = 0; if (ignorecase) { while (len--) { key = key*65599 + *p; } } else { while (len--) { key = key*65599 + toupper(*p); } } return key; } static VALUE Fstr_hash(str) VALUE str; { int key = str_hash(str); return INT2FIX(key); } #define min(a,b) (((a)>(b))?(b):(a)) int str_cmp(str1, str2) struct RString *str1, *str2; { UINT len; int retval; if (ignorecase != Qnil) { return str_cicmp(str1, str2); } len = min(str1->len, str2->len); retval = memcmp(str1->ptr, str2->ptr, len); if (retval == 0) { return str1->ptr[len] - str2->ptr[len]; } return retval; } static VALUE Fstr_equal(str1, str2) struct RString *str1, *str2; { if (TYPE(str2) != T_STRING) return FALSE; if (str1->len == str2->len && str_cmp(str1, str2) == 0) { return TRUE; } return FALSE; } static VALUE Fstr_cmp(str1, str2) VALUE str1, str2; { int result; Check_Type(str2, T_STRING); result = str_cmp(str1, str2); return INT2FIX(result); } Regexp * make_regexp(); VALUE Freg_match(); extern VALUE C_Glob; static VALUE Fstr_match(x, y) struct RString *x, *y; { VALUE reg; int start; switch (TYPE(y)) { case T_REGEXP: return Freg_match(y, x); case T_STRING: reg = re_regcomp(y); start = research(reg, x, 0, ignorecase); if (start == -1) { return FALSE; } return INT2FIX(start); default: if (obj_is_kind_of(y, C_Glob)) { return Fglob_match(y, x); } Fail("type mismatch"); break; } } static VALUE Fstr_match2(str) struct RString *str; { extern VALUE rb_lastline; VALUE reg; int start; if (TYPE(rb_lastline) != T_STRING) Fail("$_ is not a string"); reg = re_regcomp(str); start = research(reg, rb_lastline, 0, ignorecase); if (start == -1) { return Qnil; } return INT2FIX(start); } static int str_index(str, sub, offset) struct RString *str, *sub; int offset; { char *s, *e, *p; int len; if (str->len - offset < sub->len) return -1; s = str->ptr+offset; p = sub->ptr; len = sub->len; e = s + str->len - len + 1; while (s < e) { if (*s == *(sub->ptr) && memcmp(s, p, len) == 0) { return (s-(str->ptr)); } s++; } return -1; } static VALUE Fstr_index(argc, argv, str) int argc; VALUE *argv; struct RString *str; { struct RString *sub; VALUE initpos; int pos; if (rb_scan_args(argc, argv, "11", &sub, &initpos) == 2) { pos = NUM2INT(initpos); } else { pos = 0; } switch (TYPE(sub)) { case T_REGEXP: pos = research(sub, str, pos, ignorecase); break; case T_STRING: pos = str_index(str, sub, pos); break; default: Fail("Type mismatch: %s given", rb_class2name(CLASS_OF(sub))); } if (pos == -1) return Qnil; return INT2FIX(pos); } static VALUE Fstr_rindex(argc, argv, str) int argc; VALUE *argv; struct RString *str; { struct RString *sub; VALUE initpos; int pos, len; char *s, *sbeg, *t; if (rb_scan_args(argc, argv, "11", &sub, &initpos) == 2) { pos = NUM2INT(initpos); if (pos >= str->len) pos = str->len; } else { pos = str->len; } Check_Type(sub, T_STRING); if (pos > str->len) return Qnil; /* substring longer than string */ sbeg = str->ptr; s = s + pos - sub->len; t = sub->ptr; len = sub->len; while (sbeg <= s) { if (*s == *t && memcmp(s, t, len) == 0) { return INT2FIX(s - sbeg); } s--; } return Qnil; } static char str_next(s) char *s; { char c = *s; /* numerics */ if ('0' <= c && c < '9') (*s)++; else if (c == '9') { *s = '0'; return '1'; } /* small alphabets */ else if ('a' <= c && c < 'z') (*s)++; else if (c == 'z') { return *s = 'a'; } /* capital alphabets */ else if ('A' <= c && c < 'Z') (*s)++; else if (c == 'Z') { return *s = 'A'; } return 0; } static VALUE Fstr_next(orig) struct RString *orig; { struct RString *str, *str2; char *sbeg, *s; char c = -1; str = (struct RString*)str_new(orig->ptr, orig->len); sbeg = str->ptr; s = sbeg + str->len - 1; while (sbeg <= s) { if (isalnum(*s) && (c = str_next(s)) == Qnil) break; s--; } if (s < sbeg && c != -1) { str2 = (struct RString*)str_new(0, str->len+1); str2->ptr[0] = c; memcpy(str2->ptr+1, str->ptr, str->len); str = str2; } return (VALUE)str; } VALUE Fstr_upto(beg, end) VALUE beg, end; { VALUE current; current = beg; for (;;) { rb_yield(current); if (Fstr_equal(current, end)) break; current = Fstr_next(current); } return Qnil; } static VALUE Fstr_aref_internal(str, indx) struct RString *str; VALUE indx; { int idx; switch (TYPE(indx)) { case T_FIXNUM: idx = FIX2UINT(indx); if (idx < 0) { idx = str->len + idx; } if (idx < 0 || str->len <= idx) { Fail("index %d out of range [0..%d]", idx, str->len-1); } return (VALUE)INT2FIX(str->ptr[idx] & 0xff); case T_REGEXP: if (Fstr_index(str, indx)) return re_last_match(0); return Qnil; case T_STRING: if (str_index(str, indx, 0)) return indx; return Qnil; default: /* check if indx is Range */ if (obj_is_kind_of(indx, C_Range)) { int beg, end; beg = rb_iv_get(indx, "start"); beg = NUM2INT(beg); end = rb_iv_get(indx, "end"); end = NUM2INT(end); if (beg > end) { int tmp; if (verbose) { Warning("start %d is bigger than end %d", beg, end); } tmp = beg; beg = end; end = tmp; } return str_subseq(str, beg, end); } Fail("Invalid index for string"); } } static VALUE Fstr_aref(argc, argv, str) int argc; VALUE *argv; struct RString *str; { VALUE arg1, arg2; if (rb_scan_args(argc, argv, "11", &arg1, &arg2) == 2) { return str_substr(str, NUM2INT(arg1), NUM2INT(arg2)); } return Fstr_aref_internal(str, arg1); } static void str_replace(str, beg, len, val) struct RString *str, *val; int beg, len; { if (len < val->len) { /* expand string */ REALLOC_N(str->ptr, char, str->len+val->len-len+1); } memmove(str->ptr+beg+val->len, str->ptr+beg+len, str->len-(beg+len)); memcpy(str->ptr+beg, val->ptr, val->len); str->len += val->len - len; str->ptr[str->len] = '\0'; } static void str_replace2(str, beg, end, val) struct RString *str, *val; int beg, end; { int len; if (beg < 0) { beg = str->len + beg; } if (str->len <= beg) { Fail("start %d too big", beg); } if (end < 0) { end = str->len + end; } if (end < 0 || str->len <= end) { Fail("end %d too big", end); } len = end - beg + 1; /* length of substring */ if (len < 0) { Fail("end %d too small", end); } str_replace(str, beg, len, val); } static VALUE str_sub(str, pat, val, once) struct RString *str; struct RRegexp *pat; VALUE val; int once; { VALUE sub; int beg, end, offset, n; for (offset=0, n=0; (beg=research(pat, str, offset, ignorecase)) >= 0; offset=RREGEXP(pat)->ptr->regs.start[0]+STRLEN(val)) { end = RREGEXP(pat)->ptr->regs.end[0]-1; sub = re_regsub(val); str_replace2(str, beg, end, sub); n++; if (once) break; } if (n == 0) return Qnil; return (VALUE)str; } static VALUE Fstr_aset_internal(str, indx, val) struct RString *str; VALUE indx, val; { int idx, beg, end, offset; switch (TYPE(indx)) { case T_FIXNUM: idx = NUM2INT(indx); if (idx < 0) { idx = str->len + idx; } if (idx < 0 || str->len <= idx) { Fail("index %d out of range [0..%d]", idx, str->len-1); } str->ptr[idx] = FIX2UINT(val) & 0xff; return val; case T_REGEXP: str_sub(str, indx, val, 0); return val; case T_STRING: for (offset=0; (beg=str_index(str, indx, offset)) >= 0; offset=beg+STRLEN(val)) { end = beg + STRLEN(indx) - 1; str_replace2(str, beg, end, val); } if (offset == 0) Fail("Not a substring"); return val; default: /* check if indx is Range */ if (obj_is_kind_of(indx, C_Range)) { Check_Type(val, T_STRING); beg = rb_iv_get(indx, "start"); beg = NUM2INT(beg); end = rb_iv_get(indx, "end"); end = NUM2INT(end); if (beg > end) { int tmp; if (verbose) { Warning("start %d is bigger than end %d", beg, end); } tmp = beg; beg = end; end = tmp; } str_replace2(str, beg, end, val); return val; } Fail("Invalid index for string"); } } static VALUE Fstr_aset(argc, argv, str) int argc; VALUE *argv; struct RString *str; { VALUE arg1, arg2, arg3; str_modify(str); if (rb_scan_args(argc, argv, "21", &arg1, &arg2, &arg3) == 3) { int beg, len; Check_Type(arg3, T_STRING); beg = NUM2INT(arg1); if (beg < 0) { beg = str->len + beg; if (beg < 0) Fail("start %d too small", beg); } len = NUM2INT(arg2); if (len < 0) Fail("length %d too small", len); if (beg + len > str->len) { len = str->len - beg; } str_replace(str, beg, len, arg3); return arg3; } return Fstr_aset_internal(str, arg1, arg2); } static VALUE Fstr_sub_internal(str, pat, val, once) VALUE str, pat, val; int once; { Check_Type(val, T_STRING); str_modify(str); switch (TYPE(pat)) { case T_REGEXP: return str_sub(str, pat, val, once); case T_STRING: return str_sub(str, re_regcomp(pat), val, once); default: /* type failed */ Check_Type(pat, T_REGEXP); } return Qnil; /* not reached */ } static VALUE Fstr_sub(str, pat, val) VALUE str, pat, val; { return Fstr_sub_internal(str, pat, val, 1); } static VALUE Fstr_gsub(str, pat, val) VALUE str, pat, val; { return Fstr_sub_internal(str, pat, val, 0); } extern VALUE rb_lastline; static VALUE Fsub(obj, pat, val) VALUE obj, pat, val; { Check_Type(rb_lastline, T_STRING); return Fstr_sub_internal(rb_lastline, pat, val, 1); } static VALUE Fgsub(obj, pat, val) VALUE obj, pat, val; { Check_Type(rb_lastline, T_STRING); return Fstr_sub_internal(rb_lastline, pat, val, 0); } static VALUE Fstr_reverse(str) struct RString *str; { VALUE obj = str_new(0, str->len); char *s, *e, *p; s = str->ptr; e = s + str->len - 1; p = RSTRING(obj)->ptr; while (e >= s) { *p++ = *e--; } return obj; } static VALUE Fstr_to_i(str) struct RString *str; { return str2inum(str->ptr, 10); } static VALUE Fstr_to_f(str) struct RString *str; { double atof(); double f = atof(str->ptr); return float_new(f); } static VALUE Fstr_to_s(str) VALUE str; { return str; } static VALUE Fstr_inspect(str) struct RString *str; { char buf[160]; char *p, *pend; char *b, *bend; #define CHECK(n) if (b+n > bend) break; p = str->ptr; pend = p + str->len; b = buf; bend = b + sizeof buf - (str->len>150?4:2); *b++ = '"'; while (p < pend) { char c = *p++; if (isprint(c)) { CHECK(1); *b++ = c; } else if (ismbchar(c)) { CHECK(2); *b++ = c; *b++ = *p++; } else if (c == '\n') { CHECK(2); *b++ = '\\'; *b++ = 'n'; } else if (c == '\r') { CHECK(2); *b++ = '\\'; *b++ = 'r'; } else if (c == '\t') { CHECK(2); *b++ = '\\'; *b++ = 't'; } else if (c == '\f') { CHECK(2); *b++ = '\\'; *b++ = 'f'; } else if (c == '\13') { CHECK(2); *b++ = '\\'; *b++ = 'v'; } else if (c == '\1') { CHECK(2); *b++ = '\\'; *b++ = 'a'; } else if (c == 033) { CHECK(2); *b++ = '\\'; *b++ = 'e'; } else if (iscntrl(c)) { CHECK(2); *b++ = '^'; *b++ = c; } else { CHECK(1); *b++ = c; } } *b++ = '"'; if (p < pend) { bend = buf + sizeof buf; while (b < bend) { *b++ = '.'; } } return str_new(buf, b - buf); } static VALUE Fstr_upcase(str) struct RString *str; { char *s, *send; str_modify(str); s = str->ptr; send = s + str->len; while (s < send) { if (islower(*s)) { *s = toupper(*s); } *s++; } return (VALUE)str; } static VALUE Fstr_downcase(str) struct RString *str; { char *s, *send; str_modify(str); s = str->ptr; send = s + str->len; while (s < send) { if (isupper(*s)) { *s = tolower(*s); } *s++; } return (VALUE)str; } static VALUE Fstr_capitalize(str) struct RString *str; { char *s, *send; str_modify(str); s = str->ptr; send = s + str->len; if (islower(*s)) *s = toupper(*s); while (++s < send) { if (isupper(*s)) { *s = tolower(*s); } } return (VALUE)str; } static VALUE Fstr_swapcase(str) struct RString *str; { char *s, *send; str_modify(str); s = str->ptr; send = s + str->len; while (s < send) { if (isupper(*s)) { *s = tolower(*s); } else if (islower(*s)) { *s = toupper(*s); } *s++; } return (VALUE)str; } static VALUE Fstr_toupper(str) struct RString *str; { return Fstr_upcase(str_new(str_new(str->ptr, str->len))); } static VALUE Fstr_tolower(str) struct RString *str; { return Fstr_downcase(str_new(str_new(str->ptr, str->len))); } struct tr { int last, max; char *p, *pend; } trsrc, trrepl; static trnext(t) struct tr *t; { while (t->p < t->pend) { if (t->max) { if (++t->last < t->max) return t->last; t->last = t->max = 0; } else if (t->last && *t->p == '-') { t->p++; t->max = *t->p; if (t->p == t->pend) { t->p--; return '-'; } else if (t->max < t->last) { t->last = t->max - 1; return '-'; } continue; } return t->last = *t->p++; } return -1; } static VALUE Fstr_tr(str, src, repl) struct RString *str, *src, *repl; { struct tr trsrc, trrepl; char trans[256]; int cflag = 0; int i, c, save; char *s, *send, *t; Check_Type(src, T_STRING); trsrc.p = src->ptr; trsrc.pend = trsrc.p + src->len; if (src->len > 2 && src->ptr[0] == '^') { cflag++; trsrc.p++; } Check_Type(repl, T_STRING); trrepl.p = repl->ptr; trrepl.pend = trrepl.p + repl->len; trsrc.last = trrepl.last = trsrc.max = trrepl.max = 0; for (i=0; i<256; i++) { trans[i] = cflag ? 1 : 0; } while ((c = trnext(&trsrc)) >= 0) { trans[c & 0xff] = cflag ? 0 : 1; } c = 0; for (i=0; i<256; i++) { if (trans[i] == 0) { trans[i] = i; } else { c = trnext(&trrepl); if (c == -1) { trans[i] = trrepl.last; } else { trans[i] = c; } } } str_modify(str); t = s = str->ptr; send = s + str->len; while (s < send) { c = *s++ & 0xff; c = trans[c] & 0xff; *t++ = c; } *t = '\0'; str->len = t - str->ptr; return (VALUE)str; } static void tr_setup_table(str, table) struct RString *str; char table[256]; { struct tr tr; int i, cflag = 0; char c; tr.p = str->ptr; tr.pend = tr.p + str->len; tr.last = tr.max = 0; if (str->len > 2 && str->ptr[0] == '^') { cflag++; tr.p++; } for (i=0; i<256; i++) { table[i] = cflag ? 1 : 0; } while ((c = trnext(&tr)) >= 0) { table[c & 0xff] = cflag ? 0 : 1; } } static VALUE Fstr_delete(str1, str2) struct RString *str1, *str2; { char *s, *send, *t; char squeez[256]; Check_Type(str2, T_STRING); tr_setup_table(str2, squeez); str_modify(str1); s = t = str1->ptr; send = s + str1->len; while (s < send) { if (!squeez[*s & 0xff]) { *t++ = *s; } s++; } *t = '\0'; str1->len = t - str1->ptr; return (VALUE)str1; } static VALUE tr_squeeze(str1, str2) struct RString *str1, *str2; { char squeez[256]; char *s, *send, *t; char c, save; if (str2) { tr_setup_table(str2, squeez); } else { int i; for (i=0; i<256; i++) { squeez[i] = 1; } } str_modify(str1); s = t = str1->ptr; send = s + str1->len; save = -1; while (s < send) { c = *s++ & 0xff; if (c != save || !squeez[c & 0xff]) { *t++ = save = c; } } *t = '\0'; str1->len = t - str1->ptr; return (VALUE)str1; } static VALUE Fstr_squeeze(argc, argv, str1) int argc; VALUE *argv; VALUE str1; { VALUE str2; rb_scan_args(argc, argv, "01", &str2); if (str2) { Check_Type(str2, T_STRING); } return tr_squeeze(str1, str2); } static VALUE Fstr_tr_s(str, src, repl) VALUE str, src, repl; { Check_Type(src, T_STRING); Check_Type(repl, T_STRING); Fstr_tr(str, src, repl); tr_squeeze(str, repl); return str; } static VALUE Fstr_split(argc, argv, str) int argc; VALUE *argv; struct RString *str; { extern VALUE FS; struct RRegexp *spat; VALUE limit; char char_sep = 0; int beg, end, lim, i; VALUE result, tmp; rb_scan_args(argc, argv, "02", &spat, &limit); if (limit) { lim = NUM2INT(limit); i = 1; } if (spat == Qnil) { if (FS) { spat = (struct RRegexp*)FS; goto fs_set; } char_sep = ' '; } else { switch (TYPE(spat)) { case T_STRING: fs_set: if (STRLEN(spat) == 1) { char_sep = RSTRING(spat)->ptr[0]; } else { spat = (struct RRegexp*)re_regcomp(spat); } break; case T_REGEXP: break; default: Fail("split(): bad separator"); } } result = ary_new(); beg = 0; if (char_sep != 0) { char *ptr = str->ptr; int len = str->len; char *eptr = ptr + len; if (char_sep == ' ') { /* AWK emulation */ int skip = 1; for (end = beg = 0; ptrptr->regs.start #define RMATCH spat->ptr->regs.end while ((end = research(spat, str, start, ignorecase)) >= 0) { if (start == end && LMATCH[0] == RMATCH[0]) { if (last_null == 1) { if (ismbchar(str->ptr[beg])) ary_push(result, str_substr(str, beg, 2)); else ary_push(result, str_substr(str, beg, 1)); beg = start; if (limit && lim <= ++i) break; } else { start += ismbchar(str->ptr[start])?2:1; last_null = 1; continue; } } else { ary_push(result, str_substr(str, beg, end-beg)); beg = start = RMATCH[0]; if (limit && lim <= ++i) break; } last_null = 0; for (idx=1; idx < 10; idx++) { if (LMATCH[idx] == -1) break; if (LMATCH[idx] == RMATCH[idx]) tmp = str_new(0, 0); else tmp = str_subseq(str, LMATCH[idx], RMATCH[idx]-1); ary_push(result, tmp); if (limit && lim <= ++i) break; } } } if (str->len > beg) { ary_push(result, str_subseq(str, beg, -1)); } else if (str->len == beg) { ary_push(result, str_new(0, 0)); } return result; } static VALUE Fstr_each(str) struct RString* str; { extern VALUE RS; int newline; int rslen; char *p = str->ptr, *pend = p + str->len, *s; if (RS == Qnil) { rb_yield(str); return (VALUE)str; } rslen = RSTRING(RS)->len; if (rslen == 0) { newline = '\n'; } else { newline = RSTRING(RS)->ptr[rslen-1]; } for (s = p, p += rslen; p < pend; p++) { if (rslen == 0 && *p == '\n') { if (*(p+1) != '\n') continue; while (*p == '\n') p++; p--; } if (*p == newline && (rslen <= 1 || memcmp(RSTRING(RS)->ptr, p-rslen+1, rslen) == 0)) { rb_lastline = str_new(s, p - s + 1); rb_yield(rb_lastline); s = p + 1; } } if (s != pend) { rb_lastline = str_new(s, p - s); rb_yield(rb_lastline); } return (VALUE)str; } static VALUE Fstr_each_byte(str) struct RString* str; { int i; for (i=0; str->len; i++) { rb_yield(str->ptr[i] & 0xff); } return (VALUE)str; } static VALUE Fstr_chop(str) struct RString *str; { str_modify(str); str->len--; str->ptr[str->len] = '\0'; return (VALUE)str; } static VALUE Fstr_strip(str) struct RString *str; { char *s, *t, *e; s = str->ptr; e = t = s + str->len; /* remove spaces at head */ while (s < t && isspace(*s)) s++; /* remove trailing spaces */ t--; while (s <= t && isspace(*t)) t--; t++; if (s > str->ptr || t < e) { char *p = str->ptr; int len = t-s; str->ptr = ALLOC_N(char, len+1); memcpy(str->ptr, p, len); str->ptr[len] = '\0'; if (str->orig) { str->orig = Qnil; } else { free(p); } } return (VALUE)str; } static VALUE Fstr_hex(str) struct RString *str; { return str2inum(str->ptr, 16); } static VALUE Fstr_oct(str) struct RString *str; { return str2inum(str->ptr, 8); } static VALUE Fstr_crypt(str, salt) struct RString *str, *salt; { Check_Type(salt, T_STRING); if (salt->len < 2) Fail("salt too short(need 2 byte)"); return str_new2(crypt(str->ptr, salt->ptr)); } static VALUE Fstr_intern(str) struct RString *str; { if (strlen(str->ptr) != str->len) Fail("string contains `\0'"); return rb_intern(str->ptr)|FIXNUM_FLAG; } static VALUE Fstr_sum(argc, argv, str) int argc; VALUE *argv; struct RString *str; { VALUE vbits; int bits; char *p, *pend; rb_scan_args(argc, argv, "01", &vbits); if (vbits == Qnil) bits = 16; else bits = NUM2INT(vbits); p = str->ptr; pend = p + str->len; if (bits > 32) { VALUE res = INT2FIX(0); VALUE mod; mod = rb_funcall(INT2FIX(1), rb_intern("<<"), 1, INT2FIX(bits)); mod = rb_funcall(mod, '-', 1, INT2FIX(1)); while (p < pend) { res = rb_funcall(res, '+', 1, INT2FIX((UINT)*p)); res = rb_funcall(res, '%', 1, mod); p++; } return res; } else { UINT res = 0; UINT mod = (1<len >= width) return (VALUE)str; res = (struct RString*)str_new(0, width); memcpy(res->ptr, str->ptr, str->len); p = res->ptr + str->len; pend = res->ptr + width; while (p < pend) { *p++ = ' '; } return (VALUE)res; } Fstr_rjust(str, w) struct RString *str; VALUE w; { int width = NUM2INT(w); struct RString *res; char *p, *pend; if (str->len >= width) return (VALUE)str; res = (struct RString*)str_new(0, width); p = res->ptr; pend = p + width - str->len; while (p < pend) { *p++ = ' '; } memcpy(pend, str->ptr, str->len); return (VALUE)res; } Fstr_center(str, w) struct RString *str; VALUE w; { int width = NUM2INT(w); struct RString *res; char *p, *pend; int n; if (str->len >= width) return (VALUE)str; res = (struct RString*)str_new(0, width); n = (width - str->len)/2; p = res->ptr; pend = p + n; while (p < pend) { *p++ = ' '; } memcpy(pend, str->ptr, str->len); p = pend + str->len; pend = res->ptr + width; while (p < pend) { *p++ = ' '; } return (VALUE)res; } extern VALUE C_Kernel; extern VALUE M_Comparable; extern VALUE M_Enumerable; Init_String() { C_String = rb_define_class("String", C_Object); rb_include_module(C_String, M_Comparable); rb_include_module(C_String, M_Enumerable); rb_define_single_method(C_String, "new", Sstr_new, 1); rb_define_method(C_String, "clone", str_clone, 0); rb_define_method(C_String, "<=>", Fstr_cmp, 1); rb_define_method(C_String, "==", Fstr_equal, 1); rb_define_method(C_String, "hash", Fstr_hash, 0); rb_define_method(C_String, "+", Fstr_plus, 1); rb_define_method(C_String, "*", Fstr_times, 1); rb_define_method(C_String, "..", Fstr_dot2, 1); rb_define_method(C_String, "[]", Fstr_aref, -1); rb_define_method(C_String, "[]=", Fstr_aset, -1); rb_define_method(C_String, "length", Fstr_length, 0); rb_define_alias(C_String, "size", "length"); rb_define_method(C_String, "=~", Fstr_match, 1); rb_define_method(C_String, "~", Fstr_match2, 0); rb_define_method(C_String, "next", Fstr_next, 0); rb_define_method(C_String, "upto", Fstr_next, 1); rb_define_method(C_String, "index", Fstr_index, -1); rb_define_method(C_String, "rindex", Fstr_rindex, -1); rb_define_method(C_String, "to_i", Fstr_to_i, 0); rb_define_method(C_String, "to_f", Fstr_to_f, 0); rb_define_method(C_String, "to_s", Fstr_to_s, 0); rb_define_method(C_String, "_inspect", Fstr_inspect, 0); rb_define_method(C_String, "toupper", Fstr_toupper, 0); rb_define_method(C_String, "tolower", Fstr_tolower, 0); rb_define_method(C_String, "upcase", Fstr_upcase, 0); rb_define_method(C_String, "downcase", Fstr_downcase, 0); rb_define_method(C_String, "capitalize", Fstr_capitalize, 0); rb_define_method(C_String, "swapcase", Fstr_swapcase, 0); rb_define_method(C_String, "hex", Fstr_hex, 0); rb_define_method(C_String, "oct", Fstr_oct, 0); rb_define_method(C_String, "split", Fstr_split, -1); rb_define_method(C_String, "reverse", Fstr_reverse, 0); rb_define_method(C_String, "concat", Fstr_concat, 1); rb_define_method(C_String, "crypt", Fstr_crypt, 1); rb_define_method(C_String, "intern", Fstr_intern, 0); rb_define_method(C_String, "ljust", Fstr_ljust, 1); rb_define_method(C_String, "rjust", Fstr_rjust, 1); rb_define_method(C_String, "center", Fstr_center, 1); rb_define_method(C_String, "sub", Fstr_sub, 2); rb_define_method(C_String, "gsub", Fstr_gsub, 2); rb_define_method(C_String, "chop", Fstr_chop, 0); rb_define_method(C_String, "strip", Fstr_strip, 0); rb_define_method(C_String, "tr", Fstr_tr, 2); rb_define_method(C_String, "tr_s", Fstr_tr_s, 2); rb_define_method(C_String, "delete", Fstr_delete, 1); rb_define_method(C_String, "squeeze", Fstr_squeeze, -1); rb_define_method(C_String, "each", Fstr_each, 0); rb_define_method(C_String, "each_byte", Fstr_each_byte, 0); rb_define_method(C_String, "sum", Fstr_sum, -1); rb_define_private_method(C_Kernel, "sub", Fsub, 2); rb_define_private_method(C_Kernel, "gsub", Fgsub, 2); pr_str = rb_intern("to_s"); } ./ruby-0.64/struct.c100644 150 1 11465 5704462402 12701 0ustar matzdaemon/************************************************ struct.c - $Author: matz $ $Date: 1995/01/10 10:43:02 $ created at: Tue Mar 22 18:44:30 JST 1994 ************************************************/ #include "ruby.h" #include "env.h" VALUE C_Struct; extern VALUE M_Enumerable; char *strdup(); static VALUE struct_alloc(class, name) VALUE class; char *name; { NEWOBJ(st, struct RStruct); OBJSETUP(st, class, T_STRUCT); if (name) st->name = strdup(name); else st->name = Qnil; st->len = 0; st->tbl = Qnil; return (VALUE)st; } static VALUE struct_find(s, id) struct RStruct *s; ID id; { struct kv_pair *t, *tend; t = s->tbl; tend = t + s->len; while (t < tend) { if (t->key == id) return t->value; t++; } Fail("struct %s has no member %s", s->name, rb_id2name(id)); } static VALUE Fstruct_access(s) struct RStruct *s; { return struct_find(s, the_env->last_func); } static VALUE struct_add(s, mem, val) struct RStruct *s; char *mem; VALUE val; { int pos = s->len; s->len++; if (s->tbl == Qnil) { s->tbl = ALLOC_N(struct kv_pair, 1); } else { REALLOC_N(s->tbl, struct kv_pair, s->len); } s->tbl[pos].key = rb_intern(mem); s->tbl[pos].value = val; rb_define_single_method(s, mem, Fstruct_access, 0); } #include VALUE struct_new(name, va_alist) char *name; va_dcl { VALUE st; va_list args; char *mem; st = struct_alloc(C_Struct,name); va_start(args); while (mem = va_arg(args, char*)) { struct_add(st, mem, va_arg(args, VALUE)); } va_end(vargs); return st; } #define ASSOC_KEY(a) RCONS(a)->car #define ASSOC_VAL(a) RCONS(a)->cdr static VALUE Sstruct_new(argc, argv, class) int argc; VALUE *argv; VALUE class; { VALUE name, st; struct RArray *tbl; int i, max; rb_scan_args(argc, argv, "1*", &name, &tbl); Check_Type(name, T_STRING); st = struct_alloc(class, RSTRING(name)->ptr); for (i=0, max=tbl->len; iptr[i]; Check_Type(assoc, T_CONS); Check_Type(ASSOC_KEY(assoc), T_STRING); struct_add(st, RSTRING(ASSOC_KEY(assoc))->ptr, ASSOC_VAL(assoc)); } return st; } static VALUE Fstruct_each(s) struct RStruct *s; { struct kv_pair *t, *tend; t = s->tbl; tend = t + s->len; while (t < tend) { rb_yield(t->value); t++; } } static VALUE Fstruct_values(s) struct RStruct *s; { VALUE ary; struct kv_pair *t, *tend; ary = ary_new(); t = s->tbl; tend = t + s->len; while (t < tend) { ary_push(ary, t->value); t++; } return ary; } static VALUE Fstruct_aref(s, idx) struct RStruct *s; VALUE idx; { struct RArray *ary; int i; if (TYPE(idx) == T_STRING) return struct_find(rb_intern(RSTRING(idx)->ptr)); i = NUM2INT(idx); if (s->len <= i) Fail("offset %d too large for struct(size:%d)", i, s->len); return s->tbl[i].value; } #define HDR "struct " static VALUE Fstruct_to_s(s) struct RStruct *s; { char *buf; buf = ALLOCA_N(char, strlen(s->name)+sizeof(HDR)+1); sprintf(buf, "%s%s", HDR, s->name); return str_new2(buf); } static VALUE Fstruct_inspect(s) struct RStruct *s; { VALUE str, str2; char buf[256], *p; int i; ID inspect = rb_intern("_inspect"); sprintf(buf, "#<%s%s: ", HDR, s->name); str = str_new2(buf); for (i=0; ilen; i++) { if (i > 0) { str_cat(str, ", ", 2); } p = rb_id2name(s->tbl[i].key); str_cat(str, p, strlen(p)); str_cat(str, "=", 1); str2 = rb_funcall(s->tbl[i].value, inspect, 0, Qnil); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); } str_cat(str, ">", 1); return str; } static VALUE Fstruct_to_a(s) struct RStruct *s; { VALUE ary; int i; ary = ary_new2(s->len); for (i=0; ilen; i++) { ary_push(ary, s->tbl[i].value); } return ary; } static VALUE Fstruct_clone(s) struct RStruct *s; { struct RStruct *st = (struct RStruct*)struct_alloc(s->name); CLONESETUP(st, s); st->len = s->len; st->tbl = ALLOC_N(struct kv_pair, s->len); MEMCPY(st->tbl, s->tbl, struct kv_pair, st->len); RBASIC(st)->class = single_class_clone(RBASIC(s)->class); return (VALUE)st; } Init_Struct() { C_Struct = rb_define_class("Struct", C_Object); rb_include_module(C_Struct, M_Enumerable); rb_define_single_method(C_Struct, "new", Sstruct_new, -1); rb_define_method(C_Struct, "clone", Fstruct_clone, 0); rb_define_method(C_Struct, "to_s", Fstruct_to_s, 0); rb_define_method(C_Struct, "_inspect", Fstruct_inspect, 0); rb_define_method(C_Struct, "to_a", Fstruct_to_a, 0); rb_define_method(C_Struct, "each", Fstruct_each, 0); rb_define_method(C_Struct, "values", Fstruct_values, 0); rb_define_method(C_Struct, "[]", Fstruct_aref, 1); } ./ruby-0.64/time.c100644 150 1 26340 5674170245 12320 0ustar matzdaemon/************************************************ time.c - $Author: matz $ $Date: 1994/12/06 09:30:28 $ created at: Tue Dec 28 14:31:59 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include #include #include #include static VALUE C_Time; extern VALUE M_Comparable; struct time_object { struct timeval tv; struct tm tm; #ifndef HAVE_TM_ZONE int gmt; #endif int tm_got; }; static ID id_tv; #define GetTimeval(obj, tobj) \ Get_Data_Struct(obj, id_tv, struct time_object, tobj) #define MakeTimeval(obj,tobj) {\ Make_Data_Struct(obj, id_tv, struct time_object, Qnil, Qnil, tobj);\ tobj->tm_got=0;\ } static VALUE Stime_now(class) VALUE class; { VALUE obj = obj_alloc(class); struct time_object *tobj; MakeTimeval(obj, tobj); if (gettimeofday(&(tobj->tv), 0) == -1) { rb_sys_fail("gettimeofday"); } return obj; } static VALUE time_new_internal(class, sec, usec) int sec, usec; { VALUE obj = obj_alloc(class); struct time_object *tobj; MakeTimeval(obj, tobj); tobj->tv.tv_sec = sec; tobj->tv.tv_usec = usec; return obj; } VALUE time_new(sec, usec) int sec, usec; { return time_new_internal(C_Time, sec, usec); } struct timeval* time_timeval(time) VALUE time; { struct time_object *tobj; static struct timeval t, *tp; switch (TYPE(time)) { case T_FIXNUM: t.tv_sec = FIX2UINT(time); if (t.tv_sec < 0) Fail("time must be positive"); t.tv_usec = 0; tp = &t; break; case T_FLOAT: { double seconds, microseconds; if (RFLOAT(time)->value < 0.0) Fail("time must be positive"); seconds = floor(RFLOAT(time)->value); microseconds = (RFLOAT(time)->value - seconds) * 1000000.0; t.tv_sec = seconds; t.tv_usec = microseconds; tp = &t; } break; default: if (!obj_is_kind_of(time, C_Time)) { Fail("Can't convert %s into Time", rb_class2name(CLASS_OF(time))); } GetTimeval(time, tobj); tp = &(tobj->tv); break; } return tp; } static VALUE Stime_at(class, time) VALUE class, time; { VALUE obj; int sec, usec; struct time_object *tobj; struct timeval *tp; tp = time_timeval(time); return time_new_internal(class, tp->tv_sec, tp->tv_usec); } static VALUE Ftime_to_i(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); return int2inum(tobj->tv.tv_sec); } static VALUE Ftime_to_f(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); return float_new((double)tobj->tv.tv_sec+(double)tobj->tv.tv_usec/1000000); } static VALUE Ftime_usec(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); return INT2FIX(tobj->tv.tv_usec); } static VALUE Ftime_cmp(time1, time2) VALUE time1, time2; { struct time_object *tobj1, *tobj2; int i; GetTimeval(time1, tobj1); if (obj_is_member_of(time2, C_Time)) { GetTimeval(time2, tobj2); if (tobj1->tv.tv_sec == tobj2->tv.tv_sec) { if (tobj1->tv.tv_usec == tobj2->tv.tv_usec) return INT2FIX(0); if (tobj1->tv.tv_usec > tobj2->tv.tv_usec) return INT2FIX(1); return FIX2INT(-1); } if (tobj1->tv.tv_sec > tobj2->tv.tv_sec) return INT2FIX(1); return FIX2INT(-1); } i = NUM2INT(time2); if (tobj1->tv.tv_sec == i) return INT2FIX(0); if (tobj1->tv.tv_sec > i) return INT2FIX(1); return FIX2INT(-1); } static VALUE Ftime_hash(time) VALUE time; { struct time_object *tobj; int hash; GetTimeval(time, tobj); hash = tobj->tv.tv_sec ^ tobj->tv.tv_usec; return INT2FIX(hash); } static VALUE Ftime_localtime(time) VALUE time; { struct time_object *tobj; struct tm *tm_tmp; GetTimeval(time, tobj); tm_tmp = localtime(&tobj->tv.tv_sec); tobj->tm = *tm_tmp; tobj->tm_got = 1; #ifndef HAVE_TM_ZONE tobj->gmt = 0; #endif return time; } static VALUE Ftime_gmtime(time) VALUE time; { struct time_object *tobj; struct tm *tm_tmp; GetTimeval(time, tobj); tm_tmp = gmtime(&tobj->tv.tv_sec); tobj->tm = *tm_tmp; tobj->tm_got = 1; #ifndef HAVE_TM_ZONE tobj->gmt = 1; #endif return time; } static VALUE Ftime_asctime(time) VALUE time; { struct time_object *tobj; char *ct; char buf[32]; int len; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } #ifndef HAVE_TM_ZONE if (tobj->gmt == 1) len = strftime(buf, 32, "%a %b %d %H:%M:%S GMT %Y", &(tobj->tm)); else #endif { len = strftime(buf, 32, "%a %b %d %H:%M:%S %Z %Y", &(tobj->tm)); } return str_new(buf, len); } static VALUE Ftime_coerce(time1, time2) VALUE time1, time2; { return time_new(CLASS_OF(time1), NUM2INT(time2), 0); } static VALUE Ftime_plus(time1, time2) VALUE time1, time2; { struct time_object *tobj1, *tobj2; int sec, usec; GetTimeval(time1, tobj1); if (obj_is_member_of(time2, C_Time)) { GetTimeval(time2, tobj2); sec = tobj1->tv.tv_sec + tobj2->tv.tv_sec; usec = tobj1->tv.tv_usec + tobj2->tv.tv_usec; } else { sec = tobj1->tv.tv_sec + NUM2INT(time2); usec = tobj1->tv.tv_usec; if (usec >= 1000000) { sec++; usec -= 1000000; } } return time_new(sec, usec); } static VALUE Ftime_minus(time1, time2) VALUE time1, time2; { struct time_object *tobj1, *tobj2; int sec, usec; GetTimeval(time1, tobj1); if (obj_is_member_of(time2, C_Time)) { GetTimeval(time2, tobj2); sec = tobj1->tv.tv_sec - tobj2->tv.tv_sec; usec = tobj1->tv.tv_usec - tobj2->tv.tv_usec; if (usec < 0) { sec--; usec += 1000000; } } else { sec = tobj1->tv.tv_sec - NUM2INT(time2); usec = tobj1->tv.tv_usec; } return time_new(sec, usec); } static VALUE Ftime_sec(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } return INT2FIX(tobj->tm.tm_sec); } static VALUE Ftime_min(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } return INT2FIX(tobj->tm.tm_min); } static VALUE Ftime_hour(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } return INT2FIX(tobj->tm.tm_hour); } static VALUE Ftime_mday(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } return INT2FIX(tobj->tm.tm_mday); } static VALUE Ftime_mon(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } return INT2FIX(tobj->tm.tm_mon); } static VALUE Ftime_year(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } return INT2FIX(tobj->tm.tm_year); } static VALUE Ftime_wday(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } return INT2FIX(tobj->tm.tm_wday); } static VALUE Ftime_yday(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } return INT2FIX(tobj->tm.tm_yday); } static VALUE Ftime_isdst(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } return INT2FIX(tobj->tm.tm_isdst); } static VALUE Ftime_zone(time) VALUE time; { struct time_object *tobj; char buf[10]; int len; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } len = strftime(buf, 10, "%Z", &(tobj->tm)); return str_new(buf, len); } static VALUE Ftime_to_a(time) VALUE time; { struct time_object *tobj; struct tm *tm; char buf[10]; VALUE ary; GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } ary = ary_new3(9, INT2FIX(tobj->tm.tm_sec), INT2FIX(tobj->tm.tm_min), INT2FIX(tobj->tm.tm_hour), INT2FIX(tobj->tm.tm_mday), INT2FIX(tobj->tm.tm_mon), INT2FIX(tobj->tm.tm_year), INT2FIX(tobj->tm.tm_wday), INT2FIX(tobj->tm.tm_yday), INT2FIX(tobj->tm.tm_isdst)); return ary; } static VALUE Ftime_strftime(time, format) VALUE time, format; { struct time_object *tobj; char buf[100]; int len; Check_Type(format, T_STRING); GetTimeval(time, tobj); if (tobj->tm_got == 0) { Ftime_localtime(time); } if (strlen(RSTRING(format)->ptr) < RSTRING(format)->len) { /* Ruby string contains \0. */ VALUE str; int l, total = 0; char *p = RSTRING(format)->ptr, *pe = p + RSTRING(format)->len; str = str_new(0, 0); while (p < pe) { len = strftime(buf, 100, p, &(tobj->tm)); str_cat(str, buf, len); l = strlen(p); p += l + 1; } return str; } len = strftime(buf, 100, RSTRING(format)->ptr, &(tobj->tm)); return str_new(buf, len); } static VALUE Stime_times(obj) VALUE obj; { struct tms buf; if (times(&buf) == -1) rb_sys_fail(Qnil); return struct_new("tms", "utime", float_new((double)buf.tms_utime / 60.0), "stime", float_new((double)buf.tms_stime / 60.0), "cutime", float_new((double)buf.tms_cutime / 60.0), "cstime", float_new((double)buf.tms_cstime / 60.0), Qnil); } Init_Time() { C_Time = rb_define_class("Time", C_Object); rb_include_module(C_Time, M_Comparable); rb_define_single_method(C_Time, "now", Stime_now, 0); rb_define_single_method(C_Time, "new", Stime_now, 0); rb_define_single_method(C_Time, "at", Stime_at, 1); rb_define_single_method(C_Time, "times", Stime_times, 0); rb_define_method(C_Time, "to_i", Ftime_to_i, 0); rb_define_method(C_Time, "to_f", Ftime_to_f, 0); rb_define_method(C_Time, "<=>", Ftime_cmp, 1); rb_define_method(C_Time, "hash", Ftime_hash, 0); rb_define_method(C_Time, "localtime", Ftime_localtime, 0); rb_define_method(C_Time, "gmtime", Ftime_gmtime, 0); rb_define_method(C_Time, "ctime", Ftime_asctime, 0); rb_define_method(C_Time, "asctime", Ftime_asctime, 0); rb_define_method(C_Time, "to_s", Ftime_asctime, 0); rb_define_method(C_Time, "_inspect", Ftime_asctime, 0); rb_define_method(C_Time, "to_a", Ftime_to_a, 0); rb_define_method(C_Time, "coerce", Ftime_coerce, 1); rb_define_method(C_Time, "+", Ftime_plus, 1); rb_define_method(C_Time, "-", Ftime_minus, 1); rb_define_method(C_Time, "sec", Ftime_sec, 0); rb_define_method(C_Time, "min", Ftime_min, 0); rb_define_method(C_Time, "hour", Ftime_hour, 0); rb_define_method(C_Time, "mday", Ftime_mday, 0); rb_define_method(C_Time, "year", Ftime_year, 0); rb_define_method(C_Time, "wday", Ftime_wday, 0); rb_define_method(C_Time, "yday", Ftime_yday, 0); rb_define_method(C_Time, "isdst", Ftime_isdst, 0); rb_define_method(C_Time, "tv_sec", Ftime_to_i, 0); rb_define_method(C_Time, "tv_usec", Ftime_usec, 0); rb_define_method(C_Time, "usec", Ftime_usec, 0); rb_define_method(C_Time, "strftime", Ftime_strftime, 1); id_tv = rb_intern("tv"); } ./ruby-0.64/variable.c100644 150 1 14756 5704462404 13152 0ustar matzdaemon/************************************************ variable.c - $Author: matz $ $Date: 1995/01/10 10:43:03 $ created at: Tue Apr 19 23:55:15 JST 1994 ************************************************/ #include "ruby.h" #include "env.h" #include "node.h" #include "ident.h" #include "st.h" st_table *rb_global_tbl; st_table *rb_class_tbl; #define global_tbl rb_global_tbl #define class_tbl rb_class_tbl #define instance_tbl (RBASIC(Qself)->iv_tbl) st_table *new_idhash() { return st_init_table(ST_NUMCMP, ST_NUMHASH); } void Init_var_tables() { global_tbl = new_idhash(); class_tbl = new_idhash(); } void rb_name_class(class, id) VALUE class; ID id; { VALUE body; if (st_lookup(class_tbl, id, &body)) { Bug("%s %s already exists", TYPE(body)==T_CLASS?"class":"module", rb_id2name(id)); } st_add_direct(class_tbl, id, class); } struct global_entry { enum { GLOBAL_VAL, GLOBAL_VAR, GLOBAL_UNDEF } mode; ID id; union { VALUE val; VALUE *var; } v; VALUE (*get_hook)(); VALUE (*set_hook)(); void *data; }; static mark_global_entry(key, entry) ID key; struct global_entry *entry; { switch (entry->mode) { case GLOBAL_VAL: gc_mark(entry->v.val); /* normal global value */ break; case GLOBAL_VAR: if (entry->v.var) gc_mark(*entry->v.var); /* c variable pointer */ break; default: break; } if (entry->data) { gc_mark_maybe(entry->data); } return ST_CONTINUE; } void gc_mark_global_tbl() { st_foreach(global_tbl, mark_global_entry, 0); } struct global_entry* rb_global_entry(id) ID id; { struct global_entry *entry; if (!st_lookup(global_tbl, id, &entry)) { entry = ALLOC(struct global_entry); st_insert(global_tbl, id, entry); entry->id = id; entry->mode = GLOBAL_UNDEF; entry->v.var = Qnil; entry->get_hook = entry->set_hook = Qnil; } return entry; } void rb_define_variable(name, var, get_hook, set_hook, data) char *name; VALUE *var; VALUE (*get_hook)(); VALUE (*set_hook)(); void *data; { struct global_entry *entry; ID id; if (name[0] == '$') id = rb_intern(name); else { char *buf = ALLOCA_N(char, strlen(name)+2); buf[0] = '$'; strcpy(buf+1, name); id = rb_intern(buf); } entry = rb_global_entry(id); entry->mode = GLOBAL_VAR; entry->v.var = var; entry->get_hook = get_hook; entry->set_hook = set_hook; entry->data = data; } void rb_define_varhook(name, get_hook, set_hook, data) char *name; VALUE (*get_hook)(); VALUE (*set_hook)(); void *data; { struct global_entry *entry; ID id; if (name[0] == '$') id = rb_intern(name); else { char *buf = ALLOCA_N(char, strlen(name)+2); buf[0] = '$'; strcpy(buf+1, name); id = rb_intern(buf); } if (!st_lookup(global_tbl, id, &entry)) { entry = ALLOC(struct global_entry); entry->id = id; entry->mode = GLOBAL_VAL; st_insert(global_tbl, id, entry); } else if (entry->mode == GLOBAL_UNDEF) { entry->mode = GLOBAL_VAL; } entry->v.val = Qnil; entry->get_hook = get_hook; entry->set_hook = set_hook; if (data) { entry->data = data; } } VALUE rb_readonly_hook(val, id) VALUE val; ID id; { Fail("Can't set variable %s", rb_id2name(id)); /* not reached */ } VALUE rb_id2class(id) ID id; { VALUE class; if (st_lookup(class_tbl, id, &class)) return class; return Qnil; } VALUE rb_gvar_get(entry) struct global_entry *entry; { VALUE val; if (entry->get_hook) val = (*entry->get_hook)(entry->id, entry->data); switch (entry->mode) { case GLOBAL_VAL: return entry->v.val; case GLOBAL_VAR: if (entry->v.var == Qnil) return val; return *entry->v.var; default: break; } if (verbose) Warning("global var %s not initialized", rb_id2name(entry->id)); return Qnil; } VALUE rb_ivar_get_1(obj, id) struct RBasic *obj; ID id; { VALUE val; if (obj->iv_tbl == Qnil) return Qnil; if (st_lookup(obj->iv_tbl, id, &val)) return val; if (verbose) Warning("instance var %s not initialized", rb_id2name(id)); return Qnil; } VALUE rb_ivar_get(id) ID id; { return rb_ivar_get_1(Qself, id); } VALUE rb_mvar_get(id) ID id; { VALUE val; if (st_lookup(class_tbl, id, &val)) return val; if (verbose) Warning("local var %s not initialized", rb_id2name(id)); return Qnil; } VALUE rb_const_get(id) ID id; { struct RClass *class = (struct RClass*)CLASS_OF(Qself); VALUE value; while (class) { if (class->c_tbl && st_lookup(class->c_tbl, id, &value)) { return value; } class = class->super; } Fail("Uninitialized constant %s", rb_id2name(id)); /* not reached */ } VALUE rb_gvar_set(entry, val) struct global_entry *entry; VALUE val; { if (entry->set_hook) (*entry->set_hook)(val, entry->id, entry->data); if (entry->mode == GLOBAL_VAR) { if (entry->v.var) { *entry->v.var = val; } } else { if (entry->mode == GLOBAL_UNDEF) { entry->mode = GLOBAL_VAL; } entry->v.val = val; } return val; } VALUE rb_gvar_set2(name, val) char *name; VALUE val; { struct global_entry *entry; ID id; id = rb_intern(name); if (!st_lookup(global_tbl, id, &entry)) { entry = rb_global_entry(id); } rb_gvar_set(entry, val); return val; } VALUE rb_ivar_set_1(obj, id, val) struct RBasic *obj; ID id; VALUE val; { if (obj->iv_tbl == Qnil) obj->iv_tbl = new_idhash(); st_insert(obj->iv_tbl, id, val); return val; } VALUE rb_ivar_set(id, val) ID id; VALUE val; { return rb_ivar_set_1(Qself, id, val); } static VALUE const_bound(class, id) struct RClass *class; ID id; { while (class) { if (class->c_tbl && st_lookup(class->c_tbl, id, Qnil)) { return TRUE; } class = class->super; } return FALSE; } void rb_const_set(class, id, val) struct RClass *class; ID id; VALUE val; { if (const_bound(class, id)) Fail("already initialized constnant"); if (class->c_tbl == Qnil) class->c_tbl = new_idhash(); st_insert(class->c_tbl, id, val); } void rb_define_const(class, name, val) struct RClass *class; char *name; VALUE val; { rb_const_set(class, rb_intern(name), val); } VALUE rb_iv_get(obj, name) VALUE obj; char *name; { ID id = rb_intern(name); return rb_ivar_get_1(obj, id); } VALUE rb_iv_set(obj, name, val) VALUE obj; char *name; VALUE val; { ID id = rb_intern(name); return rb_ivar_set_1(obj, id, val); } ./ruby-0.64/version.c100644 150 1 1321 5704462406 13014 0ustar matzdaemon/************************************************ version.c - $Author: matz $ $Revision: 1.4 $ $Date: 1994/12/19 08:30:17 $ created at: Thu Sep 30 20:08:01 JST 1993 Copyright (C) 1994 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "version.h" #include static VALUE rb_version; VALUE rb_readonly_hook(); Init_version() { rb_version = str_new2(RUBY_VERSION); rb_define_variable("$VERSION", &rb_version, Qnil, rb_readonly_hook, 0); } show_version() { fprintf(stderr, "ruby - version %s (%s)\n", RUBY_VERSION, VERSION_DATE); } show_copyright() { fprintf(stderr, "ruby - Copyright (C) 1994 Yukihiro Matsumoto\n"); exit(0); } ./ruby-0.64/version.h100644 150 1 74 5704462407 12766 0ustar matzdaemon#define RUBY_VERSION "0.64" #define VERSION_DATE "95/01/10" ./ruby-0.64/missing/ 40755 150 1 0 5704463033 12537 5ustar matzdaemon./ruby-0.64/missing/alloca.c100644 150 1 12222 5674170245 14260 0ustar matzdaemon/* alloca -- (mostly) portable public-domain implementation -- D A Gwyn last edit: 86/05/30 rms include config.h, since on VMS it renames some symbols. Use xmalloc instead of malloc. This implementation of the PWB library alloca() function, which is used to allocate space off the run-time stack so that it is automatically reclaimed upon procedure exit, was inspired by discussions with J. Q. Johnson of Cornell. It should work under any C implementation that uses an actual procedure stack (as opposed to a linked list of frames). There are some preprocessor constants that can be defined when compiling for your specific system, for improved efficiency; however, the defaults should be okay. The general concept of this implementation is to keep track of all alloca()-allocated blocks, and reclaim any that are found to be deeper in the stack than the current invocation. This heuristic does not reclaim storage as soon as it becomes invalid, but it will do so eventually. As a special case, alloca(0) reclaims storage without allocating any. It is a good idea to use alloca(0) in your main control loop, etc. to force garbage collection. */ #ifndef lint static char SCCSid[] = "@(#)alloca.c 1.1"; /* for the "what" utility */ #endif #include "config.h" #ifdef emacs #ifdef static /* actually, only want this if static is defined as "" -- this is for usg, in which emacs must undefine static in order to make unexec workable */ #ifndef STACK_DIRECTION you lose -- must know STACK_DIRECTION at compile-time #endif /* STACK_DIRECTION undefined */ #endif /* static */ #endif /* emacs */ #ifdef X3J11 typedef void *pointer; /* generic pointer type */ #else typedef char *pointer; /* generic pointer type */ #endif /* X3J11 */ #define NULL 0 /* null pointer constant */ extern void free(); extern pointer xmalloc(); /* Define STACK_DIRECTION if you know the direction of stack growth for your system; otherwise it will be automatically deduced at run-time. STACK_DIRECTION > 0 => grows toward higher addresses STACK_DIRECTION < 0 => grows toward lower addresses STACK_DIRECTION = 0 => direction of growth unknown */ #ifndef STACK_DIRECTION #define STACK_DIRECTION 0 /* direction unknown */ #endif #if STACK_DIRECTION != 0 #define STACK_DIR STACK_DIRECTION /* known at compile-time */ #else /* STACK_DIRECTION == 0; need run-time code */ static int stack_dir; /* 1 or -1 once known */ #define STACK_DIR stack_dir static void find_stack_direction (/* void */) { static char *addr = NULL; /* address of first `dummy', once known */ auto char dummy; /* to get stack address */ if (addr == NULL) { /* initial entry */ addr = &dummy; find_stack_direction (); /* recurse once */ } else /* second entry */ if (&dummy > addr) stack_dir = 1; /* stack grew upward */ else stack_dir = -1; /* stack grew downward */ } #endif /* STACK_DIRECTION == 0 */ /* An "alloca header" is used to: (a) chain together all alloca()ed blocks; (b) keep track of stack depth. It is very important that sizeof(header) agree with malloc() alignment chunk size. The following default should work okay. */ #ifndef ALIGN_SIZE #define ALIGN_SIZE sizeof(double) #endif typedef union hdr { char align[ALIGN_SIZE]; /* to force sizeof(header) */ struct { union hdr *next; /* for chaining headers */ char *deep; /* for stack depth measure */ } h; } header; /* alloca( size ) returns a pointer to at least `size' bytes of storage which will be automatically reclaimed upon exit from the procedure that called alloca(). Originally, this space was supposed to be taken from the current stack frame of the caller, but that method cannot be made to work for some implementations of C, for example under Gould's UTX/32. */ static header *last_alloca_header = NULL; /* -> last alloca header */ pointer alloca (size) /* returns pointer to storage */ unsigned size; /* # bytes to allocate */ { auto char probe; /* probes stack depth: */ register char *depth = &probe; #if STACK_DIRECTION == 0 if (STACK_DIR == 0) /* unknown growth direction */ find_stack_direction (); #endif /* Reclaim garbage, defined as all alloca()ed storage that was allocated from deeper in the stack than currently. */ { register header *hp; /* traverses linked list */ for (hp = last_alloca_header; hp != NULL;) if (STACK_DIR > 0 && hp->h.deep > depth || STACK_DIR < 0 && hp->h.deep < depth) { register header *np = hp->h.next; free ((pointer) hp); /* collect garbage */ hp = np; /* -> next header */ } else break; /* rest are not deeper */ last_alloca_header = hp; /* -> last valid storage */ } if (size == 0) return NULL; /* no allocation required */ /* Allocate combined header + user data storage. */ { register pointer new = xmalloc (sizeof (header) + size); /* address of header */ ((header *)new)->h.next = last_alloca_header; ((header *)new)->h.deep = depth; last_alloca_header = (header *)new; /* User storage begins just after header. */ return (pointer)((char *)new + sizeof(header)); } } ./ruby-0.64/missing/memmove.c100644 150 1 553 5674170245 14436 0ustar matzdaemon/* * memmove --- move memories. * * We supply this routine for those systems that aren't standard yet. */ char * memmove (dst, src, n) char *dst, *src; int n; { char *ret = dst; if (src < dst) { src += n; dst += n; while (n--) *--dst = *--src; } else if (dst < src) while (n--) *dst++ = *src++; return ret; } ./ruby-0.64/missing/mkdir.c100644 150 1 4720 5674170245 14117 0ustar matzdaemon/* * Written by Robert Rother, Mariah Corporation, August 1985. * * If you want it, it's yours. All I ask in return is that if you * figure out how to do this in a Bourne Shell script you send me * a copy. * sdcsvax!rmr or rmr@uscd * * Severely hacked over by John Gilmore to make a 4.2BSD compatible * subroutine. 11Mar86; hoptoad!gnu * * Modified by rmtodd@uokmax 6-28-87 -- when making an already existing dir, * subroutine didn't return EEXIST. It does now. */ #include /* * Make a directory. */ int mkdir (dpath, dmode) char *dpath; int dmode; { int cpid, status; struct stat statbuf; if (stat (dpath, &statbuf) == 0) { errno = EEXIST; /* Stat worked, so it already exists */ return -1; } /* If stat fails for a reason other than non-existence, return error */ if (errno != ENOENT) return -1; switch (cpid = fork ()) { case -1: /* Error in fork() */ return (-1); /* Errno is set already */ case 0: /* Child process */ /* * Cheap hack to set mode of new directory. Since this * child process is going away anyway, we zap its umask. * FIXME, this won't suffice to set SUID, SGID, etc. on this * directory. Does anybody care? */ status = umask (0); /* Get current umask */ status = umask (status | (0777 & ~dmode)); /* Set for mkdir */ execl ("/bin/mkdir", "mkdir", dpath, (char *) 0); _exit (-1); /* Can't exec /bin/mkdir */ default: /* Parent process */ while (cpid != wait (&status)); /* Wait for kid to finish */ } if (WIFSIGNALED (status) || WEXITSTATUS (status) != 0) { errno = EIO; /* We don't know why, but */ return -1; /* /bin/mkdir failed */ } return 0; } int rmdir (dpath) char *dpath; { int cpid, status; struct stat statbuf; if (stat (dpath, &statbuf) != 0) { /* Stat just set errno. We don't have to */ return -1; } switch (cpid = fork ()) { case -1: /* Error in fork() */ return (-1); /* Errno is set already */ case 0: /* Child process */ execl ("/bin/rmdir", "rmdir", dpath, (char *) 0); _exit (-1); /* Can't exec /bin/mkdir */ default: /* Parent process */ while (cpid != wait (&status)); /* Wait for kid to finish */ } if (WIFSIGNALED (status) || WEXITSTATUS (status) != 0) { errno = EIO; /* We don't know why, but */ return -1; /* /bin/mkdir failed */ } return 0; } ./ruby-0.64/missing/strdup.c100644 150 1 673 5674170245 14315 0ustar matzdaemon/************************************************ strdup.c - $Author: matz $ $Date: 1994/12/09 09:47:57 $ created at: Wed Dec 7 15:34:01 JST 1994 ************************************************/ #include char * strdup(str) char *str; { extern char *xmalloc(); char *tmp; int len = strlen(str) + 1; tmp = xmalloc(len); if (tmp == NULL) return NULL; memcpy(tmp, str, len); return tmp; } ./ruby-0.64/missing/strerror.c100644 150 1 521 5674170245 14646 0ustar matzdaemon/* * strerror.c --- Map an integer error number into a printable string. */ extern int sys_nerr; extern char *sys_errlist[]; static char msg[50]; char * strerror(error) int error; { if ((error <= sys_nerr) && (error > 0)) { return sys_errlist[error]; } sprintf (msg, "Unknown error (%d)", error); return msg; } ./ruby-0.64/missing/strftime.c100644 150 1 45131 5674170246 14670 0ustar matzdaemon/* * strftime.c * * Public-domain implementation of ANSI C library routine. * * It's written in old-style C for maximal portability. * However, since I'm used to prototypes, I've included them too. * * If you want stuff in the System V ascftime routine, add the SYSV_EXT define. * For extensions from SunOS, add SUNOS_EXT. * For stuff needed to implement the P1003.2 date command, add POSIX2_DATE. * For VMS dates, add VMS_EXT. * For complete POSIX semantics, add POSIX_SEMANTICS. * * The code for %c, %x, and %X is my best guess as to what's "appropriate". * This version ignores LOCALE information. * It also doesn't worry about multi-byte characters. * So there. * * This file is also shipped with GAWK (GNU Awk), gawk specific bits of * code are included if GAWK is defined. * * Arnold Robbins * January, February, March, 1991 * Updated March, April 1992 * Updated April, 1993 * Updated February, 1994 * Updated May, 1994 * * Fixes from ado@elsie.nci.nih.gov * February 1991, May 1992 * Fixes from Tor Lillqvist tml@tik.vtt.fi * May, 1993 * Further fixes from ado@elsie.nci.nih.gov * February 1994 */ #include "config.h" #include #include #if defined (HAVE_STRING_H) # include #else /* !HAVE_STRING_H */ # include #endif /* !HAVE_STRING_H */ #include #include #include /* defaults: season to taste */ #define SYSV_EXT 1 /* stuff in System V ascftime routine */ #define SUNOS_EXT 1 /* stuff in SunOS strftime routine */ #define POSIX2_DATE 1 /* stuff in Posix 1003.2 date command */ #define VMS_EXT 1 /* include %v for VMS date format */ #ifndef RUBY #define POSIX_SEMANTICS 1 /* call tzset() if TZ changes */ #endif #if defined(POSIX2_DATE) #if ! defined(SYSV_EXT) #define SYSV_EXT 1 #endif #if ! defined(SUNOS_EXT) #define SUNOS_EXT 1 #endif #endif #if defined(POSIX2_DATE) #define adddecl(stuff) stuff #else #define adddecl(stuff) #endif #undef strchr /* avoid AIX weirdness */ #ifndef __STDC__ #define const /**/ extern void *malloc(); extern void *realloc(); extern void tzset(); extern char *strchr(); extern char *getenv(); static int weeknumber(); adddecl(static int iso8601wknum();) #else extern void *malloc(unsigned count); extern void *realloc(void *ptr, unsigned count); extern void tzset(void); extern char *strchr(const char *str, int ch); extern char *getenv(const char *v); static int weeknumber(const struct tm *timeptr, int firstweekday); adddecl(static int iso8601wknum(const struct tm *timeptr);) #endif #ifdef __GNUC__ #define inline __inline__ #else #define inline /**/ #endif #define range(low, item, hi) max(low, min(item, hi)) #if !defined(OS2) && !defined(MSDOS) && defined(HAVE_TZNAME) extern char *tzname[2]; # ifdef HAVE_DAYLIGHT extern int daylight; # endif #endif /* min --- return minimum of two numbers */ #ifndef __STDC__ static inline int min(a, b) int a, b; #else static inline int min(int a, int b) #endif { return (a < b ? a : b); } /* max --- return maximum of two numbers */ #ifndef __STDC__ static inline int max(a, b) int a, b; #else static inline int max(int a, int b) #endif { return (a > b ? a : b); } /* strftime --- produce formatted time */ #ifndef __STDC__ size_t strftime(s, maxsize, format, timeptr) char *s; size_t maxsize; const char *format; const struct tm *timeptr; #else size_t strftime(char *s, size_t maxsize, const char *format, const struct tm *timeptr) #endif { char *endp = s + maxsize; char *start = s; auto char tbuf[100]; int i; static short first = 1; #ifdef POSIX_SEMANTICS static char *savetz = NULL; static int savetzlen = 0; char *tz; #endif /* POSIX_SEMANTICS */ #ifndef HAVE_TM_ZONE extern char *timezone(); struct timeval tv; struct timezone zone; #endif /* HAVE_TM_ZONE */ /* various tables, useful in North America */ static const char *days_a[] = { "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat", }; static const char *days_l[] = { "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", }; static const char *months_a[] = { "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec", }; static const char *months_l[] = { "January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December", }; static const char *ampm[] = { "AM", "PM", }; if (s == NULL || format == NULL || timeptr == NULL || maxsize == 0) return 0; /* quick check if we even need to bother */ if (strchr(format, '%') == NULL && strlen(format) + 1 >= maxsize) return 0; #ifndef POSIX_SEMANTICS if (first) { tzset(); first = 0; } #else /* POSIX_SEMANTICS */ tz = getenv("TZ"); if (first) { if (tz != NULL) { int tzlen = strlen(tz); savetz = (char *) malloc(tzlen + 1); if (savetz != NULL) { savetzlen = tzlen + 1; strcpy(savetz, tz); } } tzset(); first = 0; } /* if we have a saved TZ, and it is different, recapture and reset */ if (tz && savetz && (tz[0] != savetz[0] || strcmp(tz, savetz) != 0)) { i = strlen(tz) + 1; if (i > savetzlen) { savetz = (char *) realloc(savetz, i); if (savetz) { savetzlen = i; strcpy(savetz, tz); } } else strcpy(savetz, tz); tzset(); } #endif /* POSIX_SEMANTICS */ for (; *format && s < endp - 1; format++) { tbuf[0] = '\0'; if (*format != '%') { *s++ = *format; continue; } again: switch (*++format) { case '\0': *s++ = '%'; goto out; case '%': *s++ = '%'; continue; case 'a': /* abbreviated weekday name */ if (timeptr->tm_wday < 0 || timeptr->tm_wday > 6) strcpy(tbuf, "?"); else strcpy(tbuf, days_a[timeptr->tm_wday]); break; case 'A': /* full weekday name */ if (timeptr->tm_wday < 0 || timeptr->tm_wday > 6) strcpy(tbuf, "?"); else strcpy(tbuf, days_l[timeptr->tm_wday]); break; #ifdef SYSV_EXT case 'h': /* abbreviated month name */ #endif case 'b': /* abbreviated month name */ if (timeptr->tm_mon < 0 || timeptr->tm_mon > 11) strcpy(tbuf, "?"); else strcpy(tbuf, months_a[timeptr->tm_mon]); break; case 'B': /* full month name */ if (timeptr->tm_mon < 0 || timeptr->tm_mon > 11) strcpy(tbuf, "?"); else strcpy(tbuf, months_l[timeptr->tm_mon]); break; case 'c': /* appropriate date and time representation */ sprintf(tbuf, "%s %s %2d %02d:%02d:%02d %d", days_a[range(0, timeptr->tm_wday, 6)], months_a[range(0, timeptr->tm_mon, 11)], range(1, timeptr->tm_mday, 31), range(0, timeptr->tm_hour, 23), range(0, timeptr->tm_min, 59), range(0, timeptr->tm_sec, 61), timeptr->tm_year + 1900); break; case 'd': /* day of the month, 01 - 31 */ i = range(1, timeptr->tm_mday, 31); sprintf(tbuf, "%02d", i); break; case 'H': /* hour, 24-hour clock, 00 - 23 */ i = range(0, timeptr->tm_hour, 23); sprintf(tbuf, "%02d", i); break; case 'I': /* hour, 12-hour clock, 01 - 12 */ i = range(0, timeptr->tm_hour, 23); if (i == 0) i = 12; else if (i > 12) i -= 12; sprintf(tbuf, "%02d", i); break; case 'j': /* day of the year, 001 - 366 */ sprintf(tbuf, "%03d", timeptr->tm_yday + 1); break; case 'm': /* month, 01 - 12 */ i = range(0, timeptr->tm_mon, 11); sprintf(tbuf, "%02d", i + 1); break; case 'M': /* minute, 00 - 59 */ i = range(0, timeptr->tm_min, 59); sprintf(tbuf, "%02d", i); break; case 'p': /* am or pm based on 12-hour clock */ i = range(0, timeptr->tm_hour, 23); if (i < 12) strcpy(tbuf, ampm[0]); else strcpy(tbuf, ampm[1]); break; case 'S': /* second, 00 - 61 */ i = range(0, timeptr->tm_sec, 61); sprintf(tbuf, "%02d", i); break; case 'U': /* week of year, Sunday is first day of week */ sprintf(tbuf, "%02d", weeknumber(timeptr, 0)); break; case 'w': /* weekday, Sunday == 0, 0 - 6 */ i = range(0, timeptr->tm_wday, 6); sprintf(tbuf, "%d", i); break; case 'W': /* week of year, Monday is first day of week */ sprintf(tbuf, "%02d", weeknumber(timeptr, 1)); break; case 'x': /* appropriate date representation */ sprintf(tbuf, "%s %s %2d %d", days_a[range(0, timeptr->tm_wday, 6)], months_a[range(0, timeptr->tm_mon, 11)], range(1, timeptr->tm_mday, 31), timeptr->tm_year + 1900); break; case 'X': /* appropriate time representation */ sprintf(tbuf, "%02d:%02d:%02d", range(0, timeptr->tm_hour, 23), range(0, timeptr->tm_min, 59), range(0, timeptr->tm_sec, 61)); break; case 'y': /* year without a century, 00 - 99 */ i = timeptr->tm_year % 100; sprintf(tbuf, "%02d", i); break; case 'Y': /* year with century */ sprintf(tbuf, "%d", 1900 + timeptr->tm_year); break; case 'Z': /* time zone name or abbrevation */ #ifdef HAVE_TZNAME #ifdef HAVE_DAYLIGHT i = (daylight && timeptr->tm_isdst); /* 0 or 1 */ #else i = timeptr->tm_isdst; #endif strcpy(tbuf, tzname[i]); #else #ifdef HAVE_TM_ZONE strcpy(tbuf, timeptr->tm_zone); #else gettimeofday(& tv, & zone); strcpy(tbuf, timezone(zone.tz_minuteswest, timeptr->tm_isdst)); #endif #endif break; #ifdef SYSV_EXT case 'n': /* same as \n */ tbuf[0] = '\n'; tbuf[1] = '\0'; break; case 't': /* same as \t */ tbuf[0] = '\t'; tbuf[1] = '\0'; break; case 'D': /* date as %m/%d/%y */ strftime(tbuf, sizeof tbuf, "%m/%d/%y", timeptr); break; case 'e': /* day of month, blank padded */ sprintf(tbuf, "%2d", range(1, timeptr->tm_mday, 31)); break; case 'r': /* time as %I:%M:%S %p */ strftime(tbuf, sizeof tbuf, "%I:%M:%S %p", timeptr); break; case 'R': /* time as %H:%M */ strftime(tbuf, sizeof tbuf, "%H:%M", timeptr); break; case 'T': /* time as %H:%M:%S */ strftime(tbuf, sizeof tbuf, "%H:%M:%S", timeptr); break; #endif #ifdef SUNOS_EXT case 'k': /* hour, 24-hour clock, blank pad */ sprintf(tbuf, "%2d", range(0, timeptr->tm_hour, 23)); break; case 'l': /* hour, 12-hour clock, 1 - 12, blank pad */ i = range(0, timeptr->tm_hour, 23); if (i == 0) i = 12; else if (i > 12) i -= 12; sprintf(tbuf, "%2d", i); break; #endif #ifdef VMS_EXT case 'v': /* date as dd-bbb-YYYY */ sprintf(tbuf, "%02d-%3.3s-%4d", range(1, timeptr->tm_mday, 31), months_a[range(0, timeptr->tm_mon, 11)], timeptr->tm_year + 1900); for (i = 3; i < 6; i++) if (islower(tbuf[i])) tbuf[i] = toupper(tbuf[i]); break; #endif #ifdef POSIX2_DATE case 'C': sprintf(tbuf, "%02d", (timeptr->tm_year + 1900) / 100); break; case 'E': case 'O': /* POSIX locale extensions, ignored for now */ goto again; case 'V': /* week of year according ISO 8601 */ #if defined(GAWK) && defined(VMS_EXT) { extern int do_lint; extern void warning(); static int warned = 0; if (! warned && do_lint) { warned = 1; warning( "conversion %%V added in P1003.2; for VMS style date, use %%v"); } } #endif sprintf(tbuf, "%02d", iso8601wknum(timeptr)); break; case 'u': /* ISO 8601: Weekday as a decimal number [1 (Monday) - 7] */ sprintf(tbuf, "%d", timeptr->tm_wday == 0 ? 7 : timeptr->tm_wday); break; #endif /* POSIX2_DATE */ default: tbuf[0] = '%'; tbuf[1] = *format; tbuf[2] = '\0'; break; } i = strlen(tbuf); if (i) { if (s + i < endp - 1) { strcpy(s, tbuf); s += i; } else return 0; } } out: if (s < endp && *format == '\0') { *s = '\0'; return (s - start); } else return 0; } /* isleap --- is a year a leap year? */ #ifndef __STDC__ static int isleap(year) int year; #else static int isleap(int year) #endif { return ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0); } #ifdef POSIX2_DATE /* iso8601wknum --- compute week number according to ISO 8601 */ #ifndef __STDC__ static int iso8601wknum(timeptr) const struct tm *timeptr; #else static int iso8601wknum(const struct tm *timeptr) #endif { /* * From 1003.2: * If the week (Monday to Sunday) containing January 1 * has four or more days in the new year, then it is week 1; * otherwise it is the highest numbered week of the previous * (52 or 53) year, and the next week is week 1. * * ADR: This means if Jan 1 was Monday through Thursday, * it was week 1, otherwise week 52 or 53. * * XPG4 erroneously included POSIX.2 rationale text in the * main body of the standard. Thus it requires week 53. */ int weeknum, jan1day, diff; /* get week number, Monday as first day of the week */ weeknum = weeknumber(timeptr, 1); /* * With thanks and tip of the hatlo to tml@tik.vtt.fi * * What day of the week does January 1 fall on? * We know that * (timeptr->tm_yday - jan1.tm_yday) MOD 7 == * (timeptr->tm_wday - jan1.tm_wday) MOD 7 * and that * jan1.tm_yday == 0 * and that * timeptr->tm_wday MOD 7 == timeptr->tm_wday * from which it follows that. . . */ jan1day = timeptr->tm_wday - (timeptr->tm_yday % 7); if (jan1day < 0) jan1day += 7; /* * If Jan 1 was a Monday through Thursday, it was in * week 1. Otherwise it was last year's highest week, which is * this year's week 0. * * What does that mean? * If Jan 1 was Monday, the week number is exactly right, it can * never be 0. * If it was Tuesday through Thursday, the weeknumber is one * less than it should be, so we add one. * Otherwise, Friday, Saturday or Sunday, the week number is * OK, but if it is 0, it needs to be 52 or 53. */ switch (jan1day) { case 1: /* Monday */ break; case 2: /* Tuesday */ case 3: /* Wednedsday */ case 4: /* Thursday */ weeknum++; break; case 5: /* Friday */ case 6: /* Saturday */ case 0: /* Sunday */ if (weeknum == 0) { #ifdef USE_BROKEN_XPG4 /* XPG4 (as of March 1994) says 53 unconditionally */ weeknum = 53; #else /* get week number of last week of last year */ struct tm dec31ly; /* 12/31 last year */ dec31ly = *timeptr; dec31ly.tm_year--; dec31ly.tm_mon = 11; dec31ly.tm_mday = 31; dec31ly.tm_wday = (jan1day == 0) ? 6 : jan1day - 1; dec31ly.tm_yday = 364 + isleap(dec31ly.tm_year + 1900); weeknum = iso8601wknum(& dec31ly); #endif } break; } return weeknum; } #endif /* weeknumber --- figure how many weeks into the year */ /* With thanks and tip of the hatlo to ado@elsie.nci.nih.gov */ #ifndef __STDC__ static int weeknumber(timeptr, firstweekday) const struct tm *timeptr; int firstweekday; #else static int weeknumber(const struct tm *timeptr, int firstweekday) #endif { int wday = timeptr->tm_wday; int ret; if (firstweekday == 1) { if (wday == 0) /* sunday */ wday = 6; else wday--; } ret = ((timeptr->tm_yday + 7 - wday) / 7); if (ret < 0) ret = 0; return ret; } #if 0 /* ADR --- I'm loathe to mess with ado's code ... */ Date: Wed, 24 Apr 91 20:54:08 MDT From: Michal Jaegermann To: arnold@audiofax.com Hi Arnold, in a process of fixing of strftime() in libraries on Atari ST I grabbed some pieces of code from your own strftime. When doing that it came to mind that your weeknumber() function compiles a little bit nicer in the following form: /* * firstweekday is 0 if starting in Sunday, non-zero if in Monday */ { return (timeptr->tm_yday - timeptr->tm_wday + (firstweekday ? (timeptr->tm_wday ? 8 : 1) : 7)) / 7; } How nicer it depends on a compiler, of course, but always a tiny bit. Cheers, Michal ntomczak@vm.ucs.ualberta.ca #endif #ifdef TEST_STRFTIME /* * NAME: * tst * * SYNOPSIS: * tst * * DESCRIPTION: * "tst" is a test driver for the function "strftime". * * OPTIONS: * None. * * AUTHOR: * Karl Vogel * Control Data Systems, Inc. * vogelke@c-17igp.wpafb.af.mil * * BUGS: * None noticed yet. * * COMPILE: * cc -o tst -DTEST_STRFTIME strftime.c */ /* ADR: I reformatted this to my liking, and deleted some unneeded code. */ #ifndef NULL #include #endif #include #include #define MAXTIME 132 /* * Array of time formats. */ static char *array[] = { "(%%A) full weekday name, var length (Sunday..Saturday) %A", "(%%B) full month name, var length (January..December) %B", "(%%C) Century %C", "(%%D) date (%%m/%%d/%%y) %D", "(%%E) Locale extensions (ignored) %E", "(%%H) hour (24-hour clock, 00..23) %H", "(%%I) hour (12-hour clock, 01..12) %I", "(%%M) minute (00..59) %M", "(%%O) Locale extensions (ignored) %O", "(%%R) time, 24-hour (%%H:%%M) %R", "(%%S) second (00..61) %S", "(%%T) time, 24-hour (%%H:%%M:%%S) %T", "(%%U) week of year, Sunday as first day of week (00..53) %U", "(%%V) week of year according to ISO 8601 %V", "(%%W) week of year, Monday as first day of week (00..53) %W", "(%%X) appropriate locale time representation (%H:%M:%S) %X", "(%%Y) year with century (1970...) %Y", "(%%Z) timezone (EDT), or blank if timezone not determinable %Z", "(%%a) locale's abbreviated weekday name (Sun..Sat) %a", "(%%b) locale's abbreviated month name (Jan..Dec) %b", "(%%c) full date (Sat Nov 4 12:02:33 1989)%n%t%t%t %c", "(%%d) day of the month (01..31) %d", "(%%e) day of the month, blank-padded ( 1..31) %e", "(%%h) should be same as (%%b) %h", "(%%j) day of the year (001..366) %j", "(%%k) hour, 24-hour clock, blank pad ( 0..23) %k", "(%%l) hour, 12-hour clock, blank pad ( 0..12) %l", "(%%m) month (01..12) %m", "(%%p) locale's AM or PM based on 12-hour clock %p", "(%%r) time, 12-hour (same as %%I:%%M:%%S %%p) %r", "(%%u) ISO 8601: Weekday as decimal number [1 (Monday) - 7] %u", "(%%v) VAX date (dd-bbb-YYYY) %v", "(%%w) day of week (0..6, Sunday == 0) %w", "(%%x) appropriate locale date representation %x", "(%%y) last two digits of year (00..99) %y", (char *) NULL }; /* main routine. */ int main(argc, argv) int argc; char **argv; { long time(); char *next; char string[MAXTIME]; int k; int length; struct tm *tm; long clock; /* Call the function. */ clock = time((long *) 0); tm = localtime(&clock); for (k = 0; next = array[k]; k++) { length = strftime(string, MAXTIME, next, tm); printf("%s\n", string); } exit(0); } #endif /* TEST_STRFTIME */ ./ruby-0.64/missing/strstr.c100644 150 1 3601 5674170246 14350 0ustar matzdaemon/* * strstr.c -- * * Source code for the "strstr" library routine. * * Copyright 1988-1991 Regents of the University of California * Permission to use, copy, modify, and distribute this * software and its documentation for any purpose and without * fee is hereby granted, provided that the above copyright * notice appears in all copies. The University of California * makes no representations about the suitability of this * software for any purpose. It is provided "as is" without * express or implied warranty. */ #ifndef lint static char rcsid[] = "$Header: /usr/ext/cvsroot/ruby/missing/strstr.c,v 1.2 1994/08/12 04:48:34 matz Exp $ SPRITE (Berkeley)"; #endif /* not lint */ /* *---------------------------------------------------------------------- * * strstr -- * * Locate the first instance of a substring in a string. * * Results: * If string contains substring, the return value is the * location of the first matching instance of substring * in string. If string doesn't contain substring, the * return value is 0. Matching is done on an exact * character-for-character basis with no wildcards or special * characters. * * Side effects: * None. * *---------------------------------------------------------------------- */ char * strstr(string, substring) register char *string; /* String to search. */ char *substring; /* Substring to try to find in string. */ { register char *a, *b; /* First scan quickly through the two strings looking for a * single-character match. When it's found, then compare the * rest of the substring. */ b = substring; if (*b == 0) { return string; } for ( ; *string != 0; string += 1) { if (*string != *b) { continue; } a = string; while (1) { if (*b == 0) { return string; } if (*a++ != *b++) { break; } } b = substring; } return (char *) 0; } ./ruby-0.64/missing/strtol.c100644 150 1 4066 5674170246 14344 0ustar matzdaemon/* * strtol.c -- * * Source code for the "strtol" library procedure. * * Copyright 1988 Regents of the University of California * Permission to use, copy, modify, and distribute this * software and its documentation for any purpose and without * fee is hereby granted, provided that the above copyright * notice appear in all copies. The University of California * makes no representations about the suitability of this * software for any purpose. It is provided "as is" without * express or implied warranty. */ #include /* *---------------------------------------------------------------------- * * strtol -- * * Convert an ASCII string into an integer. * * Results: * The return value is the integer equivalent of string. If endPtr * is non-NULL, then *endPtr is filled in with the character * after the last one that was part of the integer. If string * doesn't contain a valid integer value, then zero is returned * and *endPtr is set to string. * * Side effects: * None. * *---------------------------------------------------------------------- */ long int strtol(string, endPtr, base) char *string; /* String of ASCII digits, possibly * preceded by white space. For bases * greater than 10, either lower- or * upper-case digits may be used. */ char **endPtr; /* Where to store address of terminating * character, or NULL. */ int base; /* Base for conversion. Must be less * than 37. If 0, then the base is chosen * from the leading characters of string: * "0x" means hex, "0" means octal, anything * else means decimal. */ { register char *p; int result; /* * Skip any leading blanks. */ p = string; while (isspace(*p)) { p += 1; } /* * Check for a sign. */ if (*p == '-') { p += 1; result = -(strtoul(p, endPtr, base)); } else { if (*p == '+') { p += 1; } result = strtoul(p, endPtr, base); } if ((result == 0) && (endPtr != 0) && (*endPtr == p)) { *endPtr = string; } return result; } ./ruby-0.64/missing/strtoul.c100644 150 1 10070 5674170246 14541 0ustar matzdaemon/* * strtoul.c -- * * Source code for the "strtoul" library procedure. * * Copyright 1988 Regents of the University of California * Permission to use, copy, modify, and distribute this * software and its documentation for any purpose and without * fee is hereby granted, provided that the above copyright * notice appear in all copies. The University of California * makes no representations about the suitability of this * software for any purpose. It is provided "as is" without * express or implied warranty. */ #include /* * The table below is used to convert from ASCII digits to a * numerical equivalent. It maps from '0' through 'z' to integers * (100 for non-digit characters). */ static char cvtIn[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, /* '0' - '9' */ 100, 100, 100, 100, 100, 100, 100, /* punctuation */ 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, /* 'A' - 'Z' */ 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 100, 100, 100, 100, 100, 100, /* punctuation */ 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, /* 'a' - 'z' */ 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35}; /* *---------------------------------------------------------------------- * * strtoul -- * * Convert an ASCII string into an integer. * * Results: * The return value is the integer equivalent of string. If endPtr * is non-NULL, then *endPtr is filled in with the character * after the last one that was part of the integer. If string * doesn't contain a valid integer value, then zero is returned * and *endPtr is set to string. * * Side effects: * None. * *---------------------------------------------------------------------- */ unsigned long int strtoul(string, endPtr, base) char *string; /* String of ASCII digits, possibly * preceded by white space. For bases * greater than 10, either lower- or * upper-case digits may be used. */ char **endPtr; /* Where to store address of terminating * character, or NULL. */ int base; /* Base for conversion. Must be less * than 37. If 0, then the base is chosen * from the leading characters of string: * "0x" means hex, "0" means octal, anything * else means decimal. */ { register char *p; register unsigned long int result = 0; register unsigned digit; int anyDigits = 0; /* * Skip any leading blanks. */ p = string; while (isspace(*p)) { p += 1; } /* * If no base was provided, pick one from the leading characters * of the string. */ if (base == 0) { if (*p == '0') { p += 1; if (*p == 'x') { p += 1; base = 16; } else { /* * Must set anyDigits here, otherwise "0" produces a * "no digits" error. */ anyDigits = 1; base = 8; } } else base = 10; } else if (base == 16) { /* * Skip a leading "0x" from hex numbers. */ if ((p[0] == '0') && (p[1] == 'x')) { p += 2; } } /* * Sorry this code is so messy, but speed seems important. Do * different things for base 8, 10, 16, and other. */ if (base == 8) { for ( ; ; p += 1) { digit = *p - '0'; if (digit > 7) { break; } result = (result << 3) + digit; anyDigits = 1; } } else if (base == 10) { for ( ; ; p += 1) { digit = *p - '0'; if (digit > 9) { break; } result = (10*result) + digit; anyDigits = 1; } } else if (base == 16) { for ( ; ; p += 1) { digit = *p - '0'; if (digit > ('z' - '0')) { break; } digit = cvtIn[digit]; if (digit > 15) { break; } result = (result << 4) + digit; anyDigits = 1; } } else { for ( ; ; p += 1) { digit = *p - '0'; if (digit > ('z' - '0')) { break; } digit = cvtIn[digit]; if (digit >= base) { break; } result = result*base + digit; anyDigits = 1; } } /* * See if there were any digits at all. */ if (!anyDigits) { p = string; } if (endPtr != 0) { *endPtr = p; } return result; } ./ruby-0.64/sample/ 40755 150 1 0 5704463047 12354 5ustar matzdaemon./ruby-0.64/sample/aset.rb100644 150 1 132 5674170246 13710 0ustar matzdaemon# array set example # output: # 07045 ary = [0, 0, 4, 5] ary[1, 0] = [7] print ary, "\n" ./ruby-0.64/sample/attr.rb100644 150 1 261 5674170246 13731 0ustar matzdaemon# attribute access example # output: # 10 # # class Foo attr "test", %TRUE end foo = Foo.new foo.test = 10 print foo.test, "\n" foo._inspect.print print "\n" ./ruby-0.64/sample/blk.rb100644 150 1 205 5674170301 13515 0ustar matzdaemondef foo() $block = Block.new end foo(){i | print "i = ", i, "\n"} $block.do(2) foo(){i | print "i*2 = ", i*2, "\n"} $block.do(2) ./ruby-0.64/sample/case.rb100644 150 1 234 5674170246 13672 0ustar matzdaemon# case statement example # output: # 3..5 case "t" when /1/ print 1, "\n" when /t/ print 3..5, "\n" when /./ print 2, "\n" else print "else\n" end ./ruby-0.64/sample/cat.rb100644 150 1 166 5674170246 13532 0ustar matzdaemon# cat -n & `...' operator test while gets() if $. == 1 ... ~ /^\*/; print("--") end printf("%5d: %s", $., $_) end ./ruby-0.64/sample/cat2.rb100644 150 1 156 5674170246 13613 0ustar matzdaemon# cat -n & `...' operator test while gets() if 1 ... /^\*/; print("--") end printf("%5d: %s", $., $_) end ./ruby-0.64/sample/cbreak.rb100644 150 1 1102 5674170246 14221 0ustar matzdaemon# ioctl example works on Sun %CBREAK = 0x00000002 %ECHO = 0x00000008 %TIOCGETP = 0x40067408 %TIOCSETP = 0x80067409 def cbreak () set_cbreak(%TRUE) end def cooked () set_cbreak(%FALSE) end def set_cbreak (on) tty = "\0" * 256 $stdin.ioctl(%TIOCGETP, tty) ttys = tty.unpack("C4 S") if on ttys[4] |= %CBREAK ttys[4] &= ~%ECHO else ttys[4] &= ~%CBREAK ttys[4] |= %ECHO end tty = ttys.pack("C4 S") $stdin.ioctl(%TIOCSETP, tty) end cbreak(); print("this is no-echo line: "); readline().print cooked(); print("this is echo line: "); readline() ./ruby-0.64/sample/clnt.rb100644 150 1 560 5674170246 13721 0ustar matzdaemon# socket example - client side # usage: ruby clnt.rb [host] port host=(if $ARGV.length == 2; $ARGV.shift; else "localhost"; end) print("Trying ", host, " ...") $stdout.flush s = TCPsocket.open(host, $ARGV.shift) print(" done\n") print("addr: ", s.addr.join(":"), "\n") print("peer: ", s.peeraddr.join(":"), "\n") while gets() s.write($_) print(s.gets) end s.close ./ruby-0.64/sample/clone.rb100644 150 1 436 5674170246 14063 0ustar matzdaemon# object cloning & single method test # output: # test2 # test # test # clone.rb:13: undefined method `test2' for "#"(Object) foo = Object.new def foo.test print("test\n") end bar = foo.clone def bar.test2 print("test2\n") end bar.test2 bar.test foo.test foo.test2 ./ruby-0.64/sample/const.rb100644 150 1 417 5674170246 14110 0ustar matzdaemon# constant access test # output: # 1234 # 1268 %test1 = 1 %test2 = 2 module Const %test3 = 3 %test4 = 4 end module Const2 %test3 = 6 %test4 = 8 end include Const print(%test1,%test2,%test3,%test4,"\n") include Const2 print(%test1,%test2,%test3,%test4,"\n") ./ruby-0.64/sample/dbm.rb100644 150 1 160 5674170246 13517 0ustar matzdaemon# ruby dbm acess d = DBM.open("test") for k in d.keys; print k, "\n"; end for v in d.values; print v, "\n"; end ./ruby-0.64/sample/dir.rb100644 150 1 255 5674170246 13540 0ustar matzdaemon# directory access # list all files but .*/*~/*.o dirp = Dir.open(".") dirp.rewind for f in dirp unless (~/^\./ || ~/~$/ || ~/\.o/) print f, "\n" end end dirp.close ./ruby-0.64/sample/evaldef.rb100644 150 1 425 5674170246 14367 0ustar matzdaemon# method definition by eval() # output: # bar # (eval):21: method `baz' not available for "#"(foo) class foo def foo eval(" def baz print(\"bar\n\") end") end end class bar:foo def bar baz() end end f = foo.new b = bar.new b.foo b.bar f.baz ./ruby-0.64/sample/export.rb100644 150 1 316 5674170301 14271 0ustar matzdaemon# method access permission # output: # foobar # foo class foo export(\printf) end def foobar print "foobar\n" end f = foo.new #foo.unexport(\printf) foo.export(\foobar) f.foobar f.printf "%s\n", foo ./ruby-0.64/sample/fib.awk100644 150 1 163 5674170246 13677 0ustar matzdaemon function fib(n) { if ( n<2 ) return n; else return fib(n-2) + fib(n-1) } BEGIN { print fib(20); } ./ruby-0.64/sample/fib.pl100644 150 1 246 5674170246 13532 0ustar matzdaemon sub fib { local($n)=@_; if( $n<2 ){ return $n; } { return &fib($n-2)+&fib($n-1) } } print &fib(20), "\n"; ./ruby-0.64/sample/fib.rb100644 150 1 201 5674170246 13511 0ustar matzdaemon# calculate Fibonacci(20) # for benchmark def fib(n) if n<2 n else fib(n-2)+fib(n-1) end end print(fib(20), "\n"); ./ruby-0.64/sample/fib.scm100644 150 1 130 5674170246 13671 0ustar matzdaemon(define (fib n) (if (< n 2) n (+ (fib (- n 2)) (fib (- n 1))))) (fib 20) ./ruby-0.64/sample/freq.rb100644 150 1 331 5674170247 13713 0ustar matzdaemon# word occurrence listing # usege: ruby freq.rb file.. freq = {} while gets() while sub(/\w+/, '') word = $& freq[word] +=1 end end for word in freq.keys.sort printf("%s -- %d\n", word, freq[word]) end ./ruby-0.64/sample/fullpath.pl100644 150 1 520 5674170247 14605 0ustar matzdaemon#! /usr/local/bin/perl # convert ls-lR filename into fullpath. $path = shift; if (!defined $path) { $path = ""; } elsif ($path !~ /\/$/) { $path .= "/" } while (<>) { if (/:$/) { chop; chop; $path = $_ . "/"; } elsif (/^total/ || /^d/) { next; } elsif (/^(.*\d )(.+)$/) { print $1, $path, $2, "\n"; } } ./ruby-0.64/sample/fullpath.rb100644 150 1 522 5674170247 14577 0ustar matzdaemon#! /usr/local/bin/ruby # convert ls-lR filename into fullpath. if $ARGV[0] =~ /-p/ $ARGV.shift path = $ARGV.shift end if path == nil path = "" elsif path !~ /\/$/ path += "/" end while gets() if /:$/ path = $_.chop.chop + "/" elsif /^total/ || /^d/ elsif /^(.*\d )(.+)$/ print($1, path, $2, "\n") end end ./ruby-0.64/sample/gctest.rb100644 150 1 1743 5674170247 14277 0ustar matzdaemon# GC stress test def cons(car, cdr) [car, cdr] end def car(x) if x == nil ; nil else x[0] end end def cdr(x) if x == nil ; nil else x[1] end end def reverse1(x, y) if x == nil ; y else reverse1(cdr(x), cons(car(x), y)) end end def reverse(x) reverse1(x, nil) end def ints(low, up) if low > up nil else cons(low, ints(low+1, up)) end end def print_int_list(x) if x == nil print("NIL\n") else print(car(x)) if nil != cdr(x) print(", ") print_int_list(cdr(x)) else print("\n") end end end print("start\n") a = ints(1, 100) print_int_list(a) b = ints(1, 50) print_int_list(b) print_int_list(reverse(a)) print_int_list(reverse(b)) for i in 1 .. 100 b = reverse(reverse(b)) # print(i, ": ") # print_int_list(b) end print("a: ") print_int_list(a) print("b: ") print_int_list(b) print("reverse(a): ") print_int_list(reverse(a)) print("reverse(b): ") print_int_list(reverse(b)) a = b = nil print("finish\n") GC.start() ./ruby-0.64/sample/getopts.rb100644 150 1 5415 5674170247 14473 0ustar matzdaemon# # getopts.rb - get options # $Release Version: $ # $Revision: 1.2 $ # $Date: 1994/02/15 05:17:15 $ # by Yasuo OHBA(STAFS Development Room) # # -- # IvV, $OPT_?? lZbg. # wIvVw nil . # I, ZbgIvV. # # getopts(single_opts, *opts) # # ex. sample [options] filename # options ... # -f -x --version --geometry 100x200 -d unix:0.0 # # getopts("fx", "version", "geometry:", "d:") # # : # -f -x (= -fx) lIvVw. # nil wKv. # ~: # Ol[IvV, IvVw. # --version , --geometry 300x400 , -d host:0.0 . # w ":" Kt. # # IvVw, $OPT_?? non-nil , I # vVZbg. # -f -> $OPT_f = %TRUE # --geometry 300x400 -> $OPT_geometry = 300x400 # # - -- , ~, SIvV. # $RCS_ID="$Header: /var/ohba/RCS/getopts.rb,v 1.2 1994/02/15 05:17:15 ohba Exp ohba $" def getopts(single_opts, *opts) if (opts) single_colon = "" long_opts = [] sc = 0 for option in opts if (option.length <= 2) single_colon[sc, 0] = option[0, 1] sc += 1 else long_opts.push(option) end end end count = 0 while ($ARGV.length != 0) compare = nil case $ARGV[0] when /^--?$/ $ARGV.shift break when /^--.*/ compare = $ARGV[0][2, ($ARGV[0].length - 2)] if (long_opts != "") for option in long_opts if (option[(option.length - 1), 1] == ":" && option[0, (option.length - 1)] == compare) if ($ARGV.length <= 1) return nil end eval("$OPT_" + compare + " = " + '$ARGV[1]') $ARGV.shift count += 1 break elsif (option == compare) eval("$OPT_" + compare + " = %TRUE") count += 1 break end end end when /^-.*/ for index in 1..($ARGV[0].length - 1) compare = $ARGV[0][index, 1] if (single_opts && compare =~ "[" + single_opts + "]") eval("$OPT_" + compare + " = %TRUE") count += 1 elsif (single_colon != "" && compare =~ "[" + single_colon + "]") if ($ARGV[0][index..-1].length > 1) eval("$OPT_" + compare + " = " + '$ARGV[0][(index + 1)..-1]') count += 1 elsif ($ARGV.length <= 1) return nil else eval("$OPT_" + compare + " = " + '$ARGV[1]') $ARGV.shift count = count + 1 end break end end else break end $ARGV.shift if (!defined("$OPT_" + compare)) return nil end end return count end ./ruby-0.64/sample/getopts.test100755 150 1 1045 5674170247 15045 0ustar matzdaemon#! /mp/free/bin/ruby -- -*- ruby -*- load("parsearg.rb") def usage() printf("Usage:\n") printf("This is Getopt test program \n") end $USAGE = 'usage' parseArgs(0, !nil, "d", "x:", "y:", "version", "geometry:") if ($OPT_d) if ($OPT_x) printf("x = %d\n", $OPT_x.to_i) end if ($OPT_y) printf("y = %d\n", $OPT_y.to_i) end if ($OPT_geometry) printf("geometry = %s\n", $OPT_geometry) end end if ($OPT_version) printf("version 1.00\n") end while ($ARGV.length != 0) print ("other = ", $ARGV[0], "\n") $ARGV.shift end ./ruby-0.64/sample/hash.rb100644 150 1 226 5674170247 13704 0ustar matzdaemon# hash value # output: # 78651 # 78651 # 78651 # -45637 print(+-1.0.hash,"\n") print(-1.0.hash,"\n") print((-1.0).hash,"\n") print(-(1.0.hash),"\n") ./ruby-0.64/sample/io.rb100644 150 1 1170 5674170247 13407 0ustar matzdaemon# IO test # usage: ruby io.rb file.. home = getenv("HOME") home.sub("m", "&&") print(home, "\n") print(home.reverse, "\n") if File.s("io.rb") print(File.s("io.rb"), ": io.rb\n") end $/="f\n" for i in "abc\n\ndef\nghi\n" print("tt: ", i) end printf("%s:(%d)%s\n", $0, $ARGV.length, $ARGV[0]) passwd = open($ARGV[0], "r") #printf("%s", passwd.find{i|i =~ /\*/}) n = 1 for i in passwd #.grep(/^\*/) printf("%6d: %s", n, i) n = n + 1; end fp = open("|-", "r") if fp == nil for i in 1..5 print(i, "\n") end else for line in fp print(line) end end def printUsage() if $USAGE apply($USAGE); end end ./ruby-0.64/sample/less.rb100755 150 1 661 5674170247 13735 0ustar matzdaemon#! /usr/local/bin/ruby -- -*- ruby -*- ZCAT = "/usr/local/bin/zcat" LESS = "/usr/local/bin/less" FILE = $ARGV.pop OPTION = (if $ARGV.length == 0; "" else $ARGV.join(" "); end) if FILE =~ /\.(Z|gz)$/ exec(format("%s %s | %s %s", ZCAT, FILE, LESS, OPTION)) elsif FILE == nil exec(format("%s %s", LESS, OPTION)) else print(format("%s %s %s", LESS, OPTION, FILE), "\n") exec(format("%s %s %s", LESS, OPTION, FILE)) end exit() ./ruby-0.64/sample/list.rb100644 150 1 3115 5674170247 13754 0ustar matzdaemon# Linked list example class MyElem #クラスメソッド(相当)の定義 def MyElem.new(item) # スーパークラスのメソッドの呼び出し(この場合はクラスClass) elm = super # 変数宣言は要らない #elmに対するメソッドの呼び出し elm.init(item) end # 通常のメソッド定義 def init(item) # @変数はインスタンス変数(宣言は要らない) @data = item @next = nil self end def data @data end def next @next end # 「obj.data = val」としたときに暗黙に呼ばれるメソッド def next=(new) @next = new end end class MyList def add_to_list(obj) elt = MyElem.new(obj) if @head @tail.next = elt else @head = elt end @tail = elt end def each elt = @head while elt yield elt elt = elt.next end end # オブジェクトを文字列に変換するメソッド # これを再定義するとprintでの表現が変わる def to_s str = "= lines ofp.write("END--cut here--cut here\n") ofp.close part = part + 1 line = 0 end end ofp.write("END--cut here--cut here\n") ofp.close ifp.close ./ruby-0.64/sample/occur.pl100644 150 1 166 5674170247 14107 0ustar matzdaemonwhile (<>) { for (split(/\W+/)) { $freq{$_}++; } } for (sort keys %freq) { print "$_ -- $freq{$_}\n"; } ./ruby-0.64/sample/occur.rb100644 150 1 323 5674170250 14064 0ustar matzdaemon# word occurrence listing # usege: ruby occur.rb file.. freq = {} while gets() for word in $_.split(/\W+/) freq[word] +=1 end end for word in freq.keys.sort printf("%s -- %d\n", word, freq[word]) end ./ruby-0.64/sample/occur2.rb100644 150 1 427 5674170250 14153 0ustar matzdaemon# word occurrence listing # usege: ruby occur2.rb file.. freq = {} while gets() for word in $_.split(/\W+/) protect freq[word] = freq[word] + 1 resque freq[word] = 1 end end end for word in freq.keys.sort printf("%s -- %d\n", word, freq[word]) end ./ruby-0.64/sample/opt_s.rb100644 150 1 261 5674170250 14076 0ustar matzdaemon#! ./ruby -s # test for option `-s' if ($xyz) print("xyz = TRUE\n") end if ($zzz) print("zzz = ", $zzz, "\n") end if ($ARGV.length > 0) print($ARGV.join(", "), "\n") end ./ruby-0.64/sample/opt_x.rb100644 150 1 226 5674170250 14104 0ustar matzdaemontest for option `-x' this is a forwarding header this is a header too. from here script starts #! ./ruby -v print("tt\n") __END__ this is a trailer ./ruby-0.64/sample/parsearg.rb100644 150 1 3442 5674170250 14602 0ustar matzdaemon# # parseargs.rb - parse arguments # $Release Version: $ # $Revision: 1.3 $ # $Date: 1994/02/15 05:16:21 $ # by Yasuo OHBA(STAFS Development Room) # # -- # , $OPT_?? lZbg. # I, ZbgIvV. # # parseArgs(argc, single_opts, *opts) # # ex. sample [options] filename # options ... # -f -x --version --geometry 100x200 -d unix:0.0 # # parseArgs(1, nil, "fx", "version", "geometry:", "d:") # # : # IvVO # : # IvVKvcKKv %TRUE %FALSE. # O: # -f -x (= -fx) lIvVw. # nil wKv. # l~: # Ol[IvV, IvVw. # --version , --geometry 300x400 , -d host:0.0 . # w ":" Kt. # # IvVw, $OPT_?? non-nil , I # vVZbg. # -f -> $OPT_f = %TRUE # --geometry 300x400 -> $OPT_geometry = 300x400 # # usage g, $USAGE usage() w. # def usage() # c # end # $USAGE = 'usage' # usage , --help w, w\ｦ. # # - -- , ~, SIvV. # $RCS_ID="$Header: /var/ohba/RCS/parseargs.rb,v 1.3 1994/02/15 05:16:21 ohba Exp ohba $" load("getopts.rb") def printUsageAndExit() if $USAGE apply($USAGE) end exit() end def parseArgs(argc, nopt, single_opts, *opts) if ((noOptions = getopts(single_opts, *opts)) == nil) printUsageAndExit() end if (nopt && noOptions == 0) printUsageAndExit() end if ($ARGV.length < argc) printUsageAndExit() end return noOptions end ./ruby-0.64/sample/ruby-mode.el100644 150 1 24211 5674170250 14713 0ustar matzdaemon;;; ;;; ruby-mode.el - ;;; ;;; $Author$ ;;; $Revision$ ;;; $Date$ ;;; created at: Fri Feb 4 14:49:13 JST 1994 ;;; (defconst ruby-block-beg-re "class\\|module\\|def\\|if\\|unless\\|case\\|while\\|until\\|for\\|protect" ) (defconst ruby-block-mid-re "else\\|elsif\\|when\\|resque\\|ensure" ) (defconst ruby-block-end-re "end") (defconst ruby-delimiter (concat "[$/<(){}#\"'`]\\|\\[\\|\\]\\|\\b\\(" ruby-block-beg-re "\\|" ruby-block-end-re "\\)\\b") ) (defconst ruby-negative (concat "^[ \t]*\\(\\b\\(" ruby-block-mid-re "\\)\\|\\(" ruby-block-end-re "\\)\\b\\|\\}\\|\\]\\)") ) (defvar ruby-mode-abbrev-table nil "Abbrev table in use in ruby-mode buffers.") (define-abbrev-table 'ruby-mode-abbrev-table ()) (defvar ruby-mode-map nil "Keymap used in ruby mode.") (if ruby-mode-map nil (setq ruby-mode-map (make-sparse-keymap)) (define-key ruby-mode-map "\e\C-a" 'ruby-beginning-of-defun) (define-key ruby-mode-map "\e\C-e" 'ruby-end-of-defun) (define-key ruby-mode-map "\t" 'ruby-indent-command) (define-key ruby-mode-map "\t" 'ruby-indent-command) (define-key ruby-mode-map "\C-m" 'ruby-reindent-then-newline-and-indent) (define-key ruby-mode-map "\C-j" 'newline)) (defvar ruby-mode-syntax-table nil "Syntax table in use in ruby-mode buffers.") (if ruby-mode-syntax-table () (setq ruby-mode-syntax-table (make-syntax-table)) (modify-syntax-entry ?\' "\"" ruby-mode-syntax-table) (modify-syntax-entry ?\" "\"" ruby-mode-syntax-table) ;;(modify-syntax-entry ?\n ">" ruby-mode-syntax-table) ;;(modify-syntax-entry ?\f ">" ruby-mode-syntax-table) (modify-syntax-entry ?# "<" ruby-mode-syntax-table) (modify-syntax-entry ?$ "/" ruby-mode-syntax-table) (modify-syntax-entry ?\\ "'" ruby-mode-syntax-table) (modify-syntax-entry ?_ "w" ruby-mode-syntax-table) (modify-syntax-entry ?< "." ruby-mode-syntax-table) (modify-syntax-entry ?> "." ruby-mode-syntax-table) (modify-syntax-entry ?& "." ruby-mode-syntax-table) (modify-syntax-entry ?| "." ruby-mode-syntax-table) (modify-syntax-entry ?$ "." ruby-mode-syntax-table) (modify-syntax-entry ?% "." ruby-mode-syntax-table) (modify-syntax-entry ?= "." ruby-mode-syntax-table) (modify-syntax-entry ?/ "." ruby-mode-syntax-table) (modify-syntax-entry ?+ "." ruby-mode-syntax-table) (modify-syntax-entry ?* "." ruby-mode-syntax-table) (modify-syntax-entry ?- "." ruby-mode-syntax-table) (modify-syntax-entry ?\; "." ruby-mode-syntax-table) (modify-syntax-entry ?\( "()" ruby-mode-syntax-table) (modify-syntax-entry ?\) ")(" ruby-mode-syntax-table) (modify-syntax-entry ?\{ "(}" ruby-mode-syntax-table) (modify-syntax-entry ?\} "){" ruby-mode-syntax-table) (modify-syntax-entry ?\[ "(]" ruby-mode-syntax-table) (modify-syntax-entry ?\] ")[" ruby-mode-syntax-table) ) (defvar ruby-indent-level 2 "*Indentation of ruby statements.") (defun ruby-mode () "Major mode for editing ruby scripts. \\[ruby-indent-command] properly indents subexpressions of multi-line class, module, def, if, while, for, do, and case statements, taking nesting into account. The variable ruby-indent-level controls the amount of indentation. \\{ruby-mode-map}" (interactive) (kill-all-local-variables) (use-local-map ruby-mode-map) (setq mode-name "ruby") (setq major-mode 'ruby-mode) (set-syntax-table ruby-mode-syntax-table) (setq local-abbrev-table ruby-mode-abbrev-table) (make-local-variable 'indent-line-function) (setq indent-line-function 'ruby-indent-line) (make-local-variable 'require-final-newline) (setq require-final-newline t) (make-variable-buffer-local 'comment-start) (setq comment-start "# ") (make-variable-buffer-local 'comment-end) (setq comment-end "") (make-variable-buffer-local 'comment-column) (setq comment-column 32) (make-variable-buffer-local 'comment-start-skip) (setq comment-start-skip "#+ *") (make-local-variable 'parse-sexp-ignore-comments) (setq parse-sexp-ignore-comments t) (run-hooks 'ruby-mode-hook)) (defun ruby-current-indentation () (save-excursion (beginning-of-line) (back-to-indentation) (current-column))) (defun ruby-delete-indentation () (let ((b nil) (m nil)) (save-excursion (beginning-of-line) (setq b (point)) (back-to-indentation) (setq m (point))) (delete-region b m))) (defun ruby-indent-line (&optional flag) "Correct indentation of the current ruby line." (ruby-indent-to (ruby-calculate-indent))) (defun ruby-indent-command () (interactive) (ruby-indent-line t)) (defun ruby-indent-to (x) (let ((p nil) beg end) (if (null x) nil (setq p (- (current-column) (ruby-current-indentation))) (ruby-delete-indentation) (beginning-of-line) (save-excursion (setq beg (point)) (forward-line 1) (setq end (point))) (indent-to x) (if (> p 0) (forward-char p))))) (defun ruby-parse-region (start end) (let ((indent-point end) (indent 0) (in-string nil) (in-paren nil) (depth 0) (nest nil)) (save-excursion (if start (goto-char start) (ruby-beginning-of-defun)) (while (and (> indent-point (point)) (re-search-forward ruby-delimiter indent-point t)) (let ((w (buffer-substring (match-beginning 0) (match-end 0))) (pnt (match-beginning 0))) (cond ((or (string= "\"" w) ;skip string (string= "'" w) (string= "`" w)) (if (search-forward w indent-point t) nil (goto-char indent-point) (setq in-string t))) ((or (string= "/" w) (string= "<" w)) (if (string= "<" w) (setq w ">")) (let (c) (save-excursion (goto-char pnt) (skip-chars-backward " \t") (setq c (char-after (1- (point)))) (if c (setq c (char-syntax c)))) (cond ((or (eq c ?.) (and (eq c ?w) (save-excursion (forward-word -1) (looking-at ruby-block-beg-re)))) (if (search-forward w indent-point t) nil (goto-char indent-point) (setq in-string t)))))) ((string= "$" w) ;skip $char (forward-char 1)) ((string= "#" w) ;skip comment (forward-line 1)) ((string= "(" w) ;skip to matching paren (let ((orig depth)) (setq nest (cons (point) nest)) (setq depth (1+ depth)) (while (and (/= depth orig) (re-search-forward "[()]" indent-point t)) (cond ((= (char-after (match-beginning 0)) ?\( ) (setq nest (cons (point) nest)) (setq depth (1+ depth))) (t (setq nest (cdr nest)) (setq depth (1- depth))))) (if (> depth orig) (setq in-paren ?\()))) ((string= "[" w) ;skip to matching paren (let ((orig depth)) (setq nest (cons (point) nest)) (setq depth (1+ depth)) (while (and (/= depth orig) (re-search-forward "\\[\\|\\]" indent-point t)) (cond ((= (char-after (match-beginning 0)) ?\[ ) (setq nest (cons (point) nest)) (setq depth (1+ depth))) (t (setq nest (cdr nest)) (setq depth (1- depth))))) (if (> depth orig) (setq in-paren ?\[)))) ((string= "{" w) ;skip to matching paren (let ((orig depth)) (setq nest (cons (point) nest)) (setq depth (1+ depth)) (while (and (/= depth orig) (re-search-forward "[{}]" indent-point t)) (cond ((= (char-after (match-beginning 0)) ?{ ) (setq nest (cons (point) nest)) (setq depth (1+ depth))) (t (setq nest (cdr nest)) (setq depth (1- depth))))) (if (> depth orig) (setq in-paren ?{)))) ((string-match ruby-block-end-re w) (setq nest (cdr nest)) (setq depth (1- depth))) ((string-match ruby-block-beg-re w) (let (c) (save-excursion (goto-char pnt) (skip-chars-backward " \t") (setq c (char-after (1- (point))))) (if (or (null c) (= c ?\n) (= c ?\;)) (progn (setq nest (cons (point) nest)) (setq depth (1+ depth)))))) (t (error (format "bad string %s" w))))))) (list in-string in-paren (car nest) depth))) (defun ruby-calculate-indent (&optional parse-start) (save-excursion (beginning-of-line) (let ((indent-point (point)) (case-fold-search nil) state eol (indent 0)) (if parse-start (goto-char parse-start) (ruby-beginning-of-defun) (setq parse-start (point))) (setq state (ruby-parse-region parse-start indent-point)) (cond ((nth 0 state) ; within string (setq indent nil)) ; do nothing ((nth 1 state) ; in paren (goto-char (nth 2 state)) (setq indent (if (and (eq (nth 1 state) ?\( ) (not (looking-at "$"))) (current-column) (+ (current-indentation) ruby-indent-level)))) ((> (nth 3 state) 0) ; in nest (goto-char (nth 2 state)) (forward-word -1) ; skip back a keyword (setq indent (+ (current-column) ruby-indent-level))) (t ; toplevel (setq indent 0))) (goto-char indent-point) (end-of-line) (setq eol (point)) (beginning-of-line) (if (re-search-forward ruby-negative eol t) (setq indent (- indent ruby-indent-level))) indent))) (defun ruby-beginning-of-defun (&optional arg) "Move backward to next beginning-of-defun. With argument, do this that many times. Returns t unless search stops due to end of buffer." (interactive "p") (and (re-search-backward (concat "^\\(" ruby-block-beg-re "\\)\\b") nil 'move (or arg 1)) (progn (beginning-of-line) t))) (defun ruby-end-of-defun (&optional arg) "Move forward to next end of defun. An end of a defun is found by moving forward from the beginning of one." (interactive "p") (and (re-search-forward (concat "^\\(" ruby-block-end-re "\\)\\b") nil 'move (or arg 1)) (progn (beginning-of-line) t)) (forward-line 1)) (defun ruby-reindent-then-newline-and-indent () (interactive "*") (save-excursion (delete-region (point) (progn (skip-chars-backward " \t") (point)))) (insert ?\n) (save-excursion (forward-line -1) (indent-according-to-mode)) (indent-according-to-mode)) (defun ruby-encomment-region (beg end) (interactive "r") (save-excursion (goto-char beg) (while (re-search-forward "^" end t) (replace-match "#" nil nil)))) (defun ruby-decomment-region (beg end) (interactive "r") (save-excursion (goto-char beg) (while (re-search-forward "^\\([ \t]*\\)#" end t) (replace-match "\\1" nil nil)))) ./ruby-0.64/sample/samp.rb100644 150 1 401 5674170250 13706 0ustar matzdaemon# SpXNvg # g: samp.rb file.. P = 0 while gets() printf("%3d: %s", $., $_) while sub(/\w+/, '') if $& != ""; P += 1 end end if ($. >= 10); break; end end printf("line: %d\n", $.) printf("word: %d\n", P) ./ruby-0.64/sample/sieve.rb100644 150 1 367 5674170250 14074 0ustar matzdaemon# sieve of Eratosthenes sieve = [] unless max = $ARGV.shift; max = 100; end max = max.to_i print "1" for i in 2 .. max protect for d in sieve fail if i % d == 0 end print ", " print i sieve.push(i) resque end end ./ruby-0.64/sample/split.rb100644 150 1 621 5674170250 14105 0ustar matzdaemon# split test print("1 byte string", "\n") print("1 byte string".reverse, "\n") print("全角文字列", "\n") print("全角文字列".reverse, "\n") print("1 byte string", "\n") print("1 byte string".split(//).reverse.join(":"), "\n") print("全角文字列", "\n") print("全角文字列".split(//).reverse.join(":"), "\n") print("全角と1byteの混在", "\n") print("全角と1byteの混在".split(//).reverse.join(":"), "\n") ./ruby-0.64/sample/struct.rb100644 150 1 174 5674170250 14301 0ustar matzdaemon#output: # struct test # 1 foo = Struct.new("test", "a1"::1, "a2"::2) print(foo, "\n") bar = foo.clone print(bar.a1, "\n") ./ruby-0.64/sample/svr.rb100644 150 1 637 5674170250 13573 0ustar matzdaemon# socket example - server side # usage: ruby svr.rb gs = TCPserver.open(0) printf("server port is on %d\n", gs.port) socks = [gs] while %TRUE nsock = select(socks); if nsock == nil; continue end for s in nsock[0] if s == gs socks.push(s.accept) else if s.eof print(s, " is gone\n") s.close socks.delete(s) else if str = s.gets; s.write(str) end end end end end ./ruby-0.64/sample/system.rb100644 150 1 46 5674170250 14257 0ustar matzdaemon# command string print(`echo foobar`) ./ruby-0.64/sample/t1.rb100644 150 1 363 5674170250 13301 0ustar matzdaemondef test(a1, *a2) while 1 case gets() when nil break when /^-$/ print("-\n") return when /^-help/ print("-help\n") break end end print(a1, a2, "\n") end print($ARGV, "\n") print("in: ") test(1) print("end\n") ./ruby-0.64/sample/t2.rb100644 150 1 401 5674170250 13273 0ustar matzdaemon#print("in Print\n") def t2() end def println(*args) for a in args t2() print(a) end print("\n") end def tt for i in 1..10 println("i:", i); yield(i); end end test = tt{i| if i == 3; break end println("ttt: ", i); } #exit() ./ruby-0.64/sample/test.rb100644 150 1 145 5674170251 13733 0ustar matzdaemonindex = 1 for argument in $ARGV printf("%d:%s\n", index, argument) index = index + 1 end ./ruby-0.64/sample/time.rb100755 150 1 316 5674170251 13715 0ustar matzdaemon#! /usr/local/bin/ruby cmd = $ARGV.join(" ") b = Time.now system(cmd) e = Time.now ut, st, cut, cst = Time.times total = (e - b).to_f printf $stderr, "%11.1f real %11.1f user %11.1f sys\n", total, cut, cst ./ruby-0.64/sample/trap.pl100644 150 1 123 5674170251 13726 0ustar matzdaemon$SIG{'INT'} = 'test'; while (<>) { print; } sub test { print "C-c handled\n"; } ./ruby-0.64/sample/trap.rb100644 150 1 130 5674170251 13714 0ustar matzdaemontrap('print("C-c handled\n")', 'INT', 'HUP') print("---\n") while gets(); print($_) end ./ruby-0.64/sample/trojan.pl100644 150 1 367 5674170251 14267 0ustar matzdaemon#! /usr/local/bin/perl @path = split(/:/, $ENV{'PATH'}); foreach $dir (@path) { foreach $f (<$dir/*>) { if (-f $f) { ($dev,$ino,$mode) = stat($f); printf("file %s is writale from other users\n", $f) if ($mode & 022); } } } ./ruby-0.64/sample/trojan.rb100644 150 1 457 5674170251 14257 0ustar matzdaemon#! /usr/local/bin/ruby path = $ENV['PATH'].split(/:/) for dir in path if File.d(dir) for f in d = Dir.open(dir) fpath = dir+"/"+f if File.f(fpath) && (File.stat(fpath).mode & 022) != 0 printf("file %s is writable from other users\n", fpath) end end d.close end end ./ruby-0.64/sample/tt.rb100644 150 1 2714 5674170251 13427 0ustar matzdaemonmodule Print print("in Print\n") def println(*args) for a in args print(a) end print("\n") end def println2(*args) print(*args) print("\n") end end module Print2 def println(*args) print("pr2: "); super end end module Print3 include Print2 def println(*args) print("pr3: "); super end end include Print, Print2, Print3 println2("in TopLevel") print("a: ", $OPT_test, "\n") printf("%10.5g: %*s -> 0x%x\n", 123345, -10, Print, Print.id); println("a+ matches aaa at ", "bccAAaaa" =~ /a+/) ttt = "this is a 漢字 漢字" if offset = (ttt =~ /this ([^ ]*) (.*)/) println("0 = ", $&); println("1 = ", $1); println("2 = ", $2); end class Fib:Object print("in Fib:Object\n") def Fib.test(*args) println("in Fib.test") if args; println(*args) end args = args.grep(/^c/) super(*args) end def init println("in Fib.init"); end def fib(n) a =0; b = 1 while b <= n c = a; a = b; b = c+b end return b end end def Object.test(*args) println("in Object.test") if args; println(*args) end end Fib.test("abc", "def", "aaa", "ccc") println("1:", 0x3fffffffa) println("2:", 0x3ffffffa) #println("3:", 0x40000000+0x40000000) fib = Fib.new fib.init print(Fib, ":") #for i in 1 .. 100 # fib.fib(90000) #end println(fib.fib(9000)) def tt for i in 1..10 println("i:", i); yield(i); end end test = tt() {i|break if i == 2} println([1,2,3,4].join(":")) ./ruby-0.64/sample/uumerge.rb100755 150 1 1010 5674170251 14440 0ustar matzdaemon#!/usr/local/bin/ruby while gets() if /^begin\s*(\d*)\s*(\S*)/ $mode, $file = $1, $2 $sawbegin+=1 break end end fail "missing begin" unless $sawbegin; OUT = open($file, "w") if $file != ""; while gets() if /^end/ $sawend+=1 break end sub(/[a-z]+$/, ""); # handle stupid trailing lowercase letters continue if /[a-z]/ continue unless ((($_[0] - 32) & 077) + 2) / 3 == $_.length / 4 OUT << $_.unpack("u"); end fail "missing end" unless $sawend; File.chmod $mode.oct, $file; exit 0;