ruby-1.2.3/ 40755 774 145 0 6662164573 10455 5ustar matzNaClruby-1.2.3/COPYING100644 774 145 43105 6607346271 11624 0ustar matzNaCl GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 19yy 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 of the License, 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19yy name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. ruby-1.2.3/ChangeLog100644 774 145 246701 6662164324 12370 0ustar matzNaClTue Feb 16 12:40:55 1999 Yukihiro Matsumoto * version 1.2.3 (stable) released. Wed Feb 10 15:20:03 1999 Yukihiro Matsumoto * regex.c (re_match): empty pattern should not cause infinite pattern match loop. * regex.c (re_compile_pattern): RE_OPTIMIZE_ANCHOR for /.*/, not for /(.|\n)/. Mon Feb 8 23:53:58 1999 SHIROYAMA Takayuki * dln.c (FUNCNAME_PATTERN): FreeBSD for alpha/mips Mon Feb 8 17:07:37 1999 Koji Arai * error.c (rb_sys_fail): need to allocate enough size buffer. Fri Feb 5 00:01:50 1999 Yukihiro Matsumoto * parse.y (terms): needed to clear heredoc_end. Sat Jan 30 01:51:16 1999 Yukihiro Matsumoto * array.c (rb_ary_delete_if): RTEST() missing. * hash.c (delete_if_i): ditto. Wed Jan 27 17:50:02 1999 Kazuhiro HIWADA * bignum.c (dbl2big): raised error if double is too big to cast into long. check added. Wed Jan 27 15:45:04 1999 Yukihiro Matsumoto * eval.c (rb_alias): was corrupting body. Thu Jan 21 18:04:05 1999 Yukihiro Matsumoto * version 1.2.2 (stable) released. Tue Jan 19 05:01:16 1999 Koji Arai * array.c (beg_len): round range value too much. Mon Jan 18 13:02:27 1999 Kuroda Jun * hash.c (env_keys): strchr() may return NULL. Sun Jan 17 19:45:37 1999 WATANABE Hirofumi * pack.c (pack_pack): nil packing caused SEGV. Mon Jan 11 16:52:31 1999 Yukihiro Matsumoto * version 1.2.1 (stable) released. Wed Jan 6 02:42:08 1999 Yukihiro Matsumoto * bignum.c (Init_Bignum): forgot to define Bignum#===. * gc.c (gc_sweep): if add_heap() is called during GC, objects on allocated heap page(s) are not marked, should not be recycled. * gc.c (gc_sweep): should refer latest freelist. Mon Dec 28 18:54:17 1998 Yukihiro Matsumoto * gc.c (obj_free): better C_ALLOCA support. * eval.c (rb_eval): should not dump core with "#{}". Fri Dec 25 13:07:46 1998 Yukihiro Matsumoto * version 1.2 (stable) released. Fri Dec 25 11:56:51 1998 Yukihiro Matsumoto * gc.c (gc_mark): proper scanning for temporary region. * eval.c (TMP_ALLOC): protection for C_ALLOCA was broken. Wed Dec 9 13:37:12 1998 MAEDA shugo * pack.c (encodes): use buffering for B-encoding. * pack.c (pack_pack): Q-encoding by 'M'. Mon Dec 7 18:24:50 1998 WATANABE Tetsuya * ruby.c (set_arg0): $0 supprt for HP-UX. Mon Dec 7 01:30:28 1998 WATANABE Hirofumi * dln.c (dln_strerror): better error messages on win32. Thu Dec 3 16:50:17 1998 Yukihiro Matsumoto * ext/extmk.rb.in (realclean): trouble on install. Sun Nov 29 22:25:39 1998 Takaaki Tateishi * process.c (f_exec): check number of argument. Thu Nov 26 17:27:30 1998 Yukihiro Matsumoto * version 1.1c9 released. Wed Nov 25 13:07:12 1998 Yukihiro Matsumoto * parse.y (yycompile): reduce known memory leak (hard to remove). Sat Nov 21 18:44:06 1998 Masaki Fukushima * time.c (time_s_now): had memory leak. * ext/md5/md5init.c (md5_new): had memory leak. * ext/md5/md5init.c (md5_clone): ditto. Wed Nov 18 10:48:09 1998 Yukihiro Matsumoto * io.c (read_all): SEGV on large files. Tue Nov 17 18:11:20 1998 Yukihiro Matsumoto * version 1.1c8 released. Tue Nov 17 16:58:47 1998 Yukihiro Matsumoto * parse.y (arg): assignment to attribute name start with capital should be allowed. * eval.c (thread_alloc): needed to mark terminated threads too. Tue Nov 17 12:33:48 1998 Motoyuki Kasahara * ext/extmk.rb.in (create_makefile): Set `libdir' to `@libdir@', Set `pkglibdir' to `$libdir/$(RUBY_INSTALL_NAME)'. Tue Nov 17 10:30:46 1998 Yukihiro Matsumoto * sprintf.c (f_sprintf): %l%%c -> %%l%c Sun Nov 15 15:44:07 1998 Tadayoshi Funaba * ext/extmk.rb.in (install): bug in target. Sat Nov 14 11:02:05 1998 Motoyuki Kasahara * Makefile.in (install): Give the argument `$(DESTDIR)' to `instruby.rb'. * instruby.rb: Recognize ARG[0] as `destdir'. * instruby.rb: Give the argument `destdir' to `extmk.rb'. * ext/extmk.rb.in: Recognize ARG[1] as `$destdir'. * instruby.rb: Create the installation directories (bindir, libdir, archdir, pkglibdir, archdir, and mandir) under `destdir', and install all files under there. * ext/extmk.rb.in: Likewise. Sat Nov 14 10:56:55 1998 Motoyuki Kasahara * instruby.rb: Add the variable `pkglibdir'. * instruby.rb: Set the variable `libdir' to `$(libdir)', not `$(libdir)/$(ruby_install_name)'. `libruby.so' and `libruby.so.LIB' are installed at `libdir'. * instruby.rb: Set the variable `archdir' to `$(pkglibdir)/$(arch)'. Fri Nov 13 19:43:29 1998 KIMURA Koichi * missing/nt.c (SafeFree): wrong free offset. Tue Nov 10 00:22:11 1998 EGUCHI Osamu * configure.in: elf supprt for FreeBSD 3.x Thu Nov 12 20:11:53 1998 Koji Arai * sample/ruby-mode.el: wrong highlight. * parse.y (parse_regx): newline in regexp was ignored. Mon Nov 9 17:55:19 1998 Yukihiro Matsumoto * version 1.1c7 released. Fri Nov 6 19:25:27 1998 Takao KAWAMURA * sample/ruby-mode.el: font-lock patch. Thu Nov 5 15:42:22 1998 Yukihiro Matsumoto * sample/README, lib/README: simple description for each file. Wed Nov 4 18:14:19 1998 Yukihiro Matsumoto * eval.c (assign): attribute assignment should be called as public. Mon Nov 2 18:24:33 1998 Yukihiro Matsumoto * eval.c (thread_create): was accessing modified status. Sun Nov 1 01:18:52 1998 EGUCHI Osamu * gc.c (xrealloc): size 0 needs round up to 1. Sat Oct 31 23:18:34 1998 Yukihiro Matsumoto * string.c (rb_str_split_method): negative LIMIT means number of splitted fields are unlimited, as in perl. * string.c (rb_str_split_method): if LIMIT is unspecified, trailing null fields are stripped. Sat Oct 31 04:16:14 1998 Inaba Hiroto * string.c (str_aref): regexp index SEGVed. Fri Oct 30 14:33:47 1998 Yukihiro Matsumoto * re.c (reg_match): returns nil for unmatch. * dir.c (dir_entries): new method. * eval.c (block_pass): do not push block, substitute it. Wed Oct 28 11:37:42 1998 TAMITO * io.c (f_select): fd number comparison bug. Sun Oct 25 22:59:27 1998 Yukihiro Matsumoto * regex.c (set_list_bits): was using wrong offset. Mon Oct 19 11:50:00 1998 Motoyuki Kasahara * ext/extmk.rb: Load '@top_srcdir@/lib/find.rb', not '../lib/find.rb'. * ext/extmk.rb: Distinguish between `top_srcdir' and `topdir'. * Makefile.in (CFLAGS): Add `-I.'. * Makefile.in (lex.c): Give `@srcdir@/keywords' to gperf, not `keywords'. * instruby.rb: Use `CONFIG["bindir"]', instead of `prefix + "/bin"'. * instruby.rb: Use `CONFIG["libdir"]', instead of `prefix + "/lib"'. * instruby.rb Use `CONFIG["mandir"]', instead of `prefix + "/man"'. * instruby.rb (wdir): Add the variable to preserve the current working directory. * instruby.rb: Chdir to wdir before install `config.h' and `rbconfig.rb'. Mon Oct 19 10:07:01 1998 EGUCHI Osamu * eval.c (rb_eval): reduce recursive calls to rb_eval(). Thu Oct 15 13:54:48 1998 Yukihiro Matsumoto * parse.y (arg): local variabls can be accessed within right side expression in assignment, notably in blocks. Mon Oct 12 13:27:15 1998 Yukihiro Matsumoto * eval.c (rb_call0): check stack depth more frequently. Fri Oct 9 17:01:14 1998 Yukihiro Matsumoto * io.c (read_all): read() returns "" at immediate EOF. * io.c (io_read): read(nil) read all until EOF. Thu Oct 8 13:32:13 1998 Yukihiro Matsumoto * time.c (time_dump): marshal can dump Time object now. * marshal.c (Init_marshal): rename marshal methods `_dump_to' to `_dump', `_load_from' to `_load'. * parse.y (rb_intern): "+=".intern generates proper symbol. Mon Oct 5 18:31:53 1998 Yukihiro Matsumoto * version 1.1c6 released. Fri Oct 2 14:22:33 1998 Yukihiro Matsumoto * regex.c (re_search): `/\s*(--)$/ =~ "- --"' did not match, because of wrong optimize condition. Mon Oct 1 01:55:16 1998 Yukihiro Matsumoto * parse.y (rb_intern): should not raise exceptions. * parse.y (yylex): symbol like `:foo?=' should not be allowed. * ext/extmk.rb.in: makes *.a for static link modules. Fri Sep 25 12:01:19 1998 Yukihiro Matsumoto * parse.y (yylex): `@foo!' should be an error. Thu Sep 24 14:55:06 1998 WATANABE Tetsuya * ext/etc/etc.c (Init_etc): wrong field definition. Thu Sep 17 17:09:05 1998 Yukihiro Matsumoto * io.c (io_reopen): was creating FILE* for wrong fd. Tue Sep 15 05:28:11 1998 Koji Arai * regex.c (re_compile_pattern): forgot to fixup for the pattern like (?=(A)|(B)). Mon Sep 14 14:42:27 1998 Yukihiro Matsumoto * regex.c (re_match): beginning and end of the string, do not automatically match `\b'. * string.c (scan_once): comsume at leaset on character. * regex.c (re_search): wrong behavior for negative range. Sat Sep 12 21:21:26 1998 Koji Arai * regex.c (re_search): range value should be maintained. Thu Sep 10 10:55:00 1998 Yukihiro Matsumoto * parse.y (backref_error): yyerror does not understand formats. Tue Sep 8 18:05:33 1998 Yukihiro Matsumoto * version 1.1c5 released. Tue Sep 8 10:03:39 1998 Yukihiro Matsumoto * string.c (str_each_line): wrong line splitting with newline at top of the string. * string.c: non bang methods return copied string. * eval.c (f_END): needed to initialize frame->argc; Fri Sep 4 11:27:40 1998 Yukihiro Matsumoto * bignum.c (bigadd): proper sign combination. * regex.c (re_search): wrong return value for \A. Thu Sep 3 14:08:14 1998 Yukihiro Matsumoto * version 1.1c4 released. Tue Sep 1 10:47:16 1998 Yukihiro Matsumoto * regex.c (slow_search): do not compare llen and blen. llen may be longer than blen, if little contains 0xff. * regex.c (mbctab_euc): set 0x8e as multibyte character. * string.c (str_inspect): mask character for octal output. Mon Aug 31 15:32:41 1998 Yukihiro Matsumoto * regex.c (re_search): use calculated offset if exactn is the first opcode in the compiled regexp. * regex.c (bm_search): use Boyer-Moore search for simple search. * regex.c (must_instr): wrong length check if pattern includes byte escape by 0xff. * regex.c (re_compile_pattern): need not to check current_mbctype. Sat Aug 29 16:31:40 1998 Yukihiro Matsumoto * eval.c (rb_check_safe_str): avoid calling rb_id2name() in normal cases to speed-up. * eval.c (thread_raise): do not save context of terminated thread. * regex.c (re_compile_pattern): mask \nnn over 256. Sat Aug 29 02:09:46 1998 1998 Koji Arai * sprintf.c (f_sprintf): wrong buffer size check. Fri Aug 28 01:57:04 1998 Yukihiro Matsumoto * regex.c (re_compile_pattern): accepts (?ix-ix) and (?ix-ix:...). Fri Aug 28 12:25:33 1998 Hiroshi Igarashi * ruby.c (ruby_require_modules): load modules in appearing order. Thu Aug 27 12:54:28 1998 Yukihiro Matsumoto * version 1.1c3 released. Wed Aug 26 11:47:00 1998 Yukihiro Matsumoto * regex.c (re_match): pop non-greedy stack elements on success. Wed Aug 26 09:25:35 1998 WATANABE Hirofumi * ruby.h: add #define environ for cygwin32. Mon Aug 24 18:46:44 1998 WATANABE Hirofumi * dln.c (dln_find_1): path check was too strict. Mon Aug 24 15:28:11 1998 WATANABE Hirofumi * parse.y (f_arglist): opt_nl added after f_args. Wed Aug 19 00:31:09 1998 Yukihiro Matsumoto * io.c (io_ctl): forgot to place TRAP_END at right position. Fri Aug 14 11:01:47 1998 Yukihiro Matsumoto * eval.c (call_trace_func): save __FILE__, __LINE__ before executing trace_func, since trace function should not corrupt line number information. Thu Aug 13 15:09:02 1998 Yukihiro Matsumoto * array.c (ary_s_new): was marking unallocated region on GC. Tue Aug 11 11:57:35 1998 Yukihiro Matsumoto * version 1.1c2 released. Mon Aug 10 14:05:30 1998 Yukihiro Matsumoto * process.c (f_system): removed fflush(stdin). Fri Aug 7 17:44:44 1998 Yukihiro Matsumoto * error.c (err_snprintf): replace sprintf for fixed sized buffer, with snprintf to avoid buffer over-run. For systems which does dot provide snprintf, missing/snprintf.c added. Tue Jul 28 13:03:25 1998 Yukihiro Matsumoto * array.c (ary_s_new): argument to specify initial value is added. * array.c (ary_s_new): specifies size, not capacity. Mon Jul 27 12:39:34 1998 Yukihiro Matsumoto * string.c (str_replace): zero fill for expansion gap. * regex.c (mbctab_euc): set flags on for 0xA1-0xFE. suggested by . * string.c (str_inspect): consider current_mbctype. Sun Jul 26 15:37:11 1998 Tadayoshi Funaba * array.c (ary_s_new): Array.new(1<<30) dumps core. Fri Jul 24 13:40:19 1998 Yukihiro Matsumoto * version 1.1c1 released. Fri Jul 24 02:10:22 1998 Yukihiro Matsumoto * marshal.c (r_bytes2): allocated buffer size was too short. * marshal.c (w_object): saves all options, not only casefold flag. * re.c (reg_clone): now copies options properly. * re.c (reg_get_kcode): code number was wrong. Thu Jul 23 13:11:32 1998 Yukihiro Matsumoto * eval.c (rb_attr): argument should be symbol or string. Wed Jul 22 11:59:34 1998 Yukihiro Matsumoto * regex.c (calculate_must_string): wrong offset added. Wed Jul 22 11:59:59 1998 Yukihiro Matsumoto * st.c (rehash): still had a GC problem. fixed. Tue Jul 21 13:19:30 1998 Yukihiro Matsumoto * eval.c (gc_mark_threads): crashed on GC before thread allocation. * st.c (rehash): GC during rehash caused SEGV. Tue Jul 21 01:25:10 1998 Yukihiro Matsumoto * sprintf.c (f_sprintf): integer formatter totally re-written. * sprintf.c (remove_sign_bits): support uppercase hexadecimal. Sat Jul 18 00:14:13 1998 Yukihiro Matsumoto * sprintf.c (f_sprintf): proper sign position for %X and %O. Fri Jul 17 14:10:20 1998 Yukihiro Matsumoto * version 1.1c0 released. Fri Jul 17 08:01:49 1998 Tadayoshi Funaba * process.c (f_exec): Check_SafeStr() added. * process.c (f_system): Check_SafeStr() moved before fork(). Thu Jul 16 22:58:48 1998 Yukihiro Matsumoto * string.c (scan_once): substrings to the block should not be tainted. use reg_nth_match(), not str_substr(). * string.c (str_substr): needed to transfer taint. Thu Jul 16 16:15:57 1998 Yukihiro Matsumoto * gc.c (xmalloc): object allocation count added to GC trigger. * eval.c (thread_save_context): avoid marking uninitialized stack in thread_mark. GC may be triggered by REALLOC_N(). Wed Jul 15 15:11:57 1998 Yukihiro Matsumoto * experimental release 1.1b9_31. Wed Jul 15 15:05:27 1998 Yukihiro Matsumoto * eval.c (thread_create): exit() and abort() in threads now forwarded to main_thread. Tue Jul 14 14:03:47 1998 Yukihiro Matsumoto * variable.c (obj_instance_variables): list names that is not instance variables. * gc.c (GC_MALLOC_LIMIT): choose smaller limit value. Mon Jul 13 12:39:38 1998 Yukihiro Matsumoto * object.c (str2cstr): should not return NULL. Fri Jul 10 11:51:46 1998 Yukihiro Matsumoto * parse.y (gettable): needed to add dyna_in_block() check. Thu Jul 9 17:38:23 1998 Yukihiro Matsumoto * experimental release 1.1b9_30. Thu Jul 9 16:01:48 1998 Yukihiro Matsumoto * sprintf.c (fmt_setup): format specifier for long needed. * sprintf.c (f_sprintf): ditto. * numeric.c (fix2str): ditto. * eval.c (thread_create): no more ITIMER_REAL. * eval.c (thread_create): thread finalization needed before aborting thread if thread_abort is set. Wed Jul 8 18:17:33 1998 Yukihiro Matsumoto * bignum.c (big_pow): abandon power by bignum (too big). Tue Jul 7 13:58:43 1998 Yukihiro Matsumoto * eval.c (rb_catch): add C level catch/throw feature. Mon Jul 6 15:18:09 1998 Yukihiro Matsumoto * parse.y (arg): proper return values for `||=' and `&&='. Fri Jul 3 16:05:11 1998 Yukihiro Matsumoto * experimental release 1.1b9_29. Fri Jul 3 11:20:46 1998 Yukihiro Matsumoto * marshal.c (r_byte): byte should not extend sign bit. * numeric.c (fix_mul): use FIX2LONG() instead of FIX2INT() for 64bit architectures. * marshal.c (r_bytes): remove weird casting bwetween pointer and int. * process.c (proc_setsid): new method Process#setsid(). Thu Jul 2 12:49:21 1998 Yukihiro Matsumoto * marshal.c (w_object): remove `write_bignum' label for 64bit architectures. * marshal.c (r_bytes): needs int, not long. Wed Jul 1 14:21:06 1998 Yukihiro Matsumoto * numeric.c (flo_plus): should not allow addition with strings. Wed Jul 1 13:09:01 1998 Keiju ISHITSUKA * numeric.c (num_uminus): wrong coerce direction. Tue Jun 30 10:13:44 1998 Yukihiro Matsumoto * io.c (f_p): accepts arbitrary number of arguments. * eval.c (rb_yield_0): there's some case that iterator_p() returns true even if the_block was not set. check added. Tue Jun 30 01:05:20 1998 Yukihiro Matsumoto * eval.c (BEGIN_CALLARGS): adjust the_block before evaluating the receiver's value and the arguments. Fri Jun 26 18:02:50 1998 Yukihiro Matsumoto * experimental release 1.1b9_28. Fri Jun 26 11:01:26 1998 WATANABE Hirofumi * string.c (str_aset_method): needed to convert to string. Thu Jun 25 02:05:50 1998 Yukihiro Matsumoto * regex.c (re_search): optimize for `.*' at beginning of the pattern. * regex.c (re_search): optimize for character class repeat at beginning of the pattern. * regex.c (re_compile_pattern): detect optimization potential for the compiled patterns. Thu Jun 25 00:02:26 1998 WATANABE Hirofumi * re.c (reg_s_new): flag value was wrong. Wed Jun 24 23:45:06 1998 Yukihiro Matsumoto * regex.c (re_search): wrong anchor handling for reverse search. Wed Jun 24 02:18:57 1998 Yukihiro Matsumoto * parse.y (mlhs): `((a,b)),c = [[1,2]],3' assigns a=1,b=2,c=3. Tue Jun 23 11:46:16 1998 Yukihiro Matsumoto * parse.y (yylex): `&&=' and `||=' added. Sat Jun 20 02:53:50 1998 Yukihiro Matsumoto * parse.y (assignable): nesting local variables should have higher priority than normal local variables for assignment too. Fri Jun 19 18:28:19 1998 Yukihiro Matsumoto * experimental release 1.1b9_27. Fri Jun 19 14:34:49 1998 Yukihiro Matsumoto * eval.c (assign): support hack for nested multiple assignment. * parse.y (mlhs): nested multiple assignment. * eval.c (rb_eval): in-block variables now honors static scope. * configure.in: RSHIFT check moved to configure. Thu Jun 18 16:46:04 1998 Yukihiro Matsumoto * experimental release 1.1b9_26. Thu Jun 18 13:37:19 1998 Yukihiro Matsumoto * file.c (file_s_ftype): uses lstat(2) instead of stat(2). * dir.c (dir_s_glob): there can be buffer overrun, check added. * eval.c (f_binding): handles in-block variables declared after binding's generation. * numeric.c (flo_floor): floor, ceil, round added to Float. Wed Jun 17 11:20:00 1998 Yukihiro Matsumoto * parse.y (gettable): nesting local variables should have higher priority than normal local variables. Tue Jun 16 12:30:46 1998 Yukihiro Matsumoto * bignum.c (str2inum): handles `+ddd'. * struct.c (make_struct): name parameter can be nil for unnamed structures. Mon Jun 15 16:30:10 1998 Yukihiro Matsumoto * object.c (class_s_inherited): prohibiting to make subclass of class Class. * object.c (module_s_new): support for making subclass of Module. * parse.y (yycompile): clear eval_tree before compiling. Fri Jun 12 17:58:18 1998 Yukihiro Matsumoto * eval.c (eval): write back the_dyna_var into the block. Thu Jun 11 18:19:18 1998 Yukihiro Matsumoto * experimental release 1.1b9_25. * eval.c (dvar_add_compiling): register dyna_var at compile time. * regex.c (re_compile_pattern): RE_DUP_MAX iteration is too big. Wed Jun 10 15:12:04 1998 Yukihiro Matsumoto * io.c (io_eof): do not block other threads. * signal.c (trap): reserve SIGALRM for thread. * eval.c (thread_create): use ITIMER_REAL also to avoid system call blocking. * io.c (f_syscall): add TRAP_BEG, TRAP_END around system calls. * io.c (io_ctl): add TRAP_BEG, TRAP_END around system calls. * enum.c (enum_collect): did not collect false values. * array.c (ary_new2): forgot to initialize capa field. Tue Jun 9 18:36:15 1998 WATANABE Hirofumi * string.c (str_split_method): split dumped core for "\xff". Tue Jun 9 16:22:12 1998 Yukihiro Matsumoto * experimental release 1.1b9_24. Tue Jun 9 16:04:07 1998 WATANABE Hirofumi * ext/kconv/kconv.c (kconv_guess): more precise decision for EUC, using jless algorithm (3 sequential EUC hiragana characters). Tue Jun 9 15:12:44 1998 Yukihiro Matsumoto * ext/kconv/kconv.c (kconv_guess): wrong guess for EUC as SJIS in some cases (0xe0 - 0xef). * gc.c (xmalloc): insert size check for big (negative in signed) allocation size. Tue Jun 9 02:54:51 1998 Yukihiro Matsumoto * lib/parsedate.rb: wday moved to the last in the return values. Mon Jun 8 10:40:16 1998 Yukihiro Matsumoto * string.c (str_split_method): split dumped core for "\0". Sat Jun 6 22:50:52 1998 Yukihiro Matsumoto * regex.c (calculate_must_string): wrong condition for {start,stop}_nowidth. * regex.c (re_match): various features imported from GNU regex.c 0.12, such as nested grouping, avoiding infinite loop with empty match, etc. * regex.c (register_info_type): now use union. * regex.c (re_search): more precise anchor(^) check. Wed Jun 3 18:07:54 1998 Yukihiro Matsumoto * re.c (reg_raise): check rb_in_compile, not rb_in_eval. Mon Jun 1 05:26:06 1998 WATANABE Tetsuya * string.c (trnext): casting to signed char* needed. Tue Jun 2 16:00:12 1998 Yukihiro Matsumoto * ext/socket/socket.c (udp_addrsetup): error check enhanced. * ext/socket/socket.c (sock_s_getservbyaname): use strtoul(), if possible. Sat May 30 07:10:02 1998 Yukihiro Matsumoto * re.c (reg_prepare_re): no more needless regular expression recompile on casefold conditions. Thu May 28 18:02:55 1998 Yukihiro Matsumoto * object.c (nil_plus): no more `+' method for nil. Wed May 27 17:33:46 1998 Yukihiro Matsumoto * hash.c (hash_fetch): new method. * regex.c (re_search): check whether translate table is set. Tue May 26 11:39:50 1998 Yukihiro Matsumoto * experimental release 1.1b9_23. * parse.y (yylex): no UPLUS/UMINUS for 1st argument if parenthesises are omitted. Tue May 26 01:09:55 1998 Yukihiro Matsumoto * regex.c (re_compile_pattern): (?XI) for turns off the corresponding option. Mon May 25 12:38:56 1998 Yukihiro Matsumoto * regex.c (re_compile_pattern): inline i option (?i). * regex.c (re_compile_pattern): inline x option (?x). * regex.c (re_compile_pattern): x option for regexp. * dir.c (dir_s_open): returns block's evaluated value. * io.c (f_open): returns block's evaluated value. * ext/curses/curses.c (curses_addstr): nil argument caused SEGV. Fri May 22 11:52:45 1998 Yukihiro Matsumoto * regex.c (re_compile_pattern): push mark on (?:), so that laststart check for {a,b} can be done. Thu May 21 17:31:16 1998 Yukihiro Matsumoto * regex.c (re_match): wrong match (too non-greedy) for `{a,b}?'. * io.c (io_lineno): new method IO#lineno, IO#lineno=. Wed May 20 06:04:43 1998 MAEDA shugo * BeOS patch. Wed May 20 16:32:19 1998 Yukihiro Matsumoto * bignum.c (BIGDN): use RSHIFT(), instead of mere `>>'. Tue May 19 16:36:26 1998 Yukihiro Matsumoto * experimental release 1.1b9_22. Tue May 19 16:31:57 1998 Yukihiro Matsumoto * parse.y (assignable): specification changed for in-block variable definition. * eval.c (dyna_var_asgn): error in in-block variables' compile time definition. * parse.y (str_extend): wrong nesting detection. Tue May 19 09:47:55 1998 WATANABE Hirofumi * numeric.c (num2int): re-defined (extensions may use this). Mon May 18 16:40:50 1998 MAEDA shugo * error.c (get_syserr): BeOS support. * configure.in: modified for BeOS. * string.c (str_dump): do not call isascii(). * sprintf.c (remove_sign_bits): forgot to initialize end pointer. * glob.c: #include added. Mon May 18 14:52:21 1998 Yukihiro Matsumoto * experimental release 1.1b9_21. Mon May 18 03:27:57 1998 MAEDA shugo * file.c (file_s_expand_path): optional second argument `default_directory' added. Sat May 16 22:06:52 1998 WATANABE Hirofumi * error.c (RAISE_ERROR): wrong error message Fri May 15 14:43:25 1998 Yukihiro Matsumoto * experimental release 1.1b9_20. Thu May 14 14:44:21 1998 WATANABE Hirofumi * sun4 cc patches for intern.h and regex.h. Thu May 14 14:03:16 1998 Yukihiro Matsumoto * random.c (RANDOM_MAX): guessing proper maximum value for random numbers. * random.c (f_rand): use drand48 if possible. Wed May 13 19:05:20 1998 1998 MAEDA shugo * BeOS patches for io.c, error.c and config.guess. Wed May 13 14:56:23 1998 Yukihiro Matsumoto * experimental release 1.1b9_19. * most of the Mac and BeOS patches merged, except path separators. * error.c (err_append): generated SyntaxError was String. * ruby.h: xxx2INT, xxx2UINT checks values as int, not long. * ruby.h: remove typedef's. INT, UINT, UCHAR, USHORT. Tue May 12 17:38:00 1998 Yukihiro Matsumoto * experimental release 1.1b9_18. Tue May 12 11:38:08 1998 Yukihiro Matsumoto * error.c (syserr_errno): returns errno of the SystemCallError. * error.c (rb_sys_fail): saves errno in the Exception. * error.c (set_syserr): no need to protect syserr_list. * error.c (rb_sys_fail): no more bufsize limit. * error.c (set_syserr): integer value of errno can be accessed by Errno::EXXX::Errno. Sun May 10 03:10:33 1998 WATANABE Tetsuya * io.c (io_tell etc.): moved from File class to IO class. Fri May 8 12:26:37 1998 Yukihiro Matsumoto * pack.c (pack_unpack): should be unsigned int (was signed int). Thu May 7 16:34:10 1998 Yukihiro Matsumoto * pack.c (pack_pack): `V', `N' uses newly created NUM2UINT(). * ruby.h (NUM2UINT): new macro. * bignum.c (big2uint): try to convert bignum into UINT. * re.c (reg_match): needed to return false for match with nil. * gc.c (obj_free): wrong condition to free string. Wed May 6 21:08:08 1998 WATANABE Hirofumi * ruby.c (ruby_process_options): modified for DJGPP. Wed May 6 15:48:03 1998 Yukihiro Matsumoto * experimental release 1.1b9_17. Wed May 6 01:37:39 1998 Yukihiro Matsumoto * eval.c: remove global variable `errat'. * eval.c (rb_longjmp): embed error position information in the exception object. Sat May 2 12:20:02 1998 Yukihiro Matsumoto * re.c (reg_search): supports reverse search. * string.c (str_index_method): does update $~ etc. * eval.c (f_load): needed to clear the_dyna_vars. * eval.c (dyna_var_asgn): do not push dyna_var, which is id == 0. * error.c (Init_Exception): NotImplementError is no longer StandardError, which is not handled by default rescue. Fri May 1 00:35:51 1998 Yukihiro Matsumoto * ruby.c (proc_options): `-d' turns on verbose flag too. * error.c (exception): last argument may be the superclass of the defining exception(s). * io.c (Init_IO): EOFError is now subclass of the IOError. * io.c (Init_IO): forgot to define IOError. * error.c (Init_Exception): old Exception class renamed to StandardError. Exception now replaces old GlobalExit. * error.c (Init_Exception): Exception is now the root of the Global Exits. There's no longer GlobalExit class. * util.c (ruby_mktemp): check TMP, TMPDIR first. Thu Apr 30 01:08:35 1998 Yukihiro Matsumoto * lib/tk.rb: call 'unknown', if proc not defined. * eval.c (handle_rescue): default rescue handles `Exceptional' not only the instance of the `Exception's. * eval.c (f_raise): exception can be any object. * time.c (time_gm_or_local): call time_gmtime or time_localtime. * eval.c (f_raise): raises TypeError if the class which is not a subclass of String is specified (checked in exc_new()). * error.c (exc_new): need to check whether invalid class (not a subclass of String) is specified. Wed Apr 29 21:05:44 1998 WATANABE Hirofumi * ruby.c (proc_options): option '-e' via tempfile. Tue Apr 28 15:27:58 1998 Yukihiro Matsumoto * experimental release 1.1b9_16. Tue Apr 28 00:07:38 1998 Yukihiro Matsumoto * eval.c (obj_is_proc): type check predicate. * eval.c (obj_is_block): ditto. Mon Apr 27 16:59:17 1998 Yukihiro Matsumoto * ext/gtk/gtk.c (Init_gtk): use timeout, not idle to avoid comsuming CPU too much. * lib/tk.rb: use tcltklib#_invoke instead of `_eval'. Mon Apr 27 16:59:17 1998 Yukihiro Matsumoto * array.c (ary_sort): use dup, not clone. Mon Apr 27 13:46:27 1998 Tadahiro Maebashi * ext/tcltklib/tcltklib.c (ip_invoke): invoke tcl command directly. need not worry about escaping tcl characters. Mon Apr 27 12:04:43 1998 Yukihiro Matsumoto * random.c (f_rand): do not call srand() implicitly. Fri Apr 24 14:35:45 1998 Yukihiro Matsumoto * experimental release 1.1b9_15. * parse.y (assignable): dyna_var_asgn actually defines nested local variables in outer context. * random.c (f_rand): call srand(), if it has not called yet. * random.c (f_srand): use tv_usec as the default seed. * eval.c (rb_eval): values of nested local variables should be independent. * eval.c (rb_yield_0): local variables wrong nested conditions. Wed Apr 22 23:27:17 1998 Yukihiro Matsumoto * io.c (select_get_io): get IO object by `to_io'. * io.c (io_to_io): method to retrieve IO object, from delegating object for example. Wed Apr 22 16:52:37 1998 Yukihiro Matsumoto * experimental release 1.1b9_14. * string.c (str_modify): check for embedded pointer reference. * gc.c (obj_free): ditto. * pack.c (pack_pack): p/P template to embed pointers. Wed Apr 22 00:07:10 1998 Tadayoshi Funaba * array.c (ary_rindex): embarrassing typo. Tue Apr 21 12:31:48 1998 Yukihiro Matsumoto * experimental release 1.1b9_13. * configure.in (RUBY_LIB): supports --program-{prefix,suffix}. * array.c (ary_rindex): new method. * io.c (io_binmode): should return self. Tue Apr 21 08:23:04 1998 Tadayoshi Funaba * parse.y (here_document): calling parse_string with wrong arguments. * struct.c (struct_aset): problem member assignment with name. Mon Apr 20 14:47:49 1998 Yukihiro Matsumoto * experimental release 1.1b9_12. * time.c (time_arg): args may be string (support for reduced implicit type conversion). * lib/base64.rb: changed to use pack/unpack with `m' template. Mon Apr 20 06:23:20 1998 Yukihiro Matsumoto * variable.c (mod_remove_const): new method. Sat Apr 18 03:53:27 1998 Yukihiro Matsumoto * hash.c (hash_each_with_index): removed. use Enumerable's each_with_index instead. * class.c (rb_include_module): check for super modules, since module's included modules may be changed. Fri Apr 17 21:50:47 1998 WATANABE Hirofumi * marshal.c (r_long): r_byte() may return signed byte. Fri Apr 17 11:58:30 1998 NAGAI Hidetoshi * ext/tcltklib/tcltklib.c (lib_mainloop): thread and interrupt check. Fri Apr 17 11:06:30 1998 Yukihiro Matsumoto * eval.c (find_file): try to fopen() to check whether file exists. * ruby.c (load_file): ditto. * struct.c (struct_aset): struct member can be set by member name. Fri Apr 17 00:47:19 1998 WATANABE Hirofumi * ext/extmk.rb.in: added m68k-human support * file.c (LOCK_SH): defines moved. * array.c (ary_flatten_bang): simplified loop. Thu Apr 16 16:52:01 1998 Yukihiro Matsumoto * experimental release 1.1b9_11. * lib/tk.rb: thread support (experimental - maybe slow). * eval.c (rb_longjmp): trace event on exception in raising context, just before raising exception. * struct.c (struct_s_members): forgot to check singletons. * struct.c (struct_aref): members can be accessed by names too. * array.c (ary_flatten): new method. * eval.c (rb_longjmp): prints exception information with `-d'. * object.c (any_to_s): remove class name restriction. Thu Apr 16 01:38:02 1998 Yukihiro Matsumoto * file.c (thread_flock): do not block other threads. * eval.c (thread_trap_eval): signals are now delivered to the current thread again. In case that the current thread is dead, signals are forwarded to the main thread. * string.c (str_new4): need not to duplicate frozen strings. Wed Apr 15 08:33:47 1998 Tadayoshi Funaba * struct.c (struct_inspect): remove restriction for struct names. Wed Apr 15 02:55:02 1998 Kazuya 'Sharl' Masuda * x68 patches to config.sub, ext/extmk.rb.in Wed Apr 15 01:22:56 1998 Yukihiro Matsumoto * string.c (str_dup_frozen): do not duplicate frozen strings. * parse.y (yylex): allow nested parenthesises. * io.c (obj_displayln): prints newline after `display'ing the receiver. * io.c (io_puts): avoid generating "\n" each time. use RS_default instead. * io.c (f_p): ditto. Tue Apr 14 22:18:17 1998 Tadayoshi Funaba * struct.c (struct_aref): should not subtract negative index. Tue Apr 14 11:34:50 1998 Yukihiro Matsumoto * experimental release 1.1b9_10. * parse.y: token names prefixed by `t'. * struct.c (struct_s_def): supports subclassing of Struct. * io.c (io_s_new): supports subclassing of IO. Mon Apr 13 11:07:39 1998 Yukihiro Matsumoto * eval.c (f_binding): need to restore method name. * eval.c (rb_call0): raises SystemStackError, not Fatal. * io.c (obj_display): same as `print self'. * io.c (f_p): can now be called in the method form. * re.c (reg_regsub): needed to be mbchar aware. Mon Apr 13 13:18:32 1998 Yukihiro Matsumoto * eval.c (thread_trap_eval): all signals delivered to main_thread. Mon Apr 13 12:47:03 1998 TAKAHASHI Masayoshi * re.c (kcode_set_option): did not set SJIS on SJIS condition. Sun Apr 12 22:14:07 1998 Kazunori NISHI * array.c (ary_uniq_bang): should be `==', not `='. embarrassing. Sat Apr 11 02:13:30 1998 Yukihiro Matsumoto * array.c (ary_subseq): SEGVed for `[][1,1]'. Fri Apr 10 21:29:06 1998 Tadayoshi Funaba * array.c (ary_subseq): add check for beg larger than array length. Wed Apr 8 17:24:11 1998 MAEDA shugo * dir.c (dir_s_open): can be called with block (like IO#open). * dir.c (dir_s_chdir): print directory path on error. * dir.c (dir_s_chroot): ditto * dir.c (Init_Dir): needed to override `new'. Thu Apr 9 18:24:58 1998 Yukihiro Matsumoto * experimental release 1.1b9_09. * string.c (str_cmp): do not depend on sentinel at the end of the strings. * string.c (str_chomp_bang): forgot to set the sentinel. Wed Apr 8 00:59:13 1998 Yukihiro Matsumoto * bignum.c (big2int): converted int may be too big to fit in signed int. * parse.y (arg): `foo += 1' should not cause an error. * variable.c (rb_const_defined): returned false even if the constant is defined at the top level. * eval.c (f_local_variables): dyna_var->id may be null. should have checked before calling str_new2(). Tue Apr 7 01:15:15 1998 Kaneko Naoshi * re.c (reg_regsub): need to check string boundary. Tue Apr 7 19:19:12 1998 Yukihiro Matsumoto * string.c (str_cmp): returns either 1, 0, -1. * array.c (ary_cmp): should check array length, too Tue Apr 7 18:50:16 1998 Yukihiro Matsumoto * experimental release 1.1b9_08. Tue Apr 7 18:31:27 1998 WATANABE Hirofumi * instruby.rb (mandir): dll installation for cygwin32 Tue Apr 7 01:16:45 1998 Yukihiro Matsumoto * config.sub (maybe_os): TOWNS support? * config.guess: too strict check for libc versions on linuxes. * experimental release 1.1b9_07. * array.c (ary_cmp): compare each element using `<=>'. * hash.c (hash_each_with_index): yields [value, key] pair. * class.c (class_protected_instance_methods): list protected method names. * class.c (ins_methods_i): exclude protected methods. * eval.c (PUSH_BLOCK): dynamic variables can be accessed from eval() with bindings. Mon Apr 6 14:49:06 1998 Yukihiro Matsumoto * eval.c (thread_yield): must return evaluated value. Fri Apr 3 13:07:29 1998 Yukihiro Matsumoto * eval.c (thread_schedule): context switch bypassed on wrong conditions. * variable.c (rb_name_class): set classname by id before String class is initialized (1.0 behavior restored). Fri Apr 3 11:25:45 1998 Yukihiro Matsumoto * numeric.c (num2int): no implicit conversion from string. * numeric.c (num2int): check whether `to_i' returns an Integer. * numeric.c (num_zero_p): new method. * numeric.c (num_nonzero_p): new method. returns the receiver if it's not zero. * eval.c (obj_instance_eval): the_class should be the object's singleton class. * error.c (exc_s_new): message is converted into a string. Thu Apr 2 18:31:46 1998 Yukihiro Matsumoto * eval.c (obj_call_init): every object call `initialize'. Wed Apr 1 08:51:53 1998 Tadayoshi Funaba * parse.y (stmt): UNTIL_MOD should be for stmt, not only for expr. Wed Apr 1 01:20:31 1998 Yukihiro Matsumoto * object.c (true_and): boolean operators &, | and ^. Tue Mar 31 13:23:58 1998 Yukihiro Matsumoto * array.c (ary_compact_bang): returns nil, if it does not modify the array like String's bang methods. * array.c (ary_uniq_bang): new method to remove duplicate items. * eval.c (bind_s_new): new method. * numeric.c (num2int): raise exception if Fixnums too big to convert into `int' in case that sizeof(int) < sizeof(INT). * string.c (str_center): SEGV on negative width. * eval.c (eval): forgot to set sourcefile. Mon Mar 30 11:12:29 1998 Yukihiro Matsumoto * file.c (f_test): raises exception for unkown command. * eval.c (Init_eval): `class_eval': alias to the module_eval. Mon Mar 30 18:50:42 1998 Tadayoshi Funaba * string.c (str_capitalize_bang): did not check string modification. * string.c (str_delete_bang): wrong conversion. * string.c (str_intern): typo in error message. Mon Mar 30 01:44:13 1998 Yukihiro Matsumoto * eval.c (obj_instance_eval): accepts block as evaluation body. No compilation needed each time. * eval.c (mod_module_eval): ditto * file.c (file_s_umask): umask did not return old values, if no argument given. Sun Mar 29 00:54:23 1998 Yukihiro Matsumoto * eval.c (f_throw): nil returned always. Sat Mar 28 20:40:12 1998 Yukihiro Matsumoto * experimental release 1.1b9_06. Sat Mar 28 16:07:11 1998 WATANABE Hirofumi * io.c (io_closed): should not cause exception fot closed IO. * string.c (str_tr): returned nil for success. Sat Mar 28 00:47:19 1998 Yukihiro Matsumoto * eval.c (f_local_variables): new method to return an array of local variable names. * variable.c (obj_instance_variables): now returns an array of variable names, as described in the reference. * eval.c (rb_attr): honors default method visibility of the current scope. Fri Mar 27 13:49:27 1998 Yukihiro Matsumoto * experimental release 1.1b9_05. * ruby.c (ruby_prog_init): `site_ruby' added to load_path. * ruby.c (ruby_prog_init): load-path order changed. Paths in the RUBYLIB environment variable comes first in non-tainted mode. Thu Mar 26 11:51:09 1998 Yukihiro Matsumoto * eval.c (rb_call): new feature: `protected' methods. * string.c (str_dump): new method. * eval.c (block_pass): block argument can be nil, which means no block is supplied for the method. Wed Mar 25 21:20:13 1998 Tadayoshi Funaba * string.c (str_reverse_bang): string copied to wrong place. Wed Mar 25 08:12:07 1998 Yukihiro Matsumoto * numeric.c (flo_modulo): caused SEGV if left operand is not a float value. * eval.c (f_eval): optional third and fourth argument to specify file-name and line-number. * eval.c (eval): file-name and line-number set properly. * parse.y (assign_in_cond): literal assignment is now warning, not compile error. * error.c (Warn): Warn() always print message, OTOH Waring() prints when verbose flag is set. Tue Mar 24 12:50:06 1998 Yukihiro Matsumoto * ruby.c (ruby_prog_init): `.' should come last in the load-path. * eval.c (Init_eval): `__send__', alias for `send'. Mon Mar 23 12:44:12 1998 Yukihiro Matsumoto * string.c (str_chomp_bang): now takes `rs' as an argument. * eval.c (thread_free): main_thread should not be freed. Fri Mar 20 16:40:34 1998 Yukihiro Matsumoto * string.c (str_chomp_bang): chomp! (and other ! methods) returns nil if it does not modify the string. * string.c (str_sub_iter_s): should check last pattern since it may be matched to null. Thu Mar 19 13:48:55 1998 Yukihiro Matsumoto * experimental release 1.1b9_04. * parse.y (yylex): `10e0.9' should cause syntax error. Wed Mar 18 17:46:31 1998 Yukihiro Matsumoto * ruby.c (load_file): new file object constant DATA. Only available for the script from the file. * regex.c (re_match): forwading failure point popped too much. Tue Mar 17 18:23:06 1998 Yukihiro Matsumoto * math.c (math_frexp): newly added. * math.c (math_ldexp): ditto. * bignum.c (bigdivmod): calculates modulo. * numeric.c (fix_remainder): returns reminder, formerly introduced as modulo. * numeric.c (fix_modulo): calculates proper `modulo'. * bignum.c (bigdivmod): wrong sign for reminder. Mon Mar 16 17:07:28 1998 Yukihiro Matsumoto * experimental release 1.1b9_03. Mon Mar 16 16:33:53 1998 WATANABE Hirofumi * io.c (pipe_finalize): needed to add pipe_finalize to pipes on cygwin32. Mon Mar 16 14:11:06 1998 Yukihiro Matsumoto * class.c (ins_methods_i): needed to consider NOEX_UNDEF. Mon Mar 16 13:23:53 1998 WATANABE Hirofumi * io.c (io_check_closed): check for `fptr->f2 == NULL'. * io.c (io_fptr_close): ditto. Mon Mar 16 11:49:25 1998 Yukihiro Matsumoto * io.c (pipe_atexit): free()ing referencing pipe_list. * range.c (range_length): returns zero, if the first is greater than the last. * signal.c (trap_restore_mask): restore signal mask before raising exceptions and throws. Fri Mar 13 13:49:24 1998 Yukihiro Matsumoto * experimental release 1.1b9_02. * object.c (mod_clone): need to dups constants and instance variables. * eval.c (rb_eval): forgot to initialize body for NODE_DEFS. * eval.c (rb_eval): retrieve self from calling frame, since self changes sometimes. * env.h (FRAME): need to save self in the calling frame. * io.c (f_gets_method): rs should be initialized by RS. Thu Mar 12 15:33:57 1998 Yukihiro Matsumoto * experimental release 1.1b9_01. * range.c (range_s_new): check values by `first <= last'. * parse.y (lastline_set): fixed offset for $_ and $~ in the local variable space. Wed Mar 11 02:14:17 1998 Yukihiro Matsumoto * io.c (io_gets): handle normal case specially for speed. * eval.c (rb_disable_super): function to disable superclass's method explicitly. * eval.c (rb_eval): inherits previous method definition's NOEX_UNDEF-ness, if exists. * class.c (rb_define_method): disables superclass's overriding method by default. Wed Mar 11 01:40:48 1998 MAEDA shugo * numeric.c (flo_gt,etc.): do not depend on `<=>', to handle NaN. Tue Mar 10 00:03:24 1998 Yukihiro Matsumoto * ruby.c (load_file): understands multiple options in #! line. * regex.c (re_compile_pattern): support for [:alpha:] etc. Mon Mar 9 16:53:51 1998 Yukihiro Matsumoto * io.h (GetOpenFile): embed io_check_closed in GetOpenFile. * sprintf.c (f_sprintf): zero padding failed for negative integers. * sprintf.c (remove_sign_bits): failed to remove some bits. Sat Mar 7 21:51:46 1998 MAEDA shugo * class.c (ins_methods_i): body may be NULL for some case. Fri Mar 6 17:23:07 1998 Yukihiro Matsumoto * regex.c (mbcinit): table driven mbchar detection. * object.c (obj_alloc): check for allocating instance for the primitive classes (mostly perfect). * ext/curses/curses.c (curses_finalize): restore original state at interpreter temination. * ext/curses/curses.c (curses_addstr): forgot to check argument type (caused SEGV). now uses STR2CSTR() macro. Thu Mar 5 13:47:39 1998 Yukihiro Matsumoto * eval.c (block_pass): accepts method object as block args. * eval.c (f_missing): use any_to_s() for stringify. Wed Mar 4 01:39:52 1998 Yukihiro Matsumoto * parse.y (block_arg): new syntax - block argument in the calling arglist. * eval.c (rb_call): no module search. simplified a lot. * eval.c (rb_eval): block arg support. * parse.y (f_block_arg): new syntax - block argument in the formal arglist. Tue Mar 3 14:20:15 1998 Yukihiro Matsumoto * eval.c (obj_method): returns bound method object. * eval.c (rb_call): argument check for empty methods. * ruby.h (NUM2CHR): new macro, originally from curses module. Tue Mar 3 13:03:35 1998 MAEDA shugo * io.c (io_putc): new method. Tue Mar 3 11:21:28 1998 Yukihiro Matsumoto * string.c (str_inspect): more strict charcode detection. * eval.c (thread_stop): stopping only thread raises ThreadError exception. Tue Mar 3 08:04:56 1998 Tadayoshi Funaba * struct.c (struct_alloc): imcomplete struct initialization made GC to access unallocated addresses. Mon Mar 2 16:28:27 1998 Yukihiro Matsumoto * eval.c (thread_stop_method): remove Thread#stop. Fri Feb 27 18:16:26 1998 Yukihiro Matsumoto * version 1.1b9 released. Fri Feb 27 09:36:35 1998 Yukihiro Matsumoto * hash.c (hash_delete_nil): needed to compare value to nil, since nil is the valid key for hashes. * hash.c (hash_foreach_iter): rehashing causes IndexError. * hash.c (hash_foreach_iter): rehash check by pointer comparison. Thu Feb 26 17:22:13 1998 Yukihiro Matsumoto * parse.y (fname): convert reswords into symbols. * parse.y (reswords): reserved words are now embedded in the syntax (sigh). * parse.y: now reserved words can be method names safely. Wed Feb 25 15:50:07 1998 Yukihiro Matsumoto * eval.c (mod_module_eval): clear the_scope's PRIVATE flag before calling eval(). * gc.c (gc_call_finalizer_at_exit): run finalizers before any data object being freed. * eval.c (rb_eval): needed to keep prot_tag->retval before evaluating the ensure clause. Tue Feb 24 11:16:32 1998 Yukihiro Matsumoto * parse.y (yylex): reserved words can be appear as method names at right after 'def' and `.'(dot), like foo.next. * eval.c (return_check): checks for return out of thread (formerly done in return_value). * eval.c (POP_TAG): copy retval to outer level. * eval.c (return_value): just set retval, no check, no unwinding. * parse.y (nextc): line continuation by backslash at end of line. * regex.c (re_compile_pattern): forgot to clear pending_exact on closing parentheses. * parse.y (assignable): should not assign dyna_var to true, if it is already defined. Mon Feb 23 14:35:03 1998 Yukihiro Matsumoto * object.c (obj_is_kind_of): no longer accepts true/false/nil. * object.c ({true,false,nil}_to_i): can be converted into integers. Mon Feb 23 12:11:51 1998 Yukihiro Matsumoto * re.c (reg_s_quote): needed to be mbchar aware. * eval.c (proc_s_new): wrong iter mark. Sat Feb 21 22:59:30 1998 MAEDA shugo * io.c (f_syscall): no argument check. Fri Feb 20 10:17:51 1998 Yukihiro Matsumoto * version 1.1b8 released. * ext/kconv/kconv.c (kconv_kconv): default output code now be determined according to the value of $KCODE. * re.c (rb_get_kcode): can retrieve $KCODE from C code. * parse.y (stmt): if/unless modifiers returns nil, if condition is not established. Thu Feb 19 11:06:47 1998 Yukihiro Matsumoto * ext/kconv/kconv.c (kconv_kconv): charcode can be specified by code name (JIS, SJIS, EUC like value of $KCODE). * regex.c (re_compile_pattern): forgot to fixup_jump for (?:..). * regex.c (re_compile_pattern): needed to clear pending_exact on non-registering grouping (?:...). Wed Feb 18 19:54:21 1998 Yukihiro Matsumoto * parse.y (here_document): needed to set lex_state to EXPR_END. Wed Feb 18 18:45:10 1998 WATANABE Hirofumi * patches for cygwin32 applied. Wed Feb 18 00:41:31 1998 Yukihiro Matsumoto * string.c (str_sub_s): needed to be mbchar aware to increment one character. * regex.c (re_match): \Z matches newline just before the end of the string. Tue Feb 17 00:04:32 1998 Yukihiro Matsumoto * time.c (time_arg): Time.gm and Time.local now understands Time#to_a format. * string.c (str_sub_s): replace happened twice for null pattern. * regex.c (re_search): null pattern should not match after newline at the end of string. * time.c (time_isdst): now returns boolean value. * error.c (rb_check_type): treat special constants in messages. * parse.y (yylex): new form `::Const' to see toplevel constants. * parse.y (cond): SEGV on `if ()'. * gc.c (obj_free): some data needed explicit free(). Mon Feb 16 23:55:40 1998 Yukihiro Matsumoto * eval.c (blk_free): release duplicated block informations. * eval.c (blk_copy_prev): duplicate outer block information into the heap, when proc/binding created. Mon Feb 16 14:38:25 1998 Yukihiro Matsumoto * time.c (time_mon): now 1 for January and so on. * time.c (time_year): year in 19xx (no + 1900 needed anymore). Mon Feb 16 13:28:33 1998 Yukihiro Matsumoto * regex.c (re_compile_pattern): need to fetch mbchar's second byte without translation. Mon Feb 16 12:29:27 1998 MAEDA shugo * eval.c (f_pass_block): pass iterator block to other method. Fri Feb 13 08:16:11 1998 Yukihiro Matsumoto * parse.y (parse_regx): handle \s before read_escape(). * parse.y (read_escape): `\s' in strings as space. Tue Feb 10 17:29:08 1998 Yukihiro Matsumoto * version 1.1b7 released. * string.c (str_aset): string insertion by `str[n] = str2'. * string.c (str_oct): does recognize `0x'. * sprintf.c (f_sprintf): use baes 10 for conversion from string to integer. Mon Feb 9 14:51:56 1998 Yukihiro Matsumoto * numeric.c (do_coerce): proper error message. * string.c (str_sum): bug - masked by wrong value. (sigh..) Sat Feb 7 15:11:14 1998 Yukihiro Matsumoto * string.c (str_empty): new method Fri Feb 6 01:42:15 1998 Yukihiro Matsumoto * time.c (time_asctime): use asctime(3), not strftime(3). Thu Feb 5 18:58:46 1998 Yukihiro Matsumoto * io.c (io_fptr_close): do not free path on close(). * array.c (ary_filter): new method. * enum.c (enum_each_with_index): new method. Thu Feb 5 14:10:35 1998 Yukihiro Matsumoto * parse.y (primary): singleton class def can be appeared inside method bodies. * hash.c (hash_replace): replace content. * string.c (str_replace_method): replace content. * array.c (ary_replace_method): replace elements. * string.c (str_succ_bang): String#succ! Thu Feb 5 18:20:30 1998 WATANABE Hirofumi * string.c (str_upcase_bang): multi byte character support. Wed Feb 4 13:55:26 1998 Yukihiro Matsumoto * array.c (ary_reverse): SEGV on empty array reverse. Tue Feb 3 12:24:07 1998 Yukihiro Matsumoto * re.c (match_to_a): non matching element should be nil. * ruby.c (ruby_load_script): load script after all initialization. * bignum.c (str2inum): need to interpret prefix `0' of `0x'. Tue Feb 3 10:00:18 1998 WATANABE Hirofumi * numeric.c (fix_rshift): use `sizeof(INT)*8' instead of 32. Mon Feb 2 14:09:24 1998 Yukihiro Matsumoto * ruby.c (set_arg0): grab environment region too. Thu Jan 29 18:36:25 1998 WATANABE Hirofumi * process.c (rb_proc_exec): check `sh' to be exist. Thu Jan 29 18:18:19 1998 Yukihiro Matsumoto * io.c (io_stdio_set): assignment to $stdin or $stdout does reopen() as well as $stderr. Thu Jan 29 14:18:40 1998 Yukihiro Matsumoto * class.c (mod_ancestors): should not include singleton classes. * object.c (obj_type): should not return internal class. * io.c (io_reopen): unwillingly closes stdio streams. Thu Jan 29 11:50:35 1998 Toshihiko SHIMOKAWA * ext/socket/socket.c (udp_addrsetup): forgot to use htons(). Tue Jan 27 23:15:24 1998 Yukihiro Matsumoto * keywords: __FILE__, __LINE__ are available again. Fri Jan 23 14:19:28 1998 Yukihiro Matsumoto * version 1.1b6 released. * object.c (mod_to_s): need to duplicate classpath. * error.c (exc_inspect): need to duplicate classpath. Thu Jan 22 00:37:47 1998 Yukihiro Matsumoto * ruby.h (STR2CSTR): new macro to retrieve char*. * class.c (rb_define_method): `initialize' should always be private, even if it defined by C extensions. * eval.c (rb_eval): `initialize' should always be private. Thu Jan 22 16:21:08 1998 Yukihiro Matsumoto * eval.c (rb_eval): some singleton class def cause SEGV. * eval.c (TMP_ALLOC): replace ALLOCA_N, where thread context switch may happen. Wed Jan 21 01:43:42 1998 Yukihiro Matsumoto * eval.c (PUSH_FRAME): do not use ALLOCA_N(). crash on some platforms that use missing/alloca.c. * regex.c (re_compile_pattern): too many pops for non register subexpr. * parse.y (yylex): open parentheses after identifiers are argument list, even if whitespaces have seen. Tue Jan 20 15:19:59 1998 Yukihiro Matsumoto * parse.y (terms): quoted word list by %w(a b c). * ext/tcltklib/extconf.rb: more accurate check for tcl/tk libs. * file.c (rb_stat): most of the FileTest methods (and function `test') accept File objects as the argument. Tue Jan 19 18:19:24 1998 WATANABE Hirofumi * ext/extmk.rb.in (install): there should be no newline after install: * re.c (MIN): renamed from min(). there's a local variable named min in the file, so that some cpp will raise an error. Mon Jan 19 16:30:05 1998 Yukihiro Matsumoto * version 1.1b5 released. * process.c (rb_syswait): no exception raised. Fri Jan 16 00:43:43 1998 Yukihiro Matsumoto * ruby.h (CLONESETUP): copies its singleton classes too. * class.c (singleton_class_attached): saves binded object in the singleton classes. * eval.c (rb_eval): calls singleton_method_added even in the singleton class clauses. Fri Jan 15 23:22:43 1998 WATANABE Hirofumi * ruby.c (proc_options): -S does not recognize PATH. Thu Jan 15 02:03:12 1998 Yukihiro Matsumoto * eval.c (rb_clear_cache_by_id): clear only affected cache entries. Wed Jan 14 02:14:48 1998 Yukihiro Matsumoto * ext/socket/socket.c: new UDP/IP socket classes. Tue Jan 13 10:00:18 1998 Yukihiro Matsumoto * string.c (str_cmp): ignorecase($=) works wrong. Fri Jan 9 13:19:55 1998 Yukihiro Matsumoto * version 1.1b4 released. * eval.c (f_missing): class name omitted from the error message. * error.c (exc_inspect): description changed. * string.c (Init_String): GlobalExit's superclass did not filled, since GlobalExit created earlier than String. Thu Jan 8 12:10:09 1998 Yukihiro Matsumoto * parse.y (aryset): expr in the brackets can be null. Wed Jan 7 21:13:56 1998 Yukihiro Matsumoto * io.c (io_reopen): keep stderr unclosed. * io.c (io_errset): keep stderr unclosed. Tue Jan 6 00:27:43 1998 Yukihiro Matsumoto * parse.y: syntax modified for `while expr do .. end' etc. * process.c (f_exec,f_system): can supply arbitrary name for the new process. Mon Jan 5 16:59:13 1998 WATANABE Hirofumi * file.c (file_s_basename): removes any extention by ".*". Sun Jan 4 19:36:22 1998 WATANABE Hirofumi * parse.y (yylex): needed to update lex_p (reading point). Sat Jan 3 19:14:14 1998 WATANABE Hirofumi * class.c,object.c: duplicate defines mKernel and cFinxnum. Fri Jan 2 20:38:59 1998 Yukihiro Matsumoto * ext/curses/curses.c (NUM2CHAR): uses the first character for string arguments. * array.c (ary_fill): did not extend array for ranges. * array.c (beg_len): did not return end pos bigger than size. Fri Jan 2 02:09:16 1998 WATANABE Hirofumi * dir.c (dir_s_chdir): bug in nil check. * array.c (ary_fill): bug in nil check. Tue Dec 30 11:46:23 1997 Yukihiro Matsumoto * hash.c (env_path_tainted): checks directories in PATH environment variable are not world writable. * ruby.c (load_file): invoke specified interpreter if the #! line does not contain the word `ruby'. Fri Dec 26 03:26:41 1997 Yukihiro Matsumoto * string.c (uscore_get): type information included in the error message. * variable.c (f_untrace_var): does not free trace-data within trace procedure. Thu Dec 25 02:50:29 1997 Yukihiro Matsumoto * version 1.1b3 released. * ruby.h: inlining some functions on gcc 2.x Tue Dec 23 02:47:33 1997 Yukihiro Matsumoto * eval.c (rb_eval): public/private information kept in the current scope, to remove undesired state from the class/module. * time.c (time_strftime): remove hidden limit of 100 bytes of result string, using malloc'ed buffer. * hash.c (hash_update): merges the contents of another hash, overriding existing keys. * regex.c (must_instr): totally re-written. * io.c (read_all): try to allocate proper sized buffer using fstat(2) for speedup. Sat Dec 20 00:27:28 1997 Yukihiro Matsumoto * regex.c (must_instr): need to skip 2 bytes for mbchars. Fri Dec 19 01:18:29 1997 Yukihiro Matsumoto * version 1.1b2 released. * eval.c (check_errat): check and convert (if necessary) traceback information before assigning to the variable $@. * eval.c (f_raise): optional third argument to specify traceback information. * io.c (f_open): prevent infinite recursive call. Thu Dec 18 19:33:47 1997 Yukihiro Matsumoto * string.c (str_rindex): now accepts regexp as index. Thu Dec 18 18:42:50 1997 WATANABE Hirofumi * ext/socket/extconf.rb: modified to detect win32 socket lib. Thu Dec 18 00:25:03 1997 Yukihiro Matsumoto * re.c (reg_equal): checks for source and casefold and kcode matching. * marshal.c: became built-in module. * ext/marshal/marshal.c (r_object): displays struct name for non-compatible struct. * string.c (str_index_method): now searches character (fixnum) in the string. * string.c (str_include): redefine `include?'. * regex.c (re_match): start_nowidth saves current stack position to stop_nowidth. * regex.c (re_compile_pattern): add space to stop_nowidth to save runtime stack position. Tue Dec 16 14:57:43 1997 Yukihiro Matsumoto * string.c (scan_once): wrong exception for regexp that match with null string (use substr instead of subseq). Sat Dec 13 00:13:32 1997 Yukihiro Matsumoto * parse.y (expr): remove bare assocs from expr rule. * rbconfig.rb: renamed from config.rb (it was too generic name). Fri Dec 12 00:50:25 1997 Yukihiro Matsumoto * parse.y (expr): warns if BEGIN or END appear in the method bodies. * string.c (str_match): calls y =~ x if y is neither String nor Regexp so that eregex.rb works. * eval.c (f_at_exit): to register end proc. * class.c (rb_define_module_function): define 'function' method for the Module, not private method. * class.c (rb_define_function): function to define `function' method. * eval.c (rb_eval): inherit visibility from superclass's method except when it is set to `function' * eval.c (rb_eval): new visibility status `function'. * parse.y (yycompile): do not clear eval_tree. thus enable multipe command line script by optn `-e'. * eval.c (rb_eval): END execute just once. * parse.y (expr): BEGIN/END built in the syntax. Thu Dec 11 13:14:35 1997 Yukihiro Matsumoto * object.c (mod_le): Module (or Class) comparison. * eval.c (rb_remove_method): raises NameError if named method does not exist. * ext/curses/curses.c: remove CHECK macro for BSD curses. Thu Dec 11 12:44:01 1997 WATANABE Hirofumi * pack.c: sun4 cc patch Wed Dec 10 15:21:36 1997 Yukihiro Matsumoto * ext/marshal/marshal.c (marshal_load): can supply evolution proc object as optional second argument. * re.c (reg_source): get source string of the regular expression. Tue Dec 9 10:05:17 1997 Yukihiro Matsumoto * version 1.1b1 released. * parse.y (tokadd): token buffer overrun. * ruby.c (ruby_prog_init): forgot to protect rb_argv0 from gc. * eval.c (ruby_run): call finalizers at process termination. * gc.c (gc_call_finalizer_at_exit): call free proc for every Data Wrapper, and finalizer for specified objects at termination. * version.c (show_version): version format changed. * regex.c (re_match): wrong match with non-greedy if they appear more than once in regular expressions. * sample/ruby-mode.el (ruby-expr-beg): forgot to handle modifiers. Mon Dec 8 19:00:15 1997 Yukihiro Matsumoto * io.c (io_puts): just put a newline if no argument given. * ext/tcltklib/tcltklib.c (lib_mainloop): thread-aware tk handle when $tk_thread_safe is set. * ext/tcltklib/tcltklib.c (lib_mainloop): use Tcl_DoOneEvent() instead of Tk_MainLoop(). Mon Dec 6 07:11:16 1997 MAEDA shugo * io.c (io_puts): core dumped without any argument. Fri Dec 5 18:17:17 1997 Yukihiro Matsumoto * eval.c (mod_remove_method): remove (not undef) a method from the class/module. * variable.c (obj_remove_instance_variable): method to remove instance variables. Thu Dec 4 13:50:29 1997 Yukihiro Matsumoto * version 1.1b0 released. * string.c (str_aref): called str_index for regexp. Mon Dec 1 15:24:41 1997 Yukihiro Matsumoto * compar.c (cmp_between): wrong comparison made. Wed Nov 26 18:18:05 1997 Yukihiro Matsumoto * lib/mkmf.rb: generate Makefile for extention modules out of ruby source tree. use like `ruby -r mkmf extconf.rb'. * numeric.c (fix2str): enlarge buffer to prevent overflow on some machines. * parse.y (here_document): wrong line number generated after here-doc. Fri Nov 21 13:17:12 1997 Yukihiro Matsumoto * parse.y (yylex): skip multibyte characters in comments. Wed Nov 19 17:19:20 1997 Yukihiro Matsumoto * object.c (nil_to_a): nil.to_a => []. * parse.y (call_args): wrong node generation. Tue Nov 18 10:13:08 1997 Yukihiro Matsumoto * array.c (Init_Array): Array#=== works as Array#include? * regex.c (re_compile_pattern): insert initialize code for jump_n, before entering loops. * re.c (reg_search): does not save registers unless $& etc appear in the script. Mon Nov 17 13:01:43 1997 Yukihiro Matsumoto * eval.c (is_defined): add defined? check for receivers and arguments for calls. * re.c (reg_search): cache last match object. * re.c (match_aref): $[0] etc. are available. Sat Nov 15 00:11:36 1997 WATANABE Hirofumi * io.c (io_s_popen): "rb" detection Fri Nov 14 18:28:40 1997 Yukihiro Matsumoto * string.c (scan_once): returns whole match if the pattern does not contain any parentheses. Thu Nov 13 14:39:06 1997 Yukihiro Matsumoto * string.c (str_sub): returns copy of the receiver string, even if any substitution occurred. * regex.c (re_compile_pattern): no-width match by (?=..), (?!..). Wed Nov 12 13:44:47 1997 Yukihiro Matsumoto * time.c: remove coerce from Time class. * regex.c (re_match): non-greedy match by ??, *? +?, {n,m}?. Mon Nov 10 11:24:51 1997 Yukihiro Matsumoto * regex.c (re_compile_pattern): non-resitering parens (?:..). * regex.c (re_compile_pattern): new meta character \< (wordbeg) and \> (wordend). * regex.c (re_compile_pattern): embedded comment for regular expression by (?#...). Fri Nov 7 16:58:24 1997 Yukihiro Matsumoto * regex.c (re_compile_pattern): perl5 regxp \A and \Z available. * regex.c (re_compile_pattern): can expand compile stack dynamically. * regex.c (PUSH_FAILURE_POINT): wrong compare condition. Wed Nov 2 16:00:00 1997 WATANABE Hirofumi * string.c (str_sub_s): "".sub! "", "" => "\000" Fri Oct 31 15:52:10 1997 Yukihiro Matsumoto * parse.y (assoc): keyword assoc like {fg->"black"}. Thu Oct 30 17:33:38 1997 Yukihiro Matsumoto * io.c (io_println): print with newline, which is not affected by the values of $/ and $\. Thu Oct 30 16:54:01 1997 WATANABE Hirofumi * string.c (str_chop_bang): "".chop caused SEGV. * string.c (str_chomp_bang): method to chop out last newline. Mon Oct 27 13:49:13 1997 Yukihiro Matsumoto * ext/extmk.rb.in: library may have pathname contains `.' * eval.c (rb_rescue): should not protect SystemError. Fri Oct 24 10:58:53 1997 Yukihiro Matsumoto * io.c (io_s_with_open_stream): ensures to close stream. Thu Oct 23 11:17:44 1997 Yukihiro Matsumoto * io.c (io_errset): value of $stderr can be changed (to any IO object). * io.c (next_argv): $< can be anything that responds to `write'. * file.c (file_s_with_open_file): ensures to close file. * error.c (exception): create error under the current class/module. * range.c (range_eqq): fixnum check for last needed too. Wed Oct 22 12:52:30 1997 Yukihiro Matsumoto * ext/socket/socket.c: Socket::Constants added. * file.c: File::Constants added for inclusion. * array.c (ary_join): call ary_join() recursively for the 1st array element. Mon Oct 20 12:18:29 1997 WATANABE Hirofumi * ruby.c (load_file): wrong condition for #! check with -x. * file.c (file_s_dirname): did return "" for "/a". Fri Oct 17 14:29:09 1997 Yukihiro Matsumoto * ruby.c: now works on alpha-linux. * bignum.c (bigadd): some undefined side effect order assumed. Wed Oct 15 17:49:24 1997 Yukihiro Matsumoto * intern.h: function prototypes added. Mon Oct 13 16:54:18 1997 Yukihiro Matsumoto * class.c (rb_define_class_id): call superclass's `inherited' method when making subclasses. * parse.y (nextc): clear lex_lastline at the end of file. * object.c (Init_Object): need to undef Class#append_features. * eval.c (rb_eval): no warning on extending classes or modules. Thu Oct 9 11:17:50 1997 Yukihiro Matsumoto * eval.c (error_print): the exception name follows after the error message. * eval.c (compile_error): error message slightly changed. * parse.y (nextc): script parsing will be terminated by __END__ at beginning of line. * eval.c (compile_error): `__END__' is no longer a keyword. * parse.y (nextc): protect lastline read from script stream. Tue Oct 7 14:06:06 1997 Yukihiro Matsumoto * version 1.1 alpha9 released. * eval.c (mod_append_features): renamed from extend_class. * eval.c (rb_eval): defining method calls `method_added'. * eval.c (ruby_options): exception while processing options must terminate the interpreter. * error.c (Init_Exception): wrong method configuration. `new' should have been a singleton method. Mon Oct 6 18:55:38 1997 Yukihiro Matsumoto * ext/kconv/kconv.c (kconv_guess): code to guess character code from string. Mon Oct 6 18:38:17 1997 WATANABE Hirofumi * pack.c: now encode/decode base64 by `m' template. Fri Oct 3 10:51:10 1997 Yukihiro Matsumoto * MANIFEST: needed to include lex.c in the distribution. * eval.c (ruby_options): f_require() called too early. * eval.c (rb_provide): module extentions should always be `.o'. Thu Oct 2 11:38:31 1997 Yukihiro Matsumoto * version 1.1 alpha8 released. * ext/marshal/marshal.c (r_object): remove temporal regist for structs. (caused problem if structs form cycles.) * parse.y (match_gen): static binding for match(=~) calls with regexp literals. Wed Oct 1 15:26:55 1997 Yukihiro Matsumoto * eval.c: protect retval in struct tag from GC for C_ALLOCA. * eval.c: no more pointer value from setjmp/longjmp. Wed Oct 1 14:01:49 1997 WATANABE Hirofumi * ext/marshal/marshal.c (w_byte): argument must be char. Wed Oct 1 10:30:22 1997 Yukihiro Matsumoto * variable.c (mod_const_at): global constants now belongs to the class Object. * object.c (Init_Object): new global constant NIL. * ext/marshal/marshal.c (marshal_dump): try to set binmode. * ext/marshal/marshal.c (r_object): forgot to re-regist structs in the object table. * eval.c (ruby_options): call Init_ext() before any require() calls by `-r'. Fri Sep 30 14:29:22 1997 WATANABE Hirofumi * ext/marshal/marshal.c (w_object): marshal dumped core. Tue Sep 30 10:27:39 1997 Yukihiro Matsumoto * sample/test.rb: bignum test suits added. * eval.c (rb_eval): new pseudo variable `true' and `false'. * parse.y: new keywords `true' and `false' added. Mon Sep 29 13:37:58 1997 Yukihiro Matsumoto * ruby.c (forbid_setid): forbid some options in suid mode. * ruby.h (NUM2DBL): new macro to convert into doubles. Mon Sep 27 09:53:48 1997 EGUCHI Osamu * bignum.c: modified for speeding. Fri Sep 26 18:27:59 1997 WATANABE Hirofumi * sample/from.rb: some extensions. Mon Sep 29 13:15:56 1997 Yukihiro Matsumoto * parse.y (lhs): no more syntax error on `obj.CONSTANT = value'. Fri Sep 26 14:41:46 1997 Yukihiro Matsumoto * eval.c (ruby_run): deferred calling Init_ext() just before eval_node. Fri Sep 26 13:27:24 1997 WATANABE Hirofumi * io.c (io_isatty): forgot to return TRUE value. Fri Sep 25 11:10:58 1997 EGUCHI Osamu * eval.c: use _setjmp/_longjmp instead of setjmp/longjmp on some platforms. Wed Sep 24 17:43:13 1997 Yukihiro Matsumoto * string.c (Init_String): String#taint and String#taint? added. * class.c (mod_ancestors): ancestors include the class itself. Wed Sep 24 00:57:00 1997 Katsuyuki Okabe * X68000 patch. Tue Sep 23 20:42:30 1997 EGUCHI Osamu * parse.y (node_newnode): SEGV on null node setup. Mon Sep 22 11:22:46 1997 Yukihiro Matsumoto * ruby.c (ruby_prog_init): wrong safe condition check. Sun Sep 21 14:46:02 1997 MAEDA shugo * error.c (exc_inspect): garbage added to classpath. Fri Sep 19 11:49:23 1997 Yukihiro Matsumoto * parse.y (newtok): forgot to adjust buffer size when shrinking the token buffer. * enum.c (enum_find): rb_eval_cmd() does not return value. * io.c (pipe_open): close fds on pipe exec. fcntl(fd, F_SETFD, 1) no longer used. Tue Sep 16 17:54:25 1997 Yukihiro Matsumoto * file.c (f_test): problem if wrong command specified. * ruby.c (ruby_prog_init): close stdaux and stdprn for MSDOS. * ruby.c (ruby_prog_init): should not add path from environment variable, if ruby is running under seuid. * process.c (init_ids): check suid check for setuid/seteuid etc. Mon Sep 15 00:42:04 1997 WATANABE Hirofumi * regex.c (re_compile_pattern): \w{3} and \W{3} did not work. Thu Sep 11 10:31:48 1997 Yukihiro Matsumoto * version 1.1 alpha7 released. * ext/socket/socket.c (sock_new): no setbuf() for NT. * io.c (rb_fopen,rb_fdopen): set close-on-exec for every fd. Wed Sep 10 15:55:31 1997 Yukihiro Matsumoto * ext/marshal/marshal.c (r_bytes0): extra big length check. Tue Sep 9 16:27:14 1997 Yukihiro Matsumoto * io.c (pipe_fptr_atexit): clean up popen()'ed fptr. * error.c (set_syserr): some system has error code that is bigger than sys_nerr. grrr. Mon Sep 8 18:33:33 1997 Yukihiro Matsumoto * io.c (io_s_new): dereferenced nil for optional mode. Fri Sep 5 10:26:03 1997 Yukihiro Matsumoto * class.c (class_instance_methods): do not include methods which are changed to private in subclasses. Thu Sep 4 12:38:53 1997 Yukihiro Matsumoto * variable.c (f_global_variables): list name of the global variables. * object.c (obj_id): returns unique integer. Wed Sep 3 14:05:16 1997 Yukihiro Matsumoto * version 1.1 alpha6 released. * eval.c (mod_s_constants): context sensitive constant list. * variable.c (mod_constants): no more `all' option. * variable.c (mod_const_of): the values for autoload classes are their name strings. * class.c (class_instance_methods): no special treatment for singleton classes. * object.c (obj_singleton_methods): returns list of singleton method names. * parse.y (yylex): no here document after `class' keyword. * eval.c (f_load): expand path if fname begins with `~'. Tue Sep 2 13:19:48 1997 Yukihiro Matsumoto * class.c (ins_methods_i): do not list undef'ed methods. Mon Sep 1 13:42:48 1997 Yukihiro Matsumoto * version 1.1 alpha5 released. * object.c (mod_attr_reader): create methods to define attribute reader/write/accessor. * class.c (rb_define_attr): always defines accessors. * eval.c (rb_call): alias occured in the module body caused SEGV. * parse.y: did not generate here document strings properly. Mon Sep 1 11:43:57 1997 WATANABE Hirofumi * parse.y (yylex): heredoc dropped an extra character. Fri Aug 29 11:10:21 1997 Yukihiro Matsumoto * class.c (class_instance_methods): same method names should not appear more than twice. * parse.y (yylex): spaces can follow =begin/=end. * variable.c (find_class_path): look for class_tbl also for unnamed fundamental classes, such as Object, String, etc. * variable.c (rb_name_class): can't name class before String class is initilialized. * inits.c (rb_call_inits): unrecognized dependency from GC to Array. * variable.c (find_class_path): could not find class if Object's iv_tbl is NULL. Thu Aug 28 13:12:05 1997 Yukihiro Matsumoto * version 1.1 alpha4 released. * variable.c (mod_constants): wrong condition for singleton class. * parse.y (yylex): revised `=begin' skip code. * parse.y (here_document): forgot to free(eos). * parse.y (yylex): spaces after `<<' prohibited for here documents to avoid confusing with operator `<<'. * eval.c (is_defined): separated from rb_eval(). Wed Aug 27 11:32:42 1997 Yukihiro Matsumoto * version 1.1 alpha3 released. * variable.c (mod_name): returns name of the class/module. * parse.y (here_document): finally here document available now. * variable.c (fc_i): some classes/modules does not have iv_tbl. * variable.c (find_class_path): avoid inifinite loop. Tue Aug 26 13:43:47 1997 Yukihiro Matsumoto * eval.c (rb_eval): undef'ing non-existing method will raise NameError exception. * object.c (class_s_new): needed to create metaclass too. * eval.c (error_print): no class name print for anonymous class. * eval.c (rb_longjmp): proper exception raised if raise() called without arguments, with $! or $@ set. * object.c (Init_Object): superclass()'s method argument setting was wrong again. * class.c (mod_anscestors): list superclasses and included modules in priority order. Mon Aug 25 11:53:11 1997 Yukihiro Matsumoto * version 1.1 alpha2 released. * sample/ruby-mode.el (ruby-parse-region): auto-indent now supports "\\" in the strings. * struct.c (struct_getmember): new API to get member value from C language side. Sat Aug 23 21:39:05 1997 Yukihiro Matsumoto * parse.y (asignable): remove unnecessary local variable initialize by nil. Fri Aug 22 14:26:40 1997 Yukihiro Matsumoto * eval.c (error_print): modified exception print format. Thu Aug 21 16:10:58 1997 Yukihiro Matsumoto * sample/ruby-mode.el (ruby-calculate-indent): wrong indent level calculated with keyword operators. Thu Aug 21 11:36:58 1997 WATANABE Hirofumi * parse.y (arg): ary[0] += 1 cause SEGV Wed Aug 20 17:28:50 1997 Yukihiro Matsumoto * ruby.c (ruby_process_options): require() all modules after processing all options * process.c (rb_proc_exec): more security checks added. * process.c (rb_proc_exec): insecure path on exec. * hash.c (f_getenv): PATH modification security check. Tue Aug 19 00:15:38 1997 Yukihiro Matsumoto * version 1.1 alpha1 released. * eval.c (mod_eval): work as normal eval() if second binding argument given. * eval.c (rb_call): did not raise ArgumentError if too many arguments more than optional arguments (without rest arg). * eval.c (rb_eval): did not work well for op_asgn2 (attribute self assignment). * eval.c (Init_Thread): returns main thread. Mon Aug 18 09:25:56 1997 Yukihiro Matsumoto * object.c (inspect_i): did not display T_DATA instance variables. * parse.y: provides more accurate line number information. * eval.c (thread_value): include value's backtrace information in the variable `$@'. * eval.c (f_abort): print backtrace and exit. Sat Aug 16 00:17:44 1997 Yukihiro Matsumoto * eval.c (class_new_instance): do not make instance from virtual classes. * object.c (class_s_new): do not make subclass of singleton class. Fri Aug 15 15:49:46 1997 Yukihiro Matsumoto * eval.c (call_trace_func): block context switch in the trace function. * eval.c (rb_eval): clear method cache at class extention. * object.c (obj_type): returns object's class even if it defines singleton methods. Fri Aug 15 19:40:43 1997 WATANABE Hirofumi * ext/socket/socket.c (Init_socket): small typo caused SEGV. Wed Aug 13 17:51:46 1997 Yukihiro Matsumoto * version 1.1 alpha0 released. ruby-1.2.3/MANIFEST100644 774 145 5357 6624242630 11702 0ustar matzNaClCOPYING ChangeLog MANIFEST Makefile.in README README.jp README.EXT README.EXT.jp ToDo array.c bignum.c class.c compar.c configure configure.bat configure.in config_h.dj config_s.dj config.guess config.sub defines.h dir.c dln.c dln.h dmyext.c enum.c env.h error.c eval.c file.c fnmatch.c fnmatch.h gc.c glob.c hash.c inits.c install-sh instruby.rb intern.h io.c keywords lex.c main.c marshal.c math.c mkconfig.rb node.h numeric.c object.c pack.c parse.c parse.y process.c random.c range.c re.c re.h regex.c regex.h ruby.1 ruby.c ruby.h rubyio.h rubysig.h rubytest.rb signal.c sprintf.c st.c st.h string.c struct.c time.c top.sed util.h util.c variable.c version.c version.h beos/ruby.def.in ext/Setup ext/Setup.dj ext/Setup.nt ext/Setup.x68 ext/aix_ld.rb ext/cygwin32_ld.rb ext/extmk.rb.in ext/extmk.rb.nt lib/English.rb lib/Env.rb lib/README lib/base64.rb lib/cgi-lib.rb lib/complex.rb lib/date.rb lib/date2.rb lib/debug.rb lib/delegate.rb lib/e2mmap.rb lib/eregex.rb lib/find.rb lib/final.rb lib/finalize.rb lib/ftplib.rb lib/ftools.rb lib/getopts.rb lib/importenv.rb lib/jcode.rb lib/mailread.rb lib/mathn.rb lib/matrix.rb lib/mkmf.rb lib/monitor.rb lib/mutex_m.rb lib/observer.rb lib/open3.rb lib/ostruct.rb lib/parsearg.rb lib/parsedate.rb lib/ping.rb lib/pstore.rb lib/rational.rb lib/readbytes.rb lib/shell.rb lib/shellwords.rb lib/singleton.rb lib/sync.rb lib/telnet.rb lib/tempfile.rb lib/thread.rb lib/thwait.rb lib/timeout.rb lib/tracer.rb lib/weakref.rb missing/alloca.c missing/crypt.c missing/dir.h missing/dup2.c missing/file.h missing/flock.c missing/memcmp.c missing/memmove.c missing/mkdir.c missing/nt.c missing/nt.h missing/setenv.c missing/strcasecmp.c missing/strchr.c missing/strdup.c missing/strerror.c missing/strftime.c missing/strstr.c missing/strtol.c missing/strtoul.c missing/vsnprintf.c missing/x68.c sample/README sample/biorhythm.rb sample/cal.rb sample/cbreak.rb sample/clnt.rb sample/dbmtest.rb sample/dir.rb sample/eval.rb sample/export.rb sample/exyacc.rb sample/fact.rb sample/fib.awk sample/fib.pl sample/fib.py sample/fib.rb sample/fib.scm sample/freq.rb sample/from.rb sample/fullpath.rb sample/getopts.test sample/goodfriday.rb sample/inf-ruby.el sample/less.rb sample/list.rb sample/list2.rb sample/list3.rb sample/mine.rb sample/mkproto.rb sample/mpart.rb sample/mrshtest.rb sample/observ.rb sample/occur.pl sample/occur.rb sample/occur2.rb sample/philos.rb sample/pi.rb sample/rbc.rb sample/rcs.awk sample/rcs.dat sample/rcs.rb sample/regx.rb sample/ruby-mode.el sample/rubydb2x.el sample/rubydb3x.el sample/sieve.rb sample/svr.rb sample/test.rb sample/time.rb sample/trojan.rb sample/tsvr.rb sample/uumerge.rb win32/Makefile win32/config.h win32/ntsetup.bat win32/ruby.def win32/sdbm.c win32/sdbm.h x68/fconvert.c x68/select.c x68/_dtos18.c x68/_round.c ruby-1.2.3/Makefile.in100644 774 145 14763 6646533557 12656 0ustar matzNaClSHELL = /bin/sh #### Start of system configuration section. #### srcdir = @srcdir@ VPATH = @srcdir@:@srcdir@/missing CC = @CC@ YACC = @YACC@ PURIFY = @SET_MAKE@ prefix = @prefix@ CFLAGS = @CFLAGS@ -I. -I@srcdir@ -I@includedir@ LDFLAGS = @STATIC@ $(CFLAGS) @LDFLAGS@ EXTLIBS = LIBS = @LIBS@ $(EXTLIBS) MISSING = @LIBOBJS@ @ALLOCA@ LDSHARED = @LDSHARED@ DLDFLAGS = @DLDFLAGS@ SOLIBS = @SOLIBS@ binsuffix = @binsuffix@ #### End of system configuration section. #### LIBRUBY = @LIBRUBY@ LIBRUBYARG = @LIBRUBYARG@ EXTOBJS = MAINOBJ = main.o OBJS = array.o \ bignum.o \ class.o \ compar.o \ dir.o \ dln.o \ enum.o \ error.o \ eval.o \ file.o \ fnmatch.o \ gc.o \ glob.o \ hash.o \ inits.o \ io.o \ marshal.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 \ sprintf.o \ st.o \ string.o \ struct.o \ time.o \ util.o \ variable.o \ version.o \ $(MISSING) all: miniruby$(binsuffix) rbconfig.rb @./miniruby$(binsuffix) -Xext extmk.rb @EXTSTATIC@ miniruby$(binsuffix): libruby.a $(MAINOBJ) dmyext.o @rm -f $@ $(PURIFY) $(CC) $(LDFLAGS) $(MAINOBJ) dmyext.o libruby.a $(LIBS) -o $@ ruby$(binsuffix): $(LIBRUBY) $(MAINOBJ) $(EXTOBJS) @rm -f $@ $(PURIFY) $(CC) $(LDFLAGS) $(MAINOBJ) $(EXTOBJS) $(LIBRUBYARG) $(LIBS) -o $@ libruby.a: $(OBJS) dmyext.o @AR@ rcu $@ $(OBJS) dmyext.o @-@RANLIB@ $@ 2> /dev/null || true libruby.so: $(OBJS) dmyext.o $(LDSHARED) $(DLDFLAGS) $(SOLIBS) $(OBJS) dmyext.o -o $@ install: rbconfig.rb ./miniruby$(binsuffix) $(srcdir)/instruby.rb $(DESTDIR) clean:; @rm -f $(OBJS) $(LIBRUBY) $(MAINOBJ) rbconfig.rb @rm -f ext/extinit.c ext/extinit.o dmyext.o @if test -f ./miniruby$(binsuffix); then \ ./miniruby$(binsuffix) -Xext extmk.rb clean; \ fi distclean: clean @rm -f Makefile ext/extmk.rb config.h @rm -f ext/config.cache config.cache config.log config.status @rm -f parse.c *~ core *.core gmon.out y.tab.c y.output @rm -f ruby$(binsuffix) miniruby$(binsuffix) realclean: distclean @rm -f lex.c test: miniruby$(binsuffix) @./miniruby$(binsuffix) $(srcdir)/rubytest.rb rbconfig.rb: config.status miniruby$(binsuffix) @./miniruby$(binsuffix) $(srcdir)/mkconfig.rb rbconfig.rb .c.o: $(CC) $(CFLAGS) $(CPPFLAGS) -c $< lex.c: keywords gperf -p -j1 -i 1 -g -o -t -N rb_reserved_word -k1,3,$$ @srcdir@/keywords > lex.c parse.c: parse.y $(YACC) $< mv -f y.tab.c parse.c alloca.o: @srcdir@/missing/alloca.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/alloca.c crypt.o: @srcdir@/missing/crypt.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/crypt.c dup2.o: @srcdir@/missing/dup2.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/dup2.c flock.o: @srcdir@/missing/flock.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/flock.c memcmp.o: @srcdir@/missing/memcmp.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/memcmp.c memmove.o: @srcdir@/missing/memmove.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/memmove.c mkdir.o: @srcdir@/missing/mkdir.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/mkdir.c setenv.o: @srcdir@/missing/setenv.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/setenv.c strcasecmp.o: @srcdir@/missing/strcasecmp.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/strcasecmp.c strchr.o: @srcdir@/missing/strchr.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/strchr.c strdup.o: @srcdir@/missing/strdup.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/strdup.c strerror.o: @srcdir@/missing/strerror.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/strerror.c strftime.o: @srcdir@/missing/strftime.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/strftime.c strstr.o: @srcdir@/missing/strstr.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/strstr.c strtol.o: @srcdir@/missing/strtol.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/strtol.c strtoul.o: @srcdir@/missing/strtoul.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/strtoul.c vsnprintf.o: @srcdir@/missing/vsnprintf.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/vsnprintf.c nt.o: @srcdir@/missing/nt.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/nt.c x68.o: @srcdir@/missing/x68.c $(CC) $(CFLAGS) $(CPPFLAGS) -c @srcdir@/missing/x68.c # Prevent GNU make v3 from overflowing arg limit on SysV. .NOEXPORT: ### parse.o: parse.y ruby.h config.h defines.h intern.h env.h node.h st.h regex.h util.h lex.c ### array.o: array.c ruby.h config.h defines.h intern.h bignum.o: bignum.c ruby.h config.h defines.h intern.h class.o: class.c ruby.h config.h defines.h intern.h node.h st.h compar.o: compar.c ruby.h config.h defines.h intern.h dir.o: dir.c ruby.h config.h defines.h intern.h dln.o: dln.c config.h defines.h dln.h dmyext.o: dmyext.c enum.o: enum.c ruby.h config.h defines.h intern.h error.o: error.c ruby.h config.h defines.h intern.h env.h eval.o: eval.c ruby.h config.h defines.h intern.h node.h env.h rubysig.h st.h dln.h file.o: file.c ruby.h config.h defines.h intern.h rubyio.h rubysig.h fnmatch.o: fnmatch.c config.h fnmatch.h gc.o: gc.c ruby.h config.h defines.h intern.h rubysig.h st.h node.h env.h re.h regex.h glob.o: config.h glob.c fnmatch.h hash.o: hash.c ruby.h config.h defines.h intern.h st.h rubysig.h inits.o: inits.c ruby.h config.h defines.h intern.h io.o: io.c ruby.h config.h defines.h intern.h rubyio.h rubysig.h main.o: main.c ruby.h config.h defines.h intern.h marshal.o: marshal.c ruby.h config.h defines.h intern.h rubyio.h st.h math.o: math.c ruby.h config.h defines.h intern.h numeric.o: numeric.c ruby.h config.h defines.h intern.h object.o: object.c ruby.h config.h defines.h intern.h st.h pack.o: pack.c ruby.h config.h defines.h intern.h process.o: process.c ruby.h config.h defines.h intern.h rubysig.h st.h random.o: random.c ruby.h config.h defines.h intern.h range.o: range.c ruby.h config.h defines.h intern.h re.o: re.c ruby.h config.h defines.h intern.h re.h regex.h regex.o: regex.c config.h regex.h util.h ruby.o: ruby.c ruby.h config.h defines.h intern.h dln.h signal.o: signal.c ruby.h config.h defines.h intern.h rubysig.h sprintf.o: sprintf.c ruby.h config.h defines.h intern.h st.o: st.c config.h st.h string.o: string.c ruby.h config.h defines.h intern.h re.h regex.h struct.o: struct.c ruby.h config.h defines.h intern.h time.o: time.c ruby.h config.h defines.h intern.h util.o: util.c ruby.h config.h defines.h intern.h util.h variable.o: variable.c ruby.h config.h defines.h intern.h env.h node.h st.h version.o: version.c ruby.h config.h defines.h intern.h version.h ruby-1.2.3/README100644 774 145 11131 6530233424 11431 0ustar matzNaCl* What's Ruby Ruby is the interpreted scripting language for quick and easy object-oriented programming. It has many features to process text files and to do system management tasks (as in Perl). It is simple, straight-forward, and extensible. * Features of Ruby + Simple Syntax + *Normal* Object-Oriented features(ex. class, method calls) + *Advanced* Object-Oriented features(ex. Mix-in, Singleton-method) + Operator Overloading + Exception Handling + Iterators and Closures + Garbage Collection + Dynamic Loading of Object files(on some architecture) + Highly Portable(works on many UNIX machines) * How to get Ruby The Ruby distribution can be found on ftp://ftp.netlab.co.jp/pub/lang/ruby/ * How to compile and install This is what you need to do to compile and install Ruby: 1. Run ./configure, which will generate config.h and Makefile. 2. Edit defines.h if you need. Probably this step will not need. 3. Remove comment mark(#) before the module names from ext/Setup (or add module names if not present), if you want to link modules statically. If you don't want to compile non static extension modules (probably on architectures which does not allow dynamic loading), remove comment mark from the line "#option nodynamic" in ext/Setup. 4. Run make. 5. Optionally, run 'make test' to check whether the compiled Ruby interpreter works well. If you see the message "test succeeded", your ruby works as it should (hopefully). 6. Run 'make install' You may have to be a super user to install ruby. If you fail to compile ruby, please send the detailed error report with the error log and machine/OS type, to help others. * Copying Ruby is copyrighted free software by Yukihiro Matsumoto . You can redistribute it and/or modify it under either the terms of the GPL (see COPYING file), or the conditions below: 1. You may make and give away verbatim copies of the source form of the software without restriction, provided that you duplicate all of the original copyright notices and associated disclaimers. 2. You may modify your copy of the software in any way, provided that you do at least ONE of the following: a) place your modifications in the Public Domain or otherwise make them Freely Available, such as by posting said modifications to Usenet or an equivalent medium, or by allowing the author to include your modifications in the software. b) use the modified software only within your corporation or organization. c) rename any non-standard executables so the names do not conflict with standard executables, which must also be provided. d) make other distribution arrangements with the author. 3. You may distribute the software in object code or executable form, provided that you do at least ONE of the following: a) distribute the executables and library files of the software, together with instructions (in the manual page or equivalent) on where to get the original distribution. b) accompany the distribution with the machine-readable source of the software. c) give non-standard executables non-standard names, with instructions on where to get the original software distribution. d) make other distribution arrangements with the author. 4. You may modify and include the part of the software into any other software (possibly commercial). But some files in the distribution are not written by the author, so that they are not under this terms. They are gc.c(partly), utils.c(partly), regex.[ch], fnmatch.[ch], glob.c, st.[ch] and some files under the ./missing directory. See each file for the copying condition. 5. The scripts and library files supplied as input to or produced as output from the software do not automatically fall under the copyright of the software, but belong to whomever generated them, and may be sold commercially, and may be aggregated with this software. 6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. * Ruby home-page The URL of the Ruby home-page is: http://www.netlab.co.jp/ruby/ * The Author Feel free to send comments and bug reports to the author. Here is the author's latest mail address: matz@netlab.co.jp ------------------------------------------------------- created at: Thu Aug 3 11:57:36 JST 1995 Local variables: mode: indented-text end: ruby-1.2.3/README.jp100644 774 145 11330 6530233424 12042 0ustar matzNaCl* Rubyとは Rubyはシンプルかつ強力なオブジェクト指向スクリプト言語です． Rubyは最初から純粋なオブジェクト指向言語として設計されていま すから，オブジェクト指向プログラミングを手軽に行う事が出来ま す．もちろん通常の手続き型のプログラミングも可能です． Rubyはテキスト処理関係の能力などに優れ，Perlと同じくらい強力 です．さらにシンプルな文法と，例外処理やイテレータなどの機構 によって，より分かりやすいプログラミングが出来ます． * Rubyの特長． + シンプルな文法 + 普通のオブジェクト指向機能(クラス，メソッドコールなど) + 特殊なオブジェクト指向機能(Mixin, 特異メソッドなど) + 演算子オーバーロード + 例外処理機能 + イテレータとクロージャ + ガーベージコレクタ + ダイナミックローディング (アーキテクチャによる) + 移植性が高い．多くのUNIX上で動く * 入手法 ** ftpで 以下の場所においてあります． ftp://ftp.netlab.co.jp/pub/lang/ruby/ * ホームページ RubyのホームページのURLは http://www.netlab.co.jp/ruby/jp/ です． * メイリングリスト Rubyに関わる話題のためのメイリングリストを開設しました．ア ドレスは ruby-list@netlab.co.jp です．このアドレスにメイルを送れば，自動的に登録されます． * コンパイル・インストール 以下の手順で行ってください． 1. configureを実行してMakefileなどを生成する 2. (必要ならば)defines.hを編集する 多分，必要無いと思います． 3. (必要ならば)ext/Setupに静的にリンクする拡張モジュールを 指定する ext/Setupに記述したモジュールは静的にリンクされます． ダイナミックローディングをサポートしていないアーキテク チャではSetupの1行目の「option nodynamic」という行のコ メントを外す必要があります．また，このアーキテクチャで 拡張モジュールを利用するためには，あらかじめ静的にリン クしておく必要があります． 4. makeを実行してコンパイルする 5. make testでテストを行う． 「test succeeded」と表示されれば成功です．ただしテスト に成功しても完璧だと保証されている訳ではありません． 6. make install rootで作業する必要があるかもしれません． もし，コンパイル時にエラーが発生した場合にはエラーのログとマ シン，OSの種類を含むできるだけ詳しいレポートを作者に送ってく ださると他の方のためにもなります． * 移植 UNIXであればconfigureがほとんどの差異を吸収してくれるはずで すが，思わぬ見落としがあった場合(あるに違いない)，作者にその ことをレポートすれば，解決できるかも知れません． アークテクチャにもっとも依存するのはGC部です．RubyのGCは対象 のアーキテクチャがsetjmp()によって全てのレジスタを jmp_bufに 格納することと，jmp_bufとスタックが32bitアラインメントされて いることを仮定しています．特に前者が成立しない場合の対応は非 常に困難でしょう．後者の解決は比較的簡単で，gc.cでスタックを マークしている部分にアラインメントのバイト数だけずらしてマー クするコードを追加するだけで済みます．「defined(THINK_C)」で 括られている部分を参考にしてください # 実際にはRubyはThink Cではコンパイルできません． レジスタウィンドウを持つCPUでは，レジスタウィンドウをスタッ クにフラッシュするアセンブラコードを追加する必要があるかも知 れません． * 配布条件 RUbyはフリーソフトウェアです．GPL(the GNU General Public Licence)または以下に示す条件でRubyを再配布できます．GPLにつ いてはCOPYINGファイルを参照して下さい． 1. 複製は制限なく自由です． 2. 以下の条件のいずれかを満たす時に手元のRubyのソースを自 由に変更できます． (a) ネットニューズにポストしたり，作者に変更を送付する などの方法で，変更を公開する (b) 変更したRubyを自分の所属する組織内部だけで使う (c) 変更点を明示したうえ，ソフトウェアの名前を変更する． そのソフトウェアを配布する時にはもとのRubyも同時に 配布する (d) その他の変更条件を作者と合意する 3. 以下の条件のいずれかを満たす時にRubyをオブジェクトコー ドや実行形式でも配布できます． (a) バイナリを受け取った人がソースを入手できるようにソー スの入手法を明示する (b) 機械可読なソースコードを添付する (c) 変更を行ったバイナリは名前を変更したうえ，ソースの 入手法を明示する (d) その他の配布条件を作者と合意する 4. 他のプログラムへの引用はいかなる目的であれ自由です．た だし，Rubyに含まれる他の作者によるコードは，それぞれの 作者の意向による制限が加えられます．具体的にはgc.c(一部)， util.c(一部)，st.[ch]，regex.[ch], fnmatch.[ch], glob.c および./missingディレクトリ下のファイル群が該当します． 5. Rubyへの入力となるスクリプトおよび，Rubyからの出力の権 利はRubyの作者ではなく，それぞれの入出力を生成した人に 属します．また，Rubyに組み込むための拡張モジュールにつ いても同様です． 6. Rubyは無保証です．作者はRubyをサポートする意志はありま すが，Ruby自身のバグあるいはRubyスクリプトのバグなどか ら発生するいかなる損害に対しても責任を持ちません． * 著者 コメント，バグレポートその他は matz@netlab.co.jp まで． ------------------------------------------------------- created at: Thu Aug 3 11:57:36 JST 1995 Local variables: mode: indented-text end: ruby-1.2.3/README.EXT100644 774 145 67543 6537134565 12127 0ustar matzNaCl.\" README.EXT - -*- Text -*- created at: Mon Aug 7 16:45:54 JST 1995 This document explains how to make extention modules for Ruby. 1．Basic knowledge In C, variables have types and data do not have types. In contrast, Ruby variables do not have static type and data themselves have types. So, data need to be converted across the languages. Data in Ruby represented C type `VALUE'. Each VALUE data have its data-type. To retrieve an C data from the VALUE, you need to: (1) Identify VALUE's data type (2) Convert VALUE into C data Converting to wrong data type may cause serious promblems. 1.1 Data-types Ruby interpreter has data-types as below: T_NIL nil T_OBJECT ordinaly object T_CLASS class T_MODULE module T_FLOAT floating point number T_STRING string T_REGEXP regular expression T_ARRAY array T_FIXNUM Fixnum(31bit integer) T_HASH assosiative array T_STRUCT (Ruby) structure T_BIGNUM multi precision integer T_TRUE true T_FALSE false T_DATA data Otherwise, there are several other types used internally: T_ICLASS T_MATCH T_VARMAP T_SCOPE T_NODE Most of the types are represented by C structures. 1.2 Check Data Type of the VALUE The macro TYPE() defined in ruby.h shows data-type of the VALUE. TYPE() returns the constant number T_XXXX described above. To handle data-types, the code will be like: switch (TYPE(obj)) { case T_FIXNUM: /* process Fixnum */ break; case T_STRING: /* process String */ break; case T_ARRAY: /* process Array */ break; default: /* raise exception */ Fail("not valid value"); break; } There is the data-type check function. void Check_Type(VALUE value, int type) It raises an exception, if the VALUE does not have the type specified. There are faster check-macros for fixnums and nil. FIXNUM_P(obj) NIL_P(obj) 1.3 Convert VALUE into C data データタイプがT_NIL, T_FALSE, T_TRUEである時，データはそれぞ れnil, false, trueです．このデータタイプのオブジェクトはひと つずつしか存在しません． データタイプがT_FIXNUMの時，これは31bitのサイズを持つ整数で す．FIXNUMをCの整数に変換するためにはマクロ「FIX2INT()」を使 います．それから，FIXNUMに限らずRubyのデータを整数に変換する 「NUM2INT()」というマクロがあります．このマクロはデータタイ プのチェック無しで使えます(整数に変換できない場合には例外が 発生する)． それ以外のデータタイプは対応するCの構造体があります．対応す る構造体のあるVALUEはそのままキャスト(型変換)すれば構造体の ポインタに変換できます． 構造体は「struct RXxxxx」という名前でruby.hで定義されていま す．例えば文字列は「struct RString」です．実際に使う可能性が あるのは文字列と配列くらいだと思います． ruby.hでは構造体へキャストするマクロも「RXXXXX()」(全部大文 字にしたもの)という名前で提供されています(例: RSTRING())． 例えば，文字列strの長さを得るためには「RSTRING(str)->len」と し，文字列strをchar*として得るためには「RSTRING(str)->ptr」 とします．配列の場合には，それぞれ「RARRAT(str)->len」， 「RARRAT(str)->ptr」となります． Rubyの構造体を直接アクセスする時に気をつけなければならないこ とは，配列や文字列の構造体の中身は参照するだけで，直接変更し ないことです．直接変更した場合，オブジェクトの内容の整合性が とれなくなって，思わぬバグの原因になります． 1.4 Convert C data into VALUE VALUEの実際の構造は * FIXNUMの場合 1bit右シフトして，LSBを立てる． * その他のポインタの場合 そのままVALUEにキャストする． となっています．よって，LSBをチェックすればVALUEがFIXNUMかど うかわかるわけです(ポインタのLSBが立っていないことを仮定して いる)． ですから，FIXNUM以外のRubyのオブジェクトの構造体は単にVALUE にキャストするだけでVALUEに変換出来ます．ただし，任意の構造 体がVALUEにキャスト出来るわけではありません．キャストするの はRubyの知っている構造体(ruby.hで定義されているstruct RXxxx のもの)だけにしておいてください． FIXNUMに関しては変換マクロを経由する必要があります．Cの整数 からVALUEに変換するマクロは以下のものがあります．必要に応じ て使い分けてください． INT2FIX() もとの整数が31bit以内に収まる時 INT2NUM() 任意の整数からVALUEへ INT2NUM()は整数がFIXNUMの範囲に収まらない場合，Bignumに変換 してくれます(が，少し遅い)． 1.5 Manipulate Ruby data 先程も述べた通り，Rubyの構造体をアクセスする時に内容の更新を 行うことは勧められません．で，Rubyのデータを操作する時には Rubyが用意している関数を用いてください． ここではもっとも使われるであろう文字列と配列の生成/操作を行 い関数をあげます(全部ではないです)． String funtions str_new(char *ptr, int len) Creates a new Ruby string. str_new2(char *ptr) Creates a new Ruby string from C string. This is equivalent to str_new(ptr, strlen(ptr)). str_cat(VALUE str, char *ptr, int len) Appends len bytes data from ptr to the Ruby string. Array functions ary_new() Creates an array with no element. ary_new2(int len) Creates an array with no element, with allocating internal buffer for len elements. ary_new3(int n, ...) Creates an n-elements array from arguments. ary_new4(int n, VALUE *elts) Creates an n-elements array from C array. ary_push(VALUE ary, VALUE val) ary_pop(VALUE ary) ary_shift(VALUE ary) ary_unshift(VALUE ary, VALUE val) ary_entry(VALUE ary, int idx) Array operations. The first argument to each functions must be an array. They may dump core if other types given. 2. Extend Ruby with C 原理的にRubyで書けることはCでも書けます．RubyそのものがCで記 述されているんですから，当然といえば当然なんですけど．ここで はRubyの拡張に使うことが多いだろうと予測される機能を中心に紹 介します． 2.1 Add new features to Ruby Rubyで提供されている関数を使えばRubyインタプリタに新しい機能 を追加することができます．Rubyでは以下の機能を追加する関数が 提供されています． * クラス，モジュール * メソッド，特異メソッドなど * 定数 では順に紹介します． 2.1.1 Class/module definition クラスやモジュールを定義するためには，以下の関数を使います． VALUE rb_define_class(char *name, VALUE super) VALUE rb_define_module(char *name) これらの関数は新しく定義されたクラスやモジュールを返します． メソッドや定数の定義にこれらの値が必要なので，ほとんどの場合 は戻り値を変数に格納しておく必要があるでしょう． 2.1.2 Method/singleton method definition メソッドや特異メソッドを定義するには以下の関数を使います． void rb_define_method(VALUE class, char *name, VALUE (*func)(), int argc) void rb_define_singleton_method(VALUE object, char *name, VALUE (*func)(), int argc) 念のため説明すると「特異メソッド」とは，その特定のオブジェク トに対してだけ有効なメソッドです．RubyではよくSmalltalkにお けるクラスメソッドとして，クラスに対する特異メソッドが使われ ます． これらの関数の argcという引数はCの関数へ渡される引数の数(と 形式)を決めます．argcが正の時は関数に引き渡す引数の数を意味 します．16個以上の引数は使えません(が，要りませんよね，そん なに)． argcが負の時は引数の数ではなく，形式を指定したことになります． argcが-1の時は引数を配列に入れて渡されます．argcが-2の時は引 数はRubyの配列として渡されます． メソッドを定義する関数はもう二つあります．ひとつはprivateメ ソッドを定義する関数で，引数はrb_define_method()と同じです． void rb_define_private_method(VALUE class, char *name, VALUE (*func)(), int argc) privateメソッドとは関数形式でしか呼び出すことの出来ないメソッ ドです． もうひとつはモジュール関数を定義するものです．モジュール関数 とはモジュールの特異メソッドであり，同時にprivateメソッドで もあるものです．例をあげるとMathモジュールのsqrt()などがあげ られます．このメソッドは Math.sqrt(4) という形式でも include Math sqrt(4) という形式でも使えます．モジュール関数を定義する関数は以下の 通りです． void rb_define_module_function(VALUE module, char *name, VALUE (*func)(), int argc) 関数的メソッド(Kernelモジュールのprivaet method)を定義するた めの関数は以下の通りです． void rb_define_global_function(char *name, VALUE (*func)(), int argc) 2.1.3 Constant definition 拡張モジュールが必要な定数はあらかじめ定義しておいた方が良い でしょう．定数を定義する関数は二つあります． void rb_define_const(VALUE class, char *name, VALUE val) void rb_define_global_const(char *name, VALUE val) 前者は特定のクラス/モジュールに属する定数を定義するもの，後 者はグローバルな定数を定義するものです． 2.2 Use Ruby features from C 既に『1.5 Rubyのデータを操作する』で一部紹介したような関数を 使えば，Rubyの機能を実現している関数を直接呼び出すことが出来 ます． # このような関数の一覧表はいまのところありません．ソースを見 # るしかないですね． それ以外にもRubyの機能を呼び出す方法はいくつかあります． 2.2.1 Rubyのプログラムをevalする CからRubyの機能を呼び出すもっとも簡単な方法として，文字列で 与えられたRubyのプログラムを評価する関数があります． VALUE rb_eval_string(char *str) この評価は現在の環境で行われます．つまり，現在のローカル変数 などを受け継ぎます． 2.2.2 ID or Symbol Cから文字列を経由せずにRubyのメソッドを呼び出すこともできま す．その前に，Rubyインタプリタ内でメソッドや変数名を指定する 時に使われているIDについて説明しておきましょう． IDとは変数名，メソッド名を表す整数です．Rubyの中では :識別子 でアクセスできます．Cからこの整数を得るためには関数 rb_intern(char *name) を使います．また一文字の演算子はその文字コードがそのままシン ボルになっています． 2.2.3 Invoke Ruby method from C Cから文字列を経由せずにRubyのメソッドを呼び出すためには以下 の関数を使います． VALUE rb_funcall(VALUE recv, ID mid, int argc, ...) この関数はオブジェクトrecvのmidで指定されるメソッドを呼び出 します． 2.2.4 変数/定数を参照/更新する Cから関数を使って参照・更新できるのは，クラス定数，インスタ ンス変数です．大域変数は一部のものはCの大域変数としてアクセ スできます．ローカル変数を参照する方法は公開していません． オブジェクトのインスタンス変数を参照・更新する関数は以下の通 りです． VALUE rb_ivar_get(VALUE obj, ID id) VALUE rb_ivar_set(VALUE obj, ID id, VALUE val) idはrb_intern()で得られるものを使ってください． クラス定数を参照するには以下の関数を使ってください． VALUE rb_const_get(VALUE obj, ID id) クラス定数を新しく定義するためには『2.1.3 定数定義』で紹介さ れている関数を使ってください． 3. Informatin sharing between Ruby and C C言語とRubyの間で情報を共有する方法について解説します． 3.1 Ruby constant that Cから参照できるRubyの定数 Following Ruby constants can be referred from C. TRUE FALSE Boolean values. FALSE is false in the C also (i.e. 0). Qnil Ruby nil in C scope. 3.2 Global variables shared between C and Ruby CとRubyで大域変数を使って情報を共有できます．共有できる大域 変数にはいくつかの種類があります．そのなかでもっとも良く使わ れると思われるのはrb_define_variable()です． void rb_define_variable(char *name, VALUE *var) この関数はRubyとCとで共有する大域変数を定義します．変数名が `$'で始まらない時には自動的に追加されます．この変数の値を変 更すると自動的にRubyの対応する変数の値も変わります． またRuby側からは更新できない変数もあります．このread onlyの 変数は以下の関数で定義します． void rb_define_readonly_variable(char *name, VALUE *var) これら変数の他にhookをつけた大域変数を定義できます．hook付き の大域変数は以下の関数を用いて定義します．hook付き大域変数の 値の参照や設定はhookで行う必要があります． void rb_define_hooked_variable(char *name, VALUE *var, VALUE (*getter)(), VALUE (*setter)()) この関数はCの関数によってhookのつけられた大域変数を定義しま す．変数が参照された時には関数getterが，変数に値がセットされ た時には関数setterが呼ばれる．hookを指定しない場合はgetterや setterに0を指定します． # getterもsetterも0ならばrb_define_variable()と同じになる． それから，Cの関数によって実現されるRubyの大域変数を定義する 関数があります． void rb_define_virtual_variable(char *name, VALUE (*getter)(), VALUE (*setter)()) この関数によって定義されたRubyの大域変数が参照された時には getterが，変数に値がセットされた時にはsetterが呼ばれます． The prototypes of the getter and setter functions are as following: (*getter)(ID id, void *data, struct global_entry* entry); (*setter)(VALUE val, ID id, void *data, struct global_entry* entry); 3.3 Encapsulate C data into Ruby object Cの世界で定義されたデータ(構造体)をRubyのオブジェクトとして 取り扱いたい場合がありえます．このような場合には，Dataという RubyオブジェクトにCの構造体(へのポインタ)をくるむことでRuby オブジェクトとして取り扱えるようになります． Dataオブジェクトを生成して構造体をRubyオブジェクトにカプセル 化するためには，以下のマクロを使います． Data_Wrap_Struct(class,mark,free,ptr) このマクロの戻り値は生成されたDataオブジェクトです． classはこのDataオブジェクトのクラスです．ptrはカプセル化する Cの構造体へのポインタです．markはこの構造体がRubyのオブジェ クトへの参照がある時に使う関数です．そのような参照を含まない 時には0を指定します． # そのような参照は勧められません． freeはこの構造体がもう不要になった時に呼ばれる関数です．この 関数がガーベージコレクタから呼ばれます． Cの構造体の割当とDataオブジェクトの生成を同時に行うマクロと して以下のものが提供されています． Data_Make_Struct(class, type, mark, free, sval) このマクロの戻り値は生成されたDataオブジェクトです． class, mark, freeはData_Wrap_Structと同じ働きをします．type は割り当てるC構造体の型です．割り当てられた構造体は変数sval に代入されます．この変数の型は (type*) である必要があります． Dataオブジェクトからポインタを取り出すのは以下のマクロを用い ます． Data_Get_Struct(obj, type, sval) Cの構造体へのポインタは変数svalに代入されます． これらのDataの使い方はちょっと分かりにくいので，後で説明する 例題を参照してください． 4．Example - Create dbm module ここまでの説明でとりあえず拡張モジュールは作れるはずです． Rubyのextディレクトリにすでに含まれているdbmモジュールを例に して段階的に説明します． (1) make the directory % mkdir ext/dbm Rubyを展開したディレクトリの下，extディレクトリの中に拡張モ ジュール用のディレクトリを作ります．名前は適当に選んで構いま せん． (2) create MANIFEST file % cd ext/dbm % touch MANIFEST 拡張モジュールのディレクトリの下にはMANIFESTというファイルが 必要なので，とりあえず空のファイルを作っておきます．後でこの ファイルには必要なファイル一覧が入ることになります． MANIFESTというファイルは，makeの時にディレクトリが拡張モジュー ルを含んでいるかどうか判定するために使われれています． (3) design the library まあ，当然なんですけど，どういう機能を実現するかどうかまず設 計する必要があります．どんなクラスをつくるか，そのクラスには どんなメソッドがあるか，クラスが提供する定数などについて設計 します．dbmクラスについてはext/dbm.docを参照してください． (4) write C code. 拡張モジュール本体となるC言語のソースを書きます．C言語のソー スがひとつの時には「モジュール名.c」を選ぶと良いでしょう．C 言語のソースが複数の場合には逆に「モジュール名.c」というファ イル名は避ける必要があります．オブジェクトファイルとモジュー ル生成時に中間的に生成される「モジュール名.o」というファイル とが衝突するからです． Rubyは拡張モジュールをロードする時に「Init_モジュール名」と いう関数を自動的に実行します．dbmモジュールの場合「Init_dbm」 です．この関数の中でクラス，モジュール，メソッド，定数などの 定義を行います．dbm.cから一部引用します． -- Init_dbm() { /* DBMクラスを定義する */ cDBM = rb_define_class("DBM", cObject); /* DBMはEnumerateモジュールをインクルードする */ rb_include_module(cDBM, mEnumerable); /* DBMクラスのクラスメソッドopen(): 引数はCの配列で受ける */ rb_define_singleton_method(cDBM, "open", fdbm_s_open, -1); /* DBMクラスのメソッドclose(): 引数はなし */ rb_define_method(cDBM, "close", fdbm_close, 0); /* DBMクラスのメソッド[]: 引数は1個 */ rb_define_method(cDBM, "[]", fdbm_fetch, 1); : /* DBMデータを格納するインスタンス変数名のためのID */ id_dbm = rb_intern("dbm"); } -- DBMモジュールはdbmのデータと対応するオブジェクトになるはずで すから，Cの世界のdbmをRubyの世界に取り込む必要があります． dbm.cではData_Make_Structを以下のように使っています． -- struct dbmdata { int di_size; DBM *di_dbm; }; obj = Data_Make_Struct(class,struct dbmdata,0,free_dbm,dbmp); -- ここではdbmstruct構造体へのポインタをDataにカプセル化してい ます．DBM*を直接カプセル化しないのはclose()した時の処理を考 えてのことです． Dataオブジェクトからdbmstruct構造体のポインタを取り出すため に以下のマクロを使っています． -- #define GetDBM(obj, dbmp) {\ Data_Get_Struct(obj, struct dbmdata, dbmp);\ if (dbmp->di_dbm == 0) closed_dbm();\ } -- ちょっと複雑なマクロですが，要するにdbmdata構造体のポインタ の取り出しと，closeされているかどうかのチェックをまとめてい るだけです． DBMクラスにはたくさんメソッドがありますが，分類すると3種類の 引数の受け方があります．ひとつは引数の数が固定のもので，例と してはdeleteメソッドがあります．deleteメソッドを実装している fdbm_delete()はこのようになっています． -- static VALUE fdbm_delete(obj, keystr) VALUE obj, keystr; { : } -- 引数の数が固定のタイプは第1引数がself，第2引数以降がメソッド の引数となります． 引数の数が不定のものはCの配列で受けるものとRubyの配列で受け るものとがあります．dbmモジュールの中で，Cの配列で受けるもの はDBMのクラスメソッドであるopen()です．これを実装している関 数fdbm_s_open()はこうなっています． -- static VALUE fdbm_s_open(argc, argv, class) int argc; VALUE *argv; VALUE class; { : if (rb_scan_args(argc, argv, "11", &file, &vmode) == 1) { mode = 0666; /* default value */ } : } -- このタイプの関数は第1引数が与えられた引数の数，第2引数が与え られた引数の入っている配列になります．selfは第3引数として与 えられます． この配列で与えられた引数を解析するための関数がopen()でも使わ れているrb_scan_args()です．第3引数に指定したフォーマットに 従い，第4変数以降に指定した変数に値を代入してくれます．この フォーマットは，第1文字目が省略できない引数の数，第2文字目が 省略できる引数の数，第3文字目が対応する相手が無いあまりの引 数があるかどうかを示す"*"です．2文字目と3文字目は省略できま す．dbm.cの例では，フォーマットは"11"ですから，引数は最低1つ で，2つまで許されるという意味になります．省略されている時の 変数の値はnil(C言語のレベルではQnil)になります． Rubyの配列で引数を受け取るものはindexesがあります．実装はこ うです． -- static VALUE fdbm_indexes(obj, args) VALUE obj; struct RArray *args; { : } -- 第1引数はself，第2引数はRubyの配列です．ここではキャストを減 らすため struct RArray* で受けていますが，VALUEでも同じこと です． ** 注意事項 Rubyと共有はしないがRubyのオブジェクトを格納する可能性のある Cの大域変数は以下の関数を使ってRubyインタプリタに変数の存在 を教えてあげてください．でないとGCでトラブルを起こします． void rb_global_variable(VALUE *var) (5) prepare extconf.rb もしディレクトリに「extconf.rb」というファイルが存在すれば， make時に実行されます．なければ適当にMakefileが生成されます． extconf.rbはモジュールのコンパイルに必要な条件のチェックなど を行うことが目的です．extconf.rbの中では以下のRuby関数を使う ことが出来ます． have_library(lib, func): ライブラリの存在チェック have_func(func): 関数の存在チェック have_header(header): ヘッダファイルの存在チェック create_makefile(target): Makefileの生成 以下の変数を使うことができます． $CFLAGS: コンパイル時に追加的に指定するフラグ(-Iなど) $LDFLAGS: リンク時に追加的に指定するフラグ(-Lなど) モジュールをコンパイルする条件が揃わなず，そのモジュールはコ ンパイルしない時にはcreate_makefileを呼ばなければMakefileは 生成されず，コンパイルも行われません． (6) prepare depend (optional) もし，ディレクトリにdependというファイルが存在すれば， Makefileが依存関係をチェックしてくれます． % gcc -MM *.c > depend などで作ることが出来ます．あって損は無いでしょう． (7) MANIFESTファイルにファイル名を入れる % ls > MANIFEST % vi MANIFEST *.o, *~など不必要なファイル以外はMANIFESTに追加しておきます． make時にはMANIFESTの内容は参照しませんので，空のままでも問題 は起きませんが，パッケージングの時に参照することがあるのと， 必要なファイルを区別できるので，用意しておいた方が良いでしょ う． (8) make Rubyのディレクトリでmakeを実行するとMakefileを生成からmake， 必要によってはそのモジュールのRubyへのリンクまで自動的に実行 してくれます．extconf.rbを書き換えるなどしてMakefileの再生成 が必要な時はまたRubyディレクトリでmakeしてください． (9) debug You may need to debug the module. The modules can be linked statically by adding directory name in the ext/Setup file, so that you can inspect the module by the debugger. (10) done, now you have the extension module 後はこっそり使うなり，広く公開するなり，売るなり，ご自由にお 使いください．Rubyの作者は拡張モジュールに関して一切の権利を 主張しません． Appendix A. Rubyのソースコードの分類 Rubyのソースはいくつかに分類することが出来ます．このうちクラ スライブラリの部分は基本的に拡張モジュールと同じ作り方になっ ています．これらのソースは今までの説明でほとんど理解できると 思います． ruby language core class.c error.c eval.c gc.c object.c parse.y variable.c utility functions dln.c fnmatch.c glob.c regex.c st.c util.c ruby interpreter implementation dmyext.c inits.c main.c ruby.c version.c class library array.c bignum.c compar.c dir.c enum.c file.c hash.c io.c math.c numeric.c pack.c process.c random.c range.c re.c signal.c sprintf.c string.c struct.c time.c Appendix B. 拡張用関数リファレンス C言語からRubyの機能を利用するAPIは以下の通りである． ** 型 VALUE Rubyオブジェクトを表現する型．必要に応じてキャストして用いる． 組み込み型を表現するCの型はruby.hに記述してあるRで始まる構造 体である．VALUE型をこれらにキャストするためにRで始まる構造体 名を全て大文字にした名前のマクロが用意されている． ** Variables and constants Qnil const: nil object TRUE const: TRUE object(default true value) FALSE const: FALSE object ** Cデータのカプセル化 Data_Wrap_Struct(VALUE class, void (*mark)(), void (*free)(), void *sval) Cの任意のポインタをカプセル化したRubyオブジェクトを返す．こ のポインタがRubyからアクセスされなくなった時，freeで指定した 関数が呼ばれる．また，このポインタの指すデータが他のRubyオブ ジェクトを指している場合，markに指定する関数でマークする必要 がある． Data_Make_Struct(class, type, mark, free, sval) type型のメモリをmallocし，変数svalに代入した後，それをカプセ ル化したデータを返すマクロ． Data_Get_Struct(data, type, sval) dataからtype型のポインタを取り出し変数svalに代入するマクロ． ** クラス/モジュール定義 VALUE rb_define_class(char *name, VALUE super) superのサブクラスとして新しいRubyクラスを定義する． VALUE rb_define_class_under(VALUE module, char *name, VALUE super) superのサブクラスとして新しいRubyクラスを定義し，moduleの定 数として定義する． VALUE rb_define_module(char *name) 新しいRubyモジュールを定義する． VALUE rb_define_module_under(VALUE module, char *name, VALUE super) 新しいRubyモジュールを定義し，moduleの定数として定義する． void rb_include_module(VALUE class, VALUE module) モジュールをインクルードする．classがすでにmoduleをインクルー ドしている時には何もしない(多重インクルードの禁止)． void rb_extend_object(VALUE object, VALUE module) オブジェクトをモジュール(で定義されているメソッド)で拡張する． ** 大域変数定義 void rb_define_variable(char *name, VALUE *var) RubyとCとで共有するグローバル変数を定義する．変数名が`$'で始 まらない時には自動的に追加される．nameとしてRubyの識別子とし て許されない文字(例えば` ')を含む場合にはRubyプログラムから は見えなくなる． void rb_define_readonly_variable(char *name, VALUE *var) RubyとCとで共有するread onlyのグローバル変数を定義する．read onlyであること以外はrb_define_variable()と同じ． void rb_define_virtual_variable(char *name, VALUE (*getter)(), VALUE (*setter)()) 関数によって実現されるRuby変数を定義する．変数が参照された時 にはgetterが，変数に値がセットされた時にはsetterが呼ばれる． void rb_define_hooked_variable(char *name, VALUE *var, VALUE (*getter)(), VALUE (*setter)()) 関数によってhookのつけられたグローバル変数を定義する．変数が 参照された時にはgetterが，関数に値がセットされた時にはsetter が呼ばれる．getterやsetterに0を指定した時にはhookを指定しな いのと同じ事になる． void rb_global_variable(VALUE *var) GCのため，Rubyプログラムからはアクセスされないが, Rubyオブジェ クトを含む大域変数をマークする． ** クラス定数 void rb_define_const(VALUE class, char *name, VALUE val) クラス定数を定義する． void rb_define_global_const(char *name, VALUE val) 大域定数を定義する． rb_define_const(cKernal, name, val) と同じ意味． ** メソッド定義 rb_define_method(VALUE class, char *name, VALUE (*func)(), int argc) メソッドを定義する．argcはselfを除く引数の数．argcが-1の時, 関数には引数の数(selfを含まない)を第1引数, 引数の配列を第2引 数とする形式で与えられる(第3引数はself)．argcが-2の時, 第1引 数がself, 第2引数がargs(argsは引数を含むRubyの配列)という形 式で与えられる． rb_define_private_method(VALUE class, char *name, VALUE (*func)(), int argc) privateメソッドを定義する．引数はrb_define_method()と同じ． rb_define_singleton_method(VALUE class, char *name, VALUE (*func)(), int argc) 特異メソッドを定義する．引数はrb_define_method()と同じ． rb_scan_args(int atgc, VALUE *argv, char *fmt, ...) argc,argv形式で与えられた引数を分解する．fmtは必須引数の数, 付加引数の数, 残りの引数があるかを指定する文字列で, "数字数 字*"という形式である． 2 番目の数字と"*"はそれぞれ省略可能で ある．必須引数が一つもない場合は0を指定する．第3引数以降は変 数へのポインタで, 該当する要素がその変数に格納される．付加引 数に対応する引数が与えられていない場合は変数にQnilが代入され る． ** Rubyメソッド呼び出し VALUE rb_funcall(VALUE recv, ID mid, int narg, ...) メソッド呼び出し．文字列からmidを得るためにはrb_intern()を使う． VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv) メソッド呼び出し．引数をargc,argv形式で渡す． VALUE rb_eval_string(char *str) 文字列をRubyとスクリプトしてコンパイル・実行する． 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)(), void *arg1, VALUE (*func2)(), void *arg2) func2をブロックとして設定し, func1をイテレータとして呼ぶ． func1には arg1が引数として渡され, func2には第1引数にイテレー タから与えられた値, 第2引数にarg2が渡される． VALUE rb_yield(VALUE val) valを値としてイテレータブロックを呼び出す． VALUE rb_rescue(VALUE (*func1)(), void *arg1, VALUE (*func2)(), void *arg2) 関数func1をarg1を引数に呼び出す．func1の実行中に例外が発生し た時には func2をarg2を引数として呼ぶ．戻り値は例外が発生しな かった時はfunc1の戻り値, 例外が発生した時にはfunc2の戻り値で ある． VALUE rb_ensure(VALUE (*func1)(), void *arg1, void (*func2)(), void *arg2) 関数func1をarg1を引数として実行し, 実行終了後(たとえ例外が発 生しても) func2をarg2を引数として実行する．戻り値はfunc1の戻 り値である(例外が発生した時は戻らない)． ** 例外・エラー void Warning(char *fmt, ...) verbose時に標準エラー出力に警告情報を表示する．引数はprintf()と同じ． void Fail(char *fmt, ...) 例外を発生させる．引数はprintf()と同じ． void Fatal(char *fmt, ...) 致命的例外を発生させる．通常の例外処理は行なわれず, インター プリタが終了する(ただしensureで指定されたコードは終了前に実 行される)． void Bug(char *fmt, ...) インタープリタなどプログラムのバグでしか発生するはずのない状 況の時呼ぶ．インタープリタはコアダンプし直ちに終了する．例外 処理は一切行なわれない． ** Rubyの初期化・実行 Rubyをアプリケーションに埋め込む場合には以下のインタフェース を使う．通常の拡張モジュールには必要ない． void ruby_init(int argc, char **argv, char **envp) Rubyインタプリタの初期化を行なう． void ruby_run() Rubyインタプリタを実行する． void ruby_script(char *name) Rubyのスクリプト名($0)を設定する． Appendix B. extconf.rbで使える関数たち extconf.rbの中では利用可能なコンパイル条件チェックの関数は以 下の通りである． have_library(lib, func) 関数funcを定義しているライブラリlibの存在をチェックする．ラ イブラリが存在する時，TRUEを返す． have_func(func) 関数funcの存在をチェックする．funcが標準ではリンクされないラ イブラリ内のものである時には先にhave_libraryでそのライブラリ をチェックしておく事．関数が存在する時TRUEを返す． have_header(header) ヘッダファイルの存在をチェックする．ヘッダファイルが存在する 時TRUEを返す． create_makefile(target) 拡張モジュール用のMakefileを生成する．この関数を呼ばなければ そのモジュールはコンパイルされない．targetはモジュール名を表 す． /* * Local variables: * fill-column: 60 * end: */ ruby-1.2.3/README.EXT.jp100644 774 145 74457 6537134603 12532 0ustar matzNaCl.\" README.EXT - -*- Text -*- created at: Mon Aug 7 16:45:54 JST 1995 Rubyの拡張モジュールの作り方を説明します． 1．基礎知識 Cの変数には型があり，データには型がありません．ですから，た とえばポインタをintの変数に代入すると，その値は整数として取 り扱われます．逆にRubyの変数には型がなく，データに型がありま す．この違いのため，CとRubyは相互に変換しなければ，お互いの データをアクセスできません． RubyのデータはVALUEというCの型で表現されます．VALUE型のデー タはそのデータタイプを自分で知っています．このデータタイプと いうのはデータ(オブジェクト)の実際の構造を意味していて，Ruby のクラスとはまた違ったものです． VALUEからCにとって意味のあるデータを取り出すためには (1) VALUEのデータタイプを知る (2) VALUEをCのデータに変換する の両方が必要です．(1)を忘れると間違ったデータの変換が行われ て，最悪プログラムがcore dumpします． 1.1 データタイプ Rubyにはユーザが使う可能性のある以下のタイプがあります． T_NIL nil T_OBJECT 通常のオブジェクト T_CLASS クラス T_MODULE モジュール T_FLOAT 浮動小数点数 T_STRING 文字列 T_REGEXP 正規表現 T_ARRAY 配列 T_FIXNUM Fixnum(31bit長整数) T_HASH 連想配列 T_STRUCT (Rubyの)構造体 T_BIGNUM 多倍長整数 T_FILE 入出力 T_TRUE 真 T_FALSE 偽 T_DATA データ その他に内部で利用されている以下のタイプがあります． T_ICLASS T_MATCH T_VARMAP T_SCOPE T_NODE ほとんどのタイプはCの構造体で実装されています． 1.2 VALUEのデータタイプをチェックする ruby.hではTYPE()というマクロが定義されていて，VALUEのデータ タイプを知ることが出来ます．TYPE()マクロは上で紹介したT_XXXX の形式の定数を返します．VALUEのデータタイプに応じて処理する 場合には，TYPE()の値で分岐することになります． switch (TYPE(obj)) { case T_FIXNUM: /* FIXNUMの処理 */ break; case T_STRING: /* 文字列の処理 */ break; case T_ARRAY: /* 配列の処理 */ break; default: /* 例外を発生させる */ TypeError("not valid value"); break; } それとデータタイプをチェックして，正しくなければ例外を発生す る関数が用意されています． void Check_Type(VALUE value, int type) この関数はvalueがtypeで無ければ，例外を発生させます．引数と して与えられたVALUEのデータタイプが正しいかどうかチェックす るためには，この関数を使います． FIXNUMとNILに関してはより高速な判別マクロが用意されています． FIXNUM_P(obj) NIL_P(obj) 1.3 VALUEをCのデータに変換する データタイプがT_NIL, T_FALSE, T_TRUEである時，データはそれぞ れnil, false, trueです．このデータタイプのオブジェクトはひと つずつしか存在しません． データタイプがT_FIXNUMの時，これは31bitのサイズを持つ整数で す．FIXNUMをCの整数に変換するためにはマクロ「FIX2INT()」を使 います．それから，FIXNUMに限らずRubyのデータを整数に変換する 「NUM2INT()」というマクロがあります．このマクロはデータタイ プのチェック無しで使えます(整数に変換できない場合には例外が 発生する)． 同様にチェック無しで使える変換マクロはdoubleを取り出す 「NUM2DBL()」とchar*を取り出す「STR2CSTR()」があります． それ以外のデータタイプは対応するCの構造体があります．対応す る構造体のあるVALUEはそのままキャスト(型変換)すれば構造体の ポインタに変換できます． 構造体は「struct RXxxxx」という名前でruby.hで定義されていま す．例えば文字列は「struct RString」です．実際に使う可能性が あるのは文字列と配列くらいだと思います． ruby.hでは構造体へキャストするマクロも「RXXXXX()」(全部大文 字にしたもの)という名前で提供されています(例: RSTRING())． 例えば，文字列strの長さを得るためには「RSTRING(str)->len」と し，文字列strをchar*として得るためには「RSTRING(str)->ptr」 とします．配列の場合には，それぞれ「RARRAY(str)->len」， 「RARRAY(str)->ptr」となります． Rubyの構造体を直接アクセスする時に気をつけなければならないこ とは，配列や文字列の構造体の中身は参照するだけで，直接変更し ないことです．直接変更した場合，オブジェクトの内容の整合性が とれなくなって，思わぬバグの原因になります． 1.4 CのデータをVALUEに変換する VALUEの実際の構造は * FIXNUMの場合 1bit右シフトして，LSBを立てる． * その他のポインタの場合 そのままVALUEにキャストする． となっています．よって，LSBをチェックすればVALUEがFIXNUMかど うかわかるわけです(ポインタのLSBが立っていないことを仮定して いる)． ですから，FIXNUM以外のRubyのオブジェクトの構造体は単にVALUE にキャストするだけでVALUEに変換出来ます．ただし，任意の構造 体がVALUEにキャスト出来るわけではありません．キャストするの はRubyの知っている構造体(ruby.hで定義されているstruct RXxxx のもの)だけです． FIXNUMに関しては変換マクロを経由する必要があります．Cの整数 からVALUEに変換するマクロは以下のものがあります．必要に応じ て使い分けてください． INT2FIX() もとの整数が31bit以内に収まる自信がある時 INT2NUM() 任意の整数からVALUEへ INT2NUM()は整数がFIXNUMの範囲に収まらない場合，Bignumに変換 してくれます(が，少し遅い)． 1.5 Rubyのデータを操作する 先程も述べた通り，Rubyの構造体をアクセスする時に内容の更新を 行うことは勧められません．で，Rubyのデータを操作する時には Rubyが用意している関数を用いてください． ここではもっとも使われるであろう文字列と配列の生成/操作を行 い関数をあげます(全部ではないです)． 文字列に対する関数 str_new(char *ptr, int len) 新しいRubyの文字列を生成する． str_new2(char *ptr) Cの文字列からRubyの文字列を生成する．この関数の機能は str_new(ptr, strlen(ptr))と同等である． str_cat(VALUE str, char *ptr, int len) Rubyの文字列strにlenバイトの文字列ptrを追加する． 配列に対する関数 ary_new() 要素が0の配列を生成する． ary_new2(int len) 要素が0の配列を生成する．len要素分の領域をあらかじめ割り 当てておく． ary_new3(int n, ...) 引数で指定したn要素を含む配列を生成する． ary_new4(int n, VALUE *elts) 配列で与えたn要素の配列を生成する． ary_push(VALUE ary, VALUE val) ary_pop(VALUE ary) ary_shift(VALUE ary) ary_unshift(VALUE ary, VALUE val) ary_entry(VALUE ary, int idx) Arrayの同名のメソッドと同じ働きをする関数．第1引数は必ず 配列でなければならない． 2．Rubyの機能を使う 原理的にRubyで書けることはCでも書けます．RubyそのものがCで記 述されているんですから，当然といえば当然なんですけど．ここで はRubyの拡張に使うことが多いだろうと予測される機能を中心に紹 介します． 2.1 Rubyに機能を追加する Rubyで提供されている関数を使えばRubyインタプリタに新しい機能 を追加することができます．Rubyでは以下の機能を追加する関数が 提供されています． * クラス，モジュール * メソッド，特異メソッドなど * 定数 では順に紹介します． 2.1.1 クラス/モジュール定義 クラスやモジュールを定義するためには，以下の関数を使います． VALUE rb_define_class(char *name, VALUE super) VALUE rb_define_module(char *name) これらの関数は新しく定義されたクラスやモジュールを返します． メソッドや定数の定義にこれらの値が必要なので，ほとんどの場合 は戻り値を変数に格納しておく必要があるでしょう． クラスやモジュールを他のクラスの内部にネストして定義する時に は以下の関数を使います． VALUE rb_define_class(VALUE outer, char *name, VALUE super) VALUE rb_define_module(VALUE outer, char *name) 2.1.2 メソッド/特異メソッド定義 メソッドや特異メソッドを定義するには以下の関数を使います． void rb_define_method(VALUE class, char *name, VALUE (*func)(), int argc) void rb_define_singleton_method(VALUE object, char *name, VALUE (*func)(), int argc) 念のため説明すると「特異メソッド」とは，その特定のオブジェク トに対してだけ有効なメソッドです．RubyではよくSmalltalkにお けるクラスメソッドとして，クラスに対する特異メソッドが使われ ます． これらの関数の argcという引数はCの関数へ渡される引数の数(と 形式)を決めます．argcが正の時は関数に引き渡す引数の数を意味 します．16個以上の引数は使えません(が，要りませんよね，そん なに)．実際の関数には先頭の引数としてselfが与えられますので， 指定した数より1多い引数を持つことになります． argcが負の時は引数の数ではなく，形式を指定したことになります． argcが-1の時は引数を配列に入れて渡されます．argcが-2の時は引 数はRubyの配列として渡されます． メソッドを定義する関数はもう二つあります．ひとつはprivateメ ソッドを定義する関数で，引数はrb_define_method()と同じです． void rb_define_private_method(VALUE class, char *name, VALUE (*func)(), int argc) privateメソッドとは関数形式でしか呼び出すことの出来ないメソッ ドです． もうひとつはモジュール関数を定義するものです．モジュール関数 とはモジュールの特異メソッドであり，同時にprivateメソッドで もあるものです．例をあげるとMathモジュールのsqrt()などがあげ られます．このメソッドは Math.sqrt(4) という形式でも include Math sqrt(4) という形式でも使えます．モジュール関数を定義する関数は以下の 通りです． void rb_define_module_function(VALUE module, char *name, VALUE (*func)(), int argc) 関数的メソッド(Kernelモジュールのprivate method)を定義するた めの関数は以下の通りです． void rb_define_global_function(char *name, VALUE (*func)(), int argc) 2.1.3 定数定義 拡張モジュールが必要な定数はあらかじめ定義しておいた方が良い でしょう．定数を定義する関数は二つあります． void rb_define_const(VALUE class, char *name, VALUE val) void rb_define_global_const(char *name, VALUE val) 前者は特定のクラス/モジュールに属する定数を定義するもの，後 者はグローバルな定数を定義するものです． 2.2 Rubyの機能をCから呼び出す 既に『1.5 Rubyのデータを操作する』で一部紹介したような関数を 使えば，Rubyの機能を実現している関数を直接呼び出すことが出来 ます． # このような関数の一覧表はいまのところありません．ソースを見 # るしかないですね． それ以外にもRubyの機能を呼び出す方法はいくつかあります． 2.2.1 Rubyのプログラムをevalする CからRubyの機能を呼び出すもっとも簡単な方法として，文字列で 与えられたRubyのプログラムを評価する関数があります． VALUE rb_eval_string(char *str) この評価は現在の環境で行われます．つまり，現在のローカル変数 などを受け継ぎます． 2.2.2 IDまたはシンボル Cから文字列を経由せずにRubyのメソッドを呼び出すこともできま す．その前に，Rubyインタプリタ内でメソッドや変数名を指定する 時に使われているIDについて説明しておきましょう． IDとは変数名，メソッド名を表す整数です．Rubyの中では :識別子 でアクセスできます．Cからこの整数を得るためには関数 rb_intern(char *name) を使います．また一文字の演算子はその文字コードがそのままシン ボルになっています．Rubyから引数として与えられたシンボル(ま たは文字列)をIDに変換するには以下の関数を使います． rb_to_id(VALUE symbol) 2.2.3 CからRubyのメソッドを呼び出す Cから文字列を経由せずにRubyのメソッドを呼び出すためには以下 の関数を使います． VALUE rb_funcall(VALUE recv, ID mid, int argc, ...) この関数はオブジェクトrecvのmidで指定されるメソッドを呼び出 します．その他に引数の指定の仕方が違う以下の関数もあります． VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv) VALUE rb_apply(VALUE recv, ID mid, VALUE args) applyには引数としてRubyの配列を与えます． 2.2.4 変数/定数を参照/更新する Cから関数を使って参照・更新できるのは，クラス定数，インスタ ンス変数です．大域変数は一部のものはCの大域変数としてアクセ スできます．ローカル変数を参照する方法は公開していません． オブジェクトのインスタンス変数を参照・更新する関数は以下の通 りです． VALUE rb_ivar_get(VALUE obj, ID id) VALUE rb_ivar_set(VALUE obj, ID id, VALUE val) idはrb_intern()で得られるものを使ってください． クラス定数を参照するには以下の関数を使ってください． VALUE rb_const_get(VALUE obj, ID id) クラス定数を新しく定義するためには『2.1.3 定数定義』で紹介さ れている関数を使ってください． 3．RubyとCとの情報共有 C言語とRubyの間で情報を共有する方法について解説します． 3.1 Cから参照できるRubyの定数 以下のRubyの定数はCのレベルから参照できる． TRUE FALSE 真偽値．FALSEはC言語でも偽とみなされる(つまり0)． Qnil C言語から見た「nil」． 3.2 CとRubyで共有される大域変数 CとRubyで大域変数を使って情報を共有できます．共有できる大域 変数にはいくつかの種類があります．そのなかでもっとも良く使わ れると思われるのはrb_define_variable()です． void rb_define_variable(char *name, VALUE *var) この関数はRubyとCとで共有する大域変数を定義します．変数名が `$'で始まらない時には自動的に追加されます．この変数の値を変 更すると自動的にRubyの対応する変数の値も変わります． またRuby側からは更新できない変数もあります．このread onlyの 変数は以下の関数で定義します． void rb_define_readonly_variable(char *name, VALUE *var) これら変数の他にhookをつけた大域変数を定義できます．hook付き の大域変数は以下の関数を用いて定義します．hook付き大域変数の 値の参照や設定はhookで行う必要があります． void rb_define_hooked_variable(char *name, VALUE *var, VALUE (*getter)(), VALUE (*setter)()) この関数はCの関数によってhookのつけられた大域変数を定義しま す．変数が参照された時には関数getterが，変数に値がセットされ た時には関数setterが呼ばれる．hookを指定しない場合はgetterや setterに0を指定します． # getterもsetterも0ならばrb_define_variable()と同じになる． それから，Cの関数によって実現されるRubyの大域変数を定義する 関数があります． void rb_define_virtual_variable(char *name, VALUE (*getter)(), VALUE (*setter)()) この関数によって定義されたRubyの大域変数が参照された時には getterが，変数に値がセットされた時にはsetterが呼ばれます． getterとsetterの仕様は以下の通りです． (*getter)(ID id, void *data, struct global_entry* entry); (*setter)(VALUE val, ID id, void *data, struct global_entry* entry); 3.3 CのデータをRubyオブジェクトにする Cの世界で定義されたデータ(構造体)をRubyのオブジェクトとして 取り扱いたい場合がありえます．このような場合には，Dataという RubyオブジェクトにCの構造体(へのポインタ)をくるむことでRuby オブジェクトとして取り扱えるようになります． Dataオブジェクトを生成して構造体をRubyオブジェクトにカプセル 化するためには，以下のマクロを使います． Data_Wrap_Struct(class,mark,free,ptr) このマクロの戻り値は生成されたDataオブジェクトです． classはこのDataオブジェクトのクラスです．ptrはカプセル化する Cの構造体へのポインタです．markはこの構造体がRubyのオブジェ クトへの参照がある時に使う関数です．そのような参照を含まない 時には0を指定します． # そのような参照は勧められません． freeはこの構造体がもう不要になった時に呼ばれる関数です．この 関数がガーベージコレクタから呼ばれます． Cの構造体の割当とDataオブジェクトの生成を同時に行うマクロと して以下のものが提供されています． Data_Make_Struct(class, type, mark, free, sval) このマクロの戻り値は生成されたDataオブジェクトです． class, mark, freeはData_Wrap_Structと同じ働きをします．type は割り当てるC構造体の型です．割り当てられた構造体は変数sval に代入されます．この変数の型は (type*) である必要があります． Dataオブジェクトからポインタを取り出すのは以下のマクロを用い ます． Data_Get_Struct(obj, type, sval) Cの構造体へのポインタは変数svalに代入されます． これらのDataの使い方はちょっと分かりにくいので，後で説明する 例題を参照してください． 4．例題 - dbmパッケージを作る ここまでの説明でとりあえず拡張モジュールは作れるはずです． Rubyのextディレクトリにすでに含まれているdbmモジュールを例に して段階的に説明します． (1) ディレクトリを作る % mkdir ext/dbm Ruby 1.1からは任意のディレクトリでダイナミックライブラリを作 ることができるようになりました．Rubyに静的にリンクする場合に はRubyを展開したディレクトリの下，extディレクトリの中に拡張 モジュール用のディレクトリを作る必要があります．名前は適当に 選んで構いません． (2) MANIFESTファイルを作る % cd ext/dbm % touch MANIFEST 拡張モジュールのディレクトリの下にはMANIFESTというファイルが 必要なので，とりあえず空のファイルを作っておきます．後でこの ファイルには必要なファイル一覧が入ることになります． MANIFESTというファイルは，静的リンクのmakeの時にディレクトリ が拡張モジュールを含んでいるかどうか判定するために使われれて います．ダイナミックライブラリを作る場合には必ずしも必要では ありません． (3) 設計する まあ，当然なんですけど，どういう機能を実現するかどうかまず設 計する必要があります．どんなクラスをつくるか，そのクラスには どんなメソッドがあるか，クラスが提供する定数などについて設計 します．dbmクラスについてはext/dbm.docを参照してください． (4) Cコードを書く 拡張モジュール本体となるC言語のソースを書きます．C言語のソー スがひとつの時には「モジュール名.c」を選ぶと良いでしょう．C 言語のソースが複数の場合には逆に「モジュール名.c」というファ イル名は避ける必要があります．オブジェクトファイルとモジュー ル生成時に中間的に生成される「モジュール名.o」というファイル とが衝突するからです． Rubyは拡張モジュールをロードする時に「Init_モジュール名」と いう関数を自動的に実行します．dbmモジュールの場合「Init_dbm」 です．この関数の中でクラス，モジュール，メソッド，定数などの 定義を行います．dbm.cから一部引用します． -- Init_dbm() { /* DBMクラスを定義する */ cDBM = rb_define_class("DBM", cObject); /* DBMはEnumerateモジュールをインクルードする */ rb_include_module(cDBM, mEnumerable); /* DBMクラスのクラスメソッドopen(): 引数はCの配列で受ける */ rb_define_singleton_method(cDBM, "open", fdbm_s_open, -1); /* DBMクラスのメソッドclose(): 引数はなし */ rb_define_method(cDBM, "close", fdbm_close, 0); /* DBMクラスのメソッド[]: 引数は1個 */ rb_define_method(cDBM, "[]", fdbm_fetch, 1); : /* DBMデータを格納するインスタンス変数名のためのID */ id_dbm = rb_intern("dbm"); } -- DBMモジュールはdbmのデータと対応するオブジェクトになるはずで すから，Cの世界のdbmをRubyの世界に取り込む必要があります． dbm.cではData_Make_Structを以下のように使っています． -- struct dbmdata { int di_size; DBM *di_dbm; }; obj = Data_Make_Struct(class,struct dbmdata,0,free_dbm,dbmp); -- ここではdbmstruct構造体へのポインタをDataにカプセル化してい ます．DBM*を直接カプセル化しないのはclose()した時の処理を考 えてのことです． Dataオブジェクトからdbmstruct構造体のポインタを取り出すため に以下のマクロを使っています． -- #define GetDBM(obj, dbmp) {\ Data_Get_Struct(obj, struct dbmdata, dbmp);\ if (dbmp->di_dbm == 0) closed_dbm();\ } -- ちょっと複雑なマクロですが，要するにdbmdata構造体のポインタ の取り出しと，closeされているかどうかのチェックをまとめてい るだけです． DBMクラスにはたくさんメソッドがありますが，分類すると3種類の 引数の受け方があります．ひとつは引数の数が固定のもので，例と してはdeleteメソッドがあります．deleteメソッドを実装している fdbm_delete()はこのようになっています． -- static VALUE fdbm_delete(obj, keystr) VALUE obj, keystr; { : } -- 引数の数が固定のタイプは第1引数がself，第2引数以降がメソッド の引数となります． 引数の数が不定のものはCの配列で受けるものとRubyの配列で受け るものとがあります．dbmモジュールの中で，Cの配列で受けるもの はDBMのクラスメソッドであるopen()です．これを実装している関 数fdbm_s_open()はこうなっています． -- static VALUE fdbm_s_open(argc, argv, class) int argc; VALUE *argv; VALUE class; { : if (rb_scan_args(argc, argv, "11", &file, &vmode) == 1) { mode = 0666; /* default value */ } : } -- このタイプの関数は第1引数が与えられた引数の数，第2引数が与え られた引数の入っている配列になります．selfは第3引数として与 えられます． この配列で与えられた引数を解析するための関数がopen()でも使わ れているrb_scan_args()です．第3引数に指定したフォーマットに 従い，第4変数以降に指定した変数に値を代入してくれます．この フォーマットは，第1文字目が省略できない引数の数，第2文字目が 省略できる引数の数，第3文字目が対応する相手が無いあまりの引 数があるかどうかを示す"*"です．2文字目と3文字目は省略できま す．dbm.cの例では，フォーマットは"11"ですから，引数は最低1つ で，2つまで許されるという意味になります．省略されている時の 変数の値はnil(C言語のレベルではQnil)になります． Rubyの配列で引数を受け取るものはindexesがあります．実装はこ うです． -- static VALUE fdbm_indexes(obj, args) VALUE obj; struct RArray *args; { : } -- 第1引数はself，第2引数はRubyの配列です．ここではキャストを減 らすため struct RArray* で受けていますが，VALUEでも同じこと です． ** 注意事項 Rubyと共有はしないがRubyのオブジェクトを格納する可能性のある Cの大域変数は以下の関数を使ってRubyインタプリタに変数の存在 を教えてあげてください．でないとGCでトラブルを起こします． void rb_global_variable(VALUE *var) (5) extconf.rbを用意する Makefileを作る場合の雛型になるextconf.rbというファイルを作り ます．extconf.rbはモジュールのコンパイルに必要な条件のチェッ クなどを行うことが目的です．extconf.rbの中では以下のRuby関数 を使うことが出来ます． have_library(lib, func): ライブラリの存在チェック have_func(func): 関数の存在チェック have_header(header): ヘッダファイルの存在チェック create_makefile(target): Makefileの生成 以下の変数を使うことができます． $CFLAGS: コンパイル時に追加的に指定するフラグ(-Iなど) $LDFLAGS: リンク時に追加的に指定するフラグ(-Lなど) モジュールをコンパイルする条件が揃わなず，そのモジュールはコ ンパイルしない時にはcreate_makefileを呼ばなければMakefileは 生成されず，コンパイルも行われません． モジュールがRuby 1.1専用である場合には require 'mkmf' をextconf.rbの先頭に置くと便利でしょう． (6) dependを用意する もし，ディレクトリにdependというファイルが存在すれば， Makefileが依存関係をチェックしてくれます． % gcc -MM *.c > depend などで作ることが出来ます．あって損は無いでしょう． (7) MANIFESTファイルにファイル名を入れる % ls > MANIFEST % vi MANIFEST *.o, *~など不必要なファイル以外はMANIFESTに追加しておきます． make時にはMANIFESTの内容は参照しませんので，空のままでも問題 は起きませんが，パッケージングの時に参照することがあるのと， 必要なファイルを区別できるので，用意しておいた方が良いでしょ う． (8) Makefileを生成する Makefileを実際に生成するためには ruby extconf.rb とします．extconf.rbに require 'mkmf' の行がない場合にはエラー になりますので，引数を追加して ruby -r mkmf extconf.rb としてください． ディレクトリをext以下に用意した場合にはRuby全体のmakeの時に 自動的にMakefileが生成されますので，このステップは不要です． (9) makeする 動的リンクライブラリを生成する場合にはその場でmakeしてくださ い．必要であれば make install でインストールされます． ext以下にディレクトリを用意した場合は，Rubyのディレクトリで makeを実行するとMakefileを生成からmake，必要によってはそのモ ジュールのRubyへのリンクまで自動的に実行してくれます． extconf.rbを書き換えるなどしてMakefileの再生成が必要な時はま たRubyディレクトリでmakeしてください． 動的リンクライブラリはmake installでRubyライブラリのディレク トリの下にコピーされます．もしモジュールと協調して使うRubyで 記述されたプログラムがあり，Rubyライブラリに置きたい場合には， 拡張モジュール用のディレクトリの下に lib というディレクトリ を作り，そこに 拡張子 .rb のファイルを置いておけば同時にイン ストールされます． (10) デバッグ まあ，デバッグしないと動かないでしょうね．ext/Setupにディレ クトリ名を書くと静的にリンクするのでデバッガが使えるようにな ります．その分コンパイルが遅くなりますけど． (11) できあがり 後はこっそり使うなり，広く公開するなり，売るなり，ご自由にお 使いください．Rubyの作者は拡張モジュールに関して一切の権利を 主張しません． Appendix A. Rubyのソースコードの分類 Rubyのソースはいくつかに分類することが出来ます．このうちクラ スライブラリの部分は基本的に拡張モジュールと同じ作り方になっ ています．これらのソースは今までの説明でほとんど理解できると 思います． Ruby言語のコア class.c error.c eval.c gc.c object.c parse.y variable.c ユーティリティ関数 dln.c fnmatch.c glob.c regex.c st.c util.c Rubyコマンドの実装 dmyext.c inits.c main.c ruby.c version.c クラスライブラリ array.c bignum.c compar.c dir.c enum.c file.c hash.c io.c marshal.c math.c numeric.c pack.c process.c random.c range.c re.c signal.c sprintf.c string.c struct.c time.c Appendix B. 拡張用関数リファレンス C言語からRubyの機能を利用するAPIは以下の通りである． ** 型 VALUE Rubyオブジェクトを表現する型．必要に応じてキャストして用いる． 組み込み型を表現するCの型はruby.hに記述してあるRで始まる構造 体である．VALUE型をこれらにキャストするためにRで始まる構造体 名を全て大文字にした名前のマクロが用意されている． ** 変数・定数 Qnil 定数: nilオブジェクト TRUE 定数: trueオブジェクト(真のデフォルト値) FALSE 定数: falseオブジェクト ** Cデータのカプセル化 Data_Wrap_Struct(VALUE class, void (*mark)(), void (*free)(), void *sval) Cの任意のポインタをカプセル化したRubyオブジェクトを返す．こ のポインタがRubyからアクセスされなくなった時，freeで指定した 関数が呼ばれる．また，このポインタの指すデータが他のRubyオブ ジェクトを指している場合，markに指定する関数でマークする必要 がある． Data_Make_Struct(class, type, mark, free, sval) type型のメモリをmallocし，変数svalに代入した後，それをカプセ ル化したデータを返すマクロ． Data_Get_Struct(data, type, sval) dataからtype型のポインタを取り出し変数svalに代入するマクロ． ** 型チェック TYPE(value) FIXNUM_P(value) NIL_P(value) void Check_Type(VALUE value, int type) void Check_SafeStr(VALUE value) ** 型変換 FIX2INT(value) INT2FIX(i) NUM2INT(value) INT2NUM(i) NUM2DBL(value) float_new(f) STR2CSTR(value) str_new2(s) ** クラス/モジュール定義 VALUE rb_define_class(char *name, VALUE super) superのサブクラスとして新しいRubyクラスを定義する． VALUE rb_define_class_under(VALUE module, char *name, VALUE super) superのサブクラスとして新しいRubyクラスを定義し，moduleの定 数として定義する． VALUE rb_define_module(char *name) 新しいRubyモジュールを定義する． VALUE rb_define_module_under(VALUE module, char *name, VALUE super) 新しいRubyモジュールを定義し，moduleの定数として定義する． void rb_include_module(VALUE class, VALUE module) モジュールをインクルードする．classがすでにmoduleをインクルー ドしている時には何もしない(多重インクルードの禁止)． void rb_extend_object(VALUE object, VALUE module) オブジェクトをモジュール(で定義されているメソッド)で拡張する． ** 大域変数定義 void rb_define_variable(char *name, VALUE *var) RubyとCとで共有するグローバル変数を定義する．変数名が`$'で始 まらない時には自動的に追加される．nameとしてRubyの識別子とし て許されない文字(例えば` ')を含む場合にはRubyプログラムから は見えなくなる． void rb_define_readonly_variable(char *name, VALUE *var) RubyとCとで共有するread onlyのグローバル変数を定義する．read onlyであること以外はrb_define_variable()と同じ． void rb_define_virtual_variable(char *name, VALUE (*getter)(), VALUE (*setter)()) 関数によって実現されるRuby変数を定義する．変数が参照された時 にはgetterが，変数に値がセットされた時にはsetterが呼ばれる． void rb_define_hooked_variable(char *name, VALUE *var, VALUE (*getter)(), VALUE (*setter)()) 関数によってhookのつけられたグローバル変数を定義する．変数が 参照された時にはgetterが，関数に値がセットされた時にはsetter が呼ばれる．getterやsetterに0を指定した時にはhookを指定しな いのと同じ事になる． void rb_global_variable(VALUE *var) GCのため，Rubyプログラムからはアクセスされないが, Rubyオブジェ クトを含む大域変数をマークする． ** クラス定数 void rb_define_const(VALUE class, char *name, VALUE val) クラス定数を定義する． void rb_define_global_const(char *name, VALUE val) 大域定数を定義する． rb_define_const(cKernal, name, val) と同じ意味． ** メソッド定義 rb_define_method(VALUE class, char *name, VALUE (*func)(), int argc) メソッドを定義する．argcはselfを除く引数の数．argcが-1の時, 関数には引数の数(selfを含まない)を第1引数, 引数の配列を第2引 数とする形式で与えられる(第3引数はself)．argcが-2の時, 第1引 数がself, 第2引数がargs(argsは引数を含むRubyの配列)という形 式で与えられる． rb_define_private_method(VALUE class, char *name, VALUE (*func)(), int argc) privateメソッドを定義する．引数はrb_define_method()と同じ． rb_define_singleton_method(VALUE class, char *name, VALUE (*func)(), int argc) 特異メソッドを定義する．引数はrb_define_method()と同じ． rb_scan_args(int atgc, VALUE *argv, char *fmt, ...) argc,argv形式で与えられた引数を分解する．fmtは必須引数の数, 付加引数の数, 残りの引数があるかを指定する文字列で, "数字数 字*"という形式である． 2 番目の数字と"*"はそれぞれ省略可能で ある．必須引数が一つもない場合は0を指定する．第3引数以降は変 数へのポインタで, 該当する要素がその変数に格納される．付加引 数に対応する引数が与えられていない場合は変数にQnilが代入され る． ** Rubyメソッド呼び出し VALUE rb_funcall(VALUE recv, ID mid, int narg, ...) メソッド呼び出し．文字列からmidを得るためにはrb_intern()を使う． VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv) メソッド呼び出し．引数をargc,argv形式で渡す． VALUE rb_eval_string(char *str) 文字列をRubyとスクリプトしてコンパイル・実行する． 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)(), void *arg1, VALUE (*func2)(), void *arg2) func2をブロックとして設定し, func1をイテレータとして呼ぶ． func1には arg1が引数として渡され, func2には第1引数にイテレー タから与えられた値, 第2引数にarg2が渡される． VALUE rb_yield(VALUE val) valを値としてイテレータブロックを呼び出す． VALUE rb_rescue(VALUE (*func1)(), void *arg1, VALUE (*func2)(), void *arg2) 関数func1をarg1を引数に呼び出す．func1の実行中に例外が発生し た時には func2をarg2を引数として呼ぶ．戻り値は例外が発生しな かった時はfunc1の戻り値, 例外が発生した時にはfunc2の戻り値で ある． VALUE rb_ensure(VALUE (*func1)(), void *arg1, void (*func2)(), void *arg2) 関数func1をarg1を引数として実行し, 実行終了後(たとえ例外が発 生しても) func2をarg2を引数として実行する．戻り値はfunc1の戻 り値である(例外が発生した時は戻らない)． ** 例外・エラー void Warning(char *fmt, ...) verbose時に標準エラー出力に警告情報を表示する．引数はprintf()と同じ． void Fail(char *fmt, ...) RuntimeError例外を発生させる．引数はprintf()と同じ． void Raise(VALUE exception, char *fmt, ...) exceptionで指定した例外を発生させる．fmt以下の引数はprintf()と同じ． void Fatal(char *fmt, ...) 致命的例外を発生させる．通常の例外処理は行なわれず, インター プリタが終了する(ただしensureで指定されたコードは終了前に実 行される)． void Bug(char *fmt, ...) インタープリタなどプログラムのバグでしか発生するはずのない状 況の時呼ぶ．インタープリタはコアダンプし直ちに終了する．例外 処理は一切行なわれない． ** Rubyの初期化・実行 Rubyをアプリケーションに埋め込む場合には以下のインタフェース を使う．通常の拡張モジュールには必要ない． void ruby_init(int argc, char **argv, char **envp) Rubyインタプリタの初期化を行なう． void ruby_run() Rubyインタプリタを実行する． void ruby_script(char *name) Rubyのスクリプト名($0)を設定する． Appendix B. extconf.rbで使える関数たち extconf.rbの中では利用可能なコンパイル条件チェックの関数は以 下の通りである． have_library(lib, func) 関数funcを定義しているライブラリlibの存在をチェックする．ラ イブラリが存在する時，TRUEを返す． have_func(func) 関数funcの存在をチェックする．funcが標準ではリンクされないラ イブラリ内のものである時には先にhave_libraryでそのライブラリ をチェックしておく事．関数が存在する時TRUEを返す． have_header(header) ヘッダファイルの存在をチェックする．ヘッダファイルが存在する 時TRUEを返す． create_makefile(target) 拡張モジュール用のMakefileを生成する．この関数を呼ばなければ そのモジュールはコンパイルされない．targetはモジュール名を表 す． /* * Local variables: * fill-column: 60 * end: */ ruby-1.2.3/ToDo100644 774 145 202 6546052717 11311 0ustar matzNaCl* remove Enumerable#reverse at 1.2 * non-blocking open/write for thread * package or access control for global variables * format ruby-1.2.3/array.c100644 774 145 64155 6657725620 12067 0ustar matzNaCl/************************************************ array.c - $Author: matz $ $Date: 1999/02/09 03:29:20 $ created at: Fri Aug 6 09:46:12 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" VALUE cArray; #define ARY_DEFAULT_SIZE 16 void memclear(mem, size) register VALUE *mem; register int size; { while (size--) { *mem++ = Qnil; } } static void memfill(mem, size, val) register VALUE *mem; register int size; register VALUE val; { while (size--) { *mem++ = val; } } #define ARY_FREEZE FL_USER1 static void ary_modify(ary) VALUE ary; { rb_secure(5); if (FL_TEST(ary, ARY_FREEZE)) { TypeError("can't modify frozen array"); } } VALUE ary_freeze(ary) VALUE ary; { FL_SET(ary, ARY_FREEZE); return ary; } static VALUE ary_frozen_p(ary) VALUE ary; { if (FL_TEST(ary, ARY_FREEZE)) return TRUE; return FALSE; } VALUE ary_new2(len) int len; { NEWOBJ(ary, struct RArray); OBJSETUP(ary, cArray, T_ARRAY); if (len < 0) { ArgError("negative array size (or size too big)"); } if (len > 0 && len*sizeof(VALUE) <= 0) { ArgError("array size too big"); } ary->len = 0; ary->capa = len; ary->ptr = 0; ary->ptr = ALLOC_N(VALUE, len); memclear(ary->ptr, len); return (VALUE)ary; } VALUE ary_new() { return ary_new2(ARY_DEFAULT_SIZE); } #ifdef HAVE_STDARG_PROTOTYPES #include #define va_init_list(a,b) va_start(a,b) #else #include #define va_init_list(a,b) va_start(a) #endif VALUE #ifdef HAVE_STDARG_PROTOTYPES ary_new3(int n, ...) #else ary_new3(n, va_alist) int n; va_dcl #endif { va_list ar; VALUE ary; int i; if (n < 0) { IndexError("Negative number of items(%d)", n); } ary = ary_new2(nptr[i] = va_arg(ar, VALUE); } va_end(ar); RARRAY(ary)->len = n; return ary; } VALUE ary_new4(n, elts) int n; VALUE *elts; { VALUE ary; ary = ary_new2(n); if (elts) { MEMCPY(RARRAY(ary)->ptr, elts, VALUE, n); } RARRAY(ary)->len = n; return ary; } VALUE assoc_new(car, cdr) VALUE car, cdr; { VALUE ary; ary = ary_new2(2); RARRAY(ary)->ptr[0] = car; RARRAY(ary)->ptr[1] = cdr; RARRAY(ary)->len = 2; return ary; } static VALUE ary_s_new(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { int len = 0; VALUE size, val; NEWOBJ(ary, struct RArray); OBJSETUP(ary, klass, T_ARRAY); ary->len = 0; ary->ptr = 0; if (rb_scan_args(argc, argv, "02", &size, &val) == 0) { ary->capa = ARY_DEFAULT_SIZE; } else { int capa = NUM2INT(size); if (capa < 0) { ArgError("negative array size"); } if (capa > 0 && capa*sizeof(VALUE) <= 0) { ArgError("array size too big"); } ary->capa = capa; len = capa; } ary->ptr = ALLOC_N(VALUE, ary->capa); memfill(ary->ptr, len, val); ary->len = len; obj_call_init((VALUE)ary); return (VALUE)ary; } static VALUE ary_s_create(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { NEWOBJ(ary, struct RArray); OBJSETUP(ary, klass, T_ARRAY); ary->len = argc; ary->capa = argc; if (argc == 0) { ary->ptr = 0; } else { ary->ptr = ALLOC_N(VALUE, argc); MEMCPY(ary->ptr, argv, VALUE, argc); } return (VALUE)ary; } void ary_store(ary, idx, val) VALUE ary; int idx; VALUE val; { ary_modify(ary); if (idx < 0) { IndexError("negative index for array"); } if (idx >= RARRAY(ary)->capa) { RARRAY(ary)->capa = idx + ARY_DEFAULT_SIZE; REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa); } if (idx > RARRAY(ary)->len) { memclear(RARRAY(ary)->ptr+RARRAY(ary)->len, idx-RARRAY(ary)->len+1); } if (idx >= RARRAY(ary)->len) { RARRAY(ary)->len = idx + 1; } RARRAY(ary)->ptr[idx] = val; } VALUE ary_push(ary, item) VALUE ary; VALUE item; { ary_store(ary, RARRAY(ary)->len, item); return ary; } static VALUE ary_push_method(argc, argv, ary) int argc; VALUE *argv; VALUE ary; { while (argc--) { ary_store(ary, RARRAY(ary)->len, *argv++); } return ary; } VALUE ary_pop(ary) VALUE ary; { if (RARRAY(ary)->len == 0) return Qnil; if (RARRAY(ary)->len * 10 < RARRAY(ary)->capa && RARRAY(ary)->capa > ARY_DEFAULT_SIZE) { RARRAY(ary)->capa = RARRAY(ary)->len * 2; REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa); } return RARRAY(ary)->ptr[--RARRAY(ary)->len]; } VALUE ary_shift(ary) VALUE ary; { VALUE top; if (RARRAY(ary)->len == 0) return Qnil; top = RARRAY(ary)->ptr[0]; RARRAY(ary)->len--; /* sliding items */ MEMMOVE(RARRAY(ary)->ptr, RARRAY(ary)->ptr+1, VALUE, RARRAY(ary)->len); if (RARRAY(ary)->len * 10 < RARRAY(ary)->capa && RARRAY(ary)->capa > ARY_DEFAULT_SIZE) { RARRAY(ary)->capa = RARRAY(ary)->len * 2; REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa); } return top; } VALUE ary_unshift(ary, item) VALUE ary, item; { ary_modify(ary); if (RARRAY(ary)->len >= RARRAY(ary)->capa) { RARRAY(ary)->capa+=ARY_DEFAULT_SIZE; REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa); } /* sliding items */ MEMMOVE(RARRAY(ary)->ptr+1, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len); RARRAY(ary)->len++; return RARRAY(ary)->ptr[0] = item; } VALUE ary_entry(ary, offset) VALUE ary; int offset; { if (RARRAY(ary)->len == 0) return Qnil; if (offset < 0) { offset = RARRAY(ary)->len + offset; } if (offset < 0 || RARRAY(ary)->len <= offset) { return Qnil; } return RARRAY(ary)->ptr[offset]; } static VALUE ary_subseq(ary, beg, len) VALUE ary; int beg, len; { VALUE ary2; if (beg < 0) { beg = RARRAY(ary)->len + beg; if (beg < 0) beg = 0; } if (len < 0) { IndexError("negative length %d", RARRAY(ary)->len); } if (len == 0) { return ary_new2(0); } if (beg + len > RARRAY(ary)->len) { len = RARRAY(ary)->len - beg; } if (len < 0) { len = 0; } ary2 = ary_new2(len); MEMCPY(RARRAY(ary2)->ptr, RARRAY(ary)->ptr+beg, VALUE, len); RARRAY(ary2)->len = len; return ary2; } static VALUE beg_len(range, begp, lenp, len) VALUE range; int *begp, *lenp; int len; { int beg, end; int b, e; if (!range_beg_end(range, &beg, &end)) return FALSE; b = beg; e = end; if (beg < 0) { beg = len + beg; if (beg < 0) beg = 0; } if (end < 0) { end = len + end; if (end < 0) end = -1; } if (beg > end) { IndexError("end smaller than beg [%d..%d]", b, e); } *begp = beg; *lenp = end - beg + 1; return TRUE; } VALUE ary_aref(argc, argv, ary) int argc; VALUE *argv; VALUE ary; { VALUE arg1, arg2; int beg, len; if (rb_scan_args(argc, argv, "11", &arg1, &arg2) == 2) { 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, FIX2INT(arg1)); } else if (TYPE(arg1) == T_BIGNUM) { IndexError("index too big"); } else if (beg_len(arg1, &beg, &len, RARRAY(ary)->len)) { /* check if idx is Range */ return ary_subseq(ary, beg, len); } return ary_entry(ary, NUM2INT(arg1)); } static VALUE ary_index(ary, val) VALUE ary; VALUE val; { int i; for (i=0; ilen; i++) { if (rb_equal(RARRAY(ary)->ptr[i], val)) return INT2FIX(i); } return Qnil; } static VALUE ary_rindex(ary, val) VALUE ary; VALUE val; { int i = RARRAY(ary)->len; while (i--) { if (rb_equal(RARRAY(ary)->ptr[i], val)) return INT2FIX(i); } return Qnil; } static VALUE ary_indexes(argc, argv, ary) int argc; VALUE *argv; VALUE ary; { VALUE new_ary; int i; new_ary = ary_new2(argc); for (i=0; ilen + beg; if (beg < 0) beg = 0; } if (beg >= RARRAY(ary)->len) { len = beg + RARRAY(rpl)->len; if (len >= RARRAY(ary)->capa) { RARRAY(ary)->capa=len; REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa); } memclear(RARRAY(ary)->ptr+RARRAY(ary)->len, beg-RARRAY(ary)->len); MEMCPY(RARRAY(ary)->ptr+beg, RARRAY(rpl)->ptr, VALUE, RARRAY(rpl)->len); RARRAY(ary)->len = len; } else { int alen; if (beg + len > RARRAY(ary)->len) { len = RARRAY(ary)->len - beg; } if (len < 0) { IndexError("negative length %d", RARRAY(ary)->len); } alen = RARRAY(ary)->len + RARRAY(rpl)->len - len; if (alen >= RARRAY(ary)->capa) { RARRAY(ary)->capa=alen; REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa); } if (len != RARRAY(rpl)->len) { MEMMOVE(RARRAY(ary)->ptr+beg+RARRAY(rpl)->len, RARRAY(ary)->ptr+beg+len, VALUE, RARRAY(ary)->len-(beg+len)); RARRAY(ary)->len = alen; } MEMCPY(RARRAY(ary)->ptr+beg, RARRAY(rpl)->ptr, VALUE, RARRAY(rpl)->len); } } static VALUE ary_aset(argc, argv, ary) int argc; VALUE *argv; VALUE ary; { VALUE arg1, arg2, arg3; int offset; int beg, len; if (rb_scan_args(argc, argv, "21", &arg1, &arg2, &arg3) == 3) { beg = NUM2INT(arg1); len = NUM2INT(arg2); ary_replace(ary, beg, len, arg3); return arg3; } else if (FIXNUM_P(arg1)) { offset = FIX2INT(arg1); goto fixnum; } else if (beg_len(arg1, &beg, &len, RARRAY(ary)->len)) { /* check if idx is Range */ ary_replace(ary, beg, len, arg2); return arg2; } if (TYPE(arg1) == T_BIGNUM) { IndexError("index too big"); } offset = NUM2INT(arg1); fixnum: if (offset < 0) { offset = RARRAY(ary)->len + offset; } ary_store(ary, offset, arg2); return arg2; } VALUE ary_each(ary) VALUE ary; { int i; for (i=0; ilen; i++) { rb_yield(RARRAY(ary)->ptr[i]); } return Qnil; } static VALUE ary_each_index(ary) VALUE ary; { int i; for (i=0; ilen; i++) { rb_yield(INT2FIX(i)); } return Qnil; } static VALUE ary_reverse_each(ary) VALUE ary; { int len = RARRAY(ary)->len; while (len--) { rb_yield(RARRAY(ary)->ptr[len]); } return Qnil; } static VALUE ary_length(ary) VALUE ary; { return INT2FIX(RARRAY(ary)->len); } static VALUE ary_empty_p(ary) VALUE ary; { if (RARRAY(ary)->len == 0) return TRUE; return FALSE; } static VALUE ary_clone(ary) VALUE ary; { VALUE ary2 = ary_new2(RARRAY(ary)->len); CLONESETUP(ary2, ary); MEMCPY(RARRAY(ary2)->ptr, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len); RARRAY(ary2)->len = RARRAY(ary)->len; return ary2; } static VALUE ary_dup(ary) VALUE ary; { return ary_new4(RARRAY(ary)->len, RARRAY(ary)->ptr); } static VALUE to_ary(ary) VALUE ary; { return rb_convert_type(ary, T_ARRAY, "Array", "to_ary"); } extern VALUE OFS; VALUE ary_join(ary, sep) VALUE ary; VALUE sep; { int i; VALUE result, tmp; if (RARRAY(ary)->len == 0) return str_new(0, 0); switch (TYPE(RARRAY(ary)->ptr[0])) { case T_STRING: result = str_dup(RARRAY(ary)->ptr[0]); break; case T_ARRAY: result = ary_join(RARRAY(ary)->ptr[0], sep); break; default: result = obj_as_string(RARRAY(ary)->ptr[0]); break; } for (i=1; ilen; i++) { tmp = RARRAY(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 (!NIL_P(sep)) str_concat(result, sep); str_cat(result, RSTRING(tmp)->ptr, RSTRING(tmp)->len); if (str_tainted(tmp)) str_taint(result); } return result; } static VALUE ary_join_method(argc, argv, ary) int argc; VALUE *argv; VALUE ary; { VALUE sep; rb_scan_args(argc, argv, "01", &sep); if (NIL_P(sep)) sep = OFS; return ary_join(ary, sep); } VALUE ary_to_s(ary) VALUE ary; { VALUE str = ary_join(ary, OFS); if (NIL_P(str)) return str_new(0, 0); return str; } static VALUE ary_inspect(ary) VALUE ary; { int i, len; VALUE s, str; if (RARRAY(ary)->len == 0) return str_new2("[]"); str = str_new2("["); len = 1; for (i=0; ilen; i++) { s = rb_inspect(RARRAY(ary)->ptr[i]); if (i > 0) str_cat(str, ", ", 2); str_cat(str, RSTRING(s)->ptr, RSTRING(s)->len); len += RSTRING(s)->len + 2; } str_cat(str, "]", 1); return str; } static VALUE ary_to_a(ary) VALUE ary; { return ary; } VALUE ary_reverse(ary) VALUE ary; { VALUE *p1, *p2; VALUE tmp; if (RARRAY(ary)->len == 0) return ary; p1 = RARRAY(ary)->ptr; p2 = p1 + RARRAY(ary)->len - 1; /* points last item */ while (p1 < p2) { tmp = *p1; *p1 = *p2; *p2 = tmp; p1++; p2--; } return ary; } static VALUE ary_reverse_method(ary) VALUE ary; { return ary_reverse(ary_dup(ary)); } 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; if (FIXNUM_P(*a)) { if (FIXNUM_P(*b)) return *a - *b; } else if (TYPE(*a) == T_STRING) { if (TYPE(*b) == T_STRING) return str_cmp(*a, *b); } retval = rb_funcall(*a, cmp, 1, *b); return NUM2INT(retval); } VALUE ary_sort_bang(ary) VALUE ary; { if (RARRAY(ary)->len == 0) return ary; ary_modify(ary); rb_qsort(RARRAY(ary)->ptr, RARRAY(ary)->len, sizeof(VALUE), iterator_p()?sort_1:sort_2); return ary; } VALUE ary_sort(ary) VALUE ary; { if (RARRAY(ary)->len == 0) return ary; return ary_sort_bang(ary_dup(ary)); } VALUE ary_delete(ary, item) VALUE ary; VALUE item; { int i1, i2; ary_modify(ary); for (i1 = i2 = 0; i1 < RARRAY(ary)->len; i1++) { if (rb_equal(RARRAY(ary)->ptr[i1], item)) continue; if (i1 != i2) { RARRAY(ary)->ptr[i2] = RARRAY(ary)->ptr[i1]; } i2++; } if (RARRAY(ary)->len == i2) { if (iterator_p()) { return rb_yield(item); } return Qnil; } else { RARRAY(ary)->len = i2; } return item; } VALUE ary_delete_at(ary, at) VALUE ary; VALUE at; { int i1, i2, pos; VALUE del = Qnil; ary_modify(ary); pos = NUM2INT(at); for (i1 = i2 = 0; i1 < RARRAY(ary)->len; i1++) { if (i1 == pos) { del = RARRAY(ary)->ptr[i1]; continue; } if (i1 != i2) { RARRAY(ary)->ptr[i2] = RARRAY(ary)->ptr[i1]; } i2++; } RARRAY(ary)->len = i2; return del; } static VALUE ary_delete_if(ary) VALUE ary; { int i1, i2; ary_modify(ary); for (i1 = i2 = 0; i1 < RARRAY(ary)->len; i1++) { if (RTEST(rb_yield(RARRAY(ary)->ptr[i1]))) continue; if (i1 != i2) { RARRAY(ary)->ptr[i2] = RARRAY(ary)->ptr[i1]; } i2++; } RARRAY(ary)->len = i2; return ary; } static VALUE ary_filter(ary) VALUE ary; { int i; ary_modify(ary); for (i = 0; i < RARRAY(ary)->len; i++) { RARRAY(ary)->ptr[i] = rb_yield(RARRAY(ary)->ptr[i]); } return ary; } static VALUE ary_replace_method(ary, ary2) VALUE ary, ary2; { ary2 = to_ary(ary2); ary_replace(ary, 0, RARRAY(ary2)->len, ary2); return ary; } static VALUE ary_clear(ary) VALUE ary; { RARRAY(ary)->len = 0; if (ARY_DEFAULT_SIZE*3 < RARRAY(ary)->capa) { RARRAY(ary)->capa = ARY_DEFAULT_SIZE * 2; REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa); } return ary; } static VALUE ary_fill(argc, argv, ary) int argc; VALUE *argv; VALUE ary; { VALUE item, arg1, arg2; int beg, len, end; VALUE *p, *pend; if (rb_scan_args(argc, argv, "12", &item, &arg1, &arg2) == 2 && beg_len(arg1, &beg, &len, RARRAY(ary)->len)) { /* beg and len set already */ } else { beg = NIL_P(arg1)?0:NUM2INT(arg1); if (beg < 0) { beg = RARRAY(ary)->len + beg; if (beg < 0) beg = 0; } len = NIL_P(arg2)?RARRAY(ary)->len - beg:NUM2INT(arg2); } end = beg + len; if (end > RARRAY(ary)->len) { if (end >= RARRAY(ary)->capa) { RARRAY(ary)->capa=end; REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa); } if (beg > RARRAY(ary)->len) { memclear(RARRAY(ary)->ptr+RARRAY(ary)->len,end-RARRAY(ary)->len); } RARRAY(ary)->len = end; } p = RARRAY(ary)->ptr + beg; pend = p + len; while (p < pend) { *p++ = item; } return ary; } VALUE ary_plus(x, y) VALUE x, y; { VALUE z; if (TYPE(y) != T_ARRAY) { return ary_plus(x, rb_Array(y)); } z = ary_new2(RARRAY(x)->len + RARRAY(y)->len); MEMCPY(RARRAY(z)->ptr, RARRAY(x)->ptr, VALUE, RARRAY(x)->len); MEMCPY(RARRAY(z)->ptr+RARRAY(x)->len, RARRAY(y)->ptr, VALUE, RARRAY(y)->len); RARRAY(z)->len = RARRAY(x)->len + RARRAY(y)->len; return z; } VALUE ary_concat(x, y) VALUE x, y; { VALUE *p, *pend; if (TYPE(y) != T_ARRAY) { return ary_concat(x, rb_Array(y)); } p = RARRAY(y)->ptr; pend = p + RARRAY(y)->len; while (p < pend) { ary_store(x, RARRAY(x)->len, *p); p++; } return x; } static VALUE ary_times(ary, times) VALUE ary; VALUE times; { VALUE ary2; int i, len; if (TYPE(times) == T_STRING) { return ary_join(ary, times); } len = NUM2INT(times); if (len < 0) { ArgError("negative argument"); } len *= RARRAY(ary)->len; ary2 = ary_new2(len); RARRAY(ary2)->len = len; for (i=0; ilen) { MEMCPY(RARRAY(ary2)->ptr+i, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len); } return ary2; } VALUE ary_assoc(ary, key) VALUE ary; VALUE key; { VALUE *p, *pend; p = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len; while (p < pend) { if (TYPE(*p) == T_ARRAY && RARRAY(*p)->len > 1 && rb_equal(RARRAY(*p)->ptr[0], key)) return *p; p++; } return Qnil; } VALUE ary_rassoc(ary, value) VALUE ary; VALUE value; { VALUE *p, *pend; p = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len; while (p < pend) { if (TYPE(*p) == T_ARRAY && RARRAY(*p)->len > 1 && rb_equal(RARRAY(*p)->ptr[1], value)) return *p; p++; } return Qnil; } static VALUE ary_equal(ary1, ary2) VALUE ary1, ary2; { int i; if (TYPE(ary2) != T_ARRAY) return FALSE; if (RARRAY(ary1)->len != RARRAY(ary2)->len) return FALSE; for (i=0; ilen; i++) { if (!rb_equal(RARRAY(ary1)->ptr[i], RARRAY(ary2)->ptr[i])) return FALSE; } return TRUE; } static VALUE ary_eql(ary1, ary2) VALUE ary1, ary2; { int i; if (TYPE(ary2) != T_ARRAY) return FALSE; if (RARRAY(ary1)->len != RARRAY(ary2)->len) return FALSE; for (i=0; ilen; i++) { if (!rb_eql(RARRAY(ary1)->ptr[i], RARRAY(ary2)->ptr[i])) return FALSE; } return TRUE; } static VALUE ary_hash(ary) VALUE ary; { int h, i; h = RARRAY(ary)->len; for (i=0; ilen; i++) { h ^= rb_hash(RARRAY(ary)->ptr[i]); } return INT2FIX(h); } VALUE ary_includes(ary, item) VALUE ary; VALUE item; { int i; for (i=0; ilen; i++) { if (rb_equal(RARRAY(ary)->ptr[i], item)) { return TRUE; } } return FALSE; } VALUE ary_cmp(ary, ary2) VALUE ary; VALUE ary2; { int i, len; ary2 = to_ary(ary2); len = RARRAY(ary)->len; if (len > RARRAY(ary2)->len) { len = RARRAY(ary2)->len; } for (i=0; iptr[i],cmp,1,RARRAY(ary2)->ptr[i]); if (v != INT2FIX(0)) { return v; } } len = RARRAY(ary)->len - RARRAY(ary2)->len; if (len == 0) return INT2FIX(0); if (len > 0) return INT2FIX(1); return INT2FIX(-1); } static VALUE ary_diff(ary1, ary2) VALUE ary1, ary2; { VALUE ary3; int i; ary2 = to_ary(ary2); ary3 = ary_new(); for (i=0; ilen; i++) { if (ary_includes(ary2, RARRAY(ary1)->ptr[i])) continue; if (ary_includes(ary3, RARRAY(ary1)->ptr[i])) continue; ary_push(ary3, RARRAY(ary1)->ptr[i]); } return ary3; } static VALUE ary_and(ary1, ary2) VALUE ary1, ary2; { VALUE ary3; int i; ary2 = to_ary(ary2); ary3 = ary_new(); for (i=0; ilen; i++) { if (ary_includes(ary2, RARRAY(ary1)->ptr[i]) && !ary_includes(ary3, RARRAY(ary1)->ptr[i])) { ary_push(ary3, RARRAY(ary1)->ptr[i]); } } return ary3; } static VALUE ary_or(ary1, ary2) VALUE ary1, ary2; { VALUE ary3; int i; if (TYPE(ary2) != T_ARRAY) { if (ary_includes(ary1, ary2)) return ary1; else return ary_plus(ary1, ary2); } ary3 = ary_new(); for (i=0; ilen; i++) { if (!ary_includes(ary3, RARRAY(ary1)->ptr[i])) ary_push(ary3, RARRAY(ary1)->ptr[i]); } for (i=0; ilen; i++) { if (!ary_includes(ary3, RARRAY(ary2)->ptr[i])) ary_push(ary3, RARRAY(ary2)->ptr[i]); } return ary3; } static VALUE ary_uniq_bang(ary) VALUE ary; { VALUE *p, *q, *t, *end; VALUE v; ary_modify(ary); p = RARRAY(ary)->ptr; end = p + RARRAY(ary)->len; while (p < end) { v = *p++; q = t = p; while (q < end) { if (rb_equal(*q, v)) q++; else *t++ = *q++; } end = t; } if (RARRAY(ary)->len == (end - RARRAY(ary)->ptr)) { return Qnil; } RARRAY(ary)->len = (end - RARRAY(ary)->ptr); return ary; } static VALUE ary_uniq(ary) VALUE ary; { VALUE v = ary_uniq_bang(ary_dup(ary)); if (NIL_P(v)) return ary; return v; } static VALUE ary_compact_bang(ary) VALUE ary; { VALUE *p, *t, *end; ary_modify(ary); p = t = RARRAY(ary)->ptr; end = p + RARRAY(ary)->len; while (t < end) { if (NIL_P(*t)) t++; else *p++ = *t++; } if (RARRAY(ary)->len == (p - RARRAY(ary)->ptr)) { return Qnil; } RARRAY(ary)->len = RARRAY(ary)->capa = (p - RARRAY(ary)->ptr); REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len); return ary; } static VALUE ary_compact(ary) VALUE ary; { VALUE v = ary_compact_bang(ary_dup(ary)); if (NIL_P(v)) return ary; return v; } static VALUE ary_nitems(ary) VALUE ary; { int n = 0; VALUE *p, *pend; p = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len; while (p < pend) { if (!NIL_P(*p)) n++; p++; } return INT2FIX(n); } static VALUE ary_flatten_bang(ary) VALUE ary; { int i; int mod = 0; ary_modify(ary); for (i=0; ilen; i++) { VALUE ary2 = RARRAY(ary)->ptr[i]; if (TYPE(ary2) == T_ARRAY) { ary_replace(ary, i--, 1, ary2); mod = 1; } } if (mod == 0) return Qnil; return ary; } static VALUE ary_flatten(ary) VALUE ary; { VALUE v = ary_flatten_bang(ary_dup(ary)); if (NIL_P(v)) return ary; return v; } void Init_Array() { cArray = rb_define_class("Array", cObject); rb_include_module(cArray, mEnumerable); rb_define_singleton_method(cArray, "new", ary_s_new, -1); rb_define_singleton_method(cArray, "[]", ary_s_create, -1); rb_define_method(cArray, "to_s", ary_to_s, 0); rb_define_method(cArray, "inspect", ary_inspect, 0); rb_define_method(cArray, "to_a", ary_to_a, 0); rb_define_method(cArray, "to_ary", ary_to_a, 0); rb_define_method(cArray, "freeze", ary_freeze, 0); rb_define_method(cArray, "frozen?", ary_frozen_p, 0); rb_define_method(cArray, "==", ary_equal, 1); rb_define_method(cArray, "eql?", ary_eql, 1); rb_define_method(cArray, "hash", ary_hash, 0); rb_define_method(cArray, "[]", ary_aref, -1); rb_define_method(cArray, "[]=", ary_aset, -1); rb_define_method(cArray, "concat", ary_concat, 1); rb_define_method(cArray, "<<", ary_push, 1); rb_define_method(cArray, "push", ary_push_method, -1); rb_define_method(cArray, "pop", ary_pop, 0); rb_define_method(cArray, "shift", ary_shift, 0); rb_define_method(cArray, "unshift", ary_unshift, 1); rb_define_method(cArray, "each", ary_each, 0); rb_define_method(cArray, "each_index", ary_each_index, 0); rb_define_method(cArray, "reverse_each", ary_reverse_each, 0); rb_define_method(cArray, "length", ary_length, 0); rb_define_alias(cArray, "size", "length"); rb_define_method(cArray, "empty?", ary_empty_p, 0); rb_define_method(cArray, "index", ary_index, 1); rb_define_method(cArray, "rindex", ary_rindex, 1); rb_define_method(cArray, "indexes", ary_indexes, -1); rb_define_method(cArray, "indices", ary_indexes, -1); rb_define_method(cArray, "clone", ary_clone, 0); rb_define_method(cArray, "dup", ary_dup, 0); rb_define_method(cArray, "join", ary_join_method, -1); rb_define_method(cArray, "reverse", ary_reverse_method, 0); rb_define_method(cArray, "reverse!", ary_reverse, 0); rb_define_method(cArray, "sort", ary_sort, 0); rb_define_method(cArray, "sort!", ary_sort_bang, 0); rb_define_method(cArray, "delete", ary_delete, 1); rb_define_method(cArray, "delete_at", ary_delete_at, 1); rb_define_method(cArray, "delete_if", ary_delete_if, 0); rb_define_method(cArray, "filter", ary_filter, 0); rb_define_method(cArray, "replace", ary_replace_method, 1); rb_define_method(cArray, "clear", ary_clear, 0); rb_define_method(cArray, "fill", ary_fill, -1); rb_define_method(cArray, "include?", ary_includes, 1); rb_define_method(cArray, "===", ary_includes, 1); rb_define_method(cArray, "<=>", ary_cmp, 1); rb_define_method(cArray, "assoc", ary_assoc, 1); rb_define_method(cArray, "rassoc", ary_rassoc, 1); rb_define_method(cArray, "+", ary_plus, 1); rb_define_method(cArray, "*", ary_times, 1); rb_define_method(cArray, "-", ary_diff, 1); rb_define_method(cArray, "&", ary_and, 1); rb_define_method(cArray, "|", ary_or, 1); rb_define_method(cArray, "uniq", ary_uniq, 0); rb_define_method(cArray, "uniq!", ary_uniq_bang, 0); rb_define_method(cArray, "compact", ary_compact, 0); rb_define_method(cArray, "compact!", ary_compact_bang, 0); rb_define_method(cArray, "flatten", ary_flatten, 0); rb_define_method(cArray, "flatten!", ary_flatten_bang, 0); rb_define_method(cArray, "nitems", ary_nitems, 0); cmp = rb_intern("<=>"); } ruby-1.2.3/bignum.c100644 774 145 57433 6657725620 12233 0ustar matzNaCl/************************************************ bignum.c - $Author: matz $ $Date: 1999/02/09 03:29:20 $ created at: Fri Jun 10 00:48:55 JST 1994 ************************************************/ #include "ruby.h" #include #include VALUE cBignum; typedef unsigned short USHORT; #define BDIGITS(x) RBIGNUM(x)->digits #define BITSPERDIG (sizeof(short)*CHAR_BIT) #define BIGRAD (1L << BITSPERDIG) #define DIGSPERINT ((unsigned int)(sizeof(long)/sizeof(short))) #define BIGUP(x) ((unsigned long)(x) << BITSPERDIG) #define BIGDN(x) (((x)<0) ? ~((~(x))>>BITSPERDIG) : (x)>>BITSPERDIG) #define BIGLO(x) ((x) & (BIGRAD-1)) static VALUE bignew_1(klass, len, sign) VALUE klass; unsigned int len; char sign; { NEWOBJ(big, struct RBignum); OBJSETUP(big, klass, T_BIGNUM); big->sign = sign; big->len = len; BDIGITS(big) = ALLOC_N(USHORT, len); return (VALUE)big; } #define bignew(len,sign) bignew_1(cBignum,len,sign) VALUE big_clone(x) VALUE x; { VALUE z = bignew_1(CLASS_OF(x), RBIGNUM(x)->len, RBIGNUM(x)->sign); MEMCPY(BDIGITS(z), BDIGITS(x), USHORT, RBIGNUM(x)->len); return z; } void big_2comp(x) /* get 2's complement */ VALUE x; { unsigned int i = RBIGNUM(x)->len; USHORT *ds = BDIGITS(x); long num; while (i--) ds[i] = ~ds[i]; i = 0; num = 1; do { num += ds[i]; ds[i++] = BIGLO(num); num = BIGDN(num); } while (i < RBIGNUM(x)->len); if (ds[0] == 1 || ds[0] == 0) { for (i=1;ilen;i++) { if (ds[i] != 0) return; } REALLOC_N(BDIGITS(x), USHORT, RBIGNUM(x)->len++); ds = BDIGITS(x); ds[RBIGNUM(x)->len-1] = 1; } } static VALUE bignorm(x) VALUE x; { unsigned int len = RBIGNUM(x)->len; USHORT *ds = BDIGITS(x); while (len-- && !ds[len]) ; RBIGNUM(x)->len = ++len; if (len*sizeof(USHORT) <= sizeof(VALUE)) { long num = 0; while (len--) { num = BIGUP(num) + ds[len]; } if (num >= 0) { if (RBIGNUM(x)->sign) { if (POSFIXABLE(num)) return INT2FIX(num); } else if (NEGFIXABLE(-num)) return INT2FIX(-num); } } return x; } VALUE big_norm(x) VALUE x; { return bignorm(RBIGNUM(x)); } VALUE uint2big(n) unsigned long n; { unsigned int i = 0; USHORT *digits; VALUE big; i = 0; big = bignew(DIGSPERINT, 1); digits = BDIGITS(big); while (i < DIGSPERINT) { digits[i++] = BIGLO(n); n = BIGDN(n); } i = DIGSPERINT; while (i-- && !digits[i]) ; RBIGNUM(big)->len = i+1; return big; } VALUE int2big(n) long n; { long neg = 0; VALUE big; if (n < 0) { n = -n; neg = 1; } big = uint2big(n); if (neg) { RBIGNUM(big)->sign = 0; } return big; } VALUE uint2inum(n) unsigned long n; { if (POSFIXABLE(n)) return INT2FIX(n); return uint2big(n); } VALUE int2inum(n) long 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; unsigned int len, blen = 1, i; VALUE z; USHORT *zds; while (ISSPACE(*str)) str++; if (*str == '+') { str++; } else 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; } } if (base == 8) { while (str[0] == '0') str++; len = 3*strlen(str)*sizeof(char); } else { /* base == 10 or 16 */ if (base == 16 && str[0] == '0' && (str[1] == 'x'||str[1] == 'X')) { str += 2; } while (str[0] == '0') str++; len = 4*strlen(str)*sizeof(char); } if (len <= (sizeof(VALUE)*CHAR_BIT)) { unsigned int val = strtoul((char*)str, 0, base); if (POSFIXABLE(val)) { if (sign) return INT2FIX(val); else { long result = -(long)val; return INT2FIX(result); } } else { VALUE big = uint2big(val); RBIGNUM(big)->sign = sign; return big; } } len = (len/BITSPERDIG)+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 (i == 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 { j = 0; hbase = 0; 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] = RBIGNUM(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 -= RBIGNUM(x)->sign?j:j-1; memmove(RBIGNUM(x)->sign?s:s+1, s+j, RSTRING(ss)->len); s[RSTRING(ss)->len] = '\0'; return ss; } static VALUE big_to_s(x) VALUE x; { return big2str(x, 10); } unsigned long big2ulong(x) VALUE x; { unsigned long num; unsigned int len = RBIGNUM(x)->len; USHORT *ds; if (len > sizeof(long)/sizeof(USHORT)) ArgError("bignum too big to convert into `uint'"); ds = BDIGITS(x); num = 0; while (len--) { num = BIGUP(num); num += ds[len]; } return num; } long big2long(x) VALUE x; { unsigned long num = big2ulong(x); if ((long)num < 0) { ArgError("bignum too big to convert into `int'"); } if (!RBIGNUM(x)->sign) return -num; return num; } VALUE big_to_i(x) VALUE x; { return bignorm(x); } VALUE dbl2big(d) double d; { unsigned int i = 0; long c; USHORT *digits; VALUE z; double u = (d < 0)?-d:d; while (!FIXABLE(u) || 0 != (long)u) { u /= (double)(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) VALUE x; { double d = 0.0; unsigned int i = RBIGNUM(x)->len; USHORT *ds = BDIGITS(x); while (i--) { d = ds[i] + BIGRAD*d; } if (!RBIGNUM(x)->sign) d = -d; return d; } VALUE big_to_f(x) VALUE x; { return float_new(big2dbl(x)); } static VALUE big_cmp(x, y) VALUE x, y; { int xlen = RBIGNUM(x)->len; switch (TYPE(y)) { case T_FIXNUM: y = int2big(FIX2LONG(y)); break; case T_BIGNUM: break; default: return num_coerce_bin(x, y); } if (RBIGNUM(x)->sign > RBIGNUM(y)->sign) return INT2FIX(1); if (RBIGNUM(x)->sign < RBIGNUM(y)->sign) return INT2FIX(-1); if (xlen < RBIGNUM(y)->len) return (RBIGNUM(x)->sign) ? INT2FIX(-1) : INT2FIX(1); if (xlen > RBIGNUM(y)->len) return (RBIGNUM(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]) ? (RBIGNUM(x)->sign ? INT2FIX(1) : INT2FIX(-1)) : (RBIGNUM(x)->sign ? INT2FIX(-1) : INT2FIX(1)); } static VALUE big_eq(x, y) VALUE x, y; { if (big_cmp(x, y) == INT2FIX(0)) return TRUE; return FALSE; } static VALUE big_uminus(x) VALUE x; { VALUE z = big_clone(x); RBIGNUM(z)->sign = !RBIGNUM(x)->sign; return bignorm(z); } static VALUE big_neg(x) VALUE x; { VALUE z = big_clone(x); unsigned int i = RBIGNUM(x)->len; USHORT *ds = BDIGITS(z); if (!RBIGNUM(x)->sign) big_2comp(z); while (i--) ds[i] = ~ds[i]; if (RBIGNUM(x)->sign) big_2comp(z); RBIGNUM(z)->sign = !RBIGNUM(z)->sign; return bignorm(z); } static VALUE bigsub(x, y) VALUE x, y; { VALUE z = 0; USHORT *zds; long num; unsigned int i; i = RBIGNUM(x)->len; /* if x is larger than y, swap */ if (RBIGNUM(x)->len < RBIGNUM(y)->len) { z = x; x = y; y = z; /* swap x y */ } else if (RBIGNUM(x)->len == RBIGNUM(y)->len) { while (i > 0) { i--; if (BDIGITS(x)[i] > BDIGITS(y)[i]) { break; } if (BDIGITS(x)[i] < BDIGITS(y)[i]) { z = x; x = y; y = z; /* swap x y */ break; } } } z = bignew(RBIGNUM(x)->len, (z == 0)?1:0); zds = BDIGITS(z); for (i = 0, num = 0; i < RBIGNUM(y)->len; i++) { num += (long)BDIGITS(x)[i] - BDIGITS(y)[i]; zds[i] = BIGLO(num); num = BIGDN(num); } while (num && i < RBIGNUM(x)->len) { num += BDIGITS(x)[i]; zds[i++] = BIGLO(num); num = BIGDN(num); } while (i < RBIGNUM(x)->len) { zds[i] = BDIGITS(x)[i]; i++; } return bignorm(z); } static VALUE bigadd(x, y, sign) VALUE x, y; char sign; { VALUE z; long num; unsigned int i, len; sign = (sign == RBIGNUM(y)->sign); if (RBIGNUM(x)->sign != sign) { if (sign) return bigsub(y, x); return bigsub(x, y); } if (RBIGNUM(x)->len > RBIGNUM(y)->len) { len = RBIGNUM(x)->len + 1; z = x; x = y; y = z; } else { len = RBIGNUM(y)->len + 1; } z = bignew(len, sign); len = RBIGNUM(x)->len; for (i = 0, num = 0; i < len; i++) { num += BDIGITS(x)[i] + BDIGITS(y)[i]; BDIGITS(z)[i] = BIGLO(num); num = BIGDN(num); } len = RBIGNUM(y)->len; while (num && i < len) { num += BDIGITS(y)[i]; BDIGITS(z)[i++] = BIGLO(num); num = BIGDN(num); } while (i < len) { BDIGITS(z)[i] = BDIGITS(y)[i]; i++; } BDIGITS(z)[i] = num; return bignorm(z); } VALUE big_plus(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: y = int2big(FIX2LONG(y)); /* fall through */ case T_BIGNUM: return bigadd(x, y, 1); case T_FLOAT: return float_new(big2dbl(x) + RFLOAT(y)->value); default: return num_coerce_bin(x, y); } } VALUE big_minus(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: y = int2big(FIX2LONG(y)); /* fall through */ case T_BIGNUM: return bigadd(x, y, 0); case T_FLOAT: return float_new(big2dbl(x) - RFLOAT(y)->value); default: return num_coerce_bin(x, y); } } VALUE big_mul(x, y) VALUE x, y; { unsigned int i = 0, j; unsigned long n = 0; VALUE z; USHORT *zds; if (FIXNUM_P(x)) x = int2big(FIX2LONG(x)); switch (TYPE(y)) { case T_FIXNUM: y = int2big(FIX2LONG(y)); break; case T_BIGNUM: break; case T_FLOAT: return float_new(big2dbl(x) * RFLOAT(y)->value); default: return num_coerce_bin(x, y); } j = RBIGNUM(x)->len + RBIGNUM(y)->len + 1; z = bignew(j, RBIGNUM(x)->sign==RBIGNUM(y)->sign); zds = BDIGITS(z); while (j--) zds[j] = 0; for (i = 0; i < RBIGNUM(x)->len; i++) { unsigned long dd = BDIGITS(x)[i]; if (dd == 0) continue; n = 0; for (j = 0; j < RBIGNUM(y)->len; j++) { int ee = n + dd * BDIGITS(y)[j]; n = zds[i + j] + ee; if (ee) zds[i + j] = BIGLO(n); n = BIGDN(n); } if (n) { zds[i + j] = n; } } return bignorm(z); } static void bigdivmod(x, y, div, mod, modulo) VALUE x, y; VALUE *div, *mod; int modulo; { unsigned int nx = RBIGNUM(x)->len, ny = RBIGNUM(y)->len, i, j; VALUE yy, z; USHORT *xds, *yds, *zds, *tds; unsigned long t2; long num; USHORT dd, q; yds = BDIGITS(y); if (ny == 0 && yds[0] == 0) num_zerodiv(); if (nx < ny || nx == ny && BDIGITS(x)[nx - 1] < BDIGITS(y)[ny - 1]) { 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 (!RBIGNUM(y)->sign) t2 = -t2; *mod = INT2FIX(t2); } return; } z = bignew(nx==ny?nx+2:nx+1, RBIGNUM(x)->sign==RBIGNUM(y)->sign); zds = BDIGITS(z); if (nx==ny) zds[nx+1] = 0; while (!yds[ny-1]) ny--; if ((dd = BIGRAD/(int)(yds[ny-1]+1)) != 1) { yy = big_clone(y); tds = BDIGITS(yy); 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 = RBIGNUM(x)->sign; if (modulo && RBIGNUM(x)->sign != RBIGNUM(y)->sign) { int len = ny; zds = BDIGITS(*mod); while (len-- && !zds[len]); if (len > 0) { *mod = bigadd(*mod, y, 1); return; } } *mod = bignorm(*mod); } } static VALUE big_div(x, y) VALUE x, y; { VALUE z; switch (TYPE(y)) { case T_FIXNUM: y = int2big(FIX2LONG(y)); break; case T_BIGNUM: break; case T_FLOAT: return float_new(big2dbl(x) / RFLOAT(y)->value); default: return num_coerce_bin(x, y); } bigdivmod(x, y, &z, 0, 0); return z; } static VALUE big_modulo(x, y, modulo) VALUE x, y; int modulo; { VALUE z; switch (TYPE(y)) { case T_FIXNUM: y = int2big(FIX2LONG(y)); break; case T_BIGNUM: break; case T_FLOAT: y = dbl2big(RFLOAT(y)->value); break; default: return num_coerce_bin(x, y); } bigdivmod(x, y, 0, &z, modulo); return z; } static VALUE big_mod(x, y) VALUE x, y; { return big_modulo(x, y, 1); } static VALUE big_remainder(x, y) VALUE x, y; { return big_modulo(x, y, 0); } static VALUE big_divmod(x, y) VALUE x, y; { VALUE div, mod; switch (TYPE(y)) { case T_FIXNUM: y = int2big(FIX2LONG(y)); break; case T_FLOAT: y = dbl2big(RFLOAT(y)->value); break; case T_BIGNUM: break; default: return num_coerce_bin(x, y); } bigdivmod(x, y, &div, &mod, 1); return assoc_new(div, mod);; } VALUE big_pow(x, y) VALUE x, y; { double d; long yy; if (y == INT2FIX(0)) return INT2FIX(1); switch (TYPE(y)) { case T_FLOAT: d = RFLOAT(y)->value; break; case T_BIGNUM: Warn("in a**b, b may be too big"); d = big2dbl(y); break; case T_FIXNUM: yy = NUM2LONG(y); if (yy > 0) { VALUE z; z = x; for (;;) { yy = yy - 1; if (yy == 0) break; while (yy % 2 == 0) { yy = yy / 2; x = big_mul(x, x); } z = big_mul(z, x); } return z; } d = (double)yy; break; default: return num_coerce_bin(x, y); } return float_new(pow(big2dbl(x), d)); } VALUE big_and(x, y) VALUE x, y; { VALUE z; USHORT *ds1, *ds2, *zds; unsigned int i, l1, l2; char sign; if (FIXNUM_P(y)) { y = int2big(FIX2LONG(y)); } else { Check_Type(y, T_BIGNUM); } if (!RBIGNUM(y)->sign) { y = big_clone(y); big_2comp(y); } if (!RBIGNUM(x)->sign) { x = big_clone(x); big_2comp(x); } if (RBIGNUM(x)->len > RBIGNUM(y)->len) { l1 = RBIGNUM(y)->len; l2 = RBIGNUM(x)->len; ds1 = BDIGITS(y); ds2 = BDIGITS(x); sign = RBIGNUM(y)->sign; } else { l1 = RBIGNUM(x)->len; l2 = RBIGNUM(y)->len; ds1 = BDIGITS(x); ds2 = BDIGITS(y); sign = RBIGNUM(x)->sign; } z = bignew(l2, RBIGNUM(x)->sign && RBIGNUM(y)->sign); zds = BDIGITS(z); for (i=0; isign) big_2comp(z); return bignorm(z); } VALUE big_or(x, y) VALUE x, y; { VALUE z; USHORT *ds1, *ds2, *zds; unsigned int i, l1, l2; char sign; if (FIXNUM_P(y)) { y = int2big(FIX2LONG(y)); } else { Check_Type(y, T_BIGNUM); } if (!RBIGNUM(y)->sign) { y = big_clone(y); big_2comp(y); } if (!RBIGNUM(x)->sign) { x = big_clone(x); big_2comp(x); } if (RBIGNUM(x)->len > RBIGNUM(y)->len) { l1 = RBIGNUM(y)->len; l2 = RBIGNUM(x)->len; ds1 = BDIGITS(y); ds2 = BDIGITS(x); sign = RBIGNUM(y)->sign; } else { l1 = RBIGNUM(x)->len; l2 = RBIGNUM(y)->len; ds1 = BDIGITS(x); ds2 = BDIGITS(y); sign = RBIGNUM(x)->sign; } z = bignew(l2, RBIGNUM(x)->sign || RBIGNUM(y)->sign); zds = BDIGITS(z); for (i=0; isign) big_2comp(z); return bignorm(z); } VALUE big_xor(x, y) VALUE x, y; { VALUE z; USHORT *ds1, *ds2, *zds; unsigned int i, l1, l2; char sign; if (FIXNUM_P(y)) { y = int2big(FIX2LONG(y)); } else { Check_Type(y, T_BIGNUM); } if (!RBIGNUM(y)->sign) { y = big_clone(y); big_2comp(y); } if (!RBIGNUM(x)->sign) { x = big_clone(x); big_2comp(x); } if (RBIGNUM(x)->len > RBIGNUM(y)->len) { l1 = RBIGNUM(y)->len; l2 = RBIGNUM(x)->len; ds1 = BDIGITS(y); ds2 = BDIGITS(x); sign = RBIGNUM(y)->sign; } else { l1 = RBIGNUM(x)->len; l2 = RBIGNUM(y)->len; ds1 = BDIGITS(x); ds2 = BDIGITS(y); sign = RBIGNUM(x)->sign; } RBIGNUM(x)->sign = RBIGNUM(x)->sign?1:0; RBIGNUM(y)->sign = RBIGNUM(y)->sign?1:0; z = bignew(l2, !(RBIGNUM(x)->sign ^ RBIGNUM(y)->sign)); zds = BDIGITS(z); for (i=0; isign) big_2comp(z); return bignorm(z); } static VALUE big_rshift _((VALUE,VALUE)); VALUE big_lshift(x, y) VALUE x, y; { USHORT *xds, *zds; int shift = NUM2INT(y); unsigned int s1 = shift/BITSPERDIG; unsigned int s2 = shift%BITSPERDIG; VALUE z; unsigned long num = 0; unsigned int len, i; if (shift < 0) return big_rshift(x, INT2FIX(-shift)); xds = BDIGITS(x); len = RBIGNUM(x)->len; z = bignew(len+s1+1, RBIGNUM(x)->sign); zds = BDIGITS(z); for (i=0; ilen; unsigned int j; if (shift < 0) return big_lshift(x, INT2FIX(-shift)); if (s1 > RBIGNUM(x)->len) { if (RBIGNUM(x)->sign) return INT2FIX(0); else return INT2FIX(-1); } xds = BDIGITS(x); i = RBIGNUM(x)->len; j = i - s1; z = bignew(j, RBIGNUM(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 big_aref(x, y) VALUE x, y; { USHORT *xds; int shift = NUM2INT(y); unsigned int s1, s2; if (shift < 0) return INT2FIX(0); s1 = shift/BITSPERDIG; s2 = shift%BITSPERDIG; if (!RBIGNUM(x)->sign) { if (s1 >= RBIGNUM(x)->len) return INT2FIX(1); x = big_clone(x); big_2comp(x); } else { if (s1 >= RBIGNUM(x)->len) return INT2FIX(0); } xds = BDIGITS(x); if (xds[s1] & (1<len; ilen; i++) { key ^= *digits++; } return INT2FIX(key); } static VALUE big_coerce(x, y) VALUE x, y; { if (FIXNUM_P(y)) { return assoc_new(int2big(FIX2LONG(y)), x); } else { TypeError("can't coerce %s to Bignum", rb_class2name(CLASS_OF(y))); } /* not reached */ } static VALUE big_abs(x) VALUE x; { if (!RBIGNUM(x)->sign) { x = big_clone(x); RBIGNUM(x)->sign = 1; } return x; } /* !!!warnig!!!! this is not really a random number!! */ VALUE big_rand(max) VALUE max; { struct RBignum *v; int len; len = RBIGNUM(max)->len; v = RBIGNUM(bignew(len,1)); while (len--) { #ifdef HAVE_RANDOM BDIGITS(v)[len] = random(); #else BDIGITS(v)[len] = rand(); #endif } return big_mod(v, max); } static VALUE big_size(big) VALUE big; { return INT2FIX(RBIGNUM(big)->len*sizeof(USHORT)); } static VALUE big_zero_p(big) VALUE big; { return FALSE; } void Init_Bignum() { cBignum = rb_define_class("Bignum", cInteger); rb_undef_method(CLASS_OF(cBignum), "new"); rb_define_method(cBignum, "to_s", big_to_s, 0); rb_define_method(cBignum, "coerce", big_coerce, 1); rb_define_method(cBignum, "-@", big_uminus, 0); rb_define_method(cBignum, "+", big_plus, 1); rb_define_method(cBignum, "-", big_minus, 1); rb_define_method(cBignum, "*", big_mul, 1); rb_define_method(cBignum, "/", big_div, 1); rb_define_method(cBignum, "%", big_mod, 1); rb_define_method(cBignum, "divmod", big_divmod, 1); rb_define_method(cBignum, "remainder", big_remainder, 1); rb_define_method(cBignum, "**", big_pow, 1); rb_define_method(cBignum, "&", big_and, 1); rb_define_method(cBignum, "|", big_or, 1); rb_define_method(cBignum, "^", big_xor, 1); rb_define_method(cBignum, "~", big_neg, 0); rb_define_method(cBignum, "<<", big_lshift, 1); rb_define_method(cBignum, ">>", big_rshift, 1); rb_define_method(cBignum, "[]", big_aref, 1); rb_define_method(cBignum, "<=>", big_cmp, 1); rb_define_method(cBignum, "==", big_eq, 1); rb_define_method(cBignum, "===", big_eq, 1); rb_define_method(cBignum, "eql?", big_eq, 1); rb_define_method(cBignum, "hash", big_hash, 0); rb_define_method(cBignum, "to_i", big_to_i, 0); rb_define_method(cBignum, "to_f", big_to_f, 0); rb_define_method(cBignum, "abs", big_abs, 0); rb_define_method(cBignum, "size", big_size, 0); rb_define_method(cBignum, "zero?", big_zero_p, 0); } ruby-1.2.3/class.c100644 774 145 27524 6534747216 12054 0ustar matzNaCl/************************************************ class.c - $Author: matz $ $Date: 1998/06/02 10:05:16 $ created at: Tue Aug 10 15:05:44 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "node.h" #include "st.h" #include #ifdef USE_CWGUSI #include #endif extern st_table *rb_class_tbl; VALUE class_new(super) VALUE super; { NEWOBJ(klass, struct RClass); OBJSETUP(klass, cClass, T_CLASS); klass->super = super; klass->iv_tbl = 0; klass->m_tbl = 0; /* safe GC */ klass->m_tbl = new_idhash(); return (VALUE)klass; } VALUE singleton_class_new(super) VALUE super; { VALUE klass = class_new(super); FL_SET(klass, FL_SINGLETON); return klass; } 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 singleton_class_clone(klass) VALUE klass; { if (!FL_TEST(klass, FL_SINGLETON)) return klass; else { /* copy singleton(unnamed) class */ NEWOBJ(clone, struct RClass); CLONESETUP(clone, klass); clone->super = RCLASS(klass)->super; clone->iv_tbl = 0; clone->m_tbl = 0; clone->m_tbl = new_idhash(); st_foreach(RCLASS(klass)->m_tbl, clone_method, clone->m_tbl); FL_SET(clone, FL_SINGLETON); return (VALUE)clone; } } void singleton_class_attached(klass, obj) VALUE klass, obj; { if (FL_TEST(klass, FL_SINGLETON)) rb_iv_set(klass, "__attached__", obj); } VALUE rb_define_class_id(id, super) ID id; VALUE super; { VALUE klass; if (!super) super = cObject; klass = class_new(super); rb_name_class(klass, id); /* make metaclass */ RBASIC(klass)->klass = singleton_class_new(RBASIC(super)->klass); singleton_class_attached(RBASIC(klass)->klass, klass); rb_funcall(super, rb_intern("inherited"), 1, klass); return klass; } VALUE rb_define_class(name, super) char *name; VALUE super; { VALUE klass; ID id; id = rb_intern(name); klass = rb_define_class_id(id, super); st_add_direct(rb_class_tbl, id, klass); return klass; } VALUE rb_define_class_under(outer, name, super) VALUE outer; char *name; VALUE super; { VALUE klass; ID id; id = rb_intern(name); klass = rb_define_class_id(id, super); rb_const_set(outer, id, klass); rb_set_class_path(klass, outer, name); return klass; } VALUE module_new() { NEWOBJ(mdl, struct RClass); OBJSETUP(mdl, cModule, T_MODULE); mdl->super = 0; mdl->iv_tbl = 0; mdl->m_tbl = 0; mdl->m_tbl = new_idhash(); return (VALUE)mdl; } VALUE rb_define_module_id(id) ID id; { extern st_table *rb_class_tbl; VALUE mdl = module_new(); rb_name_class(mdl, id); return mdl; } VALUE rb_define_module(name) char *name; { VALUE module; ID id; id = rb_intern(name); module = rb_define_module_id(id); st_add_direct(rb_class_tbl, id, module); return module; } VALUE rb_define_module_under(outer, name) VALUE outer; char *name; { VALUE module; ID id; id = rb_intern(name); module = rb_define_module_id(id); rb_const_set(outer, id, module); rb_set_class_path(module, outer, name); return module; } static VALUE include_class_new(module, super) VALUE module, super; { NEWOBJ(klass, struct RClass); OBJSETUP(klass, cClass, T_ICLASS); klass->m_tbl = RCLASS(module)->m_tbl; klass->iv_tbl = RCLASS(module)->iv_tbl; klass->super = super; if (TYPE(module) == T_ICLASS) { RBASIC(klass)->klass = RBASIC(module)->klass; } else { RBASIC(klass)->klass = module; } return (VALUE)klass; } void rb_include_module(klass, module) VALUE klass, module; { VALUE p; if (NIL_P(module)) return; if (klass == module) return; switch (TYPE(module)) { case T_MODULE: case T_CLASS: case T_ICLASS: break; default: Check_Type(module, T_MODULE); } while (module) { /* ignore if the module included already in superclasses */ for (p = RCLASS(klass)->super; p; p = RCLASS(p)->super) { if (BUILTIN_TYPE(p) == T_ICLASS && RCLASS(p)->m_tbl == RCLASS(module)->m_tbl) { if (RCLASS(module)->super) { rb_include_module(p, RCLASS(module)->super); } return; } } RCLASS(klass)->super = include_class_new(module, RCLASS(klass)->super); klass = RCLASS(klass)->super; module = RCLASS(module)->super; } rb_clear_cache(); } VALUE mod_included_modules(mod) VALUE mod; { VALUE ary = ary_new(); VALUE p; for (p = RCLASS(mod)->super; p; p = RCLASS(p)->super) { if (BUILTIN_TYPE(p) == T_ICLASS) { ary_push(ary, RBASIC(p)->klass); } } return ary; } VALUE mod_ancestors(mod) VALUE mod; { VALUE ary = ary_new(); VALUE p; for (p = mod; p; p = RCLASS(p)->super) { if (FL_TEST(p, FL_SINGLETON)) continue; if (BUILTIN_TYPE(p) == T_ICLASS) { ary_push(ary, RBASIC(p)->klass); } else { ary_push(ary, p); } } return ary; } static int ins_methods_i(key, body, ary) ID key; NODE *body; VALUE ary; { if ((body->nd_noex&(NOEX_PRIVATE|NOEX_PROTECTED)) == 0) { VALUE name = str_new2(rb_id2name(key)); if (!ary_includes(ary, name)) { if (!body->nd_body) { ary_push(ary, Qnil); } ary_push(ary, name); } } else if (body->nd_body && nd_type(body->nd_body) == NODE_ZSUPER) { ary_push(ary, Qnil); ary_push(ary, str_new2(rb_id2name(key))); } return ST_CONTINUE; } static int ins_methods_prot_i(key, body, ary) ID key; NODE *body; VALUE ary; { if (!body->nd_body) { ary_push(ary, Qnil); ary_push(ary, str_new2(rb_id2name(key))); } else if (body->nd_noex & NOEX_PROTECTED) { VALUE name = str_new2(rb_id2name(key)); if (!ary_includes(ary, name)) { ary_push(ary, name); } } else if (nd_type(body->nd_body) == NODE_ZSUPER) { ary_push(ary, Qnil); ary_push(ary, str_new2(rb_id2name(key))); } return ST_CONTINUE; } static int ins_methods_priv_i(key, body, ary) ID key; NODE *body; VALUE ary; { if (!body->nd_body) { ary_push(ary, Qnil); ary_push(ary, str_new2(rb_id2name(key))); } else if (body->nd_noex & NOEX_PRIVATE) { VALUE name = str_new2(rb_id2name(key)); if (!ary_includes(ary, name)) { ary_push(ary, name); } } else if (nd_type(body->nd_body) == NODE_ZSUPER) { ary_push(ary, Qnil); ary_push(ary, str_new2(rb_id2name(key))); } return ST_CONTINUE; } static VALUE method_list(mod, option, func) VALUE mod; int option; int (*func)(); { VALUE ary; VALUE klass; VALUE *p, *q, *pend; ary = ary_new(); for (klass = mod; klass; klass = RCLASS(klass)->super) { st_foreach(RCLASS(klass)->m_tbl, func, ary); if (!option) break; } p = q = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len; while (p < pend) { if (*p == Qnil) { p+=2; continue; } *q++ = *p++; } RARRAY(ary)->len = q - RARRAY(ary)->ptr; return ary; } VALUE class_instance_methods(argc, argv, mod) int argc; VALUE *argv; VALUE mod; { VALUE option; rb_scan_args(argc, argv, "01", &option); return method_list(mod, RTEST(option), ins_methods_i); } VALUE class_protected_instance_methods(argc, argv, mod) int argc; VALUE *argv; VALUE mod; { VALUE option; rb_scan_args(argc, argv, "01", &option); return method_list(mod, RTEST(option), ins_methods_prot_i); } VALUE class_private_instance_methods(argc, argv, mod) int argc; VALUE *argv; VALUE mod; { VALUE option; rb_scan_args(argc, argv, "01", &option); return method_list(mod, RTEST(option), ins_methods_priv_i); } VALUE obj_singleton_methods(obj) VALUE obj; { VALUE ary; VALUE klass; VALUE *p, *q, *pend; ary = ary_new(); klass = CLASS_OF(obj); while (klass && FL_TEST(klass, FL_SINGLETON)) { st_foreach(RCLASS(klass)->m_tbl, ins_methods_i, ary); klass = RCLASS(klass)->super; } p = q = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len; while (p < pend) { if (*p == Qnil) { p+=2; continue; } *q++ = *p++; } RARRAY(ary)->len = q - RARRAY(ary)->ptr; return ary; } void rb_define_method_id(klass, name, func, argc) VALUE klass; ID name; VALUE (*func)(); int argc; { rb_add_method(klass, name, NEW_CFUNC(func,argc), NOEX_PUBLIC|NOEX_CFUNC); } void rb_define_method(klass, name, func, argc) VALUE klass; char *name; VALUE (*func)(); int argc; { ID id = rb_intern(name); rb_add_method(klass, id, NEW_CFUNC(func, argc), ((name[0] == 'i' && id == rb_intern("initialize"))? NOEX_PRIVATE:NOEX_PUBLIC)|NOEX_CFUNC); } void rb_define_protected_method(klass, name, func, argc) VALUE klass; char *name; VALUE (*func)(); int argc; { rb_add_method(klass, rb_intern(name), NEW_CFUNC(func, argc), NOEX_PROTECTED|NOEX_CFUNC); } void rb_define_private_method(klass, name, func, argc) VALUE klass; char *name; VALUE (*func)(); int argc; { rb_add_method(klass, rb_intern(name), NEW_CFUNC(func, argc), NOEX_PRIVATE|NOEX_CFUNC); } void rb_undef_method(klass, name) VALUE klass; char *name; { rb_add_method(klass, rb_intern(name), 0, NOEX_UNDEF); } VALUE rb_singleton_class(obj) VALUE obj; { if (rb_special_const_p(obj)) { TypeError("cannot define singleton"); } if (FL_TEST(RBASIC(obj)->klass, FL_SINGLETON)) { return RBASIC(obj)->klass; } RBASIC(obj)->klass = singleton_class_new(RBASIC(obj)->klass); singleton_class_attached(RBASIC(obj)->klass, obj); return RBASIC(obj)->klass; } void rb_define_singleton_method(obj, name, func, argc) VALUE obj; char *name; VALUE (*func)(); int argc; { rb_define_method(rb_singleton_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_singleton_method(module, name, func, argc); } void rb_define_global_function(name, func, argc) char *name; VALUE (*func)(); int argc; { rb_define_private_method(mKernel, name, func, argc); } void rb_define_alias(klass, name1, name2) VALUE klass; char *name1, *name2; { rb_alias(klass, rb_intern(name1), rb_intern(name2)); } void rb_define_attr(klass, name, read, write) VALUE klass; char *name; int read, write; { rb_attr(klass, rb_intern(name), read, write, FALSE); } #ifdef HAVE_STDARG_PROTOTYPES #include #define va_init_list(a,b) va_start(a,b) #else #include #define va_init_list(a,b) va_start(a) #endif int #ifdef HAVE_STDARG_PROTOTYPES rb_scan_args(int argc, VALUE *argv, char *fmt, ...) #else rb_scan_args(argc, argv, fmt, va_alist) int argc; VALUE *argv; char *fmt; va_dcl #endif { int n, i; char *p = fmt; VALUE *var; va_list vargs; va_init_list(vargs, fmt); if (*p == '*') { var = va_arg(vargs, VALUE*); *var = ary_new4(argc, argv); return argc; } if (ISDIGIT(*p)) { n = *p - '0'; if (n > argc) ArgError("Wrong # 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) { ArgError("Wrong # of arguments(%d for %d)", argc, i); } } else { goto error; } va_end(vargs); return argc; error: Fatal("bad scan arg format: %s", fmt); return 0; } ruby-1.2.3/compar.c100644 774 145 3405 6550616364 12175 0ustar matzNaCl/************************************************ compar.c - $Author: matz $ $Date: 1998/07/08 07:16:54 $ created at: Thu Aug 26 14:39:48 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" VALUE mComparable; static ID cmp; static VALUE cmp_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 cmp_gt(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 cmp_ge(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 cmp_lt(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 cmp_le(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 cmp_between(x, min, max) VALUE x, min, max; { VALUE c = rb_funcall(x, cmp, 1, min); long t = NUM2LONG(c); if (t < 0) return FALSE; c = rb_funcall(x, cmp, 1, max); t = NUM2LONG(c); if (t > 0) return FALSE; return TRUE; } void Init_Comparable() { mComparable = rb_define_module("Comparable"); rb_define_method(mComparable, "==", cmp_eq, 1); rb_define_method(mComparable, ">", cmp_gt, 1); rb_define_method(mComparable, ">=", cmp_ge, 1); rb_define_method(mComparable, "<", cmp_lt, 1); rb_define_method(mComparable, "<=", cmp_le, 1); rb_define_method(mComparable, "between?", cmp_between, 2); cmp = rb_intern("<=>"); } ruby-1.2.3/configure100755 774 145 343214 6657721756 12536 0ustar matzNaCl#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated automatically using autoconf version 2.12 # Copyright (C) 1992, 93, 94, 95, 96 Free Software Foundation, Inc. # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. # Defaults: ac_help= ac_default_prefix=/usr/local # Any additions from configure.in: ac_help="$ac_help --without-gcc never use gcc" ac_help="$ac_help --disable-thread never use user-level thread" ac_help="$ac_help --enable-fat-binary build a NeXT/Apple Multi Architecture Binary. " ac_help="$ac_help --with-dln-a-out use dln_a_out if possible" ac_help="$ac_help --with-static-linked-ext link external modules statically" # Initialize some variables set by options. # The variables have the same names as the options, with # dashes changed to underlines. build=NONE cache_file=./config.cache exec_prefix=NONE host=NONE no_create= nonopt=NONE no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= target=NONE verbose= x_includes=NONE x_libraries=NONE bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datadir='${prefix}/share' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' libdir='${exec_prefix}/lib' includedir='${prefix}/include' oldincludedir='/usr/include' infodir='${prefix}/info' mandir='${prefix}/man' # Initialize some other variables. subdirs= MFLAGS= MAKEFLAGS= # Maximum number of lines to put in a shell here document. ac_max_here_lines=12 ac_prev= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval "$ac_prev=\$ac_option" ac_prev= continue fi case "$ac_option" in -*=*) ac_optarg=`echo "$ac_option" | sed 's/[-_a-zA-Z0-9]*=//'` ;; *) ac_optarg= ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case "$ac_option" in -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir="$ac_optarg" ;; -build | --build | --buil | --bui | --bu) ac_prev=build ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build="$ac_optarg" ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file="$ac_optarg" ;; -datadir | --datadir | --datadi | --datad | --data | --dat | --da) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=* | --data=* | --dat=* \ | --da=*) datadir="$ac_optarg" ;; -disable-* | --disable-*) ac_feature=`echo $ac_option|sed -e 's/-*disable-//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_feature| sed 's/[-a-zA-Z0-9_]//g'`"; then { echo "configure: error: $ac_feature: invalid feature name" 1>&2; exit 1; } fi ac_feature=`echo $ac_feature| sed 's/-/_/g'` eval "enable_${ac_feature}=no" ;; -enable-* | --enable-*) ac_feature=`echo $ac_option|sed -e 's/-*enable-//' -e 's/=.*//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_feature| sed 's/[-_a-zA-Z0-9]//g'`"; then { echo "configure: error: $ac_feature: invalid feature name" 1>&2; exit 1; } fi ac_feature=`echo $ac_feature| sed 's/-/_/g'` case "$ac_option" in *=*) ;; *) ac_optarg=yes ;; esac eval "enable_${ac_feature}='$ac_optarg'" ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix="$ac_optarg" ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he) # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat << EOF Usage: configure [options] [host] Options: [defaults in brackets after descriptions] Configuration: --cache-file=FILE cache test results in FILE --help print this message --no-create do not create output files --quiet, --silent do not print \`checking...' messages --version print the version of autoconf that created configure Directory and file names: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [same as prefix] --bindir=DIR user executables in DIR [EPREFIX/bin] --sbindir=DIR system admin executables in DIR [EPREFIX/sbin] --libexecdir=DIR program executables in DIR [EPREFIX/libexec] --datadir=DIR read-only architecture-independent data in DIR [PREFIX/share] --sysconfdir=DIR read-only single-machine data in DIR [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data in DIR [PREFIX/com] --localstatedir=DIR modifiable single-machine data in DIR [PREFIX/var] --libdir=DIR object code libraries in DIR [EPREFIX/lib] --includedir=DIR C header files in DIR [PREFIX/include] --oldincludedir=DIR C header files for non-gcc in DIR [/usr/include] --infodir=DIR info documentation in DIR [PREFIX/info] --mandir=DIR man documentation in DIR [PREFIX/man] --srcdir=DIR find the sources in DIR [configure dir or ..] --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names EOF cat << EOF Host type: --build=BUILD configure for building on BUILD [BUILD=HOST] --host=HOST configure for HOST [guessed] --target=TARGET configure for TARGET [TARGET=HOST] Features and packages: --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --x-includes=DIR X include files are in DIR --x-libraries=DIR X library files are in DIR EOF if test -n "$ac_help"; then echo "--enable and --with options recognized:$ac_help" fi exit 0 ;; -host | --host | --hos | --ho) ac_prev=host ;; -host=* | --host=* | --hos=* | --ho=*) host="$ac_optarg" ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir="$ac_optarg" ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir="$ac_optarg" ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir="$ac_optarg" ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir="$ac_optarg" ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst \ | --locals | --local | --loca | --loc | --lo) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* \ | --locals=* | --local=* | --loca=* | --loc=* | --lo=*) localstatedir="$ac_optarg" ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir="$ac_optarg" ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir="$ac_optarg" ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix="$ac_optarg" ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix="$ac_optarg" ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix="$ac_optarg" ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name="$ac_optarg" ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir="$ac_optarg" ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir="$ac_optarg" ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site="$ac_optarg" ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir="$ac_optarg" ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir="$ac_optarg" ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target="$ac_optarg" ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers) echo "configure generated by autoconf version 2.12" exit 0 ;; -with-* | --with-*) ac_package=`echo $ac_option|sed -e 's/-*with-//' -e 's/=.*//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_package| sed 's/[-_a-zA-Z0-9]//g'`"; then { echo "configure: error: $ac_package: invalid package name" 1>&2; exit 1; } fi ac_package=`echo $ac_package| sed 's/-/_/g'` case "$ac_option" in *=*) ;; *) ac_optarg=yes ;; esac eval "with_${ac_package}='$ac_optarg'" ;; -without-* | --without-*) ac_package=`echo $ac_option|sed -e 's/-*without-//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_package| sed 's/[-a-zA-Z0-9_]//g'`"; then { echo "configure: error: $ac_package: invalid package name" 1>&2; exit 1; } fi ac_package=`echo $ac_package| sed 's/-/_/g'` eval "with_${ac_package}=no" ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes="$ac_optarg" ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries="$ac_optarg" ;; -*) { echo "configure: error: $ac_option: invalid option; use --help to show usage" 1>&2; exit 1; } ;; *) if test -n "`echo $ac_option| sed 's/[-a-z0-9.]//g'`"; then echo "configure: warning: $ac_option: invalid host type" 1>&2 fi if test "x$nonopt" != xNONE; then { echo "configure: error: can only configure for one host and one target at a time" 1>&2; exit 1; } fi nonopt="$ac_option" ;; esac done if test -n "$ac_prev"; then { echo "configure: error: missing argument to --`echo $ac_prev | sed 's/_/-/g'`" 1>&2; exit 1; } fi trap 'rm -fr conftest* confdefs* core core.* *.core $ac_clean_files; exit 1' 1 2 15 # File descriptor usage: # 0 standard input # 1 file creation # 2 errors and warnings # 3 some systems may open it to /dev/tty # 4 used on the Kubota Titan # 6 checking for... messages and results # 5 compiler messages saved in config.log if test "$silent" = yes; then exec 6>/dev/null else exec 6>&1 fi exec 5>./config.log echo "\ This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. " 1>&5 # Strip out --no-create and --no-recursion so they do not pile up. # Also quote any args containing shell metacharacters. ac_configure_args= for ac_arg do case "$ac_arg" in -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c) ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) ;; *" "*|*" "*|*[\[\]\~\#\$\^\&\*\(\)\{\}\\\|\;\<\>\?]*) ac_configure_args="$ac_configure_args '$ac_arg'" ;; *) ac_configure_args="$ac_configure_args $ac_arg" ;; esac done # NLS nuisances. # Only set these to C if already set. These must not be set unconditionally # because not all systems understand e.g. LANG=C (notably SCO). # Fixing LC_MESSAGES prevents Solaris sh from translating var values in `set'! # Non-C LC_CTYPE values break the ctype check. if test "${LANG+set}" = set; then LANG=C; export LANG; fi if test "${LC_ALL+set}" = set; then LC_ALL=C; export LC_ALL; fi if test "${LC_MESSAGES+set}" = set; then LC_MESSAGES=C; export LC_MESSAGES; fi if test "${LC_CTYPE+set}" = set; then LC_CTYPE=C; export LC_CTYPE; fi # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -rf conftest* confdefs.h # AIX cpp loses on an empty file, so make sure it contains at least a newline. echo > confdefs.h # 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. ac_unique_file=ruby.h # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then its parent. ac_prog=$0 ac_confdir=`echo $ac_prog|sed 's%/[^/][^/]*$%%'` test "x$ac_confdir" = "x$ac_prog" && ac_confdir=. srcdir=$ac_confdir if test ! -r $srcdir/$ac_unique_file; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r $srcdir/$ac_unique_file; then if test "$ac_srcdir_defaulted" = yes; then { echo "configure: error: can not find sources in $ac_confdir or .." 1>&2; exit 1; } else { echo "configure: error: can not find sources in $srcdir" 1>&2; exit 1; } fi fi srcdir=`echo "${srcdir}" | sed 's%\([^/]\)/*$%\1%'` # Prefer explicitly selected file to automatically selected ones. if test -z "$CONFIG_SITE"; then if test "x$prefix" != xNONE; then CONFIG_SITE="$prefix/share/config.site $prefix/etc/config.site" else CONFIG_SITE="$ac_default_prefix/share/config.site $ac_default_prefix/etc/config.site" fi fi for ac_site_file in $CONFIG_SITE; do if test -r "$ac_site_file"; then echo "loading site script $ac_site_file" . "$ac_site_file" fi done if test -r "$cache_file"; then echo "loading cache $cache_file" . $cache_file else echo "creating cache $cache_file" > $cache_file fi ac_ext=c # CFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. ac_cpp='$CPP $CPPFLAGS' ac_compile='${CC-cc} -c $CFLAGS $CPPFLAGS conftest.$ac_ext 1>&5' ac_link='${CC-cc} -o conftest $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS 1>&5' cross_compiling=$ac_cv_prog_cc_cross if (echo "testing\c"; echo 1,2,3) | grep c >/dev/null; then # Stardent Vistra SVR4 grep lacks -e, says ghazi@caip.rutgers.edu. if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then ac_n= ac_c=' ' ac_t=' ' else ac_n=-n ac_c= ac_t= fi else ac_n= ac_c='\c' ac_t= fi # Check whether --with-gcc or --without-gcc was given. if test "${with_gcc+set}" = set; then withval="$with_gcc" case $withval in no) CC=cc without_gcc=yes;; yes) CC=gcc without_gcc=no;; *) CC=$withval without_gcc=$withval;; esac else without_gcc=no fi if test ! -z "$ac_cv_prog_CC" -a ! -z "$CC" -a "$CC" != "$ac_cv_prog_CC" then { echo "configure: error: cached CC is different -- throw away $cache_file (it is also a good idea to do 'make clean' before compiling)" 1>&2; exit 1; } fi rb_thread=yes # Check whether --enable-thread or --disable-thread was given. if test "${enable_thread+set}" = set; then enableval="$enable_thread" rb_thread=$enableval fi if test $rb_thread = yes; then cat >> confdefs.h <<\EOF #define THREAD 1 EOF fi ac_aux_dir= for ac_dir in $srcdir $srcdir/.. $srcdir/../..; do if test -f $ac_dir/install-sh; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f $ac_dir/install.sh; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break fi done if test -z "$ac_aux_dir"; then { echo "configure: error: can not find install-sh or install.sh in $srcdir $srcdir/.. $srcdir/../.." 1>&2; exit 1; } fi ac_config_guess=$ac_aux_dir/config.guess ac_config_sub=$ac_aux_dir/config.sub ac_configure=$ac_aux_dir/configure # This should be Cygnus configure. # Make sure we can run config.sub. if $ac_config_sub sun4 >/dev/null 2>&1; then : else { echo "configure: error: can not run $ac_config_sub" 1>&2; exit 1; } fi echo $ac_n "checking host system type""... $ac_c" 1>&6 echo "configure:597: checking host system type" >&5 host_alias=$host case "$host_alias" in NONE) case $nonopt in NONE) if host_alias=`$ac_config_guess`; then : else { echo "configure: error: can not guess host type; you must specify one" 1>&2; exit 1; } fi ;; *) host_alias=$nonopt ;; esac ;; esac host=`$ac_config_sub $host_alias` host_cpu=`echo $host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'` host_vendor=`echo $host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'` host_os=`echo $host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'` echo "$ac_t""$host" 1>&6 fat_binary=no # Check whether --enable-fat-binary or --disable-fat-binary was given. if test "${enable_fat_binary+set}" = set; then enableval="$enable_fat_binary" fat_binary=$enableval fi if test "$fat_binary" = yes ; then echo $ac_n "checking target architecture ""... $ac_c" 1>&6 echo "configure:628: checking target architecture " >&5 case "$host_os" in rhapsody*) echo -n "MacOS X Server: " if test "$TARGET_ARCHS" = "" ; then TARGET_ARCHS="ppc i386" fi ;; nextstep*|openstep*) echo -n "NeXTSTEP/OPENSTEP: " if test "$host_os" = "rhapsody" ; then echo -n "Rhapsody: " if test "$TARGET_ARCHS" = "" ; then TARGET_ARCHS="ppc i486" fi else echo -n "NeXTSTEP/OPENSTEP: " if test "$TARGET_ARCHS" = "" ; then if test `/usr/bin/arch` = "m68k" ; then TARGET_ARCHS="m68k i486" else # Black and Native one TARGET_ARCHS="m68k `/usr/bin/arch`" fi fi fi ;; esac # /usr/lib/arch_tool -archify_list $TARGET_ARCHS for archs in $TARGET_ARCHS do ARCH_FLAG="$ARCH_FLAG -arch $archs " echo -n " $archs" done cat >> confdefs.h <<\EOF #define NEXT_FAT_BINARY 1 EOF echo "." fi if test "$program_transform_name" = s,x,x,; then program_transform_name= else # Double any \ or $. echo might interpret backslashes. cat <<\EOF_SED > conftestsed s,\\,\\\\,g; s,\$,$$,g EOF_SED program_transform_name="`echo $program_transform_name|sed -f conftestsed`" rm -f conftestsed fi test "$program_prefix" != NONE && program_transform_name="s,^,${program_prefix},; $program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s,\$\$,${program_suffix},; $program_transform_name" # sed with no file args requires a program. test "$program_transform_name" = "" && program_transform_name="s,x,x," # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 echo "configure:693: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_CC'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_CC="gcc" break fi done IFS="$ac_save_ifs" fi fi CC="$ac_cv_prog_CC" if test -n "$CC"; then echo "$ac_t""$CC" 1>&6 else echo "$ac_t""no" 1>&6 fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 echo "configure:722: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_CC'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" ac_prog_rejected=no for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then if test "$ac_dir/$ac_word" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" break fi done IFS="$ac_save_ifs" if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# -gt 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift set dummy "$ac_dir/$ac_word" "$@" shift ac_cv_prog_CC="$@" fi fi fi fi CC="$ac_cv_prog_CC" if test -n "$CC"; then echo "$ac_t""$CC" 1>&6 else echo "$ac_t""no" 1>&6 fi test -z "$CC" && { echo "configure: error: no acceptable cc found in \$PATH" 1>&2; exit 1; } fi echo $ac_n "checking whether the C compiler ($CC $CFLAGS $LDFLAGS) works""... $ac_c" 1>&6 echo "configure:770: checking whether the C compiler ($CC $CFLAGS $LDFLAGS) works" >&5 ac_ext=c # CFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. ac_cpp='$CPP $CPPFLAGS' ac_compile='${CC-cc} -c $CFLAGS $CPPFLAGS conftest.$ac_ext 1>&5' ac_link='${CC-cc} -o conftest $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS 1>&5' cross_compiling=$ac_cv_prog_cc_cross cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then ac_cv_prog_cc_works=yes # If we can't run a trivial program, we are probably using a cross compiler. if (./conftest; exit) 2>/dev/null; then ac_cv_prog_cc_cross=no else ac_cv_prog_cc_cross=yes fi else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 ac_cv_prog_cc_works=no fi rm -fr conftest* echo "$ac_t""$ac_cv_prog_cc_works" 1>&6 if test $ac_cv_prog_cc_works = no; then { echo "configure: error: installation or configuration problem: C compiler cannot create executables." 1>&2; exit 1; } fi echo $ac_n "checking whether the C compiler ($CC $CFLAGS $LDFLAGS) is a cross-compiler""... $ac_c" 1>&6 echo "configure:804: checking whether the C compiler ($CC $CFLAGS $LDFLAGS) is a cross-compiler" >&5 echo "$ac_t""$ac_cv_prog_cc_cross" 1>&6 cross_compiling=$ac_cv_prog_cc_cross echo $ac_n "checking whether we are using GNU C""... $ac_c" 1>&6 echo "configure:809: checking whether we are using GNU C" >&5 if eval "test \"`echo '$''{'ac_cv_prog_gcc'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.c <&5; (eval $ac_try) 2>&5; }; } | egrep yes >/dev/null 2>&1; then ac_cv_prog_gcc=yes else ac_cv_prog_gcc=no fi fi echo "$ac_t""$ac_cv_prog_gcc" 1>&6 if test $ac_cv_prog_gcc = yes; then GCC=yes ac_test_CFLAGS="${CFLAGS+set}" ac_save_CFLAGS="$CFLAGS" CFLAGS= echo $ac_n "checking whether ${CC-cc} accepts -g""... $ac_c" 1>&6 echo "configure:833: checking whether ${CC-cc} accepts -g" >&5 if eval "test \"`echo '$''{'ac_cv_prog_cc_g'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else echo 'void f(){}' > conftest.c if test -z "`${CC-cc} -g -c conftest.c 2>&1`"; then ac_cv_prog_cc_g=yes else ac_cv_prog_cc_g=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_prog_cc_g" 1>&6 if test "$ac_test_CFLAGS" = set; then CFLAGS="$ac_save_CFLAGS" elif test $ac_cv_prog_cc_g = yes; then CFLAGS="-g -O2" else CFLAGS="-O2" fi else GCC= test "${CFLAGS+set}" = set || CFLAGS="-g" fi echo $ac_n "checking how to run the C preprocessor""... $ac_c" 1>&6 echo "configure:861: checking how to run the C preprocessor" >&5 # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if eval "test \"`echo '$''{'ac_cv_prog_CPP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else # This must be in double quotes, not single quotes, because CPP may get # substituted into the Makefile and "${CC-cc}" will confuse make. CPP="${CC-cc} -E" # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. cat > conftest.$ac_ext < Syntax Error EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" { (eval echo configure:882: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then : else echo "$ac_err" >&5 echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* CPP="${CC-cc} -E -traditional-cpp" cat > conftest.$ac_ext < Syntax Error EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" { (eval echo configure:899: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then : else echo "$ac_err" >&5 echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* CPP=/lib/cpp fi rm -f conftest* fi rm -f conftest* ac_cv_prog_CPP="$CPP" fi CPP="$ac_cv_prog_CPP" else ac_cv_prog_CPP="$CPP" fi echo "$ac_t""$CPP" 1>&6 if test $ac_cv_prog_gcc = yes; then echo $ac_n "checking whether ${CC-cc} needs -traditional""... $ac_c" 1>&6 echo "configure:923: checking whether ${CC-cc} needs -traditional" >&5 if eval "test \"`echo '$''{'ac_cv_prog_gcc_traditional'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_pattern="Autoconf.*'x'" cat > conftest.$ac_ext < Autoconf TIOCGETP EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "$ac_pattern" >/dev/null 2>&1; then rm -rf conftest* ac_cv_prog_gcc_traditional=yes else rm -rf conftest* ac_cv_prog_gcc_traditional=no fi rm -f conftest* if test $ac_cv_prog_gcc_traditional = no; then cat > conftest.$ac_ext < Autoconf TCGETA EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "$ac_pattern" >/dev/null 2>&1; then rm -rf conftest* ac_cv_prog_gcc_traditional=yes fi rm -f conftest* fi fi echo "$ac_t""$ac_cv_prog_gcc_traditional" 1>&6 if test $ac_cv_prog_gcc_traditional = yes; then CC="$CC -traditional" fi fi for ac_prog in 'bison -y' byacc do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 echo "configure:973: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_YACC'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test -n "$YACC"; then ac_cv_prog_YACC="$YACC" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_YACC="$ac_prog" break fi done IFS="$ac_save_ifs" fi fi YACC="$ac_cv_prog_YACC" if test -n "$YACC"; then echo "$ac_t""$YACC" 1>&6 else echo "$ac_t""no" 1>&6 fi test -n "$YACC" && break done test -n "$YACC" || YACC="yacc" # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 echo "configure:1005: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_RANLIB'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_RANLIB="ranlib" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_prog_RANLIB" && ac_cv_prog_RANLIB=":" fi fi RANLIB="$ac_cv_prog_RANLIB" if test -n "$RANLIB"; then echo "$ac_t""$RANLIB" 1>&6 else echo "$ac_t""no" 1>&6 fi for ac_prog in ar aal do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&6 echo "configure:1037: checking for $ac_word" >&5 if eval "test \"`echo '$''{'ac_cv_prog_AR'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_AR="$ac_prog" break fi done IFS="$ac_save_ifs" fi fi AR="$ac_cv_prog_AR" if test -n "$AR"; then echo "$ac_t""$AR" 1>&6 else echo "$ac_t""no" 1>&6 fi test -n "$AR" && break done test -n "$AR" || AR="ar" # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # ./install, which can be erroneously created by make from ./install.sh. echo $ac_n "checking for a BSD compatible install""... $ac_c" 1>&6 echo "configure:1077: checking for a BSD compatible install" >&5 if test -z "$INSTALL"; then if eval "test \"`echo '$''{'ac_cv_path_install'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else IFS="${IFS= }"; ac_save_IFS="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do # Account for people who put trailing slashes in PATH elements. case "$ac_dir/" in /|./|.//|/etc/*|/usr/sbin/*|/usr/etc/*|/sbin/*|/usr/afsws/bin/*|/usr/ucb/*) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. for ac_prog in ginstall installbsd scoinst install; do if test -f $ac_dir/$ac_prog; then if test $ac_prog = install && grep dspmsg $ac_dir/$ac_prog >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. # OSF/1 installbsd also uses dspmsg, but is usable. : else ac_cv_path_install="$ac_dir/$ac_prog -c" break 2 fi fi done ;; esac done IFS="$ac_save_IFS" fi if test "${ac_cv_path_install+set}" = set; then INSTALL="$ac_cv_path_install" else # As a last resort, use the slow shell script. We don't cache a # path for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the path is relative. INSTALL="$ac_install_sh" fi fi echo "$ac_t""$INSTALL" 1>&6 # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' echo $ac_n "checking whether ${MAKE-make} sets \${MAKE}""... $ac_c" 1>&6 echo "configure:1127: checking whether ${MAKE-make} sets \${MAKE}" >&5 set dummy ${MAKE-make}; ac_make=`echo "$2" | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_prog_make_${ac_make}_set'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftestmake <<\EOF all: @echo 'ac_maketemp="${MAKE}"' EOF # GNU make sometimes prints "make[1]: Entering...", which would confuse us. eval `${MAKE-make} -f conftestmake 2>/dev/null | grep temp=` if test -n "$ac_maketemp"; then eval ac_cv_prog_make_${ac_make}_set=yes else eval ac_cv_prog_make_${ac_make}_set=no fi rm -f conftestmake fi if eval "test \"`echo '$ac_cv_prog_make_'${ac_make}_set`\" = yes"; then echo "$ac_t""yes" 1>&6 SET_MAKE= else echo "$ac_t""no" 1>&6 SET_MAKE="MAKE=${MAKE-make}" fi # checks for UNIX variants that set C preprocessor variables ac_safe=`echo "minix/config.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for minix/config.h""... $ac_c" 1>&6 echo "configure:1157: checking for minix/config.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" { (eval echo configure:1167: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 MINIX=yes else echo "$ac_t""no" 1>&6 MINIX= fi if test "$MINIX" = yes; then cat >> confdefs.h <<\EOF #define _POSIX_SOURCE 1 EOF cat >> confdefs.h <<\EOF #define _POSIX_1_SOURCE 2 EOF cat >> confdefs.h <<\EOF #define _MINIX 1 EOF fi echo $ac_n "checking size of int""... $ac_c" 1>&6 echo "configure:1206: checking size of int" >&5 if eval "test \"`echo '$''{'ac_cv_sizeof_int'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < main() { FILE *f=fopen("conftestval", "w"); if (!f) exit(1); fprintf(f, "%d\n", sizeof(int)); exit(0); } EOF if { (eval echo configure:1225: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then ac_cv_sizeof_int=`cat conftestval` else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_sizeof_int=0 fi rm -fr conftest* fi fi echo "$ac_t""$ac_cv_sizeof_int" 1>&6 cat >> confdefs.h <&6 echo "configure:1245: checking size of long" >&5 if eval "test \"`echo '$''{'ac_cv_sizeof_long'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < main() { FILE *f=fopen("conftestval", "w"); if (!f) exit(1); fprintf(f, "%d\n", sizeof(long)); exit(0); } EOF if { (eval echo configure:1264: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then ac_cv_sizeof_long=`cat conftestval` else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_sizeof_long=0 fi rm -fr conftest* fi fi echo "$ac_t""$ac_cv_sizeof_long" 1>&6 cat >> confdefs.h <&6 echo "configure:1284: checking size of void*" >&5 if eval "test \"`echo '$''{'ac_cv_sizeof_voidp'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < main() { FILE *f=fopen("conftestval", "w"); if (!f) exit(1); fprintf(f, "%d\n", sizeof(void*)); exit(0); } EOF if { (eval echo configure:1303: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then ac_cv_sizeof_voidp=`cat conftestval` else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_sizeof_voidp=0 fi rm -fr conftest* fi fi echo "$ac_t""$ac_cv_sizeof_voidp" 1>&6 cat >> confdefs.h <&6 echo "configure:1324: checking for prototypes" >&5 if eval "test \"`echo '$''{'rb_cv_have_prototypes'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_have_prototypes=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* rb_cv_have_prototypes=no fi rm -f conftest* fi echo "$ac_t""$rb_cv_have_prototypes" 1>&6 if test "$rb_cv_have_prototypes" = yes; then cat >> confdefs.h <<\EOF #define HAVE_PROTOTYPES 1 EOF fi echo $ac_n "checking for variable length prototypes and stdarg.h""... $ac_c" 1>&6 echo "configure:1357: checking for variable length prototypes and stdarg.h" >&5 if eval "test \"`echo '$''{'rb_cv_stdarg'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int foo(int x, ...) { va_list va; va_start(va, x); va_arg(va, int); va_arg(va, char *); va_arg(va, double); return 0; } int main() { return foo(10, "", 3.14); ; return 0; } EOF if { (eval echo configure:1379: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_stdarg=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* rb_cv_stdarg=no fi rm -f conftest* fi echo "$ac_t""$rb_cv_stdarg" 1>&6 if test "$rb_cv_stdarg" = yes; then cat >> confdefs.h <<\EOF #define HAVE_STDARG_PROTOTYPES 1 EOF fi echo $ac_n "checking for gcc attribute noreturn""... $ac_c" 1>&6 echo "configure:1400: checking for gcc attribute noreturn" >&5 if eval "test \"`echo '$''{'rb_cv_have_attr_noreturn'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_have_attr_noreturn=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* rb_cv_have_attr_noreturn=no fi rm -f conftest* fi echo "$ac_t""$rb_cv_have_attr_noreturn" 1>&6 if test "$rb_cv_have_attr_noreturn" = yes; then cat >> confdefs.h <<\EOF #define HAVE_ATTR_NORETURN 1 EOF fi case "$host_os" in nextstep*) ;; openstep*) ;; rhapsody*) ;; human*) ;; beos*) ;; *) LIBS="-lm $LIBS";; esac echo $ac_n "checking for crypt in -lcrypt""... $ac_c" 1>&6 echo "configure:1441: checking for crypt in -lcrypt" >&5 ac_lib_var=`echo crypt'_'crypt | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-lcrypt $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=no" fi rm -f conftest* LIBS="$ac_save_LIBS" fi if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_lib=HAVE_LIB`echo crypt | sed -e 's/[^a-zA-Z0-9_]/_/g' \ -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'` cat >> confdefs.h <&6 fi echo $ac_n "checking for dlopen in -ldl""... $ac_c" 1>&6 echo "configure:1488: checking for dlopen in -ldl" >&5 ac_lib_var=`echo dl'_'dlopen | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-ldl $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=no" fi rm -f conftest* LIBS="$ac_save_LIBS" fi if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_lib=HAVE_LIB`echo dl | sed -e 's/[^a-zA-Z0-9_]/_/g' \ -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'` cat >> confdefs.h <&6 fi # Dynamic linking for SunOS/Solaris and SYSV echo $ac_n "checking for shl_load in -ldld""... $ac_c" 1>&6 echo "configure:1535: checking for shl_load in -ldld" >&5 ac_lib_var=`echo dld'_'shl_load | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-ldld $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=no" fi rm -f conftest* LIBS="$ac_save_LIBS" fi if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_lib=HAVE_LIB`echo dld | sed -e 's/[^a-zA-Z0-9_]/_/g' \ -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'` cat >> confdefs.h <&6 fi # Dynamic linking for HP-UX echo $ac_n "checking for setlocale in -lxpg4""... $ac_c" 1>&6 echo "configure:1582: checking for setlocale in -lxpg4" >&5 ac_lib_var=`echo xpg4'_'setlocale | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-lxpg4 $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=no" fi rm -f conftest* LIBS="$ac_save_LIBS" fi if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_lib=HAVE_LIB`echo xpg4 | sed -e 's/[^a-zA-Z0-9_]/_/g' \ -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'` cat >> confdefs.h <&6 fi # FreeBSD needs this ac_header_dirent=no for ac_hdr in dirent.h sys/ndir.h sys/dir.h ndir.h do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr that defines DIR""... $ac_c" 1>&6 echo "configure:1634: checking for $ac_hdr that defines DIR" >&5 if eval "test \"`echo '$''{'ac_cv_header_dirent_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include <$ac_hdr> int main() { DIR *dirp = 0; ; return 0; } EOF if { (eval echo configure:1647: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* eval "ac_cv_header_dirent_$ac_safe=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_header_dirent_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_dirent_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_hdr=HAVE_`echo $ac_hdr | sed 'y%abcdefghijklmnopqrstuvwxyz./-%ABCDEFGHIJKLMNOPQRSTUVWXYZ___%'` cat >> confdefs.h <&6 fi done # Two versions of opendir et al. are in -ldir and -lx on SCO Xenix. if test $ac_header_dirent = dirent.h; then echo $ac_n "checking for opendir in -ldir""... $ac_c" 1>&6 echo "configure:1672: checking for opendir in -ldir" >&5 ac_lib_var=`echo dir'_'opendir | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-ldir $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=no" fi rm -f conftest* LIBS="$ac_save_LIBS" fi if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then echo "$ac_t""yes" 1>&6 LIBS="$LIBS -ldir" else echo "$ac_t""no" 1>&6 fi else echo $ac_n "checking for opendir in -lx""... $ac_c" 1>&6 echo "configure:1713: checking for opendir in -lx" >&5 ac_lib_var=`echo x'_'opendir | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-lx $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=no" fi rm -f conftest* LIBS="$ac_save_LIBS" fi if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then echo "$ac_t""yes" 1>&6 LIBS="$LIBS -lx" else echo "$ac_t""no" 1>&6 fi fi echo $ac_n "checking for ANSI C header files""... $ac_c" 1>&6 echo "configure:1755: checking for ANSI C header files" >&5 if eval "test \"`echo '$''{'ac_cv_header_stdc'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include #include #include EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" { (eval echo configure:1768: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* ac_cv_header_stdc=yes else echo "$ac_err" >&5 echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_header_stdc=no fi rm -f conftest* if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "memchr" >/dev/null 2>&1; then : else rm -rf conftest* ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "free" >/dev/null 2>&1; then : else rm -rf conftest* ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : else cat > conftest.$ac_ext < #define ISLOWER(c) ('a' <= (c) && (c) <= 'z') #define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) exit(2); exit (0); } EOF if { (eval echo configure:1835: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then : else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_header_stdc=no fi rm -fr conftest* fi fi fi echo "$ac_t""$ac_cv_header_stdc" 1>&6 if test $ac_cv_header_stdc = yes; then cat >> confdefs.h <<\EOF #define STDC_HEADERS 1 EOF fi for ac_hdr in stdlib.h unistd.h limits.h sys/file.h sys/ioctl.h pwd.h \ sys/select.h sys/time.h sys/times.h sys/param.h sys/wait.h\ syscall.h a.out.h string.h utime.h memory.h direct.h do ac_safe=`echo "$ac_hdr" | sed 'y%./+-%__p_%'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&6 echo "configure:1864: checking for $ac_hdr" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" { (eval echo configure:1874: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_hdr=HAVE_`echo $ac_hdr | sed 'y%abcdefghijklmnopqrstuvwxyz./-%ABCDEFGHIJKLMNOPQRSTUVWXYZ___%'` cat >> confdefs.h <&6 fi done echo $ac_n "checking for uid_t in sys/types.h""... $ac_c" 1>&6 echo "configure:1902: checking for uid_t in sys/types.h" >&5 if eval "test \"`echo '$''{'ac_cv_type_uid_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "uid_t" >/dev/null 2>&1; then rm -rf conftest* ac_cv_type_uid_t=yes else rm -rf conftest* ac_cv_type_uid_t=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_type_uid_t" 1>&6 if test $ac_cv_type_uid_t = no; then cat >> confdefs.h <<\EOF #define uid_t int EOF cat >> confdefs.h <<\EOF #define gid_t int EOF fi echo $ac_n "checking for size_t""... $ac_c" 1>&6 echo "configure:1936: checking for size_t" >&5 if eval "test \"`echo '$''{'ac_cv_type_size_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #if STDC_HEADERS #include #include #endif EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "size_t[^a-zA-Z_0-9]" >/dev/null 2>&1; then rm -rf conftest* ac_cv_type_size_t=yes else rm -rf conftest* ac_cv_type_size_t=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_type_size_t" 1>&6 if test $ac_cv_type_size_t = no; then cat >> confdefs.h <<\EOF #define size_t unsigned EOF fi echo $ac_n "checking for st_blksize in struct stat""... $ac_c" 1>&6 echo "configure:1969: checking for st_blksize in struct stat" >&5 if eval "test \"`echo '$''{'ac_cv_struct_st_blksize'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include int main() { struct stat s; s.st_blksize; ; return 0; } EOF if { (eval echo configure:1982: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_cv_struct_st_blksize=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_struct_st_blksize=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_struct_st_blksize" 1>&6 if test $ac_cv_struct_st_blksize = yes; then cat >> confdefs.h <<\EOF #define HAVE_ST_BLKSIZE 1 EOF fi save_LIBOJBS="$LIBOBJS" echo $ac_n "checking for st_blocks in struct stat""... $ac_c" 1>&6 echo "configure:2004: checking for st_blocks in struct stat" >&5 if eval "test \"`echo '$''{'ac_cv_struct_st_blocks'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include int main() { struct stat s; s.st_blocks; ; return 0; } EOF if { (eval echo configure:2017: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_cv_struct_st_blocks=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_struct_st_blocks=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_struct_st_blocks" 1>&6 if test $ac_cv_struct_st_blocks = yes; then cat >> confdefs.h <<\EOF #define HAVE_ST_BLOCKS 1 EOF else LIBOBJS="$LIBOBJS fileblocks.o" fi LIBOBJS="$save_LIBOBJS" echo $ac_n "checking for st_rdev in struct stat""... $ac_c" 1>&6 echo "configure:2041: checking for st_rdev in struct stat" >&5 if eval "test \"`echo '$''{'ac_cv_struct_st_rdev'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include int main() { struct stat s; s.st_rdev; ; return 0; } EOF if { (eval echo configure:2054: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_cv_struct_st_rdev=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_struct_st_rdev=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_struct_st_rdev" 1>&6 if test $ac_cv_struct_st_rdev = yes; then cat >> confdefs.h <<\EOF #define HAVE_ST_RDEV 1 EOF fi echo $ac_n "checking type of array argument to getgroups""... $ac_c" 1>&6 echo "configure:2076: checking type of array argument to getgroups" >&5 if eval "test \"`echo '$''{'ac_cv_type_getgroups'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then ac_cv_type_getgroups=cross else cat > conftest.$ac_ext < #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); } EOF if { (eval echo configure:2109: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then ac_cv_type_getgroups=gid_t else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_type_getgroups=int fi rm -fr conftest* fi if test $ac_cv_type_getgroups = cross; then cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "getgroups.*int.*gid_t" >/dev/null 2>&1; then rm -rf conftest* ac_cv_type_getgroups=gid_t else rm -rf conftest* ac_cv_type_getgroups=int fi rm -f conftest* fi fi echo "$ac_t""$ac_cv_type_getgroups" 1>&6 cat >> confdefs.h <&6 echo "configure:2147: checking return type of signal handlers" >&5 if eval "test \"`echo '$''{'ac_cv_type_signal'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include #ifdef signal #undef signal #endif #ifdef __cplusplus extern "C" void (*signal (int, void (*)(int)))(int); #else void (*signal ()) (); #endif int main() { int i; ; return 0; } EOF if { (eval echo configure:2169: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_cv_type_signal=void else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_type_signal=int fi rm -f conftest* fi echo "$ac_t""$ac_cv_type_signal" 1>&6 cat >> confdefs.h <&6 echo "configure:2190: checking for working alloca.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_alloca_h'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { char *p = alloca(2 * sizeof(int)); ; return 0; } EOF if { (eval echo configure:2202: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* ac_cv_header_alloca_h=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_header_alloca_h=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_header_alloca_h" 1>&6 if test $ac_cv_header_alloca_h = yes; then cat >> confdefs.h <<\EOF #define HAVE_ALLOCA_H 1 EOF fi echo $ac_n "checking for alloca""... $ac_c" 1>&6 echo "configure:2223: checking for alloca" >&5 if eval "test \"`echo '$''{'ac_cv_func_alloca_works'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < # else # ifdef _AIX #pragma alloca # else # ifndef alloca /* predefined by HP cc +Olibcalls */ char *alloca (); # endif # endif # endif #endif int main() { char *p = (char *) alloca(1); ; return 0; } EOF if { (eval echo configure:2251: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* ac_cv_func_alloca_works=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_func_alloca_works=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_func_alloca_works" 1>&6 if test $ac_cv_func_alloca_works = yes; then cat >> confdefs.h <<\EOF #define HAVE_ALLOCA 1 EOF fi if test $ac_cv_func_alloca_works = no; 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 cat >> confdefs.h <<\EOF #define C_ALLOCA 1 EOF echo $ac_n "checking whether alloca needs Cray hooks""... $ac_c" 1>&6 echo "configure:2283: checking whether alloca needs Cray hooks" >&5 if eval "test \"`echo '$''{'ac_cv_os_cray'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5 | egrep "webecray" >/dev/null 2>&1; then rm -rf conftest* ac_cv_os_cray=yes else rm -rf conftest* ac_cv_os_cray=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_os_cray" 1>&6 if test $ac_cv_os_cray = yes; then for ac_func in _getb67 GETB67 getb67; do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 echo "configure:2313: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char $ac_func(); int main() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if { (eval echo configure:2341: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <&6 fi done fi echo $ac_n "checking stack direction for C alloca""... $ac_c" 1>&6 echo "configure:2368: checking stack direction for C alloca" >&5 if eval "test \"`echo '$''{'ac_cv_c_stack_direction'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then ac_cv_c_stack_direction=0 else cat > conftest.$ac_ext < addr) ? 1 : -1; } main () { exit (find_stack_direction() < 0); } EOF if { (eval echo configure:2395: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then ac_cv_c_stack_direction=1 else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_c_stack_direction=-1 fi rm -fr conftest* fi fi echo "$ac_t""$ac_cv_c_stack_direction" 1>&6 cat >> confdefs.h <&6 echo "configure:2417: checking for pid_t" >&5 if eval "test \"`echo '$''{'ac_cv_type_pid_t'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #if STDC_HEADERS #include #include #endif EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "pid_t[^a-zA-Z_0-9]" >/dev/null 2>&1; then rm -rf conftest* ac_cv_type_pid_t=yes else rm -rf conftest* ac_cv_type_pid_t=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_type_pid_t" 1>&6 if test $ac_cv_type_pid_t = no; then cat >> confdefs.h <<\EOF #define pid_t int EOF fi ac_safe=`echo "vfork.h" | sed 'y%./+-%__p_%'` echo $ac_n "checking for vfork.h""... $ac_c" 1>&6 echo "configure:2451: checking for vfork.h" >&5 if eval "test \"`echo '$''{'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < EOF ac_try="$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" { (eval echo configure:2461: \"$ac_try\") 1>&5; (eval $ac_try) 2>&5; } ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&6 cat >> confdefs.h <<\EOF #define HAVE_VFORK_H 1 EOF else echo "$ac_t""no" 1>&6 fi echo $ac_n "checking for working vfork""... $ac_c" 1>&6 echo "configure:2486: checking for working vfork" >&5 if eval "test \"`echo '$''{'ac_cv_func_vfork_works'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then echo $ac_n "checking for vfork""... $ac_c" 1>&6 echo "configure:2492: checking for vfork" >&5 if eval "test \"`echo '$''{'ac_cv_func_vfork'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char vfork(); int main() { /* 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_vfork) || defined (__stub___vfork) choke me #else vfork(); #endif ; return 0; } EOF if { (eval echo configure:2520: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_func_vfork=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_func_vfork=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'vfork`\" = yes"; then echo "$ac_t""yes" 1>&6 : else echo "$ac_t""no" 1>&6 fi else cat > conftest.$ac_ext < #include #include #ifdef HAVE_UNISTD_H #include #endif #ifdef HAVE_VFORK_H #include #endif /* On some sparc systems, changes by the child to local and incoming argument registers are propagated back to the parent. The compiler is told about this with #include , but some compilers (e.g. gcc -O) don't grok . Test for this by using a static variable whose address is put into a register that is clobbered by the vfork. */ static #ifdef __cplusplus sparc_address_test (int arg) #else sparc_address_test (arg) int arg; #endif { static pid_t child; if (!child) { child = vfork (); if (child < 0) { perror ("vfork"); _exit(2); } if (!child) { arg = getpid(); write(-1, "", 0); _exit (arg); } } } main() { pid_t parent = getpid (); pid_t child; sparc_address_test (); child = vfork (); if (child == 0) { /* Here is another test for sparc vfork register problems. This test uses lots of local variables, at least as many local variables as main has allocated so far including compiler temporaries. 4 locals are enough for gcc 1.40.3 on a Solaris 4.1.3 sparc, but we use 8 to be safe. A buggy compiler should reuse the register of parent for one of the local variables, since it will think that parent can't possibly be used any more in this routine. Assigning to the local variable will thus munge parent in the parent process. */ pid_t p = getpid(), p1 = getpid(), p2 = getpid(), p3 = getpid(), p4 = getpid(), p5 = getpid(), p6 = getpid(), p7 = getpid(); /* Convince the compiler that p..p7 are live; otherwise, it might use the same hardware register for all 8 local variables. */ if (p != p1 || p != p2 || p != p3 || p != p4 || p != p5 || p != p6 || p != p7) _exit(1); /* On some systems (e.g. IRIX 3.3), vfork doesn't separate parent from child file descriptors. If the child closes a descriptor before it execs or exits, this munges the parent's descriptor as well. Test for this by closing stdout in the child. */ _exit(close(fileno(stdout)) != 0); } else { int status; struct stat st; while (wait(&status) != child) ; exit( /* Was there some problem with vforking? */ child < 0 /* Did the child fail? (This shouldn't happen.) */ || status /* Did the vfork/compiler bug occur? */ || parent != getpid() /* Did the file descriptor bug occur? */ || fstat(fileno(stdout), &st) != 0 ); } } EOF if { (eval echo configure:2636: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then ac_cv_func_vfork_works=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_func_vfork_works=no fi rm -fr conftest* fi fi echo "$ac_t""$ac_cv_func_vfork_works" 1>&6 if test $ac_cv_func_vfork_works = no; then cat >> confdefs.h <<\EOF #define vfork fork EOF fi echo $ac_n "checking for 8-bit clean memcmp""... $ac_c" 1>&6 echo "configure:2659: checking for 8-bit clean memcmp" >&5 if eval "test \"`echo '$''{'ac_cv_func_memcmp_clean'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then ac_cv_func_memcmp_clean=no else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then ac_cv_func_memcmp_clean=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_func_memcmp_clean=no fi rm -fr conftest* fi fi echo "$ac_t""$ac_cv_func_memcmp_clean" 1>&6 test $ac_cv_func_memcmp_clean = no && LIBOBJS="$LIBOBJS memcmp.o" for ac_func in dup2 setenv memmove mkdir strcasecmp strerror strftime\ strchr strstr strtoul strdup crypt flock vsnprintf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 echo "configure:2698: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char $ac_func(); int main() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if { (eval echo configure:2726: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_func=HAVE_`echo $ac_func | tr 'abcdefghijklmnopqrstuvwxyz' 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'` cat >> confdefs.h <&6 LIBOBJS="$LIBOBJS ${ac_func}.o" fi done for ac_func in fmod killpg drand48 random wait4 waitpid syscall getcwd\ truncate chsize times utimes fcntl lockf setitimer\ setruid seteuid setreuid setrgid setegid setregid\ setpgrp2 getpgid setpgid getgroups getpriority\ dlopen sigprocmask sigaction _setjmp setpgrp setsid do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 echo "configure:2759: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char $ac_func(); int main() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if { (eval echo configure:2787: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_func=HAVE_`echo $ac_func | tr 'abcdefghijklmnopqrstuvwxyz' 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'` cat >> confdefs.h <&6 fi done if test "$ac_cv_func_strftime" = no; then echo $ac_n "checking whether struct tm is in sys/time.h or time.h""... $ac_c" 1>&6 echo "configure:2813: checking whether struct tm is in sys/time.h or time.h" >&5 if eval "test \"`echo '$''{'ac_cv_struct_tm'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include int main() { struct tm *tp; tp->tm_sec; ; return 0; } EOF if { (eval echo configure:2826: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_cv_struct_tm=time.h else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_struct_tm=sys/time.h fi rm -f conftest* fi echo "$ac_t""$ac_cv_struct_tm" 1>&6 if test $ac_cv_struct_tm = sys/time.h; then cat >> confdefs.h <<\EOF #define TM_IN_SYS_TIME 1 EOF fi echo $ac_n "checking for tm_zone in struct tm""... $ac_c" 1>&6 echo "configure:2847: checking for tm_zone in struct tm" >&5 if eval "test \"`echo '$''{'ac_cv_struct_tm_zone'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #include <$ac_cv_struct_tm> int main() { struct tm tm; tm.tm_zone; ; return 0; } EOF if { (eval echo configure:2860: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_cv_struct_tm_zone=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_struct_tm_zone=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_struct_tm_zone" 1>&6 if test "$ac_cv_struct_tm_zone" = yes; then cat >> confdefs.h <<\EOF #define HAVE_TM_ZONE 1 EOF else echo $ac_n "checking for tzname""... $ac_c" 1>&6 echo "configure:2880: checking for tzname" >&5 if eval "test \"`echo '$''{'ac_cv_var_tzname'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < #ifndef tzname /* For SGI. */ extern char *tzname[]; /* RS6000 and others reject char **tzname. */ #endif int main() { atoi(*tzname); ; return 0; } EOF if { (eval echo configure:2895: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* ac_cv_var_tzname=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_var_tzname=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_var_tzname" 1>&6 if test $ac_cv_var_tzname = yes; then cat >> confdefs.h <<\EOF #define HAVE_TZNAME 1 EOF fi fi cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* cat >> confdefs.h <<\EOF #define HAVE_DAYLIGHT 1 EOF else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -f conftest* fi if test "$ac_cv_func_sigprocmask" = yes && test "$ac_cv_func_sigaction" = yes; then cat >> confdefs.h <<\EOF #define POSIX_SIGNAL 1 EOF else echo $ac_n "checking for BSD signal semantics""... $ac_c" 1>&6 echo "configure:2944: checking for BSD signal semantics" >&5 if eval "test \"`echo '$''{'rb_cv_bsd_signal'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < #include void sig_handler(dummy) int dummy; { } int main() { signal(SIGINT, sig_handler); kill(getpid(), SIGINT); kill(getpid(), SIGINT); return 0; } EOF if { (eval echo configure:2974: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then rb_cv_bsd_signal=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* rb_cv_bsd_signal=no fi rm -fr conftest* fi fi echo "$ac_t""$rb_cv_bsd_signal" 1>&6 if test "$rb_cv_bsd_signal" = yes; then cat >> confdefs.h <<\EOF #define BSD_SIGNAL 1 EOF fi fi if test "$ac_cv_func_setpgrp2" = yes; then cat >> confdefs.h <<\EOF #define BSD_GETPGRP getpgrp2 EOF cat >> confdefs.h <<\EOF #define BSD_SETPGRP setpgrp2 EOF else echo $ac_n "checking whether getpgrp() has arg""... $ac_c" 1>&6 echo "configure:3008: checking whether getpgrp() has arg" >&5 if eval "test \"`echo '$''{'rb_cv_bsdgetpgrp'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { getpgrp(0); ; return 0; } EOF if { (eval echo configure:3020: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_bsdgetpgrp=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* rb_cv_bsdgetpgrp=no fi rm -f conftest* fi echo "$ac_t""$rb_cv_bsdgetpgrp" 1>&6 if test "$rb_cv_bsdgetpgrp" = yes; then cat >> confdefs.h <<\EOF #define BSD_GETPGRP getpgrp EOF fi echo $ac_n "checking whether setpgrp() has args""... $ac_c" 1>&6 echo "configure:3041: checking whether setpgrp() has args" >&5 if eval "test \"`echo '$''{'rb_cv_bsdsetpgrp'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { setpgrp(1, 1); ; return 0; } EOF if { (eval echo configure:3053: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_bsdsetpgrp=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* rb_cv_bsdsetpgrp=no fi rm -f conftest* fi echo "$ac_t""$rb_cv_bsdsetpgrp" 1>&6 if test "$rb_cv_bsdsetpgrp" = yes; then cat >> confdefs.h <<\EOF #define BSD_SETPGRP setpgrp EOF fi fi echo $ac_n "checking whether byte ordering is bigendian""... $ac_c" 1>&6 echo "configure:3075: checking whether byte ordering is bigendian" >&5 if eval "test \"`echo '$''{'ac_cv_c_bigendian'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_cv_c_bigendian=unknown # See if sys/param.h defines the BYTE_ORDER macro. cat > conftest.$ac_ext < #include int main() { #if !BYTE_ORDER || !BIG_ENDIAN || !LITTLE_ENDIAN bogus endian macros #endif ; return 0; } EOF if { (eval echo configure:3093: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* # It does; now see whether it defined to BIG_ENDIAN or not. cat > conftest.$ac_ext < #include int main() { #if BYTE_ORDER != BIG_ENDIAN not big endian #endif ; return 0; } EOF if { (eval echo configure:3108: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* ac_cv_c_bigendian=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* ac_cv_c_bigendian=no fi rm -f conftest* else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -f conftest* if test $ac_cv_c_bigendian = unknown; then if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then ac_cv_c_bigendian=no else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_c_bigendian=yes fi rm -fr conftest* fi fi fi echo "$ac_t""$ac_cv_c_bigendian" 1>&6 if test $ac_cv_c_bigendian = yes; then cat >> confdefs.h <<\EOF #define WORDS_BIGENDIAN 1 EOF fi echo $ac_n "checking whether char is unsigned""... $ac_c" 1>&6 echo "configure:3165: checking whether char is unsigned" >&5 if eval "test \"`echo '$''{'ac_cv_c_char_unsigned'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$GCC" = yes; then # GCC predefines this symbol on systems where it applies. cat > conftest.$ac_ext <&5 | egrep "yes" >/dev/null 2>&1; then rm -rf conftest* ac_cv_c_char_unsigned=yes else rm -rf conftest* ac_cv_c_char_unsigned=no fi rm -f conftest* else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then ac_cv_c_char_unsigned=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* ac_cv_c_char_unsigned=no fi rm -fr conftest* fi fi fi echo "$ac_t""$ac_cv_c_char_unsigned" 1>&6 if test $ac_cv_c_char_unsigned = yes && test "$GCC" != yes; then cat >> confdefs.h <<\EOF #define __CHAR_UNSIGNED__ 1 EOF fi echo $ac_n "checking whether right shift preserve sign bit""... $ac_c" 1>&6 echo "configure:3229: checking whether right shift preserve sign bit" >&5 if eval "test \"`echo '$''{'rb_cv_rshift_sign'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext <>1)) return 0; return 1; } EOF if { (eval echo configure:3249: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then rb_cv_rshift_sign=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* rb_cv_rshift_sign=no fi rm -fr conftest* fi fi echo "$ac_t""$rb_cv_rshift_sign" 1>&6 if test "$rb_cv_rshift_sign" = yes; then cat >> confdefs.h <<\EOF #define RSHIFT(x,y) ((x)>>y) EOF else cat >> confdefs.h <<\EOF #define RSHIFT(x,y) (((x)<0) ? ~((~(x))>>y) : (x)>>y) EOF fi echo $ac_n "checking count field in FILE structures""... $ac_c" 1>&6 echo "configure:3277: checking count field in FILE structures" >&5 if eval "test \"`echo '$''{'rb_cv_fcnt'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < int main() { FILE *f = stdin; f->_cnt = 0; ; return 0; } EOF if { (eval echo configure:3289: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_fcnt="_cnt" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -f conftest* if test "$rb_cv_fcnt" = ""; then cat > conftest.$ac_ext < int main() { FILE *f = stdin; f->__cnt = 0; ; return 0; } EOF if { (eval echo configure:3306: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_fcnt="__cnt" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -f conftest* fi if test "$rb_cv_fcnt" = ""; then cat > conftest.$ac_ext < int main() { FILE *f = stdin; f->_r = 0; ; return 0; } EOF if { (eval echo configure:3324: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_fcnt="_r" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -f conftest* fi if test "$rb_cv_fcnt" = ""; then cat > conftest.$ac_ext < int main() { FILE *f = stdin; f->readCount = 0; ; return 0; } EOF if { (eval echo configure:3342: \"$ac_compile\") 1>&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_fcnt="readCount" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* rb_cv_fcnt="not found" fi rm -f conftest* fi fi if test "$rb_cv_fcnt" = "not found"; then echo "$ac_t""not found(OK if using GNU libc)" 1>&6 else echo "$ac_t""$rb_cv_fcnt" 1>&6 cat >> confdefs.h <&6 echo "configure:3381: checking whether ELF binaries are produced" >&5 if eval "test \"`echo '$''{'rb_cv_linux_elf'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then : else cat > conftest.$ac_ext < #include main() { char buffer[4]; int i=open("conftest",O_RDONLY); if(i==-1) exit(1); /* fail */ if(read(i,&buffer[0],4)<4) exit(1); /* fail */ if(buffer[0] != 127 || buffer[1] != 'E' || buffer[2] != 'L' || buffer[3] != 'F') exit(1); /* fail */ exit(0); /* succeed (yes, it's ELF) */ } EOF if { (eval echo configure:3409: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then rb_cv_linux_elf=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* rb_cv_linux_elf=no fi rm -fr conftest* fi fi echo "$ac_t""$rb_cv_linux_elf" 1>&6 if test "$rb_cv_linux_elf" = no; then with_dln_a_out=yes host_os=linux-a.out else LDFLAGS="-rdynamic" fi;; esac STATIC= if test "$with_dln_a_out" != yes; then rb_cv_dlopen=unknown echo $ac_n "checking whether OS depend dynamic link works""... $ac_c" 1>&6 echo "configure:3439: checking whether OS depend dynamic link works" >&5 if test "$GCC" = yes; then case "$host_os" in nextstep*) ;; openstep*) ;; rhapsody*) ;; human*) ;; cygwin*) CCDLFLAGS=-DDLLIMPORT;; *) CCDLFLAGS=-fpic;; esac else case "$host_os" in hpux*) CCDLFLAGS='+z';; solaris*|irix*) CCDLFLAGS='-K pic' ;; sunos*) CCDLFLAGS='-pic' ;; esix*|uxpds*) CCDLFLAGS='-Kpic' ;; *) CCDLFLAGS='' ;; esac fi case "$host_os" in hpux*) DLDFLAGS="-E" LDSHARED='ld -b' LDFLAGS="-Wl,-E" rb_cv_dlopen=yes;; solaris*) LDSHARED='ld -G' rb_cv_dlopen=yes;; sunos*) LDSHARED='ld -assert nodefinitions' rb_cv_dlopen=yes;; irix*) LDSHARED='ld -ignore_unresolved' rb_cv_dlopen=yes;; sysv4*) LDSHARED='ld -G' rb_cv_dlopen=yes;; esix*|uxpds*) LDSHARED="ld -G" rb_cv_dlopen=yes ;; linux*) LDSHARED="gcc -shared" rb_cv_dlopen=yes ;; freebsd*) LDSHARED="gcc -shared" if test -x /usr/bin/objformat -a \ `/usr/bin/objformat` = "elf" ; then LDFLAGS="-rdynamic" fi rb_cv_dlopen=yes ;; netbsd*) LDSHARED="ld -Bshareable" case "$host_cpu" in alpha|mips) LDFLAGS="-export-dynamic" ;; *) ;; esac rb_cv_dlopen=yes ;; openbsd*) LDSHARED="ld -Bforcearchive -Bshareable" CCDLFLAGS=-fPIC rb_cv_dlopen=yes ;; nextstep*) LDSHARED='cc -r' LDFLAGS="-u libsys_s" DLDFLAGS="$ARCH_FLAG" rb_cv_dlopen=yes ;; openstep*) LDSHARED='cc -dynamic -bundle -undefined suppress' LDFLAGS="" DLDFLAGS="$ARCH_FLAG" rb_cv_dlopen=yes ;; rhapsody*) LDSHARED='cc -dynamic -bundle -undefined suppress' LDFLAGS="" DLDFLAGS="$ARCH_FLAG" rb_cv_dlopen=yes ;; aix*) LDSHARED='../../miniruby ../aix_ld.rb $(TARGET)' rb_cv_dlopen=yes ;; human*) DLDFLAGS='' LDSHARED='' LDFLAGS='' ;; beos*) LDSHARED="ld -xms" case "$host_cpu" in powerpc*) DLDFLAGS="-f ruby.exp -lbe -lroot glue-noinit.a init_term_dyn.o start_dyn.o" ;; *) DLDFLAGS="ruby.def -lbe -lroot glue-noinit.a init_term_dyn.o start_dyn.o" ;; esac rb_cv_dlopen=yes ;; cygwin*) LDSHARED='../../miniruby ../cygwin32_ld.rb' ;; *) LDSHARED='ld' ;; esac echo "$ac_t""$rb_cv_dlopen" 1>&6 fi dln_a_out_works=no if test "$ac_cv_header_a_out_h" = yes; then if test "$with_dln_a_out" = yes || test "$rb_cv_dlopen" = unknown; then echo $ac_n "checking whether matz's dln works""... $ac_c" 1>&6 echo "configure:3530: checking whether matz's dln works" >&5 cat confdefs.h > config.h if eval "test \"`echo '$''{'rb_cv_dln_a_out'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext <&5; (eval $ac_compile) 2>&5; }; then rm -rf conftest* rb_cv_dln_a_out=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* rb_cv_dln_a_out=no fi rm -f conftest* fi echo "$ac_t""$rb_cv_dln_a_out" 1>&6 if test "$rb_cv_dln_a_out" = yes; then dln_a_out_works=yes cat >> confdefs.h <<\EOF #define USE_DLN_A_OUT 1 EOF fi fi fi if test "$dln_a_out_works" = yes; then if test "$GCC" = yes; then STATIC=-static else STATIC=-Bstatic fi DLEXT=o cat >> confdefs.h <<\EOF #define DLEXT ".o" EOF CCDLFLAGS= else case "$host_os" in hpux*) DLEXT=sl cat >> confdefs.h <<\EOF #define DLEXT ".sl" EOF ;; nextstep*) DLEXT=o cat >> confdefs.h <<\EOF #define DLEXT ".o" EOF ;; openstep*) DLEXT=bundle cat >> confdefs.h <<\EOF #define DLEXT ".bundle" EOF ;; rhapsody*) DLEXT=bundle cat >> confdefs.h <<\EOF #define DLEXT ".bundle" EOF ;; cygwin*) DLEXT=dll cat >> confdefs.h <<\EOF #define DLEXT ".dll" EOF ;; *) DLEXT=so cat >> confdefs.h <<\EOF #define DLEXT ".so" EOF ;; esac fi if test "$with_dln_a_out" = yes; then STRIP=true else STRIP=strip fi case "$host_os" in linux*) STRIP='strip -S -x';; nextstep*) STRIP='strip -A -n';; openstep*) STRIP='strip -A -n';; rhapsody*) STRIP='strip -A -n';; esac EXTSTATIC= # Check whether --with-static-linked-ext or --without-static-linked-ext was given. if test "${with_static_linked_ext+set}" = set; then withval="$with_static_linked_ext" case $withval in yes) STATIC= EXTSTATIC=static;; *) ;; esac fi case "$host_os" in human*) echo $ac_n "checking for _harderr in -lsignal""... $ac_c" 1>&6 echo "configure:3648: checking for _harderr in -lsignal" >&5 ac_lib_var=`echo signal'_'_harderr | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-lsignal $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=no" fi rm -f conftest* LIBS="$ac_save_LIBS" fi if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_lib=HAVE_LIB`echo signal | sed -e 's/[^a-zA-Z0-9_]/_/g' \ -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'` cat >> confdefs.h <&6 fi echo $ac_n "checking for hmemset in -lhmem""... $ac_c" 1>&6 echo "configure:3695: checking for hmemset in -lhmem" >&5 ac_lib_var=`echo hmem'_'hmemset | sed 'y%./+-%__p_%'` if eval "test \"`echo '$''{'ac_cv_lib_$ac_lib_var'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else ac_save_LIBS="$LIBS" LIBS="-lhmem $LIBS" cat > conftest.$ac_ext <&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_lib_$ac_lib_var=no" fi rm -f conftest* LIBS="$ac_save_LIBS" fi if eval "test \"`echo '$ac_cv_lib_'$ac_lib_var`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_lib=HAVE_LIB`echo hmem | sed -e 's/[^a-zA-Z0-9_]/_/g' \ -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'` cat >> confdefs.h <&6 fi for ac_func in select do echo $ac_n "checking for $ac_func""... $ac_c" 1>&6 echo "configure:3744: checking for $ac_func" >&5 if eval "test \"`echo '$''{'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else cat > conftest.$ac_ext < /* Override any gcc2 internal prototype to avoid an error. */ /* We use char because int might match the return type of a gcc2 builtin and then its argument prototype would still apply. */ char $ac_func(); int main() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if { (eval echo configure:3772: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&6 ac_tr_func=HAVE_`echo $ac_func | tr 'abcdefghijklmnopqrstuvwxyz' 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'` cat >> confdefs.h <&6 fi done echo $ac_n "checking whether PD libc _dtos18 fail to convert big number""... $ac_c" 1>&6 echo "configure:3797: checking whether PD libc _dtos18 fail to convert big number" >&5 if eval "test \"`echo '$''{'rb_cv_missing__dtos18'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < main () { char buf[256]; sprintf (buf, "%g", 1e+300); exit (strcmp (buf, "1e+300") ? 0 : 1); } EOF if { (eval echo configure:3817: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then rb_cv_missing__dtos18=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* rb_cv_missing__dtos18=no fi rm -fr conftest* fi fi echo "$ac_t""$rb_cv_missing__dtos18" 1>&6 if test "$rb_cv_missing__dtos18" = yes; then cat >> confdefs.h <<\EOF #define MISSING__DTOS18 1 EOF fi echo $ac_n "checking whether PD libc fconvert fail to round""... $ac_c" 1>&6 echo "configure:3839: checking whether PD libc fconvert fail to round" >&5 if eval "test \"`echo '$''{'rb_cv_missing_fconvert'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&6 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < #include main () { char buf[256]; sprintf (buf, "%f", log(exp(1.0))); exit (strcmp (buf, "1.000000") ? 0 : 1); } EOF if { (eval echo configure:3860: \"$ac_link\") 1>&5; (eval $ac_link) 2>&5; } && test -s conftest && (./conftest; exit) 2>/dev/null then rb_cv_missing_fconvert=yes else echo "configure: failed program was:" >&5 cat conftest.$ac_ext >&5 rm -fr conftest* rb_cv_missing_fconvert=no fi rm -fr conftest* fi fi echo "$ac_t""$rb_cv_missing_fconvert" 1>&6 if test "$rb_cv_missing_fconvert" = yes; then cat >> confdefs.h <<\EOF #define MISSING_FCONVERT 1 EOF fi LIBOBJS="$LIBOBJS x68.o" CFLAGS="$CFLAGS -fansi-only -cc1-stack=196608 -cpp-stack=2694144" binsuffix=.x setup=Setup.x68 ;; cygwin*) binsuffix=.exe setup=Setup ;; *) binsuffix= setup=Setup ;; esac if test "$prefix" = NONE; then prefix=$ac_default_prefix fi if test "$fat_binary" = yes ; then CFLAGS="$CFLAGS $ARCH_FLAG" fi LIBRUBY='libruby.a' LIBRUBYARG='libruby.a' SOLIBS= if test "$host_os" = "beos"; then CFLAGS="$CFLAGS -relax_pointers" LIBRUBY='libruby.so' LIBRUBYARG='-lruby' SOLIBS='-lnet' echo creating ruby.def case "$host_cpu" in powerpc*) cp beos/ruby.def.in ruby.exp ;; *) echo EXPORTS > ruby.def cat beos/ruby.def.in >> ruby.def ;; esac fi if test "$enable_shared" = 'yes'; then LIBRUBY='libruby.so' LIBRUBYARG='-L./ -lruby' fi case "$host_os" in nextstep*) CFLAGS="$CFLAGS -pipe" ;; openstep*) CFLAGS="$CFLAGS -pipe" ;; rhasody*) CFLAGS="$CFLAGS -pipe -no-precomp" ;; *) ;; esac ri_prefix= test "$program_prefix" != NONE && ri_prefix=$program_prefix ri_suffix= test "$program_suffix" != NONE && ri_suffix=$program_suffix RUBY_INSTALL_NAME="${ri_prefix}ruby${ri_suffix}" cat >> confdefs.h <> confdefs.h <> confdefs.h <> confdefs.h <> confdefs.h <> confdefs.h <> confdefs.h <> confdefs.h <> confdefs.h <> confdefs.h < config.h trap '' 1 2 15 cat > confcache <<\EOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs. It is not useful on other systems. # If it contains results you don't want to keep, you may remove or edit it. # # By default, configure uses ./config.cache as the cache file, # creating it if it does not exist already. You can give configure # the --cache-file=FILE option to use a different cache file; that is # what configure does when it calls configure scripts in # subdirectories, so they share the cache. # Giving --cache-file=/dev/null disables caching, for debugging configure. # config.status only pays attention to the cache file if you give it the # --recheck option to rerun configure. # EOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, don't put newlines in cache variables' values. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. (set) 2>&1 | case `(ac_space=' '; set) 2>&1` in *ac_space=\ *) # `set' does not quote correctly, so add quotes (double-quote substitution # turns \\\\ into \\, and sed turns \\ into \). sed -n \ -e "s/'/'\\\\''/g" \ -e "s/^\\([a-zA-Z0-9_]*_cv_[a-zA-Z0-9_]*\\)=\\(.*\\)/\\1=\${\\1='\\2'}/p" ;; *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n -e 's/^\([a-zA-Z0-9_]*_cv_[a-zA-Z0-9_]*\)=\(.*\)/\1=${\1=\2}/p' ;; esac >> confcache if cmp -s $cache_file confcache; then : else if test -w $cache_file; then echo "updating cache $cache_file" cat confcache > $cache_file else echo "not updating unwritable cache $cache_file" fi fi rm -f confcache trap 'rm -fr conftest* confdefs* core core.* *.core $ac_clean_files; exit 1' 1 2 15 test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' # Any assignment to VPATH causes Sun make to only execute # the first set of double-colon rules, so remove it if not needed. # If there is a colon in the path, we need to keep it. if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[^:]*$/d' fi trap 'rm -f $CONFIG_STATUS conftest*; exit 1' 1 2 15 # Transform confdefs.h into DEFS. # Protect against shell expansion while executing Makefile rules. # Protect against Makefile macro expansion. cat > conftest.defs <<\EOF s%#define \([A-Za-z_][A-Za-z0-9_]*\) *\(.*\)%-D\1=\2%g s%[ `~#$^&*(){}\\|;'"<>?]%\\&%g s%\[%\\&%g s%\]%\\&%g s%\$%$$%g EOF DEFS=`sed -f conftest.defs confdefs.h | tr '\012' ' '` rm -f conftest.defs # Without the "./", some shells look in PATH for config.status. : ${CONFIG_STATUS=./config.status} echo creating $CONFIG_STATUS rm -f $CONFIG_STATUS cat > $CONFIG_STATUS </dev/null | sed 1q`: # # $0 $ac_configure_args # # Compiler output produced by configure, useful for debugging # configure, is in ./config.log if it exists. ac_cs_usage="Usage: $CONFIG_STATUS [--recheck] [--version] [--help]" for ac_option do case "\$ac_option" in -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) echo "running \${CONFIG_SHELL-/bin/sh} $0 $ac_configure_args --no-create --no-recursion" exec \${CONFIG_SHELL-/bin/sh} $0 $ac_configure_args --no-create --no-recursion ;; -version | --version | --versio | --versi | --vers | --ver | --ve | --v) echo "$CONFIG_STATUS generated by autoconf version 2.12" exit 0 ;; -help | --help | --hel | --he | --h) echo "\$ac_cs_usage"; exit 0 ;; *) echo "\$ac_cs_usage"; exit 1 ;; esac done ac_given_srcdir=$srcdir ac_given_INSTALL="$INSTALL" trap 'rm -fr `echo "Makefile ext/extmk.rb" | sed "s/:[^ ]*//g"` conftest*; exit 1' 1 2 15 EOF cat >> $CONFIG_STATUS < conftest.subs <<\\CEOF $ac_vpsub $extrasub s%@CFLAGS@%$CFLAGS%g s%@CPPFLAGS@%$CPPFLAGS%g s%@CXXFLAGS@%$CXXFLAGS%g s%@DEFS@%$DEFS%g s%@LDFLAGS@%$LDFLAGS%g s%@LIBS@%$LIBS%g s%@exec_prefix@%$exec_prefix%g s%@prefix@%$prefix%g s%@program_transform_name@%$program_transform_name%g s%@bindir@%$bindir%g s%@sbindir@%$sbindir%g s%@libexecdir@%$libexecdir%g s%@datadir@%$datadir%g s%@sysconfdir@%$sysconfdir%g s%@sharedstatedir@%$sharedstatedir%g s%@localstatedir@%$localstatedir%g s%@libdir@%$libdir%g s%@includedir@%$includedir%g s%@oldincludedir@%$oldincludedir%g s%@infodir@%$infodir%g s%@mandir@%$mandir%g s%@host@%$host%g s%@host_alias@%$host_alias%g s%@host_cpu@%$host_cpu%g s%@host_vendor@%$host_vendor%g s%@host_os@%$host_os%g s%@CC@%$CC%g s%@CPP@%$CPP%g s%@YACC@%$YACC%g s%@RANLIB@%$RANLIB%g s%@AR@%$AR%g s%@INSTALL_PROGRAM@%$INSTALL_PROGRAM%g s%@INSTALL_DATA@%$INSTALL_DATA%g s%@SET_MAKE@%$SET_MAKE%g s%@LIBOBJS@%$LIBOBJS%g s%@ALLOCA@%$ALLOCA%g s%@DLDFLAGS@%$DLDFLAGS%g s%@STATIC@%$STATIC%g s%@CCDLFLAGS@%$CCDLFLAGS%g s%@LDSHARED@%$LDSHARED%g s%@DLEXT@%$DLEXT%g s%@STRIP@%$STRIP%g s%@EXTSTATIC@%$EXTSTATIC%g s%@binsuffix@%$binsuffix%g s%@setup@%$setup%g s%@LIBRUBY@%$LIBRUBY%g s%@LIBRUBYARG@%$LIBRUBYARG%g s%@SOLIBS@%$SOLIBS%g s%@arch@%$arch%g CEOF EOF cat >> $CONFIG_STATUS <<\EOF # Split the substitutions into bite-sized pieces for seds with # small command number limits, like on Digital OSF/1 and HP-UX. ac_max_sed_cmds=90 # Maximum number of lines to put in a sed script. ac_file=1 # Number of current file. ac_beg=1 # First line for current file. ac_end=$ac_max_sed_cmds # Line after last line for current file. ac_more_lines=: ac_sed_cmds="" while $ac_more_lines; do if test $ac_beg -gt 1; then sed "1,${ac_beg}d; ${ac_end}q" conftest.subs > conftest.s$ac_file else sed "${ac_end}q" conftest.subs > conftest.s$ac_file fi if test ! -s conftest.s$ac_file; then ac_more_lines=false rm -f conftest.s$ac_file else if test -z "$ac_sed_cmds"; then ac_sed_cmds="sed -f conftest.s$ac_file" else ac_sed_cmds="$ac_sed_cmds | sed -f conftest.s$ac_file" fi ac_file=`expr $ac_file + 1` ac_beg=$ac_end ac_end=`expr $ac_end + $ac_max_sed_cmds` fi done if test -z "$ac_sed_cmds"; then ac_sed_cmds=cat fi EOF cat >> $CONFIG_STATUS <> $CONFIG_STATUS <<\EOF for ac_file in .. $CONFIG_FILES; do if test "x$ac_file" != x..; then # Support "outfile[:infile[:infile...]]", defaulting infile="outfile.in". case "$ac_file" in *:*) ac_file_in=`echo "$ac_file"|sed 's%[^:]*:%%'` ac_file=`echo "$ac_file"|sed 's%:.*%%'` ;; *) ac_file_in="${ac_file}.in" ;; esac # Adjust a relative srcdir, top_srcdir, and INSTALL for subdirectories. # Remove last slash and all that follows it. Not all systems have dirname. ac_dir=`echo $ac_file|sed 's%/[^/][^/]*$%%'` if test "$ac_dir" != "$ac_file" && test "$ac_dir" != .; then # The file is in a subdirectory. test ! -d "$ac_dir" && mkdir "$ac_dir" ac_dir_suffix="/`echo $ac_dir|sed 's%^\./%%'`" # A "../" for each directory in $ac_dir_suffix. ac_dots=`echo $ac_dir_suffix|sed 's%/[^/]*%../%g'` else ac_dir_suffix= ac_dots= fi case "$ac_given_srcdir" in .) srcdir=. if test -z "$ac_dots"; then top_srcdir=. else top_srcdir=`echo $ac_dots|sed 's%/$%%'`; fi ;; /*) srcdir="$ac_given_srcdir$ac_dir_suffix"; top_srcdir="$ac_given_srcdir" ;; *) # Relative path. srcdir="$ac_dots$ac_given_srcdir$ac_dir_suffix" top_srcdir="$ac_dots$ac_given_srcdir" ;; esac case "$ac_given_INSTALL" in [/$]*) INSTALL="$ac_given_INSTALL" ;; *) INSTALL="$ac_dots$ac_given_INSTALL" ;; esac echo creating "$ac_file" rm -f "$ac_file" configure_input="Generated automatically from `echo $ac_file_in|sed 's%.*/%%'` by configure." case "$ac_file" in *Makefile*) ac_comsub="1i\\ # $configure_input" ;; *) ac_comsub= ;; esac ac_file_inputs=`echo $ac_file_in|sed -e "s%^%$ac_given_srcdir/%" -e "s%:% $ac_given_srcdir/%g"` sed -e "$ac_comsub s%@configure_input@%$configure_input%g s%@srcdir@%$srcdir%g s%@top_srcdir@%$top_srcdir%g s%@INSTALL@%$INSTALL%g " $ac_file_inputs | (eval "$ac_sed_cmds") > $ac_file fi; done rm -f conftest.s* EOF cat >> $CONFIG_STATUS <> $CONFIG_STATUS <<\EOF exit 0 EOF chmod +x $CONFIG_STATUS rm -fr confdefs* $ac_clean_files test "$no_create" = yes || ${CONFIG_SHELL-/bin/sh} $CONFIG_STATUS || exit 1 ruby-1.2.3/configure.bat100755 774 145 521 6650770165 13201 0ustar matzNaCl@echo off sed -f top.sed < Makefile.in > Makefile sed -f top.sed < ext/extmk.rb.in > ext\extmk.rb copy ext\Setup.dj ext\Setup copy config_h.dj config.h if not (%OS%) == (Windows_NT) goto LFN copy missing\vsnprintf.c missing\vsnprint.c copy config_s.dj config.sta goto end :LFN copy config_s.dj config.status :end ruby-1.2.3/configure.in100644 774 145 36760 6657721750 13117 0ustar matzNaCldnl Process this file with autoconf to produce a configure script. AC_INIT(ruby.h) dnl checks for alternative programs AC_ARG_WITH(gcc, [--without-gcc never use gcc], [ case $withval in no) CC=cc without_gcc=yes;; yes) CC=gcc without_gcc=no;; *) CC=$withval without_gcc=$withval;; esac], [without_gcc=no]) dnl If the user switches compilers, we can't believe the cache if test ! -z "$ac_cv_prog_CC" -a ! -z "$CC" -a "$CC" != "$ac_cv_prog_CC" then AC_ERROR(cached CC is different -- throw away $cache_file (it is also a good idea to do 'make clean' before compiling)) fi dnl checks for thread rb_thread=yes AC_ARG_ENABLE(thread, [--disable-thread never use user-level thread], [ rb_thread=$enableval ]) if test $rb_thread = yes; then AC_DEFINE(THREAD) fi AC_CANONICAL_HOST dnl checks for fat-binary fat_binary=no AC_ARG_ENABLE( fat-binary, [--enable-fat-binary build a NeXT/Apple Multi Architecture Binary. ], [ fat_binary=$enableval ] ) if test "$fat_binary" = yes ; then AC_MSG_CHECKING( target architecture ) case "$host_os" in rhapsody*) echo -n "MacOS X Server: " if test "$TARGET_ARCHS" = "" ; then TARGET_ARCHS="ppc i386" fi ;; nextstep*|openstep*) echo -n "NeXTSTEP/OPENSTEP: " if test "$host_os" = "rhapsody" ; then echo -n "Rhapsody: " if test "$TARGET_ARCHS" = "" ; then TARGET_ARCHS="ppc i486" fi else echo -n "NeXTSTEP/OPENSTEP: " if test "$TARGET_ARCHS" = "" ; then if test `/usr/bin/arch` = "m68k" ; then TARGET_ARCHS="m68k i486" else # Black and Native one TARGET_ARCHS="m68k `/usr/bin/arch`" fi fi fi ;; esac # /usr/lib/arch_tool -archify_list $TARGET_ARCHS for archs in $TARGET_ARCHS do ARCH_FLAG="$ARCH_FLAG -arch $archs " echo -n " $archs" done AC_DEFINE( NEXT_FAT_BINARY ) echo "." fi AC_ARG_PROGRAM dnl Checks for programs. AC_PROG_CC AC_PROG_GCC_TRADITIONAL AC_PROG_YACC AC_PROG_RANLIB AC_SUBST(AR) AC_CHECK_PROGS(AR, ar aal, ar) AC_PROG_INSTALL AC_PROG_MAKE_SET # checks for UNIX variants that set C preprocessor variables AC_MINIX AC_CHECK_SIZEOF(int) AC_CHECK_SIZEOF(long) AC_CHECK_SIZEOF(void*) AC_MSG_CHECKING(for prototypes) AC_CACHE_VAL(rb_cv_have_prototypes, [AC_TRY_COMPILE([int foo(int x) { return 0; }], [return foo(10);], rb_cv_have_prototypes=yes, rb_cv_have_prototypes=no)]) AC_MSG_RESULT($rb_cv_have_prototypes) if test "$rb_cv_have_prototypes" = yes; then AC_DEFINE(HAVE_PROTOTYPES) fi AC_MSG_CHECKING(for variable length prototypes and stdarg.h) AC_CACHE_VAL(rb_cv_stdarg, [AC_TRY_COMPILE([ #include int foo(int x, ...) { va_list va; va_start(va, x); va_arg(va, int); va_arg(va, char *); va_arg(va, double); return 0; } ], [return foo(10, "", 3.14);], rb_cv_stdarg=yes, rb_cv_stdarg=no)]) AC_MSG_RESULT($rb_cv_stdarg) if test "$rb_cv_stdarg" = yes; then AC_DEFINE(HAVE_STDARG_PROTOTYPES) fi AC_MSG_CHECKING(for gcc attribute noreturn) AC_CACHE_VAL(rb_cv_have_attr_noreturn, [AC_TRY_COMPILE([void exit(int x) __attribute__ ((noreturn));], [], rb_cv_have_attr_noreturn=yes, rb_cv_have_attr_noreturn=no)]) AC_MSG_RESULT($rb_cv_have_attr_noreturn) if test "$rb_cv_have_attr_noreturn" = yes; then AC_DEFINE(HAVE_ATTR_NORETURN) fi dnl Checks for libraries. case "$host_os" in nextstep*) ;; openstep*) ;; rhapsody*) ;; human*) ;; beos*) ;; *) LIBS="-lm $LIBS";; esac AC_CHECK_LIB(crypt, crypt) AC_CHECK_LIB(dl, dlopen) # Dynamic linking for SunOS/Solaris and SYSV AC_CHECK_LIB(dld, shl_load) # Dynamic linking for HP-UX AC_CHECK_LIB(xpg4, setlocale) # FreeBSD needs this dnl Checks for header files. AC_HEADER_DIRENT AC_HEADER_STDC AC_CHECK_HEADERS(stdlib.h unistd.h limits.h sys/file.h sys/ioctl.h pwd.h \ sys/select.h sys/time.h sys/times.h sys/param.h sys/wait.h\ syscall.h a.out.h string.h utime.h memory.h direct.h) dnl Checks for typedefs, structures, and compiler characteristics. AC_TYPE_UID_T AC_TYPE_SIZE_T AC_STRUCT_ST_BLKSIZE save_LIBOJBS="$LIBOBJS" AC_STRUCT_ST_BLOCKS LIBOBJS="$save_LIBOBJS" AC_STRUCT_ST_RDEV dnl Checks for library functions. AC_TYPE_GETGROUPS AC_TYPE_SIGNAL AC_FUNC_ALLOCA AC_FUNC_VFORK AC_FUNC_MEMCMP AC_REPLACE_FUNCS(dup2 setenv memmove mkdir strcasecmp strerror strftime\ strchr strstr strtoul strdup crypt flock vsnprintf) AC_CHECK_FUNCS(fmod killpg drand48 random wait4 waitpid syscall getcwd\ truncate chsize times utimes fcntl lockf setitimer\ setruid seteuid setreuid setrgid setegid setregid\ setpgrp2 getpgid setpgid getgroups getpriority\ dlopen sigprocmask sigaction _setjmp setpgrp setsid) if test "$ac_cv_func_strftime" = no; then AC_STRUCT_TIMEZONE AC_TRY_LINK([], [extern int daylight; int i = daylight;], AC_DEFINE(HAVE_DAYLIGHT)) fi if test "$ac_cv_func_sigprocmask" = yes && test "$ac_cv_func_sigaction" = yes; then AC_DEFINE(POSIX_SIGNAL) else AC_MSG_CHECKING(for BSD signal semantics) AC_CACHE_VAL(rb_cv_bsd_signal, [AC_TRY_RUN([ #include #include void sig_handler(dummy) int dummy; { } int main() { signal(SIGINT, sig_handler); kill(getpid(), SIGINT); kill(getpid(), SIGINT); return 0; } ], rb_cv_bsd_signal=yes, rb_cv_bsd_signal=no)]) AC_MSG_RESULT($rb_cv_bsd_signal) if test "$rb_cv_bsd_signal" = yes; then AC_DEFINE(BSD_SIGNAL) fi fi if test "$ac_cv_func_setpgrp2" = yes; then AC_DEFINE(BSD_GETPGRP, getpgrp2) AC_DEFINE(BSD_SETPGRP, setpgrp2) else AC_MSG_CHECKING(whether getpgrp() has arg) AC_CACHE_VAL(rb_cv_bsdgetpgrp, [AC_TRY_COMPILE([#include ], [getpgrp(0);], rb_cv_bsdgetpgrp=yes, rb_cv_bsdgetpgrp=no)]) AC_MSG_RESULT($rb_cv_bsdgetpgrp) if test "$rb_cv_bsdgetpgrp" = yes; then AC_DEFINE(BSD_GETPGRP, getpgrp) fi AC_MSG_CHECKING(whether setpgrp() has args) AC_CACHE_VAL(rb_cv_bsdsetpgrp, [AC_TRY_COMPILE([#include ], [setpgrp(1, 1);], rb_cv_bsdsetpgrp=yes, rb_cv_bsdsetpgrp=no)]) AC_MSG_RESULT($rb_cv_bsdsetpgrp) if test "$rb_cv_bsdsetpgrp" = yes; then AC_DEFINE(BSD_SETPGRP, setpgrp) fi fi AC_C_BIGENDIAN AC_CHAR_UNSIGNED AC_MSG_CHECKING(whether right shift preserve sign bit) AC_CACHE_VAL(rb_cv_rshift_sign, [AC_TRY_RUN([ int main() { if (-1==(-1>>1)) return 0; return 1; } ], rb_cv_rshift_sign=yes, rb_cv_rshift_sign=no)]) AC_MSG_RESULT($rb_cv_rshift_sign) if test "$rb_cv_rshift_sign" = yes; then AC_DEFINE(RSHIFT(x,y), ((x)>>y)) else AC_DEFINE(RSHIFT(x,y), (((x)<0) ? ~((~(x))>>y) : (x)>>y)) fi AC_MSG_CHECKING([count field in FILE structures]) AC_CACHE_VAL(rb_cv_fcnt, [AC_TRY_COMPILE([#include ], [FILE *f = stdin; f->_cnt = 0;], rb_cv_fcnt="_cnt", ) if test "$rb_cv_fcnt" = ""; then AC_TRY_COMPILE([#include ], [FILE *f = stdin; f->__cnt = 0;], rb_cv_fcnt="__cnt", ) fi if test "$rb_cv_fcnt" = ""; then AC_TRY_COMPILE([#include ], [FILE *f = stdin; f->_r = 0;], rb_cv_fcnt="_r", ) fi if test "$rb_cv_fcnt" = ""; then AC_TRY_COMPILE([#include ], [FILE *f = stdin; f->readCount = 0;], rb_cv_fcnt="readCount", rb_cv_fcnt="not found") fi]) if test "$rb_cv_fcnt" = "not found"; then AC_MSG_RESULT([not found(OK if using GNU libc)]) else AC_MSG_RESULT($rb_cv_fcnt) AC_DEFINE_UNQUOTED(FILE_COUNT, $rb_cv_fcnt) fi dnl wheather use dln_a_out ot not AC_ARG_WITH(dln-a-out, [--with-dln-a-out use dln_a_out if possible], [ case $withval in yes) with_dln_a_out=yes;; *) with_dln_a_out=no;; esac], [with_dln_a_out=no]) case "$host_os" in linux*) AC_MSG_CHECKING(whether ELF binaries are produced) AC_CACHE_VAL(rb_cv_linux_elf, [AC_TRY_RUN([ /* Test for whether ELF binaries are produced */ #include #include main() { char buffer[4]; int i=open("conftest",O_RDONLY); if(i==-1) exit(1); /* fail */ if(read(i,&buffer[0],4)<4) exit(1); /* fail */ if(buffer[0] != 127 || buffer[1] != 'E' || buffer[2] != 'L' || buffer[3] != 'F') exit(1); /* fail */ exit(0); /* succeed (yes, it's ELF) */ } ], rb_cv_linux_elf=yes, rb_cv_linux_elf=no, [:])]) AC_MSG_RESULT($rb_cv_linux_elf) if test "$rb_cv_linux_elf" = no; then with_dln_a_out=yes host_os=linux-a.out else LDFLAGS="-rdynamic" fi;; esac AC_SUBST(DLDFLAGS)dnl AC_SUBST(STATIC)dnl AC_SUBST(CCDLFLAGS)dnl AC_SUBST(LDSHARED)dnl AC_SUBST(DLEXT)dnl STATIC= if test "$with_dln_a_out" != yes; then rb_cv_dlopen=unknown AC_MSG_CHECKING(whether OS depend dynamic link works) if test "$GCC" = yes; then case "$host_os" in nextstep*) ;; openstep*) ;; rhapsody*) ;; human*) ;; cygwin*) CCDLFLAGS=-DDLLIMPORT;; *) CCDLFLAGS=-fpic;; esac else case "$host_os" in hpux*) CCDLFLAGS='+z';; solaris*|irix*) CCDLFLAGS='-K pic' ;; sunos*) CCDLFLAGS='-pic' ;; esix*|uxpds*) CCDLFLAGS='-Kpic' ;; *) CCDLFLAGS='' ;; esac fi case "$host_os" in hpux*) DLDFLAGS="-E" LDSHARED='ld -b' LDFLAGS="-Wl,-E" rb_cv_dlopen=yes;; solaris*) LDSHARED='ld -G' rb_cv_dlopen=yes;; sunos*) LDSHARED='ld -assert nodefinitions' rb_cv_dlopen=yes;; irix*) LDSHARED='ld -ignore_unresolved' rb_cv_dlopen=yes;; sysv4*) LDSHARED='ld -G' rb_cv_dlopen=yes;; esix*|uxpds*) LDSHARED="ld -G" rb_cv_dlopen=yes ;; linux*) LDSHARED="gcc -shared" rb_cv_dlopen=yes ;; freebsd*) LDSHARED="gcc -shared" if test -x /usr/bin/objformat -a \ `/usr/bin/objformat` = "elf" ; then LDFLAGS="-rdynamic" fi rb_cv_dlopen=yes ;; netbsd*) LDSHARED="ld -Bshareable" case "$host_cpu" in alpha|mips) LDFLAGS="-export-dynamic" ;; *) ;; esac rb_cv_dlopen=yes ;; openbsd*) LDSHARED="ld -Bforcearchive -Bshareable" CCDLFLAGS=-fPIC rb_cv_dlopen=yes ;; nextstep*) LDSHARED='cc -r' LDFLAGS="-u libsys_s" DLDFLAGS="$ARCH_FLAG" rb_cv_dlopen=yes ;; openstep*) LDSHARED='cc -dynamic -bundle -undefined suppress' LDFLAGS="" DLDFLAGS="$ARCH_FLAG" rb_cv_dlopen=yes ;; rhapsody*) LDSHARED='cc -dynamic -bundle -undefined suppress' LDFLAGS="" DLDFLAGS="$ARCH_FLAG" rb_cv_dlopen=yes ;; aix*) LDSHARED='../../miniruby ../aix_ld.rb $(TARGET)' rb_cv_dlopen=yes ;; human*) DLDFLAGS='' LDSHARED='' LDFLAGS='' ;; beos*) LDSHARED="ld -xms" case "$host_cpu" in powerpc*) DLDFLAGS="-f ruby.exp -lbe -lroot glue-noinit.a init_term_dyn.o start_dyn.o" ;; *) DLDFLAGS="ruby.def -lbe -lroot glue-noinit.a init_term_dyn.o start_dyn.o" ;; esac rb_cv_dlopen=yes ;; cygwin*) LDSHARED='../../miniruby ../cygwin32_ld.rb' ;; *) LDSHARED='ld' ;; esac AC_MSG_RESULT($rb_cv_dlopen) fi dln_a_out_works=no if test "$ac_cv_header_a_out_h" = yes; then if test "$with_dln_a_out" = yes || test "$rb_cv_dlopen" = unknown; then AC_MSG_CHECKING(whether matz's dln works) cat confdefs.h > config.h AC_CACHE_VAL(rb_cv_dln_a_out, [AC_TRY_COMPILE([ #define USE_DLN_A_OUT #include "dln.c" ], [], rb_cv_dln_a_out=yes, rb_cv_dln_a_out=no)]) AC_MSG_RESULT($rb_cv_dln_a_out) if test "$rb_cv_dln_a_out" = yes; then dln_a_out_works=yes AC_DEFINE(USE_DLN_A_OUT) fi fi fi if test "$dln_a_out_works" = yes; then if test "$GCC" = yes; then STATIC=-static else STATIC=-Bstatic fi DLEXT=o AC_DEFINE(DLEXT, ".o") CCDLFLAGS= else case "$host_os" in hpux*) DLEXT=sl AC_DEFINE(DLEXT, ".sl");; nextstep*) DLEXT=o AC_DEFINE(DLEXT, ".o");; openstep*) DLEXT=bundle AC_DEFINE(DLEXT, ".bundle");; rhapsody*) DLEXT=bundle AC_DEFINE(DLEXT, ".bundle");; cygwin*) DLEXT=dll AC_DEFINE(DLEXT, ".dll");; *) DLEXT=so AC_DEFINE(DLEXT, ".so");; esac fi AC_SUBST(STRIP)dnl if test "$with_dln_a_out" = yes; then STRIP=true else STRIP=strip fi case "$host_os" in linux*) STRIP='strip -S -x';; nextstep*) STRIP='strip -A -n';; openstep*) STRIP='strip -A -n';; rhapsody*) STRIP='strip -A -n';; esac EXTSTATIC= AC_SUBST(EXTSTATIC)dnl AC_ARG_WITH(static-linked-ext, [--with-static-linked-ext link external modules statically], [case $withval in yes) STATIC= EXTSTATIC=static;; *) ;; esac]) case "$host_os" in human*) AC_CHECK_LIB(signal, _harderr) AC_CHECK_LIB(hmem, hmemset) AC_CHECK_FUNCS(select) AC_MSG_CHECKING(whether PD libc _dtos18 fail to convert big number) AC_CACHE_VAL(rb_cv_missing__dtos18, [AC_TRY_RUN( changequote(<<, >>)dnl << #include main () { char buf[256]; sprintf (buf, "%g", 1e+300); exit (strcmp (buf, "1e+300") ? 0 : 1); } >>, changequote([, ])dnl rb_cv_missing__dtos18=yes, rb_cv_missing__dtos18=no)]) AC_MSG_RESULT($rb_cv_missing__dtos18) if test "$rb_cv_missing__dtos18" = yes; then AC_DEFINE(MISSING__DTOS18) fi AC_MSG_CHECKING(whether PD libc fconvert fail to round) AC_CACHE_VAL(rb_cv_missing_fconvert, [AC_TRY_RUN( changequote(<<, >>)dnl << #include #include main () { char buf[256]; sprintf (buf, "%f", log(exp(1.0))); exit (strcmp (buf, "1.000000") ? 0 : 1); } >>, changequote([, ])dnl rb_cv_missing_fconvert=yes, rb_cv_missing_fconvert=no)]) AC_MSG_RESULT($rb_cv_missing_fconvert) if test "$rb_cv_missing_fconvert" = yes; then AC_DEFINE(MISSING_FCONVERT) fi LIBOBJS="$LIBOBJS x68.o" CFLAGS="$CFLAGS -fansi-only -cc1-stack=196608 -cpp-stack=2694144" binsuffix=.x setup=Setup.x68 ;; cygwin*) binsuffix=.exe setup=Setup ;; *) binsuffix= setup=Setup ;; esac AC_SUBST(binsuffix) AC_SUBST(setup) if test "$prefix" = NONE; then prefix=$ac_default_prefix fi if test "$fat_binary" = yes ; then CFLAGS="$CFLAGS $ARCH_FLAG" fi LIBRUBY='libruby.a' LIBRUBYARG='libruby.a' SOLIBS= if test "$host_os" = "beos"; then CFLAGS="$CFLAGS -relax_pointers" LIBRUBY='libruby.so' LIBRUBYARG='-lruby' SOLIBS='-lnet' echo creating ruby.def case "$host_cpu" in powerpc*) cp beos/ruby.def.in ruby.exp ;; *) echo EXPORTS > ruby.def cat beos/ruby.def.in >> ruby.def ;; esac fi if test "$enable_shared" = 'yes'; then LIBRUBY='libruby.so' LIBRUBYARG='-L./ -lruby' fi case "$host_os" in nextstep*) CFLAGS="$CFLAGS -pipe" ;; openstep*) CFLAGS="$CFLAGS -pipe" ;; rhasody*) CFLAGS="$CFLAGS -pipe -no-precomp" ;; *) ;; esac AC_SUBST(LIBRUBY) AC_SUBST(LIBRUBYARG) AC_SUBST(SOLIBS) ri_prefix= test "$program_prefix" != NONE && ri_prefix=$program_prefix ri_suffix= test "$program_suffix" != NONE && ri_suffix=$program_suffix RUBY_INSTALL_NAME="${ri_prefix}ruby${ri_suffix}" AC_DEFINE_UNQUOTED(RUBY_LIB, "${prefix}/lib/${RUBY_INSTALL_NAME}") AC_DEFINE_UNQUOTED(RUBY_SITE_LIB, "${prefix}/lib/${RUBY_INSTALL_NAME}/site_ruby") AC_SUBST(arch)dnl if test "$fat_binary" = yes ; then arch="fat-${host_os}" AC_DEFINE_UNQUOTED(RUBY_THIN_ARCHLIB, "${prefix}/lib/${RUBY_INSTALL_NAME}/" __ARCHITECTURE__ "-${host_os}" ) AC_DEFINE_UNQUOTED(RUBY_SITE_THIN_ARCHLIB, "${prefix}/lib/${RUBY_INSTALL_NAME}/" __ARCHITECTURE__ "-${host_os}" ) AC_DEFINE_UNQUOTED(RUBY_ARCHLIB, "${prefix}/lib/${RUBY_INSTALL_NAME}/${arch}") AC_DEFINE_UNQUOTED(RUBY_SITE_ARCHLIB, "${prefix}/lib/${RUBY_INSTALL_NAME}/site_ruby/${arch}") AC_DEFINE_UNQUOTED(RUBY_PLATFORM, __ARCHITECTURE__ "-${host_os}" ) else arch="${host_cpu}-${host_os}" AC_DEFINE_UNQUOTED(RUBY_ARCHLIB, "${prefix}/lib/${RUBY_INSTALL_NAME}/${arch}") AC_DEFINE_UNQUOTED(RUBY_SITE_ARCHLIB, "${prefix}/lib/${RUBY_INSTALL_NAME}/site_ruby/${arch}") AC_DEFINE_UNQUOTED(RUBY_PLATFORM, "${arch}") fi echo "creating config.h" cat confdefs.h > config.h AC_OUTPUT(Makefile ext/extmk.rb) ruby-1.2.3/config_h.dj100644 774 145 3165 6614113570 12636 0ustar matzNaCl#define THREAD 1 #define SIZEOF_INT 4 #define SIZEOF_LONG 4 #define SIZEOF_VOIDP 4 #define HAVE_PROTOTYPES 1 #define HAVE_STDARG_PROTOTYPES 1 #define HAVE_ATTR_NORETURN 1 #define HAVE_DIRENT_H 1 #define STDC_HEADERS 1 #define HAVE_STDLIB_H 1 #define HAVE_UNISTD_H 1 #define HAVE_LIMITS_H 1 #define HAVE_SYS_FILE_H 1 #define HAVE_SYS_IOCTL_H 1 #define HAVE_PWD_H 1 #define HAVE_SYS_TIME_H 1 #define HAVE_SYS_TIMES_H 1 #define HAVE_SYS_PARAM_H 1 #define HAVE_SYS_WAIT_H 1 #define HAVE_STRING_H 1 #define HAVE_UTIME_H 1 #define HAVE_MEMORY_H 1 #define HAVE_DIRECT_H 1 #define HAVE_ST_BLKSIZE 1 #define HAVE_ST_RDEV 1 #define GETGROUPS_T gid_t #define RETSIGTYPE void #define HAVE_ALLOCA 1 #define vfork fork #define HAVE_DUP2 1 #define HAVE_SETENV 1 #define HAVE_MEMMOVE 1 #define HAVE_MKDIR 1 #define HAVE_STRCASECMP 1 #define HAVE_STRERROR 1 #define HAVE_STRFTIME 1 #define HAVE_STRCHR 1 #define HAVE_STRSTR 1 #define HAVE_STRTOUL 1 #define HAVE_STRDUP 1 #define HAVE_FMOD 1 #define HAVE_RANDOM 1 #define HAVE_WAITPID 1 #define HAVE_GETCWD 1 #define HAVE_TRUNCATE 1 #define HAVE_CHSIZE 1 #define HAVE_TIMES 1 #define HAVE_UTIMES 1 #define HAVE_FCNTL 1 /*#define HAVE_SETITIMER 1*/ #define HAVE_GETGROUPS 1 #define HAVE_SIGPROCMASK 1 #define HAVE_SIGACTION 1 #define HAVE_SETSID 1 #define POSIX_SIGNAL 1 #define BSD_SETPGRP setpgrp #define RSHIFT(x,y) ((x)>>y) #define FILE_COUNT _cnt #define DLEXT ".o" #define RUBY_LIB "/usr/local/lib/ruby" #define RUBY_SITE_LIB "/usr/local/lib/ruby/site_ruby" #define RUBY_ARCHLIB "/usr/local/lib/ruby/i386-djgpp" #define RUBY_SITE_ARCHLIB "/usr/local/lib/ruby/site_ruby/i386-djgpp" #define RUBY_PLATFORM "i386-djgpp" ruby-1.2.3/config_s.dj100644 774 145 4652 6623735332 12661 0ustar matzNaCls%@CFLAGS@%-g -O2%g s%@CPPFLAGS@%%g s%@CXXFLAGS@%%g s%@DEFS@% -DTHREAD=1 -DSIZEOF_INT=4 -DSIZEOF_LONG=4 -DSIZEOF_VOIDP=4 -DHAVE_PROTOTYPES=1 -DHAVE_STDARG_PROTOTYPES=1 -DHAVE_ATTR_NORETURN=1 -DHAVE_DIRENT_H=1 -DSTDC_HEADERS=1 -DHAVE_STDLIB_H=1 -DHAVE_UNISTD_H=1 -DHAVE_LIMITS_H=1 -DHAVE_SYS_FILE_H=1 -DHAVE_SYS_IOCTL_H=1 -DHAVE_PWD_H=1 -DHAVE_SYS_TIME_H=1 -DHAVE_SYS_TIMES_H=1 -DHAVE_SYS_PARAM_H=1 -DHAVE_SYS_WAIT_H=1 -DHAVE_STRING_H=1 -DHAVE_UTIME_H=1 -DHAVE_MEMORY_H=1 -DHAVE_DIRECT_H=1 -DHAVE_ST_BLKSIZE=1 -DHAVE_ST_RDEV=1 -DGETGROUPS_T=gid_t -DRETSIGTYPE=void -DHAVE_ALLOCA=1 -Dvfork=fork -DHAVE_DUP2=1 -DHAVE_SETENV=1 -DHAVE_MEMMOVE=1 -DHAVE_MKDIR=1 -DHAVE_STRCASECMP=1 -DHAVE_STRERROR=1 -DHAVE_STRFTIME=1 -DHAVE_STRCHR=1 -DHAVE_STRSTR=1 -DHAVE_STRTOUL=1 -DHAVE_STRDUP=1 -DHAVE_FMOD=1 -DHAVE_RANDOM=1 -DHAVE_WAITPID=1 -DHAVE_GETCWD=1 -DHAVE_TRUNCATE=1 -DHAVE_CHSIZE=1 -DHAVE_TIMES=1 -DHAVE_UTIMES=1 -DHAVE_FCNTL=1 -DHAVE_SETITIMER=1 -DHAVE_GETGROUPS=1 -DHAVE_SIGPROCMASK=1 -DHAVE_SIGACTION=1 -DHAVE_SETSID=1 -DPOSIX_SIGNAL=1 -DBSD_SETPGRP=setpgrp -DRSHIFT=\(x,y\)\ \(\(x\)\>\>y\) -DFILE_COUNT=_cnt -DDLEXT=\".so\" -DRUBY_LIB=\"/usr/local/lib/ruby\" -DRUBY_SITE_LIB=\"/usr/local/lib/ruby/site_ruby\" -DRUBY_ARCHLIB=\"/usr/local/lib/ruby/i386-djgpp\" -DRUBY_SITE_ARCHLIB=\"/usr/local/lib/ruby/site_ruby/i386-djgpp\" -DRUBY_PLATFORM=\"i386-djgpp\" %g s%@LDFLAGS@%%g s%@LIBS@%-lm %g s%@exec_prefix@%${prefix}%g s%@prefix@%/usr/local%g s%@program_transform_name@%s,x,x,%g s%@bindir@%${exec_prefix}/bin%g s%@sbindir@%${exec_prefix}/sbin%g s%@libexecdir@%${exec_prefix}/libexec%g s%@datadir@%${prefix}/share%g s%@sysconfdir@%${prefix}/etc%g s%@sharedstatedir@%${prefix}/com%g s%@localstatedir@%${prefix}/var%g s%@libdir@%${exec_prefix}/lib%g s%@includedir@%${prefix}/include%g s%@oldincludedir@%/usr/include%g s%@infodir@%${prefix}/info%g s%@mandir@%${prefix}/man%g s%@host@%i386-pc-djgpp%g s%@host_alias@%i386-djgpp%g s%@host_cpu@%i386%g s%@host_vendor@%pc%g s%@host_os@%djgpp%g s%@CC@%gcc%g s%@CPP@%gcc -E%g s%@YACC@%bison -y%g s%@RANLIB@%ranlib%g s%@AR@%ar%g s%@INSTALL_PROGRAM@%${INSTALL}%g s%@INSTALL_DATA@%${INSTALL} -m 644%g s%@SET_MAKE@%%g s%@LIBOBJS@% crypt.o flock.o snprintf.o%g s%@ALLOCA@%%g s%@DLDFLAGS@%%g s%@STATIC@%%g s%@CCDLFLAGS@%%g s%@LDSHARED@%ld%g s%@DLEXT@%o%g s%@STRIP@%strip%g s%@EXTSTATIC@%%g s%@binsuffix@%.exe%g s%@setup@%Setup%g s%@LIBRUBY@%libruby.a%g s%@LIBRUBYARG@%libruby.a%g s%@SOLIBS@%%g s%@arch@%i386-djgpp%g s%@srcdir%.%g ac_given_srcdir=. ruby-1.2.3/config.guess100755 774 145 63364 6646702032 13114 0ustar matzNaCl#! /bin/sh # Attempt to guess a canonical system name. # Copyright (C) 1992, 93, 94, 95, 96, 97, 1998 Free Software Foundation, Inc. # # This file 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 of the License, 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Written by Per Bothner . # The master version of this file is at the FSF in /home/gd/gnu/lib. # # This script attempts to guess a canonical system name similar to # config.sub. If it succeeds, it prints the system name on stdout, and # exits with 0. Otherwise, it exits with 1. # # The plan is that this can be called by configure scripts if you # don't specify an explicit system type (host/target name). # # Only a few systems have been added to this list; please add others # (but try to keep the structure clean). # # Modified for Human68k by K.Okabe 1997.07.09 # Last change: 1997.07.09 case "$KSH_VERSION" in *X6*) echo m68k-sharp-human exit 0 ;; *) ;; esac # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 8/24/94.) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown trap 'rm -f dummy.c dummy.o dummy; exit 1' 1 2 15 # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in alpha:OSF1:*:*) if test $UNAME_RELEASE = "V4.0"; then UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` fi # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. cat <dummy.s .globl main .ent main main: .frame \$30,0,\$26,0 .prologue 0 .long 0x47e03d80 # implver $0 lda \$2,259 .long 0x47e20c21 # amask $2,$1 srl \$1,8,\$2 sll \$2,2,\$2 sll \$0,3,\$0 addl \$1,\$0,\$0 addl \$2,\$0,\$0 ret \$31,(\$26),1 .end main EOF ${CC-cc} dummy.s -o dummy 2>/dev/null if test "$?" = 0 ; then ./dummy case "$?" in 7) UNAME_MACHINE="alpha" ;; 15) UNAME_MACHINE="alphaev5" ;; 14) UNAME_MACHINE="alphaev56" ;; 10) UNAME_MACHINE="alphapca56" ;; 16) UNAME_MACHINE="alphaev6" ;; esac fi rm -f dummy.s dummy echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[VTX]//' | tr [[A-Z]] [[a-z]]` exit 0 ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit 0 ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-cbm-sysv4 exit 0;; amiga:NetBSD:*:*) echo m68k-cbm-netbsd${UNAME_RELEASE} exit 0 ;; amiga:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit 0 ;; arc64:OpenBSD:*:*) echo mips64el-unknown-openbsd${UNAME_RELEASE} exit 0 ;; arc:OpenBSD:*:*) echo mipsel-unknown-openbsd${UNAME_RELEASE} exit 0 ;; hkmips:OpenBSD:*:*) echo mips-unknown-openbsd${UNAME_RELEASE} exit 0 ;; pmax:OpenBSD:*:*) echo mipsel-unknown-openbsd${UNAME_RELEASE} exit 0 ;; sgi:OpenBSD:*:*) echo mips-unknown-openbsd${UNAME_RELEASE} exit 0 ;; wgrisc:OpenBSD:*:*) echo mipsel-unknown-openbsd${UNAME_RELEASE} exit 0 ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit 0;; arm32:NetBSD:*:*) echo arm-unknown-netbsd`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` exit 0 ;; SR2?01:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit 0;; Pyramid*:OSx*:*:*|MIS*:OSx*:*:*|MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit 0 ;; NILE:*:*:dcosx) echo pyramid-pyramid-svr4 exit 0 ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; i86pc:SunOS:5.*:*) echo i386-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit 0 ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit 0 ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(head -1 /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit 0 ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit 0 ;; atari*:NetBSD:*:*) echo m68k-atari-netbsd${UNAME_RELEASE} exit 0 ;; atari*:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; sun3*:NetBSD:*:*) echo m68k-sun-netbsd${UNAME_RELEASE} exit 0 ;; sun3*:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; mac68k:NetBSD:*:*) echo m68k-apple-netbsd${UNAME_RELEASE} exit 0 ;; mac68k:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; mvme68k:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; mvme88k:OpenBSD:*:*) echo m88k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit 0 ;; macppc:NetBSD:*:*) echo powerpc-apple-netbsd${UNAME_RELEASE} exit 0 ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit 0 ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit 0 ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit 0 ;; 2020:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit 0 ;; mips:*:*:UMIPS | mips:*:*:RISCos) sed 's/^ //' << EOF >dummy.c int main (argc, argv) int argc; char **argv; { #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF ${CC-cc} dummy.c -o dummy \ && ./dummy `echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` \ && rm dummy.c dummy && exit 0 rm -f dummy.c dummy echo mips-mips-riscos${UNAME_RELEASE} exit 0 ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit 0 ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit 0 ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit 0 ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit 0 ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 -o $UNAME_PROCESSOR = mc88110 ] ; then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx \ -o ${TARGET_BINARY_INTERFACE}x = x ] ; then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit 0 ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit 0 ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit 0 ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit 0 ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit 0 ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit 0 ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit 0 ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i?86:AIX:*:*) echo i386-ibm-aix exit 0 ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then sed 's/^ //' << EOF >dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF ${CC-cc} dummy.c -o dummy && ./dummy && rm dummy.c dummy && exit 0 rm -f dummy.c dummy echo rs6000-ibm-aix3.2.5 elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit 0 ;; *:AIX:*:4) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | head -1 | awk '{ print $1 }'` if /usr/sbin/lsattr -EHl ${IBM_CPU_ID} | grep POWER >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=4.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit 0 ;; *:AIX:*:*) echo rs6000-ibm-aix exit 0 ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit 0 ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC NetBSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit 0 ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit 0 ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit 0 ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit 0 ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit 0 ;; 9000/[34678]??:HP-UX:*:*) case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/6?? | 9000/7?? | 9000/80[24] | 9000/8?[13679] | 9000/892 ) sed 's/^ //' << EOF >dummy.c #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (${CC-cc} dummy.c -o dummy 2>/dev/null ) && HP_ARCH=`./dummy` rm -f dummy.c dummy esac HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit 0 ;; 3050*:HI-UX:*:*) sed 's/^ //' << EOF >dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF ${CC-cc} dummy.c -o dummy && ./dummy && rm dummy.c dummy && exit 0 rm -f dummy.c dummy echo unknown-hitachi-hiuxwe2 exit 0 ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit 0 ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit 0 ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit 0 ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit 0 ;; i?86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit 0 ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit 0 ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit 0 ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit 0 ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit 0 ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit 0 ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit 0 ;; CRAY*X-MP:*:*:*) echo xmp-cray-unicos exit 0 ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} exit 0 ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ exit 0 ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} exit 0 ;; CRAY-2:*:*:*) echo cray2-cray-unicos exit 0 ;; F300:UNIX_System_V:*:*) FUJITSU_SYS=`uname -p | tr [A-Z] [a-z] | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "f300-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit 0 ;; F301:UNIX_System_V:*:*) echo f301-fujitsu-uxpv`echo $UNAME_RELEASE | sed 's/ .*//'` exit 0 ;; hp3[0-9][05]:NetBSD:*:*) echo m68k-hp-netbsd${UNAME_RELEASE} exit 0 ;; hp300:OpenBSD:*:*) echo m68k-unknown-openbsd${UNAME_RELEASE} exit 0 ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit 0 ;; i?86:BSD/386:*:* | i?86:BSD/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit 0 ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit 0 ;; *:FreeBSD:*:*) echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit 0 ;; *:NetBSD:*:*) echo ${UNAME_MACHINE}-unknown-netbsd`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` exit 0 ;; *:OpenBSD:*:*) echo ${UNAME_MACHINE}-unknown-openbsd`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` exit 0 ;; *:*:*BOW*:*) echo i386-pc-bow exit 0 ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit 0 ;; i*:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit 0 ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit 0 ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; *:GNU:*:*) echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit 0 ;; *:Linux:*:*) # uname on the ARM produces all sorts of strangeness, and we need to # filter it out. case "$UNAME_MACHINE" in arm* | sa110*) UNAME_MACHINE="arm" ;; esac # The BFD linker knows what the default object file format is, so # first see if it will tell us. ld_help_string=`ld --help 2>&1` ld_supported_emulations=`echo $ld_help_string \ | sed -ne '/supported emulations:/!d s/[ ][ ]*/ /g s/.*supported emulations: *// s/ .*// p'` case "$ld_supported_emulations" in i?86linux) echo "${UNAME_MACHINE}-pc-linux-aout" ; exit 0 ;; i?86coff) echo "${UNAME_MACHINE}-pc-linux-coff" ; exit 0 ;; sparclinux) echo "${UNAME_MACHINE}-unknown-linux-aout" ; exit 0 ;; m68klinux) echo "${UNAME_MACHINE}-unknown-linux-aout" ; exit 0 ;; elf32ppc) echo "powerpc-unknown-linux" ; exit 0 ;; esac if test "${UNAME_MACHINE}" = "alpha" ; then sed 's/^ //' <dummy.s .globl main .ent main main: .frame \$30,0,\$26,0 .prologue 0 .long 0x47e03d80 # implver $0 lda \$2,259 .long 0x47e20c21 # amask $2,$1 srl \$1,8,\$2 sll \$2,2,\$2 sll \$0,3,\$0 addl \$1,\$0,\$0 addl \$2,\$0,\$0 ret \$31,(\$26),1 .end main EOF LIBC="" ${CC-cc} dummy.s -o dummy 2>/dev/null if test "$?" = 0 ; then ./dummy case "$?" in 7) UNAME_MACHINE="alpha" ;; 15) UNAME_MACHINE="alphaev5" ;; 14) UNAME_MACHINE="alphaev56" ;; 10) UNAME_MACHINE="alphapca56" ;; 16) UNAME_MACHINE="alphaev6" ;; esac objdump --private-headers dummy | \ grep ld.so.1 > /dev/null if test "$?" = 0 ; then LIBC="libc1" fi fi rm -f dummy.s dummy echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC} ; exit 0 elif test "${UNAME_MACHINE}" = "mips" ; then cat >dummy.c </dev/null && ./dummy "${UNAME_MACHINE}" && rm dummy.c dummy && exit 0 rm -f dummy.c dummy else case "${UNAME_MACHINE}" in i?86) VENDOR=pc; ;; *) VENDOR=unknown; ;; esac echo ${UNAME_MACHINE}-${VENDOR}-linux exit 0 fi ;; # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. earlier versions # are messed up and put the nodename in both sysname and nodename. i?86:DYNIX/ptx:4*:*) echo i386-sequent-sysv4 exit 0 ;; i?86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit 0 ;; i?86:*:4.*:* | i?86:SYSTEM_V:4.*:*) if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_RELEASE} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_RELEASE} fi exit 0 ;; i?86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|egrep Release|sed -e 's/.*= //')` (/bin/uname -X|egrep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|egrep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit 0 ;; i?86:UnixWare:*:*) if /bin/uname -X 2>/dev/null >/dev/null ; then (/bin/uname -X|egrep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 fi echo ${UNAME_MACHINE}-unixware-${UNAME_RELEASE}-${UNAME_VERSION} exit 0 ;; pc:*:*:*) # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i386. echo i386-pc-msdosdjgpp exit 0 ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit 0 ;; paragon:*:*:*) echo i860-intel-osf1 exit 0 ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit 0 ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit 0 ;; M68*:*:R3V[567]*:*) test -r /sysV68 && echo 'm68k-motorola-sysv' && exit 0 ;; 3[34]??:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 4850:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && echo i486-ncr-sysv4.3${OS_REL} && exit 0 /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && echo i586-ncr-sysv4.3${OS_REL} && exit 0 ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && echo i486-ncr-sysv4 && exit 0 ;; m68*:LynxOS:2.*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit 0 ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit 0 ;; i?86:LynxOS:2.*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit 0 ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit 0 ;; rs6000:LynxOS:2.*:* | PowerPC:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit 0 ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit 0 ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit 0 ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit 0 ;; PENTIUM:CPunix:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit 0 ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit 0 ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit 0 ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit 0 ;; news*:NEWS-OS:*:6*) echo mips-sony-newsos6 exit 0 ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R4000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv`echo ${UNAME_RELEASE} | sed -n 's/\([.0-9]*\).*/\1/p'` else echo mips-unknown-sysv${UNAME_RELEASE} fi exit 0 ;; DS/90*:*:*:V20*) echo sparc-fujitsu-uxpds exit 0 ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit 0 ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit 0 ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit 0 ;; *:Rhapsody:*:*) arch=`/usr/bin/arch` case "$arch" in ppc) echo powerpc-apple-rhapsody${UNAME_RELEASE} ;; i[3456]86) echo i386-apple-rhapsody${UNAME_RELEASE} ;; *) echo $arch-apple-rhapsody${UNAME_RELEASE} ;; esac exit 0 ;; esac #echo '(No uname command or uname output not recognized.)' 1>&2 #echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 cat >dummy.c < # include #endif main () { #if defined (sony) #if defined (MIPSEB) /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, I don't know.... */ printf ("mips-sony-bsd\n"); exit (0); #else #include printf ("m68k-sony-newsos%s\n", #ifdef NEWSOS4 "4" #else "" #endif ); exit (0); #endif #endif #if defined (__arm) && defined (__acorn) && defined (__unix) printf ("arm-acorn-riscix"); exit (0); #endif #if defined (hp300) && !defined (hpux) printf ("m68k-hp-bsd\n"); exit (0); #endif #if defined (NeXT) #if !defined (__ARCHITECTURE__) #define __ARCHITECTURE__ "m68k" #endif int version; version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; if (version < 4) printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); else printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-pc-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) struct utsname un; uname(&un); if (strncmp(un.version, "V2", 2) == 0) { printf ("i386-sequent-ptx2\n"); exit (0); } if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ printf ("i386-sequent-ptx1\n"); exit (0); } printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) #if !defined (ultrix) printf ("vax-dec-bsd\n"); exit (0); #else printf ("vax-dec-ultrix\n"); exit (0); #endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF ${CC-cc} dummy.c -o dummy 2>/dev/null && ./dummy && rm dummy.c dummy && exit 0 rm -f dummy.c dummy # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit 0; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit 0 ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit 0 ;; c34*) echo c34-convex-bsd exit 0 ;; c38*) echo c38-convex-bsd exit 0 ;; c4*) echo c4-convex-bsd exit 0 ;; esac fi #echo '(Unable to guess system type)' 1>&2 exit 1 ruby-1.2.3/config.sub100755 774 145 46762 6644610226 12563 0ustar matzNaCl#! /bin/sh # Configuration validation subroutine script, version 1.1. # Copyright (C) 1991, 92-97, 1998 Free Software Foundation, Inc. # This file is (in principle) common to ALL GNU software. # The presence of a machine in this file suggests that SOME GNU software # can handle that machine. It does not imply ALL GNU software can. # # This file 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 of the License, 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., 59 Temple Place - Suite 330, # Boston, MA 02111-1307, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. if [ x$1 = x ] then echo Configuration name missing. 1>&2 echo "Usage: $0 CPU-MFR-OPSYS" 1>&2 echo "or $0 ALIAS" 1>&2 echo where ALIAS is a recognized configuration type. 1>&2 exit 1 fi # First pass through any local machine types. case $1 in *local*) echo $1 exit 0 ;; *) ;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in linux-gnu*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple) os= basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco5) os=sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. tahoe | i860 | m32r | m68k | m68000 | m88k | ns32k | arc | arm \ | arme[lb] | pyramid | mn10200 | mn10300 | tron | a29k \ | 580 | i960 | h8300 | hppa | hppa1.0 | hppa1.1 | hppa2.0 \ | alpha | alphaev5 | alphaev56 | we32k | ns16k | clipper \ | i370 | sh | powerpc | powerpcle | 1750a | dsp16xx | pdp11 \ | mips64 | mipsel | mips64el | mips64orion | mips64orionel \ | mipstx39 | mipstx39el \ | sparc | sparclet | sparclite | sparc64 | v850) basic_machine=$basic_machine-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i[34567]86) basic_machine=$basic_machine-pc ;; i[3456]86-TOWNS*) basic_machine=`echo $basic_machine | sed -e 's/-TOWNS.*/-TOWNS/'` ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. vax-* | tahoe-* | i[34567]86-* | i860-* | m32r-* | m68k-* | m68000-* \ | m88k-* | sparc-* | ns32k-* | fx80-* | arc-* | arm-* | c[123]* \ | mips-* | pyramid-* | tron-* | a29k-* | romp-* | rs6000-* \ | power-* | none-* | 580-* | cray2-* | h8300-* | i960-* \ | xmp-* | ymp-* | hppa-* | hppa1.0-* | hppa1.1-* | hppa2.0-* \ | alpha-* | alphaev5-* | alphaev56-* | we32k-* | cydra-* \ | ns16k-* | pn-* | np1-* | xps100-* | clipper-* | orion-* \ | sparclite-* | pdp11-* | sh-* | powerpc-* | powerpcle-* \ | sparc64-* | mips64-* | mipsel-* \ | mips64el-* | mips64orion-* | mips64orionel-* \ | mipstx39-* | mipstx39el-* \ | f301-*) ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-cbm ;; amigaos | amigados) basic_machine=m68k-cbm os=-amigaos ;; amigaunix | amix) basic_machine=m68k-cbm os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | ymp) basic_machine=ymp-cray os=-unicos ;; cray2) basic_machine=cray2-cray os=-unicos ;; [ctj]90-cray) basic_machine=c90-cray os=-unicos ;; crds | unos) basic_machine=m68k-crds ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k7[0-9][0-9] | hp7[0-9][0-9] | hp9k8[0-9]7 | hp8[0-9]7) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; i370-ibm* | ibm*) basic_machine=i370-ibm os=-mvs ;; # I'm not sure what "Sysv32" means. Should this be sysv3.2? i[34567]86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i[34567]86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i[34567]86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i[34567]86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; miniframe) basic_machine=m68000-convergent ;; mipsel*-linux*) basic_machine=mipsel-unknown os=-linux ;; mips*-linux*) basic_machine=mips-unknown os=-linux ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; np1) basic_machine=np1-gould ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pentium | p5 | k5 | nexen) basic_machine=i586-pc ;; pentiumpro | p6 | k6 | 6x86) basic_machine=i686-pc ;; pentiumii | pentium2) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | nexen-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | k6-* | 6x86-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=rs6000-ibm ;; ppc) basic_machine=powerpc-unknown ;; ppc-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; symmetry) basic_machine=i386-sequent os=-dynix ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; tower | tower-32) basic_machine=m68k-ncr ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; xmp) basic_machine=xmp-cray os=-unicos ;; xps | xps100) basic_machine=xps100-honeywell ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. mips) if [ x$os = x-linux ]; then basic_machine=mips-unknown else basic_machine=mips-mips fi ;; romp) basic_machine=romp-ibm ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sparc) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; human) basic_machine=m68k-sharp os=-human ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -netbsd* | -openbsd* | -freebsd* | -riscix* \ | -lynxos* | -bosx* | -nextstep* | -cxux* | -aout* | -elf* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -linux* | -uxpv* | -beos*) # Remember, each alternative MUST END IN *, to match a version number. ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -ctix* | -uts*) os=-sysv ;; -ns2 ) os=-nextstep2 ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -xenix) os=-xenix ;; -uxpds) os=-uxpds ;; -human) ;; -beos) os=-beos ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in *-acorn) os=-riscix1.2 ;; arm*-semi) os=-aout ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 # This also exists in the configure program, but was not the # default. # os=-sunos4 ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-ibm) os=-aix ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f301-fujitsu) os=-uxpv ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -aix*) vendor=ibm ;; -hpux*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs*) vendor=ibm ;; -ptx*) vendor=sequent ;; -vxsim* | -vxworks*) vendor=wrs ;; -aux*) vendor=apple ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os ruby-1.2.3/defines.h100644 774 145 2267 6621530724 12335 0ustar matzNaCl/************************************************ defines.h - $Author: matz $ $Date: 1998/11/09 09:11:48 $ created at: Wed May 18 00:21:44 JST 1994 ************************************************/ #ifndef DEFINES_H #define DEFINES_H #define RUBY /* define RUBY_USE_EUC/SJIS for default kanji-code */ #if defined(MSDOS) || defined(__CYGWIN32__) || defined(__human68k__) || defined(__MACOS__) #undef RUBY_USE_EUC #define RUBY_USE_SJIS #else #define RUBY_USE_EUC #undef RUBY_USE_SJIS #endif #ifdef NeXT #define DYNAMIC_ENDIAN /* determine endian at runtime */ #ifndef __APPLE__ #define S_IXUSR _S_IXUSR /* execute/search permission, owner */ #endif #define S_IXGRP 0000010 /* execute/search permission, group */ #define S_IXOTH 0000001 /* execute/search permission, other */ #endif /* NeXT */ #ifdef NT #include "missing/nt.h" #endif #ifndef EXTERN #define EXTERN extern #endif #ifdef sparc #define FLUSH_REGISTER_WINDOWS asm("ta 3") #else #define FLUSH_REGISTER_WINDOWS /* empty */ #endif #if defined(__human68k__) || defined(__CYGWIN32__) #undef HAVE_RANDOM #undef HAVE_SETITIMER #endif #ifndef RUBY_PLATFORM #define RUBY_PLATFORM "unknown-unknown" #endif #endif ruby-1.2.3/dir.c100644 774 145 20674 6621530724 11513 0ustar matzNaCl/************************************************ dir.c - $Author: matz $ $Date: 1998/11/09 09:11:48 $ created at: Wed Jan 5 09:51:01 JST 1994 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include #include #ifdef HAVE_SYS_PARAM_H # include #else # define MAXPATHLEN 1024 #endif #ifdef HAVE_UNISTD_H #include #endif #if HAVE_DIRENT_H # include # define NAMLEN(dirent) strlen((dirent)->d_name) #elif HAVE_DIRECT_H # include # define NAMLEN(dirent) strlen((dirent)->d_name) #else # define dirent direct # define NAMLEN(dirent) (dirent)->d_namlen # if HAVE_SYS_NDIR_H # include # endif # if HAVE_SYS_DIR_H # include # endif # if HAVE_NDIR_H # include # endif # if defined(NT) && defined(_MSC_VER) # include "missing/dir.h" # endif #endif #include #ifndef NT char *getenv(); #endif #ifdef USE_CWGUSI # include #endif static VALUE cDir; static void free_dir(dir) DIR *dir; { if (dir) closedir(dir); } static VALUE dir_close _((VALUE)); static VALUE dir_s_open(dir_class, dirname) VALUE dir_class, dirname; { VALUE obj; DIR *dirp; Check_SafeStr(dirname); dirp = opendir(RSTRING(dirname)->ptr); if (dirp == NULL) { if (errno == EMFILE || errno == ENFILE) { gc_gc(); dirp = opendir(RSTRING(dirname)->ptr); } if (dirp == NULL) { rb_sys_fail(RSTRING(dirname)->ptr); } } obj = Data_Wrap_Struct(dir_class, 0, free_dir, dirp); if (iterator_p()) { return rb_ensure(rb_yield, obj, dir_close, obj); } return obj; } static void dir_closed() { Fail("closed directory"); } #define GetDIR(obj, dirp) {\ Data_Get_Struct(obj, DIR, dirp);\ if (dirp == NULL) dir_closed();\ } static VALUE dir_read(dir) VALUE dir; { DIR *dirp; struct dirent *dp; GetDIR(dir, dirp); errno = 0; dp = readdir(dirp); if (dp) return str_taint(str_new(dp->d_name, NAMLEN(dp))); else if (errno == 0) { /* end of stream */ return Qnil; } else { rb_sys_fail(0); } } static VALUE dir_each(dir) VALUE dir; { DIR *dirp; struct dirent *dp; VALUE file; GetDIR(dir, dirp); for (dp = readdir(dirp); dp != NULL; dp = readdir(dirp)) { file = str_taint(str_new(dp->d_name, NAMLEN(dp))); rb_yield(file); } return dir; } static VALUE dir_tell(dir) VALUE dir; { DIR *dirp; int pos; #if !defined(__CYGWIN32__) && !defined(__BEOS__) GetDIR(dir, dirp); pos = telldir(dirp); return int2inum(pos); #else rb_notimplement(); #endif } static VALUE dir_seek(dir, pos) VALUE dir, pos; { DIR *dirp; #if !defined(__CYGWIN32__) && !defined(__BEOS__) GetDIR(dir, dirp); seekdir(dirp, NUM2INT(pos)); return dir; #else rb_notimplement(); #endif } static VALUE dir_rewind(dir) VALUE dir; { DIR *dirp; GetDIR(dir, dirp); rewinddir(dirp); return dir; } static VALUE dir_close(dir) VALUE dir; { DIR *dirp; Data_Get_Struct(dir, DIR, dirp); if (dirp == NULL) dir_closed(); closedir(dirp); DATA_PTR(dir) = NULL; return Qnil; } static VALUE dir_s_chdir(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE path; char *dist = ""; rb_secure(2); if (rb_scan_args(argc, argv, "01", &path) == 1) { Check_SafeStr(path); dist = RSTRING(path)->ptr; } else { dist = getenv("HOME"); if (!dist) { dist = getenv("LOGDIR"); } } if (chdir(dist) < 0) rb_sys_fail(dist); return INT2FIX(0); } static VALUE dir_s_getwd(dir) VALUE dir; { char path[MAXPATHLEN]; #ifdef HAVE_GETCWD if (getcwd(path, sizeof(path)) == 0) rb_sys_fail(path); #else extern char *getwd(); if (getwd(path) == 0) rb_sys_fail(path); #endif return str_taint(str_new2(path)); } static VALUE dir_s_chroot(dir, path) VALUE dir, path; { #if !defined(DJGPP) && !defined(NT) && !defined(__human68k__) && !defined(USE_CWGUSI) && !defined(__BEOS__) rb_secure(2); Check_SafeStr(path); if (chroot(RSTRING(path)->ptr) == -1) rb_sys_fail(RSTRING(path)->ptr); return INT2FIX(0); #else rb_notimplement(); #endif } static VALUE dir_s_mkdir(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE path, vmode; int mode; rb_secure(2); if (rb_scan_args(argc, argv, "11", &path, &vmode) == 2) { mode = NUM2INT(vmode); } else { mode = 0777; } Check_SafeStr(path); #if !defined(NT) && !defined(USE_CWGUSI) if (mkdir(RSTRING(path)->ptr, mode) == -1) rb_sys_fail(RSTRING(path)->ptr); #else if (mkdir(RSTRING(path)->ptr) == -1) rb_sys_fail(RSTRING(path)->ptr); #endif return INT2FIX(0); } static VALUE dir_s_rmdir(obj, dir) VALUE obj, dir; { rb_secure(2); Check_SafeStr(dir); if (rmdir(RSTRING(dir)->ptr) < 0) rb_sys_fail(RSTRING(dir)->ptr); return TRUE; } #define isdelim(c) ((c)==' '||(c)=='\t'||(c)=='\n'||(c)=='\0') char **glob_filename(); extern char *glob_error_return; static void push_globs(ary, s) VALUE ary; char *s; { char **fnames, **ff; fnames = glob_filename(s); if (fnames == (char**)-1) rb_sys_fail(s); ff = fnames; while (*ff) { ary_push(ary, str_taint(str_new2(*ff))); free(*ff); ff++; } if (fnames != &glob_error_return) { free(fnames); } } static void push_braces(ary, s) VALUE ary; char *s; { char buf[MAXPATHLEN]; char *p, *t, *b; char *lbrace, *rbrace; p = s; lbrace = rbrace = 0; while (*p) { if (*p == '{') { lbrace = p; break; } p++; } while (*p) { if (*p == '}' && lbrace) { rbrace = p; break; } p++; } if (lbrace) { memcpy(buf, s, lbrace-s); b = buf + (lbrace-s); p = lbrace; while (*p != '}') { t = p + 1; for (p = t; *p!='}' && *p!=','; p++) { /* skip inner braces */ if (*p == '{') while (*p!='}') p++; } memcpy(b, t, p-t); strcpy(b+(p-t), rbrace+1); push_braces(ary, buf); } } else { push_globs(ary, s); } } static VALUE dir_s_glob(dir, str) VALUE dir, str; { char *p, *pend; char buf[MAXPATHLEN]; char *t, *t0; int nest; VALUE ary; Check_SafeStr(str); if (RSTRING(str)->len > MAXPATHLEN) { ArgError("pathname too long (%d bytes)", RSTRING(str)->len); } ary = ary_new(); p = RSTRING(str)->ptr; pend = p + RSTRING(str)->len; while (p < pend) { t = buf; while (p < pend && isdelim(*p)) p++; while (p < pend && !isdelim(*p)) { *t++ = *p++; } *t = '\0'; t0 = buf; nest = 0; while (t0 < t) { if (*t0 == '{') nest+=2; if (*t0 == '}') nest+=3; t0++; } if (nest == 0) { push_globs(ary, buf); } else if (nest % 5 == 0) { push_braces(ary, buf); } /* else unmatched braces */ } return ary; } static VALUE dir_foreach(io, dirname) VALUE io, dirname; { VALUE dir; dir = rb_funcall(cDir, rb_intern("open"), 1, dirname); return rb_ensure(dir_each, dir, dir_close, dir); } static VALUE dir_entries(io, dirname) VALUE io, dirname; { VALUE dir; dir = rb_funcall(cDir, rb_intern("open"), 1, dirname); return rb_ensure(rb_Array, dir, dir_close, dir); } void Init_Dir() { cDir = rb_define_class("Dir", cObject); rb_include_module(cDir, mEnumerable); rb_define_singleton_method(cDir, "new", dir_s_open, 1); rb_define_singleton_method(cDir, "open", dir_s_open, 1); rb_define_singleton_method(cDir, "foreach", dir_foreach, 1); rb_define_singleton_method(cDir, "entries", dir_entries, 1); rb_define_method(cDir,"read", dir_read, 0); rb_define_method(cDir,"each", dir_each, 0); rb_define_method(cDir,"rewind", dir_rewind, 0); rb_define_method(cDir,"tell", dir_tell, 0); rb_define_method(cDir,"seek", dir_seek, 1); rb_define_method(cDir,"close", dir_close, 0); rb_define_singleton_method(cDir,"chdir", dir_s_chdir, -1); rb_define_singleton_method(cDir,"getwd", dir_s_getwd, 0); rb_define_singleton_method(cDir,"pwd", dir_s_getwd, 0); rb_define_singleton_method(cDir,"chroot", dir_s_chroot, 1); rb_define_singleton_method(cDir,"mkdir", dir_s_mkdir, -1); rb_define_singleton_method(cDir,"rmdir", dir_s_rmdir, 1); rb_define_singleton_method(cDir,"delete", dir_s_rmdir, 1); rb_define_singleton_method(cDir,"unlink", dir_s_rmdir, 1); rb_define_singleton_method(cDir,"glob", dir_s_glob, 1); rb_define_singleton_method(cDir,"[]", dir_s_glob, 1); } ruby-1.2.3/dln.c100644 774 145 107653 6657725621 11550 0ustar matzNaCl/************************************************ dln.c - $Author: matz $ $Date: 1999/02/09 03:29:21 $ created at: Tue Jan 18 17:05:06 JST 1994 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "config.h" #include "defines.h" #include "dln.h" char *dln_argv0; #ifdef _AIX #pragma alloca #endif #if defined(HAVE_ALLOCA_H) && !defined(__GNUC__) #include #endif #ifdef HAVE_STRING_H # include #else # include #endif void *xmalloc(); void *xcalloc(); void *xrealloc(); #include #ifndef NT # ifndef USE_CWGUSI # include # endif #else #include "missing/file.h" #endif #include #include #ifdef HAVE_SYS_PARAM_H # include #else # define MAXPATHLEN 1024 #endif #ifdef HAVE_UNISTD_H # include #endif #ifndef NT char *strdup(); char *getenv(); #endif #ifdef __MACOS__ # include # include # include #endif #ifdef __BEOS__ # include #endif int eaccess(); #if defined(HAVE_DLOPEN) && !defined(USE_DLN_A_OUT) && !defined(__CYGWIN32__) && !defined(_AIX) /* dynamic load with dlopen() */ # define USE_DLN_DLOPEN #endif #ifndef FUNCNAME_PATTERN # if defined(__hp9000s300) || ( defined(__NetBSD__) && (!defined(__alpha__) && !defined(__mips__))) || defined(__BORLANDC__) || (defined(__FreeBSD__) && __FreeBSD__ < 3) || defined(NeXT) || defined(__WATCOMC__) # define FUNCNAME_PATTERN "_Init_%.200s" # else # define FUNCNAME_PATTERN "Init_%.200s" # endif #endif static void init_funcname(buf, file) char *buf, *file; { char *p, *slash; /* Load the file as an object one */ for (p = file, slash = p-1; *p; p++) /* Find position of last '/' */ #ifdef __MACOS__ if (*p == ':') slash = p; #else if (*p == '/') slash = p; #endif sprintf(buf, FUNCNAME_PATTERN, slash + 1); for (p = buf; *p; p++) { /* Delete suffix it it exists */ if (*p == '.') { *p = '\0'; break; } } } #ifdef USE_DLN_A_OUT #ifndef LIBC_NAME # define LIBC_NAME "libc.a" #endif #ifndef DLN_DEFAULT_LIB_PATH # define DLN_DEFAULT_LIB_PATH "/lib:/usr/lib:/usr/local/lib:." #endif #include static int dln_errno; #define DLN_ENOEXEC ENOEXEC /* Exec format error */ #define DLN_ECONFL 201 /* Symbol name conflict */ #define DLN_ENOINIT 202 /* No inititalizer given */ #define DLN_EUNDEF 203 /* Undefine symbol remains */ #define DLN_ENOTLIB 204 /* Not a library file */ #define DLN_EBADLIB 205 /* Malformed library file */ #define DLN_EINIT 206 /* Not initialized */ static int dln_init_p = 0; #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 load_lib(); static int load_header(fd, hdrp, disp) int fd; struct exec *hdrp; long disp; { int size; lseek(fd, disp, 0); size = read(fd, hdrp, sizeof(struct exec)); if (size == -1) { dln_errno = errno; return -1; } if (size != sizeof(struct exec) || N_BADMAG(*hdrp)) { dln_errno = DLN_ENOEXEC; return -1; } return 0; } #if defined(sequent) #define RELOC_SYMBOL(r) ((r)->r_symbolnum) #define RELOC_MEMORY_SUB_P(r) ((r)->r_bsr) #define RELOC_PCREL_P(r) ((r)->r_pcrel || (r)->r_bsr) #define RELOC_TARGET_SIZE(r) ((r)->r_length) #endif /* Default macros */ #ifndef RELOC_ADDRESS #define RELOC_ADDRESS(r) ((r)->r_address) #define RELOC_EXTERN_P(r) ((r)->r_extern) #define RELOC_SYMBOL(r) ((r)->r_symbolnum) #define RELOC_MEMORY_SUB_P(r) 0 #define RELOC_PCREL_P(r) ((r)->r_pcrel) #define RELOC_TARGET_SIZE(r) ((r)->r_length) #endif #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) #endif #if defined(sequent) #define R_SYMBOL(r) ((r)->r_symbolnum) #define R_MEMORY_SUB(r) ((r)->r_bsr) #define R_PCREL(r) ((r)->r_pcrel || (r)->r_bsr) #define R_LENGTH(r) ((r)->r_length) #endif #ifndef R_SYMBOL # define R_SYMBOL(r) ((r)->r_symbolnum) # define R_MEMORY_SUB(r) 0 # define R_PCREL(r) ((r)->r_pcrel) # define R_LENGTH(r) ((r)->r_length) #endif static struct relocation_info * 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 * 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; 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 * 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_strtable(); if (tbl == NULL) { dln_errno = errno; return NULL; } while (sym < end) { st_insert(tbl, sym->n_un.n_name, sym); sym++; } return tbl; } static int dln_init(prog) char *prog; { char *file; int fd; struct exec hdr; struct nlist *syms; if (dln_init_p == 1) return 0; file = dln_find_exe(prog, NULL); if (file == NULL || (fd = open(file, O_RDONLY)) < 0) { dln_errno = errno; return -1; } if (load_header(fd, &hdr, 0) == -1) return -1; syms = load_sym(fd, &hdr, 0); if (syms == NULL) { close(fd); return -1; } sym_tbl = 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'; return dln_init(buf); } dln_init_p = 1; undef_tbl = st_init_strtable(); close(fd); return 0; err_noexec: close(fd); dln_errno = DLN_ENOEXEC; return -1; } static long 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 void dln_print_undef() { fprintf(stderr, " Undefined symbols:\n"); st_foreach(undef_tbl, undef_print, NULL); } static void dln_undefined() { if (undef_tbl->num_entries > 0) { fprintf(stderr, "dln: Calling undefined function\n"); dln_print_undef(); rb_exit(1); } } 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_numtable(); } 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 */ if (R_MEMORY_SUB(&(undef->reloc))) *address = datum - *address; else *address = undef->u.c + datum; break; case 1: /* word */ if (R_MEMORY_SUB(&(undef->reloc))) *(short*)address = datum - *(short*)address; else *(short*)address = undef->u.s + datum; break; case 2: /* long */ if (R_MEMORY_SUB(&(undef->reloc))) *(long*)address = datum - *(long*)address; else *(long*)address = undef->u.l + datum; break; } #endif free(undef->name); free(undef); return ST_DELETE; } static void 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); } #ifdef N_INDR struct indr_data { char *name0, *name1; }; static int reloc_repl(no, undef, data) int no; struct undef *undef; struct indr_data *data; { if (strcmp(data->name0, undef->name) == 0) { free(undef->name); undef->name = strdup(data->name1); } return ST_CONTINUE; } #endif static int load_1(fd, disp, need_init) int fd; long disp; char *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; char buf[256]; if (load_header(fd, &hdr, disp) == -1) return -1; if (INVALID_OBJECT(hdr)) { dln_errno = DLN_ENOEXEC; return -1; } reloc = load_reloc(fd, &hdr, disp); if (reloc == NULL) return -1; syms = 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; #ifdef N_INDR if (sym->n_type == (N_INDR | N_EXT)) { char *key = sym->n_un.n_name; if (st_lookup(sym_tbl, sym[1].n_un.n_name, &old_sym)) { if (st_delete(undef_tbl, &key, NULL)) { unlink_undef(key, old_sym->n_value); free(key); } } else { struct indr_data data; data.name0 = sym->n_un.n_name; data.name1 = sym[1].n_un.n_name; st_foreach(reloc_tbl, reloc_repl, &data); st_insert(undef_tbl, strdup(sym[1].n_un.n_name), NULL); if (st_delete(undef_tbl, &key, NULL)) { free(key); } } sym += 2; continue; } #endif 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 = 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); break; case N_TEXT: case N_DATA: sym->n_value += block; break; } 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)) { 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) { int len; char **libs_to_be_linked = 0; if (undef_tbl->num_entries > 0) { if (load_lib(libc) == -1) goto err_exit; } init_funcname(buf, need_init); len = strlen(buf); for (sym = syms; symn_un.n_name; if (name[0] == '_' && sym->n_value >= block) { if (strcmp(name+1, "libs_to_be_linked") == 0) { libs_to_be_linked = (char**)sym->n_value; } else if (strcmp(name+1, buf) == 0) { init_p = 1; ((int (*)())sym->n_value)(); } } } if (libs_to_be_linked && undef_tbl->num_entries > 0) { while (*libs_to_be_linked) { load_lib(*libs_to_be_linked); libs_to_be_linked++; } } } free(reloc); free(syms); if (need_init) { if (init_p == 0) { dln_errno = DLN_ENOINIT; return -1; } if (undef_tbl->num_entries > 0) { if (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((char*)block); return -1; } static int target_offset; static int search_undef(key, value, lib_tbl) char *key; int value; st_table *lib_tbl; { int offset; if (st_lookup(lib_tbl, key, &offset) == 0) return ST_CONTINUE; target_offset = offset; return ST_STOP; } struct symdef { int str_index; int lib_offset; }; char *dln_library_path = DLN_DEFAULT_LIB_PATH; static int 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; if (lib[0] == '-' && lib[1] == 'l') { char *p = alloca(strlen(lib) + 4); sprintf(p, "lib%s.a", lib+2); lib = p; } /* 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 (size == -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) { /* make hash table from __.SYMDEF */ lib_tbl = st_init_strtable(); 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 (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 (load_header(fd, &hdr, offset) == -1) goto badlib; syms = 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 (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; } static int load(file) char *file; { int fd; int result; if (dln_init_p == 0) { if (dln_init(dln_argv0) == -1) return -1; } result = strlen(file); if (file[result-1] == 'a') { return load_lib(file); } fd = open(file, O_RDONLY); if (fd == -1) { dln_errno = errno; return -1; } result = load_1(fd, 0, file); close(fd); return result; } void* dln_sym(name) char *name; { struct nlist *sym; if (st_lookup(sym_tbl, name, &sym)) return (void*)sym->n_value; return NULL; } #endif /* USE_DLN_A_OUT */ #ifdef USE_DLN_DLOPEN # ifdef __NetBSD__ # include # include # else # include # endif #endif #ifdef hpux #include #include "dl.h" #endif #ifdef _AIX #include /* for isdigit() */ #include /* for global errno */ #include #endif #ifdef NeXT #if NS_TARGET_MAJOR < 4 #include #else #include #endif #endif #ifdef _WIN32 #include #endif static char * dln_strerror() { #ifdef USE_DLN_A_OUT 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); } #endif #ifdef USE_DLN_DLOPEN return (char*)dlerror(); #endif #ifdef _WIN32 static char message[1024]; int error = GetLastError(); char *p = message; p += sprintf(message, "%d: ", error); FormatMessage( FORMAT_MESSAGE_FROM_SYSTEM, NULL, error, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), p, sizeof message - strlen(message), NULL); for (p = message; *p; p++) { if (*p == '\n' || *p == '\r') *p = ' '; } return message; #endif } #ifdef _AIX static void aix_loaderror(char *pathname) { char *message[8], errbuf[1024]; int i,j; struct errtab { int errno; char *errstr; } load_errtab[] = { {L_ERROR_TOOMANY, "too many errors, rest skipped."}, {L_ERROR_NOLIB, "can't load library:"}, {L_ERROR_UNDEF, "can't find symbol in library:"}, {L_ERROR_RLDBAD, "RLD index out of range or bad relocation type:"}, {L_ERROR_FORMAT, "not a valid, executable xcoff file:"}, {L_ERROR_MEMBER, "file not an archive or does not contain requested member:"}, {L_ERROR_TYPE, "symbol table mismatch:"}, {L_ERROR_ALIGN, "text allignment in file is wrong."}, {L_ERROR_SYSTEM, "System error:"}, {L_ERROR_ERRNO, NULL} }; #define LOAD_ERRTAB_LEN (sizeof(load_errtab)/sizeof(load_errtab[0])) #define ERRBUF_APPEND(s) strncat(errbuf, s, sizeof(errbuf)-strlen(errbuf)-1) sprintf(errbuf, "load failed - %.200s ", pathname); if (!loadquery(1, &message[0], sizeof(message))) ERRBUF_APPEND(strerror(errno)); for(i = 0; message[i] && *message[i]; i++) { int nerr = atoi(message[i]); for (j=0; j 2 && fname[1] == ':') return fname; if (strncmp(".\\", fname, 2) == 0 || strncmp("..\\", fname, 3) == 0) return fname; if (exe_flag && strchr(fname, '\\')) return fname; #endif #endif /* __MACOS__ */ for (dp = path;; dp = ++ep) { register int l; int i; int fspace; /* extract a component */ #if !defined(MSDOS) && !defined(NT) && !defined(__human68k__) && !defined(__MACOS__) ep = strchr(dp, ':'); #else ep = strchr(dp, ';'); #endif 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 || #if defined(MSDOS) || defined(NT) || defined(__human68k__) dp[1] == '\\' || #endif 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] != '/') #ifdef __MACOS__ *bp++ = ':'; #else *bp++ = '/'; #endif } /* 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 */ if (eaccess(fbuf, X_OK) == 0) return fbuf; } #if defined(MSDOS) || defined(NT) || defined(__human68k__) if (exe_flag) { static const char *extension[] = { #if defined(MSDOS) ".com", ".exe", ".bat", #if defined(DJGPP) ".btm", ".sh", ".ksh", ".pl", ".sed", #endif #else ".r", ".R", ".x", ".X", ".bat", ".BAT", #endif (char *) NULL }; int j; for (j = 0; extension[j]; j++) { if (fspace < strlen(extension[j])) { fprintf(stderr, "openpath: pathname too long (ignored)\n"); fprintf(stderr, "\tDirectory \"%.*s\"\n", (int) (bp - fbuf), fbuf); fprintf(stderr, "\tFile \"%s%s\"\n", fname, extension[j]); continue; } strcpy(bp + i, extension[j]); if (stat(fbuf, &st) == 0) return fbuf; } } #endif /* MSDOS or NT or __human68k__ */ /* if not, and no other alternatives, life is bleak */ if (*ep == '\0') { return NULL; } /* otherwise try the next component in the search path */ } } ruby-1.2.3/dln.h100644 774 145 1001 6507153672 11464 0ustar matzNaCl/************************************************ dln.h - $Author: matz $ $Revision: 1.1.1.1.4.2 $ $Date: 1998/03/28 10:57:39 $ created at: Wed Jan 19 16:53:09 JST 1994 ************************************************/ #ifndef DLN_H #define DLN_H #ifndef _ #ifndef __STDC__ # define _(args) () #else # define _(args) args #endif #endif char *dln_find_exe _((char*,char*)); char *dln_find_file _((char*,char*)); #ifdef USE_DLN_A_OUT extern char *dln_argv0; #endif void dln_load _((char*)); #endif ruby-1.2.3/dmyext.c100644 774 145 24 6457557633 12171 0ustar matzNaClvoid Init_ext() { } ruby-1.2.3/enum.c100644 774 145 14454 6621530724 11700 0ustar matzNaCl/************************************************ enum.c - $Author: matz $ $Date: 1998/11/09 09:11:48 $ created at: Fri Oct 1 15:15:19 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" VALUE mEnumerable; static ID id_each, id_eqq, id_cmp; VALUE rb_each(obj) VALUE obj; { return rb_funcall(obj, id_each, 0, 0); } static VALUE grep_i(i, arg) VALUE i, *arg; { if (RTEST(rb_funcall(arg[0], id_eqq, 1, i))) { ary_push(arg[1], i); } return Qnil; } static VALUE grep_iter_i(i, pat) VALUE i, pat; { if (RTEST(rb_funcall(pat, id_eqq, 1, i))) { rb_yield(i); } return Qnil; } static VALUE enum_grep(obj, pat) VALUE obj, pat; { if (iterator_p()) { rb_iterate(rb_each, obj, grep_iter_i, pat); return obj; } else { VALUE tmp, arg[2]; arg[0] = pat; arg[1] = tmp = ary_new(); rb_iterate(rb_each, obj, grep_i, (VALUE)arg); return tmp; } } struct find_arg { int found; VALUE val; }; static VALUE find_i(i, arg) VALUE i; struct find_arg *arg; { if (RTEST(rb_yield(i))) { arg->found = TRUE; arg->val = i; rb_iter_break(); } return Qnil; } static VALUE enum_find(argc, argv, obj) int argc; VALUE* argv; VALUE obj; { struct find_arg arg; VALUE if_none; rb_scan_args(argc, argv, "01", &if_none); arg.found = FALSE; rb_iterate(rb_each, obj, find_i, (VALUE)&arg); if (arg.found) { return arg.val; } if (!NIL_P(if_none)) { rb_eval_cmd(if_none, Qnil); } return Qnil; } static VALUE find_all_i(i, tmp) VALUE i, tmp; { if (RTEST(rb_yield(i))) { ary_push(tmp, i); } return Qnil; } static VALUE enum_find_all(obj) VALUE obj; { VALUE tmp; tmp = ary_new(); rb_iterate(rb_each, obj, find_all_i, tmp); return tmp; } static VALUE collect_i(i, tmp) VALUE i, tmp; { ary_push(tmp, rb_yield(i)); return Qnil; } static VALUE enum_collect(obj) VALUE obj; { VALUE tmp; tmp = ary_new(); rb_iterate(rb_each, obj, collect_i, tmp); return tmp; } static VALUE reverse_i(i, tmp) VALUE i, tmp; { ary_unshift(tmp, i); return Qnil; } static VALUE enum_reverse(obj) VALUE obj; { VALUE tmp; tmp = ary_new(); rb_iterate(rb_each, obj, reverse_i, tmp); return tmp; } static VALUE enum_all(i, ary) VALUE i, ary; { ary_push(ary, i); return Qnil; } static VALUE enum_to_a(obj) VALUE obj; { VALUE ary; ary = ary_new(); rb_iterate(rb_each, obj, enum_all, ary); return ary; } static VALUE enum_sort(obj) VALUE obj; { return ary_sort(enum_to_a(obj)); } static VALUE min_i(i, min) VALUE i, *min; { VALUE cmp; if (NIL_P(*min)) *min = i; else { cmp = rb_funcall(i, id_cmp, 1, *min); if (FIX2LONG(cmp) < 0) *min = i; } return Qnil; } static VALUE min_ii(i, min) VALUE i, *min; { VALUE cmp; if (NIL_P(*min)) *min = i; else { cmp = rb_yield(assoc_new(i, *min)); if (FIX2LONG(cmp) < 0) *min = i; } return Qnil; } static VALUE enum_min(obj) VALUE obj; { VALUE min = Qnil; rb_iterate(rb_each, obj, iterator_p()?min_ii:min_i, (VALUE)&min); return min; } static VALUE max_i(i, max) VALUE i, *max; { VALUE cmp; if (NIL_P(*max)) *max = i; else { cmp = rb_funcall(i, id_cmp, 1, *max); if (FIX2LONG(cmp) > 0) *max = i; } return Qnil; } static VALUE max_ii(i, max) VALUE i, *max; { VALUE cmp; if (NIL_P(*max)) *max = i; else { cmp = rb_yield(assoc_new(i, *max)); if (FIX2LONG(cmp) > 0) *max = i; } return Qnil; } static VALUE enum_max(obj) VALUE obj; { VALUE max = Qnil; rb_iterate(rb_each, obj, iterator_p()?max_ii:max_i, (VALUE)&max); return max; } struct i_v_pair { int i; VALUE v; int found; }; static VALUE index_i(item, iv) VALUE item; struct i_v_pair *iv; { if (rb_equal(item, iv->v)) { iv->found = 1; rb_iter_break(); } else { iv->i++; } return Qnil; } static VALUE enum_index(obj, val) VALUE obj, val; { struct i_v_pair iv; iv.i = 0; iv.v = val; iv.found = 0; rb_iterate(rb_each, obj, index_i, (VALUE)&iv); if (iv.found) return INT2FIX(iv.i); return Qnil; /* not found */ } static VALUE member_i(item, iv) VALUE item; struct i_v_pair *iv; { if (rb_equal(item, iv->v)) { iv->i = 1; rb_iter_break(); } return Qnil; } static VALUE enum_member(obj, val) VALUE obj, val; { struct i_v_pair iv; iv.i = 0; iv.v = val; rb_iterate(rb_each, obj, member_i, (VALUE)&iv); if (iv.i) return TRUE; return FALSE; } static VALUE length_i(i, length) VALUE i; int *length; { (*length)++; return Qnil; } VALUE enum_length(obj) VALUE obj; { int length = 0; rb_iterate(rb_each, obj, length_i, (VALUE)&length); return INT2FIX(length); } static VALUE each_with_index_i(val, indexp) VALUE val; int *indexp; { rb_yield(assoc_new(val, INT2FIX(*indexp))); (*indexp)++; return Qnil; } VALUE enum_each_with_index(obj) VALUE obj; { int index = 0; rb_iterate(rb_each, obj, each_with_index_i, (VALUE)&index); return Qnil; } void Init_Enumerable() { mEnumerable = rb_define_module("Enumerable"); rb_define_method(mEnumerable,"to_a", enum_to_a, 0); rb_define_method(mEnumerable,"entries", enum_to_a, 0); rb_define_method(mEnumerable,"sort", enum_sort, 0); rb_define_method(mEnumerable,"grep", enum_grep, 1); rb_define_method(mEnumerable,"find", enum_find, -1); rb_define_method(mEnumerable,"find_all", enum_find_all, 0); rb_define_method(mEnumerable,"collect", enum_collect, 0); rb_define_method(mEnumerable,"reverse", enum_reverse, 0); rb_define_method(mEnumerable,"min", enum_min, 0); rb_define_method(mEnumerable,"max", enum_max, 0); rb_define_method(mEnumerable,"index", enum_index, 1); rb_define_method(mEnumerable,"member?", enum_member, 1); rb_define_method(mEnumerable,"include?", enum_member, 1); rb_define_method(mEnumerable,"length", enum_length, 0); rb_define_method(mEnumerable,"size", enum_length, 0); rb_define_method(mEnumerable,"each_with_index", enum_each_with_index, 0); id_eqq = rb_intern("==="); id_each = rb_intern("each"); id_cmp = rb_intern("<=>"); } ruby-1.2.3/env.h100644 774 145 1612 6502173253 11477 0ustar matzNaCl/************************************************ env.h - $Author: matz $ $Revision: 1.1.1.2.2.2 $ $Date: 1998/03/13 09:04:28 $ created at: Mon Jul 11 11:53:03 JST 1994 ************************************************/ #ifndef ENV_H #define ENV_H extern struct FRAME { VALUE self; int argc; VALUE *argv; ID last_func; VALUE last_class; VALUE cbase; struct FRAME *prev; char *file; int line; int iter; } *the_frame; void gc_mark_frame _((struct FRAME *)); extern struct SCOPE { struct RBasic super; ID *local_tbl; VALUE *local_vars; int flag; } *the_scope; #define SCOPE_ALLOCA 0 #define SCOPE_MALLOC 1 #define SCOPE_NOSTACK 2 extern int rb_in_eval; extern VALUE the_class; struct RVarmap { struct RBasic super; ID id; VALUE val; struct RVarmap *next; }; extern struct RVarmap *the_dyna_vars; #endif /* ENV_H */ ruby-1.2.3/error.c100644 774 145 54332 6657725621 12077 0ustar matzNaCl/************************************************ error.c - $Author: matz $ $Date: 1999/02/09 03:29:21 $ created at: Mon Aug 9 16:11:34 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "env.h" #include #ifdef HAVE_STDARG_PROTOTYPES #include #define va_init_list(a,b) va_start(a,b) #else #include #define va_init_list(a,b) va_start(a) #endif #ifdef USE_CWGUSI #include int sys_nerr = 256; #endif extern char *sourcefile; extern int sourceline; int nerrs; static void err_snprintf(buf, len, fmt, args) char *buf, *fmt; int len; va_list args; { if (!sourcefile) { vsnprintf(buf, len, fmt, args); } else { int n = snprintf(buf, len, "%s:%d: ", sourcefile, sourceline); if (len > n) { vsnprintf((char*)buf+n, len-n, fmt, args); } } } static void err_append _((char*)); static void err_print(fmt, args) char *fmt; va_list args; { char buf[BUFSIZ]; err_snprintf(buf, BUFSIZ, fmt, args); err_append(buf); } void #ifdef HAVE_STDARG_PROTOTYPES Error(char *fmt, ...) #else Error(fmt, va_alist) char *fmt; va_dcl #endif { va_list args; va_init_list(args, fmt); err_print(fmt, args); va_end(args); nerrs++; } void #ifdef HAVE_STDARG_PROTOTYPES Error_Append(char *fmt, ...) #else Error_Append(fmt, va_alist) char *fmt; va_dcl #endif { va_list args; char buf[BUFSIZ]; va_init_list(args, fmt); vsnprintf(buf, BUFSIZ, fmt, args); va_end(args); err_append(buf); } void #ifdef HAVE_STDARG_PROTOTYPES Warn(char *fmt, ...) #else Warn(fmt, va_alist) char *fmt; va_dcl #endif { char buf[BUFSIZ]; va_list args; snprintf(buf, BUFSIZ, "warning: %s", fmt); va_init_list(args, fmt); err_print(buf, args); va_end(args); } /* Warning() reports only in verbose mode */ void #ifdef HAVE_STDARG_PROTOTYPES Warning(char *fmt, ...) #else Warning(fmt, va_alist) char *fmt; va_dcl #endif { char buf[BUFSIZ]; va_list args; if (!RTEST(verbose)) return; snprintf(buf, BUFSIZ, "warning: %s", fmt); va_init_list(args, fmt); err_print(buf, args); va_end(args); } void #ifdef HAVE_STDARG_PROTOTYPES Bug(char *fmt, ...) #else Bug(fmt, va_alist) char *fmt; va_dcl #endif { char buf[BUFSIZ]; va_list args; snprintf(buf, BUFSIZ, "[BUG] %s", fmt); rb_in_eval = 0; va_init_list(args, fmt); err_print(buf, args); va_end(args); abort(); } static struct types { int type; char *name; } builtin_types[] = { T_NIL, "nil", T_OBJECT, "Object", T_CLASS, "Class", T_ICLASS, "iClass", /* internal use: mixed-in module holder */ T_MODULE, "Module", T_FLOAT, "Float", T_STRING, "String", T_REGEXP, "Regexp", T_ARRAY, "Array", T_FIXNUM, "Fixnum", T_HASH, "Hash", T_STRUCT, "Struct", T_BIGNUM, "Bignum", T_FILE, "File", T_TRUE, "TRUE", T_FALSE, "FALSE", T_DATA, "Data", /* internal use: wrapped C pointers */ T_MATCH, "Match", /* data of $~ */ T_VARMAP, "Varmap", /* internal use: dynamic variables */ T_SCOPE, "Scope", /* internal use: variable scope */ T_NODE, "Node", /* internal use: syntax tree node */ -1, 0, }; void rb_check_type(x, t) VALUE x; int t; { struct types *type = builtin_types; int tt = TYPE(x); if (tt != t) { while (type->type >= 0) { if (type->type == t) { char *etype; if (NIL_P(x)) { etype = "nil"; } else if (FIXNUM_P(x)) { etype = "Fixnum"; } else if (rb_special_const_p(x)) { etype = RSTRING(obj_as_string(x))->ptr; } else { etype = rb_class2name(CLASS_OF(x)); } TypeError("wrong argument type %s (expected %s)", etype, type->name); } type++; } Bug("unknown type 0x%x", t); } } /* exception classes */ #include VALUE eException; VALUE eSystemExit, eInterrupt, eFatal; VALUE eStandardError; VALUE eRuntimeError; VALUE eSyntaxError; VALUE eTypeError; VALUE eArgError; VALUE eNameError; VALUE eIndexError; VALUE eLoadError; VALUE eSecurityError; VALUE eNotImpError; VALUE eSystemCallError; VALUE mErrno; VALUE exc_new(etype, ptr, len) VALUE etype; char *ptr; unsigned len; { VALUE exc = obj_alloc(etype); rb_iv_set(exc, "mesg", str_new(ptr, len)); return exc; } VALUE exc_new2(etype, s) VALUE etype; char *s; { return exc_new(etype, s, strlen(s)); } VALUE exc_new3(etype, str) VALUE etype, str; { char *s; int len; s = str2cstr(str, &len); return exc_new(etype, s, len); } static VALUE exc_initialize(argc, argv, exc) int argc; VALUE *argv; VALUE exc; { VALUE mesg; if (rb_scan_args(argc, argv, "01", &mesg) == 0) { mesg = str_new(0, 0); } else { STR2CSTR(mesg); /* ensure mesg can be converted to String */ } rb_iv_set(exc, "mesg", mesg); return exc; } static VALUE exc_new_method(argc, argv, self) int argc; VALUE *argv; VALUE self; { VALUE etype, exc; if (argc == 1 && self == argv[0]) return self; etype = CLASS_OF(self); while (FL_TEST(etype, FL_SINGLETON)) { etype = RCLASS(etype)->super; } exc = obj_alloc(etype); obj_call_init(exc); return exc; } static VALUE exc_to_s(exc) VALUE exc; { return rb_iv_get(exc, "mesg"); } static VALUE exc_inspect(exc) VALUE exc; { VALUE str, klass; klass = CLASS_OF(exc); exc = obj_as_string(exc); if (RSTRING(exc)->len == 0) { return str_dup(rb_class_path(klass)); } str = str_new2("#<"); klass = rb_class_path(klass); str_concat(str, klass); str_cat(str, ":", 1); str_concat(str, exc); str_cat(str, ">", 1); return str; } static VALUE exc_backtrace(exc) VALUE exc; { return rb_iv_get(exc, "bt"); } static VALUE check_backtrace(bt) VALUE bt; { int i; static char *err = "backtrace must be Array of String"; if (!NIL_P(bt)) { int t = TYPE(bt); if (t == T_STRING) return ary_new3(1, bt); if (t != T_ARRAY) { TypeError(err); } for (i=0;ilen;i++) { if (TYPE(RARRAY(bt)->ptr[i]) != T_STRING) { TypeError(err); } } } return bt; } static VALUE exc_set_backtrace(exc, bt) VALUE exc; { return rb_iv_set(exc, "bt", check_backtrace(bt)); } static VALUE exception(argc, argv) int argc; VALUE *argv; { VALUE v = Qnil; VALUE etype = eStandardError; int i; ID id; if (argc == 0) { ArgError("wrong # of arguments"); } Warn("Exception() is now obsolete"); if (TYPE(argv[argc-1]) == T_CLASS) { etype = argv[argc-1]; argc--; if (!rb_funcall(etype, '<', 1, eException)) { TypeError("exception should be subclass of Exception"); } } for (i=0; i> 12) & 0xf; offset = (i >> 8) & 0xf; if (offset < syserr_index[ix].n) { ix = syserr_index[ix].ix; if ((i & 0xff) < syserr_list[ix + offset].n) { list = syserr_list[ix + offset].list; list[i & 0xff] = error; rb_global_variable(&list[i & 0xff]); } } #else if (i <= sys_nerr) { syserr_list[i] = error; } #endif return error; } static VALUE syserr_errno(self) VALUE self; { return rb_iv_get(self, "errno"); } #ifdef __BEOS__ static VALUE get_syserr(int i) { VALUE *list; int ix, offset; i -= B_GENERAL_ERROR_BASE; ix = (i >> 12) & 0xf; offset = (i >> 8) & 0xf; if (offset < syserr_index[ix].n) { ix = syserr_index[ix].ix; if ((i & 0xff) < syserr_list[ix + offset].n) { list = syserr_list[ix + offset].list; return list[i & 0xff]; } } return 0; } #endif /* __BEOS__ */ static void init_syserr _((void)); void Init_Exception() { eException = rb_define_class("Exception", cObject); rb_define_method(eException, "new", exc_new_method, -1); rb_define_method(eException, "initialize", exc_initialize, -1); rb_define_method(eException, "to_s", exc_to_s, 0); rb_define_method(eException, "to_str", exc_to_s, 0); rb_define_method(eException, "message", exc_to_s, 0); rb_define_method(eException, "inspect", exc_inspect, 0); rb_define_method(eException, "backtrace", exc_backtrace, 0); rb_define_method(eException, "set_backtrace", exc_set_backtrace, 1); eSystemExit = rb_define_class("SystemExit", eException); eFatal = rb_define_class("fatal", eException); eInterrupt = rb_define_class("Interrupt", eException); eStandardError = rb_define_class("StandardError", eException); eSyntaxError = rb_define_class("SyntaxError", eStandardError); eTypeError = rb_define_class("TypeError", eStandardError); eArgError = rb_define_class("ArgumentError", eStandardError); eNameError = rb_define_class("NameError", eStandardError); eIndexError = rb_define_class("IndexError", eStandardError); eLoadError = rb_define_class("LoadError", eStandardError); eRuntimeError = rb_define_class("RuntimeError", eStandardError); eSecurityError = rb_define_class("SecurityError", eStandardError); eNotImpError = rb_define_class("NotImplementError", eException); init_syserr(); rb_define_global_function("Exception", exception, -1); } #define RAISE_ERROR(klass,fmt) {\ va_list args;\ char buf[BUFSIZ];\ va_init_list(args,fmt);\ vsnprintf(buf, BUFSIZ, fmt, args);\ va_end(args);\ rb_raise(exc_new2(klass, buf));\ } void #ifdef HAVE_STDARG_PROTOTYPES Raise(VALUE exc, char *fmt, ...) #else Raise(exc, fmt, va_alist) VALUE exc; char *fmt; va_dcl #endif { RAISE_ERROR(exc, fmt); } void #ifdef HAVE_STDARG_PROTOTYPES TypeError(char *fmt, ...) #else TypeError(fmt, va_alist) char *fmt; va_dcl #endif { RAISE_ERROR(eTypeError, fmt); } void #ifdef HAVE_STDARG_PROTOTYPES ArgError(char *fmt, ...) #else ArgError(fmt, va_alist) char *fmt; va_dcl #endif { RAISE_ERROR(eArgError, fmt); } void #ifdef HAVE_STDARG_PROTOTYPES NameError(char *fmt, ...) #else NameError(fmt, va_alist) char *fmt; va_dcl #endif { RAISE_ERROR(eNameError, fmt); } void #ifdef HAVE_STDARG_PROTOTYPES IndexError(char *fmt, ...) #else IndexError(fmt, va_alist) char *fmt; va_dcl #endif { RAISE_ERROR(eIndexError, fmt); } void #ifdef HAVE_STDARG_PROTOTYPES Fail(char *fmt, ...) #else Fail(fmt, va_alist) char *fmt; va_dcl #endif { RAISE_ERROR(eRuntimeError, fmt); } void rb_notimplement() { Raise(eNotImpError, "The %s() function is unimplemented on this machine", rb_id2name(the_frame->last_func)); } void #ifdef HAVE_STDARG_PROTOTYPES LoadError(char *fmt, ...) #else LoadError(fmt, va_alist) char *fmt; va_dcl #endif { RAISE_ERROR(eLoadError, fmt); } void #ifdef HAVE_STDARG_PROTOTYPES Fatal(char *fmt, ...) #else Fatal(fmt, va_alist) char *fmt; va_dcl #endif { va_list args; char buf[BUFSIZ]; va_init_list(args, fmt); vsnprintf(buf, BUFSIZ, fmt, args); va_end(args); rb_in_eval = 0; rb_fatal(exc_new2(eFatal, buf)); } void rb_sys_fail(mesg) char *mesg; { #ifndef NT char *strerror(); #endif char *err; char *buf; extern int errno; int n = errno; VALUE ee; err = strerror(errno); if (mesg) { buf = ALLOCA_N(char, strlen(err)+strlen(mesg)+4); sprintf(buf, "%s - %s", err, mesg); } else { buf = ALLOCA_N(char, strlen(err)+1); strcpy(buf, err); } errno = 0; #ifdef __BEOS__ ee = get_syserr(n); if (!ee) { char name[6]; sprintf(name, "E%03d", n); ee = set_syserr(n, name); } #else # ifdef USE_CWGUSI if (n < 0) { int macoserr_index = sys_nerr - 1; if (!syserr_list[macoserr_index]) { char name[6]; sprintf(name, "E%03d", macoserr_index); ee = set_syserr(macoserr_index, name); } } else #endif /* USE_CWGUSI */ if (n > sys_nerr || !syserr_list[n]) { char name[6]; sprintf(name, "E%03d", n); ee = set_syserr(n, name); } else { ee = syserr_list[n]; } ee = exc_new2(ee, buf); #endif rb_iv_set(ee, "errno", INT2FIX(n)); rb_raise(ee); } static void init_syserr() { #ifdef __BEOS__ int i, ix, offset; #endif eSystemCallError = rb_define_class("SystemCallError", eStandardError); rb_define_method(eSystemCallError, "errno", syserr_errno, 0); mErrno = rb_define_module("Errno"); #ifdef __BEOS__ for (i = 0; syserr_index[i].n != 0; i++) { ix = syserr_index[i].ix; for (offset = 0; offset < syserr_index[i].n; offset++) { MEMZERO(syserr_list[ix + offset].list, VALUE, syserr_list[ix + offset].n); } } #else syserr_list = ALLOC_N(VALUE, sys_nerr+1); MEMZERO(syserr_list, VALUE, sys_nerr+1); #endif #ifdef EPERM set_syserr(EPERM, "EPERM"); #endif #ifdef ENOENT set_syserr(ENOENT, "ENOENT"); #endif #ifdef ESRCH set_syserr(ESRCH, "ESRCH"); #endif #ifdef EINTR set_syserr(EINTR, "EINTR"); #endif #ifdef EIO set_syserr(EIO, "EIO"); #endif #ifdef ENXIO set_syserr(ENXIO, "ENXIO"); #endif #ifdef E2BIG set_syserr(E2BIG, "E2BIG"); #endif #ifdef ENOEXEC set_syserr(ENOEXEC, "ENOEXEC"); #endif #ifdef EBADF set_syserr(EBADF, "EBADF"); #endif #ifdef ECHILD set_syserr(ECHILD, "ECHILD"); #endif #ifdef EAGAIN set_syserr(EAGAIN, "EAGAIN"); #endif #ifdef ENOMEM set_syserr(ENOMEM, "ENOMEM"); #endif #ifdef EACCES set_syserr(EACCES, "EACCES"); #endif #ifdef EFAULT set_syserr(EFAULT, "EFAULT"); #endif #ifdef ENOTBLK set_syserr(ENOTBLK, "ENOTBLK"); #endif #ifdef EBUSY set_syserr(EBUSY, "EBUSY"); #endif #ifdef EEXIST set_syserr(EEXIST, "EEXIST"); #endif #ifdef EXDEV set_syserr(EXDEV, "EXDEV"); #endif #ifdef ENODEV set_syserr(ENODEV, "ENODEV"); #endif #ifdef ENOTDIR set_syserr(ENOTDIR, "ENOTDIR"); #endif #ifdef EISDIR set_syserr(EISDIR, "EISDIR"); #endif #ifdef EINVAL set_syserr(EINVAL, "EINVAL"); #endif #ifdef ENFILE set_syserr(ENFILE, "ENFILE"); #endif #ifdef EMFILE set_syserr(EMFILE, "EMFILE"); #endif #ifdef ENOTTY set_syserr(ENOTTY, "ENOTTY"); #endif #ifdef ETXTBSY set_syserr(ETXTBSY, "ETXTBSY"); #endif #ifdef EFBIG set_syserr(EFBIG, "EFBIG"); #endif #ifdef ENOSPC set_syserr(ENOSPC, "ENOSPC"); #endif #ifdef ESPIPE set_syserr(ESPIPE, "ESPIPE"); #endif #ifdef EROFS set_syserr(EROFS, "EROFS"); #endif #ifdef EMLINK set_syserr(EMLINK, "EMLINK"); #endif #ifdef EPIPE set_syserr(EPIPE, "EPIPE"); #endif #ifdef EDOM set_syserr(EDOM, "EDOM"); #endif #ifdef ERANGE set_syserr(ERANGE, "ERANGE"); #endif #ifdef EDEADLK set_syserr(EDEADLK, "EDEADLK"); #endif #ifdef ENAMETOOLONG set_syserr(ENAMETOOLONG, "ENAMETOOLONG"); #endif #ifdef ENOLCK set_syserr(ENOLCK, "ENOLCK"); #endif #ifdef ENOSYS set_syserr(ENOSYS, "ENOSYS"); #endif #ifdef ENOTEMPTY set_syserr(ENOTEMPTY, "ENOTEMPTY"); #endif #ifdef ELOOP set_syserr(ELOOP, "ELOOP"); #endif #ifdef EWOULDBLOCK set_syserr(EWOULDBLOCK, "EWOULDBLOCK"); #endif #ifdef ENOMSG set_syserr(ENOMSG, "ENOMSG"); #endif #ifdef EIDRM set_syserr(EIDRM, "EIDRM"); #endif #ifdef ECHRNG set_syserr(ECHRNG, "ECHRNG"); #endif #ifdef EL2NSYNC set_syserr(EL2NSYNC, "EL2NSYNC"); #endif #ifdef EL3HLT set_syserr(EL3HLT, "EL3HLT"); #endif #ifdef EL3RST set_syserr(EL3RST, "EL3RST"); #endif #ifdef ELNRNG set_syserr(ELNRNG, "ELNRNG"); #endif #ifdef EUNATCH set_syserr(EUNATCH, "EUNATCH"); #endif #ifdef ENOCSI set_syserr(ENOCSI, "ENOCSI"); #endif #ifdef EL2HLT set_syserr(EL2HLT, "EL2HLT"); #endif #ifdef EBADE set_syserr(EBADE, "EBADE"); #endif #ifdef EBADR set_syserr(EBADR, "EBADR"); #endif #ifdef EXFULL set_syserr(EXFULL, "EXFULL"); #endif #ifdef ENOANO set_syserr(ENOANO, "ENOANO"); #endif #ifdef EBADRQC set_syserr(EBADRQC, "EBADRQC"); #endif #ifdef EBADSLT set_syserr(EBADSLT, "EBADSLT"); #endif #ifdef EDEADLOCK set_syserr(EDEADLOCK, "EDEADLOCK"); #endif #ifdef EBFONT set_syserr(EBFONT, "EBFONT"); #endif #ifdef ENOSTR set_syserr(ENOSTR, "ENOSTR"); #endif #ifdef ENODATA set_syserr(ENODATA, "ENODATA"); #endif #ifdef ETIME set_syserr(ETIME, "ETIME"); #endif #ifdef ENOSR set_syserr(ENOSR, "ENOSR"); #endif #ifdef ENONET set_syserr(ENONET, "ENONET"); #endif #ifdef ENOPKG set_syserr(ENOPKG, "ENOPKG"); #endif #ifdef EREMOTE set_syserr(EREMOTE, "EREMOTE"); #endif #ifdef ENOLINK set_syserr(ENOLINK, "ENOLINK"); #endif #ifdef EADV set_syserr(EADV, "EADV"); #endif #ifdef ESRMNT set_syserr(ESRMNT, "ESRMNT"); #endif #ifdef ECOMM set_syserr(ECOMM, "ECOMM"); #endif #ifdef EPROTO set_syserr(EPROTO, "EPROTO"); #endif #ifdef EMULTIHOP set_syserr(EMULTIHOP, "EMULTIHOP"); #endif #ifdef EDOTDOT set_syserr(EDOTDOT, "EDOTDOT"); #endif #ifdef EBADMSG set_syserr(EBADMSG, "EBADMSG"); #endif #ifdef EOVERFLOW set_syserr(EOVERFLOW, "EOVERFLOW"); #endif #ifdef ENOTUNIQ set_syserr(ENOTUNIQ, "ENOTUNIQ"); #endif #ifdef EBADFD set_syserr(EBADFD, "EBADFD"); #endif #ifdef EREMCHG set_syserr(EREMCHG, "EREMCHG"); #endif #ifdef ELIBACC set_syserr(ELIBACC, "ELIBACC"); #endif #ifdef ELIBBAD set_syserr(ELIBBAD, "ELIBBAD"); #endif #ifdef ELIBSCN set_syserr(ELIBSCN, "ELIBSCN"); #endif #ifdef ELIBMAX set_syserr(ELIBMAX, "ELIBMAX"); #endif #ifdef ELIBEXEC set_syserr(ELIBEXEC, "ELIBEXEC"); #endif #ifdef EILSEQ set_syserr(EILSEQ, "EILSEQ"); #endif #ifdef ERESTART set_syserr(ERESTART, "ERESTART"); #endif #ifdef ESTRPIPE set_syserr(ESTRPIPE, "ESTRPIPE"); #endif #ifdef EUSERS set_syserr(EUSERS, "EUSERS"); #endif #ifdef ENOTSOCK set_syserr(ENOTSOCK, "ENOTSOCK"); #endif #ifdef EDESTADDRREQ set_syserr(EDESTADDRREQ, "EDESTADDRREQ"); #endif #ifdef EMSGSIZE set_syserr(EMSGSIZE, "EMSGSIZE"); #endif #ifdef EPROTOTYPE set_syserr(EPROTOTYPE, "EPROTOTYPE"); #endif #ifdef ENOPROTOOPT set_syserr(ENOPROTOOPT, "ENOPROTOOPT"); #endif #ifdef EPROTONOSUPPORT set_syserr(EPROTONOSUPPORT, "EPROTONOSUPPORT"); #endif #ifdef ESOCKTNOSUPPORT set_syserr(ESOCKTNOSUPPORT, "ESOCKTNOSUPPORT"); #endif #ifdef EOPNOTSUPP set_syserr(EOPNOTSUPP, "EOPNOTSUPP"); #endif #ifdef EPFNOSUPPORT set_syserr(EPFNOSUPPORT, "EPFNOSUPPORT"); #endif #ifdef EAFNOSUPPORT set_syserr(EAFNOSUPPORT, "EAFNOSUPPORT"); #endif #ifdef EADDRINUSE set_syserr(EADDRINUSE, "EADDRINUSE"); #endif #ifdef EADDRNOTAVAIL set_syserr(EADDRNOTAVAIL, "EADDRNOTAVAIL"); #endif #ifdef ENETDOWN set_syserr(ENETDOWN, "ENETDOWN"); #endif #ifdef ENETUNREACH set_syserr(ENETUNREACH, "ENETUNREACH"); #endif #ifdef ENETRESET set_syserr(ENETRESET, "ENETRESET"); #endif #ifdef ECONNABORTED set_syserr(ECONNABORTED, "ECONNABORTED"); #endif #ifdef ECONNRESET set_syserr(ECONNRESET, "ECONNRESET"); #endif #ifdef ENOBUFS set_syserr(ENOBUFS, "ENOBUFS"); #endif #ifdef EISCONN set_syserr(EISCONN, "EISCONN"); #endif #ifdef ENOTCONN set_syserr(ENOTCONN, "ENOTCONN"); #endif #ifdef ESHUTDOWN set_syserr(ESHUTDOWN, "ESHUTDOWN"); #endif #ifdef ETOOMANYREFS set_syserr(ETOOMANYREFS, "ETOOMANYREFS"); #endif #ifdef ETIMEDOUT set_syserr(ETIMEDOUT, "ETIMEDOUT"); #endif #ifdef ECONNREFUSED set_syserr(ECONNREFUSED, "ECONNREFUSED"); #endif #ifdef EHOSTDOWN set_syserr(EHOSTDOWN, "EHOSTDOWN"); #endif #ifdef EHOSTUNREACH set_syserr(EHOSTUNREACH, "EHOSTUNREACH"); #endif #ifdef EALREADY set_syserr(EALREADY, "EALREADY"); #endif #ifdef EINPROGRESS set_syserr(EINPROGRESS, "EINPROGRESS"); #endif #ifdef ESTALE set_syserr(ESTALE, "ESTALE"); #endif #ifdef EUCLEAN set_syserr(EUCLEAN, "EUCLEAN"); #endif #ifdef ENOTNAM set_syserr(ENOTNAM, "ENOTNAM"); #endif #ifdef ENAVAIL set_syserr(ENAVAIL, "ENAVAIL"); #endif #ifdef EISNAM set_syserr(EISNAM, "EISNAM"); #endif #ifdef EREMOTEIO set_syserr(EREMOTEIO, "EREMOTEIO"); #endif #ifdef EDQUOT set_syserr(EDQUOT, "EDQUOT"); #endif } static void err_append(s) char *s; { extern VALUE errinfo; if (rb_in_eval) { if (NIL_P(errinfo)) { errinfo = exc_new2(eSyntaxError, s); } else { VALUE str = str_to_str(errinfo); str_cat(str, "\n", 1); str_cat(str, s, strlen(s)); errinfo = exc_new3(eSyntaxError, str); } } else { fputs(s, stderr); fputs("\n", stderr); fflush(stderr); } } ruby-1.2.3/eval.c100644 774 145 412321 6657725621 11711 0ustar matzNaCl/************************************************ eval.c - $Author: matz $ $Date: 1999/02/09 03:29:21 $ created at: Thu Jun 10 14:22:17 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "node.h" #include "env.h" #include "rubysig.h" #include #include #include "st.h" #include "dln.h" #ifndef HAVE_STRING_H char *strrchr _((char*,char)); #endif #ifdef HAVE_UNISTD_H #include #endif #ifdef __BEOS__ #include #endif #ifdef USE_CWGUSI #include #include #include #endif #ifndef setjmp #ifdef HAVE__SETJMP #define setjmp(env) _setjmp(env) #define longjmp(env,val) _longjmp(env,val) #endif #endif #if defined(MSDOS) || defined(NT) || defined(__human68k__) || defined(__MACOS__) #define RUBY_LIB_SEP ";" #else #define RUBY_LIB_SEP ":" #endif VALUE cProc; static VALUE cBinding; static VALUE proc_call _((VALUE,VALUE)); static VALUE f_binding _((VALUE)); static void f_END _((void)); static VALUE f_iterator_p _((void)); static VALUE block_pass _((VALUE,NODE*)); static VALUE cMethod; static VALUE method_proc _((VALUE)); static int scope_vmode; #define SCOPE_PUBLIC 0 #define SCOPE_PRIVATE 1 #define SCOPE_PROTECTED 2 #define SCOPE_MODFUNC 5 #define SCOPE_MASK 7 #define SCOPE_SET(f) do {scope_vmode=(f);} while(0) #define SCOPE_TEST(f) (scope_vmode&(f)) #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 */ ID mid0; /* method's original id */ VALUE klass; /* receiver's class */ VALUE origin; /* where method defined */ NODE *method; int noex; }; static struct cache_entry cache[CACHE_SIZE]; void rb_clear_cache() { struct cache_entry *ent, *end; ent = cache; end = ent + CACHE_SIZE; while (ent < end) { ent->mid = 0; ent++; } } static void rb_clear_cache_by_id(id) ID id; { struct cache_entry *ent, *end; ent = cache; end = ent + CACHE_SIZE; while (ent < end) { if (ent->mid == id) { ent->mid = 0; } ent++; } } void rb_add_method(klass, mid, node, noex) VALUE klass; ID mid; NODE *node; int noex; { NODE *body; if (NIL_P(klass)) klass = cObject; body = NEW_METHOD(node, noex); st_insert(RCLASS(klass)->m_tbl, mid, body); } static NODE* search_method(klass, id, origin) VALUE klass, *origin; ID id; { NODE *body; while (!st_lookup(RCLASS(klass)->m_tbl, id, &body)) { klass = RCLASS(klass)->super; if (!klass) return 0; } if (origin) *origin = klass; return body; } static NODE* rb_get_method_body(klassp, idp, noexp) VALUE *klassp; ID *idp; int *noexp; { ID id = *idp; VALUE klass = *klassp; VALUE origin; NODE *body; struct cache_entry *ent; if ((body = search_method(klass, id, &origin)) == 0) { return 0; } if (!body->nd_body) return 0; /* store in cache */ ent = cache + EXPR1(klass, id); ent->klass = klass; ent->noex = body->nd_noex; body = body->nd_body; if (nd_type(body) == NODE_FBODY) { ent->mid = id; *klassp = body->nd_orig; ent->origin = body->nd_orig; *idp = ent->mid0 = body->nd_mid; body = ent->method = body->nd_head; } else { *klassp = origin; ent->origin = origin; ent->mid = ent->mid0 = id; ent->method = body; } if (noexp) *noexp = ent->noex; return body; } void rb_alias(klass, name, def) VALUE klass; ID name, def; { VALUE origin; NODE *orig, *body; if (name == def) return; orig = search_method(klass, def, &origin); if (!orig || !orig->nd_body) { if (TYPE(klass) == T_MODULE) { orig = search_method(cObject, def, &origin); } } if (!orig || !orig->nd_body) { NameError("undefined method `%s' for `%s'", rb_id2name(def), rb_class2name(klass)); } body = orig->nd_body; if (nd_type(body) == NODE_FBODY) { /* was alias */ def = body->nd_mid; origin = body->nd_orig; body = body->nd_head; } st_insert(RCLASS(klass)->m_tbl, name, NEW_METHOD(NEW_FBODY(body, def, origin), orig->nd_noex)); } static void remove_method(klass, mid) VALUE klass; ID mid; { NODE *body; if (!st_delete(RCLASS(klass)->m_tbl, &mid, &body)) { NameError("method `%s' not defined in %s", rb_id2name(mid), rb_class2name(klass)); } rb_clear_cache_by_id(mid); } void rb_remove_method(klass, name) VALUE klass; char *name; { remove_method(klass, rb_intern(name)); } void rb_disable_super(klass, name) VALUE klass; char *name; { VALUE origin; NODE *body; ID mid = rb_intern(name); body = search_method(klass, mid, &origin); if (!body || !body->nd_body) { NameError("undefined method `%s' for `%s'", rb_id2name(mid), rb_class2name(klass)); } if (origin == klass) { body->nd_noex |= NOEX_UNDEF; } else { rb_clear_cache_by_id(mid); rb_add_method(the_class, mid, 0, NOEX_UNDEF); } } void rb_enable_super(klass, name) VALUE klass; char *name; { VALUE origin; NODE *body; ID mid = rb_intern(name); body = search_method(klass, mid, &origin); if (!body || !body->nd_body || origin != klass) { NameError("undefined method `%s' for `%s'", rb_id2name(mid), rb_class2name(klass)); } body->nd_noex &= ~NOEX_UNDEF; } static void rb_export_method(klass, name, noex) VALUE klass; ID name; int noex; { NODE *body; VALUE origin; body = search_method(klass, name, &origin); if (!body && TYPE(klass) == T_MODULE) { body = search_method(cObject, name, &origin); } if (!body) { NameError("undefined method `%s' for `%s'", rb_id2name(name), rb_class2name(klass)); } if (body->nd_noex != noex) { if (klass == origin) { body->nd_noex = noex; } else { rb_clear_cache_by_id(name); rb_add_method(klass, name, NEW_ZSUPER(), noex); } } } int rb_method_boundp(klass, id, ex) VALUE klass; ID id; int ex; { int noex; if (rb_get_method_body(&klass, &id, &noex)) { if (ex && noex & NOEX_PRIVATE) return FALSE; return TRUE; } return FALSE; } void rb_attr(klass, id, read, write, ex) VALUE klass; ID id; int read, write, ex; { char *name; char *buf; ID attr, attriv; int noex; if (!ex) noex = NOEX_PUBLIC; else { if (SCOPE_TEST(SCOPE_PRIVATE)) { noex = NOEX_PRIVATE; Warning("private attribute?"); } else if (SCOPE_TEST(SCOPE_PROTECTED)) { noex = NOEX_PROTECTED; } else { noex = NOEX_PUBLIC; } } name = rb_id2name(id); if (!name) { ArgError("argument needs to be symbol or string"); } buf = ALLOCA_N(char,strlen(name)+2); sprintf(buf, "@%s", name); attriv = rb_intern(buf); if (read) { rb_add_method(klass, id, NEW_IVAR(attriv), noex); } sprintf(buf, "%s=", name); id = rb_intern(buf); if (write) { rb_add_method(klass, id, NEW_ATTRSET(attriv), noex); } } static ID init, eqq, each, aref, aset, match; VALUE errinfo = Qnil; extern NODE *eval_tree_begin; extern NODE *eval_tree; extern int nerrs; static VALUE eLocalJumpError; static VALUE eSysStackError; extern VALUE TopSelf; struct FRAME *the_frame; struct SCOPE *the_scope; static struct FRAME *top_frame; static struct SCOPE *top_scope; #define PUSH_FRAME() { \ struct FRAME _frame; \ _frame.prev = the_frame; \ _frame.file = sourcefile; \ _frame.line = sourceline; \ _frame.iter = the_iter->iter; \ _frame.cbase = the_frame->cbase; \ the_frame = &_frame; \ #define POP_FRAME() \ sourcefile = _frame.file; \ sourceline = _frame.line; \ the_frame = _frame.prev; } struct BLOCK { NODE *var; NODE *body; VALUE self; struct FRAME frame; struct SCOPE *scope; VALUE klass; struct tag *tag; int iter; int vmode; struct RVarmap *d_vars; #ifdef THREAD VALUE orig_thread; #endif struct BLOCK *prev; }; static struct BLOCK *the_block; #define PUSH_BLOCK(v,b) { \ struct BLOCK _block; \ _block.tag = prot_tag; \ _block.var = v; \ _block.body = b; \ _block.self = self; \ _block.frame = *the_frame; \ _block.klass = the_class; \ _block.frame.file = sourcefile; \ _block.frame.line = sourceline; \ _block.scope = the_scope; \ _block.d_vars = the_dyna_vars; \ _block.prev = the_block; \ _block.iter = the_iter->iter; \ _block.vmode = scope_vmode; \ the_block = &_block; #define POP_BLOCK() \ the_block = _block.prev; \ } struct RVarmap *the_dyna_vars; #define PUSH_VARS() { \ struct RVarmap * volatile _old; \ _old = the_dyna_vars; \ the_dyna_vars = 0; #define POP_VARS() \ the_dyna_vars = _old; \ } static struct RVarmap* new_dvar(id, value) ID id; VALUE value; { NEWOBJ(vars, struct RVarmap); OBJSETUP(vars, 0, T_VARMAP); vars->id = id; vars->val = value; vars->next = the_dyna_vars; return vars; } static void mark_dvar(vars) struct RVarmap *vars; { the_dyna_vars = new_dvar(0, 0); the_dyna_vars->next = vars; } VALUE dyna_var_defined(id) ID id; { struct RVarmap *vars = the_dyna_vars; while (vars) { if (vars->id == id) return TRUE; vars = vars->next; } return FALSE; } VALUE dyna_var_ref(id) ID id; { struct RVarmap *vars = the_dyna_vars; while (vars) { if (vars->id == id) { return vars->val; } vars = vars->next; } return Qnil; } void dyna_var_push(id, value) ID id; VALUE value; { the_dyna_vars = new_dvar(id, value); } VALUE dyna_var_asgn(id, value) ID id; VALUE value; { struct RVarmap *vars = the_dyna_vars; while (vars) { if (vars->id == id) { vars->val = value; return value; } vars = vars->next; } dyna_var_push(id, value); return value; } static void dvar_asgn_push(id, value) ID id; VALUE value; { if (the_dyna_vars && the_dyna_vars->id == 0) { struct RVarmap* vars = new_dvar(id, value); vars->next = the_dyna_vars->next; the_dyna_vars->next = vars; } else { dyna_var_asgn(id, value); } } struct iter { int iter; struct iter *prev; }; static struct iter *the_iter; #define ITER_NOT 0 #define ITER_PRE 1 #define ITER_CUR 2 #define PUSH_ITER(i) { \ struct iter _iter; \ _iter.prev = the_iter; \ _iter.iter = (i); \ the_iter = &_iter; \ #define POP_ITER() \ the_iter = _iter.prev; \ } struct tag { jmp_buf buf; struct FRAME *frame; struct iter *iter; ID tag; VALUE retval; ID dst; struct tag *prev; }; static struct tag *prot_tag; #define PUSH_TAG(ptag) { \ struct tag _tag; \ _tag.retval = Qnil; \ _tag.frame = the_frame; \ _tag.iter = the_iter; \ _tag.prev = prot_tag; \ _tag.retval = Qnil; \ _tag.tag = ptag; \ _tag.dst = 0; \ prot_tag = &_tag; #define PROT_NONE 0 #define PROT_FUNC -1 #define PROT_THREAD -2 #define EXEC_TAG() setjmp(prot_tag->buf) #define JUMP_TAG(st) { \ the_frame = prot_tag->frame; \ the_iter = prot_tag->iter; \ longjmp(prot_tag->buf,(st)); \ } #define POP_TAG() \ if (_tag.prev) \ _tag.prev->retval = _tag.retval;\ prot_tag = _tag.prev; \ } #define TAG_RETURN 0x1 #define TAG_BREAK 0x2 #define TAG_NEXT 0x3 #define TAG_RETRY 0x4 #define TAG_REDO 0x5 #define TAG_RAISE 0x6 #define TAG_THROW 0x7 #define TAG_FATAL 0x8 #define TAG_MASK 0xf VALUE the_class; #define PUSH_CLASS() { \ VALUE _class = the_class; \ #define POP_CLASS() the_class = _class; } #define PUSH_SCOPE() { \ int volatile _vmode = scope_vmode; \ struct SCOPE * volatile _old; \ NEWOBJ(_scope, struct SCOPE); \ OBJSETUP(_scope, 0, T_SCOPE); \ _scope->local_tbl = 0; \ _scope->local_vars = 0; \ _scope->flag = 0; \ _old = the_scope; \ the_scope = _scope; \ scope_vmode = SCOPE_PUBLIC; #define POP_SCOPE() \ if (the_scope->flag == SCOPE_ALLOCA) {\ the_scope->local_vars = 0;\ the_scope->local_tbl = 0;\ if (the_scope != top_scope)\ gc_force_recycle(the_scope);\ }\ else {\ the_scope->flag |= SCOPE_NOSTACK;\ }\ the_scope = _old;\ scope_vmode = _vmode;\ } static VALUE rb_eval _((VALUE,NODE*)); static VALUE eval _((VALUE,VALUE,VALUE,char*,int)); static NODE *compile _((VALUE,char*)); static VALUE rb_call _((VALUE,VALUE,ID,int,VALUE*,int)); static VALUE module_setup _((VALUE,NODE*)); static VALUE massign _((VALUE,NODE*,VALUE)); static void assign _((VALUE,NODE*,VALUE)); static int safe_level = 0; /* safe-level: 0 - strings from streams/environment/ARGV are tainted (default) 1 - no dangerous operation by tainted string 2 - some process operations prohibited 3 - all genetated strings are tainted 4 - no global variable value modification/no direct output 5 - no instance variable value modification */ int rb_safe_level() { return safe_level; } void rb_set_safe_level(level) int level; { if (level > safe_level) { safe_level = level; } } static VALUE safe_getter() { return INT2FIX(safe_level); } static void safe_setter(val) VALUE val; { int level = NUM2INT(val); if (level < safe_level) { Raise(eSecurityError, "tried to downgrade safe level from %d to %d", safe_level, level); } safe_level = level; } void rb_check_safe_str(x) VALUE x; { if (TYPE(x)!= T_STRING) { TypeError("wrong argument type %s (expected String)", rb_class2name(CLASS_OF(x))); } if (str_tainted(x)) { if (safe_level > 0){ Raise(eSecurityError, "Insecure operation - %s", rb_id2name(the_frame->last_func)); } } } void rb_secure(level) int level; { if (level <= safe_level) { Raise(eSecurityError, "Insecure operation `%s' for level %d", rb_id2name(the_frame->last_func), level); } } extern int sourceline; extern char *sourcefile; static VALUE trace_func = 0; static void call_trace_func _((char*,char*,int,VALUE,ID)); static void error_pos() { if (sourcefile) { if (the_frame->last_func) { fprintf(stderr, "%s:%d:in `%s'", sourcefile, sourceline, rb_id2name(the_frame->last_func)); } else { fprintf(stderr, "%s:%d", sourcefile, sourceline); } } } static VALUE get_backtrace(info) VALUE info; { if (NIL_P(info)) return Qnil; return rb_funcall(info, rb_intern("backtrace"), 0); } static void set_backtrace(info, bt) VALUE info, bt; { rb_funcall(info, rb_intern("set_backtrace"), 1, bt); } static void error_print() { VALUE errat; VALUE eclass; VALUE einfo; if (NIL_P(errinfo)) return; errat = get_backtrace(errinfo); if (!NIL_P(errat)) { VALUE mesg = RARRAY(errat)->ptr[0]; if (NIL_P(mesg)) error_pos(); else { fwrite(RSTRING(mesg)->ptr, 1, RSTRING(mesg)->len, stderr); } } eclass = CLASS_OF(errinfo); einfo = obj_as_string(errinfo); if (eclass == eRuntimeError && RSTRING(einfo)->len == 0) { fprintf(stderr, ": unhandled exception\n"); } else { VALUE epath; epath = rb_class_path(eclass); if (RSTRING(einfo)->len == 0) { fprintf(stderr, ": "); fwrite(RSTRING(epath)->ptr, 1, RSTRING(epath)->len, stderr); putc('\n', stderr); } else { char *tail = 0; int len = RSTRING(einfo)->len; if (RSTRING(epath)->ptr[0] == '#') epath = 0; if (tail = strchr(RSTRING(einfo)->ptr, '\n')) { len = tail - RSTRING(einfo)->ptr; tail++; /* skip newline */ } fprintf(stderr, ": "); fwrite(RSTRING(einfo)->ptr, 1, len, stderr); if (epath) { fprintf(stderr, " ("); fwrite(RSTRING(epath)->ptr, 1, RSTRING(epath)->len, stderr); fprintf(stderr, ")\n"); } if (tail) { fwrite(tail, 1, RSTRING(einfo)->len-len-1, stderr); putc('\n', stderr); } } } if (!NIL_P(errat)) { int i; struct RArray *ep = RARRAY(errat); #define TRACE_MAX (TRACE_HEAD+TRACE_TAIL+5) #define TRACE_HEAD 8 #define TRACE_TAIL 5 ep = RARRAY(errat); for (i=1; ilen; i++) { fprintf(stderr, "\tfrom %s\n", RSTRING(ep->ptr[i])->ptr); if (i == TRACE_HEAD && ep->len > TRACE_MAX) { fprintf(stderr, "\t ... %d levels...\n", ep->len - TRACE_HEAD - TRACE_TAIL); i = ep->len - TRACE_TAIL; } } } } #if !defined(NT) && !defined(__MACOS__) extern char **environ; #endif char **origenviron; void rb_call_inits _((void)); void init_stack _((void)); void init_heap _((void)); void Init_ext _((void)); void gc_call_finalizer_at_exit _((void)); void ruby_init() { static struct FRAME frame; static struct iter iter; int state; the_frame = top_frame = &frame; the_iter = &iter; #ifdef __MACOS__ origenviron = 0; #else origenviron = environ; #endif init_heap(); PUSH_SCOPE(); the_scope->local_vars = 0; the_scope->local_tbl = 0; top_scope = the_scope; /* default visibility is private at toplevel */ SCOPE_SET(SCOPE_PRIVATE); PUSH_TAG(PROT_NONE) if ((state = EXEC_TAG()) == 0) { rb_call_inits(); the_class = cObject; the_frame->self = TopSelf; the_frame->cbase = (VALUE)node_newnode(NODE_CREF,cObject,0,0); rb_define_global_const("TOPLEVEL_BINDING", f_binding(TopSelf)); ruby_prog_init(); } POP_TAG(); if (state) error_print(); POP_SCOPE(); the_scope = top_scope; } static int ext_init = 0; void ruby_options(argc, argv) int argc; char **argv; { int state; PUSH_TAG(PROT_NONE) if ((state = EXEC_TAG()) == 0) { NODE *save; ruby_process_options(argc, argv); ext_init = 1; /* Init_ext() called in ruby_process_options */ save = eval_tree; ruby_require_modules(); eval_tree = save; } POP_TAG(); if (state) { error_print(); exit(1); } } static VALUE eval_node(self) VALUE self; { VALUE result = Qnil; NODE *tree; if (eval_tree_begin) { tree = eval_tree_begin; eval_tree_begin = 0; rb_eval(self, tree); } if (!eval_tree) return Qnil; tree = eval_tree; eval_tree = 0; result = rb_eval(self, tree); return result; } int rb_in_eval; #ifdef THREAD static void thread_cleanup _((void)); static void thread_wait_other_threads _((void)); static VALUE thread_current _((void)); #endif static int exit_status; static void exec_end_proc _((void)); void ruby_run() { int state; static int ex; if (nerrs > 0) exit(nerrs); init_stack(); PUSH_TAG(PROT_NONE); PUSH_ITER(ITER_NOT); if ((state = EXEC_TAG()) == 0) { if (!ext_init) Init_ext(); eval_node(TopSelf); } POP_ITER(); POP_TAG(); if (state && !ex) ex = state; PUSH_TAG(PROT_NONE); PUSH_ITER(ITER_NOT); if ((state = EXEC_TAG()) == 0) { rb_trap_exit(); #ifdef THREAD thread_cleanup(); thread_wait_other_threads(); #endif exec_end_proc(); gc_call_finalizer_at_exit(); } else { ex = state; } POP_ITER(); POP_TAG(); switch (ex & 0xf) { case 0: exit(0); case TAG_RETURN: error_pos(); fprintf(stderr, ": unexpected return\n"); exit(1); break; case TAG_NEXT: error_pos(); fprintf(stderr, ": unexpected next\n"); exit(1); break; case TAG_BREAK: error_pos(); fprintf(stderr, ": unexpected break\n"); exit(1); break; case TAG_REDO: error_pos(); fprintf(stderr, ": unexpected redo\n"); exit(1); break; case TAG_RETRY: error_pos(); fprintf(stderr, ": retry outside of rescue clause\n"); exit(1); break; case TAG_RAISE: case TAG_FATAL: if (obj_is_kind_of(errinfo, eSystemExit)) { exit(exit_status); } error_print(); exit(1); break; default: Bug("Unknown longjmp status %d", ex); break; } } static void compile_error(at) char *at; { VALUE str; char *mesg; int len; mesg = str2cstr(errinfo, &len); nerrs = 0; str = str_new2("compile error"); if (at) { str_cat(str, " in ", 4); str_cat(str, at, strlen(at)); } str_cat(str, "\n", 1); str_cat(str, mesg, len); rb_raise(exc_new3(eSyntaxError, str)); } VALUE rb_eval_string(str) char *str; { VALUE v; char *oldsrc = sourcefile; sourcefile = "(eval)"; v = eval(TopSelf, str_new2(str), Qnil, 0, 0); sourcefile = oldsrc; return v; } VALUE rb_eval_cmd(cmd, arg) VALUE cmd, arg; { int state; VALUE val; struct SCOPE *saved_scope; volatile int safe = rb_safe_level(); if (TYPE(cmd) != T_STRING) { Check_Type(arg, T_ARRAY); return rb_funcall2(cmd, rb_intern("call"), RARRAY(arg)->len, RARRAY(arg)->ptr); } PUSH_CLASS(); PUSH_TAG(PROT_NONE); saved_scope = the_scope; the_scope = top_scope; the_class = cObject; if (str_tainted(cmd)) { safe_level = 5; } if ((state = EXEC_TAG()) == 0) { val = eval(TopSelf, cmd, Qnil, 0, 0); } the_scope = saved_scope; safe_level = safe; POP_TAG(); POP_CLASS(); switch (state) { case 0: break; case TAG_RETURN: Raise(eLocalJumpError, "unexpected return"); break; case TAG_NEXT: Raise(eLocalJumpError, "unexpected next"); break; case TAG_BREAK: Raise(eLocalJumpError, "unexpected break"); break; case TAG_REDO: Raise(eLocalJumpError, "unexpected redo"); break; case TAG_RETRY: Raise(eLocalJumpError, "retry outside of rescue clause"); break; default: JUMP_TAG(state); break; } return val; } VALUE rb_trap_eval(cmd, sig) VALUE cmd; int sig; { int state; VALUE val; /* OK */ PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { val = rb_eval_cmd(cmd, ary_new3(1, INT2FIX(sig))); } POP_TAG(); if (state) { trap_immediate = 0; JUMP_TAG(state); } return val; } static VALUE superclass(self, node) VALUE self; NODE *node; { VALUE val; /* OK */ int state; PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { val = rb_eval(self, node); } POP_TAG(); if (state) { superclass_error: switch (nd_type(node)) { case NODE_COLON2: TypeError("undefined superclass `%s'", rb_id2name(node->nd_mid)); case NODE_CVAR: TypeError("undefined superclass `%s'", rb_id2name(node->nd_vid)); default: TypeError("superclass undefined"); } JUMP_TAG(state); } if (TYPE(val) != T_CLASS) goto superclass_error; if (FL_TEST(val, FL_SINGLETON)) { TypeError("can't make subclass of virtual class"); } return val; } static VALUE ev_const_defined(cref, id) NODE *cref; ID id; { NODE *cbase = cref; while (cbase && cbase->nd_clss != cObject) { struct RClass *klass = RCLASS(cbase->nd_clss); if (klass->iv_tbl && st_lookup(klass->iv_tbl, id, 0)) { return TRUE; } cbase = cbase->nd_next; } return rb_const_defined(cref->nd_clss, id); } static VALUE ev_const_get(cref, id) NODE *cref; ID id; { NODE *cbase = cref; VALUE result; while (cbase && cbase->nd_clss != cObject) { struct RClass *klass = RCLASS(cbase->nd_clss); if (klass->iv_tbl && st_lookup(klass->iv_tbl, id, &result)) { return result; } cbase = cbase->nd_next; } return rb_const_get(cref->nd_clss, id); } static VALUE mod_nesting() { NODE *cbase = (NODE*)the_frame->cbase; VALUE ary = ary_new(); while (cbase && cbase->nd_clss != cObject) { ary_push(ary, cbase->nd_clss); cbase = cbase->nd_next; } return ary; } static VALUE mod_s_constants() { NODE *cbase = (NODE*)the_frame->cbase; VALUE ary = ary_new(); while (cbase && cbase->nd_clss != cObject) { mod_const_at(cbase->nd_clss, ary); cbase = cbase->nd_next; } mod_const_of(((NODE*)the_frame->cbase)->nd_clss, ary); return ary; } static VALUE mod_remove_method(mod, name) VALUE mod, name; { remove_method(mod, rb_to_id(name)); return mod; } static VALUE mod_undef_method(mod, name) VALUE mod, name; { ID id = rb_to_id(name); rb_add_method(mod, id, 0, NOEX_PUBLIC); rb_clear_cache_by_id(id); return mod; } static VALUE mod_alias_method(mod, newname, oldname) VALUE mod, newname, oldname; { ID id = rb_to_id(newname); rb_alias(mod, id, rb_to_id(oldname)); rb_clear_cache_by_id(id); return mod; } #if defined(C_ALLOCA) # define TMP_PROTECT NODE * volatile __protect_tmp=0 # define TMP_ALLOC(n) \ (__protect_tmp = node_newnode(NODE_ALLOCA, \ ALLOC_N(VALUE,n),__protect_tmp,n),\ (void*)__protect_tmp->nd_head) #else # define TMP_PROTECT typedef int foobazzz # define TMP_ALLOC(n) ALLOCA_N(VALUE,n) #endif #define SETUP_ARGS(anode) {\ NODE *n = anode;\ if (!n) {\ argc = 0;\ argv = 0;\ }\ else if (nd_type(n) == NODE_ARRAY) {\ argc=n->nd_alen;\ if (argc > 0) {\ char *file = sourcefile;\ int line = sourceline;\ int i;\ n = anode;\ argv = TMP_ALLOC(argc);\ for (i=0;ind_head);\ n=n->nd_next;\ }\ sourcefile = file;\ sourceline = line;\ }\ else {\ argc = 0;\ argv = 0;\ }\ }\ else {\ VALUE args = rb_eval(self,n);\ char *file = sourcefile;\ int line = sourceline;\ if (TYPE(args) != T_ARRAY)\ args = rb_Array(args);\ argc = RARRAY(args)->len;\ argv = ALLOCA_N(VALUE, argc);\ MEMCPY(argv, RARRAY(args)->ptr, VALUE, argc);\ sourcefile = file;\ sourceline = line;\ }\ } #define BEGIN_CALLARGS {\ struct BLOCK *tmp_block = the_block;\ if (the_iter->iter == ITER_PRE) {\ the_block = the_block->prev;\ }\ PUSH_ITER(ITER_NOT); #define END_CALLARGS \ the_block = tmp_block;\ POP_ITER();\ } #define MATCH_DATA the_scope->local_vars[node->nd_cnt] static char* is_defined _((VALUE, NODE*, char*)); static char* arg_defined(self, node, buf, type) VALUE self; NODE *node; char *buf; char *type; { int argc; int i; if (!node) return type; /* no args */ if (nd_type(node) == NODE_ARRAY) { argc=node->nd_alen; if (argc > 0) { for (i=0;ind_head, buf)) return 0; node = node->nd_next; } } } else if (!is_defined(self, node, buf)) { return 0; } return type; } static char* is_defined(self, node, buf) VALUE self; NODE *node; /* OK */ char *buf; { VALUE val; /* OK */ int state; switch (nd_type(node)) { case NODE_SUPER: case NODE_ZSUPER: if (the_frame->last_func == 0) return 0; else if (rb_method_boundp(RCLASS(the_frame->last_class)->super, the_frame->last_func, 1)) { if (nd_type(node) == NODE_SUPER) { return arg_defined(self, node->nd_args, buf, "super"); } return "super"; } break; case NODE_VCALL: case NODE_FCALL: val = CLASS_OF(self); goto check_bound; case NODE_CALL: if (!is_defined(self, node->nd_recv, buf)) return 0; PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { val = rb_eval(self, node->nd_recv); val = CLASS_OF(val); } POP_TAG(); if (state) { return 0; } check_bound: if (rb_method_boundp(val, node->nd_mid, nd_type(node)== NODE_CALL)) { return arg_defined(self, node->nd_args, buf, "method"); } break; case NODE_MATCH2: case NODE_MATCH3: return "method"; case NODE_YIELD: if (iterator_p()) { return "yield"; } break; case NODE_SELF: return "self"; case NODE_NIL: return "nil"; case NODE_TRUE: return "true"; case NODE_FALSE: return "false"; case NODE_ATTRSET: case NODE_OP_ASGN1: case NODE_OP_ASGN2: case NODE_MASGN: case NODE_LASGN: case NODE_DASGN: case NODE_DASGN_PUSH: case NODE_GASGN: case NODE_IASGN: case NODE_CASGN: return "assignment"; case NODE_LVAR: return "local-variable"; case NODE_DVAR: return "local-variable(in-block)"; case NODE_GVAR: if (rb_gvar_defined(node->nd_entry)) { return "global-variable"; } break; case NODE_IVAR: if (rb_ivar_defined(self, node->nd_vid)) { return "instance-variable"; } break; case NODE_CVAR: if (ev_const_defined((NODE*)the_frame->cbase, node->nd_vid)) { return "constant"; } break; case NODE_COLON2: PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { val = rb_eval(self, node->nd_head); } POP_TAG(); if (state) { return 0; } else { switch (TYPE(val)) { case T_CLASS: case T_MODULE: if (rb_const_defined_at(val, node->nd_mid)) return "constant"; } } break; case NODE_NTH_REF: if (reg_nth_defined(node->nd_nth, MATCH_DATA)) { sprintf(buf, "$%d", node->nd_nth); return buf; } break; case NODE_BACK_REF: if (reg_nth_defined(0, MATCH_DATA)) { sprintf(buf, "$%c", node->nd_nth); return buf; } break; default: PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { rb_eval(self, node); } POP_TAG(); if (!state) { return "expression"; } break; } return 0; } static int handle_rescue _((VALUE,NODE*)); static void blk_free(); static VALUE obj_is_block(block) VALUE block; { if (TYPE(block) == T_DATA && RDATA(block)->dfree == blk_free) { return TRUE; } return FALSE; } static VALUE obj_is_proc(proc) VALUE proc; { if (obj_is_block(proc) && obj_is_kind_of(proc, cProc)) { return TRUE; } return FALSE; } static VALUE set_trace_func(obj, trace) VALUE obj, trace; { if (NIL_P(trace)) { trace_func = 0; return Qnil; } if (!obj_is_proc(trace)) { TypeError("trace_func needs to be Proc"); } return trace_func = trace; } static void call_trace_func(event, file, line, self, id) char *event; char *file; int line; VALUE self; ID id; { int state; volatile VALUE trace; struct FRAME *prev; char *file_save = sourcefile; int line_save = sourceline; if (!trace_func) return; trace = trace_func; trace_func = 0; #ifdef THREAD thread_critical++; #endif prev = the_frame; PUSH_FRAME(); *the_frame = *_frame.prev; the_frame->prev = prev; the_frame->line = sourceline = line; the_frame->file = sourcefile = file; PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { proc_call(trace, ary_new3(5, str_new2(event), str_new2(sourcefile), INT2FIX(sourceline), INT2FIX(id), self?f_binding(self):Qnil)); } POP_TAG(); POP_FRAME(); #ifdef THREAD thread_critical--; #endif if (!trace_func) trace_func = trace; sourceline = line_save; sourcefile = file_save; if (state) JUMP_TAG(state); } static void return_check _((void)); #define return_value(v) prot_tag->retval = (v) static VALUE rb_eval(self, node) VALUE self; NODE * volatile node; { int state; volatile VALUE result = Qnil; #define RETURN(v) { result = (v); goto finish; } again: if (!node) RETURN(Qnil); switch (nd_type(node)) { case NODE_BLOCK: if (!node->nd_next) { node = node->nd_head; goto again; } while (node) { result = rb_eval(self, node->nd_head); node = node->nd_next; } break; case NODE_POSTEXE: f_END(); nd_set_type(node, NODE_NIL); /* exec just once */ result = Qnil; break; /* begin .. end without clauses */ case NODE_BEGIN: node = node->nd_body; goto again; /* nodes for speed-up(default match) */ case NODE_MATCH: result = reg_match2(node->nd_head->nd_lit); break; /* nodes for speed-up(literal match) */ case NODE_MATCH2: result = reg_match(rb_eval(self,node->nd_recv), rb_eval(self,node->nd_value)); break; /* nodes for speed-up(literal match) */ case NODE_MATCH3: { VALUE r = rb_eval(self,node->nd_recv); VALUE l = rb_eval(self,node->nd_value); if (TYPE(r) == T_STRING) { result = reg_match(l, r); } else { result = rb_funcall(r, match, 1, l); } } break; /* nodes for speed-up(top-level loop for -n/-p) */ case NODE_OPT_N: while (!NIL_P(f_gets())) { rb_eval(self, node->nd_body); } RETURN(Qnil); case NODE_SELF: RETURN(self); case NODE_NIL: RETURN(Qnil); case NODE_TRUE: RETURN(TRUE); case NODE_FALSE: RETURN(FALSE); case NODE_IF: sourceline = nd_line(node); if (RTEST(rb_eval(self, node->nd_cond))) { node = node->nd_body; } else { node = node->nd_else; } goto again; case NODE_CASE: { VALUE val; val = rb_eval(self, node->nd_head); node = node->nd_body; while (node) { NODE *tag; if (nd_type(node) != NODE_WHEN) { goto again; } tag = node->nd_head; while (tag) { if (trace_func) { call_trace_func("line", tag->nd_file, nd_line(tag), self, the_frame->last_func); } sourceline = nd_line(tag); if (RTEST(rb_funcall2(rb_eval(self, tag->nd_head),eqq,1,&val))){ node = node->nd_body; goto again; } tag = tag->nd_next; } node = node->nd_next; } } RETURN(Qnil); case NODE_WHILE: PUSH_TAG(PROT_NONE); switch (state = EXEC_TAG()) { case 0: sourceline = nd_line(node); if (node->nd_state && !RTEST(rb_eval(self, node->nd_cond))) goto while_out; do { while_redo: rb_eval(self, node->nd_body); while_next: ; } while (RTEST(rb_eval(self, node->nd_cond))); break; case TAG_REDO: state = 0; goto while_redo; case TAG_NEXT: state = 0; goto while_next; case TAG_BREAK: state = 0; default: break; } while_out: POP_TAG(); if (state) { JUMP_TAG(state); } RETURN(Qnil); case NODE_UNTIL: PUSH_TAG(PROT_NONE); switch (state = EXEC_TAG()) { case 0: if (node->nd_state && RTEST(rb_eval(self, node->nd_cond))) goto until_out; do { until_redo: rb_eval(self, node->nd_body); until_next: ; } while (!RTEST(rb_eval(self, node->nd_cond))); break; case TAG_REDO: state = 0; goto until_redo; case TAG_NEXT: state = 0; goto until_next; case TAG_BREAK: state = 0; default: break; } until_out: POP_TAG(); if (state) { JUMP_TAG(state); } RETURN(Qnil); case NODE_BLOCK_PASS: result = block_pass(self, node); break; case NODE_ITER: case NODE_FOR: { iter_retry: PUSH_BLOCK(node->nd_var, node->nd_body); PUSH_TAG(PROT_FUNC); state = EXEC_TAG(); if (state == 0) { if (nd_type(node) == NODE_ITER) { PUSH_ITER(ITER_PRE); result = rb_eval(self, node->nd_iter); POP_ITER(); } else { VALUE recv; char *file = sourcefile; int line = sourceline; recv = rb_eval(self, node->nd_iter); PUSH_ITER(ITER_PRE); sourcefile = file; sourceline = line; result = rb_call(CLASS_OF(recv),recv,each,0,0,0); POP_ITER(); } } else if (_block.tag->dst == state) { state &= TAG_MASK; if (state == TAG_RETURN) { result = prot_tag->retval; } } POP_TAG(); POP_BLOCK(); switch (state) { case 0: break; case TAG_RETRY: goto iter_retry; case TAG_BREAK: result = Qnil; break; case TAG_RETURN: return_value(result); /* fall through */ default: JUMP_TAG(state); } } break; case NODE_BREAK: JUMP_TAG(TAG_BREAK); break; case NODE_NEXT: JUMP_TAG(TAG_NEXT); break; case NODE_REDO: JUMP_TAG(TAG_REDO); break; case NODE_RETRY: JUMP_TAG(TAG_RETRY); break; case NODE_YIELD: result = rb_yield_0(rb_eval(self, node->nd_stts), 0); break; case NODE_RESCUE: retry_entry: { volatile VALUE e_info = errinfo; PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { result = rb_eval(self, node->nd_head); } POP_TAG(); if (state == TAG_RAISE) { NODE * volatile resq = node->nd_resq; while (resq) { if (handle_rescue(self, resq)) { state = 0; PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { result = rb_eval(self, resq->nd_body); } POP_TAG(); if (state == 0) { errinfo = e_info; } else if (state == TAG_RETRY) { state = 0; goto retry_entry; } break; } resq = resq->nd_head; /* next rescue */ } } if (state) { JUMP_TAG(state); } } break; case NODE_ENSURE: PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { result = rb_eval(self, node->nd_head); } POP_TAG(); if (node->nd_ensr) { VALUE retval = prot_tag->retval; /* save retval */ rb_eval(self, node->nd_ensr); return_value(retval); } if (state) { JUMP_TAG(state); } break; case NODE_AND: result = rb_eval(self, node->nd_1st); if (!RTEST(result)) break; node = node->nd_2nd; goto again; case NODE_OR: result = rb_eval(self, node->nd_1st); if (RTEST(result)) break; node = node->nd_2nd; goto again; case NODE_NOT: if (RTEST(rb_eval(self, node->nd_body))) result = FALSE; else result = TRUE; break; case NODE_DOT2: case NODE_DOT3: RETURN(range_new(rb_eval(self, node->nd_beg), rb_eval(self, node->nd_end))); case NODE_FLIP2: /* like AWK */ if (node->nd_state == 0) { if (RTEST(rb_eval(self, node->nd_beg))) { node->nd_state = rb_eval(self, node->nd_end)?0:1; result = TRUE; } else { result = FALSE; } } else { if (RTEST(rb_eval(self, node->nd_end))) { node->nd_state = 0; } result = TRUE; } break; case NODE_FLIP3: /* like SED */ if (node->nd_state == 0) { if (RTEST(rb_eval(self, node->nd_beg))) { node->nd_state = 1; result = TRUE; } result = FALSE; } else { if (RTEST(rb_eval(self, node->nd_end))) { node->nd_state = 0; } result = TRUE; } break; case NODE_RETURN: if (node->nd_stts) { return_value(rb_eval(self, node->nd_stts)); } return_check(); JUMP_TAG(TAG_RETURN); break; case NODE_CALL: { VALUE recv; int argc; VALUE *argv; /* used in SETUP_ARGS */ TMP_PROTECT; BEGIN_CALLARGS; recv = rb_eval(self, node->nd_recv); SETUP_ARGS(node->nd_args); END_CALLARGS; result = rb_call(CLASS_OF(recv),recv,node->nd_mid,argc,argv,0); } break; case NODE_FCALL: { int argc; VALUE *argv; /* used in SETUP_ARGS */ TMP_PROTECT; BEGIN_CALLARGS; SETUP_ARGS(node->nd_args); END_CALLARGS; result = rb_call(CLASS_OF(self),self,node->nd_mid,argc,argv,1); } break; case NODE_VCALL: result = rb_call(CLASS_OF(self),self,node->nd_mid,0,0,2); break; case NODE_SUPER: case NODE_ZSUPER: { int argc; VALUE *argv; /* used in SETUP_ARGS */ TMP_PROTECT; if (the_frame->last_class == 0) { NameError("superclass method `%s' disabled", rb_id2name(the_frame->last_func)); } if (nd_type(node) == NODE_ZSUPER) { argc = the_frame->argc; argv = the_frame->argv; } else { BEGIN_CALLARGS; SETUP_ARGS(node->nd_args); END_CALLARGS; } PUSH_ITER(the_iter->iter?ITER_PRE:ITER_NOT); result = rb_call(RCLASS(the_frame->last_class)->super, the_frame->self, the_frame->last_func, argc, argv, 3); POP_ITER(); } break; case NODE_SCOPE: { VALUE save = the_frame->cbase; PUSH_SCOPE(); PUSH_TAG(PROT_NONE); if (node->nd_rval) the_frame->cbase = node->nd_rval; if (node->nd_tbl) { VALUE *vars = ALLOCA_N(VALUE, node->nd_tbl[0]+1); *vars++ = (VALUE)node; the_scope->local_vars = vars; memclear(the_scope->local_vars, node->nd_tbl[0]); the_scope->local_tbl = node->nd_tbl; } else { the_scope->local_vars = 0; the_scope->local_tbl = 0; } if ((state = EXEC_TAG()) == 0) { result = rb_eval(self, node->nd_body); } POP_TAG(); POP_SCOPE(); the_frame->cbase = save; if (state) JUMP_TAG(state); } break; case NODE_OP_ASGN1: { int argc; VALUE *argv; /* used in SETUP_ARGS */ VALUE recv, val; NODE *rval; TMP_PROTECT; recv = rb_eval(self, node->nd_recv); rval = node->nd_args->nd_head; SETUP_ARGS(node->nd_args->nd_next); val = rb_funcall2(recv, aref, argc-1, argv); if (node->nd_mid == 0) { /* OR */ if (RTEST(val)) break; val = rb_eval(self, rval); } else if (node->nd_mid == 1) { /* AND */ if (!RTEST(val)) break; val = rb_eval(self, rval); } else { val = rb_funcall(val, node->nd_mid, 1, rb_eval(self, rval)); } argv[argc-1] = val; val = rb_funcall2(recv, aset, argc, argv); result = val; } break; case NODE_OP_ASGN2: { ID id = node->nd_next->nd_vid; VALUE recv, val; recv = rb_eval(self, node->nd_recv); val = rb_funcall(recv, id, 0); if (node->nd_next->nd_mid == 0) { /* OR */ if (RTEST(val)) break; val = rb_eval(self, node->nd_value); } else if (node->nd_next->nd_mid == 1) { /* AND */ if (!RTEST(val)) break; val = rb_eval(self, node->nd_value); } else { val = rb_funcall(val, node->nd_next->nd_mid, 1, rb_eval(self, node->nd_value)); } rb_funcall2(recv, node->nd_next->nd_aid, 1, &val); result = val; } break; case NODE_OP_ASGN_AND: result = rb_eval(self, node->nd_head); if (RTEST(result)) { result = rb_eval(self, node->nd_value); } break; case NODE_OP_ASGN_OR: result = rb_eval(self, node->nd_head); if (!RTEST(result)) { result = rb_eval(self, node->nd_value); } break; case NODE_MASGN: result = massign(self, node, rb_eval(self, node->nd_value)); break; case NODE_LASGN: if (the_scope->local_vars == 0) Bug("unexpected local variable assignment"); result = rb_eval(self, node->nd_value); the_scope->local_vars[node->nd_cnt] = result; break; case NODE_DASGN: result = dyna_var_asgn(node->nd_vid, rb_eval(self, node->nd_value)); break; case NODE_DASGN_PUSH: result = rb_eval(self, node->nd_value); dvar_asgn_push(node->nd_vid, result); break; case NODE_GASGN: { VALUE val; val = rb_eval(self, node->nd_value); rb_gvar_set(node->nd_entry, val); result = val; } break; case NODE_IASGN: { VALUE val; val = rb_eval(self, node->nd_value); rb_ivar_set(self, node->nd_vid, val); result = val; } break; case NODE_CASGN: { VALUE val; val = rb_eval(self, node->nd_value); /* check for static scope constants */ if (RTEST(verbose) && ev_const_defined((NODE*)the_frame->cbase, node->nd_vid)) { Warning("already initialized constant %s", rb_id2name(node->nd_vid)); } rb_const_set(the_class, node->nd_vid, val); result = val; } break; case NODE_LVAR: if (the_scope->local_vars == 0) { Bug("unexpected local variable"); } result = the_scope->local_vars[node->nd_cnt]; break; case NODE_DVAR: result = dyna_var_ref(node->nd_vid); break; case NODE_GVAR: result = rb_gvar_get(node->nd_entry); break; case NODE_IVAR: result = rb_ivar_get(self, node->nd_vid); break; case NODE_CVAR: result = ev_const_get((NODE*)the_frame->cbase, node->nd_vid); break; case NODE_BLOCK_ARG: if (the_scope->local_vars == 0) Bug("unexpected block argument"); if (iterator_p()) { result = f_lambda(); the_scope->local_vars[node->nd_cnt] = result; } else { result = Qnil; } break; case NODE_COLON2: { VALUE klass; klass = rb_eval(self, node->nd_head); switch (TYPE(klass)) { case T_CLASS: case T_MODULE: break; default: Check_Type(klass, T_CLASS); break; } result = rb_const_get_at(klass, node->nd_mid); } break; case NODE_COLON3: result = rb_const_get_at(cObject, node->nd_mid); break; case NODE_NTH_REF: result = reg_nth_match(node->nd_nth, MATCH_DATA); break; case NODE_BACK_REF: switch (node->nd_nth) { case '&': result = reg_last_match(MATCH_DATA); break; case '`': result = reg_match_pre(MATCH_DATA); break; case '\'': result = reg_match_post(MATCH_DATA); break; case '+': result = reg_match_last(MATCH_DATA); break; default: Bug("unexpected back-ref"); } break; case NODE_HASH: { NODE *list; VALUE hash = hash_new(); VALUE key, val; list = node->nd_head; while (list) { key = rb_eval(self, list->nd_head); list = list->nd_next; if (list == 0) Bug("odd number list for Hash"); val = rb_eval(self, list->nd_head); list = list->nd_next; hash_aset(hash, key, val); } result = hash; } break; case NODE_ZARRAY: /* zero length list */ result = ary_new(); break; case NODE_ARRAY: { VALUE ary; int i; i = node->nd_alen; ary = ary_new2(i); for (i=0;node;node=node->nd_next) { RARRAY(ary)->ptr[i++] = rb_eval(self, node->nd_head); RARRAY(ary)->len = i; } result = ary; } break; case NODE_STR: result = str_new3(node->nd_lit); break; case NODE_DSTR: case NODE_DXSTR: case NODE_DREGX: case NODE_DREGX_ONCE: { VALUE str, str2; NODE *list = node->nd_next; str = str_new3(node->nd_lit); while (list) { if (list->nd_head) { switch (nd_type(list->nd_head)) { case NODE_STR: str2 = list->nd_head->nd_lit; break; case NODE_EVSTR: rb_in_eval++; list->nd_head = compile(list->nd_head->nd_lit,0); eval_tree = 0; rb_in_eval--; if (nerrs > 0) { compile_error("string expansion"); } /* fall through */ default: str2 = rb_eval(self, list->nd_head); str2 = obj_as_string(str2); break; } str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); if (str_tainted(str2)) str_taint(str); } list = list->nd_next; } switch (nd_type(node)) { case NODE_DREGX: result = reg_new(RSTRING(str)->ptr, RSTRING(str)->len, node->nd_cflag); break; case NODE_DREGX_ONCE: /* regexp expand once */ result = reg_new(RSTRING(str)->ptr, RSTRING(str)->len, node->nd_cflag); nd_set_type(node, NODE_LIT); node->nd_lit = result; break; case NODE_DXSTR: result = rb_funcall(self, '`', 1, str); break; default: result = str; break; } } break; case NODE_XSTR: result = rb_funcall(self, '`', 1, node->nd_lit); break; case NODE_LIT: result = node->nd_lit; break; case NODE_ATTRSET: if (the_frame->argc != 1) ArgError("Wrong # of arguments(%d for 1)", the_frame->argc); result = rb_ivar_set(self, node->nd_vid, the_frame->argv[0]); break; case NODE_DEFN: if (node->nd_defn) { NODE *body; VALUE origin; int noex; if (the_class == cObject && node->nd_mid == init) { Warn("re-defining Object#initialize may cause infinite loop"); } body = search_method(the_class, node->nd_mid, &origin); if (body) { if (origin == the_class) { Warning("discarding old %s", rb_id2name(node->nd_mid)); } rb_clear_cache_by_id(node->nd_mid); } if (SCOPE_TEST(SCOPE_PRIVATE) || node->nd_mid == init) { noex = NOEX_PRIVATE; } else if (SCOPE_TEST(SCOPE_PROTECTED)) { noex = NOEX_PROTECTED; } else { noex = NOEX_PUBLIC; } if (body && origin == the_class && body->nd_noex & NOEX_UNDEF) { noex |= NOEX_UNDEF; } rb_add_method(the_class, node->nd_mid, node->nd_defn, noex); if (scope_vmode == SCOPE_MODFUNC) { rb_add_method(rb_singleton_class(the_class), node->nd_mid, node->nd_defn, NOEX_PUBLIC); rb_funcall(the_class, rb_intern("singleton_method_added"), 1, INT2FIX(node->nd_mid)); } if (FL_TEST(the_class, FL_SINGLETON)) { rb_funcall(rb_iv_get(the_class, "__attached__"), rb_intern("singleton_method_added"), 1, INT2FIX(node->nd_mid)); } else { rb_funcall(the_class, rb_intern("method_added"), 1, INT2FIX(node->nd_mid)); } result = Qnil; } break; case NODE_DEFS: if (node->nd_defn) { VALUE recv = rb_eval(self, node->nd_recv); VALUE klass; NODE *body = 0; if (FIXNUM_P(recv)) { TypeError("Can't define method \"%s\" for Fixnum", rb_id2name(node->nd_mid)); } if (NIL_P(recv)) { TypeError("Can't define method \"%s\" for nil", rb_id2name(node->nd_mid)); } if (rb_special_const_p(recv)) { TypeError("Can't define method \"%s\" for special constants", rb_id2name(node->nd_mid)); } klass = rb_singleton_class(recv); if (st_lookup(RCLASS(klass)->m_tbl, node->nd_mid, &body)) { Warning("redefine %s", rb_id2name(node->nd_mid)); } rb_clear_cache_by_id(node->nd_mid); rb_add_method(klass, node->nd_mid, node->nd_defn, NOEX_PUBLIC|(body?body->nd_noex&NOEX_UNDEF:0)); rb_funcall(recv, rb_intern("singleton_method_added"), 1, INT2FIX(node->nd_mid)); result = Qnil; } break; case NODE_UNDEF: { VALUE origin; NODE *body; body = search_method(the_class, node->nd_mid, &origin); if (!body || !body->nd_body) { char *s0 = " class"; VALUE klass = the_class; if (FL_TEST(the_class, FL_SINGLETON)) { VALUE obj = rb_iv_get(the_class, "__attached__"); switch (TYPE(obj)) { case T_MODULE: case T_CLASS: klass = obj; s0 = ""; } } NameError("undefined method `%s' for%s `%s'", rb_id2name(node->nd_mid),s0,rb_class2name(klass)); } rb_clear_cache_by_id(node->nd_mid); rb_add_method(the_class, node->nd_mid, 0, NOEX_PUBLIC); result = Qnil; } break; case NODE_ALIAS: rb_alias(the_class, node->nd_new, node->nd_old); rb_funcall(the_class, rb_intern("method_added"), 1, INT2FIX(node->nd_mid)); result = Qnil; break; case NODE_VALIAS: rb_alias_variable(node->nd_new, node->nd_old); result = Qnil; break; case NODE_CLASS: { VALUE super, klass, tmp; if (node->nd_super) { super = superclass(self, node->nd_super); } else { super = 0; } if (rb_const_defined_at(the_class, node->nd_cname) && (the_class != cObject || !rb_autoload_defined(node->nd_cname))) { klass = rb_const_get_at(the_class, node->nd_cname); if (TYPE(klass) != T_CLASS) { TypeError("%s is not a class", rb_id2name(node->nd_cname)); } if (super) { tmp = RCLASS(klass)->super; if (FL_TEST(tmp, FL_SINGLETON)) { tmp = RCLASS(tmp)->super; } while (TYPE(tmp) == T_ICLASS) { tmp = RCLASS(tmp)->super; } if (tmp != super) { TypeError("superclass mismatch for %s", rb_id2name(node->nd_cname)); } } if (safe_level >= 3) { Raise(eSecurityError, "extending class prohibited"); } rb_clear_cache(); } else { if (!super) super = cObject; klass = rb_define_class_id(node->nd_cname, super); rb_const_set(the_class, node->nd_cname, klass); rb_set_class_path(klass,the_class,rb_id2name(node->nd_cname)); obj_call_init(klass); } return module_setup(klass, node->nd_body); } break; case NODE_MODULE: { VALUE module; if (rb_const_defined_at(the_class, node->nd_cname) && (the_class != cObject || !rb_autoload_defined(node->nd_cname))) { module = rb_const_get_at(the_class, node->nd_cname); if (TYPE(module) != T_MODULE) { TypeError("%s is not a module", rb_id2name(node->nd_cname)); } if (safe_level >= 3) { Raise(eSecurityError, "extending module prohibited"); } } else { module = rb_define_module_id(node->nd_cname); rb_const_set(the_class, node->nd_cname, module); rb_set_class_path(module,the_class,rb_id2name(node->nd_cname)); obj_call_init(module); } result = module_setup(module, node->nd_body); } break; case NODE_SCLASS: { VALUE klass; klass = rb_eval(self, node->nd_recv); if (FIXNUM_P(klass)) { TypeError("No virtual class for Fixnums"); } if (NIL_P(klass)) { TypeError("No virtual class for nil"); } if (rb_special_const_p(klass)) { TypeError("No virtual class for special constants"); } if (FL_TEST(CLASS_OF(klass), FL_SINGLETON)) { rb_clear_cache(); } klass = rb_singleton_class(klass); result = module_setup(klass, node->nd_body); } break; case NODE_DEFINED: { char buf[20]; char *desc = is_defined(self, node->nd_head, buf); if (desc) result = str_new2(desc); else result = FALSE; } break; case NODE_NEWLINE: sourcefile = node->nd_file; sourceline = node->nd_nth; if (trace_func) { call_trace_func("line", sourcefile, sourceline, self, the_frame->last_func); } node = node->nd_next; goto again; default: Bug("unknown node type %d", nd_type(node)); } finish: CHECK_INTS; return result; } static VALUE module_setup(module, node) VALUE module; NODE * volatile node; { int state; VALUE save = the_frame->cbase; VALUE result; /* OK */ char *file = sourcefile; int line = sourceline; TMP_PROTECT; /* fill c-ref */ node->nd_clss = module; node = node->nd_body; PUSH_CLASS(); the_class = module; PUSH_SCOPE(); if (node->nd_rval) the_frame->cbase = node->nd_rval; if (node->nd_tbl) { VALUE *vars = TMP_ALLOC(node->nd_tbl[0]+1); *vars++ = (VALUE)node; the_scope->local_vars = vars; memclear(the_scope->local_vars, node->nd_tbl[0]); the_scope->local_tbl = node->nd_tbl; } else { the_scope->local_vars = 0; the_scope->local_tbl = 0; } PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { if (trace_func) { call_trace_func("class", file, line, the_class, the_frame->last_func); } result = rb_eval(the_class, node->nd_body); } POP_TAG(); POP_SCOPE(); POP_CLASS(); the_frame->cbase = save; if (trace_func) { call_trace_func("end", file, line, 0, the_frame->last_func); } if (state) JUMP_TAG(state); return result; } int rb_respond_to(obj, id) VALUE obj; ID id; { if (rb_method_boundp(CLASS_OF(obj), id, 0)) { return TRUE; } return FALSE; } static VALUE obj_respond_to(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE mid, priv; ID id; rb_scan_args(argc, argv, "11", &mid, &priv); id = rb_to_id(mid); if (rb_method_boundp(CLASS_OF(obj), id, !RTEST(priv))) { return TRUE; } return FALSE; } static VALUE mod_method_defined(mod, mid) VALUE mod, mid; { if (rb_method_boundp(mod, rb_to_id(mid), 1)) { return TRUE; } return FALSE; } void rb_exit(status) int status; { if (prot_tag) { exit_status = status; rb_raise(exc_new(eSystemExit, 0, 0)); } exit(status); } static VALUE f_exit(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE status; rb_secure(2); if (rb_scan_args(argc, argv, "01", &status) == 1) { status = NUM2INT(status); } else { status = 0; } rb_exit(status); /* not reached */ } static VALUE f_abort() { rb_secure(2); if (errinfo) { error_print(); } rb_exit(1); /* not reached */ } void rb_iter_break() { JUMP_TAG(TAG_BREAK); } static void rb_longjmp _((int, VALUE)) NORETURN; static VALUE make_backtrace _((void)); static void rb_longjmp(tag, mesg) int tag; VALUE mesg; { VALUE at; if (NIL_P(mesg)) mesg = errinfo; if (NIL_P(mesg)) { mesg = exc_new(eRuntimeError, 0, 0); } at = get_backtrace(mesg); if (NIL_P(at) && sourcefile && !NIL_P(mesg)) { at = make_backtrace(); set_backtrace(mesg, at); } if (!NIL_P(mesg)) { errinfo = mesg; } if (debug && !NIL_P(errinfo) && !obj_is_kind_of(errinfo, eSystemExit)) { fprintf(stderr, "Exception `%s' at %s:%d\n", rb_class2name(CLASS_OF(errinfo)), sourcefile, sourceline); } trap_restore_mask(); if (trace_func && tag != TAG_FATAL) { call_trace_func("raise", sourcefile, sourceline, the_frame->self, the_frame->last_func); } JUMP_TAG(tag); } void rb_raise(mesg) VALUE mesg; { rb_longjmp(TAG_RAISE, mesg); } void rb_fatal(mesg) VALUE mesg; { rb_longjmp(TAG_FATAL, mesg); } void rb_interrupt() { Raise(eInterrupt, ""); } static VALUE f_raise(argc, argv) int argc; VALUE *argv; { VALUE arg1, arg2, arg3; VALUE etype, mesg; int n; etype = eRuntimeError; mesg = Qnil; switch (n = rb_scan_args(argc, argv, "03", &arg1, &arg2, &arg3)) { case 1: mesg = arg1; break; case 3: case 2: etype = arg1; mesg = arg2; break; } if (!NIL_P(mesg)) { if (n >= 2) { mesg = rb_funcall(etype, rb_intern("new"), 1, mesg); } else if (TYPE(mesg) == T_STRING) { mesg = exc_new3(eRuntimeError, mesg); } if (!obj_is_kind_of(mesg, eException)) { TypeError("casting non-exception"); } set_backtrace(mesg, arg3); } PUSH_FRAME(); /* fake frame */ *the_frame = *_frame.prev->prev; rb_longjmp(TAG_RAISE, mesg); POP_FRAME(); } int iterator_p() { if (the_frame->iter) return TRUE; return FALSE; } static VALUE f_iterator_p() { if (the_frame->prev && the_frame->prev->iter) return TRUE; return FALSE; } VALUE rb_yield_0(val, self) VALUE val; volatile VALUE self; { NODE *node; volatile VALUE result = Qnil; struct BLOCK *block; struct SCOPE *old_scope; struct FRAME frame; int state; static unsigned serial = 1; if (!iterator_p() || !the_block) { Raise(eLocalJumpError, "yield called out of iterator"); } PUSH_VARS(); PUSH_CLASS(); block = the_block; frame = block->frame; frame.prev = the_frame; the_frame = &(frame); old_scope = the_scope; the_scope = block->scope; the_block = block->prev; mark_dvar(block->d_vars); the_class = block->klass; if (!self) self = block->self; node = block->body; if (block->var) { if (nd_type(block->var) == NODE_MASGN) massign(self, block->var, val); else assign(self, block->var, val); } PUSH_ITER(block->iter); PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { redo: if (!node) { result = Qnil; } else if (nd_type(node) == NODE_CFUNC) { result = (*node->nd_cfnc)(val, node->nd_tval, self); } else { result = rb_eval(self, node); } } else { switch (state) { case TAG_REDO: state = 0; goto redo; case TAG_NEXT: state = 0; result = Qnil; break; case TAG_BREAK: case TAG_RETURN: state |= (serial++ << 8); state |= 0x10; block->tag->dst = state; break; default: break; } } POP_TAG(); POP_ITER(); POP_CLASS(); POP_VARS(); the_block = block; the_frame = the_frame->prev; the_scope = old_scope; if (state) JUMP_TAG(state); return result; } VALUE rb_yield(val) VALUE val; { return rb_yield_0(val, 0); } static VALUE f_loop() { for (;;) { rb_yield(Qnil); } } static VALUE massign(self, node, val) VALUE self; NODE *node; VALUE val; { NODE *list; int i, len; list = node->nd_head; if (val) { if (TYPE(val) != T_ARRAY) { val = rb_Array(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 { assign(self, node->nd_args, ary_new2(0)); } } } else if (node->nd_args) { assign(self, node->nd_args, Qnil); } while (list) { assign(self, list->nd_head, Qnil); list = list->nd_next; } return val; } static void assign(self, lhs, val) VALUE self; 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(self, lhs->nd_vid, val); break; case NODE_LASGN: if (the_scope->local_vars == 0) Bug("unexpected iterator variable assignment"); the_scope->local_vars[lhs->nd_cnt] = val; break; case NODE_DASGN: dyna_var_asgn(lhs->nd_vid, val); break; case NODE_DASGN_PUSH: dvar_asgn_push(lhs->nd_vid, val); break; case NODE_CASGN: rb_const_set(the_class, lhs->nd_vid, val); break; case NODE_MASGN: massign(self, lhs, val); break; case NODE_CALL: { VALUE recv; recv = rb_eval(self, lhs->nd_recv); if (!lhs->nd_args->nd_head) { /* attr set */ rb_call(CLASS_OF(recv), recv, lhs->nd_mid, 1, &val, 0); } else { /* array set */ VALUE args; args = rb_eval(self, lhs->nd_args); RARRAY(args)->ptr[RARRAY(args)->len-1] = val; rb_call(CLASS_OF(recv), recv, lhs->nd_mid, RARRAY(args)->len, RARRAY(args)->ptr, 0); } } break; default: Bug("bug in variable assignment"); break; } } VALUE rb_iterate(it_proc, data1, bl_proc, data2) VALUE (*it_proc)(), (*bl_proc)(); VALUE data1, data2; { int state; volatile VALUE retval = Qnil; NODE *node = NEW_CFUNC(bl_proc, data2); VALUE self = TopSelf; iter_retry: PUSH_ITER(ITER_PRE); PUSH_BLOCK(0, node); PUSH_TAG(PROT_NONE); state = EXEC_TAG(); if (state == 0) { retval = (*it_proc)(data1); } if (the_block->tag->dst == state) { state &= TAG_MASK; if (state == TAG_RETURN) { retval = prot_tag->retval; } } POP_TAG(); POP_BLOCK(); POP_ITER(); switch (state) { case 0: break; case TAG_RETRY: goto iter_retry; case TAG_BREAK: retval = Qnil; break; case TAG_RETURN: return_value(retval); /* fall through */ default: JUMP_TAG(state); } return retval; } static int handle_rescue(self, node) VALUE self; NODE *node; { int argc; VALUE *argv; /* used in SETUP_ARGS */ TMP_PROTECT; if (!node->nd_args) { return obj_is_kind_of(errinfo, eStandardError); } BEGIN_CALLARGS; SETUP_ARGS(node->nd_args); END_CALLARGS; while (argc--) { if (!obj_is_kind_of(argv[0], cModule)) { TypeError("class or module required for rescue clause"); } if (obj_is_kind_of(errinfo, argv[0])) return 1; argv++; } return 0; } VALUE rb_rescue(b_proc, data1, r_proc, data2) VALUE (*b_proc)(), (*r_proc)(); VALUE data1, data2; { int state; volatile VALUE result; volatile VALUE e_info = errinfo; PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { retry_entry: result = (*b_proc)(data1); } else if (state == TAG_RAISE && obj_is_kind_of(errinfo, eStandardError)) { if (r_proc) { PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { result = (*r_proc)(data2, errinfo); } POP_TAG(); if (state == TAG_RETRY) { state = 0; goto retry_entry; } } else { result = Qnil; state = 0; } if (state == 0) { errinfo = e_info; } } POP_TAG(); if (state) JUMP_TAG(state); return result; } VALUE rb_ensure(b_proc, data1, e_proc, data2) VALUE (*b_proc)(); VALUE (*e_proc)(); VALUE data1, data2; { int state; volatile VALUE result = Qnil; VALUE retval; PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { result = (*b_proc)(data1); } POP_TAG(); retval = prot_tag->retval; /* save retval */ (*e_proc)(data2); return_value(retval); if (state) { JUMP_TAG(state); } return result; } static int last_call_status; #define CSTAT_PRIV 1 #define CSTAT_PROT 2 #define CSTAT_VCALL 4 static VALUE f_missing(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { ID id; VALUE desc = 0; char *format = 0; char *file = sourcefile; int line = sourceline; id = FIX2INT(argv[0]); argc--; argv++; switch (TYPE(obj)) { case T_NIL: format = "undefined method `%s' for nil"; break; case T_TRUE: format = "undefined method `%s' for TRUE"; break; case T_FALSE: format = "undefined method `%s' for FALSE"; break; case T_OBJECT: desc = any_to_s(obj); break; default: desc = rb_inspect(obj); break; } if (desc) { if (last_call_status & CSTAT_PRIV) { format = "private method `%s' called for %s"; } if (last_call_status & CSTAT_PROT) { format = "protected method `%s' called for %s"; } else if (iterator_p()) { format = "undefined iterator `%s' for %s"; } else if (last_call_status & CSTAT_VCALL) { char *mname = rb_id2name(id); if (('a' <= mname[0] && mname[0] <= 'z') || mname[0] == '_') { format = "undefined local variable or method `%s' for %s"; } } if (!format) { format = "undefined method `%s' for %s"; } if (RSTRING(desc)->len > 65) { desc = any_to_s(obj); } } sourcefile = file; sourceline = line; PUSH_FRAME(); /* fake frame */ *the_frame = *_frame.prev->prev; NameError(format, rb_id2name(id), desc?(char*)RSTRING(desc)->ptr:""); POP_FRAME(); return Qnil; /* not reached */ } static VALUE rb_undefined(obj, id, argc, argv, call_status) VALUE obj; ID id; int argc; VALUE*argv; int call_status; { VALUE *nargv; nargv = ALLOCA_N(VALUE, argc+1); nargv[0] = INT2FIX(id); MEMCPY(nargv+1, argv, VALUE, argc); last_call_status = call_status; return rb_funcall2(obj, rb_intern("method_missing"), argc+1, nargv); } #ifdef DJGPP # define STACK_LEVEL_MAX 65535 #else #ifdef __human68k__ extern int _stacksize; # define STACK_LEVEL_MAX (_stacksize - 4096) #else # define STACK_LEVEL_MAX 655350 #endif #endif extern VALUE *gc_stack_start; static int stack_length() { VALUE pos; #ifdef sparc return gc_stack_start - &pos + 0x80; #else return (&pos < gc_stack_start) ? gc_stack_start - &pos : &pos - gc_stack_start; #endif } static VALUE rb_call0(klass, recv, id, argc, argv, body, nosuper) VALUE klass, recv; ID id; int argc; /* OK */ VALUE *argv; /* OK */ NODE *body; int nosuper; { NODE *b2; /* OK */ volatile VALUE result = Qnil; int itr; static int tick; TMP_PROTECT; switch (the_iter->iter) { case ITER_PRE: itr = ITER_CUR; break; case ITER_CUR: default: itr = ITER_NOT; break; } if ((++tick & 0x3ff) == 0 && stack_length() > STACK_LEVEL_MAX) Raise(eSysStackError, "stack level too deep"); PUSH_ITER(itr); PUSH_FRAME(); the_frame->last_func = id; the_frame->last_class = nosuper?0:klass; the_frame->self = recv; the_frame->argc = argc; the_frame->argv = argv; switch (nd_type(body)) { case NODE_CFUNC: { int len = body->nd_argc; if (len >= 0 && argc != len) { ArgError("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(klass), rb_id2name(id)); } else { ArgError("too many arguments(%d)", len); } break; } } break; case NODE_IVAR: /* for attr get */ if (argc != 0) { ArgError("Wrong # of arguments(%d for 0)", argc); } case NODE_ATTRSET: /* for attr set */ case NODE_ZSUPER: /* for re-scoped/renamed method */ result = rb_eval(recv, body); break; default: { int state; VALUE *local_vars; /* OK */ PUSH_SCOPE(); if (body->nd_rval) the_frame->cbase = body->nd_rval; if (body->nd_tbl) { local_vars = TMP_ALLOC(body->nd_tbl[0]+1); *local_vars++ = (VALUE)body; memclear(local_vars, body->nd_tbl[0]); the_scope->local_tbl = body->nd_tbl; the_scope->local_vars = local_vars; } else { local_vars = the_scope->local_vars = 0; the_scope->local_tbl = 0; } b2 = body = body->nd_body; PUSH_TAG(PROT_FUNC); PUSH_VARS(); if ((state = EXEC_TAG()) == 0) { NODE *node = 0; int i; if (nd_type(body) == NODE_ARGS) { node = body; body = 0; } else if (nd_type(body) == NODE_BLOCK) { node = body->nd_head; body = body->nd_next; } if (node) { if (nd_type(node) != NODE_ARGS) { Bug("no argument-node"); } i = node->nd_cnt; if (i > argc) { ArgError("Wrong # of arguments(%d for %d)", argc, i); } if (node->nd_rest == -1) { int opt = argc - i; NODE *optnode = node->nd_opt; while (optnode) { opt--; optnode = optnode->nd_next; } if (opt > 0) { ArgError("Wrong # of arguments(%d for %d)", argc, argc-opt); } } if (local_vars) { if (i > 0) { /* +2 for $_ and $~ */ MEMCPY(local_vars+2, argv, VALUE, i); } argv += i; argc -= i; if (node->nd_opt) { NODE *opt = node->nd_opt; while (opt && argc) { assign(recv, opt->nd_head, *argv); argv++; argc--; opt = opt->nd_next; } rb_eval(recv, opt); } if (node->nd_rest >= 0) { if (argc > 0) local_vars[node->nd_rest]=ary_new4(argc,argv); else local_vars[node->nd_rest]=ary_new2(0); } } } if (trace_func) { call_trace_func("call", b2->nd_file, nd_line(b2), recv, the_frame->last_func); } result = rb_eval(recv, body); } else if (state == TAG_RETURN) { result = prot_tag->retval; state = 0; } POP_VARS(); POP_TAG(); POP_SCOPE(); if (trace_func) { char *file = the_frame->prev->file; int line = the_frame->prev->line; if (!file) { file = sourcefile; line = sourceline; } call_trace_func("return", file, line, 0, the_frame->last_func); } switch (state) { case 0: break; case TAG_NEXT: Raise(eLocalJumpError, "unexpected next"); break; case TAG_BREAK: Raise(eLocalJumpError, "unexpected break"); break; case TAG_REDO: Raise(eLocalJumpError, "unexpected redo"); break; case TAG_RETRY: if (!iterator_p()) { Raise(eLocalJumpError, "retry outside of rescue clause"); } default: JUMP_TAG(state); } } } POP_FRAME(); POP_ITER(); return result; } static VALUE rb_call(klass, recv, mid, argc, argv, scope) VALUE klass, recv; ID mid; int argc; /* OK */ VALUE *argv; /* OK */ int scope; { NODE *body; /* OK */ int noex; ID id = mid; struct cache_entry *ent; /* is it in the method cache? */ ent = cache + EXPR1(klass, mid); if (ent->mid == mid && ent->klass == klass) { klass = ent->origin; id = ent->mid0; noex = ent->noex; body = ent->method; } else if ((body = rb_get_method_body(&klass, &id, &noex)) == 0) { if (scope == 3) { NameError("super: no superclass method `%s'", rb_id2name(mid)); } return rb_undefined(recv, mid, argc, argv, scope==2?CSTAT_VCALL:0); } /* receiver specified form for private method */ if ((noex & NOEX_PRIVATE) && scope == 0) return rb_undefined(recv, mid, argc, argv, CSTAT_PRIV); /* self must be kind of a specified form for private method */ if ((noex & NOEX_PROTECTED) && !obj_is_kind_of(the_frame->self, klass)) return rb_undefined(recv, mid, argc, argv, CSTAT_PROT); return rb_call0(klass, recv, id, argc, argv, body, noex & NOEX_UNDEF); } VALUE rb_apply(recv, mid, args) VALUE recv; ID mid; VALUE args; { 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 f_send(argc, argv, recv) int argc; VALUE *argv; VALUE recv; { VALUE vid; if (argc == 0) ArgError("no method name given"); vid = *argv++; argc--; PUSH_ITER(iterator_p()?ITER_PRE:ITER_NOT); vid = rb_call(CLASS_OF(recv), recv, rb_to_id(vid), argc, argv, 1); POP_ITER(); return vid; } #ifdef HAVE_STDARG_PROTOTYPES #include #define va_init_list(a,b) va_start(a,b) #else #include #define va_init_list(a,b) va_start(a) #endif VALUE #ifdef HAVE_STDARG_PROTOTYPES rb_funcall(VALUE recv, ID mid, int n, ...) #else rb_funcall(recv, mid, n, va_alist) VALUE recv; ID mid; int n; va_dcl #endif { va_list ar; VALUE *argv; if (n > 0) { int i; argv = ALLOCA_N(VALUE, n); va_init_list(ar, n); for (i=0;ilast_func) { snprintf(buf, BUFSIZ, "%s:%d:in `%s'", sourcefile, sourceline, rb_id2name(frame->last_func)); } else { snprintf(buf, BUFSIZ, "%s:%d", sourcefile, sourceline); } ary_push(ary, str_new2(buf)); } else { while (lev-- > 0) { frame = frame->prev; if (!frame) return Qnil; } } while (frame && frame->file) { if (frame->prev && frame->prev->last_func) { snprintf(buf, BUFSIZ, "%s:%d:in `%s'", frame->file, frame->line, rb_id2name(frame->prev->last_func)); } else { snprintf(buf, BUFSIZ, "%s:%d", frame->file, frame->line); } ary_push(ary, str_new2(buf)); frame = frame->prev; } safe_level = slev; return ary; } static VALUE f_caller(argc, argv) int argc; VALUE *argv; { VALUE level; int lev; rb_scan_args(argc, argv, "01", &level); if (NIL_P(level)) lev = 1; else lev = NUM2INT(level); if (lev < 0) ArgError("negative level(%d)", lev); return backtrace(lev); } void rb_backtrace() { int i, lev; VALUE ary; lev = INT2FIX(0); ary = backtrace(-1); for (i=0; ilen; i++) { printf("\tfrom %s\n", RSTRING(RARRAY(ary)->ptr[i])->ptr); } } static VALUE make_backtrace() { VALUE lev; lev = INT2FIX(0); return backtrace(-1); } ID rb_frame_last_func() { return the_frame->last_func; } static NODE* compile(src, place) VALUE src; char *place; { NODE *node; Check_Type(src, T_STRING); if (place == 0) place = sourcefile; node = compile_string(place, RSTRING(src)->ptr, RSTRING(src)->len); if (nerrs == 0) return node; return 0; } static VALUE eval(self, src, scope, file, line) VALUE self, src, scope; char *file; int line; { struct BLOCK *data; volatile VALUE result = Qnil; struct SCOPE * volatile old_scope; struct BLOCK * volatile old_block; struct RVarmap * volatile old_d_vars; int volatile old_vmode; struct FRAME frame; char *filesave = sourcefile; int linesave = sourceline; volatile int iter = the_frame->iter; int state; if (file == 0) { file = sourcefile; line = sourceline; } if (!NIL_P(scope)) { if (!obj_is_block(scope)) { TypeError("wrong argument type %s (expected Proc/Binding)", rb_class2name(CLASS_OF(scope))); } Data_Get_Struct(scope, struct BLOCK, data); /* PUSH BLOCK from data */ frame = data->frame; frame.prev = the_frame; the_frame = &(frame); old_scope = the_scope; the_scope = data->scope; old_block = the_block; the_block = data->prev; old_d_vars = the_dyna_vars; the_dyna_vars = data->d_vars; old_vmode = scope_vmode; scope_vmode = data->vmode; self = data->self; the_frame->iter = data->iter; } else { if (the_frame->prev) { the_frame->iter = the_frame->prev->iter; } } PUSH_CLASS(); the_class = ((NODE*)the_frame->cbase)->nd_clss; rb_in_eval++; if (TYPE(the_class) == T_ICLASS) { the_class = RBASIC(the_class)->klass; } PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { sourcefile = file; sourceline = line; compile(src, file); if (nerrs > 0) { compile_error(0); } result = eval_node(self); } POP_TAG(); POP_CLASS(); rb_in_eval--; if (!NIL_P(scope)) { the_frame = the_frame->prev; the_scope = old_scope; the_block = old_block; data->d_vars = the_dyna_vars; the_dyna_vars = old_d_vars; data->vmode = scope_vmode; /* write back visibility mode */ scope_vmode = old_vmode; } else { the_frame->iter = iter; } sourcefile = filesave; sourceline = linesave; if (state) { if (state == TAG_RAISE) { VALUE err; VALUE errat; errat = get_backtrace(errinfo); if (strcmp(file, "(eval)") == 0) { if (sourceline > 1) { err = RARRAY(errat)->ptr[0]; str_cat(err, ": ", 2); str_concat(err, errinfo); } else { err = str_dup(errinfo); } errat = Qnil; rb_raise(exc_new3(CLASS_OF(errinfo), err)); } rb_raise(errinfo); } JUMP_TAG(state); } return result; } static VALUE f_eval(argc, argv, self) int argc; VALUE *argv; VALUE self; { VALUE src, scope, vfile, vline; char *file = "(eval)"; int line = 0; rb_scan_args(argc, argv, "13", &src, &scope, &vfile, &vline); if (argc >= 3) { Check_Type(vfile, T_STRING); file = RSTRING(vfile)->ptr; } if (argc >= 4) { line = NUM2INT(vline); } Check_SafeStr(src); return eval(self, src, scope, file, line); } static VALUE exec_under(func, under, args) VALUE (*func)(); VALUE under; void *args; { VALUE val; /* OK */ int state; int mode; VALUE cbase = the_frame->cbase; PUSH_CLASS(); the_class = under; PUSH_FRAME(); the_frame->last_func = _frame.prev->last_func; the_frame->last_class = _frame.prev->last_class; the_frame->argc = _frame.prev->argc; the_frame->argv = _frame.prev->argv; the_frame->cbase = (VALUE)node_newnode(NODE_CREF,under,0,cbase); mode = scope_vmode; SCOPE_SET(SCOPE_PUBLIC); PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { val = (*func)(args); } POP_TAG(); SCOPE_SET(mode); POP_FRAME(); POP_CLASS(); if (state) JUMP_TAG(state); return val; } static VALUE eval_under_i(args) VALUE *args; { return eval(args[0], args[1], Qnil, (char*)args[2], (int)args[3]); } static VALUE eval_under(under, self, src, file, line) VALUE under, self, src; char *file; int line; { VALUE args[4]; args[0] = self; args[1] = src; args[2] = (VALUE)file; args[3] = (VALUE)line; return exec_under(eval_under_i, under, args); } static VALUE yield_under_i(self) VALUE self; { return rb_yield_0(self, self); } static VALUE yield_under(under, self) VALUE under, self; { return exec_under(yield_under_i, under, self); } static VALUE obj_instance_eval(argc, argv, self) int argc; VALUE *argv; VALUE self; { char *file = 0; int line = 0; if (argc == 0) { if (!iterator_p()) { ArgError("block not supplied"); } } else if (argc < 4) { Check_SafeStr(argv[0]); if (argc > 1) file = STR2CSTR(argv[1]); if (argc > 2) line = NUM2INT(argv[2]); } else { ArgError("Wrong # of arguments: %s(src) or %s{..}", rb_id2name(the_frame->last_func), rb_id2name(the_frame->last_func)); } if (argc == 0) { return yield_under(rb_singleton_class(self), self); } else { return eval_under(rb_singleton_class(self), self, argv[0], file, line); } } static VALUE mod_module_eval(argc, argv, mod) int argc; VALUE *argv; VALUE mod; { char *file = 0; int line = 0; if (argc == 0) { if (!iterator_p()) { ArgError("block not supplied"); } } else if (argc < 4) { Check_SafeStr(argv[0]); if (argc > 1) file = STR2CSTR(argv[1]); if (argc > 2) line = NUM2INT(argv[2]); } else { ArgError("Wrong # of arguments: %s(src) or %s{..}", rb_id2name(the_frame->last_func), rb_id2name(the_frame->last_func)); } if (argc == 0) { return yield_under(mod, mod); } else { return eval_under(mod, mod, argv[0], file, line); } } VALUE rb_load_path; static int is_absolute_path(path) char *path; { if (path[0] == '/') return 1; # if defined(MSDOS) || defined(NT) || defined(__human68k__) if (path[0] == '\\') return 1; if (strlen(path) > 2 && path[1] == ':') return 1; # endif return 0; } static char* find_file(file) char *file; { extern VALUE rb_load_path; VALUE vpath; char *path; if (is_absolute_path(file)) { FILE *f = fopen(file, "r"); if (f == NULL) return 0; fclose(f); return file; } if (rb_load_path) { int i; Check_Type(rb_load_path, T_ARRAY); for (i=0;ilen;i++) { Check_SafeStr(RARRAY(rb_load_path)->ptr[i]); } vpath = ary_join(rb_load_path, str_new2(RUBY_LIB_SEP)); Check_SafeStr(vpath); path = RSTRING(vpath)->ptr; } else { path = 0; } return dln_find_file(file, path); } VALUE f_load(obj, fname) VALUE obj, fname; { int state; char *file; volatile ID last_func; TMP_PROTECT; Check_SafeStr(fname); #ifndef __MACOS__ if (RSTRING(fname)->ptr[0] == '~') { fname = file_s_expand_path(1, &fname); } #endif file = find_file(RSTRING(fname)->ptr); if (!file) LoadError("No such file to load -- %s", RSTRING(fname)->ptr); PUSH_VARS(); PUSH_TAG(PROT_NONE); PUSH_CLASS(); the_class = cObject; PUSH_SCOPE(); if (top_scope->local_tbl) { int len = top_scope->local_tbl[0]+1; ID *tbl = ALLOC_N(ID, len); VALUE *vars = TMP_ALLOC(len); *vars++ = 0; MEMCPY(tbl, top_scope->local_tbl, ID, len); MEMCPY(vars, top_scope->local_vars, ID, len-1); the_scope->local_tbl = tbl; the_scope->local_vars = vars; } /* default visibility is private at loading toplevel */ SCOPE_SET(SCOPE_PRIVATE); state = EXEC_TAG(); last_func = the_frame->last_func; the_frame->last_func = 0; if (state == 0) { rb_in_eval++; rb_load_file(file); rb_in_eval--; if (nerrs == 0) { eval_node(TopSelf); } } the_frame->last_func = last_func; if (the_scope->flag == SCOPE_ALLOCA && the_scope->local_tbl) { free(the_scope->local_tbl); } POP_SCOPE(); POP_CLASS(); POP_TAG(); POP_VARS(); if (nerrs > 0) { rb_raise(errinfo); } if (state) JUMP_TAG(state); return TRUE; } static VALUE rb_features; static int rb_provided(feature) char *feature; { VALUE *p, *pend; char *f; int len; p = RARRAY(rb_features)->ptr; pend = p + RARRAY(rb_features)->len; while (p < pend) { f = STR2CSTR(*p); if (strcmp(f, feature) == 0) return TRUE; len = strlen(feature); if (strncmp(f, feature, len) == 0 && (strcmp(f+len, ".rb") == 0 ||strcmp(f+len, ".o") == 0)) { return TRUE; } p++; } return FALSE; } #ifdef THREAD static int thread_loading _((char*)); static void thread_loading_done _((void)); #endif void rb_provide(feature) char *feature; { char *buf, *ext; if (!rb_provided(feature)) { ext = strrchr(feature, '.'); if (strcmp(DLEXT, ext) == 0) { buf = ALLOCA_N(char, strlen(feature)+1); strcpy(buf, feature); ext = strrchr(buf, '.'); strcpy(ext, ".o"); feature = buf; } ary_push(rb_features, str_new2(feature)); } } VALUE f_require(obj, fname) VALUE obj, fname; { char *ext, *file, *feature, *buf; /* OK */ volatile VALUE load; Check_SafeStr(fname); if (rb_provided(RSTRING(fname)->ptr)) return FALSE; ext = strrchr(RSTRING(fname)->ptr, '.'); if (ext) { if (strcmp(".rb", ext) == 0) { feature = file = RSTRING(fname)->ptr; file = find_file(file); if (file) goto rb_load; } else if (strcmp(".o", ext) == 0) { file = feature = RSTRING(fname)->ptr; if (strcmp(".o", DLEXT) != 0) { buf = ALLOCA_N(char, strlen(file)+sizeof(DLEXT)+1); strcpy(buf, feature); ext = strrchr(buf, '.'); strcpy(ext, DLEXT); file = find_file(buf); } if (file) goto dyna_load; } else if (strcmp(DLEXT, ext) == 0) { feature = RSTRING(fname)->ptr; file = find_file(feature); if (file) goto dyna_load; } } buf = ALLOCA_N(char, strlen(RSTRING(fname)->ptr) + 5); sprintf(buf, "%s.rb", RSTRING(fname)->ptr); file = find_file(buf); if (file) { fname = str_new2(file); feature = buf; goto rb_load; } sprintf(buf, "%s%s", RSTRING(fname)->ptr, DLEXT); file = find_file(buf); if (file) { feature = buf; goto dyna_load; } LoadError("No such file to load -- %s", RSTRING(fname)->ptr); dyna_load: #ifdef THREAD if (thread_loading(feature)) return FALSE; else { int state; PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { #endif load = str_new2(file); file = RSTRING(load)->ptr; dln_load(file); rb_provide(feature); #ifdef THREAD } POP_TAG(); thread_loading_done(); if (state) JUMP_TAG(state); } #endif return TRUE; rb_load: #ifdef THREAD if (thread_loading(feature)) return FALSE; else { int state; PUSH_TAG(PROT_NONE); if ((state = EXEC_TAG()) == 0) { #endif f_load(obj, fname); rb_provide(feature); #ifdef THREAD } POP_TAG(); thread_loading_done(); if (state) JUMP_TAG(state); } #endif return TRUE; } static void set_method_visibility(self, argc, argv, ex) VALUE self; int argc; VALUE *argv; int ex; { int i; for (i=0; ind_body == 0) { NameError("undefined method `%s' for module `%s'", rb_id2name(id), rb_class2name(module)); } rb_clear_cache_by_id(id); rb_add_method(rb_singleton_class(module), id, body->nd_body, NOEX_PUBLIC); } return module; } static VALUE mod_append_features(module, include) VALUE module, include; { switch (TYPE(include)) { case T_CLASS: case T_MODULE: break; default: Check_Type(include, T_CLASS); break; } rb_include_module(include, module); return module; } static VALUE mod_include(argc, argv, module) int argc; VALUE *argv; VALUE module; { int i; for (i=0; iargc, the_frame->argv); POP_ITER(); } VALUE class_new_instance(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { VALUE obj; if (FL_TEST(klass, FL_SINGLETON)) { TypeError("can't create instance of virtual class"); } obj = obj_alloc(klass); obj_call_init(obj); return obj; } static VALUE top_include(argc, argv) int argc; VALUE *argv; { rb_secure(4); return mod_include(argc, argv, cObject); } void rb_extend_object(obj, module) VALUE obj, module; { rb_include_module(rb_singleton_class(obj), module); } static VALUE mod_extend_object(mod, obj) VALUE mod, obj; { rb_extend_object(obj, mod); return obj; } static VALUE obj_extend(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { int i; for (i=0; ilocal_tbl; if (tbl) { n = *tbl++; for (i=2; iid) { ary_push(ary, str_new2(rb_id2name(vars->id))); } vars = vars->next; } return ary; } static VALUE f_catch(); static VALUE f_throw(); struct end_proc_data { void (*func)(); VALUE data; struct end_proc_data *next; } *end_proc_data; void rb_set_end_proc(func, data) void (*func)(); VALUE data; { struct end_proc_data *link = ALLOC(struct end_proc_data); link->next = end_proc_data; link->func = func; link->data = data; rb_global_variable(&link->data); end_proc_data = link; } static void call_end_proc(data) VALUE data; { proc_call(data, Qnil); } static void f_END() { PUSH_FRAME(); the_frame->argc = 0; rb_set_end_proc(call_end_proc, f_lambda()); POP_FRAME(); } static VALUE f_at_exit() { VALUE proc; proc = f_lambda(); rb_set_end_proc(call_end_proc, proc); return proc; } static void exec_end_proc() { struct end_proc_data *link = end_proc_data; while (link) { (*link->func)(link->data); link = link->next; } } void Init_eval() { init = rb_intern("initialize"); eqq = rb_intern("==="); each = rb_intern("each"); aref = rb_intern("[]"); aset = rb_intern("[]="); match = rb_intern("=~"); rb_global_variable((VALUE*)&top_scope); rb_global_variable((VALUE*)&eval_tree_begin); rb_global_variable((VALUE*)&eval_tree); rb_global_variable((VALUE*)&the_dyna_vars); rb_define_virtual_variable("$@", errat_getter, errat_setter); rb_define_hooked_variable("$!", &errinfo, 0, errinfo_setter); rb_define_global_function("eval", f_eval, -1); rb_define_global_function("iterator?", f_iterator_p, 0); rb_define_global_function("method_missing", f_missing, -1); rb_define_global_function("loop", f_loop, 0); rb_define_method(mKernel, "respond_to?", obj_respond_to, -1); rb_define_global_function("raise", f_raise, -1); rb_define_alias(mKernel, "fail", "raise"); rb_define_global_function("caller", f_caller, -1); rb_define_global_function("exit", f_exit, -1); rb_define_global_function("abort", f_abort, 0); rb_define_global_function("at_exit", f_at_exit, 0); rb_define_global_function("catch", f_catch, 1); rb_define_global_function("throw", f_throw, -1); rb_define_global_function("global_variables", f_global_variables, 0); rb_define_global_function("local_variables", f_local_variables, 0); rb_define_method(mKernel, "send", f_send, -1); rb_define_method(mKernel, "__send__", f_send, -1); rb_define_method(mKernel, "instance_eval", obj_instance_eval, -1); rb_define_private_method(cModule, "append_features", mod_append_features, 1); rb_define_private_method(cModule, "extend_object", mod_extend_object, 1); rb_define_private_method(cModule, "include", mod_include, -1); rb_define_private_method(cModule, "public", mod_public, -1); rb_define_private_method(cModule, "protected", mod_protected, -1); rb_define_private_method(cModule, "private", mod_private, -1); rb_define_private_method(cModule, "module_function", mod_modfunc, -1); rb_define_method(cModule, "method_defined?", mod_method_defined, 1); rb_define_method(cModule, "public_class_method", mod_public_method, -1); rb_define_method(cModule, "private_class_method", mod_private_method, -1); rb_define_method(cModule, "module_eval", mod_module_eval, -1); rb_define_method(cModule, "class_eval", mod_module_eval, -1); rb_define_private_method(cModule, "remove_method", mod_remove_method, 1); rb_define_private_method(cModule, "undef_method", mod_undef_method, 1); rb_define_private_method(cModule, "alias_method", mod_alias_method, 2); rb_define_singleton_method(cModule, "nesting", mod_nesting, 0); rb_define_singleton_method(cModule, "constants", mod_s_constants, 0); rb_define_singleton_method(TopSelf, "include", top_include, -1); rb_define_singleton_method(TopSelf, "public", top_public, -1); rb_define_singleton_method(TopSelf, "private", top_private, -1); rb_define_method(mKernel, "extend", obj_extend, -1); rb_define_global_function("trace_var", f_trace_var, -1); rb_define_global_function("untrace_var", f_untrace_var, -1); rb_define_global_function("set_trace_func", set_trace_func, 1); rb_define_virtual_variable("$SAFE", safe_getter, safe_setter); } VALUE f_autoload(); void Init_load() { rb_load_path = ary_new(); rb_define_readonly_variable("$:", &rb_load_path); rb_define_readonly_variable("$-I", &rb_load_path); rb_define_readonly_variable("$LOAD_PATH", &rb_load_path); rb_features = ary_new(); rb_define_readonly_variable("$\"", &rb_features); rb_define_global_function("load", f_load, 1); rb_define_global_function("require", f_require, 1); rb_define_global_function("autoload", f_autoload, 2); } static void scope_dup(scope) struct SCOPE *scope; { ID *tbl; VALUE *vars; if (scope->flag & SCOPE_MALLOC) return; if (scope->local_tbl) { tbl = scope->local_tbl; vars = ALLOC_N(VALUE, tbl[0]+1); *vars++ = scope->local_vars[-1]; MEMCPY(vars, scope->local_vars, VALUE, tbl[0]); scope->local_vars = vars; scope->flag = SCOPE_MALLOC; } else { scope->flag = SCOPE_NOSTACK; } } static void blk_mark(data) struct BLOCK *data; { while (data) { gc_mark_frame(&data->frame); gc_mark(data->scope); gc_mark(data->var); gc_mark(data->body); gc_mark(data->self); gc_mark(data->d_vars); gc_mark(data->klass); data = data->prev; } } static void blk_free(data) struct BLOCK *data; { struct BLOCK *tmp; while (data) { free(data->frame.argv); tmp = data; data = data->prev; free(tmp); } } static void blk_copy_prev(block) struct BLOCK *block; { struct BLOCK *tmp; while (block->prev) { tmp = ALLOC_N(struct BLOCK, 1); MEMCPY(tmp, block->prev, struct BLOCK, 1); tmp->frame.argv = ALLOC_N(VALUE, tmp->frame.argc); MEMCPY(tmp->frame.argv, block->frame.argv, VALUE, tmp->frame.argc); block->prev = tmp; block = tmp; } } static VALUE bind_clone(self) VALUE self; { struct BLOCK *orig, *data; VALUE bind; Data_Get_Struct(self, struct BLOCK, orig); bind = Data_Make_Struct(self,struct BLOCK,blk_mark,blk_free,data); MEMCPY(data, orig, struct BLOCK, 1); data->frame.argv = ALLOC_N(VALUE, orig->frame.argc); MEMCPY(data->frame.argv, orig->frame.argv, VALUE, orig->frame.argc); if (data->iter) { blk_copy_prev(data); } else { data->prev = 0; } return bind; } static VALUE f_binding(self) VALUE self; { struct BLOCK *data; VALUE bind; PUSH_BLOCK(0,0); bind = Data_Make_Struct(cBinding,struct BLOCK,blk_mark,blk_free,data); MEMCPY(data, the_block, struct BLOCK, 1); #ifdef THREAD data->orig_thread = thread_current(); #endif data->iter = f_iterator_p(); if (the_frame->prev) { data->frame.last_func = the_frame->prev->last_func; } data->frame.argv = ALLOC_N(VALUE, data->frame.argc); MEMCPY(data->frame.argv, the_block->frame.argv, VALUE, data->frame.argc); if (data->iter) { blk_copy_prev(data); } else { data->prev = 0; } scope_dup(data->scope); POP_BLOCK(); return bind; } #define PROC_TAINT FL_USER0 #define PROC_T3 FL_USER1 #define PROC_T4 FL_USER2 #define PROC_T5 (FL_USER1|FL_USER2) #define PROC_TMASK (FL_USER1|FL_USER2) static VALUE proc_s_new(klass) VALUE klass; { volatile VALUE proc; struct BLOCK *data; if (!iterator_p() && !f_iterator_p()) { ArgError("tryed to create Procedure-Object out of iterator"); } proc = Data_Make_Struct(klass, struct BLOCK, blk_mark, blk_free, data); *data = *the_block; #ifdef THREAD data->orig_thread = thread_current(); #endif data->iter = data->prev?TRUE:FALSE; data->frame.argv = ALLOC_N(VALUE, data->frame.argc); MEMCPY(data->frame.argv, the_block->frame.argv, VALUE, data->frame.argc); if (data->iter) { blk_copy_prev(data); } else { data->prev = 0; } scope_dup(data->scope); if (safe_level >= 3) { FL_SET(proc, PROC_TAINT); switch (safe_level) { case 3: FL_SET(proc, PROC_T3); break; case 4: FL_SET(proc, PROC_T4); break; case 5: FL_SET(proc, PROC_T5); break; } } obj_call_init(proc); return proc; } VALUE f_lambda() { return proc_s_new(cProc); } static int blk_orphan(data) struct BLOCK *data; { if (data->scope && data->scope != top_scope && (data->scope->flag & SCOPE_NOSTACK)) { return 1; } #ifdef THREAD if (data->orig_thread != thread_current()) { return 1; } #endif return 0; } static VALUE proc_call(proc, args) VALUE proc, args; /* OK */ { struct BLOCK * volatile old_block; struct BLOCK *data, data_body; volatile VALUE result = Qnil; int state; volatile int orphan; volatile int safe = safe_level; if (TYPE(args) == T_ARRAY) { switch (RARRAY(args)->len) { case 0: args = Qnil; break; case 1: args = RARRAY(args)->ptr[0]; break; } } Data_Get_Struct(proc, struct BLOCK, data); orphan = blk_orphan(data); /* PUSH BLOCK from data */ old_block = the_block; #if 0 the_block = data; #else data_body = *data; the_block = &data_body; #endif PUSH_ITER(ITER_CUR); the_frame->iter = ITER_CUR; if (orphan) {/* orphan procedure */ if (iterator_p()) { the_block->frame.iter = ITER_CUR; } else { the_block->frame.iter = ITER_NOT; } } if (FL_TEST(proc, PROC_TAINT)) { switch (RBASIC(proc)->flags & PROC_TMASK) { case PROC_T3: safe_level = 3; break; case PROC_T4: safe_level = 4; break; case PROC_T5: safe_level = 5; break; } } PUSH_TAG(PROT_NONE); state = EXEC_TAG(); if (state == 0) { result = rb_yield(args); } POP_TAG(); POP_ITER(); if (the_block->tag->dst == state) { state &= TAG_MASK; } the_block = old_block; safe_level = safe; if (state) { if (orphan) {/* orphan procedure */ switch (state) { case TAG_BREAK: Raise(eLocalJumpError, "break from proc-closure"); break; case TAG_RETRY: Raise(eLocalJumpError, "retry from proc-closure"); break; case TAG_RETURN: Raise(eLocalJumpError, "return from proc-closure"); break; } } JUMP_TAG(state); } return result; } static VALUE block_pass(self, node) VALUE self; NODE *node; { VALUE block = rb_eval(self, node->nd_body); struct BLOCK * volatile old_block; struct BLOCK *data, data_body; volatile VALUE result = Qnil; int state; volatile int orphan; volatile int safe = safe_level; if (NIL_P(block)) { return rb_eval(self, node->nd_iter); } if (obj_is_kind_of(block, cMethod)) { block = method_proc(block); } else if (!obj_is_proc(block)) { TypeError("wrong argument type %s (expected Proc)", rb_class2name(CLASS_OF(block))); } Data_Get_Struct(block, struct BLOCK, data); orphan = blk_orphan(data); /* PUSH BLOCK from data */ old_block = the_block; #if 0 the_block = data; #else data_body = *data; the_block = &data_body; #endif PUSH_ITER(ITER_PRE); the_frame->iter = ITER_PRE; if (FL_TEST(block, PROC_TAINT)) { switch (RBASIC(block)->flags & PROC_TMASK) { case PROC_T3: safe_level = 3; break; case PROC_T4: safe_level = 4; break; case PROC_T5: safe_level = 5; break; } } PUSH_TAG(PROT_NONE); state = EXEC_TAG(); if (state == 0) { result = rb_eval(self, node->nd_iter); } POP_TAG(); POP_ITER(); if (the_block->tag->dst == state) { state &= TAG_MASK; orphan = 2; } the_block = old_block; safe_level = safe; if (state) { if (orphan == 2) {/* escape from orphan procedure */ switch (state) { case TAG_BREAK: Raise(eLocalJumpError, "break from proc-closure"); break; case TAG_RETRY: Raise(eLocalJumpError, "retry from proc-closure"); break; case TAG_RETURN: Raise(eLocalJumpError, "return from proc-closure"); break; } } JUMP_TAG(state); } return result; } struct METHOD { VALUE klass, oklass; VALUE recv; ID id, oid; NODE *body; }; static void bm_mark(data) struct METHOD *data; { gc_mark(data->oklass); gc_mark(data->klass); gc_mark(data->recv); gc_mark(data->body); } static VALUE obj_method(obj, vid) VALUE obj; VALUE vid; { VALUE method; VALUE klass = CLASS_OF(obj); ID id; NODE *body; int noex; struct METHOD *data; id = rb_to_id(vid); again: if ((body = rb_get_method_body(&klass, &id, &noex)) == 0) { return rb_undefined(obj, rb_to_id(vid), 0, 0, 0); } if (nd_type(body) == NODE_ZSUPER) { klass = RCLASS(klass)->super; goto again; } method = Data_Make_Struct(cMethod, struct METHOD, bm_mark, free, data); data->klass = klass; data->recv = obj; data->id = id; data->body = body; data->oklass = CLASS_OF(obj); data->oid = rb_to_id(vid); return method; } static VALUE method_call(argc, argv, method) int argc; VALUE *argv; VALUE method; { VALUE result; struct METHOD *data; Data_Get_Struct(method, struct METHOD, data); PUSH_ITER(iterator_p()?ITER_PRE:ITER_NOT); result = rb_call0(data->klass, data->recv, data->id, argc, argv, data->body, 0); POP_ITER(); return result; } static VALUE method_inspect(method) VALUE method; { struct METHOD *data; VALUE str; char *s; Data_Get_Struct(method, struct METHOD, data); str = str_new2("#<"); s = rb_class2name(CLASS_OF(method)); str_cat(str, s, strlen(s)); str_cat(str, ": ", 2); s = rb_class2name(data->oklass); str_cat(str, s, strlen(s)); str_cat(str, "#", 1); s = rb_id2name(data->oid); str_cat(str, s, strlen(s)); str_cat(str, ">", 1); return str; } static VALUE mproc() { VALUE proc; /* emulate ruby's method call */ PUSH_ITER(ITER_CUR); PUSH_FRAME(); proc = f_lambda(); POP_FRAME(); POP_ITER(); return proc; } static VALUE mcall(args, method) VALUE args, method; { if (TYPE(args) == T_ARRAY) { return method_call(RARRAY(args)->len, RARRAY(args)->ptr, method); } return method_call(1, &args, method); } static VALUE method_proc(method) VALUE method; { return rb_iterate(mproc, 0, mcall, method); } void Init_Proc() { eLocalJumpError = rb_define_class("LocalJumpError", eStandardError); eSysStackError = rb_define_class("SystemStackError", eStandardError); cProc = rb_define_class("Proc", cObject); rb_define_singleton_method(cProc, "new", proc_s_new, 0); rb_define_method(cProc, "call", proc_call, -2); rb_define_global_function("proc", f_lambda, 0); rb_define_global_function("lambda", f_lambda, 0); rb_define_global_function("binding", f_binding, 0); cBinding = rb_define_class("Binding", cObject); rb_undef_method(CLASS_OF(cMethod), "new"); rb_define_method(cBinding, "clone", bind_clone, 0); cMethod = rb_define_class("Method", cObject); rb_undef_method(CLASS_OF(cMethod), "new"); rb_define_method(cMethod, "call", method_call, -1); rb_define_method(cMethod, "inspect", method_inspect, 0); rb_define_method(cMethod, "to_s", method_inspect, 0); rb_define_method(cMethod, "to_proc", method_proc, 0); rb_define_method(mKernel, "method", obj_method, 1); } #ifdef THREAD static VALUE eThreadError; int thread_pending = 0; VALUE cThread; #include #ifdef HAVE_SYS_TIME_H # include #else #ifndef NT struct timeval { long tv_sec; /* seconds */ long tv_usec; /* and microseconds */ }; #endif /* NT */ #endif #include #include #ifdef HAVE_SYS_SELECT_H #include #endif extern VALUE last_status; enum thread_status { THREAD_RUNNABLE, THREAD_STOPPED, THREAD_TO_KILL, THREAD_KILLED, }; #define WAIT_FD (1<<0) #define WAIT_TIME (1<<1) #define WAIT_JOIN (1<<2) /* +infty, for this purpose */ #define DELAY_INFTY 1E30 typedef struct thread * thread_t; struct thread { struct thread *next, *prev; jmp_buf context; VALUE result; int stk_len; int stk_max; VALUE*stk_ptr; VALUE*stk_pos; struct FRAME *frame; struct SCOPE *scope; struct RVarmap *dyna_vars; struct BLOCK *block; struct iter *iter; struct tag *tag; VALUE klass; VALUE trace; int misc; /* misc. states (vmode/trap_immediate) */ char *file; int line; VALUE errinfo; VALUE last_status; VALUE last_line; VALUE last_match; int safe; enum thread_status status; int wait_for; int fd; double delay; thread_t join; int abort; VALUE thread; }; static thread_t curr_thread; static int num_waiting_on_fd; static int num_waiting_on_timer; static int num_waiting_on_join; #define FOREACH_THREAD_FROM(f,x) x = f; do { x = x->next; #define END_FOREACH_FROM(f,x) } while (x != f) #define FOREACH_THREAD(x) FOREACH_THREAD_FROM(curr_thread,x) #define END_FOREACH(x) END_FOREACH_FROM(curr_thread,x) /* Return the current time as a floating-point number */ static double timeofday() { struct timeval tv; gettimeofday(&tv, NULL); return (double)tv.tv_sec + (double)tv.tv_usec * 1e-6; } static thread_t main_thread; #define ADJ(addr) (void*)(((VALUE*)(addr)-th->stk_pos)+th->stk_ptr) #define STACK(addr) (th->stk_pos<(addr) && (addr)stk_pos+th->stk_len) static void thread_mark(th) thread_t th; { struct FRAME *frame; struct BLOCK *block; gc_mark(th->result); gc_mark(th->thread); if (th->join) gc_mark(th->join->thread); gc_mark(th->scope); gc_mark(th->dyna_vars); gc_mark(th->errinfo); gc_mark(th->last_line); gc_mark(th->last_match); /* mark data in copied stack */ if (th->status == THREAD_KILLED) return; if (th->stk_len == 0) return; /* stack not active, no need to mark. */ if (th->stk_ptr) { gc_mark_locations(th->stk_ptr, th->stk_ptr+th->stk_len); #if defined(THINK_C) || defined(__human68k__) gc_mark_locations(th->stk_ptr+2, th->stk_ptr+th->stk_len+2); #endif } frame = th->frame; while (frame && frame != top_frame) { frame = ADJ(frame); if (frame->argv && !STACK(frame->argv)) { gc_mark_frame(frame); } frame = frame->prev; } block = th->block; while (block) { block = ADJ(block); if (block->frame.argv && !STACK(block->frame.argv)) { gc_mark_frame(&block->frame); } block = block->prev; } } void gc_mark_threads() { thread_t th; if (!curr_thread) return; FOREACH_THREAD(th) { gc_mark(th->thread); } END_FOREACH(th); } static void thread_free(th) thread_t th; { if (th->stk_ptr) free(th->stk_ptr); th->stk_ptr = 0; if (th != main_thread) free(th); } static thread_t thread_check(data) VALUE data; { if (TYPE(data) != T_DATA || RDATA(data)->dfree != thread_free) { TypeError("wrong argument type %s (expected Thread)", rb_class2name(CLASS_OF(data))); } return (thread_t)RDATA(data)->data; } static void thread_save_context(th) thread_t th; { VALUE v; int len = stack_length(); th->stk_len = 0; th->stk_pos = (gc_stack_start<(VALUE*)&v)?gc_stack_start :gc_stack_start - len; if (len > th->stk_max) { REALLOC_N(th->stk_ptr, VALUE, len); th->stk_max = len; } th->stk_len = len; FLUSH_REGISTER_WINDOWS; MEMCPY(th->stk_ptr, th->stk_pos, VALUE, th->stk_len); th->frame = the_frame; th->scope = the_scope; th->klass = the_class; th->dyna_vars = the_dyna_vars; th->block = the_block; th->misc = scope_vmode | (trap_immediate<<8); th->iter = the_iter; th->tag = prot_tag; th->errinfo = errinfo; th->last_status = last_status; th->last_line = lastline_get(); th->last_match = backref_get(); th->safe = safe_level; th->trace = trace_func; th->file = sourcefile; th->line = sourceline; } static void thread_restore_context _((thread_t,int)); static void stack_extend(th, exit) thread_t th; int exit; { VALUE space[1024]; memset(space, 0, 1); /* prevent array from optimization */ thread_restore_context(th, exit); } static int th_raise_argc; static VALUE th_raise_argv[2]; static char *th_raise_file; static int th_raise_line; static VALUE th_cmd; static int th_sig; static void thread_restore_context(th, exit) thread_t th; int exit; { VALUE v; static thread_t tmp; static int ex; if (!th->stk_ptr) Bug("unsaved context"); if (&v < gc_stack_start) { /* Stack grows downward */ if (&v > th->stk_pos) stack_extend(th, exit); } else { /* Stack grows upward */ if (&v < th->stk_pos + th->stk_len) stack_extend(th, exit); } the_frame = th->frame; the_scope = th->scope; the_class = th->klass; the_dyna_vars = th->dyna_vars; the_block = th->block; scope_vmode = th->misc&SCOPE_MASK; trap_immediate = th->misc>>8; the_iter = th->iter; prot_tag = th->tag; errinfo = th->errinfo; last_status = th->last_status; safe_level = th->safe; trace_func = th->trace; sourcefile = th->file; sourceline = th->line; tmp = th; ex = exit; FLUSH_REGISTER_WINDOWS; MEMCPY(tmp->stk_pos, tmp->stk_ptr, VALUE, tmp->stk_len); lastline_set(tmp->last_line); backref_set(tmp->last_match); switch (ex) { case 1: JUMP_TAG(TAG_FATAL); break; case 2: rb_interrupt(); break; case 3: rb_trap_eval(th_cmd, th_sig); errno = EINTR; break; case 4: the_frame->last_func = 0; sourcefile = th_raise_file; sourceline = th_raise_line; f_raise(th_raise_argc, th_raise_argv); break; default: longjmp(tmp->context, 1); } } static void thread_ready(th) thread_t th; { /* The thread is no longer waiting on anything */ if (th->wait_for & WAIT_FD) { num_waiting_on_fd--; } if (th->wait_for & WAIT_TIME) { num_waiting_on_timer--; } if (th->wait_for & WAIT_JOIN) { num_waiting_on_join--; } th->wait_for = 0; th->status = THREAD_RUNNABLE; } static void thread_remove() { thread_ready(curr_thread); curr_thread->status = THREAD_KILLED; curr_thread->prev->next = curr_thread->next; curr_thread->next->prev = curr_thread->prev; } static int thread_dead(th) thread_t th; { return th->status == THREAD_KILLED; } static void thread_deadlock() { curr_thread = main_thread; th_raise_argc = 1; th_raise_argv[0] = exc_new2(eFatal, "Thread: deadlock"); th_raise_file = sourcefile; th_raise_line = sourceline; f_abort(); } void thread_schedule() { thread_t next; /* OK */ thread_t th; thread_t curr; select_err: thread_pending = 0; if (curr_thread == curr_thread->next) return; next = 0; curr = curr_thread; /* starting thread */ while (curr->status == THREAD_KILLED) { curr = curr->prev; } FOREACH_THREAD_FROM(curr, th) { if (th->status != THREAD_STOPPED && th->status != THREAD_KILLED) { next = th; break; } } END_FOREACH_FROM(curr, th); if (num_waiting_on_join) { FOREACH_THREAD_FROM(curr, th) { if ((th->wait_for&WAIT_JOIN) && thread_dead(th->join)) { th->join = 0; th->wait_for &= ~WAIT_JOIN; th->status = THREAD_RUNNABLE; num_waiting_on_join--; if (!next) next = th; } } END_FOREACH_FROM(curr, th); } if (num_waiting_on_fd > 0 || num_waiting_on_timer > 0) { fd_set readfds; struct timeval delay_tv, *delay_ptr; double delay, now; /* OK */ int n, max; do { max = 0; FD_ZERO(&readfds); if (num_waiting_on_fd > 0) { FOREACH_THREAD_FROM(curr, th) { if (th->wait_for & WAIT_FD) { FD_SET(th->fd, &readfds); if (th->fd > max) max = th->fd; } } END_FOREACH_FROM(curr, th); } delay = DELAY_INFTY; if (num_waiting_on_timer > 0) { now = timeofday(); FOREACH_THREAD_FROM(curr, th) { if (th->wait_for & WAIT_TIME) { if (th->delay <= now) { th->delay = 0.0; th->wait_for &= ~WAIT_TIME; th->status = THREAD_RUNNABLE; num_waiting_on_timer--; next = th; } else if (th->delay < delay) { delay = th->delay; } } } END_FOREACH_FROM(curr, th); } /* Do the select if needed */ if (num_waiting_on_fd > 0 || !next) { /* Convert delay to a timeval */ /* If a thread is runnable, just poll */ if (next) { delay_tv.tv_sec = 0; delay_tv.tv_usec = 0; delay_ptr = &delay_tv; } else if (delay == DELAY_INFTY) { delay_ptr = 0; } else { delay -= now; delay_tv.tv_sec = (unsigned int)delay; delay_tv.tv_usec = (delay - (double)delay_tv.tv_sec) * 1e6; delay_ptr = &delay_tv; } n = select(max+1, &readfds, 0, 0, delay_ptr); if (n < 0) { if (trap_pending) rb_trap_exec(); goto select_err; } if (n > 0) { /* Some descriptors are ready. Make the corresponding threads runnable. */ FOREACH_THREAD_FROM(curr, th) { if ((th->wait_for&WAIT_FD) && FD_ISSET(th->fd, &readfds)) { /* Wake up only one thread per fd. */ FD_CLR(th->fd, &readfds); th->status = THREAD_RUNNABLE; th->fd = 0; th->wait_for &= ~WAIT_FD; num_waiting_on_fd--; if (!next) next = th; /* Found one. */ } } END_FOREACH_FROM(curr, th); } } /* The delays for some of the threads should have expired. Go through the loop once more, to check the delays. */ } while (!next && delay != DELAY_INFTY); } if (!next) { curr_thread->file = sourcefile; curr_thread->line = sourceline; FOREACH_THREAD_FROM(curr, th) { fprintf(stderr, "%s:%d:deadlock 0x%x: %d:%d %s\n", th->file, th->line, th->thread, th->status, th->wait_for, th==main_thread?"(main)":""); } END_FOREACH_FROM(curr, th); /* raise fatal error to main thread */ thread_deadlock(); } if (next->status == THREAD_RUNNABLE && next == curr_thread) { return; } /* context switch */ if (curr == curr_thread) { thread_save_context(curr); if (setjmp(curr->context)) { return; } } curr_thread = next; if (next->status == THREAD_TO_KILL) { /* execute ensure-clause if any */ thread_restore_context(next, 1); } thread_restore_context(next, 0); } void thread_wait_fd(fd) int fd; { if (curr_thread == curr_thread->next) return; curr_thread->status = THREAD_STOPPED; curr_thread->fd = fd; num_waiting_on_fd++; curr_thread->wait_for |= WAIT_FD; thread_schedule(); } void thread_fd_writable(fd) int fd; { struct timeval zero; fd_set fds; if (curr_thread == curr_thread->next) return; zero.tv_sec = zero.tv_usec = 0; for (;;) { FD_ZERO(&fds); FD_SET(fd, &fds); if (select(fd+1, 0, &fds, 0, &zero) == 1) break; thread_schedule(); } } void thread_wait_for(time) struct timeval time; { double date; if (curr_thread == curr_thread->next) { int n; #ifndef linux double d, limit; limit = timeofday()+(double)time.tv_sec+(double)time.tv_usec*1e-6; #endif for (;;) { TRAP_BEG; n = select(0, 0, 0, 0, &time); TRAP_END; if (n == 0) return; #ifndef linux d = limit - timeofday(); time.tv_sec = (int)d; time.tv_usec = (int)((d - (int)d)*1e6); if (time.tv_usec < 0) { time.tv_usec += 1e6; time.tv_sec -= 1; } if (time.tv_sec < 0) return; #endif } } date = timeofday() + (double)time.tv_sec + (double)time.tv_usec*1e-6; curr_thread->status = THREAD_STOPPED; curr_thread->delay = date; num_waiting_on_timer++; curr_thread->wait_for |= WAIT_TIME; thread_schedule(); } void thread_sleep_forever _((void)); int thread_alone() { return curr_thread == curr_thread->next; } int thread_select(max, read, write, except, timeout) int max; fd_set *read, *write, *except; struct timeval *timeout; { double limit; struct timeval zero; fd_set r, *rp, w, *wp, x, *xp; int n; if (!read && !write && !except) { if (!timeout) { thread_sleep_forever(); return 0; } thread_wait_for(*timeout); return 0; } if (timeout) { limit = timeofday()+ (double)timeout->tv_sec+(double)timeout->tv_usec*1e-6; } if (curr_thread == curr_thread->next) { /* no other thread */ #ifndef linux struct timeval tv, *tvp = timeout; if (timeout) { tv = *timeout; tvp = &tv; } for (;;) { TRAP_BEG; n = select(max, read, write, except, tvp); TRAP_END; if (n < 0 && errno == EINTR) { if (timeout) { double d = timeofday() - limit; tv.tv_sec = (unsigned int)d; tv.tv_usec = (d - (double)tv.tv_sec) * 1e6; } continue; } return n; } #else for (;;) { TRAP_BEG; n = select(max, read, write, except, timeout); TRAP_END; if (n < 0 && errno == EINTR) { continue; } return n; } #endif } for (;;) { zero.tv_sec = zero.tv_usec = 0; if (read) {rp = &r; r = *read;} else {rp = 0;} if (write) {wp = &w; w = *write;} else {wp = 0;} if (except) {xp = &x; x = *except;} else {xp = 0;} n = select(max, rp, wp, xp, &zero); if (n > 0) { /* write back fds */ if (read) {*read = r;} if (write) {*write = w;} if (except) {*except = x;} return n; } if (n < 0 && errno != EINTR) { return n; } if (timeout) { if (timeout->tv_sec == 0 && timeout->tv_usec == 0) return 0; if (limit <= timeofday()) return 0; } thread_schedule(); CHECK_INTS; } } static VALUE thread_join(dmy, thread) VALUE dmy; VALUE thread; { thread_t th = thread_check(thread); if (thread_dead(th)) return thread; if ((th->wait_for & WAIT_JOIN) && th->join == curr_thread) Raise(eThreadError, "Thread.join: deadlock"); curr_thread->status = THREAD_STOPPED; curr_thread->join = th; num_waiting_on_join++; curr_thread->wait_for |= WAIT_JOIN; thread_schedule(); return thread; } static VALUE thread_current() { return curr_thread->thread; } static VALUE thread_main() { return main_thread->thread; } static VALUE thread_wakeup(thread) VALUE thread; { thread_t th = thread_check(thread); if (th->status == THREAD_KILLED) Raise(eThreadError, "killed thread"); thread_ready(th); return thread; } static VALUE thread_run(thread) VALUE thread; { thread_wakeup(thread); if (!thread_critical) thread_schedule(); return thread; } static VALUE thread_kill(thread) VALUE thread; { thread_t th = thread_check(thread); if (th->status == THREAD_TO_KILL || th->status == THREAD_KILLED) return thread; if (th == th->next || th == main_thread) rb_exit(0); thread_ready(th); th->status = THREAD_TO_KILL; thread_schedule(); return Qnil; /* not reached */ } static VALUE thread_s_kill(obj, th) VALUE obj, th; { return thread_kill(th); } static VALUE thread_exit() { return thread_kill(curr_thread->thread); } static VALUE thread_pass() { thread_schedule(); return Qnil; } static VALUE thread_stop() { thread_critical = 0; curr_thread->status = THREAD_STOPPED; if (curr_thread == curr_thread->next) { Raise(eThreadError, "stopping only thread"); } thread_schedule(); return Qnil; } struct timeval time_timeval(); void thread_sleep(sec) int sec; { if (curr_thread == curr_thread->next) { TRAP_BEG; sleep(sec); TRAP_END; return; } thread_wait_for(time_timeval(INT2FIX(sec))); } void thread_sleep_forever() { if (curr_thread == curr_thread->next) { TRAP_BEG; sleep((32767L<<16)+32767); TRAP_END; return; } num_waiting_on_timer++; curr_thread->delay = DELAY_INFTY; curr_thread->wait_for |= WAIT_TIME; curr_thread->status = THREAD_STOPPED; thread_schedule(); } static int thread_abort; static VALUE thread_s_abort_exc() { return thread_abort?TRUE:FALSE; } static VALUE thread_s_abort_exc_set(self, val) VALUE self, val; { thread_abort = RTEST(val); return val; } static VALUE thread_abort_exc(thread) VALUE thread; { thread_t th = thread_check(thread); return th->abort?TRUE:FALSE; } static VALUE thread_abort_exc_set(thread, val) VALUE thread, val; { thread_t th = thread_check(thread); th->abort = RTEST(val); return val; } static thread_t thread_alloc() { thread_t th; th = ALLOC(struct thread); th->status = THREAD_RUNNABLE; th->status = 0; th->result = 0; th->errinfo = Qnil; th->stk_ptr = 0; th->stk_len = 0; th->stk_max = 0; th->wait_for = 0; th->fd = 0; th->delay = 0.0; th->join = 0; th->frame = 0; th->scope = 0; th->klass = 0; th->dyna_vars = 0; th->block = 0; th->iter = 0; th->tag = 0; th->errinfo = 0; th->last_status = 0; th->last_line = 0; th->last_match = 0; th->abort = 0; th->thread = data_object_alloc(cThread, th, thread_mark, thread_free); if (curr_thread) { th->prev = curr_thread; curr_thread->next->prev = th; th->next = curr_thread->next; curr_thread->next = th; } else { curr_thread = th->prev = th->next = th; th->status = THREAD_RUNNABLE; } return th; } #if defined(HAVE_SETITIMER) && !defined(__BOW__) static void catch_timer(sig) int sig; { #if !defined(POSIX_SIGNAL) && !defined(BSD_SIGNAL) signal(sig, catch_timer); #endif if (!thread_critical) { if (trap_immediate) { thread_schedule(); } else thread_pending = 1; } } #else int thread_tick = THREAD_TICK; #endif static VALUE thread_raise _((int, VALUE*, VALUE)); #if defined(HAVE_SETITIMER) && !defined(__BOW__) static int thread_init = 0; void thread_start_timer() { struct itimerval tval; if (!thread_init) return; tval.it_interval.tv_sec = 0; tval.it_interval.tv_usec = 100000; tval.it_value = tval.it_interval; setitimer(ITIMER_VIRTUAL, &tval, NULL); } void thread_stop_timer() { struct itimerval tval; if (!thread_init) return; tval.it_interval.tv_sec = 0; tval.it_interval.tv_usec = 0; tval.it_value = tval.it_interval; setitimer(ITIMER_VIRTUAL, &tval, NULL); } #endif VALUE thread_create(fn, arg) VALUE (*fn)(); void *arg; { thread_t th = thread_alloc(); volatile VALUE thread = th->thread; int state; enum thread_status status; #if defined(HAVE_SETITIMER) && !defined(__BOW__) if (!thread_init) { #ifdef POSIX_SIGNAL posix_signal(SIGVTALRM, catch_timer); posix_signal(SIGALRM, catch_timer); #else signal(SIGVTALRM, catch_timer); signal(SIGALRM, catch_timer); #endif thread_init = 1; thread_start_timer(); } #endif thread_save_context(curr_thread); if (setjmp(curr_thread->context)) { return th->thread; } PUSH_TAG(PROT_THREAD); if ((state = EXEC_TAG()) == 0) { thread_save_context(th); if (setjmp(th->context) == 0) { curr_thread = th; th->result = (*fn)(arg, th); } } POP_TAG(); status = th->status; thread_remove(); if (state && status != THREAD_TO_KILL && !NIL_P(errinfo)) { if (state == TAG_FATAL) { /* fatal error within this thread, need to stop whole script */ main_thread->errinfo = errinfo; thread_cleanup(); } else if (obj_is_kind_of(errinfo, eSystemExit)) { /* delegate exception to main_thread */ thread_raise(1, &errinfo, main_thread->thread); } else if (thread_abort || curr_thread->abort || RTEST(debug)) { VALUE err = exc_new(eSystemExit, 0, 0); error_print(); /* exit on main_thread */ thread_raise(1, &err, main_thread->thread); } else { curr_thread->errinfo = errinfo; } } thread_schedule(); return 0; /* not reached */ } static VALUE thread_yield(arg, th) int arg; thread_t th; { scope_dup(the_block->scope); return rb_yield(th->thread); } static VALUE thread_start() { if (!iterator_p()) { Raise(eThreadError, "must be called as iterator"); } return thread_create(thread_yield, 0); } static VALUE thread_value(thread) VALUE thread; { thread_t th = thread_check(thread); thread_join(0, thread); if (!NIL_P(th->errinfo)) { VALUE oldbt = get_backtrace(th->errinfo); VALUE errat = make_backtrace(); ary_unshift(errat, ary_entry(oldbt, 0)); set_backtrace(th->errinfo, errat); rb_raise(th->errinfo); } return th->result; } static VALUE thread_status(thread) VALUE thread; { thread_t th = thread_check(thread); if (thread_dead(th)) { if (NIL_P(th->errinfo)) return FALSE; return Qnil; } return TRUE; } static VALUE thread_stop_p(thread) VALUE thread; { thread_t th = thread_check(thread); if (thread_dead(th)) return TRUE; if (th->status == THREAD_STOPPED) return TRUE; return FALSE; } static void thread_wait_other_threads() { /* wait other threads to terminate */ while (curr_thread != curr_thread->next) { thread_schedule(); } } static void thread_cleanup() { thread_t th; if (curr_thread != curr_thread->next->prev) { curr_thread = curr_thread->prev; } FOREACH_THREAD(th) { if (th != curr_thread && th->status != THREAD_KILLED) { th->status = THREAD_TO_KILL; th->wait_for = 0; } } END_FOREACH(th); } int thread_critical; static VALUE thread_get_critical() { return thread_critical?TRUE:FALSE; } static VALUE thread_set_critical(obj, val) VALUE obj, val; { thread_critical = RTEST(val); return val; } void thread_interrupt() { thread_critical = 0; thread_ready(main_thread); if (curr_thread == main_thread) { rb_interrupt(); } thread_save_context(curr_thread); if (setjmp(curr_thread->context)) { return; } curr_thread = main_thread; thread_restore_context(curr_thread, 2); } void thread_trap_eval(cmd, sig) VALUE cmd; int sig; { thread_critical = 0; if (!thread_dead(curr_thread)) { thread_ready(curr_thread); rb_trap_eval(cmd, sig); return; } thread_ready(main_thread); thread_save_context(curr_thread); if (setjmp(curr_thread->context)) { return; } th_cmd = cmd; th_sig = sig; curr_thread = main_thread; thread_restore_context(curr_thread, 3); } static VALUE thread_raise(argc, argv, thread) int argc; VALUE *argv; VALUE thread; { thread_t th = thread_check(thread); if (thread_dead(th)) return thread; if (curr_thread == th) { f_raise(argc, argv); } if (curr_thread->status != THREAD_KILLED) thread_save_context(curr_thread); if (setjmp(curr_thread->context)) { return thread; } rb_scan_args(argc, argv, "11", &th_raise_argv[0], &th_raise_argv[1]); thread_ready(th); curr_thread = th; th_raise_argc = argc; th_raise_file = sourcefile; th_raise_line = sourceline; thread_restore_context(curr_thread, 4); return Qnil; /* not reached */ } static thread_t loading_thread; static int loading_nest; static int thread_loading(feature) char *feature; { if (curr_thread != curr_thread->next && loading_thread) { while (loading_thread != curr_thread) { thread_schedule(); CHECK_INTS; } if (rb_provided(feature)) return TRUE; /* no need to load */ } loading_thread = curr_thread; loading_nest++; return FALSE; } static void thread_loading_done() { if (--loading_nest == 0) { loading_thread = 0; } } void Init_Thread() { eThreadError = rb_define_class("ThreadError", eStandardError); cThread = rb_define_class("Thread", cObject); rb_define_singleton_method(cThread, "new", thread_start, 0); rb_define_singleton_method(cThread, "start", thread_start, 0); rb_define_singleton_method(cThread, "fork", thread_start, 0); rb_define_singleton_method(cThread, "stop", thread_stop, 0); rb_define_singleton_method(cThread, "kill", thread_s_kill, 1); rb_define_singleton_method(cThread, "exit", thread_exit, 0); rb_define_singleton_method(cThread, "pass", thread_pass, 0); rb_define_singleton_method(cThread, "join", thread_join, 1); rb_define_singleton_method(cThread, "current", thread_current, 0); rb_define_singleton_method(cThread, "main", thread_main, 0); rb_define_singleton_method(cThread, "critical", thread_get_critical, 0); rb_define_singleton_method(cThread, "critical=", thread_set_critical, 1); rb_define_singleton_method(cThread, "abort_on_exception", thread_s_abort_exc, 0); rb_define_singleton_method(cThread, "abort_on_exception=", thread_s_abort_exc_set, 1); rb_define_method(cThread, "run", thread_run, 0); rb_define_method(cThread, "wakeup", thread_wakeup, 0); rb_define_method(cThread, "exit", thread_kill, 0); rb_define_method(cThread, "value", thread_value, 0); rb_define_method(cThread, "status", thread_status, 0); rb_define_method(cThread, "alive?", thread_status, 0); rb_define_method(cThread, "stop?", thread_stop_p, 0); rb_define_method(cThread, "raise", thread_raise, -1); rb_define_method(cThread, "abort_on_exception", thread_abort_exc, 0); rb_define_method(cThread, "abort_on_exception=", thread_abort_exc_set, 1); /* allocate main thread */ main_thread = thread_alloc(); } #endif static VALUE f_catch(dmy, tag) VALUE dmy, tag; { int state; ID t; VALUE val; /* OK */ t = rb_to_id(tag); PUSH_TAG(t); if ((state = EXEC_TAG()) == 0) { val = rb_yield(tag); } else if (state == TAG_THROW && t == prot_tag->dst) { val = prot_tag->retval; state = 0; } POP_TAG(); if (state) JUMP_TAG(state); return val; } static VALUE catch_i(tag) ID tag; { return f_catch(0, FIX2INT(tag)); } VALUE rb_catch(tag, proc, data) char *tag; VALUE (*proc)(); VALUE data; { return rb_iterate(catch_i, rb_intern(tag), proc, data); } static VALUE f_throw _((int,VALUE*)) NORETURN; static VALUE f_throw(argc, argv) int argc; VALUE *argv; { VALUE tag, value; ID t; struct tag *tt = prot_tag; rb_scan_args(argc, argv, "11", &tag, &value); t = rb_to_id(tag); while (tt) { if (tt->tag == t) { tt->dst = t; break; } #ifdef THREAD if (tt->tag == PROT_THREAD) { Raise(eThreadError, "uncaught throw `%s' in thread 0x%x", rb_id2name(t), curr_thread); } #endif tt = tt->prev; } if (!tt) { NameError("uncaught throw `%s'", rb_id2name(t)); } return_value(value); trap_restore_mask(); JUMP_TAG(TAG_THROW); /* not reached */ } void rb_throw(tag, val) char *tag; VALUE val; { VALUE argv[2]; ID t = rb_intern(tag); argv[0] = FIX2INT(t); argv[1] = val; f_throw(2, argv); } static void return_check() { #ifdef THREAD struct tag *tt = prot_tag; while (tt) { if (tt->tag == PROT_FUNC) { break; } if (tt->tag == PROT_THREAD) { Raise(eThreadError, "return from within thread 0x%x", curr_thread); } tt = tt->prev; } #endif } ruby-1.2.3/file.c100644 774 145 77442 6573444243 11667 0ustar matzNaCl/************************************************ file.c - $Author: matz $ $Date: 1998/09/03 07:43:31 $ created at: Mon Nov 15 12:24:34 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "rubyio.h" #include "rubysig.h" #ifdef HAVE_UNISTD_H #include #endif #ifdef HAVE_SYS_PARAM_H # include #else # define MAXPATHLEN 1024 #endif #ifdef HAVE_SYS_TIME_H # include #else #ifndef NT struct timeval { long tv_sec; /* seconds */ long tv_usec; /* and microseconds */ }; #endif /* NT */ #endif #ifdef HAVE_UTIME_H #include #endif #ifdef HAVE_PWD_H #include #endif #ifndef HAVE_STRING_H char *strrchr _((char*,char)); #endif #include #include #ifdef USE_CWGUSI #include "macruby_missing.h" extern int fileno(FILE *stream); extern int utimes(); #endif VALUE cFile; VALUE mFileTest; static VALUE sStat; VALUE file_open(fname, mode) char *fname, *mode; { OpenFile *fptr; NEWOBJ(port, struct RFile); OBJSETUP(port, cFile, T_FILE); MakeOpenFile(port, fptr); fptr->mode = io_mode_flags(mode); fptr->f = rb_fopen(fname, mode); fptr->path = strdup(fname); obj_call_init((VALUE)port); return (VALUE)port; } static VALUE file_s_open(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { VALUE fname, vmode, file; char *mode; rb_scan_args(argc, argv, "11", &fname, &vmode); Check_SafeStr(fname); if (!NIL_P(vmode)) { mode = STR2CSTR(vmode); } else { mode = "r"; } file = file_open(RSTRING(fname)->ptr, mode); RBASIC(file)->klass = klass; obj_call_init(file); if (iterator_p()) { return rb_ensure(rb_yield, file, io_close, file); } return file; } static VALUE file_reopen(argc, argv, file) int argc; VALUE *argv; VALUE file; { VALUE fname, nmode; char *mode; OpenFile *fptr; if (rb_scan_args(argc, argv, "11", &fname, &nmode) == 1) { if (TYPE(fname) == T_FILE) { /* fname must be IO */ return io_reopen(file, fname); } } Check_SafeStr(fname); if (!NIL_P(nmode)) { mode = STR2CSTR(nmode); } else { mode = "r"; } GetOpenFile(file, fptr); if (fptr->path) free(fptr->path); fptr->path = strdup(RSTRING(fname)->ptr); fptr->mode = io_mode_flags(mode); if (!fptr->f) { fptr->f = rb_fopen(RSTRING(fname)->ptr, mode); if (fptr->f2) { fclose(fptr->f2); fptr->f2 = NULL; } return file; } if (freopen(RSTRING(fname)->ptr, mode, fptr->f) == NULL) { rb_sys_fail(fptr->path); } if (fptr->f2) { if (freopen(RSTRING(fname)->ptr, "w", fptr->f2) == NULL) { rb_sys_fail(fptr->path); } } return file; } static int apply2files(func, vargs, arg) int (*func)(); VALUE vargs; void *arg; { int i; VALUE path; struct RArray *args = RARRAY(vargs); for (i=0; ilen; i++) { Check_SafeStr(args->ptr[i]); } for (i=0; ilen; i++) { path = args->ptr[i]; if ((*func)(RSTRING(path)->ptr, arg) < 0) rb_sys_fail(RSTRING(path)->ptr); } return args->len; } static VALUE file_path(obj) VALUE obj; { OpenFile *fptr; GetOpenFile(obj, fptr); if (fptr->path == NULL) return Qnil; return str_new2(fptr->path); } #ifndef NT # ifndef USE_CWGUSI # include # endif #else #include "missing/file.h" #endif static VALUE stat_new(st) struct stat *st; { if (!st) Bug("stat_new() called with bad value"); return struct_new(sStat, INT2FIX((int)st->st_dev), INT2FIX((int)st->st_ino), INT2FIX((int)st->st_mode), INT2FIX((int)st->st_nlink), INT2FIX((int)st->st_uid), INT2FIX((int)st->st_gid), #ifdef HAVE_ST_RDEV INT2FIX((int)st->st_rdev), #else INT2FIX(0), #endif INT2FIX((int)st->st_size), #ifdef HAVE_ST_BLKSIZE INT2FIX((int)st->st_blksize), #else INT2FIX(0), #endif #ifdef HAVE_ST_BLOCKS INT2FIX((int)st->st_blocks), #else INT2FIX(0), #endif time_new(st->st_atime, 0), time_new(st->st_mtime, 0), time_new(st->st_ctime, 0)); } static int rb_stat(file, st) VALUE file; struct stat *st; { OpenFile *fptr; if (TYPE(file) == T_FILE) { GetOpenFile(file, fptr); return fstat(fileno(fptr->f), st); } Check_SafeStr(file); return stat(RSTRING(file)->ptr, st); } static VALUE file_s_stat(obj, fname) VALUE obj, fname; { struct stat st; Check_SafeStr(fname); if (stat(RSTRING(fname)->ptr, &st) == -1) { rb_sys_fail(RSTRING(fname)->ptr); } return stat_new(&st); } static VALUE io_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 file_s_lstat(obj, fname) VALUE obj, fname; { #if !defined(MSDOS) && !defined(NT) struct stat st; Check_SafeStr(fname); if (lstat(RSTRING(fname)->ptr, &st) == -1) { rb_sys_fail(RSTRING(fname)->ptr); } return stat_new(&st); #else rb_notimplement(); #endif } static VALUE file_lstat(obj) VALUE obj; { #if !defined(MSDOS) && !defined(NT) OpenFile *fptr; struct stat st; GetOpenFile(obj, fptr); if (lstat(fptr->path, &st) == -1) { rb_sys_fail(fptr->path); } return stat_new(&st); #else rb_notimplement(); #endif } static int group_member(gid) GETGROUPS_T gid; { #if !defined(NT) && !defined(USE_CWGUSI) if (getgid() == gid || getegid() == gid) return TRUE; # ifdef HAVE_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 #endif return FALSE; } #ifndef S_IXUGO # define S_IXUGO (S_IXUSR | S_IXGRP | S_IXOTH) #endif int eaccess(path, mode) char *path; int mode; { #ifndef NT struct stat st; static int euid = -1; if (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; #else /* !NT*/ return 0; #endif } static VALUE test_d(obj, fname) VALUE obj, fname; { #ifndef S_ISDIR # define S_ISDIR(m) ((m & S_IFMT) == S_IFDIR) #endif struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (S_ISDIR(st.st_mode)) return TRUE; return FALSE; } static VALUE test_p(obj, fname) VALUE obj, fname; { #ifdef S_IFIFO # ifndef S_ISFIFO # define S_ISFIFO(m) ((m & S_IFMT) == S_IFIFO) # endif struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (S_ISFIFO(st.st_mode)) return TRUE; #endif return FALSE; } static VALUE test_l(obj, fname) VALUE obj, 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_SafeStr(fname); if (lstat(RSTRING(fname)->ptr, &st) < 0) return FALSE; if (S_ISLNK(st.st_mode)) return TRUE; #endif return FALSE; } static VALUE test_S(obj, fname) VALUE obj, 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; if (rb_stat(fname, &st) < 0) return FALSE; if (S_ISSOCK(st.st_mode)) return TRUE; #endif return FALSE; } static VALUE test_b(obj, fname) VALUE obj, fname; { #ifndef S_ISBLK # ifdef S_IFBLK # define S_ISBLK(m) ((m & S_IFMT) == S_IFBLK) # else # define S_ISBLK(m) (0) /* anytime false */ # endif #endif #ifdef S_ISBLK struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (S_ISBLK(st.st_mode)) return TRUE; #endif return FALSE; } static VALUE test_c(obj, fname) VALUE obj, fname; { #ifndef S_ISCHR # define S_ISCHR(m) ((m & S_IFMT) == S_IFCHR) #endif struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (S_ISBLK(st.st_mode)) return TRUE; return FALSE; } static VALUE test_e(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; return TRUE; } static VALUE test_r(obj, fname) VALUE obj, fname; { Check_SafeStr(fname); if (eaccess(RSTRING(fname)->ptr, R_OK) < 0) return FALSE; return TRUE; } static VALUE test_R(obj, fname) VALUE obj, fname; { Check_SafeStr(fname); if (access(RSTRING(fname)->ptr, R_OK) < 0) return FALSE; return TRUE; } static VALUE test_w(obj, fname) VALUE obj, fname; { Check_SafeStr(fname); if (eaccess(RSTRING(fname)->ptr, W_OK) < 0) return FALSE; return TRUE; } static VALUE test_W(obj, fname) VALUE obj, fname; { Check_SafeStr(fname); if (access(RSTRING(fname)->ptr, W_OK) < 0) return FALSE; return TRUE; } static VALUE test_x(obj, fname) VALUE obj, fname; { Check_SafeStr(fname); if (eaccess(RSTRING(fname)->ptr, X_OK) < 0) return FALSE; return TRUE; } static VALUE test_X(obj, fname) VALUE obj, fname; { Check_SafeStr(fname); if (access(RSTRING(fname)->ptr, X_OK) < 0) return FALSE; return TRUE; } #ifndef S_ISREG # define S_ISREG(m) ((m & S_IFMT) == S_IFREG) #endif static VALUE test_f(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (S_ISREG(st.st_mode)) return TRUE; return FALSE; } static VALUE test_z(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (st.st_size == 0) return TRUE; return FALSE; } static VALUE test_s(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (st.st_size == 0) return FALSE; return int2inum(st.st_size); } static VALUE test_owned(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (st.st_uid == geteuid()) return TRUE; return FALSE; } static VALUE test_rowned(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (st.st_uid == getuid()) return TRUE; return FALSE; } static VALUE test_grpowned(obj, fname) VALUE obj, fname; { #ifndef NT struct stat st; if (rb_stat(fname, &st) < 0) return FALSE; if (st.st_gid == getegid()) return TRUE; #endif 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 (stat(file, &st) < 0) return FALSE; if (st.st_mode & mode) return TRUE; return FALSE; } #endif static VALUE test_suid(obj, fname) VALUE obj, fname; { #ifdef S_ISUID Check_SafeStr(fname); return check3rdbyte(RSTRING(fname)->ptr, S_ISUID); #else return FALSE; #endif } static VALUE test_sgid(obj, fname) VALUE obj, fname; { #ifndef NT Check_SafeStr(fname); return check3rdbyte(RSTRING(fname)->ptr, S_ISGID); #else return FALSE; #endif } static VALUE test_sticky(obj, fname) VALUE obj, fname; { #ifdef S_ISVTX return check3rdbyte(STR2CSTR(fname), S_ISVTX); #else return FALSE; #endif } static VALUE file_s_size(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) rb_sys_fail(RSTRING(fname)->ptr); return int2inum(st.st_size); } static VALUE file_s_ftype(obj, fname) VALUE obj, fname; { struct stat st; char *t; #if defined(MSDOS) || defined(NT) if (rb_stat(fname, &st) < 0) rb_sys_fail(RSTRING(fname)->ptr); #else Check_SafeStr(fname); if (lstat(RSTRING(fname)->ptr, &st) == -1) { rb_sys_fail(RSTRING(fname)->ptr); } #endif 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 #ifdef 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 file_s_atime(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) rb_sys_fail(RSTRING(fname)->ptr); return time_new(st.st_atime, 0); } static VALUE file_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 file_s_mtime(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) rb_sys_fail(RSTRING(fname)->ptr); return time_new(st.st_mtime, 0); } static VALUE file_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 file_s_ctime(obj, fname) VALUE obj, fname; { struct stat st; if (rb_stat(fname, &st) < 0) rb_sys_fail(RSTRING(fname)->ptr); return time_new(st.st_ctime, 0); } static VALUE file_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 file_s_chmod(argc, argv) int argc; VALUE *argv; { VALUE vmode; VALUE rest; int mode, n; rb_scan_args(argc, argv, "1*", &vmode, &rest); mode = NUM2INT(vmode); n = apply2files(chmod_internal, rest, mode); return INT2FIX(n); } static VALUE file_chmod(obj, vmode) VALUE obj, vmode; { OpenFile *fptr; int mode; rb_secure(2); mode = NUM2INT(vmode); GetOpenFile(obj, fptr); #if defined(DJGPP) || defined(NT) || defined(USE_CWGUSI) || defined(__BEOS__) if (chmod(fptr->path, mode) == -1) rb_sys_fail(fptr->path); #else if (fchmod(fileno(fptr->f), mode) == -1) rb_sys_fail(fptr->path); #endif 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 file_s_chown(argc, argv) int argc; VALUE *argv; { VALUE o, g, rest; struct chown_args arg; int n; rb_scan_args(argc, argv, "2*", &o, &g, &rest); if (NIL_P(o)) { arg.owner = -1; } else { arg.owner = NUM2INT(o); } if (NIL_P(g)) { arg.group = -1; } else { arg.group = NUM2INT(g); } n = apply2files(chown_internal, rest, &arg); return INT2FIX(n); } static VALUE file_chown(obj, owner, group) VALUE obj, owner, group; { OpenFile *fptr; rb_secure(2); GetOpenFile(obj, fptr); #if defined(DJGPP) || defined(__CYGWIN32__) || defined(NT) || defined(USE_CWGUSI) if (chown(fptr->path, NUM2INT(owner), NUM2INT(group)) == -1) rb_sys_fail(fptr->path); #else if (fchown(fileno(fptr->f), NUM2INT(owner), NUM2INT(group)) == -1) rb_sys_fail(fptr->path); #endif return INT2FIX(0); } struct timeval time_timeval(); #ifdef HAVE_UTIMES static void utime_internal(path, tvp) char *path; struct timeval tvp[]; { if (utimes(path, tvp) < 0) rb_sys_fail(path); } static VALUE file_s_utime(argc, argv) int argc; VALUE *argv; { 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); } #else #ifndef HAVE_UTIME_H # ifdef NT # if defined(__BORLANDC__) # include # else # include # endif # if defined(_MSC_VER) # define utimbuf _utimbuf # endif # else struct utimbuf { long actime; long modtime; }; # endif #endif static void utime_internal(path, utp) char *path; struct utimbuf *utp; { if (utime(path, utp) < 0) rb_sys_fail(path); } static VALUE file_s_utime(argc, argv) int argc; VALUE *argv; { VALUE atime, mtime, rest; int n; struct timeval tv; struct utimbuf utbuf; rb_scan_args(argc, argv, "2*", &atime, &mtime, &rest); tv = time_timeval(atime); utbuf.actime = tv.tv_sec; tv = time_timeval(mtime); utbuf.modtime = tv.tv_sec; n = apply2files(utime_internal, rest, &utbuf); return INT2FIX(n); } #endif static VALUE file_s_link(obj, from, to) VALUE obj, from, to; { #if defined(USE_CWGUSI) rb_notimplement(); #else Check_SafeStr(from); Check_SafeStr(to); if (link(RSTRING(from)->ptr, RSTRING(to)->ptr) < 0) rb_sys_fail(RSTRING(from)->ptr); return INT2FIX(0); #endif /* USE_CWGUSI */ } static VALUE file_s_symlink(obj, from, to) VALUE obj, from, to; { #if !defined(MSDOS) && !defined(NT) Check_SafeStr(from); Check_SafeStr(to); if (symlink(RSTRING(from)->ptr, RSTRING(to)->ptr) < 0) rb_sys_fail(RSTRING(from)->ptr); return INT2FIX(0); #else rb_notimplement(); #endif } static VALUE file_s_readlink(obj, path) VALUE obj, path; { #if !defined(MSDOS) && !defined(NT) char buf[MAXPATHLEN]; int cc; Check_SafeStr(path); if ((cc = readlink(RSTRING(path)->ptr, buf, MAXPATHLEN)) < 0) rb_sys_fail(RSTRING(path)->ptr); return str_new(buf, cc); #else rb_notimplement(); #endif } static void unlink_internal(path) char *path; { if (unlink(path) < 0) rb_sys_fail(path); } static VALUE file_s_unlink(obj, args) VALUE obj, args; { int n; n = apply2files(unlink_internal, args, 0); return INT2FIX(n); } static VALUE file_s_rename(obj, from, to) VALUE obj, from, to; { Check_SafeStr(from); Check_SafeStr(to); if (rename(RSTRING(from)->ptr, RSTRING(to)->ptr) < 0) rb_sys_fail(RSTRING(from)->ptr); return INT2FIX(0); } static VALUE file_s_umask(argc, argv) int argc; VALUE *argv; { #ifdef USE_CWGUSI rb_notimplement(); #else int omask = 0; if (argc == 0) { omask = umask(0); umask(omask); } else if (argc == 1) { omask = umask(NUM2INT(argv[0])); } else { ArgError("wrong # of argument"); } return INT2FIX(omask); #endif /* USE_CWGUSI */ } VALUE file_s_expand_path(argc, argv) int argc; VALUE *argv; { VALUE fname, dname; char *s, *p; char buf[MAXPATHLEN+2]; rb_scan_args(argc, argv, "11", &fname, &dname); s = STR2CSTR(fname); p = buf; if (s[0] == '~') { if (s[1] == '/' || #if defined(MSDOS) || defined(NT) || defined(__human68k__) s[1] == '\\' || #endif s[1] == '\0') { char *dir = getenv("HOME"); if (!dir) { Fail("couldn't find HOME environment -- expanding `%s'", s); } strcpy(buf, dir); p = &buf[strlen(buf)]; s++; } else { #ifdef HAVE_PWD_H struct passwd *pwPtr; s++; #endif while (*s && *s != '/') { *p++ = *s++; } *p = '\0'; #ifdef HAVE_PWD_H pwPtr = getpwnam(buf); if (!pwPtr) { endpwent(); Fail("user %s doesn't exist", buf); } strcpy(buf, pwPtr->pw_dir); p = &buf[strlen(buf)]; endpwent(); #endif } } else if (s[0] != '/') { if (argc == 2) { dname = file_s_expand_path(1, &dname); strcpy(buf, RSTRING(dname)->ptr); } else { #ifdef HAVE_GETCWD getcwd(buf, MAXPATHLEN); #else getwd(buf); #endif } p = &buf[strlen(buf)]; while (p > buf && *(p - 1) == '/') p--; } *p = '/'; for ( ; *s; s++) { switch (*s) { case '.': if (*(s+1)) { switch (*++s) { case '.': if (*(s+1) == '\0' || *(s+1) == '/') { /* We must go back to the parent */ if (*p == '/' && p > buf) p--; while (p > buf && *p != '/') p--; } else { *++p = '.'; *++p = '.'; } break; case '/': if (*p != '/') *++p = '/'; break; default: *++p = '.'; *++p = *s; break; } } break; case '/': if (*p != '/') *++p = '/'; break; default: *++p = *s; } } /* Place a \0 at end. If path ends with a "/", delete it */ if (p == buf || *p != '/') p++; *p = '\0'; return str_taint(str_new2(buf)); } static int rmext(p, e) char *p, *e; { int l1, l2; l1 = strlen(p); if (!e) return 0; l2 = strlen(e); if (l2 == 2 && e[1] == '*') { e = strrchr(p, *e); if (!e) return 0; return e - p; } if (l1 < l2) return l1; if (strcmp(p+l1-l2, e) == 0) { return l1-l2; } return 0; } static VALUE file_s_basename(argc, argv) int argc; VALUE *argv; { VALUE fname, fext; char *name, *p, *ext; int f; if (rb_scan_args(argc, argv, "11", &fname, &fext) == 2) { ext = STR2CSTR(fext); } name = STR2CSTR(fname); p = strrchr(name, '/'); if (!p) { if (!NIL_P(fext)) { f = rmext(name, ext); if (f) return str_new(name, f); } return fname; } p++; /* skip last `/' */ if (!NIL_P(fext)) { f = rmext(p, ext); if (f) return str_new(p, f); } return str_taint(str_new2(p)); } static VALUE file_s_dirname(obj, fname) VALUE obj, fname; { char *name, *p; name = STR2CSTR(fname); p = strrchr(name, '/'); if (!p) { return str_new2("."); } if (p == name) p++; return str_taint(str_new(name, p - name)); } static VALUE file_s_split(obj, path) VALUE obj, path; { return assoc_new(file_s_dirname(Qnil, path), file_s_basename(1,&path)); } static VALUE separator; static VALUE file_s_join(obj, args) VALUE obj, args; { return ary_join(args, separator); } static VALUE file_s_truncate(obj, path, len) VALUE obj, path, len; { Check_SafeStr(path); #ifdef HAVE_TRUNCATE if (truncate(RSTRING(path)->ptr, NUM2INT(len)) < 0) rb_sys_fail(RSTRING(path)->ptr); #else # ifdef HAVE_CHSIZE { int tmpfd; # if defined(NT) if ((tmpfd = open(RSTRING(path)->ptr, O_RDWR)) < 0) { rb_sys_fail(RSTRING(path)->ptr); } # else if ((tmpfd = open(RSTRING(path)->ptr, 0)) < 0) { rb_sys_fail(RSTRING(path)->ptr); } # endif if (chsize(tmpfd, NUM2INT(len)) < 0) { close(tmpfd); rb_sys_fail(RSTRING(path)->ptr); } close(tmpfd); } # else rb_notimplement(); # endif #endif return INT2FIX(0); } static VALUE file_truncate(obj, len) VALUE obj, len; { OpenFile *fptr; rb_secure(2); GetOpenFile(obj, fptr); if (!(fptr->mode & FMODE_WRITABLE)) { Fail("not opened for writing"); } #ifdef HAVE_TRUNCATE if (ftruncate(fileno(fptr->f), NUM2INT(len)) < 0) rb_sys_fail(fptr->path); #else # ifdef HAVE_CHSIZE if (chsize(fileno(fptr->f), NUM2INT(len)) < 0) rb_sys_fail(fptr->path); # else rb_notimplement(); # endif #endif return INT2FIX(0); } # ifndef LOCK_SH # define LOCK_SH 1 # endif # ifndef LOCK_EX # define LOCK_EX 2 # endif # ifndef LOCK_NB # define LOCK_NB 4 # endif # ifndef LOCK_UN # define LOCK_UN 8 # endif #if defined(THREAD) && defined(EWOULDBLOCK) static int thread_flock(fd, op) int fd, op; { if (thread_alone() || (op & LOCK_NB)) { return flock(fd, op); } op |= LOCK_NB; while (flock(fd, op) < 0) { switch (errno) { case EINTR: /* can be happen? */ case EWOULDBLOCK: thread_schedule(); /* busy wait */ break; default: return -1; } } return 0; } #define flock thread_flock #endif static VALUE file_flock(obj, operation) VALUE obj; VALUE operation; { #ifdef USE_CWGUSI rb_notimplement(); #else OpenFile *fptr; rb_secure(2); GetOpenFile(obj, fptr); if (flock(fileno(fptr->f), NUM2INT(operation)) < 0) { #ifdef EWOULDBLOCK if (errno == EWOULDBLOCK) { return FALSE; } #endif rb_sys_fail(fptr->path); } return INT2FIX(0); #endif /* USE_CWGUSI */ } #undef flock static void test_check(n, argc, argv) int n, argc; VALUE *argv; { int i; n+=1; if (n < argc) ArgError("Wrong # of arguments(%d for %d)", argc, n); for (i=1; iptr); } switch (cmd) { case 'A': return time_new(st.st_atime, 0); case 'M': return time_new(st.st_mtime, 0); case 'C': return time_new(st.st_ctime, 0); } } if (strchr("-=<>", cmd)) { struct stat st1, st2; CHECK(2); if (rb_stat(argv[1], &st1) < 0) return FALSE; if (rb_stat(argv[2], &st2) < 0) return FALSE; switch (cmd) { case '-': if (st1.st_dev == st2.st_dev && st1.st_ino == st2.st_ino) return TRUE; break; case '=': if (st1.st_mtime == st2.st_mtime) return TRUE; break; case '>': if (st1.st_mtime > st2.st_mtime) return TRUE; break; case '<': if (st1.st_mtime < st2.st_mtime) return TRUE; break; } } /* unknown command */ ArgError("unknow command ?%c", cmd); return Qnil; /* not reached */ } void Init_File() { VALUE mConst; mFileTest = rb_define_module("FileTest"); rb_define_module_function(mFileTest, "directory?", test_d, 1); rb_define_module_function(mFileTest, "exist?", test_e, 1); rb_define_module_function(mFileTest, "exists?", test_e, 1); /* temporary */ rb_define_module_function(mFileTest, "readable?", test_r, 1); rb_define_module_function(mFileTest, "readable_real?", test_R, 1); rb_define_module_function(mFileTest, "writable?", test_w, 1); rb_define_module_function(mFileTest, "writable_real?", test_W, 1); rb_define_module_function(mFileTest, "executable?", test_x, 1); rb_define_module_function(mFileTest, "executable_real?", test_X, 1); rb_define_module_function(mFileTest, "file?", test_f, 1); rb_define_module_function(mFileTest, "zero?", test_z, 1); rb_define_module_function(mFileTest, "size?", test_s, 1); rb_define_module_function(mFileTest, "size", test_s, 1); rb_define_module_function(mFileTest, "owned?", test_owned, 1); rb_define_module_function(mFileTest, "grpowned?", test_grpowned, 1); rb_define_module_function(mFileTest, "pipe?", test_p, 1); rb_define_module_function(mFileTest, "symlink?", test_l, 1); rb_define_module_function(mFileTest, "socket?", test_S, 1); rb_define_module_function(mFileTest, "blockdev?", test_b, 1); rb_define_module_function(mFileTest, "chardev?", test_c, 1); rb_define_module_function(mFileTest, "setuid?", test_suid, 1); rb_define_module_function(mFileTest, "setgid?", test_sgid, 1); rb_define_module_function(mFileTest, "sticky?", test_sticky, 1); cFile = rb_define_class("File", cIO); rb_extend_object(cFile, CLASS_OF(mFileTest)); rb_define_singleton_method(cFile, "new", file_s_open, -1); rb_define_singleton_method(cFile, "open", file_s_open, -1); rb_define_singleton_method(cFile, "stat", file_s_stat, 1); rb_define_singleton_method(cFile, "lstat", file_s_lstat, 1); rb_define_singleton_method(cFile, "ftype", file_s_ftype, 1); rb_define_singleton_method(cFile, "atime", file_s_atime, 1); rb_define_singleton_method(cFile, "mtime", file_s_mtime, 1); rb_define_singleton_method(cFile, "ctime", file_s_ctime, 1); rb_define_singleton_method(cFile, "size", file_s_size, 1); rb_define_singleton_method(cFile, "utime", file_s_utime, -1); rb_define_singleton_method(cFile, "chmod", file_s_chmod, -1); rb_define_singleton_method(cFile, "chown", file_s_chown, -1); rb_define_singleton_method(cFile, "link", file_s_link, 2); rb_define_singleton_method(cFile, "symlink", file_s_symlink, 2); rb_define_singleton_method(cFile, "readlink", file_s_readlink, 1); rb_define_singleton_method(cFile, "unlink", file_s_unlink, -2); rb_define_singleton_method(cFile, "delete", file_s_unlink, -2); rb_define_singleton_method(cFile, "rename", file_s_rename, 2); rb_define_singleton_method(cFile, "umask", file_s_umask, -1); rb_define_singleton_method(cFile, "truncate", file_s_truncate, 2); rb_define_singleton_method(cFile, "expand_path", file_s_expand_path, -1); rb_define_singleton_method(cFile, "basename", file_s_basename, -1); rb_define_singleton_method(cFile, "dirname", file_s_dirname, 1); separator = str_new2("/"); rb_define_const(cFile, "Separator", separator); rb_define_singleton_method(cFile, "split", file_s_split, 1); rb_define_singleton_method(cFile, "join", file_s_join, -2); rb_define_method(cFile, "reopen", file_reopen, -1); rb_define_method(cIO, "stat", io_stat, 0); /* this is IO's method */ rb_define_method(cFile, "lstat", file_lstat, 0); rb_define_method(cFile, "atime", file_atime, 0); rb_define_method(cFile, "mtime", file_mtime, 0); rb_define_method(cFile, "ctime", file_ctime, 0); rb_define_method(cFile, "chmod", file_chmod, 1); rb_define_method(cFile, "chown", file_chown, 2); rb_define_method(cFile, "truncate", file_truncate, 1); rb_define_method(cFile, "flock", file_flock, 1); mConst = rb_define_module_under(cFile, "Constants"); rb_define_const(cFile, "LOCK_SH", INT2FIX(LOCK_SH)); rb_define_const(cFile, "LOCK_EX", INT2FIX(LOCK_EX)); rb_define_const(cFile, "LOCK_UN", INT2FIX(LOCK_UN)); rb_define_const(cFile, "LOCK_NB", INT2FIX(LOCK_NB)); rb_define_const(mConst, "LOCK_SH", INT2FIX(LOCK_SH)); rb_define_const(mConst, "LOCK_EX", INT2FIX(LOCK_EX)); rb_define_const(mConst, "LOCK_UN", INT2FIX(LOCK_UN)); rb_define_const(mConst, "LOCK_NB", INT2FIX(LOCK_NB)); rb_define_method(cFile, "path", file_path, 0); rb_define_global_function("test", f_test, -1); sStat = struct_define("Stat", "dev", "ino", "mode", "nlink", "uid", "gid", "rdev", "size", "blksize", "blocks", "atime", "mtime", "ctime", 0); } ruby-1.2.3/fnmatch.c100644 774 145 14046 6527004611 12345 0ustar matzNaCl/* 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" #ifdef USE_CWGUSI #include #endif #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 == '/') /* If we are matching a pathname, `?' can never match a `/'. */ return (FNM_NOMATCH); else if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_PATHNAME) && n[-1] == '/'))) /* `?' cannot match a `.' if it is the first character of the string or if it is the first character following a slash and we are matching a pathname. */ return (FNM_NOMATCH); break; case '\\': if (!(flags & FNM_NOESCAPE)) { c = *p++; if (c == '\0') return (FNM_NOMATCH); } if (*n != c) return (FNM_NOMATCH); break; case '*': if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_PATHNAME) && n[-1] == '/'))) /* `*' cannot match a `.' if it is the first character of the string or if it is the first character following a slash and we are matching a pathname. */ return (FNM_NOMATCH); /* Collapse multiple consecutive, `*' and `?', but make sure that one character of the string is consumed for each `?'. */ for (c = *p++; c == '?' || c == '*'; c = *p++) { if ((flags & FNM_PATHNAME) && *n == '/') /* A slash does not match a wildcard under FNM_PATHNAME. */ return (FNM_NOMATCH); else if (c == '?') { if (*n == '\0') return (FNM_NOMATCH); /* One character of the string is consumed in matching this ? wildcard, so *??? won't match if there are fewer than three characters. */ n++; } } if (c == '\0') return (0); /* General case, use recursion. */ { char c1 = (!(flags & FNM_NOESCAPE) && c == '\\') ? *p : c; for (--p; *n != '\0'; ++n) /* Only call fnmatch if the first character indicates a possible match. */ 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); /* A character class cannot match a `.' if it is the first character of the string or if it is the first character following a slash and we are matching a pathname. */ if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_PATHNAME) && n[-1] == '/'))) return (FNM_NOMATCH); /* POSIX.2 2.8.3.1.2 says: `An expression containing a `[' that is not preceded by a backslash and is not part of a bracket expression produces undefined results.' This implementation treats the `[' as just a character to be matched if there is not a closing `]'. This code will have to be changed when POSIX.2 character classes are implemented. */ { register char *np; for (np = p; np && *np && *np != ']'; np++) ; if (np && !*np) { if (*n != '[') return (FNM_NOMATCH); break; } } not = (*p == '!' || *p == '^'); if (not) ++p; c = *p++; for (;;) { register char cstart, cend; /* Initialize cstart and cend in case `-' is the last character of the pattern. */ cstart = cend = c; if (!(flags & FNM_NOESCAPE) && c == '\\') { if (*p == '\0') return FNM_NOMATCH; cstart = cend = *p++; } if (c == '\0') /* [ (unterminated) loses. */ return (FNM_NOMATCH); c = *p++; if ((flags & FNM_PATHNAME) && c == '/') /* [/] can never match. */ return (FNM_NOMATCH); /* This introduces a range, unless the `-' is the last character of the class. Find the end of the range and move past it. */ 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); 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 == '\\') { if (*p == '\0') return FNM_NOMATCH; /* XXX 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-1.2.3/fnmatch.h100644 774 145 2645 6526467417 12354 0ustar matzNaCl/* 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-1.2.3/gc.c100644 774 145 51723 6646327156 11337 0ustar matzNaCl/************************************************ gc.c - $Author: matz $ $Date: 1999/01/11 07:55:26 $ created at: Tue Oct 5 09:44:46 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "rubysig.h" #include "st.h" #include "node.h" #include "env.h" #include "re.h" #include #include void re_free_registers _((struct re_registers*)); void io_fptr_finalize _((struct OpenFile*)); #ifndef setjmp #ifdef HAVE__SETJMP #define setjmp(env) _setjmp(env) #define longjmp(env,val) _longjmp(env,val) #endif #endif #ifdef C_ALLOCA #ifndef alloca void *alloca(); #endif #endif static void run_final(); #ifndef GC_MALLOC_LIMIT #if defined(MSDOS) || defined(__human68k__) #define GC_MALLOC_LIMIT 100000 #else #define GC_MALLOC_LIMIT 200000 #endif #endif #define GC_NEWOBJ_LIMIT 1000 static unsigned long malloc_memories = 0; static unsigned long alloc_objects = 0; void * xmalloc(size) int size; { void *mem; if (size < 0) { ArgError("negative allocation size (or too big)"); } if (size == 0) size = 1; malloc_memories += size; if (malloc_memories > GC_MALLOC_LIMIT && alloc_objects > GC_NEWOBJ_LIMIT) { gc_gc(); } mem = malloc(size); if (!mem) { gc_gc(); mem = malloc(size); if (!mem) Fatal("failed to allocate memory"); } return mem; } void * xcalloc(n, size) int n, size; { void *mem; mem = xmalloc(n * size); memset(mem, 0, n * size); return mem; } void * xrealloc(ptr, size) void *ptr; int size; { void *mem; if (size < 0) { ArgError("negative re-allocation size"); } if (!ptr) return xmalloc(size); if (size == 0) size = 1; malloc_memories += size; mem = realloc(ptr, size); if (!mem) { gc_gc(); mem = realloc(ptr, size); if (!mem) 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 */ extern int rb_in_compile; static int dont_gc; VALUE gc_s_enable() { int old = dont_gc; dont_gc = FALSE; return old; } VALUE gc_s_disable() { int old = dont_gc; dont_gc = TRUE; return old; } VALUE mGC; static struct gc_list { VALUE *varptr; struct gc_list *next; } *Global_List = 0; void rb_global_variable(var) VALUE *var; { struct gc_list *tmp; tmp = ALLOC(struct gc_list); tmp->next = Global_List; tmp->varptr = var; Global_List = tmp; } typedef struct RVALUE { union { struct { unsigned long flag; /* always 0 for freed obj */ struct RVALUE *next; } free; struct RBasic basic; struct RObject object; struct RClass klass; struct RFloat flonum; struct RString string; struct RArray array; struct RRegexp regexp; struct RHash hash; struct RData data; struct RStruct rstruct; struct RBignum bignum; struct RFile file; struct RNode node; struct RMatch match; struct RVarmap varmap; struct SCOPE scope; } as; } RVALUE; RVALUE *freelist = 0; #define HEAPS_INCREMENT 10 static RVALUE **heaps; static int heaps_length = 0; static int heaps_used = 0; #define HEAP_SLOTS 10000 #define FREE_MIN 512 static RVALUE *himem, *lomem; static void add_heap() { RVALUE *p, *pend; if (heaps_used == heaps_length) { /* Realloc heaps */ heaps_length += HEAPS_INCREMENT; heaps = (heaps_used>0)? (RVALUE**)realloc(heaps, heaps_length*sizeof(RVALUE)): (RVALUE**)malloc(heaps_length*sizeof(RVALUE)); if (heaps == 0) Fatal("can't alloc memory"); } p = heaps[heaps_used++] = (RVALUE*)malloc(sizeof(RVALUE)*HEAP_SLOTS); if (p == 0) Fatal("can't alloc memory"); pend = p + HEAP_SLOTS; if (lomem == 0 || lomem > p) lomem = p; if (himem < pend) himem = pend; while (p < pend) { p->as.free.flag = 0; p->as.free.next = freelist; freelist = p; p++; } } #define RANY(o) ((RVALUE*)(o)) VALUE rb_newobj() { VALUE obj; if (freelist) { retry: obj = (VALUE)freelist; freelist = freelist->as.free.next; alloc_objects++; return obj; } if (dont_gc || prohibit_interrupt) add_heap(); else gc_gc(); goto retry; } VALUE data_object_alloc(klass, datap, dmark, dfree) VALUE klass; void *datap; void (*dfree)(); void (*dmark)(); { NEWOBJ(data, struct RData); OBJSETUP(data, klass, T_DATA); data->data = datap; data->dfree = dfree; data->dmark = dmark; return (VALUE)data; } extern st_table *rb_class_tbl; VALUE *gc_stack_start; static int looks_pointerp(ptr) void *ptr; { register RVALUE *p = RANY(ptr); register RVALUE *heap_org; register long i; if (p < lomem || p > himem) return FALSE; /* check if p looks like a pointer */ for (i=0; i < heaps_used; i++) { heap_org = heaps[i]; if (heap_org <= p && p < heap_org + HEAP_SLOTS && ((((char*)p)-((char*)heap_org))%sizeof(RVALUE)) == 0) return TRUE; } return FALSE; } static void mark_locations_array(x, n) VALUE *x; long n; { while (n--) { if (looks_pointerp(*x)) { gc_mark(*x); } x++; } } void gc_mark_locations(start, end) VALUE *start, *end; { VALUE *tmp; long n; if (start > end) { tmp = start; start = end; end = tmp; } n = end - start; mark_locations_array(start,n); } static int mark_entry(key, value) ID key; VALUE value; { gc_mark(value); return ST_CONTINUE; } static void mark_tbl(tbl) st_table *tbl; { if (!tbl) return; st_foreach(tbl, mark_entry, 0); } static int mark_hashentry(key, value) ID key; VALUE value; { gc_mark(key); gc_mark(value); return ST_CONTINUE; } static void mark_hash(tbl) st_table *tbl; { if (!tbl) return; st_foreach(tbl, mark_hashentry, 0); } void gc_mark_maybe(obj) void *obj; { if (looks_pointerp(obj)) { gc_mark(obj); } } void gc_mark(ptr) void *ptr; { register RVALUE *obj = RANY(ptr); Top: if (FIXNUM_P(obj)) return; /* fixnum not marked */ if (rb_special_const_p((VALUE)obj)) return; /* special const not marked */ if (obj->as.basic.flags == 0) return; /* free cell */ if (obj->as.basic.flags & FL_MARK) return; /* already marked */ 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; case T_NODE: switch (nd_type(obj)) { case NODE_IF: /* 1,2,3 */ case NODE_FOR: case NODE_ITER: case NODE_CREF: gc_mark(obj->as.node.u2.node); /* fall through */ case NODE_BLOCK: /* 1,3 */ case NODE_ARRAY: case NODE_DSTR: case NODE_DXSTR: case NODE_EVSTR: case NODE_DREGX: case NODE_DREGX_ONCE: case NODE_FBODY: case NODE_CALL: gc_mark(obj->as.node.u1.node); /* fall through */ case NODE_SUPER: /* 3 */ case NODE_FCALL: case NODE_NEWLINE: obj = RANY(obj->as.node.u3.node); goto Top; case NODE_WHILE: /* 1,2 */ case NODE_UNTIL: case NODE_MATCH2: case NODE_MATCH3: gc_mark(obj->as.node.u1.node); /* fall through */ case NODE_METHOD: /* 2 */ case NODE_NOT: case NODE_GASGN: case NODE_LASGN: case NODE_DASGN: case NODE_IASGN: case NODE_CASGN: obj = RANY(obj->as.node.u2.node); goto Top; case NODE_HASH: /* 1 */ case NODE_LIT: case NODE_STR: case NODE_XSTR: case NODE_DEFINED: case NODE_MATCH: obj = RANY(obj->as.node.u1.node); goto Top; case NODE_SCOPE: /* 2,3 */ gc_mark(obj->as.node.u3.node); obj = RANY(obj->as.node.u2.node); goto Top; case NODE_ZARRAY: /* - */ case NODE_CFUNC: case NODE_VCALL: case NODE_GVAR: case NODE_LVAR: case NODE_DVAR: case NODE_IVAR: case NODE_CVAR: case NODE_NTH_REF: case NODE_BACK_REF: case NODE_ALIAS: case NODE_VALIAS: case NODE_UNDEF: case NODE_SELF: case NODE_NIL: case NODE_POSTEXE: break; #ifdef C_ALLOCA case NODE_ALLOCA: mark_locations_array((VALUE*)obj->as.node.u1.value, obj->as.node.u3.cnt); obj = RANY(obj->as.node.u2.node); goto Top; #endif default: if (looks_pointerp(obj->as.node.u1.node)) { gc_mark(obj->as.node.u1.node); } if (looks_pointerp(obj->as.node.u2.node)) { gc_mark(obj->as.node.u2.node); } if (looks_pointerp(obj->as.node.u3.node)) { obj = RANY(obj->as.node.u3.node); goto Top; } } return; /* no need to mark class. */ } gc_mark(obj->as.basic.klass); switch (obj->as.basic.flags & T_MASK) { case T_ICLASS: gc_mark(obj->as.klass.super); mark_tbl(obj->as.klass.iv_tbl); mark_tbl(obj->as.klass.m_tbl); break; case T_CLASS: case T_MODULE: gc_mark(obj->as.klass.super); mark_tbl(obj->as.klass.m_tbl); mark_tbl(obj->as.klass.iv_tbl); 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++); } break; case T_HASH: mark_hash(obj->as.hash.tbl); break; case T_STRING: if (obj->as.string.orig) { obj = RANY(obj->as.string.orig); goto Top; } break; case T_DATA: if (obj->as.data.dmark) (*obj->as.data.dmark)(DATA_PTR(obj)); break; case T_OBJECT: mark_tbl(obj->as.object.iv_tbl); break; case T_FILE: case T_REGEXP: case T_FLOAT: case T_BIGNUM: break; case T_MATCH: if (obj->as.match.str) { obj = RANY(obj->as.match.str); goto Top; } break; case T_VARMAP: gc_mark(obj->as.varmap.val); obj = RANY(obj->as.varmap.next); goto Top; break; case T_SCOPE: if (obj->as.scope.local_vars) { int n = obj->as.scope.local_tbl[0]+1; VALUE *vars = &obj->as.scope.local_vars[-1]; while (n--) { gc_mark_maybe(*vars); vars++; } } break; case T_STRUCT: { int i, len = obj->as.rstruct.len; VALUE *ptr = obj->as.rstruct.ptr; for (i=0; i < len; i++) gc_mark(*ptr++); } break; default: Bug("gc_mark(): unknown data type 0x%x(0x%x) %s", obj->as.basic.flags & T_MASK, obj, looks_pointerp(obj)?"corrupted object":"non object"); } } #define MIN_FREE_OBJ 512 static void obj_free(); static void gc_sweep() { RVALUE *p, *pend; int freed = 0; int i, used = heaps_used; if (rb_in_compile) { for (i = 0; i < used; i++) { p = heaps[i]; pend = p + HEAP_SLOTS; while (p < pend) { if (!(p->as.basic.flags&FL_MARK) && BUILTIN_TYPE(p) == T_NODE) gc_mark(p); p++; } } } freelist = 0; for (i = 0; i < used; i++) { int n = 0; p = heaps[i]; pend = p + HEAP_SLOTS; while (p < pend) { if (!(p->as.basic.flags & FL_MARK)) { if (p->as.basic.flags) obj_free((VALUE)p); p->as.free.flag = 0; p->as.free.next = freelist; freelist = p; n++; } else RBASIC(p)->flags &= ~FL_MARK; p++; } freed += n; } alloc_objects = 0; if (freed < FREE_MIN) { add_heap(); } } void gc_force_recycle(p) VALUE p; { RANY(p)->as.free.flag = 0; RANY(p)->as.free.next = freelist; freelist = RANY(p); } static int need_call_final = 0; static void obj_free(obj) VALUE obj; { switch (RANY(obj)->as.basic.flags & T_MASK) { case T_NIL: case T_FIXNUM: case T_TRUE: case T_FALSE: Bug("obj_free() called for broken object"); break; } if (need_call_final) { run_final(obj); } switch (RANY(obj)->as.basic.flags & T_MASK) { case T_OBJECT: if (RANY(obj)->as.object.iv_tbl) { st_free_table(RANY(obj)->as.object.iv_tbl); } break; case T_MODULE: case T_CLASS: rb_clear_cache(); st_free_table(RANY(obj)->as.klass.m_tbl); if (RANY(obj)->as.object.iv_tbl) { st_free_table(RANY(obj)->as.object.iv_tbl); } break; case T_STRING: #define STR_NO_ORIG FL_USER3 /* copied from string.c */ if (!RANY(obj)->as.string.orig || FL_TEST(obj, STR_NO_ORIG)) free(RANY(obj)->as.string.ptr); break; case T_ARRAY: if (RANY(obj)->as.array.ptr) free(RANY(obj)->as.array.ptr); break; case T_HASH: if (RANY(obj)->as.hash.tbl) st_free_table(RANY(obj)->as.hash.tbl); break; case T_REGEXP: if (RANY(obj)->as.regexp.ptr) re_free_pattern(RANY(obj)->as.regexp.ptr); if (RANY(obj)->as.regexp.str) free(RANY(obj)->as.regexp.str); break; case T_DATA: if (DATA_PTR(obj)) { if ((long)RANY(obj)->as.data.dfree == -1) { free(DATA_PTR(obj)); } else if (RANY(obj)->as.data.dfree) { (*RANY(obj)->as.data.dfree)(DATA_PTR(obj)); } } break; case T_MATCH: if (RANY(obj)->as.match.regs) re_free_registers(RANY(obj)->as.match.regs); if (RANY(obj)->as.match.regs) free(RANY(obj)->as.match.regs); break; case T_FILE: if (RANY(obj)->as.file.fptr) { io_fptr_finalize(RANY(obj)->as.file.fptr); free(RANY(obj)->as.file.fptr); } break; case T_ICLASS: /* iClass shares table with the module */ break; case T_FLOAT: case T_VARMAP: break; case T_BIGNUM: if (RANY(obj)->as.bignum.digits) free(RANY(obj)->as.bignum.digits); break; case T_NODE: switch (nd_type(obj)) { case NODE_SCOPE: if (RANY(obj)->as.node.u1.tbl) { free(RANY(obj)->as.node.u1.tbl); } break; #ifdef C_ALLOCA case NODE_ALLOCA: free(RANY(obj)->as.node.u1.value); break; #endif } return; /* no need to free iv_tbl */ case T_SCOPE: if (RANY(obj)->as.scope.local_vars) { VALUE *vars = RANY(obj)->as.scope.local_vars-1; if (vars[0] == 0) free(RANY(obj)->as.scope.local_tbl); if (RANY(obj)->as.scope.flag&SCOPE_MALLOC) free(vars); } break; case T_STRUCT: if (RANY(obj)->as.rstruct.ptr) free(RANY(obj)->as.rstruct.ptr); break; default: Bug("gc_sweep(): unknown data type %d", RANY(obj)->as.basic.flags & T_MASK); } } void gc_mark_frame(frame) struct FRAME *frame; { int n = frame->argc; VALUE *tbl = frame->argv; while (n--) { gc_mark_maybe(*tbl); tbl++; } gc_mark(frame->cbase); } #ifdef __GNUC__ #if defined(__human68k__) || defined(DJGPP) #if defined(__human68k__) typedef unsigned long rb_jmp_buf[8]; __asm__ (".even _rb_setjmp: move.l 4(sp),a0 movem.l d3-d7/a3-a5,(a0) moveq.l #0,d0 rts"); #else #if defined(DJGPP) typedef unsigned long rb_jmp_buf[6]; __asm__ (".align 4 _rb_setjmp: pushl %ebp movl %esp,%ebp movl 8(%ebp),%ebp movl %eax,(%ebp) movl %ebx,4(%ebp) movl %ecx,8(%ebp) movl %edx,12(%ebp) movl %esi,16(%ebp) movl %edi,20(%ebp) popl %ebp xorl %eax,%eax ret"); #endif #endif int rb_setjmp (rb_jmp_buf); #define jmp_buf rb_jmp_buf #define setjmp rb_setjmp #endif /* __human68k__ or DJGPP */ #endif /* __GNUC__ */ void gc_gc() { struct gc_list *list; struct FRAME *frame; jmp_buf save_regs_gc_mark; VALUE stack_end; if (dont_gc) return; dont_gc++; malloc_memories = 0; #ifdef C_ALLOCA alloca(0); #endif /* mark frame stack */ for (frame = the_frame; frame; frame = frame->prev) { gc_mark_frame(frame); } gc_mark(the_scope); gc_mark(the_dyna_vars); FLUSH_REGISTER_WINDOWS; /* This assumes that all registers are saved into the jmp_buf */ setjmp(save_regs_gc_mark); mark_locations_array((VALUE*)&save_regs_gc_mark, sizeof(save_regs_gc_mark) / sizeof(VALUE *)); gc_mark_locations(gc_stack_start, (VALUE*)&stack_end); #if defined(THINK_C) || defined(__human68k__) #ifndef __human68k__ mark_locations_array((VALUE*)((char*)save_regs_gc_mark+2), sizeof(save_regs_gc_mark) / sizeof(VALUE *)); #endif gc_mark_locations((VALUE*)((char*)gc_stack_start + 2), (VALUE*)((char*)&stack_end + 2)); #endif #ifdef THREAD gc_mark_threads(); #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--; } static VALUE gc_method() { gc_gc(); return Qnil; } void init_stack() { #ifdef __human68k__ extern void *_SEND; gc_stack_start = _SEND; #else VALUE start; gc_stack_start = &start; #endif } void init_heap() { init_stack(); add_heap(); } static VALUE os_live_obj() { int i; int n = 0; for (i = 0; i < heaps_used; i++) { RVALUE *p, *pend; p = heaps[i]; pend = p + HEAP_SLOTS; for (;p < pend; p++) { if (p->as.basic.flags) { switch (TYPE(p)) { case T_ICLASS: case T_VARMAP: case T_SCOPE: case T_NODE: continue; case T_CLASS: if (FL_TEST(p, FL_SINGLETON)) continue; default: rb_yield((VALUE)p); n++; } } } } return INT2FIX(n); } static VALUE os_obj_of(of) VALUE of; { int i; int n = 0; for (i = 0; i < heaps_used; i++) { RVALUE *p, *pend; p = heaps[i]; pend = p + HEAP_SLOTS; for (;p < pend; p++) { if (p->as.basic.flags) { switch (TYPE(p)) { case T_ICLASS: case T_VARMAP: case T_SCOPE: case T_NODE: continue; case T_CLASS: if (FL_TEST(p, FL_SINGLETON)) continue; default: if (obj_is_kind_of((VALUE)p, of)) { rb_yield((VALUE)p); n++; } } } } } return INT2FIX(n); } static VALUE os_each_obj(argc, argv) int argc; VALUE *argv; { VALUE of; if (rb_scan_args(argc, argv, "01", &of) == 0) { return os_live_obj(); } else { return os_obj_of(of); } } static VALUE finalizers; static VALUE add_final(os, proc) VALUE os, proc; { if (!obj_is_kind_of(proc, cProc)) { ArgError("wrong type argument %s (Proc required)", rb_class2name(CLASS_OF(proc))); } ary_push(finalizers, proc); return proc; } static VALUE rm_final(os, proc) VALUE os, proc; { ary_delete(finalizers, proc); return proc; } static VALUE finals() { return finalizers; } static VALUE call_final(os, obj) VALUE os, obj; { need_call_final = 1; FL_SET(obj, FL_FINALIZE); return obj; } static void run_final(obj) VALUE obj; { int i; if (!FL_TEST(obj, FL_FINALIZE)) return; obj = INT2NUM((long)obj); /* make obj into id */ for (i=0; ilen; i++) { rb_eval_cmd(RARRAY(finalizers)->ptr[i], ary_new3(1,obj)); } } void gc_call_finalizer_at_exit() { RVALUE *p, *pend; int i; /* run finalizers */ for (i = 0; i < heaps_used; i++) { p = heaps[i]; pend = p + HEAP_SLOTS; while (p < pend) { run_final((VALUE)p); p++; } } /* run data object's finaliers */ for (i = 0; i < heaps_used; i++) { p = heaps[i]; pend = p + HEAP_SLOTS; while (p < pend) { if (BUILTIN_TYPE(p) == T_DATA && DATA_PTR(p) && RANY(p)->as.data.dfree) (*RANY(p)->as.data.dfree)(DATA_PTR(p)); p++; } } } static VALUE id2ref(obj, id) VALUE obj, id; { unsigned long ptr = NUM2UINT(id); if (FIXNUM_P(ptr)) return (VALUE)ptr; if (ptr == TRUE) return TRUE; if (ptr == FALSE) return FALSE; if (ptr == Qnil) return Qnil; if (!looks_pointerp(ptr)) { IndexError("0x%x is not the id value", ptr); } if (RANY(ptr)->as.free.flag == 0) { IndexError("0x%x is recycled object", ptr); } return (VALUE)ptr; } void Init_GC() { VALUE mObSpace; mGC = rb_define_module("GC"); rb_define_singleton_method(mGC, "start", gc_method, 0); rb_define_singleton_method(mGC, "enable", gc_s_enable, 0); rb_define_singleton_method(mGC, "disable", gc_s_disable, 0); rb_define_method(mGC, "garbage_collect", gc_method, 0); mObSpace = rb_define_module("ObjectSpace"); rb_define_module_function(mObSpace, "each_object", os_each_obj, -1); rb_define_module_function(mObSpace, "garbage_collect", gc_method, 0); rb_define_module_function(mObSpace, "add_finalizer", add_final, 1); rb_define_module_function(mObSpace, "remove_finalizer", rm_final, 1); rb_define_module_function(mObSpace, "finalizers", finals, 0); rb_define_module_function(mObSpace, "call_finalizer", call_final, 1); rb_define_module_function(mObSpace, "_id2ref", id2ref, 1); rb_global_variable(&finalizers); finalizers = ary_new(); } ruby-1.2.3/glob.c100644 774 145 34567 6573141407 11670 0ustar matzNaCl/* 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 (__GNUC__) && !defined (HAVE_ALLOCA_H) && defined (_AIX) #pragma alloca #endif /* _AIX && RISC6000 && !__GNUC__ */ #if defined (HAVE_ALLOCA_H) # include #endif #if defined (HAVE_UNISTD_H) # include #endif #if defined (HAVE_STDLIB_H) # include #else # if defined (SHELL) # include "ansi_stdlib.h" # endif /* SHELL */ #endif #include #if defined (HAVE_DIRENT_H) # include # define D_NAMLEN(d) strlen ((d)->d_name) #elif HAVE_DIRECT_H # include # define D_NAMLEN(d) strlen ((d)->d_name) #else /* !HAVE_DIRENT_H */ # define D_NAMLEN(d) ((d)->d_namlen) # if defined (HAVE_SYS_NDIR_H) # include # endif # if defined (HAVE_SYS_DIR_H) # include # endif /* HAVE_SYS_DIR_H */ # if defined (HAVE_NDIR_H) # include # endif # if !defined (dirent) # define dirent direct # endif #endif /* !HAVE_DIRENT_H */ #if defined (_POSIX_SOURCE) || defined(DJGPP) || defined(USE_CWGUSI) /* Posix does not require that the d_ino field be present, and some systems do not provide it. */ # define REAL_DIR_ENTRY(dp) 1 #elif defined (__BORLANDC__) # define REAL_DIR_ENTRY(dp) 1 #else # define REAL_DIR_ENTRY(dp) (dp->d_ino != 0) #endif /* _POSIX_SOURCE */ #if defined (HAVE_STRING_H) # include #else /* !HAVE_STRING_H */ # include #endif /* !HAVE_STRING_H */ #if !defined (HAVE_BCOPY) && !defined (bcopy) # define bcopy(s, d, n) ((void) memcpy ((d), (s), (n))) #endif /* !HAVE_BCOPY */ /* If the opendir () on your system lets you open non-directory files, then we consider that not robust. */ #if defined (OPENDIR_NOT_ROBUST) # if defined (SHELL) # include "posixstat.h" # else /* !SHELL */ # include # endif /* !SHELL */ #endif /* OPENDIR_NOT_ROBUST */ #include "fnmatch.h" 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 void throw_to_top_level (); extern int interrupt_state; #endif /* SHELL */ #if defined(NT) && defined(_MSC_VER) #include "missing/dir.h" #endif /* 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 dirent *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] != '.' && (pat[0] != '\\' || pat[1] != '.')) 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? */ #if defined (SHELL) lost: #endif 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); #if 1 strcpy (result[i], dir); if (add_slash) result[i][l] = '/'; strcpy (result[i] + l + add_slash, array[i]); #else (void)sprintf (result[i], "%s%s%s", dir, add_slash ? "/" : "", array[i]); #endif } 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; { #ifndef strrchr char *strrchr(); #endif 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) { free ((char *) result); return ((char **) &glob_error_return); } else if (*directories == NULL) { free ((char *) directories); free ((char *) result); 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-1.2.3/hash.c100644 774 145 56303 6657725622 11672 0ustar matzNaCl/************************************************ hash.c - $Author: matz $ $Date: 1999/02/09 03:29:22 $ created at: Mon Nov 22 18:51:18 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "st.h" #include "rubysig.h" #include #include #ifndef HAVE_STRING_H char *strchr _((char*,char)); #endif #define HASH_FREEZE FL_USER1 #define HASH_DELETED FL_USER2 static void hash_modify(hash) VALUE hash; { rb_secure(5); if (FL_TEST(hash, HASH_FREEZE)) { TypeError("can't modify frozen hash"); } } VALUE hash_freeze(hash) VALUE hash; { FL_SET(hash, HASH_FREEZE); return hash; } static VALUE hash_frozen_p(hash) VALUE hash; { if (FL_TEST(hash, HASH_FREEZE)) return TRUE; return FALSE; } VALUE cHash; static VALUE envtbl; static ID hash; VALUE rb_hash(obj) VALUE obj; { return rb_funcall(obj, hash, 0); } static int any_cmp(a, b) VALUE a, b; { if (FIXNUM_P(a)) { if (FIXNUM_P(b)) return a != b; } else if (TYPE(a) == T_STRING) { if (TYPE(b) == T_STRING) return str_cmp(a, b); } DEFER_INTS; a = !rb_eql(a, b); ENABLE_INTS; return a; } static int any_hash(a, mod) VALUE a; int mod; { unsigned int hval; switch (TYPE(a)) { case T_FIXNUM: hval = a; break; case T_STRING: hval = str_hash(a); break; default: DEFER_INTS; hval = rb_funcall(a, hash, 0); if (!FIXNUM_P(hval)) { hval = rb_funcall(hval, '%', 1, INT2FIX(65439)); } ENABLE_INTS; hval = FIX2LONG(hval); } return hval % mod; } static struct st_hash_type objhash = { any_cmp, any_hash, }; struct hash_foreach_arg { VALUE hash; enum st_retval (*func)(); char *arg; }; static int hash_foreach_iter(key, value, arg) VALUE key, value; struct hash_foreach_arg *arg; { int status; st_table *tbl = RHASH(arg->hash)->tbl; st_table_entry **bins = tbl->bins; if (key == Qnil) return ST_CONTINUE; status = (*arg->func)(key, value, arg->arg); if (RHASH(arg->hash)->tbl != tbl || RHASH(arg->hash)->tbl->bins != bins){ IndexError("rehash occurred during iteration"); } return status; } static VALUE hash_foreach_call(arg) struct hash_foreach_arg *arg; { st_foreach(RHASH(arg->hash)->tbl, hash_foreach_iter, arg); return Qnil; } static int hash_delete_nil(key, value) VALUE key, value; { if (value == Qnil) return ST_DELETE; return ST_CONTINUE; } static VALUE hash_foreach_ensure(hash) VALUE hash; { RHASH(hash)->iter_lev--; if (RHASH(hash)->iter_lev == 0) { if (FL_TEST(hash, HASH_DELETED)) { st_foreach(RHASH(hash)->tbl, hash_delete_nil, 0); FL_UNSET(hash, HASH_DELETED); } } return 0; } static int hash_foreach(hash, func, farg) VALUE hash; enum st_retval (*func)(); char *farg; { struct hash_foreach_arg arg; RHASH(hash)->iter_lev++; arg.hash = hash; arg.func = func; arg.arg = farg; return rb_ensure(hash_foreach_call, (VALUE)&arg, hash_foreach_ensure, hash); } static VALUE hash_s_new(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { VALUE sz; int size; NEWOBJ(hash, struct RHash); OBJSETUP(hash, klass, T_HASH); hash->iter_lev = 0; hash->status = 0; hash->tbl = 0; /* avoid GC crashing */ if (rb_scan_args(argc, argv, "01", &sz) == 0) { size = 0; } else size = NUM2INT(sz); hash->tbl = st_init_table_with_size(&objhash, size); obj_call_init((VALUE)hash); return (VALUE)hash; } static VALUE hash_new2(klass) VALUE klass; { NEWOBJ(hash, struct RHash); OBJSETUP(hash, klass, T_HASH); hash->iter_lev = 0; hash->status = 0; hash->tbl = 0; /* avoid GC crashing */ hash->tbl = st_init_table(&objhash); return (VALUE)hash; } VALUE hash_new() { return hash_new2(cHash); } static VALUE hash_s_create(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { VALUE hash; int i; if (argc == 1 && TYPE(argv[0]) == T_HASH) { if (klass == CLASS_OF(argv[0])) return argv[0]; else { NEWOBJ(hash, struct RHash); OBJSETUP(hash, klass, T_HASH); hash->iter_lev = 0; hash->status = 0; hash->tbl = 0; /* avoid GC crashing */ hash->tbl = (st_table*)st_copy(RHASH(argv[0])->tbl); obj_call_init((VALUE)hash); return (VALUE)hash; } } if (argc % 2 != 0) { ArgError("odd number args for Hash"); } hash = hash_new2(klass); for (i=0; itbl, argv[i], argv[i+1]); } obj_call_init(hash); return hash; } static VALUE hash_clone(hash) VALUE hash; { NEWOBJ(hash2, struct RHash); CLONESETUP(hash2, hash); hash2->iter_lev = 0; hash2->status = 0; hash2->tbl = 0; /* avoid GC crashing */ hash2->tbl = (st_table*)st_copy(RHASH(hash)->tbl); return (VALUE)hash2; } static VALUE hash_dup(hash) VALUE hash; { NEWOBJ(hash2, struct RHash); OBJSETUP(hash2, CLASS_OF(hash), T_HASH); hash2->iter_lev = 0; hash2->status = 0; hash2->tbl = 0; /* avoid GC crashing */ hash2->tbl = (st_table*)st_copy(RHASH(hash)->tbl); return (VALUE)hash2; } static VALUE to_hash(hash) VALUE hash; { return rb_convert_type(hash, T_HASH, "Hash", "to_hash"); } static int hash_rehash_i(key, value, tbl) VALUE key, value; st_table *tbl; { if (key != Qnil) { st_insert(tbl, key, value); } return ST_CONTINUE; } static VALUE hash_rehash(hash) VALUE hash; { st_table *tbl; tbl = st_init_table_with_size(&objhash, RHASH(hash)->tbl->num_entries); st_foreach(RHASH(hash)->tbl, hash_rehash_i, tbl); st_free_table(RHASH(hash)->tbl); RHASH(hash)->tbl = tbl; return hash; } VALUE hash_aref(hash, key) VALUE hash, key; { VALUE val; if (!st_lookup(RHASH(hash)->tbl, key, &val)) { return Qnil; } return val; } static VALUE hash_fetch(argc, argv, hash) int argc; VALUE *argv; VALUE hash; { VALUE key, if_none; VALUE val; rb_scan_args(argc, argv, "11", &key, &if_none); if (!st_lookup(RHASH(hash)->tbl, key, &val)) { if (iterator_p()) { if (argc > 1) { ArgError("wrong # of arguments", argc); } return rb_yield(argv[0]); } return if_none; } return val; } static VALUE hash_indexes(argc, argv, hash) int argc; VALUE *argv; VALUE hash; { VALUE indexes; int i; indexes = ary_new2(argc); for (i=0; iptr[i] = hash_aref(hash, argv[i]); } RARRAY(indexes)->len = i; return indexes; } static VALUE hash_delete(hash, key) VALUE hash, key; { VALUE val; hash_modify(hash); if (RHASH(hash)->iter_lev > 0 && st_delete_safe(RHASH(hash)->tbl, &key, &val, Qnil)) { FL_SET(hash, HASH_DELETED); return val; } else if (st_delete(RHASH(hash)->tbl, &key, &val)) return val; if (iterator_p()) { return rb_yield(key); } return Qnil; } struct shift_var { int stop; VALUE key; VALUE val; }; static int shift_i(key, value, var) VALUE key, value; struct shift_var *var; { if (key == Qnil) return ST_CONTINUE; if (var->stop) return ST_STOP; var->stop = 1; var->key = key; var->val = value; return ST_DELETE; } static VALUE hash_shift(hash) VALUE hash; { struct shift_var var; hash_modify(hash); var.stop = 0; st_foreach(RHASH(hash)->tbl, shift_i, &var); if (var.stop == 0) return Qnil; return assoc_new(var.key, var.val); } static int delete_if_i(key, value) VALUE key, value; { if (key == Qnil) return ST_CONTINUE; if (RTEST(rb_yield(assoc_new(key, value)))) return ST_DELETE; return ST_CONTINUE; } static VALUE hash_delete_if(hash) VALUE hash; { hash_modify(hash); hash_foreach(hash, delete_if_i, 0); return hash; } static int clear_i(key, value) VALUE key, value; { return ST_DELETE; } static VALUE hash_clear(hash) VALUE hash; { hash_modify(hash); st_foreach(RHASH(hash)->tbl, clear_i); return hash; } VALUE hash_aset(hash, key, val) VALUE hash, key, val; { hash_modify(hash); if (NIL_P(val)) { hash_delete(hash, key); return Qnil; } if (TYPE(key) == T_STRING) { key = str_dup_frozen(key); } st_insert(RHASH(hash)->tbl, key, val); return val; } static int replace_i(key, val, hash) VALUE key, val, hash; { hash_aset(hash, key, val); return ST_CONTINUE; } static VALUE hash_replace(hash, hash2) VALUE hash, hash2; { hash2 = to_hash(hash2); hash_clear(hash); st_foreach(RHASH(hash2)->tbl, replace_i, hash); return hash; } static VALUE hash_length(hash) VALUE hash; { return INT2FIX(RHASH(hash)->tbl->num_entries); } static VALUE hash_empty_p(hash) VALUE hash; { if (RHASH(hash)->tbl->num_entries == 0) return TRUE; return FALSE; } static int each_value_i(key, value) VALUE key, value; { if (key == Qnil) return ST_CONTINUE; rb_yield(value); return ST_CONTINUE; } static VALUE hash_each_value(hash) VALUE hash; { hash_foreach(hash, each_value_i, 0); return hash; } static int each_key_i(key, value) VALUE key, value; { if (key == Qnil) return ST_CONTINUE; rb_yield(key); return ST_CONTINUE; } static VALUE hash_each_key(hash) VALUE hash; { hash_foreach(hash, each_key_i, 0); return hash; } static int each_pair_i(key, value) VALUE key, value; { if (key == Qnil) return ST_CONTINUE; rb_yield(assoc_new(key, value)); return ST_CONTINUE; } static VALUE hash_each_pair(hash) VALUE hash; { hash_foreach(hash, each_pair_i, 0); return hash; } static int to_a_i(key, value, ary) VALUE key, value, ary; { if (key == Qnil) return ST_CONTINUE; ary_push(ary, assoc_new(key, value)); return ST_CONTINUE; } static VALUE hash_to_a(hash) VALUE hash; { VALUE ary; ary = ary_new(); st_foreach(RHASH(hash)->tbl, to_a_i, ary); return ary; } static int inspect_i(key, value, str) VALUE key, value, str; { VALUE str2; if (key == Qnil) return ST_CONTINUE; if (RSTRING(str)->len > 1) { str_cat(str, ", ", 2); } str2 = rb_inspect(key); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); str_cat(str, "=>", 2); str2 = rb_inspect(value); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); return ST_CONTINUE; } static VALUE hash_inspect(hash) VALUE hash; { VALUE str; str = str_new2("{"); st_foreach(RHASH(hash)->tbl, inspect_i, str); str_cat(str, "}", 1); return str; } static VALUE hash_to_s(hash) VALUE hash; { return ary_to_s(hash_to_a(hash)); } static VALUE hash_to_hash(hash) VALUE hash; { return hash; } static int keys_i(key, value, ary) VALUE key, value, ary; { if (key == Qnil) return ST_CONTINUE; ary_push(ary, key); return ST_CONTINUE; } static VALUE hash_keys(hash) VALUE hash; { VALUE ary; ary = ary_new(); st_foreach(RHASH(hash)->tbl, keys_i, ary); return ary; } static int values_i(key, value, ary) VALUE key, value, ary; { if (key == Qnil) return ST_CONTINUE; ary_push(ary, value); return ST_CONTINUE; } static VALUE hash_values(hash) VALUE hash; { VALUE ary; ary = ary_new(); st_foreach(RHASH(hash)->tbl, values_i, ary); return ary; } static VALUE hash_has_key(hash, key) VALUE hash; VALUE key; { if (st_lookup(RHASH(hash)->tbl, key, 0)) { return TRUE; } return FALSE; } static int hash_search_value(key, value, data) VALUE key, value, *data; { if (key == Qnil) return ST_CONTINUE; if (rb_equal(value, data[1])) { data[0] = TRUE; return ST_STOP; } return ST_CONTINUE; } static VALUE hash_has_value(hash, val) VALUE hash; VALUE val; { VALUE data[2]; data[0] = FALSE; data[1] = val; st_foreach(RHASH(hash)->tbl, hash_search_value, data); return data[0]; } struct equal_data { int result; st_table *tbl; }; static int equal_i(key, val1, data) VALUE key, val1; struct equal_data *data; { VALUE val2; if (key == Qnil) return ST_CONTINUE; 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 hash_equal(hash1, hash2) VALUE hash1, hash2; { struct equal_data data; if (TYPE(hash2) != T_HASH) return FALSE; if (RHASH(hash1)->tbl->num_entries != RHASH(hash2)->tbl->num_entries) return FALSE; data.tbl = RHASH(hash2)->tbl; data.result = TRUE; st_foreach(RHASH(hash1)->tbl, equal_i, &data); return data.result; } static int hash_invert_i(key, value, hash) VALUE key, value; VALUE hash; { if (key == Qnil) return ST_CONTINUE; hash_aset(hash, value, key); return ST_CONTINUE; } static VALUE hash_invert(hash) VALUE hash; { VALUE h = hash_new(); st_foreach(RHASH(hash)->tbl, hash_invert_i, h); return h; } static int hash_update_i(key, value, hash) VALUE key, value; VALUE hash; { if (key == Qnil) return ST_CONTINUE; hash_aset(hash, key, value); return ST_CONTINUE; } static VALUE hash_update(hash1, hash2) VALUE hash1, hash2; { hash2 = to_hash(hash2); st_foreach(RHASH(hash2)->tbl, hash_update_i, hash1); return hash1; } #ifndef __MACOS__ /* environment variables nothing on MacOS. */ static int path_tainted = -1; #ifndef NT extern char **environ; #endif static VALUE env_delete(obj, name) VALUE obj, name; { int i, len; char *nam, *val = 0; rb_secure(4); nam = STR2CSTR(name); len = strlen(nam); if (strcmp(nam, "PATH") == 0) path_tainted = 0; 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; } static VALUE env_delete_method(obj, name) VALUE obj, name; { VALUE val = env_delete(obj, name); if (iterator_p()) rb_yield(name); return val; } static VALUE f_getenv(obj, name) VALUE obj, name; { char *nam, *env; int len; nam = str2cstr(name, &len); if (strlen(nam) != len) { ArgError("Bad environment variable name"); } env = getenv(nam); if (env) { if (strcmp(nam, "PATH") == 0 && !env_path_tainted()) return str_new2(env); return str_taint(str_new2(env)); } return Qnil; } static int path_check_1(path) char *path; { struct stat st; char *p = 0; char *s; for (;;) { if (stat(path, &st) == 0 && (st.st_mode & 2)) { return 0; } s = strrchr(path, '/'); if (p) *p = '/'; if (!s || s == path) return 1; p = s; *p = '\0'; } } static void path_check(path) char *path; { char *p = path; char *pend = strchr(path, ':'); if (!path) { path_tainted = 0; } p = path; pend = strchr(path, ':'); for (;;) { int safe; if (pend) *pend = '\0'; safe = path_check_1(p); if (!pend) break; *pend = ':'; if (!safe) { path_tainted = 1; return; } p = pend + 1; pend = strchr(p, ':'); } path_tainted = 0; } int env_path_tainted() { if (path_tainted < 0) { path_check(getenv("PATH")); } return path_tainted; } static VALUE f_setenv(obj, name, value) VALUE obj, name, value; { if (rb_safe_level() >= 4) { Raise(eSecurityError, "cannot change environment variable"); } Check_SafeStr(name); if (NIL_P(value)) { env_delete(obj, name); return Qnil; } Check_SafeStr(value); if (strlen(RSTRING(name)->ptr) != RSTRING(name)->len) ArgError("Bad environment name"); if (strlen(RSTRING(value)->ptr) != RSTRING(value)->len) ArgError("Bad environment value"); setenv(RSTRING(name)->ptr, RSTRING(value)->ptr, 1); if (strcmp(RSTRING(name)->ptr, "PATH") == 0) { if (str_tainted(value)) { /* already tainted, no check */ path_tainted = 1; return TRUE; } path_check(RSTRING(name)->ptr); } return TRUE; } static VALUE env_keys() { char **env; VALUE ary = ary_new(); env = environ; while (*env) { char *s = strchr(*env, '='); if (!s) { env++; continue; } ary_push(ary, str_taint(str_new(*env, s-*env))); env++; } return ary; } static VALUE env_each_key(hash) VALUE hash; { return ary_each(env_keys()); } static VALUE env_values() { char **env; VALUE ary = ary_new(); env = environ; while (*env) { char *s = strchr(*env, '='); if (!s) { env++; continue; } ary_push(ary, str_taint(str_new2(s+1))); env++; } return ary; } static VALUE env_each_value(hash) VALUE hash; { return ary_each(env_values()); } static VALUE env_each(hash) VALUE hash; { volatile VALUE ary = env_keys(); VALUE *ptr = RARRAY(ary)->ptr; int len = RARRAY(ary)->len; while (len--) { VALUE val = f_getenv(Qnil, *ptr); if (!NIL_P(val)) { rb_yield(assoc_new(*ptr, val)); } ptr++; } return hash; } static VALUE env_delete_if() { volatile VALUE ary = env_keys(); VALUE *ptr = RARRAY(ary)->ptr; int len = RARRAY(ary)->len; while (len--) { VALUE val = f_getenv(Qnil, *ptr); if (!NIL_P(val)) { if (RTEST(rb_yield(assoc_new(*ptr, val)))) { env_delete(Qnil, *ptr); } } ptr++; } return envtbl; } static VALUE env_to_s() { return str_new2("ENV"); } static VALUE env_to_a() { char **env; VALUE ary = ary_new(); env = environ; while (*env) { char *s = strchr(*env, '='); if (!s) { env++; continue; } ary_push(ary, assoc_new(str_taint(str_new(*env, s-*env)), str_taint(str_new2(s+1)))); env++; } return ary; } static VALUE env_none() { return Qnil; } static VALUE env_size() { int i; for(i=0; environ[i]; i++) ; return INT2FIX(i); } static VALUE env_empty_p() { if (environ[0] == 0) return TRUE; return FALSE; } static VALUE env_has_key(env, key) VALUE env, key; { if (TYPE(key) != T_STRING) return FALSE; if (getenv(RSTRING(key)->ptr)) return TRUE; return FALSE; } static VALUE env_has_value(dmy, value) VALUE dmy, value; { char **env; VALUE ary; int len; if (TYPE(value) != T_STRING) return FALSE; ary = ary_new(); env = environ; while (*env) { char *s = strchr(*env, '='); if (!s) { env++; continue; } s++; len = strlen(s); if (strncmp(s, RSTRING(value)->ptr, len) == 0) return TRUE; env++; } return FALSE; } static VALUE env_indexes(argc, argv) int argc; VALUE *argv; { int i; VALUE indexes = ary_new2(argc); for (i=0;iptr); } if (v) { RARRAY(indexes)->ptr[i] = str_new2(v); } else { RARRAY(indexes)->ptr[i] = Qnil; } RARRAY(indexes)->len = i+1; } return indexes; } static VALUE env_to_hash(obj) VALUE obj; { VALUE hash = hash_new(); VALUE ary = env_keys(); VALUE *ptr = RARRAY(ary)->ptr; int len = RARRAY(ary)->len; while (len--) { VALUE val = f_getenv(Qnil, *ptr); if (!NIL_P(val)) { hash_aset(hash, *ptr, val); } ptr++; } return hash; } #endif /* ifndef __MACOS__ environment variables nothing on MacOS. */ void Init_Hash() { hash = rb_intern("hash"); cHash = rb_define_class("Hash", cObject); rb_include_module(cHash, mEnumerable); rb_define_singleton_method(cHash, "new", hash_s_new, -1); rb_define_singleton_method(cHash, "[]", hash_s_create, -1); rb_define_method(cHash,"clone", hash_clone, 0); rb_define_method(cHash,"dup", hash_dup, 0); rb_define_method(cHash,"rehash", hash_rehash, 0); rb_define_method(cHash,"freeze", hash_freeze, 0); rb_define_method(cHash,"frozen?",hash_frozen_p, 0); rb_define_method(cHash,"to_hash", hash_to_hash, 0); rb_define_method(cHash,"to_a", hash_to_a, 0); rb_define_method(cHash,"to_s", hash_to_s, 0); rb_define_method(cHash,"inspect", hash_inspect, 0); rb_define_method(cHash,"==", hash_equal, 1); rb_define_method(cHash,"[]", hash_aref, 1); rb_define_method(cHash,"fetch", hash_fetch, -1); rb_define_method(cHash,"[]=", hash_aset, 2); rb_define_method(cHash,"store", hash_aset, 2); rb_define_method(cHash,"indexes", hash_indexes, -1); rb_define_method(cHash,"indices", hash_indexes, -1); rb_define_method(cHash,"length", hash_length, 0); rb_define_alias(cHash, "size", "length"); rb_define_method(cHash,"empty?", hash_empty_p, 0); rb_define_method(cHash,"each", hash_each_pair, 0); rb_define_method(cHash,"each_value", hash_each_value, 0); rb_define_method(cHash,"each_key", hash_each_key, 0); rb_define_method(cHash,"each_pair", hash_each_pair, 0); rb_define_method(cHash,"keys", hash_keys, 0); rb_define_method(cHash,"values", hash_values, 0); rb_define_method(cHash,"shift", hash_shift, 0); rb_define_method(cHash,"delete", hash_delete, 1); rb_define_method(cHash,"delete_if", hash_delete_if, 0); rb_define_method(cHash,"clear", hash_clear, 0); rb_define_method(cHash,"invert", hash_invert, 0); rb_define_method(cHash,"update", hash_update, 1); rb_define_method(cHash,"replace", hash_replace, 1); rb_define_method(cHash,"include?", hash_has_key, 1); rb_define_method(cHash,"has_key?", hash_has_key, 1); rb_define_method(cHash,"has_value?", hash_has_value, 1); rb_define_method(cHash,"key?", hash_has_key, 1); rb_define_method(cHash,"value?", hash_has_value, 1); #ifndef __MACOS__ /* environment variables nothing on MacOS. */ envtbl = obj_alloc(cObject); rb_extend_object(envtbl, mEnumerable); rb_define_singleton_method(envtbl,"[]", f_getenv, 1); rb_define_singleton_method(envtbl,"[]=", f_setenv, 2); rb_define_singleton_method(envtbl,"each", env_each, 0); rb_define_singleton_method(envtbl,"each_pair", env_each, 0); rb_define_singleton_method(envtbl,"each_key", env_each_key, 0); rb_define_singleton_method(envtbl,"each_value", env_each_value, 0); rb_define_singleton_method(envtbl,"delete", env_delete_method, 1); rb_define_singleton_method(envtbl,"delete_if", env_delete_if, 0); rb_define_singleton_method(envtbl,"to_s", env_to_s, 0); rb_define_singleton_method(envtbl,"rehash", env_none, 0); rb_define_singleton_method(envtbl,"to_a", env_to_a, 0); rb_define_singleton_method(envtbl,"indexes", env_indexes, -1); rb_define_singleton_method(envtbl,"indices", env_indexes, -1); rb_define_singleton_method(envtbl,"length", env_size, 0); rb_define_singleton_method(envtbl,"empty?", env_empty_p, 0); rb_define_singleton_method(envtbl,"keys", env_keys, 0); rb_define_singleton_method(envtbl,"values", env_values, 0); rb_define_singleton_method(envtbl,"include?", env_has_key, 1); rb_define_singleton_method(envtbl,"has_key?", env_has_key, 1); rb_define_singleton_method(envtbl,"has_value?", env_has_value, 1); rb_define_singleton_method(envtbl,"key?", env_has_key, 1); rb_define_singleton_method(envtbl,"value?", env_has_value, 1); rb_define_singleton_method(envtbl,"to_hash", env_to_hash, 0); rb_define_global_const("ENV", envtbl); #else /* __MACOS__ */ envtbl = hash_s_new(0, NULL, cHash); rb_define_global_const("ENV", envtbl); #endif /* ifndef __MACOS__ environment variables nothing on MacOS. */ } ruby-1.2.3/inits.c100644 774 145 3227 6474737672 12057 0ustar matzNaCl/************************************************ inits.c - $Author: matz $ $Date: 1998/02/25 06:52:42 $ created at: Tue Dec 28 16:01:58 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" void Init_Array _((void)); void Init_Bignum _((void)); void Init_Comparable _((void)); void Init_Dir _((void)); void Init_Enumerable _((void)); void Init_Exception _((void)); void Init_eval _((void)); void Init_load _((void)); void Init_Proc _((void)); void Init_Thread _((void)); void Init_File _((void)); void Init_GC _((void)); void Init_Hash _((void)); void Init_IO _((void)); void Init_Math _((void)); void Init_marshal _((void)); void Init_Numeric _((void)); void Init_Object _((void)); void Init_pack _((void)); void Init_sym _((void)); void Init_process _((void)); void Init_Random _((void)); void Init_Range _((void)); void Init_Regexp _((void)); void Init_signal _((void)); void Init_String _((void)); void Init_Struct _((void)); void Init_Time _((void)); void Init_var_tables _((void)); void Init_version _((void)); void rb_call_inits() { Init_sym(); Init_var_tables(); Init_Object(); Init_Comparable(); Init_Enumerable(); Init_eval(); Init_String(); Init_Exception(); #ifdef THREAD Init_Thread(); #endif Init_Numeric(); Init_Bignum(); Init_Array(); Init_Hash(); Init_Struct(); Init_Regexp(); Init_pack(); Init_Range(); Init_IO(); Init_Dir(); Init_Time(); Init_Random(); Init_signal(); Init_process(); Init_load(); Init_Proc(); Init_Math(); Init_GC(); Init_marshal(); Init_version(); } ruby-1.2.3/install-sh100755 774 145 11244 6457647322 12600 0ustar matzNaCl#! /bin/sh # # install - install a program, script, or datafile # This comes from X11R5. # # Calling this script install-sh is preferred over install.sh, to prevent # `make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. # # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit="${DOITPROG-}" # put in absolute paths if you don't have them in your path; or use env. vars. mvprog="${MVPROG-mv}" cpprog="${CPPROG-cp}" chmodprog="${CHMODPROG-chmod}" chownprog="${CHOWNPROG-chown}" chgrpprog="${CHGRPPROG-chgrp}" stripprog="${STRIPPROG-strip}" rmprog="${RMPROG-rm}" mkdirprog="${MKDIRPROG-mkdir}" tranformbasename="" transform_arg="" instcmd="$mvprog" chmodcmd="$chmodprog 0755" chowncmd="" chgrpcmd="" stripcmd="" rmcmd="$rmprog -f" mvcmd="$mvprog" src="" dst="" dir_arg="" while [ x"$1" != x ]; do case $1 in -c) instcmd="$cpprog" shift continue;; -d) dir_arg=true shift continue;; -m) chmodcmd="$chmodprog $2" shift shift continue;; -o) chowncmd="$chownprog $2" shift shift continue;; -g) chgrpcmd="$chgrpprog $2" shift shift continue;; -s) stripcmd="$stripprog" shift continue;; -t=*) transformarg=`echo $1 | sed 's/-t=//'` shift continue;; -b=*) transformbasename=`echo $1 | sed 's/-b=//'` shift continue;; *) if [ x"$src" = x ] then src=$1 else # this colon is to work around a 386BSD /bin/sh bug : dst=$1 fi shift continue;; esac done if [ x"$src" = x ] then echo "install: no input file specified" exit 1 else true fi if [ x"$dir_arg" != x ]; then dst=$src src="" if [ -d $dst ]; then instcmd=: else instcmd=mkdir fi else # Waiting for this to be detected by the "$instcmd $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if [ -f $src -o -d $src ] then true else echo "install: $src does not exist" exit 1 fi if [ x"$dst" = x ] then echo "install: no destination specified" exit 1 else true fi # If destination is a directory, append the input filename; if your system # does not like double slashes in filenames, you may need to add some logic if [ -d $dst ] then dst="$dst"/`basename $src` else true fi fi ## this sed command emulates the dirname command dstdir=`echo $dst | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'` # Make sure that the destination directory exists. # this part is taken from Noah Friedman's mkinstalldirs script # Skip lots of stat calls in the usual case. if [ ! -d "$dstdir" ]; then defaultIFS=' ' IFS="${IFS-${defaultIFS}}" oIFS="${IFS}" # Some sh's can't handle IFS=/ for some reason. IFS='%' set - `echo ${dstdir} | sed -e 's@/@%@g' -e 's@^%@/@'` IFS="${oIFS}" pathcomp='' while [ $# -ne 0 ] ; do pathcomp="${pathcomp}${1}" shift if [ ! -d "${pathcomp}" ] ; then $mkdirprog "${pathcomp}" else true fi pathcomp="${pathcomp}/" done fi if [ x"$dir_arg" != x ] then $doit $instcmd $dst && if [ x"$chowncmd" != x ]; then $doit $chowncmd $dst; else true ; fi && if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dst; else true ; fi && if [ x"$stripcmd" != x ]; then $doit $stripcmd $dst; else true ; fi && if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dst; else true ; fi else # If we're going to rename the final executable, determine the name now. if [ x"$transformarg" = x ] then dstfile=`basename $dst` else dstfile=`basename $dst $transformbasename | sed $transformarg`$transformbasename fi # don't allow the sed command to completely eliminate the filename if [ x"$dstfile" = x ] then dstfile=`basename $dst` else true fi # Make a temp file name in the proper directory. dsttmp=$dstdir/#inst.$$# # Move or copy the file name to the temp name $doit $instcmd $src $dsttmp && trap "rm -f ${dsttmp}" 0 && # and set any options; do chmod last to preserve setuid bits # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $instcmd $src $dsttmp" command. if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; else true;fi && if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; else true;fi && if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; else true;fi && if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; else true;fi && # Now rename the file to the real destination. $doit $rmcmd -f $dstdir/$dstfile && $doit $mvcmd $dsttmp $dstdir/$dstfile fi && exit 0 ruby-1.2.3/instruby.rb100755 774 145 2501 6624170600 12741 0ustar matzNaCl#!./miniruby -I. require "rbconfig.rb" include Config $:.unshift CONFIG["srcdir"]+"/lib" require "ftools" binsuffix = CONFIG["binsuffix"] if ENV["prefix"] prefix = ENV["prefix"] else prefix = CONFIG["prefix"] end ruby_install_name = CONFIG["ruby_install_name"] bindir = CONFIG["bindir"] libdir = CONFIG["libdir"] pkglibdir = libdir + "/" + ruby_install_name archdir = pkglibdir + "/" + CONFIG["arch"] mandir = CONFIG["mandir"] + "/man1" wdir = Dir.getwd File.makedirs bindir, TRUE File.install "ruby#{binsuffix}", "#{bindir}/#{ruby_install_name}#{binsuffix}", 0755, TRUE for dll in Dir['*.dll'] File.install dll, "#{bindir}/#{dll}", 0755, TRUE end File.makedirs libdir, TRUE for lib in ["libruby.so", "libruby.so.LIB"] if File.exist? lib File.install lib, "#{libdir}", 0644, TRUE end end File.makedirs pkglibdir, TRUE File.makedirs archdir, TRUE Dir.chdir "ext" system "../miniruby#{binsuffix} extmk.rb install" Dir.chdir CONFIG["srcdir"] IO.foreach 'MANIFEST' do |$_| $_.chop! if /^lib/ File.install $_, "#{pkglibdir}", 0644, TRUE elsif /^[a-z]+\.h$/ File.install $_, "#{archdir}", 0644, TRUE end end File.makedirs mandir, TRUE File.install "ruby.1", "#{mandir}", 0644, TRUE Dir.chdir wdir File.install "config.h", "#{archdir}", 0644, TRUE File.install "rbconfig.rb", "#{archdir}", 0644, TRUE # vi:set sw=2: ruby-1.2.3/intern.h100644 774 145 23267 6630655016 12244 0ustar matzNaCl/* Functions and variables that are used by more than one source file of * the kernel. Not available to extensions and applications. */ /* array.c */ void memclear _((register VALUE*, register int)); VALUE assoc_new _((VALUE, VALUE)); VALUE ary_new _((void)); VALUE ary_new2 _((int)); VALUE ary_new3 __((int,...)); VALUE ary_new4 _((int, VALUE *)); VALUE ary_freeze _((VALUE)); VALUE ary_aref _((int, VALUE*, VALUE)); void ary_store _((VALUE, int, VALUE)); VALUE ary_push _((VALUE, VALUE)); VALUE ary_pop _((VALUE)); VALUE ary_shift _((VALUE)); VALUE ary_unshift _((VALUE, VALUE)); VALUE ary_entry _((VALUE, int)); VALUE ary_each _((VALUE)); VALUE ary_join _((VALUE, VALUE)); VALUE ary_to_s _((VALUE)); VALUE ary_print_on _((VALUE, VALUE)); VALUE ary_reverse _((VALUE)); VALUE ary_sort_bang _((VALUE)); VALUE ary_sort _((VALUE)); VALUE ary_delete _((VALUE, VALUE)); VALUE ary_delete_at _((VALUE, VALUE)); VALUE ary_plus _((VALUE, VALUE)); VALUE ary_concat _((VALUE, VALUE)); VALUE ary_assoc _((VALUE, VALUE)); VALUE ary_rassoc _((VALUE, VALUE)); VALUE ary_includes _((VALUE, VALUE)); /* bignum.c */ VALUE big_clone _((VALUE)); void big_2comp _((VALUE)); VALUE big_norm _((VALUE)); VALUE uint2big _((unsigned long)); VALUE int2big _((long)); VALUE uint2inum _((unsigned long)); VALUE int2inum _((long)); VALUE str2inum _((char*, int)); VALUE big2str _((VALUE, int)); long big2long _((VALUE)); #define big2int(x) big2long(x) unsigned long big2ulong _((VALUE)); #define big2uint(x) big2ulong(x) VALUE big_to_i _((VALUE)); VALUE dbl2big _((double)); double big2dbl _((VALUE)); VALUE big_to_f _((VALUE)); VALUE big_plus _((VALUE, VALUE)); VALUE big_minus _((VALUE, VALUE)); VALUE big_mul _((VALUE, VALUE)); VALUE big_pow _((VALUE, VALUE)); VALUE big_and _((VALUE, VALUE)); VALUE big_or _((VALUE, VALUE)); VALUE big_xor _((VALUE, VALUE)); VALUE big_lshift _((VALUE, VALUE)); VALUE big_rand _((VALUE)); /* class.c */ VALUE class_new _((VALUE)); VALUE singleton_class_new _((VALUE)); VALUE singleton_class_clone _((VALUE)); void singleton_class_attached _((VALUE,VALUE)); VALUE rb_define_class_id _((ID, VALUE)); VALUE module_new _((void)); VALUE rb_define_module_id _((ID)); VALUE mod_included_modules _((VALUE)); VALUE mod_ancestors _((VALUE)); VALUE class_instance_methods _((int, VALUE*, VALUE)); VALUE class_private_instance_methods _((int, VALUE*, VALUE)); VALUE obj_singleton_methods _((VALUE)); void rb_define_method_id _((VALUE, ID, VALUE (*)(), int)); void rb_undef_method _((VALUE, char*)); void rb_define_protected_method _((VALUE, char*, VALUE (*)(), int)); void rb_define_private_method _((VALUE, char*, VALUE (*)(), int)); void rb_define_singleton_method _((VALUE,char*,VALUE(*)(),int)); void rb_define_private_method _((VALUE,char*,VALUE(*)(),int)); VALUE rb_singleton_class _((VALUE)); /* enum.c */ VALUE enum_length _((VALUE)); /* error.c */ VALUE exc_new _((VALUE, char*, unsigned int)); VALUE exc_new2 _((VALUE, char*)); VALUE exc_new3 _((VALUE, VALUE)); void TypeError __((char*, ...)) NORETURN; void ArgError __((char*, ...)) NORETURN; void NameError __((char*, ...)) NORETURN; void IndexError __((char*, ...)) NORETURN; void LoadError __((char*, ...)) NORETURN; /* eval.c */ void rb_remove_method _((VALUE, char*)); void rb_disable_super _((VALUE, char*)); void rb_enable_super _((VALUE, char*)); void rb_clear_cache _((void)); void rb_alias _((VALUE, ID, ID)); void rb_attr _((VALUE,ID,int,int,int)); int rb_method_boundp _((VALUE, ID, int)); VALUE dyna_var_defined _((ID)); VALUE dyna_var_ref _((ID)); VALUE dyna_var_asgn _((ID, VALUE)); void dyna_var_push _((ID, VALUE)); void ruby_init _((void)); void ruby_options _((int, char**)); void ruby_run _((void)); VALUE rb_eval_cmd _((VALUE, VALUE)); VALUE rb_trap_eval _((VALUE, int)); int rb_respond_to _((VALUE, ID)); void rb_raise _((VALUE)); void rb_fatal _((VALUE)); void rb_interrupt _((void)); int iterator_p _((void)); VALUE rb_yield_0 _((VALUE, volatile VALUE)); VALUE rb_apply _((VALUE, ID, VALUE)); VALUE rb_funcall2 _((VALUE, ID, int, VALUE*)); void rb_backtrace _((void)); ID rb_frame_last_func _((void)); VALUE f_load _((VALUE, VALUE)); void rb_provide _((char*)); VALUE f_require _((VALUE, VALUE)); void obj_call_init _((VALUE)); VALUE class_new_instance _((int, VALUE*, VALUE)); VALUE f_lambda _((void)); void rb_set_end_proc _((void (*)(),VALUE)); void gc_mark_threads _((void)); void thread_start_timer _((void)); void thread_stop_timer _((void)); void thread_schedule _((void)); void thread_wait_fd _((int)); void thread_fd_writable _((int)); int thread_alone _((void)); void thread_sleep _((int)); void thread_sleep_forever _((void)); VALUE thread_create _((VALUE (*)(), void*)); void thread_interrupt _((void)); void thread_trap_eval _((VALUE, int)); int thread_select(); void thread_wait_for(); /* file.c */ VALUE file_open _((char*, char*)); int eaccess _((char*, int)); VALUE file_s_expand_path _((int, VALUE *)); /* gc.c */ void rb_global_variable _((VALUE*)); void gc_mark_locations _((VALUE*, VALUE*)); void gc_mark_maybe(); void gc_mark(); void gc_force_recycle(); void gc_gc _((void)); void init_stack _((void)); void init_heap _((void)); /* hash.c */ VALUE hash_freeze _((VALUE)); VALUE rb_hash _((VALUE)); VALUE hash_new _((void)); VALUE hash_aref _((VALUE, VALUE)); VALUE hash_aset _((VALUE, VALUE, VALUE)); int env_path_tainted _((void)); /* io.c */ void eof_error _((void)); VALUE io_write _((VALUE, VALUE)); VALUE io_gets _((VALUE)); VALUE io_getc _((VALUE)); VALUE io_ungetc _((VALUE, VALUE)); VALUE io_close _((VALUE)); VALUE io_binmode _((VALUE)); int io_mode_flags _((char*)); VALUE io_reopen _((VALUE, VALUE)); VALUE f_gets _((void)); void rb_str_setter _((VALUE, ID, VALUE*)); /* numeric.c */ void num_zerodiv _((void)); VALUE num_coerce_bin _((VALUE, VALUE)); VALUE float_new _((double)); VALUE flo_pow _((VALUE, VALUE)); VALUE num2fix _((VALUE)); VALUE fix2str _((VALUE, int)); VALUE fix_to_s _((VALUE)); VALUE num_upto _((VALUE, VALUE)); VALUE fix_upto _((VALUE, VALUE)); /* object.c */ VALUE rb_equal _((VALUE, VALUE)); int rb_eql _((VALUE, VALUE)); VALUE obj_equal _((VALUE, VALUE)); VALUE any_to_s _((VALUE)); VALUE rb_inspect _((VALUE)); VALUE obj_is_instance_of _((VALUE, VALUE)); VALUE obj_is_kind_of _((VALUE, VALUE)); VALUE obj_alloc _((VALUE)); VALUE rb_convert_type _((VALUE,int,char*,char*)); VALUE rb_Integer _((VALUE)); VALUE rb_Float _((VALUE)); VALUE rb_String _((VALUE)); VALUE rb_Array _((VALUE)); double num2dbl _((VALUE)); /* parse.y */ int yyparse _((void)); void pushback _((int)); ID id_attrset _((ID)); void yyappend_print _((void)); void yywhile_loop _((int, int)); int rb_is_const_id _((ID)); int rb_is_instance_id _((ID)); VALUE backref_get _((void)); void backref_set _((VALUE)); VALUE lastline_get _((void)); void lastline_set _((VALUE)); /* process.c */ int rb_proc_exec _((char*)); void rb_syswait _((int)); /* range.c */ VALUE range_new _((VALUE, VALUE)); VALUE range_beg_end _((VALUE, int*, int*)); /* re.c */ VALUE reg_nth_defined _((int, VALUE)); VALUE reg_nth_match _((int, VALUE)); VALUE reg_last_match _((VALUE)); VALUE reg_match_pre _((VALUE)); VALUE reg_match_post _((VALUE)); VALUE reg_match_last _((VALUE)); VALUE reg_new _((char*, int, int)); VALUE reg_match _((VALUE, VALUE)); VALUE reg_match2 _((VALUE)); int reg_options _((VALUE)); char*rb_get_kcode _((void)); void rb_set_kcode _((char*)); /* ruby.c */ void rb_load_file _((char*)); void ruby_script _((char*)); void ruby_prog_init _((void)); void ruby_set_argv _((int, char**)); void ruby_process_options _((int, char**)); void ruby_require_modules _((void)); void ruby_load_script _((void)); /* signal.c */ VALUE f_kill _((int, VALUE*)); void gc_mark_trap_list _((void)); void posix_signal _((int, void (*)())); void rb_trap_exit _((void)); void rb_trap_exec _((void)); /* sprintf.c */ VALUE f_sprintf _((int, VALUE*)); /* string.c */ VALUE str_new _((char*, unsigned int)); VALUE str_new2 _((char*)); VALUE str_new3 _((VALUE)); VALUE str_new4 _((VALUE)); VALUE obj_as_string _((VALUE)); VALUE str_to_str _((VALUE)); VALUE str_dup _((VALUE)); VALUE str_plus _((VALUE, VALUE)); VALUE str_times _((VALUE, VALUE)); VALUE str_substr _((VALUE, int, int)); void str_modify _((VALUE)); VALUE str_freeze _((VALUE)); VALUE str_dup_frozen _((VALUE)); VALUE str_taint _((VALUE)); VALUE str_tainted _((VALUE)); VALUE str_resize _((VALUE, int)); VALUE str_cat _((VALUE, char*, unsigned int)); VALUE str_concat _((VALUE, VALUE)); int str_hash _((VALUE)); int str_cmp _((VALUE, VALUE)); VALUE str_upto _((VALUE, VALUE)); VALUE str_inspect _((VALUE)); VALUE str_split _((VALUE, char*)); /* struct.c */ VALUE struct_new __((VALUE, ...)); VALUE struct_define __((char*, ...)); VALUE struct_alloc _((VALUE, VALUE)); VALUE struct_aref _((VALUE, VALUE)); VALUE struct_aset _((VALUE, VALUE, VALUE)); VALUE struct_getmember _((VALUE, ID)); /* time.c */ VALUE time_new _((int, int)); /* util.c */ void add_suffix _((VALUE, char*)); unsigned long scan_oct _((char*, int, int*)); unsigned long scan_hex _((char*, int, int*)); /* variable.c */ struct st_table *new_idhash _((void)); VALUE mod_name _((VALUE)); VALUE rb_class_path _((VALUE)); void rb_set_class_path _((VALUE, VALUE, char*)); VALUE rb_path2class _((char*)); void rb_name_class _((VALUE, ID)); void rb_autoload _((char*, char*)); VALUE f_autoload _((VALUE, VALUE, VALUE)); void gc_mark_global_tbl _((void)); VALUE f_trace_var _((int, VALUE*)); VALUE f_untrace_var _((int, VALUE*)); VALUE rb_gvar_set2 _((char*, VALUE)); VALUE f_global_variables _((void)); void rb_alias_variable _((ID, ID)); VALUE rb_ivar_get _((VALUE, ID)); VALUE rb_ivar_set _((VALUE, ID, VALUE)); VALUE rb_ivar_defined _((VALUE, ID)); VALUE obj_instance_variables _((VALUE)); VALUE mod_const_at _((VALUE, VALUE)); VALUE mod_constants _((VALUE)); VALUE mod_const_of _((VALUE, VALUE)); int rb_const_defined_at _((VALUE, ID)); int rb_autoload_defined _((ID)); int rb_const_defined _((VALUE, ID)); ruby-1.2.3/io.c100644 774 145 146634 6627210210 11360 0ustar matzNaCl/************************************************ io.c - $Author: matz $ $Date: 1998/11/26 08:25:44 $ created at: Fri Oct 15 18:08:59 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "rubyio.h" #include "rubysig.h" #include #include #include #if !defined(DJGPP) && !defined(NT) && !defined(__human68k__) #include #endif #if defined(HAVE_FCNTL) #include #endif #ifdef HAVE_SYS_TIME_H # include #else #ifndef NT struct timeval { long tv_sec; /* seconds */ long tv_usec; /* and microseconds */ }; #endif #endif #ifdef HAVE_VFORK_H #include #endif #include #ifdef HAVE_SYS_PARAM_H # include #else # define NOFILE 64 #endif #ifdef HAVE_UNISTD_H #include #endif #ifdef USE_CWGUSI #include #include #include extern void Init_File(); #endif #ifdef __BEOS__ #include #endif VALUE cIO; VALUE eEOFError; VALUE eIOError; VALUE rb_stdin, rb_stdout, rb_stderr, rb_defout; VALUE FS, OFS; VALUE RS, ORS; VALUE RS_default; static VALUE argf; ID id_write; extern char *inplace; struct timeval time_timeval _((VALUE)); static VALUE filename, file; static int gets_lineno; static int init_p = 0, next_p = 0; static VALUE lineno; #ifdef _STDIO_USES_IOSTREAM /* GNU libc */ # ifdef _IO_fpos_t # define READ_DATA_PENDING(fp) ((fp)->_IO_read_ptr != (fp)->_IO_read_end) # else # define READ_DATA_PENDING(fp) ((fp)->_gptr < (fp)->_egptr) # endif #else # ifdef FILE_COUNT # define READ_DATA_PENDING(fp) ((fp)->FILE_COUNT > 0) # else # if defined(__BEOS__) # define ReadDataPending(fp) (fp->_state._eof == 0) # elif defined(USE_CWGUSI) # define ReadDataPending(fp) (fp->state.eof == 0) # else /* requires systems own version of the ReadDataPending() */ extern int ReadDataPending(); # endif # define READ_DATA_PENDING(fp) ReadDataPending(fp) # endif #endif #ifndef THREAD # define READ_CHECK(fp) 0 #else # define READ_CHECK(fp) do {\ if (!READ_DATA_PENDING(fp)) thread_wait_fd(fileno(fp));\ } while(0) #endif void eof_error() { Raise(eEOFError, "End of file reached"); } void io_check_closed(fptr) OpenFile *fptr; { if (fptr->f == NULL && fptr->f2 == NULL) Raise(eIOError, "closed stream"); } void io_readable(fptr) OpenFile *fptr; { if (!(fptr->mode & FMODE_READABLE)) { Raise(eIOError, "not opened for reading"); } } void io_writable(fptr) OpenFile *fptr; { if (!(fptr->mode & FMODE_WRITABLE)) { Raise(eIOError, "not opened for writing"); } } /* writing functions */ VALUE io_write(io, str) VALUE io, str; { OpenFile *fptr; FILE *f; int n; if (TYPE(str) != T_STRING) str = obj_as_string(str); if (RSTRING(str)->len == 0) return INT2FIX(0); if (BUILTIN_TYPE(io) != T_FILE) { /* port is not IO, call write method for it. */ return rb_funcall(io, id_write, 1, str); } rb_secure(4); GetOpenFile(io, fptr); io_writable(fptr); f = GetWriteFile(fptr); #ifdef __human68k__ { register char *ptr = RSTRING(str)->ptr; n = (int)RSTRING(str)->len; while (--n >= 0) if (fputc(*ptr++, f) == EOF) rb_sys_fail(fptr->path); n = ptr - RSTRING(str)->ptr; } if (ferror(f)) rb_sys_fail(fptr->path); #else n = fwrite(RSTRING(str)->ptr, 1, RSTRING(str)->len, f); if (n == 0 || ferror(f)) { rb_sys_fail(fptr->path); } #endif if (fptr->mode & FMODE_SYNC) { fflush(f); } return INT2FIX(n); } static VALUE io_addstr(io, str) VALUE io, str; { io_write(io, str); return io; } static VALUE io_flush(io) VALUE io; { OpenFile *fptr; FILE *f; GetOpenFile(io, fptr); io_writable(fptr); f = GetWriteFile(fptr); if (fflush(f) == EOF) rb_sys_fail(0); return io; } static VALUE io_tell(io) VALUE io; { OpenFile *fptr; long pos; GetOpenFile(io, fptr); pos = ftell(fptr->f); if (ferror(fptr->f) != 0) rb_sys_fail(fptr->path); return int2inum(pos); } static VALUE io_seek(io, offset, ptrname) VALUE io, offset, ptrname; { OpenFile *fptr; long pos; GetOpenFile(io, fptr); pos = fseek(fptr->f, NUM2INT(offset), NUM2INT(ptrname)); if (pos != 0) rb_sys_fail(fptr->path); clearerr(fptr->f); return INT2FIX(0); } static VALUE io_set_pos(io, offset) VALUE io, offset; { OpenFile *fptr; long pos; GetOpenFile(io, fptr); pos = fseek(fptr->f, NUM2INT(offset), 0); if (pos != 0) rb_sys_fail(fptr->path); clearerr(fptr->f); return INT2NUM(pos); } static VALUE io_rewind(io) VALUE io; { OpenFile *fptr; GetOpenFile(io, fptr); if (fseek(fptr->f, 0L, 0) != 0) rb_sys_fail(fptr->path); clearerr(fptr->f); return INT2FIX(0); } static VALUE io_eof(io) VALUE io; { OpenFile *fptr; int ch; GetOpenFile(io, fptr); io_readable(fptr); if (READ_DATA_PENDING(fptr->f)) return FALSE; #if 0 if (feof(fptr->f)) return TRUE; return FALSE; #else READ_CHECK(fptr->f); TRAP_BEG; ch = getc(fptr->f); TRAP_END; if (ch != EOF) { (void)ungetc(ch, fptr->f); return FALSE; } return TRUE; #endif } static VALUE io_sync(io) VALUE io; { OpenFile *fptr; GetOpenFile(io, fptr); return (fptr->mode & FMODE_SYNC) ? TRUE : FALSE; } static VALUE io_set_sync(io, mode) VALUE io, mode; { OpenFile *fptr; GetOpenFile(io, fptr); if (RTEST(mode)) { fptr->mode |= FMODE_SYNC; } else { fptr->mode &= ~FMODE_SYNC; } return mode; } static VALUE io_fileno(io) VALUE io; { OpenFile *fptr; int fd; GetOpenFile(io, fptr); fd = fileno(fptr->f); return INT2FIX(fd); } static VALUE io_to_io(io) VALUE io; { return io; } /* reading functions */ #ifndef S_ISREG # define S_ISREG(m) ((m & S_IFMT) == S_IFREG) #endif #define SMALLBUF 100 static VALUE read_all(port) VALUE port; { OpenFile *fptr; VALUE str = Qnil; struct stat st; int siz = BUFSIZ; int bytes = 0; int n; GetOpenFile(port, fptr); io_readable(fptr); if (fstat(fileno(fptr->f), &st) == 0 && S_ISREG(st.st_mode) #ifdef __BEOS__ && (st.st_dev > 3) #endif ) { if (st.st_size == 0) return str_new(0, 0); else { int pos = ftell(fptr->f); if (st.st_size > pos && pos >= 0) { siz = st.st_size - pos + 1; } } } str = str_new(0, siz); for (;;) { READ_CHECK(fptr->f); TRAP_BEG; n = fread(RSTRING(str)->ptr+bytes, 1, siz-bytes, fptr->f); TRAP_END; if (n <= 0) { if (ferror(fptr->f)) rb_sys_fail(fptr->path); return str_new(0, 0); } bytes += n; if (bytes < siz) break; siz += BUFSIZ; str_resize(str, siz); } if (bytes == 0) return str_new(0, 0); if (bytes != siz) str_resize(str, bytes); return str_taint(str); } static VALUE io_read(argc, argv, io) int argc; VALUE *argv; VALUE io; { OpenFile *fptr; int n, len; VALUE length, str; if (rb_scan_args(argc, argv, "01", &length) == 0 || NIL_P(length)) { return read_all(io); } len = NUM2INT(length); GetOpenFile(io, fptr); io_readable(fptr); str = str_new(0, len); READ_CHECK(fptr->f); TRAP_BEG; n = fread(RSTRING(str)->ptr, 1, len, fptr->f); TRAP_END; if (n <= 0) { if (ferror(fptr->f)) rb_sys_fail(fptr->path); return Qnil; } RSTRING(str)->len = n; RSTRING(str)->ptr[n] = '\0'; return str_taint(str); } VALUE io_gets_method(argc, argv, io) int argc; VALUE *argv; VALUE io; { OpenFile *fptr; FILE *f; VALUE str = Qnil; int c, newline; char *rsptr; int rslen, rspara = 0; VALUE rs; if (argc == 0) { rs = RS; } else { rb_scan_args(argc, argv, "1", &rs); if (!NIL_P(rs)) Check_Type(rs, T_STRING); } if (NIL_P(rs)) { rsptr = 0; rslen = 0; } else { rslen = RSTRING(rs)->len; if (rslen == 0) { rsptr = "\n\n"; rslen = 2; rspara = 1; } else if (rslen == 1 && RSTRING(rs)->ptr[0] == '\n') { return io_gets(io); } else { rsptr = RSTRING(rs)->ptr; } } GetOpenFile(io, fptr); io_readable(fptr); f = fptr->f; if (rspara) { do { READ_CHECK(f); TRAP_BEG; c = getc(f); TRAP_END; if (c != '\n') { ungetc(c,f); break; } } while (c != EOF); } newline = rslen ? rsptr[rslen - 1] : 0777; { char buf[8192]; char *bp, *bpe = buf + sizeof buf - 3; int cnt; int append = 0; again: bp = buf; if (rslen) { for (;;) { READ_CHECK(f); TRAP_BEG; c = getc(f); TRAP_END; if (c == EOF) { if (errno == EINTR) continue; break; } if ((*bp++ = c) == newline) break; if (bp == bpe) break; } cnt = bp - buf; } else { READ_CHECK(f); TRAP_BEG; cnt = fread(buf, 1, sizeof(buf), f); TRAP_END; if (cnt == 0) { if (ferror(f)) rb_sys_fail(fptr->path); c = EOF; } else { c = 0; } } if (c == EOF && !append && cnt == 0) { str = Qnil; goto return_gets; } if (append) str_cat(str, buf, cnt); else str = str_new(buf, cnt); if (c != EOF && (!rslen || RSTRING(str)->len < rslen || memcmp(RSTRING(str)->ptr+RSTRING(str)->len-rslen,rsptr,rslen))) { append = 1; goto again; } } return_gets: if (rspara) { while (c != EOF) { READ_CHECK(f); TRAP_BEG; c = getc(f); TRAP_END; if (c != '\n') { ungetc(c, f); break; } } } if (!NIL_P(str)) { fptr->lineno++; lineno = INT2FIX(fptr->lineno); str_taint(str); } lastline_set(str); return str; } VALUE io_gets(io) VALUE io; { OpenFile *fptr; FILE *f; VALUE str = Qnil; int c; char buf[8192]; char *bp, *bpe = buf + sizeof buf - 3; int cnt; int append = 0; GetOpenFile(io, fptr); io_readable(fptr); f = fptr->f; again: bp = buf; for (;;) { READ_CHECK(f); TRAP_BEG; c = getc(f); TRAP_END; if (c == EOF) { if (errno == EINTR) continue; break; } if ((*bp++ = c) == '\n') break; if (bp == bpe) break; } cnt = bp - buf; if (c == EOF && !append && cnt == 0) { str = Qnil; goto return_gets; } if (append) str_cat(str, buf, cnt); else str = str_new(buf, cnt); if (c != EOF && RSTRING(str)->ptr[RSTRING(str)->len-1] != '\n') { append = 1; goto again; } return_gets: if (!NIL_P(str)) { fptr->lineno++; lineno = INT2FIX(fptr->lineno); str_taint(str); } lastline_set(str); return str; } static VALUE io_lineno(io) VALUE io; { OpenFile *fptr; GetOpenFile(io, fptr); io_readable(fptr); return INT2NUM(fptr->lineno); } static VALUE io_set_lineno(io, lineno) VALUE io, lineno; { OpenFile *fptr; GetOpenFile(io, fptr); io_readable(fptr); fptr->lineno = NUM2INT(lineno); } static void lineno_setter(val, id, var) VALUE val; ID id; VALUE *var; { gets_lineno = NUM2INT(val); *var = INT2FIX(gets_lineno); } static VALUE io_readline(argc, argv, io) int argc; VALUE *argv; VALUE io; { VALUE line = io_gets_method(argc, argv, io); if (NIL_P(line)) { eof_error(); } return line; } static VALUE io_readlines(argc, argv, io) int argc; VALUE *argv; VALUE io; { VALUE line, ary; ary = ary_new(); while (!NIL_P(line = io_gets_method(argc, argv, io))) { ary_push(ary, line); } return ary; } static VALUE io_each_line(argc, argv, io) int argc; VALUE *argv; VALUE io; { VALUE str; while (!NIL_P(str = io_gets_method(argc, argv, io))) { rb_yield(str); } return Qnil; } static VALUE io_each_byte(io) VALUE io; { OpenFile *fptr; FILE *f; int c; GetOpenFile(io, fptr); io_readable(fptr); f = fptr->f; for (;;) { READ_CHECK(f); TRAP_BEG; c = getc(f); TRAP_END; if (c == EOF) break; rb_yield(INT2FIX(c & 0xff)); } if (ferror(f) != 0) rb_sys_fail(fptr->path); return Qnil; } VALUE io_getc(io) VALUE io; { OpenFile *fptr; FILE *f; int c; GetOpenFile(io, fptr); io_readable(fptr); f = fptr->f; READ_CHECK(f); TRAP_BEG; c = getc(f); TRAP_END; if (c == EOF) { if (ferror(f) != 0) rb_sys_fail(fptr->path); return Qnil; } return INT2FIX(c & 0xff); } static VALUE io_readchar(io) VALUE io; { VALUE c = io_getc(io); if (NIL_P(c)) { eof_error(); } return c; } VALUE io_ungetc(io, c) VALUE io, c; { OpenFile *fptr; Check_Type(c, T_FIXNUM); GetOpenFile(io, fptr); io_readable(fptr); if (ungetc(FIX2INT(c), fptr->f) == EOF) rb_sys_fail(fptr->path); return Qnil; } static VALUE io_isatty(io) VALUE io; { OpenFile *fptr; GetOpenFile(io, fptr); if (isatty(fileno(fptr->f)) == 0) return FALSE; return TRUE; } static void fptr_finalize(fptr) OpenFile *fptr; { if (fptr->f != NULL) { fclose(fptr->f); } if (fptr->f2 != NULL) { fclose(fptr->f2); } if (fptr->pid) { rb_syswait(fptr->pid); fptr->pid = 0; } } static void io_fptr_close(fptr) OpenFile *fptr; { if (fptr->f == NULL && fptr->f2 == NULL) return; if (fptr->finalize) { (*fptr->finalize)(fptr); } else { fptr_finalize(fptr); } fptr->f = fptr->f2 = NULL; } void io_fptr_finalize(fptr) OpenFile *fptr; { io_fptr_close(fptr); if (fptr->path) { free(fptr->path); fptr->path = NULL; } } VALUE io_close(io) VALUE io; { OpenFile *fptr; GetOpenFile(io, fptr); io_fptr_close(fptr); return Qnil; } VALUE io_close_method(io) VALUE io; { rb_secure(4); return io_close(io); } static VALUE io_closed(io) VALUE io; { OpenFile *fptr; fptr = RFILE(io)->fptr; return (fptr->f || fptr->f2)?FALSE:TRUE; } static VALUE io_syswrite(io, str) VALUE io, str; { OpenFile *fptr; FILE *f; int n; rb_secure(4); if (TYPE(str) != T_STRING) str = obj_as_string(str); GetOpenFile(io, fptr); io_writable(fptr); f = GetWriteFile(fptr); #ifdef THREAD thread_fd_writable(fileno(f)); #endif n = write(fileno(f), RSTRING(str)->ptr, RSTRING(str)->len); if (n == -1) rb_sys_fail(fptr->path); return INT2FIX(n); } static VALUE io_sysread(io, len) VALUE io, len; { OpenFile *fptr; int n, ilen; VALUE str; ilen = NUM2INT(len); GetOpenFile(io, fptr); io_readable(fptr); str = str_new(0, ilen); #ifdef THREAD thread_wait_fd(fileno(fptr->f)); #endif TRAP_BEG; n = read(fileno(fptr->f), RSTRING(str)->ptr, RSTRING(str)->len); TRAP_END; if (n == -1) rb_sys_fail(fptr->path); if (n == 0) eof_error(); RSTRING(str)->len = n; RSTRING(str)->ptr[n] = '\0'; return str_taint(str); } VALUE io_binmode(io) VALUE io; { #if defined(NT) || defined(DJGPP) || defined(__CYGWIN32__) || defined(__human68k__) || defined(USE_CWGUSI) OpenFile *fptr; GetOpenFile(io, fptr); #ifdef __human68k__ if (fptr->f) fmode(fptr->f, _IOBIN); if (fptr->f2) fmode(fptr->f2, _IOBIN); #else # ifndef USE_CWGUSI if (fptr->f && setmode(fileno(fptr->f), O_BINARY) == -1) rb_sys_fail(fptr->path); if (fptr->f2 && setmode(fileno(fptr->f2), O_BINARY) == -1) rb_sys_fail(fptr->path); # else /* USE_CWGUSI */ if (fptr->f) fptr->f->mode.binary_io = 1; if (fptr->f2) fptr->f2->mode.binary_io = 1; # endif /* USE_CWGUSI */ #endif fptr->mode |= FMODE_BINMODE; #endif return io; } int 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: ArgError("illegal access mode"); } if (mode[1] == 'b') { flags |= FMODE_BINMODE; mode++; } if (mode[1] == '+') { flags |= FMODE_READWRITE; } return flags; } FILE * rb_fopen(fname, mode) char *fname; char *mode; { FILE *f; f = fopen(fname, mode); if (f == NULL) { if (errno == EMFILE || errno == ENFILE) { gc_gc(); f = fopen(fname, mode); } if (f == NULL) { rb_sys_fail(fname); } } return f; } FILE * rb_fdopen(fd, mode) int fd; char *mode; { FILE *f; f = fdopen(fd, mode); if (f == NULL) { if (errno == EMFILE) { f = fdopen(fd, mode); } if (f == NULL) { rb_sys_fail(0); } } return f; } #if defined (NT) || defined(DJGPP) || defined(__CYGWIN32__) || defined(__human68k__) static struct pipe_list { OpenFile *fptr; struct pipe_list *next; } *pipe_list; static void pipe_add_fptr(fptr) OpenFile *fptr; { struct pipe_list *list; list = ALLOC(struct pipe_list); list->fptr = fptr; list->next = pipe_list; pipe_list = list; } static void pipe_del_fptr(fptr) OpenFile *fptr; { struct pipe_list *list = pipe_list; struct pipe_list *tmp; if (list->fptr == fptr) { pipe_list = list->next; free(list); return; } while (list->next) { if (list->next->fptr == fptr) { tmp = list->next; list->next = list->next->next; free(tmp); return; } list = list->next; } } static void pipe_atexit() { struct pipe_list *list = pipe_list; struct pipe_list *tmp; while (list) { tmp = list->next; io_fptr_finalize(list->fptr); list = tmp; } } static void pipe_finalize(fptr) OpenFile *fptr; { #if !defined (__CYGWIN32__) if (fptr->f != NULL) { pclose(fptr->f); } if (fptr->f2 != NULL) { pclose(fptr->f2); } #else fptr_finalize(fptr); #endif fptr->f = fptr->f2 = NULL; pipe_del_fptr(fptr); } #endif void io_unbuffered(fptr) OpenFile *fptr; { if (fptr->f2 == 0) TypeError("non-writable fptr"); if (fptr->f != 0) setbuf(fptr->f, NULL); setbuf(fptr->f2, NULL); fptr->mode |= FMODE_SYNC; } static VALUE pipe_open(pname, mode) char *pname, *mode; { #ifndef USE_CWGUSI int modef = io_mode_flags(mode); OpenFile *fptr; #if defined(NT) || defined(DJGPP) || defined(__human68k__) FILE *f = popen(pname, mode); if (f == NULL) rb_sys_fail(pname); else { NEWOBJ(port, struct RFile); OBJSETUP(port, cIO, T_FILE); MakeOpenFile(port, fptr); fptr->finalize = pipe_finalize; fptr->mode = modef; pipe_add_fptr(fptr); if (modef & FMODE_READABLE) fptr->f = f; if (modef & FMODE_WRITABLE) { fptr->f2 = f; io_unbuffered(fptr); } obj_call_init((VALUE)port); return (VALUE)port; } #else int pid, pr[2], pw[2]; volatile int doexec; if (((modef & FMODE_READABLE) && pipe(pr) == -1) || ((modef & FMODE_WRITABLE) && pipe(pw) == -1)) rb_sys_fail(pname); 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 (modef & FMODE_READABLE) { close(pr[0]); if (pr[1] != 1) { dup2(pr[1], 1); close(pr[1]); } } if (modef & FMODE_WRITABLE) { close(pw[1]); if (pw[0] != 0) { dup2(pw[0], 0); close(pw[0]); } } if (doexec) { extern char *sourcefile; extern int sourceline; int fd; for (fd = 3; fd < NOFILE; fd++) close(fd); rb_proc_exec(pname); fprintf(stderr, "%s:%d: command not found: %s\n", sourcefile, sourceline, pname); _exit(127); } return Qnil; case -1: /* fork failed */ if (errno == EAGAIN) { #ifdef THREAD thread_sleep(1); #else sleep(1); #endif goto retry; } close(pr[0]); close(pw[1]); rb_sys_fail(pname); break; default: /* parent */ if (pid < 0) rb_sys_fail(pname); else { NEWOBJ(port, struct RFile); OBJSETUP(port, cIO, T_FILE); MakeOpenFile(port, fptr); fptr->mode = modef; fptr->mode |= FMODE_SYNC; fptr->pid = pid; if (modef & FMODE_READABLE) { close(pr[1]); fptr->f = rb_fdopen(pr[0], "r"); } if (modef & FMODE_WRITABLE) { FILE *f = rb_fdopen(pw[1], "w"); close(pw[0]); if (fptr->f) fptr->f2 = f; else fptr->f = f; } #if defined (__CYGWIN32__) fptr->finalize = pipe_finalize; pipe_add_fptr(fptr); #endif obj_call_init((VALUE)port); return (VALUE)port; } } #endif #else /* USE_CWGUSI */ rb_notimplement(); #endif } static VALUE io_s_popen(argc, argv, self) int argc; VALUE *argv; VALUE self; { char *mode; VALUE pname, pmode; if (rb_scan_args(argc, argv, "11", &pname, &pmode) == 1) { mode = "r"; } else { int len; mode = STR2CSTR(pmode); len = strlen(mode); if (len == 0 || len > 3) ArgError("illegal access mode"); } Check_SafeStr(pname); return pipe_open(RSTRING(pname)->ptr, mode); } static VALUE io_open(fname, mode) char *fname, *mode; { if (fname[0] == '|') { return pipe_open(fname+1, mode); } else { return file_open(fname, mode); } } static VALUE f_open(argc, argv) int argc; VALUE *argv; { char *mode; VALUE pname, pmode; VALUE port; rb_scan_args(argc, argv, "11", &pname, &pmode); Check_SafeStr(pname); if (NIL_P(pmode)) { mode = "r"; } else { int len; mode = STR2CSTR(pmode); len = strlen(mode); if (len == 0 || len > 3) ArgError("illegal access mode"); } port = io_open(RSTRING(pname)->ptr, mode); if (iterator_p()) { return rb_ensure(rb_yield, port, io_close, port); } return port; } static VALUE io_get_io(io) VALUE io; { return rb_convert_type(io, T_FILE, "IO", "to_io"); } #ifndef NT extern char *strdup(); #endif static char* io_mode_string(fptr) OpenFile *fptr; { switch (fptr->mode & FMODE_READWRITE) { case FMODE_READABLE: default: return "r"; case FMODE_WRITABLE: return "w"; case FMODE_READWRITE: return "r+"; } } VALUE io_reopen(io, nfile) VALUE io, nfile; { OpenFile *fptr, *orig; char *mode; int fd; GetOpenFile(io, fptr); nfile = io_get_io(nfile); GetOpenFile(nfile, orig); if (orig->f2) { fflush(orig->f2); } else if (orig->mode & FMODE_WRITABLE) { fflush(orig->f); } /* copy OpenFile structure */ fptr->mode = orig->mode; fptr->pid = orig->pid; fptr->lineno = orig->lineno; if (fptr->path) free(fptr->path); if (orig->path) fptr->path = strdup(orig->path); else fptr->path = 0; fptr->finalize = orig->finalize; mode = io_mode_string(fptr); fd = fileno(fptr->f); if (fd < 3) { /* need to keep stdio */ if (dup2(fileno(orig->f), fd) < 0) rb_sys_fail(orig->path); } else { fclose(fptr->f); if (dup2(fileno(orig->f), fd) < 0) rb_sys_fail(orig->path); fptr->f = rb_fdopen(fd, mode); } if (fptr->f2) { fd = fileno(fptr->f2); fclose(fptr->f2); if (orig->f2) { if (dup2(fileno(orig->f2), fd) < 0) rb_sys_fail(orig->path); fptr->f2 = rb_fdopen(fd, "w"); } else { fptr->f2 = 0; } } if (fptr->mode & FMODE_BINMODE) { io_binmode(io); } RBASIC(io)->klass = RBASIC(nfile)->klass; return io; } static VALUE io_clone(io) VALUE io; { OpenFile *fptr, *orig; int fd; char *mode; NEWOBJ(obj, struct RFile); OBJSETUP(obj, CLASS_OF(io), T_FILE); GetOpenFile(io, orig); MakeOpenFile(obj, fptr); if (orig->f2) { fflush(orig->f2); } else if (orig->mode & FMODE_WRITABLE) { fflush(orig->f); } /* copy OpenFile structure */ fptr->mode = orig->mode; fptr->pid = orig->pid; fptr->lineno = orig->lineno; if (orig->path) fptr->path = strdup(orig->path); fptr->finalize = orig->finalize; switch (fptr->mode & FMODE_READWRITE) { case FMODE_READABLE: default: mode = "r"; break; case FMODE_WRITABLE: mode = "w"; break; case FMODE_READWRITE: if (orig->f2) mode = "r"; else mode = "r+"; break; } fd = dup(fileno(orig->f)); fptr->f = rb_fdopen(fd, mode); if (fptr->f2) { fd = dup(fileno(orig->f2)); fptr->f = rb_fdopen(fd, "w"); } if (fptr->mode & FMODE_BINMODE) { io_binmode((VALUE)obj); } return (VALUE)obj; } static VALUE io_printf(argc, argv, out) int argc; VALUE argv[]; VALUE out; { rb_funcall(out, id_write, 1, f_sprintf(argc, argv)); return Qnil; } static VALUE f_printf(argc, argv) int argc; VALUE argv[]; { VALUE out; if (argc == 0) return Qnil; if (TYPE(argv[0]) == T_STRING) { out = rb_defout; } else if (rb_respond_to(argv[0], id_write)) { out = argv[0]; argv++; argc--; } else { NameError("output must responds to `write'"); } rb_funcall(out, id_write, 1, f_sprintf(argc, argv)); return Qnil; } static VALUE io_print(argc, argv, out) int argc; VALUE *argv; VALUE out; { int i, j; VALUE line; /* if no argument given, print `$_' */ if (argc == 0) { argc = 1; line = lastline_get(); argv = &line; } for (i=0; i0) { io_write(out, OFS); } switch (TYPE(argv[i])) { case T_NIL: io_write(out, str_new2("nil")); break; case T_ARRAY: for (j=0; jlen; j++) { if (!NIL_P(OFS) && j>0) { io_write(out, OFS); } io_write(out, RARRAY(argv[i])->ptr[j]); } break; default: io_write(out, argv[i]); break; } } if (!NIL_P(ORS)) { io_write(out, ORS); } return Qnil; } static VALUE f_print(argc, argv) int argc; VALUE *argv; { io_print(argc, argv, rb_defout); return Qnil; } static VALUE io_putc(io, ch) VALUE io, ch; { OpenFile *fptr; FILE *f; int c = NUM2CHR(ch); rb_secure(4); GetOpenFile(io, fptr); io_writable(fptr); f = GetWriteFile(fptr); if (fputc(c, f) == EOF || ferror(f)) rb_sys_fail(fptr->path); if (fptr->mode & FMODE_SYNC) fflush(f); return ch; } static VALUE f_putc(recv, ch) VALUE recv, ch; { return io_putc(rb_defout, ch); } static VALUE io_puts(argc, argv, out) int argc; VALUE *argv; VALUE out; { int i, j; VALUE line; /* if no argument given, print newline. */ if (argc == 0) { io_write(out, RS_default); return Qnil; } for (i=0; ilen; j++) { io_puts(1, &RARRAY(argv[i])->ptr[j], out); } continue; default: line = argv[i]; break; } line = obj_as_string(line); io_write(out, line); if (RSTRING(line)->ptr[RSTRING(line)->len-1] != '\n') { io_write(out, RS_default); } } return Qnil; } static VALUE f_puts(argc, argv) int argc; VALUE *argv; { io_puts(argc, argv, rb_defout); return Qnil; } void rb_p(obj) /* for debug print within C code */ VALUE obj; { io_write(rb_defout, rb_inspect(obj)); io_write(rb_defout, RS_default); } static VALUE f_p(argc, argv) int argc; VALUE *argv; { int i; for (i=0; iptr, "w"); } if (!rb_respond_to(val, id_write)) { TypeError("$< must have write method, %s given", rb_class2name(CLASS_OF(val))); } rb_defout = val; } static void io_stdio_set(val, id, var) VALUE val; ID id; VALUE *var; { OpenFile *fptr; int fd; if (TYPE(val) != T_FILE) { TypeError("%s must be IO object", rb_id2name(id)); } GetOpenFile(*var, fptr); fd = fileno(fptr->f); GetOpenFile(val, fptr); if (fd == 0) { io_readable(fptr); } else { io_writable(fptr); } io_reopen(*var, val); } static VALUE prep_stdio(f, mode, klass) FILE *f; int mode; VALUE klass; { OpenFile *fp; NEWOBJ(io, struct RFile); OBJSETUP(io, klass, T_FILE); MakeOpenFile(io, fp); fp->f = f; fp->mode = mode; obj_call_init((VALUE)io); return (VALUE)io; } static VALUE io_s_new(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { VALUE fnum, mode; char *m = "r"; if (rb_scan_args(argc, argv, "11", &fnum, &mode) == 2) { Check_SafeStr(mode); m = RSTRING(mode)->ptr; } return prep_stdio(rb_fdopen(NUM2INT(fnum), m), io_mode_flags(m), klass); } static int next_argv() { extern VALUE rb_argv; char *fn; if (init_p == 0) { if (RARRAY(rb_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(rb_argv)->len > 0) { filename = ary_shift(rb_argv); fn = RSTRING(filename)->ptr; if (RSTRING(filename)->len == 1 && fn[0] == '-') { file = rb_stdin; if (inplace) { rb_defout = rb_stdout; } } else { FILE *fr = rb_fopen(fn, "r"); if (inplace) { struct stat st, st2; VALUE str; FILE *fw; if (TYPE(rb_defout) == T_FILE && rb_defout != rb_stdout) { io_close(rb_defout); } fstat(fileno(fr), &st); if (*inplace) { str = str_new2(fn); #if defined(MSDOS) || defined(__CYGWIN32__) || defined(NT) add_suffix(str, inplace); #else str_cat(str, inplace, strlen(inplace)); #endif #if defined(MSDOS) || defined(__BOW__) || defined(__CYGWIN32__) || defined(NT) || defined(__human68k__) (void)fclose(fr); (void)unlink(RSTRING(str)->ptr); (void)rename(fn, RSTRING(str)->ptr); fr = rb_fopen(RSTRING(str)->ptr, "r"); #else if (rename(fn, RSTRING(str)->ptr) < 0) { Warn("Can't rename %s to %s: %s, skipping file", fn, RSTRING(str)->ptr, strerror(errno)); fclose(fr); goto retry; } #endif } else { #if !defined(MSDOS) && !defined(__BOW__) && !defined(__CYGWIN32__) && !defined(NT) && !defined(__human68k__) if (unlink(fn) < 0) { Warn("Can't remove %s: %s, skipping file", fn, strerror(errno)); fclose(fr); goto retry; } #else Fatal("Can't do inplace edit without backup"); #endif } fw = rb_fopen(fn, "w"); #if !defined(MSDOS) && !defined(__CYGWIN32__) && !(NT) && !defined(__human68k__)\ && !defined(USE_CWGUSI) && !defined(__BEOS__) 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); } #endif rb_defout = prep_stdio(fw, FMODE_WRITABLE, cFile); } file = prep_stdio(fr, FMODE_READABLE, cFile); } } else { init_p = 0; return FALSE; } } return TRUE; } static VALUE f_gets_method(argc, argv) int argc; VALUE *argv; { VALUE line; retry: if (!next_argv()) return Qnil; line = io_gets_method(argc, argv, file); if (NIL_P(line) && next_p != -1) { io_close(file); next_p = 1; goto retry; } gets_lineno++; lineno = INT2FIX(gets_lineno); return line; } VALUE f_gets() { return f_gets_method(0,0); } static VALUE f_readline(argc, argv) int argc; VALUE *argv; { VALUE line = f_gets_method(argc, argv); if (NIL_P(line)) { eof_error(); } return line; } static VALUE f_tell() { return io_tell(file); } static VALUE f_seek(self, offset, ptrname) VALUE self, offset, ptrname; { if (!next_argv()) { ArgError("no stream to seek"); } return io_seek(file, offset, ptrname); } static VALUE f_set_pos(self, offset) VALUE self, offset; { if (!next_argv()) { ArgError("no stream to pos"); } return io_set_pos(file, offset); } static VALUE f_rewind() { return io_rewind(file); } static VALUE f_eof() { if (init_p == 0 && !next_argv()) return TRUE; if (io_eof(file)) { next_p = 1; return TRUE; } return FALSE; } static VALUE f_getc() { return io_getc(rb_stdin); } static VALUE f_ungetc(self, c) VALUE self, c; { if (!next_argv()) { ArgError("no stream to ungetc"); } return io_ungetc(file, c); } static VALUE f_readchar() { VALUE c = f_getc(); if (NIL_P(c)) { eof_error(); } return c; } static VALUE f_readlines(argc, argv) int argc; VALUE *argv; { VALUE line, ary; ary = ary_new(); while (!NIL_P(line = f_gets_method(argc, argv))) { ary_push(ary, line); } return ary; } void rb_str_setter(val, id, var) VALUE val; ID id; VALUE *var; { if (!NIL_P(val) && TYPE(val) != T_STRING) { TypeError("value of %s must be String", rb_id2name(id)); } *var = val; } static VALUE f_backquote(obj, str) VALUE obj, str; { VALUE port, result; Check_SafeStr(str); port = pipe_open(RSTRING(str)->ptr, "r"); result = read_all(port); io_close(port); if (NIL_P(result)) return str_new(0,0); return result; } #ifdef HAVE_SYS_SELECT_H #include #endif #ifdef NT #define select(v, w, x, y, z) (-1) /* anytime fail */ #endif static VALUE f_select(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 *tp, timerec; OpenFile *fptr; int i, max = 0, n; int interrupt_flag = 0; int pending = 0; rb_scan_args(argc, argv, "13", &read, &write, &except, &timeout); if (NIL_P(timeout)) { tp = NULL; } else { timerec = time_timeval(timeout); tp = &timerec; } FD_ZERO(&pset); if (!NIL_P(read)) { Check_Type(read, T_ARRAY); rp = &rset; FD_ZERO(rp); for (i=0; ilen; i++) { VALUE io = io_get_io(RARRAY(read)->ptr[i]); GetOpenFile(io, fptr); FD_SET(fileno(fptr->f), rp); if (READ_DATA_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 (!NIL_P(write)) { Check_Type(write, T_ARRAY); wp = &wset; FD_ZERO(wp); for (i=0; ilen; i++) { VALUE io = io_get_io(RARRAY(write)->ptr[i]); GetOpenFile(io, 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 (!NIL_P(except)) { Check_Type(except, T_ARRAY); ep = &eset; FD_ZERO(ep); for (i=0; ilen; i++) { VALUE io = io_get_io(RARRAY(except)->ptr[i]); GetOpenFile(io, 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++; #ifdef THREAD n = thread_select(max, rp, wp, ep, tp); if (n < 0) { rb_sys_fail(0); } #else retry: TRAP_BEG; n = select(max, rp, wp, ep, tp); TRAP_END; if (n < 0) { if (errno != EINTR) { rb_sys_fail(0); } if (tp == NULL) goto retry; interrupt_flag = 1; } #endif if (!pending && n == 0) return Qnil; /* returns nil on timeout */ res = ary_new2(3); ary_push(res, rp?ary_new():ary_new2(0)); ary_push(res, wp?ary_new():ary_new2(0)); ary_push(res, ep?ary_new():ary_new2(0)); if (interrupt_flag == 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; /* returns an empty array on interrupt */ } static VALUE io_ctl(io, req, arg, io_p) VALUE io, req, arg; int io_p; { #if !defined(MSDOS) && !defined(__human68k__) int cmd = NUM2INT(req); OpenFile *fptr; int len = 0; int fd; long narg = 0; int retval; rb_secure(2); GetOpenFile(io, fptr); if (NIL_P(arg) || arg == FALSE) { narg = 0; } else if (FIXNUM_P(arg)) { narg = FIX2INT(arg); } else if (arg == TRUE) { narg = 1; } else { Check_Type(arg, T_STRING); #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 systems we're safe */ #else len = 256; /* otherwise guess at what's safe */ #endif str_modify(arg); if (len <= RSTRING(arg)->len) { len = RSTRING(arg)->len; } if (RSTRING(arg)->len < len) { str_resize(arg, len+1); } RSTRING(arg)->ptr[len] = 17; /* a little sanity check here */ narg = (long)RSTRING(arg)->ptr; } fd = fileno(fptr->f); #ifdef HAVE_FCNTL TRAP_BEG; # ifdef USE_CWGUSI retval = io_p?ioctl(fd, cmd, (void*) narg):fcntl(fd, cmd, narg); # else retval = io_p?ioctl(fd, cmd, narg):fcntl(fd, cmd, narg); # endif TRAP_END; #else if (!io_p) { rb_notimplement(); } TRAP_BEG; retval = ioctl(fd, cmd, narg); TRAP_END; #endif if (retval < 0) rb_sys_fail(fptr->path); if (TYPE(arg) == T_STRING && RSTRING(arg)->ptr[len] != 17) { ArgError("return value overflowed string"); } return INT2NUM(retval); #else rb_notimplement(); #endif } static VALUE io_ioctl(argc, argv, io) int argc; VALUE *argv; VALUE io; { VALUE req, arg; rb_scan_args(argc, argv, "11", &req, &arg); return io_ctl(io, req, arg, 1); } static VALUE io_fcntl(argc, argv, io) int argc; VALUE *argv; VALUE io; { #ifdef HAVE_FCNTL VALUE req, arg; rb_scan_args(argc, argv, "11", &req, &arg); return io_ctl(io, req, arg, 0); #else rb_notimplement(); #endif } static VALUE f_syscall(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 = 1; 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? */ rb_secure(2); if (argc == 0) ArgError("too few arguments for syscall"); 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++; } TRAP_BEG; switch (argc) { 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 */ } TRAP_END; if (retval == -1) rb_sys_fail(0); return INT2FIX(0); #else rb_notimplement(); #endif } static VALUE io_s_pipe() { #ifndef __human68k__ int pipes[2]; VALUE r, w, ary; #ifdef NT if (_pipe(pipes, 1024, O_BINARY) == -1) #else if (pipe(pipes) == -1) #endif rb_sys_fail(0); r = prep_stdio(fdopen(pipes[0], "r"), FMODE_READABLE, cIO); w = prep_stdio(fdopen(pipes[1], "w"), FMODE_WRITABLE, cIO); ary = ary_new2(2); ary_push(ary, r); ary_push(ary, w); return ary; #else rb_notimplement(); #endif } struct foreach_arg { int argc; VALUE sep; VALUE io; }; static VALUE io_foreach_line(arg) struct foreach_arg *arg; { VALUE str; while (!NIL_P(str = io_gets_method(arg->argc, &arg->sep, arg->io))) { rb_yield(str); } return Qnil; } static VALUE io_s_foreach(argc, argv, io) int argc; VALUE *argv; VALUE io; { VALUE fname; struct foreach_arg arg; rb_scan_args(argc, argv, "11", &fname, &arg.sep); Check_SafeStr(fname); arg.argc = argc - 1; arg.io = io_open(RSTRING(fname)->ptr, "r"); return rb_ensure(io_foreach_line, (VALUE)&arg, io_close, arg.io); } static VALUE io_readline_line(arg) struct foreach_arg *arg; { VALUE line, ary; ary = ary_new(); while (!NIL_P(line = io_gets_method(arg->argc, &arg->sep, arg->io))) { ary_push(ary, line); } return ary; } static VALUE io_s_readlines(argc, argv, io) int argc; VALUE *argv; VALUE io; { VALUE fname; struct foreach_arg arg; rb_scan_args(argc, argv, "11", &fname, &arg.sep); Check_SafeStr(fname); arg.argc = argc - 1; arg.io = io_open(RSTRING(fname)->ptr, "r"); return rb_ensure(io_readline_line, (VALUE)&arg, io_close, arg.io); } static VALUE arg_fileno() { return io_fileno(file); } static VALUE arg_to_io() { return file; } static VALUE arg_read(argc, argv) int argc; VALUE *argv; { VALUE tmp, str; int len; if (argc == 1) len = NUM2INT(argv[0]); str = Qnil; retry: if (!next_argv()) return str; tmp = io_read(argc, argv, file); if ((NIL_P(tmp) || RSTRING(tmp)->len == 0) && next_p != -1) { io_close(file); next_p = 1; goto retry; } if (NIL_P(tmp) || RSTRING(tmp)->len == 0) return str; else if (NIL_P(str)) str = tmp; else str_cat(str, RSTRING(tmp)->ptr, RSTRING(tmp)->len); if (argc == 0) { goto retry; } if (RSTRING(tmp)->len < len) { len -= RSTRING(tmp)->len; argv[0] = INT2FIX(len); goto retry; } return str; } static VALUE arg_getc() { VALUE byte; retry: if (!next_argv()) return Qnil; byte = io_getc(file); if (NIL_P(byte) && next_p != -1) { io_close(file); next_p = 1; goto retry; } return byte; } static VALUE arg_readchar() { VALUE c = io_getc(file); if (NIL_P(c)) { eof_error(); } return c; } static VALUE arg_each_line(argc, argv) int argc; VALUE *argv; { VALUE str; while (RTEST(str = f_gets_method(argc, argv))) { rb_yield(str); } return Qnil; } static VALUE arg_each_byte() { VALUE byte; while (!NIL_P(byte = arg_getc())) { rb_yield(byte); } return Qnil; } static VALUE arg_filename() { return filename; } static VALUE arg_file() { return file; } static VALUE arg_skip() { if (next_p != -1) { io_close(file); next_p = 1; } return argf; } static VALUE arg_close() { io_close(file); if (next_p != -1) { next_p = 1; } gets_lineno = 0; return argf; } static VALUE arg_closed() { return io_closed(file); } static VALUE opt_i_get() { if (!inplace) return Qnil; return str_new2(inplace); } static void opt_i_set(val) VALUE val; { if (!RTEST(val)) { inplace = 0; return; } inplace = STR2CSTR(val); } void Init_IO() { eIOError = rb_define_class("IOError", eStandardError); eEOFError = rb_define_class("EOFError", eIOError); id_write = rb_intern("write"); rb_define_global_function("syscall", f_syscall, -1); rb_define_global_function("open", f_open, -1); rb_define_global_function("printf", f_printf, -1); rb_define_global_function("print", f_print, -1); rb_define_global_function("putc", f_putc, 1); rb_define_global_function("puts", f_puts, -1); rb_define_global_function("gets", f_gets_method, -1); rb_define_global_function("readline", f_readline, -1); rb_define_global_function("tell", f_tell, 0); rb_define_global_function("seek", f_seek, 2); rb_define_global_function("rewind", f_rewind, 0); rb_define_global_function("eof", f_eof, 0); rb_define_global_function("eof?", f_eof, 0); rb_define_global_function("getc", f_getc, 0); rb_define_global_function("readchar", f_readchar, 0); rb_define_global_function("select", f_select, -1); rb_define_global_function("ungetc", f_ungetc, 1); rb_define_global_function("readlines", f_readlines, -1); rb_define_global_function("`", f_backquote, 1); rb_define_global_function("pipe", io_s_pipe, 0); rb_define_global_function("p", f_p, -1); rb_define_method(mKernel, "display", obj_display, -1); cIO = rb_define_class("IO", cObject); rb_include_module(cIO, mEnumerable); rb_define_singleton_method(cIO, "new", io_s_new, -1); rb_define_singleton_method(cIO, "popen", io_s_popen, -1); rb_define_singleton_method(cIO, "foreach", io_s_foreach, -1); rb_define_singleton_method(cIO, "readlines", io_s_readlines, -1); rb_define_singleton_method(cIO, "select", f_select, -1); FS = OFS = Qnil; rb_define_hooked_variable("$;", &FS, 0, rb_str_setter); rb_define_hooked_variable("$-F", &FS, 0, rb_str_setter); rb_define_hooked_variable("$,", &OFS, 0, rb_str_setter); RS = RS_default = str_new2("\n"); ORS = Qnil; rb_global_variable(&RS_default); str_freeze(RS_default); /* avoid modifying RS_default */ rb_define_hooked_variable("$/", &RS, 0, rb_str_setter); rb_define_hooked_variable("$-0", &RS, 0, rb_str_setter); rb_define_hooked_variable("$\\", &ORS, 0, rb_str_setter); rb_define_hooked_variable("$.", &lineno, 0, lineno_setter); rb_define_virtual_variable("$_", lastline_get, lastline_set); rb_define_method(cIO, "clone", io_clone, 0); rb_define_method(cIO, "reopen", io_reopen, 1); rb_define_method(cIO, "print", io_print, -1); rb_define_method(cIO, "putc", io_putc, 1); rb_define_method(cIO, "puts", io_puts, -1); rb_define_method(cIO, "printf", io_printf, -1); rb_define_method(cIO, "each", io_each_line, -1); rb_define_method(cIO, "each_line", io_each_line, -1); rb_define_method(cIO, "each_byte", io_each_byte, 0); rb_define_method(cIO, "syswrite", io_syswrite, 1); rb_define_method(cIO, "sysread", io_sysread, 1); rb_define_method(cIO, "fileno", io_fileno, 0); rb_define_alias(cIO, "to_i", "fileno"); rb_define_method(cIO, "to_io", io_to_io, 0); rb_define_method(cIO, "sync", io_sync, 0); rb_define_method(cIO, "sync=", io_set_sync, 1); rb_define_method(cIO, "lineno", io_lineno, 0); rb_define_method(cIO, "lineno=", io_set_lineno, 1); rb_define_method(cIO, "readlines", io_readlines, -1); rb_define_method(cIO, "read", io_read, -1); rb_define_method(cIO, "write", io_write, 1); rb_define_method(cIO, "gets", io_gets_method, -1); rb_define_method(cIO, "readline", io_readline, -1); rb_define_method(cIO, "getc", io_getc, 0); rb_define_method(cIO, "readchar", io_readchar, 0); rb_define_method(cIO, "ungetc",io_ungetc, 1); rb_define_method(cIO, "<<", io_addstr, 1); rb_define_method(cIO, "flush", io_flush, 0); rb_define_method(cIO, "tell", io_tell, 0); rb_define_method(cIO, "seek", io_seek, 2); rb_define_method(cIO, "rewind", io_rewind, 0); rb_define_method(cIO, "pos", io_tell, 0); rb_define_method(cIO, "pos=", io_set_pos, 1); rb_define_method(cIO, "eof", io_eof, 0); rb_define_method(cIO, "eof?", io_eof, 0); rb_define_method(cIO, "close", io_close_method, 0); rb_define_method(cIO, "closed?", io_closed, 0); rb_define_method(cIO, "isatty", io_isatty, 0); rb_define_method(cIO, "tty?", io_isatty, 0); rb_define_method(cIO, "binmode", io_binmode, 0); rb_define_method(cIO, "ioctl", io_ioctl, -1); rb_define_method(cIO, "fcntl", io_fcntl, -1); rb_stdin = prep_stdio(stdin, FMODE_READABLE, cIO); rb_define_hooked_variable("$stdin", &rb_stdin, 0, io_stdio_set); rb_stdout = prep_stdio(stdout, FMODE_WRITABLE, cIO); rb_define_hooked_variable("$stdout", &rb_stdout, 0, io_stdio_set); rb_stderr = prep_stdio(stderr, FMODE_WRITABLE, cIO); rb_define_hooked_variable("$stderr", &rb_stderr, 0, io_stdio_set); rb_defout = rb_stdout; rb_define_hooked_variable("$>", &rb_defout, 0, io_defset); rb_define_global_const("STDIN", rb_stdin); rb_define_global_const("STDOUT", rb_stdout); rb_define_global_const("STDERR", rb_stderr); argf = obj_alloc(cObject); rb_extend_object(argf, mEnumerable); rb_define_readonly_variable("$<", &argf); rb_define_global_const("ARGF", argf); rb_define_singleton_method(argf, "fileno", arg_fileno, 0); rb_define_singleton_method(argf, "to_i", arg_fileno, 0); rb_define_singleton_method(argf, "to_io", arg_to_io, 0); rb_define_singleton_method(argf, "each", arg_each_line, -1); rb_define_singleton_method(argf, "each_line", arg_each_line, -1); rb_define_singleton_method(argf, "each_byte", arg_each_byte, 0); rb_define_singleton_method(argf, "read", arg_read, -1); rb_define_singleton_method(argf, "readlines", f_readlines, -1); rb_define_singleton_method(argf, "to_a", f_readlines, -1); rb_define_singleton_method(argf, "gets", f_gets_method, -1); rb_define_singleton_method(argf, "readline", f_readline, -1); rb_define_singleton_method(argf, "getc", arg_getc, 0); rb_define_singleton_method(argf, "readchar", arg_readchar, 0); rb_define_singleton_method(argf, "tell", f_tell, 0); rb_define_singleton_method(argf, "seek", f_seek, 2); rb_define_singleton_method(argf, "rewind", f_rewind, 0); rb_define_singleton_method(argf, "pos", f_tell, 0); rb_define_singleton_method(argf, "pos=", f_set_pos, 1); rb_define_singleton_method(argf, "eof", f_eof, 0); rb_define_singleton_method(argf, "eof?", f_eof, 0); rb_define_singleton_method(argf, "ungetc", f_ungetc, 1); rb_define_singleton_method(argf, "to_s", arg_filename, 0); rb_define_singleton_method(argf, "filename", arg_filename, 0); rb_define_singleton_method(argf, "file", arg_file, 0); rb_define_singleton_method(argf, "skip", arg_skip, 0); rb_define_singleton_method(argf, "close", arg_close, 0); rb_define_singleton_method(argf, "closed?", arg_closed, 0); filename = str_new2("-"); rb_define_readonly_variable("$FILENAME", &filename); file = rb_stdin; rb_global_variable(&file); rb_define_virtual_variable("$-i", opt_i_get, opt_i_set); #if defined (NT) || defined(DJGPP) || defined(__CYGWIN32__) || defined(__human68k__) atexit(pipe_atexit); #endif Init_File(); } ruby-1.2.3/keywords100644 774 145 2440 6465250122 12327 0ustar matzNaClstruct kwtable {char *name; int id[2]; enum lex_state state;}; %% __LINE__, k__LINE__, k__LINE__, EXPR_END __FILE__, k__FILE__, k__FILE__, EXPR_END BEGIN, klBEGIN, klBEGIN, EXPR_END END, klEND, klEND, EXPR_END alias, kALIAS, kALIAS, EXPR_FNAME and, kAND, kAND, EXPR_BEG begin, kBEGIN, kBEGIN, EXPR_BEG break, kBREAK, kBREAK, EXPR_END case, kCASE, kCASE, EXPR_BEG class, kCLASS, kCLASS, EXPR_CLASS def, kDEF, kDEF, EXPR_FNAME defined?, kDEFINED, kDEFINED, EXPR_END do, kDO, kDO, EXPR_BEG else, kELSE, kELSE, EXPR_BEG elsif, kELSIF, kELSIF, EXPR_BEG end, kEND, kEND, EXPR_END ensure, kENSURE, kENSURE, EXPR_BEG false, kFALSE, kFALSE, EXPR_END for, kFOR, kFOR, EXPR_BEG if, kIF, kIF_MOD, EXPR_BEG in, kIN, kIN, EXPR_BEG module, kMODULE, kMODULE, EXPR_BEG next, kNEXT, kNEXT, EXPR_END nil, kNIL, kNIL, EXPR_END not, kNOT, kNOT, EXPR_BEG or, kOR, kOR, EXPR_BEG redo, kREDO, kREDO, EXPR_END rescue, kRESCUE, kRESCUE, EXPR_MID retry, kRETRY, kRETRY, EXPR_END return, kRETURN, kRETURN, EXPR_MID self, kSELF, kSELF, EXPR_END super, kSUPER, kSUPER, EXPR_END then, kTHEN, kTHEN, EXPR_BEG true, kTRUE, kTRUE, EXPR_END undef, kUNDEF, kUNDEF, EXPR_FNAME unless, kUNLESS, kUNLESS_MOD, EXPR_BEG until, kUNTIL, kUNTIL_MOD, EXPR_BEG when, kWHEN, kWHEN, EXPR_BEG while, kWHILE, kWHILE_MOD, EXPR_BEG yield, kYIELD, kYIELD, EXPR_END ruby-1.2.3/lex.c100644 774 145 7260 6536637052 11510 0ustar matzNaCl/* C code produced by gperf version 2.5 (GNU C++ version) */ /* Command-line: gperf -p -j1 -i 1 -g -o -t -N rb_reserved_word -k1,3,$ keywords */ struct kwtable {char *name; int id[2]; enum lex_state state;}; #define TOTAL_KEYWORDS 40 #define MIN_WORD_LENGTH 2 #define MAX_WORD_LENGTH 8 #define MIN_HASH_VALUE 6 #define MAX_HASH_VALUE 55 /* maximum key range = 50, duplicates = 0 */ #ifdef __GNUC__ inline #endif static unsigned int hash (str, len) register char *str; register int unsigned len; { static unsigned char asso_values[] = { 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 11, 56, 56, 36, 56, 1, 37, 31, 1, 56, 56, 56, 56, 29, 56, 1, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 56, 32, 1, 2, 1, 1, 4, 23, 56, 17, 56, 20, 9, 2, 9, 26, 14, 56, 5, 1, 1, 16, 56, 21, 20, 9, 56, 56, 56, 56, 56, 56, }; register int hval = len; switch (hval) { default: case 3: hval += asso_values[str[2]]; case 2: case 1: hval += asso_values[str[0]]; break; } return hval + asso_values[str[len - 1]]; } #ifdef __GNUC__ inline #endif struct kwtable * rb_reserved_word (str, len) register char *str; register unsigned int len; { static struct kwtable wordlist[] = { {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"end", kEND, kEND, EXPR_END}, {"else", kELSE, kELSE, EXPR_BEG}, {"case", kCASE, kCASE, EXPR_BEG}, {"ensure", kENSURE, kENSURE, EXPR_BEG}, {"module", kMODULE, kMODULE, EXPR_BEG}, {"elsif", kELSIF, kELSIF, EXPR_BEG}, {"def", kDEF, kDEF, EXPR_FNAME}, {"rescue", kRESCUE, kRESCUE, EXPR_MID}, {"not", kNOT, kNOT, EXPR_BEG}, {"then", kTHEN, kTHEN, EXPR_BEG}, {"yield", kYIELD, kYIELD, EXPR_END}, {"for", kFOR, kFOR, EXPR_BEG}, {"self", kSELF, kSELF, EXPR_END}, {"false", kFALSE, kFALSE, EXPR_END}, {"retry", kRETRY, kRETRY, EXPR_END}, {"return", kRETURN, kRETURN, EXPR_MID}, {"true", kTRUE, kTRUE, EXPR_END}, {"if", kIF, kIF_MOD, EXPR_BEG}, {"defined?", kDEFINED, kDEFINED, EXPR_END}, {"super", kSUPER, kSUPER, EXPR_END}, {"undef", kUNDEF, kUNDEF, EXPR_FNAME}, {"break", kBREAK, kBREAK, EXPR_END}, {"in", kIN, kIN, EXPR_BEG}, {"do", kDO, kDO, EXPR_BEG}, {"nil", kNIL, kNIL, EXPR_END}, {"until", kUNTIL, kUNTIL_MOD, EXPR_BEG}, {"unless", kUNLESS, kUNLESS_MOD, EXPR_BEG}, {"or", kOR, kOR, EXPR_BEG}, {"next", kNEXT, kNEXT, EXPR_END}, {"when", kWHEN, kWHEN, EXPR_BEG}, {"redo", kREDO, kREDO, EXPR_END}, {"and", kAND, kAND, EXPR_BEG}, {"begin", kBEGIN, kBEGIN, EXPR_BEG}, {"__LINE__", k__LINE__, k__LINE__, EXPR_END}, {"class", kCLASS, kCLASS, EXPR_CLASS}, {"__FILE__", k__FILE__, k__FILE__, EXPR_END}, {"END", klEND, klEND, EXPR_END}, {"BEGIN", klBEGIN, klBEGIN, EXPR_END}, {"while", kWHILE, kWHILE_MOD, EXPR_BEG}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"",}, {"alias", kALIAS, kALIAS, EXPR_FNAME}, }; if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH) { register int key = hash (str, len); if (key <= MAX_HASH_VALUE && key >= 0) { register char *s = wordlist[key].name; if (*s == *str && !strcmp (str + 1, s + 1)) return &wordlist[key]; } } return 0; } ruby-1.2.3/main.c100644 774 145 1012 6457652042 11627 0ustar matzNaCl/************************************************ main.c - $Author: matz $ $Date: 1998/01/16 12:35:46 $ created at: Fri Aug 19 13:19:58 JST 1994 ************************************************/ #include "ruby.h" #ifdef DJGPP unsigned int _stklen = 0x100000; #endif #ifdef __human68k__ int _stacksize = 131072; #endif int main(argc, argv, envp) int argc; char **argv, **envp; { #if defined(NT) NtInitialize(&argc, &argv); #endif ruby_init(); ruby_options(argc, argv); ruby_run(); } ruby-1.2.3/marshal.c100644 774 145 37263 6621530726 12370 0ustar matzNaCl/************************************************ marshal.c - $Author: matz $ $Revision: 1.1.1.1.2.17 $ $Date: 1998/11/09 09:11:50 $ created at: Thu Apr 27 16:30:01 JST 1995 ************************************************/ #include "ruby.h" #include "rubyio.h" #include "st.h" #define MARSHAL_MAJOR 4 #define MARSHAL_MINOR 0 #define TYPE_NIL '0' #define TYPE_TRUE 'T' #define TYPE_FALSE 'F' #define TYPE_FIXNUM 'i' #define TYPE_UCLASS 'C' #define TYPE_OBJECT 'o' #define TYPE_USERDEF 'u' #define TYPE_FLOAT 'f' #define TYPE_BIGNUM 'l' #define TYPE_STRING '"' #define TYPE_REGEXP '/' #define TYPE_ARRAY '[' #define TYPE_HASH '{' #define TYPE_STRUCT 'S' #define TYPE_MODULE 'M' #define TYPE_SYMBOL ':' #define TYPE_SYMLINK ';' #define TYPE_LINK '@' VALUE rb_path2class _((char*)); static ID s_dump, s_load; struct dump_arg { VALUE obj; FILE *fp; VALUE str; st_table *symbol; st_table *data; }; struct dump_call_arg { VALUE obj; struct dump_arg *arg; int limit; }; static void w_long _((long, struct dump_arg*)); static void w_byte(c, arg) char c; struct dump_arg *arg; { if (arg->fp) putc(c, arg->fp); else str_cat(arg->str, &c, 1); } static void w_bytes(s, n, arg) char *s; int n; struct dump_arg *arg; { w_long(n, arg); if (arg->fp) { fwrite(s, 1, n, arg->fp); } else { str_cat(arg->str, s, n); } } static void w_short(x, arg) int x; struct dump_arg *arg; { int i; for (i=0; i> (i*8)) & 0xff, arg); } } static void w_long(x, arg) long x; struct dump_arg *arg; { char buf[sizeof(long)+1]; int i, len = 0; if (x == 0) { w_byte(0, arg); return; } for (i=1;isymbol, id, &num)) { w_byte(TYPE_SYMLINK, arg); w_long(num, arg); } else { w_byte(TYPE_SYMBOL, arg); w_bytes(sym, strlen(sym), arg); st_insert(arg->symbol, id, arg->symbol->num_entries); } } static void w_unique(s, arg) char *s; struct dump_arg *arg; { w_symbol(rb_intern(s), arg); } static void w_object _((VALUE,struct dump_arg*,int)); static int hash_each(key, value, arg) VALUE key, value; struct dump_call_arg *arg; { w_object(key, arg->arg, arg->limit); w_object(value, arg->arg, arg->limit); return ST_CONTINUE; } static int obj_each(id, value, arg) ID id; VALUE value; struct dump_call_arg *arg; { w_symbol(id, arg->arg); w_object(value, arg->arg, arg->limit); return ST_CONTINUE; } static void w_uclass(obj, klass, arg) VALUE obj, klass; struct dump_arg *arg; { if (CLASS_OF(obj) != klass) { w_byte(TYPE_UCLASS, arg); w_unique(rb_class2name(CLASS_OF(obj)), arg); } } static void w_object(obj, arg, limit) VALUE obj; struct dump_arg *arg; int limit; { struct dump_call_arg c_arg; if (limit == 0) { Fail("exceed depth limit"); } if (obj == Qnil) { w_byte(TYPE_NIL, arg); } else if (obj == TRUE) { w_byte(TYPE_TRUE, arg); } else if (obj == FALSE) { w_byte(TYPE_FALSE, arg); } else if (FIXNUM_P(obj)) { #if SIZEOF_LONG <= 4 w_byte(TYPE_FIXNUM, arg); w_long(FIX2INT(obj), arg); #else if (RSHIFT((long)obj, 32) == 0 || RSHIFT((long)obj, 32) == -1) { w_byte(TYPE_FIXNUM, arg); w_long(FIX2LONG(obj), arg); } else { w_object(int2big(FIX2LONG(obj)), arg, limit); return; } #endif } else { int num; limit--; c_arg.limit = limit; c_arg.arg = arg; if (st_lookup(arg->data, obj, &num)) { w_byte(TYPE_LINK, arg); w_long(num, arg); return; } st_insert(arg->data, obj, arg->data->num_entries); if (rb_respond_to(obj, s_dump)) { VALUE v; w_byte(TYPE_USERDEF, arg); w_unique(rb_class2name(CLASS_OF(obj)), arg); v = rb_funcall(obj, s_dump, 1, limit); if (TYPE(v) != T_STRING) { TypeError("_dump must return String"); } w_bytes(RSTRING(v)->ptr, RSTRING(v)->len, arg); return; } switch (BUILTIN_TYPE(obj)) { case T_MODULE: case T_CLASS: w_byte(TYPE_MODULE, arg); { VALUE path = rb_class_path(obj); w_bytes(RSTRING(path)->ptr, RSTRING(path)->len, arg); } return; case T_FLOAT: w_byte(TYPE_FLOAT, arg); w_float(RFLOAT(obj)->value, arg); return; case T_BIGNUM: w_byte(TYPE_BIGNUM, arg); { char sign = RBIGNUM(obj)->sign?'+':'-'; int len = RBIGNUM(obj)->len; unsigned short *d = RBIGNUM(obj)->digits; w_byte(sign, arg); w_long(len, arg); while (len--) { w_short(*d, arg); d++; } } return; case T_STRING: w_uclass(obj, cString, arg); w_byte(TYPE_STRING, arg); w_bytes(RSTRING(obj)->ptr, RSTRING(obj)->len, arg); return; case T_REGEXP: w_uclass(obj, cRegexp, arg); w_byte(TYPE_REGEXP, arg); w_bytes(RREGEXP(obj)->str, RREGEXP(obj)->len, arg); w_byte(reg_options(obj), arg); return; case T_ARRAY: w_uclass(obj, cArray, arg); w_byte(TYPE_ARRAY, arg); { int len = RARRAY(obj)->len; VALUE *ptr = RARRAY(obj)->ptr; w_long(len, arg); while (len--) { w_object(*ptr, arg, limit); ptr++; } } break; case T_HASH: w_uclass(obj, cHash, arg); w_byte(TYPE_HASH, arg); w_long(RHASH(obj)->tbl->num_entries, arg); st_foreach(RHASH(obj)->tbl, hash_each, &c_arg); break; case T_STRUCT: w_byte(TYPE_STRUCT, arg); { int len = RSTRUCT(obj)->len; char *path = rb_class2name(CLASS_OF(obj)); VALUE mem; int i; w_unique(path, arg); w_long(len, arg); mem = rb_ivar_get(CLASS_OF(obj), rb_intern("__member__")); if (mem == Qnil) { Fatal("non-initialized struct"); } for (i=0; iptr[i]), arg); w_object(RSTRUCT(obj)->ptr[i], arg, limit); } } break; case T_OBJECT: w_byte(TYPE_OBJECT, arg); { VALUE klass = CLASS_OF(obj); char *path; if (FL_TEST(klass, FL_SINGLETON)) { TypeError("singleton can't be dumped"); } path = rb_class2name(klass); w_unique(path, arg); if (ROBJECT(obj)->iv_tbl) { w_long(ROBJECT(obj)->iv_tbl->num_entries, arg); st_foreach(ROBJECT(obj)->iv_tbl, obj_each, &c_arg); } else { w_long(0, arg); } } break; default: TypeError("can't dump %s", rb_class2name(CLASS_OF(obj))); break; } } } static VALUE dump(arg) struct dump_call_arg *arg; { w_object(arg->obj, arg->arg, arg->limit); return 0; } static VALUE dump_ensure(arg) struct dump_arg *arg; { st_free_table(arg->symbol); st_free_table(arg->data); return 0; } static VALUE marshal_dump(argc, argv) int argc; VALUE* argv; { VALUE obj, port, a1, a2; int limit = -1; struct dump_arg arg; struct dump_call_arg c_arg; port = 0; rb_scan_args(argc, argv, "12", &obj, &a1, &a2); if (argc == 3) { limit = NUM2INT(a2); port = a1; } else if (argc == 2) { if (FIXNUM_P(a1)) limit = FIX2INT(a1); else port = a1; } if (port) { if (obj_is_kind_of(port, cIO)) { OpenFile *fptr; io_binmode(port); GetOpenFile(port, fptr); io_writable(fptr); arg.fp = (fptr->f2) ? fptr->f2 : fptr->f; } else { TypeError("instance of IO needed"); } } else { arg.fp = 0; port = str_new(0, 0); arg.str = port; } arg.symbol = st_init_numtable(); arg.data = st_init_numtable(); c_arg.obj = obj; c_arg.arg = &arg; c_arg.limit = limit; w_byte(MARSHAL_MAJOR, &arg); w_byte(MARSHAL_MINOR, &arg); rb_ensure(dump, (VALUE)&c_arg, dump_ensure, (VALUE)&arg); return port; } struct load_arg { FILE *fp; char *ptr, *end; st_table *symbol; st_table *data; VALUE proc; }; static int r_byte(arg) struct load_arg *arg; { if (arg->fp) return getc(arg->fp); if (arg->ptr < arg->end) return *(unsigned char*)arg->ptr++; return EOF; } static unsigned short r_short(arg) struct load_arg *arg; { unsigned short x; int i; x = 0; for (i=0; i 0) { if (c > sizeof(long)) long_toobig((int)c); x = 0; for (i=0;i sizeof(long)) long_toobig((int)c); x = -1; for (i=0;ifp) { len = fread(s, 1, len, arg->fp); } else { if (arg->ptr + len > arg->end) { len = arg->end - arg->ptr; } memcpy(s, arg->ptr, len); arg->ptr += len; } s[len] = '\0'; } static ID r_symbol(arg) struct load_arg *arg; { char *buf; ID id; if (r_byte(arg) == TYPE_SYMLINK) { int num = r_long(arg); if (st_lookup(arg->symbol, num, &id)) { return id; } TypeError("bad symbol"); } r_bytes(buf, arg); id = rb_intern(buf); st_insert(arg->symbol, arg->symbol->num_entries, id); return id; } static char* r_unique(arg) struct load_arg *arg; { return rb_id2name(r_symbol(arg)); } static VALUE r_string(arg) struct load_arg *arg; { char *buf; int len; r_bytes2(buf, len, arg); return str_taint(str_new(buf, len)); } static VALUE r_regist(v, arg) VALUE v; struct load_arg *arg; { if (arg->proc) { rb_funcall(arg->proc, rb_intern("call"), 1, v); } st_insert(arg->data, arg->data->num_entries, v); return v; } static VALUE r_object(arg) struct load_arg *arg; { VALUE v; int type = r_byte(arg); switch (type) { case EOF: eof_error(); return Qnil; case TYPE_LINK: if (st_lookup(arg->data, r_long(arg), &v)) { return v; } ArgError("dump format error (unlinked)"); break; case TYPE_UCLASS: { VALUE c = rb_path2class(r_unique(arg)); v = r_object(arg); if (rb_special_const_p(v)) { ArgError("dump format error (user class)"); } RBASIC(v)->klass = c; return v; } case TYPE_NIL: return Qnil; case TYPE_TRUE: return TRUE; case TYPE_FALSE: return FALSE; case TYPE_FIXNUM: { int i = r_long(arg); return INT2FIX(i); } case TYPE_FLOAT: { #ifndef atof double atof(); #endif char *buf; r_bytes(buf, arg); v = float_new(atof(buf)); return r_regist(v, arg); } case TYPE_BIGNUM: { int len; unsigned short *digits; NEWOBJ(big, struct RBignum); OBJSETUP(big, cBignum, T_BIGNUM); big->sign = (r_byte(arg) == '+'); big->len = len = r_long(arg); big->digits = digits = ALLOC_N(unsigned short, len); while (len--) { *digits++ = r_short(arg); } big = RBIGNUM(big_norm((VALUE)big)); if (TYPE(big) == T_BIGNUM) { r_regist((VALUE)big, arg); } return (VALUE)big; } case TYPE_STRING: return r_regist(r_string(arg), arg); case TYPE_REGEXP: { char *buf; int len; int options; r_bytes2(buf, len, arg); options = r_byte(arg); return r_regist(reg_new(buf, len, options), arg); } case TYPE_ARRAY: { volatile int len = r_long(arg); v = ary_new2(len); r_regist(v, arg); while (len--) { ary_push(v, r_object(arg)); } return v; } case TYPE_HASH: { int len = r_long(arg); v = hash_new(); r_regist(v, arg); while (len--) { VALUE key = r_object(arg); VALUE value = r_object(arg); hash_aset(v, key, value); } return v; } case TYPE_STRUCT: { VALUE klass, mem, values; volatile int i; /* gcc 2.7.2.3 -O2 bug?? */ int len; ID slot; klass = rb_path2class(r_unique(arg)); mem = rb_ivar_get(klass, rb_intern("__member__")); if (mem == Qnil) { Fatal("non-initialized struct"); } len = r_long(arg); values = ary_new2(len); for (i=0; iptr[i] != INT2FIX(slot)) { TypeError("struct %s not compatible (:%s for :%s)", rb_class2name(klass), rb_id2name(slot), rb_id2name(FIX2INT(RARRAY(mem)->ptr[i]))); } struct_aset(v, INT2FIX(i), r_object(arg)); } return v; } break; case TYPE_USERDEF: { VALUE klass; klass = rb_path2class(r_unique(arg)); if (rb_respond_to(klass, s_load)) { v = rb_funcall(klass, s_load, 1, r_string(arg)); return r_regist(v, arg); } TypeError("class %s needs to have method `_load'", rb_class2name(klass)); } break; case TYPE_OBJECT: { VALUE klass; int len; klass = rb_path2class(r_unique(arg)); len = r_long(arg); v = obj_alloc(klass); r_regist(v, arg); if (len > 0) { while (len--) { ID id = r_symbol(arg); VALUE val = r_object(arg); rb_ivar_set(v, id, val); } } return v; } break; case TYPE_MODULE: { char *buf; r_bytes(buf, arg); return rb_path2class(buf); } default: ArgError("dump format error(0x%x)", type); break; } } static VALUE load(arg) struct load_arg *arg; { return r_object(arg); } static VALUE load_ensure(arg) struct load_arg *arg; { st_free_table(arg->symbol); st_free_table(arg->data); return 0; } static VALUE marshal_load(argc, argv) int argc; VALUE *argv; { VALUE port, proc; int major; VALUE v; OpenFile *fptr; struct load_arg arg; rb_scan_args(argc, argv, "11", &port, &proc); if (obj_is_kind_of(port, cIO)) { io_binmode(port); GetOpenFile(port, fptr); io_readable(fptr); arg.fp = fptr->f; } else if (rb_respond_to(port, rb_intern("to_str"))) { int len; arg.fp = 0; arg.ptr = str2cstr(port, &len); arg.end = arg.ptr + RSTRING(port)->len; } else { TypeError("instance of IO needed"); } major = r_byte(&arg); if (major == MARSHAL_MAJOR) { if (r_byte(&arg) != MARSHAL_MINOR) { Warn("Old marshal file format (can be read)"); } arg.symbol = st_init_numtable(); arg.data = st_init_numtable(); if (NIL_P(proc)) arg.proc = 0; else arg.proc = proc; v = rb_ensure(load, (VALUE)&arg, load_ensure, (VALUE)&arg); } else { TypeError("Old marshal file format (can't read)"); } return v; } void Init_marshal() { VALUE mMarshal = rb_define_module("Marshal"); s_dump = rb_intern("_dump"); s_load = rb_intern("_load"); rb_define_module_function(mMarshal, "dump", marshal_dump, -1); rb_define_module_function(mMarshal, "load", marshal_load, -1); rb_define_module_function(mMarshal, "restore", marshal_load, 1); rb_provide("marshal.o"); /* for backward compatibility */ } ruby-1.2.3/math.c100644 774 145 5271 6532175171 11644 0ustar matzNaCl/************************************************ math.c - $Author: matz $ $Date: 1998/05/25 04:57:42 $ created at: Tue Jan 25 14:12:56 JST 1994 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include VALUE mMath; #define Need_Float(x) (x) = rb_Float(x) #define Need_Float2(x,y) {\ Need_Float(x);\ Need_Float(y);\ } static VALUE math_atan2(obj, x, y) VALUE obj, x, y; { Need_Float2(x, y); return float_new(atan2(RFLOAT(x)->value, RFLOAT(y)->value)); } static VALUE math_cos(obj, x) VALUE obj, x; { Need_Float(x); return float_new(cos(RFLOAT(x)->value)); } static VALUE math_sin(obj, x) VALUE obj, x; { Need_Float(x); return float_new(sin(RFLOAT(x)->value)); } static VALUE math_tan(obj, x) VALUE obj, x; { Need_Float(x); return float_new(tan(RFLOAT(x)->value)); } static VALUE math_exp(obj, x) VALUE obj, x; { Need_Float(x); return float_new(exp(RFLOAT(x)->value)); } static VALUE math_log(obj, x) VALUE obj, x; { Need_Float(x); return float_new(log(RFLOAT(x)->value)); } static VALUE math_log10(obj, x) VALUE obj, x; { Need_Float(x); return float_new(log10(RFLOAT(x)->value)); } static VALUE math_sqrt(obj, x) VALUE obj, x; { Need_Float(x); if (RFLOAT(x)->value < 0.0) ArgError("square root for negative number"); return float_new(sqrt(RFLOAT(x)->value)); } static VALUE math_frexp(obj, x) VALUE obj, x; { double d; int exp; Need_Float(x); d = frexp(RFLOAT(x)->value, &exp); return assoc_new(float_new(d), INT2NUM(exp)); } static VALUE math_ldexp(obj, x, n) VALUE obj, x, n; { double d; Need_Float(x); return float_new(d = ldexp(RFLOAT(x)->value, NUM2INT(n))); } void Init_Math() { mMath = rb_define_module("Math"); #ifdef M_PI rb_define_const(mMath, "PI", float_new(M_PI)); #else rb_define_const(mMath, "PI", float_new(atan(1.0)*4.0)); #endif #ifdef M_E rb_define_const(mMath, "E", float_new(M_E)); #else rb_define_const(mMath, "E", float_new(exp(1.0))); #endif rb_define_module_function(mMath, "atan2", math_atan2, 2); rb_define_module_function(mMath, "cos", math_cos, 1); rb_define_module_function(mMath, "sin", math_sin, 1); rb_define_module_function(mMath, "tan", math_tan, 1); rb_define_module_function(mMath, "exp", math_exp, 1); rb_define_module_function(mMath, "log", math_log, 1); rb_define_module_function(mMath, "log10", math_log10, 1); rb_define_module_function(mMath, "sqrt", math_sqrt, 1); rb_define_module_function(mMath, "frexp", math_frexp, 1); rb_define_module_function(mMath, "ldexp", math_ldexp, 2); } ruby-1.2.3/mkconfig.rb100644 774 145 3574 6607013247 12673 0ustar matzNaCl#!./miniruby require File.dirname($0)+"/lib/ftools" rbconfig_rb = ARGV[0] || 'rbconfig.rb' File.makedirs(File.dirname(rbconfig_rb), true) version = VERSION config = open(rbconfig_rb, "w") $stdout.reopen(config) fast = {'prefix'=>TRUE, 'INSTALL'=>TRUE, 'binsuffix'=>TRUE} print %[ module Config VERSION == "#{version}" or raise "ruby lib version (#{version}) doesn't match executable version (\#{VERSION})" # This file was created by configrb when ruby was built. Any changes # made to this file will be lost the next time ruby is built. ] print " CONFIG = {}\n" v_fast = [] v_others = [] File.foreach "config.status" do |$_| next if /^#/ if /^s%@program_transform_name@%s,(.*)%g$/ ptn = $1.sub(/\$\$/, '$').split(/,/) v_fast << " CONFIG[\"ruby_install_name\"] = \"" + "ruby".sub(ptn[0],ptn[1]) + "\"\n" elsif /^s%@(\w+)@%(.*)%g/ name = $1 val = $2 || "" next if name =~ /^(INSTALL|DEFS|configure_input|srcdir|top_srcdir)$/ v = " CONFIG[\"" + name + "\"] = " + val.sub(/^\s*(.*)\s*$/, '"\1"').gsub(/\$[{(]?([^})]+)[})]?/) { "\#{CONFIG[\\\"#{$1}\\\"]}" } + "\n" if fast[name] v_fast << v else v_others << v end if /DEFS/ val.split(/\s*-D/).each do |i| if i =~ /(.*)=(\\")?([^\\]*)(\\")?/ key, val = $1, $3 if val == '1' val = "TRUE" else val.sub! /^\s*(.*)\s*$/, '"\1"' end print " CONFIG[\"#{key}\"] = #{val}\n" end end end elsif /^ac_given_srcdir=(.*)/ path = $1 cwd = Dir.pwd begin Dir.chdir path v_fast << " CONFIG[\"srcdir\"] = \"" + Dir.pwd + "\"\n" ensure Dir.chdir cwd end elsif /^ac_given_INSTALL=(.*)/ v_fast << " CONFIG[\"INSTALL\"] = " + $1 + "\n" end # break if /^CEOF/ end print v_fast, v_others Dir.chdir File.dirname($0) print " CONFIG[\"compile_dir\"] = \"#{Dir.pwd}\"\n" print "end\n" config.close # vi:set sw=2: ruby-1.2.3/node.h100644 774 145 22511 6551100761 11653 0ustar matzNaCl/************************************************ node.h - $Author: matz $ $Date: 1998/07/09 08:40:17 $ created at: Fri May 28 15:14:02 JST 1993 Copyright (C) 1993-1998 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_OPT_N, NODE_WHILE, NODE_UNTIL, NODE_ITER, NODE_FOR, NODE_BREAK, NODE_NEXT, NODE_REDO, NODE_RETRY, NODE_BEGIN, NODE_RESCUE, NODE_RESBODY, NODE_ENSURE, NODE_AND, NODE_OR, NODE_NOT, NODE_MASGN, NODE_LASGN, NODE_DASGN, NODE_DASGN_PUSH, NODE_GASGN, NODE_IASGN, NODE_CASGN, NODE_OP_ASGN1, NODE_OP_ASGN2, NODE_OP_ASGN_AND, NODE_OP_ASGN_OR, NODE_CALL, NODE_FCALL, NODE_VCALL, NODE_SUPER, NODE_ZSUPER, NODE_ARRAY, NODE_ZARRAY, NODE_HASH, NODE_RETURN, NODE_YIELD, NODE_LVAR, NODE_DVAR, NODE_GVAR, NODE_IVAR, NODE_CVAR, NODE_NTH_REF, NODE_BACK_REF, NODE_MATCH_REF, NODE_LASTLINE, NODE_MATCH, NODE_MATCH2, NODE_MATCH3, NODE_LIT, NODE_STR, NODE_DSTR, NODE_XSTR, NODE_DXSTR, NODE_EVSTR, NODE_DREGX, NODE_DREGX_ONCE, NODE_ARGS, NODE_BLOCK_ARG, NODE_BLOCK_PASS, NODE_DEFN, NODE_DEFS, NODE_ALIAS, NODE_VALIAS, NODE_UNDEF, NODE_CLASS, NODE_MODULE, NODE_SCLASS, NODE_COLON2, NODE_COLON3, NODE_CNAME, NODE_CREF, NODE_DOT2, NODE_DOT3, NODE_FLIP2, NODE_FLIP3, NODE_ATTRSET, NODE_SELF, NODE_NIL, NODE_TRUE, NODE_FALSE, NODE_DEFINED, NODE_TAG, NODE_NEWLINE, NODE_POSTEXE, #ifdef C_ALLOCA NODE_ALLOCA, #endif }; typedef struct RNode { unsigned long flags; char *nd_file; union { struct RNode *node; ID id; VALUE value; VALUE (*cfunc)(); ID *tbl; } u1; union { struct RNode *node; ID id; int argc; VALUE value; } 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>>FL_USHIFT)&0xff) #define nd_set_type(n,t) \ RNODE(n)->flags=((RNODE(n)->flags&~FL_UMASK)|(((t)<flags>>18)&0x3fff) #define nd_set_line(n,l) \ RNODE(n)->flags=((RNODE(n)->flags&~(-1<<18))|(((l)&0x7fff)<<18)) #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_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_opt u1.node #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.node #define nd_modl u1.id #define nd_clss u1.value #define nd_beg u1.node #define nd_end u2.node #define nd_state u3.state #define nd_rval u3.value #define nd_nth u2.argc #define nd_tag u1.id #define nd_tlev u3.cnt #define nd_tval u2.value #define NEW_METHOD(n,x) node_newnode(NODE_METHOD,x,n,0) #define NEW_FBODY(n,i,o) node_newnode(NODE_FBODY,n,i,o) #define NEW_DEFN(i,a,d,p) node_newnode(NODE_DEFN,p,i,NEW_RFUNC(a,d)) #define NEW_DEFS(r,i,a,d) node_newnode(NODE_DEFS,r,i,NEW_RFUNC(a,d)) #define NEW_CFUNC(f,c) node_newnode(NODE_CFUNC,f,c,0) #define NEW_RFUNC(b1,b2) NEW_SCOPE(block_append(b1,b2)) #define NEW_SCOPE(b) node_newnode(NODE_SCOPE,local_tbl(),(b),cur_cref) #define NEW_BLOCK(a) node_newnode(NODE_BLOCK,a,0,0) #define NEW_IF(c,t,e) node_newnode(NODE_IF,c,t,e) #define NEW_UNLESS(c,t,e) node_newnode(NODE_IF,c,e,t) #define NEW_CASE(h,b) node_newnode(NODE_CASE,h,b,0) #define NEW_WHEN(c,t,e) node_newnode(NODE_WHEN,c,t,e) #define NEW_OPT_N(b) node_newnode(NODE_OPT_N,0,b,0) #define NEW_WHILE(c,b,n) node_newnode(NODE_WHILE,c,b,n) #define NEW_UNTIL(c,b,n) node_newnode(NODE_UNTIL,c,b,n) #define NEW_FOR(v,i,b) node_newnode(NODE_FOR,v,b,i) #define NEW_ITER(v,i,b) node_newnode(NODE_ITER,v,b,i) #define NEW_BREAK() node_newnode(NODE_BREAK,0,0,0) #define NEW_NEXT() node_newnode(NODE_NEXT,0,0,0) #define NEW_REDO() node_newnode(NODE_REDO,0,0,0) #define NEW_RETRY() node_newnode(NODE_RETRY,0,0,0) #define NEW_BEGIN(b) node_newnode(NODE_BEGIN,0,b,0) #define NEW_RESCUE(b,res) node_newnode(NODE_RESCUE,b,res,0) #define NEW_RESBODY(a,ex,n) node_newnode(NODE_RESBODY,n,ex,a) #define NEW_ENSURE(b,en) node_newnode(NODE_ENSURE,b,0,en) #define NEW_RET(s) node_newnode(NODE_RETURN,s,0,0) #define NEW_YIELD(a) node_newnode(NODE_YIELD,a,0,0) #define NEW_LIST(a) NEW_ARRAY(a) #define NEW_ARRAY(a) node_newnode(NODE_ARRAY,a,1,0) #define NEW_ZARRAY() node_newnode(NODE_ZARRAY,0,0,0) #define NEW_HASH(a) node_newnode(NODE_HASH,a,0,0) #define NEW_NOT(a) node_newnode(NODE_NOT,0,a,0) #define NEW_MASGN(l,r) node_newnode(NODE_MASGN,l,0,r) #define NEW_GASGN(v,val) node_newnode(NODE_GASGN,v,val,rb_global_entry(v)) #define NEW_LASGN(v,val) node_newnode(NODE_LASGN,v,val,local_cnt(v)) #define NEW_DASGN(v,val) node_newnode(NODE_DASGN,v,val,0); #define NEW_DASGN_PUSH(v,val) node_newnode(NODE_DASGN_PUSH,v,val,0); #define NEW_IASGN(v,val) node_newnode(NODE_IASGN,v,val,0) #define NEW_CASGN(v,val) node_newnode(NODE_CASGN,v,val,0) #define NEW_OP_ASGN1(p,id,a) node_newnode(NODE_OP_ASGN1,p,id,a) #define NEW_OP_ASGN2(r,i,o,val) node_newnode(NODE_OP_ASGN2,r,val,NEW_OP_ASGN22(i,o)) #define NEW_OP_ASGN22(i,o) node_newnode(NODE_OP_ASGN2,i,o,id_attrset(i)) #define NEW_OP_ASGN_OR(i,val) node_newnode(NODE_OP_ASGN_OR,i,val,0) #define NEW_OP_ASGN_AND(i,val) node_newnode(NODE_OP_ASGN_AND,i,val,0) #define NEW_GVAR(v) node_newnode(NODE_GVAR,v,0,rb_global_entry(v)) #define NEW_LVAR(v) node_newnode(NODE_LVAR,v,0,local_cnt(v)) #define NEW_DVAR(v) node_newnode(NODE_DVAR,v,0,0); #define NEW_IVAR(v) node_newnode(NODE_IVAR,v,0,0) #define NEW_CVAR(v) node_newnode(NODE_CVAR,v,0,0) #define NEW_NTH_REF(n) node_newnode(NODE_NTH_REF,0,n,local_cnt('~')) #define NEW_BACK_REF(n) node_newnode(NODE_BACK_REF,0,n,local_cnt('~')) #define NEW_MATCH(c) node_newnode(NODE_MATCH,c,0,0) #define NEW_MATCH2(n1,n2) node_newnode(NODE_MATCH2,n1,n2,0) #define NEW_MATCH3(r,n2) node_newnode(NODE_MATCH3,r,n2,0) #define NEW_LIT(l) node_newnode(NODE_LIT,l,0,0) #define NEW_STR(s) node_newnode(NODE_STR,s,0,0) #define NEW_DSTR(s) node_newnode(NODE_DSTR,s,0,0) #define NEW_XSTR(s) node_newnode(NODE_XSTR,s,0,0) #define NEW_DXSTR(s) node_newnode(NODE_DXSTR,s,0,0) #define NEW_EVSTR(s,l) node_newnode(NODE_EVSTR,str_new(s,l),0,0) #define NEW_CALL(r,m,a) node_newnode(NODE_CALL,r,m,a) #define NEW_FCALL(m,a) node_newnode(NODE_FCALL,0,m,a) #define NEW_VCALL(m) node_newnode(NODE_VCALL,0,m,0) #define NEW_SUPER(a) node_newnode(NODE_SUPER,0,0,a) #define NEW_ZSUPER() node_newnode(NODE_ZSUPER,0,0,0) #define NEW_ARGS(f,o,r) node_newnode(NODE_ARGS,o,r,f) #define NEW_BLOCK_ARG(v) node_newnode(NODE_BLOCK_ARG,v,0,local_cnt(v)) #define NEW_BLOCK_PASS(b) node_newnode(NODE_BLOCK_PASS,0,b,0) #define NEW_ALIAS(n,o) node_newnode(NODE_ALIAS,0,n,o) #define NEW_VALIAS(n,o) node_newnode(NODE_VALIAS,0,n,o) #define NEW_UNDEF(i) node_newnode(NODE_UNDEF,0,i,0) #define NEW_CLASS(n,b,s) node_newnode(NODE_CLASS,n,NEW_CBODY(b),s) #define NEW_SCLASS(r,b) node_newnode(NODE_SCLASS,r,NEW_CBODY(b),0) #define NEW_MODULE(n,b) node_newnode(NODE_MODULE,n,NEW_CBODY(b),0) #define NEW_COLON2(c,i) node_newnode(NODE_COLON2,c,i,0) #define NEW_COLON3(i) node_newnode(NODE_COLON3,0,i,0) #define NEW_CREF0() (cur_cref=node_newnode(NODE_CREF,RNODE(the_frame->cbase)->nd_clss,0,0)) #define NEW_CREF() (cur_cref=node_newnode(NODE_CREF,0,0,cur_cref)) #define NEW_CBODY(b) (cur_cref->nd_body=NEW_SCOPE(b),cur_cref) #define NEW_DOT2(b,e) node_newnode(NODE_DOT2,b,e,0) #define NEW_DOT3(b,e) node_newnode(NODE_DOT3,b,e,0) #define NEW_ATTRSET(a) node_newnode(NODE_ATTRSET,a,0,0) #define NEW_SELF() node_newnode(NODE_SELF,0,0,0) #define NEW_NIL() node_newnode(NODE_NIL,0,0,0) #define NEW_TRUE() node_newnode(NODE_TRUE,0,0,0) #define NEW_FALSE() node_newnode(NODE_FALSE,0,0,0) #define NEW_DEFINED(e) node_newnode(NODE_DEFINED,e,0,0) #define NEW_NEWLINE(n) node_newnode(NODE_NEWLINE,0,0,n) #define NEW_PREEXE(b) NEW_SCOPE(b) #define NEW_POSTEXE() node_newnode(NODE_POSTEXE,0,0,0) NODE *node_newnode(); VALUE rb_method_booundp(); #define NOEX_PUBLIC 0 #define NOEX_UNDEF 1 #define NOEX_CFUNC 1 #define NOEX_PRIVATE 2 #define NOEX_PROTECTED 4 NODE *compile_string _((char *, char *, int)); NODE *compile_file _((char *, VALUE, int)); void rb_add_method _((VALUE, ID, NODE *, int)); NODE *node_newnode(); enum node_type nodetype _((NODE *)); int nodeline _((NODE *)); struct global_entry *rb_global_entry _((ID)); VALUE rb_gvar_get _((struct global_entry *)); VALUE rb_gvar_set _((struct global_entry *, VALUE)); VALUE rb_gvar_defined _((struct global_entry *)); #endif ruby-1.2.3/numeric.c100644 774 145 61423 6553044143 12373 0ustar matzNaCl/************************************************ numeric.c - $Author: matz $ $Date: 1998/07/15 06:12:51 $ created at: Fri Aug 13 18:33:09 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include #include static ID coerce; static ID to_i; VALUE cNumeric; VALUE cFloat; VALUE cInteger; VALUE cFixnum; VALUE eZeroDiv; ID rb_frame_last_func(); VALUE float_new(); double big2dbl(); void num_zerodiv() { Raise(eZeroDiv, "divided by 0"); } static VALUE num_coerce(x, y) VALUE x, y; { if (CLASS_OF(x) == CLASS_OF(y)) return assoc_new(x, y); return assoc_new(rb_Float(x), rb_Float(y)); } static VALUE coerce_body(x) VALUE *x; { return rb_funcall(x[1], coerce, 1, x[0]); } static VALUE coerce_rescue(x) VALUE *x; { TypeError("%s can't be coerced into %s", rb_special_const_p(x[1])? STR2CSTR(rb_inspect(x[1])): rb_class2name(CLASS_OF(x[1])), rb_class2name(CLASS_OF(x[0]))); } static void do_coerce(x, y) VALUE *x, *y; { VALUE ary; VALUE a[2]; a[0] = *x; a[1] = *y; ary = rb_rescue(coerce_body, (VALUE)a, coerce_rescue, (VALUE)a); if (TYPE(ary) != T_ARRAY || RARRAY(ary)->len != 2) { TypeError("coerce must return [x, y]"); } *x = RARRAY(ary)->ptr[0]; *y = RARRAY(ary)->ptr[1]; } VALUE num_coerce_bin(x, y) VALUE x, y; { do_coerce(&x, &y); return rb_funcall(x, rb_frame_last_func(), 1, y); } static VALUE num_uplus(num) VALUE num; { return num; } static VALUE num_uminus(num) VALUE num; { VALUE zero; zero = INT2FIX(0); do_coerce(&zero, &num); return rb_funcall(zero, '-', 1, num); } static VALUE num_divmod(x, y) VALUE x, y; { VALUE div, mod; div = rb_funcall(x, '/', 1, y); if (TYPE(div) == T_FLOAT) { double d = floor(RFLOAT(div)->value); if (RFLOAT(div)->value > d) { div = float_new(d); } } mod = rb_funcall(x, '%', 1, y); return assoc_new(div, mod); } static VALUE num_int_p(num) VALUE num; { return FALSE; } static VALUE num_chr(num) VALUE num; { char c; long i = NUM2LONG(num); if (i < 0 || 0xff < i) Fail("%d out of char range", i); c = i; return str_new(&c, 1); } static VALUE num_abs(num) VALUE num; { if (RTEST(rb_funcall(num, '<', 1, INT2FIX(0)))) { return rb_funcall(num, rb_intern("-@"), 0); } return num; } static VALUE num_zero_p(num) VALUE num; { if (RTEST(rb_equal(num, INT2FIX(0)))) { return TRUE; } return FALSE; } static VALUE num_nonzero_p(num) VALUE num; { if (RTEST(rb_funcall(num, rb_intern("zero?"), 0, 0))) { return FALSE; } return num; } VALUE float_new(d) double d; { NEWOBJ(flt, struct RFloat); OBJSETUP(flt, cFloat, T_FLOAT); flt->value = d; return (VALUE)flt; } static VALUE flo_to_s(flt) VALUE flt; { char buf[32]; sprintf(buf, "%g", RFLOAT(flt)->value); if (strchr(buf, '.') == 0) { int len = strlen(buf); char *ind = strchr(buf, 'e'); if (ind) { memmove(ind+2, ind, len-(ind-buf)+1); ind[0] = '.'; ind[1] = '0'; } else { strcat(buf, ".0"); } } return str_new2(buf); } static VALUE flo_coerce(x, y) VALUE x, y; { return assoc_new(rb_Float(y), x); } static VALUE flo_uminus(flt) VALUE flt; { return float_new(-RFLOAT(flt)->value); } static VALUE flo_plus(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: return float_new(RFLOAT(x)->value + (double)FIX2LONG(y)); case T_BIGNUM: return float_new(RFLOAT(x)->value + big2dbl(y)); case T_FLOAT: return float_new(RFLOAT(x)->value + RFLOAT(y)->value); default: return num_coerce_bin(x, y); } } static VALUE flo_minus(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: return float_new(RFLOAT(x)->value - (double)FIX2LONG(y)); case T_BIGNUM: return float_new(RFLOAT(x)->value - big2dbl(y)); case T_FLOAT: return float_new(RFLOAT(x)->value - RFLOAT(y)->value); default: return num_coerce_bin(x, y); } } static VALUE flo_mul(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: return float_new(RFLOAT(x)->value * (double)FIX2LONG(y)); case T_BIGNUM: return float_new(RFLOAT(x)->value * big2dbl(y)); case T_FLOAT: return float_new(RFLOAT(x)->value * RFLOAT(y)->value); default: return num_coerce_bin(x, y); } } static VALUE flo_div(x, y) VALUE x, y; { long f_y; double d; switch (TYPE(y)) { case T_FIXNUM: f_y = FIX2LONG(y); if (f_y == 0) num_zerodiv(); return float_new(RFLOAT(x)->value / (double)f_y); case T_BIGNUM: d = big2dbl(y); if (d == 0.0) num_zerodiv(); return float_new(RFLOAT(x)->value / d); case T_FLOAT: if (RFLOAT(y)->value == 0.0) num_zerodiv(); return float_new(RFLOAT(x)->value / RFLOAT(y)->value); default: return num_coerce_bin(x, y); } } static VALUE flo_modulo(x, y, modulo) VALUE x, y; int modulo; { double value, result; switch (TYPE(y)) { case T_FIXNUM: value = (double)FIX2LONG(y); break; case T_BIGNUM: value = big2dbl(y); break; case T_FLOAT: value = RFLOAT(y)->value; break; default: return num_coerce_bin(x, y); } #ifdef HAVE_FMOD result = fmod(RFLOAT(x)->value, value); #else { double value1 = RFLOAT(x)->value; double value2; modf(value1/value, &value2); result = value1 - value2 * value; } #endif if (modulo && (RFLOAT(x)->value < 0.0) != (result < 0.0) && result != 0.0) { result += value; } return float_new(result); } static VALUE flo_mod(x, y) VALUE x, y; { return flo_modulo(x,y,1); } static VALUE flo_remainder(x, y) VALUE x, y; { return flo_modulo(x,y,0); } VALUE flo_pow(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: return float_new(pow(RFLOAT(x)->value, (double)FIX2LONG(y))); case T_BIGNUM: return float_new(pow(RFLOAT(x)->value, big2dbl(y))); case T_FLOAT: return float_new(pow(RFLOAT(x)->value, RFLOAT(y)->value)); default: return num_coerce_bin(x, y); } } static VALUE num_eql(x, y) VALUE x, y; { if (TYPE(x) != TYPE(y)) return FALSE; return rb_equal(x, y); } static VALUE num_equal(x, y) VALUE x, y; { return rb_equal(y, x); } static VALUE flo_eq(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: if (RFLOAT(x)->value == FIX2LONG(y)) return TRUE; return FALSE; case T_BIGNUM: return (RFLOAT(x)->value == big2dbl(y))?TRUE:FALSE; case T_FLOAT: return (RFLOAT(x)->value == RFLOAT(y)->value)?TRUE:FALSE; default: return num_equal(x, y); } } static VALUE flo_hash(num) VALUE num; { double d; char *c; int i, hash; d = RFLOAT(num)->value; c = (char*)&d; for (hash=0, i=0; ivalue; switch (TYPE(y)) { case T_FIXNUM: b = (double)FIX2LONG(y); break; case T_BIGNUM: b = big2dbl(y); break; case T_FLOAT: b = RFLOAT(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 flo_gt(x, y) VALUE x, y; { double a, b; a = RFLOAT(x)->value; switch (TYPE(y)) { case T_FIXNUM: b = (double)FIX2LONG(y); break; case T_BIGNUM: b = big2dbl(y); break; case T_FLOAT: b = RFLOAT(y)->value; break; default: return num_coerce_bin(x, y); } return (a > b)?TRUE:FALSE; } static VALUE flo_ge(x, y) VALUE x, y; { double a, b; a = RFLOAT(x)->value; switch (TYPE(y)) { case T_FIXNUM: b = (double)FIX2LONG(y); break; case T_BIGNUM: b = big2dbl(y); break; case T_FLOAT: b = RFLOAT(y)->value; break; default: return num_coerce_bin(x, y); } return (a >= b)?TRUE:FALSE; } static VALUE flo_lt(x, y) VALUE x, y; { double a, b; a = RFLOAT(x)->value; switch (TYPE(y)) { case T_FIXNUM: b = (double)FIX2LONG(y); break; case T_BIGNUM: b = big2dbl(y); break; case T_FLOAT: b = RFLOAT(y)->value; break; default: return num_coerce_bin(x, y); } return (a < b)?TRUE:FALSE; } static VALUE flo_le(x, y) VALUE x, y; { double a, b; a = RFLOAT(x)->value; switch (TYPE(y)) { case T_FIXNUM: b = (double)FIX2LONG(y); break; case T_BIGNUM: b = big2dbl(y); break; case T_FLOAT: b = RFLOAT(y)->value; break; default: return num_coerce_bin(x, y); } return (a <= b)?TRUE:FALSE; } static VALUE flo_eql(x, y) VALUE x, y; { if (TYPE(y) == T_FLOAT) { if (RFLOAT(x)->value == RFLOAT(y)->value) return TRUE; } return FALSE; } static VALUE flo_to_i(num) VALUE num; { double f = RFLOAT(num)->value; long val; if (!FIXABLE(f)) { return dbl2big(f); } val = f; return INT2FIX(val); } static VALUE flo_floor(num) VALUE num; { double f = floor(RFLOAT(num)->value); long val; if (!FIXABLE(f)) { return dbl2big(f); } val = f; return INT2FIX(val); } static VALUE flo_ceil(num) VALUE num; { double f = ceil(RFLOAT(num)->value); long val; if (!FIXABLE(f)) { return dbl2big(f); } val = f; return INT2FIX(val); } static VALUE flo_round(num) VALUE num; { double f = RFLOAT(num)->value; long val; if (f > 0.0) f = floor(f+0.5); if (f < 0.0) f = ceil(f-0.5); if (!FIXABLE(f)) { return dbl2big(f); } val = f; return INT2FIX(val); } static VALUE flo_to_f(num) VALUE num; { return num; } static VALUE flo_abs(flt) VALUE flt; { double val = fabs(RFLOAT(flt)->value); return float_new(val); } static VALUE flo_zero_p(num) VALUE num; { if (RFLOAT(num)->value == 0.0) { return TRUE; } return FALSE; } static VALUE to_integer(val) VALUE val; { return rb_funcall(val, to_i, 0); } static VALUE fail_to_integer(val) VALUE val; { TypeError("failed to convert %s into Integer", rb_class2name(CLASS_OF(val))); } long num2long(val) VALUE val; { if (NIL_P(val)) { TypeError("no implicit conversion from nil"); } switch (TYPE(val)) { case T_FIXNUM: return FIX2LONG(val); case T_FLOAT: if (RFLOAT(val)->value <= (double)LONG_MAX && RFLOAT(val)->value >= (double)LONG_MIN) { return (long)(RFLOAT(val)->value); } else { TypeError("float %g out of rang of integer", RFLOAT(val)->value); } case T_BIGNUM: return big2long(val); case T_STRING: TypeError("no implicit conversion from string"); return Qnil; /* not reached */ default: val = rb_rescue(to_integer, val, fail_to_integer, val); if (!obj_is_kind_of(val, cInteger)) { TypeError("`to_i' need to return integer"); } return NUM2LONG(val); } } unsigned long num2ulong(val) VALUE val; { if (TYPE(val) == T_BIGNUM) { return big2ulong(val); } return (unsigned long)num2long(val); } #if SIZEOF_INT < SIZEOF_LONG int num2int(val) VALUE val; { long num = num2long(val); if (num < INT_MIN || INT_MAX < num) { ArgError("integer %d too big to convert to `int'.", num); } return (int)num; } int fix2int(val) VALUE val; { long num = FIXNUM_P(val)?FIX2LONG(val):num2long(val); if (num < INT_MIN || INT_MAX < num) { ArgError("integer %d too big to convert to `int'.", num); } return (int)num; } #else int num2int(val) VALUE val; { return num2long(val); } int fix2int(val) VALUE val; { return FIX2INT(val); } #endif VALUE num2fix(val) VALUE val; { long v; if (FIXNUM_P(val)) return val; v = num2long(val); if (!FIXABLE(v)) Fail("integer %d out of range of fixnum", v); return INT2FIX(v); } static VALUE int_int_p(num) VALUE num; { return TRUE; } static VALUE int_succ(num) VALUE num; { return rb_funcall(num, '+', 1, INT2FIX(1)); } static VALUE fix_uminus(num) VALUE num; { return int2inum(-FIX2LONG(num)); } VALUE fix2str(x, base) VALUE x; int base; { char fmt[4], buf[22]; fmt[0] = '%'; fmt[1] = 'l'; fmt[3] = '\0'; if (base == 10) fmt[2] = 'd'; else if (base == 16) fmt[2] = 'x'; else if (base == 8) fmt[2] = 'o'; else Fatal("fixnum cannot treat base %d", base); sprintf(buf, fmt, FIX2LONG(x)); return str_new2(buf); } VALUE fix_to_s(in) VALUE in; { return fix2str(in, 10); } static VALUE fix_plus(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: { long a, b, c; VALUE r; a = FIX2LONG(x); b = FIX2LONG(y); c = a + b; r = INT2FIX(c); if (FIX2LONG(r) != c) { r = big_plus(int2big(a), int2big(b)); } return r; } case T_FLOAT: return float_new((double)FIX2LONG(x) + RFLOAT(y)->value); default: return num_coerce_bin(x, y); } } static VALUE fix_minus(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: { long a, b, c; VALUE r; a = FIX2LONG(x); b = FIX2LONG(y); c = a - b; r = INT2FIX(c); if (FIX2LONG(r) != c) { r = big_minus(int2big(a), int2big(b)); } return r; } case T_FLOAT: return float_new((double)FIX2LONG(x) - RFLOAT(y)->value); default: return num_coerce_bin(x, y); } } static VALUE fix_mul(x, y) VALUE x, y; { switch (TYPE(y)) { case T_FIXNUM: { long a, b, c; VALUE r; a = FIX2LONG(x); if (a == 0) return x; b = FIX2LONG(y); c = a * b; r = INT2FIX(c); if (FIX2LONG(r) != c || c/a != b) { r = big_mul(int2big(a), int2big(b)); } return r; } case T_FLOAT: return float_new((double)FIX2LONG(x) * RFLOAT(y)->value); default: return num_coerce_bin(x, y); } } static VALUE fix_div(x, y) VALUE x, y; { long i; if (TYPE(y) == T_FIXNUM) { i = FIX2LONG(y); if (i == 0) num_zerodiv(); i = FIX2LONG(x)/i; return INT2FIX(i); } return num_coerce_bin(x, y); } static VALUE fix_modulo(x, y, modulo) VALUE x, y; { long i; if (TYPE(y) == T_FIXNUM) { i = FIX2LONG(y); if (i == 0) num_zerodiv(); i = FIX2LONG(x)%i; if (modulo && (FIX2LONG(x) < 0) != (FIX2LONG(y) < 0) && i != 0) { i += FIX2LONG(y); } return INT2FIX(i); } return num_coerce_bin(x, y); } static VALUE fix_mod(x, y) VALUE x, y; { return fix_modulo(x, y, 1); } static VALUE fix_remainder(x, y) VALUE x, y; { return fix_modulo(x, y, 0); } static VALUE fix_pow(x, y) VALUE x, y; { if (FIXNUM_P(y)) { long a, b; b = FIX2LONG(y); if (b == 0) return INT2FIX(1); a = FIX2LONG(x); if (b > 0) { return big_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 fix_equal(x, y) VALUE x, y; { if (FIXNUM_P(y)) { return (FIX2LONG(x) == FIX2LONG(y))?TRUE:FALSE; } else { return num_equal(x, y); } } static VALUE fix_cmp(x, y) VALUE x, y; { if (FIXNUM_P(y)) { long a = FIX2LONG(x), b = FIX2LONG(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 fix_gt(x, y) VALUE x, y; { if (FIXNUM_P(y)) { long a = FIX2LONG(x), b = FIX2LONG(y); if (a > b) return TRUE; return FALSE; } else { return num_coerce_bin(x, y); } } static VALUE fix_ge(x, y) VALUE x, y; { if (FIXNUM_P(y)) { long a = FIX2LONG(x), b = FIX2LONG(y); if (a >= b) return TRUE; return FALSE; } else { return num_coerce_bin(x, y); } } static VALUE fix_lt(x, y) VALUE x, y; { if (FIXNUM_P(y)) { long a = FIX2LONG(x), b = FIX2LONG(y); if (a < b) return TRUE; return FALSE; } else { return num_coerce_bin(x, y); } } static VALUE fix_le(x, y) VALUE x, y; { if (FIXNUM_P(y)) { long a = FIX2LONG(x), b = FIX2LONG(y); if (a <= b) return TRUE; return FALSE; } else { return num_coerce_bin(x, y); } } static VALUE fix_rev(num) VALUE num; { unsigned long val = FIX2UINT(num); val = ~val; return int2inum(val); } static VALUE fix_and(x, y) VALUE x, y; { long val; if (TYPE(y) == T_BIGNUM) { return big_and(y, x); } val = FIX2LONG(x) & NUM2LONG(y); return int2inum(val); } static VALUE fix_or(x, y) VALUE x, y; { long val; if (TYPE(y) == T_BIGNUM) { return big_or(y, x); } val = FIX2LONG(x) | NUM2LONG(y); return int2inum(val); } static VALUE fix_xor(x, y) VALUE x, y; { long val; if (TYPE(y) == T_BIGNUM) { return big_xor(y, x); } val = FIX2LONG(x) ^ NUM2LONG(y); return int2inum(val); } static VALUE fix_lshift(x, y) VALUE x, y; { long val; int width; val = NUM2LONG(x); width = NUM2INT(y); if (width > (sizeof(VALUE)*CHAR_BIT-1) || ((unsigned long)val)>>(sizeof(VALUE)*CHAR_BIT-1-width) > 0) { return big_lshift(int2big(val), y); } val = val << width; return int2inum(val); } static VALUE fix_rshift(x, y) VALUE x, y; { long i, val; i = NUM2LONG(y); if (i < sizeof(long) * 8) { val = RSHIFT(FIX2LONG(x), i); return INT2FIX(val); } return INT2FIX(0); } static VALUE fix_aref(fix, idx) VALUE fix, idx; { unsigned long val = FIX2LONG(fix); int i = FIX2LONG(idx); if (i < 0 || sizeof(VALUE)*CHAR_BIT-1 < i) return INT2FIX(0); if (val & (1<', 1, to))) break; rb_yield(i); i = rb_funcall(i, '+', 1, INT2FIX(1)); } return from; } static VALUE num_downto(from, to) VALUE from, to; { VALUE i = from; for (;;) { if (RTEST(rb_funcall(i, '<', 1, to))) break; rb_yield(i); i = rb_funcall(i, '-', 1, INT2FIX(1)); } return from; } static VALUE num_step(from, to, step) VALUE from, to, step; { VALUE i = from; ID cmp; if (step == INT2FIX(0)) { ArgError("step cannot be 0"); } if (RTEST(rb_funcall(step, '>', 1, INT2FIX(0)))) { cmp = '>'; } else { cmp = '<'; } for (;;) { if (RTEST(rb_funcall(i, cmp, 1, to))) break; rb_yield(i); i = rb_funcall(i, '+', 1, step); } return from; } static VALUE num_dotimes(num) VALUE num; { VALUE i = INT2FIX(0); for (;;) { if (!RTEST(rb_funcall(i, '<', 1, num))) break; rb_yield(i); i = rb_funcall(i, '+', 1, INT2FIX(1)); } return num; } VALUE fix_upto(from, to) VALUE from, to; { long i, end; if (!FIXNUM_P(to)) return num_upto(from, to); end = FIX2LONG(to); for (i = FIX2LONG(from); i <= end; i++) { rb_yield(INT2FIX(i)); } return from; } static VALUE fix_downto(from, to) VALUE from, to; { long i, end; if (!FIXNUM_P(to)) return num_downto(from, to); end = FIX2LONG(to); for (i=FIX2LONG(from); i >= end; i--) { rb_yield(INT2FIX(i)); } return from; } static VALUE fix_step(from, to, step) VALUE from, to, step; { long i, end, diff; if (!FIXNUM_P(to) || !FIXNUM_P(step)) return num_step(from, to, step); end = FIX2LONG(to); diff = FIX2LONG(step); if (diff == 0) { ArgError("step cannot be 0"); } else if (diff > 0) { for (i=FIX2LONG(from); i <= end; i+=diff) { rb_yield(INT2FIX(i)); } } else { for (i=FIX2LONG(from); i >= end; i+=diff) { rb_yield(INT2FIX(i)); } } return from; } static VALUE fix_dotimes(num) VALUE num; { long i, end; end = FIX2LONG(num); for (i=0; i", fix_cmp, 1); rb_define_method(cFixnum, ">", fix_gt, 1); rb_define_method(cFixnum, ">=", fix_ge, 1); rb_define_method(cFixnum, "<", fix_lt, 1); rb_define_method(cFixnum, "<=", fix_le, 1); rb_define_method(cFixnum, "~", fix_rev, 0); rb_define_method(cFixnum, "&", fix_and, 1); rb_define_method(cFixnum, "|", fix_or, 1); rb_define_method(cFixnum, "^", fix_xor, 1); rb_define_method(cFixnum, "[]", fix_aref, 1); rb_define_method(cFixnum, "<<", fix_lshift, 1); rb_define_method(cFixnum, ">>", fix_rshift, 1); rb_define_method(cFixnum, "to_i", fix_to_i, 0); rb_define_method(cFixnum, "to_f", fix_to_f, 0); rb_define_method(cFixnum, "succ", fix_succ, 0); rb_define_method(cFixnum, "next", fix_succ, 0); rb_define_method(cFixnum, "size", fix_size, 0); rb_define_method(cFixnum, "upto", fix_upto, 1); rb_define_method(cFixnum, "downto", fix_downto, 1); rb_define_method(cFixnum, "step", fix_step, 2); rb_define_method(cFixnum, "times", fix_dotimes, 0); rb_define_method(cFixnum, "zero?", fix_zero_p, 0); cFloat = rb_define_class("Float", cNumeric); rb_undef_method(CLASS_OF(cFloat), "new"); rb_define_method(cFloat, "to_s", flo_to_s, 0); rb_define_method(cFloat, "coerce", flo_coerce, 1); rb_define_method(cFloat, "-@", flo_uminus, 0); rb_define_method(cFloat, "+", flo_plus, 1); rb_define_method(cFloat, "-", flo_minus, 1); rb_define_method(cFloat, "*", flo_mul, 1); rb_define_method(cFloat, "/", flo_div, 1); rb_define_method(cFloat, "%", flo_mod, 1); rb_define_method(cFloat, "remainder", flo_remainder, 1); rb_define_method(cFloat, "**", flo_pow, 1); rb_define_method(cFloat, "==", flo_eq, 1); rb_define_method(cFloat, "<=>", flo_cmp, 1); rb_define_method(cFloat, ">", flo_gt, 1); rb_define_method(cFloat, ">=", flo_ge, 1); rb_define_method(cFloat, "<", flo_lt, 1); rb_define_method(cFloat, "<=", flo_le, 1); rb_define_method(cFloat, "eql?", flo_eql, 1); rb_define_method(cFloat, "hash", flo_hash, 0); rb_define_method(cFloat, "to_i", flo_to_i, 0); rb_define_method(cFloat, "to_f", flo_to_f, 0); rb_define_method(cFloat, "abs", flo_abs, 0); rb_define_method(cFloat, "zero?", flo_zero_p, 0); rb_define_method(cFloat, "floor", flo_floor, 0); rb_define_method(cFloat, "ceil", flo_ceil, 0); rb_define_method(cFloat, "round", flo_round, 0); } ruby-1.2.3/object.c100644 774 145 53333 6571154251 12202 0ustar matzNaCl/************************************************ object.c - $Author: matz $ $Date: 1998/08/27 03:55:21 $ created at: Thu Jul 15 12:01:24 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "st.h" #include VALUE mKernel; #ifdef __MACOS__ /* name conflict AERegistory.h */ VALUE cRubyObject; #else VALUE cObject; #endif VALUE cModule; VALUE cClass; VALUE cData; static VALUE cNilClass; static VALUE cTrueClass; static VALUE cFalseClass; VALUE f_sprintf(); VALUE obj_alloc(); static ID eq, eql; static ID inspect; VALUE rb_equal(obj1, obj2) VALUE obj1, obj2; { VALUE result; result = rb_funcall(obj1, eq, 1, obj2); if (result == FALSE || NIL_P(result)) return FALSE; return TRUE; } int rb_eql(obj1, obj2) VALUE obj1, obj2; { return rb_funcall(obj1, eql, 1, obj2); } VALUE obj_equal(obj1, obj2) VALUE obj1, obj2; { if (obj1 == obj2) return TRUE; return FALSE; } static VALUE any_to_a(obj) VALUE obj; { return ary_new3(1, obj); } static VALUE obj_hash(obj) VALUE obj; { return (long)obj|FIXNUM_FLAG; } static VALUE obj_id(obj) VALUE obj; { return INT2NUM((long)obj); } static VALUE obj_type(obj) VALUE obj; { VALUE cl = CLASS_OF(obj); while (FL_TEST(cl, FL_SINGLETON) || TYPE(cl) == T_ICLASS) { cl = RCLASS(cl)->super; } return cl; } static VALUE obj_clone(obj) VALUE obj; { VALUE clone; if (TYPE(obj) != T_OBJECT) { TypeError("can't clone %s", rb_class2name(CLASS_OF(obj))); } clone = obj_alloc(RBASIC(obj)->klass); CLONESETUP(clone,obj); if (ROBJECT(obj)->iv_tbl) { ROBJECT(clone)->iv_tbl = st_copy(ROBJECT(obj)->iv_tbl); RBASIC(clone)->klass = singleton_class_clone(RBASIC(obj)->klass); RBASIC(clone)->flags = RBASIC(obj)->flags; } return clone; } static VALUE obj_dup(obj) VALUE obj; { return rb_funcall(obj, rb_intern("clone"), 0, 0); } VALUE any_to_s(obj) VALUE obj; { char *s; char *cname = rb_class2name(CLASS_OF(obj)); s = ALLOCA_N(char, strlen(cname)+6+16+1); /* 6:tags 16:addr 1:eos */ sprintf(s, "#<%s:0x%x>", cname, obj); return str_new2(s); } VALUE rb_inspect(obj) VALUE obj; { return obj_as_string(rb_funcall(obj, inspect, 0, 0)); } static int inspect_i(id, value, str) ID id; VALUE value; VALUE str; { VALUE str2; char *ivname; /* need not to show internal data */ if (CLASS_OF(value) == 0) return ST_CONTINUE; if (RSTRING(str)->ptr[0] == '-') { RSTRING(str)->ptr[0] = '#'; str_cat(str, ": ", 2); } else { str_cat(str, ", ", 2); } ivname = rb_id2name(id); str_cat(str, ivname, strlen(ivname)); str_cat(str, "=", 1); if (TYPE(value) == T_OBJECT) { str2 = any_to_s(value); } else { str2 = rb_inspect(value); } str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); return ST_CONTINUE; } static VALUE obj_inspect(obj) VALUE obj; { if (TYPE(obj) == T_OBJECT && ROBJECT(obj)->iv_tbl && ROBJECT(obj)->iv_tbl->num_entries > 0) { VALUE str; char *b; str = str_new2("-<"); b = rb_class2name(CLASS_OF(obj)); str_cat(str, b, strlen(b)); st_foreach(ROBJECT(obj)->iv_tbl, inspect_i, str); str_cat(str, ">", 1); return str; } return rb_funcall(obj, rb_intern("to_s"), 0, 0); } VALUE obj_is_instance_of(obj, c) VALUE obj, c; { VALUE cl; switch (TYPE(c)) { case T_MODULE: case T_CLASS: break; case T_NIL: if (NIL_P(obj)) return TRUE; return FALSE; case T_FALSE: if (obj) return FALSE; return TRUE; case T_TRUE: if (obj) return TRUE; return FALSE; default: TypeError("class or module required"); } cl = CLASS_OF(obj); while (FL_TEST(cl, FL_SINGLETON) || TYPE(cl) == T_ICLASS) { cl = RCLASS(cl)->super; } if (c == cl) return TRUE; return FALSE; } VALUE obj_is_kind_of(obj, c) VALUE obj, c; { VALUE cl = CLASS_OF(obj); switch (TYPE(c)) { case T_MODULE: case T_CLASS: break; default: TypeError("class or module required"); } while (cl) { if (cl == c || RCLASS(cl)->m_tbl == RCLASS(c)->m_tbl) return TRUE; cl = RCLASS(cl)->super; } return FALSE; } static VALUE obj_dummy(obj) VALUE obj; { return Qnil; } static VALUE nil_to_i(obj) VALUE obj; { return INT2FIX(0); } static VALUE nil_to_s(obj) VALUE obj; { return str_new2(""); } static VALUE nil_to_a(obj) VALUE obj; { return ary_new2(0); } static VALUE nil_inspect(obj) VALUE obj; { return str_new2("nil"); } static VALUE nil_type(obj) VALUE obj; { return cNilClass; } #ifdef NIL_PLUS static VALUE nil_plus(x, y) VALUE x, y; { switch (TYPE(y)) { case T_NIL: case T_FIXNUM: case T_FLOAT: case T_BIGNUM: case T_STRING: case T_ARRAY: return y; default: TypeError("tried to add %s(%s) to nil", STR2CSTR(rb_inspect(y)), rb_class2name(CLASS_OF(y))); } /* not reached */ } #endif static VALUE main_to_s(obj) VALUE obj; { return str_new2("main"); } static VALUE true_to_s(obj) VALUE obj; { return str_new2("true"); } static VALUE true_to_i(obj) VALUE obj; { return INT2FIX(1); } static VALUE true_type(obj) VALUE obj; { return cTrueClass; } static VALUE true_and(obj, obj2) VALUE obj, obj2; { return RTEST(obj2)?TRUE:FALSE; } static VALUE true_or(obj, obj2) VALUE obj, obj2; { return TRUE; } static VALUE true_xor(obj, obj2) VALUE obj, obj2; { return RTEST(obj2)?FALSE:TRUE; } static VALUE false_to_s(obj) VALUE obj; { return str_new2("false"); } static VALUE false_to_i(obj) VALUE obj; { return INT2FIX(0); } static VALUE false_type(obj) VALUE obj; { return cFalseClass; } static VALUE false_and(obj, obj2) VALUE obj, obj2; { return FALSE; } static VALUE false_or(obj, obj2) VALUE obj, obj2; { return RTEST(obj2)?TRUE:FALSE; } static VALUE false_xor(obj, obj2) VALUE obj, obj2; { return RTEST(obj2)?TRUE:FALSE; } static VALUE rb_true(obj) VALUE obj; { return TRUE; } static VALUE rb_false(obj) VALUE obj; { return FALSE; } VALUE obj_alloc(klass) VALUE klass; { NEWOBJ(obj, struct RObject); OBJSETUP(obj, klass, T_OBJECT); obj->iv_tbl = 0; return (VALUE)obj; } static VALUE mod_clone(module) VALUE module; { NEWOBJ(clone, struct RClass); OBJSETUP(clone, CLASS_OF(module), TYPE(module)); clone->super = RCLASS(module)->super; clone->iv_tbl = 0; clone->m_tbl = 0; /* avoid GC crashing */ clone->iv_tbl = st_copy(RCLASS(module)->iv_tbl); clone->m_tbl = st_copy(RCLASS(module)->m_tbl); return (VALUE)clone; } static VALUE mod_to_s(klass) VALUE klass; { return str_dup(rb_class_path(klass)); } static VALUE mod_eqq(mod, arg) VALUE mod, arg; { return obj_is_kind_of(arg, mod); } static VALUE mod_le(mod, arg) VALUE mod, arg; { switch (TYPE(arg)) { case T_MODULE: case T_CLASS: break; default: TypeError("compared with non class/module"); } while (mod) { if (RCLASS(mod)->m_tbl == RCLASS(arg)->m_tbl) return TRUE; mod = RCLASS(mod)->super; } return FALSE; } static VALUE mod_lt(mod, arg) VALUE mod, arg; { if (mod == arg) return FALSE; return mod_le(mod, arg); } static VALUE mod_ge(mod, arg) VALUE mod, arg; { switch (TYPE(arg)) { case T_MODULE: case T_CLASS: break; default: TypeError("compared with non class/module"); } return mod_lt(arg, mod); } static VALUE mod_gt(mod, arg) VALUE mod, arg; { if (mod == arg) return FALSE; return mod_ge(mod, arg); } static VALUE mod_cmp(mod, arg) VALUE mod, arg; { if (mod == arg) return INT2FIX(0); switch (TYPE(arg)) { case T_MODULE: case T_CLASS: break; default: TypeError("<=> requires Class or Module (%s given)", rb_class2name(CLASS_OF(arg))); break; } if (mod_le(mod, arg)) { return INT2FIX(-1); } return INT2FIX(1); } VALUE module_s_new(klass) { VALUE mod = module_new(); RBASIC(mod)->klass = klass; obj_call_init(mod); return mod; } VALUE class_new_instance(); static VALUE class_s_new(argc, argv) int argc; VALUE *argv; { VALUE super, klass; if (rb_scan_args(argc, argv, "01", &super) == 0) { super = cObject; } Check_Type(super, T_CLASS); if (FL_TEST(super, FL_SINGLETON)) { TypeError("can't make subclass of virtual class"); } klass = class_new(super); /* make metaclass */ RBASIC(klass)->klass = singleton_class_new(RBASIC(super)->klass); singleton_class_attached(RBASIC(klass)->klass, klass); obj_call_init(klass); return klass; } static VALUE class_s_inherited() { TypeError("can't make subclass of Class"); } VALUE mod_name(); VALUE mod_included_modules(); VALUE mod_ancestors(); VALUE class_instance_methods(); VALUE class_protected_instance_methods(); VALUE class_private_instance_methods(); static VALUE class_superclass(klass) VALUE klass; { VALUE super = RCLASS(klass)->super; while (TYPE(super) == T_ICLASS) { super = RCLASS(super)->super; } if (!super) { return Qnil; } return super; } ID rb_to_id(name) VALUE name; { if (TYPE(name) == T_STRING) { return rb_intern(RSTRING(name)->ptr); } Check_Type(name, T_FIXNUM); return FIX2UINT(name); } static VALUE mod_attr(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { VALUE name, pub; rb_scan_args(argc, argv, "11", &name, &pub); rb_attr(klass, rb_to_id(name), 1, RTEST(pub), TRUE); return Qnil; } static VALUE mod_attr_reader(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { int i; for (i=0; ivalue <= (double)FIXNUM_MAX && RFLOAT(arg)->value >= (double)FIXNUM_MIN) { i = (int)RFLOAT(arg)->value; break; } return dbl2big(RFLOAT(arg)->value); case T_BIGNUM: return arg; case T_STRING: return str2inum(RSTRING(arg)->ptr, 0); case T_NIL: return INT2FIX(0); default: i = NUM2INT(arg); } return INT2NUM(i); } VALUE rb_Integer(val) VALUE val; { return f_integer(Qnil, val); } struct arg_to { VALUE val; char *s; }; static VALUE to_type(arg) struct arg_to *arg; { return rb_funcall(arg->val, rb_intern(arg->s), 0); } static VALUE fail_to_type(arg) struct arg_to *arg; { TypeError("failed to convert %s into %s", NIL_P(arg->val) ? "nil" : arg->val == TRUE ? "true" : arg->val == FALSE ? "false" : rb_class2name(CLASS_OF(arg->val)), arg->s); } VALUE rb_convert_type(val, type, tname, method) VALUE val; int type; char *tname, *method; { struct arg_to arg1, arg2; if (TYPE(val) == type) return val; arg1.val = arg2.val = val; arg1.s = method; arg2.s = tname; val = rb_rescue(to_type, (VALUE)&arg1, fail_to_type, (VALUE)&arg2); Check_Type(val, type); return val; } double big2dbl _((VALUE)); VALUE f_float(obj, arg) VALUE obj, arg; { switch (TYPE(arg)) { case T_FIXNUM: return float_new((double)FIX2LONG(arg)); case T_FLOAT: return arg; case T_BIGNUM: return float_new(big2dbl(arg)); default: return rb_convert_type(arg, T_FLOAT, "Float", "to_f"); } } VALUE rb_Float(val) VALUE val; { return f_float(Qnil, val); } double num2dbl(val) VALUE val; { VALUE v = rb_Float(val); return RFLOAT(v)->value; } static VALUE f_string(obj, arg) VALUE obj, arg; { return rb_convert_type(arg, T_STRING, "String", "to_s"); } char* str2cstr(str, len) VALUE str; int *len; { if (TYPE(str) != T_STRING) { str = str_to_str(str); } if (len) *len = RSTRING(str)->len; return RSTRING(str)->ptr; } VALUE rb_String(val) VALUE val; { return f_string(Qnil, val); } static VALUE f_array(obj, arg) VALUE obj, arg; { if (TYPE(arg) == T_ARRAY) return arg; arg = rb_funcall(arg, rb_intern("to_a"), 0); if (TYPE(arg) != T_ARRAY) { TypeError("`to_a' did not return Array"); } return arg; } VALUE rb_Array(val) VALUE val; { return f_array(Qnil, val); } VALUE rb_to_a(val) /* backward compatibility */ VALUE val; { return f_array(Qnil, val); } static VALUE boot_defclass(name, super) char *name; VALUE super; { extern st_table *rb_class_tbl; VALUE obj = class_new(super); ID id = rb_intern(name); rb_name_class(obj, id); st_add_direct(rb_class_tbl, id, obj); return obj; } VALUE rb_class_of(obj) VALUE obj; { if (FIXNUM_P(obj)) return cFixnum; if (obj == Qnil) return cNilClass; if (obj == FALSE) return cFalseClass; if (obj == TRUE) return cTrueClass; return RBASIC(obj)->klass; } VALUE TopSelf; void Init_Object() { VALUE metaclass; cObject = boot_defclass("Object", 0); cModule = boot_defclass("Module", cObject); cClass = boot_defclass("Class", cModule); metaclass = RBASIC(cObject)->klass = singleton_class_new(cClass); singleton_class_attached(metaclass, cObject); metaclass = RBASIC(cModule)->klass = singleton_class_new(metaclass); singleton_class_attached(metaclass, cModule); metaclass = RBASIC(cClass)->klass = singleton_class_new(metaclass); singleton_class_attached(metaclass, cClass); mKernel = rb_define_module("Kernel"); rb_include_module(cObject, mKernel); rb_define_private_method(cClass, "inherited", obj_dummy, 1); /* * Ruby's Class Hierarchy Chart * * +------------------+ * | | * Object---->(Object) | * ^ ^ ^ ^ | * | | | | | * | | +-----+ +---------+ | * | | | | | * | +-----------+ | | * | | | | | * +------+ | Module--->(Module) | * | | ^ ^ | * OtherClass-->(OtherClass) | | | * | | | * Class---->(Class) | * ^ | * | | * +----------------+ * * + All metaclasses are instances of the class `Class'. */ rb_define_method(mKernel, "nil?", rb_false, 0); rb_define_method(mKernel, "==", obj_equal, 1); rb_define_alias(mKernel, "equal?", "=="); rb_define_alias(mKernel, "===", "=="); rb_define_method(mKernel, "=~", rb_false, 1); rb_define_method(mKernel, "eql?", obj_equal, 1); rb_define_method(mKernel, "hash", obj_hash, 0); rb_define_method(mKernel, "id", obj_id, 0); rb_define_method(mKernel, "__id__", obj_id, 0); rb_define_method(mKernel, "type", obj_type, 0); rb_define_method(mKernel, "clone", obj_clone, 0); rb_define_method(mKernel, "dup", obj_dup, 0); rb_define_method(mKernel, "to_a", any_to_a, 0); rb_define_method(mKernel, "to_s", any_to_s, 0); rb_define_method(mKernel, "inspect", obj_inspect, 0); rb_define_method(mKernel, "methods", obj_methods, 0); rb_define_method(mKernel, "public_methods", obj_methods, 0); rb_define_method(mKernel, "singleton_methods", obj_singleton_methods, 0); rb_define_method(mKernel, "protected_methods", obj_protected_methods, 0); rb_define_method(mKernel, "private_methods", obj_private_methods, 0); rb_define_method(mKernel, "instance_variables", obj_instance_variables, 0); rb_define_private_method(mKernel, "remove_instance_variable", obj_remove_instance_variable, 0); rb_define_method(mKernel, "instance_of?", obj_is_instance_of, 1); rb_define_method(mKernel, "kind_of?", obj_is_kind_of, 1); rb_define_method(mKernel, "is_a?", obj_is_kind_of, 1); rb_define_global_function("sprintf", f_sprintf, -1); rb_define_alias(mKernel, "format", "sprintf"); rb_define_global_function("Integer", f_integer, 1); rb_define_global_function("Float", f_float, 1); rb_define_global_function("String", f_string, 1); rb_define_global_function("Array", f_array, 1); cNilClass = rb_define_class("NilClass", cObject); rb_define_method(cNilClass, "type", nil_type, 0); rb_define_method(cNilClass, "to_i", nil_to_i, 0); rb_define_method(cNilClass, "to_s", nil_to_s, 0); rb_define_method(cNilClass, "to_a", nil_to_a, 0); rb_define_method(cNilClass, "inspect", nil_inspect, 0); rb_define_method(cNilClass, "nil?", rb_true, 0); rb_undef_method(CLASS_OF(cNilClass), "new"); rb_define_global_const("NIL", Qnil); /* default addition */ #ifdef NIL_PLUS rb_define_method(cNilClass, "+", nil_plus, 1); #endif rb_define_global_function("initialize", obj_dummy, -1); rb_define_global_function("singleton_method_added", obj_dummy, 1); rb_define_method(cModule, "===", mod_eqq, 1); rb_define_method(cModule, "<=>", mod_cmp, 1); rb_define_method(cModule, "<", mod_lt, 1); rb_define_method(cModule, "<=", mod_le, 1); rb_define_method(cModule, ">", mod_gt, 1); rb_define_method(cModule, ">=", mod_ge, 1); rb_define_method(cModule, "clone", mod_clone, 0); rb_define_method(cModule, "to_s", mod_to_s, 0); rb_define_method(cModule, "included_modules", mod_included_modules, 0); rb_define_method(cModule, "name", mod_name, 0); rb_define_method(cModule, "ancestors", mod_ancestors, 0); rb_define_private_method(cModule, "attr", mod_attr, -1); rb_define_private_method(cModule, "attr_reader", mod_attr_reader, -1); rb_define_private_method(cModule, "attr_writer", mod_attr_writer, -1); rb_define_private_method(cModule, "attr_accessor", mod_attr_accessor, -1); rb_define_singleton_method(cModule, "new", module_s_new, 0); rb_define_method(cModule, "instance_methods", class_instance_methods, -1); rb_define_method(cModule, "public_instance_methods", class_instance_methods, -1); rb_define_method(cModule, "protected_instance_methods", class_protected_instance_methods, -1); rb_define_method(cModule, "private_instance_methods", class_private_instance_methods, -1); rb_define_method(cModule, "constants", mod_constants, 0); rb_define_method(cModule, "const_get", mod_const_get, 1); rb_define_method(cModule, "const_set", mod_const_set, 2); rb_define_method(cModule, "const_defined?", mod_const_defined, 1); rb_define_private_method(cModule, "remove_const", mod_remove_const, 1); rb_define_private_method(cModule, "method_added", obj_dummy, 1); rb_define_method(cClass, "new", class_new_instance, -1); rb_define_method(cClass, "superclass", class_superclass, 0); rb_define_singleton_method(cClass, "new", class_s_new, -1); rb_undef_method(cClass, "extend_object"); rb_undef_method(cClass, "append_features"); rb_define_singleton_method(cClass, "inherited", class_s_inherited, 1); cData = rb_define_class("Data", cObject); rb_undef_method(CLASS_OF(cData), "new"); TopSelf = obj_alloc(cObject); rb_global_variable(&TopSelf); rb_define_singleton_method(TopSelf, "to_s", main_to_s, 0); cTrueClass = rb_define_class("TrueClass", cObject); rb_define_method(cTrueClass, "to_s", true_to_s, 0); rb_define_method(cTrueClass, "to_i", true_to_i, 0); rb_define_method(cTrueClass, "type", true_type, 0); rb_define_method(cTrueClass, "&", true_and, 1); rb_define_method(cTrueClass, "|", true_or, 1); rb_define_method(cTrueClass, "^", true_xor, 1); rb_undef_method(CLASS_OF(cTrueClass), "new"); rb_define_global_const("TRUE", TRUE); cFalseClass = rb_define_class("FalseClass", cObject); rb_define_method(cFalseClass, "to_s", false_to_s, 0); rb_define_method(cFalseClass, "to_i", false_to_i, 0); rb_define_method(cFalseClass, "type", false_type, 0); rb_define_method(cFalseClass, "&", false_and, 1); rb_define_method(cFalseClass, "|", false_or, 1); rb_define_method(cFalseClass, "^", false_xor, 1); rb_undef_method(CLASS_OF(cFalseClass), "new"); rb_define_global_const("FALSE", FALSE); eq = rb_intern("=="); eql = rb_intern("eql?"); inspect = rb_intern("inspect"); } ruby-1.2.3/pack.c100644 774 145 51255 6650575042 11656 0ustar matzNaCl/************************************************ pack.c - $Author: matz $ $Date: 1999/01/18 09:08:50 $ created at: Thu Feb 10 15:17:05 JST 1994 Copyright (C) 1993-1998 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 DYNAMIC_ENDIAN #ifdef ntohs #undef ntohs #undef ntohl #undef htons #undef htonl #endif static int endian() { static int init = 0; static int endian_value; char *p; if (init) return endian_value; init = 1; p = (char*)&init; return endian_value = p[0]?0:1; } #define ntohs(x) (endian()?(x):swaps(x)) #define ntohl(x) (endian()?(x):swapl(x)) #define htons(x) (endian()?(x):swaps(x)) #define htonl(x) (endian()?(x):swapl(x)) #define htovs(x) (endian()?swaps(x):(x)) #define htovl(x) (endian()?swapl(x):(x)) #define vtohs(x) (endian()?swaps(x):(x)) #define vtohl(x) (endian()?swapl(x):(x)) #else #ifdef WORDS_BIGENDIAN #ifndef ntohs #define ntohs(x) (x) #define ntohl(x) (x) #define htons(x) (x) #define htonl(x) (x) #endif #define htovs(x) swaps(x) #define htovl(x) swapl(x) #define vtohs(x) swaps(x) #define vtohl(x) swapl(x) #else /* LITTLE ENDIAN */ #ifndef ntohs #define ntohs(x) swaps(x) #define ntohl(x) swapl(x) #define htons(x) swaps(x) #define htonl(x) swapl(x) #endif #define htovs(x) (x) #define htovl(x) (x) #define vtohs(x) (x) #define vtohl(x) (x) #endif #endif static char *toofew = "too few arguments"; static void encodes _((VALUE,char*,int,int)); static void qpencode _((VALUE,VALUE,int)); static void pack_add_ptr(str, add) VALUE str, add; { #define STR_NO_ORIG FL_USER3 /* copied from string.c */ if (!RSTRING(str)->orig) { RSTRING(str)->orig = ary_new(); FL_SET(str, STR_NO_ORIG); } ary_push(RSTRING(str)->orig, add); } static VALUE pack_pack(ary, fmt) VALUE ary, 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; p = str2cstr(fmt, &plen); pend = p + plen; res = str_new(0, 0); items = RARRAY(ary)->len; idx = 0; #define NEXTFROM (items-- > 0 ? RARRAY(ary)->ptr[idx++] : (ArgError(toofew),0)) 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, (char**)&p, 10); } else { len = 1; } switch (type) { case 'A': case 'a': case 'B': case 'b': case 'H': case 'h': from = NEXTFROM; if (NIL_P(from)) { ptr = ""; 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': case 'A': if (plen >= len) str_cat(res, ptr, len); else { str_cat(res, ptr, plen); len -= plen; while (len >= 10) { str_cat(res, (type == 'A')?spc10:nul10, 10); len -= 10; } str_cat(res, (type == 'A')?spc10:nul10, 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 (NIL_P(from)) 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 (NIL_P(from)) s = 0; else { s = NUM2INT(from); } str_cat(res, (char*)&s, sizeof(short)); } break; case 'i': case 'I': while (len-- > 0) { int i; from = NEXTFROM; if (NIL_P(from)) i = 0; else { i = NUM2UINT(from); } str_cat(res, (char*)&i, sizeof(int)); } break; case 'l': case 'L': while (len-- > 0) { long l; from = NEXTFROM; if (NIL_P(from)) l = 0; else { l = NUM2ULONG(from); } str_cat(res, (char*)&l, sizeof(long)); } break; case 'n': while (len-- > 0) { unsigned short s; from = NEXTFROM; if (NIL_P(from)) s = 0; else { s = NUM2INT(from); } s = htons(s); str_cat(res, (char*)&s, sizeof(short)); } break; case 'N': while (len-- > 0) { unsigned long l; from = NEXTFROM; if (NIL_P(from)) l = 0; else { l = NUM2ULONG(from); } l = htonl(l); str_cat(res, (char*)&l, sizeof(long)); } break; case 'v': while (len-- > 0) { unsigned short s; from = NEXTFROM; if (NIL_P(from)) s = 0; else { s = NUM2INT(from); } s = htovs(s); str_cat(res, (char*)&s, sizeof(short)); } break; case 'V': while (len-- > 0) { unsigned long l; from = NEXTFROM; if (NIL_P(from)) l = 0; else { l = NUM2ULONG(from); } l = htovl(l); str_cat(res, (char*)&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, (char*)&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, (char*)&d, sizeof(double)); } 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) ArgError("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 '%': ArgError("% may only be used in unpack"); break; case 'u': case 'm': 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, type); plen -= todo; ptr += todo; } break; case 'M': from = obj_as_string(NEXTFROM); if (len <= 1) len = 72; qpencode(res, from, len); break; case 'P': len = 1; /* FALL THROUGH */ case 'p': while (len-- > 0) { char *t; from = NEXTFROM; if (NIL_P(from)) t = ""; else { t = STR2CSTR(from); pack_add_ptr(res, from); } str_cat(res, (char*)&t, sizeof(char*)); } break; default: break; } } return res; } static char uu_table[] = "`!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_"; static char b64_table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; static void encodes(str, s, len, type) VALUE str; char *s; int len; int type; { char *buff = ALLOCA_N(char, len * 4 / 3 + 6); int i = 0; char *p, *pend; char *trans = type == 'u' ? uu_table : b64_table; int padding; if (type == 'u') { buff[i++] = len + ' '; padding = '`'; } else { padding = '='; } while (len >= 3) { buff[i++] = trans[077 & (*s >> 2)]; buff[i++] = trans[077 & (((*s << 4) & 060) | ((s[1] >> 4) & 017))]; buff[i++] = trans[077 & (((s[1] << 2) & 074) | ((s[2] >> 6) & 03))]; buff[i++] = trans[077 & s[2]]; s += 3; len -= 3; } if (len == 2) { buff[i++] = trans[077 & (*s >> 2)]; buff[i++] = trans[077 & (((*s << 4) & 060) | ((s[1] >> 4) & 017))]; buff[i++] = trans[077 & (((s[1] << 2) & 074) | (('\0' >> 6) & 03))]; buff[i++] = padding; } else if (len == 1) { buff[i++] = trans[077 & (*s >> 2)]; buff[i++] = trans[077 & (((*s << 4) & 060) | (('\0' >> 4) & 017))]; buff[i++] = padding; buff[i++] = padding; } buff[i++] = '\n'; str_cat(str, buff, i); } static char hex_table[] = "0123456789ABCDEF"; static void qpencode(str, from, len) VALUE str, from; int len; { char buff[1024]; int i = 0, n = 0, prev = EOF; unsigned char *s = RSTRING(from)->ptr; unsigned char *send = s + RSTRING(from)->len; while (s < send) { if ((*s > 126) || (*s < 32 && *s != '\n' && *s != '\t') || (*s == '=')) { buff[i++] = '='; buff[i++] = hex_table[*s >> 4]; buff[i++] = hex_table[*s & 0x0f]; n += 3; prev = EOF; } else if (*s == '\n') { if (prev == ' ' || prev == '\t') { buff[i++] = '='; buff[i++] = *s; } buff[i++] = *s; n = 0; prev = *s; } else { buff[i++] = *s; n++; prev = *s; } if (n > len) { buff[i++] = '='; buff[i++] = '\n'; n = 0; prev = '\n'; } if (i > 1024 - 5) { str_cat(str, buff, i); i = 0; } s++; } if (n > 0) { buff[i++] = '='; buff[i++] = '\n'; } if (i > 0) { str_cat(str, buff, i); } } #if defined(__GNUC__) && __GNUC__ >= 2 && !defined(RUBY_NO_INLINE) static __inline__ int #else static int #endif hex2num(c) char c; { switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': return c - '0'; case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': return c - 'a' + 10; case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': return c - 'A' + 10; default: return -1; } } static VALUE pack_unpack(str, fmt) VALUE str, fmt; { static char *hexdigits = "0123456789abcdef0123456789ABCDEFx"; char *s, *send; char *p, *pend; VALUE ary; char type; int len; s = str2cstr(str, &len); send = s + len; p = str2cstr(fmt, &len); pend = p + len; ary = ary_new(); while (p < pend) { type = *p++; if (*p == '*') { len = send - s; p++; } else if (ISDIGIT(*p)) { len = strtoul(p, (char**)&p, 10); } else { len = (type != '@'); } switch (type) { case '%': ArgError("% is not supported(yet)"); break; case 'A': if (len > send - s) len = send - s; { int end = len; char *t = s + len - 1; while (t >= s) { if (*t != ' ' && *t != '\0') break; t--; len--; } ary_push(ary, str_new(s, len)); s += end; } break; 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; bits = 0; ary_push(ary, bitstr = str_new(0, len)); t = RSTRING(bitstr)->ptr; for (i=0; i>= 1; else bits = *s++; *t++ = (bits & 1) ? '1' : '0'; } } break; case 'B': { VALUE bitstr; char *t; int bits, i; if (p[-1] == '*' || len > (send - s) * 8) len = (send - s) * 8; bits = 0; ary_push(ary, bitstr = str_new(0, len)); t = RSTRING(bitstr)->ptr; for (i=0; i (send - s) * 2) len = (send - s) * 2; bits = 0; ary_push(ary, bitstr = str_new(0, len)); t = RSTRING(bitstr)->ptr; for (i=0; i>= 4; else bits = *s++; *t++ = hexdigits[bits & 15]; } } break; case 'H': { VALUE bitstr; char *t; int bits, i; if (p[-1] == '*' || len > (send - s) * 2) len = (send - s) * 2; bits = 0; ary_push(ary, bitstr = str_new(0, len)); t = RSTRING(bitstr)->ptr; for (i=0; i> 4) & 15]; } } break; case 'c': if (len > send - s) len = send - s; while (len-- > 0) { int c = *s++; if (c > (char)127) c-=256; 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(short)) len = (send - s) / sizeof(short); while (len-- > 0) { unsigned short tmp; memcpy(&tmp, s, sizeof(short)); s += sizeof(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(int)) len = (send - s) / sizeof(int); while (len-- > 0) { unsigned int tmp; memcpy(&tmp, s, sizeof(int)); s += sizeof(int); ary_push(ary, uint2inum(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(long)) len = (send - s) / sizeof(long); while (len-- > 0) { unsigned long tmp; memcpy(&tmp, s, sizeof(long)); s += sizeof(long); ary_push(ary, uint2inum(tmp)); } break; case 'n': if (len >= (send - s) / sizeof(short)) len = (send - s) / sizeof(short); while (len-- > 0) { unsigned short tmp; memcpy(&tmp, s, sizeof(short)); s += sizeof(short); tmp = ntohs(tmp); ary_push(ary, uint2inum(tmp)); } break; case 'N': if (len >= (send - s) / sizeof(long)) len = (send - s) / sizeof(long); while (len-- > 0) { unsigned long tmp; memcpy(&tmp, s, sizeof(long)); s += sizeof(long); tmp = ntohl(tmp); ary_push(ary, uint2inum(tmp)); } break; case 'v': if (len >= (send - s) / sizeof(short)) len = (send - s) / sizeof(short); while (len-- > 0) { unsigned short tmp; memcpy(&tmp, s, sizeof(short)); s += sizeof(short); tmp = vtohs(tmp); ary_push(ary, uint2inum(tmp)); } break; case 'V': if (len >= (send - s) / sizeof(long)) len = (send - s) / sizeof(long); while (len-- > 0) { unsigned long tmp; memcpy(&tmp, s, sizeof(long)); s += sizeof(long); tmp = vtohl(tmp); ary_push(ary, uint2inum(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 '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; if (total > RSTRING(str)->len) { len -= total - RSTRING(str)->len; total = RSTRING(str)->len; } while (len > 0) { int mlen = len > 3 ? 3 : len; 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, mlen); ptr += mlen; len -= mlen; } if (*s == '\r') s++; if (*s == '\n') s++; else if (s < send && (s+1 == send || s[1] == '\n')) s += 2; /* possible checksum byte */ } RSTRING(str)->len = total; ary_push(ary, str); } break; case 'm': { VALUE str = str_new(0, (send - s)*3/4); char *ptr = RSTRING(str)->ptr; int a,b,c,d; static int first = 1; static int b64_xtable[256]; if (first) { int i; first = 0; for (i = 0; i < 256; i++) { b64_xtable[i] = -1; } for (i = 0; i < 64; i++) { b64_xtable[b64_table[i]] = i; } } for (;;) { while (s[0] == '\r' || s[0] == '\n') { s++; } if ((a = b64_xtable[s[0]]) == -1) break; if ((b = b64_xtable[s[1]]) == -1) break; if ((c = b64_xtable[s[2]]) == -1) break; if ((d = b64_xtable[s[3]]) == -1) break; *ptr++ = a << 2 | b >> 4; *ptr++ = b << 4 | c >> 2; *ptr++ = c << 6 | d; s += 4; } if (a != -1 && b != -1 && s[2] == '=') { *ptr++ = a << 2 | b >> 4; } if (a != -1 && b != -1 && c != -1 && s[3] == '=') { *ptr++ = a << 2 | b >> 4; *ptr++ = b << 4 | c >> 2; } RSTRING(str)->len = ptr - RSTRING(str)->ptr; ary_push(ary, str); } break; case 'M': { VALUE str = str_new(0, send - s); char *ptr = RSTRING(str)->ptr; int c1, c2; while (s < send) { if (*s == '=') { if (++s == send) break; if (*s != '\n') { if ((c1 = hex2num(*s)) == -1) break; if (++s == send) break; if ((c2 = hex2num(*s)) == -1) break; *ptr++ = c1 << 4 | c2; } } else { *ptr++ = *s; } s++; } RSTRING(str)->len = ptr - RSTRING(str)->ptr; ary_push(ary, str); } break; case '@': s = RSTRING(str)->ptr + len; break; case 'X': if (len > s - RSTRING(str)->ptr) ArgError("X outside of string"); s -= len; break; case 'x': if (len > send - s) ArgError("x outside of string"); s += len; break; case 'P': if (sizeof(char *) <= send - s) { char *t; VALUE str = str_new(0, 0); memcpy(&t, s, sizeof(char *)); s += sizeof(char *); if (t) str_cat(str, t, len); ary_push(ary, str); } break; case 'p': if (len > (send - s) / sizeof(char *)) len = (send - s) / sizeof(char *); while (len-- > 0) { if (send - s < sizeof(char *)) break; else { char *t; VALUE str = str_new(0, 0); memcpy(&t, s, sizeof(char *)); s += sizeof(char *); if (t) str_cat(str, t, strlen(t)); ary_push(ary, str); } } break; default: break; } } return ary; } void Init_pack() { rb_define_method(cArray, "pack", pack_pack, 1); rb_define_method(cString, "unpack", pack_unpack, 1); } ruby-1.2.3/parse.c100644 774 145 657067 6657725665 12126 0ustar matzNaCl /* A Bison parser, made from parse.y by GNU Bison version 1.25 */ #define YYBISON 1 /* Identify Bison output. */ #define kCLASS 258 #define kMODULE 259 #define kDEF 260 #define kUNDEF 261 #define kBEGIN 262 #define kRESCUE 263 #define kENSURE 264 #define kEND 265 #define kIF 266 #define kUNLESS 267 #define kTHEN 268 #define kELSIF 269 #define kELSE 270 #define kCASE 271 #define kWHEN 272 #define kWHILE 273 #define kUNTIL 274 #define kFOR 275 #define kBREAK 276 #define kNEXT 277 #define kREDO 278 #define kRETRY 279 #define kIN 280 #define kDO 281 #define kRETURN 282 #define kYIELD 283 #define kSUPER 284 #define kSELF 285 #define kNIL 286 #define kTRUE 287 #define kFALSE 288 #define kAND 289 #define kOR 290 #define kNOT 291 #define kIF_MOD 292 #define kUNLESS_MOD 293 #define kWHILE_MOD 294 #define kUNTIL_MOD 295 #define kALIAS 296 #define kDEFINED 297 #define klBEGIN 298 #define klEND 299 #define k__LINE__ 300 #define k__FILE__ 301 #define tIDENTIFIER 302 #define tFID 303 #define tGVAR 304 #define tIVAR 305 #define tCONSTANT 306 #define tINTEGER 307 #define tFLOAT 308 #define tSTRING 309 #define tXSTRING 310 #define tREGEXP 311 #define tDSTRING 312 #define tDXSTRING 313 #define tDREGEXP 314 #define tNTH_REF 315 #define tBACK_REF 316 #define tUPLUS 317 #define tUMINUS 318 #define tPOW 319 #define tCMP 320 #define tEQ 321 #define tEQQ 322 #define tNEQ 323 #define tGEQ 324 #define tLEQ 325 #define tANDOP 326 #define tOROP 327 #define tMATCH 328 #define tNMATCH 329 #define tDOT2 330 #define tDOT3 331 #define tAREF 332 #define tASET 333 #define tLSHFT 334 #define tRSHFT 335 #define tCOLON2 336 #define tCOLON3 337 #define tOP_ASGN 338 #define tASSOC 339 #define tLPAREN 340 #define tLBRACK 341 #define tLBRACE 342 #define tSTAR 343 #define tAMPER 344 #define tSYMBEG 345 #define LAST_TOKEN 346 #line 13 "parse.y" #define YYDEBUG 1 #include "ruby.h" #include "env.h" #include "node.h" #include "st.h" #include /* hack for bison */ #ifdef const # undef const #endif #define ID_SCOPE_SHIFT 3 #define ID_SCOPE_MASK 0x07 #define ID_LOCAL 0x01 #define ID_INSTANCE 0x02 #define ID_GLOBAL 0x03 #define ID_ATTRSET 0x04 #define ID_CONST 0x05 #define is_id_notop(id) ((id)>LAST_TOKEN) #define is_local_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_LOCAL) #define is_global_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_GLOBAL) #define is_instance_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_INSTANCE) #define is_attrset_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_ATTRSET) #define is_const_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_CONST) struct op_tbl { ID token; char *name; }; NODE *eval_tree_begin = 0; NODE *eval_tree = 0; char *sourcefile; /* current source file */ int sourceline; /* current line no. */ static int yylex(); static int yyerror(); 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_ARG, /* newline significant, +/- is a operator. */ EXPR_FNAME, /* ignore newline, +/- is a operator, no reserved words. */ EXPR_DOT, /* immediate after `.', no reserved words. */ EXPR_CLASS, /* immediate after `class', no here document. */ } lex_state; static int class_nest = 0; static int in_single = 0; static ID cur_mid = 0; static int value_expr(); static NODE *cond(); static NODE *logop(); static NODE *newline_node(); static void fixpos(); static NODE *block_append(); static NODE *list_append(); static NODE *list_concat(); static NODE *arg_add(); static NODE *call_op(); static int in_defined = 0; static NODE *arg_blk_pass(); static NODE *new_call(); static NODE *new_fcall(); static NODE *gettable(); static NODE *assignable(); static NODE *aryset(); static NODE *attrset(); static void backref_error(); static NODE *match_gen(); static void local_push(); static void local_pop(); static int local_cnt(); static int local_id(); static ID *local_tbl(); static struct RVarmap *dyna_push(); static void dyna_pop(); static int dyna_in_block(); VALUE dyna_var_asgn(); VALUE dyna_var_defined(); #define cref_push() NEW_CREF() static void cref_pop(); static NODE *cur_cref; static void top_local_init(); static void top_local_setup(); #line 116 "parse.y" typedef union { NODE *node; VALUE val; ID id; int num; struct RVarmap *vars; } YYSTYPE; #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 609 #define YYFLAG -32768 #define YYNTBASE 118 #define YYTRANSLATE(x) ((unsigned)(x) <= 346 ? yytranslate[x] : 203) static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 116, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 104, 2, 2, 2, 103, 98, 2, 115, 110, 101, 99, 111, 100, 109, 102, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 93, 117, 95, 91, 94, 92, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 112, 2, 113, 97, 2, 114, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 107, 96, 108, 105, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 106 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 1, 4, 7, 8, 10, 14, 17, 20, 21, 26, 30, 34, 38, 41, 45, 49, 53, 57, 58, 64, 69, 71, 75, 78, 81, 83, 87, 91, 94, 97, 99, 102, 107, 112, 115, 117, 121, 123, 127, 129, 133, 136, 142, 145, 147, 151, 154, 156, 160, 162, 167, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 190, 195, 197, 199, 201, 203, 205, 207, 209, 211, 213, 215, 217, 219, 221, 223, 225, 227, 229, 231, 233, 235, 237, 239, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 277, 279, 281, 283, 285, 287, 289, 291, 293, 295, 297, 299, 301, 303, 305, 307, 309, 311, 313, 315, 317, 319, 321, 323, 325, 327, 329, 330, 335, 342, 348, 354, 358, 362, 369, 375, 381, 385, 389, 393, 397, 401, 405, 409, 413, 417, 420, 423, 427, 431, 435, 439, 443, 447, 451, 455, 459, 463, 467, 471, 475, 478, 481, 485, 489, 493, 497, 498, 503, 509, 511, 513, 514, 517, 519, 522, 528, 531, 537, 542, 550, 554, 556, 559, 562, 563, 565, 566, 568, 572, 574, 579, 582, 584, 585, 588, 590, 594, 597, 599, 601, 603, 605, 607, 609, 611, 616, 620, 624, 629, 633, 635, 640, 644, 646, 647, 654, 656, 659, 661, 664, 671, 678, 684, 690, 695, 703, 709, 713, 714, 721, 722, 730, 731, 737, 738, 745, 746, 747, 757, 759, 761, 763, 765, 767, 769, 772, 774, 776, 779, 781, 787, 788, 791, 793, 795, 796, 799, 801, 805, 806, 812, 813, 819, 821, 823, 825, 827, 829, 834, 841, 845, 852, 857, 859, 865, 867, 869, 875, 876, 877, 880, 882, 885, 887, 889, 891, 893, 895, 897, 899, 901, 903, 905, 907, 909, 911, 913, 915, 917, 919, 921, 923, 925, 926, 931, 934, 939, 942, 949, 954, 959, 962, 967, 970, 973, 975, 976, 978, 982, 986, 988, 992, 995, 998, 1001, 1002, 1004, 1009, 1010, 1013, 1016, 1018, 1022, 1026, 1028, 1030, 1032, 1033, 1035, 1036, 1038, 1039, 1041, 1043, 1045, 1047, 1049 }; static const short yyrhs[] = { -1, 119, 120, 0, 121, 198, 0, 0, 122, 0, 121, 202, 122, 0, 1, 122, 0, 171, 167, 0, 0, 41, 135, 123, 135, 0, 41, 49, 49, 0, 41, 49, 61, 0, 41, 49, 60, 0, 6, 136, 0, 122, 37, 125, 0, 122, 38, 125, 0, 122, 39, 125, 0, 122, 40, 125, 0, 0, 43, 124, 107, 120, 108, 0, 44, 107, 120, 108, 0, 125, 0, 127, 91, 150, 0, 27, 151, 0, 28, 151, 0, 126, 0, 125, 34, 125, 0, 125, 35, 125, 0, 36, 125, 0, 104, 126, 0, 140, 0, 197, 145, 0, 153, 109, 197, 145, 0, 153, 81, 197, 145, 0, 29, 145, 0, 129, 0, 85, 128, 110, 0, 129, 0, 85, 128, 110, 0, 131, 0, 131, 88, 133, 0, 131, 132, 0, 131, 132, 111, 88, 133, 0, 88, 133, 0, 133, 0, 85, 128, 110, 0, 130, 111, 0, 130, 0, 132, 111, 130, 0, 180, 0, 153, 112, 143, 113, 0, 153, 109, 47, 0, 182, 0, 47, 0, 51, 0, 47, 0, 51, 0, 48, 0, 138, 0, 139, 0, 135, 0, 0, 136, 111, 137, 135, 0, 75, 0, 96, 0, 97, 0, 98, 0, 65, 0, 66, 0, 67, 0, 73, 0, 94, 0, 69, 0, 95, 0, 70, 0, 79, 0, 80, 0, 99, 0, 100, 0, 101, 0, 88, 0, 102, 0, 103, 0, 64, 0, 105, 0, 62, 0, 63, 0, 77, 0, 78, 0, 114, 0, 45, 0, 46, 0, 43, 0, 44, 0, 41, 0, 34, 0, 7, 0, 21, 0, 16, 0, 3, 0, 5, 0, 42, 0, 26, 0, 15, 0, 14, 0, 10, 0, 9, 0, 33, 0, 20, 0, 37, 0, 25, 0, 4, 0, 22, 0, 31, 0, 36, 0, 35, 0, 23, 0, 8, 0, 24, 0, 27, 0, 30, 0, 29, 0, 13, 0, 32, 0, 6, 0, 38, 0, 40, 0, 17, 0, 39, 0, 28, 0, 0, 180, 91, 141, 140, 0, 153, 112, 143, 113, 91, 140, 0, 153, 109, 47, 91, 140, 0, 153, 109, 51, 91, 140, 0, 182, 91, 140, 0, 180, 83, 140, 0, 153, 112, 143, 113, 83, 140, 0, 153, 109, 47, 83, 140, 0, 153, 109, 51, 83, 140, 0, 182, 83, 140, 0, 140, 75, 140, 0, 140, 76, 140, 0, 140, 99, 140, 0, 140, 100, 140, 0, 140, 101, 140, 0, 140, 102, 140, 0, 140, 103, 140, 0, 140, 64, 140, 0, 62, 140, 0, 63, 140, 0, 140, 96, 140, 0, 140, 97, 140, 0, 140, 98, 140, 0, 140, 65, 140, 0, 140, 94, 140, 0, 140, 69, 140, 0, 140, 95, 140, 0, 140, 70, 140, 0, 140, 66, 140, 0, 140, 67, 140, 0, 140, 68, 140, 0, 140, 73, 140, 0, 140, 74, 140, 0, 104, 140, 0, 105, 140, 0, 140, 79, 140, 0, 140, 80, 140, 0, 140, 71, 140, 0, 140, 72, 140, 0, 0, 42, 199, 142, 140, 0, 140, 92, 140, 93, 140, 0, 153, 0, 144, 0, 0, 145, 199, 0, 126, 0, 149, 147, 0, 149, 111, 88, 140, 147, 0, 195, 147, 0, 195, 111, 88, 140, 147, 0, 149, 111, 195, 147, 0, 149, 111, 195, 111, 88, 140, 147, 0, 88, 140, 147, 0, 146, 0, 89, 140, 0, 111, 146, 0, 0, 149, 0, 0, 140, 0, 149, 111, 140, 0, 149, 0, 149, 111, 88, 140, 0, 88, 140, 0, 145, 0, 0, 149, 200, 0, 177, 0, 153, 81, 134, 0, 82, 134, 0, 54, 0, 57, 0, 55, 0, 58, 0, 59, 0, 181, 0, 182, 0, 153, 112, 143, 113, 0, 86, 152, 113, 0, 87, 194, 108, 0, 27, 115, 151, 110, 0, 27, 115, 110, 0, 27, 0, 28, 115, 151, 110, 0, 28, 115, 110, 0, 28, 0, 0, 42, 199, 115, 154, 125, 110, 0, 48, 0, 197, 169, 0, 172, 0, 172, 169, 0, 11, 125, 161, 120, 163, 10, 0, 12, 125, 161, 120, 164, 10, 0, 18, 125, 162, 120, 10, 0, 19, 125, 162, 120, 10, 0, 16, 120, 173, 10, 0, 20, 165, 25, 125, 162, 120, 10, 0, 7, 120, 175, 176, 10, 0, 85, 120, 110, 0, 0, 3, 134, 183, 155, 120, 10, 0, 0, 3, 79, 125, 201, 156, 120, 10, 0, 0, 4, 134, 157, 120, 10, 0, 0, 5, 135, 158, 185, 120, 10, 0, 0, 0, 5, 193, 109, 159, 135, 160, 185, 120, 10, 0, 21, 0, 22, 0, 23, 0, 24, 0, 201, 0, 13, 0, 201, 13, 0, 201, 0, 26, 0, 201, 26, 0, 164, 0, 14, 125, 161, 120, 163, 0, 0, 15, 120, 0, 133, 0, 127, 0, 0, 96, 96, 0, 72, 0, 96, 165, 96, 0, 0, 26, 168, 166, 120, 10, 0, 0, 107, 170, 166, 120, 108, 0, 47, 0, 51, 0, 48, 0, 172, 0, 126, 0, 197, 115, 144, 110, 0, 153, 109, 197, 115, 144, 110, 0, 153, 109, 197, 0, 153, 81, 197, 115, 144, 110, 0, 29, 115, 144, 110, 0, 29, 0, 17, 149, 161, 120, 174, 0, 164, 0, 173, 0, 8, 148, 162, 120, 175, 0, 0, 0, 9, 120, 0, 179, 0, 90, 178, 0, 56, 0, 135, 0, 50, 0, 49, 0, 52, 0, 53, 0, 47, 0, 50, 0, 49, 0, 51, 0, 31, 0, 30, 0, 32, 0, 33, 0, 46, 0, 45, 0, 180, 0, 60, 0, 61, 0, 201, 0, 0, 95, 184, 125, 201, 0, 1, 201, 0, 115, 186, 199, 110, 0, 186, 201, 0, 187, 111, 189, 111, 190, 192, 0, 187, 111, 189, 192, 0, 187, 111, 190, 192, 0, 187, 192, 0, 189, 111, 190, 192, 0, 189, 192, 0, 190, 192, 0, 191, 0, 0, 47, 0, 187, 111, 47, 0, 47, 91, 140, 0, 188, 0, 189, 111, 188, 0, 88, 47, 0, 89, 47, 0, 111, 191, 0, 0, 181, 0, 85, 125, 199, 110, 0, 0, 195, 200, 0, 149, 200, 0, 196, 0, 195, 111, 196, 0, 140, 84, 140, 0, 47, 0, 51, 0, 48, 0, 0, 202, 0, 0, 116, 0, 0, 116, 0, 111, 0, 117, 0, 116, 0, 201, 0, 202, 117, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 238, 247, 255, 257, 261, 265, 269, 274, 283, 284, 289, 295, 304, 309, 315, 321, 327, 337, 347, 355, 362, 370, 372, 378, 385, 390, 391, 395, 399, 404, 409, 411, 416, 422, 428, 436, 437, 442, 443, 448, 452, 456, 460, 464, 469, 470, 475, 480, 484, 489, 493, 497, 501, 507, 511, 513, 514, 515, 516, 521, 527, 531, 532, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 564, 564, 564, 564, 565, 565, 565, 565, 565, 565, 565, 566, 566, 566, 566, 566, 566, 566, 567, 567, 567, 567, 567, 567, 567, 568, 568, 568, 568, 568, 568, 568, 569, 569, 569, 569, 569, 569, 570, 570, 572, 573, 580, 585, 590, 595, 601, 624, 639, 650, 661, 666, 670, 674, 678, 682, 686, 690, 694, 698, 702, 706, 710, 714, 718, 722, 726, 730, 734, 738, 742, 746, 750, 754, 758, 763, 767, 771, 775, 779, 783, 784, 788, 794, 799, 807, 811, 813, 818, 822, 827, 832, 837, 842, 847, 852, 854, 860, 864, 869, 870, 875, 880, 886, 897, 902, 908, 922, 926, 928, 932, 937, 941, 945, 946, 950, 951, 952, 953, 954, 959, 967, 971, 978, 984, 990, 995, 999, 1003, 1003, 1008, 1012, 1017, 1018, 1027, 1036, 1045, 1053, 1061, 1069, 1077, 1092, 1096, 1106, 1114, 1121, 1129, 1138, 1146, 1154, 1163, 1164, 1171, 1179, 1183, 1187, 1191, 1196, 1197, 1198, 1200, 1201, 1202, 1204, 1205, 1214, 1218, 1223, 1224, 1226, 1230, 1234, 1238, 1243, 1248, 1256, 1261, 1268, 1272, 1276, 1280, 1281, 1283, 1288, 1294, 1299, 1305, 1311, 1319, 1326, 1327, 1329, 1336, 1341, 1345, 1350, 1351, 1355, 1357, 1358, 1359, 1361, 1362, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1375, 1380, 1381, 1383, 1387, 1391, 1395, 1397, 1402, 1407, 1411, 1415, 1419, 1423, 1427, 1431, 1435, 1439, 1444, 1451, 1459, 1466, 1471, 1476, 1483, 1488, 1492, 1497, 1510, 1528, 1532, 1536, 1544, 1545, 1550, 1555, 1556, 1557, 1559, 1560, 1562, 1563, 1565, 1566, 1567, 1569, 1570, 1572, 1573 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char * const yytname[] = { "$","error","$undefined.","kCLASS", "kMODULE","kDEF","kUNDEF","kBEGIN","kRESCUE","kENSURE","kEND","kIF","kUNLESS", "kTHEN","kELSIF","kELSE","kCASE","kWHEN","kWHILE","kUNTIL","kFOR","kBREAK","kNEXT", "kREDO","kRETRY","kIN","kDO","kRETURN","kYIELD","kSUPER","kSELF","kNIL","kTRUE", "kFALSE","kAND","kOR","kNOT","kIF_MOD","kUNLESS_MOD","kWHILE_MOD","kUNTIL_MOD", "kALIAS","kDEFINED","klBEGIN","klEND","k__LINE__","k__FILE__","tIDENTIFIER", "tFID","tGVAR","tIVAR","tCONSTANT","tINTEGER","tFLOAT","tSTRING","tXSTRING", "tREGEXP","tDSTRING","tDXSTRING","tDREGEXP","tNTH_REF","tBACK_REF","tUPLUS", "tUMINUS","tPOW","tCMP","tEQ","tEQQ","tNEQ","tGEQ","tLEQ","tANDOP","tOROP","tMATCH", "tNMATCH","tDOT2","tDOT3","tAREF","tASET","tLSHFT","tRSHFT","tCOLON2","tCOLON3", "tOP_ASGN","tASSOC","tLPAREN","tLBRACK","tLBRACE","tSTAR","tAMPER","tSYMBEG", "'='","'?'","':'","'>'","'<'","'|'","'^'","'&'","'+'","'-'","'*'","'/'","'%'", "'!'","'~'","LAST_TOKEN","'{'","'}'","'.'","')'","','","'['","']'","'`'","'('", "'\\n'","';'","program","@1","compstmt","stmts","stmt","@2","@3","expr","command_call", "mlhs","mlhs_entry","mlhs_basic","mlhs_item","mlhs_head","mlhs_tail","lhs","cname", "fname","undef_list","@4","op","reswords","arg","@5","@6","aref_args","opt_call_args", "call_args","block_arg","opt_block_arg","opt_list","args","mrhs","ret_args", "array","primary","@7","@8","@9","@10","@11","@12","@13","then","do","if_tail", "opt_else","iter_var","opt_iter_var","iter_do_block","@14","iter_block","@15", "iterator","method_call","case_body","cases","rescue","ensure","literal","symbol", "numeric","variable","var_ref","backref","superclass","@16","f_arglist","f_args", "f_arg","f_opt","f_optarg","f_rest_arg","f_block_arg","opt_f_block_arg","singleton", "assoc_list","assocs","assoc","operation","opt_terms","opt_nl","trailer","term", "terms", NULL }; #endif static const short yyr1[] = { 0, 119, 118, 120, 121, 121, 121, 121, 122, 123, 122, 122, 122, 122, 122, 122, 122, 122, 122, 124, 122, 122, 122, 125, 125, 125, 125, 125, 125, 125, 125, 125, 126, 126, 126, 126, 127, 127, 128, 128, 129, 129, 129, 129, 129, 130, 130, 131, 132, 132, 133, 133, 133, 133, 134, 134, 135, 135, 135, 135, 135, 136, 137, 136, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 138, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 139, 141, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 140, 142, 140, 140, 140, 143, 144, 144, 145, 145, 145, 145, 145, 145, 145, 145, 145, 146, 147, 147, 148, 148, 149, 149, 150, 150, 150, 151, 152, 152, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 154, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 155, 153, 156, 153, 157, 153, 158, 153, 159, 160, 153, 153, 153, 153, 153, 161, 161, 161, 162, 162, 162, 163, 163, 164, 164, 165, 165, 166, 166, 166, 166, 168, 167, 170, 169, 171, 171, 171, 171, 171, 172, 172, 172, 172, 172, 172, 173, 174, 174, 175, 175, 176, 176, 177, 177, 177, 178, 178, 178, 179, 179, 180, 180, 180, 180, 180, 180, 180, 180, 180, 180, 181, 182, 182, 183, 184, 183, 183, 185, 185, 186, 186, 186, 186, 186, 186, 186, 186, 186, 187, 187, 188, 189, 189, 190, 191, 192, 192, 193, 193, 194, 194, 194, 195, 195, 196, 197, 197, 197, 198, 198, 199, 199, 200, 200, 200, 201, 201, 202, 202 }; static const short yyr2[] = { 0, 0, 2, 2, 0, 1, 3, 2, 2, 0, 4, 3, 3, 3, 2, 3, 3, 3, 3, 0, 5, 4, 1, 3, 2, 2, 1, 3, 3, 2, 2, 1, 2, 4, 4, 2, 1, 3, 1, 3, 1, 3, 2, 5, 2, 1, 3, 2, 1, 3, 1, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 4, 6, 5, 5, 3, 3, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 3, 3, 3, 3, 0, 4, 5, 1, 1, 0, 2, 1, 2, 5, 2, 5, 4, 7, 3, 1, 2, 2, 0, 1, 0, 1, 3, 1, 4, 2, 1, 0, 2, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 4, 3, 3, 4, 3, 1, 4, 3, 1, 0, 6, 1, 2, 1, 2, 6, 6, 5, 5, 4, 7, 5, 3, 0, 6, 0, 7, 0, 5, 0, 6, 0, 0, 9, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 5, 0, 2, 1, 1, 0, 2, 1, 3, 0, 5, 0, 5, 1, 1, 1, 1, 1, 4, 6, 3, 6, 4, 1, 5, 1, 1, 5, 0, 0, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 4, 2, 4, 2, 6, 4, 4, 2, 4, 2, 2, 1, 0, 1, 3, 3, 1, 3, 2, 2, 2, 0, 1, 4, 0, 2, 2, 1, 3, 3, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 2 }; static const short yydefact[] = { 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 244, 245, 246, 247, 215, 218, 278, 299, 298, 300, 301, 0, 0, 344, 19, 0, 303, 302, 339, 341, 296, 295, 340, 292, 293, 203, 205, 288, 204, 206, 207, 305, 306, 0, 0, 0, 0, 198, 333, 0, 0, 0, 0, 2, 342, 5, 22, 26, 0, 36, 0, 40, 45, 31, 174, 0, 223, 200, 286, 304, 208, 209, 0, 7, 54, 55, 0, 0, 237, 100, 112, 101, 125, 97, 118, 107, 106, 123, 105, 104, 99, 128, 109, 98, 113, 117, 119, 111, 103, 120, 130, 122, 121, 114, 124, 108, 96, 116, 115, 110, 126, 129, 127, 95, 102, 93, 94, 91, 92, 56, 58, 57, 86, 87, 84, 68, 69, 70, 73, 75, 71, 64, 88, 89, 76, 77, 0, 81, 72, 74, 65, 66, 67, 78, 79, 80, 82, 83, 85, 90, 239, 59, 60, 304, 331, 0, 121, 114, 124, 108, 91, 92, 56, 57, 61, 14, 283, 294, 221, 297, 0, 26, 223, 0, 0, 0, 0, 215, 218, 278, 344, 259, 258, 0, 0, 50, 53, 0, 0, 0, 0, 0, 0, 178, 192, 197, 186, 189, 24, 174, 304, 209, 189, 336, 0, 25, 176, 35, 29, 0, 9, 345, 171, 0, 0, 150, 174, 151, 202, 0, 0, 0, 36, 192, 346, 0, 346, 0, 346, 44, 291, 290, 289, 287, 30, 165, 166, 350, 349, 3, 351, 343, 0, 0, 0, 0, 0, 0, 0, 47, 0, 0, 48, 42, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 176, 264, 8, 266, 224, 0, 131, 0, 0, 176, 32, 222, 0, 0, 308, 233, 307, 0, 344, 321, 241, 62, 191, 284, 249, 0, 248, 0, 0, 0, 252, 0, 251, 0, 0, 0, 0, 176, 0, 189, 187, 214, 0, 0, 0, 179, 0, 176, 0, 181, 217, 0, 0, 344, 11, 13, 12, 0, 219, 0, 0, 0, 0, 0, 232, 37, 348, 347, 199, 211, 335, 212, 348, 334, 352, 6, 15, 16, 17, 18, 27, 28, 0, 194, 23, 0, 41, 0, 149, 155, 160, 161, 162, 157, 159, 169, 170, 163, 164, 142, 143, 167, 168, 0, 156, 158, 152, 153, 154, 144, 145, 146, 147, 148, 54, 341, 55, 201, 0, 339, 340, 275, 0, 175, 260, 260, 137, 0, 141, 136, 0, 235, 310, 0, 0, 0, 0, 322, 0, 0, 321, 0, 0, 330, 325, 330, 330, 320, 0, 0, 0, 190, 0, 0, 256, 250, 256, 0, 229, 0, 253, 0, 0, 52, 340, 275, 0, 0, 0, 185, 213, 338, 0, 193, 188, 189, 339, 0, 0, 0, 337, 216, 277, 177, 10, 0, 172, 0, 21, 37, 193, 196, 0, 46, 0, 49, 0, 176, 34, 0, 0, 0, 0, 176, 33, 210, 262, 0, 0, 0, 132, 273, 0, 0, 0, 238, 332, 0, 327, 328, 344, 0, 312, 0, 316, 0, 318, 0, 319, 242, 63, 0, 0, 285, 231, 0, 0, 0, 254, 0, 0, 227, 228, 51, 0, 189, 0, 183, 210, 189, 0, 20, 0, 43, 173, 0, 139, 134, 140, 135, 0, 0, 0, 261, 0, 0, 0, 0, 309, 234, 324, 0, 240, 323, 330, 330, 329, 0, 326, 330, 321, 283, 0, 257, 225, 226, 256, 0, 180, 0, 182, 220, 195, 276, 274, 138, 133, 263, 265, 267, 236, 311, 0, 314, 315, 317, 0, 282, 0, 280, 281, 279, 230, 189, 330, 0, 256, 184, 313, 243, 255, 0, 0, 0 }; static const short yydefgoto[] = { 607, 1, 224, 58, 59, 343, 217, 60, 61, 62, 225, 63, 64, 65, 257, 66, 403, 154, 169, 435, 155, 156, 67, 413, 345, 408, 409, 339, 200, 331, 436, 201, 370, 202, 229, 220, 471, 420, 498, 303, 305, 434, 566, 311, 317, 523, 524, 188, 494, 288, 410, 290, 411, 69, 176, 315, 597, 309, 439, 71, 237, 72, 204, 74, 205, 301, 419, 427, 428, 429, 430, 431, 432, 562, 510, 159, 231, 206, 207, 191, 243, 216, 354, 312, 245 }; static const short yypact[] = {-32768, 1612, 4636, 27, 220, 4033, 4342, 2069, 4726, 4726, 2450, 4726, 4726, 5624,-32768,-32768,-32768,-32768, 3390, 3480, 3570, -32768,-32768,-32768,-32768, 4726, 4239, -70,-32768, -54,-32768, -32768, 1742, 1952,-32768,-32768, 1847,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768, 5356, 5356, 220, 2541, 5356, 5356, 5888, 4136, 5446, 5356,-32768, 192, 313, 201, 41, -11,-32768, 25, 5712,-32768, 5927, 14, 61, 18, -32768,-32768, 92,-32768, 94, 3030, 313,-32768,-32768, 4726, 37,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768, 72, 75, 81, 91,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 112, 117, 142,-32768, 148,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 4726, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 152,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 93, 258, 3120, 3210, 3300, 50,-32768, 176, 50, 271, 57, 57, 182, 200, 202, -70,-32768, 180, 111, 308, 131, 143, -13, 2649, 5356, 5356, 5356, 4446,-32768, 5887,-32768,-32768, 225,-32768, 153, 29, 46, 227,-32768, 4541,-32768, 4816, -32768,-32768, 39,-32768,-32768, 229, 233, 2757, 277, 161, 277,-32768, 2541, 232, 236, 238, 5927, -6, 241, -6, 247, 22,-32768,-32768,-32768,-32768,-32768,-32768, 277, 277, -32768,-32768,-32768,-32768, 2939, 4726, 4726, 4726, 4726, 4726, 4726, 5176,-32768, 2541, 5888,-32768, 245, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 5356, 150, 190, 4816,-32768,-32768,-32768,-32768, 5356,-32768, 5356, 5356, 4816,-32768,-32768, 26, 192,-32768, -32768,-32768, 2848, 36, -7,-32768,-32768, 5356, 351,-32768, 2177, 348, 2359, 5356, 353,-32768, 2848, 338, 2848, 229, 150, 230, 4816, 4726, 1331, 5927,-32768, 261, 5356, 4906, -32768, 256, 4816, 4996,-32768,-32768, 263, 264, -70,-32768, -32768,-32768, 4342,-32768, 5356, 2757, 275, 256, 281,-32768, 283, 5356,-32768,-32768,-32768,-32768,-32768, 5356,-32768,-32768, 313, 201, 201, 201, 201,-32768,-32768, 5356, 284,-32768, 282,-32768, 5800, 277, 796, 796, 796, 796, 279, 279, 1276, 1000, 796, 796, 1405, 1405, 129, 129, 1476, 279, 279, 226, 226, 434, 13, 13, 277, 277, 277, 3660, -32768, 3750,-32768, 3840, 185, 95, 3930, 286,-32768, -3, -3, 5927, 5356, 5927, 5927, 287,-32768,-32768, 4726, 2848, 386, 290, 310, 355, 360, 1, 2848, 192, 297,-32768, 298, 300,-32768, 4342, 4342, 5, 302, 2848, 400, 299, -32768, 401, 52,-32768, 405,-32768, 410, 306, 101,-32768, 307, 314, 57, 339,-32768,-32768, 5927, 5356, 5887,-32768, 321, 96, 320, 5356, 5887,-32768,-32768,-32768,-32768,-32768, 4726, 5927, 327,-32768, 209, 5927, 5927, 5266,-32768, 5888, -32768, 5356, 4816,-32768, 5356, 5356, 5356, 5356, 4816,-32768, 210,-32768, 5536, 2848, 2757, 5927,-32768, 2848, 26, 426, -32768,-32768, 5356,-32768,-32768, -70, 428,-32768, 8,-32768, 15,-32768, 350,-32768,-32768,-32768, 2069, 5356,-32768,-32768, 4726, 2848, 430,-32768, 431, 2268,-32768,-32768, 175, 2848, 1331, 5086,-32768, 97, 1331, 24,-32768, 5356,-32768, 5927, 334, 5927, 5927, 5927, 5927, 335, 5356, 5356,-32768, 352, 436, 341, 437,-32768,-32768, 5927, 343,-32768, 310, 340, 300,-32768, 310,-32768, 300, -7, 258, 50,-32768,-32768, -32768, 102, 444,-32768, 5356,-32768,-32768, 5927,-32768,-32768, 5927, 5927,-32768,-32768,-32768,-32768,-32768, 15,-32768,-32768, -32768, 2848,-32768, 2177,-32768,-32768,-32768,-32768, 1331, 300, 445, 299,-32768,-32768,-32768,-32768, 457, 459,-32768 }; static const short yypgoto[] = {-32768, -32768, 262,-32768, 19,-32768,-32768, 119, 1314, -9, -178, -27, -62,-32768,-32768, 3, 69, -4,-32768,-32768,-32768, -32768, 979,-32768,-32768, -222, -197, 10, -293, -201,-32768, -19,-32768, 6,-32768, -1,-32768,-32768,-32768,-32768,-32768, -32768,-32768, -163, -154, -138, -407, -28, 55,-32768,-32768, -29,-32768,-32768, 613, -105,-32768, -99,-32768,-32768,-32768, -32768, 498, 464, 634,-32768,-32768, -93, 48,-32768, -475, -33, -443, -266, -389,-32768,-32768, -32, -307, 139,-32768, -169, -123, -24,-32768 }; #define YYLAST 6030 static const short yytable[] = { 68, 68, 168, 256, 185, 335, 68, 68, 68, 68, 68, 68, 187, 338, 313, 320, 186, 203, 203, 203, 232, 77, 214, 226, 68, 209, 319, 466, 199, 199, 211, 316, 228, 230, 244, 525, 564, 460, 299, 433, 423, 460, 512, 514, -271, 349, 215, 297, 423, 68, 236, 466, 187, 218, 203, 559, 233, 302, 250, 251, 250, 251, 563, 310, 187, 310, 561, -272, 565, 492, 250, 251, 81, 82, 78, 203, 371, 258, 79, 68, 252, 424, 425, 316, 250, 251, 296, 287, 340, 424, 425, 250, 251, 493, 289, 284, 424, 425, 416, 341, 342, 452, 295, 424, 425, 352, 80, 356, 426, 359, 353, 463, 291, 564, 281, 282, 283, 522, 222, 314, 292, 241, 242, 285, 455, 289, 286, 174, 177, 293, 179, 180, 300, 358, 577, 422, 253, 294, 353, 68, 76, 76, 241, 242, 212, 600, 76, 76, 76, 76, 76, 76, 215, 241, 242, 318, 318, 76, 76, 76, 433, 460, 297, 518, 76, 595, 241, 242, 241, 242, 469, 589, 590, 241, 242, 291, 591, 293, 487, 485, 547, -299, -339, 292, -298, 294, 488, 486, 548, 76, -300, 68, 321, 258, 76, 203, 226, 400, 401, 298, -301, 402, 328, -50, 307, -53, 199, 203, -339, 203, -339, 604, -304, -339, 337, 76, -339, 68, 199, 76, 322, -303, 68, 323, -209, 466, -302, 226, 279, 280, 281, 282, 283, 369, 284, 250, 251, 405, 401, 460, -304, 406, 321, -304, 68, 68, 68, 68, 68, 68, 68, -294, -209, 68, 187, -209, -210, -297, 372, 304, 533, 306, 332, 57, 361, 333, 308, 78, 485, 170, 348, 79, 178, 333, 417, 418, 486, 449, 401, 76, 526, 450, 517, 289, -210, 203, 541, -210, 314, 437, 258, -45, 546, 547, 203, 443, -52, 196, 461, 530, 433, 548, 68, 462, 401, 271, 272, 406, 241, 242, 68, 481, 68, 521, 522, 208, 68, 210, 68, -39, -46, -51, 203, 68, 278, 279, 280, 281, 282, 283, 574, 76, 203, 324, 576, 76, 330, 557, 334, 470, 346, 258, 350, 258, 344, 68, 351, 76, -38, 76, 246, 247, 248, 249, 355, 357, 373, 76, 271, 272, 438, 441, 76, 444, 446, 362, 363, 364, 365, 366, 367, 456, 187, 467, 468, 276, 277, 278, 279, 280, 281, 282, 283, 474, 76, 76, 76, 76, 76, 76, 76, 475, 479, 76, -46, 478, 501, 497, 603, 491, 502, 503, 504, 203, 508, 594, 203, 505, 509, 511, 520, 513, 318, 518, 484, 527, 522, 490, 68, 68, 528, 483, 489, 404, 407, 76, 68, 529, 194, 318, 515, 516, 532, 534, 76, 537, 555, 68, 558, 425, 570, 571, 76, 453, 579, 580, 584, 586, 583, 585, 76, 588, 76, 587, 598, 605, 76, 608, 76, 609, 448, 451, 76, 76, 606, 550, 495, 596, 593, 158, 68, 407, 76, 592, 506, 554, 560, 0, 0, 187, 347, 0, 203, 539, 185, 76, 0, 451, 203, 0, 0, 0, 187, 68, 68, 0, 186, 68, 258, 73, 73, 0, 0, 157, 0, 73, 73, 73, 73, 73, 73, 189, 0, 271, 272, 0, 68, 0, 0, 0, 68, 68, 0, 73, 0, 68, 0, 0, 0, 68, 0, 0, 0, 279, 280, 281, 282, 283, 499, 0, 0, 0, 0, 76, 0, 0, 76, 0, 73, 0, 0, 189, 0, 0, 0, 0, 0, 0, 76, 76, 0, 0, 0, 189, 0, 421, 76, 0, 0, 0, 0, 0, 0, 440, 0, 442, 0, 76, 73, 445, 0, 447, 0, 0, 0, 0, 0, 0, 0, 0, 536, 68, 0, 68, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 473, 0, 76, 0, 0, 0, 70, 70, 0, 0, 0, 0, 70, 0, 76, 70, 0, 0, 0, 0, 76, 0, 0, 0, 0, 76, 76, 75, 75, 76, 73, 0, 568, 75, 75, 75, 75, 75, 75, 190, 0, 0, 0, 0, 0, 0, 0, 0, 76, 0, 0, 75, 76, 76, 0, 70, 0, 76, 0, 0, 0, 76, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 500, 0, 75, 0, 0, 190, 0, 507, 73, 0, 0, 0, 0, 0, 0, 0, 0, 190, 519, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 75, 0, 73, 0, 0, 0, 0, 73, 0, 0, 0, 0, 0, 0, 0, 0, 0, 76, 0, 76, 0, 0, 0, 0, 0, 0, 0, 0, 0, 73, 73, 73, 73, 73, 73, 73, 0, 0, 73, 189, 0, 0, 551, 552, 0, 0, 553, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 75, 0, 0, 0, 0, 567, 0, 0, 0, 0, 569, 0, 0, 0, 572, 0, 0, 0, 573, 0, 0, 0, 0, 0, 0, 0, 0, 73, 0, 0, 0, 70, 0, 0, 0, 73, 0, 73, 0, 0, 0, 73, 0, 73, 0, 0, 0, 0, 73, 0, 0, 0, 75, 0, 0, 0, 0, 70, 0, 0, 0, 0, 70, 0, 0, 0, 0, 0, 0, 0, 73, 0, 0, 0, 0, 0, 0, 0, 75, 0, 601, 0, 602, 75, 70, 0, 258, -32768,-32768,-32768,-32768, 263, 264, 70, 0,-32768,-32768, 189, 0, 0, 0, 271, 272, 0, 0, 75, 75, 75, 75, 75, 75, 75, 0, 0, 75, 190, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 70, 73, 73, 0, 0, 0, 0, 0, 70, 73, 70, 0, 0, 0, 70, 0, 70, 0, 0, 0, 73, 75, 0, 0, 0, 0, 0, 0, 0, 75, 0, 75, 0, 0, 0, 75, 0, 75, 0, 0, 0, 0, 75, 70, 0, 0, 0, 0, 0, 0, 0, 0, 0, 73, 0, 0, 0, 0, 0, 0, 0, 0, 189, 0, 75, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 189, 73, 73, 0, 0, 73, 198, 198, 198, 0, 0, 0, 0, 0, 0, 0, 190, 0, 0, 0, 0, 0, 0, 0, 73, 0, 0, 0, 73, 73, 0, 0, 0, 73, 0, 219, 221, 73, 0, 227, 198, 0, 70, 239, 240, 0, 0, 0, 0, 70, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 70, 0, 75, 75, 198, 0, 0, 0, 0, 0, 75, 0, 0, 258, 259, 260, 261, 262, 263, 264, 265, 75, 267, 268, 0, 0, 0, 0, 271, 272, 0, 0, 0, 0, 0, 0, 0, 0, 0, 73, 0, 73, 0, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 0, 75, 0, 70, 70, 0, 0, 70, 0, 0, 190, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 190, 75, 75, 70, 0, 75, 0, 0, 70, 0, 0, 0, 70, 0, 0, 0, 70, 0, 0, 0, 0, 0, 0, 0, 75, 0, 0, 0, 75, 75, 0, 0, 0, 75, 0, 0, 0, 75, 0, 0, 0, 0, 0, 0, 0, 325, 326, 239, 198, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 198, 0, 198, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 70, 0, 70, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 75, 0, 75, 0, 0, 227, 0, 0, 0, 0, 0, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 0, 0, 198, 0, 0, 0, 0, 412, 0, 414, 415, 198, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 227, 0, 0, 0, 0, 0, 227, 0, 0, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 0, 0, 457, 459, 0, 0, 198, 465, 0, 0, 0, 0, 0, 0, 0, 0, 175, 175, 472, 175, 175, 0, 0, 0, 0, 476, 197, 197, 197, 0, 0, 465, 0, 175, 258, 259, 260, 261, 262, 263, 264, 477, 0, 267, 268, 0, 0, 0, 0, 271, 272, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 238, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 0, 0, 0, 198, 0, 0, 198, 0, 0, 0, 197, 0, 496, 0, 175, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 0, 0, 271, 272, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 273, 0, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 0, 0, 531, 0, 0, 0, 0, 454, 535, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 175, 0, 0, 476, 0, 0, 0, 540, 198, 0, 542, 543, 544, 545, 198, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268,-32768, -32768, 556, 0, 271, 272, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 476, 0, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 0, 197, 465, 0, 0, 0, 0, 0, 578, 0, 0, 0, 0, 197, 0, 197, 0, 581, 582, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 0, 599, 271, 272, 0, 0, 0, 175, 175, 175, 175, 175, 175, 0, 0, 273, 482, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 0, 0, 197, 0, 0, -4, 2, 0, 3, 4, 5, 6, 7, 0, 0, 0, 8, 9, 0, 0, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 197, 175, 18, 19, 20, 21, 22, 23, 24, 0, 197, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 55, 56, 197, 0, 0, 197, 0, 0, 0, 0, 0, 0, -4, -4, 0, 0, 0, 175, 0, 0, 0, 0, 0, 0, 0, 0, -294, 0, 0, 0, 0, 0, 0, 0, -294, -294, -294, 0, 0, 0, -294, -294, 0, -294, 0, 0, 0, 0, 0, 0, 0, 0, -268, 0, 0, 0, 0, 0, 0, 0, -294, -294, 0, -294, -294, -294, -294, 0, 0, 175, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 197, 0, 0, -294, -294, -294, -294, -294, -294, -294, -294, -294, -294, -294, -294, -294, 0, 0, -294, -294, -294, 0, -294, 0, 0, 0, 0, 0, 0, 0, -294, -294, 175, -294, -294, -294, -294, -294, -294, -294, -294, -294, -294, 0, -297, 0, 0, -294, -294, -294, -294, -294, -297, -297, -297, -294, -294, 0, -297, -297, 0, -297, 0, 0, 0, 0, 0, 0, 0, 0, -269, 0, 0, 0, 0, 0, 0, 0, -297, -297, 0, -297, -297, -297, -297, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -297, -297, -297, -297, -297, -297, -297, -297, -297, -297, -297, -297, -297, 0, 0, -297, -297, -297, 0, -297, 0, 0, 0, 0, 0, 0, 0, -297, -297, 0, -297, -297, -297, -297, -297, -297, -297, -297, -297, -297, 0, -221, 0, 0, -297, -297, -297, -297, -297, -221, -221, -221, -297, -297, 0, -221, -221, 0, -221, 0, 0, 0, 0, 0, 0, 0, 0, -270, 0, 0, 0, 0, 0, 0, 0, -221, -221, 0, -221, -221, -221, -221, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -221, -221, -221, -221, -221, -221, -221, -221, -221, -221, -221, -221, -221, 0, 0, -221, -221, -221, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -221, 0, -221, -221, -221, -221, -221, -221, -221, -221, -221, -221, 0, 0, 0, 0, -221, -221, -221, 0, -221, 0, 0, 0, -221, -221, 2, 0, 3, 4, 5, 6, 7, -4, -4, -4, 8, 9, 0, 0, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 55, 56, 0, 0, 0, 2, 0, 3, 4, 5, 6, 7, -4, -4, -4, 8, 9, 0, -4, -4, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 2, 0, 3, 4, 5, 6, 7, 0, 0, -4, 8, 9, 55, 56, -4, 10, -4, 11, 12, 13, 14, 15, 16, 17, -4, -4, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 2, 0, 3, 4, 5, 6, 7, 0, 0, -4, 8, 9, 55, 56, -4, 10, 0, 11, 12, 13, 14, 15, 16, 17, -4, -4, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 2, 0, 3, 4, 5, 6, 7, 0, 0, 0, 8, 9, 55, 56, 0, 10, -4, 11, 12, 13, 14, 15, 16, 17, -4, -4, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 2, 0, 3, 4, 5, 6, 7, 0, 0, 0, 8, 9, 55, 56, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, -4, -4, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 223, 51, 52, 53, 0, 54, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 55, 56, 0, 0, 0, 2, -4, 3, 4, 5, 6, 7, -4, -4, 0, 8, 9, 0, 0, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 55, 56, 0, 0, 0, 2, -4, 3, 4, 5, 6, 7, -4, -4, 0, 8, 9, 0, 0, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 2, 0, 3, 4, 5, 6, 7, 0, 0, -4, 8, 9, 55, 56, 0, 10, -4, 11, 12, 13, 14, 15, 16, 17, -4, -4, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 0, 0, 3, 4, 5, 6, 7, 0, 0, 0, 8, 9, 55, 56, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, -4, -4, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 55, 56, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 360, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 193, 194, 54, 0, 0, -339, -339, -339, 0, -339, 0, 0, 0, -339, -339, 0, 195, 56, -339, 289, -339, -339, -339, -339, -339, -339, -339, 295, 0, -339, -339, -339, -339, -339, -339, -339, 0, 0, 0, 0, 0, 0, 0, 0, -339, 0, 0, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -339, 0, 0, -339, -339, -339, -339, -339, -339, 0, 0, -341, -341, -341, 0, -341, 0, 0, 0, -341, -341, 0, -339, -339, -341, -339, -341, -341, -341, -341, -341, -341, -341, -339, 0, -341, -341, -341, -341, -341, -341, -341, 0, 0, 0, 0, 0, 0, 0, 0, -341, 0, 0, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, -341, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -341, 0, 0, -341, -341, -341, -341, -341, -341, 0, 0, -340, -340, -340, 0, -340, 0, 0, 0, -340, -340, 0, -341, -341, -340, -341, -340, -340, -340, -340, -340, -340, -340, -341, 0, -340, -340, -340, -340, -340, -340, -340, 0, 0, 0, 0, 0, 0, 0, 0, -340, 0, 0, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -340, 0, 0, -340, -340, -340, -340, -340, -340, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, -340, -340, 10, -340, 11, 12, 13, 14, 15, 16, 17, -340, 0, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 193, 194, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 196, 0, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 193, 194, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 208, 0, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 193, 194, 54, 0, 0, -339, -339, -339, 0, -339, 0, 0, 0, -339, -339, 0, 195, 56, -339, 0, -339, -339, -339, -339, -339, -339, -339, 210, 0, -339, -339, -339, -339, -339, -339, -339, 0, 0, 0, 0, 0, 0, 0, 0, -339, 0, 0, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, -339, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -339, 0, 0, -339, -339, -339, -339, -339, -339, 0, 0, -340, -340, -340, 0, -340, 0, 0, 0, -340, -340, 0, -339, -339, -340, 0, -340, -340, -340, -340, -340, -340, -340, -339, 0, -340, -340, -340, -340, -340, -340, -340, 0, 0, 0, 0, 0, 0, 0, 0, -340, 0, 0, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, -340, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -340, 0, 0, -340, -340, -340, -340, -340, -340, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, -340, -340, 10, 0, 11, 12, 13, 14, 15, 16, 17, -340, 0, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 193, 194, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 483, 0, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 193, 194, 54, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 195, 56, 83, 84, 85, 86, 87, 88, 89, 90, 0, 489, 91, 92, 93, 94, 95, 0, 0, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 34, 35, 125, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 126, 127, 128, 129, 130, 131, 0, 132, 133, 0, 0, 134, 0, 135, 0, 136, 137, 138, 139, 0, 0, 0, 0, 140, 0, 0, 141, 0, 0, 0, 0, 0, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 0, 152, 83, 84, 85, 86, 87, 88, 89, 90, 153, 0, 91, 92, 93, 94, 95, 0, 0, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 160, 161, 162, 163, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 164, 165, 166, 124, 234, 235, 167, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 126, 127, 128, 129, 130, 131, 0, 132, 133, 0, 0, 134, 0, 135, 0, 136, 137, 138, 139, 0, 0, 0, 0, 0, 0, 0, 141, 0, 0, 0, 0, 0, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 0, 152, 83, 84, 85, 86, 87, 88, 89, 90, 153, 0, 91, 92, 93, 94, 95, 0, 0, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 160, 161, 162, 163, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 164, 165, 166, 124, 213, 0, 167, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 126, 127, 128, 129, 130, 131, 0, 132, 133, 0, 0, 134, 0, 135, 0, 136, 137, 138, 139, 0, 0, 0, 0, 0, 0, 0, 141, 0, 0, 0, 0, 0, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 0, 152, 83, 84, 85, 86, 87, 88, 89, 90, 153, 0, 91, 92, 93, 94, 95, 0, 0, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 160, 161, 162, 163, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 164, 165, 166, 124, 0, 0, 167, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 126, 127, 128, 129, 130, 131, 0, 132, 133, 0, 0, 134, 0, 135, 0, 136, 137, 138, 139, 0, 0, 0, 0, 0, 0, 0, 141, 0, 0, 0, 0, 0, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 0, 152, 0, 3, 4, 5, 0, 7, 0, 0, 153, 8, 9, 0, 0, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 193, 194, 54, 0, 0, 0, 0, 0, 0, 0, 3, 4, 5, 0, 7, 0, 195, 56, 8, 9, 0, 0, 327, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 193, 194, 54, 0, 0, 0, 0, 0, 0, 0, 3, 4, 5, 6, 7, 0, 195, 56, 8, 9, 0, 0, 336, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 55, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 18, 19, 20, 21, 22, 23, 24, 0, 0, 25, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 55, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 193, 194, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 458, 194, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 464, 194, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 575, 194, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 368, 0, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 538, 0, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 0, 0, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 192, 51, 52, 0, 0, 54, 0, 0, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 195, 56, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 184, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 3, 4, 5, 0, 7, 549, 0, 0, 8, 9, 0, 0, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 184, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 50, 51, 52, 53, 0, 54, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 0, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 184, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 254, 51, 52, 255, 0, 54, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 0, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 184, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 49, 0, 0, 254, 51, 52, 480, 0, 54, 3, 4, 5, 0, 7, 0, 0, 0, 8, 9, 0, 0, 0, 10, 0, 11, 12, 13, 14, 15, 16, 17, 0, 0, 181, 182, 183, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0, 184, 0, 0, 30, 31, 171, 172, 34, 35, 173, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 0, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 0, 0, 271, 272, 0, 0, 49, 329, 0, 192, 51, 52, 0, 0, 54, 273, 0, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 0, 0, 271, 272, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 273, 0, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283 }; static const short yycheck[] = { 1, 2, 6, 65, 13, 206, 7, 8, 9, 10, 11, 12, 13, 210, 177, 184, 13, 18, 19, 20, 52, 2, 26, 50, 25, 19, 180, 334, 18, 19, 20, 26, 51, 52, 58, 442, 511, 330, 1, 305, 47, 334, 431, 432, 26, 223, 116, 76, 47, 50, 54, 358, 53, 107, 55, 47, 53, 81, 34, 35, 34, 35, 47, 13, 65, 13, 509, 26, 511, 72, 34, 35, 3, 4, 47, 76, 254, 64, 51, 80, 91, 88, 89, 26, 34, 35, 76, 26, 49, 88, 89, 34, 35, 96, 107, 81, 88, 89, 295, 60, 61, 323, 115, 88, 89, 111, 79, 230, 115, 232, 116, 333, 83, 588, 101, 102, 103, 15, 49, 17, 91, 116, 117, 109, 325, 107, 112, 8, 9, 83, 11, 12, 95, 111, 110, 304, 111, 91, 116, 140, 1, 2, 116, 117, 25, 588, 7, 8, 9, 10, 11, 12, 116, 116, 117, 179, 180, 18, 19, 20, 426, 454, 191, 111, 25, 572, 116, 117, 116, 117, 339, 560, 561, 116, 117, 83, 565, 83, 83, 83, 83, 109, 81, 91, 109, 91, 91, 91, 91, 50, 109, 192, 81, 64, 55, 196, 223, 47, 48, 80, 109, 51, 196, 111, 111, 111, 196, 208, 107, 210, 109, 600, 81, 112, 208, 76, 115, 218, 208, 80, 109, 109, 223, 112, 81, 532, 109, 254, 99, 100, 101, 102, 103, 252, 81, 34, 35, 47, 48, 532, 109, 51, 81, 112, 245, 246, 247, 248, 249, 250, 251, 109, 109, 254, 255, 112, 81, 109, 255, 140, 461, 109, 109, 1, 245, 112, 8, 47, 83, 7, 109, 51, 10, 112, 298, 299, 91, 47, 48, 140, 443, 51, 436, 107, 109, 286, 483, 112, 17, 308, 64, 111, 489, 83, 295, 314, 111, 115, 330, 453, 566, 91, 303, 47, 48, 79, 80, 51, 116, 117, 311, 373, 313, 14, 15, 115, 317, 115, 319, 110, 111, 111, 323, 324, 98, 99, 100, 101, 102, 103, 531, 192, 333, 25, 535, 196, 111, 506, 111, 343, 107, 64, 110, 64, 115, 346, 110, 208, 110, 210, 37, 38, 39, 40, 113, 108, 111, 218, 79, 80, 9, 13, 223, 10, 26, 246, 247, 248, 249, 250, 251, 110, 373, 110, 110, 96, 97, 98, 99, 100, 101, 102, 103, 108, 245, 246, 247, 248, 249, 250, 251, 110, 110, 254, 111, 111, 10, 110, 599, 113, 110, 91, 47, 404, 428, 568, 407, 47, 111, 111, 10, 111, 436, 111, 404, 10, 15, 407, 419, 420, 10, 115, 115, 284, 285, 286, 427, 113, 89, 453, 434, 435, 111, 113, 295, 108, 10, 438, 10, 89, 10, 10, 303, 324, 110, 110, 10, 10, 96, 108, 311, 111, 313, 110, 10, 10, 317, 0, 319, 0, 321, 322, 323, 324, 602, 493, 411, 572, 567, 5, 471, 332, 333, 566, 426, 499, 509, -1, -1, 480, 218, -1, 483, 480, 493, 346, -1, 348, 489, -1, -1, -1, 493, 494, 495, -1, 493, 498, 64, 1, 2, -1, -1, 5, -1, 7, 8, 9, 10, 11, 12, 13, -1, 79, 80, -1, 517, -1, -1, -1, 521, 522, -1, 25, -1, 526, -1, -1, -1, 530, -1, -1, -1, 99, 100, 101, 102, 103, 419, -1, -1, -1, -1, 404, -1, -1, 407, -1, 50, -1, -1, 53, -1, -1, -1, -1, -1, -1, 419, 420, -1, -1, -1, 65, -1, 303, 427, -1, -1, -1, -1, -1, -1, 311, -1, 313, -1, 438, 80, 317, -1, 319, -1, -1, -1, -1, -1, -1, -1, -1, 471, 592, -1, 594, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 346, -1, 471, -1, -1, -1, 1, 2, -1, -1, -1, -1, 7, -1, 483, 10, -1, -1, -1, -1, 489, -1, -1, -1, -1, 494, 495, 1, 2, 498, 140, -1, 521, 7, 8, 9, 10, 11, 12, 13, -1, -1, -1, -1, -1, -1, -1, -1, 517, -1, -1, 25, 521, 522, -1, 50, -1, 526, -1, -1, -1, 530, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 420, -1, 50, -1, -1, 53, -1, 427, 192, -1, -1, -1, -1, -1, -1, -1, -1, 65, 438, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 80, -1, 218, -1, -1, -1, -1, 223, -1, -1, -1, -1, -1, -1, -1, -1, -1, 592, -1, 594, -1, -1, -1, -1, -1, -1, -1, -1, -1, 245, 246, 247, 248, 249, 250, 251, -1, -1, 254, 255, -1, -1, 494, 495, -1, -1, 498, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 140, -1, -1, -1, -1, 517, -1, -1, -1, -1, 522, -1, -1, -1, 526, -1, -1, -1, 530, -1, -1, -1, -1, -1, -1, -1, -1, 303, -1, -1, -1, 192, -1, -1, -1, 311, -1, 313, -1, -1, -1, 317, -1, 319, -1, -1, -1, -1, 324, -1, -1, -1, 192, -1, -1, -1, -1, 218, -1, -1, -1, -1, 223, -1, -1, -1, -1, -1, -1, -1, 346, -1, -1, -1, -1, -1, -1, -1, 218, -1, 592, -1, 594, 223, 245, -1, 64, 65, 66, 67, 68, 69, 70, 254, -1, 73, 74, 373, -1, -1, -1, 79, 80, -1, -1, 245, 246, 247, 248, 249, 250, 251, -1, -1, 254, 255, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 303, 419, 420, -1, -1, -1, -1, -1, 311, 427, 313, -1, -1, -1, 317, -1, 319, -1, -1, -1, 438, 303, -1, -1, -1, -1, -1, -1, -1, 311, -1, 313, -1, -1, -1, 317, -1, 319, -1, -1, -1, -1, 324, 346, -1, -1, -1, -1, -1, -1, -1, -1, -1, 471, -1, -1, -1, -1, -1, -1, -1, -1, 480, -1, 346, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 493, 494, 495, -1, -1, 498, 18, 19, 20, -1, -1, -1, -1, -1, -1, -1, 373, -1, -1, -1, -1, -1, -1, -1, 517, -1, -1, -1, 521, 522, -1, -1, -1, 526, -1, 47, 48, 530, -1, 51, 52, -1, 420, 55, 56, -1, -1, -1, -1, 427, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 438, -1, 419, 420, 76, -1, -1, -1, -1, -1, 427, -1, -1, 64, 65, 66, 67, 68, 69, 70, 71, 438, 73, 74, -1, -1, -1, -1, 79, 80, -1, -1, -1, -1, -1, -1, -1, -1, -1, 592, -1, 594, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, 471, -1, 494, 495, -1, -1, 498, -1, -1, 480, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 493, 494, 495, 517, -1, 498, -1, -1, 522, -1, -1, -1, 526, -1, -1, -1, 530, -1, -1, -1, -1, -1, -1, -1, 517, -1, -1, -1, 521, 522, -1, -1, -1, 526, -1, -1, -1, 530, -1, -1, -1, -1, -1, -1, -1, 193, 194, 195, 196, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 208, -1, 210, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 592, -1, 594, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 592, -1, 594, -1, -1, 252, -1, -1, -1, -1, -1, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, -1, -1, 286, -1, -1, -1, -1, 291, -1, 293, 294, 295, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 308, -1, -1, -1, -1, -1, 314, -1, -1, -1, -1, -1, -1, -1, -1, 323, -1, -1, -1, -1, -1, 329, 330, -1, -1, 333, 334, -1, -1, -1, -1, -1, -1, -1, -1, 8, 9, 345, 11, 12, -1, -1, -1, -1, 352, 18, 19, 20, -1, -1, 358, -1, 25, 64, 65, 66, 67, 68, 69, 70, 368, -1, 73, 74, -1, -1, -1, -1, 79, 80, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 55, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, -1, -1, 404, -1, -1, 407, -1, -1, -1, 76, -1, 413, -1, 80, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, -1, -1, 79, 80, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 92, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, -1, 458, -1, -1, -1, -1, 111, 464, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 140, -1, -1, 478, -1, -1, -1, 482, 483, -1, 485, 486, 487, 488, 489, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 503, -1, 79, 80, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 518, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, 196, 532, -1, -1, -1, -1, -1, 538, -1, -1, -1, -1, 208, -1, 210, -1, 547, 548, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, -1, 575, 79, 80, -1, -1, -1, 246, 247, 248, 249, 250, 251, -1, -1, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 286, -1, -1, -1, -1, -1, -1, -1, -1, 295, -1, -1, 0, 1, -1, 3, 4, 5, 6, 7, -1, -1, -1, 11, 12, -1, -1, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, 323, 324, 27, 28, 29, 30, 31, 32, 33, -1, 333, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 104, 105, 404, -1, -1, 407, -1, -1, -1, -1, -1, -1, 116, 117, -1, -1, -1, 419, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, 8, 9, 10, -1, -1, -1, 14, 15, -1, 17, -1, -1, -1, -1, -1, -1, -1, -1, 26, -1, -1, -1, -1, -1, -1, -1, 34, 35, -1, 37, 38, 39, 40, -1, -1, 471, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 483, -1, -1, -1, -1, -1, 489, -1, -1, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, -1, -1, 79, 80, 81, -1, 83, -1, -1, -1, -1, -1, -1, -1, 91, 92, 521, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, 0, -1, -1, 108, 109, 110, 111, 112, 8, 9, 10, 116, 117, -1, 14, 15, -1, 17, -1, -1, -1, -1, -1, -1, -1, -1, 26, -1, -1, -1, -1, -1, -1, -1, 34, 35, -1, 37, 38, 39, 40, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, -1, -1, 79, 80, 81, -1, 83, -1, -1, -1, -1, -1, -1, -1, 91, 92, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, 0, -1, -1, 108, 109, 110, 111, 112, 8, 9, 10, 116, 117, -1, 14, 15, -1, 17, -1, -1, -1, -1, -1, -1, -1, -1, 26, -1, -1, -1, -1, -1, -1, -1, 34, 35, -1, 37, 38, 39, 40, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, -1, -1, 79, 80, 81, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 92, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, -1, -1, -1, 108, 109, 110, -1, 112, -1, -1, -1, 116, 117, 1, -1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, -1, -1, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 104, 105, -1, -1, -1, 1, -1, 3, 4, 5, 6, 7, 116, 117, 10, 11, 12, -1, 14, 15, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, 1, -1, 3, 4, 5, 6, 7, -1, -1, 10, 11, 12, 104, 105, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 116, 117, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, 1, -1, 3, 4, 5, 6, 7, -1, -1, 10, 11, 12, 104, 105, 15, 16, -1, 18, 19, 20, 21, 22, 23, 24, 116, 117, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, 1, -1, 3, 4, 5, 6, 7, -1, -1, -1, 11, 12, 104, 105, -1, 16, 17, 18, 19, 20, 21, 22, 23, 24, 116, 117, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, 1, -1, 3, 4, 5, 6, 7, -1, -1, -1, 11, 12, 104, 105, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, 116, 117, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 104, 105, -1, -1, -1, 1, 110, 3, 4, 5, 6, 7, 116, 117, -1, 11, 12, -1, -1, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 104, 105, -1, -1, -1, 1, 110, 3, 4, 5, 6, 7, 116, 117, -1, 11, 12, -1, -1, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, 1, -1, 3, 4, 5, 6, 7, -1, -1, 10, 11, 12, 104, 105, -1, 16, 108, 18, 19, 20, 21, 22, 23, 24, 116, 117, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, -1, 3, 4, 5, 6, 7, -1, -1, -1, 11, 12, 104, 105, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, 116, 117, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, 104, 105, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, 117, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, 107, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, 107, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, 107, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, 107, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, 115, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 104, 105, 3, 4, 5, 6, 7, 8, 9, 10, -1, 115, 13, 14, 15, 16, 17, -1, -1, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, 63, 64, 65, 66, 67, -1, 69, 70, -1, -1, 73, -1, 75, -1, 77, 78, 79, 80, -1, -1, -1, -1, 85, -1, -1, 88, -1, -1, -1, -1, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, 105, 3, 4, 5, 6, 7, 8, 9, 10, 114, -1, 13, 14, 15, 16, 17, -1, -1, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, 63, 64, 65, 66, 67, -1, 69, 70, -1, -1, 73, -1, 75, -1, 77, 78, 79, 80, -1, -1, -1, -1, -1, -1, -1, 88, -1, -1, -1, -1, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, 105, 3, 4, 5, 6, 7, 8, 9, 10, 114, -1, 13, 14, 15, 16, 17, -1, -1, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, -1, 51, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, 63, 64, 65, 66, 67, -1, 69, 70, -1, -1, 73, -1, 75, -1, 77, 78, 79, 80, -1, -1, -1, -1, -1, -1, -1, 88, -1, -1, -1, -1, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, 105, 3, 4, 5, 6, 7, 8, 9, 10, 114, -1, 13, 14, 15, 16, 17, -1, -1, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, -1, -1, 51, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, 63, 64, 65, 66, 67, -1, 69, 70, -1, -1, 73, -1, 75, -1, 77, 78, 79, 80, -1, -1, -1, -1, -1, -1, -1, 88, -1, -1, -1, -1, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, -1, 105, -1, 3, 4, 5, -1, 7, -1, -1, 114, 11, 12, -1, -1, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, -1, -1, -1, -1, -1, 3, 4, 5, -1, 7, -1, 104, 105, 11, 12, -1, -1, 110, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, -1, -1, -1, -1, -1, 3, 4, 5, 6, 7, -1, 104, 105, 11, 12, -1, -1, 110, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, 36, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, 89, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, -1, -1, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, -1, -1, 90, -1, -1, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, 104, 105, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, 3, 4, 5, -1, 7, 96, -1, -1, 11, 12, -1, -1, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, -1, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, -1, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 87, 88, -1, 90, 3, 4, 5, -1, 7, -1, -1, -1, 11, 12, -1, -1, -1, 16, -1, 18, 19, 20, 21, 22, 23, 24, -1, -1, 27, 28, 29, 30, 31, 32, 33, -1, -1, -1, -1, -1, -1, -1, -1, 42, -1, -1, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, -1, -1, 79, 80, -1, -1, 82, 84, -1, 85, 86, 87, -1, -1, 90, 92, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, -1, -1, 79, 80, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 92, -1, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/share/misc/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ /* As a special exception, when this file is copied by Bison into a Bison output file, you may use that output file without restriction. This special exception was added by the Free Software Foundation in version 1.24 of Bison. */ #ifndef alloca #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) #include #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #include #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #include #pragma alloca #else /* not MSDOS, __TURBOC__, or _AIX */ #ifdef __hpux #ifdef __cplusplus extern "C" { void *alloca (unsigned int); }; #else /* not __cplusplus */ void *alloca (); #endif /* not __cplusplus */ #endif /* __hpux */ #endif /* not _AIX */ #endif /* not MSDOS, or __TURBOC__ */ #endif /* not sparc. */ #endif /* not GNU C. */ #endif /* alloca not defined. */ /* This is the parser code that is written into each bison parser when the %semantic_parser declaration is not specified in the grammar. It was written by Richard Stallman by simplifying the hairy parser used when %semantic_parser is specified. */ /* Note: there must be only one dollar sign in this file. It is replaced by the list of actions, each action as one case of the switch. */ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT return(0) #define YYABORT return(1) #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(token, value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { yychar = (token), yylval = (value); \ yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { yyerror ("syntax error: cannot back up"); YYERROR; } \ while (0) #define YYTERROR 1 #define YYERRCODE 256 #ifndef YYPURE #define YYLEX yylex() #endif #ifdef YYPURE #ifdef YYLSP_NEEDED #ifdef YYLEX_PARAM #define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) #else #define YYLEX yylex(&yylval, &yylloc) #endif #else /* not YYLSP_NEEDED */ #ifdef YYLEX_PARAM #define YYLEX yylex(&yylval, YYLEX_PARAM) #else #define YYLEX yylex(&yylval) #endif #endif /* not YYLSP_NEEDED */ #endif /* If nonreentrant, generate the variables here */ #ifndef YYPURE int yychar; /* the lookahead symbol */ YYSTYPE yylval; /* the semantic value of the */ /* lookahead symbol */ #ifdef YYLSP_NEEDED YYLTYPE yylloc; /* location data for the lookahead */ /* symbol */ #endif int yynerrs; /* number of parse errors so far */ #endif /* not YYPURE */ #if YYDEBUG != 0 int yydebug; /* nonzero means print parse trace */ /* Since this is uninitialized, it does not stop multiple parsers from coexisting. */ #endif /* YYINITDEPTH indicates the initial size of the parser's stacks */ #ifndef YYINITDEPTH #define YYINITDEPTH 200 #endif /* YYMAXDEPTH is the maximum size the stacks can grow to (effective only if the built-in stack extension method is used). */ #if YYMAXDEPTH == 0 #undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH #define YYMAXDEPTH 10000 #endif /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ int yyparse (void); #endif #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ #define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) #else /* not GNU C or C++ */ #ifndef __cplusplus /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_memcpy (to, from, count) char *to; char *from; int count; { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #else /* __cplusplus */ /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_memcpy (char *to, char *from, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif #line 196 "/usr/share/misc/bison.simple" /* The user can define YYPARSE_PARAM as the name of an argument to be passed into yyparse. The argument should have type void *. It should actually point to an object. Grammar actions can access the variable by casting it to the proper pointer type. */ #ifdef YYPARSE_PARAM #ifdef __cplusplus #define YYPARSE_PARAM_ARG void *YYPARSE_PARAM #define YYPARSE_PARAM_DECL #else /* not __cplusplus */ #define YYPARSE_PARAM_ARG YYPARSE_PARAM #define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; #endif /* not __cplusplus */ #else /* not YYPARSE_PARAM */ #define YYPARSE_PARAM_ARG #define YYPARSE_PARAM_DECL #endif /* not YYPARSE_PARAM */ int yyparse(YYPARSE_PARAM_ARG) YYPARSE_PARAM_DECL { register int yystate; register int yyn; register short *yyssp; register YYSTYPE *yyvsp; int yyerrstatus; /* number of tokens to shift before error messages enabled */ int yychar1 = 0; /* lookahead token as an internal (translated) token number */ short yyssa[YYINITDEPTH]; /* the state stack */ YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ short *yyss = yyssa; /* refer to the stacks thru separate pointers */ YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ #ifdef YYLSP_NEEDED YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ YYLTYPE *yyls = yylsa; YYLTYPE *yylsp; #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) #else #define YYPOPSTACK (yyvsp--, yyssp--) #endif int yystacksize = YYINITDEPTH; #ifdef YYPURE int yychar; YYSTYPE yylval; int yynerrs; #ifdef YYLSP_NEEDED YYLTYPE yylloc; #endif #endif YYSTYPE yyval; /* the variable used to return */ /* semantic values from the action */ /* routines */ int yylen; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Starting parse\n"); #endif yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ yyssp = yyss - 1; yyvsp = yyvs; #ifdef YYLSP_NEEDED yylsp = yyls; #endif /* Push a new state, which is found in yystate . */ /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yynewstate: *++yyssp = yystate; if (yyssp >= yyss + yystacksize - 1) { /* Give user a chance to reallocate the stack */ /* Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; #ifdef YYLSP_NEEDED YYLTYPE *yyls1 = yyls; #endif /* Get the current used size of the three stacks, in elements. */ int size = yyssp - yyss + 1; #ifdef yyoverflow /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ #ifdef YYLSP_NEEDED /* This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yyls1, size * sizeof (*yylsp), &yystacksize); #else yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yystacksize); #endif yyss = yyss1; yyvs = yyvs1; #ifdef YYLSP_NEEDED yyls = yyls1; #endif #else /* no yyoverflow */ /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) { yyerror("parser stack overflow"); return 2; } yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; yyss = (short *) alloca (yystacksize * sizeof (*yyssp)); __yy_memcpy ((char *)yyss, (char *)yyss1, size * sizeof (*yyssp)); yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); __yy_memcpy ((char *)yyvs, (char *)yyvs1, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); __yy_memcpy ((char *)yyls, (char *)yyls1, size * sizeof (*yylsp)); #endif #endif /* no yyoverflow */ yyssp = yyss + size - 1; yyvsp = yyvs + size - 1; #ifdef YYLSP_NEEDED yylsp = yyls + size - 1; #endif #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Stack size increased to %d\n", yystacksize); #endif if (yyssp >= yyss + yystacksize - 1) YYABORT; } #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Entering state %d\n", yystate); #endif goto yybackup; yybackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* yyresume: */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* yychar is either YYEMPTY or YYEOF or a valid token in external form. */ if (yychar == YYEMPTY) { #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Reading a token: "); #endif yychar = YYLEX; } /* Convert token to internal form (in yychar1) for indexing tables with */ if (yychar <= 0) /* This means end of input. */ { yychar1 = 0; yychar = YYEOF; /* Don't call YYLEX any more */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Now at end of input.\n"); #endif } else { yychar1 = YYTRANSLATE(yychar); #if YYDEBUG != 0 if (yydebug) { fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); /* Give the individual parser a way to print the precise meaning of a token, for further debugging info. */ #ifdef YYPRINT YYPRINT (stderr, yychar, yylval); #endif fprintf (stderr, ")\n"); } #endif } yyn += yychar1; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; yyn = yytable[yyn]; /* yyn is what to do for this token type in this state. Negative => reduce, -yyn is rule number. Positive => shift, yyn is new state. New state is final state => don't bother to shift, just return success. 0, or most negative number => error. */ if (yyn < 0) { if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); #endif /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif /* count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /* Do the default action for the current state. */ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; /* Do a reduction. yyn is the number of a rule to reduce with. */ yyreduce: yylen = yyr2[yyn]; if (yylen > 0) yyval = yyvsp[1-yylen]; /* implement default value of the action */ #if YYDEBUG != 0 if (yydebug) { int i; fprintf (stderr, "Reducing via rule %d (line %d), ", yyn, yyrline[yyn]); /* Print the symbols being reduced, and their result. */ for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) fprintf (stderr, "%s ", yytname[yyrhs[i]]); fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); } #endif switch (yyn) { case 1: #line 238 "parse.y" { yyval.vars = the_dyna_vars; lex_state = EXPR_BEG; top_local_init(); NEW_CREF0(); /* initialize constant c-ref */ if ((VALUE)the_class == cObject) class_nest = 0; else class_nest = 1; ; break;} case 2: #line 247 "parse.y" { eval_tree = block_append(eval_tree, yyvsp[0].node); top_local_setup(); cur_cref = 0; class_nest = 0; the_dyna_vars = yyvsp[-1].vars; ; break;} case 4: #line 258 "parse.y" { yyval.node = 0; ; break;} case 5: #line 262 "parse.y" { yyval.node = newline_node(yyvsp[0].node); ; break;} case 6: #line 266 "parse.y" { yyval.node = block_append(yyvsp[-2].node, newline_node(yyvsp[0].node)); ; break;} case 7: #line 270 "parse.y" { yyval.node = yyvsp[0].node; ; break;} case 8: #line 275 "parse.y" { if (yyvsp[-1].node && nd_type(yyvsp[-1].node) == NODE_BLOCK_PASS) { Error("both block arg and actual block given"); } yyvsp[0].node->nd_iter = yyvsp[-1].node; yyval.node = yyvsp[0].node; fixpos(yyval.node, yyvsp[0].node); ; break;} case 9: #line 283 "parse.y" {lex_state = EXPR_FNAME;; break;} case 10: #line 284 "parse.y" { if (cur_mid || in_single) yyerror("alias within method"); yyval.node = NEW_ALIAS(yyvsp[-2].id, yyvsp[0].id); ; break;} case 11: #line 290 "parse.y" { if (cur_mid || in_single) yyerror("alias within method"); yyval.node = NEW_VALIAS(yyvsp[-1].id, yyvsp[0].id); ; break;} case 12: #line 296 "parse.y" { char buf[3]; if (cur_mid || in_single) yyerror("alias within method"); sprintf(buf, "$%c", yyvsp[0].node->nd_nth); yyval.node = NEW_VALIAS(yyvsp[-1].id, rb_intern(buf)); ; break;} case 13: #line 305 "parse.y" { yyerror("can't make alias for the number variables"); yyval.node = 0; ; break;} case 14: #line 310 "parse.y" { if (cur_mid || in_single) yyerror("undef within method"); yyval.node = yyvsp[0].node; ; break;} case 15: #line 316 "parse.y" { value_expr(yyvsp[0].node); yyval.node = NEW_IF(cond(yyvsp[0].node), yyvsp[-2].node, 0); fixpos(yyval.node, yyvsp[0].node); ; break;} case 16: #line 322 "parse.y" { value_expr(yyvsp[0].node); yyval.node = NEW_UNLESS(cond(yyvsp[0].node), yyvsp[-2].node, 0); fixpos(yyval.node, yyvsp[0].node); ; break;} case 17: #line 328 "parse.y" { value_expr(yyvsp[0].node); if (nd_type(yyvsp[-2].node) == NODE_BEGIN) { yyval.node = NEW_WHILE(cond(yyvsp[0].node), yyvsp[-2].node->nd_body, 0); } else { yyval.node = NEW_WHILE(cond(yyvsp[0].node), yyvsp[-2].node, 1); } ; break;} case 18: #line 338 "parse.y" { value_expr(yyvsp[0].node); if (nd_type(yyvsp[-2].node) == NODE_BEGIN) { yyval.node = NEW_UNTIL(cond(yyvsp[0].node), yyvsp[-2].node->nd_body, 0); } else { yyval.node = NEW_UNTIL(cond(yyvsp[0].node), yyvsp[-2].node, 1); } ; break;} case 19: #line 348 "parse.y" { if (cur_mid || in_single) { yyerror("BEGIN in method"); } local_push(); ; break;} case 20: #line 356 "parse.y" { eval_tree_begin = block_append(eval_tree_begin, NEW_PREEXE(yyvsp[-1].node)); local_pop(); yyval.node = 0; ; break;} case 21: #line 363 "parse.y" { if (cur_mid || in_single) { yyerror("END in method; use at_exit"); } yyval.node = NEW_ITER(0, NEW_POSTEXE(), yyvsp[-1].node); ; break;} case 23: #line 373 "parse.y" { value_expr(yyvsp[0].node); yyvsp[-2].node->nd_value = yyvsp[0].node; yyval.node = yyvsp[-2].node; ; break;} case 24: #line 379 "parse.y" { value_expr(yyvsp[0].node); if (!cur_mid && !in_single) yyerror("return appeared outside of method"); yyval.node = NEW_RET(yyvsp[0].node); ; break;} case 25: #line 386 "parse.y" { value_expr(yyvsp[0].node); yyval.node = NEW_YIELD(yyvsp[0].node); ; break;} case 27: #line 392 "parse.y" { yyval.node = logop(NODE_AND, yyvsp[-2].node, yyvsp[0].node); ; break;} case 28: #line 396 "parse.y" { yyval.node = logop(NODE_OR, yyvsp[-2].node, yyvsp[0].node); ; break;} case 29: #line 400 "parse.y" { value_expr(yyvsp[0].node); yyval.node = NEW_NOT(cond(yyvsp[0].node)); ; break;} case 30: #line 405 "parse.y" { value_expr(yyvsp[0].node); yyval.node = NEW_NOT(cond(yyvsp[0].node)); ; break;} case 32: #line 412 "parse.y" { yyval.node = new_fcall(yyvsp[-1].id, yyvsp[0].node); fixpos(yyval.node, yyvsp[0].node); ; break;} case 33: #line 417 "parse.y" { value_expr(yyvsp[-3].node); yyval.node = new_call(yyvsp[-3].node, yyvsp[-1].id, yyvsp[0].node); fixpos(yyval.node, yyvsp[-3].node); ; break;} case 34: #line 423 "parse.y" { value_expr(yyvsp[-3].node); yyval.node = new_call(yyvsp[-3].node, yyvsp[-1].id, yyvsp[0].node); fixpos(yyval.node, yyvsp[-3].node); ; break;} case 35: #line 429 "parse.y" { if (!cur_mid && !in_single && !in_defined) yyerror("super called outside of method"); yyval.node = NEW_SUPER(yyvsp[0].node); fixpos(yyval.node, yyvsp[0].node); ; break;} case 37: #line 438 "parse.y" { yyval.node = yyvsp[-1].node; ; break;} case 39: #line 444 "parse.y" { yyval.node = NEW_MASGN(NEW_LIST(yyvsp[-1].node), 0); ; break;} case 40: #line 449 "parse.y" { yyval.node = NEW_MASGN(NEW_LIST(yyvsp[0].node), 0); ; break;} case 41: #line 453 "parse.y" { yyval.node = NEW_MASGN(NEW_LIST(yyvsp[-2].node), yyvsp[0].node); ; break;} case 42: #line 457 "parse.y" { yyval.node = NEW_MASGN(list_concat(NEW_LIST(yyvsp[-1].node),yyvsp[0].node), 0); ; break;} case 43: #line 461 "parse.y" { yyval.node = NEW_MASGN(list_concat(NEW_LIST(yyvsp[-4].node),yyvsp[-3].node),yyvsp[0].node); ; break;} case 44: #line 465 "parse.y" { yyval.node = NEW_MASGN(0, yyvsp[0].node); ; break;} case 46: #line 471 "parse.y" { yyval.node = yyvsp[-1].node; ; break;} case 47: #line 476 "parse.y" { yyval.node = yyvsp[-1].node; ; break;} case 48: #line 481 "parse.y" { yyval.node = NEW_LIST(yyvsp[0].node); ; break;} case 49: #line 485 "parse.y" { yyval.node = list_append(yyvsp[-2].node, yyvsp[0].node); ; break;} case 50: #line 490 "parse.y" { yyval.node = assignable(yyvsp[0].id, 0); ; break;} case 51: #line 494 "parse.y" { yyval.node = aryset(yyvsp[-3].node, yyvsp[-1].node, 0); ; break;} case 52: #line 498 "parse.y" { yyval.node = attrset(yyvsp[-2].node, yyvsp[0].id, 0); ; break;} case 53: #line 502 "parse.y" { backref_error(yyvsp[0].node); yyval.node = 0; ; break;} case 54: #line 508 "parse.y" { yyerror("class/module name must be CONSTANT"); ; break;} case 59: #line 517 "parse.y" { lex_state = EXPR_END; yyval.id = yyvsp[0].id; ; break;} case 60: #line 522 "parse.y" { lex_state = EXPR_END; yyval.id = yyvsp[0].id; ; break;} case 61: #line 528 "parse.y" { yyval.node = NEW_UNDEF(yyvsp[0].id); ; break;} case 62: #line 531 "parse.y" {lex_state = EXPR_FNAME;; break;} case 63: #line 532 "parse.y" { yyval.node = block_append(yyvsp[-3].node, NEW_UNDEF(yyvsp[0].id)); ; break;} case 64: #line 536 "parse.y" { yyval.id = tDOT2; ; break;} case 65: #line 537 "parse.y" { yyval.id = '|'; ; break;} case 66: #line 538 "parse.y" { yyval.id = '^'; ; break;} case 67: #line 539 "parse.y" { yyval.id = '&'; ; break;} case 68: #line 540 "parse.y" { yyval.id = tCMP; ; break;} case 69: #line 541 "parse.y" { yyval.id = tEQ; ; break;} case 70: #line 542 "parse.y" { yyval.id = tEQQ; ; break;} case 71: #line 543 "parse.y" { yyval.id = tMATCH; ; break;} case 72: #line 544 "parse.y" { yyval.id = '>'; ; break;} case 73: #line 545 "parse.y" { yyval.id = tGEQ; ; break;} case 74: #line 546 "parse.y" { yyval.id = '<'; ; break;} case 75: #line 547 "parse.y" { yyval.id = tLEQ; ; break;} case 76: #line 548 "parse.y" { yyval.id = tLSHFT; ; break;} case 77: #line 549 "parse.y" { yyval.id = tRSHFT; ; break;} case 78: #line 550 "parse.y" { yyval.id = '+'; ; break;} case 79: #line 551 "parse.y" { yyval.id = '-'; ; break;} case 80: #line 552 "parse.y" { yyval.id = '*'; ; break;} case 81: #line 553 "parse.y" { yyval.id = '*'; ; break;} case 82: #line 554 "parse.y" { yyval.id = '/'; ; break;} case 83: #line 555 "parse.y" { yyval.id = '%'; ; break;} case 84: #line 556 "parse.y" { yyval.id = tPOW; ; break;} case 85: #line 557 "parse.y" { yyval.id = '~'; ; break;} case 86: #line 558 "parse.y" { yyval.id = tUPLUS; ; break;} case 87: #line 559 "parse.y" { yyval.id = tUMINUS; ; break;} case 88: #line 560 "parse.y" { yyval.id = tAREF; ; break;} case 89: #line 561 "parse.y" { yyval.id = tASET; ; break;} case 90: #line 562 "parse.y" { yyval.id = '`'; ; break;} case 131: #line 572 "parse.y" {yyval.node = assignable(yyvsp[-1].id, 0);; break;} case 132: #line 573 "parse.y" { yyval.node = yyvsp[-1].node; if (yyval.node) { yyval.node->nd_value = yyvsp[0].node; fixpos(yyval.node, yyvsp[0].node); } ; break;} case 133: #line 581 "parse.y" { yyval.node = aryset(yyvsp[-5].node, yyvsp[-3].node, yyvsp[0].node); fixpos(yyval.node, yyvsp[-5].node); ; break;} case 134: #line 586 "parse.y" { yyval.node = attrset(yyvsp[-4].node, yyvsp[-2].id, yyvsp[0].node); fixpos(yyval.node, yyvsp[0].node); ; break;} case 135: #line 591 "parse.y" { yyval.node = attrset(yyvsp[-4].node, yyvsp[-2].id, yyvsp[0].node); fixpos(yyval.node, yyvsp[0].node); ; break;} case 136: #line 596 "parse.y" { value_expr(yyvsp[0].node); backref_error(yyvsp[-2].node); yyval.node = 0; ; break;} case 137: #line 602 "parse.y" { if (is_local_id(yyvsp[-2].id)) { if (local_id(yyvsp[-2].id)||!dyna_in_block()) { local_cnt(yyvsp[-2].id); } else if (!dyna_var_defined(yyvsp[-2].id)) { dyna_var_asgn(yyvsp[-2].id, TRUE); } } if (yyvsp[-1].id == tOROP) { yyval.node = NEW_OP_ASGN_OR(gettable(yyvsp[-2].id), assignable(yyvsp[-2].id, yyvsp[0].node)); } else if (yyvsp[-1].id == tANDOP) { yyval.node = NEW_OP_ASGN_AND(gettable(yyvsp[-2].id), assignable(yyvsp[-2].id, yyvsp[0].node)); } else { yyval.node = assignable(yyvsp[-2].id,call_op(gettable(yyvsp[-2].id),yyvsp[-1].id,1,yyvsp[0].node)); } fixpos(yyval.node, yyvsp[0].node); ; break;} case 138: #line 625 "parse.y" { NODE *args = NEW_LIST(yyvsp[0].node); list_append(yyvsp[-3].node, NEW_NIL()); list_concat(args, yyvsp[-3].node); if (yyvsp[-1].id == tOROP) { yyvsp[-1].id = 0; } else if (yyvsp[-1].id == tANDOP) { yyvsp[-1].id = 1; } yyval.node = NEW_OP_ASGN1(yyvsp[-5].node, yyvsp[-1].id, args); fixpos(yyval.node, yyvsp[-5].node); ; break;} case 139: #line 640 "parse.y" { if (yyvsp[-1].id == tOROP) { yyvsp[-1].id = 0; } else if (yyvsp[-1].id == tANDOP) { yyvsp[-1].id = 1; } yyval.node = NEW_OP_ASGN2(yyvsp[-4].node, yyvsp[-2].id, yyvsp[-1].id, yyvsp[0].node); fixpos(yyval.node, yyvsp[-4].node); ; break;} case 140: #line 651 "parse.y" { if (yyvsp[-1].id == tOROP) { yyvsp[-1].id = 0; } else if (yyvsp[-1].id == tANDOP) { yyvsp[-1].id = 1; } yyval.node = NEW_OP_ASGN2(yyvsp[-4].node, yyvsp[-2].id, yyvsp[-1].id, yyvsp[0].node); fixpos(yyval.node, yyvsp[-4].node); ; break;} case 141: #line 662 "parse.y" { backref_error(yyvsp[-2].node); yyval.node = 0; ; break;} case 142: #line 667 "parse.y" { yyval.node = NEW_DOT2(yyvsp[-2].node, yyvsp[0].node); ; break;} case 143: #line 671 "parse.y" { yyval.node = NEW_DOT3(yyvsp[-2].node, yyvsp[0].node); ; break;} case 144: #line 675 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '+', 1, yyvsp[0].node); ; break;} case 145: #line 679 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '-', 1, yyvsp[0].node); ; break;} case 146: #line 683 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '*', 1, yyvsp[0].node); ; break;} case 147: #line 687 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '/', 1, yyvsp[0].node); ; break;} case 148: #line 691 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '%', 1, yyvsp[0].node); ; break;} case 149: #line 695 "parse.y" { yyval.node = call_op(yyvsp[-2].node, tPOW, 1, yyvsp[0].node); ; break;} case 150: #line 699 "parse.y" { yyval.node = call_op(yyvsp[0].node, tUPLUS, 0); ; break;} case 151: #line 703 "parse.y" { yyval.node = call_op(yyvsp[0].node, tUMINUS, 0); ; break;} case 152: #line 707 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '|', 1, yyvsp[0].node); ; break;} case 153: #line 711 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '^', 1, yyvsp[0].node); ; break;} case 154: #line 715 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '&', 1, yyvsp[0].node); ; break;} case 155: #line 719 "parse.y" { yyval.node = call_op(yyvsp[-2].node, tCMP, 1, yyvsp[0].node); ; break;} case 156: #line 723 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '>', 1, yyvsp[0].node); ; break;} case 157: #line 727 "parse.y" { yyval.node = call_op(yyvsp[-2].node, tGEQ, 1, yyvsp[0].node); ; break;} case 158: #line 731 "parse.y" { yyval.node = call_op(yyvsp[-2].node, '<', 1, yyvsp[0].node); ; break;} case 159: #line 735 "parse.y" { yyval.node = call_op(yyvsp[-2].node, tLEQ, 1, yyvsp[0].node); ; break;} case 160: #line 739 "parse.y" { yyval.node = call_op(yyvsp[-2].node, tEQ, 1, yyvsp[0].node); ; break;} case 161: #line 743 "parse.y" { yyval.node = call_op(yyvsp[-2].node, tEQQ, 1, yyvsp[0].node); ; break;} case 162: #line 747 "parse.y" { yyval.node = NEW_NOT(call_op(yyvsp[-2].node, tEQ, 1, yyvsp[0].node)); ; break;} case 163: #line 751 "parse.y" { yyval.node = match_gen(yyvsp[-2].node, yyvsp[0].node); ; break;} case 164: #line 755 "parse.y" { yyval.node = NEW_NOT(match_gen(yyvsp[-2].node, yyvsp[0].node)); ; break;} case 165: #line 759 "parse.y" { value_expr(yyvsp[0].node); yyval.node = NEW_NOT(cond(yyvsp[0].node)); ; break;} case 166: #line 764 "parse.y" { yyval.node = call_op(yyvsp[0].node, '~', 0); ; break;} case 167: #line 768 "parse.y" { yyval.node = call_op(yyvsp[-2].node, tLSHFT, 1, yyvsp[0].node); ; break;} case 168: #line 772 "parse.y" { yyval.node = call_op(yyvsp[-2].node, tRSHFT, 1, yyvsp[0].node); ; break;} case 169: #line 776 "parse.y" { yyval.node = logop(NODE_AND, yyvsp[-2].node, yyvsp[0].node); ; break;} case 170: #line 780 "parse.y" { yyval.node = logop(NODE_OR, yyvsp[-2].node, yyvsp[0].node); ; break;} case 171: #line 783 "parse.y" {in_defined = 1;; break;} case 172: #line 784 "parse.y" { in_defined = 0; yyval.node = NEW_DEFINED(yyvsp[0].node); ; break;} case 173: #line 789 "parse.y" { value_expr(yyvsp[-4].node); yyval.node = NEW_IF(cond(yyvsp[-4].node), yyvsp[-2].node, yyvsp[0].node); fixpos(yyval.node, yyvsp[-4].node); ; break;} case 174: #line 795 "parse.y" { yyval.node = yyvsp[0].node; ; break;} case 175: #line 800 "parse.y" { if (yyvsp[0].node && nd_type(yyvsp[0].node) == NODE_BLOCK_PASS) { Error("block argument should not be given"); } yyval.node = yyvsp[0].node; ; break;} case 176: #line 808 "parse.y" { yyval.node = 0; ; break;} case 178: #line 814 "parse.y" { value_expr(yyvsp[0].node); yyval.node = NEW_LIST(yyvsp[0].node); ; break;} case 179: #line 819 "parse.y" { yyval.node = arg_blk_pass(yyvsp[-1].node, yyvsp[0].node); ; break;} case 180: #line 823 "parse.y" { yyval.node = arg_add(yyvsp[-4].node, yyvsp[-1].node); yyval.node = arg_blk_pass(yyval.node, yyvsp[0].node); ; break;} case 181: #line 828 "parse.y" { yyval.node = NEW_LIST(NEW_HASH(yyvsp[-1].node)); yyval.node = arg_blk_pass(yyval.node, yyvsp[0].node); ; break;} case 182: #line 833 "parse.y" { yyval.node = arg_add(NEW_LIST(NEW_HASH(yyvsp[-4].node)), yyvsp[-1].node); yyval.node = arg_blk_pass(yyval.node, yyvsp[0].node); ; break;} case 183: #line 838 "parse.y" { yyval.node = list_append(yyvsp[-3].node, NEW_HASH(yyvsp[-1].node)); yyval.node = arg_blk_pass(yyval.node, yyvsp[0].node); ; break;} case 184: #line 843 "parse.y" { yyval.node = arg_add(list_append(yyvsp[-6].node, NEW_HASH(yyvsp[-4].node)), yyvsp[-1].node); yyval.node = arg_blk_pass(yyval.node, yyvsp[0].node); ; break;} case 185: #line 848 "parse.y" { value_expr(yyvsp[-1].node); yyval.node = arg_blk_pass(yyvsp[-1].node, yyvsp[0].node); ; break;} case 187: #line 855 "parse.y" { value_expr(yyvsp[0].node); yyval.node = NEW_BLOCK_PASS(yyvsp[0].node); ; break;} case 188: #line 861 "parse.y" { yyval.node = yyvsp[0].node; ; break;} case 189: #line 865 "parse.y" { yyval.node = 0; ; break;} case 191: #line 871 "parse.y" { yyval.node = 0; ; break;} case 192: #line 876 "parse.y" { value_expr(yyvsp[0].node); yyval.node = NEW_LIST(yyvsp[0].node); ; break;} case 193: #line 881 "parse.y" { value_expr(yyvsp[0].node); yyval.node = list_append(yyvsp[-2].node, yyvsp[0].node); ; break;} case 194: #line 887 "parse.y" { if (yyvsp[0].node && nd_type(yyvsp[0].node) == NODE_ARRAY && yyvsp[0].node->nd_next == 0) { yyval.node = yyvsp[0].node->nd_head; } else { yyval.node = yyvsp[0].node; } ; break;} case 195: #line 898 "parse.y" { value_expr(yyvsp[0].node); yyval.node = arg_add(yyvsp[-3].node, yyvsp[0].node); ; break;} case 196: #line 903 "parse.y" { value_expr(yyvsp[0].node); yyval.node = yyvsp[0].node; ; break;} case 197: #line 909 "parse.y" { yyval.node = yyvsp[0].node; if (yyvsp[0].node) { if (nd_type(yyvsp[0].node) == NODE_ARRAY && yyvsp[0].node->nd_next == 0) { yyval.node = yyvsp[0].node->nd_head; } else if (nd_type(yyvsp[0].node) == NODE_BLOCK_PASS) { Error("block argument should not be given"); } } ; break;} case 198: #line 923 "parse.y" { yyval.node = 0; ; break;} case 200: #line 929 "parse.y" { yyval.node = NEW_LIT(yyvsp[0].val); ; break;} case 201: #line 933 "parse.y" { value_expr(yyvsp[-2].node); yyval.node = NEW_COLON2(yyvsp[-2].node, yyvsp[0].id); ; break;} case 202: #line 938 "parse.y" { yyval.node = NEW_COLON3(yyvsp[0].id); ; break;} case 203: #line 942 "parse.y" { yyval.node = NEW_STR(yyvsp[0].val); ; break;} case 205: #line 947 "parse.y" { yyval.node = NEW_XSTR(yyvsp[0].val); ; break;} case 210: #line 955 "parse.y" { value_expr(yyvsp[-3].node); yyval.node = NEW_CALL(yyvsp[-3].node, tAREF, yyvsp[-1].node); ; break;} case 211: #line 960 "parse.y" { if (yyvsp[-1].node == 0) yyval.node = NEW_ZARRAY(); /* zero length array*/ else { yyval.node = yyvsp[-1].node; } ; break;} case 212: #line 968 "parse.y" { yyval.node = NEW_HASH(yyvsp[-1].node); ; break;} case 213: #line 972 "parse.y" { if (!cur_mid && !in_single) yyerror("return appeared outside of method"); value_expr(yyvsp[-1].node); yyval.node = NEW_RET(yyvsp[-1].node); ; break;} case 214: #line 979 "parse.y" { if (!cur_mid && !in_single) yyerror("return appeared outside of method"); yyval.node = NEW_RET(0); ; break;} case 215: #line 985 "parse.y" { if (!cur_mid && !in_single) yyerror("return appeared outside of method"); yyval.node = NEW_RET(0); ; break;} case 216: #line 991 "parse.y" { value_expr(yyvsp[-1].node); yyval.node = NEW_YIELD(yyvsp[-1].node); ; break;} case 217: #line 996 "parse.y" { yyval.node = NEW_YIELD(0); ; break;} case 218: #line 1000 "parse.y" { yyval.node = NEW_YIELD(0); ; break;} case 219: #line 1003 "parse.y" {in_defined = 1;; break;} case 220: #line 1004 "parse.y" { in_defined = 0; yyval.node = NEW_DEFINED(yyvsp[-1].node); ; break;} case 221: #line 1009 "parse.y" { yyval.node = NEW_VCALL(yyvsp[0].id); ; break;} case 222: #line 1013 "parse.y" { yyvsp[0].node->nd_iter = NEW_FCALL(yyvsp[-1].id, 0); yyval.node = yyvsp[0].node; ; break;} case 224: #line 1019 "parse.y" { if (yyvsp[-1].node && nd_type(yyvsp[-1].node) == NODE_BLOCK_PASS) { Error("both block arg and actual block given"); } yyvsp[0].node->nd_iter = yyvsp[-1].node; yyval.node = yyvsp[0].node; fixpos(yyval.node, yyvsp[-1].node); ; break;} case 225: #line 1031 "parse.y" { value_expr(yyvsp[-4].node); yyval.node = NEW_IF(cond(yyvsp[-4].node), yyvsp[-2].node, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-4].node); ; break;} case 226: #line 1040 "parse.y" { value_expr(yyvsp[-4].node); yyval.node = NEW_UNLESS(cond(yyvsp[-4].node), yyvsp[-2].node, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-4].node); ; break;} case 227: #line 1048 "parse.y" { value_expr(yyvsp[-3].node); yyval.node = NEW_WHILE(cond(yyvsp[-3].node), yyvsp[-1].node, 1); fixpos(yyval.node, yyvsp[-3].node); ; break;} case 228: #line 1056 "parse.y" { value_expr(yyvsp[-3].node); yyval.node = NEW_UNTIL(cond(yyvsp[-3].node), yyvsp[-1].node, 1); fixpos(yyval.node, yyvsp[-3].node); ; break;} case 229: #line 1064 "parse.y" { value_expr(yyvsp[-2].node); yyval.node = NEW_CASE(yyvsp[-2].node, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-2].node); ; break;} case 230: #line 1072 "parse.y" { value_expr(yyvsp[-5].node); yyval.node = NEW_FOR(yyvsp[-5].node, yyvsp[-3].node, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-5].node); ; break;} case 231: #line 1082 "parse.y" { if (!yyvsp[-2].node && !yyvsp[-1].node) yyval.node = NEW_BEGIN(yyvsp[-3].node); else { if (yyvsp[-2].node) yyvsp[-3].node = NEW_RESCUE(yyvsp[-3].node, yyvsp[-2].node); if (yyvsp[-1].node) yyvsp[-3].node = NEW_ENSURE(yyvsp[-3].node, yyvsp[-1].node); yyval.node = yyvsp[-3].node; } fixpos(yyval.node, yyvsp[-3].node); ; break;} case 232: #line 1093 "parse.y" { yyval.node = yyvsp[-1].node; ; break;} case 233: #line 1097 "parse.y" { if (cur_mid || in_single) yyerror("class definition in method body"); class_nest++; cref_push(); local_push(); ; break;} case 234: #line 1107 "parse.y" { yyval.node = NEW_CLASS(yyvsp[-4].id, yyvsp[-1].node, yyvsp[-3].node); fixpos(yyval.node, yyvsp[-3].node); local_pop(); cref_pop(); class_nest--; ; break;} case 235: #line 1115 "parse.y" { class_nest++; cref_push(); local_push(); ; break;} case 236: #line 1122 "parse.y" { yyval.node = NEW_SCLASS(yyvsp[-4].node, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-4].node); local_pop(); cref_pop(); class_nest--; ; break;} case 237: #line 1130 "parse.y" { if (cur_mid || in_single) yyerror("module definition in method body"); class_nest++; cref_push(); local_push(); ; break;} case 238: #line 1139 "parse.y" { yyval.node = NEW_MODULE(yyvsp[-3].id, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-1].node); local_pop(); cref_pop(); class_nest--; ; break;} case 239: #line 1147 "parse.y" { if (cur_mid || in_single) yyerror("nested method definition"); cur_mid = yyvsp[0].id; local_push(); ; break;} case 240: #line 1156 "parse.y" { /* NOEX_PRIVATE for toplevel */ yyval.node = NEW_DEFN(yyvsp[-4].id, yyvsp[-2].node, yyvsp[-1].node, class_nest?0:1); fixpos(yyval.node, yyvsp[-2].node); local_pop(); cur_mid = 0; ; break;} case 241: #line 1163 "parse.y" {lex_state = EXPR_FNAME;; break;} case 242: #line 1164 "parse.y" { value_expr(yyvsp[-3].node); in_single++; local_push(); lex_state = EXPR_END; /* force for args */ ; break;} case 243: #line 1173 "parse.y" { yyval.node = NEW_DEFS(yyvsp[-7].node, yyvsp[-4].id, yyvsp[-2].node, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-7].node); local_pop(); in_single--; ; break;} case 244: #line 1180 "parse.y" { yyval.node = NEW_BREAK(); ; break;} case 245: #line 1184 "parse.y" { yyval.node = NEW_NEXT(); ; break;} case 246: #line 1188 "parse.y" { yyval.node = NEW_REDO(); ; break;} case 247: #line 1192 "parse.y" { yyval.node = NEW_RETRY(); ; break;} case 255: #line 1208 "parse.y" { value_expr(yyvsp[-3].node); yyval.node = NEW_IF(cond(yyvsp[-3].node), yyvsp[-1].node, yyvsp[0].node); fixpos(yyval.node, yyvsp[-3].node); ; break;} case 256: #line 1215 "parse.y" { yyval.node = 0; ; break;} case 257: #line 1219 "parse.y" { yyval.node = yyvsp[0].node; ; break;} case 260: #line 1227 "parse.y" { yyval.node = 0; ; break;} case 261: #line 1231 "parse.y" { yyval.node = 0; ; break;} case 262: #line 1235 "parse.y" { yyval.node = 0; ; break;} case 263: #line 1239 "parse.y" { yyval.node = yyvsp[-1].node; ; break;} case 264: #line 1244 "parse.y" { yyval.vars = dyna_push(); ; break;} case 265: #line 1250 "parse.y" { yyval.node = NEW_ITER(yyvsp[-2].node, 0, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-2].node?yyvsp[-2].node:yyvsp[-1].node); dyna_pop(yyvsp[-3].vars); ; break;} case 266: #line 1257 "parse.y" { yyval.vars = dyna_push(); ; break;} case 267: #line 1262 "parse.y" { yyval.node = NEW_ITER(yyvsp[-2].node, 0, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-2].node?yyvsp[-2].node:yyvsp[-1].node); dyna_pop(yyvsp[-3].vars); ; break;} case 268: #line 1269 "parse.y" { yyval.node = NEW_VCALL(yyvsp[0].id); ; break;} case 269: #line 1273 "parse.y" { yyval.node = NEW_VCALL(yyvsp[0].id); ; break;} case 270: #line 1277 "parse.y" { yyval.node = NEW_VCALL(yyvsp[0].id); ; break;} case 273: #line 1284 "parse.y" { yyval.node = new_fcall(yyvsp[-3].id, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-1].node); ; break;} case 274: #line 1289 "parse.y" { value_expr(yyvsp[-5].node); yyval.node = new_call(yyvsp[-5].node, yyvsp[-3].id, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-5].node); ; break;} case 275: #line 1295 "parse.y" { value_expr(yyvsp[-2].node); yyval.node = new_call(yyvsp[-2].node, yyvsp[0].id, 0); ; break;} case 276: #line 1300 "parse.y" { value_expr(yyvsp[-5].node); yyval.node = new_call(yyvsp[-5].node, yyvsp[-3].id, yyvsp[-1].node); fixpos(yyval.node, yyvsp[-5].node); ; break;} case 277: #line 1306 "parse.y" { if (!cur_mid && !in_single && !in_defined) yyerror("super called outside of method"); yyval.node = NEW_SUPER(yyvsp[-1].node); ; break;} case 278: #line 1312 "parse.y" { if (!cur_mid && !in_single && !in_defined) yyerror("super called outside of method"); yyval.node = NEW_ZSUPER(); ; break;} case 279: #line 1322 "parse.y" { yyval.node = NEW_WHEN(yyvsp[-3].node, yyvsp[-1].node, yyvsp[0].node); ; break;} case 282: #line 1332 "parse.y" { yyval.node = NEW_RESBODY(yyvsp[-3].node, yyvsp[-1].node, yyvsp[0].node); fixpos(yyval.node, yyvsp[-3].node?yyvsp[-3].node:yyvsp[-1].node); ; break;} case 283: #line 1337 "parse.y" { yyval.node = 0; ; break;} case 284: #line 1342 "parse.y" { yyval.node = 0; ; break;} case 285: #line 1346 "parse.y" { yyval.node = yyvsp[0].node; ; break;} case 287: #line 1352 "parse.y" { yyval.val = INT2FIX(yyvsp[0].id); ; break;} case 298: #line 1368 "parse.y" {yyval.id = kNIL;; break;} case 299: #line 1369 "parse.y" {yyval.id = kSELF;; break;} case 300: #line 1370 "parse.y" {yyval.id = kTRUE;; break;} case 301: #line 1371 "parse.y" {yyval.id = kFALSE;; break;} case 302: #line 1372 "parse.y" {yyval.id = k__FILE__;; break;} case 303: #line 1373 "parse.y" {yyval.id = k__LINE__;; break;} case 304: #line 1376 "parse.y" { yyval.node = gettable(yyvsp[0].id); ; break;} case 307: #line 1384 "parse.y" { yyval.node = 0; ; break;} case 308: #line 1388 "parse.y" { lex_state = EXPR_BEG; ; break;} case 309: #line 1392 "parse.y" { yyval.node = yyvsp[-1].node; ; break;} case 310: #line 1395 "parse.y" {yyerrok; yyval.node = 0;; break;} case 311: #line 1398 "parse.y" { yyval.node = yyvsp[-2].node; lex_state = EXPR_BEG; ; break;} case 312: #line 1403 "parse.y" { yyval.node = yyvsp[-1].node; ; break;} case 313: #line 1408 "parse.y" { yyval.node = block_append(NEW_ARGS(yyvsp[-5].num, yyvsp[-3].node, yyvsp[-1].id), yyvsp[0].node); ; break;} case 314: #line 1412 "parse.y" { yyval.node = block_append(NEW_ARGS(yyvsp[-3].num, yyvsp[-1].node, -1), yyvsp[0].node); ; break;} case 315: #line 1416 "parse.y" { yyval.node = block_append(NEW_ARGS(yyvsp[-3].num, 0, yyvsp[-1].id), yyvsp[0].node); ; break;} case 316: #line 1420 "parse.y" { yyval.node = block_append(NEW_ARGS(yyvsp[-1].num, 0, -1), yyvsp[0].node); ; break;} case 317: #line 1424 "parse.y" { yyval.node = block_append(NEW_ARGS(0, yyvsp[-3].node, yyvsp[-1].id), yyvsp[0].node); ; break;} case 318: #line 1428 "parse.y" { yyval.node = block_append(NEW_ARGS(0, yyvsp[-1].node, -1), yyvsp[0].node); ; break;} case 319: #line 1432 "parse.y" { yyval.node = block_append(NEW_ARGS(0, 0, yyvsp[-1].id), yyvsp[0].node); ; break;} case 320: #line 1436 "parse.y" { yyval.node = block_append(NEW_ARGS(0, 0, -1), yyvsp[0].node); ; break;} case 321: #line 1440 "parse.y" { yyval.node = NEW_ARGS(0, 0, -1); ; break;} case 322: #line 1445 "parse.y" { if (!is_local_id(yyvsp[0].id)) yyerror("formal argument must be local variable"); local_cnt(yyvsp[0].id); yyval.num = 1; ; break;} case 323: #line 1452 "parse.y" { if (!is_local_id(yyvsp[0].id)) yyerror("formal argument must be local variable"); local_cnt(yyvsp[0].id); yyval.num += 1; ; break;} case 324: #line 1460 "parse.y" { if (!is_local_id(yyvsp[-2].id)) yyerror("formal argument must be local variable"); yyval.node = assignable(yyvsp[-2].id, yyvsp[0].node); ; break;} case 325: #line 1467 "parse.y" { yyval.node = NEW_BLOCK(yyvsp[0].node); yyval.node->nd_end = yyval.node; ; break;} case 326: #line 1472 "parse.y" { yyval.node = block_append(yyvsp[-2].node, yyvsp[0].node); ; break;} case 327: #line 1477 "parse.y" { if (!is_local_id(yyvsp[0].id)) yyerror("rest argument must be local variable"); yyval.id = local_cnt(yyvsp[0].id); ; break;} case 328: #line 1484 "parse.y" { yyval.node = NEW_BLOCK_ARG(yyvsp[0].id); ; break;} case 329: #line 1489 "parse.y" { yyval.node = yyvsp[0].node; ; break;} case 330: #line 1493 "parse.y" { yyval.node = 0; ; break;} case 331: #line 1498 "parse.y" { if (nd_type(yyvsp[0].node) == NODE_SELF) { yyval.node = NEW_SELF(); } else if (nd_type(yyvsp[0].node) == NODE_NIL) { yyerror("Can't define single method for nil."); yyval.node = 0; } else { yyval.node = yyvsp[0].node; } ; break;} case 332: #line 1511 "parse.y" { switch (nd_type(yyvsp[-2].node)) { case NODE_STR: case NODE_DSTR: case NODE_XSTR: case NODE_DXSTR: case NODE_DREGX: case NODE_LIT: case NODE_ARRAY: case NODE_ZARRAY: yyerror("Can't define single method for literals."); default: break; } yyval.node = yyvsp[-2].node; ; break;} case 333: #line 1529 "parse.y" { yyval.node = 0; ; break;} case 334: #line 1533 "parse.y" { yyval.node = yyvsp[-1].node; ; break;} case 335: #line 1537 "parse.y" { if (yyvsp[-1].node->nd_alen%2 != 0) { yyerror("odd number list for Hash"); } yyval.node = yyvsp[-1].node; ; break;} case 337: #line 1546 "parse.y" { yyval.node = list_concat(yyvsp[-2].node, yyvsp[0].node); ; break;} case 338: #line 1551 "parse.y" { yyval.node = list_append(NEW_LIST(yyvsp[-2].node), yyvsp[0].node); ; break;} case 349: #line 1569 "parse.y" {yyerrok;; break;} case 352: #line 1573 "parse.y" {yyerrok;; break;} } /* the action file gets copied in in place of this dollarsign */ #line 498 "/usr/share/misc/bison.simple" yyvsp -= yylen; yyssp -= yylen; #ifdef YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif *++yyvsp = yyval; #ifdef YYLSP_NEEDED yylsp++; if (yylen == 0) { yylsp->first_line = yylloc.first_line; yylsp->first_column = yylloc.first_column; yylsp->last_line = (yylsp-1)->last_line; yylsp->last_column = (yylsp-1)->last_column; yylsp->text = 0; } else { yylsp->last_line = (yylsp+yylen-1)->last_line; yylsp->last_column = (yylsp+yylen-1)->last_column; } #endif /* Now "shift" the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTBASE] + *yyssp; if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; yyerrlab: /* here on detecting error */ if (! yyerrstatus) /* If not already recovering from an error, report this error. */ { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { int size = 0; char *msg; int x, count; count = 0; /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) size += strlen(yytname[x]) + 15, count++; msg = (char *) malloc(size + 15); if (msg != 0) { strcpy(msg, "parse error"); if (count < 5) { count = 0; for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) { strcat(msg, count == 0 ? ", expecting `" : " or `"); strcat(msg, yytname[x]); strcat(msg, "'"); count++; } } yyerror(msg); free(msg); } else yyerror ("parse error; also virtual memory exceeded"); } else #endif /* YYERROR_VERBOSE */ yyerror("parse error"); } goto yyerrlab1; yyerrlab1: /* here on error raised explicitly by an action */ if (yyerrstatus == 3) { /* if just tried and failed to reuse lookahead token after an error, discard it. */ /* return failure if at end of input */ if (yychar == YYEOF) YYABORT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); #endif yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ yyerrstatus = 3; /* Each real token shifted decrements this */ goto yyerrhandle; yyerrdefault: /* current state does not do anything special for the error token. */ #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ if (yyn) goto yydefault; #endif yyerrpop: /* pop the current state because it cannot handle the error token */ if (yyssp == yyss) YYABORT; yyvsp--; yystate = *--yyssp; #ifdef YYLSP_NEEDED yylsp--; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "Error: state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif yyerrhandle: yyn = yypact[yystate]; if (yyn == YYFLAG) goto yyerrdefault; yyn += YYTERROR; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) goto yyerrdefault; yyn = yytable[yyn]; if (yyn < 0) { if (yyn == YYFLAG) goto yyerrpop; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting error token, "); #endif *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; } #line 1574 "parse.y" #include #include #include "regex.h" #include "util.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(); static NODE *str_extend(); #define LEAVE_BS 1 static VALUE lex_input; /* non-nil if File */ static VALUE lex_lastline; /* gc protect */ static char *lex_pbeg; static char *lex_p; static char *lex_pend; static int yyerror(msg) char *msg; { char *p, *pe, *buf; int len, i; void Error_Append(); Error("%s", msg); p = lex_p; while (lex_pbeg <= p) { if (*p == '\n') break; p--; } p++; pe = lex_p; while (pe < lex_pend) { if (*pe == '\n') break; pe++; } len = pe - p; if (len > 4) { buf = ALLOCA_N(char, len+2); MEMCPY(buf, p, char, len); buf[len] = '\0'; Error_Append("%s", buf); i = lex_p - p; p = buf; pe = p + len; while (p < pe) { if (*p != '\t') *p = ' '; p++; } buf[i] = '^'; buf[i+1] = '\0'; Error_Append("%s", buf); } return 0; } static int newline_seen; static int heredoc_end; int rb_in_compile = 0; static NODE* yycompile(f) char *f; { int n; eval_tree = 0; newline_seen = 0; heredoc_end = 0; sourcefile = f; rb_in_compile = 1; n = yyparse(); rb_in_compile = 0; if (n == 0) return eval_tree; return 0; } NODE* compile_string(f, s, len) char *f, *s; int len; { lex_pbeg = lex_p = s; lex_pend = s + len; lex_input = 0; if (!sourcefile || strcmp(f, sourcefile)) /* not in eval() */ sourceline = 1; return yycompile(f); } NODE* compile_file(f, file, start) char *f; VALUE file; int start; { lex_input = file; lex_pbeg = lex_p = lex_pend = 0; sourceline = start; return yycompile(strdup(f)); } static int nextc() { int c; if (lex_p == lex_pend) { if (lex_input) { VALUE v = io_gets(lex_input); if (NIL_P(v)) return -1; if (heredoc_end > 0) { sourceline = heredoc_end+1; heredoc_end = 0; } while (RSTRING(v)->len >= 2 && RSTRING(v)->ptr[RSTRING(v)->len-1] == '\n' && RSTRING(v)->ptr[RSTRING(v)->len-2] == '\\') { VALUE v2 = io_gets(lex_input); if (!NIL_P(v2)) { str_cat(v, RSTRING(v2)->ptr, RSTRING(v2)->len); } } lex_pbeg = lex_p = RSTRING(v)->ptr; lex_pend = lex_p + RSTRING(v)->len; if (RSTRING(v)->len == 8 && strncmp(lex_pbeg, "__END__", 7) == 0) { lex_lastline = 0; return -1; } lex_lastline = v; } else { lex_lastline = 0; return -1; } } c = (unsigned char)*lex_p++; return c; } void pushback(c) int c; { if (c == -1) return; lex_p--; } #define tokfix() (tokenbuf[tokidx]='\0') #define tok() tokenbuf #define toklen() tokidx #define toklast() (tokidx>0?tokenbuf[tokidx-1]:0) static char* newtok() { tokidx = 0; if (!tokenbuf) { toksiz = 60; tokenbuf = ALLOC_N(char, 60); } if (toksiz > 4096) { toksiz = 60; REALLOC_N(tokenbuf, char, 60); } return tokenbuf; } static void tokadd(c) char c; { tokenbuf[tokidx++] = c; if (tokidx >= toksiz) { toksiz *= 2; REALLOC_N(tokenbuf, char, toksiz); } } static int read_escape() { int c; switch (c = nextc()) { case '\\': /* Backslash */ return c; case 'n': /* newline */ return '\n'; case 't': /* horizontal tab */ return '\t'; case 'r': /* carriage-return */ return '\r'; case 'f': /* form-feed */ return '\f'; case 'v': /* vertical tab */ return '\13'; case 'a': /* alarm(bell) */ return '\007'; case 'e': /* escape */ return 033; case '0': case '1': case '2': case '3': /* octal constant */ case '4': case '5': case '6': case '7': { char buf[3]; int i; pushback(c); for (i=0; i<3; i++) { c = nextc(); if (c == -1) goto eof; if (c < '0' || '7' < c) { pushback(c); break; } buf[i] = c; } c = scan_oct(buf, i+1, &i); } return c; case 'x': /* hex constant */ { char buf[2]; int i; for (i=0; i<2; i++) { buf[i] = nextc(); if (buf[i] == -1) goto eof; if (!ISXDIGIT(buf[i])) { pushback(buf[i]); break; } } c = scan_hex(buf, i+1, &i); } return c; case 'b': /* backspace */ return '\b'; case 's': /* space */ return ' '; case 'M': if ((c = nextc()) != '-') { yyerror("Invalid escape character syntax"); pushback(c); return '\0'; } if ((c = nextc()) == '\\') { return read_escape() | 0x80; } else if (c == -1) goto eof; else { return ((c & 0xff) | 0x80); } case 'C': if ((c = nextc()) != '-') { yyerror("Invalid escape character syntax"); pushback(c); return '\0'; } case 'c': case '^': if ((c = nextc())== '\\') { c = read_escape(); } else if (c == '?') return 0177; else if (c == -1) goto eof; return c & 0x9f; eof: case -1: yyerror("Invalid escape character syntax"); return '\0'; default: return c; } } static int parse_regx(term, paren) int term; { register int c; char kcode = 0; int once = 0; int nest = 0; int options = 0; int in_brack = 0; int re_start = sourceline; NODE *list = 0; newtok(); while ((c = nextc()) != -1) { if ((!in_brack && c == term) || nest > 0) { goto regx_end; } switch (c) { case '\n': sourceline++; break; case '[': in_brack = 1; break; case ']': in_brack = 0; break; case '#': list = str_extend(list, term); if (list == (NODE*)-1) return 0; continue; case '\\': switch (c = nextc()) { case -1: sourceline = re_start; Error("unterminated regexp meets end of file"); /* */ return 0; case '\n': sourceline++; break; case '\\': case '^': /* no \^ escape in regexp */ case 's': tokadd('\\'); tokadd(c); break; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': case '0': case 'x': tokadd('\\'); tokadd(c); break; case 'b': if (!in_brack) { tokadd('\\'); tokadd('b'); break; } /* fall through */ default: if (c == paren) nest++; if (c == term) nest--; if (c == '\n') { sourceline++; } else if (c == term) { tokadd(c); } else { pushback(c); tokadd('\\'); tokadd(read_escape()); } } continue; case -1: Error("unterminated regexp"); return 0; default: if (ismbchar(c)) { tokadd(c); c = nextc(); } break; regx_end: for (;;) { switch (c = nextc()) { case 'i': options |= RE_OPTION_IGNORECASE; break; case 'x': options |= RE_OPTION_EXTENDED; break; case 'o': once = 1; break; case 'n': kcode = 4; break; case 'e': kcode = 8; break; case 's': kcode = 12; break; default: pushback(c); goto end_options; } } end_options: 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, once?NODE_DREGX_ONCE:NODE_DREGX); list->nd_cflag = options | kcode; yylval.node = list; return tDREGEXP; } else { yylval.val = reg_new(tok(), toklen(), options | kcode); return tREGEXP; } } tokadd(c); } Error("unterminated regexp"); return 0; } static int parse_qstring _((int,int)); static int parse_string(func, term, paren) int func, term, paren; { int c; NODE *list = 0; int strstart; int nest = 0; if (func == '\'') { return parse_qstring(term, paren); } strstart = sourceline; newtok(); while ((c = nextc()) != term || nest > 0) { 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 = str_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 { pushback(c); if (func != '"') tokadd('\\'); tokadd(read_escape()); } continue; } if (c == paren) nest++; if (c == term) nest--; tokadd(c); } tokfix(); lex_state = EXPR_END; if (list) { if (toklen() > 0) { VALUE ss = str_new(tok(), toklen()); list_append(list, NEW_STR(ss)); } yylval.node = list; if (func == '`') { nd_set_type(list, NODE_DXSTR); return tDXSTRING; } else { return tDSTRING; } } else { yylval.val = str_new(tok(), toklen()); return (func == '`') ? tXSTRING : tSTRING; } } static int parse_qstring(term, paren) int term, paren; { int strstart; int c; int nest = 0; strstart = sourceline; newtok(); while ((c = nextc()) != term || nest > 0) { 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 '\'': if (term == '\'') { c = '\''; break; } /* fall through */ default: tokadd('\\'); } } if (c == paren) nest++; if (c == term) nest--; tokadd(c); } tokfix(); yylval.val = str_new(tok(), toklen()); lex_state = EXPR_END; return tSTRING; } static int parse_quotedword(term, paren) int term, paren; { if (parse_qstring(term, paren) == 0) return 0; yylval.node = NEW_CALL(NEW_STR(yylval.val), rb_intern("split"), 0); return tDSTRING; } char *strdup(); static int here_document(term) char term; { int c; char *eos; int len; VALUE str, line; VALUE lastline_save; int offset_save; NODE *list = 0; int linesave = sourceline; newtok(); switch (term) { case '\'': case '"': case '`': while ((c = nextc()) != term) { tokadd(c); } break; default: c = term; term = '"'; if (!is_identchar(c)) { Error("illegal here document"); return 0; } while (is_identchar(c)) { tokadd(c); c = nextc(); } pushback(c); break; } tokfix(); lastline_save = lex_lastline; offset_save = lex_p - lex_pbeg; eos = strdup(tok()); len = strlen(eos); str = str_new(0,0); for (;;) { line = io_gets(lex_input); if (NIL_P(line)) { error: Error("unterminated string meets end of file"); free(eos); return 0; } sourceline++; if (strncmp(eos, RSTRING(line)->ptr, len) == 0 && (RSTRING(line)->ptr[len] == '\n' || RSTRING(line)->ptr[len] == '\r')) { break; } lex_pbeg = lex_p = RSTRING(line)->ptr; lex_pend = lex_p + RSTRING(line)->len; switch (parse_string(term, '\n', '\n')) { case tSTRING: case tXSTRING: str_cat(yylval.val, "\n", 1); if (!list) { str_cat(str, RSTRING(yylval.val)->ptr, RSTRING(yylval.val)->len); } else { list_append(list, NEW_STR(yylval.val)); } break; case tDSTRING: case tDXSTRING: list_append(yylval.node, NEW_STR(str_new2("\n"))); nd_set_type(yylval.node, NODE_STR); if (!list) list = NEW_DSTR(str); yylval.node = NEW_LIST(yylval.node); yylval.node->nd_next = yylval.node->nd_head->nd_next; list_concat(list, yylval.node); break; case 0: goto error; } } free(eos); lex_lastline = lastline_save; lex_pbeg = RSTRING(lex_lastline)->ptr; lex_pend = lex_pbeg + RSTRING(lex_lastline)->len; lex_p = lex_pbeg + offset_save; lex_state = EXPR_END; heredoc_end = sourceline; sourceline = linesave; if (list) { yylval.node = list; } switch (term) { case '\'': case '"': if (list) return tDSTRING; yylval.val = str; return tSTRING; case '`': if (list) return tDXSTRING; return tXSTRING; } return 0; } #include "lex.c" static void arg_ambiguous() { Warning("ambiguous first argument; make sure"); } #ifndef atof double atof(); #endif static int yylex() { register int c; int space_seen = 0; struct kwtable *kw; if (newline_seen) { sourceline+=newline_seen; newline_seen = 0; } 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' */ space_seen = 1; goto retry; case '#': /* it's a comment */ while ((c = nextc()) != '\n') { if (c == -1) return 0; if (c == '\\') { /* skip a char */ c = nextc(); if (c == '\n') sourceline++; } if (ismbchar(c)) { c = nextc(); if (c == '\n') { sourceline++; break; } } } /* fall through */ case '\n': switch (lex_state) { case EXPR_BEG: case EXPR_FNAME: case EXPR_DOT: sourceline++; goto retry; default: break; } newline_seen++; lex_state = EXPR_BEG; return '\n'; case '*': if ((c = nextc()) == '*') { lex_state = EXPR_BEG; if (nextc() == '=') { yylval.id = tPOW; return tOP_ASGN; } pushback(c); return tPOW; } if (c == '=') { yylval.id = '*'; lex_state = EXPR_BEG; return tOP_ASGN; } pushback(c); if (lex_state == EXPR_ARG && space_seen && !ISSPACE(c)){ arg_ambiguous(); lex_state = EXPR_BEG; return tSTAR; } if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { lex_state = EXPR_BEG; return tSTAR; } lex_state = EXPR_BEG; return '*'; case '!': lex_state = EXPR_BEG; if ((c = nextc()) == '=') { return tNEQ; } if (c == '~') { return tNMATCH; } pushback(c); return '!'; case '=': if (lex_p == lex_pbeg + 1) { if (!lex_input) { Error("embedded document not available in eval"); } /* skip embedded rd document */ if (strncmp(lex_p, "begin", 5) == 0 && ISSPACE(lex_p[5])) { for (;;) { sourceline++; lex_p = lex_pend; c = nextc(); if (c == -1) { Error("embedded document meets end of file"); return 0; } if (c != '=') continue; if (strncmp(lex_p, "end", 3) == 0 && ISSPACE(lex_p[3])) { break; } } sourceline++; lex_p = lex_pend; goto retry; } } lex_state = EXPR_BEG; if ((c = nextc()) == '=') { if ((c = nextc()) == '=') { return tEQQ; } pushback(c); return tEQ; } if (c == '~') { return tMATCH; } else if (c == '>') { return tASSOC; } pushback(c); return '='; case '<': c = nextc(); if (c == '<' && lex_state != EXPR_END && lex_state != EXPR_CLASS && (lex_state != EXPR_ARG || space_seen)) { int c2 = nextc(); if (!ISSPACE(c2) && (strchr("\"'`", c2) || is_identchar(c2))) { if (!lex_input) { ArgError("here document not available in eval"); } return here_document(c2); } pushback(c2); } lex_state = EXPR_BEG; if (c == '=') { if ((c = nextc()) == '>') { return tCMP; } pushback(c); return tLEQ; } if (c == '<') { if (nextc() == '=') { yylval.id = tLSHFT; return tOP_ASGN; } pushback(c); return tLSHFT; } pushback(c); return '<'; case '>': lex_state = EXPR_BEG; if ((c = nextc()) == '=') { return tGEQ; } if (c == '>') { if ((c = nextc()) == '=') { yylval.id = tRSHFT; return tOP_ASGN; } pushback(c); return tRSHFT; } pushback(c); return '>'; case '"': return parse_string(c,c,c); case '`': if (lex_state == EXPR_FNAME) return c; return parse_string(c,c,c); case '\'': return parse_qstring(c,c); case '?': if (lex_state == EXPR_END) { Warning("a?b:c is undocumented feature ^^;;;"); lex_state = EXPR_BEG; return '?'; } c = nextc(); if (lex_state == EXPR_ARG && ISSPACE(c)){ pushback(c); arg_ambiguous(); lex_state = EXPR_BEG; Warning("a?b:c is undocumented feature ^^;;;"); return '?'; } if (c == '\\') { c = read_escape(); } c &= 0xff; yylval.val = INT2FIX(c); lex_state = EXPR_END; return tINTEGER; case '&': if ((c = nextc()) == '&') { lex_state = EXPR_BEG; if ((c = nextc()) == '=') { yylval.id = tANDOP; return tOP_ASGN; } pushback(c); return tANDOP; } else if (c == '=') { yylval.id = '&'; lex_state = EXPR_BEG; return tOP_ASGN; } pushback(c); if (lex_state == EXPR_ARG && space_seen && !ISSPACE(c)){ arg_ambiguous(); lex_state = EXPR_BEG; return tAMPER; } if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { lex_state = EXPR_BEG; return tAMPER; } lex_state = EXPR_BEG; return '&'; case '|': lex_state = EXPR_BEG; if ((c = nextc()) == '|') { if ((c = nextc()) == '=') { yylval.id = tOROP; return tOP_ASGN; } pushback(c); return tOROP; } else if (c == '=') { yylval.id = '|'; return tOP_ASGN; } pushback(c); return '|'; case '+': c = nextc(); if (lex_state == EXPR_FNAME) { if (c == '@') { return tUPLUS; } pushback(c); return '+'; } if (c == '=') { lex_state = EXPR_BEG; yylval.id = '+'; return tOP_ASGN; } if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { if (ISDIGIT(c)) { goto start_num; } pushback(c); lex_state = EXPR_BEG; return tUPLUS; } lex_state = EXPR_BEG; pushback(c); return '+'; case '-': c = nextc(); if (lex_state == EXPR_FNAME) { if (c == '@') { return tUMINUS; } pushback(c); return '-'; } if (c == '=') { lex_state = EXPR_BEG; yylval.id = '-'; return tOP_ASGN; } if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { if (ISDIGIT(c)) { pushback(c); c = '-'; goto start_num; } lex_state = EXPR_BEG; pushback(c); return tUMINUS; } lex_state = EXPR_BEG; pushback(c); return '-'; case '.': lex_state = EXPR_BEG; if ((c = nextc()) == '.') { if ((c = nextc()) == '.') { return tDOT3; } pushback(c); return tDOT2; } pushback(c); if (!ISDIGIT(c)) { lex_state = EXPR_DOT; 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; is_float = seen_point = seen_e = 0; lex_state = EXPR_END; newtok(); if (c == '-' || c == '+') { tokadd(c); c = nextc(); } if (c == '0') { c = nextc(); if (c == 'x' || c == 'X') { /* hexadecimal */ while (c = nextc()) { if (c == '_') continue; if (!ISXDIGIT(c)) break; tokadd(c); } pushback(c); tokfix(); yylval.val = str2inum(tok(), 16); return tINTEGER; } else if (c >= '0' && c <= '7') { /* octal */ do { tokadd(c); while ((c = nextc()) == '_') ; } while (c >= '0' && c <= '9'); pushback(c); tokfix(); yylval.val = str2inum(tok(), 8); return tINTEGER; } else if (c > '7' && c <= '9') { yyerror("Illegal octal digit"); } else if (c == '.') { tokadd('0'); } else { pushback(c); yylval.val = INT2FIX(0); return tINTEGER; } } 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 || seen_e) { goto decode_num; } else { int c0 = nextc(); if (!ISDIGIT(c0)) { pushback(c0); goto decode_num; } c = c0; } 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(c); tokfix(); if (is_float) { yylval.val = float_new(atof(tok())); return tFLOAT; } yylval.val = str2inum(tok(), 10); return tINTEGER; } case ']': case '}': case ')': lex_state = EXPR_END; return c; case ':': c = nextc(); if (c == ':') { if (lex_state == EXPR_BEG) { lex_state = EXPR_BEG; return tCOLON3; } if (lex_state == EXPR_ARG && space_seen) { arg_ambiguous(); lex_state = EXPR_BEG; return tCOLON3; } lex_state = EXPR_DOT; return tCOLON2; } pushback(c); if (lex_state == EXPR_END || ISSPACE(c)) { lex_state = EXPR_BEG; return ':'; } lex_state = EXPR_FNAME; return tSYMBEG; case '/': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { return parse_regx('/', '/'); } if ((c = nextc()) == '=') { lex_state = EXPR_BEG; yylval.id = '/'; return tOP_ASGN; } if (lex_state == EXPR_ARG) { if (space_seen && !ISSPACE(c)) { pushback(c); arg_ambiguous(); return parse_regx('/', '/'); } } lex_state = EXPR_BEG; pushback(c); return '/'; case '^': lex_state = EXPR_BEG; if (nextc() == '=') { yylval.id = '^'; return tOP_ASGN; } pushback(c); return c; case ',': case ';': lex_state = EXPR_BEG; return c; case '~': if (lex_state == EXPR_FNAME) { if ((c = nextc()) != '@') { pushback(c); } } lex_state = EXPR_BEG; return '~'; case '(': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { c = tLPAREN; lex_state = EXPR_BEG; } else { lex_state = EXPR_BEG; } return c; case '[': if (lex_state == EXPR_FNAME) { if ((c = nextc()) == ']') { if ((c = nextc()) == '=') { return tASET; } pushback(c); return tAREF; } pushback(c); return '['; } else if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { c = tLBRACK; } else if (lex_state == EXPR_ARG && space_seen) { arg_ambiguous(); c = tLBRACK; } lex_state = EXPR_BEG; return c; case '{': if (lex_state != EXPR_END && lex_state != EXPR_ARG) c = tLBRACE; lex_state = EXPR_BEG; return c; case '\\': c = nextc(); if (c == '\n') { sourceline++; space_seen = 1; goto retry; /* skip \\n */ } pushback(c); return '\\'; case '%': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { int term; int paren; c = nextc(); quotation: if (!ISALNUM(c)) { term = c; switch (c) { case '\'': c = 'q'; break; case '/': c = 'r'; break; case '`': c = 'x'; break; default: c = 'Q';break; } } else { term = nextc(); } if (c == -1 || term == -1) { Error("unterminated quoted string meets end of file"); return 0; } paren = term; if (term == '(') term = ')'; else if (term == '[') term = ']'; else if (term == '{') term = '}'; else if (term == '<') term = '>'; switch (c) { case 'Q': return parse_string('"', term, paren); case 'q': return parse_qstring(term, paren); case 'w': return parse_quotedword(term, paren); case 'x': return parse_string('`', term, paren); case 'r': return parse_regx(term, paren); default: yyerror("unknown type of %string"); return 0; } } if ((c = nextc()) == '=') { yylval.id = '%'; return tOP_ASGN; } if (lex_state == EXPR_ARG) { if (space_seen && !ISSPACE(c)) { arg_ambiguous(); goto quotation; } } lex_state = EXPR_BEG; pushback(c); return '%'; case '$': lex_state = EXPR_END; newtok(); c = nextc(); switch (c) { case '~': /* $~: match-data */ /* fall through */ case '_': /* $_: last read line string */ local_cnt(c); /* fall through */ case '*': /* $*: argv */ case '$': /* $$: pid */ case '?': /* $?: last status */ case '!': /* $!: error string */ case '@': /* $@: error position */ case '/': /* $/: input record separator */ case '\\': /* $\: output record separator */ case ';': /* $;: field separator */ case ',': /* $,: output field separator */ case '.': /* $.: last read line number */ case '=': /* $=: ignorecase */ case ':': /* $:: load path */ case '<': /* $<: reading filename */ case '>': /* $>: default output handle */ case '\"': /* $": already loaded files */ tokadd('$'); tokadd(c); tokfix(); yylval.id = rb_intern(tok()); return tGVAR; case '-': tokadd('$'); tokadd(c); c = nextc(); tokadd(c); tokfix(); yylval.id = rb_intern(tok()); return tGVAR; case '&': /* $&: last match */ case '`': /* $`: string before last match */ case '\'': /* $': string after last match */ case '+': /* $+: string matches last paren. */ yylval.node = NEW_BACK_REF(c); return tBACK_REF; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': while (ISDIGIT(c)) { tokadd(c); c = nextc(); } pushback(c); tokfix(); yylval.node = NEW_NTH_REF(atoi(tok())); return tNTH_REF; default: if (!is_identchar(c)) { pushback(c); return '$'; } case '0': tokadd('$'); } break; case '@': c = nextc(); if (!is_identchar(c)) { pushback(c); 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(); } if ((c == '!' || c == '?') && is_identchar(tok()[0])) { tokadd(c); } else { pushback(c); } tokfix(); { int result; switch (tok()[0]) { case '$': lex_state = EXPR_END; result = tGVAR; break; case '@': lex_state = EXPR_END; result = tIVAR; break; default: if (lex_state != EXPR_DOT) { /* See if it is a reserved word. */ kw = rb_reserved_word(tok(), toklen()); if (kw) { enum lex_state state = lex_state; if (lex_state == EXPR_FNAME) { yylval.id = rb_intern(kw->name); } lex_state = kw->state; return kw->id[state != EXPR_BEG]; } } if (ISUPPER(tok()[0])) { result = tCONSTANT; } else if (toklast() == '!' || toklast() == '?') { result = tFID; } else { result = tIDENTIFIER; if (lex_state == EXPR_FNAME) { lex_state = EXPR_END; if ((c = nextc()) == '=') { tokadd(c); } else { pushback(c); } } } if (lex_state == EXPR_BEG || lex_state == EXPR_DOT || lex_state == EXPR_ARG){ lex_state = EXPR_ARG; } else { lex_state = EXPR_END; } } tokfix(); yylval.id = rb_intern(tok()); return result; } } static NODE* str_extend(list, term) NODE *list; char term; { int c; int brace = -1; VALUE ss; NODE *node; int nest; c = nextc(); switch (c) { case '$': case '@': case '{': break; default: tokadd('#'); pushback(c); return list; } ss = str_new(tok(), toklen()); if (list == 0) { list = NEW_DSTR(ss); } else if (toklen() > 0) { list_append(list, NEW_STR(ss)); } newtok(); switch (c) { case '$': tokadd('$'); c = nextc(); if (c == -1) return (NODE*)-1; switch (c) { case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': while (ISDIGIT(c)) { tokadd(c); c = nextc(); } pushback(c); goto fetch_id; case '&': case '+': case '_': case '~': case '*': case '$': case '?': case '!': case '@': case ',': case '.': case '=': case ':': case '<': case '>': case '\\': refetch: tokadd(c); goto fetch_id; default: if (c == term) { list_append(list, NEW_STR(str_new2("#$"))); pushback(c); newtok(); return list; } switch (c) { case '\"': case '/': case '\'': case '`': goto refetch; } if (!is_identchar(c)) { yyerror("bad global variable in string"); newtok(); return list; } } /* through */ case '@': tokadd(c); c = nextc(); while (is_identchar(c)) { tokadd(c); if (ismbchar(c)) { c = nextc(); tokadd(c); } c = nextc(); } pushback(c); break; case '{': if (c == '{') brace = '}'; nest = 0; do { loop_again: c = nextc(); switch (c) { case -1: if (nest > 0) { yyerror("bad substitution in string"); newtok(); return list; } return (NODE*)-1; case '}': if (c == brace) { if (nest == 0) break; nest--; } tokadd(c); goto loop_again; case '\\': c = read_escape(); tokadd(c); goto loop_again; case '{': if (brace != -1) nest++; case '\"': case '/': case '`': if (c == term) { pushback(c); list_append(list, NEW_STR(str_new2("#"))); Warning("bad substitution in string"); tokfix(); list_append(list, NEW_STR(str_new(tok(), toklen()))); newtok(); return list; } default: tokadd(c); break; } } while (c != brace); } fetch_id: tokfix(); node = NEW_EVSTR(tok(),toklen()); list_append(list, node); newtok(); return list; } NODE* node_newnode(type, a0, a1, a2) enum node_type type; NODE *a0, *a1, *a2; { NODE *n = (NODE*)rb_newobj(); n->flags |= T_NODE; nd_set_type(n, type); nd_set_line(n, sourceline); n->nd_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); } int nodeline(node) NODE *node; { return nd_line(node); } static NODE* newline_node(node) NODE *node; { NODE *nl = 0; if (node) { nl = NEW_NEWLINE(node); fixpos(nl, node); nl->nd_nth = nd_line(node); } return nl; } static void fixpos(node, orig) NODE *node, *orig; { if (!node) return; if (!orig) return; node->nd_file = orig->nd_file; nd_set_line(node, nd_line(orig)); } static NODE* block_append(head, tail) NODE *head, *tail; { NODE *end; if (tail == 0) return head; if (head == 0) return tail; if (nd_type(head) != NODE_BLOCK) { end = NEW_BLOCK(head); end->nd_end = end; fixpos(end, head); head = end; } else { end = head->nd_end; } if (RTEST(verbose)) { NODE *nd = end->nd_head; newline: switch (nd_type(nd)) { case NODE_RETURN: case NODE_BREAK: case NODE_NEXT: case NODE_REDO: case NODE_RETRY: Warning("statement not reached"); break; case NODE_NEWLINE: nd = nd->nd_next; goto newline; default: break; } } if (nd_type(tail) != NODE_BLOCK) { tail = NEW_BLOCK(tail); tail->nd_end = tail; } end->nd_next = tail; head->nd_end = tail->nd_end; return head; } static NODE* list_append(head, tail) NODE *head, *tail; { NODE *last; if (head == 0) 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; last = head; while (last->nd_next) { last = last->nd_next; } last->nd_next = tail; head->nd_alen += tail->nd_alen; return head; } 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); } return NEW_CALL(recv, id, narg==1?NEW_LIST(arg1):0); } static NODE* match_gen(node1, node2) NODE *node1; NODE *node2; { local_cnt('~'); switch (nd_type(node1)) { case NODE_DREGX: case NODE_DREGX_ONCE: return NEW_MATCH2(node1, node2); case NODE_LIT: if (TYPE(node1->nd_lit) == T_REGEXP) { return NEW_MATCH2(node1, node2); } } switch (nd_type(node2)) { case NODE_DREGX: case NODE_DREGX_ONCE: return NEW_MATCH3(node2, node1); case NODE_LIT: if (TYPE(node2->nd_lit) == T_REGEXP) { return NEW_MATCH3(node2, node1); } } return NEW_CALL(node1, tMATCH, NEW_LIST(node2)); } static NODE* gettable(id) ID id; { if (id == kSELF) { return NEW_SELF(); } else if (id == kNIL) { return NEW_NIL(); } else if (id == kTRUE) { return NEW_TRUE(); } else if (id == kFALSE) { return NEW_FALSE(); } else if (id == k__FILE__) { return NEW_STR(str_new2(sourcefile)); } else if (id == k__LINE__) { return NEW_LIT(INT2FIX(sourceline)); } else if (is_local_id(id)) { if (dyna_in_block() && dyna_var_defined(id)) return NEW_DVAR(id); if (local_id(id)) return NEW_LVAR(id); /* method call without arguments */ return NEW_VCALL(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); } Bug("invalid id for gettable"); return 0; } static NODE* assignable(id, val) ID id; NODE *val; { NODE *lhs = 0; value_expr(val); if (id == kSELF) { yyerror("Can't change the value of self"); } else if (id == kNIL) { yyerror("Can't assign to nil"); } else if (id == kTRUE) { yyerror("Can't assign to true"); } else if (id == kFALSE) { yyerror("Can't assign to false"); } else if (id == k__FILE__) { yyerror("Can't assign to __FILE__"); } else if (id == k__LINE__) { yyerror("Can't assign to __LINE__"); } else if (is_local_id(id)) { if (dyna_var_defined(id)) { lhs = NEW_DASGN(id, val); } else if (local_id(id) || !dyna_in_block()) { lhs = NEW_LASGN(id, val); } else{ dyna_var_push(id, 0); lhs = NEW_DASGN_PUSH(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) yyerror("dynamic constant assignment"); lhs = NEW_CASGN(id, val); } else { Bug("bad id for variable"); } return lhs; } static NODE * arg_add(node1, node2) NODE *node1; NODE *node2; { return call_op(node1, rb_intern("concat"), 1, node2); } static NODE * aryset(recv, idx, val) NODE *recv, *idx, *val; { value_expr(recv); value_expr(val); if (idx) { if (nd_type(idx) == NODE_ARRAY) { idx = list_append(idx, val); } else { idx = arg_add(idx, val); } } return NEW_CALL(recv, tASET, idx); } ID id_attrset(id) ID id; { id &= ~ID_SCOPE_MASK; id |= ID_ATTRSET; return id; } static NODE * attrset(recv, id, val) NODE *recv, *val; ID id; { value_expr(recv); value_expr(val); return NEW_CALL(recv, id_attrset(id), NEW_LIST(val)); } static void backref_error(node) NODE *node; { switch (nd_type(node)) { case NODE_NTH_REF: Error("Can't set variable $%d", node->nd_nth); break; case NODE_BACK_REF: Error("Can't set variable $%c", node->nd_nth); break; } } static int value_expr(node) NODE *node; { if (node == 0) return TRUE; switch (nd_type(node)) { case NODE_RETURN: case NODE_BREAK: case NODE_NEXT: case NODE_REDO: case NODE_RETRY: case NODE_WHILE: case NODE_UNTIL: case NODE_CLASS: case NODE_MODULE: case NODE_DEFN: case NODE_DEFS: yyerror("void value expression"); return FALSE; break; case NODE_BLOCK: while (node->nd_next) { node = node->nd_next; } return value_expr(node->nd_head); case NODE_IF: return value_expr(node->nd_body) && value_expr(node->nd_else); case NODE_NEWLINE: return value_expr(node->nd_next); default: return TRUE; } } static NODE *cond2(); int assign_in_cond(node) NODE *node; { switch (nd_type(node)) { case NODE_MASGN: yyerror("multiple assignment in conditional"); return 1; case NODE_LASGN: case NODE_DASGN: case NODE_GASGN: case NODE_IASGN: case NODE_CASGN: break; case NODE_NEWLINE: default: return 0; } switch (nd_type(node->nd_value)) { case NODE_LIT: case NODE_STR: case NODE_DSTR: case NODE_XSTR: case NODE_DXSTR: case NODE_EVSTR: case NODE_DREGX: case NODE_NIL: case NODE_TRUE: case NODE_FALSE: /* reports always */ Warn("found = in conditional, should be =="); return 1; default: break; } if (assign_in_cond(node->nd_value) == 0) { Warning("assignment in condition"); } return 1; } static NODE* cond0(node) NODE *node; { enum node_type type = nd_type(node); assign_in_cond(node); switch (type) { case NODE_DREGX: case NODE_DREGX_ONCE: local_cnt('_'); local_cnt('~'); return NEW_MATCH2(node, NEW_GVAR(rb_intern("$_"))); case NODE_DOT2: case NODE_DOT3: node->nd_beg = cond2(node->nd_beg); node->nd_end = cond2(node->nd_end); if (type == NODE_DOT2) nd_set_type(node,NODE_FLIP2); else if (type == NODE_DOT3) nd_set_type(node, NODE_FLIP3); return node; case NODE_LIT: if (TYPE(node->nd_lit) == T_REGEXP) { local_cnt('_'); local_cnt('~'); return NEW_MATCH(node); } if (TYPE(node->nd_lit) == T_STRING) { local_cnt('_'); local_cnt('~'); return NEW_MATCH(reg_new(RSTRING(node)->ptr,RSTRING(node)->len,0)); } default: return node; } } static NODE* cond(node) NODE *node; { if (node == 0) return 0; if (nd_type(node) == NODE_NEWLINE){ node->nd_next = cond0(node->nd_next); return node; } return cond0(node); } static NODE* cond2(node) NODE *node; { enum node_type type; node = cond(node); type = nd_type(node); if (type == NODE_NEWLINE) node = node->nd_next; if (type == NODE_LIT && FIXNUM_P(node->nd_lit)) { return call_op(node,tEQ,1,NEW_GVAR(rb_intern("$."))); } return node; } static NODE* logop(type, left, right) enum node_type type; NODE *left, *right; { value_expr(left); return node_newnode(type, cond(left), cond(right)); } static NODE * arg_blk_pass(node1, node2) NODE *node1; NODE *node2; { if (node2) { node2->nd_head = node1; return node2; } return node1; } static NODE* new_call(r,m,a) NODE *r; ID m; NODE *a; { if (a && nd_type(a) == NODE_BLOCK_PASS) { a->nd_iter = NEW_CALL(r,m,a->nd_head); return a; } return NEW_CALL(r,m,a); } static NODE* new_fcall(m,a) ID m; NODE *a; { if (a && nd_type(a) == NODE_BLOCK_PASS) { a->nd_iter = NEW_FCALL(m,a->nd_head); return a; } return NEW_FCALL(m,a); } st_table *new_idhash(); static struct local_vars { ID *tbl; int nofree; int cnt; int dlev; struct local_vars *prev; } *lvtbl; static void local_push() { struct local_vars *local; local = ALLOC(struct local_vars); local->prev = lvtbl; local->nofree = 0; local->cnt = 0; local->tbl = 0; local->dlev = 0; lvtbl = local; } static void local_pop() { struct local_vars *local = lvtbl->prev; if (lvtbl->tbl) { if (!lvtbl->nofree) free(lvtbl->tbl); else lvtbl->tbl[0] = lvtbl->cnt; } free(lvtbl); lvtbl = local; } static ID* local_tbl() { lvtbl->nofree = 1; return lvtbl->tbl; } static int local_cnt(id) ID id; { int cnt, max; if (id == 0) return lvtbl->cnt; for (cnt=1, max=lvtbl->cnt+1; cnttbl[cnt] == id) return cnt-1; } if (lvtbl->tbl == 0) { lvtbl->tbl = ALLOC_N(ID, 4); lvtbl->tbl[0] = 0; lvtbl->tbl[1] = '_'; lvtbl->tbl[2] = '~'; lvtbl->cnt = 2; if (id == '_') return 0; if (id == '~') return 1; } 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 == 0) return FALSE; for (i=3, max=lvtbl->cnt+1; itbl[i] == id) return TRUE; } return FALSE; } static void top_local_init() { local_push(); lvtbl->cnt = the_scope->local_tbl?the_scope->local_tbl[0]:0; if (lvtbl->cnt > 0) { lvtbl->tbl = ALLOC_N(ID, lvtbl->cnt+3); MEMCPY(lvtbl->tbl, the_scope->local_tbl, ID, lvtbl->cnt+1); } else { lvtbl->tbl = 0; } if (the_dyna_vars) lvtbl->dlev = 1; else lvtbl->dlev = 0; } static void top_local_setup() { int len = lvtbl->cnt; int i; if (len > 0) { i = lvtbl->tbl[0]; if (i < len) { if (i == 0 || the_scope->flag == SCOPE_ALLOCA) { VALUE *vars = ALLOC_N(VALUE, len+1); if (the_scope->local_vars) { *vars++ = the_scope->local_vars[-1]; MEMCPY(vars, the_scope->local_vars, VALUE, i); memclear(vars+i, len-i); } else { *vars++ = 0; memclear(vars, len); } the_scope->local_vars = vars; the_scope->flag |= SCOPE_MALLOC; } else { VALUE *vars = the_scope->local_vars-1; REALLOC_N(vars, VALUE, len+1); the_scope->local_vars = vars+1; memclear(the_scope->local_vars+i, len-i); } if (the_scope->local_tbl && the_scope->local_vars[-1] == 0) { free(the_scope->local_tbl); } the_scope->local_vars[-1] = 0; the_scope->local_tbl = local_tbl(); } } local_pop(); } static struct RVarmap* dyna_push() { lvtbl->dlev++; return the_dyna_vars; } static void dyna_pop(vars) struct RVarmap* vars; { lvtbl->dlev--; the_dyna_vars = vars; } static int dyna_in_block() { return (lvtbl->dlev > 0); } static void cref_pop() { cur_cref = cur_cref->nd_next; } void yyappend_print() { eval_tree = block_append(eval_tree, NEW_FCALL(rb_intern("print"), NEW_ARRAY(NEW_GVAR(rb_intern("$_"))))); } void yywhile_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"), 0)), eval_tree); } if (chop) { eval_tree = block_append(NEW_CALL(NEW_GVAR(rb_intern("$_")), rb_intern("chop!"), 0), eval_tree); } eval_tree = NEW_OPT_N(eval_tree); } static struct op_tbl op_tbl[] = { tDOT2, "..", '+', "+", '-', "-", '+', "+(binary)", '-', "-(binary)", '*', "*", '/', "/", '%', "%", tPOW, "**", tUPLUS, "+@", tUMINUS, "-@", tUPLUS, "+(unary)", tUMINUS, "-(unary)", '|', "|", '^', "^", '&', "&", tCMP, "<=>", '>', ">", tGEQ, ">=", '<', "<", tLEQ, "<=", tEQ, "==", tEQQ, "===", tNEQ, "!=", tMATCH, "=~", tNMATCH, "!~", '!', "!", '~', "~", '!', "!(unary)", '~', "~(unary)", '!', "!@", '~', "~@", tAREF, "[]", tASET, "[]=", tLSHFT, "<<", tRSHFT, ">>", tCOLON2, "::", tCOLON3, "::", '`', "`", 0, 0, }; char *rb_id2name(); char *rb_class2name(); static st_table *sym_tbl; static st_table *sym_rev_tbl; void Init_sym() { sym_tbl = st_init_strtable(); sym_rev_tbl = st_init_numtable(); rb_global_variable((VALUE*)&cur_cref); rb_global_variable((VALUE*)&lex_lastline); } 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 = 0; switch (name[0]) { case '$': id |= ID_GLOBAL; break; case '@': id |= ID_INSTANCE; break; default: if (name[0] != '_' && !ISALPHA(name[0]) && !ismbchar(name[0])) { /* operator */ int i; for (i=0; op_tbl[i].token; i++) { if (*op_tbl[i].name == *name && strcmp(op_tbl[i].name, name) == 0) { id = op_tbl[i].token; goto id_regist; } } } last = strlen(name)-1; if (name[last] == '=') { /* attribute assignment */ char *buf = ALLOCA_N(char,last+1); strncpy(buf, name, last); buf[last] = '\0'; id = rb_intern(buf); if (id > LAST_TOKEN) { id = id_attrset(id); goto id_regist; } id |= ID_ATTRSET; } else if (ISUPPER(name[0])) { id = ID_CONST; } else { id = ID_LOCAL; } break; } id |= ++last_id << ID_SCOPE_SHIFT; id_regist: name = strdup(name); st_add_direct(sym_tbl, name, id); st_add_direct(sym_rev_tbl, id, name); return id; } char * rb_id2name(id) ID id; { char *name; if (id < LAST_TOKEN) { int i = 0; for (i=0; op_tbl[i].token; i++) { if (op_tbl[i].token == id) return op_tbl[i].name; } } if (st_lookup(sym_rev_tbl, id, &name)) return name; if (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 0; } int rb_is_const_id(id) ID id; { if (is_const_id(id)) return TRUE; return FALSE; } int rb_is_instance_id(id) ID id; { if (is_instance_id(id)) return TRUE; return FALSE; } static void special_local_set(c, val) char c; VALUE val; { int cnt; top_local_init(); cnt = local_cnt(c); top_local_setup(); the_scope->local_vars[cnt] = val; } VALUE backref_get() { if (the_scope->local_vars) { return the_scope->local_vars[1]; } return Qnil; } void backref_set(val) VALUE val; { if (the_scope->local_vars) { the_scope->local_vars[1] = val; } else { special_local_set('~', val); } } VALUE lastline_get() { if (the_scope->local_vars) { return the_scope->local_vars[0]; } return Qnil; } void lastline_set(val) VALUE val; { if (the_scope->local_vars) { the_scope->local_vars[0] = val; } else { special_local_set('_', val); } } ruby-1.2.3/parse.y100644 774 145 224046 6657725623 12131 0ustar matzNaCl/************************************************ parse.y - $Author: matz $ $Date: 1999/02/09 03:29:23 $ created at: Fri May 28 18:02:42 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ %{ #define YYDEBUG 1 #include "ruby.h" #include "env.h" #include "node.h" #include "st.h" #include /* hack for bison */ #ifdef const # undef const #endif #define ID_SCOPE_SHIFT 3 #define ID_SCOPE_MASK 0x07 #define ID_LOCAL 0x01 #define ID_INSTANCE 0x02 #define ID_GLOBAL 0x03 #define ID_ATTRSET 0x04 #define ID_CONST 0x05 #define is_id_notop(id) ((id)>LAST_TOKEN) #define is_local_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_LOCAL) #define is_global_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_GLOBAL) #define is_instance_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_INSTANCE) #define is_attrset_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_ATTRSET) #define is_const_id(id) (is_id_notop(id)&&((id)&ID_SCOPE_MASK)==ID_CONST) struct op_tbl { ID token; char *name; }; NODE *eval_tree_begin = 0; NODE *eval_tree = 0; char *sourcefile; /* current source file */ int sourceline; /* current line no. */ static int yylex(); static int yyerror(); 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_ARG, /* newline significant, +/- is a operator. */ EXPR_FNAME, /* ignore newline, +/- is a operator, no reserved words. */ EXPR_DOT, /* immediate after `.', no reserved words. */ EXPR_CLASS, /* immediate after `class', no here document. */ } lex_state; static int class_nest = 0; static int in_single = 0; static ID cur_mid = 0; static int value_expr(); static NODE *cond(); static NODE *logop(); static NODE *newline_node(); static void fixpos(); static NODE *block_append(); static NODE *list_append(); static NODE *list_concat(); static NODE *arg_add(); static NODE *call_op(); static int in_defined = 0; static NODE *arg_blk_pass(); static NODE *new_call(); static NODE *new_fcall(); static NODE *gettable(); static NODE *assignable(); static NODE *aryset(); static NODE *attrset(); static void backref_error(); static NODE *match_gen(); static void local_push(); static void local_pop(); static int local_cnt(); static int local_id(); static ID *local_tbl(); static struct RVarmap *dyna_push(); static void dyna_pop(); static int dyna_in_block(); VALUE dyna_var_asgn(); VALUE dyna_var_defined(); #define cref_push() NEW_CREF() static void cref_pop(); static NODE *cur_cref; static void top_local_init(); static void top_local_setup(); %} %union { NODE *node; VALUE val; ID id; int num; struct RVarmap *vars; } %token kCLASS kMODULE kDEF kUNDEF kBEGIN kRESCUE kENSURE kEND kIF kUNLESS kTHEN kELSIF kELSE kCASE kWHEN kWHILE kUNTIL kFOR kBREAK kNEXT kREDO kRETRY kIN kDO kRETURN kYIELD kSUPER kSELF kNIL kTRUE kFALSE kAND kOR kNOT kIF_MOD kUNLESS_MOD kWHILE_MOD kUNTIL_MOD kALIAS kDEFINED klBEGIN klEND k__LINE__ k__FILE__ %token tIDENTIFIER tFID tGVAR tIVAR tCONSTANT %token tINTEGER tFLOAT tSTRING tXSTRING tREGEXP %token tDSTRING tDXSTRING tDREGEXP tNTH_REF tBACK_REF %type singleton %type literal numeric %type compstmt stmts stmt expr arg primary command_call method_call %type if_tail opt_else case_body cases rescue ensure %type opt_call_args call_args ret_args args %type aref_args opt_block_arg block_arg %type mrhs opt_list superclass iterator var_ref %type f_arglist f_args f_optarg f_opt f_block_arg opt_f_block_arg %type array assoc_list assocs assoc undef_list backref %type iter_var opt_iter_var iter_block iter_do_block %type mlhs mlhs_head mlhs_tail mlhs_basic mlhs_entry mlhs_item lhs %type variable symbol operation %type cname fname op f_rest_arg %type f_arg %token tUPLUS /* unary+ */ %token tUMINUS /* unary- */ %token tPOW /* ** */ %token tCMP /* <=> */ %token tEQ /* == */ %token tEQQ /* === */ %token tNEQ /* != */ %token tGEQ /* >= */ %token tLEQ /* <= */ %token tANDOP tOROP /* && and || */ %token tMATCH tNMATCH /* =~ and !~ */ %token tDOT2 tDOT3 /* .. and ... */ %token tAREF tASET /* [] and []= */ %token tLSHFT tRSHFT /* << and >> */ %token tCOLON2 /* :: */ %token tCOLON3 /* :: at EXPR_BEG */ %token tOP_ASGN /* +=, -= etc. */ %token tASSOC /* => */ %token tLPAREN /* ( */ %token tLBRACK /* [ */ %token tLBRACE /* { */ %token tSTAR /* * */ %token tAMPER /* & */ %token tSYMBEG /* * precedence table */ %left kIF_MOD kUNLESS_MOD kWHILE_MOD kUNTIL_MOD %left kOR kAND %right kNOT %nonassoc kDEFINED %right '=' tOP_ASGN %right '?' ':' %nonassoc tDOT2 tDOT3 %left tOROP %left tANDOP %nonassoc tCMP tEQ tEQQ tNEQ tMATCH tNMATCH %left '>' tGEQ '<' tLEQ %left '|' '^' %left '&' %left tLSHFT tRSHFT %left '+' '-' %left '*' '/' '%' %right '!' '~' tUPLUS tUMINUS %right tPOW %token LAST_TOKEN %% program : { $$ = the_dyna_vars; lex_state = EXPR_BEG; top_local_init(); NEW_CREF0(); /* initialize constant c-ref */ if ((VALUE)the_class == cObject) class_nest = 0; else class_nest = 1; } compstmt { eval_tree = block_append(eval_tree, $2); top_local_setup(); cur_cref = 0; class_nest = 0; the_dyna_vars = $1; } compstmt : stmts opt_terms stmts : /* none */ { $$ = 0; } | stmt { $$ = newline_node($1); } | stmts terms stmt { $$ = block_append($1, newline_node($3)); } | error stmt { $$ = $2; } stmt : iterator iter_do_block { if ($1 && nd_type($1) == NODE_BLOCK_PASS) { Error("both block arg and actual block given"); } $2->nd_iter = $1; $$ = $2; fixpos($$, $2); } | kALIAS fname {lex_state = EXPR_FNAME;} fname { if (cur_mid || in_single) yyerror("alias within method"); $$ = NEW_ALIAS($2, $4); } | kALIAS tGVAR tGVAR { if (cur_mid || in_single) yyerror("alias within method"); $$ = NEW_VALIAS($2, $3); } | kALIAS tGVAR tBACK_REF { char buf[3]; if (cur_mid || in_single) yyerror("alias within method"); sprintf(buf, "$%c", $3->nd_nth); $$ = NEW_VALIAS($2, rb_intern(buf)); } | kALIAS tGVAR tNTH_REF { yyerror("can't make alias for the number variables"); $$ = 0; } | kUNDEF undef_list { if (cur_mid || in_single) yyerror("undef within method"); $$ = $2; } | stmt kIF_MOD expr { value_expr($3); $$ = NEW_IF(cond($3), $1, 0); fixpos($$, $3); } | stmt kUNLESS_MOD expr { value_expr($3); $$ = NEW_UNLESS(cond($3), $1, 0); fixpos($$, $3); } | stmt kWHILE_MOD expr { value_expr($3); if (nd_type($1) == NODE_BEGIN) { $$ = NEW_WHILE(cond($3), $1->nd_body, 0); } else { $$ = NEW_WHILE(cond($3), $1, 1); } } | stmt kUNTIL_MOD expr { value_expr($3); if (nd_type($1) == NODE_BEGIN) { $$ = NEW_UNTIL(cond($3), $1->nd_body, 0); } else { $$ = NEW_UNTIL(cond($3), $1, 1); } } | klBEGIN { if (cur_mid || in_single) { yyerror("BEGIN in method"); } local_push(); } '{' compstmt '}' { eval_tree_begin = block_append(eval_tree_begin, NEW_PREEXE($4)); local_pop(); $$ = 0; } | klEND '{' compstmt '}' { if (cur_mid || in_single) { yyerror("END in method; use at_exit"); } $$ = NEW_ITER(0, NEW_POSTEXE(), $3); } | expr expr : mlhs '=' mrhs { value_expr($3); $1->nd_value = $3; $$ = $1; } | kRETURN ret_args { value_expr($2); if (!cur_mid && !in_single) yyerror("return appeared outside of method"); $$ = NEW_RET($2); } | kYIELD ret_args { value_expr($2); $$ = NEW_YIELD($2); } | command_call | expr kAND expr { $$ = logop(NODE_AND, $1, $3); } | expr kOR expr { $$ = logop(NODE_OR, $1, $3); } | kNOT expr { value_expr($2); $$ = NEW_NOT(cond($2)); } | '!' command_call { value_expr($2); $$ = NEW_NOT(cond($2)); } | arg command_call : operation call_args { $$ = new_fcall($1, $2); fixpos($$, $2); } | primary '.' operation call_args { value_expr($1); $$ = new_call($1, $3, $4); fixpos($$, $1); } | primary tCOLON2 operation call_args { value_expr($1); $$ = new_call($1, $3, $4); fixpos($$, $1); } | kSUPER call_args { if (!cur_mid && !in_single && !in_defined) yyerror("super called outside of method"); $$ = NEW_SUPER($2); fixpos($$, $2); } mlhs : mlhs_basic | tLPAREN mlhs_entry ')' { $$ = $2; } mlhs_entry : mlhs_basic | tLPAREN mlhs_entry ')' { $$ = NEW_MASGN(NEW_LIST($2), 0); } mlhs_basic : mlhs_head { $$ = NEW_MASGN(NEW_LIST($1), 0); } | mlhs_head tSTAR lhs { $$ = NEW_MASGN(NEW_LIST($1), $3); } | mlhs_head mlhs_tail { $$ = NEW_MASGN(list_concat(NEW_LIST($1),$2), 0); } | mlhs_head mlhs_tail ',' tSTAR lhs { $$ = NEW_MASGN(list_concat(NEW_LIST($1),$2),$5); } | tSTAR lhs { $$ = NEW_MASGN(0, $2); } mlhs_item : lhs | tLPAREN mlhs_entry ')' { $$ = $2; } mlhs_head : mlhs_item ',' { $$ = $1; } mlhs_tail : mlhs_item { $$ = NEW_LIST($1); } | mlhs_tail ',' mlhs_item { $$ = list_append($1, $3); } lhs : variable { $$ = assignable($1, 0); } | primary '[' aref_args ']' { $$ = aryset($1, $3, 0); } | primary '.' tIDENTIFIER { $$ = attrset($1, $3, 0); } | backref { backref_error($1); $$ = 0; } cname : tIDENTIFIER { yyerror("class/module name must be CONSTANT"); } | tCONSTANT fname : tIDENTIFIER | tCONSTANT | tFID | op { lex_state = EXPR_END; $$ = $1; } | reswords { lex_state = EXPR_END; $$ = $1; } undef_list : fname { $$ = NEW_UNDEF($1); } | undef_list ',' {lex_state = EXPR_FNAME;} fname { $$ = block_append($1, NEW_UNDEF($4)); } op : tDOT2 { $$ = tDOT2; } | '|' { $$ = '|'; } | '^' { $$ = '^'; } | '&' { $$ = '&'; } | tCMP { $$ = tCMP; } | tEQ { $$ = tEQ; } | tEQQ { $$ = tEQQ; } | tMATCH { $$ = tMATCH; } | '>' { $$ = '>'; } | tGEQ { $$ = tGEQ; } | '<' { $$ = '<'; } | tLEQ { $$ = tLEQ; } | tLSHFT { $$ = tLSHFT; } | tRSHFT { $$ = tRSHFT; } | '+' { $$ = '+'; } | '-' { $$ = '-'; } | '*' { $$ = '*'; } | tSTAR { $$ = '*'; } | '/' { $$ = '/'; } | '%' { $$ = '%'; } | tPOW { $$ = tPOW; } | '~' { $$ = '~'; } | tUPLUS { $$ = tUPLUS; } | tUMINUS { $$ = tUMINUS; } | tAREF { $$ = tAREF; } | tASET { $$ = tASET; } | '`' { $$ = '`'; } reswords : k__LINE__ | k__FILE__ | klBEGIN | klEND | kALIAS | kAND | kBEGIN | kBREAK | kCASE | kCLASS | kDEF | kDEFINED | kDO | kELSE | kELSIF | kEND | kENSURE | kFALSE | kFOR | kIF_MOD | kIN | kMODULE | kNEXT | kNIL | kNOT | kOR | kREDO | kRESCUE | kRETRY | kRETURN | kSELF | kSUPER | kTHEN | kTRUE | kUNDEF | kUNLESS_MOD | kUNTIL_MOD | kWHEN | kWHILE_MOD | kYIELD arg : variable '=' {$$ = assignable($1, 0);} arg { $$ = $3; if ($$) { $$->nd_value = $4; fixpos($$, $4); } } | primary '[' aref_args ']' '=' arg { $$ = aryset($1, $3, $6); fixpos($$, $1); } | primary '.' tIDENTIFIER '=' arg { $$ = attrset($1, $3, $5); fixpos($$, $5); } | primary '.' tCONSTANT '=' arg { $$ = attrset($1, $3, $5); fixpos($$, $5); } | backref '=' arg { value_expr($3); backref_error($1); $$ = 0; } | variable tOP_ASGN arg { if (is_local_id($1)) { if (local_id($1)||!dyna_in_block()) { local_cnt($1); } else if (!dyna_var_defined($1)) { dyna_var_asgn($1, TRUE); } } if ($2 == tOROP) { $$ = NEW_OP_ASGN_OR(gettable($1), assignable($1, $3)); } else if ($2 == tANDOP) { $$ = NEW_OP_ASGN_AND(gettable($1), assignable($1, $3)); } else { $$ = assignable($1,call_op(gettable($1),$2,1,$3)); } fixpos($$, $3); } | primary '[' aref_args ']' tOP_ASGN arg { NODE *args = NEW_LIST($6); list_append($3, NEW_NIL()); list_concat(args, $3); if ($5 == tOROP) { $5 = 0; } else if ($5 == tANDOP) { $5 = 1; } $$ = NEW_OP_ASGN1($1, $5, args); fixpos($$, $1); } | primary '.' tIDENTIFIER tOP_ASGN arg { if ($4 == tOROP) { $4 = 0; } else if ($4 == tANDOP) { $4 = 1; } $$ = NEW_OP_ASGN2($1, $3, $4, $5); fixpos($$, $1); } | primary '.' tCONSTANT tOP_ASGN arg { if ($4 == tOROP) { $4 = 0; } else if ($4 == tANDOP) { $4 = 1; } $$ = NEW_OP_ASGN2($1, $3, $4, $5); fixpos($$, $1); } | backref tOP_ASGN arg { backref_error($1); $$ = 0; } | arg tDOT2 arg { $$ = NEW_DOT2($1, $3); } | arg tDOT3 arg { $$ = NEW_DOT3($1, $3); } | arg '+' arg { $$ = call_op($1, '+', 1, $3); } | arg '-' arg { $$ = call_op($1, '-', 1, $3); } | arg '*' arg { $$ = call_op($1, '*', 1, $3); } | arg '/' arg { $$ = call_op($1, '/', 1, $3); } | arg '%' arg { $$ = call_op($1, '%', 1, $3); } | arg tPOW arg { $$ = call_op($1, tPOW, 1, $3); } | tUPLUS arg { $$ = call_op($2, tUPLUS, 0); } | tUMINUS arg { $$ = call_op($2, tUMINUS, 0); } | arg '|' arg { $$ = call_op($1, '|', 1, $3); } | arg '^' arg { $$ = call_op($1, '^', 1, $3); } | arg '&' arg { $$ = call_op($1, '&', 1, $3); } | arg tCMP arg { $$ = call_op($1, tCMP, 1, $3); } | arg '>' arg { $$ = call_op($1, '>', 1, $3); } | arg tGEQ arg { $$ = call_op($1, tGEQ, 1, $3); } | arg '<' arg { $$ = call_op($1, '<', 1, $3); } | arg tLEQ arg { $$ = call_op($1, tLEQ, 1, $3); } | arg tEQ arg { $$ = call_op($1, tEQ, 1, $3); } | arg tEQQ arg { $$ = call_op($1, tEQQ, 1, $3); } | arg tNEQ arg { $$ = NEW_NOT(call_op($1, tEQ, 1, $3)); } | arg tMATCH arg { $$ = match_gen($1, $3); } | arg tNMATCH arg { $$ = NEW_NOT(match_gen($1, $3)); } | '!' arg { value_expr($2); $$ = NEW_NOT(cond($2)); } | '~' arg { $$ = call_op($2, '~', 0); } | arg tLSHFT arg { $$ = call_op($1, tLSHFT, 1, $3); } | arg tRSHFT arg { $$ = call_op($1, tRSHFT, 1, $3); } | arg tANDOP arg { $$ = logop(NODE_AND, $1, $3); } | arg tOROP arg { $$ = logop(NODE_OR, $1, $3); } | kDEFINED opt_nl {in_defined = 1;} arg { in_defined = 0; $$ = NEW_DEFINED($4); } | arg '?' arg ':' arg { value_expr($1); $$ = NEW_IF(cond($1), $3, $5); fixpos($$, $1); } | primary { $$ = $1; } aref_args : opt_call_args { if ($1 && nd_type($1) == NODE_BLOCK_PASS) { Error("block argument should not be given"); } $$ = $1; } opt_call_args : /* none */ { $$ = 0; } | call_args opt_nl call_args : command_call { value_expr($1); $$ = NEW_LIST($1); } | args opt_block_arg { $$ = arg_blk_pass($1, $2); } | args ',' tSTAR arg opt_block_arg { $$ = arg_add($1, $4); $$ = arg_blk_pass($$, $5); } | assocs opt_block_arg { $$ = NEW_LIST(NEW_HASH($1)); $$ = arg_blk_pass($$, $2); } | assocs ',' tSTAR arg opt_block_arg { $$ = arg_add(NEW_LIST(NEW_HASH($1)), $4); $$ = arg_blk_pass($$, $5); } | args ',' assocs opt_block_arg { $$ = list_append($1, NEW_HASH($3)); $$ = arg_blk_pass($$, $4); } | args ',' assocs ',' tSTAR arg opt_block_arg { $$ = arg_add(list_append($1, NEW_HASH($3)), $6); $$ = arg_blk_pass($$, $7); } | tSTAR arg opt_block_arg { value_expr($2); $$ = arg_blk_pass($2, $3); } | block_arg block_arg : tAMPER arg { value_expr($2); $$ = NEW_BLOCK_PASS($2); } opt_block_arg : ',' block_arg { $$ = $2; } | /* none */ { $$ = 0; } opt_list : args | /* none */ { $$ = 0; } args : arg { value_expr($1); $$ = NEW_LIST($1); } | args ',' arg { value_expr($3); $$ = list_append($1, $3); } mrhs : args { if ($1 && nd_type($1) == NODE_ARRAY && $1->nd_next == 0) { $$ = $1->nd_head; } else { $$ = $1; } } | args ',' tSTAR arg { value_expr($4); $$ = arg_add($1, $4); } | tSTAR arg { value_expr($2); $$ = $2; } ret_args : call_args { $$ = $1; if ($1) { if (nd_type($1) == NODE_ARRAY && $1->nd_next == 0) { $$ = $1->nd_head; } else if (nd_type($1) == NODE_BLOCK_PASS) { Error("block argument should not be given"); } } } array : /* none */ { $$ = 0; } | args trailer primary : literal { $$ = NEW_LIT($1); } | primary tCOLON2 cname { value_expr($1); $$ = NEW_COLON2($1, $3); } | tCOLON3 cname { $$ = NEW_COLON3($2); } | tSTRING { $$ = NEW_STR($1); } | tDSTRING | tXSTRING { $$ = NEW_XSTR($1); } | tDXSTRING | tDREGEXP | var_ref | backref | primary '[' aref_args ']' { value_expr($1); $$ = NEW_CALL($1, tAREF, $3); } | tLBRACK array ']' { if ($2 == 0) $$ = NEW_ZARRAY(); /* zero length array*/ else { $$ = $2; } } | tLBRACE assoc_list '}' { $$ = NEW_HASH($2); } | kRETURN '(' ret_args ')' { if (!cur_mid && !in_single) yyerror("return appeared outside of method"); value_expr($3); $$ = NEW_RET($3); } | kRETURN '(' ')' { if (!cur_mid && !in_single) yyerror("return appeared outside of method"); $$ = NEW_RET(0); } | kRETURN { if (!cur_mid && !in_single) yyerror("return appeared outside of method"); $$ = NEW_RET(0); } | kYIELD '(' ret_args ')' { value_expr($3); $$ = NEW_YIELD($3); } | kYIELD '(' ')' { $$ = NEW_YIELD(0); } | kYIELD { $$ = NEW_YIELD(0); } | kDEFINED opt_nl '(' {in_defined = 1;} expr ')' { in_defined = 0; $$ = NEW_DEFINED($5); } | tFID { $$ = NEW_VCALL($1); } | operation iter_block { $2->nd_iter = NEW_FCALL($1, 0); $$ = $2; } | method_call | method_call iter_block { if ($1 && nd_type($1) == NODE_BLOCK_PASS) { Error("both block arg and actual block given"); } $2->nd_iter = $1; $$ = $2; fixpos($$, $1); } | kIF expr then compstmt if_tail kEND { value_expr($2); $$ = NEW_IF(cond($2), $4, $5); fixpos($$, $2); } | kUNLESS expr then compstmt opt_else kEND { value_expr($2); $$ = NEW_UNLESS(cond($2), $4, $5); fixpos($$, $2); } | kWHILE expr do compstmt kEND { value_expr($2); $$ = NEW_WHILE(cond($2), $4, 1); fixpos($$, $2); } | kUNTIL expr do compstmt kEND { value_expr($2); $$ = NEW_UNTIL(cond($2), $4, 1); fixpos($$, $2); } | kCASE compstmt case_body kEND { value_expr($2); $$ = NEW_CASE($2, $3); fixpos($$, $2); } | kFOR iter_var kIN expr do compstmt kEND { value_expr($2); $$ = NEW_FOR($2, $4, $6); fixpos($$, $2); } | kBEGIN compstmt rescue ensure kEND { if (!$3 && !$4) $$ = NEW_BEGIN($2); else { if ($3) $2 = NEW_RESCUE($2, $3); if ($4) $2 = NEW_ENSURE($2, $4); $$ = $2; } fixpos($$, $2); } | tLPAREN compstmt ')' { $$ = $2; } | kCLASS cname superclass { if (cur_mid || in_single) yyerror("class definition in method body"); class_nest++; cref_push(); local_push(); } compstmt kEND { $$ = NEW_CLASS($2, $5, $3); fixpos($$, $3); local_pop(); cref_pop(); class_nest--; } | kCLASS tLSHFT expr term { class_nest++; cref_push(); local_push(); } compstmt kEND { $$ = NEW_SCLASS($3, $6); fixpos($$, $3); local_pop(); cref_pop(); class_nest--; } | kMODULE cname { if (cur_mid || in_single) yyerror("module definition in method body"); class_nest++; cref_push(); local_push(); } compstmt kEND { $$ = NEW_MODULE($2, $4); fixpos($$, $4); local_pop(); cref_pop(); class_nest--; } | kDEF fname { if (cur_mid || in_single) yyerror("nested method definition"); cur_mid = $2; local_push(); } f_arglist compstmt kEND { /* NOEX_PRIVATE for toplevel */ $$ = NEW_DEFN($2, $4, $5, class_nest?0:1); fixpos($$, $4); local_pop(); cur_mid = 0; } | kDEF singleton '.' {lex_state = EXPR_FNAME;} fname { value_expr($2); in_single++; local_push(); lex_state = EXPR_END; /* force for args */ } f_arglist compstmt kEND { $$ = NEW_DEFS($2, $5, $7, $8); fixpos($$, $2); local_pop(); in_single--; } | kBREAK { $$ = NEW_BREAK(); } | kNEXT { $$ = NEW_NEXT(); } | kREDO { $$ = NEW_REDO(); } | kRETRY { $$ = NEW_RETRY(); } then : term | kTHEN | term kTHEN do : term | kDO | term kDO if_tail : opt_else | kELSIF expr then compstmt if_tail { value_expr($2); $$ = NEW_IF(cond($2), $4, $5); fixpos($$, $2); } opt_else : /* none */ { $$ = 0; } | kELSE compstmt { $$ = $2; } iter_var : lhs | mlhs opt_iter_var : /* node */ { $$ = 0; } | '|' /* none */ '|' { $$ = 0; } | tOROP { $$ = 0; } | '|' iter_var '|' { $$ = $2; } iter_do_block : kDO { $$ = dyna_push(); } opt_iter_var compstmt kEND { $$ = NEW_ITER($3, 0, $4); fixpos($$, $3?$3:$4); dyna_pop($2); } iter_block : '{' { $$ = dyna_push(); } opt_iter_var compstmt '}' { $$ = NEW_ITER($3, 0, $4); fixpos($$, $3?$3:$4); dyna_pop($2); } iterator : tIDENTIFIER { $$ = NEW_VCALL($1); } | tCONSTANT { $$ = NEW_VCALL($1); } | tFID { $$ = NEW_VCALL($1); } | method_call | command_call method_call : operation '(' opt_call_args ')' { $$ = new_fcall($1, $3); fixpos($$, $3); } | primary '.' operation '(' opt_call_args ')' { value_expr($1); $$ = new_call($1, $3, $5); fixpos($$, $1); } | primary '.' operation { value_expr($1); $$ = new_call($1, $3, 0); } | primary tCOLON2 operation '(' opt_call_args ')' { value_expr($1); $$ = new_call($1, $3, $5); fixpos($$, $1); } | kSUPER '(' opt_call_args ')' { if (!cur_mid && !in_single && !in_defined) yyerror("super called outside of method"); $$ = NEW_SUPER($3); } | kSUPER { if (!cur_mid && !in_single && !in_defined) yyerror("super called outside of method"); $$ = NEW_ZSUPER(); } case_body : kWHEN args then compstmt cases { $$ = NEW_WHEN($2, $4, $5); } cases : opt_else | case_body rescue : kRESCUE opt_list do compstmt rescue { $$ = NEW_RESBODY($2, $4, $5); fixpos($$, $2?$2:$4); } | /* none */ { $$ = 0; } ensure : /* none */ { $$ = 0; } | kENSURE compstmt { $$ = $2; } literal : numeric | tSYMBEG symbol { $$ = INT2FIX($2); } | tREGEXP symbol : fname | tIVAR | tGVAR numeric : tINTEGER | tFLOAT variable : tIDENTIFIER | tIVAR | tGVAR | tCONSTANT | kNIL {$$ = kNIL;} | kSELF {$$ = kSELF;} | kTRUE {$$ = kTRUE;} | kFALSE {$$ = kFALSE;} | k__FILE__ {$$ = k__FILE__;} | k__LINE__ {$$ = k__LINE__;} var_ref : variable { $$ = gettable($1); } backref : tNTH_REF | tBACK_REF superclass : term { $$ = 0; } | '<' { lex_state = EXPR_BEG; } expr term { $$ = $3; } | error term {yyerrok; $$ = 0;} f_arglist : '(' f_args opt_nl ')' { $$ = $2; lex_state = EXPR_BEG; } | f_args term { $$ = $1; } f_args : f_arg ',' f_optarg ',' f_rest_arg opt_f_block_arg { $$ = block_append(NEW_ARGS($1, $3, $5), $6); } | f_arg ',' f_optarg opt_f_block_arg { $$ = block_append(NEW_ARGS($1, $3, -1), $4); } | f_arg ',' f_rest_arg opt_f_block_arg { $$ = block_append(NEW_ARGS($1, 0, $3), $4); } | f_arg opt_f_block_arg { $$ = block_append(NEW_ARGS($1, 0, -1), $2); } | f_optarg ',' f_rest_arg opt_f_block_arg { $$ = block_append(NEW_ARGS(0, $1, $3), $4); } | f_optarg opt_f_block_arg { $$ = block_append(NEW_ARGS(0, $1, -1), $2); } | f_rest_arg opt_f_block_arg { $$ = block_append(NEW_ARGS(0, 0, $1), $2); } | f_block_arg { $$ = block_append(NEW_ARGS(0, 0, -1), $1); } | /* none */ { $$ = NEW_ARGS(0, 0, -1); } f_arg : tIDENTIFIER { if (!is_local_id($1)) yyerror("formal argument must be local variable"); local_cnt($1); $$ = 1; } | f_arg ',' tIDENTIFIER { if (!is_local_id($3)) yyerror("formal argument must be local variable"); local_cnt($3); $$ += 1; } f_opt : tIDENTIFIER '=' arg { if (!is_local_id($1)) yyerror("formal argument must be local variable"); $$ = assignable($1, $3); } f_optarg : f_opt { $$ = NEW_BLOCK($1); $$->nd_end = $$; } | f_optarg ',' f_opt { $$ = block_append($1, $3); } f_rest_arg : tSTAR tIDENTIFIER { if (!is_local_id($2)) yyerror("rest argument must be local variable"); $$ = local_cnt($2); } f_block_arg : tAMPER tIDENTIFIER { $$ = NEW_BLOCK_ARG($2); } opt_f_block_arg : ',' f_block_arg { $$ = $2; } | /* none */ { $$ = 0; } singleton : var_ref { if (nd_type($1) == NODE_SELF) { $$ = NEW_SELF(); } else if (nd_type($1) == NODE_NIL) { yyerror("Can't define single method for nil."); $$ = 0; } else { $$ = $1; } } | tLPAREN expr opt_nl ')' { switch (nd_type($2)) { case NODE_STR: case NODE_DSTR: case NODE_XSTR: case NODE_DXSTR: case NODE_DREGX: case NODE_LIT: case NODE_ARRAY: case NODE_ZARRAY: yyerror("Can't define single method for literals."); default: break; } $$ = $2; } assoc_list : /* none */ { $$ = 0; } | assocs trailer { $$ = $1; } | args trailer { if ($1->nd_alen%2 != 0) { yyerror("odd number list for Hash"); } $$ = $1; } assocs : assoc | assocs ',' assoc { $$ = list_concat($1, $3); } assoc : arg tASSOC arg { $$ = list_append(NEW_LIST($1), $3); } operation : tIDENTIFIER | tCONSTANT | tFID opt_terms : /* none */ | terms opt_nl : /* none */ | '\n' trailer : /* none */ | '\n' | ',' term : ';' {yyerrok;} | '\n' terms : term | terms ';' {yyerrok;} %% #include #include #include "regex.h" #include "util.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(); static NODE *str_extend(); #define LEAVE_BS 1 static VALUE lex_input; /* non-nil if File */ static VALUE lex_lastline; /* gc protect */ static char *lex_pbeg; static char *lex_p; static char *lex_pend; static int yyerror(msg) char *msg; { char *p, *pe, *buf; int len, i; void Error_Append(); Error("%s", msg); p = lex_p; while (lex_pbeg <= p) { if (*p == '\n') break; p--; } p++; pe = lex_p; while (pe < lex_pend) { if (*pe == '\n') break; pe++; } len = pe - p; if (len > 4) { buf = ALLOCA_N(char, len+2); MEMCPY(buf, p, char, len); buf[len] = '\0'; Error_Append("%s", buf); i = lex_p - p; p = buf; pe = p + len; while (p < pe) { if (*p != '\t') *p = ' '; p++; } buf[i] = '^'; buf[i+1] = '\0'; Error_Append("%s", buf); } return 0; } static int newline_seen; static int heredoc_end; int rb_in_compile = 0; static NODE* yycompile(f) char *f; { int n; eval_tree = 0; newline_seen = 0; heredoc_end = 0; sourcefile = f; rb_in_compile = 1; n = yyparse(); rb_in_compile = 0; if (n == 0) return eval_tree; return 0; } NODE* compile_string(f, s, len) char *f, *s; int len; { lex_pbeg = lex_p = s; lex_pend = s + len; lex_input = 0; if (!sourcefile || strcmp(f, sourcefile)) /* not in eval() */ sourceline = 1; return yycompile(f); } NODE* compile_file(f, file, start) char *f; VALUE file; int start; { lex_input = file; lex_pbeg = lex_p = lex_pend = 0; sourceline = start; return yycompile(strdup(f)); } static int nextc() { int c; if (lex_p == lex_pend) { if (lex_input) { VALUE v = io_gets(lex_input); if (NIL_P(v)) return -1; if (heredoc_end > 0) { sourceline = heredoc_end+1; heredoc_end = 0; } while (RSTRING(v)->len >= 2 && RSTRING(v)->ptr[RSTRING(v)->len-1] == '\n' && RSTRING(v)->ptr[RSTRING(v)->len-2] == '\\') { VALUE v2 = io_gets(lex_input); if (!NIL_P(v2)) { str_cat(v, RSTRING(v2)->ptr, RSTRING(v2)->len); } } lex_pbeg = lex_p = RSTRING(v)->ptr; lex_pend = lex_p + RSTRING(v)->len; if (RSTRING(v)->len == 8 && strncmp(lex_pbeg, "__END__", 7) == 0) { lex_lastline = 0; return -1; } lex_lastline = v; } else { lex_lastline = 0; return -1; } } c = (unsigned char)*lex_p++; return c; } void pushback(c) int c; { if (c == -1) return; lex_p--; } #define tokfix() (tokenbuf[tokidx]='\0') #define tok() tokenbuf #define toklen() tokidx #define toklast() (tokidx>0?tokenbuf[tokidx-1]:0) static char* newtok() { tokidx = 0; if (!tokenbuf) { toksiz = 60; tokenbuf = ALLOC_N(char, 60); } if (toksiz > 4096) { toksiz = 60; REALLOC_N(tokenbuf, char, 60); } return tokenbuf; } static void tokadd(c) char c; { tokenbuf[tokidx++] = c; if (tokidx >= toksiz) { toksiz *= 2; REALLOC_N(tokenbuf, char, toksiz); } } static int read_escape() { int c; switch (c = nextc()) { case '\\': /* Backslash */ return c; case 'n': /* newline */ return '\n'; case 't': /* horizontal tab */ return '\t'; case 'r': /* carriage-return */ return '\r'; case 'f': /* form-feed */ return '\f'; case 'v': /* vertical tab */ return '\13'; case 'a': /* alarm(bell) */ return '\007'; case 'e': /* escape */ return 033; case '0': case '1': case '2': case '3': /* octal constant */ case '4': case '5': case '6': case '7': { char buf[3]; int i; pushback(c); for (i=0; i<3; i++) { c = nextc(); if (c == -1) goto eof; if (c < '0' || '7' < c) { pushback(c); break; } buf[i] = c; } c = scan_oct(buf, i+1, &i); } return c; case 'x': /* hex constant */ { char buf[2]; int i; for (i=0; i<2; i++) { buf[i] = nextc(); if (buf[i] == -1) goto eof; if (!ISXDIGIT(buf[i])) { pushback(buf[i]); break; } } c = scan_hex(buf, i+1, &i); } return c; case 'b': /* backspace */ return '\b'; case 's': /* space */ return ' '; case 'M': if ((c = nextc()) != '-') { yyerror("Invalid escape character syntax"); pushback(c); return '\0'; } if ((c = nextc()) == '\\') { return read_escape() | 0x80; } else if (c == -1) goto eof; else { return ((c & 0xff) | 0x80); } case 'C': if ((c = nextc()) != '-') { yyerror("Invalid escape character syntax"); pushback(c); return '\0'; } case 'c': case '^': if ((c = nextc())== '\\') { c = read_escape(); } else if (c == '?') return 0177; else if (c == -1) goto eof; return c & 0x9f; eof: case -1: yyerror("Invalid escape character syntax"); return '\0'; default: return c; } } static int parse_regx(term, paren) int term; { register int c; char kcode = 0; int once = 0; int nest = 0; int options = 0; int in_brack = 0; int re_start = sourceline; NODE *list = 0; newtok(); while ((c = nextc()) != -1) { if ((!in_brack && c == term) || nest > 0) { goto regx_end; } switch (c) { case '\n': sourceline++; break; case '[': in_brack = 1; break; case ']': in_brack = 0; break; case '#': list = str_extend(list, term); if (list == (NODE*)-1) return 0; continue; case '\\': switch (c = nextc()) { case -1: sourceline = re_start; Error("unterminated regexp meets end of file"); /* */ return 0; case '\n': sourceline++; break; case '\\': case '^': /* no \^ escape in regexp */ case 's': tokadd('\\'); tokadd(c); break; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': case '0': case 'x': tokadd('\\'); tokadd(c); break; case 'b': if (!in_brack) { tokadd('\\'); tokadd('b'); break; } /* fall through */ default: if (c == paren) nest++; if (c == term) nest--; if (c == '\n') { sourceline++; } else if (c == term) { tokadd(c); } else { pushback(c); tokadd('\\'); tokadd(read_escape()); } } continue; case -1: Error("unterminated regexp"); return 0; default: if (ismbchar(c)) { tokadd(c); c = nextc(); } break; regx_end: for (;;) { switch (c = nextc()) { case 'i': options |= RE_OPTION_IGNORECASE; break; case 'x': options |= RE_OPTION_EXTENDED; break; case 'o': once = 1; break; case 'n': kcode = 4; break; case 'e': kcode = 8; break; case 's': kcode = 12; break; default: pushback(c); goto end_options; } } end_options: 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, once?NODE_DREGX_ONCE:NODE_DREGX); list->nd_cflag = options | kcode; yylval.node = list; return tDREGEXP; } else { yylval.val = reg_new(tok(), toklen(), options | kcode); return tREGEXP; } } tokadd(c); } Error("unterminated regexp"); return 0; } static int parse_qstring _((int,int)); static int parse_string(func, term, paren) int func, term, paren; { int c; NODE *list = 0; int strstart; int nest = 0; if (func == '\'') { return parse_qstring(term, paren); } strstart = sourceline; newtok(); while ((c = nextc()) != term || nest > 0) { 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 = str_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 { pushback(c); if (func != '"') tokadd('\\'); tokadd(read_escape()); } continue; } if (c == paren) nest++; if (c == term) nest--; tokadd(c); } tokfix(); lex_state = EXPR_END; if (list) { if (toklen() > 0) { VALUE ss = str_new(tok(), toklen()); list_append(list, NEW_STR(ss)); } yylval.node = list; if (func == '`') { nd_set_type(list, NODE_DXSTR); return tDXSTRING; } else { return tDSTRING; } } else { yylval.val = str_new(tok(), toklen()); return (func == '`') ? tXSTRING : tSTRING; } } static int parse_qstring(term, paren) int term, paren; { int strstart; int c; int nest = 0; strstart = sourceline; newtok(); while ((c = nextc()) != term || nest > 0) { 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 '\'': if (term == '\'') { c = '\''; break; } /* fall through */ default: tokadd('\\'); } } if (c == paren) nest++; if (c == term) nest--; tokadd(c); } tokfix(); yylval.val = str_new(tok(), toklen()); lex_state = EXPR_END; return tSTRING; } static int parse_quotedword(term, paren) int term, paren; { if (parse_qstring(term, paren) == 0) return 0; yylval.node = NEW_CALL(NEW_STR(yylval.val), rb_intern("split"), 0); return tDSTRING; } char *strdup(); static int here_document(term) char term; { int c; char *eos; int len; VALUE str, line; VALUE lastline_save; int offset_save; NODE *list = 0; int linesave = sourceline; newtok(); switch (term) { case '\'': case '"': case '`': while ((c = nextc()) != term) { tokadd(c); } break; default: c = term; term = '"'; if (!is_identchar(c)) { Error("illegal here document"); return 0; } while (is_identchar(c)) { tokadd(c); c = nextc(); } pushback(c); break; } tokfix(); lastline_save = lex_lastline; offset_save = lex_p - lex_pbeg; eos = strdup(tok()); len = strlen(eos); str = str_new(0,0); for (;;) { line = io_gets(lex_input); if (NIL_P(line)) { error: Error("unterminated string meets end of file"); free(eos); return 0; } sourceline++; if (strncmp(eos, RSTRING(line)->ptr, len) == 0 && (RSTRING(line)->ptr[len] == '\n' || RSTRING(line)->ptr[len] == '\r')) { break; } lex_pbeg = lex_p = RSTRING(line)->ptr; lex_pend = lex_p + RSTRING(line)->len; switch (parse_string(term, '\n', '\n')) { case tSTRING: case tXSTRING: str_cat(yylval.val, "\n", 1); if (!list) { str_cat(str, RSTRING(yylval.val)->ptr, RSTRING(yylval.val)->len); } else { list_append(list, NEW_STR(yylval.val)); } break; case tDSTRING: case tDXSTRING: list_append(yylval.node, NEW_STR(str_new2("\n"))); nd_set_type(yylval.node, NODE_STR); if (!list) list = NEW_DSTR(str); yylval.node = NEW_LIST(yylval.node); yylval.node->nd_next = yylval.node->nd_head->nd_next; list_concat(list, yylval.node); break; case 0: goto error; } } free(eos); lex_lastline = lastline_save; lex_pbeg = RSTRING(lex_lastline)->ptr; lex_pend = lex_pbeg + RSTRING(lex_lastline)->len; lex_p = lex_pbeg + offset_save; lex_state = EXPR_END; heredoc_end = sourceline; sourceline = linesave; if (list) { yylval.node = list; } switch (term) { case '\'': case '"': if (list) return tDSTRING; yylval.val = str; return tSTRING; case '`': if (list) return tDXSTRING; return tXSTRING; } return 0; } #include "lex.c" static void arg_ambiguous() { Warning("ambiguous first argument; make sure"); } #ifndef atof double atof(); #endif static int yylex() { register int c; int space_seen = 0; struct kwtable *kw; if (newline_seen) { sourceline+=newline_seen; newline_seen = 0; } 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' */ space_seen = 1; goto retry; case '#': /* it's a comment */ while ((c = nextc()) != '\n') { if (c == -1) return 0; if (c == '\\') { /* skip a char */ c = nextc(); if (c == '\n') sourceline++; } if (ismbchar(c)) { c = nextc(); if (c == '\n') { sourceline++; break; } } } /* fall through */ case '\n': switch (lex_state) { case EXPR_BEG: case EXPR_FNAME: case EXPR_DOT: sourceline++; goto retry; default: break; } newline_seen++; lex_state = EXPR_BEG; return '\n'; case '*': if ((c = nextc()) == '*') { lex_state = EXPR_BEG; if (nextc() == '=') { yylval.id = tPOW; return tOP_ASGN; } pushback(c); return tPOW; } if (c == '=') { yylval.id = '*'; lex_state = EXPR_BEG; return tOP_ASGN; } pushback(c); if (lex_state == EXPR_ARG && space_seen && !ISSPACE(c)){ arg_ambiguous(); lex_state = EXPR_BEG; return tSTAR; } if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { lex_state = EXPR_BEG; return tSTAR; } lex_state = EXPR_BEG; return '*'; case '!': lex_state = EXPR_BEG; if ((c = nextc()) == '=') { return tNEQ; } if (c == '~') { return tNMATCH; } pushback(c); return '!'; case '=': if (lex_p == lex_pbeg + 1) { if (!lex_input) { Error("embedded document not available in eval"); } /* skip embedded rd document */ if (strncmp(lex_p, "begin", 5) == 0 && ISSPACE(lex_p[5])) { for (;;) { sourceline++; lex_p = lex_pend; c = nextc(); if (c == -1) { Error("embedded document meets end of file"); return 0; } if (c != '=') continue; if (strncmp(lex_p, "end", 3) == 0 && ISSPACE(lex_p[3])) { break; } } sourceline++; lex_p = lex_pend; goto retry; } } lex_state = EXPR_BEG; if ((c = nextc()) == '=') { if ((c = nextc()) == '=') { return tEQQ; } pushback(c); return tEQ; } if (c == '~') { return tMATCH; } else if (c == '>') { return tASSOC; } pushback(c); return '='; case '<': c = nextc(); if (c == '<' && lex_state != EXPR_END && lex_state != EXPR_CLASS && (lex_state != EXPR_ARG || space_seen)) { int c2 = nextc(); if (!ISSPACE(c2) && (strchr("\"'`", c2) || is_identchar(c2))) { if (!lex_input) { ArgError("here document not available in eval"); } return here_document(c2); } pushback(c2); } lex_state = EXPR_BEG; if (c == '=') { if ((c = nextc()) == '>') { return tCMP; } pushback(c); return tLEQ; } if (c == '<') { if (nextc() == '=') { yylval.id = tLSHFT; return tOP_ASGN; } pushback(c); return tLSHFT; } pushback(c); return '<'; case '>': lex_state = EXPR_BEG; if ((c = nextc()) == '=') { return tGEQ; } if (c == '>') { if ((c = nextc()) == '=') { yylval.id = tRSHFT; return tOP_ASGN; } pushback(c); return tRSHFT; } pushback(c); return '>'; case '"': return parse_string(c,c,c); case '`': if (lex_state == EXPR_FNAME) return c; return parse_string(c,c,c); case '\'': return parse_qstring(c,c); case '?': if (lex_state == EXPR_END) { Warning("a?b:c is undocumented feature ^^;;;"); lex_state = EXPR_BEG; return '?'; } c = nextc(); if (lex_state == EXPR_ARG && ISSPACE(c)){ pushback(c); arg_ambiguous(); lex_state = EXPR_BEG; Warning("a?b:c is undocumented feature ^^;;;"); return '?'; } if (c == '\\') { c = read_escape(); } c &= 0xff; yylval.val = INT2FIX(c); lex_state = EXPR_END; return tINTEGER; case '&': if ((c = nextc()) == '&') { lex_state = EXPR_BEG; if ((c = nextc()) == '=') { yylval.id = tANDOP; return tOP_ASGN; } pushback(c); return tANDOP; } else if (c == '=') { yylval.id = '&'; lex_state = EXPR_BEG; return tOP_ASGN; } pushback(c); if (lex_state == EXPR_ARG && space_seen && !ISSPACE(c)){ arg_ambiguous(); lex_state = EXPR_BEG; return tAMPER; } if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { lex_state = EXPR_BEG; return tAMPER; } lex_state = EXPR_BEG; return '&'; case '|': lex_state = EXPR_BEG; if ((c = nextc()) == '|') { if ((c = nextc()) == '=') { yylval.id = tOROP; return tOP_ASGN; } pushback(c); return tOROP; } else if (c == '=') { yylval.id = '|'; return tOP_ASGN; } pushback(c); return '|'; case '+': c = nextc(); if (lex_state == EXPR_FNAME) { if (c == '@') { return tUPLUS; } pushback(c); return '+'; } if (c == '=') { lex_state = EXPR_BEG; yylval.id = '+'; return tOP_ASGN; } if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { if (ISDIGIT(c)) { goto start_num; } pushback(c); lex_state = EXPR_BEG; return tUPLUS; } lex_state = EXPR_BEG; pushback(c); return '+'; case '-': c = nextc(); if (lex_state == EXPR_FNAME) { if (c == '@') { return tUMINUS; } pushback(c); return '-'; } if (c == '=') { lex_state = EXPR_BEG; yylval.id = '-'; return tOP_ASGN; } if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { if (ISDIGIT(c)) { pushback(c); c = '-'; goto start_num; } lex_state = EXPR_BEG; pushback(c); return tUMINUS; } lex_state = EXPR_BEG; pushback(c); return '-'; case '.': lex_state = EXPR_BEG; if ((c = nextc()) == '.') { if ((c = nextc()) == '.') { return tDOT3; } pushback(c); return tDOT2; } pushback(c); if (!ISDIGIT(c)) { lex_state = EXPR_DOT; 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; is_float = seen_point = seen_e = 0; lex_state = EXPR_END; newtok(); if (c == '-' || c == '+') { tokadd(c); c = nextc(); } if (c == '0') { c = nextc(); if (c == 'x' || c == 'X') { /* hexadecimal */ while (c = nextc()) { if (c == '_') continue; if (!ISXDIGIT(c)) break; tokadd(c); } pushback(c); tokfix(); yylval.val = str2inum(tok(), 16); return tINTEGER; } else if (c >= '0' && c <= '7') { /* octal */ do { tokadd(c); while ((c = nextc()) == '_') ; } while (c >= '0' && c <= '9'); pushback(c); tokfix(); yylval.val = str2inum(tok(), 8); return tINTEGER; } else if (c > '7' && c <= '9') { yyerror("Illegal octal digit"); } else if (c == '.') { tokadd('0'); } else { pushback(c); yylval.val = INT2FIX(0); return tINTEGER; } } 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 || seen_e) { goto decode_num; } else { int c0 = nextc(); if (!ISDIGIT(c0)) { pushback(c0); goto decode_num; } c = c0; } 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(c); tokfix(); if (is_float) { yylval.val = float_new(atof(tok())); return tFLOAT; } yylval.val = str2inum(tok(), 10); return tINTEGER; } case ']': case '}': case ')': lex_state = EXPR_END; return c; case ':': c = nextc(); if (c == ':') { if (lex_state == EXPR_BEG) { lex_state = EXPR_BEG; return tCOLON3; } if (lex_state == EXPR_ARG && space_seen) { arg_ambiguous(); lex_state = EXPR_BEG; return tCOLON3; } lex_state = EXPR_DOT; return tCOLON2; } pushback(c); if (lex_state == EXPR_END || ISSPACE(c)) { lex_state = EXPR_BEG; return ':'; } lex_state = EXPR_FNAME; return tSYMBEG; case '/': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { return parse_regx('/', '/'); } if ((c = nextc()) == '=') { lex_state = EXPR_BEG; yylval.id = '/'; return tOP_ASGN; } if (lex_state == EXPR_ARG) { if (space_seen && !ISSPACE(c)) { pushback(c); arg_ambiguous(); return parse_regx('/', '/'); } } lex_state = EXPR_BEG; pushback(c); return '/'; case '^': lex_state = EXPR_BEG; if (nextc() == '=') { yylval.id = '^'; return tOP_ASGN; } pushback(c); return c; case ',': case ';': lex_state = EXPR_BEG; return c; case '~': if (lex_state == EXPR_FNAME) { if ((c = nextc()) != '@') { pushback(c); } } lex_state = EXPR_BEG; return '~'; case '(': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { c = tLPAREN; lex_state = EXPR_BEG; } else { lex_state = EXPR_BEG; } return c; case '[': if (lex_state == EXPR_FNAME) { if ((c = nextc()) == ']') { if ((c = nextc()) == '=') { return tASET; } pushback(c); return tAREF; } pushback(c); return '['; } else if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { c = tLBRACK; } else if (lex_state == EXPR_ARG && space_seen) { arg_ambiguous(); c = tLBRACK; } lex_state = EXPR_BEG; return c; case '{': if (lex_state != EXPR_END && lex_state != EXPR_ARG) c = tLBRACE; lex_state = EXPR_BEG; return c; case '\\': c = nextc(); if (c == '\n') { sourceline++; space_seen = 1; goto retry; /* skip \\n */ } pushback(c); return '\\'; case '%': if (lex_state == EXPR_BEG || lex_state == EXPR_MID) { int term; int paren; c = nextc(); quotation: if (!ISALNUM(c)) { term = c; switch (c) { case '\'': c = 'q'; break; case '/': c = 'r'; break; case '`': c = 'x'; break; default: c = 'Q';break; } } else { term = nextc(); } if (c == -1 || term == -1) { Error("unterminated quoted string meets end of file"); return 0; } paren = term; if (term == '(') term = ')'; else if (term == '[') term = ']'; else if (term == '{') term = '}'; else if (term == '<') term = '>'; switch (c) { case 'Q': return parse_string('"', term, paren); case 'q': return parse_qstring(term, paren); case 'w': return parse_quotedword(term, paren); case 'x': return parse_string('`', term, paren); case 'r': return parse_regx(term, paren); default: yyerror("unknown type of %string"); return 0; } } if ((c = nextc()) == '=') { yylval.id = '%'; return tOP_ASGN; } if (lex_state == EXPR_ARG) { if (space_seen && !ISSPACE(c)) { arg_ambiguous(); goto quotation; } } lex_state = EXPR_BEG; pushback(c); return '%'; case '$': lex_state = EXPR_END; newtok(); c = nextc(); switch (c) { case '~': /* $~: match-data */ /* fall through */ case '_': /* $_: last read line string */ local_cnt(c); /* fall through */ case '*': /* $*: argv */ case '$': /* $$: pid */ case '?': /* $?: last status */ case '!': /* $!: error string */ case '@': /* $@: error position */ case '/': /* $/: input record separator */ case '\\': /* $\: output record separator */ case ';': /* $;: field separator */ case ',': /* $,: output field separator */ case '.': /* $.: last read line number */ case '=': /* $=: ignorecase */ case ':': /* $:: load path */ case '<': /* $<: reading filename */ case '>': /* $>: default output handle */ case '\"': /* $": already loaded files */ tokadd('$'); tokadd(c); tokfix(); yylval.id = rb_intern(tok()); return tGVAR; case '-': tokadd('$'); tokadd(c); c = nextc(); tokadd(c); tokfix(); yylval.id = rb_intern(tok()); return tGVAR; case '&': /* $&: last match */ case '`': /* $`: string before last match */ case '\'': /* $': string after last match */ case '+': /* $+: string matches last paren. */ yylval.node = NEW_BACK_REF(c); return tBACK_REF; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': while (ISDIGIT(c)) { tokadd(c); c = nextc(); } pushback(c); tokfix(); yylval.node = NEW_NTH_REF(atoi(tok())); return tNTH_REF; default: if (!is_identchar(c)) { pushback(c); return '$'; } case '0': tokadd('$'); } break; case '@': c = nextc(); if (!is_identchar(c)) { pushback(c); 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(); } if ((c == '!' || c == '?') && is_identchar(tok()[0])) { tokadd(c); } else { pushback(c); } tokfix(); { int result; switch (tok()[0]) { case '$': lex_state = EXPR_END; result = tGVAR; break; case '@': lex_state = EXPR_END; result = tIVAR; break; default: if (lex_state != EXPR_DOT) { /* See if it is a reserved word. */ kw = rb_reserved_word(tok(), toklen()); if (kw) { enum lex_state state = lex_state; if (lex_state == EXPR_FNAME) { yylval.id = rb_intern(kw->name); } lex_state = kw->state; return kw->id[state != EXPR_BEG]; } } if (ISUPPER(tok()[0])) { result = tCONSTANT; } else if (toklast() == '!' || toklast() == '?') { result = tFID; } else { result = tIDENTIFIER; if (lex_state == EXPR_FNAME) { lex_state = EXPR_END; if ((c = nextc()) == '=') { tokadd(c); } else { pushback(c); } } } if (lex_state == EXPR_BEG || lex_state == EXPR_DOT || lex_state == EXPR_ARG){ lex_state = EXPR_ARG; } else { lex_state = EXPR_END; } } tokfix(); yylval.id = rb_intern(tok()); return result; } } static NODE* str_extend(list, term) NODE *list; char term; { int c; int brace = -1; VALUE ss; NODE *node; int nest; c = nextc(); switch (c) { case '$': case '@': case '{': break; default: tokadd('#'); pushback(c); return list; } ss = str_new(tok(), toklen()); if (list == 0) { list = NEW_DSTR(ss); } else if (toklen() > 0) { list_append(list, NEW_STR(ss)); } newtok(); switch (c) { case '$': tokadd('$'); c = nextc(); if (c == -1) return (NODE*)-1; switch (c) { case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': while (ISDIGIT(c)) { tokadd(c); c = nextc(); } pushback(c); goto fetch_id; case '&': case '+': case '_': case '~': case '*': case '$': case '?': case '!': case '@': case ',': case '.': case '=': case ':': case '<': case '>': case '\\': refetch: tokadd(c); goto fetch_id; default: if (c == term) { list_append(list, NEW_STR(str_new2("#$"))); pushback(c); newtok(); return list; } switch (c) { case '\"': case '/': case '\'': case '`': goto refetch; } if (!is_identchar(c)) { yyerror("bad global variable in string"); newtok(); return list; } } /* through */ case '@': tokadd(c); c = nextc(); while (is_identchar(c)) { tokadd(c); if (ismbchar(c)) { c = nextc(); tokadd(c); } c = nextc(); } pushback(c); break; case '{': if (c == '{') brace = '}'; nest = 0; do { loop_again: c = nextc(); switch (c) { case -1: if (nest > 0) { yyerror("bad substitution in string"); newtok(); return list; } return (NODE*)-1; case '}': if (c == brace) { if (nest == 0) break; nest--; } tokadd(c); goto loop_again; case '\\': c = read_escape(); tokadd(c); goto loop_again; case '{': if (brace != -1) nest++; case '\"': case '/': case '`': if (c == term) { pushback(c); list_append(list, NEW_STR(str_new2("#"))); Warning("bad substitution in string"); tokfix(); list_append(list, NEW_STR(str_new(tok(), toklen()))); newtok(); return list; } default: tokadd(c); break; } } while (c != brace); } fetch_id: tokfix(); node = NEW_EVSTR(tok(),toklen()); list_append(list, node); newtok(); return list; } NODE* node_newnode(type, a0, a1, a2) enum node_type type; NODE *a0, *a1, *a2; { NODE *n = (NODE*)rb_newobj(); n->flags |= T_NODE; nd_set_type(n, type); nd_set_line(n, sourceline); n->nd_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); } int nodeline(node) NODE *node; { return nd_line(node); } static NODE* newline_node(node) NODE *node; { NODE *nl = 0; if (node) { nl = NEW_NEWLINE(node); fixpos(nl, node); nl->nd_nth = nd_line(node); } return nl; } static void fixpos(node, orig) NODE *node, *orig; { if (!node) return; if (!orig) return; node->nd_file = orig->nd_file; nd_set_line(node, nd_line(orig)); } static NODE* block_append(head, tail) NODE *head, *tail; { NODE *end; if (tail == 0) return head; if (head == 0) return tail; if (nd_type(head) != NODE_BLOCK) { end = NEW_BLOCK(head); end->nd_end = end; fixpos(end, head); head = end; } else { end = head->nd_end; } if (RTEST(verbose)) { NODE *nd = end->nd_head; newline: switch (nd_type(nd)) { case NODE_RETURN: case NODE_BREAK: case NODE_NEXT: case NODE_REDO: case NODE_RETRY: Warning("statement not reached"); break; case NODE_NEWLINE: nd = nd->nd_next; goto newline; default: break; } } if (nd_type(tail) != NODE_BLOCK) { tail = NEW_BLOCK(tail); tail->nd_end = tail; } end->nd_next = tail; head->nd_end = tail->nd_end; return head; } static NODE* list_append(head, tail) NODE *head, *tail; { NODE *last; if (head == 0) 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; last = head; while (last->nd_next) { last = last->nd_next; } last->nd_next = tail; head->nd_alen += tail->nd_alen; return head; } 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); } return NEW_CALL(recv, id, narg==1?NEW_LIST(arg1):0); } static NODE* match_gen(node1, node2) NODE *node1; NODE *node2; { local_cnt('~'); switch (nd_type(node1)) { case NODE_DREGX: case NODE_DREGX_ONCE: return NEW_MATCH2(node1, node2); case NODE_LIT: if (TYPE(node1->nd_lit) == T_REGEXP) { return NEW_MATCH2(node1, node2); } } switch (nd_type(node2)) { case NODE_DREGX: case NODE_DREGX_ONCE: return NEW_MATCH3(node2, node1); case NODE_LIT: if (TYPE(node2->nd_lit) == T_REGEXP) { return NEW_MATCH3(node2, node1); } } return NEW_CALL(node1, tMATCH, NEW_LIST(node2)); } static NODE* gettable(id) ID id; { if (id == kSELF) { return NEW_SELF(); } else if (id == kNIL) { return NEW_NIL(); } else if (id == kTRUE) { return NEW_TRUE(); } else if (id == kFALSE) { return NEW_FALSE(); } else if (id == k__FILE__) { return NEW_STR(str_new2(sourcefile)); } else if (id == k__LINE__) { return NEW_LIT(INT2FIX(sourceline)); } else if (is_local_id(id)) { if (dyna_in_block() && dyna_var_defined(id)) return NEW_DVAR(id); if (local_id(id)) return NEW_LVAR(id); /* method call without arguments */ return NEW_VCALL(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); } Bug("invalid id for gettable"); return 0; } static NODE* assignable(id, val) ID id; NODE *val; { NODE *lhs = 0; value_expr(val); if (id == kSELF) { yyerror("Can't change the value of self"); } else if (id == kNIL) { yyerror("Can't assign to nil"); } else if (id == kTRUE) { yyerror("Can't assign to true"); } else if (id == kFALSE) { yyerror("Can't assign to false"); } else if (id == k__FILE__) { yyerror("Can't assign to __FILE__"); } else if (id == k__LINE__) { yyerror("Can't assign to __LINE__"); } else if (is_local_id(id)) { if (dyna_var_defined(id)) { lhs = NEW_DASGN(id, val); } else if (local_id(id) || !dyna_in_block()) { lhs = NEW_LASGN(id, val); } else{ dyna_var_push(id, 0); lhs = NEW_DASGN_PUSH(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) yyerror("dynamic constant assignment"); lhs = NEW_CASGN(id, val); } else { Bug("bad id for variable"); } return lhs; } static NODE * arg_add(node1, node2) NODE *node1; NODE *node2; { return call_op(node1, rb_intern("concat"), 1, node2); } static NODE * aryset(recv, idx, val) NODE *recv, *idx, *val; { value_expr(recv); value_expr(val); if (idx) { if (nd_type(idx) == NODE_ARRAY) { idx = list_append(idx, val); } else { idx = arg_add(idx, val); } } return NEW_CALL(recv, tASET, idx); } ID id_attrset(id) ID id; { id &= ~ID_SCOPE_MASK; id |= ID_ATTRSET; return id; } static NODE * attrset(recv, id, val) NODE *recv, *val; ID id; { value_expr(recv); value_expr(val); return NEW_CALL(recv, id_attrset(id), NEW_LIST(val)); } static void backref_error(node) NODE *node; { switch (nd_type(node)) { case NODE_NTH_REF: Error("Can't set variable $%d", node->nd_nth); break; case NODE_BACK_REF: Error("Can't set variable $%c", node->nd_nth); break; } } static int value_expr(node) NODE *node; { if (node == 0) return TRUE; switch (nd_type(node)) { case NODE_RETURN: case NODE_BREAK: case NODE_NEXT: case NODE_REDO: case NODE_RETRY: case NODE_WHILE: case NODE_UNTIL: case NODE_CLASS: case NODE_MODULE: case NODE_DEFN: case NODE_DEFS: yyerror("void value expression"); return FALSE; break; case NODE_BLOCK: while (node->nd_next) { node = node->nd_next; } return value_expr(node->nd_head); case NODE_IF: return value_expr(node->nd_body) && value_expr(node->nd_else); case NODE_NEWLINE: return value_expr(node->nd_next); default: return TRUE; } } static NODE *cond2(); int assign_in_cond(node) NODE *node; { switch (nd_type(node)) { case NODE_MASGN: yyerror("multiple assignment in conditional"); return 1; case NODE_LASGN: case NODE_DASGN: case NODE_GASGN: case NODE_IASGN: case NODE_CASGN: break; case NODE_NEWLINE: default: return 0; } switch (nd_type(node->nd_value)) { case NODE_LIT: case NODE_STR: case NODE_DSTR: case NODE_XSTR: case NODE_DXSTR: case NODE_EVSTR: case NODE_DREGX: case NODE_NIL: case NODE_TRUE: case NODE_FALSE: /* reports always */ Warn("found = in conditional, should be =="); return 1; default: break; } if (assign_in_cond(node->nd_value) == 0) { Warning("assignment in condition"); } return 1; } static NODE* cond0(node) NODE *node; { enum node_type type = nd_type(node); assign_in_cond(node); switch (type) { case NODE_DREGX: case NODE_DREGX_ONCE: local_cnt('_'); local_cnt('~'); return NEW_MATCH2(node, NEW_GVAR(rb_intern("$_"))); case NODE_DOT2: case NODE_DOT3: node->nd_beg = cond2(node->nd_beg); node->nd_end = cond2(node->nd_end); if (type == NODE_DOT2) nd_set_type(node,NODE_FLIP2); else if (type == NODE_DOT3) nd_set_type(node, NODE_FLIP3); return node; case NODE_LIT: if (TYPE(node->nd_lit) == T_REGEXP) { local_cnt('_'); local_cnt('~'); return NEW_MATCH(node); } if (TYPE(node->nd_lit) == T_STRING) { local_cnt('_'); local_cnt('~'); return NEW_MATCH(reg_new(RSTRING(node)->ptr,RSTRING(node)->len,0)); } default: return node; } } static NODE* cond(node) NODE *node; { if (node == 0) return 0; if (nd_type(node) == NODE_NEWLINE){ node->nd_next = cond0(node->nd_next); return node; } return cond0(node); } static NODE* cond2(node) NODE *node; { enum node_type type; node = cond(node); type = nd_type(node); if (type == NODE_NEWLINE) node = node->nd_next; if (type == NODE_LIT && FIXNUM_P(node->nd_lit)) { return call_op(node,tEQ,1,NEW_GVAR(rb_intern("$."))); } return node; } static NODE* logop(type, left, right) enum node_type type; NODE *left, *right; { value_expr(left); return node_newnode(type, cond(left), cond(right)); } static NODE * arg_blk_pass(node1, node2) NODE *node1; NODE *node2; { if (node2) { node2->nd_head = node1; return node2; } return node1; } static NODE* new_call(r,m,a) NODE *r; ID m; NODE *a; { if (a && nd_type(a) == NODE_BLOCK_PASS) { a->nd_iter = NEW_CALL(r,m,a->nd_head); return a; } return NEW_CALL(r,m,a); } static NODE* new_fcall(m,a) ID m; NODE *a; { if (a && nd_type(a) == NODE_BLOCK_PASS) { a->nd_iter = NEW_FCALL(m,a->nd_head); return a; } return NEW_FCALL(m,a); } st_table *new_idhash(); static struct local_vars { ID *tbl; int nofree; int cnt; int dlev; struct local_vars *prev; } *lvtbl; static void local_push() { struct local_vars *local; local = ALLOC(struct local_vars); local->prev = lvtbl; local->nofree = 0; local->cnt = 0; local->tbl = 0; local->dlev = 0; lvtbl = local; } static void local_pop() { struct local_vars *local = lvtbl->prev; if (lvtbl->tbl) { if (!lvtbl->nofree) free(lvtbl->tbl); else lvtbl->tbl[0] = lvtbl->cnt; } free(lvtbl); lvtbl = local; } static ID* local_tbl() { lvtbl->nofree = 1; return lvtbl->tbl; } static int local_cnt(id) ID id; { int cnt, max; if (id == 0) return lvtbl->cnt; for (cnt=1, max=lvtbl->cnt+1; cnttbl[cnt] == id) return cnt-1; } if (lvtbl->tbl == 0) { lvtbl->tbl = ALLOC_N(ID, 4); lvtbl->tbl[0] = 0; lvtbl->tbl[1] = '_'; lvtbl->tbl[2] = '~'; lvtbl->cnt = 2; if (id == '_') return 0; if (id == '~') return 1; } 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 == 0) return FALSE; for (i=3, max=lvtbl->cnt+1; itbl[i] == id) return TRUE; } return FALSE; } static void top_local_init() { local_push(); lvtbl->cnt = the_scope->local_tbl?the_scope->local_tbl[0]:0; if (lvtbl->cnt > 0) { lvtbl->tbl = ALLOC_N(ID, lvtbl->cnt+3); MEMCPY(lvtbl->tbl, the_scope->local_tbl, ID, lvtbl->cnt+1); } else { lvtbl->tbl = 0; } if (the_dyna_vars) lvtbl->dlev = 1; else lvtbl->dlev = 0; } static void top_local_setup() { int len = lvtbl->cnt; int i; if (len > 0) { i = lvtbl->tbl[0]; if (i < len) { if (i == 0 || the_scope->flag == SCOPE_ALLOCA) { VALUE *vars = ALLOC_N(VALUE, len+1); if (the_scope->local_vars) { *vars++ = the_scope->local_vars[-1]; MEMCPY(vars, the_scope->local_vars, VALUE, i); memclear(vars+i, len-i); } else { *vars++ = 0; memclear(vars, len); } the_scope->local_vars = vars; the_scope->flag |= SCOPE_MALLOC; } else { VALUE *vars = the_scope->local_vars-1; REALLOC_N(vars, VALUE, len+1); the_scope->local_vars = vars+1; memclear(the_scope->local_vars+i, len-i); } if (the_scope->local_tbl && the_scope->local_vars[-1] == 0) { free(the_scope->local_tbl); } the_scope->local_vars[-1] = 0; the_scope->local_tbl = local_tbl(); } } local_pop(); } static struct RVarmap* dyna_push() { lvtbl->dlev++; return the_dyna_vars; } static void dyna_pop(vars) struct RVarmap* vars; { lvtbl->dlev--; the_dyna_vars = vars; } static int dyna_in_block() { return (lvtbl->dlev > 0); } static void cref_pop() { cur_cref = cur_cref->nd_next; } void yyappend_print() { eval_tree = block_append(eval_tree, NEW_FCALL(rb_intern("print"), NEW_ARRAY(NEW_GVAR(rb_intern("$_"))))); } void yywhile_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"), 0)), eval_tree); } if (chop) { eval_tree = block_append(NEW_CALL(NEW_GVAR(rb_intern("$_")), rb_intern("chop!"), 0), eval_tree); } eval_tree = NEW_OPT_N(eval_tree); } static struct op_tbl op_tbl[] = { tDOT2, "..", '+', "+", '-', "-", '+', "+(binary)", '-', "-(binary)", '*', "*", '/', "/", '%', "%", tPOW, "**", tUPLUS, "+@", tUMINUS, "-@", tUPLUS, "+(unary)", tUMINUS, "-(unary)", '|', "|", '^', "^", '&', "&", tCMP, "<=>", '>', ">", tGEQ, ">=", '<', "<", tLEQ, "<=", tEQ, "==", tEQQ, "===", tNEQ, "!=", tMATCH, "=~", tNMATCH, "!~", '!', "!", '~', "~", '!', "!(unary)", '~', "~(unary)", '!', "!@", '~', "~@", tAREF, "[]", tASET, "[]=", tLSHFT, "<<", tRSHFT, ">>", tCOLON2, "::", tCOLON3, "::", '`', "`", 0, 0, }; char *rb_id2name(); char *rb_class2name(); static st_table *sym_tbl; static st_table *sym_rev_tbl; void Init_sym() { sym_tbl = st_init_strtable(); sym_rev_tbl = st_init_numtable(); rb_global_variable((VALUE*)&cur_cref); rb_global_variable((VALUE*)&lex_lastline); } 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 = 0; switch (name[0]) { case '$': id |= ID_GLOBAL; break; case '@': id |= ID_INSTANCE; break; default: if (name[0] != '_' && !ISALPHA(name[0]) && !ismbchar(name[0])) { /* operator */ int i; for (i=0; op_tbl[i].token; i++) { if (*op_tbl[i].name == *name && strcmp(op_tbl[i].name, name) == 0) { id = op_tbl[i].token; goto id_regist; } } } last = strlen(name)-1; if (name[last] == '=') { /* attribute assignment */ char *buf = ALLOCA_N(char,last+1); strncpy(buf, name, last); buf[last] = '\0'; id = rb_intern(buf); if (id > LAST_TOKEN) { id = id_attrset(id); goto id_regist; } id |= ID_ATTRSET; } else if (ISUPPER(name[0])) { id = ID_CONST; } else { id = ID_LOCAL; } break; } id |= ++last_id << ID_SCOPE_SHIFT; id_regist: name = strdup(name); st_add_direct(sym_tbl, name, id); st_add_direct(sym_rev_tbl, id, name); return id; } char * rb_id2name(id) ID id; { char *name; if (id < LAST_TOKEN) { int i = 0; for (i=0; op_tbl[i].token; i++) { if (op_tbl[i].token == id) return op_tbl[i].name; } } if (st_lookup(sym_rev_tbl, id, &name)) return name; if (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 0; } int rb_is_const_id(id) ID id; { if (is_const_id(id)) return TRUE; return FALSE; } int rb_is_instance_id(id) ID id; { if (is_instance_id(id)) return TRUE; return FALSE; } static void special_local_set(c, val) char c; VALUE val; { int cnt; top_local_init(); cnt = local_cnt(c); top_local_setup(); the_scope->local_vars[cnt] = val; } VALUE backref_get() { if (the_scope->local_vars) { return the_scope->local_vars[1]; } return Qnil; } void backref_set(val) VALUE val; { if (the_scope->local_vars) { the_scope->local_vars[1] = val; } else { special_local_set('~', val); } } VALUE lastline_get() { if (the_scope->local_vars) { return the_scope->local_vars[0]; } return Qnil; } void lastline_set(val) VALUE val; { if (the_scope->local_vars) { the_scope->local_vars[0] = val; } else { special_local_set('_', val); } } ruby-1.2.3/process.c100644 774 145 50103 6635151627 12407 0ustar matzNaCl/************************************************ process.c - $Author: matz $ $Date: 1998/12/14 09:00:07 $ created at: Tue Aug 10 14:30:50 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "rubysig.h" #include #include #include #ifdef HAVE_UNISTD_H #include #endif #ifndef NT #ifdef HAVE_SYS_TIME_H # include #else struct timeval { long tv_sec; /* seconds */ long tv_usec; /* and microseconds */ }; #endif #endif /* NT */ #include struct timeval time_timeval _((VALUE)); #ifdef HAVE_SYS_WAIT_H # include #endif #ifdef HAVE_GETPRIORITY # include #endif #ifdef HAVE_VFORK_H #include #endif #include "st.h" #ifdef USE_CWGUSI # include # include "macruby_missing.h" #endif static VALUE get_pid() { return INT2FIX(getpid()); } static VALUE get_ppid() { #ifdef NT return INT2FIX(0); #else return INT2FIX(getppid()); #endif } VALUE last_status = Qnil; #if !defined(HAVE_WAITPID) && !defined(HAVE_WAIT4) #define NO_WAITPID static st_table *pid_tbl; #endif static int rb_waitpid(pid, flags, st) int pid; int flags; int *st; { int result; #ifndef NO_WAITPID #if defined(THREAD) int oflags = flags; if (!thread_alone()) { /* there're other threads to run */ flags |= WNOHANG; } #endif retry: #ifdef HAVE_WAITPID result = waitpid(pid, st, flags); #else /* HAVE_WAIT4 */ result = wait4(pid, st, flags, NULL); #endif if (result < 0) { if (errno == EINTR) { #ifdef THREAD thread_schedule(); #endif goto retry; } return -1; } #ifdef THREAD if (result == 0) { if (oflags & WNOHANG) return 0; thread_schedule(); if (thread_alone()) flags = oflags; goto retry; } #endif #else /* NO_WAITPID */ if (pid_tbl && st_lookup(pid_tbl, pid, st)) { last_status = INT2FIX(*st); st_delete(pid_tbl, &pid, NULL); return pid; } if (flags) { ArgError("Can't do waitpid with flags"); } for (;;) { result = wait(st); if (result < 0) { if (errno == EINTR) { #ifdef THREAD thread_schedule(); #endif continue; } return -1; } if (result == pid) { break; } if (!pid_tbl) pid_tbl = st_init_numtable(); st_insert(pid_tbl, pid, st); #ifdef THREAD if (!thread_alone()) thread_schedule(); #endif } #endif last_status = INT2FIX(*st); return result; } #ifdef NO_WAITPID struct wait_data { int pid; int status; }; static int wait_each(key, value, data) int key, value; struct wait_data *data; { if (data->status != -1) return ST_STOP; data->pid = key; data->status = value; return ST_DELETE; } #endif static VALUE f_wait() { int pid, state; #ifdef NO_WAITPID struct wait_data data; data.status = -1; st_foreach(pid_tbl, wait_each, &data); if (data.status != -1) { last_status = data.status; return INT2FIX(data.pid); } while ((pid = wait(&state)) < 0) { if (errno == EINTR) { #ifdef THREAD thread_schedule(); #endif continue; } rb_sys_fail(0); } last_status = INT2FIX(state); #else if ((pid = rb_waitpid(-1, 0, &state)) < 0) rb_sys_fail(0); #endif return INT2FIX(pid); } static VALUE f_waitpid(obj, vpid, vflags) VALUE obj, vpid, vflags; { int pid, flags, status; if (NIL_P(vflags)) flags = 0; else flags = FIX2UINT(vflags); if ((pid = rb_waitpid(FIX2UINT(vpid), flags, &status)) < 0) rb_sys_fail(0); return INT2FIX(pid); } char *strtok(); #if defined(THREAD) && defined(HAVE_SETITIMER) #define before_exec() thread_stop_timer() #define after_exec() thread_start_timer() #else #define before_exec() #define after_exec() #endif extern char *dln_find_exe(); static void security(str) char *str; { if (rb_safe_level() > 0) { #ifndef USE_CWGUSI if (env_path_tainted()) { Raise(eSecurityError, "Insecure PATH - %s", str); } #endif } } static int proc_exec_v(argv, prog) char **argv; char *prog; { #ifndef USE_CWGUSI if (prog) { security(prog); } else { security(argv[0]); prog = dln_find_exe(argv[0], 0); if (!prog) { errno = ENOENT; return -1; } } #if (defined(MSDOS) && !defined(DJGPP)) || defined(__human68k__) { #if defined(__human68k__) #define COMMAND "command.x" #else #define COMMAND "command.com" #endif char *extension; if ((extension = strrchr(prog, '.')) != NULL && strcasecmp(extension, ".bat") == 0) { char **new_argv; char *p; int n; for (n = 0; argv[n]; n++) /* no-op */; new_argv = ALLOCA_N(char *, n + 2); for (; n > 0; n--) new_argv[n + 1] = argv[n]; new_argv[1] = strcpy(ALLOCA_N(char, strlen(argv[0]) + 1), argv[0]); for (p = new_argv[1]; *p != '\0'; p++) if (*p == '/') *p = '\\'; new_argv[0] = COMMAND; argv = new_argv; prog = dln_find_exe(argv[0], 0); if (!prog) { errno = ENOENT; return -1; } } } #endif /* MSDOS or __human68k__ */ before_exec(); execv(prog, argv); after_exec(); return -1; #else /* USE_CWGUSI */ rb_notimplement(); #endif /* USE_CWGUSI */ } static int proc_exec_n(argc, argv, progv) int argc; VALUE *argv; VALUE progv; { char *prog = 0; char **args; int i; if (progv) { prog = RSTRING(progv)->ptr; } args = ALLOCA_N(char*, argc+1); for (i=0; iptr; } args[i] = 0; if (args[0]) { return proc_exec_v(args, prog); } return -1; } int rb_proc_exec(str) char *str; { #ifndef USE_CWGUSI char *s = str, *t; char **argv, **a; security(str); for (s=str; *s; s++) { if (*s != ' ' && !ISALPHA(*s) && strchr("*?{}[]<>()~&|\\$;'`\"\n",*s)) { #if defined(MSDOS) int state; before_exec(); state = system(str); after_exec(); if (state != -1) exit(state); #else #if defined(__human68k__) || defined(__CYGWIN32__) char *shell = dln_find_exe("sh", 0); int state = -1; before_exec(); if (shell) execl(shell, "sh", "-c", str, (char *) NULL); else state = system(str); after_exec(); if (state != -1) exit(state); #else before_exec(); execl("/bin/sh", "sh", "-c", str, (char *)NULL); after_exec(); #endif #endif 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]) { return proc_exec_v(argv, 0); } errno = ENOENT; return -1; #else /* USE_CWGUSI */ rb_notimplement(); #endif /* USE_CWGUSI */ } #if defined(__human68k__) static int proc_spawn_v(argv, prog) char **argv; char *prog; { char *extension; int state; if (prog) { security(prog); } else { security(argv[0]); prog = dln_find_exe(argv[0], 0); if (!prog) return -1; } if ((extension = strrchr(prog, '.')) != NULL && strcasecmp(extension, ".bat") == 0) { char **new_argv; char *p; int n; for (n = 0; argv[n]; n++) /* no-op */; new_argv = ALLOCA_N(char *, n + 2); for (; n > 0; n--) new_argv[n + 1] = argv[n]; new_argv[1] = strcpy(ALLOCA_N(char, strlen(argv[0]) + 1), argv[0]); for (p = new_argv[1]; *p != '\0'; p++) if (*p == '/') *p = '\\'; new_argv[0] = COMMAND; argv = new_argv; prog = dln_find_exe(argv[0], 0); if (!prog) { errno = ENOENT; return -1; } } before_exec(); state = spawnv(P_WAIT, prog, argv); after_exec(); return state; } static int proc_spawn_n(argc, argv, prog) int argc; VALUE *argv; VALUE prog; { char **args; int i; args = ALLOCA_N(char *, argc + 1); for (i = 0; i < argc; i++) { Check_SafeStr(argv[i]); args[i] = RSTRING(argv[i])->ptr; } Check_SafeStr(prog); args[i] = (char *) 0; if (args[0]) return proc_spawn_v(args, RSTRING(prog)->ptr); return -1; } static int proc_spawn(sv) VALUE sv; { char *str; char *s, *t; char **argv, **a; int state; Check_SafeStr(sv); str = s = RSTRING(sv)->ptr; for (s = str; *s; s++) { if (*s != ' ' && !ISALPHA(*s) && strchr("*?{}[]<>()~&|\\$;'`\"\n",*s)) { char *shell = dln_find_exe("sh", 0); before_exec(); state = shell ? spawnl(P_WAIT, shell, "sh", "-c", str, (char *) NULL) : system(str) ; after_exec(); return state; } } 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; } return argv[0] ? proc_spawn_v(argv, 0) : -1 ; } #endif /* __human68k__ */ static VALUE f_exec(argc, argv) int argc; VALUE *argv; { VALUE prog = 0; int i; if (argc == 0) { ArgError("wrong # of arguments"); } if (TYPE(argv[0]) == T_ARRAY) { if (RARRAY(argv[0])->len != 2) { ArgError("wrong first argument"); } prog = RARRAY(argv[0])->ptr[0]; argv[0] = RARRAY(argv[0])->ptr[1]; } if (TYPE(argv[0]) == T_ARRAY) { if (RARRAY(argv[0])->len != 2) { ArgError("wrong first argument"); } prog = RARRAY(argv[0])->ptr[0]; argv[0] = RARRAY(argv[0])->ptr[1]; } if (prog) { Check_SafeStr(prog); } for (i = 0; i < argc; i++) { Check_SafeStr(argv[i]); } if (argc == 1 && prog == 0) { rb_proc_exec(RSTRING(argv[0])->ptr); } else { proc_exec_n(argc, argv, prog); } rb_sys_fail(RSTRING(argv[0])->ptr); } static VALUE f_fork(obj) VALUE obj; { #if !defined(__human68k__) int pid; rb_secure(2); switch (pid = fork()) { case 0: #ifdef linux after_exec(); #endif if (iterator_p()) { rb_yield(Qnil); _exit(0); } return Qnil; case -1: rb_sys_fail("fork(2)"); return Qnil; default: return INT2FIX(pid); } #else rb_notimplement(); #endif } static VALUE f_exit_bang(obj, status) VALUE obj, status; { int code = -1; rb_secure(2); if (FIXNUM_P(status)) { code = INT2FIX(status); } #ifdef USE_CWGUSI exit(code); #else _exit(code); #endif /* not reached */ } void rb_syswait(pid) int pid; { RETSIGTYPE (*hfunc)(), (*qfunc)(), (*ifunc)(); int status; int i; #ifdef SIGHUP hfunc = signal(SIGHUP, SIG_IGN); #endif #ifdef SIGQUIT qfunc = signal(SIGQUIT, SIG_IGN); #endif ifunc = signal(SIGINT, SIG_IGN); do { i = rb_waitpid(pid, 0, &status); } while (i == -1 && errno == EINTR); #ifdef SIGHUP signal(SIGHUP, hfunc); #endif #ifdef SIGQUIT signal(SIGQUIT, qfunc); #endif signal(SIGINT, ifunc); } static VALUE f_system(argc, argv) int argc; VALUE *argv; { #ifdef NT VALUE cmd; int state; if (TYPE(argv[0]) == T_ARRAY) { if (RARRAY(argv[0])->len != 2) { ArgError("wrong first argument"); } argv[0] = RARRAY(argv[0])->ptr[0]; } cmd = ary_join(ary_new4(argc, argv), str_new2(" ")); Check_SafeStr(cmd); state = do_spawn(RSTRING(cmd)->ptr); last_status = INT2FIX(state); if (state == 0) return TRUE; return FALSE; #else #if defined(DJGPP) VALUE cmd; int state; if (TYPE(argv[0]) == T_ARRAY) { if (RARRAY(argv[0])->len != 2) { ArgError("wrong first argument"); } argv[0] = RARRAY(argv[0])->ptr[0]; } cmd = ary_join(ary_new4(argc, argv), str_new2(" ")); Check_SafeStr(cmd); state = system(RSTRING(cmd)->ptr); last_status = INT2FIX(state); if (state == 0) return TRUE; return FALSE; #else #if defined(__human68k__) VALUE prog = 0; int i; int state; fflush(stdin); fflush(stdout); fflush(stderr); if (argc == 0) { last_status = INT2FIX(0); return INT2FIX(0); } if (TYPE(argv[0]) == T_ARRAY) { if (RARRAY(argv[0])->len != 2) { ArgError("wrong first argument"); } prog = RARRAY(argv[0])->ptr[0]; argv[0] = RARRAY(argv[0])->ptr[1]; } if (argc == 1 && prog == 0) { state = proc_spawn(argv[0]); } else { state = proc_spawn_n(argc, argv, prog); } last_status = state == -1 ? INT2FIX(127) : INT2FIX(state); return state == 0 ? TRUE : FALSE ; #else volatile VALUE prog = 0; int pid; int i; fflush(stdout); fflush(stderr); if (argc == 0) { last_status = INT2FIX(0); return INT2FIX(0); } if (TYPE(argv[0]) == T_ARRAY) { if (RARRAY(argv[0])->len != 2) { ArgError("wrong first argument"); } prog = RARRAY(argv[0])->ptr[0]; argv[0] = RARRAY(argv[0])->ptr[1]; } if (prog) { Check_SafeStr(prog); } for (i = 0; i < argc; i++) { Check_SafeStr(argv[i]); } retry: switch (pid = vfork()) { case 0: if (argc == 1 && prog == 0) { rb_proc_exec(RSTRING(argv[0])->ptr); } else { proc_exec_n(argc, argv, prog); } _exit(127); break; /* not reached */ case -1: if (errno == EAGAIN) { #ifdef THREAD thread_sleep(1); #else sleep(1); #endif goto retry; } rb_sys_fail(0); break; default: rb_syswait(pid); } if (last_status == INT2FIX(0)) return TRUE; return FALSE; #endif #endif #endif } static VALUE f_sleep(argc, argv) int argc; VALUE *argv; { int beg, end; beg = time(0); #ifdef THREAD if (argc == 0) { thread_sleep_forever(); } else if (argc == 1) { thread_wait_for(time_timeval(argv[0])); } #else if (argc == 0) { TRAP_BEG; sleep((32767<<16)+32767); TRAP_END; } else if (argc == 1) { struct timeval tv; int n; tv = time_timeval(argv[0]); TRAP_BEG; n = select(0, 0, 0, 0, &tv); TRAP_END; if (n<0) rb_sys_fail(0); } #endif else { ArgError("wrong # of arguments"); } end = time(0) - beg; return INT2FIX(end); } #if !defined(NT) && !defined(DJGPP) && !defined(__human68k__) && !defined(USE_CWGUSI) static VALUE proc_getpgrp(argc, argv) int argc; VALUE *argv; { int pgrp; #ifdef BSD_GETPGRP VALUE vpid; int pid; rb_scan_args(argc, argv, "01", &vpid); pid = NIL_P(vpid)?0:NUM2INT(vpid); pgrp = BSD_GETPGRP(pid); #else rb_scan_args(argc, argv, "0"); pgrp = getpgrp(); #endif if (pgrp < 0) rb_sys_fail(0); return INT2FIX(pgrp); } static VALUE proc_setpgrp(argc, argv) int argc; VALUE *argv; { #ifdef HAVE_SETPGRP #ifdef BSD_SETPGRP VALUE pid, pgrp; int ipid, ipgrp; rb_scan_args(argc, argv, "02", &pid, &pgrp); ipid = NIL_P(pid)?0:NUM2INT(pid); ipgrp = NIL_P(pgrp)?0:NUM2INT(pgrp); if (BSD_SETPGRP(ipid, ipgrp) < 0) rb_sys_fail(0); #else rb_scan_args(argc, argv, "0"); if (setpgrp() < 0) rb_sys_fail(0); #endif return Qnil; #else rb_notimplement(); #endif } static VALUE proc_setpgid(obj, pid, pgrp) VALUE obj, pid, pgrp; { #ifdef HAVE_SETPGID int ipid, ipgrp; ipid = NUM2INT(pid); ipgrp = NUM2INT(pgrp); if (setpgid(ipid, ipgrp) < 0) rb_sys_fail(0); return Qnil; #else rb_notimplement(); #endif } static VALUE proc_setsid() { #ifdef HAVE_SETSID int pid = setsid(); if (pid < 0) rb_sys_fail(0); return INT2FIX(pid); #else rb_notimplement(); #endif } static VALUE proc_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 < 0) rb_sys_fail(0); return INT2FIX(prio); #else rb_notimplement(); #endif } static VALUE proc_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) < 0) rb_sys_fail(0); return INT2FIX(0); #else rb_notimplement(); #endif } #endif static VALUE proc_getuid(obj) VALUE obj; { int uid = getuid(); return INT2FIX(uid); } static VALUE proc_setuid(obj, id) VALUE obj, id; { int uid; uid = NUM2INT(id); #ifdef HAVE_SETREUID setreuid(uid, -1); #else #ifdef HAVE_SETRUID setruid(uid); #else { if (geteuid() == uid) setuid(uid); else rb_notimplement(); } #endif #endif return INT2FIX(uid); } static VALUE proc_getgid(obj) VALUE obj; { int gid = getgid(); return INT2FIX(gid); } static VALUE proc_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 rb_notimplement(); } #endif #endif return INT2FIX(gid); } static VALUE proc_geteuid(obj) VALUE obj; { int euid = geteuid(); return INT2FIX(euid); } static VALUE proc_seteuid(obj, euid) VALUE obj, euid; { #ifdef HAVE_SETEUID if (seteuid(NUM2INT(euid)) < 0) rb_sys_fail(0); #else #ifdef HAVE_SETREUID if (setreuid(-1, NUM2INT(euid)) < 0) rb_sys_fail(0); #else euid = NUM2INT(euid); if (euid == getuid()) setuid(euid); else rb_notimplement(); #endif #endif return euid; } static VALUE proc_getegid(obj) VALUE obj; { int egid = getegid(); return INT2FIX(egid); } static VALUE proc_setegid(obj, egid) VALUE obj, egid; { #ifdef HAVE_SETEGID if (setegid(NUM2INT(egid)) < 0) rb_sys_fail(0); #else #ifdef HAVE_SETREGID if (setregid(-1, NUM2INT(egid)) < 0) rb_sys_fail(0); #else egid = NUM2INT(egid); if (egid == getgid()) setgid(egid); else rb_notimplement(); #endif #endif return egid; } VALUE mProcess; extern VALUE f_kill(); void Init_process() { #ifndef USE_CWGUSI rb_define_virtual_variable("$$", get_pid, 0); #endif rb_define_readonly_variable("$?", &last_status); #ifndef USE_CWGUSI rb_define_global_function("exec", f_exec, -1); #endif #if !defined(NT) && !defined(USE_CWGUSI) rb_define_global_function("fork", f_fork, 0); #endif rb_define_global_function("exit!", f_exit_bang, 1); #ifndef USE_CWGUSI rb_define_global_function("system", f_system, -1); #endif rb_define_global_function("sleep", f_sleep, -1); mProcess = rb_define_module("Process"); #if !defined(NT) && !defined(DJGPP) #ifdef WNOHANG rb_define_const(mProcess, "WNOHANG", INT2FIX(WNOHANG)); #else rb_define_const(mProcess, "WNOHANG", INT2FIX(0)); #endif #ifdef WUNTRACED rb_define_const(mProcess, "WUNTRACED", INT2FIX(WUNTRACED)); #else rb_define_const(mProcess, "WUNTRACED", INT2FIX(0)); #endif #endif #if !defined(NT) && !defined(USE_CWGUSI) rb_define_singleton_method(mProcess, "fork", f_fork, 0); #endif rb_define_singleton_method(mProcess, "exit!", f_exit_bang, 1); #ifndef USE_CWGUSI rb_define_module_function(mProcess, "kill", f_kill, -1); #endif #ifndef NT rb_define_module_function(mProcess, "wait", f_wait, 0); rb_define_module_function(mProcess, "waitpid", f_waitpid, 2); #ifndef USE_CWGUSI rb_define_module_function(mProcess, "pid", get_pid, 0); rb_define_module_function(mProcess, "ppid", get_ppid, 0); #endif /* ifndef USE_CWGUSI */ #endif /* ifndef NT */ #if !defined(NT) && !defined(DJGPP) && !defined(__human68k__) && !defined(USE_CWGUSI) rb_define_module_function(mProcess, "getpgrp", proc_getpgrp, -1); rb_define_module_function(mProcess, "setpgrp", proc_setpgrp, -1); rb_define_module_function(mProcess, "setpgid", proc_setpgid, 2); rb_define_module_function(mProcess, "setsid", proc_setsid, 0); rb_define_module_function(mProcess, "getpriority", proc_getpriority, 2); rb_define_module_function(mProcess, "setpriority", proc_setpriority, 3); #ifdef PRIO_PROCESS rb_define_const(mProcess, "PRIO_PROCESS", INT2FIX(PRIO_PROCESS)); rb_define_const(mProcess, "PRIO_PGRP", INT2FIX(PRIO_PGRP)); rb_define_const(mProcess, "PRIO_USER", INT2FIX(PRIO_USER)); #endif rb_define_module_function(mProcess, "uid", proc_getuid, 0); rb_define_module_function(mProcess, "uid=", proc_setuid, 1); rb_define_module_function(mProcess, "gid", proc_getgid, 0); rb_define_module_function(mProcess, "gid=", proc_setgid, 1); rb_define_module_function(mProcess, "euid", proc_geteuid, 0); rb_define_module_function(mProcess, "euid=", proc_seteuid, 1); rb_define_module_function(mProcess, "egid", proc_getegid, 0); rb_define_module_function(mProcess, "egid=", proc_setegid, 1); #endif } ruby-1.2.3/random.c100644 774 145 5131 6573444250 12170 0ustar matzNaCl/************************************************ random.c - $Author: matz $ $Date: 1998/09/03 07:43:36 $ created at: Fri Dec 24 16:39:21 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include #ifndef NT #ifdef HAVE_SYS_TIME_H # include #else struct timeval { long tv_sec; /* seconds */ long tv_usec; /* and microseconds */ }; #endif #endif /* NT */ #ifdef HAVE_STDLIB_H # include #endif /* * Prefer to use drand48, otherwise use random, or rand as a last resort. */ #ifdef HAVE_DRAND48 #ifndef HAVE_DRAND48_DECL double drand48 _((void)); void srand48 _((long)); #endif #define SRANDOM(s) srand48((long)(s)) #define RANDOM_NUMBER drand48() #else /* not HAVE_DRAND48 */ /* * The largest number returned by the random number generator is * RANDOM_MAX. If we're using `rand' it's RAND_MAX, but if we're * using `random' it's 2^31-1. */ #ifndef RANDOM_MAX # ifndef HAVE_RANDOM # define RANDOM_MAX RAND_MAX # else # define RANDOM_MAX 2147483647.0 # endif #endif #ifdef HAVE_RANDOM #define RANDOM random #define SRANDOM srandom #else /* HAVE_RANDOM */ #define RANDOM rand #define SRANDOM srand #endif /* HAVE_RANDOM */ /* 0 <= RANDOM_NUMBER <= 1 */ #define RANDOM_NUMBER (((double)RANDOM())/(double)RANDOM_MAX) #endif /* not HAVE_DRAND48 */ #ifdef HAVE_RANDOM static int first = 1; static char state[256]; #endif static VALUE f_srand(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE seed; int old; static int saved_seed; if (rb_scan_args(argc, argv, "01", &seed) == 0) { struct timeval tv; gettimeofday(&tv, 0); seed = tv.tv_sec ^ tv.tv_usec; } else { seed = NUM2UINT(seed); } #ifdef HAVE_RANDOM if (first == 1) { initstate(1, state, sizeof state); first = 0; } else { setstate(state); } #endif SRANDOM(seed); old = saved_seed; saved_seed = seed; return int2inum(old); } static VALUE f_rand(obj, vmax) VALUE obj, vmax; { long val, max; switch (TYPE(vmax)) { case T_BIGNUM: return big_rand(vmax); case T_FLOAT: if (RFLOAT(vmax)->value > LONG_MAX || RFLOAT(vmax)->value < LONG_MIN) return big_rand(dbl2big(RFLOAT(vmax)->value)); break; } max = NUM2LONG(vmax); if (max == 0) { return float_new(RANDOM_NUMBER); } val = max*RANDOM_NUMBER; if (val < 0) val = -val; return int2inum(val); } void Init_Random() { rb_define_global_function("srand", f_srand, -1); rb_define_global_function("rand", f_rand, 1); } ruby-1.2.3/range.c100644 774 145 10361 6553556512 12030 0ustar matzNaCl/************************************************ range.c - $Author: matz $ $Date: 1998/07/17 05:12:42 $ created at: Thu Aug 19 17:46:47 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" static VALUE cRange; static ID id_upto, id_cmp; static ID id_beg, id_end; static VALUE range_check(args) VALUE *args; { rb_funcall(args[0], id_cmp, 1, args[1]); return Qnil; } static VALUE range_failed() { ArgError("bad value for range"); } static VALUE range_s_new(klass, first, last) VALUE klass, first, last; { VALUE obj; VALUE args[2]; args[0] = first; args[1] = last; rb_rescue(range_check, (VALUE)args, range_failed, 0); obj = obj_alloc(klass); rb_ivar_set(obj, id_beg, first); rb_ivar_set(obj, id_end, last); obj_call_init(obj); return obj; } VALUE range_new(first, last) VALUE first, last; { return range_s_new(cRange, first, last); } static VALUE range_eqq(rng, obj) VALUE rng, obj; { VALUE first, last; first = rb_ivar_get(rng, id_beg); last = rb_ivar_get(rng, id_end); if (FIXNUM_P(first) && FIXNUM_P(obj) && FIXNUM_P(last)) { if (FIX2INT(first) <= FIX2INT(obj) && FIX2INT(obj) <= FIX2INT(last)) { return TRUE; } return FALSE; } else { if (RTEST(rb_funcall(first, rb_intern("<="), 1, obj)) && RTEST(rb_funcall(last, rb_intern(">="), 1, obj))) { return TRUE; } return FALSE; } } struct upto_data { VALUE first; VALUE last; }; static VALUE range_upto(data) struct upto_data *data; { return rb_funcall(data->first, id_upto, 1, data->last); } static VALUE range_each(obj) VALUE obj; { VALUE b, e; b = rb_ivar_get(obj, id_beg); e = rb_ivar_get(obj, id_end); if (FIXNUM_P(b)) { /* fixnum is a special case(for performance) */ num_upto(b, e); } else { struct upto_data data; data.first = b; data.last = e; rb_iterate(range_upto, (VALUE)&data, rb_yield, 0); } return Qnil; } static VALUE range_first(obj) VALUE obj; { VALUE b; b = rb_ivar_get(obj, id_beg); return b; } static VALUE range_last(obj) VALUE obj; { VALUE e; e = rb_ivar_get(obj, id_end); return e; } VALUE range_beg_end(range, begp, endp) VALUE range; int *begp, *endp; { VALUE first, last; if (!obj_is_kind_of(range, cRange)) return FALSE; first = rb_ivar_get(range, id_beg); *begp = NUM2INT(first); last = rb_ivar_get(range, id_end); *endp = NUM2INT(last); return TRUE; } static VALUE range_to_s(range) VALUE range; { VALUE str, str2; str = obj_as_string(rb_ivar_get(range, id_beg)); str2 = obj_as_string(rb_ivar_get(range, id_end)); str_cat(str, "..", 2); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); return str; } static VALUE range_inspect(range) VALUE range; { VALUE str, str2; str = rb_inspect(rb_ivar_get(range, id_beg)); str2 = rb_inspect(rb_ivar_get(range, id_end)); str_cat(str, "..", 2); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); return str; } VALUE enum_length(); static VALUE range_length(rng) VALUE rng; { VALUE first, last; VALUE size; first = rb_ivar_get(rng, id_beg); last = rb_ivar_get(rng, id_end); if (RTEST(rb_funcall(first, '>', 1, last))) { return INT2FIX(0); } if (!obj_is_kind_of(first, cNumeric)) { return enum_length(rng); } size = rb_funcall(last, '-', 1, first); size = rb_funcall(size, '+', 1, INT2FIX(1)); return size; } void Init_Range() { cRange = rb_define_class("Range", cObject); rb_include_module(cRange, mEnumerable); rb_define_singleton_method(cRange, "new", range_s_new, 2); rb_define_method(cRange, "===", range_eqq, 1); rb_define_method(cRange, "each", range_each, 0); rb_define_method(cRange, "first", range_first, 0); rb_define_method(cRange, "last", range_last, 0); rb_define_method(cRange, "to_s", range_to_s, 0); rb_define_method(cRange, "inspect", range_inspect, 0); rb_define_method(cRange, "length", range_length, 0); rb_define_method(cRange, "size", range_length, 0); id_upto = rb_intern("upto"); id_cmp = rb_intern("<=>"); id_beg = rb_intern("first"); id_end = rb_intern("last"); } ruby-1.2.3/re.c100644 774 145 54203 6621530726 11340 0ustar matzNaCl/************************************************ re.c - $Author: matz $ $Date: 1998/11/09 09:11:50 $ created at: Mon Aug 9 18:24:49 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "re.h" static VALUE eRegxpError; #define BEG(no) regs->beg[no] #define END(no) regs->end[no] #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) VALUE str1, str2; { int len, i; char *p1, *p2; len = MIN(RSTRING(str1)->len, RSTRING(str2)->len); p1 = RSTRING(str1)->ptr; p2 = RSTRING(str2)->ptr; for (i = 0; i < len; i++, p1++, p2++) { if (casetable[(unsigned)*p1] != casetable[(unsigned)*p2]) return casetable[(unsigned)*p1] - casetable[(unsigned)*p2]; } return RSTRING(str1)->len - RSTRING(str2)->len; } #define REG_IGNORECASE FL_USER0 #define REG_CASESTATE FL_USER1 #define KCODE_NONE 0 #define KCODE_EUC FL_USER2 #define KCODE_SJIS FL_USER3 #define KCODE_FIXED FL_USER4 #define KCODE_MASK (KCODE_EUC|KCODE_SJIS) static int reg_kcode = #ifdef RUBY_USE_EUC KCODE_EUC; #else # ifdef RUBY_USE_SJIS KCODE_SJIS; # else KCODE_NONE; # endif #endif static void kcode_euc(reg) struct RRegexp *reg; { FL_UNSET(reg, KCODE_MASK); FL_SET(reg, KCODE_EUC); FL_SET(reg, KCODE_FIXED); } static void kcode_sjis(reg) struct RRegexp *reg; { FL_UNSET(reg, KCODE_MASK); FL_SET(reg, KCODE_SJIS); FL_SET(reg, KCODE_FIXED); } static void kcode_none(reg) struct RRegexp *reg; { FL_UNSET(reg, KCODE_MASK); FL_SET(reg, KCODE_FIXED); } static void kcode_set_option(reg) VALUE reg; { if (!FL_TEST(reg, KCODE_FIXED)) return; switch ((RBASIC(reg)->flags & KCODE_MASK)) { case KCODE_NONE: re_mbcinit(MBCTYPE_ASCII); break; case KCODE_EUC: re_mbcinit(MBCTYPE_EUC); break; case KCODE_SJIS: re_mbcinit(MBCTYPE_SJIS); break; } } void kcode_reset_option() { switch (reg_kcode) { case KCODE_NONE: re_mbcinit(MBCTYPE_ASCII); break; case KCODE_EUC: re_mbcinit(MBCTYPE_EUC); break; case KCODE_SJIS: re_mbcinit(MBCTYPE_SJIS); break; } } extern int rb_in_compile; static void reg_expr_str(str, s, len) VALUE str; char *s; int len; { char *p, *pend; int slash = 0; p = s; pend = p + len; while (pflags & KCODE_MASK)) { case KCODE_NONE: str_cat(str, "n", 1); break; case KCODE_EUC: str_cat(str, "e", 1); break; case KCODE_SJIS: str_cat(str, "s", 1); break; } } } return str; } static VALUE reg_source(re) VALUE re; { VALUE str = str_new(0,0); reg_expr_str(str, RREGEXP(re)->str, RREGEXP(re)->len); return str; } static VALUE reg_inspect(re) VALUE re; { return reg_desc(RREGEXP(re)->str, RREGEXP(re)->len, re); } static void reg_raise(s, len, err, re) char *s; int len; char *err; VALUE re; { VALUE desc = reg_desc(s, len, re); if (rb_in_compile) Error("%s: %s", err, RSTRING(desc)->ptr); else Raise(eRegxpError, "%s: %s", err, RSTRING(desc)->ptr); } static VALUE reg_casefold_p(re) VALUE re; { if (FL_TEST(re, REG_IGNORECASE)) return TRUE; return FALSE; } static VALUE reg_kcode_method(re) VALUE re; { char *kcode = "$KCODE"; if (FL_TEST(re, KCODE_FIXED)) { switch (RBASIC(re)->flags & KCODE_MASK) { case KCODE_NONE: kcode = "none"; break; case KCODE_EUC: kcode = "euc"; break; case KCODE_SJIS: kcode = "sjis"; break; default: break; } } return str_new2(kcode); } static Regexp* make_regexp(s, len, flag) char *s; int len, flag; { Regexp *rp; char *err; /* 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->buffer = ALLOC_N(char, 16); rp->allocated = 16; rp->fastmap = ALLOC_N(char, 256); if (flag) { rp->options = flag; } err = re_compile_pattern(s, (size_t)len, rp); kcode_reset_option(); if (err != NULL) { reg_raise(s, len, err, 0); } return rp; } static VALUE cMatch; static VALUE match_alloc() { NEWOBJ(match, struct RMatch); OBJSETUP(match, cMatch, T_MATCH); match->str = 0; match->regs = 0; match->regs = ALLOC(struct re_registers); MEMZERO(match->regs, struct re_registers, 1); return (VALUE)match; } static VALUE match_clone(orig) VALUE orig; { NEWOBJ(match, struct RMatch); OBJSETUP(match, cMatch, T_MATCH); match->str = RMATCH(orig)->str; match->regs = 0; match->regs = ALLOC(struct re_registers); match->regs->allocated = 0; re_copy_registers(match->regs, RMATCH(orig)->regs); return (VALUE)match; } VALUE ignorecase; static VALUE matchcache; void reg_prepare_re(reg) VALUE reg; { int casefold = RTEST(ignorecase); int need_recompile = 0; /* case-flag set for the object */ if (FL_TEST(reg, REG_IGNORECASE)) { casefold = TRUE; } else if ((casefold && !FL_TEST(reg, REG_CASESTATE)) || (!casefold && FL_TEST(reg, REG_CASESTATE))) { RREGEXP(reg)->ptr->fastmap_accurate = 0; RBASIC(reg)->flags ^= REG_CASESTATE; need_recompile = 1; } if (FL_TEST(reg, KCODE_FIXED)) { kcode_set_option(reg); } else if ((RBASIC(reg)->flags & KCODE_MASK) != reg_kcode) { need_recompile = 1; RBASIC(reg)->flags &= ~KCODE_MASK; RBASIC(reg)->flags |= reg_kcode; } if (need_recompile) { char *err; err = re_compile_pattern(RREGEXP(reg)->str, RREGEXP(reg)->len, RREGEXP(reg)->ptr); if (err != NULL) { kcode_reset_option(); reg_raise(RREGEXP(reg)->str, RREGEXP(reg)->len, err, reg); } } } int reg_search(reg, str, start, reverse) VALUE reg, str; int start, reverse; { int result; VALUE match = 0; struct re_registers *regs = 0; int range; if (start > RSTRING(str)->len) return -1; reg_prepare_re(reg); if (matchcache) { match = matchcache; matchcache = 0; } else { match = match_alloc(); } regs = RMATCH(match)->regs; if (reverse) { range = -start; } else { range = RSTRING(str)->len-start; } result = re_search(RREGEXP(reg)->ptr,RSTRING(str)->ptr,RSTRING(str)->len, start, range, regs); kcode_reset_option(); if (result == -2) { reg_raise(RREGEXP(reg)->str, RREGEXP(reg)->len, "Stack overfow in regexp matcher", reg); } if (result < 0) { matchcache = match; backref_set(Qnil); } else if (match) { RMATCH(match)->str = str_new4(str); backref_set(match); } return result; } VALUE reg_nth_defined(nth, match) int nth; VALUE match; { if (NIL_P(match)) return Qnil; if (nth >= RMATCH(match)->regs->num_regs) { return FALSE; } if (RMATCH(match)->BEG(nth) == -1) return FALSE; return TRUE; } VALUE reg_nth_match(nth, match) int nth; VALUE match; { int start, end, len; if (NIL_P(match)) return Qnil; if (nth >= RMATCH(match)->regs->num_regs) { return Qnil; } start = RMATCH(match)->BEG(nth); if (start == -1) return Qnil; end = RMATCH(match)->END(nth); len = end - start; return str_new(RSTRING(RMATCH(match)->str)->ptr + start, len); } VALUE reg_last_match(match) VALUE match; { return reg_nth_match(0, match); } VALUE reg_match_pre(match) VALUE match; { if (NIL_P(match)) return Qnil; if (RMATCH(match)->BEG(0) == -1) return Qnil; return str_new(RSTRING(RMATCH(match)->str)->ptr, RMATCH(match)->BEG(0)); } VALUE reg_match_post(match) VALUE match; { if (NIL_P(match)) return Qnil; if (RMATCH(match)->BEG(0) == -1) return Qnil; return str_new(RSTRING(RMATCH(match)->str)->ptr+RMATCH(match)->END(0), RSTRING(RMATCH(match)->str)->len-RMATCH(match)->END(0)); } VALUE reg_match_last(match) VALUE match; { int i; if (NIL_P(match)) return Qnil; if (RMATCH(match)->BEG(0) == -1) return Qnil; for (i=RMATCH(match)->regs->num_regs-1; RMATCH(match)->BEG(i) == -1 && i > 0; i--) ; if (i == 0) return Qnil; return reg_nth_match(i, match); } static VALUE last_match_getter() { return reg_last_match(backref_get()); } static VALUE prematch_getter() { return reg_match_pre(backref_get()); } static VALUE postmatch_getter() { return reg_match_post(backref_get()); } static VALUE last_paren_match_getter() { return reg_match_last(backref_get()); } static VALUE match_to_a(match) VALUE match; { struct re_registers *regs = RMATCH(match)->regs; VALUE ary = ary_new2(regs->num_regs); char *ptr = RSTRING(RMATCH(match)->str)->ptr; int i; for (i=0; inum_regs; i++) { if (regs->beg[i] == -1) ary_push(ary, Qnil); else ary_push(ary, str_new(ptr+regs->beg[i], regs->end[i]-regs->beg[i])); } return ary; } static VALUE match_aref(argc, argv, match) int argc; VALUE *argv; VALUE match; { VALUE idx, rest; struct re_registers *regs; char *ptr; int i; rb_scan_args(argc, argv, "11", &idx, &rest); if (!NIL_P(rest) || !FIXNUM_P(idx) || FIX2INT(idx) < 0) { return ary_aref(argc, argv, match_to_a(match)); } regs = RMATCH(match)->regs; i = FIX2INT(idx); if (i>=regs->num_regs) return Qnil; ptr = RSTRING(RMATCH(match)->str)->ptr; return str_new(ptr+regs->beg[i], regs->end[i]-regs->beg[i]); } static VALUE match_to_s(match) VALUE match; { VALUE str = reg_last_match(match); if (NIL_P(str)) return str_new(0,0); return str; } VALUE cRegexp; static VALUE reg_new_1(klass, s, len, options) VALUE klass; char *s; int len; int options; /* CASEFOLD = 1 */ /* EXTENDED = 2 */ /* CODE_NONE = 4 */ /* CODE_EUC = 8 */ /* CODE_SJIS = 12 */ { NEWOBJ(re, struct RRegexp); OBJSETUP(re, klass, T_REGEXP); re->ptr = 0; re->str = 0; if (options & RE_OPTION_IGNORECASE) { FL_SET(re, REG_IGNORECASE); } switch (options & ~0x3) { case 0: default: FL_SET(re, reg_kcode); break; case 4: kcode_none(re); break; case 8: kcode_euc(re); break; case 12: kcode_sjis(re); break; } kcode_set_option((VALUE)re); if (RTEST(ignorecase)) { options |= RE_OPTION_IGNORECASE; FL_SET(re, REG_CASESTATE); } re->ptr = make_regexp(s, len, options & 0x3); re->str = ALLOC_N(char, len+1); memcpy(re->str, s, len); re->str[len] = '\0'; re->len = len; if (options & ~0x3) { kcode_reset_option(); } obj_call_init((VALUE)re); return (VALUE)re; } VALUE reg_new(s, len, options) char *s; int len, options; { return reg_new_1(cRegexp, s, len, options); } static int ign_cache; static VALUE reg_cache; VALUE reg_regcomp(str) VALUE str; { int ignc = RTEST(ignorecase); if (reg_cache && RREGEXP(reg_cache)->len == RSTRING(str)->len && ign_cache == ignc && memcmp(RREGEXP(reg_cache)->str, RSTRING(str)->ptr, RSTRING(str)->len) == 0) return reg_cache; ign_cache = ignc; return reg_cache = reg_new(RSTRING(str)->ptr, RSTRING(str)->len, ignc); } static int reg_cur_kcode(re) VALUE re; { if (FL_TEST(re, KCODE_FIXED)) { return RBASIC(re)->flags & KCODE_MASK; } return 0; } static VALUE reg_equal(re1, re2) VALUE re1, re2; { int min; if (re1 == re2) return TRUE; if (TYPE(re2) != T_REGEXP) return FALSE; if (RREGEXP(re1)->len != RREGEXP(re2)->len) return FALSE; min = RREGEXP(re1)->len; if (min > RREGEXP(re2)->len) min = RREGEXP(re2)->len; if (memcmp(RREGEXP(re1)->str, RREGEXP(re2)->str, min) == 0 && reg_cur_kcode(re1) == reg_cur_kcode(re2) && !(FL_TEST(re1,REG_IGNORECASE) ^ FL_TEST(re2,REG_IGNORECASE))) { return TRUE; } return FALSE; } VALUE reg_match(re, str) VALUE re, str; { int start; if (NIL_P(str)) return Qnil; str = str_to_str(str); start = reg_search(re, str, 0, 0); if (start >= 0) return INT2FIX(start); return Qnil; } VALUE reg_match2(re) VALUE re; { int start; VALUE line = lastline_get(); if (TYPE(line) != T_STRING) return Qnil; start = reg_search(re, line, 0, 0); if (start >= 0) return INT2FIX(start); return Qnil; } static VALUE reg_s_new(argc, argv, self) int argc; VALUE *argv; VALUE self; { VALUE src; int flag = 0; if (argc == 0 || argc > 3) { ArgError("wrong # of argument"); } if (argc >= 2 && RTEST(argv[1])) { flag = RE_OPTION_IGNORECASE; } if (argc == 3) { char *kcode = STR2CSTR(argv[2]); switch (kcode[0]) { case 'n': case 'N': flag |= 4; break; case 'e': case 'E': flag |= 8; break; case 's': case 'S': flag |= 12; break; default: break; } } src = argv[0]; if (TYPE(src) == T_REGEXP) { return reg_new_1(self, RREGEXP(src)->str, RREGEXP(src)->len, flag); } else { char *p; int len; p = str2cstr(src, &len); return reg_new_1(self, p, len, flag); } } static VALUE reg_s_quote(re, str) VALUE re, str; { char *s, *send, *t; char *tmp; int len; s = str2cstr(str, &len); send = s + len; tmp = ALLOCA_N(char, len*2); t = tmp; for (; s != send; s++) { if (ismbchar(*s)) { *t++ = *s++; *t++ = *s; continue; } if (*s == '[' || *s == ']' || *s == '{' || *s == '}' || *s == '(' || *s == ')' || *s == '|' || *s == '*' || *s == '.' || *s == '\\' || *s == '?' || *s == '+' || *s == '^' || *s == '$') { *t++ = '\\'; } *t++ = *s; } return str_new(tmp, t - tmp); } static int reg_get_kcode(re) VALUE re; { int kcode = 0; switch (RBASIC(re)->flags & KCODE_MASK) { case KCODE_NONE: kcode |= 4; break; case KCODE_EUC: kcode |= 8; break; case KCODE_SJIS: kcode |= 12; break; default: break; } return kcode; } int reg_options(re) VALUE re; { int options = 0; if (FL_TEST(re, REG_IGNORECASE)) options |= RE_OPTION_IGNORECASE; if (FL_TEST(re, KCODE_FIXED)) { options |= reg_get_kcode(re); } return options; } static VALUE reg_clone(re) VALUE re; { return reg_new_1(CLASS_OF(re), RREGEXP(re)->str, RREGEXP(re)->len, reg_options(re)); } VALUE reg_regsub(str, src, regs) VALUE str, src; struct re_registers *regs; { VALUE val = 0; char *p, *s, *e, c; int no; p = s = RSTRING(str)->ptr; e = s + RSTRING(str)->len; while (s < e) { char *ss = s; c = *s++; if (ismbchar(c)) { s++; continue; } if (c != '\\' || s == e) continue; if (!val) val = str_new(p, ss-p); else str_cat(val, p, ss-p); c = *s++; p = s; switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': no = c - '0'; break; case '&': no = 0; break; case '`': str_cat(val, RSTRING(src)->ptr, BEG(0)); continue; case '\'': str_cat(val, RSTRING(src)->ptr+END(0), RSTRING(src)->len-END(0)); continue; case '+': no = regs->num_regs-1; while (BEG(no) == -1 && no > 0) no--; if (no == 0) continue; break; case '\\': str_cat(val, s-1, 1); continue; default: str_cat(val, s-2, 2); continue; } if (no >= 0) { if (BEG(no) == -1) continue; str_cat(val, RSTRING(src)->ptr+BEG(no), END(no)-BEG(no)); } } if (p < e) { if (!val) val = str_new(p, e-p); else str_cat(val, p, e-p); } if (!val) return str; return val; } char* rb_get_kcode() { switch (reg_kcode) { case KCODE_SJIS: return "SJIS"; case KCODE_EUC: return "EUC"; default: return "NONE"; } } static VALUE kcode_getter() { return str_new2(rb_get_kcode()); } void rb_set_kcode(code) char *code; { if (code == 0) goto set_no_conversion; switch (code[0]) { case 'E': case 'e': reg_kcode = KCODE_EUC; re_mbcinit(MBCTYPE_EUC); break; case 'S': case 's': reg_kcode = KCODE_SJIS; re_mbcinit(MBCTYPE_SJIS); break; default: case 'N': case 'n': case 'A': case 'a': set_no_conversion: reg_kcode = KCODE_NONE; re_mbcinit(MBCTYPE_ASCII); break; } } static void kcode_setter(val) struct RString *val; { rb_set_kcode(STR2CSTR(val)); } static VALUE match_getter() { return backref_get(); } static void match_setter(val) VALUE val; { Check_Type(val, T_MATCH); backref_set(val); } void Init_Regexp() { eRegxpError = rb_define_class("RegxpError", eStandardError); re_set_syntax(RE_NO_BK_PARENS | RE_NO_BK_VBAR | RE_INTERVALS | RE_NO_BK_BRACES | RE_CONTEXTUAL_INVALID_OPS | RE_CHAR_CLASSES | RE_BACKSLASH_ESCAPE_IN_LISTS); re_set_casetable(casetable); #ifdef RUBY_USE_EUC re_mbcinit(MBCTYPE_EUC); #else #ifdef RUBY_USE_SJIS re_mbcinit(MBCTYPE_SJIS); #else re_mbcinit(MBCTYPE_ASCII); #endif #endif rb_define_virtual_variable("$~", match_getter, match_setter); rb_define_virtual_variable("$&", last_match_getter, 0); rb_define_virtual_variable("$`", prematch_getter, 0); rb_define_virtual_variable("$'", postmatch_getter, 0); rb_define_virtual_variable("$+", last_paren_match_getter, 0); rb_define_variable("$=", &ignorecase); rb_define_virtual_variable("$KCODE", kcode_getter, kcode_setter); rb_define_virtual_variable("$-K", kcode_getter, kcode_setter); cRegexp = rb_define_class("Regexp", cObject); rb_define_singleton_method(cRegexp, "new", reg_s_new, -1); rb_define_singleton_method(cRegexp, "compile", reg_s_new, -1); rb_define_singleton_method(cRegexp, "quote", reg_s_quote, 1); rb_define_method(cRegexp, "clone", reg_clone, 0); rb_define_method(cRegexp, "==", reg_equal, 1); rb_define_method(cRegexp, "=~", reg_match, 1); rb_define_method(cRegexp, "===", reg_match, 1); rb_define_method(cRegexp, "~", reg_match2, 0); rb_define_method(cRegexp, "inspect", reg_inspect, 0); rb_define_method(cRegexp, "source", reg_source, 0); rb_define_method(cRegexp, "casefold?", reg_casefold_p, 0); rb_define_method(cRegexp, "kcode", reg_kcode_method, 0); rb_global_variable(®_cache); rb_global_variable(&matchcache); cMatch = rb_define_class("MatchingData", cData); rb_define_method(cMatch, "clone", match_clone, 0); rb_define_method(cMatch, "to_a", match_to_a, 0); rb_define_method(cMatch, "[]", match_aref, -1); rb_define_method(cMatch, "to_s", match_to_s, 0); rb_define_method(cMatch, "inspect", any_to_s, 0); } ruby-1.2.3/re.h100644 774 145 1316 6627210212 11311 0ustar matzNaCl/************************************************ re.h - $Author: matz $ $Revision: 1.1.1.2.2.3 $ $Date: 1998/11/26 08:25:46 $ created at: Thu Sep 30 14:18:32 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #ifndef RE_H #define RE_H #include #include #include "regex.h" typedef struct re_pattern_buffer Regexp; struct RMatch { struct RBasic basic; VALUE str; struct re_registers *regs; }; #define RMATCH(obj) (R_CAST(RMatch)(obj)) int str_cicmp _((VALUE, VALUE)); VALUE reg_regcomp _((VALUE)); int reg_search _((VALUE, VALUE, int, int)); VALUE reg_regsub _((VALUE, VALUE, struct re_registers *)); #endif ruby-1.2.3/regex.c100644 774 145 357611 6660231134 12067 0ustar matzNaCl/* 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. */ /* We write fatal error messages on standard error. */ #include /* isalpha(3) etc. are used for the character classes. */ #include #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 #include "config.h" void *xmalloc P((unsigned long)); void *xcalloc P((unsigned long,unsigned long)); void *xrealloc P((void*,unsigned long)); void free P((void*)); /* #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(HAVE_ALLOCA_H) # include # else char *alloca(); # endif #endif /* __GNUC__ */ #ifdef _AIX #pragma alloca #endif #ifdef HAVE_STRING_H # include #else # include #endif #define RE_ALLOCATE alloca #ifdef C_ALLOCA #define FREE_VARIABLES() alloca(0) #else #define FREE_VARIABLES() #endif #define FREE_AND_RETURN_VOID(stackb) return #define FREE_AND_RETURN(stackb,val) return(val) #define DOUBLE_STACK(stackx,stackb,len,type) \ (stackx = (type*)alloca(2 * len * sizeof(type)), \ /* Only copy what is in use. */ \ (type*)memcpy(stackx, stackb, len * sizeof (type))) #else /* NO_ALLOCA defined */ #define RE_ALLOCATE xmalloc #define FREE_VAR(var) if (var) free(var); var = NULL #define FREE_VARIABLES() \ do { \ FREE_VAR(regstart); \ FREE_VAR(regend); \ FREE_VAR(old_regstart) \ FREE_VAR(old_regend); \ FREE_VAR(best_regstart); \ FREE_VAR(best_regend); \ FREE_VAR(reg_info); \ } while (0) #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,type) \ (type*)xrealloc(stackb, 2 * len * sizeof(type)) #endif /* NO_ALLOCA */ #define RE_TALLOC(n,t) ((t*)RE_ALLOCATE((n)*sizeof(t))) #define TMALLOC(n,t) ((t*)xmalloc((n)*sizeof(t))) #define TREALLOC(s,n,t) (s=((t*)xrealloc(s,(n)*sizeof(t)))) #define EXPAND_FAIL_STACK(stackx,stackb,len) \ do {\ /* Roughly double the size of the stack. */ \ stackx = DOUBLE_STACK(stackx,stackb,len,unsigned char*); \ /* Rearrange the pointers. */ \ stackp = stackx + (stackp - stackb); \ stackb = stackx; \ stacke = stackb + 2 * len; \ } while (0) /* Get the interface, including the syntax bits. */ #include "regex.h" /* Subroutines for re_compile_pattern. */ 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 P((int, char*, char*)); static void insert_op_2 P((int, char*, char*, int, int)); static int memcmp_translate P((unsigned char*, unsigned char*, int)); static int alt_match_null_string_p (); static int common_op_match_null_string_p (); static int group_match_null_string_p (); /* Define the syntax stuff, so we can do the \<, \>, etc. */ /* This must be nonzero for the wordchar and notwordchar pattern commands in re_match. */ #define Sword 1 #define Sword2 2 #define SYNTAX(c) re_syntax_table[c] static char re_syntax_table[256]; static void init_syntax_once P((void)); static unsigned char *translate = 0; static void init_regs P((struct re_registers*, unsigned int)); static void bm_init_skip P((int *, unsigned char*, int, char*)); #undef P #include "util.h" 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=0; c<0x7f; c++) if (isalnum(c)) re_syntax_table[c] = Sword; re_syntax_table['_'] = Sword; for (c=0x80; c<=0xff; c++) if (isalnum(c)) re_syntax_table[c] = Sword2; done = 1; } void re_set_casetable(table) char *table; { translate = (unsigned char*)table; } /* Jim Meyering writes: "... Some ctype macros are valid only for character codes that isascii says are ASCII (SGI's IRIX-4.0.5 is one such system --when using /bin/cc or gcc but without giving an ansi option). So, all ctype uses should be through macros like ISPRINT... If STDC_HEADERS is defined, then autoconf has verified that the ctype macros don't need to be guarded with references to isascii. ... Defining isascii to 1 should let any compiler worth its salt eliminate the && through constant folding." */ #ifdef isblank #define ISBLANK(c) isblank ((unsigned char)c) #else #define ISBLANK(c) ((c) == ' ' || (c) == '\t') #endif #ifdef isgraph #define ISGRAPH(c) isgraph ((unsigned char)c) #else #define ISGRAPH(c) (isprint ((unsigned char)c) && !isspace ((unsigned char)c)) #endif #define ISPRINT(c) isprint ((unsigned char)c) #define ISDIGIT(c) isdigit ((unsigned char)c) #define ISALNUM(c) isalnum ((unsigned char)c) #define ISALPHA(c) isalpha ((unsigned char)c) #define ISCNTRL(c) iscntrl ((unsigned char)c) #define ISLOWER(c) islower ((unsigned char)c) #define ISPUNCT(c) ispunct ((unsigned char)c) #define ISSPACE(c) isspace ((unsigned char)c) #define ISUPPER(c) isupper ((unsigned char)c) #define ISXDIGIT(c) isxdigit ((unsigned char)c) /* 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. */ begbuf, /* Succeeds if at beginning of buffer (if emacs) or at beginning of string to be matched (if not). */ endbuf, /* Analogously, for end of buffer/string. */ endbuf2, /* End of buffer/string, or newline just before it. */ jump, /* Followed by two bytes giving relative address to jump to. */ jump_past_alt,/* Same as jump, but marks the end of an alternative. */ 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. */ push_dummy_failure, /* Push a dummy failure point and continue. Used at the end of alternatives. */ 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. */ try_next, /* Jump to next pattern for the first time, leaving this pattern on the failure stack. */ finalize_push, /* Finalize stack and push the beginning of the pattern on the stack to retry (used for non-greedy match) */ finalize_push_n, /* Similar to finalize_push, buf finalize n time only */ 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. */ stop_paren, /* Place holder at the end of (?:..). */ casefold_on, /* Turn on casefold flag. */ casefold_off, /* Turn off casefold flag. */ start_nowidth, /* Save string point to the stack. */ stop_nowidth, /* Restore string place at the point start_nowidth. */ pop_and_fail, /* Fail after popping nowidth entry from stack. */ duplicate, /* Match a duplicate of something remembered. Followed by one byte containing the index of the memory register. */ 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. */ }; /* 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 #if defined(CHAR_UNSIGNED) || defined(__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 = re_syntax_options; re_syntax_options = syntax; return ret; } /* Set by re_set_syntax to the current regexp syntax to recognize. */ long re_syntax_options = 0; /* Macros for re_compile_pattern, which is found below these definitions. */ #define TRANSLATE_P() ((options&RE_OPTION_IGNORECASE) && translate) #define MAY_TRANSLATE() ((bufp->options&(RE_OPTION_IGNORECASE|RE_MAY_IGNORECASE)) && translate) /* Fetch the next character in the uncompiled pattern---translating it if necessary. Also cast from a signed character in the constant string passed to us by the user to an unsigned char that we can use as an array index (in, e.g., `translate'). */ #define PATFETCH(c) \ do {if (p == pend) goto end_of_pattern; \ c = (unsigned char) *p++; \ if (TRANSLATE_P()) c = (unsigned char)translate[c]; \ } while (0) /* Fetch the next character in the uncompiled pattern, with no translation. */ #define PATFETCH_RAW(c) \ do {if (p == pend) goto end_of_pattern; \ c = (unsigned char)*p++; \ } while (0) /* Go backwards one character in the pattern. */ #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_alt_jump) \ fixup_alt_jump = (fixup_alt_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); \ } \ } \ } #define STREQ(s1, s2) ((strcmp (s1, s2) == 0)) #define CHAR_CLASS_MAX_LENGTH 6 /* Namely, `xdigit'. */ #define IS_CHAR_CLASS(string) \ (STREQ (string, "alpha") || STREQ (string, "upper") \ || STREQ (string, "lower") || STREQ (string, "digit") \ || STREQ (string, "alnum") || STREQ (string, "xdigit") \ || STREQ (string, "space") || STREQ (string, "print") \ || STREQ (string, "punct") || STREQ (string, "graph") \ || STREQ (string, "cntrl") || STREQ (string, "blank")) #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 short)((unsigned char)(p)[0] << 8 | (unsigned char)(p)[1])) #define EXTRACT_MBC_AND_INCR(p) \ ((unsigned short)((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 set_list_bits(c1, c2, b) unsigned short c1, c2; unsigned char *b; { unsigned char sbc_size = b[-1]; unsigned short mbc_size = EXTRACT_UNSIGNED(&b[sbc_size]); unsigned short beg, end, upb; if (c1 > c2) return; if ((int)c1 < 1 << BYTEWIDTH) { upb = c2; if (1 << BYTEWIDTH <= (int)upb) upb = (1 << BYTEWIDTH) - 1; /* The last single-byte char */ if (sbc_size <= (unsigned short)(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; } for (; c1 <= upb; c1++) if (!ismbchar(c1)) SET_LIST_BIT(c1); if ((int)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 = (unsigned short)(beg + upb) >> 1; if ((int)c1 - 1 > (int)EXTRACT_MBC(&b[mid*4 + 2])) beg = mid + 1; else upb = mid; } for (end = beg, upb = mbc_size; end < upb; ) { unsigned short mid = (unsigned short)(end + upb) >> 1; if ((int)c2 >= (int)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+2])) c2 = EXTRACT_MBC(&b[(end - 1)*4+2]); } 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 - end + 1; STORE_NUMBER(&b[-2], mbc_size); } static int is_in_list(c, b) unsigned short c; const unsigned char *b; { unsigned short size; unsigned short i, j; int result = 0; size = *b++; if ((int)c < 1<= 1<>BYTEWIDTH; } while (size>0 && b[size*4-2] == 0xff) { size--; if (b[size*4+1] <= i && i <= b[size*4+3]) { result = 2; break; } } } for (i = 0, j = size; i < j; ) { unsigned short k = (unsigned short)(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')) return 1; return result; } static void print_partial_compiled_pattern(start, end) unsigned char *start; unsigned char *end; { int mcnt, mcnt2; unsigned char *p = start; unsigned char *pend = end; if (start == NULL) { printf ("(null)\n"); return; } /* Loop over pattern commands. */ while (p < pend) { switch ((enum regexpcode)*p++) { case unused: printf ("/unused"); break; case exactn: mcnt = *p++; printf ("/exactn/%d", mcnt); do { putchar('/'); printf("%c", *p++); } while (--mcnt); break; case start_memory: mcnt = *p++; printf ("/start_memory/%d/%d", mcnt, *p++); break; case stop_memory: mcnt = *p++; printf ("/stop_memory/%d/%d", mcnt, *p++); break; case stop_paren: printf ("/stop_paren"); break; case casefold_on: printf ("/casefold_on"); break; case casefold_off: printf ("/casefold_off"); break; case start_nowidth: EXTRACT_NUMBER_AND_INCR (mcnt, p); printf ("/start_nowidth//%d", mcnt); break; case stop_nowidth: printf ("/stop_nowidth//"); p += 2; break; case pop_and_fail: printf ("/pop_and_fail"); break; case duplicate: printf ("/duplicate/%d", *p++); break; case anychar: printf ("/anychar"); break; case charset: case charset_not: { register int c; printf ("/charset%s", (enum regexpcode)*(p - 1) == charset_not ? "_not" : ""); mcnt = *p++; printf("/%d", mcnt); for (c = 0; c < mcnt; c++) { unsigned bit; unsigned char map_byte = p[c]; putchar ('/'); for (bit = 0; bit < BYTEWIDTH; bit++) if (map_byte & (1 << bit)) printf("%c", c * BYTEWIDTH + bit); } p += mcnt; mcnt = EXTRACT_UNSIGNED_AND_INCR(p); while (mcnt--) { int beg, end; beg = EXTRACT_MBC_AND_INCR(p); end = EXTRACT_MBC_AND_INCR(p); printf("/%c%c-%c%c", beg>>BYTEWIDTH, beg&0xff, end>>BYTEWIDTH, end&0xff); } break; } case begline: printf ("/begline"); break; case endline: printf ("/endline"); break; case on_failure_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); printf ("/on_failure_jump//%d", mcnt); break; case dummy_failure_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); printf ("/dummy_failure_jump//%d", mcnt); break; case push_dummy_failure: printf ("/push_dummy_failure"); break; case finalize_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); printf ("/finalize_jump//%d", mcnt); break; case maybe_finalize_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); printf ("/maybe_finalize_jump//%d", mcnt); break; case jump_past_alt: EXTRACT_NUMBER_AND_INCR (mcnt, p); printf ("/jump_past_alt//%d", mcnt); break; case jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); printf ("/jump//%d", mcnt); break; case succeed_n: EXTRACT_NUMBER_AND_INCR (mcnt, p); EXTRACT_NUMBER_AND_INCR (mcnt2, p); printf ("/succeed_n//%d//%d", mcnt, mcnt2); break; case jump_n: EXTRACT_NUMBER_AND_INCR (mcnt, p); EXTRACT_NUMBER_AND_INCR (mcnt2, p); printf ("/jump_n//%d//%d", mcnt, mcnt2); break; case set_number_at: EXTRACT_NUMBER_AND_INCR (mcnt, p); EXTRACT_NUMBER_AND_INCR (mcnt2, p); printf ("/set_number_at//%d//%d", mcnt, mcnt2); break; case try_next: EXTRACT_NUMBER_AND_INCR (mcnt, p); printf ("/try_next//%d", mcnt); break; case finalize_push: EXTRACT_NUMBER_AND_INCR (mcnt, p); printf ("/finalize_push//%d", mcnt); break; case finalize_push_n: EXTRACT_NUMBER_AND_INCR (mcnt, p); EXTRACT_NUMBER_AND_INCR (mcnt2, p); printf ("/finalize_push_n//%d//%d", mcnt, mcnt2); break; case wordbound: printf ("/wordbound"); break; case notwordbound: printf ("/notwordbound"); break; case wordbeg: printf ("/wordbeg"); break; case wordend: printf ("/wordend"); case wordchar: printf ("/wordchar"); break; case notwordchar: printf ("/notwordchar"); break; case begbuf: printf ("/begbuf"); break; case endbuf: printf ("/endbuf"); break; case endbuf2: printf ("/endbuf2"); break; default: printf ("?%d", *(p-1)); } } printf ("/\n"); } static void print_compiled_pattern(bufp) struct re_pattern_buffer *bufp; { unsigned char *buffer = (unsigned char*)bufp->buffer; print_partial_compiled_pattern (buffer, buffer + bufp->used); } static char* calculate_must_string(start, end) char *start; char *end; { int mcnt; int max = 0; char *p = start; char *pend = end; char *must = 0; if (start == NULL) return 0; /* Loop over pattern commands. */ while (p < pend) { switch ((enum regexpcode)*p++) { case unused: break; case exactn: mcnt = *p; if (mcnt > max) { must = p; max = mcnt; } p += mcnt+1; break; case start_memory: case stop_memory: p += 2; break; case duplicate: p++; break; case casefold_on: case casefold_off: return 0; /* should not check must_string */ case pop_and_fail: case anychar: case begline: case endline: case wordbound: case notwordbound: case wordbeg: case wordend: case wordchar: case notwordchar: case begbuf: case endbuf: case endbuf2: case push_dummy_failure: case stop_paren: break; case charset: case charset_not: mcnt = *p++; p += mcnt; mcnt = EXTRACT_UNSIGNED_AND_INCR(p); while (mcnt--) { p += 4; } break; case on_failure_jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); if (mcnt > 0) p += mcnt; if ((enum regexpcode)p[-3] == jump) { p -= 3; EXTRACT_NUMBER_AND_INCR (mcnt, p); if (mcnt > 0) p += mcnt; } break; case dummy_failure_jump: case succeed_n: case try_next: case jump: EXTRACT_NUMBER_AND_INCR (mcnt, p); if (mcnt > 0) p += mcnt; break; case start_nowidth: case stop_nowidth: case finalize_jump: case maybe_finalize_jump: case finalize_push: p += 2; break; case jump_n: case set_number_at: case finalize_push_n: p += 4; break; default: break; } } return must; } /* 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; int numlen; /* 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_alt_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; /* In processing a repeat, 1 means non-greedy matches. */ char greedy; /* Address of beginning of regexp, or inside of last (. */ char *begalt = b; /* Place in the uncompiled pattern (i.e., the {) to which to go back if the interval is invalid. */ char *beg_interval; /* 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; /* Stack of information saved by ( and restored by ). Five stack elements are pushed by each (: First, the value of b. Second, the value of fixup_alt_jump. Third, the value of begalt. Fourth, the value of regnum. Fifth, the type of the paren. */ int *stackb = RE_TALLOC(40, int); 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; int range = 0; int had_char_class = 0; int options = bufp->options; bufp->fastmap_accurate = 0; bufp->must = 0; bufp->must_skip = 0; bufp->stclass = 0; /* Initialize the syntax table. */ init_syntax_once(); 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 '$': { p0 = p; /* When testing what follows the $, look past the \-constructs that don't consume anything. */ while (p0 != pend) { if (*p0 == '\\' && p0 + 1 != pend && (p0[1] == 'b' || p0[1] == 'B')) p0 += 2; else 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 (p0 == pend || *p0 == '\n' || *p0 == ')' || *p0 == '|') { BUFPUSH(endline); break; } goto normal_char; } case '^': /* ^ means succeed if at beg of line, but only if no preceding pattern. */ if (laststart) goto invalid_pattern; if (laststart && p - 2 >= pattern && p[-2] != '\n') goto normal_char; BUFPUSH(begline); break; case '+': case '?': case '*': /* If there is no previous pattern, char not special. */ if (!laststart) { goto invalid_pattern; } /* If there is a sequence of repetition chars, collapse it down to just one. */ zero_times_ok = c != '+'; many_times_ok = c != '?'; greedy = 1; if (p != pend) { PATFETCH(c); switch (c) { case '?': greedy = 0; break; case '*': case '+': goto nested_meta; default: PATUNFETCH; break; } } repeat: /* 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,greedy?maybe_finalize_jump:finalize_push,laststart-3); b += 3; /* Because store_jump put stuff here. */ } /* On failure, jump from laststart to next pattern, 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); b += 3; if (zero_times_ok) { if (greedy == 0) { GET_BUFFER_SPACE(3); insert_jump(try_next, laststart, b + 3, b); b += 3; } } else { /* At least one repetition is required, so insert a `dummy_failure_jump' 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(3); 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 ((re_syntax_options & RE_HAT_NOT_NEWLINE) && b[-2] == charset_not) SET_LIST_BIT('\n'); had_char_class = 0; /* Read in characters and ranges, setting map bits. */ for (;;) { int size; unsigned last = (unsigned)-1; 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; } range_retry: PATFETCH(c); if (c == ']') { if (p == p0 + 1) { if (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; } /* Look ahead to see if it's a range when the last thing was a character class. */ if (had_char_class && c == '-' && *p != ']') goto invalid_pattern; if (ismbchar(c)) { PATFETCH(c1); c = c << BYTEWIDTH | c1; } /* \ escapes characters when inside [...]. */ if (c == '\\') { PATFETCH(c); switch (c) { case 'w': for (c = 0; c < (1 << BYTEWIDTH); c++) { if (SYNTAX(c) == Sword || (!current_mbctype && SYNTAX(c) == Sword2)) SET_LIST_BIT(c); } last = -1; continue; case 'W': for (c = 0; c < (1 << BYTEWIDTH); c++) { if (SYNTAX(c) != Sword && (current_mbctype || SYNTAX(c) != Sword2)) SET_LIST_BIT(c); } if (current_mbctype) { set_list_bits(0x8000, 0xffff, (unsigned char*)b); } last = -1; continue; case 's': for (c = 0; c < 256; c++) if (ISSPACE(c)) SET_LIST_BIT(c); last = -1; continue; case 'S': for (c = 0; c < 256; c++) if (!ISSPACE(c)) SET_LIST_BIT(c); if (current_mbctype) { set_list_bits(0x8000, 0xffff, (unsigned char*)b); } last = -1; continue; case 'd': for (c = '0'; c <= '9'; c++) SET_LIST_BIT(c); last = -1; continue; case 'D': for (c = 0; c < 256; c++) if (!ISDIGIT(c)) SET_LIST_BIT(c); if (current_mbctype) { set_list_bits(0x8000, 0xffff, (unsigned char*)b); } last = -1; continue; case 'x': c = scan_hex(p, 2, &numlen); if (current_mbctype && c > 0x7f) c = 0xff00 | c; p += numlen; break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': PATUNFETCH; c = scan_oct(p, 3, &numlen); if (ismbchar(c)) c |= 0xff00; p += numlen; break; default: if (ismbchar(c)) { PATFETCH(c1); c = c << 8 | c1; } break; } } /* Get a range. */ if (range) { if (last > c) goto invalid_pattern; range = 0; if (last < 1 << BYTEWIDTH && c < 1 << BYTEWIDTH) { for (;last<=c;last++) SET_LIST_BIT(last); } else { set_list_bits(last, c, (unsigned char*)b); } } else if (p[0] == '-' && p[1] != ']') { last = c; PATFETCH(c1); range = 1; goto range_retry; } else if ((re_syntax_options & RE_CHAR_CLASSES) && c == '[' && *p == ':') { /* Leave room for the null. */ char str[CHAR_CLASS_MAX_LENGTH + 1]; PATFETCH_RAW (c); c1 = 0; /* If pattern is `[[:'. */ if (p == pend) goto invalid_pattern; for (;;) { PATFETCH (c); if (c == ':' || c == ']' || p == pend || c1 == CHAR_CLASS_MAX_LENGTH) break; str[c1++] = c; } str[c1] = '\0'; /* If isn't a word bracketed by `[:' and:`]': undo the ending character, the letters, and leave the leading `:' and `[' (but set bits for them). */ if (c == ':' && *p == ']') { int ch; char is_alnum = STREQ (str, "alnum"); char is_alpha = STREQ (str, "alpha"); char is_blank = STREQ (str, "blank"); char is_cntrl = STREQ (str, "cntrl"); char is_digit = STREQ (str, "digit"); char is_graph = STREQ (str, "graph"); char is_lower = STREQ (str, "lower"); char is_print = STREQ (str, "print"); char is_punct = STREQ (str, "punct"); char is_space = STREQ (str, "space"); char is_upper = STREQ (str, "upper"); char is_xdigit = STREQ (str, "xdigit"); if (!IS_CHAR_CLASS (str)) goto invalid_pattern; /* Throw away the ] at the end of the character class. */ PATFETCH (c); if (p == pend) goto invalid_pattern; for (ch = 0; ch < 1 << BYTEWIDTH; ch++) { if ( (is_alnum && ISALNUM (ch)) || (is_alpha && ISALPHA (ch)) || (is_blank && ISBLANK (ch)) || (is_cntrl && ISCNTRL (ch)) || (is_digit && ISDIGIT (ch)) || (is_graph && ISGRAPH (ch)) || (is_lower && ISLOWER (ch)) || (is_print && ISPRINT (ch)) || (is_punct && ISPUNCT (ch)) || (is_space && ISSPACE (ch)) || (is_upper && ISUPPER (ch)) || (is_xdigit && ISXDIGIT (ch))) SET_LIST_BIT (ch); } had_char_class = 1; } else { c1++; while (c1--) PATUNFETCH; SET_LIST_BIT(translate?translate['[']:'['); SET_LIST_BIT(translate?translate[':']:':'); had_char_class = 0; last = ':'; } } else if (c < 1 << BYTEWIDTH) SET_LIST_BIT(c); else set_list_bits(c, c, (unsigned char*)b); } /* 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 '(': PATFETCH(c); if (c == '?') { int negative = 0; PATFETCH_RAW(c); switch (c) { case 'x': case 'i': case '-': for (;;) { switch (c) { case '-': negative = 1; break; case ':': case ')': break; case 'x': if (negative) options &= ~RE_OPTION_EXTENDED; else options |= RE_OPTION_EXTENDED; break; case 'i': if (negative) { if (options&RE_OPTION_IGNORECASE) { options &= ~RE_OPTION_IGNORECASE; BUFPUSH(casefold_off); } } else if (!(options&RE_OPTION_IGNORECASE)) { options |= RE_OPTION_IGNORECASE; BUFPUSH(casefold_on); } break; default: FREE_AND_RETURN(stackb, "undefined (?...) inline option"); } if (c == ')') { c = '#'; /* read whole in-line options */ break; } if (c == ':') break; PATFETCH_RAW(c); } break; case '#': for (;;) { PATFETCH(c); if (c == ')') break; } c = '#'; break; case ':': case '=': case '!': break; default: FREE_AND_RETURN(stackb, "undefined (?...) sequence"); } } else { PATUNFETCH; c = '('; } if (c == '#') break; if (stackp+8 >= stacke) { int *stackx; unsigned int len = stacke - stackb; stackx = DOUBLE_STACK(stackx,stackb,len,int); /* Rearrange the pointers. */ stackp = stackx + (stackp - stackb); stackb = stackx; stacke = stackb + 2 * len; } /* Laststart should point to the start_memory that we are about to push (unless the pattern has RE_NREGS or more ('s). */ /* obsolete: now RE_NREGS is just a default register size. */ *stackp++ = b - bufp->buffer; *stackp++ = fixup_alt_jump ? fixup_alt_jump - bufp->buffer + 1 : 0; *stackp++ = begalt - bufp->buffer; switch (c) { case '(': BUFPUSH(start_memory); BUFPUSH(regnum); *stackp++ = regnum++; *stackp++ = b - bufp->buffer; BUFPUSH(0); /* too many ()'s to fit in a byte. (max 254) */ if (regnum >= RE_REG_MAX) goto too_big; break; case '=': case '!': BUFPUSH(start_nowidth); *stackp++ = b - bufp->buffer; BUFPUSH(0); /* temporary value */ BUFPUSH(0); if (c == '=') break; BUFPUSH(on_failure_jump); *stackp++ = b - bufp->buffer; BUFPUSH(0); /* temporary value */ BUFPUSH(0); break; case ':': pending_exact = 0; default: break; } *stackp++ = c; *stackp++ = options; fixup_alt_jump = 0; laststart = 0; begalt = b; break; case ')': if (stackp == stackb) FREE_AND_RETURN(stackb, "unmatched )"); if ((options ^ stackp[-1]) & RE_OPTION_IGNORECASE) { BUFPUSH((options&RE_OPTION_IGNORECASE)?casefold_off:casefold_on); } pending_exact = 0; if (fixup_alt_jump) { /* Push a dummy failure point at the end of the alternative for a possible future `finalize_jump' to pop. See comments at `push_dummy_failure' in `re_match'. */ BUFPUSH(push_dummy_failure); /* We allocated space for this jump when we assigned to `fixup_alt_jump', in the `handle_alt' case below. */ store_jump(fixup_alt_jump, jump, b); } options = *--stackp; switch (c = *--stackp) { case '(': { char *loc = bufp->buffer + *--stackp; *loc = regnum - stackp[-1]; BUFPUSH(stop_memory); BUFPUSH(stackp[-1]); BUFPUSH(regnum - stackp[-1]); stackp--; } break; case '!': BUFPUSH(pop_and_fail); /* back patch */ STORE_NUMBER(bufp->buffer+stackp[-1], b - bufp->buffer - stackp[-1] - 2); stackp--; /* fall through */ case '=': BUFPUSH(stop_nowidth); /* tell stack-pos place to start_nowidth */ STORE_NUMBER(bufp->buffer+stackp[-1], b - bufp->buffer - stackp[-1] - 2); BUFPUSH(0); /* space to hold stack pos */ BUFPUSH(0); stackp--; break; case ':': BUFPUSH(stop_paren); break; default: break; } begalt = *--stackp + bufp->buffer; stackp--; fixup_alt_jump = *stackp ? *stackp + bufp->buffer - 1 : 0; laststart = *--stackp + bufp->buffer; if (c == '!' || c == '=') laststart = b; break; case '|': /* Insert before the previous alternative a jump which jumps to this alternative if the former fails. */ GET_BUFFER_SPACE(3); insert_jump(on_failure_jump, begalt, b + 6, b); pending_exact = 0; b += 3; /* The alternative before this one has a jump after it which gets executed if it gets matched. Adjust that jump so it will jump to this 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. A picture: _____ _____ | | | | | v | v a | b | c If we are at `b', then fixup_alt_jump right now points to a three-byte space after `a'. We'll put in the jump, set fixup_alt_jump to right after `b', and leave behind three bytes which we'll fill in when we get to after `c'. */ if (fixup_alt_jump) store_jump(fixup_alt_jump, jump_past_alt, b); /* Mark and leave space for a jump after this alternative, to be filled in later either by next alternative or when know we're at the end of a series of alternatives. */ fixup_alt_jump = b; GET_BUFFER_SPACE(3); b += 3; laststart = 0; begalt = b; break; case '{': /* If there is no previous pattern, this isn't an interval. */ if (!laststart || p == pend) { goto normal_backsl; } beg_interval = p - 1; lower_bound = -1; /* So can see if are set. */ upper_bound = -1; GET_UNSIGNED_NUMBER(lower_bound); if (c == ',') { GET_UNSIGNED_NUMBER(upper_bound); } else /* Interval such as `{1}' => match exactly once. */ upper_bound = lower_bound; if (lower_bound < 0 || c != '}') goto unfetch_interval; if (lower_bound >= RE_DUP_MAX || upper_bound >= RE_DUP_MAX) FREE_AND_RETURN(stackb, "too big quantifier in {,}"); if (upper_bound < 0) upper_bound = RE_DUP_MAX; if (lower_bound > upper_bound) FREE_AND_RETURN(stackb, "can't do {n,m} with n > m"); beg_interval = 0; pending_exact = 0; greedy = 1; if (p != pend) { PATFETCH(c); if (c == '?') greedy = 0; else PATUNFETCH; } if (lower_bound == 0) { zero_times_ok = 1; if (upper_bound == RE_DUP_MAX) { many_times_ok = 1; goto repeat; } if (upper_bound == 1) { many_times_ok = 0; goto repeat; } } if (lower_bound == 1) { if (upper_bound == 1) { /* No need to repeat */ break; } if (upper_bound == RE_DUP_MAX) { many_times_ok = 1; zero_times_ok = 0; goto repeat; } } /* 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; break; } /* Otherwise, we have a nontrivial interval. When we're all done, the pattern will look like: set_number_at set_number_at succeed_n jump_n (The upper bound and `jump_n' are omitted if `upper_bound' is 1, though.) */ { /* If the upper bound is > 1, we need to insert more at the end of the loop. */ unsigned nbytes = upper_bound == 1 ? 10 : 20; GET_BUFFER_SPACE(nbytes); /* Initialize lower bound of the `succeed_n', even though it will be set during matching by its attendant `set_number_at' (inserted next), because `re_compile_fastmap' needs to know. Jump to the `jump_n' we might insert below. */ insert_jump_n(succeed_n, laststart, b + (nbytes/2), b, lower_bound); b += 5; /* Just increment for the succeed_n here. */ /* Code to initialize the lower bound. Insert before the `succeed_n'. The `5' is the last two bytes of this `set_number_at', plus 3 bytes of the following `succeed_n'. */ insert_op_2(set_number_at, laststart, b, 5, lower_bound); b += 5; if (upper_bound > 1) { /* More than one repetition is allowed, so append a backward jump to the `succeed_n' that starts this interval. When we've reached this during matching, we'll have matched the interval once, so jump back only `upper_bound - 1' times. */ GET_BUFFER_SPACE(5); store_jump_n(b, greedy?jump_n:finalize_push_n, laststart + 5, upper_bound - 1); b += 5; /* The location we want to set is the second parameter of the `jump_n'; that is `b-2' as an absolute address. `laststart' will be the `set_number_at' we're about to insert; `laststart+3' the number to set, the source for the relative address. But we are inserting into the middle of the pattern -- so everything is getting moved up by 5. Conclusion: (b - 2) - (laststart + 3) + 5, i.e., b - laststart. We insert this at the beginning of the loop so that if we fail during matching, we'll reinitialize the bounds. */ insert_op_2(set_number_at, laststart, b, b - laststart, upper_bound - 1); b += 5; } } break; unfetch_interval: /* If an invalid interval, match the characters as literals. */ p = beg_interval; beg_interval = 0; /* normal_char and normal_backslash need `c'. */ PATFETCH (c); goto normal_char; case '\\': if (p == pend) goto invalid_pattern; /* Do not translate the character after the \, so that we can distinguish, e.g., \B from \b, even if we normally would translate, e.g., B to b. */ PATFETCH_RAW(c); switch (c) { 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; case 'w': laststart = b; BUFPUSH(wordchar); break; case 'W': laststart = b; BUFPUSH(notwordchar); break; case '<': BUFPUSH(wordbeg); break; case '>': BUFPUSH(wordend); break; case 'b': BUFPUSH(wordbound); break; case 'B': BUFPUSH(notwordbound); break; case 'A': BUFPUSH(begbuf); break; case 'Z': BUFPUSH(endbuf2); break; case 'z': BUFPUSH(endbuf); break; /* hex */ case 'x': c1 = 0; c = scan_hex(p, 2, &numlen); p += numlen; if (c > 0x7f) c1 = 0xff; goto numeric_char; /* octal */ case '0': c1 = 0; c = scan_oct(p, 3, &numlen); p += numlen; if (c > 0x7f) c1 = 0xff; goto numeric_char; /* back-ref or octal */ case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': { char *p_save; PATUNFETCH; p_save = p; c1 = 0; GET_UNSIGNED_NUMBER(c1); if (!ISDIGIT(c)) PATUNFETCH; if (c1 >= regnum) { /* need to get octal */ p = p_save; c = scan_oct(p_save, 3, &numlen) & 0xff; p = p_save + numlen; c1 = 0; if (c > 0x7f) c1 = 0xff; goto numeric_char; } } /* Can't back reference to a subexpression if inside of it. */ for (stackt = stackp - 2; stackt > stackb; stackt -= 5) if (*stackt == c1) goto normal_char; laststart = b; BUFPUSH(duplicate); BUFPUSH(c1); break; default: normal_backsl: goto normal_char; } break; case '#': if (options & RE_OPTION_EXTENDED) { while (p != pend) { PATFETCH(c); if (c == '\n') break; } break; } goto normal_char; case ' ': case '\t': case '\f': case '\r': case '\n': if (options & RE_OPTION_EXTENDED) break; default: normal_char: /* Expects the character in `c'. */ c1 = 0; if (ismbchar(c)) { c1 = c; PATFETCH_RAW(c); } else if (c > 0x7f) { c1 = 0xff; } numeric_char: if (!pending_exact || pending_exact + *pending_exact + 1 != b || *pending_exact >= (c1 ? 0176 : 0177) || *p == '+' || *p == '?' || *p == '*' || *p == '^' || *p == '{') { laststart = b; BUFPUSH(exactn); pending_exact = b; BUFPUSH(0); } if (c1) { BUFPUSH(c1); (*pending_exact)++; } BUFPUSH(c); (*pending_exact)++; } } if (fixup_alt_jump) store_jump(fixup_alt_jump, jump, b); if (stackp != stackb) FREE_AND_RETURN(stackb, "unmatched ("); /* set optimize flags */ laststart = bufp->buffer; if (laststart != b) { if (*laststart == start_memory) laststart += 3; if (*laststart == dummy_failure_jump) laststart += 3; else if (*laststart == try_next) laststart += 3; if (*laststart == on_failure_jump) { int mcnt; laststart++; EXTRACT_NUMBER_AND_INCR(mcnt, laststart); if (mcnt == 4 && *laststart == anychar) { switch ((enum regexpcode)laststart[4]) { case jump_n: case finalize_jump: case maybe_finalize_jump: case jump: case jump_past_alt: case dummy_failure_jump: bufp->options |= RE_OPTIMIZE_ANCHOR; break; } } else if (*laststart == charset || *laststart == charset_not) { p0 = laststart; mcnt = *++p0 ; p0 += mcnt+1; mcnt = EXTRACT_UNSIGNED_AND_INCR(p0); p0 += 4*mcnt; if (*p0 == maybe_finalize_jump) { bufp->stclass = laststart; } } } } bufp->used = b - bufp->buffer; bufp->re_nsub = regnum; laststart = bufp->buffer; if (laststart != b) { if (*laststart == start_memory) laststart += 3; if (*laststart == exactn) { bufp->options |= RE_OPTIMIZE_EXACTN; bufp->must = laststart+1; } } else { bufp->must = calculate_must_string(bufp->buffer, b); } if (current_mbctype == MBCTYPE_SJIS) bufp->options |= RE_OPTIMIZE_NO_BM; else if (bufp->must) { int i; int len = (unsigned char)bufp->must[0]; for (i=1; imust[i] == 0xff || (current_mbctype == MBCTYPE_EUC && ismbchar(bufp->must[i]))) { bufp->options |= RE_OPTIMIZE_NO_BM; break; } } if (!(bufp->options & RE_OPTIMIZE_NO_BM)) { bufp->must_skip = (int *) xmalloc((1 << BYTEWIDTH)*sizeof(int)); bm_init_skip(bufp->must_skip, bufp->must+1, (unsigned char)bufp->must[0], MAY_TRANSLATE()?translate:0); } } FREE_AND_RETURN(stackb, 0); invalid_pattern: FREE_AND_RETURN(stackb, "invalid regular expression"); end_of_pattern: FREE_AND_RETURN(stackb, "premature end of regular expression"); too_big: FREE_AND_RETURN(stackb, "regular expression too big"); memory_exhausted: FREE_AND_RETURN(stackb, "memory exhausted"); nested_meta: FREE_AND_RETURN(stackb, "nested *?+ in regexp"); } void re_free_pattern(bufp) struct re_pattern_buffer *bufp; { free(bufp->buffer); free(bufp->fastmap); if (bufp->must_skip) free(bufp->must_skip); free(bufp); } /* 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. 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(op, there, current_end) int op; char *there, *current_end; { register char *pfrom = current_end; /* Copy from here... */ register char *pto = current_end + 1; /* ...to here. */ while (pfrom != there) *--pto = *--pfrom; there[0] = (char)op; } /* 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); } #define trans_eq(c1, c2, translate) (translate?(translate[c1]==translate[c2]):((c1)==(c2))) static int slow_match(little, lend, big, bend, translate) unsigned char *little, *lend; unsigned char *big, *bend; unsigned char *translate; { int c; while (little < lend && big < bend) { c = *little++; if (c == 0xff) c = *little++; if (!trans_eq(*big++, c, translate)) break; } if (little == lend) return 1; return 0; } static int slow_search(little, llen, big, blen, translate) unsigned char *little; int llen; unsigned char *big; int blen; char *translate; { unsigned char *bsave = big; unsigned char *bend = big + blen; register int c; int fescape = 0; c = *little; if (c == 0xff) { c = little[1]; fescape = 1; } else if (translate && !ismbchar(c)) { c = translate[c]; } while (big < bend) { /* look for first character */ if (fescape) { while (big < bend) { if (*big == c) break; big++; } } else if (translate && !ismbchar(c)) { while (big < bend) { if (ismbchar(*big)) big++; else if (translate[*big] == c) break; big++; } } else { while (big < bend) { if (*big == c) break; if (ismbchar(*big)) big++; big++; } } if (slow_match(little, little+llen, big, bend, translate)) return big - bsave; if (ismbchar(*big)) big++; big++; } return -1; } static void bm_init_skip(skip, pat, m, translate) int *skip; unsigned char *pat; int m; char *translate; { int j, c; for (c=0; c<256; c++) { skip[c] = m; } if (translate) { for (j=0; j= 0 && translate[big[k]] == translate[little[j]]) { k--; j--; } if (j < 0) return k+1; i += skip[translate[big[i]]]; } return -1; } while (i < blen) { k = i; j = llen-1; while (j >= 0 && big[k] == little[j]) { k--; j--; } if (j < 0) return k+1; i += skip[big[i]]; } return -1; } /* 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 is_a_succeed_n; unsigned char **stackb = RE_TALLOC(NFAILURES, unsigned char*); unsigned char **stackp = stackb; unsigned char **stacke = stackb + NFAILURES; int options = bufp->options; 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 (p[1] == 0xff) { if (TRANSLATE_P()) fastmap[translate[p[2]]] = 2; else fastmap[p[2]] = 2; } else if (TRANSLATE_P()) fastmap[translate[p[1]]] = 1; else fastmap[p[1]] = 1; break; case begline: case begbuf: case endbuf: case endbuf2: case wordbound: case notwordbound: case wordbeg: case wordend: case pop_and_fail: case push_dummy_failure: case stop_paren: continue; case casefold_on: bufp->options |= RE_MAY_IGNORECASE; case casefold_off: options ^= RE_OPTION_IGNORECASE; continue; case endline: if (TRANSLATE_P()) fastmap[translate['\n']] = 1; else fastmap['\n'] = 1; if (bufp->can_be_null == 0) bufp->can_be_null = 2; break; case jump_n: case finalize_jump: case maybe_finalize_jump: case jump: case jump_past_alt: 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 != try_next && (enum regexpcode)*p != succeed_n && (enum regexpcode)*p != finalize_push && (enum regexpcode)*p != finalize_push_n) continue; p++; EXTRACT_NUMBER_AND_INCR(j, p); p += j; if (stackp != stackb && *stackp == p) stackp--; /* pop */ continue; case start_nowidth: case stop_nowidth: case finalize_push: p += 2; continue; case finalize_push_n: p += 4; continue; case try_next: case on_failure_jump: handle_on_failure_jump: EXTRACT_NUMBER_AND_INCR(j, p); if (p + j < pend) { if (stackp == stacke) { unsigned char **stackx; unsigned int len = stacke - stackb; EXPAND_FAIL_STACK(stackx, stackb, len); } *++stackp = p + j; /* push */ } else { bufp->can_be_null = 1; } 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. */ EXTRACT_NUMBER(k, p + 2); /* Increment p past the n for when k != 0. */ if (k == 0) { p += 4; } else { goto handle_on_failure_jump; } continue; case set_number_at: p += 4; continue; case start_memory: case stop_memory: p += 2; 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 < 0x80; j++) { if (SYNTAX(j) == Sword) fastmap[j] = 1; } switch (current_mbctype) { case MBCTYPE_ASCII: for (j = 0x80; j < (1 << BYTEWIDTH); j++) { if (SYNTAX(j) == Sword2) fastmap[j] = 1; } break; case MBCTYPE_EUC: case MBCTYPE_SJIS: for (j = 0x80; j < (1 << BYTEWIDTH); j++) { if (mbctab[j]) fastmap[j] = 1; } break; } break; case notwordchar: for (j = 0; j < 0x80; j++) if (SYNTAX(j) != Sword) fastmap[j] = 1; switch (current_mbctype) { case MBCTYPE_ASCII: for (j = 0x80; j < (1 << BYTEWIDTH); j++) { if (SYNTAX(j) != Sword2) fastmap[j] = 1; } break; case MBCTYPE_EUC: case MBCTYPE_SJIS: for (j = 0x80; j < (1 << BYTEWIDTH); j++) { if (!mbctab[j]) fastmap[j] = 1; } break; } break; 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 (TRANSLATE_P()) fastmap[translate[j]] = 1; else fastmap[j] = 1; } { unsigned short size; unsigned c, end; p += p[-1] + 2; size = EXTRACT_UNSIGNED(&p[-2]); for (j = 0; j < (int)size; j++) { if ((unsigned char)p[j*4] == 0xff) { for (c = (unsigned char)p[j*4+1], end = (unsigned char)p[j*4+3]; c <= end; c++) { fastmap[c] = 2; } } else { /* 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; int byte_match = 0; p += p[-1] + 2; size = EXTRACT_UNSIGNED(&p[-2]); if (size == 0) { for (j = 0x80; j < (1 << BYTEWIDTH); j++) if (ismbchar(j)) fastmap[j] = 1; } for (j = 0,c = 0x80;j < (int)size; j++) { if ((unsigned char)p[j*4] == 0xff) { byte_match = 1; for (beg = (unsigned char)p[j*4+1]; c < beg; c++) fastmap[c] = 1; c = (unsigned char)p[j*4+3] + 1; } else { 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; } } if (byte_match) { for (j = c; j < (1 << BYTEWIDTH); j++) fastmap[j] = 1; for (j = 0; j < (1 << BYTEWIDTH); j++) if (fastmap[j]) fastmap[j] = 2; } else { for (j = c; j < (1 << BYTEWIDTH); j++) if (ismbchar(j)) fastmap[j] = 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--; /* pop */ else break; } FREE_AND_RETURN_VOID(stackb); } /* Using the compiled pattern in BUFP->buffer, first tries to match STRING, 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. STRING is of SIZE. In REGS, return the indices of STRING that matched the entire BUFP->buffer and its contained subexpressions. 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(bufp, string, size, startpos, range, regs) struct re_pattern_buffer *bufp; char *string; int size, startpos, range; struct re_registers *regs; { register char *fastmap = bufp->fastmap; int val, anchor = 0; /* Check for out-of-range starting position. */ if (startpos < 0 || startpos > size) return -1; /* Update the fastmap now if not correct already. */ if (fastmap && !bufp->fastmap_accurate) { re_compile_fastmap(bufp); } /* If the search isn't to be a backwards one, don't waste time in a search for a pattern that must be anchored. */ if (bufp->used>0) { switch ((enum regexpcode)bufp->buffer[0]) { case begbuf: if (range > 0) { if (startpos > 0) return -1; else if (re_match(bufp, string, size, 0, regs) >= 0) return 0; return -1; } break; case begline: anchor = 1; break; default: break; } } if (bufp->options & RE_OPTIMIZE_ANCHOR) { anchor = 1; } if (bufp->must) { int len = ((unsigned char*)bufp->must)[0]; int pos, pbeg, pend; pbeg = startpos; pend = startpos + range; if (pbeg > pend) { /* swap pbeg,pend */ pos = pend; pend = pbeg; pbeg = pos; } if (pend > size) pend = size; if (bufp->options & RE_OPTIMIZE_NO_BM) { pos = slow_search(bufp->must+1, len, string+pbeg, pend-pbeg, MAY_TRANSLATE()?translate:0); } else { pos = bm_search(bufp->must+1, len, string+pbeg, pend-pbeg, bufp->must_skip, MAY_TRANSLATE()?translate:0); } if (pos == -1) return -1; if (range > 0 && (bufp->options & RE_OPTIMIZE_EXACTN)) { startpos += pos; range -= pos; } } for (;;) { /* 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 < size && bufp->can_be_null != 1 && !(anchor && startpos == 0)) { if (range > 0) /* Searching forwards. */ { register unsigned char *p, c; int irange = range; p = (unsigned char*)string+startpos; while (range > 0) { c = *p++; if (ismbchar(c)) { if (fastmap[c]) break; c = *p++; range--; if (fastmap[c] == 2) break; } else if (fastmap[MAY_TRANSLATE() ? translate[c] : c]) break; range--; } startpos += irange - range; } else /* Searching backwards. */ { register unsigned char c; c = string[startpos]; c &= 0xff; if (MAY_TRANSLATE() ? !fastmap[translate[c]] : !fastmap[c]) goto advance; } } if (startpos > size) return -1; if (anchor && size > 0 && startpos == size) return -1; if (fastmap && startpos == size && range >= 0 && (bufp->can_be_null == 0 || (bufp->can_be_null && size > 0 && string[startpos-1] == '\n'))) return -1; val = re_match(bufp, string, size, startpos, regs); if (val >= 0) return startpos; if (val == -2) return -2; #ifndef NO_ALLOCA #ifdef C_ALLOCA alloca(0); #endif /* C_ALLOCA */ #endif /* NO_ALLOCA */ if (range > 0) { if (anchor && startpos < size && startpos > 0 && string[startpos-1] != '\n') { while (range > 0 && string[startpos] != '\n') { range--; startpos++; } } else if (fastmap && (bufp->stclass)) { register unsigned char *p; register unsigned short c; int irange = range; p = (unsigned char*)string+startpos; while (range > 0) { c = *p++; if (ismbchar(c) && fastmap[c] != 2) { c = c << 8 | *p++; } else if (MAY_TRANSLATE()) c = translate[c]; if (*bufp->stclass == charset) { if (!is_in_list(c, bufp->stclass+1)) break; } else { if (is_in_list(c, bufp->stclass+1)) break; } range--; if (c > 256) range--; } startpos += irange - range; } } advance: if (!range) break; else if (range > 0) { const char *d = string + startpos; if (ismbchar(*d)) { range--, startpos++; if (!range) break; } range--, startpos++; } else { range++, startpos--; { const char *s, *d, *p; s = string; d = string + startpos; 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; } /* The following are used for re_match, 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. */ /* static int memcmp_translate(); *//* already declared */ /* Structure and accessing macros used in re_match: */ typedef union { unsigned char *word; struct { /* This field is one if this group can match the empty string, zero if not. If not yet determined, `MATCH_NULL_UNSET_VALUE'. */ #define MATCH_NULL_UNSET_VALUE 3 unsigned match_null_string_p : 2; unsigned is_active : 1; unsigned matched_something : 1; unsigned ever_matched_something : 1; } bits; } register_info_type; #define REG_MATCH_NULL_STRING_P(R) ((R).bits.match_null_string_p) #define IS_ACTIVE(R) ((R).bits.is_active) #define MATCHED_SOMETHING(R) ((R).bits.matched_something) #define EVER_MATCHED_SOMETHING(R) ((R).bits.ever_matched_something) /* Macros used by re_match: */ /* I.e., regstart, regend, and reg_info. */ #define NUM_REG_ITEMS 3 /* Individual items aside from the registers. */ #define NUM_NONREG_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 (num_regs * NUM_REG_ITEMS + NUM_NONREG_ITEMS) /* We push this many things on the stack whenever we fail. */ #define NUM_FAILURE_ITEMS (last_used_reg * NUM_REG_ITEMS + NUM_REG_ITEMS) /* 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) \ do { \ 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 = num_regs - 1; last_used_reg > 0; last_used_reg--)\ if (!REG_UNSET(regstart[last_used_reg])) \ 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_VARIABLES(); \ FREE_AND_RETURN(stackb,(-2)); \ }*/ \ \ /* Roughly double the size of the stack. */ \ EXPAND_FAIL_STACK(stackx, stackb, 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++ = reg_info[this_reg].word; \ } \ \ /* Push how many registers we saved. */ \ *stackp++ = (unsigned char*)last_used_reg; \ \ *stackp++ = pattern_place; \ *stackp++ = string_place; \ *stackp++ = (unsigned char*)0; /* non-greedy flag */ \ } while(0) /* This pops what PUSH_FAILURE_POINT pushes. */ #define POP_FAILURE_POINT() \ do { \ int temp; \ stackp -= NUM_NONREG_ITEMS; /* Remove failure points (and flag). */ \ temp = (int)*--stackp; /* How many regs pushed. */ \ temp *= NUM_REG_ITEMS; /* How much to take off the stack. */ \ stackp -= temp; /* Remove the register info. */ \ } while(0) /* Registers are set to a sentinel when they haven't yet matched. */ #define REG_UNSET_VALUE ((unsigned char*)-1) #define REG_UNSET(e) ((e) == REG_UNSET_VALUE) #define PREFETCH if (d == dend) goto fail /* 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 \ do { unsigned this_reg; \ for (this_reg = 0; this_reg < num_regs; this_reg++) \ { \ if (IS_ACTIVE(reg_info[this_reg])) \ MATCHED_SOMETHING(reg_info[this_reg]) \ = EVER_MATCHED_SOMETHING (reg_info[this_reg]) \ = 1; \ else \ MATCHED_SOMETHING(reg_info[this_reg]) = 0; \ } \ } while(0) #define AT_STRINGS_BEG(d) (d == string) #define AT_STRINGS_END(d) (d == dend) /* 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)) == Sword || \ (current_mbctype ? \ mbctab[*(d)] == 1 : \ SYNTAX(*(d)) == Sword2)) static void init_regs(regs, num_regs) struct re_registers *regs; unsigned int num_regs; { int i; regs->num_regs = num_regs; if (num_regs < RE_NREGS) num_regs = RE_NREGS; if (regs->allocated == 0) { regs->beg = TMALLOC(num_regs, int); regs->end = TMALLOC(num_regs, int); regs->allocated = num_regs; } else if (regs->allocated < num_regs) { TREALLOC(regs->beg, num_regs, int); TREALLOC(regs->end, num_regs, int); } for (i=0; ibeg[i] = regs->end[i] = -1; } } /* Match the pattern described by BUFP against STRING, which is of SIZE. Start the match at index POS in STRING. In REGS, return the indices of STRING that matched the entire BUFP->buffer and its contained subexpressions. If bufp->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(bufp, string_arg, size, pos, regs) struct re_pattern_buffer *bufp; char *string_arg; int size, pos; struct re_registers *regs; { register unsigned char *p = (unsigned char*)bufp->buffer; unsigned char *p1; /* Pointer to beyond end of buffer. */ register unsigned char *pend = p + bufp->used; unsigned num_regs = bufp->re_nsub; unsigned char *string = (unsigned char*)string_arg; register unsigned char *d, *dend; register int mcnt; /* Multipurpose. */ int options = bufp->options; /* 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. */ 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_TALLOC(num_regs, unsigned char*); unsigned char **regend = RE_TALLOC(num_regs, unsigned char*); /* If a group that's operated upon by a repetition operator fails to match anything, then the register for its start will need to be restored because it will have been set to wherever in the string we are when we last see its open-group operator. Similarly for a register's end. */ unsigned char **old_regstart = RE_TALLOC(num_regs, unsigned char*); unsigned char **old_regend = RE_TALLOC(num_regs, unsigned char*); /* 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. */ register_info_type *reg_info = RE_TALLOC(num_regs, register_info_type); /* 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_TALLOC(num_regs, unsigned char*); unsigned char **best_regend = RE_TALLOC(num_regs, unsigned char*); if (regs) { init_regs(regs, num_regs); } /* Initialize the stack. */ stackb = RE_TALLOC(MAX_NUM_FAILURE_ITEMS * NFAILURES, unsigned char*); stackp = stackb; stacke = &stackb[MAX_NUM_FAILURE_ITEMS * NFAILURES]; #ifdef DEBUG_REGEX fprintf (stderr, "Entering re_match(%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 < num_regs; mcnt++) { regstart[mcnt] = regend[mcnt] = old_regstart[mcnt] = old_regend[mcnt] = best_regstart[mcnt] = best_regend[mcnt] = REG_UNSET_VALUE; #ifdef __CHECKER__ reg_info[mcnt].word = 0; #endif REG_MATCH_NULL_STRING_P (reg_info[mcnt]) = MATCH_NULL_UNSET_VALUE; IS_ACTIVE (reg_info[mcnt]) = 0; MATCHED_SOMETHING (reg_info[mcnt]) = 0; EVER_MATCHED_SOMETHING (reg_info[mcnt]) = 0; } /* Set up pointers to ends of strings. Don't allow the second string to be empty unless both are empty. */ /* `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. */ d = string + pos, dend = string + size; /* 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. */ for (;;) { #ifdef DEBUG_REGEX fprintf(stderr, "regex loop(%d): matching 0x%02d\n", p - (unsigned char*)bufp->buffer, *p); #endif /* End of pattern means we might have succeeded. */ if (p == pend) { /* If not end of string, try backtracking. Otherwise done. */ if (d != dend) { while (stackp != stackb && (int)stackp[-1] == 1) POP_FAILURE_POINT(); if (stackp != stackb) { /* More failure points to try. */ /* If exceeds best match so far, save it. */ if (! best_regs_set || (d > best_regend[0])) { best_regs_set = 1; best_regend[0] = d; /* Never use regstart[0]. */ for (mcnt = 1; mcnt < num_regs; 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 < num_regs; 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->beg[0] = pos; regs->end[0] = d - string; for (mcnt = 1; mcnt < num_regs; mcnt++) { if (REG_UNSET(regend[mcnt])) { regs->beg[mcnt] = -1; regs->end[mcnt] = -1; continue; } regs->beg[mcnt] = regstart[mcnt] - string; regs->end[mcnt] = regend[mcnt] - string; } } FREE_VARIABLES(); FREE_AND_RETURN(stackb, (d - pos - string)); } /* 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: /* Find out if this group can match the empty string. */ p1 = p; /* To send to group_match_null_string_p. */ if (REG_MATCH_NULL_STRING_P (reg_info[*p]) == MATCH_NULL_UNSET_VALUE) REG_MATCH_NULL_STRING_P (reg_info[*p]) = group_match_null_string_p (&p1, pend, reg_info); /* Save the position in the string where we were the last time we were at this open-group operator in case the group is operated upon by a repetition operator, e.g., with `(a*)*b' against `ab'; then we want to ignore where we are now in the string in case this attempt to match fails. */ old_regstart[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p]) ? REG_UNSET (regstart[*p]) ? d : regstart[*p] : regstart[*p]; regstart[*p] = d; IS_ACTIVE(reg_info[*p]) = 1; MATCHED_SOMETHING(reg_info[*p]) = 0; p += 2; continue; case stop_memory: /* We need to save the string position the last time we were at this close-group operator in case the group is operated upon by a repetition operator, e.g., with `((a*)*(b*)*)*' against `aba'; then we want to ignore where we are now in the string in case this attempt to match fails. */ old_regend[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p]) ? REG_UNSET (regend[*p]) ? d : regend[*p] : regend[*p]; 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 ((p + 1) != pend && (! MATCHED_SOMETHING(reg_info[*p]) || (enum regexpcode)p[-3] == start_memory)) { p1 = p + 2; mcnt = 0; switch (*p1++) { case jump_n: case finalize_push_n: case finalize_jump: case maybe_finalize_jump: case jump: case dummy_failure_jump: EXTRACT_NUMBER_AND_INCR(mcnt, p1); break; } p1 += 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)*p1 == on_failure_jump && (enum regexpcode)p1[3] == start_memory && p1[4] == *p) { /* If this group ever matched anything, then restore what its registers were before trying this last failed match, e.g., with `(a*)*b' against `ab' for regstart[1], and, e.g., with `((a*)*(b*)*)*' against `aba' for regend[3]. Also restore the registers for inner groups for, e.g., `((a*)(b*))*' against `aba' (register 3 would otherwise get trashed). */ if (EVER_MATCHED_SOMETHING (reg_info[*p])) { unsigned r; EVER_MATCHED_SOMETHING (reg_info[*p]) = 0; /* Restore this and inner groups' (if any) registers. */ for (r = *p; r < *p + *(p + 1); r++) { regstart[r] = old_regstart[r]; /* xx why this test? */ if ((int)old_regend[r] >= (int)regstart[r]) regend[r] = old_regend[r]; } } p1++; EXTRACT_NUMBER_AND_INCR(mcnt, p1); PUSH_FAILURE_POINT(p1 + mcnt, d); goto fail; } } p += 2; continue; case stop_paren: 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; if (IS_ACTIVE(reg_info[regno])) break; /* Where in input to try to start matching. */ d2 = regstart[regno]; if (REG_UNSET(d2)) break; /* 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 = regend[regno]; if (REG_UNSET(dend2)) break; for (;;) { /* 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 ((options & RE_OPTION_IGNORECASE) ? memcmp_translate(d, d2, mcnt) : memcmp((char*)d, (char*)d2, mcnt)) goto fail; d += mcnt, d2 += mcnt; } } break; case start_nowidth: PUSH_FAILURE_POINT(0, d); EXTRACT_NUMBER_AND_INCR(mcnt, p); STORE_NUMBER(p+mcnt, stackp - stackb); continue; case stop_nowidth: EXTRACT_NUMBER_AND_INCR(mcnt, p); stackp = stackb + mcnt; d = stackp[-2]; POP_FAILURE_POINT(); continue; case pop_and_fail: EXTRACT_NUMBER(mcnt, p+1); stackp = stackb + mcnt; POP_FAILURE_POINT(); goto fail; case anychar: PREFETCH; /* 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_P()) ? translate[*d] : *d) == '\n') goto fail; SET_REGS_MATCHED; d++; break; case charset: case charset_not: { int not; /* Nonzero for charset_not. */ int half; /* 2 if need to match latter half of mbc */ int c; PREFETCH; c = (unsigned char)*d; if (ismbchar(c)) { if (d + 1 != dend) { c <<= 8; c |= (unsigned char)d[1]; } } else if (TRANSLATE_P()) c = (unsigned char)translate[c]; half = not = is_in_list(c, p); if (*(p - 1) == (unsigned char)charset_not) { not = !not; } p += 1 + *p + 2 + EXTRACT_UNSIGNED(&p[1 + *p])*4; if (!not) goto fail; SET_REGS_MATCHED; d++; if (half != 2 && d != dend && c >= 1 << BYTEWIDTH) d++; break; } case begline: if (size == 0 || AT_STRINGS_BEG(d) || (d && d[-1] == '\n')) break; else goto fail; case endline: if (AT_STRINGS_END(d) || *d == '\n') break; goto fail; /* Match at the very beginning of the string. */ case begbuf: if (AT_STRINGS_BEG(d)) break; goto fail; /* Match at the very end of the data. */ case endbuf: if (AT_STRINGS_END(d)) break; goto fail; /* Match at the very end of the data. */ case endbuf2: if (AT_STRINGS_END(d)) break; /* .. or newline just before the end of the data. */ if (*d == '\n' && AT_STRINGS_END(d+1)) 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); continue; /* 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 the beginning of the repeat with what in the pattern follows its end. If we can establish that there is nothing that they would both match, i.e., that we would have to backtrack because of (as in, e.g., `a*a') then we can change to pop_failure_jump, because we'll never have to backtrack. This is not true in the case of alternatives: in `(a|ab)*' we do need to backtrack to the `ab' alternative (e.g., if the string was `ab'). But instead of trying to detect that here, the alternative has put on a dummy failure point which is what we will end up popping. */ /* Skip over open/close-group commands. */ while (p2 + 2 < pend) { if ((enum regexpcode)*p2 == stop_memory || (enum regexpcode)*p2 == start_memory) p2 += 3; /* Skip over args, too. */ else if ((enum regexpcode)*p2 == stop_paren) p2 += 1; else break; } 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) { int 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. */ not = is_in_list(c, p1 + 4); if (p1[3] == (unsigned char)charset_not) not = !not; if (!not) 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: if (stackp[-2] == d) { p = stackp[-3]; POP_FAILURE_POINT(); continue; } POP_FAILURE_POINT(); /* Note fall through. */ /* Jump without taking off any failure points. */ case jump: nofinalize: EXTRACT_NUMBER_AND_INCR(mcnt, p); p += mcnt; continue; /* We need this opcode so we can detect where alternatives end in `group_match_null_string_p' et al. */ case jump_past_alt: goto nofinalize; 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; /* At the end of an alternative, we need to push a dummy failure point in case we are followed by a `finalize_jump', because we don't want the failure point for the alternative to be popped. For example, matching `(a|ab)*' against `aab' requires that we match the `ab' alternative. */ case push_dummy_failure: /* See comments just above at `dummy_failure_jump' about the two zeroes. */ PUSH_FAILURE_POINT(0, 0); break; /* 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 > 0) { mcnt--; p += 2; STORE_NUMBER_AND_INCR(p, mcnt); PUSH_FAILURE_POINT(0, 0); } else if (mcnt == 0) { p[2] = unused; p[3] = unused; goto on_failure; } continue; 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; continue; case set_number_at: EXTRACT_NUMBER_AND_INCR(mcnt, p); p1 = p + mcnt; EXTRACT_NUMBER_AND_INCR(mcnt, p); STORE_NUMBER(p1, mcnt); continue; case try_next: EXTRACT_NUMBER_AND_INCR(mcnt, p); if (p + mcnt < pend) { PUSH_FAILURE_POINT(p, d); stackp[-1] = (unsigned char*)1; } p += mcnt; continue; case finalize_push: POP_FAILURE_POINT(); EXTRACT_NUMBER_AND_INCR(mcnt, p); PUSH_FAILURE_POINT(p + mcnt, d); stackp[-1] = (unsigned char*)1; continue; case finalize_push_n: EXTRACT_NUMBER(mcnt, p + 2); /* Originally, this is how many times we CAN jump. */ if (mcnt) { int pos, i; mcnt--; STORE_NUMBER(p + 2, mcnt); EXTRACT_NUMBER(pos, p); EXTRACT_NUMBER(i, p+pos+5); if (i > 0) goto nofinalize; POP_FAILURE_POINT(); EXTRACT_NUMBER_AND_INCR(mcnt, p); PUSH_FAILURE_POINT(p + mcnt, d); stackp[-1] = (unsigned char*)1; p += 2; /* skip n */ } /* If don't have to push any more, skip over the rest of command. */ else p += 4; continue; /* Ignore these. Used to ignore the n of succeed_n's which currently have n == 0. */ case unused: continue; case casefold_on: options |= RE_OPTION_IGNORECASE; continue; case casefold_off: options &= ~RE_OPTION_IGNORECASE; continue; case wordbound: if (AT_STRINGS_BEG(d)) { if (IS_A_LETTER(d)) break; else goto fail; } if (AT_STRINGS_BEG(d)) { if (IS_A_LETTER(d-1)) break; else goto fail; } if (IS_A_LETTER(d - 1) != IS_A_LETTER(d)) break; goto fail; case notwordbound: if (AT_STRINGS_BEG(d)) { if (IS_A_LETTER(d)) goto fail; else break; } if (AT_STRINGS_END(d)) { if (IS_A_LETTER(d-1)) goto fail; else break; } if (IS_A_LETTER(d - 1) != IS_A_LETTER(d)) goto fail; break; case wordbeg: if (IS_A_LETTER(d) && (AT_STRINGS_BEG(d) || !IS_A_LETTER(d - 1))) break; goto fail; case wordend: if (!AT_STRINGS_BEG(d) && IS_A_LETTER(d - 1) && (!IS_A_LETTER(d) || AT_STRINGS_END(d))) break; goto fail; 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; if (ismbchar(*d) && d + 1 != dend) d++; d++; SET_REGS_MATCHED; break; 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_P()) { do { unsigned char c; PREFETCH; c = *d++; if (*p == 0xff) { p++; if (!--mcnt || AT_STRINGS_END(d) || (unsigned char)*d++ != (unsigned char)*p++) goto fail; continue; } if (ismbchar(c)) { if (c != (unsigned char)*p++ || !--mcnt /* redundant check if pattern was compiled properly. */ || AT_STRINGS_END(d) || (unsigned char)*d++ != (unsigned char)*p++) goto fail; continue; } /* compiled code translation needed for ruby */ if ((unsigned char)translate[c] != (unsigned char)translate[*p++]) goto fail; } while (--mcnt); } else { do { PREFETCH; if (*p == 0xff) {p++; mcnt--;} if (*d++ != *p++) goto fail; } while (--mcnt); } SET_REGS_MATCHED; break; } while (stackp != stackb && (int)stackp[-1] == 1) POP_FAILURE_POINT(); 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[-3] == 0) { POP_FAILURE_POINT(); goto fail; } stackp--; /* discard flag */ d = *--stackp; p = *--stackp; /* Restore register info. */ last_used_reg = (long)*--stackp; /* Make the ones that weren't saved -1 or 0 again. */ for (this_reg = num_regs - 1; this_reg > last_used_reg; this_reg--) { regend[this_reg] = REG_UNSET_VALUE; regstart[this_reg] = REG_UNSET_VALUE; 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].word = *--stackp; regend[this_reg] = *--stackp; regstart[this_reg] = *--stackp; } if (p < pend) { int is_a_jump_n = 0; int failed_paren = 0; p1 = p; /* If failed to a backwards jump that's part of a repetition loop, need to pop this failure point and use the next one. */ pop_loop: switch ((enum regexpcode)*p1) { case stop_paren: failed_paren = 1; p1++; goto pop_loop; case jump_n: case finalize_push_n: is_a_jump_n = 1; case maybe_finalize_jump: case finalize_jump: case finalize_push: case jump: p1++; EXTRACT_NUMBER_AND_INCR (mcnt, p1); p1 += mcnt; if (p1 >= pend) break; if (( is_a_jump_n && (enum regexpcode)*p1 == succeed_n) || (!is_a_jump_n && (enum regexpcode)*p1 == on_failure_jump)) { if (failed_paren) { p1++; EXTRACT_NUMBER_AND_INCR(mcnt, p1); PUSH_FAILURE_POINT(p1 + mcnt, d); } goto fail; } break; default: /* do nothing */ ; } } } 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. */ } /* We are passed P pointing to a register number after a start_memory. Return true if the pattern up to the corresponding stop_memory can match the empty string, and false otherwise. If we find the matching stop_memory, sets P to point to one past its number. Otherwise, sets P to an undefined byte less than or equal to END. We don't handle duplicates properly (yet). */ static int group_match_null_string_p (p, end, reg_info) unsigned char **p, *end; register_info_type *reg_info; { int mcnt; /* Point to after the args to the start_memory. */ unsigned char *p1 = *p + 2; while (p1 < end) { /* Skip over opcodes that can match nothing, and return true or false, as appropriate, when we get to one that can't, or to the matching stop_memory. */ switch ((enum regexpcode)*p1) { /* Could be either a loop or a series of alternatives. */ case on_failure_jump: p1++; EXTRACT_NUMBER_AND_INCR (mcnt, p1); /* If the next operation is not a jump backwards in the pattern. */ if (mcnt >= 0) { /* Go through the on_failure_jumps of the alternatives, seeing if any of the alternatives cannot match nothing. The last alternative starts with only a jump, whereas the rest start with on_failure_jump and end with a jump, e.g., here is the pattern for `a|b|c': /on_failure_jump/0/6/exactn/1/a/jump_past_alt/0/6 /on_failure_jump/0/6/exactn/1/b/jump_past_alt/0/3 /exactn/1/c So, we have to first go through the first (n-1) alternatives and then deal with the last one separately. */ /* Deal with the first (n-1) alternatives, which start with an on_failure_jump (see above) that jumps to right past a jump_past_alt. */ while ((enum regexpcode)p1[mcnt-3] == jump_past_alt) { /* `mcnt' holds how many bytes long the alternative is, including the ending `jump_past_alt' and its number. */ if (!alt_match_null_string_p (p1, p1 + mcnt - 3, reg_info)) return 0; /* Move to right after this alternative, including the jump_past_alt. */ p1 += mcnt; /* Break if it's the beginning of an n-th alternative that doesn't begin with an on_failure_jump. */ if ((enum regexpcode)*p1 != on_failure_jump) break; /* Still have to check that it's not an n-th alternative that starts with an on_failure_jump. */ p1++; EXTRACT_NUMBER_AND_INCR (mcnt, p1); if ((enum regexpcode)p1[mcnt-3] != jump_past_alt) { /* Get to the beginning of the n-th alternative. */ p1 -= 3; break; } } /* Deal with the last alternative: go back and get number of the `jump_past_alt' just before it. `mcnt' contains the length of the alternative. */ EXTRACT_NUMBER (mcnt, p1 - 2); #if 0 if (!alt_match_null_string_p (p1, p1 + mcnt, reg_info)) return 0; #endif p1 += mcnt; /* Get past the n-th alternative. */ } /* if mcnt > 0 */ break; case stop_memory: *p = p1 + 2; return 1; default: if (!common_op_match_null_string_p (&p1, end, reg_info)) return 0; } } /* while p1 < end */ return 0; } /* group_match_null_string_p */ /* Similar to group_match_null_string_p, but doesn't deal with alternatives: It expects P to be the first byte of a single alternative and END one byte past the last. The alternative can contain groups. */ static int alt_match_null_string_p (p, end, reg_info) unsigned char *p, *end; register_info_type *reg_info; { int mcnt; unsigned char *p1 = p; while (p1 < end) { /* Skip over opcodes that can match nothing, and break when we get to one that can't. */ switch ((enum regexpcode)*p1) { /* It's a loop. */ case on_failure_jump: p1++; EXTRACT_NUMBER_AND_INCR (mcnt, p1); p1 += mcnt; break; default: if (!common_op_match_null_string_p (&p1, end, reg_info)) return 0; } } /* while p1 < end */ return 1; } /* alt_match_null_string_p */ /* Deals with the ops common to group_match_null_string_p and alt_match_null_string_p. Sets P to one after the op and its arguments, if any. */ static int common_op_match_null_string_p (p, end, reg_info) unsigned char **p, *end; register_info_type *reg_info; { int mcnt; int ret; int reg_no; unsigned char *p1 = *p; switch ((enum regexpcode)*p1++) { case unused: case begline: case endline: case begbuf: case endbuf: case endbuf2: case wordbeg: case wordend: case wordbound: case notwordbound: #ifdef emacs case before_dot: case at_dot: case after_dot: #endif break; case start_memory: reg_no = *p1; ret = group_match_null_string_p (&p1, end, reg_info); /* Have to set this here in case we're checking a group which contains a group and a back reference to it. */ if (REG_MATCH_NULL_STRING_P (reg_info[reg_no]) == MATCH_NULL_UNSET_VALUE) REG_MATCH_NULL_STRING_P (reg_info[reg_no]) = ret; if (!ret) return 0; break; /* If this is an optimized succeed_n for zero times, make the jump. */ case jump: EXTRACT_NUMBER_AND_INCR (mcnt, p1); if (mcnt >= 0) p1 += mcnt; else return 0; break; case succeed_n: /* Get to the number of times to succeed. */ p1 += 2; EXTRACT_NUMBER_AND_INCR (mcnt, p1); if (mcnt == 0) { p1 -= 4; EXTRACT_NUMBER_AND_INCR (mcnt, p1); p1 += mcnt; } else return 0; break; case duplicate: if (!REG_MATCH_NULL_STRING_P (reg_info[*p1])) return 0; break; case set_number_at: p1 += 4; default: /* All other opcodes mean we cannot match the empty string. */ return 0; } *p = p1; return 1; } /* common_op_match_null_string_p */ static int memcmp_translate(s1, s2, len) unsigned char *s1, *s2; register int len; { 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; } void re_copy_registers(regs1, regs2) struct re_registers *regs1, *regs2; { int i; if (regs1 == regs2) return; if (regs1->allocated == 0) { regs1->beg = TMALLOC(regs2->num_regs, int); regs1->end = TMALLOC(regs2->num_regs, int); regs1->allocated = regs2->num_regs; } else if (regs1->allocated < regs2->num_regs) { TREALLOC(regs1->beg, regs2->num_regs, int); TREALLOC(regs1->end, regs2->num_regs, int); regs1->allocated = regs2->num_regs; } for (i=0; inum_regs; i++) { regs1->beg[i] = regs2->beg[i]; regs1->end[i] = regs2->end[i]; } regs1->num_regs = regs2->num_regs; } void re_free_registers(regs) struct re_registers *regs; { if (regs->allocated == 0) return; if (regs->beg) free(regs->beg); if (regs->end) free(regs->end); } /* Functions for multi-byte support. Created for grep multi-byte extension Jul., 1993 by t^2 (Takahiro Tanimoto) Last change: Jul. 9, 1993 by t^2 */ static const unsigned char mbctab_ascii[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; static const unsigned char mbctab_euc[] = { /* 0xA1-0xFE */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0 }; static const unsigned char mbctab_sjis[] = { /* 0x80-0x9f,0xE0-0xFF */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 }; const unsigned char *mbctab = mbctab_ascii; int current_mbctype = MBCTYPE_ASCII; void re_mbcinit(mbctype) int mbctype; { switch (mbctype) { case MBCTYPE_ASCII: mbctab = mbctab_ascii; current_mbctype = MBCTYPE_ASCII; break; case MBCTYPE_EUC: mbctab = mbctab_euc; current_mbctype = MBCTYPE_EUC; break; case MBCTYPE_SJIS: mbctab = mbctab_sjis; current_mbctype = MBCTYPE_SJIS; break; } } ruby-1.2.3/regex.h100644 774 145 24436 6605055173 12056 0ustar matzNaCl/* 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 */ /* modifis for Ruby by matz@caelum.co.jp */ #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 #define RE_REG_MAX ((1<. .\" .\"This source is distributed under the conditions blow: .\" .\" 1. You may make and give away verbatim copies of the source form of .\" the software without restriction, provided that you do not modify .\" the original distribution files. .\" .\" If you want to distribute the modified version in any way, contact .\" the author. .\" .\" 2. You may distribute the software in object code or executable .\" form, provided that you distribute it with instructions on where .\" to get the software. .\" .\" 3. You may modify the software in any way, provided that you do not .\" distribute the modified version. .\" .\" 4. You may modify and include the part of the software into any other .\" software (possibly commercial). But some files in the distribution .\" are not written by the author, so that they are not under this terms. .\" They are gc.c(partly)$B!$(Butils.c(partly), regex.[ch]$B!$(Bfnmatch.[ch]$B!$(B .\" glob.c, st.[ch] and somme files under the ./missing directory. See .\" each files for the copying condition. .\" .\" 5. The scripts and library files supplied as input to or produced as .\" output from the software do not automatically fall under the .\" copyright of the software, but belong to whomever generated them, .\" and may be sold commercially, and may be aggregated with this .\" software. .\" .\" 6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR .\" IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED .\" WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR .\" PURPOSE. .\" .\" $Id: ruby.1,v 1.1.1.1.4.4 1999/01/18 09:08:51 matz Exp $ .\" .na .TH RUBY 1 "ruby 1.2" "12/Jan/99" "Ruby Programmers Reference Guide" .SH NAME ruby - Interpreted object-oriented scripting language .SH SYNOPSIS .B ruby \c [ \c .BI -version \c ] [ \c .BI -c \c ] [ \c .BI -w \c ] [ \c .BI -d \c ] [ \c .BI -l \c ] [ \c .BI -p \c ] [ \c .BI -n \c ] [ \c .BI -a \c ] [ \c .BI -s \c ] [ \c .BI -0 "[digit]"\c ] [ \c .BI -K "c"\c ] [ \c .BI -e "script"\c ] [ \c .BI -F "pattern"\c ] [ \c .BI -i "[extension]"\c ] [ \c .BI -I "dir"\c ] [ \c .BI -r "filename"\c ] [ \c .BI -S \c ] [ \c .BI -v \c ] [ \c .BI -x "[dir]"\c ] [ \c .BI -X "[dir]"\c ] [ \c .BI -y \c ] [ \c .BI -- \c ] [ programfile ] [ argument ] ... .SH PREFACE Ruby is an interpreted scripting language for quick and easy object-oriented programming. It has many features to process text files and to do system management tasks (as in Perl). It is simple, straight-forward, and extensible. .PP If you want a language for easy object-oriented programming, or you don't like the Perl ugliness, or you do like the concept of lisp, but don't like too much parentheses, Ruby may be the language of your choice. .SH DESCRIPTION Ruby's features are as follows: .TP .B "\(bu Interpretive" Ruby is an interpreted language, so you don't have to recompile programs written in Ruby to execute them. .TP .B "\(bu Variables have no type (dynamic typing)" Variables in Ruby can contain data of any type. You don't have to worry about variable typing. Consequently, it has a weaker compile time check. .TP .B "\(bu No declaration needed" You can use variables in your Ruby programs without any declarations. Variable names denote their scope, local, global, instance, etc. .TP .B "\(bu Simple syntax" Ruby has a simple syntax influenced slightly from Eiffel. .TP .B "\(bu No user-level memory management" Ruby has automatic memory management. Objects no longer referenced from anywhere are automatically collected by the garbage collector built into the interpreter. .TP .B "\(bu Everything is an object" Ruby is the purely object-oriented language, and was so since its creation. Even such basic data as integers are seen as objects. .TP .B "\(bu Class, inheritance, methods" Of course, as an object-oriented language, Ruby has such basic features like classes, inheritance, and methods. .TP .B "\(bu Singleton methods" Ruby has the ability to define methods for certain objects. For example, you can define a press-button action for certain widget by defining a singleton method for the button. Or, you can make up your own prototype based object system using singleton methods, if you want to. .TP .B "\(bu Mix-in by modules" Ruby intentioanlly does not have the multiple inheritance as it is a souce of confusion. Instead, Ruby has the ability to share implementations acrss the inheritance tree. This is oftern called `Mix-in'. .TP .B "\(bu Iterators" Ruby has iterators for loop abstraction. .TP .B "\(bu Closures" In Ruby, you can objectify the procedure. .TP .B "\(bu Text processing and regular expression" Ruby has a bunch of text processing features like in Perl. .TP .B "\(bu Bignums" With built-in bignums, you can for example calculate factorial(400). .TP .B "\(bu Exception handling" As in Java(tm). .TP .B "\(bu Direct access to the OS" Ruby can use most UNIX system calls, often used in system programming. .TP .B "\(bu Dynamic loading" On most UNIX systems, you can load object files into the Ruby interpreter on-the-fly. .PP .SH COMMAND LINE OPTIONS Ruby interpreter accepts following command-line options (switches). They are quite similar to those of Perl. .TP .B -0digit pecifies the input record separator ($/) as an octal number. If no digit is given, the null character is taken as the separator. Other switches may follow the digits. -00 turns Ruby into paragraph mode. - 0777 makes Ruby read whole file at once as a single string since there is no legal character with that value. .TP .B -a turns on auto-split mode when used with -n or -p. In auto-split mode, Ruby executes .nf .ne 1 \& $F = $_.split at beginning of each loop. .fi .TP .B -c causes Ruby to check the syntax of the script and exit without executing. If there are no syntax errors, Ruby will print "Syntax OK" to the standard output. .TP .B -Kc specifies KANJI (Japanese) code-set. .TP .B -d --debug turns on debug mode. $DEBUG will set TRUE. .TP .B -e script specifies script from command-line while telling Ruby to not search argv for script filenames. .TP .B -F regexp specifies input field separator ($;). .TP .B -i extension specifies in-place-edit mode. The extension, if specified, is added to old filename to make a backup copy. example: .nf .ne 8 \& % 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 .B -I directory used to tell Ruby where to load the library scripts. Directory path will be added to the load-path variable ($:'). .TP .B -l enables automatic line-ending processing, which means to firstly set $\ to the value of $/, and secondly chops every line read using chop!. .TP .B -n causes Ruby to assume the following loop around your script, which makes it iterate over filename arguments somewhat like sed -n or awk. .nf .ne 3 \& while gets \& ... \& end .fi .TP .B -p acts mostly same as -n switch, but print the value of variable $_ at the each end of the loop. example: .nf .ne 2 \& % echo matz | ruby -p -e '$_.tr! "a-z", "A-Z"' \& MATZ .fi .TP .B -r filename causes Ruby to load the file using [4]require. It is useful with switches -n or -p. .TP .B -s enables some switch parsing for switches after script name but before any filename arguments (or before a --). Any switches found there are removed from ARGV and set the corresponding variable in the script. example: .nf .ne 3 \& #! /usr/local/bin/ruby -s \& # prints "true" if invoked with `-xyz' switch. \& print "true\en" if $xyz .fi .TP .B -S makes Ruby use the PATH environment variable to search for script, unless if its name begins with a slash. This is used to emulate #! on machines that don't support it, in the following manner: .nf .ne 2 \& #! /usr/local/bin/ruby \& # This line makes the next one a comment in ruby \\ \& exec /usr/local/bin/ruby -S $0 $* .fi On some systems $0 does not always contain the full pathname, so you need -S switch to tell Ruby to search for the script if necessary. To handle embedded spaces or such. A better construct than $* would be ${1+"$@"}, but it does not work if the script is being interpreted by csh. .TP .B -v --verbose enables verbose mode. Ruby will print its version at the beginning, and set the variable `$VERBOSE' to TRUE. Some methods print extra messages if this variable is TRUE. If this switch is given, and no other switches are present, Ruby quits after printing its version. .TP .B --version prints the version of Ruby interpreter. .TP .B -w enables verbose mode without printing version message at the beginning. It set the `$VERBOSE' variable to true. .TP .B -x[directory] tells Ruby that the script is embedded in a message. Leading garbage will be discarded until the first that starts with "#!" and contains the string, "ruby". Any meaningful switches on that line will applied. The end of script must be specified with either EOF, ^D (control-D), ^Z (control-Z), or reserved word __END__.If the directory name is specified, Ruby will switch to that directory before executing script. .TP .B -X directory causes Ruby to switch to the directory. .TP .B -y --yydebug turns on compiler debug mode. Ruby will print a bunch of internal state messages during compiling scripts. You don't have to specify this switch, unless you are going to debug the Ruby interpreter. .PP .SH AUTHOR Ruby is designed and implemented by Yukihiro Matsumoto . ruby-1.2.3/ruby.c100644 774 145 36330 6651566670 11726 0ustar matzNaCl/************************************************ ruby.c - $Author: matz $ $Date: 1999/01/21 09:04:56 $ created at: Tue Aug 10 12:47:31 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #ifdef _WIN32 #include #endif #include "ruby.h" #include "dln.h" #include #include #include #include #ifdef __hpux #include #endif #ifdef HAVE_UNISTD_H #include #endif #ifdef __MWERKS__ #include "node.h" #endif void show_version(); void show_copyright(); #ifdef USE_CWGUSI #include "macruby_missing.h" #endif #ifndef HAVE_STRING_H char *strchr _((char*,char)); char *strrchr _((char*,char)); char *strstr _((char*,char*)); #endif char *ruby_mktemp _((void)); char *getenv(); static int version, copyright; VALUE debug = FALSE; VALUE verbose = FALSE; int tainting = FALSE; static int sflag = FALSE; char *inplace = FALSE; char *strdup(); extern char *sourcefile; extern int yydebug; extern int nerrs; static int xflag = FALSE; extern VALUE RS, RS_default, ORS, FS; static void load_stdin _((void)); static void load_file _((char *, int)); static void forbid_setid _((char *)); static VALUE do_loop = FALSE, do_print = FALSE; static VALUE do_check = FALSE, do_line = FALSE; static VALUE do_split = FALSE; static char *script; static int origargc; static char **origargv; extern int sourceline; extern char *sourcefile; #ifndef RUBY_LIB #define RUBY_LIB "/usr/local/lib/ruby" #endif #ifndef RUBY_SITE_LIB #define RUBY_SITE_LIB "/usr/local/lib/site_ruby" #endif #if defined(MSDOS) || defined(NT) || defined(__MACOS__) #define RUBY_LIB_SEP ';' #else #define RUBY_LIB_SEP ':' #endif extern VALUE rb_load_path; static FILE *e_fp; static char *e_tmpname; static void addpath(path) char *path; { if (path == 0) return; #if defined(__CYGWIN32__) { char rubylib[FILENAME_MAX]; conv_to_posix_path(path, rubylib); path = rubylib; } #endif if (strchr(path, RUBY_LIB_SEP)) { char *p, *s; VALUE ary = ary_new(); p = path; while (*p) { while (*p == RUBY_LIB_SEP) p++; if (s = strchr(p, RUBY_LIB_SEP)) { ary_push(ary, str_new(p, (int)(s-p))); p = s + 1; } else { ary_push(ary, str_new2(p)); break; } } rb_load_path = ary_plus(ary, rb_load_path); } else { ary_unshift(rb_load_path, str_new2(path)); } } struct req_list { char *name; struct req_list *next; } req_list_head; struct req_list *req_list_last = &req_list_head; static void add_modules(mod) char *mod; { struct req_list *list; list = ALLOC(struct req_list); list->name = mod; list->next = 0; req_list_last->next = list; req_list_last = list; } void ruby_require_modules() { struct req_list *list = req_list_head.next; struct req_list *tmp; req_list_last = 0; while (list) { f_require(Qnil, str_new2(list->name)); tmp = list->next; free(list); list = tmp; } } static void proc_options(argcp, argvp) int *argcp; char ***argvp; { int argc = *argcp; char **argv = *argvp; int script_given, do_search; char *s; if (argc == 0) return; version = FALSE; do_search = FALSE; script_given = 0; e_tmpname = NULL; for (argc--,argv++; argc > 0; argc--,argv++) { if (argv[0][0] != '-' || !argv[0][1]) break; s = argv[0]+1; reswitch: switch (*s) { case 'a': do_split = TRUE; s++; goto reswitch; case 'p': do_print = TRUE; /* through */ case 'n': do_loop = TRUE; s++; goto reswitch; case 'd': debug = TRUE; verbose |= 1; s++; goto reswitch; case 'y': yydebug = 1; s++; goto reswitch; case 'v': show_version(); verbose = 2; case 'w': verbose |= 1; s++; goto reswitch; case 'c': do_check = TRUE; s++; goto reswitch; case 's': forbid_setid("-s"); sflag = TRUE; s++; goto reswitch; case 'l': do_line = TRUE; ORS = RS; s++; goto reswitch; case 'S': forbid_setid("-S"); do_search = TRUE; s++; goto reswitch; case 'e': forbid_setid("-e"); if (!e_fp) { e_tmpname = ruby_mktemp(); if (!e_tmpname) Fatal("Can't mktemp"); e_fp = fopen(e_tmpname, "w"); if (!e_fp) { Fatal("Cannot open temporary file: %s", e_tmpname); } if (script == 0) script = e_tmpname; } if (argv[1]) { fputs(argv[1], e_fp); argc--, argv++; } putc('\n', e_fp); break; case 'r': forbid_setid("-r"); if (*++s) { add_modules(s); } else if (argv[1]) { add_modules(argv[1]); argc--,argv++; } break; case 'i': forbid_setid("-i"); if (inplace) free(inplace); inplace = strdup(s+1); break; case 'x': xflag = TRUE; s++; if (*s && chdir(s) < 0) { Fatal("Can't chdir to %s", s); } break; case 'X': s++; if (!*s) { s = argv[1]; argc--,argv++; } if (*s && chdir(s) < 0) { Fatal("Can't chdir to %s", s); } break; case 'F': FS = str_new2(s+1); break; case 'K': s++; rb_set_kcode(s); s++; goto reswitch; case 'T': { int numlen; int v = 1; if (*++s) { v = scan_oct(s, 2, &numlen); if (numlen == 0) v = 1; } rb_set_safe_level(v); tainting = TRUE; } break; case 'I': forbid_setid("-I"); if (*++s) addpath(s); else if (argv[1]) { addpath(argv[1]); argc--,argv++; } break; case '0': { int numlen; int v; char c; v = scan_oct(s, 4, &numlen); s += numlen; if (v > 0377) RS = Qnil; else if (v == 0 && numlen >= 2) { RS = str_new2("\n\n"); } else { c = v & 0xff; RS = str_new(&c, 1); } } goto reswitch; case '-': if (!s[1]) { argc--,argv++; goto switch_end; } s++; if (strcmp("copyright", s) == 0) copyright = 1; else if (strcmp("debug", s) == 0) debug = 1; else if (strcmp("version", s) == 0) version = 1; else if (strcmp("verbose", s) == 0) verbose = 2; else if (strcmp("yydebug", s) == 0) yydebug = 1; else { Fatal("Unrecognized long option: --%s",s); } break; case '*': case ' ': if (s[1] == '-') s+=2; break; default: Fatal("Unrecognized switch: -%s",s); case 0: break; } } switch_end: if (*argvp[0] == 0) return; if (e_fp) { if (fflush(e_fp) || ferror(e_fp) || fclose(e_fp)) Fatal("Cannot write to temp file for -e"); e_fp = NULL; argc++, argv--; argv[0] = e_tmpname; } if (version) { show_version(); exit(0); } if (copyright) { show_copyright(); } Init_ext(); /* should be called here for some reason :-( */ if (script_given == FALSE) { if (argc == 0) { /* no more args */ if (verbose == 3) exit(0); script = "-"; load_stdin(); } else { script = argv[0]; if (script[0] == '\0') { script = "-"; load_stdin(); } else { if (do_search) { char *path = getenv("RUBYPATH"); script = 0; if (path) { script = dln_find_file(argv[0], path); } if (!script) { script = dln_find_file(argv[0], getenv("PATH")); } if (!script) script = argv[0]; } load_file(script, 1); } argc--; argv++; } } if (verbose) verbose = TRUE; xflag = FALSE; *argvp = argv; *argcp = argc; 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(argv[0], str_new2(s)); } else { rb_gvar_set2(argv[0], TRUE); } argv[0][0] = '-'; } *argcp = argc; *argvp = argv; } } static void load_file(fname, script) char *fname; int script; { extern VALUE rb_stdin; VALUE f; int line_start = 1; if (strcmp(fname, "-") == 0) { f = rb_stdin; } else { FILE *fp = fopen(fname, "r"); if (fp == NULL) { LoadError("No such file to load -- %s", fname); } fclose(fp); f = file_open(fname, "r"); } if (script) { VALUE c; VALUE line; VALUE rs = RS; char *p; RS = RS_default; if (xflag) { forbid_setid("-x"); xflag = FALSE; while (!NIL_P(line = io_gets(f))) { line_start++; if (RSTRING(line)->len > 2 && RSTRING(line)->ptr[0] == '#' && RSTRING(line)->ptr[1] == '!') { if (p = strstr(RSTRING(line)->ptr, "ruby")) { goto start_read; } } } RS = rs; LoadError("No Ruby script found in input"); } c = io_getc(f); if (c == INT2FIX('#')) { line = io_gets(f); line_start++; if (RSTRING(line)->len > 2 && RSTRING(line)->ptr[0] == '!') { if ((p = strstr(RSTRING(line)->ptr, "ruby")) == 0) { /* not ruby script, kick the program */ char **argv; char *path; char *pend = RSTRING(line)->ptr + RSTRING(line)->len; p = RSTRING(line)->ptr + 2; /* skip `#!' */ if (pend[-1] == '\n') pend--; /* chomp line */ if (pend[-1] == '\r') pend--; *pend = '\0'; while (p < pend && ISSPACE(*p)) p++; path = p; /* interpreter path */ while (p < pend && !ISSPACE(*p)) p++; *p++ = '\0'; if (p < pend) { argv = ALLOCA_N(char*, origargc+3); argv[1] = p; MEMCPY(argv+2, origargv+1, char*, origargc); } else { argv = origargv; } argv[0] = path; #ifndef USE_CWGUSI execv(path, argv); #endif sourcefile = fname; sourceline = 1; Fatal("Can't exec %s", path); } start_read: p += 4; RSTRING(line)->ptr[RSTRING(line)->len-1] = '\0'; if (RSTRING(line)->ptr[RSTRING(line)->len-2] == '\r') RSTRING(line)->ptr[RSTRING(line)->len-2] = '\0'; if (p = strstr(p, " -")) { int argc; char *argv[2]; char **argvp = argv; char *s = ++p; argc = 2; argv[0] = 0; while (*p == '-') { while (*s && !ISSPACE(*s)) s++; *s = '\0'; argv[1] = p; proc_options(&argc, &argvp); p = ++s; while (*p && ISSPACE(*p)) p++; } } } } else if (!NIL_P(c)) { io_ungetc(f, c); } RS = rs; } compile_file(fname, f, line_start); if (script) { rb_define_global_const("DATA", f); } else if (f != rb_stdin) { io_close(f); } } void rb_load_file(fname) char *fname; { load_file(fname, 0); } static void load_stdin() { forbid_setid("program input from stdin"); load_file("-", 1); } VALUE rb_progname; VALUE rb_argv; VALUE rb_argv0; static void set_arg0(val, id) VALUE val; ID id; { char *s; int i; static int len; if (origargv == 0) Fail("$0 not initialized"); #ifndef __hpux 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]; } #endif s = str2cstr(val, &i); #ifndef __hpux 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++ = ' '; } rb_progname = str_taint(str_new2(origargv[0])); #else if (i >= PST_CLEN) { union pstun j; j.pst_command = s; i = PST_CLEN; RSTRING(val)->len = i; *(s + i) = '\0'; pstat(PSTAT_SETCMD, j, PST_CLEN, 0, 0); } else { union pstun j; j.pst_command = s; pstat(PSTAT_SETCMD, j, i, 0, 0); } rb_progname = str_taint(str_new(s, i)); #endif } void ruby_script(name) char *name; { if (name) { rb_progname = str_taint(str_new2(name)); sourcefile = name; } } static int uid, euid, gid, egid; static void init_ids() { uid = (int)getuid(); euid = (int)geteuid(); gid = (int)getgid(); egid = (int)getegid(); #ifdef VMS uid |= gid << 16; euid |= egid << 16; #endif if (uid && (euid != uid || egid != gid)) { rb_set_safe_level(1); } } static void forbid_setid(s) char *s; { if (euid != uid) Fatal("No %s allowed while running setuid", s); if (egid != gid) Fatal("No %s allowed while running setgid", s); if (rb_safe_level() > 0) Fatal("No %s allowed in tainted mode", s); } #if defined(_WIN32) || defined(DJGPP) static char * ruby_libpath() { static char libpath[FILENAME_MAX+1]; char *p; #if defined(_WIN32) GetModuleFileName(NULL, libpath, sizeof libpath); #elif defined(DJGPP) extern char *__dos_argv0; strcpy(libpath, __dos_argv0); #endif p = strrchr(libpath, '\\'); if (p) { *p = 0; if (!strcasecmp(p-4, "\\bin")) p -= 4; } else { strcpy(libpath, "."); p = libpath + 1; } strcpy(p, "\\lib"); #if defined(__CYGWIN32__) p = (char *)malloc(strlen(libpath)+10); if (!p) return 0; cygwin32_conv_to_posix_path(libpath, p); strcpy(libpath, p); free(p); #else for (p = libpath; *p; p++) if (*p == '\\') *p = '/'; #endif return libpath; } #endif void ruby_prog_init() { init_ids(); sourcefile = "ruby"; rb_define_variable("$VERBOSE", &verbose); rb_define_variable("$-v", &verbose); rb_define_variable("$DEBUG", &debug); rb_define_variable("$-d", &debug); rb_define_readonly_variable("$-p", &do_print); rb_define_readonly_variable("$-l", &do_line); if (rb_safe_level() == 0) { addpath("."); } addpath(RUBY_LIB); #if defined(_WIN32) || defined(DJGPP) addpath(ruby_libpath()); #endif #ifdef __MACOS__ setup_macruby_libpath(); #endif #ifdef RUBY_ARCHLIB addpath(RUBY_ARCHLIB); #endif #ifdef RUBY_THIN_ARCHLIB addpath(RUBY_THIN_ARCHLIB); #endif addpath(RUBY_SITE_LIB); #ifdef RUBY_SITE_ARCHLIB addpath(RUBY_SITE_ARCHLIB); #endif #ifdef RUBY_SITE_THIN_ARCHLIB addpath(RUBY_SITE_THIN_ARCHLIB); #endif if (rb_safe_level() == 0) { addpath(getenv("RUBYLIB")); } rb_define_hooked_variable("$0", &rb_progname, 0, set_arg0); rb_argv = ary_new(); rb_define_readonly_variable("$*", &rb_argv); rb_define_global_const("ARGV", rb_argv); rb_define_readonly_variable("$-a", &do_split); rb_global_variable(&rb_argv0); #ifdef MSDOS /* * There is no way we can refer to them from ruby, so close them to save * space. */ (void)fclose(stdaux); (void)fclose(stdprn); #endif } void ruby_set_argv(argc, argv) int argc; char **argv; { int i; #if defined(USE_DLN_A_OUT) if (origargv) dln_argv0 = origargv[0]; else dln_argv0 = argv[0]; #endif for (i=0; i < argc; i++) { ary_push(rb_argv, str_taint(str_new2(argv[i]))); } } void ruby_process_options(argc, argv) int argc; char **argv; { origargc = argc; origargv = argv; ruby_script(argv[0]); /* for the time being */ rb_argv0 = rb_progname; #if defined(USE_DLN_A_OUT) dln_argv0 = argv[0]; #endif proc_options(&argc, &argv); ruby_script(script); ruby_set_argv(argc, argv); if (do_check && nerrs == 0) { printf("Syntax OK\n"); exit(0); } if (do_print) { yyappend_print(); } if (do_loop) { yywhile_loop(do_line, do_split); } if (e_fp) { fclose(e_fp); e_fp = NULL; } if (e_tmpname) { unlink(e_tmpname); e_tmpname = NULL; } } ruby-1.2.3/ruby.h100644 774 145 32120 6621530727 11713 0ustar matzNaCl/************************************************ ruby.h - $Author: matz $ $Date: 1998/11/09 09:11:51 $ created at: Thu Jun 10 14:26:32 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto *************************************************/ #ifndef RUBY_H #define RUBY_H #if defined(__cplusplus) extern "C" { #endif #include "config.h" #include "defines.h" #ifdef HAVE_STDLIB_H # include #endif #ifdef HAVE_STRING_H # include #else # include #endif #include /* need to include to use these macros */ #define ISSPACE(c) isspace((unsigned char)(c)) #define ISUPPER(c) isupper((unsigned char)(c)) #define ISLOWER(c) islower((unsigned char)(c)) #define ISPRINT(c) isprint((unsigned char)(c)) #define ISALNUM(c) isalnum((unsigned char)(c)) #define ISALPHA(c) isalpha((unsigned char)(c)) #define ISDIGIT(c) isdigit((unsigned char)(c)) #define ISXDIGIT(c) isxdigit((unsigned char)(c)) #ifndef __STDC__ # define volatile # ifdef __GNUC__ # define const __const__ # else # define const # endif #endif #ifdef HAVE_PROTOTYPES # define _(args) args #else # define _(args) () #endif #ifdef HAVE_STDARG_PROTOTYPES # define __(args) args #else # define __(args) () #endif #ifdef HAVE_ATTR_NORETURN # define NORETURN __attribute__ ((noreturn)) #else # define NORETURN #endif #if defined(HAVE_ALLOCA_H) && !defined(__GNUC__) #include #endif #if defined(__CYGWIN32__) #if defined(DLLIMPORT) #include "import.h" #else #define environ (*__imp___cygwin_environ) #endif #endif #ifdef _AIX #pragma alloca #endif #if SIZEOF_LONG != SIZEOF_VOIDP ---->> ruby requires sizeof(void*) == sizeof(long) to be compiled. <<---- # endif /* INT, UINT, UCHAR are obsolete macro, do not use them. */ typedef long INT; typedef unsigned long UINT; typedef unsigned char UCHAR; typedef unsigned long VALUE; typedef unsigned int ID; #ifdef __STDC__ # include #else # ifndef LONG_MAX # ifdef HAVE_LIMITS_H # include # else /* assuming 32bit(2's compliment) long */ # define LONG_MAX 2147483647 # endif # endif # ifndef LONG_MIN # define LONG_MIN (-LONG_MAX-1) # endif # ifndef CHAR_BIT # define CHAR_BIT 8 # endif #endif #define FIXNUM_MAX (LONG_MAX>>1) #define FIXNUM_MIN RSHIFT((long)LONG_MIN,1) #define FIXNUM_FLAG 0x01 #define INT2FIX(i) (VALUE)(((long)(i))<<1 | FIXNUM_FLAG) VALUE int2inum _((long)); #define INT2NUM(v) int2inum(v) #define FIX2LONG(x) RSHIFT((long)x,1) #define FIX2ULONG(x) (((unsigned long)(x))>>1) #define FIXNUM_P(f) (((long)(f))&FIXNUM_FLAG) #define POSFIXABLE(f) ((f) <= FIXNUM_MAX) #define NEGFIXABLE(f) ((f) >= FIXNUM_MIN) #define FIXABLE(f) (POSFIXABLE(f) && NEGFIXABLE(f)) /* special contants - i.e. non-zero and non-fixnum constants */ #ifndef MACRUBY_PUBLIC_INTERFACE # undef FALSE # undef TRUE # define FALSE 0 # define TRUE 2 # define NIL 4 #endif #define Qfalse 0 #define Qtrue 2 #define Qnil 4 # define RTEST(v) rb_test_false_or_nil((VALUE)(v)) #define NIL_P(v) ((VALUE)(v) == Qnil) VALUE rb_class_of _((VALUE)); #define CLASS_OF(v) rb_class_of((VALUE)(v)) #define T_NONE 0x00 #define T_NIL 0x01 #define T_OBJECT 0x02 #define T_CLASS 0x03 #define T_ICLASS 0x04 #define T_MODULE 0x05 #define T_FLOAT 0x06 #define T_STRING 0x07 #define T_REGEXP 0x08 #define T_ARRAY 0x09 #define T_FIXNUM 0x0a #define T_HASH 0x0b #define T_STRUCT 0x0c #define T_BIGNUM 0x0d #define T_FILE 0x0e #define T_TRUE 0x20 #define T_FALSE 0x21 #define T_DATA 0x22 #define T_MATCH 0x23 #define T_VARMAP 0xfd #define T_SCOPE 0xfe #define T_NODE 0xff #define T_MASK 0xff #define BUILTIN_TYPE(x) (((struct RBasic*)(x))->flags & T_MASK) #define TYPE(x) rb_type((VALUE)(x)) void rb_check_type _((VALUE,int)); #define Check_Type(v,t) rb_check_type((VALUE)(v),t) void rb_check_safe_str _((VALUE)); #define Check_SafeStr(v) rb_check_safe_str((VALUE)(v)) void rb_secure _((int)); long num2long _((VALUE)); unsigned long num2ulong _((VALUE)); #define NUM2LONG(x) (FIXNUM_P(x)?FIX2INT(x):num2long((VALUE)x)) #define NUM2ULONG(x) num2ulong((VALUE)x) #if SIZEOF_INT < SIZEOF_LONG int num2int _((VALUE)); #define NUM2INT(x) (FIXNUM_P(x)?FIX2INT(x):num2int((VALUE)x)) int fix2int _((VALUE)); #define FIX2INT(x) fix2int((VALUE)x) #define NUM2UINT(x) ((unsigned int)NUM2ULONG(x)) #define FIX2UINT(x) ((unsigned int)FIX2ULONG(x)) #else #define NUM2INT(x) NUM2LONG(x) #define NUM2UINT(x) NUM2ULONG(x) #define FIX2INT(x) FIX2LONG(x) #define FIX2UINT(x) FIX2ULONG(x) #endif double num2dbl _((VALUE)); #define NUM2DBL(x) num2dbl((VALUE)(x)) char *str2cstr _((VALUE,int*)); #define STR2CSTR(x) str2cstr((VALUE)(x),0) #define NUM2CHR(x) (((TYPE(x) == T_STRING)&&(RSTRING(x)->len>=1))?\ RSTRING(x)->ptr[0]:(char)NUM2INT(x)) #define CHR2FIX(x) INT2FIX((int)x) VALUE rb_newobj _((void)); #define NEWOBJ(obj,type) type *obj = (type*)rb_newobj() #define OBJSETUP(obj,c,t) {\ RBASIC(obj)->klass = (c);\ RBASIC(obj)->flags = (t);\ } #define CLONESETUP(clone,obj) {\ OBJSETUP(clone,singleton_class_clone(RBASIC(obj)->klass),RBASIC(obj)->flags);\ singleton_class_attached(RBASIC(clone)->klass, (VALUE)clone);\ } struct RBasic { unsigned long flags; VALUE klass; }; struct RObject { struct RBasic basic; struct st_table *iv_tbl; }; struct RClass { struct RBasic basic; struct st_table *iv_tbl; struct st_table *m_tbl; VALUE super; }; struct RFloat { struct RBasic basic; double value; }; struct RString { struct RBasic basic; int len; char *ptr; VALUE orig; }; struct RArray { struct RBasic basic; int len, capa; VALUE *ptr; }; struct RRegexp { struct RBasic basic; struct re_pattern_buffer *ptr; int len; char *str; }; struct RHash { struct RBasic basic; struct st_table *tbl; int iter_lev; long status; }; struct RFile { struct RBasic basic; struct OpenFile *fptr; }; struct RData { struct RBasic basic; void (*dmark)(); void (*dfree)(); void *data; }; EXTERN VALUE cData; #define DATA_PTR(dta) (RDATA(dta)->data) VALUE data_object_alloc _((VALUE,void*,void (*)(),void (*)())); #define Data_Make_Struct(klass,type,mark,free,sval) (\ sval = ALLOC(type),\ memset(sval, 0, sizeof(type)),\ data_object_alloc(klass,sval,mark,free)\ ) #define Data_Wrap_Struct(klass,mark,free,sval) (\ data_object_alloc(klass,sval,mark,free)\ ) #define Data_Get_Struct(obj,type,sval) {\ Check_Type(obj, T_DATA); \ sval = (type*)DATA_PTR(obj);\ } struct RStruct { struct RBasic basic; int len; VALUE *ptr; }; struct RBignum { struct RBasic basic; char sign; int len; unsigned short *digits; }; #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 RMODULE(obj) 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 RHASH(obj) (R_CAST(RHash)(obj)) #define RDATA(obj) (R_CAST(RData)(obj)) #define RSTRUCT(obj) (R_CAST(RStruct)(obj)) #define RBIGNUM(obj) (R_CAST(RBignum)(obj)) #define RFILE(obj) (R_CAST(RFile)(obj)) #define FL_SINGLETON FL_USER0 #define FL_MARK (1<<8) #define FL_FINALIZE (1<<9) #define FL_USHIFT 10 #define FL_USER0 (1<<(FL_USHIFT+0)) #define FL_USER1 (1<<(FL_USHIFT+1)) #define FL_USER2 (1<<(FL_USHIFT+2)) #define FL_USER3 (1<<(FL_USHIFT+3)) #define FL_USER4 (1<<(FL_USHIFT+4)) #define FL_USER5 (1<<(FL_USHIFT+5)) #define FL_USER6 (1<<(FL_USHIFT+6)) #define FL_USER7 (1<<(FL_USHIFT+7)) #define FL_UMASK (0xff<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);} #define FL_REVERSE(x,f) if(FL_ABLE(x)){RBASIC(x)->flags ^= f;} #if defined(__GNUC__) && __GNUC__ >= 2 && !defined(RUBY_NO_INLINE) extern __inline__ int rb_type(VALUE obj) { if (FIXNUM_P(obj)) return T_FIXNUM; if (obj == Qnil) return T_NIL; #ifdef MACRUBY_PUBLIC_INTERFACE if (obj == RubyFALSE) return T_FALSE; if (obj == RubyTRUE) return T_TRUE; #else if (obj == FALSE) return T_FALSE; if (obj == TRUE) return T_TRUE; #endif return BUILTIN_TYPE(obj); } extern __inline__ int rb_special_const_p(VALUE obj) { #ifdef MACRUBY_PUBLIC_INTERFACE return (FIXNUM_P(obj)||obj == Qnil||obj == RubyFALSE||obj == RubyTRUE)?RubyTRUE:RubyFALSE; #else return (FIXNUM_P(obj)||obj == Qnil||obj == FALSE||obj == TRUE)?TRUE:FALSE; #endif } extern __inline__ int rb_test_false_or_nil(VALUE v) { #ifdef MACRUBY_PUBLIC_INTERFACE return (v != Qnil) && (v != RubyFALSE); return (v != Qnil) && (v != RubyFALSE); #else return (v != Qnil) && (v != FALSE); return (v != Qnil) && (v != FALSE); #endif } #else int rb_type _((VALUE)); int rb_special_const_p _((VALUE)); int rb_test_false_or_nil _((VALUE)); #endif void *xmalloc _((int)); void *xcalloc _((int,int)); void *xrealloc _((void*,int)); #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)) #define MEMMOVE(p1,p2,type,n) memmove((p1), (p2), sizeof(type)*(n)) VALUE rb_define_class _((char*,VALUE)); VALUE rb_define_module _((char*)); VALUE rb_define_class_under _((VALUE, char *, VALUE)); VALUE rb_define_module_under _((VALUE, char *)); void rb_include_module _((VALUE,VALUE)); void rb_extend_object _((VALUE,VALUE)); void rb_define_variable _((char*,VALUE*)); void rb_define_virtual_variable _((char*,VALUE(*)(),void(*)())); void rb_define_hooked_variable _((char*,VALUE*,VALUE(*)(),void(*)())); void rb_define_readonly_variable _((char*,VALUE*)); void rb_define_const _((VALUE,char*,VALUE)); void rb_define_global_const _((char*,VALUE)); void rb_define_method _((VALUE,char*,VALUE(*)(),int)); void rb_define_function _((VALUE,char*,VALUE(*)(),int)); void rb_define_module_function _((VALUE,char*,VALUE(*)(),int)); void rb_define_global_function _((char *, VALUE (*)(), int)); void rb_undef_method _((VALUE,char*)); void rb_define_alias _((VALUE,char*,char*)); void rb_define_attr _((VALUE,char*,int,int)); ID rb_intern _((char*)); char *rb_id2name _((ID)); ID rb_to_id _((VALUE)); char *rb_class2name _((VALUE)); void rb_p _((VALUE)); VALUE rb_eval_string _((char*)); VALUE rb_funcall __((VALUE, ID, int, ...)); int rb_scan_args __((int, VALUE*, char*, ...)); VALUE rb_iv_get _((VALUE, char *)); VALUE rb_iv_set _((VALUE, char *, VALUE)); VALUE rb_const_get _((VALUE, ID)); VALUE rb_const_get_at _((VALUE, ID)); void rb_const_set _((VALUE, ID, VALUE)); VALUE rb_equal _((VALUE,VALUE)); EXTERN VALUE verbose, debug; int rb_safe_level _((void)); void rb_set_safe_level _((int)); void Raise __((VALUE, char*, ...)) NORETURN; void Fail __((char*, ...)) NORETURN; void Fatal __((char*, ...)) NORETURN; void Bug __((char*, ...)) NORETURN; void rb_sys_fail _((char*)) NORETURN; void rb_iter_break _((void)) NORETURN; void rb_exit _((int)) NORETURN; void rb_raise _((VALUE)) NORETURN; void rb_fatal _((VALUE)) NORETURN; void rb_notimplement _((void)) NORETURN; void Error __((char*, ...)); void Warn __((char*, ...)); void Warning __((char*, ...)); /* reports if `-w' specified */ VALUE rb_each _((VALUE)); VALUE rb_yield _((VALUE)); int iterator_p _((void)); VALUE rb_iterate _((VALUE(*)(),VALUE,VALUE(*)(),VALUE)); VALUE rb_rescue _((VALUE(*)(),VALUE,VALUE(*)(),VALUE)); VALUE rb_ensure _((VALUE(*)(),VALUE,VALUE(*)(),VALUE)); VALUE rb_catch _((char*,VALUE(*)(),VALUE)); void rb_throw _((char*,VALUE)) NORETURN; EXTERN VALUE mKernel; EXTERN VALUE mComparable; EXTERN VALUE mEnumerable; EXTERN VALUE mErrno; EXTERN VALUE mFileTest; EXTERN VALUE mGC; EXTERN VALUE mMath; EXTERN VALUE mProcess; #ifdef __MACOS__ /* name conflict, AERegistory.h */ EXTERN VALUE cRubyObject; #else EXTERN VALUE cObject; #endif EXTERN VALUE cArray; EXTERN VALUE cBignum; EXTERN VALUE cClass; EXTERN VALUE cData; EXTERN VALUE cFile; EXTERN VALUE cFixnum; EXTERN VALUE cFloat; EXTERN VALUE cHash; EXTERN VALUE cInteger; EXTERN VALUE cIO; EXTERN VALUE cModule; EXTERN VALUE cNumeric; EXTERN VALUE cProc; EXTERN VALUE cRegexp; EXTERN VALUE cString; EXTERN VALUE cThread; EXTERN VALUE cStruct; EXTERN VALUE eException; EXTERN VALUE eStandardError; EXTERN VALUE eSystemExit, eInterrupt, eFatal; EXTERN VALUE eArgError; EXTERN VALUE eEOFError; EXTERN VALUE eIndexError; EXTERN VALUE eIOError; EXTERN VALUE eLoadError; EXTERN VALUE eNameError; EXTERN VALUE eRuntimeError; EXTERN VALUE eSecurityError; EXTERN VALUE eSyntaxError; EXTERN VALUE eSystemCallError; EXTERN VALUE eTypeError; EXTERN VALUE eZeroDiv; EXTERN VALUE eNotImpError; #include "intern.h" #if defined(EXTLIB) && defined(USE_DLN_A_OUT) /* hook for external modules */ static char *libs_to_be_linked[] = { EXTLIB, 0 }; #endif #if defined(__cplusplus) } /* extern "C" { */ #endif #endif /* ifndef RUBY_H */ ruby-1.2.3/rubyio.h100644 774 145 2643 6544666605 12243 0ustar matzNaCl/************************************************ rubyio.h - $Author: matz $ $Revision: 1.1.2.2 $ $Date: 1998/06/26 09:44:37 $ created at: Fri Nov 12 16:47:09 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #ifndef IO_H #define IO_H #include #include typedef struct OpenFile { 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 */ void (*finalize)(); /* finalize proc */ } OpenFile; #define FMODE_READABLE 1 #define FMODE_WRITABLE 2 #define FMODE_READWRITE 3 #define FMODE_BINMODE 4 #define FMODE_SYNC 8 #define GetOpenFile(obj,fp) io_check_closed((fp) = RFILE(obj)->fptr) #define MakeOpenFile(obj, fp) do {\ fp = RFILE(obj)->fptr = ALLOC(OpenFile);\ fp->f = fp->f2 = NULL;\ fp->mode = 0;\ fp->pid = 0;\ fp->lineno = 0;\ fp->path = NULL;\ fp->finalize = 0;\ } while (0) #define GetWriteFile(fptr) (((fptr)->f2) ? (fptr)->f2 : (fptr)->f) FILE *rb_fopen _((char *, char *)); FILE *rb_fdopen _((int, char *)); void io_writable _((OpenFile *)); void io_readable _((OpenFile *)); void io_fptr_finalize _((OpenFile *)); void io_unbuffered _((OpenFile *)); void io_check_closed _((OpenFile *)); #endif ruby-1.2.3/rubysig.h100644 774 145 2430 6544666606 12411 0ustar matzNaCl/************************************************ rubysig.h - $Author: matz $ $Date: 1998/06/26 09:44:38 $ created at: Wed Aug 16 01:15:38 JST 1995 ************************************************/ #ifndef SIG_H #define SIG_H extern int trap_immediate; #define TRAP_BEG (trap_immediate=1) #define TRAP_END (trap_immediate=0) extern int prohibit_interrupt; #define DEFER_INTS {prohibit_interrupt++;} #define ALLOW_INTS {prohibit_interrupt--; CHECK_INTS;} #define ENABLE_INTS {prohibit_interrupt--;} extern int trap_pending; void trap_restore_mask _((void)); #ifdef THREAD extern int thread_critical; void thread_schedule _((void)); #if defined(HAVE_SETITIMER) && !defined(__BOW__) extern int thread_pending; # define CHECK_INTS if (!prohibit_interrupt) {\ if (trap_pending) rb_trap_exec();\ if (thread_pending && !thread_critical) thread_schedule();\ } # else /* pseudo preemptive thread switching */ extern int thread_tick; #define THREAD_TICK 500 # define CHECK_INTS if (!prohibit_interrupt) {\ if (trap_pending) rb_trap_exec();\ if (!thread_critical) {\ if (thread_tick-- <= 0) {\ thread_tick = THREAD_TICK;\ thread_schedule();\ }\ }\ } # endif #else # define CHECK_INTS if (!prohibit_interrupt) {\ if (trap_pending) rb_trap_exec();\ } #endif #endif ruby-1.2.3/rubytest.rb100755 774 145 471 6575172504 12741 0ustar matzNaCl#! ./miniruby -I. require 'rbconfig' include Config $stderr.reopen($stdout) error = '' `./ruby #{CONFIG["srcdir"]}/sample/test.rb`.each do |line| if line =~ /^end of test/ print "test succeeded\n" exit 0 end error << line if line =~ %r:^(sample/test.rb|not): end print error print "test failed\n" ruby-1.2.3/signal.c100644 774 145 22666 6551100772 12213 0ustar matzNaCl/************************************************ signal.c - $Author: matz $ $Date: 1998/07/09 08:40:26 $ created at: Tue Dec 20 10:13:44 JST 1994 ************************************************/ #include "ruby.h" #include "rubysig.h" #include #include #ifdef __BEOS__ #undef SIGBUS #endif #ifndef NSIG # ifdef DJGPP # define NSIG SIGMAX # else # define NSIG (_SIGMAX + 1) /* For QNX */ # endif #endif #ifdef USE_CWGUSI # undef NSIG # define NSIG __signal_max #endif 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 f_kill(argc, argv) int argc; VALUE *argv; { #ifdef USE_CWGUSI rb_notimplement(); #else int negative = 0; int sig; int i; char *s; rb_secure(2); if (argc < 2) ArgError("wrong # of arguments -- kill(sig, pid...)"); switch (TYPE(argv[0])) { case T_FIXNUM: sig = FIX2UINT(argv[0]); if (sig >= NSIG) { s = rb_id2name(sig); if (!s) ArgError("Bad signal"); goto str_signal; } break; case T_STRING: { s = RSTRING(argv[0])->ptr; if (s[0] == '-') { negative++; s++; } str_signal: if (strncmp("SIG", s, 3) == 0) s += 3; if((sig = signm2signo(s)) == 0) ArgError("Unrecognized signal name `%s'", s); if (negative) sig = -sig; } break; default: ArgError("bad signal type %s", rb_class2name(CLASS_OF(argv[0]))); break; } if (sig < 0) { sig = -sig; for (i=1; i= NSIG ||(sig != SIGINT && !trap_list[sig])) Bug("trap_handler: Bad signal %d", sig); #if !defined(POSIX_SIGNAL) && !defined(BSD_SIGNAL) signal(sig, sighandle); #endif if (trap_immediate) { trap_immediate = 0; if (sig == SIGINT && !trap_list[SIGINT]) { rb_interrupt(); } rb_trap_eval(trap_list[sig], sig); trap_immediate = 1; } else { trap_pending++; trap_pending_list[sig]++; } } #ifdef SIGBUS static RETSIGTYPE sigbus(sig) int sig; { Bug("Bus Error"); } #endif #ifdef SIGSEGV static RETSIGTYPE sigsegv(sig) int sig; { Bug("Segmentation fault"); } #endif void rb_trap_exit() { #ifndef MACOS_UNUSE_SIGNAL if (trap_list[0]) rb_eval_cmd(trap_list[0], ary_new3(1, INT2FIX(0))); #endif } void rb_trap_exec() { #ifndef MACOS_UNUSE_SIGNAL int i; for (i=0; icmd; if (NIL_P(command)) { func = SIG_IGN; } else if (TYPE(command) == T_STRING) { Check_SafeStr(command); /* taint check */ if (RSTRING(command)->len == 0) { func = SIG_IGN; } else if (RSTRING(command)->len == 7) { if (strncmp(RSTRING(command)->ptr, "SIG_IGN", 7) == 0) { func = SIG_IGN; } else if (strncmp(RSTRING(command)->ptr, "SIG_DFL", 7) == 0) { func = SIG_DFL; } else if (strncmp(RSTRING(command)->ptr, "DEFAULT", 7) == 0) { func = SIG_DFL; } } else if (RSTRING(command)->len == 6) { if (strncmp(RSTRING(command)->ptr, "IGNORE", 6) == 0) { func = SIG_IGN; } } else if (RSTRING(command)->len == 4) { if (strncmp(RSTRING(command)->ptr, "EXIT", 4) == 0) { func = sigexit; } } } if (func == SIG_IGN || func == SIG_DFL) { command = 0; } if (TYPE(arg->sig) == T_STRING) { char *s = RSTRING(arg->sig)->ptr; if (strncmp("SIG", s, 3) == 0) s += 3; sig = signm2signo(s); if (sig == 0 && strcmp(s, "EXIT") != 0) ArgError("Invalid signal SIG%s", s); } else { sig = NUM2INT(arg->sig); } if (sig < 0 || sig > NSIG) { ArgError("Invalid signal no %d", sig); } #if defined(THREAD) && defined(HAVE_SETITIMER) && !defined(__BOW__) if (sig == SIGVTALRM) { ArgError("SIGVTALRM reserved for Thread; cannot set handler"); } #endif if (func == SIG_DFL) { switch (sig) { case SIGINT: func = sighandle; break; #ifdef SIGBUS case SIGBUS: func = sigbus; break; #endif #ifdef SIGSEGV case SIGSEGV: func = sigsegv; break; #endif } } #ifdef POSIX_SIGNAL posix_signal(sig, func); #else signal(sig, func); #endif old = trap_list[sig]; if (!old) old = Qnil; trap_list[sig] = command; /* enable at least specified signal. */ #if !defined(NT) && !defined(USE_CWGUSI) #ifdef HAVE_SIGPROCMASK sigdelset(&arg->mask, sig); #else arg->mask &= ~sigmask(sig); #endif #endif return old; } #if !defined(NT) && !defined(USE_CWGUSI) static VALUE trap_ensure(arg) struct trap_arg *arg; { /* enable interrupt */ #ifdef HAVE_SIGPROCMASK sigprocmask(SIG_SETMASK, &arg->mask, NULL); #else sigsetmask(arg->mask); #endif trap_last_mask = arg->mask; return 0; } #endif void trap_restore_mask() { #ifndef NT # ifdef HAVE_SIGPROCMASK sigprocmask(SIG_SETMASK, &trap_last_mask, NULL); # else sigsetmask(trap_last_mask); # endif #endif } static VALUE f_trap(argc, argv) int argc; VALUE *argv; { struct trap_arg arg; rb_secure(2); if (argc == 0 || argc > 2) { ArgError("wrong # of arguments -- trap(sig, cmd)/trap(sig){...}"); } arg.sig = argv[0]; if (argc == 1) { arg.cmd = f_lambda(); } else if (argc == 2) { arg.cmd = argv[1]; } #if !defined(NT) && !defined(USE_CWGUSI) /* disable interrupt */ # ifdef HAVE_SIGPROCMASK sigfillset(&arg.mask); sigprocmask(SIG_BLOCK, &arg.mask, &arg.mask); # else arg.mask = sigblock(~0); # endif return rb_ensure(trap, (VALUE)&arg, trap_ensure, (VALUE)&arg); #else return trap(&arg); #endif } void Init_signal() { #ifndef MACOS_UNUSE_SIGNAL rb_define_global_function("trap", f_trap, -1); #ifdef POSIX_SIGNAL posix_signal(SIGINT, sighandle); #else signal(SIGINT, sighandle); #endif #ifdef SIGBUS signal(SIGBUS, sigbus); #endif #ifdef SIGSEGV signal(SIGSEGV, sigsegv); #endif #endif /* MACOS_UNUSE_SIGNAL */ } ruby-1.2.3/sprintf.c100644 774 145 25273 6624237007 12423 0ustar matzNaCl/************************************************ sprintf.c - $Author: matz $ $Date: 1998/11/17 09:12:39 $ created at: Fri Oct 15 10:39:26 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include static void fmt_setup _((char*,char,int,int,int)); static char* remove_sign_bits(str, base) char *str; int base; { char *s, *t, *end; s = t = str; end = str + strlen(str); if (base == 16) { x_retry: switch (*t) { case 'c': case 'C': *t = '4'; break; case 'd': case 'D': *t = '5'; break; case 'e': case 'E': *t = '2'; break; case 'f': case 'F': if (t[1] > '8') { t++; goto x_retry; } *t = '1'; break; case '1': case '3': case '7': if (t[1] > '8') { t++; goto x_retry; } break; } switch (*t) { case '1': *t = 'f'; break; case '2': *t = 'e'; break; case '3': *t = 'f'; break; case '4': *t = 'c'; break; case '5': *t = 'd'; break; case '6': *t = 'e'; break; case '7': *t = 'f'; break; } } else if (base == 8) { o_retry: switch (*t) { case '6': *t = '2'; break; case '7': if (t[1] > '3') { t++; goto o_retry; } *t = '1'; break; case '1': case '3': if (t[1] > '3') { t++; goto o_retry; } break; } switch (*t) { case '1': *t = '7'; break; case '2': *t = '6'; break; case '3': *t = '7'; break; } } else if (base == 2) { while (t= 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)?(ArgError("too few argument."),0):(argc--,((argv++)[0]))) VALUE f_sprintf(argc, argv) int argc; VALUE *argv; { VALUE fmt; char *buf, *p, *end; int blen, bsiz; VALUE result; int width, prec, flags = FNONE; VALUE tmp; VALUE str; fmt = GETARG(); p = str2cstr(fmt, &blen); end = p + blen; blen = 0; bsiz = 120; buf = ALLOC_N(char, bsiz); for (; 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 `%' */ width = prec = -1; retry: switch (*p) { default: if (ISPRINT(*p)) ArgError("malformed format string - %%%c", *p); else ArgError("malformed format string"); break; case ' ': flags |= FSPACE; 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 < end && ISDIGIT(*p); p++) { width = 10 * width + (*p - '0'); } if (p >= end) { ArgError("malformed format string - %%[0-9]"); } goto retry; case '*': if (flags & FWIDTH) { ArgError("width given twice"); } flags |= FWIDTH; tmp = GETARG(); width = NUM2INT(tmp); if (width < 0) { flags |= FMINUS; width = -width; } p++; goto retry; case '.': if (flags & FPREC) { ArgError("precision given twice"); } prec = 0; p++; if (*p == '*') { tmp = GETARG(); prec = NUM2INT(tmp); if (prec > 0) flags |= FPREC; p++; goto retry; } for (; p < end && ISDIGIT(*p); p++) { prec = 10 * prec + (*p - '0'); } if (p >= end) { ArgError("malformed format string - %%.[0-9]"); } if (prec > 0) flags |= FPREC; goto retry; case '\n': p--; case '\0': case '%': PUSH("%", 1); break; case 'c': { VALUE val = GETARG(); char c; if (!(flags & FMINUS)) while (--width > 0) PUSH(" ", 1); c = NUM2INT(val) & 0xff; PUSH(&c, 1); while (--width > 0) PUSH(" ", 1); } break; case 's': { VALUE arg = GETARG(); int len; str = obj_as_string(arg); len = RSTRING(str)->len; if (flags&FPREC) { if (prec < len) { CHECK(prec); memcpy(&buf[blen], RSTRING(str)->ptr, prec); blen += prec; break; } } if (flags&FWIDTH) { if (width > len) { CHECK(width); width -= len; if (!(flags&FMINUS)) { while (width--) { buf[blen++] = ' '; } } memcpy(&buf[blen], RSTRING(str)->ptr, len); blen += len; if (flags&FMINUS) { while (width--) { buf[blen++] = ' '; } } break; } } CHECK(len); memcpy(&buf[blen], RSTRING(str)->ptr, len); blen += len; } break; case 'd': case 'i': case 'o': case 'x': case 'X': case 'b': case 'u': { volatile VALUE val = GETARG(); char fbuf[32], nbuf[64], *s, *t; char *prefix = 0; int sign = 0; char sc = 0; long v; int base, bignum = 0; int len, pos; switch (*p) { case 'd': case 'i': sign = 1; break; case 'o': case 'x': case 'X': case 'b': case 'u': default: if (flags&(FPLUS|FSPACE)) sign = 1; break; } if (flags & FSHARP) { if (*p == 'o') prefix = "0"; else if (*p == 'x') prefix = "0x"; else if (*p == 'X') prefix = "0X"; else if (*p == 'b') prefix = "0b"; if (prefix) { width -= strlen(prefix); } } bin_retry: switch (TYPE(val)) { case T_FIXNUM: v = FIX2LONG(val); break; case T_FLOAT: val = dbl2big(RFLOAT(val)->value); if (FIXNUM_P(val)) goto bin_retry; bignum = 1; break; case T_STRING: val = str2inum(RSTRING(val)->ptr, 10); goto bin_retry; case T_BIGNUM: bignum = 1; break; default: Check_Type(val, T_FIXNUM); break; } if (*p == 'u' || *p == 'd' || *p == 'i') base = 10; else if (*p == 'x' || *p == 'X') base = 16; else if (*p == 'o') base = 8; else if (*p == 'b') base = 2; if (!bignum) { if (base == 2) { val = int2big(v); goto bin_retry; } if (sign) { char c = *p; if (c == 'i') c = 'd'; /* %d and %i are identical */ if (v < 0) { v = -v; sc = '-'; width--; } else if (flags & FPLUS) { sc = '+'; width--; } else if (flags & FSPACE) { sc = ' '; width--; } sprintf(fbuf, "%%l%c", c); sprintf(nbuf, fbuf, v); s = nbuf; goto format_integer; } s = nbuf; if (v < 0) { strcpy(s, ".."); s += 2; } sprintf(fbuf, "%%l%c", *p); sprintf(s, fbuf, v); if (v < 0) { char d = 0; remove_sign_bits(s, base); switch (base) { case 16: d = 'f'; break; case 8: d = '7'; break; } if (d && *s != d) { memmove(s+1, s, strlen(s)+1); *s = d; } } s = nbuf; goto format_integer; } if (sign) { val = big2str(val, base); s = RSTRING(val)->ptr; if (s[0] == '-') { s++; sc = '-'; width--; } else if (flags & FPLUS) { sc = '+'; width--; } else if (flags & FSPACE) { sc = ' '; width--; } goto format_integer; } if (!RBIGNUM(val)->sign) { val = big_clone(val); big_2comp(val); } val = big2str(val, base); s = RSTRING(val)->ptr; if (*s == '-') { remove_sign_bits(++s, base); val = str_new(0, 3+strlen(s)); t = RSTRING(val)->ptr; strcpy(t, ".."); t += 2; switch (base) { case 16: if (s[0] != 'f') strcpy(t++, "f"); break; case 8: if (s[0] != '7') strcpy(t++, "7"); break; } strcpy(t, s); bignum = 2; } s = RSTRING(val)->ptr; format_integer: pos = -1; len = strlen(s); if (*p == 'X') { char *pp = s; while (*pp) { *pp = toupper(*pp); pp++; } } if (prec < len) prec = len; width -= prec; if (!(flags&(FZERO|FMINUS)) && s[0] != '.') { CHECK(width); while (width-->0) { buf[blen++] = ' '; } } if (sc) PUSH(&sc, 1); if (prefix) { int plen = strlen(prefix); CHECK(plen); strcpy(&buf[blen], prefix); blen += plen; if (pos) pos += plen; } if (!(flags & FMINUS)) { char c = ' '; if (s[0] == '.') { c = '.'; if ((flags & FPREC) && prec > len) { pos = blen; } else { pos = blen + 2; } } else if (flags & FZERO) c = '0'; CHECK(width); while (width-->0) { buf[blen++] = c; } } CHECK(prec - len); while (len < prec--) { buf[blen++] = s[0]=='.'?'.':'0'; } CHECK(len); strcpy(&buf[blen], s); blen += len; CHECK(width); while (width-->0) { buf[blen++] = ' '; } if (pos >= 0 && buf[pos] == '.') { char c = '.'; switch (base) { case 16: if (*p == 'X') c = 'F'; else c = 'f'; break; case 8: c = '7'; break; case '2': c = '1'; break; } s = &buf[pos]; while (*s && *s == '.') { *s++ = c; } } } break; case 'f': case 'g': case 'e': case 'E': { VALUE val = GETARG(); double fval; char fbuf[32]; switch (TYPE(val)) { case T_FIXNUM: fval = (double)FIX2LONG(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: Check_Type(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 (RTEST(verbose) && argc > 1) { ArgError("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 & FSPACE) *buf++ = ' '; 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-1.2.3/st.c100644 774 145 20444 6646326263 11366 0ustar matzNaCl/* This is a general purpose hash table package written by Peter Moore @ UCB. */ static char sccsid[] = "@(#) st.c 5.1 89/12/14 Crucible"; #include "config.h" #include #include "st.h" #ifdef USE_CWGUSI #include #endif #define ST_DEFAULT_MAX_DENSITY 5 #define ST_DEFAULT_INIT_TABLE_SIZE 11 /* * 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 * */ static int numcmp(); static int numhash(); static struct st_hash_type type_numhash = { numcmp, numhash, }; extern int strcmp(); static int strhash(); static struct st_hash_type type_strhash = { strcmp, strhash, }; void *xmalloc(); void *xcalloc(); void *xrealloc(); static void rehash(); #ifndef max #define max(a,b) ((a) > (b) ? (a) : (b)) #endif #define alloc(type) (type*)xmalloc((unsigned)sizeof(type)) #define Calloc(n,s) (char*)xcalloc((n),(s)) #define EQUAL(table, x, y) ((*table->type->compare)(x, y) == 0) #define do_hash(key, table) (*(table)->type->hash)((key), (table)->num_bins) #define do_hash2(key, table, bins) (*(table)->type->hash)((key), bins) st_table* st_init_table_with_size(type, size) struct st_hash_type *type; int size; { st_table *tbl; if (size == 0) size = ST_DEFAULT_INIT_TABLE_SIZE; else size /= ST_DEFAULT_MAX_DENSITY*0.87; if (size < ST_DEFAULT_INIT_TABLE_SIZE) size = ST_DEFAULT_INIT_TABLE_SIZE; tbl = alloc(st_table); tbl->type = type; tbl->num_entries = 0; tbl->num_bins = size; tbl->bins = (st_table_entry **)Calloc(size, sizeof(st_table_entry*)); return tbl; } st_table* st_init_table(type) struct st_hash_type *type; { return st_init_table_with_size(type, 0); } st_table* st_init_numtable() { return st_init_table(&type_numhash); } st_table* st_init_strtable() { return st_init_table(&type_strhash); } void 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 != 0) { next = ptr->next; free(ptr); ptr = next; } } free(table->bins); free(table); } #define PTR_NOT_EQUAL(table, ptr, key) \ (ptr != 0 && !EQUAL(table, 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;\ }\ ptr = ptr->next;\ } int 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 == 0) { return 0; } else { if (value != 0) *value = ptr->record; return 1; } } #define ADD_DIRECT(table, key, value, hash_val, tbl)\ {\ if (table->num_entries/table->num_bins > ST_DEFAULT_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++;\ } int 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 == 0) { ADD_DIRECT(table,key,value,hash_val,tbl); return 0; } else { ptr->record = value; return 1; } } void 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); } int 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 == 0) { ADD_DIRECT(table, key, (char*)0, hash_val, tbl) if (slot != 0) *slot = &tbl->record; return 0; } else { if (slot != 0) *slot = &ptr->record; return 1; } } static void rehash(table) register st_table *table; { register st_table_entry *ptr, *next, **new_bins; int i, old_num_bins = table->num_bins, new_num_bins, hash_val; new_num_bins = 1.79*old_num_bins; if (new_num_bins%2 == 0) { new_num_bins += 1; } new_bins = (st_table_entry **) Calloc((unsigned)new_num_bins, sizeof(st_table_entry*)); for(i = 0; i < old_num_bins ; i++) { ptr = table->bins[i]; while (ptr != 0) { next = ptr->next; hash_val = do_hash2(ptr->key, table, new_num_bins); ptr->next = new_bins[hash_val]; new_bins[hash_val] = ptr; ptr = next; } } free(table->bins); table->num_bins = new_num_bins; table->bins = new_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 == 0) { return 0; } *new_table = *old_table; new_table->bins = (st_table_entry**) Calloc((unsigned)num_bins, sizeof(st_table_entry*)); if (new_table->bins == 0) { free(new_table); return 0; } for(i = 0; i < num_bins ; i++) { new_table->bins[i] = 0; ptr = old_table->bins[i]; while (ptr != 0) { tbl = alloc(st_table_entry); if (tbl == 0) { free(new_table->bins); free(new_table); return 0; } *tbl = *ptr; tbl->next = new_table->bins[i]; new_table->bins[i] = tbl; ptr = ptr->next; } } return new_table; } int 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 == 0) { if (value != 0) *value = 0; return 0; } if (EQUAL(table, *key, ptr->key)) { table->bins[hash_val] = ptr->next; table->num_entries--; if (value != 0) *value = ptr->record; *key = ptr->key; free(ptr); return 1; } for(; ptr->next != 0; ptr = ptr->next) { if (EQUAL(table, ptr->next->key, *key)) { tmp = ptr->next; ptr->next = ptr->next->next; table->num_entries--; if (value != 0) *value = tmp->record; *key = tmp->key; free(tmp); return 1; } } return 0; } int st_delete_safe(table, key, value, never) register st_table *table; register char **key; char **value; char *never; { int hash_val; register st_table_entry *ptr; hash_val = do_hash(*key, table); ptr = table->bins[hash_val]; if (ptr == 0) { if (value != 0) *value = 0; return 0; } if (EQUAL(table, *key, ptr->key)) { table->num_entries--; *key = ptr->key; if (value != 0) *value = ptr->record; ptr->key = ptr->record = never; return 1; } for(; ptr->next != 0; ptr = ptr->next) { if (EQUAL(table, ptr->next->key, *key)) { table->num_entries--; *key = ptr->key; if (value != 0) *value = ptr->record; ptr->key = ptr->record = never; return 1; } } return 0; } void 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 = 0; for(ptr = table->bins[i]; ptr != 0;) { 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 == 0) { table->bins[i] = ptr->next; } else { last->next = ptr->next; } ptr = ptr->next; free(tmp); table->num_entries--; } } } } static int 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; } static int numcmp(x, y) int x, y; { return x != y; } static int numhash(n, modulus) int n; int modulus; { return n % modulus; } ruby-1.2.3/st.h100644 774 145 2072 6457557634 11360 0ustar matzNaCl/* 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_hash_type { int (*compare)(); int (*hash)(); }; struct st_table { struct st_hash_type *type; int num_bins; int num_entries; 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}; st_table *st_init_table(); st_table *st_init_table_with_size(); st_table *st_init_numtable(); st_table *st_init_strtable(); int st_delete(), st_delete_safe(), st_insert(); int st_lookup(), st_find_or_add(); void st_foreach(), st_add_direct(), st_free_table(); st_table *st_copy(); #define ST_NUMCMP ((int (*)()) 0) #define ST_NUMHASH ((int (*)()) -2) #define st_numcmp ST_NUMCMP #define st_numhash ST_NUMHASH int st_strhash(); #endif /* ST_INCLUDED */ ruby-1.2.3/string.c100644 774 145 147375 6621530727 12276 0ustar matzNaCl/************************************************ string.c - $Author: matz $ $Date: 1998/11/09 09:11:51 $ created at: Mon Aug 9 17:12:58 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "re.h" #define BEG(no) regs->beg[no] #define END(no) regs->end[no] #include #ifdef HAVE_UNISTD_H #include #endif VALUE cString; #define STRLEN(s) RSTRING(s)->len #define STR_FREEZE FL_USER1 #define STR_TAINT FL_USER2 #define STR_NO_ORIG FL_USER3 extern VALUE RS; VALUE str_new(ptr, len) char *ptr; unsigned len; { NEWOBJ(str, struct RString); OBJSETUP(str, cString, T_STRING); if (rb_safe_level() >= 3) { FL_SET(str, STR_TAINT); } str->ptr = 0; str->len = len; str->orig = 0; 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) VALUE str; { NEWOBJ(str2, struct RString); OBJSETUP(str2, cString, T_STRING); str2->len = RSTRING(str)->len; str2->ptr = RSTRING(str)->ptr; str2->orig = str; if (rb_safe_level() >= 3) { FL_SET(str2, STR_TAINT); } return (VALUE)str2; } VALUE str_new4(orig) VALUE orig; { if (FL_TEST(orig, STR_FREEZE)) { return orig; } else if (RSTRING(orig)->orig && !FL_TEST(orig, STR_NO_ORIG)) { return str_freeze(RSTRING(orig)->orig); } else { NEWOBJ(str, struct RString); OBJSETUP(str, cString, T_STRING); str->len = RSTRING(orig)->len; str->ptr = RSTRING(orig)->ptr; RSTRING(orig)->orig = (VALUE)str; str->orig = 0; if (rb_safe_level() >= 3) { FL_SET(str, STR_TAINT); } return (VALUE)str; } } VALUE str_to_str(str) VALUE str; { return rb_convert_type(str, T_STRING, "String", "to_str"); } static void str_assign(str, str2) VALUE str, str2; { if (str == str2) return; if (NIL_P(str2)) { RSTRING(str)->ptr = 0; RSTRING(str)->len = 0; RSTRING(str)->orig = 0; return; } if ((!RSTRING(str)->orig||FL_TEST(str, STR_NO_ORIG))&&RSTRING(str)->ptr) free(RSTRING(str)->ptr); RSTRING(str)->ptr = RSTRING(str2)->ptr; RSTRING(str)->len = RSTRING(str2)->len; RSTRING(str)->orig = RSTRING(str2)->orig; RSTRING(str2)->ptr = 0; /* abandon str2 */ RSTRING(str2)->len = 0; if (str_tainted(str2)) str_taint(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 any_to_s(obj); return str; } static VALUE str_clone(orig) VALUE orig; { VALUE str; if (RSTRING(orig)->orig && !FL_TEST(orig, STR_NO_ORIG)) str = str_new3(RSTRING(orig)->orig); else str = str_new(RSTRING(orig)->ptr, RSTRING(orig)->len); if (RSTRING(orig)->orig && FL_TEST(orig, STR_NO_ORIG)) RSTRING(str)->orig = RSTRING(orig)->orig; CLONESETUP(str, orig); return str; } VALUE str_dup(str) VALUE str; { VALUE s; str = str_to_str(str); s = str_new(RSTRING(str)->ptr, RSTRING(str)->len); if (str_tainted(str)) s = str_taint(s); if (RSTRING(str)->orig && FL_TEST(str, STR_NO_ORIG)) RSTRING(s)->orig = RSTRING(str)->orig; return s; } static VALUE str_s_new(klass, orig) VALUE klass; VALUE orig; { NEWOBJ(str, struct RString); OBJSETUP(str, klass, T_STRING); orig = obj_as_string(orig); str->len = RSTRING(orig)->len; str->ptr = ALLOC_N(char, RSTRING(orig)->len+1); if (str->ptr) { memcpy(str->ptr, RSTRING(orig)->ptr, RSTRING(orig)->len); } str->ptr[RSTRING(orig)->len] = '\0'; str->orig = 0; if (rb_safe_level() >= 3) { FL_SET(str, STR_TAINT); } obj_call_init((VALUE)str); return (VALUE)str; } static VALUE str_length(str) VALUE str; { return INT2FIX(RSTRING(str)->len); } static VALUE str_empty(str) VALUE str; { if (RSTRING(str)->len == 0) return TRUE; return FALSE; } VALUE str_plus(str1, str2) VALUE str1, str2; { VALUE str3; str2 = str_to_str(str2); str3 = str_new(0, RSTRING(str1)->len+RSTRING(str2)->len); memcpy(RSTRING(str3)->ptr, RSTRING(str1)->ptr, RSTRING(str1)->len); memcpy(RSTRING(str3)->ptr+RSTRING(str1)->len, RSTRING(str2)->ptr, RSTRING(str2)->len); RSTRING(str3)->ptr[RSTRING(str3)->len] = '\0'; if (str_tainted(str1) || str_tainted(str2)) return str_taint(str3); return str3; } VALUE str_times(str, times) VALUE str; VALUE times; { VALUE str2; int i, len; len = NUM2INT(times); if (len < 0) { ArgError("negative argument"); } str2 = str_new(0, RSTRING(str)->len*len); for (i=0; iptr+(i*RSTRING(str)->len), RSTRING(str)->ptr, RSTRING(str)->len); } RSTRING(str2)->ptr[RSTRING(str2)->len] = '\0'; if (str_tainted(str)) { return str_taint(str2); } return str2; } VALUE str_format(str, arg) VALUE str, arg; { VALUE *argv; if (TYPE(arg) == T_ARRAY) { argv = ALLOCA_N(VALUE, RARRAY(arg)->len + 1); argv[0] = str; MEMCPY(argv+1, RARRAY(arg)->ptr, VALUE, RARRAY(arg)->len); return f_sprintf(RARRAY(arg)->len+1, argv); } argv = ALLOCA_N(VALUE, 2); argv[0] = str; argv[1] = arg; return f_sprintf(2, argv); } VALUE str_substr(str, start, len) VALUE str; int start, len; { VALUE str2; if (start < 0) { start = RSTRING(str)->len + start; } if (RSTRING(str)->len <= start || len < 0) { return str_new(0,0); } if (RSTRING(str)->len < start + len) { len = RSTRING(str)->len - start; } str2 = str_new(RSTRING(str)->ptr+start, len); if (str_tainted(str)) str_taint(str2); return str2; } static VALUE str_subseq(str, beg, end) VALUE str; int beg, end; { int len; if ((beg > 0 && end > 0 || beg < 0 && end < 0) && beg > end) { IndexError("end smaller than beg [%d..%d]", beg, end); } if (beg < 0) { beg = RSTRING(str)->len + beg; if (beg < 0) beg = 0; } if (end < 0) { end = RSTRING(str)->len + end; if (end < 0) end = -1; else if (RSTRING(str)->len < end) { end = RSTRING(str)->len; } } if (beg >= RSTRING(str)->len) { return str_new(0, 0); } len = end - beg + 1; if (len < 0) { len = 0; } return str_substr(str, beg, len); } extern VALUE ignorecase; void str_modify(str) VALUE str; { char *ptr; if (rb_safe_level() >= 5) { Raise(eSecurityError, "cannot change string status"); } if (FL_TEST(str, STR_FREEZE)) TypeError("can't modify frozen string"); if (!RSTRING(str)->orig || FL_TEST(str, STR_NO_ORIG)) return; ptr = RSTRING(str)->ptr; RSTRING(str)->ptr = ALLOC_N(char, RSTRING(str)->len+1); if (RSTRING(str)->ptr) { memcpy(RSTRING(str)->ptr, ptr, RSTRING(str)->len); RSTRING(str)->ptr[RSTRING(str)->len] = 0; } RSTRING(str)->orig = 0; } VALUE str_freeze(str) VALUE str; { FL_SET(str, STR_FREEZE); return str; } static VALUE str_frozen_p(str) VALUE str; { if (FL_TEST(str, STR_FREEZE)) return TRUE; return FALSE; } VALUE str_dup_frozen(str) VALUE str; { if (RSTRING(str)->orig && !FL_TEST(str, STR_NO_ORIG)) { return str_freeze(RSTRING(str)->orig); } if (FL_TEST(str, STR_FREEZE)) return str; return str_freeze(str_dup(str)); } VALUE str_taint(str) VALUE str; { if (TYPE(str) == T_STRING) { FL_SET(str, STR_TAINT); } return str; } VALUE str_tainted(str) VALUE str; { if (FL_TEST(str, STR_TAINT)) return TRUE; return FALSE; } VALUE str_resize(str, len) VALUE str; int len; { str_modify(str); if (len >= 0) { if (RSTRING(str)->len < len || RSTRING(str)->len - len > 1024) { REALLOC_N(RSTRING(str)->ptr, char, len + 1); } RSTRING(str)->len = len; RSTRING(str)->ptr[len] = '\0'; /* sentinel */ } return str; } VALUE str_cat(str, ptr, len) VALUE str; char *ptr; unsigned len; { if (len > 0) { str_modify(str); REALLOC_N(RSTRING(str)->ptr, char, RSTRING(str)->len + len + 1); if (ptr) memcpy(RSTRING(str)->ptr + RSTRING(str)->len, ptr, len); RSTRING(str)->len += len; RSTRING(str)->ptr[RSTRING(str)->len] = '\0'; /* sentinel */ } return str; } VALUE str_concat(str1, str2) VALUE str1, str2; { str2 = str_to_str(str2); str_cat(str1, RSTRING(str2)->ptr, RSTRING(str2)->len); return str1; } int str_hash(str) VALUE str; { register int len = RSTRING(str)->len; register char *p = RSTRING(str)->ptr; register int key = 0; if (RTEST(ignorecase)) { while (len--) { key = key*65599 + toupper(*p); p++; } } else { while (len--) { key = key*65599 + *p; p++; } } return key; } static VALUE str_hash_method(str) VALUE str; { int key = str_hash(str); return INT2FIX(key); } #define min(a,b) (((a)>(b))?(b):(a)) int str_cmp(str1, str2) VALUE str1, str2; { unsigned int len; int retval; if (RTEST(ignorecase)) { return str_cicmp(str1, str2); } len = min(RSTRING(str1)->len, RSTRING(str2)->len); retval = memcmp(RSTRING(str1)->ptr, RSTRING(str2)->ptr, len); if (retval == 0) { if (RSTRING(str1)->len == RSTRING(str2)->len) return 0; if (RSTRING(str1)->len > RSTRING(str2)->len) return 1; return -1; } if (retval == 0) return 0; if (retval > 0) return 1; return -1; } static VALUE str_equal(str1, str2) VALUE str1, str2; { if (TYPE(str2) != T_STRING) return FALSE; if (RSTRING(str1)->len == RSTRING(str2)->len && str_cmp(str1, str2) == 0) { return TRUE; } return FALSE; } static VALUE str_cmp_method(str1, str2) VALUE str1, str2; { int result; str2 = str_to_str(str2); result = str_cmp(str1, str2); return INT2FIX(result); } static VALUE str_match(x, y) VALUE x, y; { VALUE reg; int start; switch (TYPE(y)) { case T_REGEXP: return reg_match(y, x); case T_STRING: reg = reg_regcomp(y); start = reg_search(reg, x, 0, 0); if (start == -1) { return FALSE; } return INT2FIX(start); default: return rb_funcall(y, rb_intern("=~"), 1, x); } } static VALUE str_match2(str) VALUE str; { return reg_match2(reg_regcomp(str)); } static int str_index(str, sub, offset) VALUE str, sub; int offset; { char *s, *e, *p; int len; if (RSTRING(str)->len - offset < RSTRING(sub)->len) return -1; s = RSTRING(str)->ptr+offset; p = RSTRING(sub)->ptr; len = RSTRING(sub)->len; e = s + RSTRING(str)->len - len + 1; while (s < e) { if (*s == *(RSTRING(sub)->ptr) && memcmp(s, p, len) == 0) { return (s-(RSTRING(str)->ptr)); } s++; } return -1; } static VALUE str_index_method(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE 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 = reg_search(sub, str, pos, 0); break; case T_STRING: pos = str_index(str, sub, pos); break; case T_FIXNUM: { int c = FIX2INT(sub); int len = RSTRING(str)->len; char *p = RSTRING(str)->ptr; for (;pos= RSTRING(str)->len) pos = RSTRING(str)->len; } else { pos = RSTRING(str)->len; } switch (TYPE(sub)) { case T_REGEXP: pos = reg_search(sub, str, pos, 1); if (pos >= 0) return INT2FIX(pos); break; case T_STRING: /* substring longer than string */ if (pos > RSTRING(str)->len) return Qnil; sbeg = RSTRING(str)->ptr; s = sbeg + pos - RSTRING(sub)->len; t = RSTRING(sub)->ptr; len = RSTRING(sub)->len; while (sbeg <= s) { if (*s == *t && memcmp(s, t, len) == 0) { return INT2FIX(s - sbeg); } s--; } break; case T_FIXNUM: { int c = FIX2INT(sub); char *p = RSTRING(str)->ptr; for (;pos>=0;pos--) { if (p[pos] == c) return INT2FIX(pos); } return Qnil; } default: TypeError("Type mismatch: %s given", rb_class2name(CLASS_OF(sub))); } return Qnil; } static char succ_char(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 str_succ(orig) VALUE orig; { VALUE str, str2; char *sbeg, *s; char c = -1; str = str_new(RSTRING(orig)->ptr, RSTRING(orig)->len); sbeg = RSTRING(str)->ptr; s = sbeg + RSTRING(str)->len - 1; while (sbeg <= s) { if (ISALNUM(*s) && (c = succ_char(s)) == 0) break; s--; } if (s < sbeg) { if (c == -1 && RSTRING(str)->len > 0) { RSTRING(str)->ptr[RSTRING(str)->len-1] += 1; } else { str2 = str_new(0, RSTRING(str)->len+1); RSTRING(str2)->ptr[0] = c; memcpy(RSTRING(str2)->ptr+1, RSTRING(str)->ptr, RSTRING(str)->len); str = str2; } } if (str_tainted(orig)) { return str_taint(str); } return str; } static VALUE str_succ_bang(str) VALUE str; { str_modify(str); str_assign(str, str_succ(str)); return str; } VALUE str_upto(beg, end) VALUE beg, end; { VALUE current; end = str_to_str(end); if (RTEST(rb_funcall(beg, '>', 1, end))) return Qnil; current = beg; for (;;) { rb_yield(current); if (str_equal(current, end)) break; current = str_succ(current); if (RSTRING(current)->len > RSTRING(end)->len) break; } return Qnil; } static VALUE str_aref(str, indx) VALUE str; VALUE indx; { int idx; switch (TYPE(indx)) { case T_FIXNUM: idx = FIX2INT(indx); if (idx < 0) { idx = RSTRING(str)->len + idx; } if (idx < 0 || RSTRING(str)->len <= idx) { return Qnil; } return INT2FIX(RSTRING(str)->ptr[idx] & 0xff); case T_REGEXP: if (reg_match(indx, str)) return reg_last_match(backref_get()); return Qnil; case T_STRING: if (str_index(str, indx, 0) != -1) return indx; return Qnil; default: /* check if indx is Range */ { int beg, end; if (range_beg_end(indx, &beg, &end)) { return str_subseq(str, beg, end); } } IndexError("Invalid index for string"); } } static VALUE str_aref_method(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE arg1, arg2; if (rb_scan_args(argc, argv, "11", &arg1, &arg2) == 2) { return str_substr(str, NUM2INT(arg1), NUM2INT(arg2)); } return str_aref(str, arg1); } static void str_replace(str, beg, len, val) VALUE str, val; int beg, len; { if (len < RSTRING(val)->len) { /* expand string */ REALLOC_N(RSTRING(str)->ptr, char, RSTRING(str)->len+RSTRING(val)->len-len+1); } if (len != RSTRING(val)->len) { memmove(RSTRING(str)->ptr+beg+RSTRING(val)->len, RSTRING(str)->ptr+beg+len, RSTRING(str)->len-(beg+len)); } if (RSTRING(str)->len < beg && len < 0) { MEMZERO(RSTRING(str)->ptr+RSTRING(str)->len, char, -len); } memcpy(RSTRING(str)->ptr+beg, RSTRING(val)->ptr, RSTRING(val)->len); RSTRING(str)->len += RSTRING(val)->len - len; RSTRING(str)->ptr[RSTRING(str)->len] = '\0'; } /* str_replace2() understands negatice offset */ static void str_replace2(str, beg, end, val) VALUE str, val; int beg, end; { int len; if ((beg > 0 && end > 0 || beg < 0 && end < 0) && beg > end) { IndexError("end smaller than beg [%d..%d]", beg, end); } if (beg < 0) { beg = RSTRING(str)->len + beg; if (beg < 0) { beg = 0; } } if (RSTRING(str)->len <= beg) { beg = RSTRING(str)->len; } if (end < 0) { end = RSTRING(str)->len + end; if (end < 0) { end = 0; } } if (RSTRING(str)->len <= end) { end = RSTRING(str)->len - 1; } len = end - beg + 1; /* length of substring */ if (len < 0) { len = 0; } str_replace(str, beg, len, val); } static VALUE str_sub_s(str, pat, val, once) VALUE str, pat, val; int once; { VALUE result, repl; int beg, offset, n; struct re_registers *regs; switch (TYPE(pat)) { case T_REGEXP: break; case T_STRING: pat = reg_regcomp(pat); break; default: /* type failed */ Check_Type(pat, T_REGEXP); } val = obj_as_string(val); result = str_new(0,0); offset=0; n=0; while ((beg=reg_search(pat, str, offset, 0)) >= 0) { n++; regs = RMATCH(backref_get())->regs; str_cat(result, RSTRING(str)->ptr+offset, beg-offset); repl = reg_regsub(val, str, regs); str_cat(result, RSTRING(repl)->ptr, RSTRING(repl)->len); if (BEG(0) == END(0)) { int len = ismbchar(RSTRING(str)->ptr[END(0)])?2:1; /* * Always consume at least one character of the input string * in order to prevent infinite loops. */ if (RSTRING(str)->len > END(0)) { str_cat(result, RSTRING(str)->ptr+END(0), len); } offset = END(0)+len; } else { offset = END(0); } if (once) break; if (offset > STRLEN(str)) break; } if (n == 0) return Qnil; if (RSTRING(str)->len > offset) { str_cat(result, RSTRING(str)->ptr+offset, RSTRING(str)->len-offset); } if (str_tainted(val)) str_taint(result); return result; } static VALUE str_sub_f(str, pat, val, once) VALUE str; VALUE pat; VALUE val; int once; { VALUE result; str_modify(str); result = str_sub_s(str, pat, val, once); if (NIL_P(result)) return Qnil; str_assign(str, result); return str; } static VALUE str_sub_iter_s(str, pat, once) VALUE str; VALUE pat; int once; { VALUE val, match, result; int beg, offset, n; struct re_registers *regs; if (!iterator_p()) { ArgError("Wrong # of arguments(1 for 2)"); } switch (TYPE(pat)) { case T_REGEXP: break; case T_STRING: pat = reg_regcomp(pat); break; default: /* type failed */ Check_Type(pat, T_REGEXP); } result = str_new(0,0); n = 0; offset = 0; while ((beg=reg_search(pat, str, offset, 0)) >= 0) { n++; match = backref_get(); regs = RMATCH(match)->regs; str_cat(result, RSTRING(str)->ptr+offset, beg-offset); val = obj_as_string(rb_yield(reg_nth_match(0, match))); str_cat(result, RSTRING(val)->ptr, RSTRING(val)->len); if (BEG(0) == END(0)) { int len = ismbchar(RSTRING(str)->ptr[END(0)])?2:1; /* * Always consume at least one character of the input string * in order to prevent infinite loops. */ if (RSTRING(str)->len > END(0)) { str_cat(result, RSTRING(str)->ptr+END(0), len); } offset = END(0)+len; } else { offset = END(0); } if (once) break; if (offset > STRLEN(str)) break; } if (n == 0) return Qnil; if (RSTRING(str)->len > offset) { str_cat(result, RSTRING(str)->ptr+offset, RSTRING(str)->len-offset); } return result; } static VALUE str_sub_iter_f(str, pat, once) VALUE str; VALUE pat; int once; { VALUE result; str_modify(str); result = str_sub_iter_s(str, pat, once); if (NIL_P(result)) return Qnil; str_assign(str, result); return str; } static VALUE str_aset(str, indx, val) VALUE str; VALUE indx, val; { int idx, beg, end, offset; switch (TYPE(indx)) { case T_FIXNUM: idx = NUM2INT(indx); if (idx < 0) { idx = RSTRING(str)->len + idx; } if (idx < 0 || RSTRING(str)->len <= idx) { IndexError("index %d out of range [0..%d]", idx, RSTRING(str)->len-1); } if (TYPE(val) == T_STRING) { str_replace(str, idx, 1, val); } else { RSTRING(str)->ptr[idx] = NUM2INT(val) & 0xff; } return val; case T_REGEXP: str_sub_f(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) return Qnil; return val; default: /* check if indx is Range */ { int beg, end; if (range_beg_end(indx, &beg, &end)) { str_replace2(str, beg, end, str_to_str(val)); return val; } } IndexError("Invalid index for string"); } } static VALUE str_aset_method(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE arg1, arg2, arg3; str_modify(str); if (rb_scan_args(argc, argv, "21", &arg1, &arg2, &arg3) == 3) { int beg, len; arg3 = str_to_str(arg3); beg = NUM2INT(arg1); if (beg < 0) { beg = RSTRING(str)->len + beg; if (beg < 0) beg = 0; } len = NUM2INT(arg2); if (len < 0) IndexError("negative length %d", len); if (beg + len > RSTRING(str)->len) { len = RSTRING(str)->len - beg; } str_replace(str, beg, len, arg3); return arg3; } return str_aset(str, arg1, arg2); } static VALUE str_sub_bang(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE pat, val; if (rb_scan_args(argc, argv, "11", &pat, &val) == 1) { return str_sub_iter_f(str, pat, 1); } return str_sub_f(str, pat, val, 1); } static VALUE str_sub(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE pat, val, v; if (rb_scan_args(argc, argv, "11", &pat, &val) == 1) { v = str_sub_iter_s(str, pat, 1); } else { v = str_sub_s(str, pat, val, 1); } if (NIL_P(v)) return str_dup(str); return v; } static VALUE str_gsub_bang(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE pat, val; if (rb_scan_args(argc, argv, "11", &pat, &val) == 1) { return str_sub_iter_f(str, pat, 0); } return str_sub_f(str, pat, val, 0); } static VALUE str_gsub(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE pat, val, v; if (rb_scan_args(argc, argv, "11", &pat, &val) == 1) { v = str_sub_iter_s(str, pat, 0); } else { v = str_sub_s(str, pat, val, 0); } if (NIL_P(v)) return str_dup(str); return v; } static VALUE str_replace_method(str, str2) VALUE str, str2; { str2 = str_to_str(str2); str_modify(str); str_resize(str, RSTRING(str2)->len); memcpy(RSTRING(str)->ptr, RSTRING(str2)->ptr, RSTRING(str2)->len); if (str_tainted(str2)) str_taint(str); return str; } static VALUE uscore_get() { VALUE line; line = lastline_get(); if (TYPE(line) != T_STRING) { TypeError("$_ value need to be String (%s given)", rb_class2name(CLASS_OF(line))); } return line; } static VALUE f_sub_bang(argc, argv) int argc; VALUE *argv; { VALUE pat, val, line; line = uscore_get(); if (rb_scan_args(argc, argv, "11", &pat, &val) == 1) { return str_sub_iter_f(line, pat, 1); } return str_sub_f(line, pat, val, 1); } static VALUE f_sub(argc, argv) int argc; VALUE *argv; { VALUE pat, val, line, v; line = uscore_get(); if (rb_scan_args(argc, argv, "11", &pat, &val) == 1) { v = str_sub_iter_s(line, pat, 1); } else { v = str_sub_s(line, pat, val, 1); } if (!NIL_P(v)) { lastline_set(v); return v; } return line; } static VALUE f_gsub_bang(argc, argv) int argc; VALUE *argv; { VALUE pat, val, line; line = uscore_get(); if (rb_scan_args(argc, argv, "11", &pat, &val) == 1) { return str_sub_iter_f(line, pat, 0); } return str_sub_f(line, pat, val, 0); } static VALUE f_gsub(argc, argv) int argc; VALUE *argv; { VALUE pat, val, line, v; line = uscore_get(); if (rb_scan_args(argc, argv, "11", &pat, &val) == 1) { v = str_sub_iter_s(line, pat, 0); } else { v = str_sub_s(line, pat, val, 0); } if (NIL_P(v)) v = str_dup(line); lastline_set(v); return v; } static VALUE str_reverse_bang(str) VALUE str; { char *s, *e, *p, *q; s = RSTRING(str)->ptr; e = s + RSTRING(str)->len - 1; p = q = ALLOCA_N(char, RSTRING(str)->len); while (e >= s) { *p++ = *e--; } MEMCPY(RSTRING(str)->ptr, q, char, RSTRING(str)->len); return str; } static VALUE str_reverse(str) VALUE str; { VALUE obj; char *s, *e, *p; if (RSTRING(str)->len <= 1) return str; obj = str_new(0, RSTRING(str)->len); s = RSTRING(str)->ptr; e = s + RSTRING(str)->len - 1; p = RSTRING(obj)->ptr; while (e >= s) { *p++ = *e--; } return obj; } static VALUE str_include(str, arg) VALUE str, arg; { int i; if (FIXNUM_P(arg)) { int c = FIX2INT(arg); int len = RSTRING(str)->len; char *p = RSTRING(str)->ptr; for (i=0; iptr, 10); } static VALUE str_to_f(str) VALUE str; { double f = atof(RSTRING(str)->ptr); return float_new(f); } static VALUE str_to_s(str) VALUE str; { return str; } VALUE str_inspect(str) VALUE str; { #define STRMAX 80 char buf[STRMAX]; char *p, *pend; char *b; p = RSTRING(str)->ptr; pend = p + RSTRING(str)->len; b = buf; *b++ = '"'; #define CHECK(n) {\ if (b - buf + n > STRMAX - 4) {\ strcpy(b, "...");\ b += 3;\ break;\ }\ } while (p < pend) { char c = *p++; if (ismbchar(c) && p < pend) { CHECK(2); *b++ = c; *b++ = *p++; } else if ((c & 0x80) && current_mbctype != MBCTYPE_EUC) { CHECK(1); *b++ = c; } else if (c == '"') { CHECK(2); *b++ = '\\'; *b++ = '"'; } else if (c == '\\') { CHECK(2); *b++ = '\\'; *b++ = '\\'; } else if (ISPRINT(c)) { CHECK(1); *b++ = c; } 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 == '\013') { CHECK(2); *b++ = '\\'; *b++ = 'v'; } else if (c == '\007') { CHECK(2); *b++ = '\\'; *b++ = 'a'; } else if (c == 033) { CHECK(2); *b++ = '\\'; *b++ = 'e'; } else { CHECK(4); *b++ = '\\'; sprintf(b, "%03o", c & 0377); b += 3; } } *b++ = '"'; return str_new(buf, b - buf); } VALUE str_dump(str) VALUE str; { int len; char *p, *pend; char *q, *qend; VALUE result; len = 2; /* "" */ p = RSTRING(str)->ptr; pend = p + RSTRING(str)->len; while (p < pend) { char c = *p++; switch (c) { case '"': case '\'': case '\n': case '\r': case '\t': case '\f': case '\013': case '\007': case '\033': len += 2; break; default: if (ISPRINT(c)) { len++; } else { len += 4; /* \nnn */ } break; } } result = str_new(0, len); p = RSTRING(str)->ptr; pend = p + RSTRING(str)->len; q = RSTRING(result)->ptr; qend = q + len; *q++ = '"'; while (p < pend) { char c = *p++; if (c == '"' || c == '\\') { *q++ = '\\'; *q++ = c; } else if (ISPRINT(c)) { *q++ = c; } else if (c == '\n') { *q++ = '\\'; *q++ = 'n'; } else if (c == '\r') { *q++ = '\\'; *q++ = 'r'; } else if (c == '\t') { *q++ = '\\'; *q++ = 't'; } else if (c == '\f') { *q++ = '\\'; *q++ = 'f'; } else if (c == '\13') { *q++ = '\\'; *q++ = 'v'; } else if (c == '\007') { *q++ = '\\'; *q++ = 'a'; } else if (c == 033) { *q++ = '\\'; *q++ = 'e'; } else { *q++ = '\\'; sprintf(q, "%03o", c&0xff); q += 3; } } *q++ = '"'; return result; } static VALUE str_upcase_bang(str) VALUE str; { char *s, *send; int modify = 0; str_modify(str); s = RSTRING(str)->ptr; send = s + RSTRING(str)->len; while (s < send) { if (ismbchar(*s)) { s++; } else if (islower(*s)) { *s = toupper(*s); modify = 1; } s++; } if (modify) return str; return Qnil; } static VALUE str_upcase(str) VALUE str; { VALUE val = str_upcase_bang(str = str_dup(str)); if (NIL_P(val)) return str; return val; } static VALUE str_downcase_bang(str) VALUE str; { char *s, *send; int modify = 0; str_modify(str); s = RSTRING(str)->ptr; send = s + RSTRING(str)->len; while (s < send) { if (ismbchar(*s)) { s++; } else if (ISUPPER(*s)) { *s = tolower(*s); modify = 1; } s++; } if (modify) return str; return Qnil; } static VALUE str_downcase(str) VALUE str; { VALUE val = str_downcase_bang(str = str_dup(str)); if (NIL_P(val)) return str; return val; } static VALUE str_capitalize_bang(str) VALUE str; { char *s, *send; int modify = 0; str_modify(str); s = RSTRING(str)->ptr; send = s + RSTRING(str)->len; if (ISLOWER(*s)) { *s = toupper(*s); modify = 1; } while (++s < send) { if (ismbchar(*s)) { s++; } else if (ISUPPER(*s)) { *s = tolower(*s); modify = 1; } } if (modify) return str; return Qnil; } static VALUE str_capitalize(str) VALUE str; { VALUE val = str_capitalize_bang(str = str_dup(str)); if (NIL_P(val)) return str; return val; } static VALUE str_swapcase_bang(str) VALUE str; { char *s, *send; int modify = 0; str_modify(str); s = RSTRING(str)->ptr; send = s + RSTRING(str)->len; while (s < send) { if (ismbchar(*s)) { s++; } else if (ISUPPER(*s)) { *s = tolower(*s); modify = 1; } else if (ISLOWER(*s)) { *s = toupper(*s); modify = 1; } s++; } if (modify) return str; return Qnil; } static VALUE str_swapcase(str) VALUE str; { VALUE val = str_swapcase_bang(str = str_dup(str)); if (NIL_P(val)) return str; return val; } typedef unsigned char *USTR; struct tr { int gen, now, max; char *p, *pend; }; static int trnext(t) struct tr *t; { for (;;) { if (!t->gen) { if (t->p == t->pend) return -1; t->now = *(USTR)t->p++; if (t->p < t->pend && *t->p == '-') { t->p++; if (t->p < t->pend) { if (t->now > *(USTR)t->p) { t->p++; continue; } t->gen = 1; t->max = *(USTR)t->p++; } } return t->now; } else if (++t->now < t->max) { return t->now; } else { t->gen = 0; return t->max; } } } static VALUE str_delete_bang _((VALUE,VALUE)); static VALUE tr_trans(str, src, repl, sflag) VALUE str, src, repl; int sflag; { struct tr trsrc, trrepl; int cflag = 0; char trans[256]; int i, c, c0, modify = 0; char *s, *send; str_modify(str); src = str_to_str(src); trsrc.p = RSTRING(src)->ptr; trsrc.pend = trsrc.p + RSTRING(src)->len; if (RSTRING(src)->len > 2 && RSTRING(src)->ptr[0] == '^') { cflag++; trsrc.p++; } repl = str_to_str(repl); if (RSTRING(repl)->len == 0) return str_delete_bang(str, src); trrepl.p = RSTRING(repl)->ptr; trrepl.pend = trrepl.p + RSTRING(repl)->len; trsrc.gen = trrepl.gen = 0; trsrc.now = trrepl.now = 0; trsrc.max = trrepl.max = 0; if (cflag) { for (i=0; i<256; i++) { trans[i] = 1; } while ((c = trnext(&trsrc)) >= 0) { trans[c & 0xff] = 0; } for (i=0; i<256; i++) { if (trans[i] == 0) { trans[i] = i; } else { c = trnext(&trrepl); if (c == -1) { trans[i] = trrepl.now; } else { trans[i] = c; } } } } else { char r; for (i=0; i<256; i++) { trans[i] = i; } while ((c = trnext(&trsrc)) >= 0) { r = trnext(&trrepl); if (r == -1) r = trrepl.now; trans[c & 0xff] = r; } } s = RSTRING(str)->ptr; send = s + RSTRING(str)->len; c0 = -1; if (sflag) { char *t = s; while (s < send) { c = trans[*s++ & 0xff] & 0xff; if (s[-1] == c || c != c0) { c0 = (s[-1] == c)?-1:c; if (*t != c) { *t = c; modify = 1; } *t++ = c; } } if (RSTRING(str)->len > (t - RSTRING(str)->ptr)) { RSTRING(str)->len = (t - RSTRING(str)->ptr); modify = 1; *t = '\0'; } } else { while (s < send) { c = trans[*s & 0xff] & 0xff; if (*s != c) { *s = c; modify = 1; } s++; } } if (modify) return str; return Qnil; } static VALUE str_tr_bang(str, src, repl) VALUE str, src, repl; { return tr_trans(str, src, repl, 0); } static VALUE str_tr(str, src, repl) VALUE str, src, repl; { VALUE val = tr_trans(str = str_dup(str), src, repl, 0); if (NIL_P(val)) return str; return val; } static void tr_setup_table(str, table) VALUE str; char table[256]; { struct tr tr; int i, cflag = 0; int c; tr.p = RSTRING(str)->ptr; tr.pend = tr.p + RSTRING(str)->len; tr.gen = tr.now = tr.max = 0; if (RSTRING(str)->len > 1 && RSTRING(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 str_delete_bang(str1, str2) VALUE str1, str2; { char *s, *send, *t; char squeez[256]; int modify = 0; str2 = str_to_str(str2); tr_setup_table(str2, squeez); str_modify(str1); s = t = RSTRING(str1)->ptr; send = s + RSTRING(str1)->len; while (s < send) { if (squeez[*s & 0xff]) modify = 1; else *t++ = *s; s++; } *t = '\0'; RSTRING(str1)->len = t - RSTRING(str1)->ptr; if (modify) return str1; return Qnil; } static VALUE str_delete(str1, str2) VALUE str1, str2; { VALUE val = str_delete_bang(str1 = str_dup(str1), str2); if (NIL_P(val)) return str1; return val; } static VALUE tr_squeeze(str1, str2) VALUE str1, str2; { char squeez[256]; char *s, *send, *t; char c, save, modify = 0; if (!NIL_P(str2)) { tr_setup_table(str2, squeez); } else { int i; for (i=0; i<256; i++) { squeez[i] = 1; } } str_modify(str1); s = t = RSTRING(str1)->ptr; send = s + RSTRING(str1)->len; save = -1; while (s < send) { c = *s++ & 0xff; if (c != save || !squeez[c & 0xff]) { *t++ = save = c; modify = 1; } } *t = '\0'; RSTRING(str1)->len = t - RSTRING(str1)->ptr; if (modify) return str1; return Qnil; } static VALUE str_squeeze_bang(argc, argv, str1) int argc; VALUE *argv; VALUE str1; { VALUE str2; if (rb_scan_args(argc, argv, "01", &str2) == 1) { str2 = str_to_str(str2); } return tr_squeeze(str1, str2); } static VALUE str_squeeze(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE val = str_squeeze_bang(argc, argv, str = str_dup(str)); if (NIL_P(val)) return str; return val; } static VALUE str_tr_s_bang(str, src, repl) VALUE str, src, repl; { return tr_trans(str, src, repl, 1); } static VALUE str_tr_s(str, src, repl) VALUE str, src, repl; { VALUE val = tr_trans(str = str_dup(str), src, repl, 1); if (NIL_P(val)) return str; return val; } static VALUE str_split_method(argc, argv, str) int argc; VALUE *argv; VALUE str; { extern VALUE FS; VALUE spat; VALUE limit; int char_sep = -1; int beg, end, i, lim = 0; VALUE result, tmp; if (rb_scan_args(argc, argv, "02", &spat, &limit) == 2) { lim = NUM2INT(limit); if (lim <= 0) limit = Qnil; else if (lim == 1) return ary_new3(1, str); i = 1; } if (argc == 0) { if (!NIL_P(FS)) { spat = FS; goto fs_set; } char_sep = ' '; } else { switch (TYPE(spat)) { case T_STRING: fs_set: if (STRLEN(spat) == 1) { char_sep = (unsigned char)RSTRING(spat)->ptr[0]; } else { spat = reg_regcomp(spat); } break; case T_REGEXP: break; default: ArgError("split(): bad separator"); } } result = ary_new(); beg = 0; if (char_sep >= 0) { char *ptr = RSTRING(str)->ptr; int len = RSTRING(str)->len; char *eptr = ptr + len; if (char_sep == ' ') { /* AWK emulation */ int skip = 1; for (end = beg = 0; ptr= 0) { regs = RMATCH(backref_get())->regs; if (start == end && BEG(0) == END(0)) { if (last_null == 1) { if (ismbchar(RSTRING(str)->ptr[beg])) ary_push(result, str_substr(str, beg, 2)); else ary_push(result, str_substr(str, beg, 1)); beg = start; } else { start += ismbchar(RSTRING(str)->ptr[start])?2:1; last_null = 1; continue; } } else { ary_push(result, str_substr(str, beg, end-beg)); beg = start = END(0); } last_null = 0; for (idx=1; idx < regs->num_regs; idx++) { if (BEG(idx) == -1) tmp = Qnil; else if (BEG(idx) == END(idx)) tmp = str_new(0, 0); else tmp = str_subseq(str, BEG(idx), END(idx)-1); ary_push(result, tmp); } if (!NIL_P(limit) && lim <= ++i) break; } } if (!NIL_P(limit) || RSTRING(str)->len > beg || lim < 0) { ary_push(result, str_subseq(str, beg, -1)); } if (NIL_P(limit) && lim == 0) { while (RARRAY(result)->len > 0 && RSTRING(RARRAY(result)->ptr[RARRAY(result)->len-1])->len == 0) ary_pop(result); } return result; } VALUE str_split(str, sep0) VALUE str; char *sep0; { VALUE sep; str = str_to_str(str); sep = str_new2(sep0); return str_split_method(1, &sep, str); } static VALUE f_split(argc, argv) int argc; VALUE *argv; { return str_split_method(argc, argv, uscore_get()); } static VALUE str_each_line(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE rs; int newline; int rslen; char *p = RSTRING(str)->ptr, *pend = p + RSTRING(str)->len, *s; char *ptr = p; int len = RSTRING(str)->len; VALUE line; if (rb_scan_args(argc, argv, "01", &rs) == 0) { rs = RS; } if (NIL_P(rs)) { rb_yield(str); return Qnil; } rs = str_to_str(rs); 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++; } if (p[-1] == newline && (rslen <= 1 || memcmp(RSTRING(rs)->ptr, p-rslen, rslen) == 0)) { line = str_new(s, p - s); lastline_set(line); rb_yield(line); if (RSTRING(str)->ptr != ptr || RSTRING(str)->len != len) Fail("string modified"); s = p; } } if (s != pend) { line = str_new(s, p - s); lastline_set(line); rb_yield(line); } return Qnil; } static VALUE str_each_byte(str) struct RString* str; { int i; for (i=0; ilen; i++) { rb_yield(INT2FIX(RSTRING(str)->ptr[i] & 0xff)); } return Qnil; } static VALUE str_chop_bang(str) VALUE str; { if (RSTRING(str)->len > 0) { str_modify(str); RSTRING(str)->len--; if (RSTRING(str)->ptr[RSTRING(str)->len] == '\n') { if (RSTRING(str)->len > 0 && RSTRING(str)->ptr[RSTRING(str)->len-1] == '\r') { RSTRING(str)->len--; } } RSTRING(str)->ptr[RSTRING(str)->len] = '\0'; return str; } return Qnil; } static VALUE str_chop(str) VALUE str; { VALUE val = str_chop_bang(str = str_dup(str)); if (NIL_P(val)) return str; return val; } static VALUE f_chop_bang(str) VALUE str; { return str_chop_bang(uscore_get()); } static VALUE f_chop() { VALUE str = str_dup(uscore_get()); VALUE val; val = str_chop_bang(str); if (NIL_P(val)) return str; lastline_set(val); return val; } static VALUE str_chomp_bang(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE rs; int newline; int rslen; char *p = RSTRING(str)->ptr; int len = RSTRING(str)->len; if (rb_scan_args(argc, argv, "01", &rs) == 0) { rs = RS; } if (NIL_P(rs)) return Qnil; rs = str_to_str(rs); rslen = RSTRING(rs)->len; if (rslen == 0) { while (len>0 && p[len-1] == '\n') { len--; } if (len < RSTRING(str)->len) { RSTRING(str)->len = len; RSTRING(str)->ptr[len] = '\0'; return str; } return Qnil; } if (rslen > len) return Qnil; newline = RSTRING(rs)->ptr[rslen-1]; if (p[len-1] == newline && (rslen <= 1 || memcmp(RSTRING(rs)->ptr, p+len-rslen, rslen) == 0)) { RSTRING(str)->len -= rslen; RSTRING(str)->ptr[RSTRING(str)->len] = '\0'; return str; } return Qnil; } static VALUE str_chomp(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE val = str_chomp_bang(argc, argv, str = str_dup(str)); if (NIL_P(val)) return str; return val; } static VALUE f_chomp_bang(argc, argv) int argc; VALUE *argv; { return str_chomp_bang(argc, argv, uscore_get()); } static VALUE f_chomp(argc, argv) int argc; VALUE *argv; { VALUE str = str_dup(uscore_get()); VALUE val = str_chomp_bang(argc, argv, str); if (NIL_P(val)) return str; lastline_set(val); return val; } static VALUE str_strip_bang(str) VALUE str; { char *s, *t, *e; str_modify(str); s = RSTRING(str)->ptr; e = t = s + RSTRING(str)->len; /* remove spaces at head */ while (s < t && ISSPACE(*s)) s++; /* remove trailing spaces */ t--; while (s <= t && ISSPACE(*t)) t--; t++; RSTRING(str)->len = t-s; if (s > RSTRING(str)->ptr) { char *p = RSTRING(str)->ptr; RSTRING(str)->ptr = ALLOC_N(char, RSTRING(str)->len+1); memcpy(RSTRING(str)->ptr, s, RSTRING(str)->len); RSTRING(str)->ptr[RSTRING(str)->len] = '\0'; free(p); } else if (t < e) { RSTRING(str)->ptr[RSTRING(str)->len] = '\0'; } else { return Qnil; } return str; } static VALUE str_strip(str) VALUE str; { VALUE val = str_strip_bang(str = str_dup(str)); if (NIL_P(val)) return str; return val; } static VALUE scan_once(str, pat, start) VALUE str, pat; int *start; { VALUE result, match; struct re_registers *regs; int i; if (reg_search(pat, str, *start, 0) >= 0) { match = backref_get(); regs = RMATCH(match)->regs; if (BEG(0) == END(0)) { /* * Always consume at least one character of the input string */ *start = END(0)+(ismbchar(RSTRING(str)->ptr[END(0)])?2:1); } else { *start = END(0); } if (regs->num_regs == 1) { return reg_nth_match(0, match); } result = ary_new2(regs->num_regs); for (i=1; i < regs->num_regs; i++) { ary_push(result, reg_nth_match(i, match)); } return result; } return Qnil; } static VALUE str_scan(str, pat) VALUE str, pat; { VALUE result; int start = 0; switch (TYPE(pat)) { case T_STRING: pat = reg_regcomp(pat); break; case T_REGEXP: break; default: Check_Type(pat, T_REGEXP); } if (!iterator_p()) { VALUE ary = ary_new(); while (!NIL_P(result = scan_once(str, pat, &start))) { ary_push(ary, result); } return ary; } while (!NIL_P(result = scan_once(str, pat, &start))) { rb_yield(result); } return Qnil; } static VALUE str_hex(str) VALUE str; { return str2inum(RSTRING(str)->ptr, 16); } static VALUE str_oct(str) VALUE str; { int base = 8; if (RSTRING(str)->len > 2 && RSTRING(str)->ptr[0] == '0' && (RSTRING(str)->ptr[1] == 'x' || RSTRING(str)->ptr[1] == 'X')) { base = 16; } return str2inum(RSTRING(str)->ptr, base); } static VALUE str_crypt(str, salt) VALUE str, salt; { extern char *crypt(); salt = str_to_str(salt); if (RSTRING(salt)->len < 2) ArgError("salt too short(need >2 bytes)"); return str_new2(crypt(RSTRING(str)->ptr, RSTRING(salt)->ptr)); } static VALUE str_intern(str) VALUE str; { ID id; if (strlen(RSTRING(str)->ptr) != RSTRING(str)->len) ArgError("string contains `\\0'"); id = rb_intern(RSTRING(str)->ptr); return INT2FIX(id); } static VALUE str_sum(argc, argv, str) int argc; VALUE *argv; VALUE str; { VALUE vbits; int bits; char *p, *pend; if (rb_scan_args(argc, argv, "01", &vbits) == 0) { bits = 16; } else bits = NUM2INT(vbits); p = RSTRING(str)->ptr; pend = p + RSTRING(str)->len; if (bits > sizeof(long)*CHAR_BIT) { 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((unsigned int)*p)); p++; } res = rb_funcall(res, '&', 1, mod); return res; } else { unsigned int res = 0; unsigned int mod = (1<len >= width) return str; res = str_new(0, width); memcpy(RSTRING(res)->ptr, RSTRING(str)->ptr, RSTRING(str)->len); p = RSTRING(res)->ptr + RSTRING(str)->len; pend = RSTRING(res)->ptr + width; while (p < pend) { *p++ = ' '; } return res; } static VALUE str_rjust(str, w) VALUE str; VALUE w; { int width = NUM2INT(w); VALUE res; char *p, *pend; if (width < 0 || RSTRING(str)->len >= width) return str; res = str_new(0, width); p = RSTRING(res)->ptr; pend = p + width - RSTRING(str)->len; while (p < pend) { *p++ = ' '; } memcpy(pend, RSTRING(str)->ptr, RSTRING(str)->len); return res; } static VALUE str_center(str, w) VALUE str; VALUE w; { int width = NUM2INT(w); VALUE res; char *p, *pend; int n; if (width < 0 || RSTRING(str)->len >= width) return str; res = str_new(0, width); n = (width - RSTRING(str)->len)/2; p = RSTRING(res)->ptr; pend = p + n; while (p < pend) { *p++ = ' '; } memcpy(pend, RSTRING(str)->ptr, RSTRING(str)->len); p = pend + RSTRING(str)->len; pend = RSTRING(res)->ptr + width; while (p < pend) { *p++ = ' '; } return res; } void Init_String() { cString = rb_define_class("String", cObject); rb_include_module(cString, mComparable); rb_include_module(cString, mEnumerable); rb_define_singleton_method(cString, "new", str_s_new, 1); rb_define_method(cString, "clone", str_clone, 0); rb_define_method(cString, "dup", str_dup, 0); rb_define_method(cString, "<=>", str_cmp_method, 1); rb_define_method(cString, "==", str_equal, 1); rb_define_method(cString, "===", str_equal, 1); rb_define_method(cString, "eql?", str_equal, 1); rb_define_method(cString, "hash", str_hash_method, 0); rb_define_method(cString, "+", str_plus, 1); rb_define_method(cString, "*", str_times, 1); rb_define_method(cString, "%", str_format, 1); rb_define_method(cString, "[]", str_aref_method, -1); rb_define_method(cString, "[]=", str_aset_method, -1); rb_define_method(cString, "length", str_length, 0); rb_define_alias(cString, "size", "length"); rb_define_method(cString, "empty?", str_empty, 0); rb_define_method(cString, "=~", str_match, 1); rb_define_method(cString, "~", str_match2, 0); rb_define_method(cString, "succ", str_succ, 0); rb_define_method(cString, "succ!", str_succ_bang, 0); rb_define_method(cString, "next", str_succ, 0); rb_define_method(cString, "next!", str_succ_bang, 0); rb_define_method(cString, "upto", str_upto, 1); rb_define_method(cString, "index", str_index_method, -1); rb_define_method(cString, "rindex", str_rindex, -1); rb_define_method(cString, "replace", str_replace_method, 1); rb_define_method(cString, "freeze", str_freeze, 0); rb_define_method(cString, "frozen?", str_frozen_p, 0); rb_define_method(cString, "taint", str_taint, 0); rb_define_method(cString, "tainted?", str_tainted, 0); rb_define_method(cString, "to_i", str_to_i, 0); rb_define_method(cString, "to_f", str_to_f, 0); rb_define_method(cString, "to_s", str_to_s, 0); rb_define_method(cString, "to_str", str_to_s, 0); rb_define_method(cString, "inspect", str_inspect, 0); rb_define_method(cString, "dump", str_dump, 0); rb_define_method(cString, "upcase", str_upcase, 0); rb_define_method(cString, "downcase", str_downcase, 0); rb_define_method(cString, "capitalize", str_capitalize, 0); rb_define_method(cString, "swapcase", str_swapcase, 0); rb_define_method(cString, "upcase!", str_upcase_bang, 0); rb_define_method(cString, "downcase!", str_downcase_bang, 0); rb_define_method(cString, "capitalize!", str_capitalize_bang, 0); rb_define_method(cString, "swapcase!", str_swapcase_bang, 0); rb_define_method(cString, "hex", str_hex, 0); rb_define_method(cString, "oct", str_oct, 0); rb_define_method(cString, "split", str_split_method, -1); rb_define_method(cString, "reverse", str_reverse, 0); rb_define_method(cString, "reverse!", str_reverse_bang, 0); rb_define_method(cString, "concat", str_concat, 1); rb_define_method(cString, "<<", str_concat, 1); rb_define_method(cString, "crypt", str_crypt, 1); rb_define_method(cString, "intern", str_intern, 0); rb_define_method(cString, "include?", str_include, 1); rb_define_method(cString, "scan", str_scan, 1); rb_define_method(cString, "ljust", str_ljust, 1); rb_define_method(cString, "rjust", str_rjust, 1); rb_define_method(cString, "center", str_center, 1); rb_define_method(cString, "sub", str_sub, -1); rb_define_method(cString, "gsub", str_gsub, -1); rb_define_method(cString, "chop", str_chop, 0); rb_define_method(cString, "chomp", str_chomp, -1); rb_define_method(cString, "strip", str_strip, 0); rb_define_method(cString, "sub!", str_sub_bang, -1); rb_define_method(cString, "gsub!", str_gsub_bang, -1); rb_define_method(cString, "strip!", str_strip_bang, 0); rb_define_method(cString, "chop!", str_chop_bang, 0); rb_define_method(cString, "chomp!", str_chomp_bang, -1); rb_define_method(cString, "tr", str_tr, 2); rb_define_method(cString, "tr_s", str_tr_s, 2); rb_define_method(cString, "delete", str_delete, 1); rb_define_method(cString, "squeeze", str_squeeze, -1); rb_define_method(cString, "tr!", str_tr_bang, 2); rb_define_method(cString, "tr_s!", str_tr_s_bang, 2); rb_define_method(cString, "delete!", str_delete_bang, 1); rb_define_method(cString, "squeeze!", str_squeeze_bang, -1); rb_define_method(cString, "each_line", str_each_line, -1); rb_define_method(cString, "each", str_each_line, -1); rb_define_method(cString, "each_byte", str_each_byte, 0); rb_define_method(cString, "sum", str_sum, -1); rb_define_global_function("sub", f_sub, -1); rb_define_global_function("gsub", f_gsub, -1); rb_define_global_function("sub!", f_sub_bang, -1); rb_define_global_function("gsub!", f_gsub_bang, -1); rb_define_global_function("chop", f_chop, 0); rb_define_global_function("chop!", f_chop_bang, 0); rb_define_global_function("chomp", f_chomp, -1); rb_define_global_function("chomp!", f_chomp_bang, -1); rb_define_global_function("split", f_split, -1); pr_str = rb_intern("to_s"); } ruby-1.2.3/struct.c100644 774 145 25347 6571154266 12272 0ustar matzNaCl/************************************************ struct.c - $Author: matz $ $Date: 1998/08/27 03:55:34 $ created at: Tue Mar 22 18:44:30 JST 1995 ************************************************/ #include "ruby.h" #ifdef USE_CWGUSI #include #endif VALUE cStruct; static VALUE class_of(obj) VALUE obj; { obj = CLASS_OF(obj); if (FL_TEST(obj, FL_SINGLETON)) return RCLASS(obj)->super; return obj; } static VALUE struct_s_members(obj) VALUE obj; { VALUE member, ary; VALUE *p, *pend; member = rb_iv_get(obj, "__member__"); if (NIL_P(member)) { Bug("non-initialized struct"); } ary = ary_new2(RARRAY(member)->len); p = RARRAY(member)->ptr; pend = p + RARRAY(member)->len; while (p < pend) { ary_push(ary, str_new2(rb_id2name(FIX2INT(*p)))); p++; } return ary; } static VALUE struct_members(obj) VALUE obj; { return struct_s_members(class_of(obj)); } VALUE struct_getmember(obj, id) VALUE obj; ID id; { VALUE member, slot; int i; member = rb_iv_get(class_of(obj), "__member__"); if (NIL_P(member)) { Bug("non-initialized struct"); } slot = INT2FIX(id); for (i=0; ilen; i++) { if (RARRAY(member)->ptr[i] == slot) { return RSTRUCT(obj)->ptr[i]; } } NameError("%s is not struct member", rb_id2name(id)); /* not reached */ } static VALUE struct_ref(obj) VALUE obj; { return struct_getmember(obj, rb_frame_last_func()); } static VALUE struct_ref0(obj) VALUE obj; {return RSTRUCT(obj)->ptr[0];} static VALUE struct_ref1(obj) VALUE obj; {return RSTRUCT(obj)->ptr[1];} static VALUE struct_ref2(obj) VALUE obj; {return RSTRUCT(obj)->ptr[2];} static VALUE struct_ref3(obj) VALUE obj; {return RSTRUCT(obj)->ptr[3];} static VALUE struct_ref4(obj) VALUE obj; {return RSTRUCT(obj)->ptr[4];} static VALUE struct_ref5(obj) VALUE obj; {return RSTRUCT(obj)->ptr[5];} static VALUE struct_ref6(obj) VALUE obj; {return RSTRUCT(obj)->ptr[6];} static VALUE struct_ref7(obj) VALUE obj; {return RSTRUCT(obj)->ptr[7];} static VALUE struct_ref8(obj) VALUE obj; {return RSTRUCT(obj)->ptr[8];} static VALUE struct_ref9(obj) VALUE obj; {return RSTRUCT(obj)->ptr[9];} VALUE (*ref_func[10])() = { struct_ref0, struct_ref1, struct_ref2, struct_ref3, struct_ref4, struct_ref5, struct_ref6, struct_ref7, struct_ref8, struct_ref9, }; static VALUE struct_set(obj, val) VALUE obj, val; { VALUE member, slot; int i; member = rb_iv_get(class_of(obj), "__member__"); if (NIL_P(member)) { Fatal("non-initialized struct"); } for (i=0; ilen; i++) { slot = RARRAY(member)->ptr[i]; if (id_attrset(FIX2INT(slot)) == rb_frame_last_func()) { return RSTRUCT(obj)->ptr[i] = val; } } NameError("not struct member"); /* not reached */ } static VALUE make_struct(name, member, klass) VALUE name, member, klass; { VALUE nstr; ID id; int i; if (NIL_P(name)) { nstr = class_new(klass); } else { char *cname = STR2CSTR(name); id = rb_intern(cname); if (!rb_is_const_id(id)) { NameError("identifier %s needs to be constant", cname); } nstr = rb_define_class_under(klass, cname, klass); } rb_iv_set(nstr, "__size__", INT2FIX(RARRAY(member)->len)); rb_iv_set(nstr, "__member__", member); rb_define_singleton_method(nstr, "new", struct_alloc, -2); rb_define_singleton_method(nstr, "[]", struct_alloc, -2); rb_define_singleton_method(nstr, "members", struct_s_members, 0); for (i=0; i< RARRAY(member)->len; i++) { ID id = FIX2INT(RARRAY(member)->ptr[i]); if (i<10) { rb_define_method_id(nstr, id, ref_func[i], 0); } else { rb_define_method_id(nstr, id, struct_ref, 0); } rb_define_method_id(nstr, id_attrset(id), struct_set, 1); } return nstr; } #ifdef HAVE_STDARG_PROTOTYPES #include #define va_init_list(a,b) va_start(a,b) #else #include #define va_init_list(a,b) va_start(a) #endif VALUE #ifdef HAVE_STDARG_PROTOTYPES struct_define(char *name, ...) #else struct_define(name, va_alist) char *name; va_dcl #endif { va_list ar; VALUE nm, ary; char *mem; nm = str_new2(name); ary = ary_new(); va_init_list(ar, name); while (mem = va_arg(ar, char*)) { ID slot = rb_intern(mem); ary_push(ary, INT2FIX(slot)); } va_end(ar); return make_struct(nm, ary, cStruct); } static VALUE struct_s_def(argc, argv, klass) int argc; VALUE *argv; { VALUE name, rest; int i; VALUE st; rb_scan_args(argc, argv, "1*", &name, &rest); for (i=0; ilen; i++) { ID id = rb_to_id(RARRAY(rest)->ptr[i]); RARRAY(rest)->ptr[i] = INT2FIX(id); } st = make_struct(name, rest, klass); obj_call_init(st); return st; } VALUE struct_alloc(klass, values) VALUE klass, values; { VALUE size; int n; size = rb_iv_get(klass, "__size__"); n = FIX2INT(size); if (n < RARRAY(values)->len) { ArgError("struct size differs"); } else { NEWOBJ(st, struct RStruct); OBJSETUP(st, klass, T_STRUCT); st->len = 0; /* avoid GC crashing */ st->ptr = ALLOC_N(VALUE, n); st->len = n; MEMCPY(st->ptr, RARRAY(values)->ptr, VALUE, RARRAY(values)->len); memclear(st->ptr+RARRAY(values)->len, n-RARRAY(values)->len); obj_call_init((VALUE)st); return (VALUE)st; } /* not reached */ } VALUE #ifdef HAVE_STDARG_PROTOTYPES struct_new(VALUE klass, ...) #else struct_new(klass, va_alist) VALUE klass; va_dcl #endif { VALUE val, mem; int size; va_list args; val = rb_iv_get(klass, "__size__"); size = FIX2INT(val); mem = ary_new(); va_init_list(args, klass); while (size--) { val = va_arg(args, VALUE); ary_push(mem, val); } va_end(args); return struct_alloc(klass, mem); } static VALUE struct_each(s) VALUE s; { int i; for (i=0; ilen; i++) { rb_yield(RSTRUCT(s)->ptr[i]); } return Qnil; } static VALUE struct_to_s(s) VALUE s; { char *name, *buf; name = rb_class2name(CLASS_OF(s)); buf = ALLOCA_N(char, strlen(name)+1); sprintf(buf, "%s", name); return str_new2(buf); } static VALUE struct_inspect(s) VALUE s; { char *name = rb_class2name(CLASS_OF(s)); VALUE str, member; int i; member = rb_iv_get(CLASS_OF(s), "__member__"); if (NIL_P(member)) { Fatal("non-initialized struct"); } str = str_new2("#<"); str_cat(str, name, strlen(name)); str_cat(str, " ", 1); for (i=0; ilen; i++) { VALUE str2, slot; char *p; if (i > 0) { str_cat(str, ", ", 2); } slot = RARRAY(member)->ptr[i]; p = rb_id2name(FIX2INT(slot)); str_cat(str, p, strlen(p)); str_cat(str, "=", 1); str2 = rb_inspect(RSTRUCT(s)->ptr[i]); str_cat(str, RSTRING(str2)->ptr, RSTRING(str2)->len); } str_cat(str, ">", 1); return str; } static VALUE struct_to_a(s) VALUE s; { return ary_new4(RSTRUCT(s)->len, RSTRUCT(s)->ptr); } static VALUE struct_clone(s) VALUE s; { NEWOBJ(st, struct RStruct); CLONESETUP(st, s); st->len = 0; /* avoid GC crashing */ st->ptr = ALLOC_N(VALUE, RSTRUCT(s)->len); st->len = RSTRUCT(s)->len; MEMCPY(st->ptr, RSTRUCT(s)->ptr, VALUE, st->len); return (VALUE)st; } static VALUE struct_aref_id(s, id) VALUE s; ID id; { VALUE member; int i, len; member = rb_iv_get(CLASS_OF(s), "__member__"); if (NIL_P(member)) { Bug("non-initialized struct"); } len = RARRAY(member)->len; for (i=0; iptr[i]) == id) { return RSTRUCT(s)->ptr[i]; } } NameError("no member '%s' in struct", rb_id2name(id)); } VALUE struct_aref(s, idx) VALUE s, idx; { int i; if (TYPE(idx) == T_STRING) { return struct_aref_id(s, rb_to_id(idx)); } i = NUM2INT(idx); if (i < 0) i = RSTRUCT(s)->len + i; if (i < 0) IndexError("offset %d too small for struct(size:%d)", i, RSTRUCT(s)->len); if (RSTRUCT(s)->len <= i) IndexError("offset %d too large for struct(size:%d)", i, RSTRUCT(s)->len); return RSTRUCT(s)->ptr[i]; } static VALUE struct_aset_id(s, id, val) VALUE s, val; ID id; { VALUE member; int i, len; member = rb_iv_get(CLASS_OF(s), "__member__"); if (NIL_P(member)) { Bug("non-initialized struct"); } len = RARRAY(member)->len; for (i=0; iptr[i]) == id) { RSTRUCT(s)->ptr[i] = val; return val; } } NameError("no member '%s' in struct", rb_id2name(id)); } VALUE struct_aset(s, idx, val) VALUE s, idx, val; { int i; if (TYPE(idx) == T_STRING) { return struct_aset_id(s, rb_to_id(idx), val); } i = NUM2INT(idx); if (i < 0) i = RSTRUCT(s)->len + i; if (i < 0) IndexError("offset %d too small for struct(size:%d)", i, RSTRUCT(s)->len); if (RSTRUCT(s)->len <= i) IndexError("offset %d too large for struct(size:%d)", i, RSTRUCT(s)->len); return RSTRUCT(s)->ptr[i] = val; } static VALUE struct_equal(s, s2) VALUE s, s2; { int i; if (TYPE(s2) != T_STRUCT) return FALSE; if (CLASS_OF(s) != CLASS_OF(s2)) return FALSE; if (RSTRUCT(s)->len != RSTRUCT(s2)->len) { Bug("inconsistent struct"); /* should never happen */ } for (i=0; ilen; i++) { if (!rb_equal(RSTRUCT(s)->ptr[i], RSTRUCT(s2)->ptr[i])) return FALSE; } return TRUE; } static VALUE struct_eql(s, s2) VALUE s, s2; { int i; if (TYPE(s2) != T_STRUCT) return FALSE; if (CLASS_OF(s) != CLASS_OF(s2)) return FALSE; if (RSTRUCT(s)->len != RSTRUCT(s2)->len) { Bug("inconsistent struct"); /* should never happen */ } for (i=0; ilen; i++) { if (!rb_eql(RSTRUCT(s)->ptr[i], RSTRUCT(s2)->ptr[i])) return FALSE; } return TRUE; } static VALUE struct_hash(s) VALUE s; { int i, h; h = CLASS_OF(s); for (i=0; ilen; i++) { h ^= rb_hash(RSTRUCT(s)->ptr[i]); } return INT2FIX(h); } void Init_Struct() { cStruct = rb_define_class("Struct", cObject); rb_include_module(cStruct, mEnumerable); rb_define_singleton_method(cStruct, "new", struct_s_def, -1); rb_define_method(cStruct, "clone", struct_clone, 0); rb_define_method(cStruct, "==", struct_equal, 1); rb_define_method(cStruct, "eql?", struct_eql, 1); rb_define_method(cStruct, "hash", struct_hash, 0); rb_define_method(cStruct, "to_s", struct_to_s, 0); rb_define_method(cStruct, "inspect", struct_inspect, 0); rb_define_method(cStruct, "to_a", struct_to_a, 0); rb_define_method(cStruct, "values", struct_to_a, 0); rb_define_method(cStruct, "each", struct_each, 0); rb_define_method(cStruct, "[]", struct_aref, 1); rb_define_method(cStruct, "[]=", struct_aset, 2); rb_define_method(cStruct, "members", struct_members, 0); } ruby-1.2.3/time.c100644 774 145 44512 6650575043 11675 0ustar matzNaCl/************************************************ time.c - $Author: matz $ $Date: 1999/01/18 09:08:51 $ created at: Tue Dec 28 14:31:59 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include #ifdef USE_CWGUSI int gettimeofday(struct timeval*, struct timezone*); int strcasecmp(char*, char*); #endif #include #ifndef NT #ifdef HAVE_SYS_TIME_H # include #else struct timeval { long tv_sec; /* seconds */ long tv_usec; /* and microseconds */ }; #endif #endif /* NT */ #ifdef HAVE_SYS_TIMES_H #include #endif #include static VALUE cTime; #if defined(HAVE_TIMES) || defined(NT) static VALUE S_Tms; #endif struct time_object { struct timeval tv; struct tm tm; #ifndef HAVE_TM_ZONE int gmt; #endif int tm_got; }; #define GetTimeval(obj, tobj) {\ Data_Get_Struct(obj, struct time_object, tobj);\ } static VALUE time_s_now(klass) VALUE klass; { VALUE obj; struct time_object *tobj; obj = Data_Make_Struct(klass, struct time_object, 0, free, tobj); tobj->tm_got=0; if (gettimeofday(&(tobj->tv), 0) == -1) { rb_sys_fail("gettimeofday"); } obj_call_init(obj); return obj; } static VALUE time_new_internal(klass, sec, usec) VALUE klass; int sec, usec; { VALUE obj; struct time_object *tobj; obj = Data_Make_Struct(klass, struct time_object, 0, free, tobj); tobj->tm_got = 0; tobj->tv.tv_sec = sec; tobj->tv.tv_usec = usec; return obj; } VALUE time_new(sec, usec) int sec, usec; { return time_new_internal(cTime, sec, usec); } struct timeval time_timeval(time) VALUE time; { struct time_object *tobj; struct timeval t; switch (TYPE(time)) { case T_FIXNUM: t.tv_sec = FIX2INT(time); t.tv_usec = 0; break; case T_FLOAT: t.tv_sec = RFLOAT(time)->value; t.tv_usec = (RFLOAT(time)->value - t.tv_sec) * 1000000.0; break; case T_BIGNUM: t.tv_sec = NUM2INT(time); t.tv_usec = 0; break; default: if (!obj_is_kind_of(time, cTime)) { TypeError("Can't convert %s into Time", rb_class2name(CLASS_OF(time))); } GetTimeval(time, tobj); t = tobj->tv; break; } return t; } static VALUE time_s_at(klass, time) VALUE klass, time; { struct timeval tv; tv = time_timeval(time); return time_new_internal(klass, tv.tv_sec, tv.tv_usec); } static char *months [12] = { "jan", "feb", "mar", "apr", "may", "jun", "jul", "aug", "sep", "oct", "nov", "dec", }; static int obj2int(obj) VALUE obj; { if (TYPE(obj) == T_STRING) { obj = str2inum(RSTRING(obj)->ptr, 10); } return NUM2INT(obj); } static void time_arg(argc, argv, args) int argc; VALUE *argv; int *args; { VALUE v[6]; int i; if (argc == 10) { v[0] = argv[5]; v[1] = argv[4]; v[2] = argv[3]; v[3] = argv[2]; v[4] = argv[1]; v[5] = argv[0]; } else { rb_scan_args(argc, argv, "15", &v[0],&v[1],&v[2],&v[3],&v[4],&v[5]); } args[0] = obj2int(v[0]); if (args[0] < 70) args[0] += 100; if (args[0] > 1900) args[0] -= 1900; if (NIL_P(v[1])) { args[1] = 0; } else if (TYPE(v[1]) == T_STRING) { args[1] = -1; for (i=0; i<12; i++) { if (strcasecmp(months[i], RSTRING(v[1])->ptr) == 0) { args[1] = i; break; } } if (args[1] == -1) { char c = RSTRING(v[1])->ptr[0]; if ('0' <= c && c <= '9') { args[1] = obj2int(v[1])-1; } } } else { args[1] = obj2int(v[1]) - 1; } if (NIL_P(v[2])) { args[2] = 1; } else { args[2] = obj2int(v[2]); } for (i=3;i<6;i++) { if (NIL_P(v[i])) { args[i] = 0; } else { args[i] = obj2int(v[i]); } } /* value validation */ if ( args[0] < 70|| args[0] > 137 || args[1] < 0 || args[1] > 11 || args[2] < 1 || args[2] > 31 || args[3] < 0 || args[3] > 23 || args[4] < 0 || args[4] > 59 || args[5] < 0 || args[5] > 60) ArgError("argument out of range"); } static VALUE time_gmtime _((VALUE)); static VALUE time_localtime _((VALUE)); static VALUE time_gm_or_local(argc, argv, gm_or_local, klass) int argc; VALUE *argv; int gm_or_local; VALUE klass; { int args[6]; struct timeval tv; struct tm *tm; time_t guess, t; int diff; struct tm *(*fn)(); VALUE time; fn = (gm_or_local) ? gmtime : localtime; time_arg(argc, argv, args); gettimeofday(&tv, 0); guess = tv.tv_sec; tm = (*fn)(&guess); if (!tm) goto error; t = args[0]; while (diff = t - (tm->tm_year)) { guess += diff * 364 * 24 * 3600; if (guess < 0) ArgError("too far future"); tm = (*fn)(&guess); if (!tm) goto error; } t = args[1]; while (diff = t - tm->tm_mon) { guess += diff * 27 * 24 * 3600; tm = (*fn)(&guess); if (!tm) goto error; } guess += (args[2] - tm->tm_mday) * 3600 * 24; guess += (args[3] - tm->tm_hour) * 3600; guess += (args[4] - tm->tm_min) * 60; guess += args[5] - tm->tm_sec; time = time_new_internal(klass, guess, 0); if (gm_or_local) return time_gmtime(time); return time_localtime(time); error: ArgError("gmtime/localtime error"); } static VALUE time_s_timegm(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { return time_gm_or_local(argc, argv, 1, klass); } static VALUE time_s_timelocal(argc, argv, klass) int argc; VALUE *argv; VALUE klass; { return time_gm_or_local(argc, argv, 0, klass); } static VALUE time_to_i(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); return int2inum(tobj->tv.tv_sec); } static VALUE time_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 time_usec(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); return INT2FIX(tobj->tv.tv_usec); } static VALUE time_cmp(time1, time2) VALUE time1, time2; { struct time_object *tobj1, *tobj2; int i; GetTimeval(time1, tobj1); switch (TYPE(time2)) { case T_FIXNUM: i = FIX2INT(time2); if (tobj1->tv.tv_sec == i) return INT2FIX(0); if (tobj1->tv.tv_sec > i) return INT2FIX(1); return FIX2INT(-1); case T_FLOAT: { double t; if (tobj1->tv.tv_sec == (int)RFLOAT(time2)->value) return INT2FIX(0); t = (double)tobj1->tv.tv_sec + (double)tobj1->tv.tv_usec*1e-6; if (tobj1->tv.tv_sec == RFLOAT(time2)->value) return INT2FIX(0); if (tobj1->tv.tv_sec > RFLOAT(time2)->value) return INT2FIX(1); return FIX2INT(-1); } } if (obj_is_instance_of(time2, cTime)) { 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 time_eql(time1, time2) VALUE time1, time2; { struct time_object *tobj1, *tobj2; GetTimeval(time1, tobj1); if (obj_is_instance_of(time2, cTime)) { GetTimeval(time2, tobj2); if (tobj1->tv.tv_sec == tobj2->tv.tv_sec) { if (tobj1->tv.tv_usec == tobj2->tv.tv_usec) return TRUE; } } return FALSE; } static VALUE time_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 time_localtime(time) VALUE time; { struct time_object *tobj; struct tm *tm_tmp; GetTimeval(time, tobj); tm_tmp = localtime((const time_t*)&tobj->tv.tv_sec); tobj->tm = *tm_tmp; tobj->tm_got = 1; #ifndef HAVE_TM_ZONE tobj->gmt = 0; #endif return time; } static VALUE time_gmtime(time) VALUE time; { struct time_object *tobj; struct tm *tm_tmp; GetTimeval(time, tobj); tm_tmp = gmtime((const time_t*)&tobj->tv.tv_sec); tobj->tm = *tm_tmp; tobj->tm_got = 1; #ifndef HAVE_TM_ZONE tobj->gmt = 1; #endif return time; } static VALUE time_asctime(time) VALUE time; { struct time_object *tobj; char *s; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } s = asctime(&(tobj->tm)); if (s[24] == '\n') s[24] = '\0'; return str_new2(s); } static VALUE time_to_s(time) VALUE time; { struct time_object *tobj; char buf[64]; int len; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } #ifndef HAVE_TM_ZONE if (tobj->gmt == 1) { len = strftime(buf, 64, "%a %b %d %H:%M:%S GMT %Y", &(tobj->tm)); } else #endif { len = strftime(buf, 64, "%a %b %d %H:%M:%S %Z %Y", &(tobj->tm)); } return str_new(buf, len); } static VALUE time_plus(time1, time2) VALUE time1, time2; { struct time_object *tobj1, *tobj2; int sec, usec; GetTimeval(time1, tobj1); if (TYPE(time2) == T_FLOAT) { unsigned int nsec = (unsigned int)RFLOAT(time2)->value; sec = tobj1->tv.tv_sec + nsec; usec = tobj1->tv.tv_usec + (RFLOAT(time2)->value - (double)nsec)*1e6; } else if (obj_is_instance_of(time2, cTime)) { 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) { /* usec overflow */ sec++; usec -= 1000000; } return time_new(sec, usec); } static VALUE time_minus(time1, time2) VALUE time1, time2; { struct time_object *tobj1, *tobj2; int sec, usec; GetTimeval(time1, tobj1); if (obj_is_instance_of(time2, cTime)) { double f; GetTimeval(time2, tobj2); f = tobj1->tv.tv_sec - tobj2->tv.tv_sec; f += (tobj1->tv.tv_usec - tobj2->tv.tv_usec)*1e-6; return float_new(f); } else if (TYPE(time2) == T_FLOAT) { sec = tobj1->tv.tv_sec - (int)RFLOAT(time2)->value; usec = tobj1->tv.tv_usec - (RFLOAT(time2)->value - (double)sec)*1e6; } else { sec = tobj1->tv.tv_sec - NUM2INT(time2); usec = tobj1->tv.tv_usec; } if (usec < 0) { /* usec underflow */ sec--; usec += 1000000; } return time_new(sec, usec); } static VALUE time_sec(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } return INT2FIX(tobj->tm.tm_sec); } static VALUE time_min(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } return INT2FIX(tobj->tm.tm_min); } static VALUE time_hour(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } return INT2FIX(tobj->tm.tm_hour); } static VALUE time_mday(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } return INT2FIX(tobj->tm.tm_mday); } static VALUE time_mon(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } Warning("Time#month now start from 1 for January"); return INT2FIX(tobj->tm.tm_mon+1); } static VALUE time_year(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } Warning("Time#year now returns 19xx"); return INT2FIX(tobj->tm.tm_year+1900); } static VALUE time_wday(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } return INT2FIX(tobj->tm.tm_wday); } static VALUE time_yday(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } return INT2FIX(tobj->tm.tm_yday); } static VALUE time_isdst(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } Warning("Time#isdst now returns boolean value"); return tobj->tm.tm_isdst?TRUE:FALSE; } static VALUE time_zone(time) VALUE time; { struct time_object *tobj; char buf[10]; int len; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } len = strftime(buf, 10, "%Z", &(tobj->tm)); return str_new(buf, len); } static VALUE time_to_a(time) VALUE time; { struct time_object *tobj; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } Warning("Time#to_a's return values are now changed"); return ary_new3(10, 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+1), INT2FIX(tobj->tm.tm_year+1900), INT2FIX(tobj->tm.tm_wday), INT2FIX(tobj->tm.tm_yday), tobj->tm.tm_isdst?TRUE:FALSE, time_zone(time)); } #define SMALLBUF 100 static int rb_strftime(buf, format, time) char ** volatile buf; char * volatile format; struct tm * volatile time; { volatile int i; int len; len = strftime(*buf, SMALLBUF, format, time); if (len != 0) return len; for (i=1024; i<8192; i+=1024) { *buf = xmalloc(i); len = strftime(*buf, i-1, format, time); if (len == 0) { free(*buf); continue; } return len; } ArgError("bad strftime format or result too long"); } static VALUE time_strftime(time, format) VALUE time, format; { struct time_object *tobj; char buffer[SMALLBUF]; char *fmt; char *buf = buffer; int len; VALUE str; GetTimeval(time, tobj); if (tobj->tm_got == 0) { time_localtime(time); } fmt = str2cstr(format, &len); if (strlen(fmt) < len) { /* Ruby string may contain \0's. */ char *p = fmt, *pe = fmt + len; str = str_new(0, 0); while (p < pe) { len = rb_strftime(&buf, p, &(tobj->tm)); str_cat(str, buf, len); p += strlen(p) + 1; if (len > SMALLBUF) free(buf); } return str; } len = rb_strftime(&buf, RSTRING(format)->ptr, &(tobj->tm)); str = str_new(buf, len); if (buf != buffer) free(buf); return str; } static VALUE time_s_times(obj) VALUE obj; { #ifdef HAVE_TIMES #ifndef HZ #define HZ 60 /* Universal constant :-) */ #endif /* HZ */ struct tms buf; if (times(&buf) == -1) rb_sys_fail(0); return struct_new(S_Tms, float_new((double)buf.tms_utime / HZ), float_new((double)buf.tms_stime / HZ), float_new((double)buf.tms_cutime / HZ), float_new((double)buf.tms_cstime / HZ)); #else #ifdef NT FILETIME create, exit, kernel, user; HANDLE hProc; hProc = GetCurrentProcess(); GetProcessTimes(hProc,&create, &exit, &kernel, &user); return struct_new(S_Tms, float_new((double)(kernel.dwHighDateTime*2e32+kernel.dwLowDateTime)/2e6), float_new((double)(user.dwHighDateTime*2e32+user.dwLowDateTime)/2e6), float_new((double)0), float_new((double)0)); #else rb_notimplement(); #endif #endif } static VALUE time_dump(time, limit) VALUE time, limit; { struct time_object *tobj; int sec, usec; unsigned char buf[8]; int i; GetTimeval(time, tobj); sec = tobj->tv.tv_sec; usec = tobj->tv.tv_usec; for (i=0; i<4; i++) { buf[i] = sec & 0xff; sec = RSHIFT(sec, 8); } for (i=4; i<8; i++) { buf[i] = usec & 0xff; usec = RSHIFT(usec, 8); } return str_new(buf, 8); } static VALUE time_load(klass, str) VALUE klass, str; { int sec, usec; unsigned char *buf; int i; buf = str2cstr(str, &i); if (i != 8) { TypeError("marshaled time format differ"); } sec = usec = 0; for (i=0; i<4; i++) { sec |= buf[i]<<(8*i); } for (i=4; i<8; i++) { usec |= buf[i]<<(8*(i-4)); } return time_new_internal(klass, sec, usec); } void Init_Time() { cTime = rb_define_class("Time", cObject); rb_include_module(cTime, mComparable); rb_define_singleton_method(cTime, "now", time_s_now, 0); rb_define_singleton_method(cTime, "new", time_s_now, 0); rb_define_singleton_method(cTime, "at", time_s_at, 1); rb_define_singleton_method(cTime, "gm", time_s_timegm, -1); rb_define_singleton_method(cTime, "local", time_s_timelocal, -1); rb_define_singleton_method(cTime, "mktime", time_s_timelocal, -1); rb_define_singleton_method(cTime, "times", time_s_times, 0); rb_define_method(cTime, "to_i", time_to_i, 0); rb_define_method(cTime, "to_f", time_to_f, 0); rb_define_method(cTime, "<=>", time_cmp, 1); rb_define_method(cTime, "eql?", time_eql, 1); rb_define_method(cTime, "hash", time_hash, 0); rb_define_method(cTime, "localtime", time_localtime, 0); rb_define_method(cTime, "gmtime", time_gmtime, 0); rb_define_method(cTime, "ctime", time_asctime, 0); rb_define_method(cTime, "asctime", time_asctime, 0); rb_define_method(cTime, "to_s", time_to_s, 0); rb_define_method(cTime, "inspect", time_to_s, 0); rb_define_method(cTime, "to_a", time_to_a, 0); rb_define_method(cTime, "+", time_plus, 1); rb_define_method(cTime, "-", time_minus, 1); rb_define_method(cTime, "sec", time_sec, 0); rb_define_method(cTime, "min", time_min, 0); rb_define_method(cTime, "hour", time_hour, 0); rb_define_method(cTime, "mday", time_mday, 0); rb_define_method(cTime, "day", time_mday, 0); rb_define_method(cTime, "mon", time_mon, 0); rb_define_method(cTime, "month", time_mon, 0); rb_define_method(cTime, "year", time_year, 0); rb_define_method(cTime, "wday", time_wday, 0); rb_define_method(cTime, "yday", time_yday, 0); rb_define_method(cTime, "isdst", time_isdst, 0); rb_define_method(cTime, "zone", time_zone, 0); rb_define_method(cTime, "tv_sec", time_to_i, 0); rb_define_method(cTime, "tv_usec", time_usec, 0); rb_define_method(cTime, "usec", time_usec, 0); rb_define_method(cTime, "strftime", time_strftime, 1); #if defined(HAVE_TIMES) || defined(NT) S_Tms = struct_define("Tms", "utime", "stime", "cutime", "cstime", 0); #endif /* methods for marshaling */ rb_define_singleton_method(cTime, "_load", time_load, 1); rb_define_method(cTime, "_dump", time_dump, 1); } ruby-1.2.3/top.sed100644 774 145 2543 6650770076 12053 0ustar matzNaCl/^SHELL/s,/bin/sh,$(COMPSEC), s/@srcdir@/./g s/@top_srcdir@/../ s%@CFLAGS@%-g -O2%g s%@CPPFLAGS@%%g s%@LDFLAGS@%%g s%@LIBS@%-lm %g s%@exec_prefix@%${prefix}%g s%@prefix@%/usr/local%g s%@program_transform_name@%s,x,x,%g s%@bindir@%${exec_prefix}/bin%g s%@sbindir@%${exec_prefix}/sbin%g s%@libexecdir@%${exec_prefix}/libexec%g s%@datadir@%${prefix}/share%g s%@sysconfdir@%${prefix}/etc%g s%@sharedstatedir@%${prefix}/com%g s%@localstatedir@%${prefix}/var%g s%@libdir@%${exec_prefix}/lib%g s%@includedir@%${prefix}/include%g s%@oldincludedir@%/usr/include%g s%@infodir@%${prefix}/info%g s%@mandir@%${prefix}/man%g s%@host@%i386-pc-djgpp%g s%@host_alias@%i386-djgpp%g s%@host_cpu@%i386%g s%@host_vendor@%pc%g s%@host_os@%djgpp%g s%@CC@%gcc%g s%@CPP@%gcc -E%g s%@YACC@%bison -y%g s%@RANLIB@%ranlib%g s%@AR@%ar%g s%@INSTALL_PROGRAM@%${INSTALL}%g s%@INSTALL_DATA@%${INSTALL} -m 644%g s%@SET_MAKE@%%g s%@LIBOBJS@% crypt.o flock.o vsnprintf.o%g s%@ALLOCA@%%g s%@DLDFLAGS@%%g s%@STATIC@%%g s%@CCDLFLAGS@%%g s%@LDSHARED@%ld%g s%@DLEXT@%o%g s%@STRIP@%strip%g s%@EXTSTATIC@%%g s%@binsuffix@%.exe%g s%@setup@%Setup.dj%g s%@LIBRUBY@%libruby.a%g s%@LIBRUBYARG@%libruby.a%g s%@SOLIBS@%%g s%@arch@%i386-djgpp%g s%/bin/rm%rm% s%|| true%% s%@archlib@%/usr/local/lib/ruby/i386-djgpp% /\/dev\/null/ { s,/dev/null 2>&1, nul, s,2> /dev/null,, } /^config.status/ { N;N;N;N;N;d } s%y\.tab\.c%y_tab.c% ruby-1.2.3/util.h100644 774 145 544 6527746731 11665 0ustar matzNaCl/************************************************ util.h - $Author: matz $ $Date: 1998/05/18 05:57:45 $ created at: Thu Mar 9 11:55:53 JST 1995 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #ifndef UTIL_H #define UTIL_H unsigned long scan_oct(); unsigned long scan_hex(); #endif /* UTIL_H */ ruby-1.2.3/util.c100644 774 145 50222 6646327157 11715 0ustar matzNaCl/************************************************ util.c - $Author: matz $ $Date: 1999/01/11 07:55:27 $ created at: Fri Mar 10 17:22:34 JST 1995 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include #define RUBY_NO_INLINE #include "ruby.h" #ifdef NT #include "missing/file.h" #endif int rb_type(obj) VALUE obj; { if (FIXNUM_P(obj)) return T_FIXNUM; if (obj == Qnil) return T_NIL; if (obj == FALSE) return T_FALSE; if (obj == TRUE) return T_TRUE; return BUILTIN_TYPE(obj); } int rb_special_const_p(obj) VALUE obj; { if (FIXNUM_P(obj)) return TRUE; if (obj == Qnil) return TRUE; if (obj == FALSE) return TRUE; if (obj == TRUE) return TRUE; return FALSE; } int rb_test_false_or_nil(v) VALUE v; { return (v != Qnil) && (v != FALSE); } #include "util.h" #ifndef HAVE_STRING_H char *strchr _((char*,char)); #endif unsigned long scan_oct(start, len, retlen) char *start; int len; int *retlen; { register char *s = start; register unsigned long retval = 0; while (len-- && *s >= '0' && *s <= '7') { retval <<= 3; retval |= *s++ - '0'; } *retlen = s - start; return retval; } unsigned long scan_hex(start, len, retlen) char *start; int len; int *retlen; { static char hexdigit[] = "0123456789abcdef0123456789ABCDEFx"; register char *s = start; register unsigned long retval = 0; char *tmp; while (len-- && *s && (tmp = strchr(hexdigit, *s))) { retval <<= 4; retval |= (tmp - hexdigit) & 15; s++; } *retlen = s - start; return retval; } #include #include #ifdef HAVE_UNISTD_H #include #endif #if defined(HAVE_FCNTL) #include #endif #ifndef S_ISDIR # define S_ISDIR(m) ((m & S_IFMT) == S_IFDIR) #endif #ifdef NT #include "missing/file.h" #endif static char * check_dir(dir) char *dir; { struct stat st; if (dir == NULL) return NULL; if (stat(dir, &st) < 0) return NULL; if (!S_ISDIR(st.st_mode)) return NULL; if (eaccess(dir, W_OK) < 0) return NULL; return dir; } char * ruby_mktemp() { char *dir; char *buf; dir = check_dir(getenv("TMP")); if (!dir) dir = check_dir(getenv("TMPDIR")); if (!dir) dir = "/tmp"; buf = ALLOC_N(char,strlen(dir)+10); sprintf(buf, "%s/rbXXXXXX", dir); dir = mktemp(buf); if (dir == NULL) free(buf); return dir; } #if defined(MSDOS) || defined(__CYGWIN32__) || defined(NT) /* * Copyright (c) 1993, Intergraph Corporation * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the perl README file. * * Various Unix compatibility functions and NT specific functions. * * Some of this code was derived from the MSDOS port(s) and the OS/2 port. * */ /* * Suffix appending for in-place editing under MS-DOS and OS/2 (and now NT!). * * Here are the rules: * * Style 0: Append the suffix exactly as standard perl would do it. * If the filesystem groks it, use it. (HPFS will always * grok it. So will NTFS. FAT will rarely accept it.) * * Style 1: The suffix begins with a '.'. The extension is replaced. * If the name matches the original name, use the fallback method. * * Style 2: The suffix is a single character, not a '.'. Try to add the * suffix to the following places, using the first one that works. * [1] Append to extension. * [2] Append to filename, * [3] Replace end of extension, * [4] Replace end of filename. * If the name matches the original name, use the fallback method. * * Style 3: Any other case: Ignore the suffix completely and use the * fallback method. * * Fallback method: Change the extension to ".$$$". If that matches the * original name, then change the extension to ".~~~". * * If filename is more than 1000 characters long, we die a horrible * death. Sorry. * * The filename restriction is a cheat so that we can use buf[] to store * assorted temporary goo. * * Examples, assuming style 0 failed. * * suffix = ".bak" (style 1) * foo.bar => foo.bak * foo.bak => foo.$$$ (fallback) * foo.$$$ => foo.~~~ (fallback) * makefile => makefile.bak * * suffix = "~" (style 2) * foo.c => foo.c~ * foo.c~ => foo.c~~ * foo.c~~ => foo~.c~~ * foo~.c~~ => foo~~.c~~ * foo~~~~~.c~~ => foo~~~~~.$$$ (fallback) * * foo.pas => foo~.pas * makefile => makefile.~ * longname.fil => longname.fi~ * longname.fi~ => longnam~.fi~ * longnam~.fi~ => longnam~.$$$ * */ static int valid_filename(char *s); static char suffix1[] = ".$$$"; static char suffix2[] = ".~~~"; #define ext (&buf[1000]) #define strEQ(s1,s2) (strcmp(s1,s2) == 0) void add_suffix(VALUE str, char *suffix) { int baselen; int extlen = strlen(suffix); char *s, *t, *p; int slen; char buf[1024]; if (RSTRING(str)->len > 1000) Fatal("Cannot do inplace edit on long filename (%d characters)", RSTRING(str)->len); #if defined(DJGPP) || defined(__CYGWIN32__) || defined(NT) /* Style 0 */ slen = RSTRING(str)->len; str_cat(str, suffix, extlen); #if defined(DJGPP) if (_USE_LFN) return; #else if (valid_filename(RSTRING(str)->ptr)) return; #endif /* Fooey, style 0 failed. Fix str before continuing. */ RSTRING(str)->ptr[RSTRING(str)->len = slen] = '\0'; #endif slen = extlen; t = buf; baselen = 0; s = RSTRING(str)->ptr; while ( (*t = *s) && *s != '.') { baselen++; if (*s == '\\' || *s == '/') baselen = 0; s++; t++; } p = t; t = ext; extlen = 0; while (*t++ = *s++) extlen++; if (extlen == 0) { ext[0] = '.'; ext[1] = 0; extlen++; } if (*suffix == '.') { /* Style 1 */ if (strEQ(ext, suffix)) goto fallback; strcpy(p, suffix); } else if (suffix[1] == '\0') { /* Style 2 */ if (extlen < 4) { ext[extlen] = *suffix; ext[++extlen] = '\0'; } else if (baselen < 8) { *p++ = *suffix; } else if (ext[3] != *suffix) { ext[3] = *suffix; } else if (buf[7] != *suffix) { buf[7] = *suffix; } else goto fallback; strcpy(p, ext); } else { /* Style 3: Panic */ fallback: (void)memcpy(p, strEQ(ext, suffix1) ? suffix2 : suffix1, 5); } str_resize(str, strlen(buf)); memcpy(RSTRING(str)->ptr, buf, RSTRING(str)->len); } #if defined(__CYGWIN32__) || defined(NT) static int valid_filename(char *s) { int fd; /* // if the file exists, then it's a valid filename! */ if (_access(s, 0) == 0) { return 1; } /* // It doesn't exist, so see if we can open it. */ if ((fd = _open(s, O_CREAT, 0666)) >= 0) { _close(fd); _unlink (s); /* don't leave it laying around */ return 1; } return 0; } #endif #endif #ifdef DJGPP /* Copyright (C) 1996 DJ Delorie, see COPYING.DJ for details */ /* Copyright (C) 1995 DJ Delorie, see COPYING.DJ for details */ #include #include /* For FILENAME_MAX */ #include /* For errno */ #include /* For LFN stuff */ #include #include /* For dpmisim */ #include /* For crt0 flags */ #include static unsigned use_lfn; static char *__get_current_directory(char *out, int drive_number); static char * __get_current_directory(char *out, int drive_number) { __dpmi_regs r; char tmpbuf[FILENAME_MAX]; memset(&r, 0, sizeof(r)); if(use_lfn) r.x.ax = 0x7147; else r.h.ah = 0x47; r.h.dl = drive_number + 1; r.x.si = __tb_offset; r.x.ds = __tb_segment; __dpmi_int(0x21, &r); if (r.x.flags & 1) { errno = r.x.ax; return out; } else { dosmemget(__tb, sizeof(tmpbuf), tmpbuf); strcpy(out+1,tmpbuf); /* Root path, don't insert "/", it'll be added later */ if (*(out + 1) != '\0') *out = '/'; else *out = '\0'; return out + strlen(out); } } __inline__ static int is_slash(int c) { return c == '/' || c == '\\'; } __inline__ static int is_term(int c) { return c == '/' || c == '\\' || c == '\0'; } #ifdef SJIS __inline__ static int is_sjis1(int c) { return 0x81 <= c && (c <= 0x9f || 0xe0 <= c); } #endif /* Takes as input an arbitrary path. Fixes up the path by: 1. Removing consecutive slashes 2. Removing trailing slashes 3. Making the path absolute if it wasn't already 4. Removing "." in the path 5. Removing ".." entries in the path (and the directory above them) 6. Adding a drive specification if one wasn't there 7. Converting all slashes to '/' */ void _fixpath(const char *in, char *out) { int drive_number; const char *ip = in; char *op = out; int preserve_case = _preserve_fncase(); char *name_start; use_lfn = _USE_LFN; /* Add drive specification to output string */ if (((*ip >= 'a' && *ip <= 'z') || (*ip >= 'A' && *ip <= 'Z')) && (*(ip + 1) == ':')) { if (*ip >= 'a' && *ip <= 'z') { drive_number = *ip - 'a'; *op++ = *ip++; } else { drive_number = *ip - 'A'; if (*ip <= 'Z') *op++ = drive_number + 'a'; else *op++ = *ip; ++ip; } *op++ = *ip++; } else { __dpmi_regs r; r.h.ah = 0x19; __dpmi_int(0x21, &r); drive_number = r.h.al; *op++ = drive_number + (drive_number < 26 ? 'a' : 'A'); *op++ = ':'; } /* Convert relative path to absolute */ if (!is_slash(*ip)) op = __get_current_directory(op, drive_number); /* Step through the input path */ while (*ip) { /* Skip input slashes */ if (is_slash(*ip)) { ip++; continue; } /* Skip "." and output nothing */ if (*ip == '.' && is_term(*(ip + 1))) { ip++; continue; } /* Skip ".." and remove previous output directory */ if (*ip == '.' && *(ip + 1) == '.' && is_term(*(ip + 2))) { ip += 2; /* Don't back up over drive spec */ if (op > out + 2) /* This requires "/" to follow drive spec */ while (!is_slash(*--op)); continue; } /* Copy path component from in to out */ *op++ = '/'; #ifndef SJIS while (!is_term(*ip)) *op++ = *ip++; #else while (!is_term(*ip)) { if (is_sjis1((unsigned char)*ip)) *op++ = *ip++; *op++ = *ip++; } #endif } /* If root directory, insert trailing slash */ if (op == out + 2) *op++ = '/'; /* Null terminate the output */ *op = '\0'; /* switch FOO\BAR to foo/bar, downcase where appropriate */ for (op = out + 3, name_start = op - 1; *name_start; op++) { char long_name[FILENAME_MAX], short_name[13]; #ifdef SJIS if (is_sjis1((unsigned char)*op)) { op++; continue; } #endif if (*op == '\\') *op = '/'; if (!preserve_case && (*op == '/' || *op == '\0')) { memcpy(long_name, name_start+1, op - name_start - 1); long_name[op - name_start - 1] = '\0'; if (!strcmp(_lfn_gen_short_fname(long_name, short_name), long_name)) { #ifndef SJIS while (++name_start < op) if (*name_start >= 'A' && *name_start <= 'Z') *name_start += 'a' - 'A'; #else while (++name_start < op) { if (is_sjis1((unsigned char)*name_start)) name_start++; else if (*name_start >= 'A' && *name_start <= 'Z') *name_start += 'a' - 'A'; } #endif } else name_start = op; } else if (*op == '\0') break; } } #ifdef TEST int main (int argc, char *argv[]) { char fixed[FILENAME_MAX]; if (argc > 1) { _fixpath (argv[1], fixed); printf ("You mean %s?\n", fixed); } return 0; } #endif #endif /* mm.c */ static int mmkind, mmsize, high, low; #define A ((int*)a) #define B ((int*)b) #define C ((int*)c) #define D ((int*)d) static void mmprepare(base, size) void *base; int size; { #ifdef DEBUG if (sizeof(int) != 4) die("sizeof(int) != 4"); if (size <= 0) die("mmsize <= 0"); #endif if ( ((int)base & (4-1)) == 0 && (size & (4-1)) == 0 ) if (size >= 16) mmkind = 1; else mmkind = 0; else mmkind = -1; mmsize = size; high = (size & (-16)); low = (size & 0x0C ); } static void mmswap(a, b) register char *a, *b; { register int s; if (a == b) return; if (mmkind >= 0) { if (mmkind > 0) { register char *t = a + high; do { s = A[0]; A[0] = B[0]; B[0] = s; s = A[1]; A[1] = B[1]; B[1] = s; s = A[2]; A[2] = B[2]; B[2] = s; s = A[3]; A[3] = B[3]; B[3] = s; a += 16; b += 16; }while (a < t); } if (low != 0) { s = A[0]; A[0] = B[0]; B[0] = s; if (low >= 8) { s = A[1]; A[1] = B[1]; B[1] = s; if (low == 12) {s = A[2]; A[2] = B[2]; B[2] = s;}}} }else{ register char *t = a + mmsize; do {s = *a; *a++ = *b; *b++ = s;} while (a < t); } } static void mmswapblock(a, b, size) register char *a, *b; int size; { register int s; if (mmkind >= 0) { register char *t = a + (size & (-16)); register int lo = (size & 0x0C); if (size >= 16) { do { s = A[0]; A[0] = B[0]; B[0] = s; s = A[1]; A[1] = B[1]; B[1] = s; s = A[2]; A[2] = B[2]; B[2] = s; s = A[3]; A[3] = B[3]; B[3] = s; a += 16; b += 16; }while (a < t); } if (lo != 0) { s = A[0]; A[0] = B[0]; B[0] = s; if (lo >= 8) { s = A[1]; A[1] = B[1]; B[1] = s; if (lo == 12) {s = A[2]; A[2] = B[2]; B[2] = s;}}} }else{ register char *t = a + size; do {s = *a; *a++ = *b; *b++ = s;} while (a < t); } } static void mmrot3(a, b, c) register char *a, *b, *c; { register int s; if (mmkind >= 0) { if (mmkind > 0) { register char *t = a + high; do { s = A[0]; A[0] = B[0]; B[0] = C[0]; C[0] = s; s = A[1]; A[1] = B[1]; B[1] = C[1]; C[1] = s; s = A[2]; A[2] = B[2]; B[2] = C[2]; C[2] = s; s = A[3]; A[3] = B[3]; B[3] = C[3]; C[3] = s; a += 16; b += 16; c += 16; }while (a < t); } if (low != 0) { s = A[0]; A[0] = B[0]; B[0] = C[0]; C[0] = s; if (low >= 8) { s = A[1]; A[1] = B[1]; B[1] = C[1]; C[1] = s; if (low == 12) {s = A[2]; A[2] = B[2]; B[2] = C[2]; C[2] = s;}}} }else{ register char *t = a + mmsize; do {s = *a; *a++ = *b; *b++ = *c; *c++ = s;} while (a < t); } } /* qs6.c */ /*****************************************************/ /* */ /* qs6 (Quick sort function) */ /* */ /* by Tomoyuki Kawamura 1995.4.21 */ /* kawamura@tokuyama.ac.jp */ /*****************************************************/ typedef struct { char *LL, *RR; } stack_node; /* Stack structure for L,l,R,r */ #define PUSH(ll,rr) {top->LL = (ll); top->RR = (rr); ++top;} /* Push L,l,R,r */ #define POP(ll,rr) {--top; ll = top->LL; rr = top->RR;} /* Pop L,l,R,r */ #define med3(a,b,c) ((*cmp)(a,b)<0 ? \ ((*cmp)(b,c)<0 ? b : ((*cmp)(a,c)<0 ? c : a)) : \ ((*cmp)(b,c)>0 ? b : ((*cmp)(a,c)<0 ? a : c)) ) void rb_qsort (base, nel, size, cmp) void* base; size_t nel; size_t size; int (*cmp)(); { register char *l, *r, *m; /* l,r:left,right group m:median point */ register int t, eq_l, eq_r; /* eq_l: all items in left group are equal to S */ char *L = base; /* left end of curren region */ char *R = (char*)base + size*(nel-1); /* right end of current region */ int chklim = 63; /* threshold of ordering element check */ stack_node stack[32], *top = stack; /* 32 is enough for 32bit CPU */ if (nel <= 1) return; /* need not to sort */ mmprepare( base, size ); goto start; nxt: if (stack == top) return; /* return if stack is empty */ POP(L,R); for (;;) { start: if (L + size == R) {if ((*cmp)(L,R) > 0) mmswap(L,R); goto nxt;}/* 2 elements */ l = L; r = R; t = (r - l + size) / size; /* number of elements */ m = l + size * (t >> 1); /* calculate median value */ if (t >= 60) { register char *m1; register char *m3; if (t >= 200) { t = size*(t>>3); /* number of bytes in splitting 8 */ { register char *p1 = l + t; register char *p2 = p1 + t; register char *p3 = p2 + t; m1 = med3( p1, p2, p3 ); p1 = m + t; p2 = p1 + t; p3 = p2 + t; m3 = med3( p1, p2, p3 ); } }else{ t = size*(t>>2); /* number of bytes in splitting 4 */ m1 = l + t; m3 = m + t; } m = med3( m1, m, m3 ); } if ((t = (*cmp)(l,m)) < 0) { /*3-5-?*/ if ((t = (*cmp)(m,r)) < 0) { /*3-5-7*/ if (chklim && nel >= chklim) { /* check if already ascending order */ char *p; chklim = 0; for (p=l; p 0) goto fail; goto nxt; } fail: goto loopA; /*3-5-7*/ } if (t > 0) { if ((*cmp)(l,r) <= 0) {mmswap(m,r); goto loopA;} /*3-5-4*/ mmrot3(r,m,l); goto loopA; /*3-5-2*/ } goto loopB; /*3-5-5*/ } if (t > 0) { /*7-5-?*/ if ((t = (*cmp)(m,r)) > 0) { /*7-5-3*/ if (chklim && nel >= chklim) { /* check if already ascending order */ char *p; chklim = 0; for (p=l; p 0) {mmswap(l,r); goto loopB;} /*5-5-3*/ /* deteming splitting type in case 5-5-5 */ /*5-5-5*/ for (;;) { if ((l += size) == r) goto nxt; /*5-5-5*/ if (l == m) continue; if ((t = (*cmp)(l,m)) > 0) {mmswap(l,r); l = L; goto loopA;} /*575-5*/ if (t < 0) {mmswap(L,l); l = L; goto loopB;} /*535-5*/ } loopA: eq_l = 1; eq_r = 1; /* splitting type A */ /* left <= median < right右*/ for (;;) { for (;;) { if ((l += size) == r) {l -= size; if (l != m) mmswap(m,l); l -= size; goto fin;} if (l == m) continue; if ((t = (*cmp)(l,m)) > 0) {eq_r = 0; break;} if (t < 0) eq_l = 0; } for (;;) { if (l == (r -= size)) {l -= size; if (l != m) mmswap(m,l); l -= size; goto fin;} if (r == m) {m = l; break;} if ((t = (*cmp)(r,m)) < 0) {eq_l = 0; break;} if (t == 0) break; } mmswap(l,r); /* swap left and right */ } loopB: eq_l = 1; eq_r = 1; /* splitting type B */ /* left < median <= right */ for (;;) { for (;;) { if (l == (r -= size)) {r += size; if (r != m) mmswap(r,m); r += size; goto fin;} if (r == m) continue; if ((t = (*cmp)(r,m)) < 0) {eq_l = 0; break;} if (t > 0) eq_r = 0; } for (;;) { if ((l += size) == r) {r += size; if (r != m) mmswap(r,m); r += size; goto fin;} if (l == m) {m = r; break;} if ((t = (*cmp)(l,m)) > 0) {eq_r = 0; break;} if (t == 0) break; } mmswap(l,r); /* swap left and right */ } fin: if (eq_l == 0) /* need to sort left side */ if (eq_r == 0) /* need to sort right side */ if (l-L < R-r) {PUSH(r,R); R = l;} /* sort left side first */ else {PUSH(L,l); L = r;} /* sort right side first */ else R = l; /* need to sort left side only */ else if (eq_r == 0) L = r; /* need to sort right side only */ else goto nxt; /* need not to sort both sides */ } } ruby-1.2.3/variable.c100644 774 145 45603 6553044147 12524 0ustar matzNaCl/************************************************ variable.c - $Author: matz $ $Date: 1998/07/15 06:12:55 $ created at: Tue Apr 19 23:55:15 JST 1994 ************************************************/ #include "ruby.h" #include "env.h" #include "node.h" #include "st.h" #ifdef USE_CWGUSI char* strdup(char*); #endif static st_table *rb_global_tbl; st_table *rb_class_tbl; #define global_tbl rb_global_tbl #define class_tbl rb_class_tbl st_table* new_idhash() { return st_init_numtable(); } void Init_var_tables() { global_tbl = new_idhash(); class_tbl = new_idhash(); } struct fc_result { ID name; VALUE klass; VALUE path; VALUE track; struct fc_result *prev; }; static int fc_i(key, value, res) ID key; VALUE value; struct fc_result *res; { VALUE path; char *name; if (!rb_is_const_id(key)) return ST_CONTINUE; name = rb_id2name(key); if (res->path) { path = str_dup(res->path); str_cat(path, "::", 2); str_cat(path, name, strlen(name)); } else { path = str_new2(name); } if (value == res->klass) { res->name = key; res->path = path; return ST_STOP; } if (obj_is_kind_of(value, cModule)) { struct fc_result arg; struct fc_result *list; if (!RCLASS(value)->iv_tbl) return ST_CONTINUE; list = res; while (list) { if (list->track == value) return ST_CONTINUE; list = list->prev; } arg.name = 0; arg.path = path; arg.klass = res->klass; arg.track = value; arg.prev = res; st_foreach(RCLASS(value)->iv_tbl, fc_i, &arg); if (arg.name) { res->name = arg.name; res->path = arg.path; return ST_STOP; } } return ST_CONTINUE; } static VALUE find_class_path(klass) VALUE klass; { struct fc_result arg; arg.name = 0; arg.path = 0; arg.klass = klass; arg.track = cObject; arg.prev = 0; if (RCLASS(cObject)->iv_tbl) { st_foreach(RCLASS(cObject)->iv_tbl, fc_i, &arg); } if (arg.name == 0) { st_foreach(class_tbl, fc_i, &arg); } if (arg.name) { rb_iv_set(klass, "__classpath__", arg.path); return arg.path; } return Qnil; } static VALUE classname(klass) VALUE klass; { VALUE path; while (TYPE(klass) == T_ICLASS || FL_TEST(klass, FL_SINGLETON)) { klass = (VALUE)RCLASS(klass)->super; } path = rb_iv_get(klass, "__classpath__"); if (NIL_P(path)) { ID classid = rb_intern("__classid__"); path = rb_ivar_get(klass, classid); if (!NIL_P(path)) { path = str_new2(rb_id2name(FIX2INT(path))); rb_ivar_set(klass, classid, path); st_delete(RCLASS(klass)->iv_tbl, &classid, 0); } } if (NIL_P(path)) { path = find_class_path(klass); if (NIL_P(path)) { return 0; } return path; } if (TYPE(path) != T_STRING) Bug("class path is not set properly"); return path; } VALUE mod_name(mod) VALUE mod; { VALUE path = classname(mod); if (path) return str_dup(path); return str_new(0,0); } VALUE rb_class_path(klass) VALUE klass; { VALUE path = classname(klass); if (path) return path; else { char buf[256]; char *s = "Class"; if (TYPE(klass) == T_MODULE) s = "Module"; sprintf(buf, "#<%s 0x%x>", s, klass); return str_new2(buf); } } void rb_set_class_path(klass, under, name) VALUE klass, under; char *name; { VALUE str; if (under == cObject) { str = str_new2(name); } else { str = str_dup(rb_class_path(under)); str_cat(str, "::", 2); str_cat(str, name, strlen(name)); } rb_iv_set(klass, "__classpath__", str); } VALUE rb_path2class(path) char *path; { if (path[0] == '#') { ArgError("can't retrieve anonymous class %s", path); } return rb_eval_string(path); } void rb_name_class(klass, id) VALUE klass; ID id; { if (cString) { rb_iv_set(klass, "__classpath__", str_new2(rb_id2name(id))); } else { rb_iv_set(klass, "__classid__", INT2FIX(id)); } } static st_table *autoload_tbl = 0; static void rb_autoload_id(id, filename) ID id; char *filename; { if (!rb_is_const_id(id)) { NameError("autoload must be constant name", rb_id2name(id)); } if (!autoload_tbl) { autoload_tbl = new_idhash(); } st_insert(autoload_tbl, id, strdup(filename)); } void rb_autoload(klass, filename) char *klass, *filename; { rb_autoload_id(rb_intern(klass), filename); } VALUE f_autoload(obj, klass, file) VALUE obj, klass, file; { rb_autoload_id(rb_to_id(klass), STR2CSTR(file)); return Qnil; } char * rb_class2name(klass) VALUE klass; { return RSTRING(rb_class_path(klass))->ptr; } struct trace_var { int removed; void (*func)(); void *data; struct trace_var *next; }; struct global_entry { ID id; void *data; VALUE (*getter)(); void (*setter)(); void (*marker)(); int block_trace; struct trace_var *trace; }; static VALUE undef_getter(); static void undef_setter(); static void undef_marker(); static VALUE val_getter(); static void val_setter(); static void val_marker(); static VALUE var_getter(); static void var_setter(); static void var_marker(); 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->data = 0; entry->getter = undef_getter; entry->setter = undef_setter; entry->marker = undef_marker; entry->block_trace = 0; entry->trace = 0; } return entry; } static VALUE undef_getter(id) ID id; { Warning("global variable `%s' not initialized", rb_id2name(id)); return Qnil; } static void undef_setter(val, id, data, entry) VALUE val; ID id; void *data; struct global_entry *entry; { entry->getter = val_getter; entry->setter = val_setter; entry->marker = val_marker; entry->data = (void*)val; } static void undef_marker() { } static VALUE val_getter(id, val) ID id; VALUE val; { return val; } static void val_setter(val, id, data, entry) VALUE val; ID id; void *data; struct global_entry *entry; { entry->data = (void*)val; } static void val_marker(data) void *data; { if (data) gc_mark_maybe(data); } static VALUE var_getter(id, var) ID id; VALUE *var; { if (!var || !*var) return Qnil; return *var; } static void var_setter(val, id, var) VALUE val; ID id; VALUE *var; { *var = val; } static void var_marker(var) VALUE **var; { if (var) gc_mark_maybe(*var); } static void readonly_setter(val, id, var) VALUE val; ID id; void *var; { NameError("Can't set variable %s", rb_id2name(id)); } static int mark_global_entry(key, entry) ID key; struct global_entry *entry; { struct trace_var *trace; (*entry->marker)(entry->data); trace = entry->trace; while (trace) { if (trace->data) gc_mark_maybe(trace->data); trace = trace->next; } return ST_CONTINUE; } void gc_mark_global_tbl() { st_foreach(global_tbl, mark_global_entry, 0); } static ID global_id(name) char *name; { 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); } return id; } void rb_define_hooked_variable(name, var, getter, setter) char *name; VALUE *var; VALUE (*getter)(); void (*setter)(); { struct global_entry *entry; ID id = global_id(name); entry = rb_global_entry(id); entry->data = (void*)var; entry->getter = getter?getter:var_getter; entry->setter = setter?setter:var_setter; entry->marker = var_marker; } void rb_define_variable(name, var) char *name; VALUE *var; { rb_define_hooked_variable(name, var, 0, 0); } void rb_define_readonly_variable(name, var) char *name; VALUE *var; { rb_define_hooked_variable(name, var, 0, readonly_setter); } void rb_define_virtual_variable(name, getter, setter) char *name; VALUE (*getter)(); void (*setter)(); { if (!getter) getter = val_getter; if (!setter) setter = readonly_setter; rb_define_hooked_variable(name, 0, getter, setter); } static void rb_trace_eval(cmd, val) VALUE cmd, val; { rb_eval_cmd(cmd, ary_new3(1, val)); } VALUE f_trace_var(argc, argv) int argc; VALUE *argv; { VALUE var, cmd; ID id; struct global_entry *entry; struct trace_var *trace; if (rb_scan_args(argc, argv, "11", &var, &cmd) == 1) { cmd = f_lambda(); } if (NIL_P(cmd)) { return f_untrace_var(argc, argv); } id = rb_to_id(var); if (!st_lookup(global_tbl, id, &entry)) { NameError("undefined global variable %s", rb_id2name(id)); } trace = ALLOC(struct trace_var); trace->next = entry->trace; trace->func = rb_trace_eval; trace->data = (void*)cmd; trace->removed = 0; entry->trace = trace; return Qnil; } static void remove_trace(entry) struct global_entry *entry; { struct trace_var *trace = entry->trace; struct trace_var t; struct trace_var *next; t.next = trace; trace = &t; while (trace->next) { next = trace->next; if (next->removed) { trace->next = next->next; free(next); } trace = next; } entry->trace = t.next; } VALUE f_untrace_var(argc, argv) int argc; VALUE *argv; { VALUE var, cmd; ID id; struct global_entry *entry; struct trace_var *trace; rb_scan_args(argc, argv, "11", &var, &cmd); id = rb_to_id(var); if (!st_lookup(global_tbl, id, &entry)) { NameError("undefined global variable %s", rb_id2name(id)); } trace = entry->trace; if (NIL_P(cmd)) { VALUE ary = ary_new(); while (trace) { struct trace_var *next = trace->next; ary_push(ary, (VALUE)trace->data); trace->removed = 1; trace = next; } entry->trace = 0; if (!entry->block_trace) remove_trace(entry); return ary; } else { while (trace) { if (trace->data == (void*)cmd) { trace->removed = 1; if (!entry->block_trace) remove_trace(entry); return ary_new3(1, cmd); } trace = trace->next; } } return Qnil; } VALUE rb_gvar_get(entry) struct global_entry *entry; { return (*entry->getter)(entry->id, entry->data, entry); } struct trace_data { struct trace_var *trace; VALUE val; }; static VALUE trace_ev(data) struct trace_data *data; { struct trace_var *trace = data->trace; while (trace) { (*trace->func)(trace->data, data->val); trace = trace->next; } } static VALUE trace_en(entry) struct global_entry *entry; { entry->block_trace = 0; remove_trace(entry); } VALUE rb_gvar_set(entry, val) struct global_entry *entry; VALUE val; { struct trace_data trace; if (rb_safe_level() >= 4) { Raise(eSecurityError, "cannot change global variable value"); } (*entry->setter)(val, entry->id, entry->data, entry); if (entry->trace && !entry->block_trace) { entry->block_trace = 1; trace.trace = entry->trace; trace.val = val; rb_ensure(trace_ev, (VALUE)&trace, trace_en, (VALUE)entry); } return val; } VALUE rb_gvar_set2(name, val) char *name; VALUE val; { struct global_entry *entry; entry = rb_global_entry(global_id(name)); return rb_gvar_set(entry, val); } VALUE rb_gvar_defined(entry) struct global_entry *entry; { if (entry->getter == undef_getter) return FALSE; return TRUE; } static int gvar_i(key, entry, ary) ID key; struct global_entry *entry; VALUE ary; { ary_push(ary, str_new2(rb_id2name(key))); return ST_CONTINUE; } VALUE f_global_variables() { VALUE ary = ary_new(); char buf[4]; char *s = "&`'+123456789"; st_foreach(global_tbl, gvar_i, ary); if (!NIL_P(backref_get())) { while (*s) { sprintf(buf, "$%c", *s++); ary_push(ary, str_new2(buf)); } } return ary; } void rb_alias_variable(name1, name2) ID name1; ID name2; { struct global_entry *entry1, *entry2; entry1 = rb_global_entry(name1); entry2 = rb_global_entry(name2); entry1->data = entry2->data; entry1->getter = entry2->getter; entry1->setter = entry2->setter; entry1->marker = entry2->marker; } VALUE rb_ivar_get(obj, id) VALUE obj; ID id; { VALUE val; switch (TYPE(obj)) { case T_OBJECT: case T_CLASS: case T_MODULE: if (ROBJECT(obj)->iv_tbl && st_lookup(ROBJECT(obj)->iv_tbl, id, &val)) return val; return Qnil; default: TypeError("class %s can not have instance variables", rb_class2name(CLASS_OF(obj))); break; } Warning("instance var %s not initialized", rb_id2name(id)); return Qnil; } VALUE rb_ivar_set(obj, id, val) VALUE obj; ID id; VALUE val; { if (rb_safe_level() >= 5) { Raise(eSecurityError, "cannot change object status"); } switch (TYPE(obj)) { case T_OBJECT: case T_CLASS: case T_MODULE: if (!ROBJECT(obj)->iv_tbl) ROBJECT(obj)->iv_tbl = new_idhash(); st_insert(ROBJECT(obj)->iv_tbl, id, val); break; default: TypeError("class %s can not have instance variables", rb_class2name(CLASS_OF(obj))); break; } return val; } VALUE rb_ivar_defined(obj, id) VALUE obj; ID id; { if (!rb_is_instance_id(id)) return FALSE; switch (TYPE(obj)) { case T_OBJECT: case T_CLASS: case T_MODULE: if (ROBJECT(obj)->iv_tbl && st_lookup(ROBJECT(obj)->iv_tbl, id, 0)) return TRUE; break; } return FALSE; } static int ivar_i(key, entry, ary) ID key; struct global_entry *entry; VALUE ary; { if (rb_is_instance_id(key)) { ary_push(ary, str_new2(rb_id2name(key))); } return ST_CONTINUE; } VALUE obj_instance_variables(obj) VALUE obj; { VALUE ary; switch (TYPE(obj)) { case T_OBJECT: case T_CLASS: case T_MODULE: ary = ary_new(); if (ROBJECT(obj)->iv_tbl) { st_foreach(ROBJECT(obj)->iv_tbl, ivar_i, ary); } return ary; } return Qnil; } VALUE obj_remove_instance_variable(obj, name) VALUE obj, name; { VALUE val = Qnil; ID id = rb_to_id(name); if (!rb_is_instance_id(id)) { NameError("`%s' is not an instance variable", rb_id2name(id)); } switch (TYPE(obj)) { case T_OBJECT: case T_CLASS: case T_MODULE: if (ROBJECT(obj)->iv_tbl) { st_delete(ROBJECT(obj)->iv_tbl, &id, &val); } break; default: TypeError("object %s can not have instance variables", rb_class2name(CLASS_OF(obj))); break; } return val; } VALUE rb_const_get_at(klass, id) VALUE klass; ID id; { VALUE value; if (RCLASS(klass)->iv_tbl && st_lookup(RCLASS(klass)->iv_tbl, id, &value)) { return value; } if (klass == cObject) { return rb_const_get(klass, id); } NameError("Uninitialized constant %s::%s", RSTRING(rb_class_path(klass))->ptr, rb_id2name(id)); /* not reached */ } VALUE rb_const_get(klass, id) VALUE klass; ID id; { VALUE value; VALUE tmp; tmp = klass; while (tmp) { if (RCLASS(tmp)->iv_tbl && st_lookup(RCLASS(tmp)->iv_tbl,id,&value)) { return value; } tmp = RCLASS(tmp)->super; } if (BUILTIN_TYPE(klass) == T_MODULE) { return rb_const_get(cObject, id); } /* pre-defined class */ if (st_lookup(class_tbl, id, &value)) return value; /* autoload */ if (autoload_tbl && st_lookup(autoload_tbl, id, 0)) { char *modname; VALUE module; st_delete(autoload_tbl, &id, &modname); module = str_new2(modname); free(modname); f_require(0, module); return rb_const_get(klass, id); } /* Uninitialized constant */ if (klass && klass != cObject) NameError("Uninitialized constant %s::%s", RSTRING(rb_class_path(klass))->ptr, rb_id2name(id)); else { NameError("Uninitialized constant %s",rb_id2name(id)); } /* not reached */ } static int const_i(key, value, ary) ID key; VALUE value; VALUE ary; { if (rb_is_const_id(key)) { VALUE kval = str_new2(rb_id2name(key)); if (!ary_includes(ary, kval)) { ary_push(ary, kval); } } return ST_CONTINUE; } VALUE mod_remove_const(mod, name) VALUE mod, name; { ID id = rb_to_id(name); VALUE val; if (!rb_is_const_id(id)) { NameError("`%s' is not constant", rb_id2name(id)); } if (RCLASS(mod)->iv_tbl && st_delete(ROBJECT(mod)->iv_tbl, &id, &val)) { return val; } if (rb_const_defined_at(mod, id)) { NameError("cannot remove %s::%s", rb_class2name(mod), rb_id2name(id)); } NameError("constant %s::%s not defined", rb_class2name(mod), rb_id2name(id)); } static int autoload_i(key, name, ary) ID key; char *name; VALUE ary; { VALUE kval = str_new2(rb_id2name(key)); if (!ary_includes(ary, kval)) { ary_push(ary, kval); } return ST_CONTINUE; } VALUE mod_const_at(mod, ary) VALUE mod, ary; { if (RCLASS(mod)->iv_tbl) { st_foreach(RCLASS(mod)->iv_tbl, const_i, ary); } if ((VALUE)mod == cObject) { st_foreach(class_tbl, const_i, ary); if (autoload_tbl) { st_foreach(autoload_tbl, autoload_i, ary); } } return ary; } VALUE mod_constants(mod) VALUE mod; { return mod_const_at(mod, ary_new()); } VALUE mod_const_of(mod, ary) VALUE mod; VALUE ary; { mod_const_at(mod, ary); for (;;) { mod = RCLASS(mod)->super; if (!mod) break; mod_const_at(mod, ary); } return ary; } int rb_const_defined_at(klass, id) VALUE klass; ID id; { if (RCLASS(klass)->iv_tbl && st_lookup(RCLASS(klass)->iv_tbl, id, 0)) { return TRUE; } if (klass == cObject) { return rb_const_defined(klass, id); } return FALSE; } int rb_autoload_defined(id) ID id; { if (autoload_tbl && st_lookup(autoload_tbl, id, 0)) return TRUE; return FALSE; } int rb_const_defined(klass, id) VALUE klass; ID id; { VALUE tmp = klass; while (tmp) { if (RCLASS(tmp)->iv_tbl && st_lookup(RCLASS(tmp)->iv_tbl,id,0)) { return TRUE; } tmp = RCLASS(tmp)->super; } if (BUILTIN_TYPE(klass) == T_MODULE) { return rb_const_defined(cObject, id); } if (st_lookup(class_tbl, id, 0)) return TRUE; return rb_autoload_defined(id); } void rb_const_set(klass, id, val) VALUE klass; ID id; VALUE val; { if (!RCLASS(klass)->iv_tbl) { RCLASS(klass)->iv_tbl = new_idhash(); } else if (st_lookup(RCLASS(klass)->iv_tbl, id, 0)) { NameError("already initialized constant %s", rb_id2name(id)); } st_insert(RCLASS(klass)->iv_tbl, id, val); } void rb_define_const(klass, name, val) VALUE klass; char *name; VALUE val; { ID id = rb_intern(name); if (!rb_is_const_id(id)) { NameError("wrong constant name %s", name); } rb_const_set(klass, id, val); } void rb_define_global_const(name, val) char *name; VALUE val; { rb_define_const(cObject, name, val); } VALUE rb_iv_get(obj, name) VALUE obj; char *name; { ID id = rb_intern(name); return rb_ivar_get(obj, id); } VALUE rb_iv_set(obj, name, val) VALUE obj; char *name; VALUE val; { ID id = rb_intern(name); return rb_ivar_set(obj, id, val); } ruby-1.2.3/version.c100644 774 145 1321 6457652045 12376 0ustar matzNaCl/************************************************ version.c - $Author: matz $ $Revision: 1.1.1.2.2.1 $ $Date: 1998/01/16 12:35:49 $ created at: Thu Sep 30 20:08:01 JST 1993 Copyright (C) 1993-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include "version.h" #include void Init_version() { rb_define_global_const("VERSION", str_new2(RUBY_VERSION)); rb_define_global_const("PLATFORM", str_new2(RUBY_PLATFORM)); } void show_version() { fprintf(stderr, "ruby %s(%s) [%s]\n", RUBY_VERSION, VERSION_DATE, RUBY_PLATFORM); } void show_copyright() { fprintf(stderr, "ruby - Copyright (C) 1993-1998 Yukihiro Matsumoto\n"); exit(0); } ruby-1.2.3/version.h100644 774 145 75 6662164417 12347 0ustar matzNaCl#define RUBY_VERSION "1.2.3" #define VERSION_DATE "99/02/16" ruby-1.2.3/beos/ 40755 774 145 0 6662164566 11407 5ustar matzNaClruby-1.2.3/beos/ruby.def.in100644 774 145 10255 6624740151 13561 0ustar matzNaClArgError Bug Error Error_Append Fail Fatal IndexError LoadError NameError Raise TypeError Warning any_to_s ary_assoc ary_concat ary_delete ary_delete_at ary_each ary_entry ary_freeze ary_includes ary_join ary_new ary_new2 ary_new3 ary_new4 ary_plus ary_pop ary_push ary_rassoc ary_reverse ary_shift ary_sort ary_sort_bang ary_store ary_to_s ary_unshift assoc_new backref_get backref_set big2dbl big2str big_2comp big_and big_clone big_lshift big_minus big_mul big_norm big_or big_plus big_pow big_rand big_to_f big_to_i big_xor cArray cBignum cClass cData cFile cFixnum cFixnum cFloat cHash cIO cInteger cModule cNumeric cObject cProc cRegexp cString cStruct class_new class_new_instance data_object_alloc dbl2big dln_find_exe dln_find_file dln_load dyna_var_asgn dyna_var_defined dyna_var_ref eaccess enum_length eof_error exc_new exc_new2 exc_new3 f_autoload f_gets f_lambda f_load f_require file_open file_s_expand_path fix2str fix_to_s fix_upto flo_pow float_new gc_force_recycle gc_gc gc_mark gc_mark_frame gc_mark_global_tbl gc_mark_locations gc_mark_maybe gc_mark_threads gc_mark_trap_list gc_s_disable gc_s_enable hash_aref hash_aset hash_new id_attrset int2big int2inum io_binmode io_check_closed io_close io_fptr_finalize io_getc io_gets io_gets_method io_mode_flags io_readable io_reopen io_unbuffered io_ungetc io_writable io_write iterator_p lastline_get lastline_set memclear mod_constants module_new new_idhash nodeline nodetype num2fix num2int num2long num_coerce_bin num_upto num_zerodiv obj_alloc obj_as_string obj_call_init obj_equal obj_is_instance_of obj_is_kind_of range_beg_end range_new rb_Array rb_Float rb_Integer rb_String rb_add_method rb_alias rb_alias_variable rb_apply rb_autoload rb_autoload_defined rb_backtrace rb_call_inits rb_check_safe_str rb_check_type rb_class2name rb_class_of rb_class_path rb_clear_cache rb_const_defined rb_const_defined_at rb_const_get rb_const_get_at rb_const_set rb_define_alias rb_define_attr rb_define_class rb_define_class_id rb_define_class_under rb_define_const rb_define_global_const rb_define_global_function rb_define_hooked_variable rb_define_method rb_define_method_id rb_define_module rb_define_module_function rb_define_module_id rb_define_module_under rb_define_private_method rb_define_readonly_variable rb_define_singleton_method rb_define_variable rb_define_virtual_variable rb_each rb_ensure rb_eql rb_equal rb_eval_cmd rb_eval_string rb_exit rb_extend_object rb_fatal rb_fdopen rb_fopen rb_frame_last_func rb_funcall rb_funcall2 rb_get_kcode rb_global_entry rb_global_variable rb_gvar_defined rb_gvar_get rb_gvar_set rb_gvar_set2 rb_hash rb_id2name rb_include_module rb_inspect rb_intern rb_interrupt rb_is_const_id rb_is_instance_id rb_iterate rb_iv_get rb_iv_set rb_ivar_defined rb_ivar_get rb_ivar_set rb_load_file rb_method_boundp rb_name_class rb_newobj rb_notimplement rb_path2class rb_proc_exec rb_provide rb_raise rb_rescue rb_respond_to rb_safe_level rb_scan_args rb_secure rb_set_class_path rb_set_kcode rb_set_safe_level rb_singleton_class rb_special_const_p rb_str_setter rb_sys_fail rb_syswait rb_test_false_or_nil rb_to_id rb_trap_eval rb_trap_exec rb_trap_exit rb_type rb_undef_method rb_yield rb_yield_0 reg_last_match reg_match reg_match2 reg_match_last reg_match_post reg_match_pre reg_new reg_nth_defined reg_nth_match reg_regcomp reg_regsub reg_search ruby_init ruby_options ruby_process_options ruby_prog_init ruby_run ruby_script ruby_set_argv scan_hex scan_oct show_copyright show_version singleton_class_clone singleton_class_new st_add_direct st_copy st_delete st_delete_safe st_find_or_add st_foreach st_free_table st_init_numtable st_init_strtable st_init_table st_init_table_with_size st_insert st_lookup str2inum str2cstr str_cat str_cicmp str_cmp str_dup str_freeze str_hash str_inspect str_modify str_new str_new2 str_new3 str_new4 str_plus str_resize str_split str_substr str_taint str_tainted str_times str_upto struct_alloc struct_aref struct_aset struct_define struct_getmember struct_new thread_alone thread_create thread_fd_writable thread_interrupt thread_schedule thread_select thread_sleep thread_sleep_forever thread_wait_fd thread_wait_for time_new time_timeval uint2big uint2inum xcalloc xmalloc xrealloc eException eStandardError trap_immediate ruby-1.2.3/ext/ 40755 774 145 0 6662164600 11244 5ustar matzNaClruby-1.2.3/ext/Setup100644 774 145 133 6626502201 12332 0ustar matzNaCl#option nodynamic #GD #curses #dbm #etc #fcntl #kconv #md5 #socket #tkutil #tcltklib #gtk ruby-1.2.3/ext/Setup.dj100644 774 145 117 6457556235 12752 0ustar matzNaCloption nodynamic #GD #curses dbm #etc fcntl kconv marshal md5 #socket #tkutil ruby-1.2.3/ext/Setup.nt100644 774 145 120 6506077231 12755 0ustar matzNaCloption nodynamic #GD #curses #dbm #etc fcntl kconv #marshal md5 socket #tkutil ruby-1.2.3/ext/Setup.x68100644 774 145 117 6457556235 13002 0ustar matzNaCloption nodynamic #GD #curses dbm #etc fcntl kconv marshal md5 #socket #tkutil ruby-1.2.3/ext/aix_ld.rb100644 774 145 2670 6601355365 13136 0ustar matzNaCl#! /usr/local/bin/ruby def older(file1, file2) if !File.exist?(file1) then return TRUE end if !File.exist?(file2) then return FALSE end if File.mtime(file1) < File.mtime(file2) return TRUE end return FALSE end target = ARGV.shift unless target =~ /\.so/ STDERR.printf "wrong suffix specified\n" exit 1 end base = File.basename(target, ".so") entry="Init_#{base}" ldargs = "-e#{entry} -bI:../ruby.imp -bM:SRE -T512 -H512 -lc" def uniq(data) last=nil data.delete_if do |name| if last == name TRUE else last = name FALSE end end end def extract(nm, out) data = nm.readlines.collect{|line| line = line.split case line[1] when "B", "D", "T" line[2] else next end }.compact!.sort! uniq(data) exp = open(out, "w") for line in data exp.printf "%s\n", line end exp.close nm.close end if older("../ruby.imp", "../../miniruby") # nm = open("|/usr/ccs/bin/nm -Bex ../../*.o") # nm = open("|/usr/ccs/bin/nm -Bex ../../*.o") nm = open("|nm ../../*.o") extract(nm, "../ruby.imp") end objs = Dir["*.o"].join(" ") #nm = open("|/usr/ccs/bin/nm -Bex #{objs}") nm = open("|nm #{objs}") extract(nm, "#{base}.exp") #system format("/usr/ccs/bin/ld %s %s ",ldargs,ARGV.join(' ')) #system "/bin/rm -f #{base}.exp" #system "chmod o-rwx ${base}.so" p format("/usr/ccs/bin/ld %s %s ",ldargs,ARGV.join(' ')) p "/bin/rm -f #{base}.exp" p "chmod o-rwx ${base}.so" ruby-1.2.3/ext/cygwin32_ld.rb100644 774 145 3760 6472524116 14021 0ustar matzNaCl#!/usr/local/bin/ruby require '../../rbconfig' include Config args = ARGV.join(" ") objs = [] flags = [] libname = '' Init = "../init" path = '' def writeInit out = open("#{Init}.c", "w") out.print %q@ #include #include extern struct _reent *__imp_reent_data; WINAPI dll_entry(int a, int b, int c) { _impure_ptr =__imp_reent_data; return 1; } main(){} //void impure_setup(struct _reent *_impure_ptrMain) //{ // _impure_ptr =__imp_reent_data; //} @ out.close end def xsystem cmd print cmd, "\n" system cmd end if args =~ /-o (\w+)\.dll/i libname = $1 # Check for path: if libname =~ /(\w+\/)(\w+)$/ path = $1 libname = $2 end for arg in ARGV case arg when /\.[oa]$/i objs.push(arg) when /-o/, /\w+\.dll/i ; else flags << arg end end writeInit unless FileTest.exist?("#{Init}.c") unless FileTest.exist?("#{Init}.o") and File.mtime("#{Init}.c") < File.mtime("#{Init}.o") xsystem "gcc -c #{Init}.c -o #{Init}.o" end command = "echo EXPORTS > #{libname}.def" xsystem command # xsystem "echo impure_setup >> #{libname}.def" xsystem "nm --extern-only " + objs.join(" ") + " | sed -n '/^........ [CDT] _/s///p' >> #{libname}.def" command = "gcc -nostdlib -o junk.o -Wl,--base-file,#{libname}.base,--dll " + objs.join(" ") + " #{Init}.o " command.concat(flags.join(" ") + " -Wl,-e,_dll_entry@12 -lcygwin -lkernel32 #{CONFIG['srcdir']}/libruby.a") xsystem command command = "dlltool --as=as --dllname #{libname}.dll --def #{libname}.def --base-file #{libname}.base --output-exp #{libname}.exp" xsystem command command = "gcc -s -nostdlib -o #{libname}.dll -Wl,--dll #{libname}.exp " + objs.join(" ") + " #{Init}.o " command.concat(flags.join(" ") + " -Wl,-e,_dll_entry@12 -lcygwin -lkernel32 #{CONFIG['srcdir']}/libruby.a") xsystem command File.unlink "junk.o" if FileTest.exist? "junk.o" else # no special processing, just call ld xsystem "ld #{args}" end ruby-1.2.3/ext/extmk.rb.in100644 774 145 26607 6652756660 13472 0ustar matzNaCl#! /usr/local/bin/ruby $".push 'mkmf.rb' #" load '@top_srcdir@/lib/find.rb' if ARGV[0] == 'static' $force_static = TRUE ARGV.shift elsif ARGV[0] == 'install' $install = TRUE $destdir = ARGV[1] || '' ARGV.shift elsif ARGV[0] == 'clean' $clean = TRUE ARGV.shift end $extlist = [] $cache_mod = FALSE; $lib_cache = {} $func_cache = {} $hdr_cache = {} $top_srcdir = "@top_srcdir@" if $top_srcdir !~ "^/" # get absolute path save = Dir.pwd Dir.chdir $top_srcdir $top_srcdir = Dir.pwd Dir.chdir save end $topdir = ".." if $topdir !~ "^/" # get absolute path save = Dir.pwd Dir.chdir $topdir $topdir = Dir.pwd Dir.chdir save end $dots = if "@INSTALL@" =~ /^\// then "" else "#{$topdir}/ext/" end if File.exist?("config.cache") then f = open("config.cache", "r") while f.gets case $_ when /^lib: (.+) (yes|no)/ $lib_cache[$1] = $2 when /^func: ([\w_]+) (yes|no)/ $func_cache[$1] = $2 when /^hdr: (.+) (yes|no)/ $hdr_cache[$1] = $2 end end f.close end def older(file1, file2) if !File.exist?(file1) then return TRUE end if !File.exist?(file2) then return FALSE end if File.mtime(file1) < File.mtime(file2) return TRUE end return FALSE end if PLATFORM == "m68k-human" CFLAGS = "@CFLAGS@".gsub(/-c..-stack=[0-9]+ */, '') else CFLAGS = "@CFLAGS@" end LINK = "@CC@ -o conftest -I#{$topdir} -I#{$top_srcdir} -I@includedir@ " + CFLAGS + " %s @LDFLAGS@ %s conftest.c @LIBS@ %s" CPP = "@CPP@ @CPPFLAGS@ -I#{$topdir} -I#{$top_srcdir} -I@includedir@ " + CFLAGS + " %s conftest.c" if /cygwin|mswin32|djgpp|mingw32|m68k-human/i =~ PLATFORM $null = open("nul", "w") else $null = open("/dev/null", "w") end $orgerr = $stderr.dup $orgout = $stdout.dup def xsystem command if $DEBUG return system(command) end $stderr.reopen($null) $stdout.reopen($null) r = system(command) $stderr.reopen($orgerr) $stdout.reopen($orgout) return r end def try_link(libs) xsystem(format(LINK, $CFLAGS, $LDFLAGS, libs)) end def try_cpp xsystem(format(CPP, $CFLAGS)) end def install_rb(mfile) path = [] dir = [] Find.find("lib") do |f| next unless /\.rb$/ =~ f f = f[4..-1] path.push f dir |= File.dirname(f) end for f in dir next if f == "." mfile.printf "\t@test -d $(DESTDIR)$(pkglibdir)/%s || mkdir $(DESTDIR)$(pkglibdir)/%s\n", f, f end for f in path mfile.printf "\t$(INSTALL_DATA) lib/%s $(DESTDIR)$(pkglibdir)/%s\n", f, f end end def have_library(lib, func) if $lib_cache[lib] if $lib_cache[lib] == "yes" if $libs $libs = "-l" + lib + " " + $libs else $libs = "-l" + lib end return TRUE else return FALSE end end cfile = open("conftest.c", "w") cfile.printf "\ int main() { return 0; } int t() { %s(); return 0; } ", func cfile.close begin if $libs libs = "-l" + lib + " " + $libs else libs = "-l" + lib end unless try_link(libs) $lib_cache[lib] = 'no' $cache_mod = TRUE return FALSE end ensure system "rm -f conftest*" end $libs = libs $lib_cache[lib] = 'yes' $cache_mod = TRUE return TRUE end def have_func(func) if $func_cache[func] if $func_cache[func] == "yes" $defs.push(format("-DHAVE_%s", func.upcase)) return TRUE else return FALSE end end cfile = open("conftest.c", "w") cfile.printf "\ char %s(); int main() { return 0; } int t() { %s(); return 0; } ", func, func cfile.close libs = $libs libs = "" if libs == nil begin unless try_link(libs) $func_cache[func] = 'no' $cache_mod = TRUE return FALSE end ensure system "rm -f conftest*" end $defs.push(format("-DHAVE_%s", func.upcase)) $func_cache[func] = 'yes' $cache_mod = TRUE return TRUE end def have_header(header) if $hdr_cache[header] if $hdr_cache[header] == "yes" header.tr!("a-z./\055", "A-Z___") $defs.push(format("-DHAVE_%s", header)) return TRUE else return FALSE end end cfile = open("conftest.c", "w") cfile.printf "\ #include <%s> ", header cfile.close begin unless try_cpp $hdr_cache[header] = 'no' $cache_mod = TRUE return FALSE end ensure system "rm -f conftest*" end $hdr_cache[header] = 'yes' header.tr!("a-z./\055", "A-Z___") $defs.push(format("-DHAVE_%s", header)) $cache_mod = TRUE return TRUE end def create_header() if $defs.length > 0 hfile = open("extconf.h", "w") for line in $defs line =~ /^-D(.*)/ hfile.printf "#define %s 1\n", $1 end hfile.close end end def create_makefile(target) if $libs and "@DLEXT@" == "o" libs = $libs.split for lib in libs lib.sub!(/-l(.*)/, '"lib\1.a"') end $defs.push(format("-DEXTLIB='%s'", libs.join(","))) end $DLDFLAGS = '@DLDFLAGS@' if PLATFORM =~ /beos/ if $libs $libs = $libs + " -lruby" else $libs = "-lruby" end $DLDFLAGS = $DLDFLAGS + " -L" + $topdir end $srcdir = $top_srcdir + "/ext/" + target mfile = open("Makefile", "w") mfile.printf "\ SHELL = /bin/sh #### Start of system configuration section. #### srcdir = #{$srcdir} VPATH = #{$srcdir} hdrdir = #{$topdir} CC = @CC@ prefix = @prefix@ CFLAGS = %s -I#{$topdir} -I#{$top_srcdir} -I@includedir@ %s #$CFLAGS %s DLDFLAGS = #$DLDFLAGS #$LDFLAGS LDSHARED = @LDSHARED@ ", if $static then "" else "@CCDLFLAGS@" end, CFLAGS, $defs.join(" ") mfile.printf "\ program_transform_name = -e @program_transform_name@ RUBY_INSTALL_NAME = `t='$(program_transform_name)'; echo ruby | sed $$t` prefix = @prefix@ exec_prefix = @exec_prefix@ libdir = @libdir@ pkglibdir = $(libdir)/$(RUBY_INSTALL_NAME) archdir = $(pkglibdir)/@arch@ @SET_MAKE@ #### End of system configuration section. #### " mfile.printf "LOCAL_LIBS = %s\n", $local_libs if $local_libs mfile.printf "LIBS = %s\n", $libs mfile.printf "OBJS = " if !$objs then $objs = [] for f in Dir["#{$top_srcdir}/ext/#{$mdir}/*.{c,cc}"] f = File.basename(f) f.sub!(/\.(c|cc)$/, ".o") $objs.push f end end mfile.printf $objs.join(" ") mfile.printf "\n" mfile.printf < /dev/null || true " elsif "@DLEXT@" != "o" mfile.printf "\ $(TARGET): $(OBJS) $(LDSHARED) $(DLDFLAGS) -o $(TARGET) $(OBJS) $(LOCAL_LIBS) $(LIBS) " elsif not File.exist?(target + ".c") and not File.exist?(target + ".cc") if PLATFORM == "m68k-human" mfile.printf "\ $(TARGET): $(OBJS) ar cru $(TARGET) $(OBJS) " elsif PLATFORM =~ "-nextstep" || PLATFORM =~ "-openstep" || PLATFORM =~ "-rhapsody" mfile.printf "\ $(TARGET): $(OBJS) cc -r $(CFLAGS) -o $(TARGET) $(OBJS) " else mfile.printf "\ $(TARGET): $(OBJS) ld $(DLDFLAGS) -r -o $(TARGET) $(OBJS) " end end if File.exist?("depend") dfile = open("depend", "r") mfile.printf "###\n" while line = dfile.gets() mfile.printf "%s", line end dfile.close end mfile.close if PLATFORM =~ /beos/ if PLATFORM =~ /^powerpc/ then deffilename = "ruby.exp" else deffilename = "ruby.def" end print "creating ruby.def\n" open(deffilename, "w") do |file| file.print("EXPORTS\n") if PLATFORM =~ /^i/ file.print("Init_#{target}\n") end end end def extmake(target) if $force_static or $static_ext[target] $static = target else $static = FALSE end return if $nodynamic and not $static $objs = nil $libs = PLATFORM =~ /cygwin|beos|openstep|nextstep|rhapsody/ ? nil : "-lc" $local_libs = nil # to be assigned in extconf.rb $CFLAGS = nil $LDFLAGS = nil begin system "mkdir", target unless File.directory?(target) Dir.chdir target $mdir = target if $static_ext.size > 0 || !File.exist?("./Makefile") || older("./Makefile", "#{$top_srcdir}/ext/@setup@") || older("./Makefile", "../extmk.rb") || older("./Makefile", "#{$top_srcdir}/ext/#{target}/extconf.rb") then $defs = [] if File.exist?("#{$top_srcdir}/ext/#{target}/extconf.rb") load "#{$top_srcdir}/ext/#{target}/extconf.rb" else create_makefile(target); end end if File.exist?("./Makefile") if $static $extlist.push [$static,target] end if $install system "make install DESTDIR=#{$destdir}" elsif $clean system "make clean" else system "make all" end end if $static $extlibs = "" unless $extlibs $extlibs += " " + $LDFLAGS if $LDFLAGS $extlibs += " " + $local_libs if $local_libs $extlibs += " " + $libs if $libs end ensure Dir.chdir ".." end end # get static-link modules $static_ext = {} for setup in ["@setup@", "#{$top_srcdir}/ext/@setup@"] if File.file? setup f = open(setup) while f.gets() $_.chomp! sub!(/#.*$/, '') next if /^\s*$/ if /^option +nodynamic/ $nodynamic = TRUE next end $static_ext[$_.split[0]] = TRUE end f.close break end end for d in Dir["#{$top_srcdir}/ext/*"] File.directory?(d) || next File.file?(d + "/MANIFEST") || next d = File.basename(d) if $install print "installing ", d, "\n" elsif $clean print "cleaning ", d, "\n" else print "compiling ", d, "\n" end extmake(d) end if $cache_mod f = open("config.cache", "w") for k,v in $lib_cache f.printf "lib: %s %s\n", k, v end for k,v in $func_cache f.printf "func: %s %s\n", k, v end for k,v in $hdr_cache f.printf "hdr: %s %s\n", k, v end f.close end exit if $install or $clean $extinit = "" unless $extinit if $extlist.size > 0 for s,t in $extlist f = format("%s/%s.a", s, t) if File.exist?(f) $extinit += format("\ \tInit_%s();\n\ \trb_provide(\"%s.o\");\n\ ", t, t) $extobjs = "" unless $extobjs $extobjs += "ext/" $extobjs += f $extobjs += " " else FALSE end end if older("extinit.c", "#{$top_srcdir}/ext/@setup@") f = open("extinit.c", "w") f.printf "void Init_ext() {\n" f.printf $extinit f.printf "}\n" f.close end if older("extinit.o", "extinit.c") cmd = "@CC@ " + CFLAGS + " -c extinit.c" print cmd, "\n" system cmd or exit 1 end Dir.chdir ".." if older("ruby@binsuffix@", "#{$top_srcdir}/ext/@setup@") or older("ruby@binsuffix@", "miniruby@binsuffix@") `rm -f ruby@binsuffix@` end if $extobjs $extobjs = "ext/extinit.o " + $extobjs else $extobjs = "ext/extinit.o " end if PLATFORM =~ /m68k-human|beos/ $extlibs.gsub!("-L/usr/local/lib", "") if $extlibs end system format('make ruby@binsuffix@ EXTOBJS="%s" EXTLIBS="%s"', $extobjs, $extlibs) else Dir.chdir ".." if older("ruby@binsuffix@", "miniruby@binsuffix@") `rm -f ruby@binsuffix@` system("make ruby@binsuffix@") end end #Local variables: # mode: ruby #end: ruby-1.2.3/ext/extmk.rb.nt100644 774 145 22644 6541406200 13455 0ustar matzNaCl#! /usr/local/bin/ruby $".push 'mkmf.rb' #" if ARGV[0] == 'static' $force_static = TRUE ARGV.shift elsif ARGV[0] == 'install' $install = TRUE ARGV.shift elsif ARGV[0] == 'clean' $clean = TRUE ARGV.shift end $extlist = [] $cache_mod = FALSE; $lib_cache = {} $func_cache = {} $hdr_cache = {} #$dllopt = '-MD' $dllopt = '' if File.exist?("config.cache") then f = open("config.cache", "r") while f.gets case $_ when /^lib: ([\w_]+) (yes|no)/ $lib_cache[$1] = $2 when /^func: ([\w_]+) (yes|no)/ $func_cache[$1] = $2 when /^hdr: (.+) (yes|no)/ $hdr_cache[$1] = $2 end end f.close end def older(file1, file2) if !File.exist?(file1) then return TRUE end if !File.exist?(file2) then return FALSE end if File.mtime(file1) < File.mtime(file2) return TRUE end return FALSE end #LINK = "cl -o conftest.exe -I../.. -Zi -O -I. %s conftest.c %s > nul" LINK = "cl -o conftest.exe -Zi -O %s conftest.c %s > nul" CPP = "cl -E -I../.. -I../../missing -I../../win32 -I. -Zi -O %s conftest.c > nul" def try_link(libs) #print(format("try #{LINK}", $CFLAGS, $LDFLAGS, libs)) #system(format(LINK, $CFLAGS, $LDFLAGS, libs)) print(format("try #{LINK}\n", $CFLAGS, libs)) system(format(LINK, $CFLAGS, libs)) end def try_cpp system(format(CPP, $CFLAGS)) end def have_library(lib, func) #print format("have_library(%s, %s)\n", lib, func) if $lib_cache[lib] if $lib_cache[lib] == "yes" if $libs# $libs = lib + ".lib " + $libs else $libs = lib + ".lib " end return TRUE else return FALSE end end cfile = open("conftest.c", "w") cfile.printf "\ #include #include int main() { return 0; } int t() { %s(); return 0; } ", func cfile.close begin if $libs libs = lib + ".lib " + $libs else libs = lib + ".lib" end #print "libs=#{libs}\n" unless try_link(libs) #print "fail : #{libs}\n" $lib_cache[lib] = 'no' $cache_mod = TRUE return FALSE end ensure system "rm -f conftest*" end $libs = libs $lib_cache[lib] = 'yes' $cache_mod = TRUE return TRUE end def have_func(func) if $func_cache[func] if $func_cache[func] == "yes" $defs.push(format("-DHAVE_%s", func.upcase)) return TRUE else return FALSE end end cfile = open("conftest.c", "w") cfile.printf "\ #include #include //char %s(); int main() { return 0; } int t() { %s(); return 0; } ", func, func cfile.close libs = $libs libs = "" if libs == nil begin #print "libs=#{libs}\n" unless try_link(libs) $func_cache[func] = 'no' $cache_mod = TRUE return FALSE end ensure system "rm -f conftest*" end $defs.push(format("-DHAVE_%s", func.upcase)) $func_cache[func] = 'yes' $cache_mod = TRUE return TRUE end def have_header(header) if $hdr_cache[header] if $hdr_cache[header] == "yes" header.tr!("a-z./\055", "A-Z___") $defs.push(format("-DHAVE_%s", header)) return TRUE else return FALSE end end cfile = open("conftest.c", "w") cfile.printf "\ #include <%s> ", header cfile.close begin unless try_cpp $hdr_cache[header] = 'no' $cache_mod = TRUE return FALSE end ensure system "rm -f conftest*" end $hdr_cache[header] = 'yes' header.tr!("a-z./\055", "A-Z___") $defs.push(format("-DHAVE_%s", header)) $cache_mod = TRUE return TRUE end def create_header() if $defs.length > 0 hfile = open("extconf.h", "w") for line in $defs line =~ /^-D(.*)/ hfile.printf "#define %s 1\n", $1 end hfile.close end end def create_makefile(target) if $libs and "obj" == "obj" libs = $libs.split for lib in libs lib.sub!(/(.*)/, '"\1.lib"') if /.lib$/ !~ lib end $defs.push(format("-DEXTLIB='%s'", libs.join(","))) end $libs = "" unless $libs mfile = open("Makefile", "w") mfile.printf "\ SHELL = $(COMPSEC) #### Start of system configuration section. #### srcdir = . VPATH = . CC = cl CFLAGS = %s -I../.. -I../../missing -I../../win32 -I. -O -DNT %s #$CFLAGS %s RUBYLIB = ../../ruby.lib DLDFLAGS = /DLL LDSHARED = ", if $static then "" else "-fpic" end, $dllopt, $defs.join(" ") if $force_static print "static\n" else print "non static\n" end mfile.printf "\ libdir = /usr/local/lib/ruby/i386-mswin32 #### End of system configuration section. #### " mfile.printf "LOCAL_LIBS = %s\n", $local_libs if $local_libs mfile.printf "LIBS = %s\n", $libs mfile.printf "OBJS = " if !$objs then $objs = Dir["*.c"] for f in $objs f.sub!(/\.c$/, ".obj") end end mfile.printf $objs.join(" ") mfile.printf "\n" dots = if "ginstall -c" =~ /^\// then "" else "../" end mfile.printf "\ TARGET = %s.%s INSTALL = %sginstall -c DEFFILE = %s.def all: $(TARGET) clean:; @rm -f *.obj *.lib *.exp vc*.pdb *.bak *.def @rm -f Makefile extconf.h conftest.* realclean: clean ", target, if $force_static then "lib" else "dll" end, dots, target if !$static mfile.printf "\ install: $(libdir)/$(TARGET) $(libdir)/$(TARGET): $(TARGET) @test -d $(libdir) || mkdir $(libdir) $(INSTALL) $(TARGET) $(libdir)/$(TARGET) " else mfile.printf "\ install:; " end if $force_static mfile.printf "\ $(TARGET): $(OBJS) lib /OUT:$(TARGET) $(OBJS) " else mfile.printf "\ $(DEFFILE): echo $(DEFFILE) $(TARGET): $(OBJS) $(DEFFILE) cl -DLL -o$(TARGET) $(OBJS) $(RUBYLIB) -link /DEF:$(DEFFILE) " end if File.exist?("depend") dfile = open("depend", "r") mfile.printf "###\n" while line = dfile.gets() mfile.printf "%s", line end dfile.close end mfile.close if $static #printf format("push %s,%s\n", $static, target); ##debug print## $extlist.push [$static,target] end end #template of .def file. def create_def(basename) defname = sprintf("%s.def", basename) f = open(defname, "w") f.printf "\ LIBRARY %s.dll CODE LOADONCALL DATA LOADONCALL DESCRIPTION 'win32 %s.dll' EXPORTS Init_%s ", basename, basename, basename f.close end def extmake(target) if $force_static or $static_ext[target] $static = target else $static = FALSE end return if $nodynamic and not $static $local_libs = nil $libs = nil $objs = nil $CFLAGS = nil $LDFLAGS = nil begin Dir.chdir target if $static_ext.size > 0 || !File.exist?("./Makefile") || older("./Makefile", "../Setup") || older("./Makefile", "../extmk.rb") || older("./Makefile", "./extconf.rb") then $defs = [] if File.exist?("extconf.rb") load "extconf.rb" else create_makefile(target); end end if !File.exist?("#{target}.def") create_def(target) end if File.exist?("./Makefile") if $install system "nmake install" if File.directory? "./lib" for i in Dir["./lib/*.rb"] system "ginstall -c #{i} /usr/local/lib/ruby/i386-mswin32" end end elsif $clean system "nmake clean" else #print "!!!make!!!\n" system "nmake all" end end if $static $extlibs = " " $extlibs += " " + $LDFLAGS if $LDFLAGS $extlibs += " " + $local_libs if $local_libs $extlibs += " " + $libs if $libs end ensure Dir.chdir ".." end end # get static-link modules $static_ext = {} if File.file? "./Setup" f = open("./Setup") while f.gets() $_.chop! sub!(/#.*$/, '') next if /^\s*$/ #print $_, "\n" if /^option +nodynamic/ $nodynamic = TRUE next end $static_ext[$_.split[0]] = TRUE end f.close end for d in Dir["*"] File.directory?(d) || next File.file?(d + "/MANIFEST") || next d = $1 if d =~ /\/([\/]*)$/ if $install print "installing ", d, "\n" elsif $clean print "cleaning ", d, "\n" else print "compiling ", d, "\n" end extmake(d) end if $cache_mod f = open("config.cache", "w") for k,v in $lib_cache f.printf "lib: %s %s\n", k, v end for k,v in $func_cache f.printf "func: %s %s\n", k, v end for k,v in $hdr_cache f.printf "hdr: %s %s\n", k, v end f.close end exit if $install or $clean $extinit = " " unless $extinit $extobjs = "" if $extlist.size > 0 for s,t in $extlist #for s,t in $static_ext #f = format("%s/%s.obj", s, t) #f = format("%s/%s.obj", s, s) l = format("%s/%s.lib", s, s) if File.exist?(l) $extinit += format("\ \tInit_%s();\n\ \trb_provide(\"%s.o\");\n\ ", s, s) $extobjs += "ext/" #$extobjs += f # *.obj $extobjs += l # *.lib $extobjs += " " else FALSE end end if older("extinit.c", "Setup") f = open("extinit.c", "w") f.printf "void Init_ext() {\n" f.printf $extinit f.printf "}\n" f.close end if older("extinit.obj", "extinit.c") cmd = "cl -Zi -O -I. -c extinit.c" print cmd, "\n" system cmd or exit 1 end Dir.chdir ".." if older("ruby.exe", "ext/Setup") or older("ruby.exe", "miniruby.exe") `rm -f ruby.exe` end $extobjs = "ext/extinit.obj " + $extobjs #$extlibs = "" #print "EXTLIBS=#{$extlibs}\n" $extlibs.gsub!("-L/usr/local/lib", "") if $extlibs $extlibs.gsub!(" +", " ") if $extlibs #print "EXTLIBS=#{$extlibs}\n" system format('nmake ruby.exe EXTOBJS="%s" EXTLIBS="%s"', $extobjs, $extlibs) else Dir.chdir ".." if older("ruby.exe", "miniruby.exe") `rm -f ruby.exe` `cp miniruby.exe ruby.exe` end end #Local variables: # mode: ruby #end: ruby-1.2.3/ext/curses/ 40755 774 145 0 6662164573 12561 5ustar matzNaClruby-1.2.3/ext/curses/MANIFEST100644 774 145 66 6457556235 13753 0ustar matzNaClMANIFEST curses.c extconf.rb hello.rb rain.rb view.rb ruby-1.2.3/ext/curses/curses.c100644 774 145 35236 6611311345 14340 0ustar matzNaCl/* * ext/curses/curses.c * * by MAEDA Shugo (ender@pic-internet.or.jp) * modified by Yukihiro Matsumoto (matz@netlab.co.jp) */ #ifdef HAVE_NCURSES_H # include #else # ifdef HAVE_NCURSES_CURSES_H # include # else # include # if (defined(__bsdi__) || defined(__NetBSD__)) && !defined(_maxx) # define _maxx maxx # endif # if (defined(__bsdi__) || defined(__NetBSD__)) && !defined(_maxy) # define _maxy maxy # endif # if (defined(__bsdi__) || defined(__NetBSD__)) && !defined(_begx) # define _begx begx # endif # if (defined(__bsdi__) || defined(__NetBSD__)) && !defined(_begy) # define _begy begy # endif # endif #endif #include "ruby.h" static VALUE mCurses; static VALUE cWindow; VALUE rb_stdscr; struct windata { WINDOW *window; }; static void no_window() { Fail("already closed window"); } #define GetWINDOW(obj, winp) {\ Data_Get_Struct(obj, struct windata, winp);\ if (winp->window == 0) no_window();\ } #define CHECK(c) c static void free_window(winp) struct windata *winp; { if (winp->window && winp->window != stdscr) delwin(winp->window); winp->window = 0; free(winp); } static VALUE prep_window(class, window) VALUE class; WINDOW *window; { VALUE obj; struct windata *winp; if (window == NULL) { Fail("failed to create window"); } obj = Data_Make_Struct(class, struct windata, 0, free_window, winp); winp->window = window; return obj; } /*-------------------------- module Curses --------------------------*/ /* def init_screen */ static VALUE curses_init_screen() { initscr(); if (stdscr == 0) { Fail("cannot initialize curses"); } clear(); rb_stdscr = prep_window(cWindow, stdscr); return Qnil; } /* def stdscr */ static VALUE curses_stdscr() { if (rb_stdscr == 0) curses_init_screen(); return rb_stdscr; } /* def close_screen */ static VALUE curses_close_screen() { #ifdef HAVE_ISENDWIN if (!isendwin()) #endif endwin(); return Qnil; } static void curses_finalize() { if (stdscr #ifdef HAVE_ISENDWIN && !isendwin() #endif ) endwin(); } /* def closed? */ static VALUE curses_closed() { #ifdef HAVE_ISENDWIN if (isendwin()) { return TRUE; } return FALSE; #else rb_notimplement(); #endif } /* def clear */ static VALUE curses_clear(obj) VALUE obj; { wclear(stdscr); return Qnil; } /* def refresh */ static VALUE curses_refresh(obj) VALUE obj; { refresh(); return Qnil; } /* def doupdate */ static VALUE curses_doupdate(obj) VALUE obj; { #ifdef HAVE_DOUPDATE doupdate(); #else refresh(); #endif return Qnil; } /* def echo */ static VALUE curses_echo(obj) VALUE obj; { echo(); return Qnil; } /* def noecho */ static VALUE curses_noecho(obj) VALUE obj; { noecho(); return Qnil; } /* def raw */ static VALUE curses_raw(obj) VALUE obj; { raw(); return Qnil; } /* def noraw */ static VALUE curses_noraw(obj) VALUE obj; { noraw(); return Qnil; } /* def cbreak */ static VALUE curses_cbreak(obj) VALUE obj; { cbreak(); return Qnil; } /* def nocbreak */ static VALUE curses_nocbreak(obj) VALUE obj; { nocbreak(); return Qnil; } /* def nl */ static VALUE curses_nl(obj) VALUE obj; { nl(); return Qnil; } /* def nonl */ static VALUE curses_nonl(obj) VALUE obj; { nonl(); return Qnil; } /* def beep */ static VALUE curses_beep(obj) VALUE obj; { #ifdef HAVE_BEEP beep(); #endif return Qnil; } /* def flash */ static VALUE curses_flash(obj) VALUE obj; { #ifdef HAVE_FLASH flash(); #endif return Qnil; } /* def ungetch */ static VALUE curses_ungetch(obj, ch) VALUE obj; VALUE ch; { #ifdef HAVE_UNGETCH ungetch(NUM2INT(ch)); #else rb_notimplement(); #endif return Qnil; } /* def setpos(y, x) */ static VALUE curses_setpos(obj, y, x) VALUE obj; VALUE y; VALUE x; { move(NUM2INT(y), NUM2INT(x)); return Qnil; } /* def standout */ static VALUE curses_standout(obj) VALUE obj; { standout(); return Qnil; } /* def standend */ static VALUE curses_standend(obj) VALUE obj; { standend(); return Qnil; } /* def inch */ static VALUE curses_inch(obj) VALUE obj; { return CHR2FIX(inch()); } /* def addch(ch) */ static VALUE curses_addch(obj, ch) VALUE obj; VALUE ch; { addch(NUM2CHR(ch)); return Qnil; } /* def insch(ch) */ static VALUE curses_insch(obj, ch) VALUE obj; VALUE ch; { insch(NUM2CHR(ch)); return Qnil; } /* def addstr(str) */ static VALUE curses_addstr(obj, str) VALUE obj; VALUE str; { if (!NIL_P(str)) { addstr(STR2CSTR(str)); } return Qnil; } /* def getch */ static VALUE curses_getch(obj) VALUE obj; { return CHR2FIX(getch()); } /* def getstr */ static VALUE curses_getstr(obj) VALUE obj; { char rtn[1024]; /* This should be big enough.. I hope */ getstr(rtn); return str_taint(str_new2(rtn)); } /* def delch */ static VALUE curses_delch(obj) VALUE obj; { delch(); return Qnil; } /* def delelteln */ static VALUE curses_deleteln(obj) VALUE obj; { deleteln(); return Qnil; } static VALUE curses_lines() { return INT2FIX(LINES); } static VALUE curses_cols() { return INT2FIX(COLS); } /*-------------------------- class Window --------------------------*/ /* def new(lines, cols, top, left) */ static VALUE window_s_new(class, lines, cols, top, left) VALUE class; VALUE lines; VALUE cols; VALUE top; VALUE left; { VALUE w; WINDOW *window; window = newwin(NUM2INT(lines), NUM2INT(cols), NUM2INT(top), NUM2INT(left)); wclear(window); w = prep_window(class, window); obj_call_init(w); return w; } /* def subwin(lines, cols, top, left) */ static VALUE window_subwin(obj, lines, cols, top, left) VALUE obj; VALUE lines; VALUE cols; VALUE top; VALUE left; { struct windata *winp; WINDOW *window; GetWINDOW(obj, winp); window = subwin(winp->window, NUM2INT(lines), NUM2INT(cols), NUM2INT(top), NUM2INT(left)); return prep_window(cWindow, window); } /* def close */ static VALUE window_close(obj) VALUE obj; { struct windata *winp; GetWINDOW(obj, winp); delwin(winp->window); winp->window = 0; return Qnil; } /* def clear */ static VALUE window_clear(obj) VALUE obj; { struct windata *winp; GetWINDOW(obj, winp); wclear(winp->window); return Qnil; } /* def refresh */ static VALUE window_refresh(obj) VALUE obj; { struct windata *winp; GetWINDOW(obj, winp); wrefresh(winp->window); return Qnil; } /* def box(vert, hor) */ static VALUE window_box(obj, vert, hor) VALUE obj; VALUE vert; VALUE hor; { struct windata *winp; GetWINDOW(obj, winp); box(winp->window, NUM2CHR(vert), NUM2CHR(hor)); return Qnil; } /* def move(y, x) */ static VALUE window_move(obj, y, x) VALUE obj; VALUE y; VALUE x; { struct windata *winp; GetWINDOW(obj, winp); mvwin(winp->window, NUM2INT(y), NUM2INT(x)); return Qnil; } /* def setpos(y, x) */ static VALUE window_setpos(obj, y, x) VALUE obj; VALUE y; VALUE x; { struct windata *winp; GetWINDOW(obj, winp); wmove(winp->window, NUM2INT(y), NUM2INT(x)); return Qnil; } /* def cury */ static VALUE window_cury(obj) VALUE obj; { struct windata *winp; int x, y; GetWINDOW(obj, winp); getyx(winp->window, y, x); return INT2FIX(y); } /* def curx */ static VALUE window_curx(obj) VALUE obj; { struct windata *winp; int x, y; GetWINDOW(obj, winp); getyx(winp->window, y, x); return INT2FIX(x); } /* def maxy */ static VALUE window_maxy(obj) VALUE obj; { struct windata *winp; int x, y; GetWINDOW(obj, winp); #ifdef getmaxy return INT2FIX(getmaxy(winp->window)); #else #ifdef getmaxyx getmaxyx(winp->window, y, x); return INT2FIX(y); #else return INT2FIX(winp->window->_maxy+1); #endif #endif } /* def maxx */ static VALUE window_maxx(obj) VALUE obj; { struct windata *winp; int x, y; GetWINDOW(obj, winp); #ifdef getmaxx return INT2FIX(getmaxx(winp->window)); #else #ifdef getmaxyx getmaxyx(winp->window, y, x); return INT2FIX(x); #else return INT2FIX(winp->window->_maxx+1); #endif #endif } /* def begy */ static VALUE window_begy(obj) VALUE obj; { struct windata *winp; int x, y; GetWINDOW(obj, winp); #ifdef getbegyx getbegyx(winp->window, y, x); return INT2FIX(y); #else return INT2FIX(winp->window->_begy); #endif } /* def begx */ static VALUE window_begx(obj) VALUE obj; { struct windata *winp; int x, y; GetWINDOW(obj, winp); #ifdef getbegyx getbegyx(winp->window, y, x); return INT2FIX(x); #else return INT2FIX(winp->window->_begx); #endif } /* def standout */ static VALUE window_standout(obj) VALUE obj; { struct windata *winp; GetWINDOW(obj, winp); wstandout(winp->window); return Qnil; } /* def standend */ static VALUE window_standend(obj) VALUE obj; { struct windata *winp; GetWINDOW(obj, winp); wstandend(winp->window); return Qnil; } /* def inch */ static VALUE window_inch(obj) VALUE obj; { struct windata *winp; GetWINDOW(obj, winp); return CHR2FIX(winch(winp->window)); } /* def addch(ch) */ static VALUE window_addch(obj, ch) VALUE obj; VALUE ch; { struct windata *winp; GetWINDOW(obj, winp); waddch(winp->window, NUM2CHR(ch)); return Qnil; } /* def insch(ch) */ static VALUE window_insch(obj, ch) VALUE obj; VALUE ch; { struct windata *winp; GetWINDOW(obj, winp); winsch(winp->window, NUM2CHR(ch)); return Qnil; } /* def addstr(str) */ static VALUE window_addstr(obj, str) VALUE obj; VALUE str; { if (!NIL_P(str)) { struct windata *winp; GetWINDOW(obj, winp); waddstr(winp->window, STR2CSTR(str)); } return Qnil; } /* def <<(str) */ static VALUE window_addstr2(obj, str) VALUE obj; VALUE str; { window_addstr(obj, str); return obj; } /* def getch */ static VALUE window_getch(obj) VALUE obj; { struct windata *winp; GetWINDOW(obj, winp); return CHR2FIX(wgetch(winp->window)); } /* def getstr */ static VALUE window_getstr(obj) VALUE obj; { struct windata *winp; char rtn[1024]; /* This should be big enough.. I hope */ GetWINDOW(obj, winp); wgetstr(winp->window, rtn); return str_taint(str_new2(rtn)); } /* def delch */ static VALUE window_delch(obj) VALUE obj; { struct windata *winp; GetWINDOW(obj, winp); wdelch(winp->window); return Qnil; } /* def delelteln */ static VALUE window_deleteln(obj) VALUE obj; { struct windata *winp; GetWINDOW(obj, winp); wdeleteln(winp->window); return Qnil; } /*------------------------- Initialization -------------------------*/ void Init_curses() { mCurses = rb_define_module("Curses"); rb_define_module_function(mCurses, "init_screen", curses_init_screen, 0); rb_define_module_function(mCurses, "close_screen", curses_close_screen, 0); rb_define_module_function(mCurses, "closed?", curses_closed, 0); rb_define_module_function(mCurses, "stdscr", curses_stdscr, 0); rb_define_module_function(mCurses, "refresh", curses_refresh, 0); rb_define_module_function(mCurses, "doupdate", curses_doupdate, 0); rb_define_module_function(mCurses, "clear", curses_clear, 0); rb_define_module_function(mCurses, "echo", curses_echo, 0); rb_define_module_function(mCurses, "noecho", curses_noecho, 0); rb_define_module_function(mCurses, "raw", curses_raw, 0); rb_define_module_function(mCurses, "noraw", curses_noraw, 0); rb_define_module_function(mCurses, "cbreak", curses_cbreak, 0); rb_define_module_function(mCurses, "nocbreak", curses_nocbreak, 0); rb_define_alias(mCurses, "crmode", "cbreak"); rb_define_alias(mCurses, "nocrmode", "nocbreak"); rb_define_module_function(mCurses, "nl", curses_nl, 0); rb_define_module_function(mCurses, "nonl", curses_nonl, 0); rb_define_module_function(mCurses, "beep", curses_beep, 0); rb_define_module_function(mCurses, "flash", curses_flash, 0); rb_define_module_function(mCurses, "ungetch", curses_ungetch, 1); rb_define_module_function(mCurses, "setpos", curses_setpos, 2); rb_define_module_function(mCurses, "standout", curses_standout, 0); rb_define_module_function(mCurses, "standend", curses_standend, 0); rb_define_module_function(mCurses, "inch", curses_inch, 0); rb_define_module_function(mCurses, "addch", curses_addch, 1); rb_define_module_function(mCurses, "insch", curses_insch, 1); rb_define_module_function(mCurses, "addstr", curses_addstr, 1); rb_define_module_function(mCurses, "getch", curses_getch, 0); rb_define_module_function(mCurses, "getstr", curses_getstr, 0); rb_define_module_function(mCurses, "delch", curses_delch, 0); rb_define_module_function(mCurses, "deleteln", curses_deleteln, 0); rb_define_module_function(mCurses, "lines", curses_lines, 0); rb_define_module_function(mCurses, "cols", curses_cols, 0); cWindow = rb_define_class_under(mCurses, "Window", cObject); rb_define_singleton_method(cWindow, "new", window_s_new, 4); rb_define_method(cWindow, "subwin", window_subwin, 4); rb_define_method(cWindow, "close", window_close, 0); rb_define_method(cWindow, "clear", window_clear, 0); rb_define_method(cWindow, "refresh", window_refresh, 0); rb_define_method(cWindow, "box", window_box, 2); rb_define_method(cWindow, "move", window_move, 2); rb_define_method(cWindow, "setpos", window_setpos, 2); rb_define_method(cWindow, "cury", window_cury, 0); rb_define_method(cWindow, "curx", window_curx, 0); rb_define_method(cWindow, "maxy", window_maxy, 0); rb_define_method(cWindow, "maxx", window_maxx, 0); rb_define_method(cWindow, "begy", window_begy, 0); rb_define_method(cWindow, "begx", window_begx, 0); rb_define_method(cWindow, "standout", window_standout, 0); rb_define_method(cWindow, "standend", window_standend, 0); rb_define_method(cWindow, "inch", window_inch, 0); rb_define_method(cWindow, "addch", window_addch, 1); rb_define_method(cWindow, "insch", window_insch, 1); rb_define_method(cWindow, "addstr", window_addstr, 1); rb_define_method(cWindow, "<<", window_addstr2, 1); rb_define_method(cWindow, "getch", window_getch, 0); rb_define_method(cWindow, "getstr", window_getstr, 0); rb_define_method(cWindow, "delch", window_delch, 0); rb_define_method(cWindow, "deleteln", window_deleteln, 0); rb_set_end_proc(curses_finalize, 0); } ruby-1.2.3/ext/curses/extconf.rb100644 774 145 1031 6611254653 14635 0ustar matzNaClrequire 'mkmf' $CFLAGS="-I/usr/include/ncurses -I/usr/local/include/ncurses" $LDFLAGS="-L/usr/local/lib" make=FALSE if have_header("ncurses.h") and have_library("ncurses", "initscr") make=TRUE elsif have_header("ncurses/curses.h") and have_library("ncurses", "initscr") make=TRUE else $CFLAGS=nil have_library("termcap", "tgetent") if have_library("curses", "initscr") make=TRUE end end if make then for f in ["isendwin", "ungetch", "beep", "doupdate", "flash"] have_func(f) end create_makefile("curses") end ruby-1.2.3/ext/curses/hello.rb100644 774 145 757 6513115325 14261 0ustar matzNaCl#!/usr/local/bin/ruby require "curses" include Curses def show_message(message) width = message.length + 6 win = Window.new(5, width, (lines - 5) / 2, (cols - width) / 2) win.box(?|, ?=) win.setpos(2, 3) win.addstr(message) win.refresh win.getch win.close end init_screen begin crmode # show_message("Hit any key") setpos((lines - 5) / 2, (cols - 10) / 2) addstr("Hit any key") refresh getch show_message("Hello, World!") refresh ensure close_screen end ruby-1.2.3/ext/curses/rain.rb100644 774 145 2777 6457556235 14153 0ustar matzNaCl#!/usr/local/bin/ruby # rain for a curses test require "curses" include Curses def onsig(sig) close_screen exit sig end def ranf rand(32767).to_f / 32767 end # main # for i in 1 .. 15 # SIGHUP .. SIGTERM if trap(i, "SIG_IGN") != 0 then # 0 for SIG_IGN trap(i) {|sig| onsig(sig) } end end init_screen nl noecho srand xpos = {} ypos = {} r = lines - 4 c = cols - 4 for i in 0 .. 4 xpos[i] = (c * ranf).to_i + 2 ypos[i] = (r * ranf).to_i + 2 end i = 0 while TRUE x = (c * ranf).to_i + 2 y = (r * ranf).to_i + 2 setpos(y, x); addstr(".") setpos(ypos[i], xpos[i]); addstr("o") i = if i == 0 then 4 else i - 1 end setpos(ypos[i], xpos[i]); addstr("O") i = if i == 0 then 4 else i - 1 end setpos(ypos[i] - 1, xpos[i]); addstr("-") setpos(ypos[i], xpos[i] - 1); addstr("|.|") setpos(ypos[i] + 1, xpos[i]); addstr("-") i = if i == 0 then 4 else i - 1 end setpos(ypos[i] - 2, xpos[i]); addstr("-") setpos(ypos[i] - 1, xpos[i] - 1); addstr("/ \\") setpos(ypos[i], xpos[i] - 2); addstr("| O |") setpos(ypos[i] + 1, xpos[i] - 1); addstr("\\ /") setpos(ypos[i] + 2, xpos[i]); addstr("-") i = if i == 0 then 4 else i - 1 end setpos(ypos[i] - 2, xpos[i]); addstr(" ") setpos(ypos[i] - 1, xpos[i] - 1); addstr(" ") setpos(ypos[i], xpos[i] - 2); addstr(" ") setpos(ypos[i] + 1, xpos[i] - 1); addstr(" ") setpos(ypos[i] + 2, xpos[i]); addstr(" ") xpos[i] = x ypos[i] = y refresh sleep(0.5) end # end of main ruby-1.2.3/ext/curses/view.rb100644 774 145 2160 6506077153 14146 0ustar matzNaCl#!/usr/local/bin/ruby require "curses" include Curses # # main # if ARGV.size != 1 then printf("usage: view file\n"); exit end begin fp = open(ARGV[0], "r") rescue raise "cannot open file: #{ARGV[1]}" end # signal(SIGINT, finish) init_screen #keypad(stdscr, TRUE) nonl cbreak noecho #scrollok(stdscr, TRUE) # slurp the file data_lines = [] fp.each_line { |l| data_lines.push(l) } fp.close lptr = 0 while TRUE i = 0 while i < lines setpos(i, 0) #clrtoeol addstr(data_lines[lptr + i]) #if data_lines[lptr + i] i += 1 end refresh explicit = FALSE n = 0 while TRUE c = getch.chr if c =~ "[0-9]" then n = 10 * n + c.to_i else break end end n = 1 if !explicit && n == 0 case c when "n" #when KEY_DOWN i = 0 while i < n if lptr + lines < data_lines.size then lptr += 1 else break end i += 1 end #wscrl(i) when "p" #when KEY_UP i = 0 while i < n if lptr > 0 then lptr -= 1 else break end i += 1 end #wscrl(-i) when "q" break end end close_screen ruby-1.2.3/ext/dbm/ 40755 774 145 0 6662164573 12017 5ustar matzNaClruby-1.2.3/ext/dbm/MANIFEST100644 774 145 41 6457556235 13202 0ustar matzNaClMANIFEST dbm.c depend extconf.rb ruby-1.2.3/ext/dbm/dbm.c100644 774 145 27461 6526245462 13050 0ustar matzNaCl/************************************************ dbm.c - $Author: matz $ $Date: 1998/05/13 07:26:42 $ created at: Mon Jan 24 15:59:52 JST 1994 Copyright (C) 1995-1998 Yukihiro Matsumoto ************************************************/ #include "ruby.h" #include #include #include #ifdef USE_CWGUSI # include #endif VALUE cDBM; extern VALUE mEnumerable; struct dbmdata { int di_size; DBM *di_dbm; }; static void closed_dbm() { Fail("closed DBM file"); } #define GetDBM(obj, dbmp) {\ Data_Get_Struct(obj, struct dbmdata, dbmp);\ if (dbmp->di_dbm == 0) closed_dbm();\ } static void free_dbm(dbmp) struct dbmdata *dbmp; { if (dbmp->di_dbm) dbm_close(dbmp->di_dbm); free(dbmp); } static VALUE fdbm_s_open(argc, argv, class) int argc; VALUE *argv; VALUE class; { VALUE file, vmode; DBM *dbm; struct dbmdata *dbmp; 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_SafeStr(file); dbm = 0; 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 = Data_Make_Struct(class,struct dbmdata,0,free_dbm,dbmp); dbmp->di_dbm = dbm; dbmp->di_size = -1; obj_call_init(obj); return obj; } static VALUE fdbm_close(obj) VALUE obj; { struct dbmdata *dbmp; Data_Get_Struct(obj, struct dbmdata, dbmp); if (dbmp->di_dbm == 0) closed_dbm(); dbm_close(dbmp->di_dbm); dbmp->di_dbm = 0; return Qnil; } static VALUE fdbm_fetch(obj, keystr) VALUE obj, keystr; { datum key, value; struct dbmdata *dbmp; DBM *dbm; Check_Type(keystr, T_STRING); key.dptr = RSTRING(keystr)->ptr; key.dsize = RSTRING(keystr)->len; GetDBM(obj, dbmp); dbm = dbmp->di_dbm; value = dbm_fetch(dbm, key); if (value.dptr == 0) { return Qnil; } return str_taint(str_new(value.dptr, value.dsize)); } static VALUE fdbm_indexes(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { VALUE new; int i; new = ary_new2(argc); for (i=0; iptr; key.dsize = RSTRING(keystr)->len; GetDBM(obj, dbmp); dbm = dbmp->di_dbm; value = dbm_fetch(dbm, key); if (value.dptr == 0) { if (iterator_p()) rb_yield(keystr); return Qnil; } if (dbm_delete(dbm, key)) { dbmp->di_size = -1; Fail("dbm_delete failed"); } else if (dbmp->di_size >= 0) { dbmp->di_size--; } return obj; } static VALUE fdbm_shift(obj) VALUE obj; { datum key, val; struct dbmdata *dbmp; DBM *dbm; VALUE keystr, valstr; rb_secure(4); GetDBM(obj, dbmp); dbm = dbmp->di_dbm; key = dbm_firstkey(dbm); if (!key.dptr) return Qnil; val = dbm_fetch(dbm, key); dbm_delete(dbm, key); keystr = str_taint(str_new(key.dptr, key.dsize)); valstr = str_taint(str_new(val.dptr, val.dsize)); return assoc_new(keystr, valstr); } static VALUE fdbm_delete_if(obj) VALUE obj; { datum key, val; struct dbmdata *dbmp; DBM *dbm; VALUE keystr, valstr; rb_secure(4); GetDBM(obj, dbmp); dbm = dbmp->di_dbm; for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); keystr = str_taint(str_new(key.dptr, key.dsize)); valstr = str_taint(str_new(val.dptr, val.dsize)); if (RTEST(rb_yield(assoc_new(keystr, valstr)))) { if (dbm_delete(dbm, key)) { Fail("dbm_delete failed"); } } } return obj; } static VALUE fdbm_clear(obj) VALUE obj; { datum key; struct dbmdata *dbmp; DBM *dbm; rb_secure(4); GetDBM(obj, dbmp); dbm = dbmp->di_dbm; dbmp->di_size = -1; 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_invert(obj) VALUE obj; { datum key, val; struct dbmdata *dbmp; DBM *dbm; VALUE keystr, valstr; VALUE hash = hash_new(); GetDBM(obj, dbmp); dbm = dbmp->di_dbm; for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); keystr = str_taint(str_new(key.dptr, key.dsize)); valstr = str_taint(str_new(val.dptr, val.dsize)); hash_aset(hash, valstr, keystr); } return obj; } static VALUE each_pair(obj) VALUE obj; { return rb_funcall(obj, rb_intern("each_pair"), 0, 0); } static VALUE fdbm_store _((VALUE,VALUE,VALUE)); static VALUE update_i(pair, dbm) VALUE pair, dbm; { Check_Type(pair, T_ARRAY); if (RARRAY(pair)->len < 2) { ArgError("pair must be [key, value]"); } fdbm_store(dbm, RARRAY(pair)->ptr[0], RARRAY(pair)->ptr[1]); return Qnil; } static VALUE fdbm_update(obj, other) VALUE obj, other; { rb_iterate(each_pair, other, update_i, obj); return obj; } static VALUE fdbm_replace(obj, other) VALUE obj, other; { fdbm_clear(obj); rb_iterate(each_pair, other, update_i, obj); return obj; } static VALUE fdbm_store(obj, keystr, valstr) VALUE obj, keystr, valstr; { datum key, val; struct dbmdata *dbmp; DBM *dbm; if (valstr == Qnil) { fdbm_delete(obj, keystr); return Qnil; } rb_secure(4); keystr = obj_as_string(keystr); key.dptr = RSTRING(keystr)->ptr; key.dsize = RSTRING(keystr)->len; if (NIL_P(valstr)) return fdbm_delete(obj, keystr); valstr = obj_as_string(valstr); val.dptr = RSTRING(valstr)->ptr; val.dsize = RSTRING(valstr)->len; Data_Get_Struct(obj, struct dbmdata, dbmp); dbmp->di_size = -1; dbm = dbmp->di_dbm; if (dbm_store(dbm, key, val, DBM_REPLACE)) { #ifdef HAVE_DBM_CLAERERR dbm_clearerr(dbm); #endif if (errno == EPERM) rb_sys_fail(0); Fail("dbm_store failed"); } return valstr; } static VALUE fdbm_length(obj) VALUE obj; { datum key; struct dbmdata *dbmp; DBM *dbm; int i = 0; Data_Get_Struct(obj, struct dbmdata, dbmp); if (dbmp->di_size > 0) return INT2FIX(dbmp->di_size); dbm = dbmp->di_dbm; for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { i++; } dbmp->di_size = i; return INT2FIX(i); } static VALUE fdbm_empty_p(obj) VALUE obj; { datum key; struct dbmdata *dbmp; DBM *dbm; int i = 0; Data_Get_Struct(obj, struct dbmdata, dbmp); if (dbmp->di_size < 0) { dbm = dbmp->di_dbm; for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { i++; } } else { i = dbmp->di_size; } if (i == 0) return TRUE; return FALSE; } static VALUE fdbm_each_value(obj) VALUE obj; { datum key, val; struct dbmdata *dbmp; DBM *dbm; GetDBM(obj, dbmp); dbm = dbmp->di_dbm; for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); rb_yield(str_taint(str_new(val.dptr, val.dsize))); } return obj; } static VALUE fdbm_each_key(obj) VALUE obj; { datum key; struct dbmdata *dbmp; DBM *dbm; GetDBM(obj, dbmp); dbm = dbmp->di_dbm; for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { rb_yield(str_taint(str_new(key.dptr, key.dsize))); } return obj; } static VALUE fdbm_each_pair(obj) VALUE obj; { datum key, val; DBM *dbm; struct dbmdata *dbmp; VALUE keystr, valstr; GetDBM(obj, dbmp); dbm = dbmp->di_dbm; for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); keystr = str_taint(str_new(key.dptr, key.dsize)); valstr = str_taint(str_new(val.dptr, val.dsize)); rb_yield(assoc_new(keystr, valstr)); } return obj; } static VALUE fdbm_keys(obj) VALUE obj; { datum key; struct dbmdata *dbmp; DBM *dbm; VALUE ary; GetDBM(obj, dbmp); dbm = dbmp->di_dbm; ary = ary_new(); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { ary_push(ary, str_taint(str_new(key.dptr, key.dsize))); } return ary; } static VALUE fdbm_values(obj) VALUE obj; { datum key, val; struct dbmdata *dbmp; DBM *dbm; VALUE ary; GetDBM(obj, dbmp); dbm = dbmp->di_dbm; ary = ary_new(); for (key = dbm_firstkey(dbm); key.dptr; key = dbm_nextkey(dbm)) { val = dbm_fetch(dbm, key); ary_push(ary, str_taint(str_new(val.dptr, val.dsize))); } return ary; } static VALUE fdbm_has_key(obj, keystr) VALUE obj, keystr; { datum key, val; struct dbmdata *dbmp; DBM *dbm; Check_Type(keystr, T_STRING); key.dptr = RSTRING(keystr)->ptr; key.dsize = RSTRING(keystr)->len; GetDBM(obj, dbmp); dbm = dbmp->di_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; struct dbmdata *dbmp; DBM *dbm; Check_Type(valstr, T_STRING); val.dptr = RSTRING(valstr)->ptr; val.dsize = RSTRING(valstr)->len; GetDBM(obj, dbmp); dbm = dbmp->di_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; struct dbmdata *dbmp; DBM *dbm; VALUE ary; GetDBM(obj, dbmp); dbm = dbmp->di_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_taint(str_new(key.dptr, key.dsize)), str_taint(str_new(val.dptr, val.dsize)))); } return ary; } Init_dbm() { cDBM = rb_define_class("DBM", cObject); rb_include_module(cDBM, mEnumerable); rb_define_singleton_method(cDBM, "open", fdbm_s_open, -1); rb_define_singleton_method(cDBM, "new", fdbm_s_open, -1); rb_define_method(cDBM, "close", fdbm_close, 0); rb_define_method(cDBM, "[]", fdbm_fetch, 1); rb_define_method(cDBM, "[]=", fdbm_store, 2); rb_define_method(cDBM, "indexes", fdbm_indexes, -1); rb_define_method(cDBM, "indices", fdbm_indexes, -1); rb_define_method(cDBM, "length", fdbm_length, 0); rb_define_alias(cDBM, "size", "length"); rb_define_method(cDBM, "empty?", fdbm_empty_p, 0); rb_define_method(cDBM, "each", fdbm_each_pair, 0); rb_define_method(cDBM, "each_value", fdbm_each_value, 0); rb_define_method(cDBM, "each_key", fdbm_each_key, 0); rb_define_method(cDBM, "each_pair", fdbm_each_pair, 0); rb_define_method(cDBM, "keys", fdbm_keys, 0); rb_define_method(cDBM, "values", fdbm_values, 0); rb_define_method(cDBM, "shift", fdbm_shift, 1); rb_define_method(cDBM, "delete", fdbm_delete, 1); rb_define_method(cDBM, "delete_if", fdbm_delete_if, 0); rb_define_method(cDBM, "clear", fdbm_clear, 0); rb_define_method(cDBM,"invert", fdbm_invert, 0); rb_define_method(cDBM,"update", fdbm_update, 1); rb_define_method(cDBM,"replace", fdbm_replace, 1); rb_define_method(cDBM, "include?", fdbm_has_key, 1); rb_define_method(cDBM, "has_key?", fdbm_has_key, 1); rb_define_method(cDBM, "has_value?", fdbm_has_value, 1); rb_define_method(cDBM, "key?", fdbm_has_key, 1); rb_define_method(cDBM, "value?", fdbm_has_value, 1); rb_define_method(cDBM, "to_a", fdbm_to_a, 0); } ruby-1.2.3/ext/dbm/depend100644 774 145 105 6457557271 13255 0ustar matzNaCldbm.o: dbm.c $(hdrdir)/ruby.h $(hdrdir)/config.h $(hdrdir)/defines.h ruby-1.2.3/ext/dbm/extconf.rb100644 774 145 351 6565720655 14067 0ustar matzNaClrequire 'mkmf' $LDFLAGS = "-L/usr/local/lib" have_library("gdbm", "dbm_open") or have_library("db", "dbm_open") or have_library("dbm", "dbm_open") if have_func("dbm_open") have_func("dbm_clearerr") create_makefile("dbm") end ruby-1.2.3/ext/etc/ 40755 774 145 0 6662164574 12031 5ustar matzNaClruby-1.2.3/ext/etc/MANIFEST100644 774 145 51 6457556235 13214 0ustar matzNaClMANIFEST etc.c etc.doc depend extconf.rb ruby-1.2.3/ext/etc/etc.c100644 774 145 11425 6606302065 13053 0ustar matzNaCl/************************************************ etc.c - $Author: matz $ $Date: 1998/10/06 02:45:09 $ created at: Tue Mar 22 18:39:19 JST 1994 ************************************************/ #include "ruby.h" #ifdef HAVE_GETPWENT #include #endif #ifdef HAVE_GETGRENT #include #endif static VALUE sPasswd, sGroup; static VALUE etc_getlogin(obj) VALUE obj; { char *getenv(); char *login; #ifdef HAVE_GETLOGIN char *getlogin(); login = getlogin(); if (!login) login = getenv("USER"); #else login = getenv("USER"); #endif if (login) return str_new2(login); return Qnil; } #ifdef HAVE_GETPWENT static VALUE setup_passwd(pwd) struct passwd *pwd; { if (pwd == 0) rb_sys_fail("/etc/passwd"); return struct_new(sPasswd, str_new2(pwd->pw_name), str_new2(pwd->pw_passwd), INT2FIX(pwd->pw_uid), INT2FIX(pwd->pw_gid), #ifdef PW_GECOS str_new2(pwd->pw_gecos), #endif str_new2(pwd->pw_dir), str_new2(pwd->pw_shell), #ifdef PW_CHANGE INT2FIX(pwd->pw_change), #endif #ifdef PW_QUOTA INT2FIX(pwd->pw_quota), #endif #ifdef PW_AGE INT2FIX(pwd->pw_age), #endif #ifdef PW_CLASS str_new2(pwd->pw_class), #endif #ifdef PW_COMMENT str_new2(pwd->pw_comment), #endif #ifdef PW_EXPIRE INT2FIX(pwd->pw_expire), #endif 0 /*dummy*/ ); } #endif static VALUE etc_getpwuid(argc, argv, obj) int argc; VALUE *argv; VALUE obj; { #ifdef HAVE_GETPWENT 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 == 0) Fail("can't find user for %d", uid); return setup_passwd(pwd); #else return Qnil; #endif } static VALUE etc_getpwnam(obj, nam) VALUE obj, nam; { #ifdef HAVE_GETPWENT struct passwd *pwd; Check_Type(nam, T_STRING); pwd = getpwnam(RSTRING(nam)->ptr); if (pwd == 0) Fail("can't find user for %s", RSTRING(nam)->ptr); return setup_passwd(pwd); #else return Qnil; #endif } static VALUE etc_passwd(obj) VALUE obj; { #if defined(HAVE_GETPWENT) struct passwd *pw; if (iterator_p()) { setpwent(); while (pw = getpwent()) { rb_yield(setup_passwd(pw)); } endpwent(); return obj; } pw = getpwent(); if (pw == 0) Fail("can't fetch next -- /etc/passwd"); return setup_passwd(pw); #else return Qnil; #endif } #ifdef HAVE_GETGRENT 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(sGroup, str_new2(grp->gr_name), str_new2(grp->gr_passwd), INT2FIX(grp->gr_gid), mem); } #endif static VALUE etc_getgrgid(obj, id) VALUE obj, id; { #ifdef HAVE_GETGRENT int gid; struct group *grp; gid = NUM2INT(id); grp = getgrgid(gid); if (grp == 0) Fail("can't find group for %d", gid); return setup_group(grp); #else return Qnil; #endif } static VALUE etc_getgrnam(obj, nam) VALUE obj, nam; { #ifdef HAVE_GETGRENT struct group *grp; Check_Type(nam, T_STRING); grp = getgrnam(RSTRING(nam)->ptr); if (grp == 0) Fail("can't find group for %s", RSTRING(nam)->ptr); return setup_group(grp); #else return Qnil; #endif } static VALUE etc_group(obj) VALUE obj; { #ifdef HAVE_GETGRENT struct group *grp; if (iterator_p()) { setgrent(); while (grp = getgrent()) { rb_yield(setup_group(grp)); } endgrent(); return obj; } return setup_group(getgrent()); #else return Qnil; #endif } static VALUE mEtc; void Init_etc() { mEtc = rb_define_module("Etc"); rb_define_module_function(mEtc, "getlogin", etc_getlogin, 0); rb_define_module_function(mEtc, "getpwuid", etc_getpwuid, -1); rb_define_module_function(mEtc, "getpwnam", etc_getpwnam, 1); rb_define_module_function(mEtc, "passwd", etc_passwd, 0); rb_define_module_function(mEtc, "getgrgid", etc_getgrgid, 1); rb_define_module_function(mEtc, "getgrnam", etc_getgrnam, 1); rb_define_module_function(mEtc, "group", etc_group, 0); sPasswd = struct_define("Passwd", "name", "passwd", "uid", "gid", #ifdef PW_GECOS "gecos", #endif "dir", "shell", #ifdef PW_CHANGE "change", #endif #ifdef PW_QUOTA "quota", #endif #ifdef PW_AGE "age", #endif #ifdef PW_CLASS "class", #endif #ifdef PW_COMMENT "comment", #endif #ifdef PW_EXPIRE "expire", #endif 0); rb_global_variable(&sPasswd); #ifdef HAVE_GETGRENT sGroup = struct_define("Group", "name", "passwd", "gid", "mem", 0); rb_global_variable(&sGroup); #endif } ruby-1.2.3/ext/etc/etc.doc100644 774 145 3444 6457556235 13376 0ustar matzNaCl.\" etc.doc - -*- Indented-Text -*- created at: Fri Jul 14 00:47:15 JST 1995 ** 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エントリを順にアクセスするためのイテレータ． ruby-1.2.3/ext/etc/depend100644 774 145 107 6457557271 13270 0ustar matzNaCletc.o : etc.c $(hdrdir)/ruby.h $(hdrdir)/config.h $(hdrdir)/defines.h ruby-1.2.3/ext/etc/extconf.rb100644 774 145 1245 6605063111 14101 0ustar matzNaClrequire 'mkmf' def etc_grep_header(field) f = open("conftest.c", "w") f.print < EOF f.close begin if xsystem("#{CPP} | egrep #{field}") $defs.push(format("-D%s", field.upcase)) end ensure system "rm -f conftest.c" end end have_library("sun", "getpwnam") # NIS (== YP) interface for IRIX 4 a = have_func("getlogin") b = have_func("getpwent") c = have_func("getgrent") if a or b or c etc_grep_header("pw_gecos") etc_grep_header("pw_change") etc_grep_header("pw_quota") etc_grep_header("pw_age") etc_grep_header("pw_class") etc_grep_header("pw_comment") etc_grep_header("pw_expire") create_makefile("etc") end ruby-1.2.3/ext/fcntl/ 40755 774 145 0 6662164574 12364 5ustar matzNaClruby-1.2.3/ext/fcntl/MANIFEST100644 774 145 30 6457556235 13544 0ustar matzNaClMANIFEST depend fcntl.c ruby-1.2.3/ext/fcntl/depend100644 774 145 111 6457557271 13616 0ustar matzNaClfcntl.o: fcntl.c $(hdrdir)/ruby.h $(hdrdir)/config.h $(hdrdir)/defines.h ruby-1.2.3/ext/fcntl/fcntl.c100644 774 145 5041 6467560342 13727 0ustar matzNaCl/************************************************ fcntl.c - $Author: matz $ created at: Mon Apr 7 18:53:05 JST 1997 Copyright (C) 1997-1998 Yukihiro Matsumoto ************************************************/ /************************************************ = NAME fcntl - load the C fcntl.h defines = SYNOPSIS require "fcntl" m = s.fcntl(Fcntl::F_GETFL, 0) f.fcntl(Fcntl::F_SETFL, Fcntl::O_NONBLOCK|m) = DESCRIPTION This module is just a translation of the C file. = NOTE Only #define symbols get translated; you must still correctly pack up your own arguments to pass as args for locking functions, etc. ************************************************/ #include "ruby.h" #include Init_fcntl() { VALUE mFcntl = rb_define_module("Fcntl"); #ifdef F_DUPFD rb_define_const(mFcntl, "F_DUPFD", INT2NUM(F_DUPFD)); #endif #ifdef F_GETFD rb_define_const(mFcntl, "F_GETFD", INT2NUM(F_GETFD)); #endif #ifdef F_GETLK rb_define_const(mFcntl, "F_GETLK", INT2NUM(F_GETLK)); #endif #ifdef F_SETFD rb_define_const(mFcntl, "F_SETFD", INT2NUM(F_SETFD)); #endif #ifdef F_GETFL rb_define_const(mFcntl, "F_GETFL", INT2NUM(F_GETFL)); #endif #ifdef F_SETFL rb_define_const(mFcntl, "F_SETFL", INT2NUM(F_SETFL)); #endif #ifdef F_SETLK rb_define_const(mFcntl, "F_SETLK", INT2NUM(F_SETLK)); #endif #ifdef F_SETLKW rb_define_const(mFcntl, "F_SETLKW", INT2NUM(F_SETLKW)); #endif #ifdef FD_CLOEXEC rb_define_const(mFcntl, "FD_CLOEXEC", INT2NUM(FD_CLOEXEC)); #endif #ifdef F_RDLCK rb_define_const(mFcntl, "F_RDLCK", INT2NUM(F_RDLCK)); #endif #ifdef F_UNLCK rb_define_const(mFcntl, "F_UNLCK", INT2NUM(F_UNLCK)); #endif #ifdef F_WRLCK rb_define_const(mFcntl, "F_WRLCK", INT2NUM(F_WRLCK)); #endif #ifdef O_CREAT rb_define_const(mFcntl, "O_CREAT", INT2NUM(O_CREAT)); #endif #ifdef O_EXCL rb_define_const(mFcntl, "O_EXCL", INT2NUM(O_EXCL)); #endif #ifdef O_NOCTTY rb_define_const(mFcntl, "O_NOCTTY", INT2NUM(O_NOCTTY)); #endif #ifdef O_TRUNC rb_define_const(mFcntl, "O_TRUNC", INT2NUM(O_TRUNC)); #endif #ifdef O_APPEND rb_define_const(mFcntl, "O_APPEND", INT2NUM(O_APPEND)); #endif #ifdef O_NONBLOCK rb_define_const(mFcntl, "O_NONBLOCK", INT2NUM(O_NONBLOCK)); #endif #ifdef O_NDELAY rb_define_const(mFcntl, "O_NDELAY", INT2NUM(O_NDELAY)); #endif #ifdef O_RDONLY rb_define_const(mFcntl, "O_RDONLY", INT2NUM(O_RDONLY)); #endif #ifdef O_RDWR rb_define_const(mFcntl, "O_RDWR", INT2NUM(O_RDWR)); #endif #ifdef O_WRONLY rb_define_const(mFcntl, "O_WRONLY", INT2NUM(O_WRONLY)); #endif } ruby-1.2.3/ext/kconv/ 40755 774 145 0 6662164574 12376 5ustar matzNaClruby-1.2.3/ext/kconv/MANIFEST100644 774 145 30 6457556235 13556 0ustar matzNaClMANIFEST depend kconv.c ruby-1.2.3/ext/kconv/depend100644 774 145 111 6457557272 13631 0ustar matzNaClkconv.o: kconv.c $(hdrdir)/ruby.h $(hdrdir)/config.h $(hdrdir)/defines.h ruby-1.2.3/ext/kconv/kconv.c100644 774 145 170102 6575103352 14006 0ustar matzNaCl/** Network Kanji Filter. (PDS Version) ************************************************************************ ** Copyright (C) 1987, Fujitsu LTD. (Itaru ICHIKAWA) ** 連絡先： （株）富士通研究所　ソフト３研　市川　至 ** （E-Mail Address: ichikawa@flab.fujitsu.co.jp） ** Copyright (C) 1996 ** 連絡先： 琉球大学情報工学科 河野 真治 mine/X0208 support ** （E-Mail Address: kono@ie.u-ryukyu.ac.jp） ** 連絡先： COW for DOS & Win16 & Win32 & OS/2 ** （E-Mail Address: GHG00637@niftyserve.or.jp） ** 営利を目的としない限り、このソースのいかなる ** 複写，改変，修正も許諾します。その際には、この部分を残すこと。 ** このプログラムについては特に何の保証もしない、悪しからず。 ** Everyone is permitted to do anything on this program ** including copying, modifying, improving ** as long as you don't try to make money off it, ** or pretend that you wrote it. ** i.e., the above copyright notice has to appear in all copies. ** THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE. ***********************************************************************/ /*********************************************************************** ** 1996/03/10 modified for Kconv - by Ikuo Nakagawa ***********************************************************************/ /*********************************************************************** ** 1996/12/18 modified for kconv(ruby) - by matz@ruby.club.or.jp ***********************************************************************/ static char *CopyRight = "Copyright (C) 1987, FUJITSU LTD. (I.Ichikawa),1996 S. Kono, COW"; static char *Version = "1.62"; static char *Patchlevel = "5/9612/Shinji Kono, COW matz"; #include "ruby.h" /* ** ** ** ** USAGE: nkf [flags] [file] ** ** Flags: ** b Output is bufferred (DEFAULT) ** u Output is unbufferred ** ** t no operation ** ** j Outout code is JIS 7 bit (DEFAULT SELECT) ** s Output code is MS Kanji (DEFAULT SELECT) ** e Output code is AT&T JIS (DEFAULT SELECT) ** l Output code is JIS 7bit and ISO8859-1 Latin-1 ** ** m MIME conversion for ISO-2022-JP ** i_ Output sequence to designate JIS-kanji (DEFAULT_J) ** o_ Output sequence to designate single-byte roman characters (DEFAULT_R) ** ** r {de/en}crypt ROT13/47 ** ** v display Version ** ** T Text mode output (for MS-DOS) ** ** x Do not convert X0201 kana into X0208 ** Z Convert X0208 alphabet to ASCII ** ** f60 fold option ** ** m MIME decode ** B try to fix broken JIS, missing Escape ** B[1-9] broken level ** ** O Output to 'nkf.out' file ** d Delete \r in line feed ** c Add \r in line feed **/ /******************************/ /* デフォルトの出力コード選択 */ /* Select DEFAULT_CODE */ #define DEFAULT_CODE_JIS /* #define DEFAULT_CODE_SJIS */ /* #define DEFAULT_CODE_EUC */ /******************************/ /* for Kconv: _AUTO, _EUC, _SJIS, _JIS */ #define _AUTO 0 #define _JIS 1 #define _EUC 2 #define _SJIS 3 #define _BINARY 4 #define _NOCONV 4 #define _UNKNOWN _AUTO #if (defined(__TURBOC__) || defined(LSI_C)) && !defined(MSDOS) #define MSDOS #endif #include #if defined(MSDOS) || defined(__OS2__) #include #include #include #endif #ifdef MSDOS #ifdef LSI_C #define setbinmode(fp) fsetbin(fp) #else /* Microsoft C, Turbo C */ #define setbinmode(fp) setmode(fileno(fp), O_BINARY) #endif #else /* UNIX,OS/2 */ #define setbinmode(fp) #endif #ifdef _IOFBF /* SysV and MSDOS */ #define setvbuffer(fp, buf, size) setvbuf(fp, buf, _IOFBF, size) #else /* BSD */ #define setvbuffer(fp, buf, size) setbuffer(fp, buf, size) #endif /*Borland C++ 4.5 EasyWin*/ #if defined(__TURBOC__) && defined(_Windows) && !defined(__WIN32__) /*Easy Win */ #define EASYWIN #include #endif #ifndef FALSE #define FALSE 0 #define TRUE 1 #endif /* state of output_mode and input_mode */ #define ASCII 0 #define X0208 1 #define X0201 2 #define NO_X0201 3 #define JIS_INPUT 4 #define SJIS_INPUT 5 #define LATIN1_INPUT 6 #define FIXED_MIME 7 #define DOUBLE_SPACE -2 #define NL 0x0a #define ESC 0x1b #define SP 0x20 #define AT 0x40 #define SSP 0xa0 #define DEL 0x7f #define SI 0x0f #define SO 0x0e #define SSO 0x8e #define HOLD_SIZE 32 #define IOBUF_SIZE 16384 #define DEFAULT_J 'B' #define DEFAULT_R 'B' #define SJ0162 0x00e1 /* 01 - 62 ku offset */ #define SJ6394 0x0161 /* 63 - 94 ku offset */ /* MIME preprocessor */ #define _GETC() (*inptr ? (int)(*inptr++) : EOF) #define _UNGETC(c) (*--inptr = (c)) #define PUTCHAR(c) (outlen + 1 < outsiz ? \ ((outptr[outlen++] = (c)), (outptr[outlen] = '\0')) : EOF) #define GETC() ((!mime_mode)?_GETC():mime_getc()) #define UNGETC(c) ((!mime_mode)?_UNGETC(c):mime_ungetc(c)) #ifdef EASYWIN /*Easy Win */ extern POINT _BufferSize; #endif /* buffers */ static unsigned char hold_buf[HOLD_SIZE*2]; static int hold_count; static unsigned char *inptr; static char *outptr; static int outsiz; static int outlen; /* MIME preprocessor fifo */ #define MIME_BUF_SIZE (1024) /* 2^n ring buffer */ #define MIME_BUF_MASK (MIME_BUF_SIZE-1) #define Fifo(n) mime_buf[(n)&MIME_BUF_MASK] static unsigned char mime_buf[MIME_BUF_SIZE]; static unsigned int mime_top = 0; static unsigned int mime_last = 0; /* decoded */ static unsigned int mime_input = 0; /* undecoded */ /* flags */ static int unbuf_f = FALSE; static int estab_f = FALSE; static int rot_f = FALSE; /* rot14/43 mode */ static int input_f = FALSE; /* non fixed input code */ static int alpha_f = FALSE; /* convert JIx0208 alphbet to ASCII */ static int mime_f = FALSE; /* convert MIME B base64 or Q */ static int mimebuf_f = FALSE; /* MIME buffered input */ static int broken_f = FALSE; /* convert ESC-less broken JIS */ static int iso8859_f = FALSE; /* ISO8859 through */ #if defined(MSDOS) || defined(__OS2__) static int x0201_f = TRUE; /* Assume JISX0201 kana */ #else static int x0201_f = NO_X0201; /* Assume NO JISX0201 */ #endif /* X0208 -> ASCII converter */ static int c1_return; /* fold parameter */ static int line = 0; /* chars in line */ static int prev = 0; static int fold_f = FALSE; static int fold_len = 0; /* options */ static char kanji_intro = DEFAULT_J, ascii_intro = DEFAULT_R; /* Folding */ #define FOLD_MARGIN 10 #define DEFAULT_FOLD 60 /* Global states */ static int output_mode = ASCII, /* output kanji mode */ input_mode = ASCII, /* input kanji mode */ shift_mode = FALSE; /* TRUE shift out, or X0201 */ static int mime_mode = FALSE; /* MIME mode B base64, Q hex */ /* X0208 -> ASCII translation table */ /* X0201 / X0208 conversion tables */ /* X0201 kana conversion table */ /* 90-9F A0-DF */ static unsigned char cv[]= { 0x21,0x21,0x21,0x23,0x21,0x56,0x21,0x57, 0x21,0x22,0x21,0x26,0x25,0x72,0x25,0x21, 0x25,0x23,0x25,0x25,0x25,0x27,0x25,0x29, 0x25,0x63,0x25,0x65,0x25,0x67,0x25,0x43, 0x21,0x3c,0x25,0x22,0x25,0x24,0x25,0x26, 0x25,0x28,0x25,0x2a,0x25,0x2b,0x25,0x2d, 0x25,0x2f,0x25,0x31,0x25,0x33,0x25,0x35, 0x25,0x37,0x25,0x39,0x25,0x3b,0x25,0x3d, 0x25,0x3f,0x25,0x41,0x25,0x44,0x25,0x46, 0x25,0x48,0x25,0x4a,0x25,0x4b,0x25,0x4c, 0x25,0x4d,0x25,0x4e,0x25,0x4f,0x25,0x52, 0x25,0x55,0x25,0x58,0x25,0x5b,0x25,0x5e, 0x25,0x5f,0x25,0x60,0x25,0x61,0x25,0x62, 0x25,0x64,0x25,0x66,0x25,0x68,0x25,0x69, 0x25,0x6a,0x25,0x6b,0x25,0x6c,0x25,0x6d, 0x25,0x6f,0x25,0x73,0x21,0x2b,0x21,0x2c, 0x00,0x00}; /* X0201 kana conversion table for daguten */ /* 90-9F A0-DF */ static unsigned char dv[]= { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x25,0x2c,0x25,0x2e, 0x25,0x30,0x25,0x32,0x25,0x34,0x25,0x36, 0x25,0x38,0x25,0x3a,0x25,0x3c,0x25,0x3e, 0x25,0x40,0x25,0x42,0x25,0x45,0x25,0x47, 0x25,0x49,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x25,0x50,0x25,0x53, 0x25,0x56,0x25,0x59,0x25,0x5c,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00}; /* X0201 kana conversion table for han-daguten */ /* 90-9F A0-DF */ static unsigned char ev[]= { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x25,0x51,0x25,0x54, 0x25,0x57,0x25,0x5a,0x25,0x5d,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x00,0x00}; /* X0208 kigou conversion table */ /* 0x8140 - 0x819e */ static unsigned char fv[] = { 0x00,0x00,0x00,0x00,0x2c,0x2e,0x00,0x3a, 0x3b,0x3f,0x21,0x00,0x00,0x27,0x60,0x00, 0x5e,0x00,0x5f,0x00,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x2d,0x00,0x2f, 0x5c,0x00,0x00,0x7c,0x00,0x00,0x60,0x27, 0x22,0x22,0x28,0x29,0x00,0x00,0x5b,0x5d, 0x7b,0x7d,0x3c,0x3e,0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x2b,0x2d,0x00,0x00, 0x00,0x3d,0x00,0x3c,0x3e,0x00,0x00,0x00, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, 0x24,0x00,0x00,0x25,0x23,0x26,0x2a,0x40, 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 } ; /* This converts =?ISO-2022-JP?B?HOGE HOGE?= */ static unsigned char *mime_pattern[] = { (unsigned char *)"\075?ISO-8859-1?Q?", (unsigned char *)"\075?ISO-2022-JP?B?", (unsigned char *)"\075?ISO-2022-JP?Q?", NULL }; static int mime_encode[] = { 'Q', 'B', 'Q', 0 }; static int add_cr = FALSE; static int del_cr = FALSE; static void (*iconv) _((register int c2,register int c1)); /* s_iconv or oconv */ static void (*oconv) _((register int c2,register int c1)); /* [ejs]_oconv */ static int do_kconv _((char *i, char *o, int siz, int out_code, int in_code)); static void h_conv _((register int c2,register int c1)); static int push_hold_buf _((int c2,int c1)); static void s_iconv _((register int c2,register int c1)); static void e_oconv _((register int c2,register int c1)); static void s_oconv _((register int c2,register int c1)); static void j_oconv _((register int c2,register int c1)); static int fold _((register int c2,register int c1)); static int pre_convert _((register int c1,register int c2)); static int mime_begin _((void)); static int mime_getc _((void)); static int mime_ungetc _((unsigned int c)); static int mime_integrity _((unsigned char *p)); static int base64decode _((int c)); #ifdef notdef main (argc, argv) int argc; char **argv; { register FILE *fin; register char *cp; #ifdef EASYWIN /*Easy Win */ _BufferSize.y = 400;/*Set Scroll Buffer Size*/ #endif #ifdef DEFAULT_CODE_JIS oconv = j_oconv; /* DEFAULT Code is JIS */ #endif #ifdef DEFAULT_CODE_SJIS oconv = s_oconv; /* DEFAULT Code is S-JIS */ #endif #ifdef DEFAULT_CODE_EUC oconv = e_oconv; /* DEFAULT Code is EUC */ #endif for (argc--,argv++; (argc > 0) && **argv == '-'; argc--, argv++) { cp = *argv; while (*cp) { switch (*cp++) { case 'b': /* buffered mode */ unbuf_f = FALSE; continue; case 'u': /* non bufferd mode */ unbuf_f = TRUE; continue; case 'j': /* JIS output */ case 'n': oconv = j_oconv; continue; case 'e': /* AT&T EUC output */ oconv = e_oconv; continue; case 's': /* SJIS output */ oconv = s_oconv; continue; case 'l': /* ISO8859 Latin-1 support, no conversion */ iso8859_f = TRUE; /* Only compatible with ISO-2022-JP */ input_f = LATIN1_INPUT; continue; case 'i': /* Kanji IN ESC-$-@/B */ if(*cp=='@'||*cp=='B') kanji_intro = *cp++; continue; case 'o': /* ASCII IN ESC-(-J/B */ if(*cp=='J'||*cp=='B'||*cp=='H') ascii_intro = *cp++; continue; case 'r': rot_f = TRUE; continue; #if defined(MSDOS) || defined(__OS2__) case 'T': binmode_f = FALSE; continue; #endif case 'v': usage(); exit(1); break; /* Input code assumption */ case 'J': /* JIS input */ case 'E': /* AT&T EUC input */ input_f = JIS_INPUT; continue; case 'S': /* MS Kanji input */ input_f = SJIS_INPUT; if(x0201_f==NO_X0201) x0201_f=TRUE; continue; case 'Z': /* Convert X0208 alphabet to asii */ /* bit:0 Convert X0208 bit:1 Convert Kankaku to one space bit:2 Convert Kankaku to two spaces */ if('9'>= *cp && *cp>='0') alpha_f |= 1<<(*cp++ -'0'); else alpha_f |= TRUE; continue; case 'x': /* Convert X0201 kana to X0208 or X0201 Conversion */ x0201_f = FALSE; /* No X0201->X0208 conversion */ /* accept X0201 ESC-(-I in JIS, EUC, MS Kanji SI/SO in JIS, EUC, MS Kanji SSO in EUC, JIS, not in MS Kanji MS Kanji (0xa0-0xdf) output X0201 ESC-(-I in JIS (0x20-0x5f) SSO in EUC (0xa0-0xdf) 0xa0-0xd in MS Kanji (0xa0-0xdf) */ continue; case 'X': /* Assume X0201 kana */ /* Default value is NO_X0201 for EUC/MS-Kanji mix */ x0201_f = TRUE; continue; case 'f': /* folding -f60 or -f */ fold_f = TRUE; fold_len = atoi(cp); if(!(0= *cp && *cp>='0') broken_f |= 1<<(*cp++ -'0'); else broken_f |= TRUE; continue; case 'O':/* for Output file */ file_out = TRUE; continue; case 'c':/* add cr code */ add_cr = TRUE; continue; case 'd':/* delete cr code */ del_cr = TRUE; continue; default: /* bogus option but ignored */ continue; } } } if(iso8859_f && (oconv != j_oconv || !x0201_f )) { fprintf(stderr,"Mixed ISO8859/JISX0201/SJIS/EUC output is not allowed.\n"); exit(1); } if(binmode_f == TRUE) #ifdef __OS2__ if(freopen("","wb",stdout) == NULL) return (-1); #else setbinmode(stdout); #endif if(unbuf_f) setbuf (stdout, (char *) NULL); else setvbuffer (stdout, stdobuf, IOBUF_SIZE); if(argc == 0) { if(binmode_f == TRUE) #ifdef __OS2__ if(freopen("","rb",stdin) == NULL) return (-1); #else setbinmode(stdin); #endif setvbuffer (stdin, stdibuf, IOBUF_SIZE); convert (stdin); } else { while (argc--) { if((fin = fopen (*argv++, "r")) == NULL) { perror (*--argv); return (-1); } else { /* reopen file for stdout */ if(file_out == TRUE){ if(argc == 1 ) { if(freopen(*argv++, "w", stdout) == NULL) { perror (*--argv); return (-1); } argc--; } else { if(freopen("nkf.out", "w", stdout) == NULL) { perror (*--argv); return (-1); } } if(binmode_f == TRUE) { #ifdef __OS2__ if(freopen("","wb",stdout) == NULL) return (-1); #else setbinmode(stdout); #endif } } if(binmode_f == TRUE) #ifdef __OS2__ if(freopen("","rb",fin) == NULL) return (-1); #else setbinmode(fin); #endif setvbuffer (fin, stdibuf, IOBUF_SIZE); convert (fin); fclose (fin); } } } #ifdef EASYWIN /*Easy Win */ if(file_out == FALSE) scanf("%d",&end_check); else fclose(stdout); #else /* for Other OS */ if(file_out == TRUE) fclose(stdout); #endif return (0); } #endif /* notdef */ static int do_kconv(i, o, siz, out_code, in_code) char *i; char *o; int siz, out_code, in_code; { register int c1, c2; c2 = 0; if (siz <= 0) { return 0; } *o = '\0'; inptr = (unsigned char *)i; /* input buffer */ outptr = o; /* output buffer */ outsiz = siz; /* output buffer size */ outlen = 0; /* current length of output string */ x0201_f = TRUE; /* don't assume JISX0201 kana */ rot_f = FALSE; /* rot14/43 mode */ input_f = FALSE; /* non fixed input code */ alpha_f = FALSE; /* convert JISX0208 alphbet to ASCII */ mime_f = TRUE; /* convert MIME base64 */ broken_f = FALSE; /* convert ESC-less broken JIS */ switch (out_code) { case _SJIS: oconv = s_oconv; break; case _EUC: oconv = e_oconv; break; default: oconv = j_oconv; break; } switch (in_code) { case _SJIS: input_f = SJIS_INPUT; x0201_f = TRUE; break; case _EUC: case _JIS: input_f = JIS_INPUT; break; default: input_f = FALSE; break; } if(input_f == JIS_INPUT || input_f == LATIN1_INPUT) { estab_f = TRUE; iconv = oconv; } else if(input_f == SJIS_INPUT) { estab_f = TRUE; iconv = s_iconv; } else { estab_f = FALSE; iconv = oconv; } input_mode = ASCII; output_mode = ASCII; shift_mode = FALSE; mime_mode = FALSE; #define NEXT continue /* no output, get next */ #define SEND ; /* output c1 and c2, get next */ #define LAST break /* end of loop, go closing */ while ((c1 = GETC()) != EOF) { if(!c2 && !input_mode && c1 DEL) { /* in case of 8th bit is on */ if(!estab_f) { /* in case of not established yet */ if(c1 > SSP) { /* It is still ambiguious */ h_conv (c2, c1); c2 = 0; NEXT; } else if(c1 < AT) { /* ignore bogus code */ c2 = 0; NEXT; } else { /* established */ /* it seems to be MS Kanji */ estab_f = TRUE; iconv = s_iconv; SEND; } } else /* in case of already established */ if(c1 < AT) { /* ignore bogus code */ c2 = 0; NEXT; } else SEND; } else /* 7 bit code */ /* it might be kanji shitfted */ if((c1 == DEL) || (c1 <= SP)) { /* ignore bogus first code */ c2 = 0; NEXT; } else SEND; } else { /* first byte */ if(c1 > DEL) { /* 8 bit code */ if(!estab_f && !iso8859_f) { /* not established yet */ if(c1 < SSP) { /* it seems to be MS Kanji */ estab_f = TRUE; iconv = s_iconv; } else if(c1 < 0xe0) { /* it seems to be EUC */ estab_f = TRUE; iconv = oconv; } else { /* still ambiguious */ } c2 = c1; NEXT; } else { /* estab_f==TRUE */ if(iso8859_f) { SEND; } else if(SSP<=c1 && c1<0xe0 && iconv == s_iconv) { /* SJIS X0201 Case... */ /* This is too arrogant, but ... */ if(x0201_f==NO_X0201) { iconv = oconv; c2 = c1; NEXT; } else if(x0201_f) { if(dv[(c1-SSP)*2]||ev[(c1-SSP)*2]) { /* look ahead for X0201/X0208conversion */ if((c2 = GETC()) == EOF) { (*oconv)(cv[(c1-SSP)*2],cv[(c1-SSP)*2+1]); LAST; } else if(c2==(0xde)) { /* 濁点 */ (*oconv)(dv[(c1-SSP)*2],dv[(c1-SSP)*2+1]); c2=0; NEXT; } else if(c2==(0xdf)&&ev[(c1-SSP)*2]) { /* 半濁点 */ (*oconv)(ev[(c1-SSP)*2],ev[(c1-SSP)*2+1]); c2=0; NEXT; } UNGETC(c2); c2 = 0; } (*oconv)(cv[(c1-SSP)*2],cv[(c1-SSP)*2+1]); NEXT; } else SEND; } else if(c1==SSO && iconv != s_iconv) { /* EUC X0201 Case */ /* This is too arrogant if(x0201_f == NO_X0201) { estab_f = FALSE; c2 = 0; NEXT; } */ c1 = GETC(); /* skip SSO */ euc_1byte_check: if(x0201_f && SSP<=c1 && c1<0xe0) { if(dv[(c1-SSP)*2]||ev[(c1-SSP)*2]) { if((c2 = GETC()) == EOF) { (*oconv)(cv[(c1-SSP)*2],cv[(c1-SSP)*2+1]); LAST; } /* forward lookup 濁点/半濁点 */ if(c2 != SSO) { UNGETC(c2); c2 = 0; (*oconv)(cv[(c1-SSP)*2],cv[(c1-SSP)*2+1]); NEXT; } else if((c2 = GETC()) == EOF) { (*oconv)(cv[(c1-SSP)*2],cv[(c1-SSP)*2+1]); (*oconv)(0,SSO); LAST; } else if(c2==(0xde)) { /* 濁点 */ (*oconv)(dv[(c1-SSP)*2],dv[(c1-SSP)*2+1]); c2=0; NEXT; } else if(c2==(0xdf)&&ev[(c1-SSP)*2]) { /* 半濁点 */ (*oconv)(ev[(c1-SSP)*2],ev[(c1-SSP)*2+1]); c2=0; NEXT; } else { (*oconv)(cv[(c1-SSP)*2],cv[(c1-SSP)*2+1]); /* we have to check this c2 */ /* and no way to push back SSO */ c1 = c2; c2 = 0; goto euc_1byte_check; } } (*oconv)(cv[(c1-SSP)*2],cv[(c1-SSP)*2+1]); NEXT; } else SEND; } else if(c1 < SSP && iconv != s_iconv) { /* strange code in EUC */ iconv = s_iconv; /* try SJIS */ c2 = c1; NEXT; } else { /* already established */ c2 = c1; NEXT; } } } else if((c1 > SP) && (c1 != DEL)) { /* in case of Roman characters */ if(shift_mode) { c1 |= 0x80; /* output 1 shifted byte */ if(x0201_f && (!iso8859_f||input_mode==X0201) && SSP<=c1 && c1<0xe0 ) { if(dv[(c1-SSP)*2]||ev[(c1-SSP)*2]) { if((c2 = GETC()) == EOF) { (*oconv)(cv[(c1-SSP)*2],cv[(c1-SSP)*2+1]); LAST; } else if(c2==(0xde&0x7f)) { /* 濁点 */ (*oconv)(dv[(c1-SSP)*2],dv[(c1-SSP)*2+1]); c2=0; NEXT; } else if(c2==(0xdf&0x7f)&&ev[(c1-SSP)*2]) { /* 半濁点 */ (*oconv)(ev[(c1-SSP)*2],ev[(c1-SSP)*2+1]); c2=0; NEXT; } UNGETC(c2); c2 = 0; } (*oconv)(cv[(c1-SSP)*2],cv[(c1-SSP)*2+1]); NEXT; } else SEND; } else if(c1 == '(' && broken_f && input_mode == X0208 && !mime_mode ) { /* Try to recover missing escape */ if((c1 = GETC()) == EOF) { (*oconv) (0, '('); LAST; } else { if(c1 == 'B' || c1 == 'J' || c1 == 'H') { input_mode = ASCII; shift_mode = FALSE; NEXT; } else { (*oconv) (0, '('); /* do not modify various input_mode */ /* It can be vt100 sequence */ SEND; } } } else if(input_mode == X0208) { /* in case of Kanji shifted */ c2 = c1; NEXT; /* goto next_byte */ } else if(c1 == '=' && mime_f && !mime_mode ) { if((c1 = _GETC()) == EOF) { (*oconv) (0, '='); LAST; } else if(c1 == '?') { /* =? is mime conversion start sequence */ if(mime_begin() == EOF) /* check in detail */ LAST; else NEXT; } else { (*oconv) (0, '='); _UNGETC(c1); NEXT; } } else if(c1 == '$' && broken_f && !mime_mode) { /* try to recover missing escape */ if((c1 = GETC()) == EOF) { (*oconv) (0, '$'); LAST; } else if(c1 == '@'|| c1 == 'B') { /* in case of Kanji in ESC sequence */ input_mode = X0208; shift_mode = FALSE; NEXT; } else { /* sorry */ (*oconv) (0, '$'); (*oconv) (0, c1); NEXT; } } else SEND; } else if(c1 == SI) { shift_mode = FALSE; NEXT; } else if(c1 == SO) { shift_mode = TRUE; NEXT; } else if(c1 == ESC ) { if((c1 = GETC()) == EOF) { (*oconv) (0, ESC); LAST; } else if(c1 == '$') { if((c1 = GETC()) == EOF) { (*oconv) (0, ESC); (*oconv) (0, '$'); LAST; } else if(c1 == '@'|| c1 == 'B') { /* This is kanji introduction */ input_mode = X0208; shift_mode = FALSE; NEXT; } else if(broken_f&0x2) { input_mode = X0208; shift_mode = FALSE; NEXT; } else { (*oconv) (0, ESC); (*oconv) (0, '$'); (*oconv) (0, c1); NEXT; } } else if(c1 == '(') { if((c1 = GETC()) == EOF) { (*oconv) (0, ESC); (*oconv) (0, '('); LAST; } else { if(c1 == 'I') { /* This is X0201 kana introduction */ input_mode = X0201; shift_mode = X0201; NEXT; } else if(c1 == 'B' || c1 == 'J' || c1 == 'H') { /* This is X0208 kanji introduction */ input_mode = ASCII; shift_mode = FALSE; NEXT; } else if(broken_f&0x2) { input_mode = ASCII; shift_mode = FALSE; NEXT; } else { (*oconv) (0, ESC); (*oconv) (0, '('); /* maintain various input_mode here */ SEND; } } } else { /* lonely ESC */ (*oconv) (0, ESC); SEND; } } else if(c1 == NL && broken_f&4) { input_mode = ASCII; SEND; } else SEND; } /* send: */ if(input_mode == X0208) (*oconv) (c2, c1); /* this is JIS, not SJIS/EUC case */ else (*iconv) (c2, c1); /* can be EUC/SJIS */ c2 = 0; continue; /* goto next_word */ } /* epilogue */ (*iconv) (EOF, 0); return outlen; } static void h_conv (c2, c1) register int c1, c2; { register int wc; /** it must NOT be in the kanji shifte sequence */ /** it must NOT be written in JIS7 */ /** and it must be after 2 byte 8bit code */ hold_count = 0; push_hold_buf (c2, c1); c2 = 0; while ((c1 = GETC()) != EOF) { if(c2) { /* second byte */ if(!estab_f) { /* not established */ if(c1 > SSP) { /* it is still ambiguious yet */ SEND; } else if(c1 < AT) { /* ignore bogus first byte */ c2 = 0; SEND; } else { /* now established */ /* it seems to be MS Kanji */ estab_f = TRUE; iconv = s_iconv; SEND; } } else SEND; } else { /* First byte */ if(c1 > DEL) { /* 8th bit is on */ if(c1 < SSP) { /* it seems to be MS Kanji */ estab_f = TRUE; iconv = s_iconv; } else if(c1 < 0xe0) { /* it seems to be EUC */ estab_f = TRUE; iconv = oconv; } else { /* still ambiguious */ } c2 = c1; NEXT; } else /* 7 bit code , then send without any process */ SEND; } /* send: */ if((push_hold_buf (c2, c1) == EOF) || estab_f) break; c2 = 0; continue; } /** now, ** 1) EOF is detected, or ** 2) Code is established, or ** 3) Buffer is FULL (but last word is pushed) ** ** in 1) and 3) cases, we continue to use ** Kanji codes by oconv and leave estab_f unchanged. **/ for (wc = 0; wc < hold_count; wc += 2) { c2 = hold_buf[wc]; c1 = hold_buf[wc+1]; (*iconv) (c2, c1); } return; } static int push_hold_buf (c2, c1) int c2, c1; { if(hold_count >= HOLD_SIZE*2) return (EOF); hold_buf[hold_count++] = c2; hold_buf[hold_count++] = c1; return ((hold_count >= HOLD_SIZE*2) ? EOF : hold_count); } static void s_iconv (c2, c1) register int c2, c1; { if((c2 == EOF) || (c2 == 0)) { /* NOP */ } else { c2 = c2 + c2 - ((c2 <= 0x9f) ? SJ0162 : SJ6394); if(c1 < 0x9f) c1 = c1 - ((c1 > DEL) ? SP : 0x1f); else { c1 = c1 - 0x7e; c2++; } } (*oconv) (c2, c1); } static void e_oconv (c2, c1) register int c2, c1; { c2 = pre_convert(c1,c2); c1 = c1_return; if(fold_f) { switch(fold(c2,c1)) { case '\n': if(add_cr == TRUE) { PUTCHAR('\r'); c1 = '\n'; } PUTCHAR('\n'); break; case 0: return; case '\r': c1 = '\n'; c2 = 0; break; case '\t': case ' ': c1 = ' '; c2 = 0; break; } } if(c2==DOUBLE_SPACE) { PUTCHAR(' '); PUTCHAR(' '); return; } if(c2 == EOF) return; else if(c2 == 0 && (c1&0x80)) { PUTCHAR(SSO); PUTCHAR(c1); } else if(c2 == 0) { if(c1 == '\n' && add_cr == TRUE) PUTCHAR('\r'); if(c1 != '\r') PUTCHAR(c1); else if(del_cr == FALSE) PUTCHAR(c1); } else { if((c1<0x20 || 0x7e> 1) + ((c2 <= 0x5e) ? 0x71 : 0xb1))); PUTCHAR((c1 + ((c2 & 1) ? ((c1 < 0x60) ? 0x1f : 0x20) : 0x7e))); } } static void j_oconv (c2, c1) register int c2, c1; { c2 = pre_convert(c1,c2); c1 = c1_return; if(fold_f) { switch(fold(c2,c1)) { case '\n': if(output_mode) { PUTCHAR(ESC); PUTCHAR('('); PUTCHAR(ascii_intro); } if(add_cr == TRUE) { PUTCHAR('\r'); c1 = '\n'; } PUTCHAR('\n'); output_mode = ASCII; break; case '\r': c1 = '\n'; c2 = 0; break; case '\t': case ' ': c1 = ' '; c2 = 0; break; case 0: return; } } if(c2 == EOF) { if(output_mode) { PUTCHAR(ESC); PUTCHAR('('); PUTCHAR(ascii_intro); } } else if(c2 == 0 && (c1 & 0x80)) { if(input_mode==X0201 || !iso8859_f) { if(output_mode!=X0201) { PUTCHAR(ESC); PUTCHAR('('); PUTCHAR('I'); output_mode = X0201; } c1 &= 0x7f; } else { /* iso8859 introduction, or 8th bit on */ /* Can we convert in 7bit form using ESC-'-'-A ? Is this popular? */ } PUTCHAR(c1); } else if(c2 == 0) { if(output_mode) { PUTCHAR(ESC); PUTCHAR('('); PUTCHAR(ascii_intro); output_mode = ASCII; } if(c1 == '\n' && add_cr == TRUE) PUTCHAR('\r'); if(c1 != '\r') PUTCHAR(c1); else if(del_cr == FALSE) PUTCHAR(c1); } else if(c2 == DOUBLE_SPACE) { if(output_mode) { PUTCHAR(ESC); PUTCHAR('('); PUTCHAR(ascii_intro); output_mode = ASCII; } PUTCHAR(' '); if(c1 == '\n' && add_cr == TRUE) PUTCHAR('\r'); if(c1 != '\r') PUTCHAR(c1); else if(del_cr == FALSE) PUTCHAR(c1); } else { if(output_mode != X0208) { PUTCHAR(ESC); PUTCHAR('$'); PUTCHAR(kanji_intro); output_mode = X0208; } if(c1<0x20 || 0x7e0x80 Japanese (X0208/X0201) <0x80 ASCII \n new line ' ' space This fold algorthm does not preserve heading space in a line. This is the main difference from fmt. */ static int fold(c2,c1) register int c2,c1; { int prev0; if(c1=='\r') return 0; /* ignore cr */ if(c1== 8) { if(line>0) line--; return 1; } if(c2==EOF && line != 0) /* close open last line */ return '\n'; /* new line */ if(c1=='\n') { if(prev == c1) { /* duplicate newline */ if(line) { line = 0; return '\n'; /* output two newline */ } else { line = 0; return 1; } } else { if(prev&0x80) { /* Japanese? */ prev = c1; return 0; /* ignore given single newline */ } else if(prev==' ') { return 0; } else { prev = c1; if(++line<=fold_len) return ' '; else { line = 0; return '\r'; /* fold and output nothing */ } } } } if(c1=='\f') { prev = '\n'; if(line==0) return 1; line = 0; return '\n'; /* output newline and clear */ } /* X0208 kankaku or ascii space */ if( (c2==0&&c1==' ')|| (c2==0&&c1=='\t')|| (c2==DOUBLE_SPACE)|| (c2=='!'&& c1=='!')) { if(prev == ' ') { return 0; /* remove duplicate spaces */ } prev = ' '; if(++line<=fold_len) return ' '; /* output ASCII space only */ else { prev = ' '; line = 0; return '\r'; /* fold and output nothing */ } } prev0 = prev; /* we still need this one... , but almost done */ prev = c1; if(c2 || (SSP<=c1 && c1<=0xdf)) prev |= 0x80; /* this is Japanese */ line += (c2==0)?1:2; if(line<=fold_len) { /* normal case */ return 1; } if(line>=fold_len+FOLD_MARGIN) { /* too many kinsou suspension */ line = (c2==0)?1:2; return '\n'; /* We can't wait, do fold now */ } /* simple kinsoku rules return 1 means no folding */ if(c2==0) { if(c1==0xde) return 1; /* ゛*/ if(c1==0xdf) return 1; /* ゜*/ if(c1==0xa4) return 1; /* 。*/ if(c1==0xa3) return 1; /* ，*/ if(c1==0xa1) return 1; /* 」*/ if(c1==0xb0) return 1; /* - */ if(SSP<=c1 && c1<=0xdf) { /* X0201 */ line = 1; return '\n';/* add one new line before this character */ } /* fold point in ASCII { [ ( */ if(( c1!=')'&& c1!=']'&& c1!='}'&& c1!='.'&& c1!=','&& c1!='!'&& c1!='?'&& c1!='/'&& c1!=':'&& c1!=';')&& ((prev0=='\n')|| (prev0==' ')|| /* ignored new line */ (prev0&0x80)) /* X0208 - ASCII */ ) { line = 1; return '\n';/* add one new line before this character */ } return 1; /* default no fold in ASCII */ } else { if(c2=='!') { if(c1=='"') return 1; /* 、 */ if(c1=='#') return 1; /* 。 */ if(c1=='$') return 1; /* ， */ if(c1=='%') return 1; /* ． */ if(c1=='\'') return 1; /* ＋ */ if(c1=='(') return 1; /* ； */ if(c1==')') return 1; /* ？ */ if(c1=='*') return 1; /* ！ */ if(c1=='+') return 1; /* ゛ */ if(c1==',') return 1; /* ゜ */ } line = 2; return '\n'; /* add one new line before this character */ } } static int pre_convert(c1,c2) register int c1,c2; { if(c2) c1 &= 0x7f; c1_return = c1; if(c2==EOF) return c2; c2 &= 0x7f; if(rot_f) { if(c2) { c1 = rot47(c1); c2 = rot47(c2); } else { if(!(c1 & 0x80)) c1 = rot13(c1); } c1_return = c1; } /* JISX0208 Alphabet */ if(alpha_f && c2 == 0x23 ) return 0; /* JISX0208 Kigou */ if(alpha_f && c2 == 0x21 ) { if(0x21==c1) { if(alpha_f&0x2) { c1_return = ' '; return 0; } else if(alpha_f&0x4) { c1_return = ' '; return DOUBLE_SPACE; } else { return c2; } } else if(0x20' ';i++) { /* start at =? */ if( ((r[i] = c1 = _GETC())==EOF) || nkf_toupper(c1) != p[i] ) { /* pattern fails, try next one */ q = p; while (p = mime_pattern[++j]) { for(k=2;k i */ if(p[k]!=q[k]) break; if(k==i && nkf_toupper(c1)==p[k]) break; } if(p) continue; /* found next one, continue */ /* all fails, output from recovery buffer */ _UNGETC(c1); for(j=0;j> 4) & 0x03); if(c2 != '=') { Fifo(mime_last++) = cc; cc = ((t2 << 4) & 0x0f0) | ((t3 >> 2) & 0x0f); if(c3 != '=') { Fifo(mime_last++) = cc; cc = ((t3 << 6) & 0x0c0) | (t4 & 0x3f); if(c4 != '=') Fifo(mime_last++) = cc; } } else { return c1; } return Fifo(mime_top++); } static int mime_ungetc(c) unsigned int c; { Fifo(mime_last++) = c; return c; } static int mime_integrity(p) unsigned char *p; { int c,d; unsigned int q; /* In buffered mode, read until =? or NL or buffer full */ mime_input = mime_top; mime_last = mime_top; while(*p) Fifo(mime_input++) = *p++; d = 0; q = mime_input; while((c=_GETC())!=EOF) { if(((mime_input-mime_top)&MIME_BUF_MASK)==0) break; if(c=='=' && d=='?') { /* checked. skip header, start decode */ Fifo(mime_input++) = c; mime_input = q; return 1; } if(!( (c=='+'||c=='/'|| c=='=' || c=='?' || ('a'<=c && c<='z')||('A'<= c && c<='Z')||('0'<=c && c<='9')))) break; /* Should we check length mod 4? */ Fifo(mime_input++) = c; d=c; } /* In case of Incomplete MIME, no MIME decode */ Fifo(mime_input++) = c; mime_last = mime_input; /* point undecoded buffer */ mime_mode = 1; /* no decode on Fifo last in mime_getc */ return 1; } static int base64decode(c) int c; { int i; if(c > '@') if(c < '[') i = c - 'A'; /* A..Z 0-25 */ else i = c - 'G' /* - 'a' + 26 */ ; /* a..z 26-51 */ else if(c > '/') i = c - '0' + '4' /* - '0' + 52 */ ; /* 0..9 52-61 */ else if(c == '+') i = '>' /* 62 */ ; /* + 62 */ else i = '?' /* 63 */ ; /* / 63 */ return (i); } #ifdef notdef int usage() { fprintf(stderr,"USAGE: nkf(nkf32,wnkf,nkf2) -[flags] [in file] .. [out file for -O flag]\n"); fprintf(stderr,"Flags:\n"); fprintf(stderr,"b,u Output is bufferred (DEFAULT),Output is unbufferred\n"); #ifdef DEFAULT_CODE_SJIS fprintf(stderr,"j,s,e Outout code is JIS 7 bit, Shift JIS (DEFAULT), AT&T JIS (EUC)\n"); #endif #ifdef DEFAULT_CODE_JIS fprintf(stderr,"j,s,e Outout code is JIS 7 bit (DEFAULT), Shift JIS, AT&T JIS (EUC)\n"); #endif #ifdef DEFAULT_CODE_EUC fprintf(stderr,"j,s,e Outout code is JIS 7 bit, Shift JIS, AT&T JIS (EUC) (DEFAULT)\n"); #endif fprintf(stderr,"J,S,E Input assumption is JIS 7 bit , Shift JIS, AT&T JIS (EUC)\n"); fprintf(stderr,"t no conversion\n"); fprintf(stderr,"i_ Output sequence to designate JIS-kanji (DEFAULT B)\n"); fprintf(stderr,"o_ Output sequence to designate ASCII (DEFAULT B)\n"); fprintf(stderr,"r {de/en}crypt ROT13/47\n"); fprintf(stderr,"v Show this usage\n"); fprintf(stderr,"m[BQ] MIME decode [B:base64 stream,Q:quoted stream]\n"); fprintf(stderr,"l ISO8859-1 (Latin-1) support\n"); fprintf(stderr,"f Folding: -f60 or -f\n"); fprintf(stderr,"Z[0-2] Convert X0208 alphabet to ASCII 1: Kankaku to space,2: 2 spaces\n"); fprintf(stderr,"X,x Assume X0201 kana in MS-Kanji, -x preserves X0201\n"); fprintf(stderr,"B[0-2] Broken input 0: missing ESC,1: any X on ESC-[($]-X,2: ASCII on NL\n"); #ifdef MSDOS fprintf(stderr,"T Text mode output\n"); #endif fprintf(stderr,"O Output to File (DEFAULT 'nkf.out')\n"); fprintf(stderr,"d,c Delete \\r in line feed, Add \\r in line feed\n"); fprintf(stderr,"Network Kanji Filter Version %s (%s) " #if defined(MSDOS) && !defined(_Windows) "for DOS" #endif #if !defined(__WIN32__) && defined(_Windows) "for Win16" #endif #if defined(__WIN32__) && defined(_Windows) "for Win32" #endif #ifdef __OS2__ "for OS/2" #endif ,Version,Patchlevel); fprintf(stderr,"\n%s\n",CopyRight); return 0; } #endif /* notdef */ static VALUE kconv_kconv(argc, argv) int argc; VALUE *argv; { VALUE src, dst; VALUE in, out; int in_code, out_code; char *codename = 0; rb_scan_args(argc, argv, "12", &src, &out, &in); Check_Type(src, T_STRING); if (NIL_P(out)) { codename = rb_get_kcode(); goto codeselect; } else if (TYPE(out) == T_STRING) { codename = RSTRING(out)->ptr; codeselect: switch (codename[0]) { case 'E': case 'e': out_code = _EUC; break; case 'S': case 's': out_code = _SJIS; break; case 'J': case 'j': default: out_code = _JIS; break; } } else { out_code = NUM2INT(out); if (out_code == _NOCONV) return (VALUE)src; } if (NIL_P(in)) { in_code = _AUTO; } else if (TYPE(in) == T_STRING) { switch (RSTRING(in)->ptr[0]) { case 'E': case 'e': in_code = _EUC; break; case 'S': case 's': in_code = _SJIS; break; case 'J': case 'j': in_code = _JIS; break; default: in_code = _AUTO; break; } } else { in_code = NUM2INT(in); if (in_code == _NOCONV) return (VALUE)src; } dst = str_new(0, RSTRING(src)->len*3+10); /* large enough? */ RSTRING(dst)->len = do_kconv(RSTRING(src)->ptr, RSTRING(dst)->ptr, RSTRING(dst)->len, out_code, in_code); return dst; } static VALUE kconv_tojis(obj, src) VALUE obj, src; { VALUE dst; Check_Type(src, T_STRING); dst = str_new(0, RSTRING(src)->len*3+10); /* large enough? */ RSTRING(dst)->len = do_kconv(RSTRING(src)->ptr, RSTRING(dst)->ptr, RSTRING(dst)->len, _JIS, _AUTO); return dst; } static VALUE kconv_toeuc(obj, src) VALUE obj, src; { VALUE dst; Check_Type(src, T_STRING); dst = str_new(0, RSTRING(src)->len*3+10); /* large enough? */ RSTRING(dst)->len = do_kconv(RSTRING(src)->ptr, RSTRING(dst)->ptr, RSTRING(dst)->len, _EUC, _AUTO); return (VALUE)dst; } static VALUE kconv_tosjis(obj, src) VALUE obj, src; { VALUE dst; Check_Type(src, T_STRING); dst = str_new(0, RSTRING(src)->len*3+10); /* large enough? */ RSTRING(dst)->len = do_kconv(RSTRING(src)->ptr, RSTRING(dst)->ptr, RSTRING(dst)->len, _SJIS, _AUTO); return dst; } /* * Character code detection - Algorithm described in: * Ken Lunde. `Understanding Japanese Information Processing' * Sebastopol, CA: O'Reilly & Associates. */ static VALUE kconv_guess(obj, src) VALUE obj, src; { unsigned char *p; unsigned char *pend; int sequence_counter = 0; Check_Type(src, T_STRING); p = RSTRING(src)->ptr; pend = p + RSTRING(src)->len; #define INCR do {\ p++;\ if (p==pend) return INT2FIX(_UNKNOWN);\ sequence_counter++;\ if (sequence_counter % 2 == 1 && *p != 0xa4)\ sequence_counter = 0;\ if (6 <= sequence_counter) {\ sequence_counter = 0;\ return INT2FIX(_EUC);\ }\ } while (0) if (*p == 0xa4) sequence_counter = 1; while (p= 0x40) { if (*p >= 0x81) { if (*p <= 0x8d || (0x8f <= *p && *p <= 0x9f)) { return INT2FIX(_SJIS); } else if (0xfd <= *p && *p <= 0xfe) { return INT2FIX(_EUC); } } INCR; } } else if (*p <= 0x9f) { return INT2FIX(_SJIS); } } else if (0xf0 <= *p && *p <= 0xfe) { return INT2FIX(_EUC); } else if (0xe0 <= *p && *p <= 0xef) { INCR; if ((0x40 <= *p && *p <= 0x7e) || (0x80 <= *p && *p <= 0xa0)) { return INT2FIX(_SJIS); } if (0xfd <= *p && *p <= 0xfe) { return INT2FIX(_EUC); } } INCR; } return INT2FIX(_UNKNOWN); } void Init_kconv() { VALUE mKconv = rb_define_module("Kconv"); rb_define_module_function(mKconv, "kconv", kconv_kconv, -1); rb_define_module_function(mKconv, "tojis", kconv_tojis, 1); rb_define_module_function(mKconv, "toeuc", kconv_toeuc, 1); rb_define_module_function(mKconv, "tosjis", kconv_tosjis, 1); rb_define_module_function(mKconv, "guess", kconv_guess, 1); rb_define_const(mKconv, "AUTO", INT2FIX(_AUTO)); rb_define_const(mKconv, "JIS", INT2FIX(_JIS)); rb_define_const(mKconv, "EUC", INT2FIX(_EUC)); rb_define_const(mKconv, "SJIS", INT2FIX(_SJIS)); rb_define_const(mKconv, "BINARY", INT2FIX(_BINARY)); rb_define_const(mKconv, "NOCONV", INT2FIX(_NOCONV)); rb_define_const(mKconv, "UNKNOWN", INT2FIX(_UNKNOWN)); } /** ** パッチ制作者 ** void@merope.pleiades.or.jp (Kusakabe Youichi) ** NIDE Naoyuki ** ohta@src.ricoh.co.jp (Junn Ohta) ** inouet@strl.nhk.or.jp (Tomoyuki Inoue) ** kiri@pulser.win.or.jp (Tetsuaki Kiriyama) ** Kimihiko Sato ** a_kuroe@kuroe.aoba.yokohama.jp (Akihiko Kuroe) ** kono@ie.u-ryukyu.ac.jp (Shinji Kono) ** GHG00637@nifty-serve.or.jp (COW) ** j_kuro@pluto.ai.kyutech.ac.jp (Jun Kuroda) ** ** 最終更新日 ** 1996.12.18 **/ /* end */ ruby-1.2.3/ext/md5/ 40755 774 145 0 6662164574 11743 5ustar matzNaClruby-1.2.3/ext/md5/MANIFEST100644 774 145 57 6457556235 13134 0ustar matzNaClMANIFEST depend md5.doc md5.h md5c.c md5init.c ruby-1.2.3/ext/md5/depend100644 774 145 150 6457557272 13201 0ustar matzNaClmd5c.o: md5c.c md5.h md5init.o: md5init.c $(hdrdir)/ruby.h $(hdrdir)/config.h $(hdrdir)/defines.h md5.h ruby-1.2.3/ext/md5/md5.doc100644 774 145 1217 6457556235 13216 0ustar matzNaCl.\" md5.doc - -*- Indented-Text -*- created at: Fri Aug 2 12:01:27 JST 1996 ** MD5(クラス) RFC1321に記述されているRSA Data Security, Inc. の MD5 Message-Digest Algorithmを実装するクラス． SuperClass: Object Class Methods: new([str]) md5([str]) 新しいMD5オブジェクトを生成する．文字列引数が与えられるとそれ を追加する(see update)． Methods: clone MD5オブジェクトの複製を作る digest 今までに追加した文字列に対するハッシュ値を16バイト長の文字列で 返す． update(str) keyをキーとする値を返す． ------------------------------------------------------- Local variables: fill-column: 70 end: ruby-1.2.3/ext/md5/md5.h100644 774 145 4775 6457556235 12714 0ustar matzNaCl/* MD5.H - header file for MD5C.C */ /* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All rights reserved. License to copy and use this software is granted provided that it is identified as the "RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing this software or this function. License is also granted to make and use derivative works provided that such works are identified as "derived from the RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing the derived work. RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided "as is" without express or implied warranty of any kind. These notices must be retained in any copies of any part of this documentation and/or software. */ /* ========== include global.h ========== */ /* GLOBAL.H - RSAREF types and constants */ /* PROTOTYPES should be set to one if and only if the compiler supports function argument prototyping. The following makes PROTOTYPES default to 0 if it has not already been defined with C compiler flags. */ #ifdef HAVE_PROTOTYPES #define PROTOTYPES 1 #endif #ifndef PROTOTYPES #define PROTOTYPES 0 #endif /* POINTER defines a generic pointer type */ typedef unsigned char *POINTER; /* UINT2 defines a two byte word */ typedef unsigned short int UINT2; #ifdef HAVE_LIMITS_H #include #else /* Wild guess */ #define LONG_MAX 2147483647L #endif /* UINT4 defines a four byte word */ #if defined(INT_MAX) && INT_MAX == 2147483647 typedef unsigned int UINT4; #else #if defined(LONG_MAX) && LONG_MAX == 2147483647L typedef unsigned long int UINT4; #endif /* Too bad if neither is */ #endif /* PROTO_LIST is defined depending on how PROTOTYPES is defined above. If using PROTOTYPES, then PROTO_LIST returns the list, otherwise it returns an empty list. */ #if PROTOTYPES #define PROTO_LIST(list) list #else #define PROTO_LIST(list) () #endif /* ========== End global.h; continue md5.h ========== */ /* MD5 context. */ typedef struct { UINT4 state[4]; /* state (ABCD) */ UINT4 count[2]; /* number of bits, modulo 2^64 (lsb first) */ unsigned char buffer[64]; /* input buffer */ } MD5_CTX; void MD5Init PROTO_LIST ((MD5_CTX *)); void MD5Update PROTO_LIST ((MD5_CTX *, unsigned char *, unsigned int)); void MD5Final PROTO_LIST ((unsigned char [16], MD5_CTX *)); ruby-1.2.3/ext/md5/md5c.c100644 774 145 24325 6457556235 13063 0ustar matzNaCl/* MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm */ /* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All rights reserved. License to copy and use this software is granted provided that it is identified as the "RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing this software or this function. License is also granted to make and use derivative works provided that such works are identified as "derived from the RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing the derived work. RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided "as is" without express or implied warranty of any kind. These notices must be retained in any copies of any part of this documentation and/or software. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "md5.h" /* Constants for MD5Transform routine. */ #define S11 7 #define S12 12 #define S13 17 #define S14 22 #define S21 5 #define S22 9 #define S23 14 #define S24 20 #define S31 4 #define S32 11 #define S33 16 #define S34 23 #define S41 6 #define S42 10 #define S43 15 #define S44 21 static void MD5Transform PROTO_LIST ((UINT4 [4], unsigned char [64])); static void Encode PROTO_LIST ((unsigned char *, UINT4 *, unsigned int)); static void Decode PROTO_LIST ((UINT4 *, unsigned char *, unsigned int)); static void MD5_memcpy PROTO_LIST ((POINTER, POINTER, unsigned int)); static void MD5_memset PROTO_LIST ((POINTER, int, unsigned int)); static unsigned char PADDING[64] = { 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; /* F, G, H and I are basic MD5 functions. */ #define F(x, y, z) (((x) & (y)) | ((~x) & (z))) #define G(x, y, z) (((x) & (z)) | ((y) & (~z))) #define H(x, y, z) ((x) ^ (y) ^ (z)) #define I(x, y, z) ((y) ^ ((x) | (~z))) /* ROTATE_LEFT rotates x left n bits. */ #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n)))) /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4. Rotation is separate from addition to prevent recomputation. */ #define FF(a, b, c, d, x, s, ac) { \ (a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } #define GG(a, b, c, d, x, s, ac) { \ (a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } #define HH(a, b, c, d, x, s, ac) { \ (a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } #define II(a, b, c, d, x, s, ac) { \ (a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } /* MD5 initialization. Begins an MD5 operation, writing a new context. */ void MD5Init (context) MD5_CTX *context; /* context */ { context->count[0] = context->count[1] = 0; /* Load magic initialization constants. */ context->state[0] = 0x67452301; context->state[1] = 0xefcdab89; context->state[2] = 0x98badcfe; context->state[3] = 0x10325476; } /* MD5 block update operation. Continues an MD5 message-digest operation, processing another message block, and updating the context. */ void MD5Update (context, input, inputLen) MD5_CTX *context; /* context */ unsigned char *input; /* input block */ unsigned int inputLen; /* length of input block */ { unsigned int i, index, partLen; /* Compute number of bytes mod 64 */ index = (unsigned int)((context->count[0] >> 3) & 0x3F); /* Update number of bits */ if ((context->count[0] += ((UINT4)inputLen << 3)) < ((UINT4)inputLen << 3)) context->count[1]++; context->count[1] += ((UINT4)inputLen >> 29); partLen = 64 - index; /* Transform as many times as possible. */ if (inputLen >= partLen) { MD5_memcpy ((POINTER)&context->buffer[index], (POINTER)input, partLen); MD5Transform (context->state, context->buffer); for (i = partLen; i + 63 < inputLen; i += 64) MD5Transform (context->state, &input[i]); index = 0; } else i = 0; /* Buffer remaining input */ MD5_memcpy ((POINTER)&context->buffer[index], (POINTER)&input[i], inputLen-i); } /* MD5 finalization. Ends an MD5 message-digest operation, writing the the message digest and zeroizing the context. */ void MD5Final (digest, context) unsigned char digest[16]; /* message digest */ MD5_CTX *context; /* context */ { unsigned char bits[8]; unsigned int index, padLen; /* Save number of bits */ Encode (bits, context->count, 8); /* Pad out to 56 mod 64. */ index = (unsigned int)((context->count[0] >> 3) & 0x3f); padLen = (index < 56) ? (56 - index) : (120 - index); MD5Update (context, PADDING, padLen); /* Append length (before padding) */ MD5Update (context, bits, 8); /* Store state in digest */ Encode (digest, context->state, 16); /* Zeroize sensitive information. */ MD5_memset ((POINTER)context, 0, sizeof (*context)); } /* MD5 basic transformation. Transforms state based on block. */ static void MD5Transform (state, block) UINT4 state[4]; unsigned char block[64]; { UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16]; Decode (x, block, 64); /* Round 1 */ FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */ FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */ FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */ FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */ FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */ FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */ FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */ FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */ FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */ FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */ FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */ FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */ FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */ FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */ FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */ FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */ /* Round 2 */ GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */ GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */ GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */ GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */ GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */ GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */ GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */ GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */ GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */ GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */ GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */ GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */ GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */ GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */ GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */ GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */ /* Round 3 */ HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */ HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */ HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */ HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */ HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */ HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */ HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */ HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */ HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */ HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */ HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */ HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */ HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */ HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */ HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */ HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */ /* Round 4 */ II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */ II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */ II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */ II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */ II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */ II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */ II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */ II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */ II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */ II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */ II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */ II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */ II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */ II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */ II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */ II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */ state[0] += a; state[1] += b; state[2] += c; state[3] += d; /* Zeroize sensitive information. */ MD5_memset ((POINTER)x, 0, sizeof (x)); } /* Encodes input (UINT4) into output (unsigned char). Assumes len is a multiple of 4. */ static void Encode (output, input, len) unsigned char *output; UINT4 *input; unsigned int len; { unsigned int i, j; for (i = 0, j = 0; j < len; i++, j += 4) { output[j] = (unsigned char)(input[i] & 0xff); output[j+1] = (unsigned char)((input[i] >> 8) & 0xff); output[j+2] = (unsigned char)((input[i] >> 16) & 0xff); output[j+3] = (unsigned char)((input[i] >> 24) & 0xff); } } /* Decodes input (unsigned char) into output (UINT4). Assumes len is a multiple of 4. */ static void Decode (output, input, len) UINT4 *output; unsigned char *input; unsigned int len; { unsigned int i, j; for (i = 0, j = 0; j < len; i++, j += 4) output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) | (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24); } /* Note: Replace "for loop" with standard memcpy if possible. */ static void MD5_memcpy (output, input, len) POINTER output; POINTER input; unsigned int len; { unsigned int i; for (i = 0; i < len; i++) output[i] = input[i]; } /* Note: Replace "for loop" with standard memset if possible. */ static void MD5_memset (output, value, len) POINTER output; int value; unsigned int len; { unsigned int i; for (i = 0; i < len; i++) ((char *)output)[i] = (char)value; } ruby-1.2.3/ext/md5/md5init.c100644 774 145 3565 6626426047 13562 0ustar matzNaCl/************************************************ md5init.c - $Author: matz $ created at: Fri Aug 2 09:24:12 JST 1996 Copyright (C) 1995-1998 Yukihiro Matsumoto ************************************************/ /* This module provides an interface to the RSA Data Security, Inc. MD5 Message-Digest Algorithm, described in RFC 1321. It requires the files md5c.c and md5.h (which are slightly changed from the versions in the RFC to avoid the "global.h" file.) */ #include "ruby.h" #include "md5.h" static VALUE cMD5; static VALUE md5_update(obj, str) VALUE obj; struct RString *str; { MD5_CTX *md5; Check_Type(str, T_STRING); Data_Get_Struct(obj, MD5_CTX, md5); MD5Update(md5, str->ptr, str->len); return Qnil; } static VALUE md5_digest(obj) VALUE obj; { MD5_CTX *md5, ctx; unsigned char digest[16]; Data_Get_Struct(obj, MD5_CTX, md5); ctx = *md5; MD5Final(digest, &ctx); return str_new(digest, 16); } static VALUE md5_clone(obj) VALUE obj; { VALUE clone; MD5_CTX *md5, *md5_new; Data_Get_Struct(obj, MD5_CTX, md5); obj = Data_Make_Struct(CLASS_OF(obj), MD5_CTX, 0, free, md5_new); *md5_new = *md5; return obj; } static VALUE md5_new(argc, argv, class) int argc; VALUE* argv; VALUE class; { int i; VALUE arg, obj; MD5_CTX *md5; rb_scan_args(argc, argv, "01", &arg); if (!NIL_P(arg)) Check_Type(arg, T_STRING); obj = Data_Make_Struct(class, MD5_CTX, 0, free, md5); MD5Init(md5); if (!NIL_P(arg)) { md5_update(obj, arg); } obj_call_init(obj); return obj; } Init_md5() { cMD5 = rb_define_class("MD5", cObject); rb_define_singleton_method(cMD5, "new", md5_new, -1); rb_define_method(cMD5, "update", md5_update, 1); rb_define_method(cMD5, "digest", md5_digest, 0); rb_define_method(cMD5, "clone", md5_clone, 0); } ruby-1.2.3/ext/socket/ 40755 774 145 0 6662164575 12547 5ustar matzNaClruby-1.2.3/ext/socket/MANIFEST100644 774 145 44 6457556235 13733 0ustar matzNaClMANIFEST depend extconf.rb socket.c ruby-1.2.3/ext/socket/depend100644 774 145 164 6541372137 13776 0ustar matzNaClsocket.o : socket.c $(hdrdir)/ruby.h $(hdrdir)/config.h $(hdrdir)/defines.h $(hdrdir)/rubyio.h $(hdrdir)/rubysig.h ruby-1.2.3/ext/socket/extconf.rb100644 774 145 1324 6563744152 14632 0ustar matzNaClrequire 'mkmf' $LDFLAGS = "-L/usr/local/lib" if File.directory?("/usr/local/lib") case PLATFORM when /mswin32/ test_func = "WSACleanup" have_library("wsock32", "WSACleanup") when /cygwin32/ test_func = "socket" when /beos/ test_func = "socket" have_library("net", "socket") else test_func = "socket" have_library("inet", "gethostbyname") have_library("nsl", "t_open") have_library("socket", "socket") end have_header("sys/un.h") if have_func(test_func) have_func("hsterror") unless have_func("gethostname") have_func("uname") end if ENV["SOCKS_SERVER"] # test if SOCKSsocket needed if have_library("socks", "Rconnect") $CFLAGS="-DSOCKS" end end create_makefile("socket") end ruby-1.2.3/ext/socket/socket.c100644 774 145 105166 6610324467 14340 0ustar matzNaCl/************************************************ socket.c - $Author: matz $ $Date: 1998/09/03 07:43:47 $ created at: Thu Mar 31 12:21:29 JST 1994 ************************************************/ #include "ruby.h" #include "rubyio.h" #include "rubysig.h" #include #include #ifndef NT #include #include #include #endif #include #ifdef HAVE_SYS_UN_H #include #endif #ifdef USE_CWGUSI extern int fileno(FILE *stream); /* */ extern int thread_select(int, fd_set*, fd_set*, fd_set*, struct timeval*); /* thread.c */ # include # include #endif #if defined(THREAD) && defined(HAVE_FCNTL) #ifdef HAVE_SYS_SELECT_H #include #endif #include #include #include #endif #ifndef EWOULDBLOCK #define EWOULDBLOCK EAGAIN #endif VALUE cBasicSocket; VALUE cIPsocket; VALUE cTCPsocket; VALUE cTCPserver; VALUE cUDPsocket; #ifdef AF_UNIX VALUE cUNIXsocket; VALUE cUNIXserver; #endif VALUE cSocket; static VALUE eSocket; #ifdef SOCKS VALUE cSOCKSsocket; void SOCKSinit(); int Rconnect(); #endif FILE *rb_fdopen(); char *strdup(); #define INET_CLIENT 0 #define INET_SERVER 1 #define INET_SOCKS 2 #ifdef NT static void sock_finalize(fptr) OpenFile *fptr; { SOCKET s = fileno(fptr->f); free(fptr->f); free(fptr->f2); closesocket(s); } #endif static VALUE sock_new(class, fd) VALUE class; int fd; { OpenFile *fp; NEWOBJ(sock, struct RFile); OBJSETUP(sock, class, T_FILE); rb_secure(4); MakeOpenFile(sock, fp); fp->f = rb_fdopen(fd, "r"); #ifdef NT fp->finalize = sock_finalize; #endif fp->f2 = rb_fdopen(fd, "w"); fp->mode = FMODE_READWRITE; io_unbuffered(fp); obj_call_init((VALUE)sock); return (VALUE)sock; } static VALUE bsock_shutdown(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { VALUE howto; int how; OpenFile *fptr; rb_secure(4); rb_scan_args(argc, argv, "01", &howto); if (howto == Qnil) how = 2; else { how = NUM2INT(howto); #if 0 if (how < 0 || 2 < how) how = 2; #endif } GetOpenFile(sock, fptr); if (shutdown(fileno(fptr->f), how) == -1) rb_sys_fail(0); return INT2FIX(0); } static VALUE bsock_setsockopt(sock, lev, optname, val) VALUE sock, lev, optname, val; { int level, option; OpenFile *fptr; int i; char *v; int vlen; rb_secure(2); level = NUM2INT(lev); option = NUM2INT(optname); switch (TYPE(val)) { case T_FIXNUM: i = FIX2INT(val); goto numval; case T_FALSE: i = 0; goto numval; case T_TRUE: i = 1; numval: v = (char*)&i; vlen = sizeof(i); break; default: v = str2cstr(val, &vlen); } GetOpenFile(sock, fptr); if (setsockopt(fileno(fptr->f), level, option, v, vlen) < 0) rb_sys_fail(fptr->path); return INT2FIX(0); } static VALUE bsock_getsockopt(sock, lev, optname) VALUE sock, lev, optname; { #if !defined(__BEOS__) int level, option, len; char *buf; OpenFile *fptr; level = NUM2INT(lev); option = NUM2INT(optname); len = 256; buf = ALLOCA_N(char,len); GetOpenFile(sock, fptr); if (getsockopt(fileno(fptr->f), level, option, buf, &len) < 0) rb_sys_fail(fptr->path); return str_new(buf, len); #else rb_notimplement(); #endif } static VALUE bsock_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 bsock_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 bsock_send(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { VALUE msg, to; VALUE flags; OpenFile *fptr; FILE *f; int fd, n; char *m, *t; int mlen, tlen; rb_secure(4); rb_scan_args(argc, argv, "21", &msg, &flags, &to); GetOpenFile(sock, fptr); f = fptr->f2?fptr->f2:fptr->f; fd = fileno(f); retry: #ifdef THREAD thread_fd_writable(fd); #endif m = str2cstr(msg, &mlen); if (RTEST(to)) { t = str2cstr(to, &tlen); n = sendto(fd, m, mlen, NUM2INT(flags), (struct sockaddr*)t, tlen); } else { n = send(fd, m, mlen, NUM2INT(flags)); } if (n < 0) { switch (errno) { case EINTR: case EWOULDBLOCK: #if EAGAIN != EWOULDBLOCK case EAGAIN: #endif #ifdef THREAD thread_schedule(); #endif goto retry; } rb_sys_fail("send(2)"); } return INT2FIX(n); } static VALUE ipaddr _((struct sockaddr_in*)); #ifdef HAVE_SYS_UN_H static VALUE unixaddr _((struct sockaddr_un*)); #endif enum sock_recv_type { RECV_RECV, /* BasicSocket#recv(no from) */ RECV_TCP, /* TCPsocket#recvfrom */ RECV_UDP, /* UDPsocket#recvfrom */ RECV_UNIX, /* UNIXsocket#recvfrom */ RECV_SOCKET, /* Socket#recvfrom */ }; static VALUE s_recv(sock, argc, argv, from) VALUE sock; int argc; VALUE *argv; enum sock_recv_type from; { OpenFile *fptr; FILE f; VALUE 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 = str_new(0, NUM2INT(len)); GetOpenFile(sock, fptr); fd = fileno(fptr->f); #ifdef THREAD thread_wait_fd(fd); #endif TRAP_BEG; retry: RSTRING(str)->len = recvfrom(fd, RSTRING(str)->ptr, RSTRING(str)->len, flags, (struct sockaddr*)buf, &alen); TRAP_END; if (RSTRING(str)->len < 0) { switch (errno) { case EINTR: case EWOULDBLOCK: #if EAGAIN != EWOULDBLOCK case EAGAIN: #endif #ifdef THREAD thread_schedule(); #endif goto retry; } rb_sys_fail("recvfrom(2)"); } str_taint(str); switch (from) { case RECV_RECV: return (VALUE)str; case RECV_TCP: if (alen != sizeof(struct sockaddr_in)) { TypeError("sockaddr size differs - should not happen"); } return assoc_new(str, ipaddr((struct sockaddr_in *)buf)); case RECV_UDP: { VALUE addr = ipaddr((struct sockaddr_in *)buf); return assoc_new(str, assoc_new(RARRAY(addr)->ptr[2], RARRAY(addr)->ptr[1])); } #ifdef HAVE_SYS_UN_H case RECV_UNIX: if (alen != sizeof(struct sockaddr_un)) { TypeError("sockaddr size differs - should not happen"); } return assoc_new(str, unixaddr((struct sockaddr_un *)buf)); #endif case RECV_SOCKET: return assoc_new(str, str_new(buf, alen)); } } static VALUE bsock_recv(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { return s_recv(sock, argc, argv, RECV_RECV); } #if defined(THREAD) && defined(HAVE_FCNTL) static int thread_connect(fd, sockaddr, len, type) int fd; struct sockaddr *sockaddr; int len; int type; { int status; int mode; fd_set fds; mode = fcntl(fd, F_GETFL, 0); #ifdef O_NDELAY # define NONBLOCKING O_NDELAY #else #ifdef O_NBIO # define NONBLOCKING O_NBIO #else # define NONBLOCKING O_NONBLOCK #endif #endif fcntl(fd, F_SETFL, mode|NONBLOCKING); for (;;) { #ifdef SOCKS if (type == INET_SOCKS) { status = Rconnect(fd, sockaddr, len); } else #endif { status = connect(fd, sockaddr, len); } if (status < 0) { switch (errno) { #ifdef EINPROGRESS case EINPROGRESS: #ifdef EAGAIN case EAGAIN: #endif FD_ZERO(&fds); FD_SET(fd, &fds); thread_select(fd+1, 0, &fds, 0, 0); continue; #endif #ifdef EISCONN case EISCONN: #endif #ifdef EALREADY case EALREADY: #endif #if defined(EISCONN) || defined(EALREADY) status = 0; errno = 0; break; #endif } } mode &= ~NONBLOCKING; fcntl(fd, F_SETFL, mode); return status; } } #endif static VALUE open_inet(class, h, serv, type) VALUE class, h, serv; int type; { 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_SafeStr(h); host = RSTRING(h)->ptr; hostent = gethostbyname(host); if (hostent == NULL) { #ifndef USE_CWGUSI hostaddr = inet_addr(host); #else hostaddr = inet_addr(host).s_addr; #endif if (hostaddr == -1) { if (type == INET_SERVER && !strlen(host)) hostaddr = INADDR_ANY; else { #ifdef HAVE_HSTRERROR extern int h_errno; Raise(eSocket, (char *)hstrerror(h_errno)); #else Raise(eSocket, "host not found"); #endif } } _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; } servent = getservbyname(STR2CSTR(serv), "tcp"); if (servent == NULL) { char *s = STR2CSTR(serv); char *end; servport = strtoul(s, &end, 0); if (*end != '\0') { Raise(eSocket, "no such servce %s", s); } setup_servent: _servent.s_port = htons(servport); _servent.s_proto = "tcp"; servent = &_servent; } #ifdef __BEOS__ fd = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP); #else protoent = getprotobyname(servent->s_proto); if (protoent == NULL) { Raise(eSocket, "no such proto %s", servent->s_proto); } fd = socket(AF_INET, SOCK_STREAM, protoent->p_proto); #endif memset(&sockaddr, 0, sizeof(sockaddr)); sockaddr.sin_family = AF_INET; if (h) { memcpy((char *)&(sockaddr.sin_addr.s_addr), (char *) hostent->h_addr_list[0], (size_t) hostent->h_length); } else { sockaddr.sin_addr.s_addr = INADDR_ANY; } sockaddr.sin_port = servent->s_port; if (type == INET_SERVER) { status = 1; setsockopt(fd,SOL_SOCKET,SO_REUSEADDR,(char*)&status,sizeof(status)); status = bind(fd, (struct sockaddr*)&sockaddr, sizeof(sockaddr)); syscall = "bind(2)"; } else { #if defined(THREAD) && defined(HAVE_FCNTL) status = thread_connect(fd, (struct sockaddr*)&sockaddr, sizeof(sockaddr), type); #else #ifdef SOCKS if (type == INET_SOCKS) { status = Rconnect(fd, &sockaddr, sizeof(sockaddr)); } else #endif { status = connect(fd, (struct sockaddr*)&sockaddr, sizeof(sockaddr)); } #endif syscall = "connect(2)"; } if (status < 0) { close (fd); rb_sys_fail(syscall); } if (type == INET_SERVER) listen(fd, 5); /* create new instance */ return sock_new(class, fd); } static VALUE tcp_s_open(class, host, serv) VALUE class, host, serv; { Check_SafeStr(host); return open_inet(class, host, serv, INET_CLIENT); } #ifdef SOCKS static VALUE socks_s_open(class, host, serv) VALUE class, host, serv; { static init = 0; if (init == 0) { SOCKSinit("ruby"); init = 1; } Check_SafeStr(host); return open_inet(class, host, serv, INET_SOCKS); } #endif static VALUE tcp_svr_s_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, INET_SERVER); else return open_inet(class, 0, arg1, INET_SERVER); } static VALUE s_accept(class, fd, sockaddr, len) VALUE class; int fd; struct sockaddr *sockaddr; int *len; { int fd2; retry: #ifdef THREAD thread_wait_fd(fd); #endif TRAP_BEG; fd2 = accept(fd, sockaddr, len); TRAP_END; if (fd2 < 0) { switch (errno) { case EINTR: case EWOULDBLOCK: #if EAGAIN != EWOULDBLOCK case EAGAIN: #endif #ifdef THREAD thread_schedule(); #endif goto retry; } rb_sys_fail(0); } return sock_new(class, fd2); } static VALUE tcp_accept(sock) VALUE sock; { OpenFile *fptr; struct sockaddr_in from; int fromlen; GetOpenFile(sock, fptr); fromlen = sizeof(struct sockaddr_in); return s_accept(cTCPsocket, fileno(fptr->f), (struct sockaddr*)&from, &fromlen); } static VALUE tcp_recvfrom(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { return s_recv(sock, argc, argv, RECV_TCP); } #ifdef HAVE_SYS_UN_H static VALUE open_unix(class, path, server) VALUE class; struct RString *path; int server; { struct sockaddr_un sockaddr; int fd, status; VALUE sock; OpenFile *fptr; Check_SafeStr(path); fd = socket(AF_UNIX, SOCK_STREAM, 0); if (fd < 0) rb_sys_fail("socket(2)"); memset(&sockaddr, 0, sizeof(sockaddr)); 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)); } else { status = connect(fd, (struct sockaddr*)&sockaddr, sizeof(sockaddr)); } if (status < 0) { close(fd); rb_sys_fail(sockaddr.sun_path); } if (server) listen(fd, 5); sock = sock_new(class, fd); GetOpenFile(sock, fptr); fptr->path = strdup(path->ptr); return sock; } #endif static void setipaddr(name, addr) char *name; struct sockaddr_in *addr; { int d1, d2, d3, d4; char ch; struct hostent *hp; long x; if (name[0] == 0) { addr->sin_addr.s_addr = INADDR_ANY; } else if (name[0] == '<' && strcmp(name, "") == 0) { addr->sin_addr.s_addr = INADDR_BROADCAST; } else if (sscanf(name, "%d.%d.%d.%d%c", &d1, &d2, &d3, &d4, &ch) == 4 && 0 <= d1 && d1 <= 255 && 0 <= d2 && d2 <= 255 && 0 <= d3 && d3 <= 255 && 0 <= d4 && d4 <= 255) { addr->sin_addr.s_addr = htonl( ((long) d1 << 24) | ((long) d2 << 16) | ((long) d3 << 8) | ((long) d4 << 0)); } else { hp = gethostbyname(name); if (!hp) { #ifdef HAVE_HSTRERROR extern int h_errno; Raise(eSocket, (char *)hstrerror(h_errno)); #else Raise(eSocket, "host not found"); #endif } memcpy((char *) &addr->sin_addr, hp->h_addr, hp->h_length); } } static VALUE mkipaddr(x) unsigned long x; { char buf[16]; x = ntohl(x); sprintf(buf, "%d.%d.%d.%d", (int) (x>>24) & 0xff, (int) (x>>16) & 0xff, (int) (x>> 8) & 0xff, (int) (x>> 0) & 0xff); return str_new2(buf); } static VALUE ipaddr(sockaddr) struct sockaddr_in *sockaddr; { VALUE family, port, addr1, addr2; VALUE ary; struct hostent *hostent; family = str_new2("AF_INET"); hostent = gethostbyaddr((char*)&sockaddr->sin_addr.s_addr, sizeof(sockaddr->sin_addr), AF_INET); addr1 = 0; if (hostent) { addr1 = str_new2(hostent->h_name); } addr2 = mkipaddr(sockaddr->sin_addr.s_addr); if (!addr1) addr1 = addr2; port = INT2FIX(ntohs(sockaddr->sin_port)); ary = ary_new3(4, family, port, addr1, addr2); return ary; } static VALUE ip_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 ipaddr(&addr); } static VALUE ip_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("getpeername(2)"); return ipaddr(&addr); } static VALUE ip_s_getaddress(obj, host) VALUE obj, host; { struct sockaddr_in addr; if (obj_is_kind_of(host, cInteger)) { int i = NUM2INT(host); addr.sin_addr.s_addr = htonl(i); } else { setipaddr(STR2CSTR(host), &addr); } return mkipaddr(addr.sin_addr.s_addr); } static VALUE udp_s_open(class) VALUE class; { return sock_new(class, socket(AF_INET, SOCK_DGRAM, 0)); } static void udp_addrsetup(host, port, addr) VALUE host, port; struct sockaddr_in *addr; { struct hostent *hostent; memset(addr, 0, sizeof(struct sockaddr_in)); addr->sin_family = AF_INET; if (NIL_P(host)) { addr->sin_addr.s_addr = INADDR_ANY; } else if (obj_is_kind_of(host, cInteger)) { int i = NUM2INT(host); addr->sin_addr.s_addr = htonl(i); } else { setipaddr(STR2CSTR(host), addr); } if (FIXNUM_P(port)) { addr->sin_port = htons(FIX2INT(port)); } else { struct servent *servent; servent = getservbyname(STR2CSTR(port), "udp"); if (servent) { addr->sin_port = servent->s_port; } else { char *s = STR2CSTR(port); char *end; int portno; portno = strtoul(s, &end, 0); if (*end != '\0') { Raise(eSocket, "no such servce %s", s); } addr->sin_port = htons(port); } } } static VALUE udp_connect(sock, host, port) VALUE sock, host, port; { struct sockaddr_in addr; OpenFile *fptr; udp_addrsetup(host, port, &addr); GetOpenFile(sock, fptr); retry: if (connect(fileno(fptr->f), (struct sockaddr*)&addr, sizeof(addr))<0) { switch (errno) { case EINTR: case EWOULDBLOCK: #if EAGAIN != EWOULDBLOCK case EAGAIN: #endif #ifdef THREAD thread_schedule(); #endif goto retry; } rb_sys_fail("connect(2)"); } return INT2FIX(0); } static VALUE udp_bind(sock, host, port) VALUE sock, host, port; { struct sockaddr_in addr; OpenFile *fptr; udp_addrsetup(host, port, &addr); GetOpenFile(sock, fptr); if (bind(fileno(fptr->f), (struct sockaddr*)&addr, sizeof(addr))<0) { rb_sys_fail("bind(2)"); } return INT2FIX(0); } static VALUE udp_send(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { VALUE mesg, flags, host, port; struct sockaddr_in addr; OpenFile *fptr; FILE *f; int n; char *m; int mlen; if (argc == 2) { return bsock_send(argc, argv, sock); } rb_scan_args(argc, argv, "4", &mesg, &flags, &host, &port); udp_addrsetup(host, port, &addr); GetOpenFile(sock, fptr); f = fptr->f2?fptr->f2:fptr->f; m = str2cstr(mesg, &mlen); retry: n = sendto(fileno(f), m, mlen, NUM2INT(flags), (struct sockaddr*)&addr, sizeof(addr)); if (n < 0) { switch (errno) { case EINTR: case EWOULDBLOCK: #if EAGAIN != EWOULDBLOCK case EAGAIN: #endif #ifdef THREAD thread_schedule(); #endif goto retry; } rb_sys_fail("sendto(2)"); } return INT2FIX(n); } static VALUE udp_recvfrom(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { return s_recv(sock, argc, argv, RECV_UDP); } #ifdef HAVE_SYS_UN_H static VALUE unix_s_sock_open(sock, path) VALUE sock, path; { return open_unix(sock, path, 0); } static VALUE unix_path(sock) VALUE sock; { OpenFile *fptr; GetOpenFile(sock, fptr); if (fptr->path == 0) { struct sockaddr_un addr; int len = sizeof(addr); if (getsockname(fileno(fptr->f), (struct sockaddr*)&addr, &len) < 0) rb_sys_fail(0); fptr->path = strdup(addr.sun_path); } return str_new2(fptr->path); } static VALUE unix_svr_s_open(sock, path) VALUE sock, path; { return open_unix(sock, path, 1); } static VALUE unix_recvfrom(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { return s_recv(sock, argc, argv, RECV_UNIX); } static VALUE unix_accept(sock) VALUE sock; { OpenFile *fptr; struct sockaddr_un from; int fromlen; GetOpenFile(sock, fptr); fromlen = sizeof(struct sockaddr_un); return s_accept(cUNIXsocket, fileno(fptr->f), (struct sockaddr*)&from, &fromlen); } static VALUE unixaddr(sockaddr) struct sockaddr_un *sockaddr; { return assoc_new(str_new2("AF_UNIX"),str_new2(sockaddr->sun_path)); } static VALUE unix_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 unixaddr(&addr); } static VALUE unix_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 unixaddr(&addr); } #endif 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, "AF_INET") == 0) *dv = AF_INET; #ifdef AF_UNIX else if (strcmp(ptr, "AF_UNIX") == 0) *dv = AF_UNIX; #endif #ifdef AF_ISO else if (strcmp(ptr, "AF_ISO") == 0) *dv = AF_ISO; #endif #ifdef AF_NS else if (strcmp(ptr, "AF_NS") == 0) *dv = AF_NS; #endif #ifdef AF_IMPLINK else if (strcmp(ptr, "AF_IMPLINK") == 0) *dv = AF_IMPLINK; #endif #ifdef PF_INET else if (strcmp(ptr, "PF_INET") == 0) *dv = PF_INET; #endif #ifdef PF_UNIX else if (strcmp(ptr, "PF_UNIX") == 0) *dv = PF_UNIX; #endif #ifdef PF_IMPLINK else if (strcmp(ptr, "PF_IMPLINK") == 0) *dv = PF_IMPLINK; else if (strcmp(ptr, "AF_IMPLINK") == 0) *dv = AF_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 Raise(eSocket, "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 Raise(eSocket, "Unknown socket type %s", ptr); } else { *tv = NUM2INT(type); } } static VALUE sock_s_open(class, domain, type, protocol) VALUE class, domain, type, protocol; { int fd; int d, t; VALUE s; setup_domain_and_type(domain, &d, type, &t); fd = socket(d, t, NUM2INT(protocol)); if (fd < 0) rb_sys_fail("socket(2)"); return sock_new(class, fd); } static VALUE sock_s_for_fd(class, fd) VALUE class, fd; { return sock_new(class, NUM2INT(fd)); } static VALUE sock_s_socketpair(class, domain, type, protocol) VALUE class, domain, type, protocol; { #if !defined(NT) && !defined(__BEOS__) 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])); #else rb_notimplement(); #endif } static VALUE sock_connect(sock, addr) VALUE sock, addr; { OpenFile *fptr; Check_Type(addr, T_STRING); str_modify(addr); GetOpenFile(sock, fptr); retry: if (connect(fileno(fptr->f), (struct sockaddr*)RSTRING(addr)->ptr, RSTRING(addr)->len) < 0) { switch (errno) { case EINTR: case EWOULDBLOCK: #if EAGAIN != EWOULDBLOCK case EAGAIN: #endif #ifdef THREAD thread_schedule(); #endif goto retry; } rb_sys_fail("connect(2)"); } return INT2FIX(0); } static VALUE sock_bind(sock, addr) VALUE sock, addr; { OpenFile *fptr; Check_Type(addr, T_STRING); str_modify(addr); GetOpenFile(sock, fptr); if (bind(fileno(fptr->f), (struct sockaddr*)RSTRING(addr)->ptr, RSTRING(addr)->len) < 0) rb_sys_fail("bind(2)"); return INT2FIX(0); } static VALUE sock_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 sock_recvfrom(argc, argv, sock) int argc; VALUE *argv; VALUE sock; { return s_recv(sock, argc, argv, RECV_SOCKET); } static VALUE sock_accept(sock) VALUE sock; { OpenFile *fptr; VALUE addr, sock2; char buf[1024]; int len = sizeof buf; GetOpenFile(sock, fptr); sock2 = s_accept(cSocket,fileno(fptr->f),(struct sockaddr*)buf,&len); return assoc_new(sock2, str_new(buf, len)); } #ifdef HAVE_GETHOSTNAME static VALUE sock_gethostname(obj) VALUE obj; { char buf[1024]; if (gethostname(buf, (int)sizeof buf - 1) < 0) rb_sys_fail("gethostname"); buf[sizeof buf - 1] = '\0'; return str_new2(buf); } #else #ifdef HAVE_UNAME #include static VALUE sock_gethostname(obj) VALUE obj; { struct utsname un; uname(&un); return str_new2(un.nodename); } #else static VALUE sock_gethostname(obj) VALUE obj; { rb_notimplement(); } #endif #endif static VALUE mkhostent(h) struct hostent *h; { struct sockaddr_in addr; char **pch; VALUE ary, names; if (h == NULL) { #ifdef HAVE_HSTRERROR extern int h_errno; Raise(eSocket, (char *)hstrerror(h_errno)); #else Raise(eSocket, "host not found"); #endif } ary = ary_new(); ary_push(ary, str_new2(h->h_name)); names = ary_new(); ary_push(ary, names); for (pch = h->h_aliases; *pch; pch++) { ary_push(names, str_new2(*pch)); } ary_push(ary, INT2FIX(h->h_length)); #ifdef h_addr for (pch = h->h_addr_list; *pch; pch++) { ary_push(ary, str_new(*pch, h->h_length)); } #else ary_push(ary, str_new(h->h_addr, h->h_length)); #endif return ary; } static VALUE sock_s_gethostbyname(obj, host) VALUE obj, host; { struct sockaddr_in addr; struct hostent *h; if (obj_is_kind_of(host, cInteger)) { int i = NUM2INT(host); addr.sin_addr.s_addr = htonl(i); } else { setipaddr(STR2CSTR(host), &addr); } h = gethostbyaddr((char *)&addr.sin_addr, sizeof(addr.sin_addr), AF_INET); return mkhostent(h); } static VALUE sock_s_gethostbyaddr(argc, argv) int argc; VALUE *argv; { VALUE vaddr, vtype; int type; char *addr; int alen; struct hostent *h; rb_scan_args(argc, argv, "11", &vaddr, &vtype); addr = str2cstr(vaddr, &alen); if (!NIL_P(vtype)) { type = NUM2INT(vtype); } else { type = AF_INET; } h = gethostbyaddr(addr, alen, type); return mkhostent(h); } static VALUE sock_s_getservbyaname(argc, argv) int argc; VALUE *argv; { VALUE service, protocol; char *proto; struct servent *sp; int port; rb_scan_args(argc, argv, "11", &service, &protocol); if (NIL_P(protocol)) proto = "tcp"; else proto = STR2CSTR(protocol); sp = getservbyname(STR2CSTR(service), proto); if (sp) { port = ntohs(sp->s_port); } else { char *s = STR2CSTR(service); char *end; port = strtoul(s, &end, 0); if (*end != '\0') { Raise(eSocket, "no such servce %s/%s", s, proto); } } return INT2FIX(port); } static VALUE mConst; static void sock_define_const(name, value) char *name; int value; { rb_define_const(cSocket, name, INT2FIX(value)); rb_define_const(mConst, name, INT2FIX(value)); } Init_socket() { eSocket = rb_define_class("SocketError", eStandardError); cBasicSocket = rb_define_class("BasicSocket", cIO); rb_undef_method(CLASS_OF(cBasicSocket), "new"); rb_undef_method(CLASS_OF(cBasicSocket), "open"); rb_define_method(cBasicSocket, "shutdown", bsock_shutdown, -1); rb_define_method(cBasicSocket, "setsockopt", bsock_setsockopt, 3); rb_define_method(cBasicSocket, "getsockopt", bsock_getsockopt, 2); rb_define_method(cBasicSocket, "getsockname", bsock_getsockname, 0); rb_define_method(cBasicSocket, "getpeername", bsock_getpeername, 0); rb_define_method(cBasicSocket, "send", bsock_send, -1); rb_define_method(cBasicSocket, "recv", bsock_recv, -1); cIPsocket = rb_define_class("IPsocket", cBasicSocket); rb_define_method(cIPsocket, "addr", ip_addr, 0); rb_define_method(cIPsocket, "peeraddr", ip_peeraddr, 0); rb_define_singleton_method(cIPsocket, "getaddress", ip_s_getaddress, 1); cTCPsocket = rb_define_class("TCPsocket", cIPsocket); rb_define_singleton_method(cTCPsocket, "open", tcp_s_open, 2); rb_define_singleton_method(cTCPsocket, "new", tcp_s_open, 2); rb_define_method(cTCPsocket, "recvfrom", tcp_recvfrom, -1); #ifdef SOCKS cSOCKSsocket = rb_define_class("SOCKSsocket", cTCPsocket); rb_define_singleton_method(cSOCKSsocket, "open", socks_s_open, 2); rb_define_singleton_method(cSOCKSsocket, "new", socks_s_open, 2); #endif cTCPserver = rb_define_class("TCPserver", cTCPsocket); rb_define_singleton_method(cTCPserver, "open", tcp_svr_s_open, -1); rb_define_singleton_method(cTCPserver, "new", tcp_svr_s_open, -1); rb_define_method(cTCPserver, "accept", tcp_accept, 0); cUDPsocket = rb_define_class("UDPsocket", cIPsocket); rb_define_singleton_method(cUDPsocket, "open", udp_s_open, 0); rb_define_singleton_method(cUDPsocket, "new", udp_s_open, 0); rb_define_method(cUDPsocket, "connect", udp_connect, 2); rb_define_method(cUDPsocket, "bind", udp_bind, 2); rb_define_method(cUDPsocket, "send", udp_send, -1); rb_define_method(cUDPsocket, "recvfrom", udp_recvfrom, -1); #ifdef HAVE_SYS_UN_H cUNIXsocket = rb_define_class("UNIXsocket", cBasicSocket); rb_define_singleton_method(cUNIXsocket, "open", unix_s_sock_open, 1); rb_define_singleton_method(cUNIXsocket, "new", unix_s_sock_open, 1); rb_define_method(cUNIXsocket, "path", unix_path, 0); rb_define_method(cUNIXsocket, "addr", unix_addr, 0); rb_define_method(cUNIXsocket, "peeraddr", unix_peeraddr, 0); rb_define_method(cUNIXsocket, "recvfrom", unix_recvfrom, -1); cUNIXserver = rb_define_class("UNIXserver", cUNIXsocket); rb_define_singleton_method(cUNIXserver, "open", unix_svr_s_open, 1); rb_define_singleton_method(cUNIXserver, "new", unix_svr_s_open, 1); rb_define_method(cUNIXserver, "accept", unix_accept, 0); #endif cSocket = rb_define_class("Socket", cBasicSocket); rb_define_singleton_method(cSocket, "open", sock_s_open, 3); rb_define_singleton_method(cSocket, "new", sock_s_open, 3); rb_define_singleton_method(cSocket, "for_fd", sock_s_for_fd, 1); rb_define_method(cSocket, "connect", sock_connect, 1); rb_define_method(cSocket, "bind", sock_bind, 1); rb_define_method(cSocket, "listen", sock_listen, 1); rb_define_method(cSocket, "accept", sock_accept, 0); rb_define_method(cSocket, "recvfrom", sock_recvfrom, -1); rb_define_singleton_method(cSocket, "socketpair", sock_s_socketpair, 3); rb_define_singleton_method(cSocket, "pair", sock_s_socketpair, 3); rb_define_singleton_method(cSocket, "gethostname", sock_gethostname, 0); rb_define_singleton_method(cSocket, "gethostbyname", sock_s_gethostbyname, 1); rb_define_singleton_method(cSocket, "gethostbyaddr", sock_s_gethostbyaddr, -1); rb_define_singleton_method(cSocket, "getservbyname", sock_s_getservbyaname, -1); /* constants */ mConst = rb_define_module_under(cSocket, "Constants"); sock_define_const("SOCK_STREAM", SOCK_STREAM); sock_define_const("SOCK_DGRAM", SOCK_DGRAM); #ifdef SOCK_RAW sock_define_const("SOCK_RAW", SOCK_RAW); #endif #ifdef SOCK_RDM sock_define_const("SOCK_RDM", SOCK_RDM); #endif #ifdef SOCK_SEQPACKET sock_define_const("SOCK_SEQPACKET", SOCK_SEQPACKET); #endif #ifdef SOCK_PACKET sock_define_const("SOCK_PACKET", SOCK_PACKET); #endif sock_define_const("AF_INET", AF_INET); #ifdef PF_INET sock_define_const("PF_INET", PF_INET); #endif #ifdef AF_UNIX sock_define_const("AF_UNIX", AF_UNIX); sock_define_const("PF_UNIX", PF_UNIX); #endif #ifdef AF_AX25 sock_define_const("AF_AX25", AF_AX25); sock_define_const("PF_AX25", PF_AX25); #endif #ifdef AF_IPX sock_define_const("AF_IPX", AF_IPX); sock_define_const("PF_IPX", PF_IPX); #endif #ifdef AF_APPLETALK sock_define_const("AF_APPLETALK", AF_APPLETALK); sock_define_const("PF_APPLETALK", PF_APPLETALK); #endif sock_define_const("MSG_OOB", MSG_OOB); #ifdef MSG_PEEK sock_define_const("MSG_PEEK", MSG_PEEK); #endif #ifdef MSG_DONTROUTE sock_define_const("MSG_DONTROUTE", MSG_DONTROUTE); #endif sock_define_const("SOL_SOCKET", SOL_SOCKET); #ifdef SOL_IP sock_define_const("SOL_IP", SOL_IP); #endif #ifdef SOL_IPX sock_define_const("SOL_IPX", SOL_IPX); #endif #ifdef SOL_AX25 sock_define_const("SOL_AX25", SOL_AX25); #endif #ifdef SOL_ATALK sock_define_const("SOL_ATALK", SOL_ATALK); #endif #ifdef SOL_TCP sock_define_const("SOL_TCP", SOL_TCP); #endif #ifdef SOL_UDP sock_define_const("SOL_UDP", SOL_UDP); #endif #ifdef SO_DEBUG sock_define_const("SO_DEBUG", SO_DEBUG); #endif sock_define_const("SO_REUSEADDR", SO_REUSEADDR); #ifdef SO_TYPE sock_define_const("SO_TYPE", SO_TYPE); #endif #ifdef SO_ERROR sock_define_const("SO_ERROR", SO_ERROR); #endif #ifdef SO_DONTROUTE sock_define_const("SO_DONTROUTE", SO_DONTROUTE); #endif #ifdef SO_BROADCAST sock_define_const("SO_BROADCAST", SO_BROADCAST); #endif #ifdef SO_SNDBUF sock_define_const("SO_SNDBUF", SO_SNDBUF); #endif #ifdef SO_RCVBUF sock_define_const("SO_RCVBUF", SO_RCVBUF); #endif #ifdef SO_KEEPALIVE sock_define_const("SO_KEEPALIVE", SO_KEEPALIVE); #endif #ifdef SO_OOBINLINE sock_define_const("SO_OOBINLINE", SO_OOBINLINE); #endif #ifdef SO_NO_CHECK sock_define_const("SO_NO_CHECK", SO_NO_CHECK); #endif #ifdef SO_PRIORITY sock_define_const("SO_PRIORITY", SO_PRIORITY); #endif #ifdef SO_LINGER sock_define_const("SO_LINGER", SO_LINGER); #endif #ifdef SOPRI_INTERACTIVE sock_define_const("SOPRI_INTERACTIVE", SOPRI_INTERACTIVE); #endif #ifdef SOPRI_NORMAL sock_define_const("SOPRI_NORMAL", SOPRI_NORMAL); #endif #ifdef SOPRI_BACKGROUND sock_define_const("SOPRI_BACKGROUND", SOPRI_BACKGROUND); #endif #ifdef IP_MULTICAST_IF sock_define_const("IP_MULTICAST_IF", IP_MULTICAST_IF); #endif #ifdef IP_MULTICAST_TTL sock_define_const("IP_MULTICAST_TTL", IP_MULTICAST_TTL); #endif #ifdef IP_MULTICAST_LOOP sock_define_const("IP_MULTICAST_LOOP", IP_MULTICAST_LOOP); #endif #ifdef IP_ADD_MEMBERSHIP sock_define_const("IP_ADD_MEMBERSHIP", IP_ADD_MEMBERSHIP); #endif #ifdef IP_DEFAULT_MULTICAST_TTL sock_define_const("IP_DEFAULT_MULTICAST_TTL", IP_DEFAULT_MULTICAST_TTL); #endif #ifdef IP_DEFAULT_MULTICAST_LOOP sock_define_const("IP_DEFAULT_MULTICAST_LOOP", IP_DEFAULT_MULTICAST_LOOP); #endif #ifdef IP_MAX_MEMBERSHIPS sock_define_const("IP_MAX_MEMBERSHIPS", IP_MAX_MEMBERSHIPS); #endif #ifdef IPX_TYPE sock_define_const("IPX_TYPE", IPX_TYPE); #endif #ifdef TCP_NODELAY sock_define_const("TCP_NODELAY", TCP_NODELAY); #endif #ifdef TCP_MAXSEG sock_define_const("TCP_MAXSEG", TCP_MAXSEG); #endif } ruby-1.2.3/ext/tcltklib/ 40755 774 145 0 6662164575 13067 5ustar matzNaClruby-1.2.3/ext/tcltklib/MANIFEST100644 774 145 316 6457557272 14277 0ustar matzNaClMANIFEST README.euc MANUAL.euc tcltklib.c depend extconf.rb lib/tcltk.rb demo/lines1.rb demo/lines0.tcl demo/lines2.rb sample/sample1.rb sample/sample2.rb sample/maru.gif sample/batsu.gif sample/sample0.rb ruby-1.2.3/ext/tcltklib/README.euc100644 774 145 10461 6457557272 14643 0ustar matzNaCl(tof) tcltk ライブラリ tcltklib ライブラリ Sep. 19, 1997 Y. Shigehiro 以下, 「tcl/tk」という表記は, tclsh や wish を実現している, 一般でいう ところの tcl/tk を指します. 「tcltk ライブラリ」, 「tcltklib ライブラ リ」という表記は, 本パッケージに含まれる ruby 用のライブラリを指します. [ファイルについて] README.euc : このファイル(注意, 特徴, インストールの方法). MANUAL.euc : マニュアル. lib/, ext/ : ライブラリの実体. sample/ : マニュアル代わりのサンプルプログラム. sample/sample0.rb : tcltklib ライブラリのテスト. sample/sample1.rb : tcltk ライブラリのテスト. tcl/tk (wish) でできそうなことを一通り書いてみました. sample/sample2.rb : tcltk ライブラリのサンプル. maeda shugo (shugo@po.aianet.ne.jp) 氏による (`rb.tk' で書かれていた) ruby のサンプルプログラム http://www.aianet.or.jp/~shugo/ruby/othello.rb.gz を tcltk ライブラリを使うように, 機械的に変更してみました. demo/ : 100 本の線を 100 回描くデモプログラム. 最初に空ループの時間を測定し, 続いて実際に線を引く時間を測定します. tcl/tk は(再)描画のときに backing store を使わずに律義に 10000 本(?) 線を引くので, (再)描画を始めると, マシンがかなり重くなります. demo/lines0.tcl : wish 用のスクリプト. demo/lines1.rb : `tk.rb' 用のスクリプト. demo/lines2.rb : tcltk ライブラリ用のスクリプト. [注意] コンパイル/実行には, tcl/tk の C ライブラリが必要です. このライブラリは, ruby-1.0-970701, ruby-1.0-970911, ruby-1.0-970919 FreeBSD 2.2.2-RELEASE およびそのパッケージ jp-tcl-7.6.tgz, jp-tk-4.2.tgz で作成/動作確認しました. 他の環境では動作するかどうかわかりません. TclTkLib.mainloop を実行中に Control-C が効かないのは不便なので, ruby のソースを参考に, #include "sig.h" して trap_immediate を操作していま すが, ruby の README.EXT にも書いてないのに, こんなことをして良いのか どうかわかりません. -d オプションでデバッグ情報を表示させるために, ruby のソースを参考に, debug という大域変数を参照していますが, ruby の README.EXT にも書いて ないのに, こんなことをして良いのかどうかわかりません. extconf.rb は書きましたが, (いろいろな意味で)これで良いのか良く分かり ません. [特徴] ruby から tcl/tk ライブラリを利用できます. tcl/tk インタプリタのスクリプトは, 機械的に tcltk ライブラリ用の ruby スクリプトに変換できます. (`tk.rb' との違い) 1. tcl/tk インタプリタのスクリプトが, どのように, tcltk ライブラリ用の ruby スクリプトに変換されるかが理解できれば, マニュアル類が無いに等 しい `tk.rb' とは異なり tcl/tk のマニュアルやオンラインドキュメントを用いて 効率良くプログラミングを行うことができます. 記述方法がわからない, コマンドに与えるパラメータがわからない... - Canvas.new { ... } と, なぜイテレータブロックを書けるの?? - Canvas の bbox は数値のリストを返すのに, xview は文字列を返すの?? と, いちいち, ライブラリのソースを追いかける必要はありません. 2. 個々の機能(オプション)を個別処理によりサポートしており, そのためサ ポートしていない機能は使うことができない(本当は使えないこともないの ですが) `tk.rb' とは異なり, tcl/tk インタプリタで可能なことは ほとんど ruby からも実行できます. 現在, ruby から実行できないことが確認され ているのは, bind コマンドでスクリプトを追加する構文 「bind tag sequence +script」 ^ のみです. - `. configure -width' をしようとして, `Tk.root.height()' と書い たのに, `undefined method `height'' と怒られてしまった. tk.rb を 読んでみて, ガーン. できないのか... ということはありません. 3. wish プロセスを起動しプロセス間通信で wish を利用する `tk.rb' とは 異なり, tcl/tk の C ライブラリをリンクし より高速に (といっても, 思った程は速くないですが) 処理を行います. 4. `tk.rb' ほど, 高水準なインターフェースを備えていないため, tcl/tk イ ンタプリタの生成等 何から何まで自分で記述 しなければなりません(その代わり, tcl/tk ライブラリの仕様通り, tcl/tk インタプリタを複数生成することもできますが). インターフェースは(おそらく) ruby の思想に沿ったものではありません. また, スクリプトの記述は ダサダサ です. スクリプトは, 一見, 読みづらいものとなります. が, 書く人にとっ ては, それほど煩わしいものではないと思います. [インストールの方法] 0. ruby のソースファイル(ruby-1.0-なんたら.tgz)を展開しておきます. 1. ruby-1.0-なんたら/ext に ext/tcltklib をコピーします. cp -r ext/tcltklib ???/ruby-1.0-なんたら/ext/ 2. ruby のインストール法に従い make 等をします. 3. ruby のライブラリ置場に lib/* をコピーします. cp lib/* /usr/local/lib/ruby/ (eof) ruby-1.2.3/ext/tcltklib/MANUAL.euc100644 774 145 10236 6457557272 14663 0ustar matzNaCl(tof) MANUAL.euc Sep. 19, 1997 Y. Shigehiro 以下, 「tcl/tk」という表記は, tclsh や wish を実現している, 一般でいう ところの tcl/tk を指します. 「tcltk ライブラリ」, 「tcltklib ライブラ リ」という表記は, 本パッケージに含まれる ruby 用のライブラリを指します. << tcltk ライブラリ >> tcl/tk の C ライブラリを利用するための高(中?)水準インターフェースを提 供します. このライブラリは ruby から tcl/tk ライブラリを利用するためのもので, 内 部で tcltklib ライブラリを利用しています. [説明] tcl/tk インタプリタでは, ウィジェットに何か指示を送るには, ウィジェッ ト名に続いてパラメータを書きます. したがって, ウィジェットがオブジェク トであり, それに対してメソッドを送っている, とみなすことができます. さ て, tcl/tk インタプリタでは, 組み込みコマンドも, 前述のウィジェットと 同じような書式の命令で実行されます. すなわち, コマンドもオブジェクトで あると考えることができます. このような考えに基づき, tcltk ライブラリでは, tcl/tk のコマンドやウィ ジェットに対応するオブジェクトを生成します. オブジェクトに対するメソッ ド呼び出しは, e() メソッドにより実行されます. 例えば, tcl/tk の info コマンドに対応する ruby のオブジェクトが info という名前であるとすると, tcl/tk の info commands という命令は tcltk ライブラリでは info.e("commands") と記述されます. また, 「.」というウィジェット (wish 実行時に自動的に生 成されるルートウィジェット) に対応する ruby のオブジェクトが root とい う名前であるとすると, . configure -height 300 -width 300 という tcl/tk の命令は root.e("configure -height 300 -width 300") と記述されます. このような記述は, 見ためには美しくありませんが, そして, スクリプトを読む人には見づらいかも知れませんが, 実際にスクリプトを書い てみると予想外に手軽です. [使用法] 1. ライブラリを読み込む. require "tcltk" 2. tcl/tk インタプリタを生成する. ip = TclTkInterpreter.new() 3. tcl/tk のコマンドに対応するオブジェクトを変数に代入しておく. # コマンドに対応するオブジェクトが入った Hash を取り出す. c = ip.commands() # 使いたいコマンドに対応するオブジェクトを個別の変数に代入する. bind, button, info, wm = c.indexes("bind", "button", "info", "wm") 4. 必要な処理を行う. 詳しくは, サンプルを参照のこと. 5. 準備ができたら, イベントループに入る. TclTk.mainloop() (( 以下, モジュール, クラス等の説明を書く予定.)) << tcltklib ライブラリ >> tcl/tk の C ライブラリを利用するための低水準インターフェースを提供しま す. コンパイル/実行には, tcl/tk の C ライブラリが必要です. [説明] このライブラリを用いると, ruby から tcl/tk の C ライブラリを利用できま す. 具体的には, ruby インタプリタから tcl/tk インタプリタを呼び出すこ とができます. さらに, その(ruby インタプリタから呼び出した) tcl/tk イ ンタプリタから, 逆に ruby インタプリタを呼び出すこともできます. [使用法] require "tcltklib" すると, 以下のモジュール, クラスが利用可能です. モジュール TclTkLib tcl/tk ライブラリを呼び出すメソッドを集めたモジュールです. ただし, tcl/tk インタプリタ関係のメソッドはクラス TclTkIp にあります. モジュールメソッド mainloop() Tk_MainLoop を実行します. 全ての tk のウインドウが無くなると終了 します(例えば, tcl/tk で書くところの "destroy ." をした場合等). 引数: 無し 戻り値: nil クラス TclTkIp インスタンスが tcl/tk のインタプリタに対応します. tcl/tk のライブ ラリの仕様通り, インスタンスを複数個生成しても正しく動作します(そ んなことをする必要はあまり無いはずですが). インタプリタは wish の tcl/tk コマンドを実行できます. さらに, 以下のコマンドを実行できま す. コマンド ruby 引数を ruby で実行します(ruby_eval_string を実行します). 引数 は 1 つでなければなりません. 戻り値は ruby の実行結果です. ruby の実行結果は nil か String でなければなりません. クラスメソッド new() TclTkIp クラスのインスタンスを生成します 引数: 無し 戻り値 (TclTkIp): 生成されたインスタンス メソッド _eval(script) インタプリタで script を評価します(Tcl_Eval を実行します). 前述 のように, ruby コマンドにより script 内から ruby スクリプトを実 行できます. 引数: script (String) - インタプリタで評価するスクリプト文字列 戻り値 (String): 評価結果 ((Tcl_Interp *)->result) メソッド _return_value() 直前の Tcl_Eval の戻り値を返します. 0(TCL_OK) で正常終了です. 引数: 無し 戻り値 (Fixnum): 直前の Tcl_Eval() が返した値. (eof) ruby-1.2.3/ext/tcltklib/tcltklib.c100644 774 145 24216 6552322021 15141 0ustar matzNaCl/* * tcltklib.c * Aug. 27, 1997 Y. Shigehiro * Oct. 24, 1997 Y. Matsumoto */ #include "ruby.h" #include "rubysig.h" #include #include #include #include #ifdef __MACOS__ # include # include #endif /* for debug */ #define DUMP1(ARG1) if (debug) { fprintf(stderr, "tcltklib: %s\n", ARG1);} #define DUMP2(ARG1, ARG2) if (debug) { fprintf(stderr, "tcltklib: ");\ fprintf(stderr, ARG1, ARG2); fprintf(stderr, "\n"); } /* #define DUMP1(ARG1) #define DUMP2(ARG1, ARG2) */ /* for callback break & continue */ VALUE eTkCallbackBreak; VALUE eTkCallbackContinue; /* from tkAppInit.c */ /* * The following variable is a special hack that is needed in order for * Sun shared libraries to be used for Tcl. */ extern int matherr(); int *tclDummyMathPtr = (int *) matherr; /*---- module TclTkLib ----*/ /* Tk_ThreadTimer */ typedef struct { Tcl_TimerToken token; int flag; } Tk_TimerData; /* timer callback */ void _timer_for_tcl (ClientData clientData) { Tk_TimerData *timer = (Tk_TimerData*)clientData; timer->flag = 0; CHECK_INTS; #ifdef THREAD if (!thread_critical) thread_schedule(); #endif timer->token = Tk_CreateTimerHandler(200, _timer_for_tcl, (ClientData)timer); timer->flag = 1; } /* execute Tk_MainLoop */ static VALUE lib_mainloop(VALUE self) { Tk_TimerData *timer; timer = (Tk_TimerData *) ckalloc(sizeof(Tk_TimerData)); timer->flag = 0; timer->token = Tk_CreateTimerHandler(200, _timer_for_tcl, (ClientData)timer); timer->flag = 1; DUMP1("start Tk_Mainloop"); while (Tk_GetNumMainWindows() > 0) { Tcl_DoOneEvent(0); } DUMP1("stop Tk_Mainloop"); #ifdef THREAD if (timer->flag) { Tk_DeleteTimerHandler(timer->token); } #endif return Qnil; } /*---- class TclTkIp ----*/ struct tcltkip { Tcl_Interp *ip; /* the interpreter */ int return_value; /* return value */ }; /* Tcl command `ruby' */ static VALUE ip_eval_rescue(VALUE *failed, VALUE einfo) { *failed = einfo; return Qnil; } static int #if TCL_MAJOR_VERSION >= 8 ip_ruby(ClientData clientData, Tcl_Interp *interp, int argc, Tcl_Obj *CONST argv[]) #else ip_ruby(ClientData clientData, Tcl_Interp *interp, int argc, char *argv[]) #endif { VALUE res; int old_trapflg; VALUE failed = 0; char *arg; int dummy; /* ruby command has 1 arg. */ if (argc != 2) { ArgError("wrong # of arguments (%d for 1)", argc); } /* get C string from Tcl object */ #if TCL_MAJOR_VERSION >= 8 arg = Tcl_GetStringFromObj(argv[1], &dummy); #else arg = argv[1]; #endif /* evaluate the argument string by ruby */ DUMP2("rb_eval_string(%s)", arg); old_trapflg = trap_immediate; trap_immediate = 0; res = rb_rescue(rb_eval_string, (VALUE)arg, ip_eval_rescue, (VALUE)&failed); trap_immediate = old_trapflg; Tcl_ResetResult(interp); if (failed) { VALUE eclass = CLASS_OF(failed); Tcl_AppendResult(interp, STR2CSTR(failed), (char*)NULL); if (eclass == eTkCallbackBreak) { return TCL_BREAK; } else if (eclass == eTkCallbackContinue) { return TCL_CONTINUE; } else { return TCL_ERROR; } } /* result must be string or nil */ if (NIL_P(res)) { DUMP1("(rb_eval_string result) nil"); return TCL_OK; } /* copy result to the tcl interpreter */ DUMP2("(rb_eval_string result) %s", STR2CSTR(res)); DUMP1("Tcl_AppendResult"); Tcl_AppendResult(interp, STR2CSTR(res), (char *)NULL); return TCL_OK; } /* destroy interpreter */ static void ip_free(struct tcltkip *ptr) { DUMP1("Tcl_DeleteInterp"); Tcl_DeleteInterp(ptr->ip); free(ptr); } /* create and initialize interpreter */ static VALUE ip_new(VALUE self) { struct tcltkip *ptr; /* tcltkip data struct */ VALUE obj; /* newly created object */ /* create object */ obj = Data_Make_Struct(self, struct tcltkip, 0, ip_free, ptr); ptr->return_value = 0; /* from Tk_Main() */ DUMP1("Tcl_CreateInterp"); ptr->ip = Tcl_CreateInterp(); /* from Tcl_AppInit() */ DUMP1("Tcl_Init"); if (Tcl_Init(ptr->ip) == TCL_ERROR) { Fail("Tcl_Init"); } DUMP1("Tk_Init"); if (Tk_Init(ptr->ip) == TCL_ERROR) { Fail("Tk_Init"); } DUMP1("Tcl_StaticPackage(\"Tk\")"); Tcl_StaticPackage(ptr->ip, "Tk", Tk_Init, (Tcl_PackageInitProc *) NULL); /* add ruby command to the interpreter */ #if TCL_MAJOR_VERSION >= 8 DUMP1("Tcl_CreateObjCommand(\"ruby\")"); Tcl_CreateObjCommand(ptr->ip, "ruby", ip_ruby, (ClientData *)NULL, (Tcl_CmdDeleteProc *)NULL); #else DUMP1("Tcl_CreateCommand(\"ruby\")"); Tcl_CreateCommand(ptr->ip, "ruby", ip_ruby, (ClientData *)NULL, (Tcl_CmdDeleteProc *)NULL); #endif return obj; } /* eval string in tcl by Tcl_Eval() */ static VALUE ip_eval(VALUE self, VALUE str) { char *s; char *buf; /* Tcl_Eval requires re-writable string region */ struct tcltkip *ptr; /* tcltkip data struct */ /* get the data struct */ Data_Get_Struct(self, struct tcltkip, ptr); /* call Tcl_Eval() */ s = STR2CSTR(str); buf = ALLOCA_N(char, strlen(s)+1); strcpy(buf, s); DUMP2("Tcl_Eval(%s)", buf); ptr->return_value = Tcl_Eval(ptr->ip, buf); if (ptr->return_value == TCL_ERROR) { Fail(ptr->ip->result); } DUMP2("(TCL_Eval result) %d", ptr->return_value); /* pass back the result (as string) */ return(str_new2(ptr->ip->result)); } static VALUE ip_toUTF8(VALUE self, VALUE str, VALUE encodename) { #ifndef TCL_UTF_MAX return str; #else Tcl_Interp *interp; Tcl_Encoding encoding; Tcl_DString dstr; struct tcltkip *ptr; char *buff1,*buff2; Data_Get_Struct(self,struct tcltkip, ptr); interp = ptr->ip; encoding = Tcl_GetEncoding(interp,STR2CSTR(encodename)); buff1 = ALLOCA_N(char,strlen(STR2CSTR(str))+1); strcpy(buff1,STR2CSTR(str)); Tcl_DStringInit(&dstr); Tcl_DStringFree(&dstr); Tcl_ExternalToUtfDString(encoding,buff1,strlen(buff1),&dstr); buff2 = ALLOCA_N(char,Tcl_DStringLength(&dstr)+1); strcpy(buff2,Tcl_DStringValue(&dstr)); Tcl_FreeEncoding(encoding); Tcl_DStringFree(&dstr); return str_new2(buff2); #endif } static VALUE ip_fromUTF8(VALUE self, VALUE str, VALUE encodename) { #ifndef TCL_UTF_MAX return str; #else Tcl_Interp *interp; Tcl_Encoding encoding; Tcl_DString dstr; struct tcltkip *ptr; char *buff1,*buff2; Data_Get_Struct(self,struct tcltkip, ptr); interp = ptr->ip; encoding = Tcl_GetEncoding(interp,STR2CSTR(encodename)); buff1 = ALLOCA_N(char,strlen(STR2CSTR(str))+1); strcpy(buff1,STR2CSTR(str)); Tcl_DStringInit(&dstr); Tcl_DStringFree(&dstr); Tcl_UtfToExternalDString(encoding,buff1,strlen(buff1),&dstr); buff2 = ALLOCA_N(char,Tcl_DStringLength(&dstr)+1); strcpy(buff2,Tcl_DStringValue(&dstr)); Tcl_FreeEncoding(encoding); Tcl_DStringFree(&dstr); return str_new2(buff2); #endif } static VALUE ip_invoke(int argc, VALUE *argv, VALUE obj) { struct tcltkip *ptr; /* tcltkip data struct */ int i; int object = 0; Tcl_CmdInfo info; char *cmd; char **av = (char **)NULL; #if TCL_MAJOR_VERSION >= 8 Tcl_Obj **ov = (Tcl_Obj **)NULL; Tcl_Obj *resultPtr; #endif /* get the data struct */ Data_Get_Struct(obj, struct tcltkip, ptr); /* get the command name string */ cmd = STR2CSTR(argv[0]); /* map from the command name to a C procedure */ if (!Tcl_GetCommandInfo(ptr->ip, cmd, &info)) { NameError("invalid command name `%s'", cmd); } #if TCL_MAJOR_VERSION >= 8 object = info.isNativeObjectProc; #endif /* memory allocation for arguments of this command */ if (object) { #if TCL_MAJOR_VERSION >= 8 /* object interface */ ov = (Tcl_Obj **)ALLOCA_N(Tcl_Obj *, argc+1); for (i = 0; i < argc; ++i) { char *s = STR2CSTR(argv[i]); ov[i] = Tcl_NewStringObj(s, strlen(s)); } ov[argc] = (Tcl_Obj *)NULL; #endif } else { /* string interface */ av = (char **)ALLOCA_N(char *, argc+1); for (i = 0; i < argc; ++i) { char *s = STR2CSTR(argv[i]); av[i] = ALLOCA_N(char, strlen(s)+1); strcpy(av[i], s); } av[argc] = (char *)NULL; } Tcl_ResetResult(ptr->ip); /* Invoke the C procedure */ if (object) { #if TCL_MAJOR_VERSION >= 8 int dummy; ptr->return_value = (*info.objProc)(info.objClientData, ptr->ip, argc, ov); /* get the string value from the result object */ resultPtr = Tcl_GetObjResult(ptr->ip); Tcl_SetResult(ptr->ip, Tcl_GetStringFromObj(resultPtr, &dummy), TCL_VOLATILE); #endif } else { ptr->return_value = (*info.proc)(info.clientData, ptr->ip, argc, av); } if (ptr->return_value == TCL_ERROR) { Fail(ptr->ip->result); } /* pass back the result (as string) */ return(str_new2(ptr->ip->result)); } /* get return code from Tcl_Eval() */ static VALUE ip_retval(VALUE self) { struct tcltkip *ptr; /* tcltkip data struct */ /* get the data strcut */ Data_Get_Struct(self, struct tcltkip, ptr); return (INT2FIX(ptr->return_value)); } #ifdef __MACOS__ static void _macinit() { tcl_macQdPtr = &qd; /* setup QuickDraw globals */ Tcl_MacSetEventProc(TkMacConvertEvent); /* setup event handler */ } #endif /*---- initialization ----*/ void Init_tcltklib() { extern VALUE rb_argv0; /* the argv[0] */ VALUE lib = rb_define_module("TclTkLib"); VALUE ip = rb_define_class("TclTkIp", cObject); eTkCallbackBreak = rb_define_class("TkCallbackBreak", eStandardError); eTkCallbackContinue = rb_define_class("TkCallbackContinue",eStandardError); rb_define_module_function(lib, "mainloop", lib_mainloop, 0); rb_define_singleton_method(ip, "new", ip_new, 0); rb_define_method(ip, "_eval", ip_eval, 1); rb_define_method(ip, "_toUTF8",ip_toUTF8,2); rb_define_method(ip, "_fromUTF8",ip_fromUTF8,2); rb_define_method(ip, "_invoke", ip_invoke, -1); rb_define_method(ip, "_return_value", ip_retval, 0); rb_define_method(ip, "mainloop", lib_mainloop, 0); #ifdef __MACOS__ _macinit(); #endif /*---- initialize tcl/tk libraries ----*/ /* from Tk_Main() */ DUMP1("Tcl_FindExecutable"); Tcl_FindExecutable(RSTRING(rb_argv0)->ptr); } /* eof */ ruby-1.2.3/ext/tcltklib/depend100644 774 145 117 6457557272 14327 0ustar matzNaCltcltklib.o: tcltklib.c $(hdrdir)/ruby.h $(hdrdir)/config.h $(hdrdir)/defines.h ruby-1.2.3/ext/tcltklib/extconf.rb100644 774 145 3774 6645034104 15153 0ustar matzNaCl# extconf.rb for tcltklib require 'mkmf' have_library("nsl", "t_open") have_library("socket", "socket") have_library("dl", "dlopen") have_library("m", "log") $includes = [] def search_header(include, *path) pwd = Dir.getwd begin for i in path.sort!.reverse! dir = Dir[i] for path in dir.sort!.reverse! next unless File.directory? path Dir.chdir path files = Dir[include] if files.size > 0 unless $includes.include? path $includes << path end return end end end ensure Dir.chdir pwd end end search_header("tcl.h", "/usr/include/tcl{,8*,7*}", "/usr/include", "/usr/local/include/tcl{,8*,7*}", "/usr/local/include") search_header("tk.h", "/usr/include/tk{,8*,4*}", "/usr/include", "/usr/local/include/tk{,8*,4*}", "/usr/local/include") search_header("X11/Xlib.h", "/usr/include/X11*", "/usr/include", "/usr/openwin/include", "/usr/X11*/include") $CFLAGS = $includes.collect{|path| "-I" + path}.join(" ") $libraries = [] def search_lib(file, func, *path) for i in path.reverse! dir = Dir[i] for path in dir.sort!.reverse! $LDFLAGS = $libraries.collect{|p| "-L" + p}.join(" ") + " -L" + path files = Dir[path+"/"+file] if files.size > 0 for lib in files.sort!.reverse! lib = File::basename(lib) lib.sub!(/^lib/, '') lib.sub!(/\.(a|so)$/, '') if have_library(lib, func) unless $libraries.include? path $libraries << path end return TRUE end end end end end return FALSE; end if have_header("tcl.h") && have_header("tk.h") && search_lib("libX11.{a,so}", "XOpenDisplay", "/usr/lib", "/usr/openwin/lib", "/usr/X11*/lib") && search_lib("libtcl{,8*,7*}.{a,so}", "Tcl_FindExecutable", "/usr/lib", "/usr/local/lib") && search_lib("libtk{,8*,4*}.{a,so}", "Tk_Init", "/usr/lib", "/usr/local/lib") $LDFLAGS = $libraries.collect{|path| "-L" + path}.join(" ") create_makefile("tcltklib") end ruby-1.2.3/ext/tcltklib/lib/ 40755 774 145 0 6662164575 13635 5ustar matzNaClruby-1.2.3/ext/tcltklib/lib/tcltk.rb100644 774 145 23631 6645033350 15410 0ustar matzNaCl# tof #### tcltk library, more direct manipulation of tcl/tk #### Sep. 5, 1997 Y. Shigehiro require "tcltklib" ################ # module TclTk: collection of tcl/tk utilities (supplies namespace.) module TclTk # initialize Hash to hold unique symbols and such @namecnt = {} # initialize Hash to hold callbacks @callback = {} end # TclTk.mainloop(): call TclTkLib.mainloop() def TclTk.mainloop() print("mainloop: start\n") if $DEBUG TclTkLib.mainloop() print("mainloop: end\n") if $DEBUG end # TclTk.deletecallbackkey(ca): remove callback from TclTk module # this does not remove callbacks from tcl/tk interpreter # without calling this method, TclTkInterpreter will not be GCed # ca: callback(TclTkCallback) def TclTk.deletecallbackkey(ca) print("deletecallbackkey: ", ca.to_s(), "\n") if $DEBUG @callback.delete(ca.to_s) end # TclTk.dcb(ca, wid, W): call TclTk.deletecallbackkey() for each callbacks # in an array. # this is for callback for top-level # ca: array of callbacks(TclTkCallback) # wid: top-level widget(TclTkWidget) # w: information about window given by %W(String) def TclTk.dcb(ca, wid, w) if wid.to_s() == w ca.each{|i| TclTk.deletecallbackkey(i) } end end # TclTk._addcallback(ca): register callback # ca: callback(TclTkCallback) def TclTk._addcallback(ca) print("_addcallback: ", ca.to_s(), "\n") if $DEBUG @callback[ca.to_s()] = ca end # TclTk._callcallback(key, arg): invoke registered callback # key: key to select callback (to_s value of the TclTkCallback) # arg: parameter from tcl/tk interpreter def TclTk._callcallback(key, arg) print("_callcallback: ", @callback[key].inspect, "\n") if $DEBUG @callback[key]._call(arg) # throw out callback value # should return String to satisfy rb_eval_string() return "" end # TclTk._newname(prefix): generate unique name(String) # prefix: prefix of the unique name def TclTk._newname(prefix) # generated name counter is stored in @namecnt if !@namecnt.key?(prefix) # first appearing prefix, initialize @namecnt[prefix] = 1 else # already appeared prefix, generate next name @namecnt[prefix] += 1 end return "#{prefix}#{@namecnt[prefix]}" end ################ # class TclTkInterpreter: tcl/tk interpreter class TclTkInterpreter # initialize(): def initialize() # generate interpreter object @ip = TclTkIp.new() # add ruby_fmt command to tcl interpreter # ruby_fmt command format arguments by `format' and call `ruby' command # (notice ruby command receives only one argument) if $DEBUG @ip._eval("proc ruby_fmt {fmt args} { puts \"ruby_fmt: $fmt $args\" ; ruby [format $fmt $args] }") else @ip._eval("proc ruby_fmt {fmt args} { ruby [format $fmt $args] }") end # @ip._get_eval_string(*args): generate string to evaluate in tcl interpreter # *args: script which is going to be evaluated under tcl/tk def @ip._get_eval_string(*args) argstr = "" args.each{|arg| argstr += " " if argstr != "" # call to_eval if it is defined if (arg.respond_to?(:to_eval)) argstr += arg.to_eval() else # call to_s unless defined argstr += arg.to_s() end } return argstr end # @ip._eval_args(*args): evaluate string under tcl/tk interpreter # returns result string. # *args: script which is going to be evaluated under tcl/tk def @ip._eval_args(*args) # calculate the string to eval in the interpreter argstr = _get_eval_string(*args) # evaluate under the interpreter print("_eval: \"", argstr, "\"") if $DEBUG res = _eval(argstr) if $DEBUG print(" -> \"", res, "\"\n") elsif _return_value() != 0 print(res, "\n") end fail(%Q/can't eval "#{argstr}"/) if _return_value() != 0 #' return res end # generate tcl/tk command object and register in the hash @commands = {} # for all commands registered in tcl/tk interpreter: @ip._eval("info command").split(/ /).each{|comname| if comname =~ /^[.]/ # if command is a widget (path), generate TclTkWidget, # and register it in the hash @commands[comname] = TclTkWidget.new(@ip, comname) else # otherwise, generate TclTkCommand @commands[comname] = TclTkCommand.new(@ip, comname) end } end # commands(): returns hash of the tcl/tk commands def commands() return @commands end # rootwidget(): returns root widget(TclTkWidget) def rootwidget() return @commands["."] end # _tcltkip(): returns @ip(TclTkIp) def _tcltkip() return @ip end # method_missing(id, *args): execute undefined method as tcl/tk command # id: method symbol # *args: method arguments def method_missing(id, *args) # if command named by id registered, then execute it if @commands.key?(id.id2name) return @commands[id.id2name].e(*args) else # otherwise, exception super end end end # class TclTkObject: base class of the tcl/tk objects class TclTkObject # initialize(ip, exp): # ip: interpreter(TclTkIp) # exp: tcl/tk representation def initialize(ip, exp) fail("type is not TclTkIp") if !ip.kind_of?(TclTkIp) @ip = ip @exp = exp end # to_s(): returns tcl/tk representation def to_s() return @exp end end # class TclTkCommand: tcl/tk commands # you should not call TclTkCommand.new() # commands are created by TclTkInterpreter:initialize() class TclTkCommand < TclTkObject # e(*args): execute command. returns String (e is for exec or eval) # *args: command arguments def e(*args) return @ip._eval_args(to_s(), *args) end end # class TclTkLibCommand: tcl/tk commands in the library class TclTkLibCommand < TclTkCommand # initialize(ip, name): # ip: interpreter(TclTkInterpreter) # name: command name (String) def initialize(ip, name) super(ip._tcltkip, name) end end # class TclTkVariable: tcl/tk variable class TclTkVariable < TclTkObject # initialize(interp, dat): # interp: interpreter(TclTkInterpreter) # dat: the value to set(String) # if nil, not initialize variable def initialize(interp, dat) # auto-generate tcl/tk representation (variable name) exp = TclTk._newname("v_") # initialize TclTkObject super(interp._tcltkip(), exp) # safe this for `set' command @set = interp.commands()["set"] # set value set(dat) if dat end # although you can set/refer variable by using set in tcl/tk, # we provide the method for accessing variables # set(data): set tcl/tk variable using `set' # data: new value def set(data) @set.e(to_s(), data.to_s()) end # get(): read tcl/tk variable(String) using `set' def get() return @set.e(to_s()) end end # class TclTkWidget: tcl/tk widget class TclTkWidget < TclTkCommand # initialize(*args): # *args: parameters def initialize(*args) if args[0].kind_of?(TclTkIp) # in case the 1st argument is TclTkIp: # Wrap tcl/tk widget by TclTkWidget # (used in TclTkInterpreter#initialize()) # need two arguments fail("illegal # of parameter") if args.size != 2 # ip: interpreter(TclTkIp) # exp: tcl/tk representation ip, exp = args # initialize TclTkObject super(ip, exp) elsif args[0].kind_of?(TclTkInterpreter) # in case 1st parameter is TclTkInterpreter: # generate new widget from parent widget # interp: interpreter(TclTkInterpreter) # parent: parent widget # command: widget generating tk command(label 等) # *args: argument to the command interp, parent, command, *args = args # generate widget name exp = parent.to_s() exp += "." if exp !~ /[.]$/ exp += TclTk._newname("w_") # initialize TclTkObject super(interp._tcltkip(), exp) # generate widget res = @ip._eval_args(command, exp, *args) # fail("can't create Widget") if res != exp # for tk_optionMenu, it is legal res != exp else fail("first parameter is not TclTkInterpreter") end end end # class TclTkCallback: tcl/tk callbacks class TclTkCallback < TclTkObject # initialize(interp, pr, arg): # interp: interpreter(TclTkInterpreter) # pr: callback procedure(Proc) # arg: string to pass as block parameters of pr # bind command of tcl/tk uses % replacement for parameters # pr can receive replaced data using block parameter # its format is specified by arg string # You should not specify arg for the command like # scrollbar with -command option, which receives parameters # without specifying any replacement def initialize(interp, pr, arg = nil) # auto-generate tcl/tk representation (variable name) exp = TclTk._newname("c_") # initialize TclTkObject super(interp._tcltkip(), exp) # save parameters @pr = pr @arg = arg # register in the module TclTk._addcallback(self) end # to_eval(): retuens string representation for @ip._eval_args def to_eval() if @arg # bind replaces %s before calling ruby_fmt, so %%s is used s = %Q/{ruby_fmt {TclTk._callcallback("#{to_s()}", "%%s")} #{@arg}}/ else s = %Q/{ruby_fmt {TclTk._callcallback("#{to_s()}", "%s")}}/ end return s end # _call(arg): invoke callback # arg: callback parameter def _call(arg) @pr.call(arg) end end # class TclTkImage: tcl/tk images class TclTkImage < TclTkCommand # initialize(interp, t, *args): # generating image is done by TclTkImage.new() # destrying is done by image delete (inconsistent, sigh) # interp: interpreter(TclTkInterpreter) # t: image type (photo, bitmap, etc.) # *args: command argument def initialize(interp, t, *args) # auto-generate tcl/tk representation exp = TclTk._newname("i_") # initialize TclTkObject super(interp._tcltkip(), exp) # generate image res = @ip._eval_args("image create", t, exp, *args) fail("can't create Image") if res != exp end end # eof ruby-1.2.3/ext/tcltklib/demo/ 40755 774 145 0 6662164575 14013 5ustar matzNaClruby-1.2.3/ext/tcltklib/demo/lines1.rb100755 774 145 1366 6457557273 15644 0ustar matzNaCl#! /usr/local/bin/ruby require "tk" def drawlines() print Time.now, "\n" for j in 0 .. 99 print "*" $stdout.flush if (j & 1) != 0 col = "blue" else col = "red" end for i in 0 .. 99 # TkcLine.new($a, i, 0, 0, 500 - i, "-fill", col) end end print Time.now, "\n" for j in 0 .. 99 print "*" $stdout.flush if (j & 1) != 0 col = "blue" else col = "red" end for i in 0 .. 99 TkcLine.new($a, i, 0, 0, 500 - i, "-fill", col) end end print Time.now, "\n" # Tk.root.destroy end $a = TkCanvas.new{ height(500) width(500) } $b = TkButton.new{ text("draw") command(proc{drawlines()}) } TkPack.configure($a, $b, {"side"=>"left"}) Tk.mainloop # eof ruby-1.2.3/ext/tcltklib/demo/lines0.tcl100755 774 145 1357 6457557273 16022 0ustar matzNaCl#! /usr/local/bin/wish proc drawlines {} { puts [clock format [clock seconds]] for {set j 0} {$j < 100} {incr j} { puts -nonewline "*" flush stdout if {$j & 1} { set c "blue" } { set c "red" } for {set i 0} {$i < 100} {incr i} { # .a create line $i 0 0 [expr 500 - $i] -fill $c } } puts [clock format [clock seconds]] for {set j 0} {$j < 100} {incr j} { puts -nonewline "*" flush stdout if {$j & 1} { set c "blue" } { set c "red" } for {set i 0} {$i < 100} {incr i} { .a create line $i 0 0 [expr 500 - $i] -fill $c } } puts [clock format [clock seconds]] # destroy . } canvas .a -height 500 -width 500 button .b -text draw -command drawlines pack .a .b -side left # eof ruby-1.2.3/ext/tcltklib/demo/lines2.rb100755 774 145 1631 6457557273 15640 0ustar matzNaCl#! /usr/local/bin/ruby require "tcltk" def drawlines() print Time.now, "\n" for j in 0 .. 99 print "*" $stdout.flush if (j & 1) != 0 col = "blue" else col = "red" end for i in 0 .. 99 # $a.e("create line", i, 0, 0, 500 - i, "-fill", col) end end print Time.now, "\n" for j in 0 .. 99 print "*" $stdout.flush if (j & 1) != 0 col = "blue" else col = "red" end for i in 0 .. 99 $a.e("create line", i, 0, 0, 500 - i, "-fill", col) end end print Time.now, "\n" # $ip.commands()["destroy"].e($root) end $ip = TclTkInterpreter.new() $root = $ip.rootwidget() $a = TclTkWidget.new($ip, $root, "canvas", "-height 500 -width 500") $c = TclTkCallback.new($ip, proc{drawlines()}) $b = TclTkWidget.new($ip, $root, "button", "-text draw -command", $c) $ip.commands()["pack"].e($a, $b, "-side left") TclTk.mainloop # eof ruby-1.2.3/ext/tcltklib/sample/ 40755 774 145 0 6662164577 14352 5ustar matzNaClruby-1.2.3/ext/tcltklib/sample/sample1.rb100755 774 145 55356 6457557273 16400 0ustar matzNaCl#! /usr/local/bin/ruby -d #! /usr/local/bin/ruby # -d オプションを付けると, デバッグ情報を表示する. # tcltk ライブラリのサンプル # まず, ライブラリを require する. require "tcltk" # 以下は, Test1 のインスタンスの initialize() で, # tcl/tk に関する処理を行う例である. # 必ずしもそのようにする必要は無く, # (もし, そうしたければ) class の外で tcl/tk に関する処理を行っても良い. class Test1 # 初期化(インタプリタを生成してウィジェットを生成する). def initialize() #### 使う前のおまじない # インタプリタの生成. ip = TclTkInterpreter.new() # コマンドに対応するオブジェクトを c に設定しておく. c = ip.commands() # 使用するコマンドに対応するオブジェクトは変数に入れておく. append, bind, button, destroy, incr, info, label, place, set, wm = c.indexes( "append", "bind", "button", "destroy", "incr", "info", "label", "place", "set", "wm") #### tcl/tk のコマンドに対応するオブジェクト(TclTkCommand)の操作 # 実行する時は, e() メソッドを使う. # (以下は, tcl/tk における info command r* を実行.) print info.e("command", "r*"), "\n" # 引数は, まとめた文字列にしても同じ. print info.e("command r*"), "\n" # 変数を用いなくとも実行できるが, 見ためが悪い. print c["info"].e("command", "r*"), "\n" # インタプリタのメソッドとしても実行できるが, 効率が悪い. print ip.info("command", "r*"), "\n" #### # 以下, 生成したオブジェクトは変数に代入しておかないと # GC の対象になってしまう. #### tcl/tk の変数に対応するオブジェクト(TclTkVariable)の操作 # 生成と同時に値を設定する. v1 = TclTkVariable.new(ip, "20") # 読み出しは get メソッドを使う. print v1.get(), "\n" # 設定は set メソッドを使う. v1.set(40) print v1.get(), "\n" # set コマンドを使って読み出し, 設定は可能だが見ためが悪い. # e() メソッド等の引数に直接 TclTkObject や数値を書いても良い. set.e(v1, 30) print set.e(v1), "\n" # tcl/tk のコマンドで変数を操作できる. incr.e(v1) print v1.get(), "\n" append.e(v1, 10) print v1.get(), "\n" #### tcl/tk のウィジェットに対応するオブジェクト(TclTkWidget)の操作 # ルートウィジェットを取り出す. root = ip.rootwidget() # ウィジェットの操作. root.e("configure -height 300 -width 300") # タイトルを付けるときは wm を使う. wm.e("title", root, $0) # 親ウィジェットとコマンドを指定して, ウィジェットを作る. l1 = TclTkWidget.new(ip, root, label, "-text {type `x' to print}") # place すると表示される. place.e(l1, "-x 0 -rely 0.0 -relwidth 1 -relheight 0.1") # コマンド名は文字列で指定しても良いが, 見ためが悪い. # (コマンド名は独立した引数でなければならない.) l2 = TclTkWidget.new(ip, root, "label") # ウィジェットの操作. l2.e("configure -text {type `q' to exit}") place.e(l2, "-x 0 -rely 0.1 -relwidth 1 -relheight 0.1") #### tcl/tk のコールバックに対応するオブジェクト(TclTkCallback)の操作 # コールバックを生成する. c1 = TclTkCallback.new(ip, proc{sample(ip, root)}) # コールバックを持つウィジェットを生成する. b1 = TclTkWidget.new(ip, root, button, "-text sample -command", c1) place.e(b1, "-x 0 -rely 0.2 -relwidth 1 -relheight 0.1") # イベントループを抜けるには destroy.e(root) する. c2 = TclTkCallback.new(ip, proc{destroy.e(root)}) b2 = TclTkWidget.new(ip, root, button, "-text exit -command", c2) place.e(b2, "-x 0 -rely 0.3 -relwidth 1 -relheight 0.1") #### イベントのバインド # script の追加 (bind tag sequence +script) は今のところできない. # (イテレータ変数の設定がうまくいかない.) # 基本的にはウィジェットに対するコールバックと同じ. c3 = TclTkCallback.new(ip, proc{print("q pressed\n"); destroy.e(root)}) bind.e(root, "q", c3) # bind コマンドで % 置換によりパラメータを受け取りたいときは, # proc{} の後ろに文字列で指定すると, # 置換結果をイテレータ変数を通して受け取ることができる. # ただし proc{} の後ろの文字列は, # bind コマンドに与えるコールバック以外で指定してはいけない. c4 = TclTkCallback.new(ip, proc{|i| print("#{i} pressed\n")}, "%A") bind.e(root, "x", c4) # TclTkCallback を GC の対象にしたければ, # dcb() (または deletecallbackkeys()) する必要がある. cb = [c1, c2, c3, c4] c5 = TclTkCallback.new(ip, proc{|w| TclTk.dcb(cb, root, w)}, "%W") bind.e(root, "", c5) cb.push(c5) #### tcl/tk のイメージに対応するオブジェクト(TclTkImage)の操作 # データを指定して生成する. i1 = TclTkImage.new(ip, "photo", "-file maru.gif") # ラベルに張り付けてみる. l3 = TclTkWidget.new(ip, root, label, "-relief raised -image", i1) place.e(l3, "-x 0 -rely 0.4 -relwidth 0.2 -relheight 0.2") # 空のイメージを生成して後で操作する. i2 = TclTkImage.new(ip, "photo") # イメージを操作する. i2.e("copy", i1) i2.e("configure -gamma 0.5") l4 = TclTkWidget.new(ip, root, label, "-relief raised -image", i2) place.e(l4, "-relx 0.2 -rely 0.4 -relwidth 0.2 -relheight 0.2") #### end # サンプルのためのウィジェットを生成する. def sample(ip, parent) bind, button, destroy, grid, toplevel, wm = ip.commands().indexes( "bind", "button", "destroy", "grid", "toplevel", "wm") ## toplevel # 新しいウインドウを開くには, toplevel を使う. t1 = TclTkWidget.new(ip, parent, toplevel) # タイトルを付けておく wm.e("title", t1, "sample") # ウィジェットが破壊されたとき, コールバックが GC の対象になるようにする. cb = [] cb.push(c = TclTkCallback.new(ip, proc{|w| TclTk.dcb(cb, t1, w)}, "%W")) bind.e(t1, "", c) # ボタンの生成. wid = [] # toplevel ウィジェットを破壊するには destroy する. cb.push(c = TclTkCallback.new(ip, proc{destroy.e(t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text close -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_label(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text label -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_button(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text button -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_checkbutton(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text checkbutton -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_radiobutton(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text radiobutton -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_scale(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text scale -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_entry(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text entry -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_text(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text text -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_raise(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text raise/lower -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_modal(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text message/modal -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_menu(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text menu -command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_listbox(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text listbox/scrollbar", "-command", c)) cb.push(c = TclTkCallback.new(ip, proc{test_canvas(ip, t1)})) wid.push(TclTkWidget.new(ip, t1, button, "-text canvas -command", c)) # grid で表示する. ro = co = 0 wid.each{|w| grid.e(w, "-row", ro, "-column", co, "-sticky news") ro += 1 if ro == 7 ro = 0 co += 1 end } end # inittoplevel(ip, parent, title) # 以下の処理をまとめて行う. # 1. toplevel ウィジェットを作成する. # 2. コールバックを登録する配列を用意し, toplevel ウィジェットの # イベントにコールバックを削除する手続きを登録する. # 3. クローズボタンを作る. # 作成した toplevel ウィジェット, クローズボタン, コールバック登録用変数 # を返す. # ip: インタプリタ # parent: 親ウィジェット # title: toplevel ウィジェットのウインドウのタイトル def inittoplevel(ip, parent, title) bind, button, destroy, toplevel, wm = ip.commands().indexes( "bind", "button", "destroy", "toplevel", "wm") # 新しいウインドウを開くには, toplevel を使う. t1 = TclTkWidget.new(ip, parent, toplevel) # タイトルを付けておく wm.e("title", t1, title) # ウィジェットが破壊されたとき, コールバックが GC の対象になるようにする. cb = [] cb.push(c = TclTkCallback.new(ip, proc{|w| TclTk.dcb(cb, t1, w)}, "%W")) bind.e(t1, "", c) # close ボタンを作っておく. # toplevel ウィジェットを破壊するには destroy する. cb.push(c = TclTkCallback.new(ip, proc{destroy.e(t1)})) b1 = TclTkWidget.new(ip, t1, button, "-text close -command", c) return t1, b1, cb end # label のサンプル. def test_label(ip, parent) button, global, label, pack = ip.commands().indexes( "button", "global", "label", "pack") t1, b1, cb = inittoplevel(ip, parent, "label") ## label # いろいろな形のラベル. l1 = TclTkWidget.new(ip, t1, label, "-text {default(flat)}") l2 = TclTkWidget.new(ip, t1, label, "-text raised -relief raised") l3 = TclTkWidget.new(ip, t1, label, "-text sunken -relief sunken") l4 = TclTkWidget.new(ip, t1, label, "-text groove -relief groove") l5 = TclTkWidget.new(ip, t1, label, "-text ridge -relief ridge") l6 = TclTkWidget.new(ip, t1, label, "-bitmap error") l7 = TclTkWidget.new(ip, t1, label, "-bitmap questhead") # pack しても表示される. pack.e(b1, l1, l2, l3, l4, l5, l6, l7, "-pady 3") ## -textvariable # tcltk ライブラリの実装では, コールバックは tcl/tk の``手続き''を通して # 呼ばれる. したがって, コールバックの中で(大域)変数にアクセスするときは, # global する必要がある. # global する前に変数に値を設定してしまうとエラーになるので, # tcl/tk における表現形だけ生成して, 実際に値を設定しないように, # 2 番目の引数には nil を与える. v1 = TclTkVariable.new(ip, nil) global.e(v1) v1.set(100) # -textvariable で変数を設定する. l6 = TclTkWidget.new(ip, t1, label, "-textvariable", v1) # コールバックの中から変数を操作する. cb.push(c = TclTkCallback.new(ip, proc{ global.e(v1); v1.set(v1.get().to_i + 10)})) b2 = TclTkWidget.new(ip, t1, button, "-text +10 -command", c) cb.push(c = TclTkCallback.new(ip, proc{ global.e(v1); v1.set(v1.get().to_i - 10)})) b3 = TclTkWidget.new(ip, t1, button, "-text -10 -command", c) pack.e(l6, b2, b3) end # button のサンプル. def test_button(ip, parent) button, pack = ip.commands().indexes("button", "pack") t1, b1, cb = inittoplevel(ip, parent, "button") ## button # コールバック内で参照する変数は先に宣言しておかなければならない. b3 = b4 = nil cb.push(c = TclTkCallback.new(ip, proc{b3.e("flash"); b4.e("flash")})) b2 = TclTkWidget.new(ip, t1, button, "-text flash -command", c) cb.push(c = TclTkCallback.new(ip, proc{b2.e("configure -state normal")})) b3 = TclTkWidget.new(ip, t1, button, "-text normal -command", c) cb.push(c = TclTkCallback.new(ip, proc{b2.e("configure -state disabled")})) b4 = TclTkWidget.new(ip, t1, button, "-text disable -command", c) pack.e(b1, b2, b3, b4) end # checkbutton のサンプル. def test_checkbutton(ip, parent) checkbutton, global, pack = ip.commands().indexes( "checkbutton", "global", "pack") t1, b1, cb = inittoplevel(ip, parent, "checkbutton") ## checkbutton v1 = TclTkVariable.new(ip, nil) global.e(v1) # -variable で変数を設定する. ch1 = TclTkWidget.new(ip, t1, checkbutton, "-onvalue on -offvalue off", "-textvariable", v1, "-variable", v1) pack.e(b1, ch1) end # radiobutton のサンプル. def test_radiobutton(ip, parent) global, label, pack, radiobutton = ip.commands().indexes( "global", "label", "pack", "radiobutton") t1, b1, cb = inittoplevel(ip, parent, "radiobutton") ## radiobutton v1 = TclTkVariable.new(ip, nil) global.e(v1) # ヌルストリングは "{}" で指定する. v1.set("{}") l1 = TclTkWidget.new(ip, t1, label, "-textvariable", v1) # -variable で同じ変数を指定すると同じグループになる. ra1 = TclTkWidget.new(ip, t1, radiobutton, "-text radio1 -value r1 -variable", v1) ra2 = TclTkWidget.new(ip, t1, radiobutton, "-text radio2 -value r2 -variable", v1) cb.push(c = TclTkCallback.new(ip, proc{global.e(v1); v1.set("{}")})) ra3 = TclTkWidget.new(ip, t1, radiobutton, "-text clear -value r3 -variable", v1, "-command", c) pack.e(b1, l1, ra1, ra2, ra3) end # scale のサンプル. def test_scale(ip, parent) global, pack, scale = ip.commands().indexes( "global", "pack", "scale") t1, b1, cb = inittoplevel(ip, parent, "scale") ## scale v1 = TclTkVariable.new(ip, nil) global.e(v1) v1.set(219) # コールバック内で参照する変数は先に宣言しておかなければならない. sca1 = nil cb.push(c = TclTkCallback.new(ip, proc{global.e(v1); v = v1.get(); sca1.e("configure -background", format("#%02x%02x%02x", v, v, v))})) sca1 = TclTkWidget.new(ip, t1, scale, "-label scale -orient h -from 0 -to 255 -variable", v1, "-command", c) pack.e(b1, sca1) end # entry のサンプル. def test_entry(ip, parent) button, entry, global, pack = ip.commands().indexes( "button", "entry", "global", "pack") t1, b1, cb = inittoplevel(ip, parent, "entry") ## entry v1 = TclTkVariable.new(ip, nil) global.e(v1) # ヌルストリングは "{}" で指定する. v1.set("{}") en1 = TclTkWidget.new(ip, t1, entry, "-textvariable", v1) cb.push(c = TclTkCallback.new(ip, proc{ global.e(v1); print(v1.get(), "\n"); v1.set("{}")})) b2 = TclTkWidget.new(ip, t1, button, "-text print -command", c) pack.e(b1, en1, b2) end # text のサンプル. def test_text(ip, parent) button, pack, text = ip.commands().indexes( "button", "pack", "text") t1, b1, cb = inittoplevel(ip, parent, "text") ## text te1 = TclTkWidget.new(ip, t1, text) cb.push(c = TclTkCallback.new(ip, proc{ # 1 行目の 0 文字目から最後までを表示し, 削除する. print(te1.e("get 1.0 end")); te1.e("delete 1.0 end")})) b2 = TclTkWidget.new(ip, t1, button, "-text print -command", c) pack.e(b1, te1, b2) end # raise/lower のサンプル. def test_raise(ip, parent) button, frame, lower, pack, raise = ip.commands().indexes( "button", "frame", "lower", "pack", "raise") t1, b1, cb = inittoplevel(ip, parent, "raise/lower") ## raise/lower # button を隠すテストのために, frame を使う. f1 = TclTkWidget.new(ip, t1, frame) # コールバック内で参照する変数は先に宣言しておかなければならない. b2 = nil cb.push(c = TclTkCallback.new(ip, proc{raise.e(f1, b2)})) b2 = TclTkWidget.new(ip, t1, button, "-text raise -command", c) cb.push(c = TclTkCallback.new(ip, proc{lower.e(f1, b2)})) b3 = TclTkWidget.new(ip, t1, button, "-text lower -command", c) lower.e(f1, b3) pack.e(b2, b3, "-in", f1) pack.e(b1, f1) end # modal なウィジェットのサンプル. def test_modal(ip, parent) button, frame, message, pack, tk_chooseColor, tk_getOpenFile, tk_messageBox = ip.commands().indexes( "button", "frame", "message", "pack", "tk_chooseColor", "tk_getOpenFile", "tk_messageBox") # 最初に load されていないライブラリは ip.commands() に存在しないので, # TclTkLibCommand を生成する必要がある. tk_dialog = TclTkLibCommand.new(ip, "tk_dialog") t1, b1, cb = inittoplevel(ip, parent, "message/modal") ## message mes = "これは message ウィジェットのテストです." mes += "以下は modal なウィジェットのテストです." me1 = TclTkWidget.new(ip, t1, message, "-text {#{mes}}") ## modal # tk_messageBox cb.push(c = TclTkCallback.new(ip, proc{ print tk_messageBox.e("-type yesnocancel -message messageBox", "-icon error -default cancel -title messageBox"), "\n"})) b2 = TclTkWidget.new(ip, t1, button, "-text messageBox -command", c) # tk_dialog cb.push(c = TclTkCallback.new(ip, proc{ # ウィジェット名を生成するためにダミーの frame を生成. print tk_dialog.e(TclTkWidget.new(ip, t1, frame), "dialog dialog error 2 yes no cancel"), "\n"})) b3 = TclTkWidget.new(ip, t1, button, "-text dialog -command", c) # tk_chooseColor cb.push(c = TclTkCallback.new(ip, proc{ print tk_chooseColor.e("-title chooseColor"), "\n"})) b4 = TclTkWidget.new(ip, t1, button, "-text chooseColor -command", c) # tk_getOpenFile cb.push(c = TclTkCallback.new(ip, proc{ print tk_getOpenFile.e("-defaultextension .rb", "-filetypes {{{Ruby Script} {.rb}} {{All Files} {*}}}", "-title getOpenFile"), "\n"})) b5 = TclTkWidget.new(ip, t1, button, "-text getOpenFile -command", c) pack.e(b1, me1, b2, b3, b4, b5) end # menu のサンプル. def test_menu(ip, parent) global, menu, menubutton, pack = ip.commands().indexes( "global", "menu", "menubutton", "pack") tk_optionMenu = TclTkLibCommand.new(ip, "tk_optionMenu") t1, b1, cb = inittoplevel(ip, parent, "menu") ## menu # menubutton を生成する. mb1 = TclTkWidget.new(ip, t1, menubutton, "-text menu") # menu を生成する. me1 = TclTkWidget.new(ip, mb1, menu) # mb1 から me1 が起動されるようにする. mb1.e("configure -menu", me1) # cascade で起動される menu を生成する. me11 = TclTkWidget.new(ip, me1, menu) # radiobutton のサンプル. v1 = TclTkVariable.new(ip, nil); global.e(v1); v1.set("r1") me11.e("add radiobutton -label radio1 -value r1 -variable", v1) me11.e("add radiobutton -label radio2 -value r2 -variable", v1) me11.e("add radiobutton -label radio3 -value r3 -variable", v1) # cascade により mb11 が起動されるようにする. me1.e("add cascade -label cascade -menu", me11) # checkbutton のサンプル. v2 = TclTkVariable.new(ip, nil); global.e(v2); v2.set("none") me1.e("add checkbutton -label check -variable", v2) # separator のサンプル. me1.e("add separator") # command のサンプル. v3 = nil cb.push(c = TclTkCallback.new(ip, proc{ global.e(v1, v2, v3); print "v1: ", v1.get(), ", v2: ", v2.get(), ", v3: ", v3.get(), "\n"})) me1.e("add command -label print -command", c) ## tk_optionMenu v3 = TclTkVariable.new(ip, nil); global.e(v3); v3.set("opt2") om1 = TclTkWidget.new(ip, t1, tk_optionMenu, v3, "opt1 opt2 opt3 opt4") pack.e(b1, mb1, om1, "-side left") end # listbox のサンプル. def test_listbox(ip, parent) clipboard, frame, grid, listbox, lower, menu, menubutton, pack, scrollbar, selection = ip.commands().indexes( "clipboard", "frame", "grid", "listbox", "lower", "menu", "menubutton", "pack", "scrollbar", "selection") t1, b1, cb = inittoplevel(ip, parent, "listbox") ## listbox/scrollbar f1 = TclTkWidget.new(ip, t1, frame) # コールバック内で参照する変数は先に宣言しておかなければならない. li1 = sc1 = sc2 = nil # 実行時に, 後ろにパラメータがつくコールバックは, # イテレータ変数でそのパラメータを受け取ることができる. # (複数のパラメータはひとつの文字列にまとめられる.) cb.push(c1 = TclTkCallback.new(ip, proc{|i| li1.e("xview", i)})) cb.push(c2 = TclTkCallback.new(ip, proc{|i| li1.e("yview", i)})) cb.push(c3 = TclTkCallback.new(ip, proc{|i| sc1.e("set", i)})) cb.push(c4 = TclTkCallback.new(ip, proc{|i| sc2.e("set", i)})) # listbox li1 = TclTkWidget.new(ip, f1, listbox, "-xscrollcommand", c3, "-yscrollcommand", c4, "-selectmode extended -exportselection true") for i in 1..20 li1.e("insert end {line #{i} line #{i} line #{i} line #{i} line #{i}}") end # scrollbar sc1 = TclTkWidget.new(ip, f1, scrollbar, "-orient horizontal -command", c1) sc2 = TclTkWidget.new(ip, f1, scrollbar, "-orient vertical -command", c2) ## selection/clipboard mb1 = TclTkWidget.new(ip, t1, menubutton, "-text edit") me1 = TclTkWidget.new(ip, mb1, menu) mb1.e("configure -menu", me1) cb.push(c = TclTkCallback.new(ip, proc{ # clipboard をクリア. clipboard.e("clear") # selection から文字列を読み込み clipboard に追加する. clipboard.e("append {#{selection.e(\"get\")}}")})) me1.e("add command -label {selection -> clipboard} -command",c) cb.push(c = TclTkCallback.new(ip, proc{ # li1 をクリア. li1.e("delete 0 end") # clipboard から文字列を取り出し, 1 行ずつ selection.e("get -selection CLIPBOARD").split(/\n/).each{|line| # li1 に挿入する. li1.e("insert end {#{line}}")}})) me1.e("add command -label {clipboard -> listbox} -command",c) grid.e(li1, "-row 0 -column 0 -sticky news") grid.e(sc1, "-row 1 -column 0 -sticky ew") grid.e(sc2, "-row 0 -column 1 -sticky ns") grid.e("rowconfigure", f1, "0 -weight 100") grid.e("columnconfigure", f1, "0 -weight 100") f2 = TclTkWidget.new(ip, t1, frame) lower.e(f2, b1) pack.e(b1, mb1, "-in", f2, "-side left") pack.e(f2, f1) end # canvas のサンプル. def test_canvas(ip, parent) canvas, lower, pack = ip.commands().indexes("canvas", "lower", "pack") t1, b1, cb = inittoplevel(ip, parent, "canvas") ## canvas ca1 = TclTkWidget.new(ip, t1, canvas, "-width 400 -height 300") lower.e(ca1, b1) # rectangle を作る. idr = ca1.e("create rectangle 10 10 20 20") # oval を作る. ca1.e("create oval 60 10 100 50") # polygon を作る. ca1.e("create polygon 110 10 110 30 140 10") # line を作る. ca1.e("create line 150 10 150 30 190 10") # arc を作る. ca1.e("create arc 200 10 250 50 -start 0 -extent 90 -style pieslice") # i1 は本当は, どこかで破壊しなければならないが, 面倒なので放ってある. i1 = TclTkImage.new(ip, "photo", "-file maru.gif") # image を作る. ca1.e("create image 100 100 -image", i1) # bitmap を作る. ca1.e("create bitmap 260 50 -bitmap questhead") # text を作る. ca1.e("create text 320 50 -text {drag rectangle}") # window を作る(クローズボタン). ca1.e("create window 200 200 -window", b1) # bind により rectangle を drag できるようにする. cb.push(c = TclTkCallback.new(ip, proc{|i| # i に x と y を受け取るので, 取り出す. x, y = i.split(/ /); x = x.to_f; y = y.to_f # 座標を変更する. ca1.e("coords current #{x - 5} #{y - 5} #{x + 5} #{y + 5}")}, # x, y 座標を空白で区切ったものをイテレータ変数へ渡すように指定. "%x %y")) # rectangle に bind する. ca1.e("bind", idr, "", c) pack.e(ca1) end end # test driver if ARGV.size == 0 print "#{$0} n で, n 個のインタプリタを起動します.\n" n = 1 else n = ARGV[0].to_i end print "start\n" ip = [] # インタプリタ, ウィジェット等の生成. for i in 1 .. n ip.push(Test1.new()) end # 用意ができたらイベントループに入る. TclTk.mainloop() print "exit from mainloop\n" # インタプリタが GC されるかのテスト. ip = [] print "GC.start\n" if $DEBUG GC.start() if $DEBUG print "end\n" exit # end ruby-1.2.3/ext/tcltklib/sample/sample2.rb100755 774 145 25430 6457557273 16367 0ustar matzNaCl#!/usr/local/bin/ruby #----------------------> pretty simple othello game <----------------------- # othello.rb # # version 0.3 # maeda shugo (shuto@po.aianet.ne.jp) #--------------------------------------------------------------------------- # Sep. 17, 1997 modified by Y. Shigehiro for tcltk library # maeda shugo (shugo@po.aianet.ne.jp) 氏による # (ruby/tk で書かれていた) ruby のサンプルプログラム # http://www.aianet.or.jp/~shugo/ruby/othello.rb.gz # を tcltk ライブラリを使うように, 機械的に変更してみました. # # なるべくオリジナルと同じになるようにしてあります. require "observer" require "tcltk" $ip = TclTkInterpreter.new() $root = $ip.rootwidget() $button, $canvas, $checkbutton, $frame, $label, $pack, $update, $wm = $ip.commands().indexes( "button", "canvas", "checkbutton", "frame", "label", "pack", "update", "wm") class Othello EMPTY = 0 BLACK = 1 WHITE = - BLACK attr :in_com_turn attr :game_over class Board include Observable DIRECTIONS = [ [-1, -1], [-1, 0], [-1, 1], [ 0, -1], [ 0, 1], [ 1, -1], [ 1, 0], [ 1, 1] ] attr :com_disk, TRUE def initialize(othello) @othello = othello reset end def notify_observers(*arg) if @observer_peers != nil super(*arg) end end def reset @data = [ [EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY], [EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY], [EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY], [EMPTY, EMPTY, EMPTY, WHITE, BLACK, EMPTY, EMPTY, EMPTY], [EMPTY, EMPTY, EMPTY, BLACK, WHITE, EMPTY, EMPTY, EMPTY], [EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY], [EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY], [EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY] ] changed notify_observers end def man_disk return - @com_disk end def other_disk(disk) return - disk end def get_disk(row, col) return @data[row][col] end def reverse_to(row, col, my_disk, dir_y, dir_x) y = row x = col begin y += dir_y x += dir_x if y < 0 || x < 0 || y > 7 || x > 7 || @data[y][x] == EMPTY return end end until @data[y][x] == my_disk begin @data[y][x] = my_disk changed notify_observers(y, x) y -= dir_y x -= dir_x end until y == row && x == col end def put_disk(row, col, disk) @data[row][col] = disk changed notify_observers(row, col) DIRECTIONS.each do |dir| reverse_to(row, col, disk, *dir) end end def count_disk(disk) num = 0 @data.each do |rows| rows.each do |d| if d == disk num += 1 end end end return num end def count_point_to(row, col, my_disk, dir_y, dir_x) return 0 if @data[row][col] != EMPTY count = 0 loop do row += dir_y col += dir_x break if row < 0 || col < 0 || row > 7 || col > 7 case @data[row][col] when my_disk return count when other_disk(my_disk) count += 1 when EMPTY break end end return 0 end def count_point(row, col, my_disk) count = 0 DIRECTIONS.each do |dir| count += count_point_to(row, col, my_disk, *dir) end return count end def corner?(row, col) return (row == 0 && col == 0) || (row == 0 && col == 7) || (row == 7 && col == 0) || (row == 7 && col == 7) end def search(my_disk) max = 0 max_row = nil max_col = nil for row in 0 .. 7 for col in 0 .. 7 buf = count_point(row, col, my_disk) if (corner?(row, col) && buf > 0) || max < buf max = buf max_row = row max_col = col end end end return max_row, max_col end end #--------------------------> class Board ends here class BoardView < TclTkWidget BACK_GROUND_COLOR = "DarkGreen" HILIT_BG_COLOR = "green" BORDER_COLOR = "black" BLACK_COLOR = "black" WHITE_COLOR = "white" STOP_COLOR = "red" attr :left attr :top attr :right attr :bottom class Square attr :oval, TRUE attr :row attr :col def initialize(view, row, col) @view = view @id = @view.e("create rectangle", *view.tk_rect(view.left + col, view.top + row, view.left + col + 1, view.top + row + 1)) @row = row @col = col @view.e("itemconfigure", @id, "-width 0.5m -outline #{BORDER_COLOR}") @view.e("bind", @id, "", TclTkCallback.new($ip, proc{ if @oval == nil view.e("itemconfigure", @id, "-fill #{HILIT_BG_COLOR}") end })) @view.e("bind", @id, "", TclTkCallback.new($ip, proc{ view.e("itemconfigure", @id, "-fill #{BACK_GROUND_COLOR}") })) @view.e("bind", @id, "", TclTkCallback.new($ip, proc{ view.click_square(self) })) end def blink(color) @view.e("itemconfigure", @id, "-fill #{color}") $update.e() sleep(0.1) @view.e("itemconfigure", @id, "-fill #{BACK_GROUND_COLOR}") end end #-----------------------> class Square ends here def initialize(othello, board) super($ip, $root, $canvas) @othello = othello @board = board @board.add_observer(self) @squares = Array.new(8) for i in 0 .. 7 @squares[i] = Array.new(8) end @left = 1 @top = 0.5 @right = @left + 8 @bottom = @top + 8 i = self.e("create rectangle", *tk_rect(@left, @top, @right, @bottom)) self.e("itemconfigure", i, "-width 1m -outline #{BORDER_COLOR} -fill #{BACK_GROUND_COLOR}") for row in 0 .. 7 for col in 0 .. 7 @squares[row][col] = Square.new(self, row, col) end end update end def tk_rect(left, top, right, bottom) return left.to_s + "c", top.to_s + "c", right.to_s + "c", bottom.to_s + "c" end def clear each_square do |square| if square.oval != nil self.e("delete", square.oval) square.oval = nil end end end def draw_disk(row, col, disk) if disk == EMPTY if @squares[row][col].oval != nil self.e("delete", @squares[row][col].oval) @squares[row][col].oval = nil end return end $update.e() sleep(0.05) oval = @squares[row][col].oval if oval == nil oval = self.e("create oval", *tk_rect(@left + col + 0.2, @top + row + 0.2, @left + col + 0.8, @top + row + 0.8)) @squares[row][col].oval = oval end case disk when BLACK color = BLACK_COLOR when WHITE color = WHITE_COLOR else fail format("Unknown disk type: %d", disk) end self.e("itemconfigure", oval, "-outline #{color} -fill #{color}") end def update(row = nil, col = nil) if row && col draw_disk(row, col, @board.get_disk(row, col)) else each_square do |square| draw_disk(square.row, square.col, @board.get_disk(square.row, square.col)) end end @othello.show_point end def each_square @squares.each do |rows| rows.each do |square| yield(square) end end end def click_square(square) if @othello.in_com_turn || @othello.game_over || @board.count_point(square.row, square.col, @board.man_disk) == 0 square.blink(STOP_COLOR) return end @board.put_disk(square.row, square.col, @board.man_disk) @othello.com_turn end private :draw_disk public :update end #----------------------> class BoardView ends here def initialize @msg_label = TclTkWidget.new($ip, $root, $label) $pack.e(@msg_label) @board = Board.new(self) @board_view = BoardView.new(self, @board) #### added by Y. Shigehiro ## board_view の大きさを設定する. x1, y1, x2, y2 = @board_view.e("bbox all").split(/ /).collect{|i| i.to_f} @board_view.e("configure -width", x2 - x1) @board_view.e("configure -height", y2 - y1) ## scrollregion を設定する. @board_view.e("configure -scrollregion {", @board_view.e("bbox all"), "}") #### ここまで $pack.e(@board_view, "-fill both -expand true") panel = TclTkWidget.new($ip, $root, $frame) @play_black = TclTkWidget.new($ip, panel, $checkbutton, "-text {com is black} -command", TclTkCallback.new($ip, proc{ switch_side })) $pack.e(@play_black, "-side left") quit = TclTkWidget.new($ip, panel, $button, "-text Quit -command", TclTkCallback.new($ip, proc{ exit })) $pack.e(quit, "-side right -fill x") reset = TclTkWidget.new($ip, panel, $button, "-text Reset -command", TclTkCallback.new($ip, proc{ reset_game })) $pack.e(reset, "-side right -fill x") $pack.e(panel, "-side bottom -fill x") # root = Tk.root $wm.e("title", $root, "Othello") $wm.e("iconname", $root, "Othello") @board.com_disk = WHITE @game_over = FALSE TclTk.mainloop end def switch_side if @in_com_turn @play_black.e("toggle") else @board.com_disk = @board.man_disk com_turn unless @game_over end end def reset_game if @board.com_disk == BLACK @board.com_disk = WHITE @play_black.e("toggle") end @board_view.clear @board.reset $wm.e("title", $root, "Othello") @game_over = FALSE end def com_turn @in_com_turn = TRUE $update.e() sleep(0.5) begin com_disk = @board.count_disk(@board.com_disk) man_disk = @board.count_disk(@board.man_disk) if @board.count_disk(EMPTY) == 0 if man_disk == com_disk $wm.e("title", $root, "{Othello - Draw!}") elsif man_disk > com_disk $wm.e("title", $root, "{Othello - You Win!}") else $wm.e("title", $root, "{Othello - You Loose!}") end @game_over = TRUE break elsif com_disk == 0 $wm.e("title", $root, "{Othello - You Win!}") @game_over = TRUE break elsif man_disk == 0 $wm.e("title", $root, "{Othello - You Loose!}") @game_over = TRUE break end row, col = @board.search(@board.com_disk) break if row == nil || col == nil @board.put_disk(row, col, @board.com_disk) end while @board.search(@board.man_disk) == [nil, nil] @in_com_turn = FALSE end def show_point black = @board.count_disk(BLACK) white = @board.count_disk(WHITE) @msg_label.e("configure -text", %Q/{#{format("BLACK: %.2d WHITE: %.2d", black, white)}}/) end end #----------------------> class Othello ends here Othello.new #----------------------------------------------> othello.rb ends here ruby-1.2.3/ext/tcltklib/sample/maru.gif100644 774 145 741 6457557273 16065 0ustar matzNaClGIF87a@@qq篤墺矜,@@h載0I8詬`(di`C;p,t-暫Z`:nN[HpUT俟Ry @J]U撒伸pk-徇0視mcww3y0D}x~20L+v^VTB`17b5z・q H(&蚤A痛突範2@ 壞1?旆巖'布06疵J$耡i縣椏{ 5rp呆O/ 0&hx!)~m@e6`Tj?y=鐘XR4!e泛IHIqY佚4e(,F- \弌EmI*#P,N竃0uRV:AS*Z(UbA搾r)甌EtB2R#(le]4>X季l!27S(4 wL@ gcM6;ruby-1.2.3/ext/tcltklib/sample/batsu.gif100644 774 145 1032 6457557273 16251 0ustar matzNaClGIF87a@@88UUqq篤矜,@@x載0I8詬`(diE[0Rn}O9n脩Eaoe # use Shigehiro's tcltklib require "tcltklib" require "tkutil" module TkComm None = Object.new def None.to_s 'None' end Tk_CMDTBL = {} Tk_WINDOWS = {} def error_at frames = caller() frames.delete_if do |c| c =~ %r!/tk(|core|thcore|canvas|text|entry|scrollbox)\.rb:\d+! end frames end private :error_at def _genobj_for_tkwidget(path) return TkRoot.new if path == '.' begin tk_class = TkCore::INTERP._invoke('winfo', 'class', path) rescue return path end ruby_class = TkClassBind::WidgetClassNameTBL[tk_class] gen_class_name = ruby_class.name + 'GeneratedOnTk' unless Object.const_defined? gen_class_name eval "class #{gen_class_name}<#{ruby_class.name} def initialize(path) @path=path Tk_WINDOWS[@path] = self end end" end eval "#{gen_class_name}.new('#{path}')" end def tk_tcl2ruby(val) if val =~ /^rb_out (c\d+)/ return Tk_CMDTBL[$1] end if val.include? ?\s return val.split.collect{|v| tk_tcl2ruby(v)} end case val when /^@font/ TkFont.get_obj(val) when /^-?\d+$/ val.to_i when /^\./ Tk_WINDOWS[val] ? Tk_WINDOWS[val] : _genobj_for_tkwidget(val) when / / val.split.collect{|elt| tk_tcl2ruby(elt) } when /^-?\d+\.\d*$/ val.to_f else val end end def tk_split_list(str) return [] if str == "" idx = str.index('{') return tk_tcl2ruby(str) unless idx list = tk_tcl2ruby(str[0,idx]) list = [] if list == "" str = str[idx+1..-1] i = -1 brace = 1 str.each_byte {|c| i += 1 brace += 1 if c == ?{ brace -= 1 if c == ?} break if brace == 0 } if str[0, i] == ' ' list.push ' ' else list.push tk_split_list(str[0, i]) end list += tk_split_list(str[i+1..-1]) list end def tk_split_simplelist(str) return [] if str == "" idx = str.index('{') return str.split unless idx list = str[0,idx].split str = str[idx+1..-1] i = -1 brace = 1 str.each_byte {|c| i += 1 brace += 1 if c == ?{ brace -= 1 if c == ?} break if brace == 0 } if i == 0 list.push '' elsif str[0, i] == ' ' list.push ' ' else list.push str[0..i-1] end list += tk_split_simplelist(str[i+1..-1]) list end private :tk_tcl2ruby, :tk_split_list, :tk_split_simplelist def hash_kv(keys) conf = [] if keys and keys != None for k, v in keys conf.push("-#{k}") conf.push(v) end end conf end private :hash_kv def array2tk_list(ary) ary.collect{|e| if e.kind_of? Array "{#{array2tk_list(e)}}" elsif e.kind_of? Hash "{#{e.to_a.collect{|ee| array2tk_list(ee)}.join(' ')}}" else s = _get_eval_string(e) (s.index(/\s/))? "{#{s}}": s end }.join(" ") end private :array2tk_list def bool(val) case val when "1", 1, 'yes', 'true' TRUE else FALSE end end def number(val) case val when /^-?\d+$/ val.to_i when /^-?\d+\.\d*$/ val.to_f else val end end def string(val) if val == "{}" '' elsif val[0] == ?{ val[1..-2] else val end end def list(val) tk_split_list(val).to_a end def window(val) Tk_WINDOWS[val] end def procedure(val) if val =~ /^rb_out (c\d+)/ Tk_CMDTBL[$1] else nil end end private :bool, :number, :string, :list, :window, :procedure def _get_eval_string(str) return nil if str == None if str.kind_of?(Hash) str = hash_kv(str).join(" ") elsif str.kind_of?(Array) str = array2tk_list(str) elsif str.kind_of?(Proc) str = install_cmd(str) elsif str == nil str = "" elsif str == false str = "0" elsif str == true str = "1" elsif (str.respond_to?(:to_eval)) str = str.to_eval() else str = str.to_s() end return str end private :_get_eval_string Tk_IDs = [0, 0] # [0]-cmdid, [1]-winid def _curr_cmd_id id = format("c%.4d", Tk_IDs[0]) end def _next_cmd_id id = _curr_cmd_id Tk_IDs[0] += 1 id end def install_cmd(cmd) return '' if cmd == '' id = _next_cmd_id Tk_CMDTBL[id] = cmd @cmdtbl = [] if not @cmdtbl @cmdtbl.push id return format("rb_out %s", id); end def uninstall_cmd(id) Tk_CMDTBL[id] = nil end private :install_cmd, :uninstall_cmd def install_win(ppath) id = format("w%.4d", Tk_IDs[1]) Tk_IDs[1] += 1 if !ppath or ppath == "." @path = format(".%s", id); else @path = format("%s.%s", ppath, id) end Tk_WINDOWS[@path] = self end def uninstall_win() Tk_WINDOWS[@path] = nil end class Event def initialize(seq,b,f,h,k,s,t,w,x,y,aa,ee,kk,nn,ww,tt,xx,yy) @serial = seq @num = b @focus = (f == 1) @height = h @keycode = k @state = s @time = t @width = w @x = x @y = y @char = aa @send_event = (ee == 1) @keysym = kk @keysym_num = nn @type = tt @widget = ww @x_root = xx @y_root = yy end attr :serial attr :num attr :focus attr :height attr :keycode attr :state attr :time attr :width attr :x attr :y attr :char attr :send_event attr :keysym attr :keysym_num attr :type attr :widget attr :x_root attr :y_root end def install_bind(cmd, args=nil) if args id = install_cmd(proc{|arg| TkUtil.eval_cmd cmd, *arg }) id + " " + args else id = install_cmd(proc{|arg| TkUtil.eval_cmd cmd, Event.new(*arg) }) id + ' %# %b %f %h %k %s %t %w %x %y %A %E %K %N %W %T %X %Y' end end def tk_event_sequence(context) if context.kind_of? TkVirtualEvent context = context.path end if context.kind_of? Array context = context.collect{|ev| if context.kind_of? TkVirtualEvent ev.path else ev end }.join("><") end if /,/ =~ context context = context.split(/\s*,\s*/).join("><") else context end end def _bind_core(mode, path, context, cmd, args=nil) id = install_bind(cmd, args) begin tk_call 'bind', path, "<#{tk_event_sequence(context)}>", mode + id rescue uninstall_cmd(id) fail end end def _bind(path, context, cmd, args=nil) _bind_core('', path, context, cmd, args) end def _bind_append(path, context, cmd, args=nil) _bind_core('+', path, context, cmd, args) end private :install_bind, :tk_event_sequence, :_bind_core, :_bind, :_bind_append def bind_all(context, cmd=Proc.new, args=nil) _bind 'all', context, cmd, args end def bind_append_all(context, cmd=Proc.new, args=nil) _bind_append 'all', context, cmd, args end def bind(tagOrClass, context, cmd=Proc.new, args=nil) _bind tagOrClass, context, cmd, args end def bind_append(tagOrClass, context, cmd=Proc.new, args=nil) _bind_append tagOrClass, context, cmd, args end def _bindinfo(tagOrClass, context=nil) if context (tk_call('bind', tagOrClass, "<#{tk_event_sequence(context)}>")).collect{|cmdline| if cmdline =~ /^rb_out (c\d+)\s+(.*)$/ [Tk_CMDTBL[$1], $2] else cmdline end } else tk_split_list(tk_call 'bind', tagOrClass).collect{|seq| seq[1..-2].gsub(/>", *hash_kv(keys)) else tk_call('event', 'generate', window, "<#{tk_event_sequence(context)}>") end end def messageBox(keys) tk_call 'tk_messageBox', *hash_kv(keys) end def getOpenFile(keys) tk_call 'tk_getOpenFile', *hash_kv(keys) end def getSaveFile(keys) tk_call 'tk_getSaveFile', *hash_kv(keys) end def chooseColor(keys) tk_call 'tk_chooseColor', *hash_kv(keys) end def tk_call(*args) print args.join(" "), "\n" if $DEBUG args.filter {|x|_get_eval_string(x)} args.compact! args.flatten! begin res = INTERP._invoke(*args) rescue NameError err = $! begin args.unshift "unknown" res = INTERP._invoke(*args) rescue raise unless /^invalid command/ =~ $! raise err end end if INTERP._return_value() != 0 fail RuntimeError, res, error_at end print "==> ", res, "\n" if $DEBUG return res end end module Tk include TkCore extend Tk TCL_VERSION = INTERP._invoke("info", "tclversion") TK_VERSION = INTERP._invoke("set", "tk_version") JAPANIZED_TK = (INTERP._invoke("info", "commands", "kanji") != "") def root TkRoot.new end def bell tk_call 'bell' end def Tk.focus(display=nil) if display == nil r = tk_call('focus') else r = tk_call('focus', '-displayof', display) end tk_tcl2ruby(r) end def Tk.focus_lastfor(win) tk_tcl2ruby(tk_call('focus', '-lastfor', win)) end def toUTF8(str,encoding) INTERP._toUTF8(str,encoding) end def fromUTF8(str,encoding) INTERP._fromUTF8(str,encoding) end module Scrollable def xscrollcommand(cmd=Proc.new) configure_cmd 'xscrollcommand', cmd end def yscrollcommand(cmd=Proc.new) configure_cmd 'yscrollcommand', cmd end end module Wm include TkComm def aspect(*args) w = window(tk_call('wm', 'grid', path, *args)) w.split.collect{|s|s.to_i} if args.length == 0 end def client(name=None) tk_call 'wm', 'client', path, name end def colormapwindows(*args) list(tk_call('wm', 'colormapwindows', path, *args)) end def wm_command(value=None) string(tk_call('wm', 'command', path, value)) end def deiconify tk_call 'wm', 'deiconify', path end def focusmodel(*args) tk_call 'wm', 'focusmodel', path, *args end def frame tk_call 'wm', 'frame', path end def geometry(*args) list(tk_call('wm', 'geometry', path, *args)) end def grid(*args) w = tk_call('wm', 'grid', path, *args) list(w) if args.size == 0 end def group(*args) tk_call 'wm', 'group', path, *args end def iconbitmap(*args) tk_call 'wm', 'iconbitmap', path, *args end def iconify tk_call 'wm', 'iconify', path end def iconmask(*args) tk_call 'wm', 'iconmask', path, *args end def iconname(*args) tk_call 'wm', 'iconname', path, *args end def iconposition(*args) w = tk_call('wm', 'iconposition', path, *args) list(w) if args.size == 0 end def iconwindow(*args) w = tk_call('wm', 'iconwindow', path, *args) window(w) if args.size == 0 end def maxsize(*args) w = tk_call('wm', 'maxsize', path, *args) list(w) if not args.size == 0 end def minsize(*args) w = tk_call('wm', 'minsize', path, *args) list(w) if args.size == 0 end def overrideredirect(bool=None) if bool == None bool(tk_call('wm', 'overrideredirect', path)) else tk_call 'wm', 'overrideredirect', path, bool end end def positionfrom(*args) tk_call 'wm', 'positionfrom', path, *args end def protocol(name=nil, cmd=nil) if cmd tk_call('wm', 'protocol', path, name, cmd) elsif name result = tk_call('wm', 'protocol', path, name) (result == "")? nil : tk_tcl2ruby(result) else tk_split_simplelist(tk_call('wm', 'protocol', path)) end end def resizable(*args) w = tk_call('wm', 'resizable', path, *args) if args.length == 0 list(w).collect{|e| bool(e)} end end def sizefrom(*args) list(tk_call('wm', 'sizefrom', path, *args)) end def state tk_call 'wm', 'state', path end def title(*args) tk_call 'wm', 'title', path, *args end def transient(*args) tk_call 'wm', 'transient', path, *args end def withdraw tk_call 'wm', 'withdraw', path end end end class TkVariable include Tk extend TkCore TkVar_CB_TBL = {} Tk_VARIABLE_ID = ["v00000"] INTERP._invoke("proc", "rb_var", "args", "ruby [format \"TkVariable.callback %%Q!%s!\" $args]") def TkVariable.callback(args) name1,name2,op = tk_split_list(args) if TkVar_CB_TBL[name1] _get_eval_string(TkVar_CB_TBL[name1].trace_callback(name2,op)) else '' end end def initialize(val="") @id = Tk_VARIABLE_ID[0] Tk_VARIABLE_ID[0] = Tk_VARIABLE_ID[0].succ if val == [] INTERP._eval(format('global %s; set %s(0) 0; unset %s(0)', @id, @id, @id)) elsif val.kind_of?(Array) a = [] val.each_with_index{|e,i| a.push(i); a.push(array2tk_list(e))} s = '"' + a.join(" ").gsub(/[][$"]/, '\\\\\&') + '"' #' INTERP._eval(format('global %s; array set %s %s', @id, @id, s)) elsif val.kind_of?(Hash) s = '"' + val.to_a.collect{|e| array2tk_list(e)}.join(" ")\ .gsub(/[][$"]/, '\\\\\&') + '"' #' INTERP._eval(format('global %s; array set %s %s', @id, @id, s)) else s = '"' + _get_eval_string(val).gsub(/[][$"]/, '\\\\\&') + '"' #' INTERP._eval(format('global %s; set %s %s', @id, @id, s)) end end def wait INTERP._eval("tkwait variable #{@id}") end def id @id end def value begin INTERP._eval(format('global %s; set %s', @id, @id)) rescue if INTERP._eval(format('global %s; array exists %s', @id, @id)) != "1" raise else Hash[*tk_split_simplelist(INTERP\ ._eval(format('global %s; array get %s', @id, @id)))] end end end def value=(val) begin s = '"' + _get_eval_string(val).gsub(/[][$"]/, '\\\\\&') + '"' #' INTERP._eval(format('global %s; set %s %s', @id, @id, s)) rescue if INTERP._eval(format('global %s; array exists %s', @id, @id)) != "1" raise else INTERP._eval(format('global %s; unset %s'), @id, @id) if val == [] INTERP._eval(format('global %s; set %s(0) 0; unset %s(0)', @id, @id, @id)) elsif val.kind_of?(Array) a = [] val.each_with_index{|e,i| a.push(i); a.push(array2tk_list(e))} s = '"' + a.join(" ").gsub(/[][$"]/, '\\\\\&') + '"' #' INTERP._eval(format('global %s; unset %s; array set %s %s', @id, @id, @id, s)) elsif val.kind_of?(Hash) s = '"' + val.to_a.collect{|e| array2tk_list(e)}.join(" ")\ .gsub(/[][$"]/, '\\\\\&') + '"' #' INTERP._eval(format('global %s; unset %s; array set %s %s', @id, @id, @id, s)) else raise end end end end def [](index) INTERP._eval(format('global %s; set %s(%s)', @id, @id, _get_eval_string(index))) end def []=(index,val) INTERP._eval(format('global %s; set %s(%s) %s', @id, @id, _get_eval_string(index), _get_eval_string(val))) end def to_i Integer(number(value)) end def to_f Float(number(value)) end def to_s String(string(value)) end def inspect format "", @id end def ==(other) case other when TkVariable self.equal(self) when String self.to_s == other when Integer self.to_i == other when Float self.to_f == other when Array self.to_a == other else false end end def to_a list(value) end def to_eval @id end def unset(elem=nil) if elem INTERP._eval(format('global %s; unset %s(%s)', @id, @id, tk_tcl2ruby(elem))) else INTERP._eval(format('global %s; unset %s', @id, @id)) end end alias remove unset def trace_callback(elem, op) if @trace_var.kind_of? Array @trace_var.each{|m,e| e.call(self,elem,op) if m.index(op)} end if elem.kind_of? String if @trace_elem[elem].kind_of? Array @trace_elem[elem].each{|m,e| e.call(self,elem,op) if m.index(op)} end end end def trace(opts, cmd) @trace_var = [] if @trace_var == nil opts = ['r','w','u'].find_all{|c| opts.index(c)}.join('') @trace_var.unshift([opts,cmd]) if @trace_opts == nil TkVar_CB_TBL[@id] = self @trace_opts = opts Tk.tk_call('trace', 'variable', @id, @trace_opts, 'rb_var') else newopts = @trace_opts.dup opts.each_byte{|c| newopts += c.chr unless @newopts.index(c)} if newopts != @trace_opts Tk.tk_call('trace', 'vdelete', @id, @trace_opts, 'rb_var') @trace_opts.replace(newopts) Tk.tk_call('trace', 'variable', @id, @trace_opts, 'rb_var') end end end def trace_element(elem, opts, cmd) @trace_elem = {} if @trace_elem == nil @trace_elem[elem] = [] if @trace_elem[elem] == nil opts = ['r','w','u'].find_all{|c| opts.index(c)}.join('') @trace_elem[elem].unshift([opts,cmd]) if @trace_opts == nil TkVar_CB_TBL[@id] = self @trace_opts = opts Tk.tk_call('trace', 'variable', @id, @trace_opts, 'rb_var') else newopts = @trace_opts.dup opts.each_byte{|c| newopts += c.chr unless @newopts.index(c)} if newopts != @trace_opts Tk.tk_call('trace', 'vdelete', @id, @trace_opts, 'rb_var') @trace_opts.replace(newopts) Tk.tk_call('trace', 'variable', @id, @trace_opts, 'rb_var') end end end def trace_vinfo return [] unless @trace_var @trace_var.dup end def trace_vinfo_for_element(elem) return [] unless @trace_elem return [] unless @trace_elem[elem] @trace_elem[elem].dup end def trace_vdelete(opts,cmd) return unless @trace_var.kind_of? Array opts = ['r','w','u'].find_all{|c| opts.index(c)}.join('') idx = -1 newopts = '' @trace_var.each_with_index{|i,e| if idx < 0 && e[0] == opts && e[1] == cmd idx = i next end e[0].each_byte{|c| newopts += c.chr unless newopts.index(c)} } if idx >= 0 @trace_var.delete_at(idx) else return end @trace_elem.each{|elem| @trace_elem[elem].each{|e| e[0].each_byte{|c| newopts += c.chr unless newopts.index(c)} } } newopts = ['r','w','u'].find_all{|c| newopts.index(c)}.join('') if newopts != @trace_opts Tk.tk_call('trace', 'vdelete', @id, @trace_opts, 'rb_var') @trace_opts.replace(newopts) if @trace_opts != '' Tk.tk_call('trace', 'variable', @id, @trace_opts, 'rb_var') end end end def trace_vdelete_for_element(elem,opts,cmd) return unless @trace_elem.kind_of? Hash return unless @trace_elem[elem].kind_of? Array opts = ['r','w','u'].find_all{|c| opts.index(c)}.join('') idx = -1 @trace_elem[elem].each_with_index{|i,e| if idx < 0 && e[0] == opts && e[1] == cmd idx = i next end } if idx >= 0 @trace_elem[elem].delete_at(idx) else return end newopts = '' @trace_var.each{|e| e[0].each_byte{|c| newopts += c.chr unless newopts.index(c)} } @trace_elem.each{|elem| @trace_elem[elem].each{|e| e[0].each_byte{|c| newopts += c.chr unless newopts.index(c)} } } newopts = ['r','w','u'].find_all{|c| newopts.index(c)}.join('') if newopts != @trace_opts Tk.tk_call('trace', 'vdelete', @id, @trace_opts, 'rb_var') @trace_opts.replace(newopts) if @trace_opts != '' Tk.tk_call('trace', 'variable', @id, @trace_opts, 'rb_var') end end end end class TkVarAccessvalue}) else tk_call path, 'configure', "-#{slot}", value end end end def configure_cmd(slot, value) configure slot, install_cmd(value) end def configinfo(slot = nil) if slot == 'font' || slot == 'kanjifont' fontobj else if slot conf = tk_split_list(tk_send('configure', "-#{slot}") ) conf[0] = conf[0][1..-1] conf else ret = tk_split_list(tk_send('configure') ).collect{|conf| conf[0] = conf[0][1..-1] conf } if ret.assoc('font') ret.delete_if{|item| item[0] == 'font' || item[0] == 'kanjifont'} ret.push(['font', fontobj]) else ret end end end end def bind(context, cmd=Proc.new, args=nil) _bind path, context, cmd, args end def bind_append(context, cmd=Proc.new, args=nil) _bind_append path, context, cmd, args end def bindinfo(context=nil) _bindinfo path, context end def event_generate(context, keys=nil) if keys tk_call('event', 'generate', path, "<#{tk_event_sequence(context)}>", *hash_kv(keys)) else tk_call('event', 'generate', path, "<#{tk_event_sequence(context)}>") end end def tk_trace_variable(v) unless v.kind_of?(TkVariable) fail ArgumentError, format("requires TkVariable given %s", v.type) end v end private :tk_trace_variable def destroy tk_call 'trace', 'vdelete', @tk_vn, 'w', @var_id if @var_id end end module TkClassBind WidgetClassNameTBL = {} def TkClassBind.name2class(name) WidgetClassNameTBL[name] end def bind(context, cmd=Proc.new, args=nil) Tk.bind to_eval, context, cmd, args end def bind_append(context, cmd=Proc.new, args=nil) Tk.bind_append to_eval, context, cmd, args end def bindinfo(context=nil) Tk.bindinfo to_eval, context end end class TkWindowval}) else tk_call 'entryconfigure', index, "-#{key}", val end end end def entryconfiginfo(index, key=nil) if key conf = tk_split_list(tk_send('entryconfigure',index,"-#{key}")) conf[0] = conf[0][1..-1] conf else tk_split_list(tk_send('entryconfigure', index)).collect{|conf| conf[0] = conf[0][1..-1] conf } end end end class TkMenubutton # require 'tk' class TkAfter include TkCore extend TkCore Tk_CBID = [0] Tk_CBTBL = {} INTERP._invoke("proc", "rb_after", "args", "ruby [format \"TkAfter.callback %%Q!%s!\" $args]") ############################### # class methods ############################### def TkAfter.callback(arg) @after_id = nil arg = Array(tk_split_list(arg)) obj_id = arg.shift ex_obj = Tk_CBTBL[obj_id] return nil if ex_obj == nil; # canceled _get_eval_string(ex_obj.do_callback(*arg)) end def TkAfter.info tk_call('after', 'info').split(' ').filter{|id| ret = Tk_CBTBL.find{|key,val| val.after_id == id} (ret == nil)? id: ret[1] } end ############################### # instance methods ############################### def do_callback(*args) @in_callback = true ret = @current_proc.call(*args) if @set_next set_next_callback(*args) else @set_next = true end @in_callback = false ret end def set_callback(sleep, args=nil) @after_script = "rb_after #{@id} #{_get_eval_string(args)}" @after_id = tk_call('after', sleep, @after_script) @current_script = [sleep, @after_script] end def set_next_callback(*args) if @running == false || @proc_max == 0 || @do_loop == 0 Tk_CBTBL[@id] = nil ;# for GC @running = false return end if @current_pos >= @proc_max if @do_loop < 0 || (@do_loop -= 1) > 0 @current_pos = 0 else Tk_CBTBL[@id] = nil ;# for GC @running = false return end end @current_args = args if @sleep_time.kind_of? Proc sleep = @sleep_time.call(*args) else sleep = @sleep_time end @current_sleep = sleep cmd, *cmd_args = @loop_proc[@current_pos] @current_pos += 1 @current_proc = cmd if cmd_args[0].kind_of? Proc #c = cmd_args.shift #cb_args = c.call(*(cmd_args + args)) cb_args = cmd_args[0].call(*args) else cb_args = cmd_args end set_callback(sleep, cb_args) end def initialize(*args) @id = format("a%.4d", Tk_CBID[0]) Tk_CBID[0] += 1 @set_next = true @init_sleep = 0 @init_proc = nil @init_args = [] @current_script = [] @current_proc = nil @current_args = nil @sleep_time = 0 @current_sleep = 0 @loop_exec = 0 @do_loop = 0 @loop_proc = [] @proc_max = 0 @current_pos = 0 @after_id = nil @after_script = nil set_procs(*args) if args != [] @running = false end attr :after_id attr :after_script attr :current_proc attr :current_sleep attr_accessor :loop_exec def get_procs [@init_sleep, @init_proc, @init_args, @sleep_time, @loop_exec, @loop_proc] end def current_status [@running, @current_sleep, @current_proc, @current_args, @do_loop] end def running? @running end def loop_rest @do_loop end def loop_rest=(rest) @do_loop = rest end def set_procs(interval, loop_exec, *procs) if !interval == 'idle' \ && !interval.kind_of?(Integer) && !interval.kind_of?(Proc) fail format("%s need to be Integer or Proc", interval.inspect) end @sleep_time = interval @loop_proc = [] procs.each{|e| if e.kind_of? Proc @loop_proc.push([e]) else @loop_proc.push(e) end } @proc_max = @loop_proc.size @current_pos = 0 @do_loop = 0 if loop_exec if loop_exec.kind_of?(Integer) && loop_exec < 0 @loop_exec = -1 elsif loop_exec == nil || loop_exec == false || loop_exec == 0 @loop_exec = 1 else if not loop_exec.kind_of?(Integer) fail format("%s need to be Integer", loop_exec.inspect) end @loop_exec = loop_exec end @do_loop = @loop_exec end self end def add_procs(*procs) procs.each{|e| if e.kind_of? Proc @loop_proc.push([e]) else @loop_proc.push(e) end } @proc_max = @loop_proc.size self end def set_start_proc(sleep, init_proc, *init_args) if !sleep == 'idle' && !sleep.kind_of?(Integer) fail format("%s need to be Integer", sleep.inspect) end @init_sleep = sleep @init_proc = init_proc @init_args = init_args self end def start(*init_args) return nil if @running Tk_CBTBL[@id] = self @do_loop = @loop_exec @current_pos = 0 argc = init_args.size if argc > 0 sleep = init_args.shift if !sleep == 'idle' && !sleep.kind_of?(Integer) fail format("%s need to be Integer", sleep.inspect) end @init_sleep = sleep end @init_proc = init_args.shift if argc > 1 @init_args = init_args if argc > 0 @current_sleep = @init_sleep @running = true if @init_proc if not @init_proc.kind_of? Proc fail format("%s need to be Proc", @init_proc.inspect) end @current_proc = @init_proc set_callback(sleep, @init_args) @set_next = false if @in_callback else set_next_callback(*@init_args) end self end def restart(*restart_args) cancel if @running if restart_args == [] start(@init_sleep, @init_proc, *@init_args) else start(*restart_args) end end def cancel @running = false tk_call 'after', 'cancel', @after_id if @after_id @after_id = nil Tk_CBTBL[@id] = nil ;# for GC self end alias stop cancel def continue(wait=nil) sleep, cmd = @current_script return nil if cmd == nil || @running == true if wait if not wait.kind_of? Integer fail format("%s need to be Integer", wait.inspect) end sleep = wait end Tk_CBTBL[@id] = self @running = true @after_id = tk_call('after', sleep, cmd) self end def skip return nil if @running == false cancel Tk_CBTBL[@id] = self @running = true set_next_callback(@current_args) self end def info if @after_id inf = tk_split_list(tk_call('after', 'info', @after_id)) [Tk_CBTBL[inf[0][1]], inf[1]] else nil end end end ruby-1.2.3/ext/tk/lib/tkbgerror.rb100644 774 145 502 6553343456 15037 0ustar matzNaCl# # tkbgerror -- bgerror ( tkerror ) module # 1998/07/16 by Hidetoshi Nagai # require 'tk' module TkBgError extend Tk def bgerror(message) tk_call 'bgerror', message end alias tkerror bgerror alias show bgerror module_function :bgerror, :tkerror, :show end ruby-1.2.3/ext/tk/lib/tkcanvas.rb100644 774 145 42012 6624237014 14701 0ustar matzNaCl# # tkcanvas.rb - Tk canvas classes # $Date: 1998/11/17 09:12:44 $ # by Yukihiro Matsumoto # $Date: 1998/11/17 09:12:44 $ # by Hidetoshi Nagai require "tk" require 'tkfont' module TkTreatCItemFont def tagfont_configinfo(tagOrId) if tagOrId.kind_of?(TkcItem) || tagOrId.kind_of?(TkcTag) pathname = self.path + ';' + tagOrId.id.to_s else pathname = self.path + ';' + tagOrId.to_s end ret = TkFont.used_on(pathname) if ret == nil ret = TkFont.init_widget_font(pathname, self.path, 'itemconfigure', tagOrId) end ret end alias tagfontobj tagfont_configinfo def tagfont_configure(tagOrId, slot) if tagOrId.kind_of?(TkcItem) || tagOrId.kind_of?(TkcTag) pathname = self.path + ';' + tagOrId.id.to_s else pathname = self.path + ';' + tagOrId.to_s end if (fnt = slot['font']) slot['font'] = nil if fnt.kind_of? TkFont return fnt.call_font_configure(pathname, self.path,'itemconfigure',tagOrId,slot) else latintagfont_configure(tagOrId, fnt) if fnt end end if (ltn = slot['latinfont']) slot['latinfont'] = nil latintagfont_configure(tagOrId, ltn) if ltn end if (ltn = slot['asciifont']) slot['asciifont'] = nil latintagfont_configure(tagOrId, ltn) if ltn end if (knj = slot['kanjifont']) slot['kanjifont'] = nil kanjitagfont_configure(tagOrId, knj) if knj end tk_call(self.path, 'itemconfigure', tagOrId, *hash_kv(slot)) if slot != {} self end def latintagfont_configure(tagOrId, ltn, keys=nil) fobj = tagfontobj(tagOrId) if ltn.kind_of? TkFont conf = {} ltn.latin_configinfo.each{|key,val| conf[key] = val if val != []} if conf == {} fobj.latin_replace(ltn) fobj.latin_configure(keys) if keys elsif keys fobj.latin_configure(conf.update(keys)) else fobj.latin_configure(conf) end else fobj.latin_replace(ltn) end end alias asciitagfont_configure latintagfont_configure def kanjitagfont_configure(tagOrId, knj, keys=nil) fobj = tagfontobj(tagOrId) if knj.kind_of? TkFont conf = {} knj.kanji_configinfo.each{|key,val| conf[key] = val if val != []} if conf == {} fobj.kanji_replace(knj) fobj.kanji_configure(keys) if keys elsif keys fobj.kanji_configure(conf.update(keys)) else fobj.kanji_configure(conf) end else fobj.kanji_replace(knj) end end def tagfont_copy(tagOrId, window, wintag=nil) if wintag window.tagfontobj(wintag).configinfo.each{|key,value| tagfontobj(tagOrId).configure(key,value) } tagfontobj(tagOrId).replace(window.tagfontobj(wintag).latin_font, window.tagfontobj(wintag).kanji_font) else window.tagfont(tagOrId).configinfo.each{|key,value| tagfontobj(tagOrId).configure(key,value) } tagfontobj(tagOrId).replace(window.fontobj.latin_font, window.fontobj.kanji_font) end end def latintagfont_copy(tagOrId, window, wintag=nil) if wintag tagfontobj(tagOrId).latin_replace(window.tagfontobj(wintag).latin_font) else tagfontobj(tagOrId).latin_replace(window.fontobj.latin_font) end end alias asciitagfont_copy latintagfont_copy def kanjitagfont_copy(tagOrId, window, wintag=nil) if wintag tagfontobj(tagOrId).kanji_replace(window.tagfontobj(wintag).kanji_font) else tagfontobj(tagOrId).kanji_replace(window.fontobj.kanji_font) end end end class TkCanvas", id rescue uninstall_cmd(cmd) fail end # @cmdtbl.push id end def itembindinfo(tag, context=nil) if context (tk_send('bind', tagid(tag), "<#{tk_event_sequence(context)}>")).collect{|cmdline| if cmdline =~ /^rb_out (c\d+)\s+(.*)$/ [Tk_CMDTBL[$1], $2] else cmdline end } else tk_split_list(tk_send 'bind', tagid(tag)).filter{|seq| seq[1..-2].gsub(/>value}) else tk_send 'itemconfigure', tagid(tagOrId), "-#{key}", value end end end # def itemconfigure(tagOrId, key, value=None) # if key.kind_of? Hash # tk_send 'itemconfigure', tagid(tagOrId), *hash_kv(key) # else # tk_send 'itemconfigure', tagid(tagOrId), "-#{key}", value # end # end # def itemconfigure(tagOrId, keys) # tk_send 'itemconfigure', tagid(tagOrId), *hash_kv(keys) # end def itemconfiginfo(tagOrId, key=nil) if key conf = tk_split_list(tk_send 'itemconfigure', tagid(tagOrId), "-#{key}") conf[0] = conf[0][1..-1] conf else tk_split_list(tk_send 'itemconfigure', tagid(tagOrId)).collect{|conf| conf[0] = conf[0][1..-1] conf } end end def lower(tag, below=None) tk_send 'lower', tagid(tag), below end def move(tag, x, y) tk_send 'move', tagid(tag), x, y end def postscript(keys) tk_send "postscript", *hash_kv(keys) end def raise(tag, above=None) tk_send 'raise', tagid(tag), above end def scale(tag, x, y, xs, ys) tk_send 'scale', tagid(tag), x, y, xs, ys end def scan_mark(x, y) tk_send 'scan', 'mark', x, y end def scan_dragto(x, y) tk_send 'scan', 'dragto', x, y end def select(mode, *args) tk_send 'select', mode, *args end def select_adjust(tagOrId, index) select('adjust', tagid(tagOrId), index) end def select_clear select('clear') end def select_from(tagOrId, index) select('from', tagid(tagOrId), index) end def select_item select('item') end def select_to(tagOrId, index) select('to', tagid(tagOrId), index) end def itemtype(tag) TkcItem.type2class(tk_send 'type', tagid(tag)) end def xview(*index) tk_send 'xview', *index end def yview(*index) tk_send 'yview', *index end end module TkcTagAccess include TkComm include TkTreatTagFont def addtag(tag) @c.addtag(tag, 'with', @id) end def bbox @c.bbox(@id) end def bind(seq, cmd=Proc.new, args=nil) @c.itembind @id, seq, cmd, args end def bindinfo(seq=nil) @c.itembindinfo @id, seq end def cget(option) @c.itemcget @id, option end def configure(key, value=None) @c.itemconfigure @id, key, value end # def configure(keys) # @c.itemconfigure @id, keys # end def configinfo(key=nil) @c.itemconfiginfo @id, key end def coords(*args) @c.coords @id, *args end def dchars(first, last=None) @c.dchars @id, first, last end def dtag(tag_to_del=None) @c.dtag @id, tag_to_del end def find @c.find 'withtag', @id end alias list find def focus @c.itemfocus @id end def gettags @c.gettags @id end def icursor(index) @c.icursor @id, index end def index(index) @c.index @id, index end def insert(beforethis, string) @c.insert @id, beforethis, string end def lower(belowthis=None) @c.lower @id, belowthis end def move(xamount, yamount) @c.move @id, xamount, yamount end def raise(abovethis=None) @c.raise @id, abovethis end def scale(xorigin, yorigin, xscale, yscale) @c.scale @id, xorigin, yorigin, xscale, yscale end def select_adjust(index) @c.select('adjust', @id, index) end def select_from(index) @c.select('from', @id, index) end def select_to(index) @c.select('to', @id, index) end def itemtype @c.itemtype @id end end class TkcTag require "tk" TopLevel = TkToplevel Frame = TkFrame Label = TkLabel Button = TkButton Radiobutton = TkRadioButton Checkbutton = TkCheckButton Message = TkMessage Entry = TkEntry Text = TkText Scale = TkScale Scrollbar = TkScrollbar Listbox = TkListbox Menu = TkMenu Menubutton = TkMenubutton Canvas = TkCanvas Arc = TkcArc Bitmap = TkcBitmap Line = TkcLine Oval = TkcOval Polygon = TkcPolygon Rectangle = TkcRectangle TextItem = TkcText WindowItem = TkcWindow Selection = TkSelection Winfo = TkWinfo Pack = TkPack Variable = TkVariable def Mainloop Tk.mainloop end ruby-1.2.3/ext/tk/lib/tkdialog.rb100644 774 145 6071 6553523426 14660 0ustar matzNaClrequire "tk" class TkDialog < TkWindow extend Tk # initialize tk_dialog def initialize(keys = nil) super() @var = TkVariable.new id = @var.id @title = title @message = message @message_config = message_config @bitmap = bitmap @bitmap_config = message_config @default_button = default_button @buttons = buttons @button_configs = proc{|num| button_configs num} if keys.kind_of? Hash @title = keys['title'] if keys['title'] @message = keys['message'] if keys['message'] @bitmap = keys['bitmap'] if keys['bitmap'] @default_button = keys['default'] if keys['default'] @buttons = keys['buttons'] if keys['buttons'] @command = keys['prev_command'] @message_config = keys['message_config'] if keys['message_config'] @bitmap_config = keys['bitmap_config'] if keys['bitmap_config'] @button_configs = keys['button_configs'] if keys['button_configs'] end if @title.include? ?\s @title = '{' + @title + '}' end @buttons = tk_split_list(@buttons) if @buttons.kind_of? String @buttons = @buttons.collect{|s| if s.kind_of? Array s = s.join(' ') end if s.include? ?\s '{' + s + '}' else s end } config = "" if @message_config.kind_of? Hash config << format("%s.msg configure %s\n", @path, hash_kv(@message_config).join(' ')) end if @bitmap_config.kind_of? Hash config << format("%s.msg configure %s\n", @path, hash_kv(@bitmap_config).join(' ')) end if @button_configs.kind_of? Proc @buttons.each_index{|i| if (c = @button_configs.call(i)).kind_of? Hash config << format("%s.button%s configure %s\n", @path, i, hash_kv(c).join(' ')) end } end config = 'after idle {' + config + '};' if config != "" if @command.kind_of? Proc @command.call(self) end INTERP._eval('eval {global '+id+';'+config+ 'set '+id+' [tk_dialog '+ @path+" "+@title+" {#{@message}} "+@bitmap+" "+ String(@default_button)+" "+@buttons.join(' ')+']}') end def value return @var.value.to_i end ###################################################### # # # these methods must be overridden for each dialog # # # ###################################################### def title return "DIALOG" end def message return "MESSAGE" end def message_config return nil end def bitmap return "info" end def bitmap_config return nil end def default_button return 0 end def buttons #return "BUTTON1 BUTTON2" return ["BUTTON1", "BUTTON2"] end def button_configs(num) return nil end end # # dialog for warning # class TkWarning < TkDialog def initialize(mes) @mes = mes super() end def message return @mes end def title return "WARNING"; end def bitmap return "warning"; end def default_button return 0; end def buttons return "OK"; end end ruby-1.2.3/ext/tk/lib/tkentry.rb100644 774 145 2615 6624237014 14554 0ustar matzNaCl# # tkentry.rb - Tk entry classes # $Date: 1998/11/17 09:12:44 $ # by Yukihiro Matsumoto require 'tk.rb' class TkEntry@latinfont, 'kanjifont'=>@kanjifont} else @compoundfont = @latinfont @fontslot = {'font'=>@latinfont} end end def create_latinfont_tk8x(font) @latinfont = @id + 'l' if JAPANIZED_TK if font.kind_of? Hash tk_call('font', 'create', @latinfont, *hash_kv(font)) elsif font.kind_of? Array tk_call('font', 'create', @latinfont, '-copy', array2tk_list(font)) elsif font.kind_of? TkFont tk_call('font', 'create', @latinfont, '-copy', font.latin_font) else tk_call('font', 'create', @latinfont, '-copy', font) end else if font.kind_of? Hash tk_call('font', 'create', @latinfont, *hash_kv(font)) else keys = {} if font.kind_of? Array actual_core(array2tk_list(font)).each{|key,val| keys[key] = val} elsif font.kind_of? TkFont actual_core(font.latin_font).each{|key,val| keys[key] = val} else actual_core(font).each{|key,val| keys[key] = val} end tk_call('font', 'create', @latinfont, *hash_kv(keys)) end end end def create_kanjifont_tk80(font) unless JAPANIZED_TK @kanjifont = "" return end @kanjifont = @id + 'k' if font.kind_of? Hash if font['charset'] tk_call('font', 'create', @kanjifont, *hash_kv(font)) else tk_call('font', 'create', @kanjifont, '-charset', 'jisx0208.1983', *hash_kv(font)) end elsif font.kind_of? Array tk_call('font', 'create', @kanjifont, '-copy', array2tk_list(font)) tk_call('font', 'configure', @kanjifont, '-charset', 'jisx0208.1983') elsif font.kind_of? TkFont tk_call('font', 'create', @kanjifont, '-copy', font.kanji_font) else tk_call('font', 'create', @kanjifont, '-copy', font, '-charset', 'jisx0208.1983') end end def create_kanjifont_tk81(font) @kanjifont = @id + 'k' if font.kind_of? Hash tk_call('font', 'create', @kanjifont, *hash_kv(font)) else keys = {} if font.kind_of? Array actual_core(array2tk_list(font)).each{|key,val| keys[key] = val} elsif font.kind_of? TkFont actual_core(font.kanji_font).each{|key,val| keys[key] = val} else actual_core(font).each{|key,val| keys[key] = val} end tk_call('font', 'create', @kanjifont, *hash_kv(keys)) end keys = {} actual_core(@kanjifont).each{|key,val| keys[key] = val} begin tk_call('font', 'configure', @compoundfont, *hash_kv(keys)) rescue end end def create_compoundfont_tk80(keys) @compoundfont = @id + 'c' if JAPANIZED_TK @fontslot = {'font'=>@compoundfont} tk_call('font', 'create', @compoundfont, '-compound', [@latinfont, @kanjifont], *hash_kv(keys)) else tk_call('font', 'create', @compoundfont) latinkeys = {} begin actual_core(@latinfont).each{|key,val| latinkeys[key] = val} rescue latinkeys {} end if latinkeys != {} tk_call('font', 'configure', @compoundfont, *hash_kv(latinkeys)) end @fontslot = {'font'=>@compoundfont} tk_call('font', 'configure', @compoundfont, *hash_kv(keys)) end end def create_compoundfont_tk81(keys) @compoundfont = @id + 'c' tk_call('font', 'create', @compoundfont) latinkeys = {} begin actual_core(@latinfont).each{|key,val| latinkeys[key] = val} rescue latinkeys {} end if latinkeys != {} tk_call('font', 'configure', @compoundfont, *hash_kv(latinkeys)) end kanjikeys = {} begin actual_core(@kanjifont).each{|key,val| kanjikeys[key] = val} rescue kanjikeys {} end if kanjikeys != {} tk_call('font', 'configure', @compoundfont, *hash_kv(kanjikeys)) end @fontslot = {'font'=>@compoundfont} tk_call('font', 'configure', @compoundfont, *hash_kv(keys)) end def actual_core_tk4x(font, window=nil, option=nil) # dummy if option "" else Array([ ['family',[]], ['size',[]], ['weight',[]], ['slant',[]], ['underline',[]], ['overstrike',[]], ['charset',[]], ['pointadjust',[]] ]) end end def actual_core_tk8x(font, window=nil, option=nil) if option == 'compound' "" elsif option if window tk_call('font', 'actual', font, "-#{option}") else tk_call('font', 'actual', font, "-displayof", window, "-#{option}") end else l = tk_split_simplelist(if window tk_call('font', 'actual', font, "-displayof", window) else tk_call('font', 'actual', font) end) r = [] while key=l.shift if key == '-compound' l.shift else r.push [key[1..-1], l.shift] end end r end end def configure_core_tk4x(font, slot, value=None) "" end def configinfo_core_tk4x(font, option=nil) # dummy if option "" else Array([ ['family',[]], ['size',[]], ['weight',[]], ['slant',[]], ['underline',[]], ['overstrike',[]], ['charset',[]], ['pointadjust',[]] ]) end end def configure_core_tk8x(font, slot, value=None) if slot.kind_of? Hash tk_call 'font', 'configure', font, *hash_kv(slot) else tk_call 'font', 'configure', font, "-#{slot}", value end end def configinfo_core_tk8x(font, option=nil) if option == 'compound' "" elsif option tk_call('font', 'configure', font, "-#{option}") else l = tk_split_simplelist(tk_call('font', 'configure', font)) r = [] while key=l.shift if key == '-compound' l.shift else r.push [key[1..-1], l.shift] end end r end end def delete_core_tk4x Tk_FontNameTBL[@id] = nil Tk_FontUseTBL.delete_if{|key,value| value == self} end def delete_core_tk8x begin tk_call('font', 'delete', @latinfont) rescue end begin tk_call('font', 'delete', @kanjifont) rescue end begin tk_call('font', 'delete', @compoundfont) rescue end Tk_FontNameTBL[@id] = nil Tk_FontUseTBL.delete_if{|key,value| value == self} end def latin_replace_core_tk4x(ltn) create_latinfont_tk4x(ltn) @compoundfont[0] = [@latinfont] if JAPANIZED_TK @fontslot['font'] = @latinfont Tk_FontUseTBL.dup.each{|w, fobj| if self == fobj begin if w.include?(';') win, tag = w.split(';') winobj = tk_tcl2ruby(win) # winobj.tagfont_configure(tag, {'font'=>@latinfont}) if winobj.kind_of? TkText tk_call(win, 'tag', 'configure', tag, '-font', @latinfont) elsif winobj.kind_of? TkCanvas tk_call(win, 'itemconfigure', tag, '-font', @latinfont) elsif winobj.kind_of? TkMenu tk_call(win, 'entryconfigure', tag, '-font', @latinfont) else raise RuntimeError, "unknown widget type" end else # tk_tcl2ruby(w).font_configure('font'=>@latinfont) tk_call(w, 'configure', '-font', @latinfont) end rescue Tk_FontUseTBL[w] = nil end end } self end def kanji_replace_core_tk4x(knj) return self unless JAPANIZED_TK create_kanjifont_tk4x(knj) @compoundfont[1] = [@kanjifont] @fontslot['kanjifont'] = @kanjifont Tk_FontUseTBL.dup.each{|w, fobj| if self == fobj begin if w.include?(';') win, tag = w.split(';') winobj = tk_tcl2ruby(win) # winobj.tagfont_configure(tag, {'kanjifont'=>@kanjifont}) if winobj.kind_of? TkText tk_call(win, 'tag', 'configure', tag, '-kanjifont', @kanjifont) elsif winobj.kind_of? TkCanvas tk_call(win, 'itemconfigure', tag, '-kanjifont', @kanjifont) elsif winobj.kind_of? TkMenu tk_call(win, 'entryconfigure', tag, '-kanjifont', @latinfont) else raise RuntimeError, "unknown widget type" end else # tk_tcl2ruby(w).font_configure('kanjifont'=>@kanjifont) tk_call(w, 'configure', '-kanjifont', @kanjifont) end rescue Tk_FontUseTBL[w] = nil end end } self end def latin_replace_core_tk8x(ltn) begin tk_call('font', 'delete', @latinfont) rescue end create_latinfont(ltn) self end def kanji_replace_core_tk80(knj) return self unless JAPANIZED_TK begin tk_call('font', 'delete', @kanjifont) rescue end create_kanjifont(knj) self end def kanji_replace_core_tk81(knj) if font.kind_of? Hash tk_call('font', 'configure', @compoundfont, *hash_kv(font)) else keys = {} if font.kind_of? Array actual_core(array2tk_list(font)).each{|key,val| keys[key] = val} elsif font.kind_of? TkFont actual_core(font.latin_font).each{|key,val| keys[key] = val} else actual_core(font).each{|key,val| keys[key] = val} end tk_call('font', 'configure', @compoundfont, *hash_kv(keys)) end self end def measure_core_tk4x(window, text) 0 end def measure_core_tk8x(window, text) if window number(tk_call('font', 'measure', @compoundfont, '-displayof', window, text)) else number(tk_call('font', 'measure', @compoundfont, text)) end end def metrics_core_tk4x(font, window, option=nil) # dummy if option "" else Array([ ['ascent',[]], ['descent',[]], ['linespace',[]], ['fixed',[]] ]) end end def metrics_core_tk8x(font, window, option=nil) if option if window number(tk_call('font', 'metrics', font, "-#{option}")) else number(tk_call('font', 'metrics', font, "-displayof", window, "-#{option}")) end else l = tk_split_list(if window tk_call('font','metrics',font,"-displayof",window) else tk_call('font','metrics',font) end) r = [] while key=l.shift r.push [key[1..-1], l.shift.to_i] end r end end ################################### # private alias ################################### case (Tk::TK_VERSION) when /^4\.*/ alias create_latinfont create_latinfont_tk4x alias create_kanjifont create_kanjifont_tk4x alias create_compoundfont create_compoundfont_tk4x alias actual_core actual_core_tk4x alias configure_core configure_core_tk4x alias configinfo_core configinfo_core_tk4x alias delete_core delete_core_tk4x alias latin_replace_core latin_replace_core_tk4x alias kanji_replace_core kanji_replace_core_tk4x alias measure_core measure_core_tk4x alias metrics_core metrics_core_tk4x when /^8\.0/ alias create_latinfont create_latinfont_tk8x alias create_kanjifont create_kanjifont_tk80 alias create_compoundfont create_compoundfont_tk80 alias actual_core actual_core_tk8x alias configure_core configure_core_tk8x alias configinfo_core configinfo_core_tk8x alias delete_core delete_core_tk8x alias latin_replace_core latin_replace_core_tk8x alias kanji_replace_core kanji_replace_core_tk80 alias measure_core measure_core_tk8x alias metrics_core metrics_core_tk8x when /^8\.1/ alias create_latinfont create_latinfont_tk8x alias create_kanjifont create_kanjifont_tk81 alias create_compoundfont create_compoundfont_tk81 alias actual_core actual_core_tk8x alias configure_core configure_core_tk8x alias configinfo_core configinfo_core_tk8x alias delete_core delete_core_tk8x alias latin_replace_core latin_replace_core_tk8x alias kanji_replace_core kanji_replace_core_tk81 alias measure_core measure_core_tk8x alias metrics_core metrics_core_tk8x end ################################### public ################################### def call_font_configure(path, *args) args += hash_kv(args.pop.update(@fontslot)) tk_call *args Tk_FontUseTBL[path] = self self end def used ret = [] Tk_FontUseTBL.each{|key,value| if key.include?(';') win, tag = key.split(';') winobj = tk_tcl2ruby(win) if winobj.kind_of? TkText ret.push([winobj, winobj.tagid2obj(tag)]) elsif winobj.kind_of? TkCanvas if (tagobj = TkcTag.id2obj(tag)).kind_of? TkcTag ret.push([winobj, tagobj]) elsif (tagobj = TkcItem.id2obj(tag)).kind_of? TkcItem ret.push([winobj, tagobj]) else ret.push([winobj, tag]) end elsif winobj.kind_of? TkMenu ret.push([winobj, tag]) else ret.push([win, tag]) end else ret.push(tk_tcl2ruby(key)) if value == self end } ret end def id @id end def to_eval font end def font @compoundfont end def latin_font @latinfont end def kanji_font @kanjifont end def actual(option=nil) actual_core(@compoundfont, nil, option) end def actual_displayof(window, option=nil) window = '.' unless window actual_core(@compoundfont, window, option) end def latin_actual(option=nil) actual_core(@latinfont, nil, option) end def latin_actual_displayof(window, option=nil) window = '.' unless window actual_core(@latinfont, window, option) end def kanji_actual(option=nil) #if JAPANIZED_TK if @kanjifont != "" actual_core(@kanjifont, nil, option) else actual_core_tk4x(nil, nil, option) end end def kanji_actual_displayof(window, option=nil) #if JAPANIZED_TK if @kanjifont != "" window = '.' unless window actual_core(@kanjifont, window, option) else actual_core_tk4x(nil, window, option) end end def [](slot) configinfo slot end def []=(slot, val) configure slot, val end def configure(slot, value=None) configure_core(@compoundfont, slot, value) end def configinfo(slot=nil) configinfo_core(@compoundfont, slot) end def delete delete_core end def latin_configure(slot, value=None) if JAPANIZED_TK configure_core(@latinfont, slot, value) else configure(slot, value) end end def latin_configinfo(slot=nil) if JAPANIZED_TK configinfo_core(@latinfont, slot) else configure(slot, value) end end def kanji_configure(slot, value=None) #if JAPANIZED_TK if @kanjifont != "" configure_core(@kanjifont, slot, value) else #"" configure(slot, value) end end def kanji_configinfo(slot=nil) #if JAPANIZED_TK if @kanjifont != "" configinfo_core(@kanjifont, slot) else #[] configinfo(slot) end end def replace(ltn, knj) latin_replace(ltn) kanji_replace(knj) self end def latin_replace(ltn) latin_replace_core(ltn) end def kanji_replace(knj) kanji_replace_core(knj) end def measure(text) measure_core(nil, text) end def measure_displayof(window, text) window = '.' unless window measure_core(window, text) end def metrics(option=nil) metrics_core(@compoundfont, nil, option) end def metrics_displayof(window, option=nil) window = '.' unless window metrics_core(@compoundfont, window, option) end def latin_metrics(option=nil) metrics_core(@latinfont, nil, option) end def latin_metrics_displayof(window, option=nil) window = '.' unless window metrics_core(@latinfont, window, option) end def kanji_metrics(option=nil) if JAPANIZED_TK metrics_core(@kanjifont, nil, option) else metrics_core_tk4x(nil, nil, option) end end def kanji_metrics_displayof(window, option=nil) if JAPANIZED_TK window = '.' unless window metrics_core(@kanjifont, window, option) else metrics_core_tk4x(nil, window, option) end end ################################### # public alias ################################### alias ascii_font latin_font alias create_asciifont create_latinfont alias ascii_actual latin_actual alias ascii_actual_displayof latin_actual_displayof alias ascii_configure latin_configure alias ascii_configinfo latin_configinfo alias ascii_replace latin_replace alias ascii_metrics latin_metrics end module TkTreatTagFont def font_configinfo @parent.tagfont_configinfo(@id) end alias font font_configinfo def font_configure(slot) @parent.tagfont_configure(@id, slot) end def latinfont_configure(ltn, keys=nil) @parent.latintagfont_configure(@id, ltn, keys) end alias asciifont_configure latinfont_configure def kanjifont_configure(knj, keys=nil) @parent.kanjitagfont_configure(@id, ltn, keys) end def font_copy(window, wintag=nil) @parent.tagfont_copy(@id, window, wintag) end def latinfont_copy(window, wintag=nil) @parent.latintagfont_copy(@id, window, wintag) end alias asciifont_copy latinfont_copy def kanjifont_copy(window, wintag=nil) @parent.kanjitagfont_copy(@id, window, wintag) end end ruby-1.2.3/ext/tk/lib/tkmenubar.rb100644 774 145 6677 6461536523 15066 0ustar matzNaCl# # tkmenubar.rb # # Copyright (C) 1998 maeda shugo. All rights reserved. # This file can be distributed under the terms of the Ruby. # Usage: # # menu_spec = [ # [['File', 0], # ['Open', proc{puts('Open clicked')}, 0], # '---', # ['Quit', proc{exit}, 0]], # [['Edit', 0], # ['Cut', proc{puts('Cut clicked')}, 2], # ['Copy', proc{puts('Copy clicked')}, 0], # ['Paste', proc{puts('Paste clicked')}, 0]] # ] # menubar = TkMenubar.new(nil, menu_spec, # 'tearoff'=>false, # 'foreground'=>'grey40', # 'activeforeground'=>'red', # 'font'=>'-adobe-helvetica-bold-r-*--12-*-iso8859-1') # menubar.pack('side'=>'top', 'fill'=>'x') # # # OR # # # menubar = TkMenubar.new # menubar.add_menu([['File', 0], # ['Open', proc{puts('Open clicked')}, 0], # '---', # ['Quit', proc{exit}, 0]]) # menubar.add_menu([['Edit', 0], # ['Cut', proc{puts('Cut clicked')}, 2], # ['Copy', proc{puts('Copy clicked')}, 0], # ['Paste', proc{puts('Paste clicked')}, 0]]) # menubar.configure('tearoff', false) # menubar.configure('foreground', 'grey40') # menubar.configure('activeforeground', 'red') # menubar.configure('font', '-adobe-helvetica-bold-r-*--12-*-iso8859-1') # menubar.pack('side'=>'top', 'fill'=>'x') # The format of the menu_spec is: # [ # [ # [button text, underline, accelerator], # [menu label, command, underline, accelerator], # '---', # separator # ... # ], # ... # ] # underline and accelerator are optional parameters. # Hashes are OK instead of Arrays. # To use add_menu, configuration must be done by calling configure after # adding all menus by add_menu, not by the constructor arguments. require "tk" class TkMenubar item_info) end end mbtn.menu(menu) @menus.push([mbtn, menu]) delegate('tearoff', menu) delegate('foreground', mbtn, menu) delegate('background', mbtn, menu) delegate('disabledforeground', mbtn, menu) delegate('activeforeground', mbtn, menu) delegate('activebackground', mbtn, menu) delegate('font', mbtn, menu) delegate('kanjifont', mbtn, menu) mbtn.pack('side' => 'left') end def [](index) return @menus[index] end end ruby-1.2.3/ext/tk/lib/tkmngfocus.rb100644 774 145 1017 6553343456 15240 0ustar matzNaCl# # tkmngfocus.rb : methods for Tcl/Tk standard library 'focus.tcl' # 1998/07/16 by Hidetoshi Nagai # require 'tk' module TkManageFocus extend Tk def TkManageFocus.followsMouse tk_call 'tk_focusFollowsMouse' end def TkManageFocus.next(window) tk_call 'tk_focusNext', window end def focusNext TkManageFocus.next(self) end def TkManageFocus.prev(window) tk_call 'tk_focusPrev', window end def focusPrev TkManageFocus.prev(self) end end ruby-1.2.3/ext/tk/lib/tkpalette.rb100644 774 145 1730 6543607132 15050 0ustar matzNaCl# # tkpalette.rb : methods for Tcl/Tk standard library 'palette.tcl' # 1998/06/21 by Hidetoshi Nagai # require 'tk' module TkPalette include Tk extend Tk def TkPalette.set(*args) args = args.to_a.flatten if args.kind_of? Hash tk_call 'tk_setPalette', *args end def TkPalette.setPalette(*args) TkPalette.set(*args) end def TkPalette.bisque tk_call 'tk_bisque' end def TkPalette.darken(color, percent) tk_call 'tkDarken', color, percent end def TkPalette.recolorTree(window, colors) if not colors.kind_of?(Hash) fail "2nd arg need to be Hash" end colors.each{|key, value| begin if window.cget(key) == tk_call('set', "tkPalette(#{key})") window[key] = colors[key] end rescue # ignore end } TkWinfo.children(window).each{|w| TkPalette.recolorTree(w, colors)} end def recolorTree(colors) TkPalette.recolorTree(self, colors) end end ruby-1.2.3/ext/tk/lib/tkscrollbox.rb100644 774 145 1401 6624237014 15412 0ustar matzNaCl# # tkscrollbox.rb - Tk Listbox with Scrollbar # as an example of Composite Widget # $Date: 1998/11/17 09:12:44 $ # by Yukihiro Matsumoto require 'tk.rb' class TkScrollbox'left','fill'=>'both','expand'=>'yes' scroll.configure 'command', list.path+" yview" scroll.pack 'side'=>'right','fill'=>'y' delegate('DEFAULT', list) delegate('foreground', list) delegate('background', list, scroll) delegate('borderwidth', @frame) delegate('relief', @frame) end end ruby-1.2.3/ext/tk/lib/tktext.rb100644 774 145 44525 6624237014 14425 0ustar matzNaCl# # tktext.rb - Tk text classes # $Date: 1998/11/17 09:12:44 $ # by Yukihiro Matsumoto require 'tk.rb' require 'tkfont' module TkTreatTextTagFont def tagfont_configinfo(tag) if tag.kind_of? TkTextTag pathname = self.path + ';' + tag.id else pathname = self.path + ';' + tag end ret = TkFont.used_on(pathname) if ret == nil ret = TkFont.init_widget_font(pathname, self.path, 'tag', 'configure', tag) end ret end alias tagfontobj tagfont_configinfo def tagfont_configure(tag, slot) if tag.kind_of? TkTextTag pathname = self.path + ';' + tag.id else pathname = self.path + ';' + tag end if (fnt = slot['font']) slot['font'] = nil if fnt.kind_of? TkFont return fnt.call_font_configure(pathname, self.path,'tag','configure',tag,slot) else latintagfont_configure(tag, fnt) if fnt end end if (ltn = slot['latinfont']) slot['latinfont'] = nil latintagfont_configure(tag, ltn) if ltn end if (ltn = slot['asciifont']) slot['asciifont'] = nil latintagfont_configure(tag, ltn) if ltn end if (knj = slot['kanjifont']) slot['kanjifont'] = nil kanjitagfont_configure(tag, knj) if knj end tk_call(self.path, 'tag', 'configure', tag, *hash_kv(slot)) if slot != {} self end def latintagfont_configure(tag, ltn, keys=nil) fobj = tagfontobj(tag) if ltn.kind_of? TkFont conf = {} ltn.latin_configinfo.each{|key,val| conf[key] = val if val != []} if conf == {} fobj.latin_replace(ltn) fobj.latin_configure(keys) if keys elsif keys fobj.latin_configure(conf.update(keys)) else fobj.latin_configure(conf) end else fobj.latin_replace(ltn) end end alias asciitagfont_configure latintagfont_configure def kanjitagfont_configure(tag, knj, keys=nil) fobj = tagfontobj(tag) if knj.kind_of? TkFont conf = {} knj.kanji_configinfo.each{|key,val| conf[key] = val if val != []} if conf == {} fobj.kanji_replace(knj) fobj.kanji_configure(keys) if keys elsif keys fobj.kanji_configure(conf.update(keys)) else fobj.kanji_configure(conf) end else fobj.kanji_replace(knj) end end def tagfont_copy(tag, window, wintag=nil) if wintag window.tagfontobj(wintag).configinfo.each{|key,value| tagfontobj(tag).configure(key,value) } tagfontobj(tag).replace(window.tagfontobj(wintag).latin_font, window.tagfontobj(wintag).kanji_font) else window.tagfont(wintag).configinfo.each{|key,value| tagfontobj(tag).configure(key,value) } tagfontobj(tag).replace(window.fontobj.latin_font, window.fontobj.kanji_font) end end def latintagfont_copy(tag, window, wintag=nil) if wintag tagfontobj(tag).latin_replace(window.tagfontobj(wintag).latin_font) else tagfontobj(tag).latin_replace(window.fontobj.latin_font) end end alias asciitagfont_copy latintagfont_copy def kanjitagfont_copy(tag, window, wintag=nil) if wintag tagfontobj(tag).kanji_replace(window.tagfontobj(wintag).kanji_font) else tagfontobj(tag).kanji_replace(window.fontobj.kanji_font) end end end class TkText", mode + id # _addcmd cmd end private :_tag_bind_core def tag_bind(tag, seq, cmd=Proc.new, args=nil) _tag_bind_core('', tag, seq, cmd=Proc.new, args=nil) end def tag_bind_append(tag, seq, cmd=Proc.new, args=nil) _tag_bind_core('+', tag, seq, cmd=Proc.new, args=nil) end def tag_bindinfo(tag, context=nil) if context (tk_send('tag', 'bind', tag, "<#{tk_event_sequence(context)}>")).collect{|cmdline| if cmdline =~ /^rb_out (c\d+)\s+(.*)$/ [Tk_CMDTBL[$1], $2] else cmdline end } else tk_split_list(tk_send('tag', 'bind', tag)).filter{|seq| seq[1..-2].gsub(/>val}) else tk_call 'tag', 'configure', tag, "-#{key}", val end end end def tag_configinfo(tag, key=nil) if key conf = tk_split_list(tk_send('tag','configure',tag,"-#{key}")) conf[0] = conf[0][1..-1] conf else tk_split_list(tk_send('tag', 'configure', tag)).collect{|conf| conf[0] = conf[0][1..-1] conf } end end def tag_raise(tag, above=None) tk_send 'tag', 'raise', tag, above end def tag_lower(tag, below=None) tk_send 'tag', 'lower', tag, below end def tag_remove(tag, *index) tk_send 'tag', 'remove', tag, *index end def tag_ranges(tag) l = tk_split_list(tk_send('tag', 'ranges', tag)) r = [] while key=l.shift r.push [key, l.shift] end r end def tag_nextrange(tag, first, last=None) tk_split_list(tk_send('tag', 'nextrange', tag, first, last)) end def tag_prevrange(tag, first, last=None) tk_split_list(tk_send('tag', 'prevrange', tag, first, last)) end def search_with_length(pat,start,stop=None) pat = pat.char if pat.kind_of? Integer if stop != None return ["", 0] if compare(start,'>=',stop) txt = get(start,stop) if (pos = txt.index(pat)) pos = txt[0..(pos-1)].split('').length if pos > 0 if pat.kind_of? String return [index(start + " + #{pos} chars"), pat.split('').length] else return [index(start + " + #{pos} chars"), $&.split('').length] end else return ["", 0] end else txt = get(start,'end - 1 char') if (pos = txt.index(pat)) pos = txt[0..(pos-1)].split('').length if pos > 0 if pat.kind_of? String return [index(start + " + #{pos} chars"), pat.split('').length] else return [index(start + " + #{pos} chars"), $&.split('').length] end else txt = get('1.0','end - 1 char') if (pos = txt.index(pat)) pos = txt[0..(pos-1)].split('').length if pos > 0 if pat.kind_of? String return [index("1.0 + #{pos} chars"), pat.split('').length] else return [index("1.0 + #{pos} chars"), $&.split('').length] end else return ["", 0] end end end end def search(pat,start,stop=None) search_with_length(pat,start,stop)[0] end def rsearch_with_length(pat,start,stop=None) pat = pat.char if pat.kind_of? Integer if stop != None return ["", 0] if compare(start,'<=',stop) txt = get(stop,start) if (pos = txt.rindex(pat)) pos = txt[0..(pos-1)].split('').length if pos > 0 if pat.kind_of? String return [index(stop + " + #{pos} chars"), pat.split('').length] else return [index(stop + " + #{pos} chars"), $&.split('').length] end else return ["", 0] end else txt = get('1.0',start) if (pos = txt.rindex(pat)) pos = txt[0..(pos-1)].split('').length if pos > 0 if pat.kind_of? String return [index("1.0 + #{pos} chars"), pat.split('').length] else return [index("1.0 + #{pos} chars"), $&.split('').length] end else txt = get('1.0','end - 1 char') if (pos = txt.rindex(pat)) pos = txt[0..(pos-1)].split('').length if pos > 0 if pat.kind_of? String return [index("1.0 + #{pos} chars"), pat.split('').length] else return [index("1.0 + #{pos} chars"), $&.split('').length] end else return ["", 0] end end end end def rsearch(pat,start,stop=None) rsearch_with_length(pat,start,stop)[0] end end class TkTextTag", id # @t._addcmd cmd end def bindinfo(context=nil) if context (tk_call(@t.path, 'tag', 'bind', @id, "<#{tk_event_sequence(context)}>")).collect{|cmdline| if cmdline =~ /^rb_out (c\d+)\s+(.*)$/ [Tk_CMDTBL[$1], $2] else cmdline end } else tk_split_list(tk_call(@t.path, 'tag', 'bind', @id)).filter{|seq| seq[1..-2].gsub(/> 0 tk_call @t.path, 'window', 'configure', @index, *hash_kv(slot) end else @id = value if slot == 'window' if slot == 'create' self.create=value else tk_call @t.path, 'window', 'configure', @index, "-#{slot}", value end end end def window @id end def window=(value) tk_call @t.path, 'window', 'configure', @index, '-window', value @id = value end def create @p_create end def create=(value) @p_create = value if @p_create.kind_of? Proc value = install_cmd(proc{@id = @p_create.call}) end tk_call @t.path, 'window', 'configure', @index, '-create', value end def configinfo(slot = nil) if slot conf = tk_split_list(tk_call @t.path, 'window', 'configure', @index, "-#{slot}") conf[0] = conf[0][1..-1] conf else tk_split_list(tk_call @t.path, 'window', 'configure', @index).collect{|conf| conf[0] = conf[0][1..-1] conf } end end end class TkTextImage # require 'tk' class TkVirtualEvent", TkVirturlEventID[0]) TkVirturlEventID[0] += 1 add(*sequences) end def add(*sequences) if sequences != [] tk_call('event', 'add', "<#{@id}>", *(sequences.collect{|seq| "<#{tk_event_sequence(seq)}>"}) ) TkVirturlEventTBL[@id] = self end self end def delete(*sequences) if sequences == [] tk_call('event', 'delete', "<#{@id}>") TkVirturlEventTBL[@id] = nil else tk_call('event', 'delete', "<#{@id}>", *(sequences.collect{|seq| "<#{tk_event_sequence(seq)}>"}) ) TkVirturlEventTBL[@id] = nil if info == [] end self end def info tk_call('event', 'info', "<#{@id}>").split(/\s+/).filter{|seq| l = seq.scan(/<*[^<>]+>*/).filter{|subseq| case (subseq) when /^<<[^<>]+>>$/ TkVirtualEvent.getobj(subseq[1..-2]) when /^<[^<>]+>$/ subseq[1..-2] else subseq.split('') end }.flatten (l.size == 1) ? l[0] : l } end end ruby-1.2.3/ext/tk/sample/ 40755 774 145 0 6662164600 13143 5ustar matzNaClruby-1.2.3/ext/tk/sample/tkbiff.rb100644 774 145 4720 6457556237 15052 0ustar matzNaCl#! /usr/local/bin/ruby if ARGV[0] != '-d' unless $DEBUG exit if fork end else ARGV.shift end if ARGV.length == 0 if ENV['MAIL'] $spool = ENV['MAIL'] else $spool = '/usr/spool/mail/' + ENV['USER'] end else $spool = ARGV[0] end require "parsedate" require "base64" include ParseDate class Mail def Mail.new(f) if !f.kind_of?(IO) f = open(f, "r") me = super f.close else me = super end return me end def initialize(f) @header = {} @body = [] while f.gets() $_.chop! next if /^From / # skip From-line break if /^$/ # end of header if /^(\S+):\s*(.*)/ @header[attr = $1.capitalize] = $2 elsif attr sub(/^\s*/, '') @header[attr] += "\n" + $_ end end return if ! $_ while f.gets() break if /^From / @body.push($_) end end def header return @header end def body return @body end end require "tkscrollbox" $top = TkRoot.new $top.withdraw $list = TkScrollbox.new($top) { relief 'raised' width 80 height 8 setgrid 'yes' pack } TkButton.new($top) { text 'Dismiss' command proc {$top.withdraw} pack('fill'=>'both','expand'=>'yes') } $top.bind "Control-c", proc{exit} $top.bind "Control-q", proc{exit} $top.bind "space", proc{exit} $spool_size = 0 $check_time = Time.now def check $check_time = Time.now size = File.size($spool) if size and size != $spool_size $spool_size = size pop_up if size > 0 end Tk.after 5000, proc{check} end if defined? Thread Thread.start do loop do sleep 600 if Time.now - $check_time > 200 Tk.after 5000, proc{check} end end end end def pop_up outcount = 0; $list.delete 0, 'end' f = open($spool, "r") while !f.eof? mail = Mail.new(f) date, from, subj = mail.header['Date'], mail.header['From'], mail.header['Subject'] next if !date y = m = d = 0 y, m, d = parsedate(date) if date from = "sombody@somewhere" if ! from subj = "(nil)" if ! subj from = decode_b(from) subj = decode_b(subj) $list.insert 'end', format('%-02d/%02d/%02d [%-28.28s] %s',y,m,d,from,subj) outcount += 1 end f.close if outcount == 0 $list.insert 'end', "You have no mail." else $list.see 'end' end $top.deiconify Tk.after 2000, proc{$top.withdraw} end $list.insert 'end', "You have no mail." check Tk.after 2000, proc{$top.withdraw} begin Tk.mainloop rescue `echo #$! > /tmp/tkbiff` end ruby-1.2.3/ext/tk/sample/tkbrowse.rb100644 774 145 3340 6533464646 15437 0ustar matzNaCl#!/usr/local/bin/ruby # # This script generates a directory browser, which lists the working # directory and allows you to open files or subdirectories by # double-clicking. # Create a scrollbar on the right side of the main window and a listbox # on the left side. require "tkscrollbox" # The procedure below is invoked to open a browser on a given file; if the # file is a directory then another instance of this program is invoked; if # the file is a regular file then the Mx editor is invoked to display # the file. $dirlist = {} def browsedir (dir) if $dirlist.key? dir $dirlist[dir] else top = if $dirlist.size > 0 then TkToplevel.new else nil end list = TkScrollbox.new(top) { relief 'raised' width 20 height 20 setgrid 'yes' pack } list.insert 'end', *`ls #{dir}`.split # Set up bindings for the browser. list.focus list.bind "Control-q", proc{exit} list.bind "Control-c", proc{exit} list.bind "Control-p", proc{ print "selection <", TkSelection.get, ">\n" } list.bind "Double-Button-1", proc{ for i in TkSelection.get.split print "clicked ", i, "\n" browse dir, i end } $dirlist[dir] = list end end def browse (dir, file) file="#{dir}/#{file}" if File.directory? file browsedir(file) else if File.file? file if ENV['EDITOR'] system format("%s %s&", ENV['EDITOR'], file) else system "xedit #{file}&" end else STDERR.print "\"#{file}\" isn't a directory or regular file" end end end # Fill the listbox with a list of all the files in the directory (run # the "ls" command to get that information). if ARGV.length>0 dir = ARGV[0] else dir="." end browsedir(dir) Tk.mainloop ruby-1.2.3/ext/tk/sample/tkdialog.rb100644 774 145 2723 6457556237 15404 0ustar matzNaCl#! /usr/local/bin/ruby require "tk" root = TkFrame.new top = TkFrame.new(root) { relief 'raised' border 1 } msg = TkMessage.new(top) { text "File main.c hasn't been saved to disk since \ it was last modified. What should I do?" justify 'center' aspect 200 font '-Adobe-helvetica-medium-r-normal--*-240*' pack('padx'=>5, 'pady'=>5, 'expand'=>'yes') } top.pack('fill'=>'both') root.pack bot = TkFrame.new(root) { relief 'raised' border 1 } TkFrame.new(bot) { |left| relief 'sunken' border 1 pack('side'=>'left', 'expand'=>'yes', 'padx'=>10, 'pady'=> 10) TkButton.new(left) { text "Save File" command "quit 'save'" pack('expand'=>'yes','padx'=>6,'pady'=> 6) top.bind "Enter", proc{state 'active'} msg.bind "Enter", proc{state 'active'} bot.bind "Enter", proc{state 'active'} top.bind "Leave", proc{state 'normal'} msg.bind "Leave", proc{state 'normal'} bot.bind "Leave", proc{state 'normal'} Tk.root.bind "ButtonRelease-1", proc{quit 'save'} Tk.root.bind "Return", proc{quit 'save'} } } TkButton.new(bot) { text "Quit Anyway" command "quit 'quit'" pack('side'=>'left', 'expand'=>'yes', 'padx'=>10) } TkButton.new(bot) { text "Return To Editor" command "quit 'return'" pack('side'=>'left', 'expand'=>'yes', 'padx'=>10) } bot.pack root.pack('side'=>'top', 'fill'=>'both', 'expand'=>'yes') def quit(button) print "aaa\n" print "You pressed the \"#{button}\" button; bye-bye!\n" exit end Tk.mainloop ruby-1.2.3/ext/tk/sample/tkfrom.rb100644 774 145 4536 6467560344 15107 0ustar matzNaCl#! /usr/local/bin/ruby require "parsedate" require "base64" include ParseDate class Mail def Mail.new(f) if !f.kind_of?(IO) f = open(f, "r") me = super(f) f.close else me = super end return me end def initialize(f) @header = {} @body = [] while f.gets() $_.chop! next if /^From / # skip From-line break if /^$/ # end of header if /^(\S+):\s*(.*)/ @header[attr = $1.capitalize] = $2 elsif attr sub(/^\s*/, '') @header[attr] += "\n" + $_ end end return if ! $_ while f.gets() break if /^From / @body.push($_) end end def header return @header end def body return @body end end if ARGV.length == 0 if ENV['MAIL'] ARGV[0] = ENV['MAIL'] elsif ENV['USER'] ARGV[0] = '/usr/spool/mail/' + ENV['USER'] elsif ENV['LOGNAME'] ARGV[0] = '/usr/spool/mail/' + ENV['LOGNAME'] end end require "tk" list = scroll = nil TkFrame.new{|f| list = TkListbox.new(f) { yscroll proc{|idx| scroll.set *idx } relief 'raised' # geometry "80x5" width 80 height 5 setgrid 'yes' pack('side'=>'left','fill'=>'both','expand'=>'yes') } scroll = TkScrollbar.new(f) { command proc{|idx| list.yview *idx } pack('side'=>'right','fill'=>'y') } pack } root = Tk.root TkButton.new(root) { text 'Dismiss' command proc {exit} pack('fill'=>'both','expand'=>'yes') } root.bind "Control-c", proc{exit} root.bind "Control-q", proc{exit} root.bind "space", proc{exit} $outcount = 0; for file in ARGV next if File.exist?(file) atime = File.atime(file) mtime = File.mtime(file) f = open(file, "r") begin until f.eof mail = Mail.new(f) date = mail.header['Date'] next unless date from = mail.header['From'] subj = mail.header['Subject'] y = m = d = 0 y, m, d = parsedate(date) if date from = "sombody@somewhere" unless from subj = "(nil)" unless subj from = decode_b(from) subj = decode_b(subj) list.insert 'end', format('%-02d/%02d/%02d [%-28.28s] %s',y,m,d,from,subj) $outcount += 1 end ensure f.close File.utime(atime, mtime, file) list.see 'end' end end limit = 10000 if $outcount == 0 list.insert 'end', "You have no mail." limit = 2000 end Tk.after limit, proc{ exit } Tk.mainloop ruby-1.2.3/ext/tk/sample/tkhello.rb100644 774 145 332 6457557300 15212 0ustar matzNaClrequire "tk" TkButton.new(nil, 'text' => 'hello', 'command' => proc{print "hello\n"}).pack('fill'=>'x') TkButton.new(nil, 'text' => 'quit', 'command' => 'exit').pack('fill'=>'x') Tk.mainloop ruby-1.2.3/ext/tk/sample/tkline.rb100644 774 145 1522 6515357750 15062 0ustar matzNaCl require "tkclass" $tkline_init = FALSE def start_random return if $tkline_init $tkline_init = TRUE if defined? Thread Thread.start do loop do sleep 2 Line.new($c, rand(400), rand(200), rand(400), rand(200)) end end end end $c = Canvas.new $c.pack $start_x = start_y = 0 def do_press(x, y) $start_x = x $start_y = y $current_line = Line.new($c, x, y, x, y) start_random end def do_motion(x, y) if $current_line $current_line.coords $start_x, $start_y, x, y end end def do_release(x, y) if $current_line $current_line.coords $start_x, $start_y, x, y $current_line.fill 'black' $current_line = nil end end $c.bind("1", proc{|e| do_press e.x, e.y}) $c.bind("B1-Motion", proc{|x, y| do_motion x, y}, "%x %y") $c.bind("ButtonRelease-1", proc{|x, y| do_release x, y}, "%x %y") Tk.mainloop ruby-1.2.3/ext/tk/sample/tktimer.rb100644 774 145 1575 6457556237 15271 0ustar matzNaCl#!/usr/local/bin/ruby # This script generates a counter with start and stop buttons. require "tk" $label = TkLabel.new { text '0.00' relief 'raised' width 10 pack('side'=>'bottom', 'fill'=>'both') } TkButton.new { text 'Start' command proc { if $stopped $stopped = FALSE tick end } pack('side'=>'left','fill'=>'both','expand'=>'yes') } TkButton.new { text 'Stop' command proc{ exit if $stopped $stopped = TRUE } pack('side'=>'right','fill'=>'both','expand'=>'yes') } $seconds=0 $hundredths=0 $stopped=TRUE def tick if $stopped then return end Tk.after 50, proc{tick} $hundredths+=5 if $hundredths >= 100 $hundredths=0 $seconds+=1 end $label.text format("%d.%02d", $seconds, $hundredths) end root = Tk.root root.bind "Control-c", proc{root.destroy} root.bind "Control-q", proc{root.destroy} Tk.root.focus Tk.mainloop ruby-1.2.3/ext/Win32API/ 40755 774 145 0 6662164600 12500 5ustar matzNaClruby-1.2.3/ext/Win32API/MANIFEST100644 774 145 101 6472526040 13675 0ustar matzNaClMANIFEST depend MANIFEST Win32API.c extconf.rb getch.rb point.rb ruby-1.2.3/ext/Win32API/depend100644 774 145 120 6472526153 13734 0ustar matzNaClWin32API.o : Win32API.c $(hdrdir)/ruby.h $(hdrdir)/config.h $(hdrdir)/defines.h ruby-1.2.3/ext/Win32API/Win32API.c100644 774 145 11444 6472524116 14222 0ustar matzNaCl/* Win32API - Ruby Win32 API Import Facility */ #define WIN32_LEAN_AND_MEAN #include #include #define _T_VOID 0 #define _T_NUMBER 1 #define _T_POINTER 2 #define _T_INTEGER 3 typedef char *ApiPointer(void); typedef long ApiNumber(void); typedef void ApiVoid(void); typedef int ApiInteger(void); #include "ruby.h" typedef struct { HANDLE dll; HANDLE proc; VALUE dllname; VALUE import; VALUE export; } Win32API; static void Win32API_FreeLibrary(hdll) HINSTANCE hdll; { FreeLibrary(hdll); } static VALUE Win32API_initialize(self, dllname, proc, import, export) VALUE self; VALUE dllname; VALUE proc; VALUE import; VALUE export; { HANDLE hproc; HINSTANCE hdll; VALUE str; VALUE a_import; VALUE *ptr; int i; int len; int ex; hdll = GetModuleHandle(RSTRING(dllname)->ptr); if (!hdll) { hdll = LoadLibrary(RSTRING(dllname)->ptr); if (!hdll) Fail("LoadLibrary: %s\n", RSTRING(dllname)->ptr); Data_Wrap_Struct(self, 0, Win32API_FreeLibrary, hdll); } hproc = GetProcAddress(hdll, RSTRING(proc)->ptr); if (!hproc) { str = str_new3(proc); str = str_cat(str, "A", 1); hproc = GetProcAddress(hdll, RSTRING(str)->ptr); if (!hproc) Fail("GetProcAddress: %s or %s\n", RSTRING(proc)->ptr, RSTRING(str)->ptr); } rb_iv_set(self, "__dll__", INT2NUM((int)hdll)); rb_iv_set(self, "__dllname__", dllname); rb_iv_set(self, "__proc__", INT2NUM((int)hproc)); a_import = ary_new(); ptr = RARRAY(import)->ptr; for (i = 0, len = RARRAY(import)->len; i < len; i++) { int c = *(char *)RSTRING(ptr[i])->ptr; switch (c) { case 'N': case 'n': case 'L': case 'l': ary_push(a_import, INT2FIX(_T_NUMBER)); break; case 'P': case 'p': ary_push(a_import, INT2FIX(_T_POINTER)); break; case 'I': case 'i': ary_push(a_import, INT2FIX(_T_INTEGER)); break; } } rb_iv_set(self, "__import__", a_import); switch (*RSTRING(export)->ptr) { case 'V': case 'v': ex = _T_VOID; break; case 'N': case 'n': case 'L': case 'l': ex = _T_NUMBER; break; case 'P': case 'p': ex = _T_POINTER; break; case 'I': case 'i': ex = _T_INTEGER; break; } rb_iv_set(self, "__export__", INT2FIX(ex)); return Qnil; } static VALUE Win32API_Call(argc, argv, obj) VALUE argc; VALUE argv; VALUE obj; { VALUE args; FARPROC ApiFunction; ApiPointer *ApiFunctionPointer; ApiNumber *ApiFunctionNumber; ApiVoid *ApiFunctionVoid; ApiInteger *ApiFunctionInteger; long lParam; char *pParam; VALUE Return; VALUE obj_proc; VALUE obj_import; VALUE obj_export; VALUE import_type; int nimport, timport, texport, i; int items; items = rb_scan_args(argc, argv, "0*", &args); obj_proc = rb_iv_get(obj, "__proc__"); ApiFunction = (FARPROC)NUM2INT(obj_proc); obj_import = rb_iv_get(obj, "__import__"); obj_export = rb_iv_get(obj, "__export__"); nimport = RARRAY(obj_import)->len; texport = FIX2INT(obj_export); if (items != nimport) Fail("Wrong number of parameters: expected %d, got %d.\n", nimport, items); if (0 < nimport) { for (i = nimport - 1; 0 <= i; i--) { VALUE str; import_type = ary_entry(obj_import, i); timport = FIX2INT(import_type); switch (timport) { case _T_NUMBER: case _T_INTEGER: lParam = NUM2INT(ary_entry(args, i)); #if defined(_MSC_VER) || defined(__LCC__) _asm { mov eax, lParam push eax } #elif defined(__CYGWIN32__) || defined(__MINGW32__) asm volatile ("pushl %0" :: "g" (lParam)); #else #error #endif break; case _T_POINTER: str = ary_entry(args, i); Check_Type(str, T_STRING); str_modify(str); pParam = RSTRING(str)->ptr; #if defined(_MSC_VER) || defined(__LCC__) _asm { mov eax, dword ptr pParam push eax } #elif defined(__CYGWIN32__) || defined(__MINGW32__) asm volatile ("pushl %0" :: "g" (pParam)); #else #error #endif break; } } } switch (texport) { case _T_NUMBER: ApiFunctionNumber = (ApiNumber *) ApiFunction; Return = INT2NUM(ApiFunctionNumber()); break; case _T_POINTER: ApiFunctionPointer = (ApiPointer *) ApiFunction; Return = str_new2((char *)ApiFunctionPointer()); break; case _T_INTEGER: ApiFunctionInteger = (ApiInteger *) ApiFunction; Return = INT2NUM(ApiFunctionInteger()); break; case _T_VOID: default: ApiFunctionVoid = (ApiVoid *) ApiFunction; ApiFunctionVoid(); Return = INT2NUM(0); break; } return Return; } void Init_Win32API() { VALUE cWin32API = rb_define_class("Win32API", cObject); rb_define_method(cWin32API, "initialize", Win32API_initialize, 4); rb_define_method(cWin32API, "call", Win32API_Call, -1); rb_define_alias(cWin32API, "Call", "call"); } ruby-1.2.3/ext/Win32API/extconf.rb100644 774 145 216 6650602350 14543 0ustar matzNaClcase PLATFORM when /cygwin/,/mingw/ $CFLAGS = "-fno-defer-pop" create_makefile("Win32API") when /win32/ create_makefile("Win32API") end ruby-1.2.3/ext/Win32API/getch.rb100644 774 145 133 6506077570 14177 0ustar matzNaClrequire 'Win32API' getch = Win32API.new("crtdll", "_getch", [], 'L') puts getch.Call.chr ruby-1.2.3/ext/Win32API/point.rb100644 774 145 1132 6472524116 14251 0ustar matzNaClrequire 'Win32API' getCursorPos = Win32API.new("user32", "GetCursorPos", ['P'], 'V') lpPoint = " " * 8 # store two LONGs getCursorPos.Call(lpPoint) x, y = lpPoint.unpack("LL") # get the actual values print "x: ", x, "\n" print "y: ", y, "\n" ods = Win32API.new("kernel32", "OutputDebugString", ['P'], 'V') ods.Call("Hello, World\n"); GetDesktopWindow = Win32API.new("user32", "GetDesktopWindow", [], 'L') GetActiveWindow = Win32API.new("user32", "GetActiveWindow", [], 'L') SendMessage = Win32API.new("user32", "SendMessage", ['L'] * 4, 'L') SendMessage.Call GetDesktopWindow.Call, 274, 0xf140, 0 ruby-1.2.3/lib/ 40755 774 145 0 6662164567 11226 5ustar matzNaClruby-1.2.3/lib/English.rb100644 774 145 1627 6457556235 13246 0ustar matzNaCl alias $ERROR_INFO $! alias $ERROR_POSITION $@ alias $LOADED_FEATURES $" alias $FS $; alias $FIELD_SEPARATOR $; alias $OFS $, alias $OUTPUT_FIELD_SEPARATOR $, alias $RS $/ alias $INPUT_RECORD_SEPARATOR $/ alias $ORS $\ alias $OUPUT_RECORD_SEPARATOR $\ alias $INPUT_LINE_NUMBER $. alias $NR $. alias $LAST_READ_LINE $_ alias $DEFAULT_OUTPUT $> alias $DEFAULT_INPUT $< alias $PID $$ alias $PROCESS_ID $$ alias $CHILD_STATUS $? alias $LAST_MATCH_INFO $~ alias $IGNORECASE $= alias $PROGRAM_NAME $0 alias $ARGV $* alias $MATCH $& alias $PREMATCH $` alias $POSTMATCH $' alias $LAST_PAREN_MATCH $+ ruby-1.2.3/lib/Env.rb100644 774 145 730 6620245061 12337 0ustar matzNaCl# Env.rb -- imports environment variables as global variables # # Usage: # # require 'Env' # p $USER # $USER = "matz" # p ENV["USER"] for k,v in ENV next unless /^[a-zA-Z][_a-zA-Z0-9]*/ =~ k eval <@-~]+)\?=/i) { decode64($1) } str = Kconv::toeuc(str) str.gsub!(/=\?SHIFT_JIS\?B\?([!->@-~]+)\?=/i) { decode64($1) } str = Kconv::toeuc(str) str.gsub!(/\n/, ' ') str.gsub!(/\0/, '') str end def encode64(bin) [bin].pack("m") end def b64encode(bin, len = 60) encode64(bin).scan(/.{1,#{len}}/o) do print $&, "\n" end end ruby-1.2.3/lib/cgi-lib.rb100644 774 145 4475 6553522327 13157 0ustar matzNaCl# # Get CGI String # # EXAMPLE: # require "cgi-lib.rb" # foo = CGI.new # foo['field'] <== value of 'field' # foo.keys <== array of fields # and foo has Hash class methods # if running on Windows(IIS or PWS) then change cwd. if ENV['SERVER_SOFTWARE'] =~ /^Microsoft-/ then Dir.chdir ENV['PATH_TRANSLATED'].sub(/[^\\]+$/, '') end require "delegate" class CGI < SimpleDelegator attr("inputs") # original is CGI.pm def read_from_cmdline require "shellwords.rb" words = Shellwords.shellwords(if not ARGV.empty? then ARGV.join(' ') else STDERR.print "(offline mode: enter name=value pairs on standard input)\n" if STDIN.tty? readlines.join(' ').gsub(/\n/, '') end.gsub(/\\=/, '%3D').gsub(/\\&/, '%26')) if words.find{|x| x =~ /=/} then words.join('&') else words.join('+') end end # escape url encode def escape(str) str.gsub!(/[^a-zA-Z0-9_\-.]/n){ sprintf("%%%02X", $&.unpack("C")[0]) } str end # unescape url encoded def unescape(str) str.gsub! /\+/, ' ' str.gsub!(/%([0-9a-fA-F]{2})/){ [$1.hex].pack("c") } str end module_function :escape, :unescape def initialize(input = $stdin) @inputs = {} case ENV['REQUEST_METHOD'] when "GET" # exception messages should be printed to stdout. STDERR.reopen(STDOUT) ENV['QUERY_STRING'] or "" when "POST" # exception messages should be printed to stdout. STDERR.reopen(STDOUT) input.read Integer(ENV['CONTENT_LENGTH']) else read_from_cmdline end.split(/&/).each do |x| key, val = x.split(/=/,2).collect{|x|unescape(x)} if @inputs.include?(key) @inputs[key] += "\0" + (val or "") else @inputs[key] = (val or "") end end super(@inputs) end def CGI.message(msg, title = "") print "Content-type: text/html\n\n" print "" print title print "\n" print msg print "\n" TRUE end def CGI.error m = $!.to_s.dup m.gsub!(/&/, '&') m.gsub!(//, '>') msgs = ["
ERROR: #{m}"]
    msgs << $@
    msgs << "
" CGI.message(msgs.join("\n"), "ERROR") exit end end ruby-1.2.3/lib/complex.rb100644 774 145 20703 6551035130 13315 0ustar matzNaCl# # complex.rb - # $Release Version: 0.5 $ # $Revision: 1.3 $ # $Date: 1998/07/08 10:05:28 $ # by Keiju ISHITSUKA(SHL Japan Inc.) # # -- # Usage: # class Complex < Numeric # # Complex(x, y) --> x + yi # y.im --> 0 + yi # # Complex::polar # # Complex::+ # Complex::- # Complex::* # Complex::/ # Complex::** # Complex::% # Complex::divmod # Complex::abs # Complex::abs2 # Complex::arg # Complex::polar # Complex::conjugate # Complex::<=> # Complex::== # Complex::to_i # Complex::to_f # Complex::to_r # Complex::to_s # # Complex::I # # Numeric::im # # Math.sqrt # Math.exp # Math.cos # Math.sin # Math.tan # Math.log # Math.log10 # Math.atan2 # # def Complex(a, b = 0) if a.kind_of?(Complex) and b == 0 a elsif b == 0 and defined? Complex::Unify a else Complex.new(a, b) end end class Complex < Numeric @RCS_ID='-$Id: complex.rb,v 1.3 1998/07/08 10:05:28 keiju Exp keiju $-' def Complex.generic?(other) other.kind_of?(Integer) or other.kind_of?(Float) or (defined?(Rational) and other.kind_of?(Rational)) end def Complex.polar(r, theta) Complex(r*Math.cos(theta), r*Math.sin(theta)) end def initialize(a, b = 0) @real = a @image = b end def + (other) if other.kind_of?(Complex) re = @real + other.real im = @image + other.image Complex(re, im) elsif Complex.generic?(other) Complex(@real + other, @image) else x , y = a.coerce(self) x + y end end def - (other) if other.kind_of?(Complex) re = @real - other.real im = @image - other.image Complex(re, im) elsif Complex.generic?(other) Complex(@real - other, @image) else x , y = a.coerce(self) x - y end end def * (other) if other.kind_of?(Complex) re = @real*other.real - @image*other.image im = @real*other.image + @image*other.real Complex(re, im) elsif Complex.generic?(other) Complex(@real * other, @image * other) else x , y = a.coerce(self) x * y end end def / (other) if other.kind_of?(Complex) self * other.conjugate / other.abs2 elsif Complex.generic?(other) Complex(@real / other, @image / other) else x , y = a.coerce(self) x / y end end def ** (other) if other == 0 return Complex(1) end if other.kind_of?(Complex) r, theta = polar ore = other.real oim = other.image nr = Math.exp!(ore*Math.log!(r) - oim * theta) ntheta = theta*ore + oim*Math.log!(r) Complex.polar(nr, ntheta) elsif other.kind_of?(Integer) if other > 0 x = self z = x n = other - 1 while n != 0 while (div, mod = n.divmod(2) mod == 0) x = Complex(x.real*x.real - x.image*x.image, 2*x.real*x.image) n = div end z *= x n -= 1 end z else if defined? Rational (Rational(1) / self) ** -other else self ** Float(other) end end elsif Complex.generic?(other) r, theta = polar Complex.polar(r.power!(other), theta * other) else x , y = a.coerce(self) x / y end end def % (other) if other.kind_of?(Complex) Complex(@real % other.real, @image % other.image) elsif Complex.generic?(other) Complex(@real % other, @image % other) else x , y = a.coerce(self) x % y end end def divmod(other) if other.kind_of?(Complex) rdiv, rmod = @real.divmod(other.real) idiv, imod = @image.divmod(other.image) return Complex(rdiv, idiv), Complex(rmod, rdiv) elsif Complex.generic?(other) Complex(@real.divmod(other), @image.divmod(other)) else x , y = a.coerce(self) x.divmod(y) end end def abs Math.sqrt!((@real*@real + @image*@image).to_f) end def abs2 @real*@real + @image*@image end def arg Math.atan2(@image.to_f, @real.to_f) end def polar return abs, arg end def conjugate Complex(@real, -@image) end def <=> (other) self.abs <=> other.abs end def == (other) if other.kind_of?(Complex) @real == other.real and @image == other.image elsif Complex.generic?(other) @real == other and @image == 0 else x , y = a.coerce(self) x == y end end def coerce(other) if Complex.generic?(other) return Complex.new(other), self else super end end def to_i Complex(@real.to_i, @image.to_i) end def to_f Complex(@real.to_f, @image.to_f) end def to_r Complex(@real.to_r, @image.to_r) end def denominator @real.denominator.lcm(@image.denominator) end def numerator cd = denominator Complex(@real.numerator*(cd/@real.denominator), @image.numerator*(cd/@image.denominator)) end def to_s if @real != 0 if defined?(Rational) and @image.kind_of?(Rational) and @image.denominator != 1 if @image >= 0 @real.to_s+"+("+@image.to_s+")i" else @real.to_s+"-("+(-@image).to_s+")i" end else if @image >= 0 @real.to_s+"+"+@image.to_s+"i" else @real.to_s+"-"+(-@image).to_s+"i" end end else if defined?(Rational) and @image.kind_of?(Rational) and @image.denominator != 1 "("+@image.to_s+")i" else @image.to_s+"i" end end end def hash @real ^ @image end def inspect sprintf("Complex(%s, %s)", @real.inspect, @image.inspect) end I = Complex(0,1) attr :real attr :image end class Numeric def im Complex(0, self) end def real self end def image 0 end def arg if self >= 0 return 0 else return Math.atan2(1,1)*4 end end def polar return abs, arg end def conjugate self end end class Fixnum if not defined? Rational alias power! ** end def ** (other) if self < 0 Complex.new(self) ** other else if defined? Rational if other >= 0 self.power!(other) else Rational.new!(self,1)**other end else self.power!(other) end end end end class Bignum if not defined? Rational alias power! ** end end class Float alias power! ** end module Math alias sqrt! sqrt alias exp! exp alias cos! cos alias sin! sin alias tan! tan alias log! log alias log10! log10 alias atan2! atan2 def sqrt(z) if Complex.generic?(z) if z >= 0 sqrt!(z) else Complex(0,sqrt!(-z)) end else z**Rational(1,2) end end def exp(z) if Complex.generic?(z) exp!(z) else Complex(exp!(z.real) * cos!(z.image), exp!(z.real) * sin!(z.image)) end end def cosh!(x) (exp!(x) + exp!(-x))/2.0 end def sinh!(x) (exp!(x) - exp!(-x))/2.0 end def cos(z) if Complex.generic?(z) cos!(z) else Complex(cos!(z.real)*cosh!(z.image), -sin!(z.real)*sinh!(z.image)) end end def sin(z) if Complex.generic?(z) sin!(z) else Complex(sin!(z.real)*cosh!(z.image), cos!(z.real)*sinh!(z.image)) end end def tan(z) if Complex.generic?(z) tan!(z) else sin(z)/cos(z) end end def log(z) if Complex.generic?(z) and z >= 0 log!(z) else r, theta = z.polar Complex(log!(r.abs), theta) end end def log10(z) if Complex.generic?(z) log10!(z) else log(z)/log!(10) end end def atan2(x, y) if Complex.generic?(x) and Complex.generic?(y) atan2!(x, y) else fail "Not yet implemented." end end def atanh!(x) log((1.0 + x.to_f) / ( 1.0 - x.to_f)) / 2.0 end def atan(z) if Complex.generic?(z) atan2!(z, 1) elsif z.image == 0 atan2(z.real,1) else a = z.real b = z.image c = (a*a + b*b - 1.0) d = (a*a + b*b + 1.0) Complex(atan2!((c + sqrt(c*c + 4.0*a*a)), 2.0*a), atanh!((-d + sqrt(d*d - 4.0*b*b))/(2.0*b))) end end module_function :sqrt module_function :sqrt! module_function :exp! module_function :exp module_function :cosh! module_function :cos! module_function :cos module_function :sinh! module_function :sin! module_function :sin module_function :tan! module_function :tan module_function :log! module_function :log module_function :log10! module_function :log module_function :atan2! module_function :atan2 # module_function :atan! module_function :atan module_function :atanh! end ruby-1.2.3/lib/date.rb100644 774 145 11771 6476666546 12623 0ustar matzNaCl# # Date.rb - # $Release Version: $ # $Revision: 1.1.1.1.4.5 $ # $Date: 1998/03/03 02:39:34 $ # by Yasuo OHBA(SHL Japan Inc. Technology Dept.) # # -- # # September 1752 # S M Tu W Th F S # 1 2 14 15 16 # 17 18 19 20 21 22 23 # 24 25 26 27 28 29 30 # class Date include Comparable Weektag = [ "Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday" ] Monthtag = [ "January","February","March","April", "May", "June","July", "August", "September", "October", "November", "December" ] Monthtab = { "jan"=>1, "feb"=>2, "mar"=>3, "apr"=>4, "may"=>5, "jun"=>6, "jul"=>7, "aug"=>8, "sep"=>9, "oct"=>10, "nov"=>11, "dec"=>12 } def initialize(y = 1, m = 1, d = 1) if y.kind_of?(String) case y when /(\d\d\d\d)-?(?:(\d\d)-?(\d\d)?)?/ @year = $1.to_i @month = if $2 then $2.to_i else 1 end @day = if $3 then $3.to_i else 1 end else require 'parsedate' @year, @month, @day = ParseDate.parsedate(y) end else if m.kind_of?(String) m = Monthtab[m.downcase] if m.nil? raise ArgumentError, "Wrong argument. (month)" end end @year = y.to_i @month = m.to_i @day = d.to_i end _check_date return self end def year return @year end def month return @month end def day return @day end def period return Date.period!(@year, @month, @day) end def jd return period + 1721423 end def mjd return jd - 2400000.5 end def to_s format("%.3s, %.3s %2d %4d", name_of_week, name_of_month, @day, @year) end def inspect to_s end def day_of_week return (period + 5) % 7 end def name_of_week return Weektag[self.day_of_week] end def name_of_month return Monthtag[@month-1] end def +(o) if o.kind_of?(Numeric) d = Integer(self.period + o) elsif o.kind_of?(Date) d = self.period + o.period else raise TypeError, "Illegal type. (Integer or Date)" end if d <= 0 raise ArgumentError, "argument out of range. (self > other)" end return Date.at(d) end def -(o) if o.kind_of?(Numeric) d = Integer(self.period - o) elsif o.kind_of?(Date) return Integer(self.period - o.period) else raise TypeError, "Illegal type. (Integer or Date)" end if d <= 0 raise ArgumentError, "argument out of range. (self > other)" end return Date.at(d) end def <=>(o) if o.kind_of?(Integer) d = o elsif o.kind_of?(Date) d = o.period else raise TypeError, "Illegal type. (Integer or Date)" end return self.period <=> d end def eql?(o) self == o end def hash return @year ^ @month ^ @day end def leapyear? Date.leapyear(@year) != 1 end def _check_date if @year == nil or @month == nil or @day == nil raise ArgumentError, "argument contains nil" end m = Date.daylist(@year) if @month < 1 || @month > 12 raise ArgumentError, "argument(month) out of range." return nil end if @year == 1752 && @month == 9 if @day >= 3 && @day <= 13 raise ArgumentError, "argument(1752/09/3-13) out of range." return nil end d = 30 else d = m[@month] end if @day < 1 || @day > d raise ArgumentError, "argument(day) out of range." return nil end return self end private :_check_date end def Date.at(d) if d.kind_of? Time return Date.new(d.year, d.mon, d.mday) end if d.kind_of? Date return Date.at(d.period) end mm = 1 yy = (d / 366.0).to_i if yy != 0 dd = d - (Date.period!(yy, 1, 1) - 1) else dd = d yy = 1 end dl = Date.daylist(yy) while dd > dl[mm] if dd > dl[0] dd -= dl[0] yy += 1 dl = Date.daylist(yy) else dd -= dl[mm] mm += 1 end end if yy == 1752 && mm == 9 && dd >= 3 && dd <= 19 dd += (14 - 3) # 1752/09/03-19 -> 1752/09/14-30 end return Date.new(yy, mm, dd) end def Date.period!(y, m, d) p = d dl = Date.daylist(y) for mm in 1..(m - 1) p += dl[mm] end p += (y - 1) * 365 + ((y - 1) / 4.0).to_i if y > 1752 p -= ((y - 1) / 100.0).to_i p += ((y - 1) / 400.0).to_i p += 2 elsif y == 1752 && m == 9 && d >= 14 && d <= 30 p -= (14 - 3) end return p end def Date.leapyear(yy) return ((Date.jan1!(yy + 1) + 7 - Date.jan1!(yy)) % 7) end def Date.daylist(yy) case (Date.leapyear(yy)) when 1 # non-leapyear return [365, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] when 2 # leapyear return [366, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] else # 1752 return [355, 31, 29, 31, 30, 31, 30, 31, 31, 19, 31, 30, 31] end end def Date.jan1!(y) d = 4 + y + (y + 3) / 4 if y > 1800 d -= (y - 1701) / 100 d += (y - 1601) / 400 end if y > 1752 d += 3 end return (d % 7) end ruby-1.2.3/lib/date2.rb100644 774 145 7731 6660755731 12654 0ustar matzNaCl# date.rb: Written by Tadayoshi Funaba 1998, 1999 # $Id: date.rb,v 1.5 1999/02/06 08:51:56 tadf Exp $ class Date include Comparable MONTHNAMES = [ nil, 'January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December' ] DAYNAMES = [ 'Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday' ] ITALY = 2299161 # Oct 15, 1582 ENGLAND = 2361222 # Sept 14, 1752 def Date.civil_to_jd(y, m, d, gs = true) if m <= 2 then y -= 1 m += 12 end a = (y / 100).to_i b = 2 - a + (a / 4).to_i jd = (365.25 * (y + 4716)).to_i + (30.6001 * (m + 1)).to_i + d + b - 1524 unless (if gs.kind_of? Numeric then jd >= gs else gs end) then jd -= b end jd end def Date.jd_to_civil(jd, gs = true) unless (if gs.kind_of? Numeric then jd >= gs else gs end) then a = jd else x = ((jd - 1867216.25) / 36524.25).to_i a = jd + 1 + x - (x / 4).to_i end b = a + 1524 c = ((b - 122.1) / 365.25).to_i d = (365.25 * c).to_i e = ((b - d) / 30.6001).to_i dom = b - d - (30.6001 * e).to_i if e <= 13 then m = e - 1 y = c - 4716 else m = e - 13 y = c - 4715 end return y, m, dom end def Date.mjd_to_jd(mjd) mjd + 2400000.5 end def Date.jd_to_mjd(jd) jd - 2400000.5 end def Date.tjd_to_jd(tjd) tjd + 2440000.5 end def Date.jd_to_tjd(jd) jd - 2440000.5 end def Date.julian_leap? (y) y % 4 == 0 end def Date.gregorian_leap? (y) y % 4 == 0 and y % 100 != 0 or y % 400 == 0 end def Date.leap? (y) Date.gregorian_leap?(y) end def initialize(jd = 0, gs = ITALY) @jd, @gs = jd, gs end def Date.exist? (y, m, d, gs = true) jd = Date.civil_to_jd(y, m, d, gs) if [y, m, d] == Date.jd_to_civil(jd, gs) then jd end end def Date.new3(y = -4712, m = 1, d = 1, gs = ITALY) unless jd = Date.exist?(y, m, d, gs) then fail ArgumentError, 'invalid date' end Date.new(jd, gs) end def Date.today(gs = ITALY) Date.new(Date.civil_to_jd(*(Time.now.to_a[3..5].reverse << gs)), gs) end def jd @jd end def mjd def self.mjd; @mjd end @mjd = Date.jd_to_mjd(@jd) end def tjd def self.tjd; @tjd end @tjd = Date.jd_to_tjd(@jd) end def civil def self.year; @year end def self.mon; @mon end def self.mday; @mday end @year, @mon, @mday = Date.jd_to_civil(@jd, @gs) end private :civil def year civil @year end def yday def self.yday; @yday end ns = if @gs.kind_of? Numeric then @jd >= @gs else @gs end jd = Date.civil_to_jd(year - 1, 12, 31, ns) @yday = @jd - jd end def mon civil @mon end def mday civil @mday end def wday def self.wday; @wday end @wday = (@jd + 1) % 7 end def leap? def self.leap?; @leap_p end ns = if @gs.kind_of? Numeric then @jd >= @gs else @gs end jd = Date.civil_to_jd(year, 2, 28, ns) @leap_p = Date.jd_to_civil(jd + 1, ns)[1] == 2 end def + (other) case other when Numeric; return Date.new(@jd + other, @gs) end fail TypeError, 'expected numeric' end def - (other) case other when Numeric; return Date.new(@jd - other, @gs) when Date; return @jd - other.jd end fail TypeError, 'expected numeric or date' end def <=> (other) case other when Numeric; return @jd <=> other when Date; return @jd <=> other.jd end fail TypeError, 'expected numeric or date' end def downto(min) @jd.downto(min.jd) do |jd| yield Date.new(jd, @gs) end end def upto(max) @jd.upto(max.jd) do |jd| yield Date.new(jd, @gs) end end def step(max, step) @jd.step(max.jd, step) do |jd| yield Date.new(jd, @gs) end end def eql? (other) self == other end def hash @jd end def to_s format('%04d-%02d-%02d', year, mon, mday) end end ruby-1.2.3/lib/debug.rb100644 774 145 12500 6564716406 12750 0ustar matzNaCl class DEBUGGER__ trap("INT") { DEBUGGER__::CONTEXT.interrupt } $DEBUG = TRUE def initialize @break_points = [] @stop_next = 1 @frames = [nil] @frame_pos = nil @last_file = nil @scripts = {} end DEBUG_LAST_CMD = [] def interrupt @stop_next = 1 end def debug_eval(str, binding) begin val = eval(str, binding) val rescue at = caller(0) printf "%s:%s\n", at.shift, $! for i in at break if i =~ /`debug_(eval|command)'$/ #` printf "\tfrom %s\n", i end end end def debug_command(file, line, id, binding) if (ENV['EMACS'] == 't') printf "\032\032%s:%d:\n", file, line else printf "%s:%d:%s", file, line, line_at(file, line) end @frames[-1] = binding STDOUT.print "(rdb:-) " STDOUT.flush while input = STDIN.gets input.chop! if input == "" input = DEBUG_LAST_CMD[0] else DEBUG_LAST_CMD[0] = input end case input when /^b(reak)?\s+(([^:\n]+:)?.+)/ pos = $2 if pos.index ":" file, pos = pos.split(":") end file = File.basename(file) if pos =~ /^\d+$/ pname = pos pos = Integer(pos) else pname = pos = pos.intern.id2name end printf "Set breakpoint %d at %s:%s\n", @break_points.size, file, pname @break_points.push [file, pos] when /^b(reak)?$/, /^info b(reak)?$/ n = 0 for f, p in @break_points printf "%d %s:%s\n", n, f, p n += 1 end when /^del(ete)?(\s+(\d+))?$/ pos = $3 unless pos STDOUT.print "clear all breakpoints? (y/n) " STDOUT.flush input = STDIN.gets.chop! if input == "y" for n in @break_points.indexes @break_points[n] = nil end end else pos = Integer(pos) if @break_points[pos] bp = @break_points[pos] printf "Clear breakpoint %d at %s:%s\n", pos, bp[0], bp[1] @break_points[pos] = nil else printf "Breakpoint %d is not defined\n", pos end end when /^c(ont)?$/ return when /^s(tep)?\s*(\d+)?$/ if $1 lev = Integer($1) else lev = 1 end @stop_next = lev return when /^n(ext)?\s*(\d+)?$/ if $1 lev = Integer($1) else lev = 1 end @stop_next = lev @no_step = @frames.size return when /^up\s*(\d+)?$/ if $1 lev = Integer($1) else lev = 1 end unless @frame_pos @frame_pos = @frames.size - 1 end @frame_pos -= lev if @frame_pos < 0 STDOUT.print "at toplevel\n" @frame_pos = 0 else binding = @frames[@frame_pos] end when /^down\s*(\d+)??$/ if $1 lev = Integer($1) else lev = 1 end if lev >= @frames.size or @frame_pos and @frame_pos+lev >= @frames.size STDOUT.print "at stack bottom\n" @frame_pos = nil else @frame_pos += lev binding = @frames[@frame_pos] end when /^fin(ish)?$/ @finish_pos = @frames.size return when /^q(uit)?$/ STDOUT.print "really quit? (y/n) " STDOUT.flush input = STDIN.gets.chop! exit if input == "y" when /^where$/ at = caller(4) for i in at printf " %s\n", i end when /^l(ist)?(\s+(.*))?$/ if $3 b, e = $3.split(/[-,]/) b = Integer(b)-1 if e e = Integer(e)-1 else e = b + 10 end end unless b b = line - 1 e = line + 9 end p [b,e] line_at(file, line) if lines = @scripts[file] and lines != TRUE n = b+1 for l in lines[b..e] printf "%4d %s", n, l n += 1 end else printf "no sourcefile available for %s\n", file end when /^p\s+/ p debug_eval($', binding) #' else v = debug_eval(input, binding) p v unless v == nil end STDOUT.print "(rdb:-) " STDOUT.flush end end def line_at(file, line) lines = @scripts[file] if lines return "\n" if lines == TRUE line = lines[line-1] return "\n" unless line return line end save = $DEBUG begin $DEBUG = FALSE f = open(file) lines = @scripts[file] = f.readlines rescue $DEBUG = save @scripts[file] = TRUE return "\n" end line = lines[line-1] return "\n" unless line return line end def debug_funcname(id) if id == 0 "toplevel" else id.id2name end end def check_break_points(file, pos, binding, id) file = File.basename(file) if @break_points.include? [file, pos] index = @break_points.index([file, pos]) printf "Breakpoint %d, %s at %s:%s\n", index, debug_funcname(id), file, pos return TRUE end return FALSE end def trace_func(event, file, line, id, binding) if event == 'line' if @no_step == nil or @no_step >= @frames.size @stop_next -= 1 end if @stop_next == 0 if [file, line] == @last @stop_next = 1 else @no_step = nil debug_command(file, line, id, binding) @last = [file, line] end end if check_break_points(file, line, binding, id) debug_command(file, line, id, binding) end end if event == 'call' @frames.push binding if check_break_points(file, id.id2name, binding, id) debug_command(file, line, id, binding) end end if event == 'class' @frames.push binding end if event == 'return' or event == 'end' if @finish_pos == @frames.size @stop_next = 1 end @frames.pop end @last_file = file end CONTEXT = new end set_trace_func proc{|event, file, line, id, binding| DEBUGGER__::CONTEXT.trace_func event, file, line, id, binding } ruby-1.2.3/lib/delegate.rb100644 774 145 4513 6630730061 13404 0ustar matzNaCl# Delegation class that delegates even methods defined in super class, # which can not be covered with normal method_missing hack. # # Delegator is the abstract delegation class. Need to redefine # `__getobj__' method in the subclass. SimpleDelegator is the # concrete subclass for simple delegation. # # Usage: # foo = Object.new # foo2 = SimpleDelegator.new(foo) # foo.hash == foo2.hash # => true # # Foo = DelegateClass(Array) # # class ExtArray true foo.test # raise error! end ruby-1.2.3/lib/e2mmap.rb100644 774 145 5501 6570422776 13027 0ustar matzNaCl# # e2mmap.rb - for ruby 1.1 # $Release Version: 1.2$ # $Revision: 1.8 $ # $Date: 1998/08/19 15:22:22 $ # by Keiju ISHITSUKA # # -- # Usage: # # class Foo # extend Exception2MassageMapper # def_exception :NewExceptionClass, "message..."[, superclass] # def_e2meggage ExistingExceptionClass, "message..." # ... # end # # Foo.Fail NewExceptionClass, arg... # Foo.Fail ExistingExceptionClass, arg... # # if VERSION < "1.1" require "e2mmap1_0.rb" else module Exception2MessageMapper @RCS_ID='-$Id: e2mmap.rb,v 1.8 1998/08/19 15:22:22 keiju Exp keiju $-' E2MM = Exception2MessageMapper def E2MM.extend_object(cl) super cl.bind(self) end # backward compatibility def E2MM.extend_to(b) c = eval("self", b) c.extend(self) end # public :fail alias fail! fail #def fail(err = nil, *rest) # super #end def Fail(err = nil, *rest) Exception2MessageMapper.Fail Exception2MessageMapper::ErrNotRegisteredException, err.inspect end def bind(cl) self.module_eval %q^ E2MM_ErrorMSG = {} unless self.const_defined?(:E2MM_ErrorMSG) # fail(err, *rest) # err: Exception # rest: Parameter accompanied with the exception # def self.Fail(err = nil, *rest) if form = E2MM_ErrorMSG[err] $! = err.new(sprintf(form, *rest)) $@ = caller(0) if $@.nil? $@.shift # e2mm_fail() raise() # elsif self == Exception2MessageMapper # fail Exception2MessageMapper::ErrNotRegisteredException, err.to_s else # print "super\n" super end end # 過去の互換性のため def self.fail(err = nil, *rest) if form = E2MM_ErrorMSG[err] $! = err.new(sprintf(form, *rest)) $@ = caller(0) if $@.nil? $@.shift # e2mm_fail() raise() # elsif self == Exception2MessageMapper # fail Exception2MessageMapper::ErrNotRegisteredException, err.to_s else # print "super\n" super end end class << self public :fail end # def_exception(c, m) # c: exception # m: message_form # def self.def_e2message(c, m) E2MM_ErrorMSG[c] = m end # def_exception(c, m) # n: exception_name # m: message_form # s: superclass_of_exception (default: Exception) # defines excaption named ``c'', whose message is ``m''. # #def def_exception(n, m) def self.def_exception(n, m, s = nil) n = n.id2name if n.kind_of?(Fixnum) unless s if defined?(StandardError) s = StandardError else s = Exception end end e = Class.new(s) const_set(n, e) E2MM_ErrorMSG[e] = m # const_get(:E2MM_ErrorMSG)[e] = m end ^ end extend E2MM def_exception(:ErrNotClassOrModule, "Not Class or Module") def_exception(:ErrNotRegisteredException, "not registerd exception(%s)") end end ruby-1.2.3/lib/eregex.rb100644 774 145 700 6543701730 13067 0ustar matzNaCl class RegOr def initialize(re1, re2) @re1 = re1 @re2 = re2 end def =~ (str) @re1 =~ str or @re2 =~ str end end class RegAnd def initialize(re1, re2) @re1 = re1 @re2 = re2 end def =~ (str) @re1 =~ str and @re2 =~ str end end class Regexp def |(other) RegOr.new(self, other) end def &(other) RegAnd.new(self, other) end end if __FILE__ == $0 p "abc" =~ /b/|/c/ p "abc" =~ /b/&/c/ end ruby-1.2.3/lib/find.rb100644 774 145 1065 6600375726 12563 0ustar matzNaCl# Usage: # require "find" # # Find.find('/foo','/bar') {|f| ...} # or # include Find # find('/foo','/bar') {|f| ...} # module Find def find(*path) while file = path.shift catch(:prune) { yield file if File.directory? file then d = Dir.open(file) begin for f in d next if f =~ /^\.\.?$/ if file == "/" then f = "/" + f else f = file + "/" + f end path.unshift f end ensure d.close end end } end end def prune throw :prune end module_function :find, :prune end ruby-1.2.3/lib/final.rb100644 774 145 1736 6532722043 12731 0ustar matzNaCl# # $Id: final.rb,v 1.1.2.3 1998/05/27 04:47:28 matz Exp $ # Copyright (C) 1998 Yukihiro Matsumoto. All rights reserved. # The ObjectSpace extension: # # ObjectSpace.define_finalizer(obj, proc=lambda()) # # Defines the finalizer for the specified object. # # ObjectSpace.undefine_finalizer(obj) # # Removes the finalizers for the object. If multiple finalizers are # defined for the object, all finalizers will be removed. # module ObjectSpace Finalizers = {} def define_finalizer(obj, proc=lambda()) ObjectSpace.call_finalizer(obj) if assoc = Finalizers[obj.id] assoc.push(proc) else Finalizers[obj.id] = [proc] end end def undefine_finalizer(obj) Finalizers.delete(obj.id) end module_function :define_finalizer, :undefine_finalizer Generic_Finalizer = proc {|id| if Finalizers.key? id for proc in Finalizers[id] proc.call(id) end Finalizers.delete(id) end } add_finalizer Generic_Finalizer end ruby-1.2.3/lib/finalize.rb100644 774 145 13446 6564761216 13474 0ustar matzNaCl# # finalizer.rb - # $Release Version: 0.3$ # $Revision: 1.4 $ # $Date: 1998/02/27 05:34:33 $ # by Keiju ISHITSUKA # # -- # # Usage: # # add(obj, dependant, method = :finalize, *opt) # add_dependency(obj, dependant, method = :finalize, *opt) # add dependency R_method(obj, dependant) # # delete(obj_or_id, dependant, method = :finalize) # delete_dependency(obj_or_id, dependant, method = :finalize) # delete dependency R_method(obj, dependant) # delete_all_dependency(obj_or_id, dependant) # delete dependency R_*(obj, dependant) # delete_by_dependant(dependant, method = :finalize) # delete dependency R_method(*, dependant) # delete_all_by_dependant(dependant) # delete dependency R_*(*, dependant) # delete_all # delete all dependency R_*(*, *) # # finalize(obj_or_id, dependant, method = :finalize) # finalize_dependency(obj_or_id, dependant, method = :finalize) # finalize the dependant connected by dependency R_method(obj, dependtant). # finalize_all_dependency(obj_or_id, dependant) # finalize all dependants connected by dependency R_*(obj, dependtant). # finalize_by_dependant(dependant, method = :finalize) # finalize the dependant connected by dependency R_method(*, dependtant). # fainalize_all_by_dependant(dependant) # finalize all dependants connected by dependency R_*(*, dependant). # finalize_all # finalize all dependency registered to the Finalizer. # # safe{..} # stop invoking Finalizer on GC. # module Finalizer RCS_ID='-$Id: finalize.rb,v 1.4 1998/02/27 05:34:33 keiju Exp keiju $-' # @dependency: {id => [[dependant, method, *opt], ...], ...} # add dependency R_method(obj, dependant) def add_dependency(obj, dependant, method = :finalize, *opt) ObjectSpace.call_finalizer(obj) method = method.intern unless method.kind_of?(Integer) assoc = [dependant, method].concat(opt) if dep = @dependency[obj.id] dep.push assoc else @dependency[obj.id] = [assoc] end end alias add add_dependency # delete dependency R_method(obj, dependant) def delete_dependency(id, dependant, method = :finalize) id = id.id unless id.kind_of?(Integer) method = method.intern unless method.kind_of?(Integer) for assoc in @dependency[id] assoc.delete_if do |d, m, *o| d == dependant && m == method end @dependency.delete(id) if assoc.empty? end end alias delete delete_dependency # delete dependency R_*(obj, dependant) def delete_all_dependency(id, dependant) id = id.id unless id.kind_of?(Integer) method = method.intern unless method.kind_of?(Integer) for assoc in @dependency[id] assoc.delete_if do |d, m, *o| d == dependant end @dependency.delete(id) if assoc.empty? end end # delete dependency R_method(*, dependant) def delete_by_dependant(dependant, method = :finalize) method = method.intern unless method.kind_of?(Integer) for id in @dependency.keys delete(id, dependant, method) end end # delete dependency R_*(*, dependant) def delete_all_by_dependant(dependant) for id in @dependency.keys delete_all_dependency(id, dependant) end end # finalize the depandant connected by dependency R_method(obj, dependtant) def finalize_dependency(id, dependant, method = :finalize) id = id.id unless id.kind_of?(Integer) method = method.intern unless method.kind_of?(Integer) for assocs in @dependency[id] assocs.delete_if do |d, m, *o| d.send(m, id, *o) if ret = d == dependant && m == method ret end @dependency.delete(id) if assoc.empty? end end alias finalize finalize_dependency # finalize all dependants connected by dependency R_*(obj, dependtant) def finalize_all_dependency(id, dependant) id = id.id unless id.kind_of?(Integer) method = method.intern unless method.kind_of?(Integer) for assoc in @dependency[id] assoc.delete_if do |d, m, *o| d.send(m, id, *o) if ret = d == dependant end @dependency.delete(id) if assoc.empty? end end # finalize the dependant connected by dependency R_method(*, dependtant) def finalize_by_dependant(dependant, method = :finalize) method = method.intern unless method.kind_of?(Integer) for id in @dependency.keys finalize(id, dependant, method) end end # finalize all dependants connected by dependency R_*(*, dependtant) def fainalize_all_by_dependant(dependant) for id in @dependency.keys finalize_all_dependency(id, dependant) end end # finalize all dependants registered to the Finalizer. def finalize_all for id, assocs in @dependency for dependant, method, *opt in assocs dependant.send(method, id, *opt) end assocs.clear end end # method to call finalize_* safely. def safe old_status = Thread.critical Thread.critical = TRUE ObjectSpace.remove_finalizer(@proc) yield ObjectSpace.add_finalizer(@proc) Thread.critical = old_status end # registering function to ObjectSpace#add_finalizer def final_of(id) if assocs = @dependency.delete(id) for dependant, method, *opt in assocs dependant.send(method, id, *opt) end end end @dependency = Hash.new @proc = proc{|id| final_of(id)} ObjectSpace.add_finalizer(@proc) module_function :add module_function :add_dependency module_function :delete module_function :delete_dependency module_function :delete_all_dependency module_function :delete_by_dependant module_function :delete_all_by_dependant module_function :finalize module_function :finalize_dependency module_function :finalize_all_dependency module_function :finalize_by_dependant module_function :fainalize_all_by_dependant module_function :finalize_all module_function :safe module_function :final_of private_class_method :final_of end ruby-1.2.3/lib/ftplib.rb100644 774 145 25760 6530253651 13145 0ustar matzNaCl## ftplib.rb # Author: Shugo Maeda # Version: $Revision: 1.7 $ ## Code: require "socket" require "monitor" class FTPError < StandardError; end class FTPReplyError < FTPError; end class FTPTempError < FTPError; end class FTPPermError < FTPError; end class FTPProtoError < FTPError; end class FTP RCS_ID = %q$Id: ftplib.rb,v 1.7 1998/04/13 12:34:24 shugo Exp shugo $ include MonitorMixin FTP_PORT = 21 CRLF = "\r\n" attr_accessor :passive, :return_code, :debug_mode attr_reader :welcome, :lastresp def FTP.open(host, user = nil, passwd = nil, acct = nil) new(host, user, passwd, acct) end def initialize(host = nil, user = nil, passwd = nil, acct = nil) super @passive = false @return_code = "\n" @debug_mode = false if host connect(host) if user login(user, passwd, acct) end end end def open_socket(host, port) if defined? SOCKSsocket and ENV["SOCKS_SERVER"] @passive = true return SOCKSsocket.open(host, port) else return TCPsocket.open(host, port) end end private :open_socket def connect(host, port = FTP_PORT) if @debug_mode print "connect: ", host, ", ", port, "\n" end synchronize do @sock = open_socket(host, port) voidresp end end def sanitize(s) if s =~ /^PASS /i return s[0, 5] + "*" * (s.length - 5) else return s end end private :sanitize def putline(line) if @debug_mode print "put: ", sanitize(line), "\n" end line = line + CRLF @sock.write(line) end private :putline def getline line = @sock.readline # if get EOF, raise EOFError if line[-2, 2] == CRLF line = line[0 .. -3] elsif line[-1] == ?\r or line[-1] == ?\n line = line[0 .. -2] end if @debug_mode print "get: ", sanitize(line), "\n" end return line end private :getline def getmultiline line = getline buff = line if line[3] == ?- code = line[0, 3] begin line = getline buff << "\n" << line end until line[0, 3] == code and line[3] != ?- end return buff << "\n" end private :getmultiline def getresp resp = getmultiline @lastresp = resp[0, 3] c = resp[0] case c when ?1, ?2, ?3 return resp when ?4 raise FTPTempError, resp when ?5 raise FTPPermError, resp else raise FTPProtoError, resp end end private :getresp def voidresp resp = getresp if resp[0] != ?2 raise FTPReplyError, resp end end private :voidresp def sendcmd(cmd) synchronize do putline(cmd) return getresp end end def voidcmd(cmd) synchronize do putline(cmd) voidresp end end def sendport(host, port) hbytes = host.split(".") pbytes = [port / 256, port % 256] bytes = hbytes + pbytes cmd = "PORT " + bytes.join(",") voidcmd(cmd) end private :sendport def makeport sock = TCPserver.open(0) port = sock.addr[1] host = TCPsocket.getaddress(@sock.addr[2]) resp = sendport(host, port) return sock end private :makeport def transfercmd(cmd) if @passive host, port = parse227(sendcmd("PASV")) conn = open_socket(host, port) resp = sendcmd(cmd) if resp[0] != ?1 raise FTPReplyError, resp end else sock = makeport resp = sendcmd(cmd) if resp[0] != ?1 raise FTPReplyError, resp end conn = sock.accept end return conn end private :transfercmd def getaddress thishost = Socket.gethostname if not thishost.index(".") thishost = Socket.gethostbyname(thishost)[0] end if ENV.has_key?("LOGNAME") realuser = ENV["LOGNAME"] elsif ENV.has_key?("USER") realuser = ENV["USER"] else realuser = "anonymous" end return realuser + "@" + thishost end private :getaddress def login(user = "anonymous", passwd = nil, acct = nil) if user == "anonymous" and passwd == nil passwd = getaddress end resp = "" synchronize do resp = sendcmd('USER ' + user) if resp[0] == ?3 resp = sendcmd('PASS ' + passwd) end if resp[0] == ?3 resp = sendcmd('ACCT ' + acct) end end if resp[0] != ?2 raise FTPReplyError, resp end @welcome = resp end def retrbinary(cmd, blocksize, callback = Proc.new) synchronize do voidcmd("TYPE I") conn = transfercmd(cmd) loop do data = conn.read(blocksize) break if data == nil callback.call(data) end conn.close voidresp end end def retrlines(cmd, callback = nil) if iterator? callback = Proc.new elsif not callback.is_a?(Proc) callback = Proc.new {|line| print line, "\n"} end synchronize do voidcmd("TYPE A") conn = transfercmd(cmd) loop do line = conn.gets break if line == nil if line[-2, 2] == CRLF line = line[0 .. -3] elsif line[-1] == ?\n line = line[0 .. -2] end callback.call(line) end conn.close voidresp end end def storbinary(cmd, file, blocksize, callback = nil) if iterator? callback = Proc.new end use_callback = callback.is_a?(Proc) synchronize do voidcmd("TYPE I") conn = transfercmd(cmd) loop do buf = file.read(blocksize) break if buf == nil conn.write(buf) callback.call(buf) if use_callback end conn.close voidresp end end def storlines(cmd, file, callback = nil) if iterator? callback = Proc.new end use_callback = callback.is_a?(Proc) synchronize do voidcmd("TYPE A") conn = transfercmd(cmd) loop do buf = file.gets break if buf == nil if buf[-2, 2] != CRLF if buf[-1] == ?\r or buf[-1] == ?\n buf = buf[0 .. -2] end buf = buf + CRLF end conn.write(buf) callback.call(buf) if use_callback end conn.close voidresp end end def getbinaryfile(remotefile, localfile, blocksize, callback = nil) if iterator? callback = Proc.new end use_callback = callback.is_a?(Proc) f = open(localfile, "w") begin f.binmode retrbinary("RETR " + remotefile, blocksize) do |data| f.write(data) callback.call(data) if use_callback end ensure f.close end end def gettextfile(remotefile, localfile, callback = nil) if iterator? callback = Proc.new end use_callback = callback.is_a?(Proc) f = open(localfile, "w") begin retrlines("RETR " + remotefile) do |line| line = line + @return_code f.write(line) callback.call(line) if use_callback end ensure f.close end end def putbinaryfile(localfile, remotefile, blocksize, callback = nil) if iterator? callback = Proc.new end use_callback = callback.is_a?(Proc) f = open(localfile) begin f.binmode storbinary("STOR " + remotefile, f, blocksize) do |data| callback.call(data) if use_callback end ensure f.close end end def puttextfile(localfile, remotefile, callback = nil) if iterator? callback = Proc.new end use_callback = callback.is_a?(Proc) f = open(localfile) begin storlines("STOR " + remotefile, f) do |line| callback.call(line) if use_callback end ensure f.close end end def acct(account) cmd = "ACCT " + account voidcmd(cmd) end def nlst(dir = nil) cmd = "NLST" if dir cmd = cmd + " " + dir end files = [] retrlines(cmd) do |line| files.push(line) end return files end def list(*args, &block) cmd = "LIST" args.each do |arg| cmd = cmd + " " + arg end if block retrlines(cmd, &block) else lines = [] retrlines(cmd) do |line| lines << line end return lines end end alias ls list alias dir list def rename(fromname, toname) resp = sendcmd("RNFR " + fromname) if resp[0] != ?3 raise FTPReplyError, resp end voidcmd("RNTO " + toname) end def delete(filename) resp = sendcmd("DELE " + filename) if resp[0, 3] == "250" return elsif resp[0] == ?5 raise FTPPermError, resp else raise FTPReplyError, resp end end def chdir(dirname) if dirname == ".." begin voidcmd("CDUP") return rescue FTPPermError if $![0, 3] != "500" raise FTPPermError, $! end end end cmd = "CWD " + dirname voidcmd(cmd) end def size(filename) voidcmd("TYPE I") resp = sendcmd("SIZE " + filename) if resp[0, 3] != "213" raise FTPReplyError, resp end return resp[3..-1].strip end MDTM_REGEXP = /^(\d\d\d\d)(\d\d)(\d\d)(\d\d)(\d\d)(\d\d)$/ def mtime(filename, local = false) str = mdtm(filename) ary = str.scan(MDTM_REGEXP)[0].collect {|i| i.to_i} return local ? Time.local(*ary) : Time.gm(*ary) end def mkdir(dirname) resp = sendcmd("MKD " + dirname) return parse257(resp) end def rmdir(dirname) voidcmd("RMD " + dirname) end def pwd resp = sendcmd("PWD") return parse257(resp) end alias getdir pwd def system resp = sendcmd("SYST") if resp[0, 3] != "215" raise FTPReplyError, resp end return resp[4 .. -1] end def abort line = "ABOR" + CRLF print "put: ABOR\n" if @debug_mode @sock.send(line, Socket::MSG_OOB) resp = getmultiline unless ["426", "226", "225"].include?(resp[0, 3]) raise FTPProtoError, resp end return resp end def status line = "STAT" + CRLF print "put: STAT\n" if @debug_mode @sock.send(line, Socket::MSG_OOB) return getresp end def mdtm(filename) resp = sendcmd("MDTM " + filename) if resp[0, 3] == "213" return resp[3 .. -1].strip end end def help(arg = nil) cmd = "HELP" if arg cmd = cmd + " " + arg end sendcmd(cmd) end def quit voidcmd("QUIT") end def close @sock.close if @sock and not @sock.closed? end def closed? @sock == nil or @sock.closed? end def parse227(resp) if resp[0, 3] != "227" raise FTPReplyError, resp end left = resp.index("(") right = resp.index(")") if left == nil or right == nil raise FTPProtoError, resp end numbers = resp[left + 1 .. right - 1].split(",") if numbers.length != 6 raise FTPProtoError, resp end host = numbers[0, 4].join(".") port = (numbers[4].to_i << 8) + numbers[5].to_i return host, port end private :parse227 def parse257(resp) if resp[0, 3] != "257" raise FTPReplyError, resp end if resp[3, 2] != ' "' return "" end dirname = "" i = 5 n = resp.length while i < n c = resp[i, 1] i = i + 1 if c == '"' if i > n or resp[i, 1] != '"' break end i = i + 1 end dirname = dirname + c end return dirname end private :parse257 end ## ftplib.rb ends here ruby-1.2.3/lib/ftools.rb100644 774 145 6157 6650572260 13155 0ustar matzNaClclass << File TOO_BIG = 1024 * 1024 * 2 # 2MB def catname from, to if FileTest.directory? to to + if to =~ /\\/ if to[-1,1] != '\\' then '\\' end + basename(from) else if to[-1,1] != '/' then '/' end + basename(from) end else to end end # copy file def syscopy from, to to = catname(from, to) fsize = size(from) fsize = 1024 if fsize < 512 fsize = TOO_BIG if fsize > TOO_BIG from = open(from, "r") from.binmode to = open(to, "w") to.binmode begin while TRUE r = from.sysread(fsize) rsize = r.size w = 0 while w < rsize t = to.syswrite(r[w, rsize - w]) w += t end end rescue EOFError ret = TRUE rescue ret = FALSE ensure to.close from.close end ret end def copy from, to, verbose = FALSE $stderr.print from, " -> ", catname(from, to), "\n" if verbose syscopy from, to end alias cp copy # move file def move from, to, verbose = FALSE to = catname(from, to) $stderr.print from, " -> ", to, "\n" if verbose if PLATFORM =~ /djgpp|cygwin|mswin32/ and FileTest.file? to unlink to end begin rename from, to rescue syscopy from, to and unlink from end end alias mv move # compare two files # TRUE: identical # FALSE: not identical def compare from, to, verbose = FALSE $stderr.print from, " <=> ", to, "\n" if verbose fsize = size(from) fsize = 1024 if fsize < 512 fsize = TOO_BIG if fsize > TOO_BIG from = open(from, "r") from.binmode to = open(to, "r") to.binmode ret = FALSE fr = tr = '' begin while fr == tr if fr = from.read(fsize) tr = to.read(fr.size) else ret = !to.read(fsize) break end end rescue ret = FALSE ensure to.close from.close end ret end alias cmp compare # unlink files safely def safe_unlink(*files) verbose = if files[-1].is_a? String then FALSE else files.pop end begin $stderr.print files.join(" "), "\n" if verbose chmod 0777, *files unlink *files rescue # STDERR.print "warning: Couldn't unlink #{files.join ' '}\n" end end alias rm_f safe_unlink def makedirs(*dirs) verbose = if dirs[-1].is_a? String then FALSE else dirs.pop end # mode = if dirs[-1].is_a? Fixnum then dirs.pop else 0755 end mode = 0755 for dir in dirs next if FileTest.directory? dir parent = dirname(dir) makedirs parent unless FileTest.directory? parent $stderr.print "mkdir ", dir, "\n" if verbose Dir.mkdir dir, mode end end alias mkpath makedirs alias o_chmod chmod def chmod(mode, *files) verbose = if files[-1].is_a? String then FALSE else files.pop end $stderr.printf "chmod %04o %s\n", mode, files.join(" ") if verbose o_chmod mode, *files end def install(from, to, mode = nil, verbose = false) to = catname(from, to) unless FileTest.exist? to and cmp from, to unlink to if FileTest.exist? to cp from, to, verbose chmod mode, to, verbose if mode end end end # vi:set sw=2: ruby-1.2.3/lib/getopts.rb100644 774 145 4756 6516561562 13343 0ustar matzNaCl# # getopts.rb - # $Release Version: $ # $Revision: 1.1.1.1.4.3 $ # $Date: 1998/04/20 05:55:37 $ # by Yasuo OHBA(SHL Japan Inc. Technology Dept.) # # -- # # # $RCS_ID=%q$Header: /home/cvsroot/ruby/lib/getopts.rb,v 1.1.1.1.4.3 1998/04/20 05:55:37 matz Exp $ def isSingle(lopt) if lopt.index(":") if lopt.split(":")[0].length == 1 return TRUE end end return nil end def getOptionName(lopt) return lopt.split(":")[0] end def getDefaultOption(lopt) od = lopt.split(":")[1] if od return od end return nil end def setOption(name, value) eval("$OPT_" + name + " = " + 'value') end def setDefaultOption(lopt) d = getDefaultOption(lopt) if d setOption(getOptionName(lopt), d) end end def setNewArgv(newargv) ARGV.clear for na in newargv ARGV << na end end def getopts(single_opts, *options) if options single_colon = "" long_opts = [] sc = 0 for o in options setDefaultOption(o) if isSingle(o) single_colon[sc, 0] = getOptionName(o) sc += 1 else long_opts.push(o) end end end opts = {} count = 0 newargv = [] while ARGV.length != 0 compare = nil case ARGV[0] when /^--?$/ ARGV.shift newargv += ARGV break when /^--.*/ compare = ARGV[0][2, (ARGV[0].length - 2)] if long_opts != "" for lo in long_opts if lo.index(":") && getOptionName(lo) == compare if ARGV.length <= 1 return nil end setOption(compare, ARGV[1]) opts[compare] = TRUE ARGV.shift count += 1 break elsif lo == compare setOption(compare, TRUE) opts[compare] = TRUE count += 1 break end end end if compare.length <= 1 return nil end when /^-.*/ for idx in 1..(ARGV[0].length - 1) compare = ARGV[0][idx, 1] if single_opts && compare =~ "[" + single_opts + "]" setOption(compare, TRUE) opts[compare] = TRUE count += 1 elsif single_colon != "" && compare =~ "[" + single_colon + "]" if ARGV[0][idx..-1].length > 1 setOption(compare, ARGV[0][(idx + 1)..-1]) opts[compare] = TRUE count += 1 elsif ARGV.length <= 1 return nil else setOption(compare, ARGV[1]) opts[compare] = TRUE ARGV.shift count += 1 end break end end else compare = ARGV[0] opts[compare] = TRUE newargv << ARGV[0] end ARGV.shift if !opts.has_key?(compare) return nil end end setNewArgv(newargv) return count end ruby-1.2.3/lib/importenv.rb100644 774 145 745 6620245265 13646 0ustar matzNaCl# importenv.rb -- imports environment variables as global variables # # Usage: # # require 'importenv' # p $USER # $USER = "matz" # p ENV["USER"] for k,v in ENV next unless /^[a-zA-Z][_a-zA-Z0-9]*/ =~ k eval < to curr = self tail = self[-2..-1] if tail.length == 2 and tail =~ /^.$/ then if self[0..-2] == to[0..-2] first = self[-2].chr for c in self[-1] .. to[-1] if (first+c.chr).mbchar? yield self[0..-2]+c.chr end end end else loop do yield curr return if curr == to curr = curr.succ return if curr.length > to.length end end return nil end def _expand_ch a = [] self.scan(/(.|\n)-(.|\n)|(.|\n)/) do |r| if $3 a.push $3 elsif $1.length != $2.length next elsif $1.length == 1 $1[0].upto($2[0]) { |c| a.push c.chr } else $1.upto($2) { |c| a.push c } end end a end def tr!(from, to) return self.delete!(from) if to.length == 0 if from =~ /^\^/ comp=TRUE from = $' end afrom = from._expand_ch ato = to._expand_ch i = 0 if comp self.gsub!(/(.|\n)/) do |c| unless afrom.include?(c) ato[-1] else c end end else self.gsub!(/(.|\n)/) do |c| if i = afrom.index(c) if i < ato.size then ato[i] else ato[-1] end else c end end end end def tr(from, to) (str = self.dup).tr!(from, to) or str end def delete!(del) if del =~ /^\^/ comp=TRUE del = $' end adel = del._expand_ch if comp self.gsub!(/(.|\n)/) do |c| next unless adel.include?(c) c end else self.gsub!(/(.|\n)/) do |c| next if adel.include?(c) c end end end def delete(del) (str = self.dup).delete!(del) or str end def squeeze!(del=nil) if del if del =~ /^\^/ comp=TRUE del = $' end adel = del._expand_ch if comp self.gsub!(/(.|\n)\1+/) do next unless adel.include?($1) $& end else for c in adel cq = Regexp.quote(c) self.gsub!(/#{cq}(#{cq})+/, cq) end end self else self.gsub!(/(.|\n)\1+/, '\1') end end def squeeze(del=nil) (str = self.dup).squeeze!(del) or str end def tr_s!(from, to) return self.delete!(from) if to.length == 0 if from =~ /^\^/ comp=TRUE from = $' end afrom = from._expand_ch ato = to._expand_ch i = 0 c = nil last = nil self.gsub!(/(.|\n)/) do |c| if comp unless afrom.include?(c) ato[-1] else c end elsif i = afrom.index(c) c = if i < ato.size then ato[i] else ato[-1] end next if c == last last = c else last = nil c end end end def tr_s(from, to) (str = self.dup).tr_s!(from,to) or str end alias original_chop! chop! private :original_chop! def chop! if self =~ /(.)$/ and $1.size == 2 original_chop! end original_chop! end def chop (str = self.dup).chop! or str end end $VERBOSE = $vsave ruby-1.2.3/lib/mailread.rb100644 774 145 1224 6506421750 13410 0ustar matzNaClclass Mail def initialize(f) unless f.kind_of?(IO) f = open(f, "r") opened = true end @header = {} @body = [] begin while f.gets() $_.chop! next if /^From / # skip From-line break if /^$/ # end of header if /^(\S+):\s*(.*)/ (attr = $1).capitalize! @header[attr] = $2 elsif attr sub!(/^\s*/, '') @header[attr] += "\n" + $_ end end return unless $_ while f.gets() break if /^From / @body.push($_) end ensure f.close if opened end end def header return @header end def body return @body end def [](field) @header[field] end end ruby-1.2.3/lib/mathn.rb100644 774 145 12636 6517330231 12765 0ustar matzNaCl# # mathn.rb - # $Release Version: 0.5 $ # $Revision: 1.1.1.1.4.1 $ # $Date: 1998/01/16 12:36:05 $ # by Keiju ISHITSUKA(SHL Japan Inc.) # # -- # # # require "rational.rb" require "complex.rb" require "matrix.rb" class Integer def gcd2(int) a = self.abs b = int.abs a, b = b, a if a < b pd_a = a.prime_division pd_b = b.prime_division gcd = 1 for pair in pd_a as = pd_b.assoc(pair[0]) if as gcd *= as[0] ** [as[1], pair[1]].min end end return gcd end def Integer.from_prime_division(pd) value = 1 for prime, index in pd value *= prime**index end value end def prime_division ps = Prime.new value = self pv = [] for prime in ps count = 0 while (value1, mod = value.divmod(prime) mod) == 0 value = value1 count += 1 end if count != 0 pv.push [prime, count] end break if prime * prime >= value end if value > 1 pv.push [value, 1] end return pv end end class Prime include Enumerable def initialize @seed = 1 @primes = [] @counts = [] end def succ i = -1 size = @primes.size while i < size if i == -1 @seed += 1 i += 1 else while @seed > @counts[i] @counts[i] += @primes[i] end if @seed != @counts[i] i += 1 else i = -1 end end end @primes.push @seed @counts.push @seed + @seed return @seed end alias next succ def each loop do yield succ end end end class Fixnum alias divmod! divmod alias / rdiv def divmod(other) a = self.div(other) b = self % other return a,b end end class Bignum alias divmod! divmod alias / rdiv end class Rational Unify = TRUE alias power! ** def ** (other) if other.kind_of?(Rational) if self < 0 return Complex(self, 0) ** other elsif other == 0 return Rational(1,1) elsif self == 0 return Rational(0,1) elsif self == 1 return Rational(1,1) end npd = @numerator.prime_division dpd = @denominator.prime_division if other < 0 other = -other npd, dpd = dpd, npd end for elm in npd elm[1] = elm[1] * other if !elm[1].kind_of?(Integer) and elm[1].denominator != 1 return Float(self) ** other end elm[1] = elm[1].to_i end for elm in dpd elm[1] = elm[1] * other if !elm[1].kind_of?(Integer) and elm[1].denominator != 1 return Float(self) ** other end elm[1] = elm[1].to_i end num = Integer.from_prime_division(npd) den = Integer.from_prime_division(dpd) Rational(num,den) elsif other.kind_of?(Integer) if other > 0 num = @numerator ** other den = @denominator ** other elsif other < 0 num = @denominator ** -other den = @numerator ** -other elsif other == 0 num = 1 den = 1 end Rational.new!(num, den) elsif other.kind_of?(Float) Float(self) ** other else x , y = other.coerce(self) x ** y end end def power2(other) if other.kind_of?(Rational) if self < 0 return Complex(self, 0) ** other elsif other == 0 return Rational(1,1) elsif self == 0 return Rational(0,1) elsif self == 1 return Rational(1,1) end dem = nil x = self.denominator.to_f.to_i neard = self.denominator.to_f ** (1.0/other.denominator.to_f) loop do if (neard**other.denominator == self.denominator) dem = neaed break end end nearn = self.numerator.to_f ** (1.0/other.denominator.to_f) Rational(num,den) elsif other.kind_of?(Integer) if other > 0 num = @numerator ** other den = @denominator ** other elsif other < 0 num = @denominator ** -other den = @numerator ** -other elsif other == 0 num = 1 den = 1 end Rational.new!(num, den) elsif other.kind_of?(Float) Float(self) ** other else x , y = other.coerce(self) x ** y end end end module Math def sqrt(a) if a.kind_of?(Complex) abs = sqrt(a.real*a.real + a.image*a.image) # if not abs.kind_of?(Rational) # return a**Rational(1,2) # end x = sqrt((a.real + abs)/Rational(2)) y = sqrt((-a.real + abs)/Rational(2)) # if !(x.kind_of?(Rational) and y.kind_of?(Rational)) # return a**Rational(1,2) # end if a.image >= 0 Complex(x, y) else Complex(x, -y) end elsif a >= 0 rsqrt(a) else Complex(0,rsqrt(-a)) end end def rsqrt(a) if a.kind_of?(Float) sqrt!(a) elsif a.kind_of?(Rational) rsqrt(a.numerator)/rsqrt(a.denominator) else src = a max = 2 ** 32 byte_a = [src & 0xffffffff] # ruby's bug while (src >= max) and (src >>= 32) byte_a.unshift src & 0xffffffff end answer = 0 main = 0 side = 0 for elm in byte_a main = (main << 32) + elm side <<= 16 if answer != 0 if main * 4 < side * side applo = main.div(side) else applo = ((sqrt!(side * side + 4 * main) - side)/2.0).to_i + 1 end else applo = sqrt!(main).to_i + 1 end while (x = (side + applo) * applo) > main applo -= 1 end main -= x answer = (answer << 16) + applo side += applo * 2 end if main == 0 answer else sqrt!(a) end end end module_function :sqrt module_function :rsqrt end class Complex Unify = TRUE end ruby-1.2.3/lib/matrix.rb100644 774 145 43026 6564770220 13167 0ustar matzNaCl# # matrix.rb - # $Release Version: 1.0$ # $Revision: 1.6 $ # $Date: 1998/07/31 03:39:49 $ # Original Version from Smalltalk-80 version # on July 23, 1985 at 8:37:17 am # by Keiju ISHITSUKA # # -- # # Matrix[[1,2,3], # : # [3,4,5]] # Matrix[row0, # row1, # : # rown] # # # module ExceptionForMatrix:: # Exceptions: # ErrDimensionMismatch # number of column/row do not match # ErrNotRegular # not a regular matrix # ErrOperationNotDefined # specified operator is not defined (yet) # # class Matrix # include ExceptionForMatrix # # Methods: # class methods: # Matrix.[](*rows) # creates a matrix where `rows' indicates rows. # `rows' is an array of arrays, # e.g, Matrix[[11, 12], [21, 22]] # Matrix.rows(rows, copy = TRUE) # creates a matrix where `rows' indicates rows. # if optional argument `copy' is false, use the array as # internal structure of the metrix without copying. # Matrix.columns(columns) # creates a new matrix using `columns` as set of colums vectors. # Matrix.diagonal(*values) # creates a matrix where `columns' indicates columns. # Matrix.scalar(n, value) # creates a diagonal matrix such that the diagal compornents is # given by `values'. # Matrix.scalar(n, value) # creates an n-by-n scalar matrix such that the diagal compornent is # given by `value'. # Matrix.identity(n) # Matrix.unit(n) # Matrix.I(n) # creates an n-by-n unit matrix. # Matrix.zero(n) # creates an n-by-n zero matrix. # Matrix.row_vector(row) # creates a 1-by-n matrix such the row vector is `row'. # `row' is specifed as a Vector or an Array. # Matrix.column_vector(column) # creates a 1-by-n matrix such that column vector is `column'. # `column' is specifed as a Vector or an Array. # accessing: # [](i, j) # returns (i,j) compornent # row_size # returns the number of rows # column_size # returns the number of columns # row(i) # returns the i-th row vector. # when the block is supplied for the method, the block is iterated # over all row vectors. # column(j) # returns the jth column vector. # when the block is supplied for the method, the block is iterated # over all column vectors. # collect # map # creates a matrix which is the result of iteration of given # block over all compornents. # minor(*param) # returns sub matrix. parameter is specified as the following: # 1. from_row, row_size, from_col, size_col # 2. from_row..to_row, from_col..to_col # TESTING: # regular? # Is regular? # singular? # Is singular? i.e. Is non-regular? # square? # Is square? # ARITHMETIC: # *(m) # times # +(m) # plus # -(m) # minus # /(m) # self * m.inv # inverse # inv # inverse # ** # power # Matrix functions: # determinant # det # returns the determinant # rank # returns the rank # trace # tr # returns the trace # transpose # t # returns the transposed # CONVERTING: # coerce(other) # row_vectors # array of row vectors # column_vectors # array of column vectors # to_a # converts each element to Array # to_f # converts each element to Float # to_i # converts each element to Integer # to_r # converts each element to Rational # PRINTING: # to_s # returns string representation # inspect # # class Vector # include ExceptionForMatrix # # INSTANCE CREATION: # Vector.[](*array) # Vector.elements(array, copy = TRUE) # ACCSESSING: # [](i) # size # ENUMRATIONS: # each2(v) # collect2(v) # ARITHMETIC: # *(x) "is matrix or number" # +(v) # -(v) # VECTOR FUNCTIONS: # inner_product(v) # collect # map # map2(v) # r # CONVERTING: # covector # to_a # to_f # to_i # to_r # coerce(other) # PRINTING: # to_s # inspect require "e2mmap.rb" module ExceptionForMatrix Exception2MessageMapper.extend_to(binding) def_e2message(TypeError, "wrong argument type %s (expected %s)") def_e2message(ArgumentError, "Wrong # of arguments(%d for %d)") def_exception("ErrDimensionMismatch", "\#{self.type} dimemsion mismatch") def_exception("ErrNotRegular", "Not Regular Matrix") def_exception("ErrOperationNotDefined", "This operation(%s) can\\'t defined") end class Matrix @RCS_ID='-$Id: matrix.rb,v 1.6 1998/07/31 03:39:49 keiju Exp keiju $-' include ExceptionForMatrix # instance creations private_class_method :new def Matrix.[](*rows) new(:init_rows, rows, FALSE) end def Matrix.rows(rows, copy = TRUE) new(:init_rows, rows, copy) end def Matrix.columns(columns) rows = (0 .. columns[0].size - 1).collect { |i| (0 .. columns.size - 1).collect { |j| columns[j][i] } } Matrix.rows(rows, FALSE) end def Matrix.diagonal(*values) size = values.size rows = (0 .. size - 1).collect { |j| row = Array.new(size).fill(0, 0, size) row[j] = values[j] row } self rows(rows, FALSE) end def Matrix.scalar(n, value) Matrix.diagonal(*Array.new(n).fill(value, 0, n)) end def Matrix.identity(n) Matrix.scalar(n, 1) end class << Matrix alias unit identity alias I identity end def Matrix.zero(n) Matrix.scalar(n, 0) end def Matrix.row_vector(row) case row when Vector Matrix.rows([row.to_a], FALSE) when Array Matrix.rows([row.dup], FALSE) else Matrix.row([[row]], FALSE) end end def Matrix.column_vector(column) case column when Vector Matrix.columns([column.to_a]) when Array Matrix.columns([column]) else Matrix.columns([[column]]) end end # initializing def initialize(init_method, *argv) self.send(init_method, *argv) end def init_rows(rows, copy) if copy @rows = rows.collect{|row| row.dup} else @rows = rows end self end private :init_rows #accessing def [](i, j) @rows[i][j] end def row_size @rows.size end def column_size @rows[0].size end def row(i) if iterator? for e in @rows[i] yield e end else Vector.elements(@rows[i]) end end def column(j) if iterator? 0.upto(row_size - 1) do |i| yield @rows[i][j] end else col = (0 .. row_size - 1).collect { |i| @rows[i][j] } Vector.elements(col, FALSE) end end def collect rows = @rows.collect{|row| row.collect{|e| yield e}} Matrix.rows(rows, FALSE) end alias map collect # # param: (from_row, row_size, from_col, size_col) # (from_row..to_row, from_col..to_col) # def minor(*param) case param.size when 2 from_row = param[0].first size_row = param[0].size from_col = param[1].first size_col = param[1].size when 4 from_row = param[0] size_row = param[1] from_col = param[2] size_col = param[3] else Matrix.fail ArgumentError, param.inspect end rows = @rows[from_row, size_row].collect{ |row| row[from_col, size_col] } Matrix.rows(rows, FALSE) end # TESTING def regular? square? and rank == column_size end def singular? not regular? end def square? column_size == row_size end # COMPARING def ==(other) return FALSE unless Matrix === other other.compare_by_row_vectors(@rows) end alias eql? == def compare_by_row_vectors(rows) return FALSE unless @rows.size == rows.size 0.upto(@rows.size - 1) do |i| return FALSE unless @rows[i] == rows[i] end TRUE end def clone Matrix.rows(@rows) end def hash value = 0 for row in @rows for e in row value ^= e.hash end end return value end # ARITHMETIC def *(m) #is matrix or vector or number" case(m) when Numeric rows = @rows.collect { |row| row.collect { |e| e * m } } return Matrix.rows(rows, FALSE) when Vector m = Matrix.column_vector(m) r = self * m return r.column(0) when Matrix Matrix.fail ErrDimensionMismatch if column_size != m.row_size rows = (0 .. row_size - 1).collect { |i| (0 .. m.column_size - 1).collect { |j| vij = 0 0.upto(column_size - 1) do |k| vij += self[i, k] * m[k, j] end vij } } return Matrix.rows(rows, FALSE) else x, y = m.coerce(self) return x * y end end def +(m) case m when Numeric Matrix.fail ErrOperationNotDefined, "+" when Vector m = Matrix.column_vector(m) when Matrix else x, y = m.coerce(self) return x + y end Matrix.fail ErrDimensionMismatch unless row_size == m.row_size and column_size == m.column_size rows = (0 .. row_size - 1).collect { |i| (0 .. column_size - 1).collect { |j| self[i, j] + m[i, j] } } Matrix.rows(rows, FALSE) end def -(m) case m when Numeric Matrix.fail ErrOperationNotDefined, "-" when Vector m = Matrix.column_vector(m) when Matrix else x, y = m.coerce(self) return x - y end Matrix.fail ErrDimensionMismatch unless row_size == m.row_size and column_size == m.column_size rows = (0 .. row_size - 1).collect { |i| (0 .. column_size - 1).collect { |j| self[i, j] - m[i, j] } } Matrix.rows(rows, FALSE) end def /(other) case other when Numeric rows = @rows.collect { |row| row.collect { |e| e / other } } return Matrix.rows(rows, FALSE) when Matrix return self * other.inverse else x, y = other.coerce(self) rerurn x / y end end def inverse Matrix.fail ErrDimensionMismatch unless square? Matrix.I(row_size).inverse_from(self) end alias inv inverse def inverse_from(src) size = row_size - 1 a = src.to_a for k in 0..size if (akk = a[k][k]) == 0 i = k begin fail ErrNotRegular if (i += 1) > size end while a[i][k] == 0 a[i], a[k] = a[k], a[i] @rows[i], @rows[k] = @rows[k], @rows[i] akk = a[k][k] end for i in 0 .. size next if i == k q = a[i][k] / akk a[i][k] = 0 (k + 1).upto(size) do |j| a[i][j] -= a[k][j] * q end 0.upto(size) do |j| @rows[i][j] -= @rows[k][j] * q end end (k + 1).upto(size) do |j| a[k][j] /= akk end 0.upto(size) do |j| @rows[k][j] /= akk end end self end #alias reciprocal inverse def ** (other) if other.kind_of?(Integer) x = self if other <= 0 x = self.inverse return Matrix.identity(self.column_size) if other == 0 other = -other end z = x n = other - 1 while n != 0 while (div, mod = n.divmod(2) mod == 0) x = x * x n = div end z *= x n -= 1 end z elsif other.kind_of?(Float) || defined?(Rational) && other.kind_of?(Rational) fail ErrOperationNotDefined, "**" else fail ErrOperationNotDefined, "**" end end # Matrix functions def determinant return 0 unless square? size = row_size - 1 a = to_a det = 1 k = 0 begin if (akk = a[k][k]) == 0 i = k begin return 0 if (i += 1) > size end while a[i][k] == 0 a[i], a[k] = a[k], a[i] akk = a[k][k] end (k + 1).upto(size) do |i| q = a[i][k] / akk (k + 1).upto(size) do |j| a[i][j] -= a[k][j] * q end end det *= akk end while (k += 1) <= size det end alias det determinant def rank if column_size > row_size a = transpose.to_a else a = to_a end rank = 0 k = 0 begin if (akk = a[k][k]) == 0 i = -1 nothing = FALSE begin if (i += 1) > column_size - 1 nothing = TRUE break end end while a[i][k] == 0 next if nothing a[i], a[k] = a[k], a[i] akk = a[k][k] end (k + 1).upto(row_size - 1) do |i| q = a[i][k] / akk (k + 1).upto(column_size - 1) do |j| a[i][j] -= a[k][j] * q end end rank += 1 end while (k += 1) <= column_size - 1 return rank end def trace tr = 0 0.upto(column_size - 1) do |i| tr += @rows[i][i] end tr end alias tr trace def transpose Matrix.columns(@rows) end alias t transpose # CONVERTING def coerce(other) case other when Numeric return Scalar.new(other), self end end def row_vectors rows = (0 .. column_size - 1).collect { |i| row(i) } rows end def column_vectors columns = (0 .. row_size - 1).collect { |i| column(i) } columns end def to_a @rows.collect{|row| row.collect{|e| e}} end def to_f collect{|e| e.to_f} end def to_i collect{|e| e.to_i} end def to_r collect{|e| e.to_r} end # PRINTING def to_s "Matrix[" + @rows.collect{ |row| "[" + row.collect{|e| e.to_s}.join(", ") + "]" }.join(", ")+"]" end def inspect "Matrix"+@rows.inspect end # Private CLASS class Scalar < Numeric include ExceptionForMatrix def initialize(value) @value = value end # ARITHMETIC def +(other) case other when Numeric Scalar.new(@value + other) when Vector, Matrix Scalar.fail WrongArgType, other.type, "Numeric or Scalar" when Scalar Scalar.new(@value + other.value) else x, y = other.coerce(self) x + y end end def -(other) case other when Numeric Scalar.new(@value - other) when Vector, Matrix Scalar.fail WrongArgType, other.type, "Numeric or Scalar" when Scalar Scalar.new(@value - other.value) else x, y = other.coerce(self) x - y end end def *(other) case other when Numeric Scalar.new(@value * other) when Vector, Matrix other.collect{|e| @value * e} else x, y = other.coerce(self) x * y end end def / (other) case other when Numeric Scalar.new(@value / other) when Vector Scalar.fail WrongArgType, other.type, "Numeric or Scalar or Matrix" when Matrix self * _M.inverse else x, y = other.coerce(self) x / y end end def ** (other) case other when Numeric Scalar.new(@value ** other) when Vector Scalar.fail WrongArgType, other.type, "Numeric or Scalar or Matrix" when Matrix other.powered_by(self) else x, y = other.coerce(self) x ** y end end end end #---------------------------------------------------------------------- # # - # #---------------------------------------------------------------------- class Vector include ExceptionForMatrix #INSTANCE CREATION private_class_method :new def Vector.[](*array) new(:init_elements, array, copy = FALSE) end def Vector.elements(array, copy = TRUE) new(:init_elements, array, copy) end def initialize(method, array, copy) self.send(method, array, copy) end def init_elements(array, copy) if copy @elements = array.dup else @elements = array end end # ACCSESSING def [](i) @elements[i] end def size @elements.size end # ENUMRATIONS def each2(v) Vector.fail ErrDimensionMismatch if size != v.size 0.upto(size - 1) do |i| yield @elements[i], v[i] end end def collect2(v) Vector.fail ErrDimensionMismatch if size != v.size (0 .. size - 1).collect do |i| yield @elements[i], v[i] end end # COMPARING def ==(other) return FALSE unless Vector === other other.compare_by(@elements) end alias eqn? == def compare_by(elements) @elements == elements end def clone Vector.elements(@elements) end def hash @elements.hash end # ARITHMETIC def *(x) "is matrix or number" case x when Numeric els = @elements.collect{|e| e * x} Vector.elements(els, FALSE) when Matrix self.covector * x else s, x = X.corece(self) s * x end end def +(v) case v when Vector Vector.fail ErrDimensionMismatch if size != v.size els = collect2(v) { |v1, v2| v1 + v2 } Vector.elements(els, FALSE) when Matrix Matrix.column_vector(self) + v else s, x = v.corece(self) s + x end end def -(v) case v when Vector Vector.fail ErrDimensionMismatch if size != v.size els = collect2(v) { |v1, v2| v1 - v2 } Vector.elements(els, FALSE) when Matrix Matrix.column_vector(self) - v else s, x = v.corece(self) s - x end end # VECTOR FUNCTIONS def inner_product(v) Vector.fail ErrDimensionMismatch if size != v.size p = 0 each2(v) { |v1, v2| p += v1 * v2 } p end def collect els = @elements.collect { |v| yield v } Vector.elements(els, FALSE) end alias map collect def map2(v) els = collect2(v) { |v1, v2| yield v1, v2 } Vector.elements(els, FALSE) end def r v = 0 for e in @elements v += e*e end return Math.sqrt(v) end # CONVERTING def covector Matrix.row_vector(self) end def to_a @elements.dup end def to_f collect{|e| e.to_f} end def to_i collect{|e| e.to_i} end def to_r collect{|e| e.to_r} end def coerce(other) case other when Numeric return Scalar.new(other), self end end # PRINTING def to_s "Vector[" + @elements.join(", ") + "]" end def inspect str = "Vector"+@elements.inspect end end ruby-1.2.3/lib/mkmf.rb100644 774 145 20157 6631443706 12616 0ustar matzNaCl# module to create Makefile for extension modules # invoke like: ruby -r mkmf extconf.rb require 'rbconfig' require 'find' include Config $found = false; $lib_cache = {} $lib_found = {} $func_cache = {} $func_found = {} $hdr_cache = {} $hdr_found = {} $config_cache = CONFIG["compile_dir"]+"/ext/config.cache" if File.exist?($config_cache) then f = open($config_cache, "r") while f.gets case $_ when /^lib: (.+) (yes|no)/ $lib_cache[$1] = $2 when /^func: ([\w_]+) (yes|no)/ $func_cache[$1] = $2 when /^hdr: (.+) (yes|no)/ $hdr_cache[$1] = $2 end end f.close end $srcdir = CONFIG["srcdir"] $libdir = CONFIG["libdir"]+"/"+CONFIG["ruby_install_name"] $archdir = $libdir+"/"+CONFIG["arch"] $install = CONFIG["INSTALL_PROGRAM"] $install_data = CONFIG["INSTALL_DATA"] if $install !~ /^\// then $install = CONFIG["srcdir"]+"/"+$install $install_data = CONFIG["srcdir"]+"/"+$install_data end if File.exist? $archdir + "/ruby.h" $hdrdir = $archdir elsif File.exist? $srcdir + "/ruby.h" $hdrdir = $srcdir else STDERR.print "can't find header files for ruby.\n" exit 1 end CFLAGS = CONFIG["CFLAGS"] if PLATFORM == "m68k-human" CFLAGS.gsub!(/-c..-stack=[0-9]+ */, '') end if /win32|djgpp|mingw32|m68k-human/i =~ PLATFORM $null = open("nul", "w") else $null = open("/dev/null", "w") end LINK = "#{CONFIG['CC']} -o conftest -I#{$srcdir} -I#{CONFIG['includedir']} #{CFLAGS} %s #{CONFIG['LDFLAGS']} %s conftest.c #{CONFIG['LIBS']} %s" CPP = "#{CONFIG['CPP']} -E -I#{$srcdir} -I#{CONFIG['includedir']} #{CFLAGS} %s conftest.c" $orgerr = $stderr.dup $orgout = $stdout.dup def xsystem command if $DEBUG print command, "\n" return system(command) end $stderr.reopen($null) $stdout.reopen($null) r = system(command) $stderr.reopen($orgerr) $stdout.reopen($orgout) return r end def try_link(libs) xsystem(format(LINK, $CFLAGS, $LDFLAGS, libs)) end def try_cpp xsystem(format(CPP, $CFLAGS)) end def install_rb(mfile) path = [] dir = [] Find.find("lib") do |f| next unless /\.rb$/ =~ f f = f[4..-1] path.push f dir |= File.dirname(f) end for f in dir next if f == "." mfile.printf "\t@test -d $(libdir)/%s || mkdir $(libdir)/%s\n", f, f end for f in path mfile.printf "\t$(INSTALL_DATA) lib/%s $(libdir)/%s\n", f, f end end def have_library(lib, func) printf "checking for %s() in -l%s... ", func, lib STDOUT.flush if $lib_cache[lib] if $lib_cache[lib] == "yes" if $libs $libs = "-l" + lib + " " + $libs else $libs = "-l" + lib end print "(cached) yes\n" return TRUE else print "(cached) no\n" return FALSE end end cfile = open("conftest.c", "w") cfile.printf "\ int main() { return 0; } int t() { %s(); return 0; } ", func cfile.close begin if $libs libs = "-l" + lib + " " + $libs else libs = "-l" + lib end unless try_link(libs) $lib_found[lib] = 'no' $found = TRUE print "no\n" return FALSE end ensure system "rm -f conftest*" end $libs = libs $lib_found[lib] = 'yes' $found = TRUE print "yes\n" return TRUE end def have_func(func) printf "checking for %s()... ", func STDOUT.flush if $func_cache[func] if $func_cache[func] == "yes" $defs.push(format("-DHAVE_%s", func.upcase)) print "(cached) yes\n" return TRUE else print "(cached) no\n" return FALSE end end cfile = open("conftest.c", "w") cfile.printf "\ char %s(); int main() { return 0; } int t() { %s(); return 0; } ", func, func cfile.close libs = $libs libs = "" if libs == nil begin unless try_link(libs) $func_found[func] = 'no' $found = TRUE print "no\n" return FALSE end ensure system "rm -f conftest*" end $defs.push(format("-DHAVE_%s", func.upcase)) $func_found[func] = 'yes' $found = TRUE print "yes\n" return TRUE end def have_header(header) printf "checking for %s... ", header STDOUT.flush if $hdr_cache[header] if $hdr_cache[header] == "yes" header.tr!("a-z./\055", "A-Z___") $defs.push(format("-DHAVE_%s", header)) print "(cached) yes\n" return TRUE else print "(cached) no\n" return FALSE end end cfile = open("conftest.c", "w") cfile.printf "\ #include <%s> ", header cfile.close begin unless try_cpp $hdr_found[header] = 'no' $found = TRUE print "no\n" return FALSE end ensure system "rm -f conftest*" end $hdr_found[header] = 'yes' header.tr!("a-z./\055", "A-Z___") $defs.push(format("-DHAVE_%s", header)) $found = TRUE print "yes\n" return TRUE end def create_header() print "creating extconf.h\n" STDOUT.flush if $defs.length > 0 hfile = open("extconf.h", "w") for line in $defs line =~ /^-D(.*)/ hfile.printf "#define %s 1\n", $1 end hfile.close end end def create_makefile(target) print "creating Makefile\n" STDOUT.flush if $libs and CONFIG["DLEXT"] == "o" libs = $libs.split for lib in libs lib.sub!(/-l(.*)/, '"lib\1.a"') end $defs.push(format("-DEXTLIB='%s'", libs.join(","))) end $libs = "" unless $libs $DLDFLAGS = CONFIG["DLDFLAGS"] if PLATFORM =~ /beos/ $libs = $libs + " -lruby" $DLDFLAGS = $DLDFLAGS + " -L" + CONFIG["prefix"] + "/lib" end unless $objs then $objs = Dir["*.{c,cc}"] for f in $objs f.sub!(/\.(c|cc)$/, ".o") end end $objs = $objs.join(" ") mfile = open("Makefile", "w") mfile.print < # Version: $Revision: 0.1 $ # USAGE: # # foo = Foo.new # foo.extend(MonitorMixin) # cond = foo.new_cond # # thread1: # foo.synchronize { # ... # cond.wait_until { foo.done? } # ... # } # # thread2: # foo.synchronize { # foo.do_something # cond.signal # } # ATTENTION: # # If you include MonitorMixin and override `initialize', you should # call `super'. # If you include MonitorMixin to built-in classes, you should override # `new' to call `mon_initialize'. ## Code: require "final" module MonitorMixin RCS_ID = %q$Id: monitor.rb,v 0.1 1998/03/01 08:40:18 shugo Exp shugo $ module Primitive include MonitorMixin MON_OWNER_TABLE = {} MON_COUNT_TABLE = {} MON_ENTERING_QUEUE_TABLE = {} MON_WAITING_QUEUE_TABLE = {} FINALIZER = Proc.new { |id| MON_OWNER_TABLE.delete(id) MON_COUNT_TABLE.delete(id) MON_ENTERING_QUEUE_TABLE.delete(id) MON_WAITING_QUEUE_TABLE.delete(id) } def self.extend_object(obj) super(obj) obj.mon_initialize end def mon_initialize MON_OWNER_TABLE[id] = nil MON_COUNT_TABLE[id] = 0 MON_ENTERING_QUEUE_TABLE[id] = [] MON_WAITING_QUEUE_TABLE[id] = [] ObjectSpace.define_finalizer(self, FINALIZER) end def mon_owner return MON_OWNER_TABLE[id] end def mon_count return MON_COUNT_TABLE[id] end def mon_entering_queue return MON_ENTERING_QUEUE_TABLE[id] end def mon_waiting_queue return MON_WAITING_QUEUE_TABLE[id] end def set_mon_owner(val) return MON_OWNER_TABLE[id] = val end def set_mon_count(val) return MON_COUNT_TABLE[id] = val end private :mon_count, :mon_entering_queue, :mon_waiting_queue, :set_mon_owner, :set_mon_count end module NonPrimitive include MonitorMixin attr_reader :mon_owner, :mon_count, :mon_entering_queue, :mon_waiting_queue def self.extend_object(obj) super(obj) obj.mon_initialize end def mon_initialize @mon_owner = nil @mon_count = 0 @mon_entering_queue = [] @mon_waiting_queue = [] end def set_mon_owner(val) @mon_owner = val end def set_mon_count(val) @mon_count = val end private :mon_count, :mon_entering_queue, :mon_waiting_queue, :set_mon_owner, :set_mon_count end def self.extendable_module(obj) if Fixnum === obj or TrueClass === obj or FalseClass === obj or NilClass === obj raise TypeError, "MonitorMixin can't extend #{obj.type}" else begin obj.instance_eval("@mon_owner") return NonPrimitive rescue TypeError return Primitive end end end def self.extend_object(obj) obj.extend(extendable_module(obj)) end def self.includable_module(klass) if klass.instance_of?(Module) return NonPrimitive end begin dummy = klass.new return extendable_module(dummy) rescue ArgumentError if klass.singleton_methods.include?("new") return Primitive else return NonPrimitive end rescue NameError raise TypeError, "#{klass} can't include MonitorMixin" end end def self.append_features(klass) mod = includable_module(klass) klass.module_eval("include mod") end def initialize(*args) super mon_initialize end def try_mon_enter result = false Thread.critical = true if mon_owner.nil? set_mon_owner(Thread.current) end if mon_owner == Thread.current set_mon_count(mon_count + 1) result = true end Thread.critical = false return result end def mon_enter Thread.critical = true while mon_owner != nil && mon_owner != Thread.current mon_entering_queue.push(Thread.current) Thread.stop Thread.critical = true end set_mon_owner(Thread.current) set_mon_count(mon_count + 1) Thread.critical = false end def mon_exit if mon_owner != Thread.current raise ThreadError, "current thread not owner" end Thread.critical = true set_mon_count(mon_count - 1) if mon_count == 0 set_mon_owner(nil) if mon_waiting_queue.empty? t = mon_entering_queue.shift else t = mon_waiting_queue.shift end end t.wakeup if t Thread.critical = false Thread.pass end def mon_synchronize mon_enter begin yield ensure mon_exit end end alias synchronize mon_synchronize class ConditionVariable def initialize(monitor) @monitor = monitor @waiters = [] end def wait if @monitor.mon_owner != Thread.current raise ThreadError, "current thread not owner" end @monitor.instance_eval(< 1, 'feb' => 2, 'mar' => 3, 'apr' => 4, 'may' => 5, 'jun' => 6, 'jul' => 7, 'aug' => 8, 'sep' => 9, 'oct' =>10, 'nov' =>11, 'dec' =>12 } MONTHPAT = MONTHS.keys.join('|') DAYS = { 'sun' => 0, 'mon' => 1, 'tue' => 2, 'wed' => 3, 'thu' => 4, 'fri' => 5, 'sat' => 6 } DAYPAT = DAYS.keys.join('|') def parsedate(date) # part of ISO 8601 # yyyy-mm-dd | yyyy-mm | yyyy # date hh:mm:ss | date Thh:mm:ss if date =~ /^(\d\d\d\d)-?(?:(\d\d)-?(\d\d)?)? *T?(?:(\d\d):?(\d\d):?(\d\d)?)?$/ return $1.to_i, if $2 then $2.to_i else 1 end, if $3 then $3.to_i else 1 end, if $4 then $4.to_i end, if $5 then $5.to_i end, if $6 then $6.to_i end, nil, nil end date = date.dup if date.sub!(/(#{DAYPAT})[a-z]*,?/i, ' ') wday = DAYS[$1.downcase] end if date.sub!(/(\d+):(\d+)(?::(\d+))?\s*(am|pm)?\s*(?:\s+([a-z]{1,4}(?:\s+[a-z]{1,4})?|[-+]\d{4}))?/i, ' ') hour = $1.to_i min = $2.to_i if $3 sec = $3.to_i end if $4 == 'pm' hour += 12 end if $5 zone = $5 end end if date.sub!(/(\d+)\S*\s+(#{MONTHPAT})\S*(?:\s+(\d+))?/i, ' ') mday = $1.to_i mon = MONTHS[$2.downcase] if $3 year = $3.to_i end elsif date.sub!(/(#{MONTHPAT})\S*\s+(\d+)\S*\s*,?(?:\s+(\d+))?/i, ' ') mon = MONTHS[$1.downcase] mday = $2.to_i if $3 year = $3.to_i end elsif date.sub!(/(\d+)\/(\d+)(?:\/(\d+))/, ' ') mon = $1.to_i mday = $2.to_i if $3 year = $3.to_i end end return year, mon, mday, hour, min, sec, zone, wday end module_function :parsedate end if __FILE__ == $0 p Time.now.asctime p ParseDate.parsedate(Time.now.asctime) end ruby-1.2.3/lib/ping.rb100644 774 145 2372 6610324454 12573 0ustar matzNaCl# # ping.rb -- check a host for upness # #= SYNOPSIS # # require 'ping' # print "'jimmy' is alive and kicking\n" if Ping.pingecho('jimmy', 10) ; # #= DESCRIPTION # # This module contains routines to test for the reachability of remote hosts. # Currently the only routine implemented is pingecho(). # # pingecho() uses a TCP echo (I an ICMP one) to determine if the # remote host is reachable. This is usually adequate to tell that a remote # host is available to rsh(1), ftp(1), or telnet(1) onto. # #== Parameters # # : hostname # # The remote host to check, specified either as a hostname or as an # IP address. # # : timeout # # The timeout in seconds. If not specified it will default to 5 seconds. # #= WARNING # # pingecho() uses user-level thread to implement the timeout, so it may block # for long period if named does not respond for some reason. # #=end require 'timeout' module Ping require "socket" def pingecho(host, timeout=5) begin timeout(timeout) do s = TCPsocket.new(host, "echo") s.close end rescue return false end return true end module_function "pingecho" end if $0 == __FILE__ host = ARGV[0] host ||= "localhost" printf("%s alive? - %s\n", host, Ping.pingecho(host, 5)) end ruby-1.2.3/lib/pstore.rb100644 774 145 4507 6552276476 13173 0ustar matzNaCl# # How to use: # # db = PStore.new("/tmp/foo") # db.transaction do # p db.roots # ary = db["root"] = [1,2,3,4] # ary[0] = [1,1.5] # end # db.transaction do # p db["root"] # end require "marshal" class PStore class Error < StandardError end def initialize(file) dir = File::dirname(file) unless File::directory? dir raise PStore::Error, format("directory %s does not exist", dir) end unless File::writable? dir raise PStore::Error, format("directory %s not writable", dir) end if File::exist? file and not File::readable? file raise PStore::Error, format("file %s not readable", file) end @transaction = false @filename = file @abort = false end def in_transaction raise PStore::Error, "not in transaction" unless @transaction end private :in_transaction def [](name) in_transaction value = @table[name] if value == nil raise PStore::Error, format("undefined root name `%s'", name) end value end def []=(name, value) in_transaction @table[name] = value end def roots in_transaction @table.keys end def root?(name) in_transaction @table.key? name end def path @filename end def commit @abort = false throw :pstore_abort_transaction end def abort @abort = true throw :pstore_abort_transaction end def transaction raise PStore::Error, "nested transaction" if @transaction begin @transaction = true value = file = nil begin File::open(@filename, "r") do |file| @table = Marshal.load(file) end rescue Errno::ENOENT @table = {} end begin catch(:pstore_abort_transaction) do value = yield(self) end rescue Exception @abort = true raise ensure unless @abort begin File::rename @filename, @filename+"~" rescue Errno::ENOENT no_orig = true end begin File::open(@filename, "w") do |file| Marshal::dump(@table, file) end rescue File::rename @filename+"~", @filename unless no_orig end end @abort = false end ensure @transaction = false end value end end if __FILE__ == $0 db = PStore.new("/tmp/foo") db.transaction do p db.roots ary = db["root"] = [1,2,3,4] ary[0] = [1,1.5] end db.transaction do p db["root"] end end ruby-1.2.3/lib/rational.rb100644 774 145 14410 6517330231 13457 0ustar matzNaCl# # rational.rb - # $Release Version: 0.5 $ # $Revision: 1.3 $ # $Date: 1998/03/11 14:09:03 $ # by Keiju ISHITSUKA(SHL Japan Inc.) # # -- # Usage: # class Rational < Numeric # (include Compareable) # # Rational(a, b) --> a/b # # Rational::+ # Rational::- # Rational::* # Rational::/ # Rational::** # Rational::% # Rational::divmod # Rational::abs # Rational::<=> # Rational::to_i # Rational::to_f # Rational::to_s # # Integer::gcd # Integer::lcm # Integer::gcdlcm # Integer::to_r # # Fixnum::** # Bignum::** # # def Rational(a, b = 1) if a.kind_of?(Rational) && b == 1 a else Rational.reduce(a, b) end end class Rational < Numeric @RCS_ID='-$Id: rational.rb,v 1.3 1998/03/11 14:09:03 keiju Exp keiju $-' def Rational.reduce(num, den = 1) raise ZeroDivisionError, "denometor is 0" if den == 0 if den < 0 num = -num den = -den end gcd = num.gcd(den) num = num.div(gcd) den = den.div(gcd) if den == 1 && defined?(Unify) num else new!(num, den) end end def Rational.new!(num, den = 1) new(num, den) end def initialize(num, den) if den < 0 num = -num den = -den end if num.kind_of?(Integer) and den.kind_of?(Integer) @numerator = num @denominator = den else @numerator = num.to_i @denoninator = den.to_i end end def + (a) if a.kind_of?(Rational) num = @numerator * a.denominator num_a = a.numerator * @denominator Rational(num + num_a, @denominator * a.denominator) elsif a.kind_of?(Integer) self + Rational.new!(a, 1) elsif a.kind_of?(Float) Float(self) + a else x , y = a.coerce(self) x + y end end def - (a) if a.kind_of?(Rational) num = @numerator * a.denominator num_a = a.numerator * @denominator Rational(num - num_a, @denominator*a.denominator) elsif a.kind_of?(Integer) self - Rational.new!(a, 1) elsif a.kind_of?(Float) Float(self) - a else x , y = a.coerce(self) x - y end end def * (a) if a.kind_of?(Rational) num = @numerator * a.numerator den = @denominator * a.denominator Rational(num, den) elsif a.kind_of?(Integer) self * Rational.new!(a, 1) elsif a.kind_of?(Float) Float(self) * a else x , y = a.coerce(self) x * y end end def / (a) if a.kind_of?(Rational) num = @numerator * a.denominator den = @denominator * a.numerator Rational(num, den) elsif a.kind_of?(Integer) raise ZeroDivisionError, "devided by 0" if a == 0 self / Rational.new!(a, 1) elsif a.kind_of?(Float) Float(self) / a else x , y = a.coerce(self) x / y end end def ** (other) if other.kind_of?(Rational) Float(self) ** other elsif other.kind_of?(Integer) if other > 0 num = @numerator ** other den = @denominator ** other elsif other < 0 num = @denominator ** -other den = @numerator ** -other elsif other == 0 num = 1 den = 1 end Rational.new!(num, den) elsif other.kind_of?(Float) Float(self) ** other else x , y = other.coerce(self) x ** y end end def % (other) value = (self / other).to_i return self - other * value end def divmod(other) value = (self / other).to_i return value, self - other * value end def abs if @numerator > 0 Rational.new!(@numerator, @denominator) else Rational.new!(-@numerator, @denominator) end end def <=> (other) if other.kind_of?(Rational) num = @numerator * other.denominator num_a = other.numerator * @denominator v = num - num_a if v > 0 return 1 elsif v < 0 return -1 else return 0 end elsif other.kind_of?(Integer) return self <=> Rational.new!(other, 1) elsif other.kind_of?(Float) return Float(self) <=> other else x , y = other.coerce(self) return x <=> y end end def coerce(other) if other.kind_of?(Float) return other, self.to_f elsif other.kind_of?(Integer) return Rational.new!(other, 1), self else super end end def to_i Integer(@numerator.div(@denominator)) end def to_f @numerator.to_f/@denominator.to_f end def to_s if @denominator == 1 @numerator.to_s else @numerator.to_s+"/"+@denominator.to_s end end def to_r self end def hash @numerator ^ @denominator end attr :numerator attr :denominator private :initialize end class Integer def numerator self end def denomerator 1 end def to_r Rational(self, 1) end def gcd(int) a = self.abs b = int.abs a, b = b, a if a < b while b != 0 void, a = a.divmod(b) a, b = b, a end return a end def lcm(int) a = self.abs b = int.abs gcd = a.gcd(b) (a.div(gcd)) * b end def gcdlcm(int) a = self.abs b = int.abs gcd = a.gcd(b) return gcd, (a.div(gcd)) * b end end class Fixnum alias div! /; def div(other) if other.kind_of?(Fixnum) self.div!(other) elsif other.kind_of?(Bignum) x, y = other.coerce(self) x.div!(y) else x, y = other.coerce(self) x / y end end # alias divmod! divmod if not defined? Complex alias power! **; end # def rdiv(other) # if other.kind_of?(Fixnum) # Rational(self, other) # elsif # x, y = other.coerce(self) # if defined?(x.div()) # x.div(y) # else # x / y # end # end # end def rdiv(other) Rational.new!(self,1) / other end def rpower (other) if other >= 0 self.power!(other) else Rational.new!(self,1)**other end end if not defined? Complex alias ** rpower end end class Bignum alias div! /; alias div /; alias divmod! divmod if not defined? power! alias power! ** end def rdiv(other) Rational.new!(self,1) / other end def rpower (other) if other >= 0 self.power!(other) else Rational.new!(self, 1)**other end end if not defined? Complex alias ** rpower end end ruby-1.2.3/lib/readbytes.rb100644 774 145 1113 6546060140 13605 0ustar matzNaCl# readbytes.rb # # add IO#readbytes, which reads fixed sized data. # it guarantees read data size. class TruncatedDataError expand_path(filename*) # \*FILENAME* -> filename*.collect{|fn| expand_path(fn)}.join(", ") # def Shell.def_commands(delegation_class, command_specs) for meth, args in command_specs arg_str = args.collect{|arg| arg.downcase}.join(", ") call_arg_str = args.collect{ |arg| case arg when /^(FILENAME.*)$/ format("expand_path(%s)", $1.downcase) when /^(\*FILENAME.*)$/ # \*FILENAME* -> filenames.collect{|fn| expand_path(fn)}.join(", ") $1.downcase + '.collect{|fn| expand_path(fn)}' else arg end }.join(", ") d = %Q[ def #{meth}(#{arg_str}) #{delegation_class}.#{meth}(#{call_arg_str}) end ] if debug? print d elsif verbose? print "Define #{meth}(#{arg_str})\n" end eval d end end # # File methods # open/foreach/unlink are defined elsewhere. # normal_delegation_file_methods = [ ["atime", ["FILENAME"]], ["basename", ["fn", "*opts"]], ["chmod", ["mode", "*FILENAMES"]], ["chown", ["owner", "group", "FILENAME"]], ["ctime", ["group", "*FILENAMES"]], ["delete", ["*FILENAMES"]], ["dirname", ["FILENAME"]], ["ftype", ["FILENAME"]], ["join", ["*items"]], ["link", ["FILENAME_O", "FILENAME_N"]], ["lstat", ["FILENAME"]], ["mtime", ["FILENAME"]], ["readlink", ["FILENAME"]], ["rename", ["FILENAME_FROM", "FILENAME_TO"]], ["size", ["FILENAME"]], ["split", ["pathname"]], ["stat", ["FILENAME"]], ["symlink", ["FILENAME_O", "FILENAME_N"]], ["truncate", ["FILENAME", "length"]], ["utime", ["atime", "mtime", "*FILENAMES"]]] def_commands(File, normal_delegation_file_methods) alias rm delete # FileTest method def_commands(FileTest, FileTest.singleton_methods.collect{|m| [m, ["FILENAME"]]}) # ftools methods normal_delegation_ftools_methods = [ ["syscopy", ["FILENAME_FROM", "FILENAME_TO"]], ["copy", ["FILENAME_FROM", "FILENAME_TO"]], ["move", ["FILENAME_FROM", "FILENAME_TO"]], ["compare", ["FILENAME_FROM", "FILENAME_TO"]], ["safe_unlink", ["*FILENAMES"]], ["makedirs", ["*FILENAMES"]], # ["chmod", ["mode", "*FILENAMES"]], ["install", ["FILENAME_FROM", "FILENAME_TO", "mode"]], ] def_commands(File, normal_delegation_ftools_methods) alias cmp compare alias mv move alias cp copy alias rm_f safe_unlink alias mkpath makedirs # test function alias top_level_test test def test(command, file1, file2 = nil) if file2 top_level_test command, expand_path(file1), expand_path(file2) else top_level_test command, expand_path(file1) end end # shell functions def echo(*strings) Echo.new(self, *strings) end def cat(*filenames) Cat.new(self, *filenames) end def tee(file) Tee.new(self, file) end # def sort(*filenames) # Sort.new(self, *filenames) # end def system(command, *opts) System.new(self, find_system_command(command), *opts) end # # search for command, raise exception if not found. # def find_system_command(command) return command if /^\// =~ command case path = @system_commands[command] when String if sh.exists?(path) return path else Shell.fail CommandNotFound, command end when FALSE Shell.fail CommandNotFound, command end for p in @system_path path = join(p, command) if FileTest.exists?(path) @system_commands[command] = path return path end end @system_commands[command] = FALSE # Shell.fail CommandNotFound, command raise CommandNotFound, command end # # define command as singleton method. # def def_system_command(command, path = command) d = " def self.#{command}(*opts) System.new(self, find_system_command('#{path}'), *opts) end " begin eval d rescue print "Can't define self.#{command} path: #{path}\n" if debug? or verbose? Shell.fail CanNotDefine, comamnd, path end if debug? print d elsif verbose? print "Define self.#{command} path: #{path}\n" end end # # define command as Shell method. # def Shell.def_system_command(command, path = command) d = " def #{command}(*opts) System.new(self, '#{path}', *opts) end " begin eval d rescue print "Can't define #{command} path: #{path}\n" if debug? or verbose? Shell.fail CanNotDefine, comamnd, path end if debug? print d elsif verbose? print "Define #{command} path: #{path}\n" end end # # defines commands on default_path. if the method is already defined, # do nothing. as default, methods are prefixed by "sys_". # invalid characters as method name are converted into "_". # def Shell.install_system_command(pre = "sys_") defined_meth = {} for m in Shell.methods defined_meth[m] = TRUE end sh = Shell.new for path in Shell.default_path next unless sh.directory? path sh.cd path sh.foreach do |cn| if !defined_meth[pre + cn] && sh.file?(cn) && sh.executable?(cn) command = (pre + cn).gsub(/\W/, "_").sub(/^([0-9])/, '_\1') begin def_system_command(command, sh.expand_path(cn)) rescue printf("Warning: Can't define %s path: %s\n", comamnd, cn) unless debug? or verbose? end defined_meth[command] = command end end end end # # Filter # required method: # each() class Filter include Enumerable include Error def initialize(sh) @shell = sh end def input=(filter) @input = filter end def each(rs = nil) rs = @shell.record_separator unless rs if @input @input.each(rs){|l| yield l} end end def < (src) case src when String cat = Cat.new(@shell, src) cat | self when IO @input = src self else Filter.fail CanNotMethodApply, "<", to.type end end def > (to) case to when String dst = @shell.open(to, "w") begin each(){|l| dst << l} ensure dst.close end when IO each(){|l| to << l} else Filter.fail CanNotMethodApply, ">", to.type end self end def >> (to) case to when String dst = @shell.open(to, "a") begin each(){|l| dst << l} ensure dst.close end when IO each(){|l| to << l} else Filter.fail CanNotMethodApply, ">>", to.type end self end def | (filter) filter.input = self filter end def method_missing(method, *args) if Shell.cascade? and @shell.respond_to?(method) self | @shell.send(method, *args) else super end end def to_a ary = [] each(){|l| ary.push l} ary end def to_s str = "" each(){|l| str.concat l} str end end class Echo < Filter def initialize(sh, *strings) super sh @strings = strings end def each(rs = nil) rs = @shell.record_separator unless rs for str in @strings yield str + rs end end end class Cat < Filter def initialize(sh, *filenames) super sh @cat_files = filenames end def each(rs = nil) if @cat_files.empty? super else for src in @cat_files @shell.foreach(src, rs){|l| yield l} end end end end # class Sort < Cat # def initialize(sh, *filenames) # super # end # # def each(rs = nil) # ary = [] # super{|l| ary.push l} # for l in ary.sort! # yield l # end # end # end class Tee < Filter def initialize(sh, filename) super sh @to_filename = filename end def each(rs = nil) to = @shell.open(@to_filename, "w") begin super{|l| to << l; yield l} ensure to.close end end end class System < Filter def initialize(sh, command, *opts) require "socket" super(sh) # @sock_me, @sock_peer = Socket.pair(Socket::AF_UNIX, Socket::SOCK_STREAM, 0) @pipe_me_in, @pipe_peer_out = pipe @pipe_peer_in, @pipe_me_out = pipe begin pid = fork { # @sock_me.close @pipe_me_in.close @pipe_me_out.close # STDIN.reopen(@sock_peer) # STDOUT.reopen(@sock_peer) STDIN.reopen(@pipe_peer_in) STDOUT.reopen(@pipe_peer_out) fork { exec(command + " " + opts.join(" ")) } exit } # print pid; $stdout.flush ensure # sock_peer.close @pipe_peer_in.close @pipe_peer_out.close begin Process.waitpid(pid, nil) rescue Errno::ECHILD end end end def each(rs = nil) rs = @shell.record_separator unless rs begin th_o = Thread.start{ super{|l| @pipe_me_out.print l} # @sock_me.shutdown(0) @pipe_me_out.close } begin @pipe_me_in.each(rs) do |l| # print l yield l end ensure th_o.exit end ensure # @sock_peer.close unless @sock_peer.closed? # @sock_me.close @pipe_me_in.close end end end end ruby-1.2.3/lib/shellwords.rb100644 774 145 1735 6570715670 14037 0ustar matzNaCl# shellwords.rb # original is shellwords.pl # # Usage: # require 'shellwords.rb' # words = Shellwords.shellwords(line) # # or # # include Shellwords # words = shellwords(line) module Shellwords def shellwords(line) return '' unless line line.sub! /^\s+/, '' words = [] while line != '' field = '' while TRUE if line.sub! /^"(([^"\\]|\\.)*)"/, '' then #" snippet = $1 snippet.gsub! /\\(.)/, '\1' elsif line =~ /^"/ then #" raise ArgError, "Unmatched double quote: #{line}" elsif line.sub! /^'(([^'\\]|\\.)*)'/, '' then #' snippet = $1 snippet.gsub! /\\(.)/, '\1' elsif line =~ /^'/ then #' raise ArgError, "Unmatched single quote: #{line}" elsif line.sub! /^\\(.)/, '' then snippet = $1 elsif line.sub! /^([^\s\\'"]+)/, '' then #' snippet = $1 else line.sub! /^\s+/, '' break end field += snippet end words += field end words end module_function :shellwords end ruby-1.2.3/lib/singleton.rb100644 774 145 1446 6550626730 13646 0ustar matzNaCl# Singleton module that ensures only one object to be allocated. # # Usage: # class SomeSingletonClass # include Singleton # #.... # end # a = SomeSingletonClass.instance # b = SomeSingletonClass.instance # a and b are same object # p [a,b] # a = SomeSingletonClass.new # error (`new' is private) module Singleton def Singleton.append_features(klass) klass.private_class_method(:new) klass.instance_eval %{ def instance unless @__instance__ @__instance__ = new end return @__instance__ end } end end if __FILE__ == $0 class SomeSingletonClass include Singleton #.... end a = SomeSingletonClass.instance b = SomeSingletonClass.instance # a and b are same object p [a,b] a = SomeSingletonClass.new # error (`new' is private) end ruby-1.2.3/lib/sync.rb100644 774 145 21560 6522307147 12634 0ustar matzNaCl# # sync.rb - カウント付2-フェーズロッククラス # $Release Version: 0.2$ # $Revision: 1.1.1.2.2.5 $ # $Date: 1998/05/01 08:56:44 $ # by Keiju ISHITSUKA # modified by matz # # -- # Sync_m, Synchronizer_m # Usage: # obj.extend(Sync_m) # or # class Foo # Sync_m.include_to self # : # end # # Sync_m#sync_mode # Sync_m#sync_locked?, locked? # Sync_m#sync_shared?, shared? # Sync_m#sync_exclusive?, sync_exclusive? # Sync_m#sync_try_lock, try_lock # Sync_m#sync_lock, lock # Sync_m#sync_unlock, unlock # # Sync, Synchronicer: # include Sync_m # Usage: # sync = Sync.new # # Sync#mode # Sync#locked? # Sync#shared? # Sync#exclusive? # Sync#try_lock(mode) -- mode = :EX, :SH, :UN # Sync#lock(mode) -- mode = :EX, :SH, :UN # Sync#unlock # Sync#synchronize(mode) {...} # # unless defined? Thread fail "Thread not available for this ruby interpreter" end require "final" module Sync_m RCS_ID='-$Header: /home/cvsroot/ruby/lib/sync.rb,v 1.1.1.2.2.5 1998/05/01 08:56:44 matz Exp $-' # lock mode UN = :UN SH = :SH EX = :EX # 例外定義 class Err < StandardError def Err.Fail(*opt) fail self, sprintf(self::Message, *opt) end class UnknownLocker < Err Message = "Thread(%s) not locked." def UnknownLocker.Fail(th) super(th.inspect) end end class LockModeFailer < Err Message = "Unknown lock mode(%s)" def LockModeFailer.Fail(mode) if mode.id2name mode = id2name end super(mode) end end end # include and extend initialize methods. def Sync_m.extendable_module(obj) if Fixnum === obj or TRUE === obj or FALSE === obj or nil == obj raise TypeError, "Sync_m can't extend to this class(#{obj.type})" else begin obj.instance_eval "@sync_locked" For_general_object rescue TypeError For_primitive_object end end end def Sync_m.includable_module(cl) begin dummy = cl.new Sync_m.extendable_module(dummy) rescue NameError # newが定義されていない時は, DATAとみなす. For_primitive_object end end def Sync_m.extend_class(cl) return super if cl.instance_of?(Module) # モジュールの時は何もしない. クラスの場合, 適切なモジュールの決定 # とaliasを行う. real = includable_module(cl) cl.module_eval %q{ include real alias locked? sync_locked? alias shared? sync_shared? alias exclusive? sync_exclusive? alias lock sync_lock alias unlock sync_unlock alias try_lock sync_try_lock alias synchronize sync_synchronize } end def Sync_m.extend_object(obj) obj.extend(Sync_m.extendable_module(obj)) end def sync_extended unless (defined? locked? and defined? shared? and defined? exclusive? and defined? lock and defined? unlock and defined? try_lock and defined? synchronize) eval "class << self alias locked? sync_locked? alias shared? sync_shared? alias exclusive? sync_exclusive? alias lock sync_lock alias unlock sync_unlock alias try_lock sync_try_lock alias synchronize sync_synchronize end" end end # accessing def sync_locked? sync_mode != UN end def sync_shared? sync_mode == SH end def sync_exclusive? sync_mode == EX end # locking methods. def sync_try_lock(mode = EX) return unlock if sync_mode == UN Thread.critical = TRUE ret = sync_try_lock_sub(sync_mode) Thread.critical = FALSE ret end def sync_lock(m = EX) return unlock if m == UN until (Thread.critical = TRUE; sync_try_lock_sub(m)) if sync_sh_locker[Thread.current] sync_upgrade_waiting.push [Thread.current, sync_sh_locker[Thread.current]] sync_sh_locker.delete(Thread.current) else sync_waiting.push Thread.current end Thread.stop end Thread.critical = FALSE self end def sync_unlock(m = EX) Thread.critical = TRUE if sync_mode == UN Thread.critical = FALSE Err::UnknownLocker.Fail(Thread.current) end m = sync_mode if m == EX and sync_mode == SH runnable = FALSE case m when UN Thread.critical = FALSE Err::UnknownLocker.Fail(Thread.current) when EX if sync_ex_locker == Thread.current if (self.sync_ex_count = sync_ex_count - 1) == 0 self.sync_ex_locker = nil if sync_sh_locker.include?(Thread.current) self.sync_mode = SH else self.sync_mode = UN end runnable = TRUE end else Err::UnknownLocker.Fail(Thread.current) end when SH if (count = sync_sh_locker[Thread.current]).nil? Err::UnknownLocker.Fail(Thread.current) else if (sync_sh_locker[Thread.current] = count - 1) == 0 sync_sh_locker.delete(Thread.current) if sync_sh_locker.empty? and sync_ex_count == 0 self.sync_mode = UN runnable = TRUE end end end end if runnable if sync_upgrade_waiting.size > 0 for k, v in sync_upgrade_waiting sync_sh_locker[k] = v end wait = sync_upgrade_waiting self.sync_upgrade_waiting = [] Thread.critical = FALSE for w, v in wait w.run end else wait = sync_waiting self.sync_waiting = [] Thread.critical = FALSE for w in wait w.run end end end Thread.critical = FALSE self end def sync_try_lock_sub(m) case m when SH case sync_mode when UN self.sync_mode = m sync_sh_locker[Thread.current] = 1 ret = TRUE when SH count = 0 unless count = sync_sh_locker[Thread.current] sync_sh_locker[Thread.current] = count + 1 ret = TRUE when EX # 既に, モードがEXである時は, 必ずEXロックとなる. if sync_ex_locker == Thread.current self.sync_ex_count = sync_ex_count + 1 ret = TRUE else ret = FALSE end end when EX if sync_mode == UN or sync_mode == SH && sync_sh_locker.size == 1 && sync_sh_locker.include?(Thread.current) self.sync_mode = m self.sync_ex_locker = Thread.current self.sync_ex_count = 1 ret = TRUE elsif sync_mode == EX && sync_ex_locker == Thread.current self.sync_ex_count = sync_ex_count + 1 ret = TRUE else ret = FALSE end else Thread.critical = FALSE Err::LockModeFailer.Fail mode end return ret end private :sync_try_lock_sub def sync_synchronize(mode = EX) sync_lock(mode) begin yield ensure sync_unlock end end # internal class module For_primitive_object include Sync_m LockState = Struct.new("LockState", :mode, :waiting, :upgrade_waiting, :sh_locker, :ex_locker, :ex_count) Sync_Locked = Hash.new def For_primitive_object.extend_object(obj) super obj.sync_extended # Changed to use `final.rb'. # Finalizer.add(obj, For_primitive_object, :sync_finalize) ObjectSpace.define_finalizer(obj) do |id| For_primitive_object.sync_finalize(id) end end def initialize super Sync_Locked[id] = LockState.new(UN, [], [], Hash.new, nil, 0 ) self end def sync_extended super initialize end def For_primitive_object.sync_finalize(id) wait = Sync_Locked.delete(id) # waiting == [] ときだけ GCされるので, 待ち行列の解放は意味がない. end def sync_mode Sync_Locked[id].mode end def sync_mode=(value) Sync_Locked[id].mode = value end def sync_waiting Sync_Locked[id].waiting end def sync_waiting=(v) Sync_Locked[id].waiting = v end def sync_upgrade_waiting Sync_Locked[id].upgrade_waiting end def sync_upgrade_waiting=(v) Sync_Locked[id].upgrade_waiting = v end def sync_sh_locker Sync_Locked[id].sh_locker end def sync_sh_locker=(v) Sync_Locked[id].sh_locker = v end def sync_ex_locker Sync_Locked[id].ex_locker end def sync_ex_locker=(value) Sync_Locked[id].ex_locker = value end def sync_ex_count Sync_Locked[id].ex_count end def sync_ex_count=(value) Sync_Locked[id].ex_count = value end end module For_general_object include Sync_m def For_general_object.extend_object(obj) super obj.sync_extended end def initialize super @sync_mode = UN @sync_waiting = [] @sync_upgrade_waiting = [] @sync_sh_locker = Hash.new @sync_ex_locker = nil @sync_ex_count = 0 self end def sync_extended super initialize end attr :sync_mode, TRUE attr :sync_waiting, TRUE attr :sync_upgrade_waiting, TRUE attr :sync_sh_locker, TRUE attr :sync_ex_locker, TRUE attr :sync_ex_count, TRUE end end Synchronizer_m = Sync_m class Sync Sync_m.extend_class self #include Sync_m def initialize super end end Synchronizer = Sync ruby-1.2.3/lib/telnet.rb100644 774 145 33445 6607262125 13160 0ustar matzNaCl# # telnet.rb # ver0.16 1998/10/09 # Wakou Aoyama # # ver0.16 1998/10/09 # preprocess method change for the better # add binmode method. # change default Binmode # TRUE --> FALSE # # ver0.15 1998/10/04 # add telnetmode method. # # ver0.141 1998/09/22 # change default prompt # /[$%#>] $/ --> /[$%#>] \Z/ # # ver0.14 1998/09/01 # IAC WILL SGA send EOL --> CR+NULL # IAC WILL SGA IAC DO BIN send EOL --> CR # NONE send EOL --> LF # add Dump_log option. # # ver0.13 1998/08/25 # add print method. # # ver0.122 1998/08/05 # support for HP-UX 10.20 thanks to WATANABE Tetsuya # socket.<< --> socket.write # # ver0.121 1998/07/15 # string.+= --> string.concat # # ver0.12 1998/06/01 # add timeout, waittime. # # ver0.11 1998/04/21 # add realtime output. # # ver0.10 1998/04/13 # first release. # # == make new Telnet object # host = Telnet.new({"Binmode" => FALSE, default: FALSE # "Host" => "localhost", default: "localhost" # "Output_log" => "output_log", default: not output # "Dump_log" => "dump_log", default: not output # "Port" => 23, default: 23 # "Prompt" => /[$%#>] \Z/, default: /[$%#>] \Z/ # "Telnetmode" => TRUE, default: TRUE # "Timeout" => 10, default: 10 # "Waittime" => 0}) default: 0 # # if set "Telnetmode" option FALSE. not TELNET command interpretation. # "Waittime" is time to confirm "Prompt". There is a possibility that # the same character as "Prompt" is included in the data, and, when # the network or the host is very heavy, the value is enlarged. # # == wait for match # line = host.waitfor(/match/) # line = host.waitfor({"Match" => /match/, # "String" => "string", # "Timeout" => secs}) # if set "String" option. Match = Regexp.new(quote(string)) # # realtime output. of cource, set sync=TRUE or flush is necessary. # host.waitfor(/match/){|c| print c } # host.waitfor({"Match" => /match/, # "String" => "string", # "Timeout" => secs}){|c| print c} # # == send string and wait prompt # line = host.cmd("string") # line = host.cmd({"String" => "string", # "Prompt" => /[$%#>] \Z/, # "Timeout" => 10}) # # realtime output. of cource, set sync=TRUE or flush is necessary. # host.cmd("string"){|c| print c } # host.cmd({"String" => "string", # "Prompt" => /[$%#>] \Z/, # "Timeout" => 10}){|c| print c } # # == send string # host.print("string") # # == turn telnet command interpretation # host.telnetmode # turn on/off # host.telnetmode(TRUE) # on # host.telnetmode(FALSE) # off # # == toggle newline translation # host.binmode # turn TRUE/FALSE # host.binmode(TRUE) # no translate newline # host.binmode(FALSE) # translate newline # # == login # host.login("username", "password") # host.login({"Name" => "username", # "Password" => "password", # "Prompt" => /[$%#>] \Z/, # "Timeout" => 10}) # # realtime output. of cource, set sync=TRUE or flush is necessary. # host.login("username", "password"){|c| print c } # host.login({"Name" => "username", # "Password" => "password", # "Prompt" => /[$%#>] \Z/, # "Timeout" => 10}){|c| print c } # # and Telnet object has socket class methods # # == sample # localhost = Telnet.new({"Host" => "localhost", # "Timeout" => 10, # "Prompt" => /[$%#>] \Z/}) # localhost.login("username", "password"){|c| print c } # localhost.cmd("command"){|c| print c } # localhost.close # # == sample 2 # checks a POP server to see if you have mail. # # pop = Telnet.new({"Host" => "your_destination_host_here", # "Port" => 110, # "Telnetmode" => FALSE, # "Prompt" => /^\+OK/}) # pop.cmd("user " + "your_username_here"){|c| print c} # pop.cmd("pass " + "your_password_here"){|c| print c} # pop.cmd("list"){|c| print c} require "socket" require "delegate" require "thread" class TimeOut < Exception end class Telnet < SimpleDelegator def timeout(sec) is_timeout = FALSE begin x = Thread.current y = Thread.start { sleep sec if x.alive? #print "timeout!\n" x.raise TimeOut, "timeout" end } begin yield rescue TimeOut is_timeout = TRUE end ensure Thread.kill y if y && y.alive? end is_timeout end IAC = 255.chr # interpret as command: DONT = 254.chr # you are not to use option DO = 253.chr # please, you use option WONT = 252.chr # I won't use option WILL = 251.chr # I will use option SB = 250.chr # interpret as subnegotiation GA = 249.chr # you may reverse the line EL = 248.chr # erase the current line EC = 247.chr # erase the current character AYT = 246.chr # are you there AO = 245.chr # abort output--but let prog finish IP = 244.chr # interrupt process--permanently BREAK = 243.chr # break DM = 242.chr # data mark--for connect. cleaning NOP = 241.chr # nop SE = 240.chr # end sub negotiation EOR = 239.chr # end of record (transparent mode) ABORT = 238.chr # Abort process SUSP = 237.chr # Suspend process EOF = 236.chr # End of file SYNCH = 242.chr # for telfunc calls OPT_BINARY = 0.chr # Binary Transmission OPT_ECHO = 1.chr # Echo OPT_RCP = 2.chr # Reconnection OPT_SGA = 3.chr # Suppress Go Ahead OPT_NAMS = 4.chr # Approx Message Size Negotiation OPT_STATUS = 5.chr # Status OPT_TM = 6.chr # Timing Mark OPT_RCTE = 7.chr # Remote Controlled Trans and Echo OPT_NAOL = 8.chr # Output Line Width OPT_NAOP = 9.chr # Output Page Size OPT_NAOCRD = 10.chr # Output Carriage-Return Disposition OPT_NAOHTS = 11.chr # Output Horizontal Tab Stops OPT_NAOHTD = 12.chr # Output Horizontal Tab Disposition OPT_NAOFFD = 13.chr # Output Formfeed Disposition OPT_NAOVTS = 14.chr # Output Vertical Tabstops OPT_NAOVTD = 15.chr # Output Vertical Tab Disposition OPT_NAOLFD = 16.chr # Output Linefeed Disposition OPT_XASCII = 17.chr # Extended ASCII OPT_LOGOUT = 18.chr # Logout OPT_BM = 19.chr # Byte Macro OPT_DET = 20.chr # Data Entry Terminal OPT_SUPDUP = 21.chr # SUPDUP OPT_SUPDUPOUTPUT = 22.chr # SUPDUP Output OPT_SNDLOC = 23.chr # Send Location OPT_TTYPE = 24.chr # Terminal Type OPT_EOR = 25.chr # End of Record OPT_TUID = 26.chr # TACACS User Identification OPT_OUTMRK = 27.chr # Output Marking OPT_TTYLOC = 28.chr # Terminal Location Number OPT_3270REGIME = 29.chr # Telnet 3270 Regime OPT_X3PAD = 30.chr # X.3 PAD OPT_NAWS = 31.chr # Negotiate About Window Size OPT_TSPEED = 32.chr # Terminal Speed OPT_LFLOW = 33.chr # Remote Flow Control OPT_LINEMODE = 34.chr # Linemode OPT_XDISPLOC = 35.chr # X Display Location OPT_OLD_ENVIRON = 36.chr # Environment Option OPT_AUTHENTICATION = 37.chr # Authentication Option OPT_ENCRYPT = 38.chr # Encryption Option OPT_NEW_ENVIRON = 39.chr # New Environment Option OPT_EXOPL = 255.chr # Extended-Options-List NULL = "\000" CR = "\015" LF = "\012" EOL = CR + LF def initialize(options) @options = options @options["Binmode"] = FALSE if not @options.include?("Binmode") @options["Host"] = "localhost" if not @options.include?("Host") @options["Port"] = 23 if not @options.include?("Port") @options["Prompt"] = /[$%#>] \Z/ if not @options.include?("Prompt") @options["Telnetmode"] = TRUE if not @options.include?("Telnetmode") @options["Timeout"] = 10 if not @options.include?("Timeout") @options["Waittime"] = 0 if not @options.include?("Waittime") @telnet_option = { "SGA" => FALSE, "BINARY" => FALSE } if @options.include?("Output_log") @log = File.open(@options["Output_log"], 'a+') @log.sync = TRUE @log.binmode end if @options.include?("Dump_log") @dumplog = File.open(@options["Dump_log"], 'a+') @dumplog.sync = TRUE @dumplog.binmode end message = "Trying " + @options["Host"] + "...\n" STDOUT.write(message) @log.write(message) if @options.include?("Output_log") @dumplog.write(message) if @options.include?("Dump_log") is_timeout = timeout(@options["Timeout"]){ begin @sock = TCPsocket.open(@options["Host"], @options["Port"]) rescue @log.write($! + "\n") if @options.include?("Output_log") @dumplog.write($! + "\n") if @options.include?("Dump_log") raise end } raise TimeOut, "timed-out; opening of the host" if is_timeout @sock.sync = TRUE @sock.binmode message = "Connected to " + @options["Host"] + ".\n" STDOUT.write(message) @log.write(message) if @options.include?("Output_log") @dumplog.write(message) if @options.include?("Dump_log") super(@sock) end def telnetmode(mode = 'turn') if 'turn' == mode @options["Telnetmode"] = @options["Telnetmode"] ? FALSE : TRUE else @options["Telnetmode"] = mode ? TRUE : FALSE end end def binmode(mode = 'turn') if 'turn' == mode @options["Binmode"] = @options["Binmode"] ? FALSE : TRUE else @options["Binmode"] = mode ? TRUE : FALSE end end def preprocess(str) if not @options["Binmode"] str.gsub!(/#{CR}#{NULL}/no, CR) # combine CR+NULL into CR str.gsub!(/#{EOL}/no, "\n") # combine EOL into "\n" end # respond to "IAC DO x" str.gsub!(/(?:(?!#{IAC}))?#{IAC}#{DO}([#{OPT_BINARY}-#{OPT_NEW_ENVIRON}#{OPT_EXOPL}])/no){ if OPT_BINARY == $1 @telnet_option["BINARY"] = TRUE @sock.write(IAC + WILL + OPT_BINARY) else @sock.write(IAC + WONT + $1) end '' } # respond to "IAC DON'T x" with "IAC WON'T x" str.gsub!(/(?:(?!#{IAC}))?#{IAC}#{DONT}([#{OPT_BINARY}-#{OPT_NEW_ENVIRON}#{OPT_EXOPL}])/no){ @sock.write(IAC + WONT + $1) '' } # respond to "IAC WILL x" str.gsub!(/(?:(?!#{IAC}))?#{IAC}#{WILL}([#{OPT_BINARY}-#{OPT_NEW_ENVIRON}#{OPT_EXOPL}])/no){ if OPT_SGA == $1 @telnet_option["SGA"] = TRUE @sock.write(IAC + DO + OPT_SGA) end '' } # ignore "IAC WON'T x" str.gsub!(/(?:(?!#{IAC}))?#{IAC}#{WONT}[#{OPT_BINARY}-#{OPT_NEW_ENVIRON}#{OPT_EXOPL}]/no, '') # respond to "IAC AYT" (are you there) str.gsub!(/(?:(?!#{IAC}))?#{IAC}#{AYT}/no){ @sock.write("nobody here but us pigeons" + EOL) '' } str.gsub(/#{IAC}#{IAC}/no, IAC) # handle escaped IAC characters end def waitfor(options) timeout = @options["Timeout"] waittime = @options["Waittime"] if options.kind_of?(Hash) prompt = options["Prompt"] if options.include?("Prompt") timeout = options["Timeout"] if options.include?("Timeout") waittime = options["Waittime"] if options.include?("Waittime") prompt = Regexp.new( Regexp.quote(options["String"]) ) if options.include?("String") else prompt = options end line = '' until(not select([@sock], nil, nil, waittime) and prompt === line) raise TimeOut, "timed-out; wait for the next data" if not select([@sock], nil, nil, timeout) buf = '' begin buf = @sock.sysread(1024 * 1024) @dumplog.print(buf) if @options.include?("Dump_log") buf = preprocess(buf) if @options["Telnetmode"] rescue EOFError # End of file reached break ensure @log.print(buf) if @options.include?("Output_log") yield buf if iterator? line.concat(buf) end end line end def print(string) string.gsub!(/#{IAC}/no, IAC + IAC) if @options["Telnetmode"] if @options["Binmode"] @sock.write(string) else if @telnet_option["BINARY"] and @telnet_option["SGA"] # IAC WILL SGA IAC DO BIN send EOL --> CR @sock.write(string.gsub(/\n/, CR) + CR) elsif @telnet_option["SGA"] # IAC WILL SGA send EOL --> CR+NULL @sock.write(string.gsub(/\n/, CR + NULL) + CR + NULL) else # NONE send EOL --> LF @sock.write(string.gsub(/\n/, LF) + LF) end end end def cmd(options) match = @options["Prompt"] timeout = @options["Timeout"] if options.kind_of?(Hash) string = options["String"] match = options["Match"] if options.include?("Match") timeout = options["Timeout"] if options.include?("Timeout") else string = options end select(nil, [@sock]) print(string) if iterator? waitfor({"Prompt" => match, "Timeout" => timeout}){|c| yield c } else waitfor({"Prompt" => match, "Timeout" => timeout}) end end def login(options, password = '') if options.kind_of?(Hash) username = options["Name"] password = options["Password"] else username = options end if iterator? line = waitfor(/login[: ]*\Z/){|c| yield c } line.concat( cmd({"String" => username, "Match" => /Password[: ]*\Z/}){|c| yield c } ) line.concat( cmd(password){|c| yield c } ) else line = waitfor(/login[: ]*\Z/) line.concat( cmd({"String" => username, "Match" => /Password[: ]*\Z/}) ) line.concat( cmd(password) ) end line end end ruby-1.2.3/lib/tempfile.rb100644 774 145 3666 6557570163 13464 0ustar matzNaCl# # $Id: tempfile.rb,v 1.1.2.8 1998/07/29 09:50:43 matz Exp $ # # The class for temporary files. # o creates a temporary file, which name is "basename.pid.n" with mode "w+". # o Tempfile objects can be used like IO object. # o with tmpfile.close(true) created temporary files are removed. # o created files are also removed on script termination. # o with Tempfile#open, you can reopen the temporary file. # o file mode of the temporary files are 0600. require 'delegate' require 'final' class Tempfile < SimpleDelegator Max_try = 10 def Tempfile.callback(path) lambda{ print "removing ", path, "..." if $DEBUG if File.exist?(path) File.unlink(path) end if File.exist?(path + '.lock') File.rmdir(path + '.lock') end print "done\n" if $DEBUG } end def initialize(basename, tmpdir = '/tmp') umask = File.umask(0177) tmpname = lock = nil begin n = 0 while true begin tmpname = sprintf('%s/%s.%d.%d', tmpdir, basename, $$, n) lock = tmpname + '.lock' unless File.exist?(lock) Dir.mkdir(lock) break end rescue raise "cannot generate tmpfile `%s'" % tmpname if n >= Max_try #sleep(1) end n += 1 end @clean_files = Tempfile.callback(tmpname) ObjectSpace.define_finalizer(self, @clean_files) @tmpname = tmpname @tmpfile = File.open(tmpname, 'w+') super(@tmpfile) Dir.rmdir(lock) ensure File.umask(umask) end end def Tempfile.open(*args) Tempfile.new(*args) end def open @tmpfile.close if @tmpfile @tmpfile = File.open(@tmpname, 'r+') __setobj__(@tmpfile) end def close(real=false) @tmpfile.close if @tmpfile @tmpfile = nil if real @clean_files.call ObjectSpace.undefine_finalizer(self) end end end if __FILE__ == $0 # $DEBUG = true f = Tempfile.new("foo") f.print("foo\n") f.close f.open p f.gets # => "foo\n" f.close(true) end ruby-1.2.3/lib/thread.rb100644 774 145 5637 6522307147 13116 0ustar matzNaCl# # thread.rb - thread support classes # $Date: 1998/05/01 08:56:45 $ # by Yukihiro Matsumoto # unless defined? Thread fail "Thread not available for this ruby interpreter" end unless defined? ThreadError class ThreadError= max @max = max Thread.critical = FALSE else diff = max - @max @max = max Thread.critical = FALSE diff.times do t = @queue_wait.shift t.run if t end end max end def push(obj) Thread.critical = true while @que.length >= @max @queue_wait.push Thread.current Thread.stop Thread.critical = true end super end def pop(*args) Thread.critical = true if @que.length < @max t = @queue_wait.shift t.run if t end super end def num_waiting @waiting.size + @queue_wait.size end end ruby-1.2.3/lib/thwait.rb100644 774 145 6224 6564757636 13162 0ustar matzNaCl# # thwait.rb - thread synchronization class # $Release Version: 0.9 $ # $Revision: 1.3 $ # $Date: 1998/06/26 03:19:34 $ # by Keiju ISHITSUKA(Nihpon Rational Software Co.,Ltd.) # # -- # feature: # provides synchronization for multiple threads. # # class methods: # * ThreadsWait.all_waits(thread1,...) # waits until all of specified threads are terminated. # if a block is supplied for the method, evaluates it for # each thread termination. # * th = ThreadsWait.new(thread1,...) # creates synchronization object, specifying thread(s) to wait. # # methods: # * th.threads # list threads to be synchronized # * th.empty? # is there any thread to be synchronized. # * th.finished? # is there already terminated thread. # * th.join(thread1,...) # wait for specified thread(s). # * th.join_nowait(threa1,...) # specifies thread(s) to wait. non-blocking. # * th.next_wait # waits until any of specified threads is terminated. # * th.all_waits # waits until all of specified threads are terminated. # if a block is supplied for the method, evaluates it for # each thread termination. # require "thread.rb" require "e2mmap.rb" class ThreadsWait RCS_ID='-$Id: thwait.rb,v 1.3 1998/06/26 03:19:34 keiju Exp keiju $-' Exception2MessageMapper.extend_to(binding) def_exception("ErrNoWaitingThread", "No threads for waiting.") def_exception("ErrNoFinshedThread", "No finished threads.") def ThreadsWait.all_waits(*threads) tw = ThreadsWait.new(*threads) if iterator? tw.all_waits do |th| yield th end else tw.all_waits end end def initialize(*threads) @threads = [] @wait_queue = Queue.new join_nowait(*threads) unless threads.empty? end # accessing # threads - list threads to be synchronized attr :threads # testing # empty? # finished? # is there any thread to be synchronized. def empty? @threads.empty? end # is there already terminated thread. def finished? !@wait_queue.empty? end # main process: # join # join_nowait # next_wait # all_wait # adds thread(s) to join, waits for any of waiting threads to terminate. def join(*threads) join_nowait(*threads) next_wait end # adds thread(s) to join, no wait. def join_nowait(*threads) @threads.concat threads for th in threads Thread.start do th = Thread.join(th) @wait_queue.push th end end end # waits for any of waiting threads to terminate # if there is no thread to wait, raises ErrNoWaitingThread. # if `nonblock' is true, and there is no terminated thread, # raises ErrNoFinishedThread. def next_wait(nonblock = nil) ThreadsWait.fail ErrNoWaitingThread if @threads.empty? begin @threads.delete(th = @wait_queue.pop(nonblock)) th rescue ThreadError ThreadsWait.fail ErrNoFinshedThread end end # waits until all of specified threads are terminated. # if a block is supplied for the method, evaluates it for # each thread termination. def all_waits until @threads.empty? th = next_wait yield th if iterator? end end end ThWait = ThreadsWait ruby-1.2.3/lib/timeout.rb100644 774 145 1355 6610324424 13321 0ustar matzNaCl# # timeout.rb -- execution timeout # #= SYNOPSIS # # require 'timeout' # status = timeout(5) { # # something may take time # } # #= DESCRIPTION # # timeout executes the block. If the block execution terminates successfully # before timeout, it returns true. If not, it terminates the execution and # raise TimeoutError exception. # #== Parameters # # : timout # # The time in seconds to wait for block teminatation. # #=end class TimeoutError "-", "call" => ">", "return" => "<", "class" => "C", "end" => "E"} def initialize @threads = Hash.new if defined? Thread.main @threads[Thread.main.id] = 0 else @threads[Thread.current.id] = 0 end @get_line_procs = {} @sources = {} @filters = [] end def on if iterator? on begin yield ensure off end else set_trace_func proc{|event, file, line, id, binding| trace_func event, file, line, id, binding } print "Trace on\n" if Tracer.verbose? end end def off set_trace_func nil print "Trace off\n" if Tracer.verbose? end def add_filter(p = proc) @filters.push p end def set_get_line_procs(file, p = proc) @get_line_procs[file] = p end def get_line(file, line) if p = @get_line_procs[file] return p.call line end unless list = @sources[file] # print file if $DEBUG begin f = open(file) begin @sources[file] = list = f.readlines ensure f.close end rescue @sources[file] = list = [] end end if l = list[line - 1] l else "-\n" end end def get_thread_no if no = @threads[Thread.current.id] no else @threads[Thread.current.id] = @threads.size end end def trace_func(event, file, line, id, binding) return if file == MY_FILE_NAME #printf "Th: %s\n", Thread.current.inspect for p in @filters return unless p.call event, file, line, id, binding end Thread.critical = TRUE printf("#%d:%s:%d:%s: %s", get_thread_no, file, line, EVENT_SYMBOL[event], get_line(file, line)) Thread.critical = FALSE end Single = new def Tracer.on if iterator? Single.on{yield} else Single.on end end def Tracer.off Single.off end def Tracer.set_get_line_procs(file_name, p = proc) Single.set_get_line_procs(file_name, p) end def Tracer.add_filter(p = proc) Single.add_filter(p) end end if caller(0).size == 1 if $0 == Tracer::MY_FILE_NAME # direct call $0 = ARGV[0] ARGV.shift Tracer.on require $0 else Tracer.on end end ruby-1.2.3/lib/weakref.rb100644 774 145 2477 6660772456 13306 0ustar matzNaCl# Weak Reference class that does not bother GCing. # # Usage: # foo = Object.new # foo.hash # foo = WeakRef.new(foo) # foo.hash # ObjectSpace.garbage_collect # foo.hash # => Raises WeakRef::RefError (because original GC'ed) require "delegate" class WeakRef 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-1.2.3/missing/crypt.c100644 774 145 20163 6457556236 13555 0ustar matzNaCl/* From Andy Tanenbaum's book "Computer Networks", rewritten in C */ struct block { unsigned char b_data[64]; }; struct ordering { unsigned char o_data[64]; }; static struct block key; static struct ordering InitialTr = { 58,50,42,34,26,18,10, 2,60,52,44,36,28,20,12, 4, 62,54,46,38,30,22,14, 6,64,56,48,40,32,24,16, 8, 57,49,41,33,25,17, 9, 1,59,51,43,35,27,19,11, 3, 61,53,45,37,29,21,13, 5,63,55,47,39,31,23,15, 7, }; static struct ordering FinalTr = { 40, 8,48,16,56,24,64,32,39, 7,47,15,55,23,63,31, 38, 6,46,14,54,22,62,30,37, 5,45,13,53,21,61,29, 36, 4,44,12,52,20,60,28,35, 3,43,11,51,19,59,27, 34, 2,42,10,50,18,58,26,33, 1,41, 9,49,17,57,25, }; static struct ordering swap = { 33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48, 49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,15,16, 17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32, }; static struct ordering KeyTr1 = { 57,49,41,33,25,17, 9, 1,58,50,42,34,26,18, 10, 2,59,51,43,35,27,19,11, 3,60,52,44,36, 63,55,47,39,31,23,15, 7,62,54,46,38,30,22, 14, 6,61,53,45,37,29,21,13, 5,28,20,12, 4, }; static struct ordering KeyTr2 = { 14,17,11,24, 1, 5, 3,28,15, 6,21,10, 23,19,12, 4,26, 8,16, 7,27,20,13, 2, 41,52,31,37,47,55,30,40,51,45,33,48, 44,49,39,56,34,53,46,42,50,36,29,32, }; static struct ordering etr = { 32, 1, 2, 3, 4, 5, 4, 5, 6, 7, 8, 9, 8, 9,10,11,12,13,12,13,14,15,16,17, 16,17,18,19,20,21,20,21,22,23,24,25, 24,25,26,27,28,29,28,29,30,31,32, 1, }; static struct ordering ptr = { 16, 7,20,21,29,12,28,17, 1,15,23,26, 5,18,31,10, 2, 8,24,14,32,27, 3, 9,19,13,30, 6,22,11, 4,25, }; static unsigned char s_boxes[8][64] = { { 14, 4,13, 1, 2,15,11, 8, 3,10, 6,12, 5, 9, 0, 7, 0,15, 7, 4,14, 2,13, 1,10, 6,12,11, 9, 5, 3, 8, 4, 1,14, 8,13, 6, 2,11,15,12, 9, 7, 3,10, 5, 0, 15,12, 8, 2, 4, 9, 1, 7, 5,11, 3,14,10, 0, 6,13, }, { 15, 1, 8,14, 6,11, 3, 4, 9, 7, 2,13,12, 0, 5,10, 3,13, 4, 7,15, 2, 8,14,12, 0, 1,10, 6, 9,11, 5, 0,14, 7,11,10, 4,13, 1, 5, 8,12, 6, 9, 3, 2,15, 13, 8,10, 1, 3,15, 4, 2,11, 6, 7,12, 0, 5,14, 9, }, { 10, 0, 9,14, 6, 3,15, 5, 1,13,12, 7,11, 4, 2, 8, 13, 7, 0, 9, 3, 4, 6,10, 2, 8, 5,14,12,11,15, 1, 13, 6, 4, 9, 8,15, 3, 0,11, 1, 2,12, 5,10,14, 7, 1,10,13, 0, 6, 9, 8, 7, 4,15,14, 3,11, 5, 2,12, }, { 7,13,14, 3, 0, 6, 9,10, 1, 2, 8, 5,11,12, 4,15, 13, 8,11, 5, 6,15, 0, 3, 4, 7, 2,12, 1,10,14, 9, 10, 6, 9, 0,12,11, 7,13,15, 1, 3,14, 5, 2, 8, 4, 3,15, 0, 6,10, 1,13, 8, 9, 4, 5,11,12, 7, 2,14, }, { 2,12, 4, 1, 7,10,11, 6, 8, 5, 3,15,13, 0,14, 9, 14,11, 2,12, 4, 7,13, 1, 5, 0,15,10, 3, 9, 8, 6, 4, 2, 1,11,10,13, 7, 8,15, 9,12, 5, 6, 3, 0,14, 11, 8,12, 7, 1,14, 2,13, 6,15, 0, 9,10, 4, 5, 3, }, { 12, 1,10,15, 9, 2, 6, 8, 0,13, 3, 4,14, 7, 5,11, 10,15, 4, 2, 7,12, 9, 5, 6, 1,13,14, 0,11, 3, 8, 9,14,15, 5, 2, 8,12, 3, 7, 0, 4,10, 1,13,11, 6, 4, 3, 2,12, 9, 5,15,10,11,14, 1, 7, 6, 0, 8,13, }, { 4,11, 2,14,15, 0, 8,13, 3,12, 9, 7, 5,10, 6, 1, 13, 0,11, 7, 4, 9, 1,10,14, 3, 5,12, 2,15, 8, 6, 1, 4,11,13,12, 3, 7,14,10,15, 6, 8, 0, 5, 9, 2, 6,11,13, 8, 1, 4,10, 7, 9, 5, 0,15,14, 2, 3,12, }, { 13, 2, 8, 4, 6,15,11, 1,10, 9, 3,14, 5, 0,12, 7, 1,15,13, 8,10, 3, 7, 4,12, 5, 6,11, 0,14, 9, 2, 7,11, 4, 1, 9,12,14, 2, 0, 6,10,13,15, 3, 5, 8, 2, 1,14, 7, 4,10, 8,13,15,12, 9, 0, 3, 5, 6,11, }, }; static int rots[] = { 1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1, }; static void transpose(struct block *data, struct ordering *t, int n) { struct block x; x = *data; while (n-- > 0) { data->b_data[n] = x.b_data[t->o_data[n] - 1]; } } static void rotate(struct block *key) { register unsigned char *p = key->b_data; register unsigned char *ep = &(key->b_data[55]); int data0 = key->b_data[0], data28 = key->b_data[28]; while (p++ < ep) *(p-1) = *p; key->b_data[27] = (char) data0; key->b_data[55] = (char) data28; } static struct ordering *EP = &etr; static void f(int i, struct block *key, struct block *a, struct block *x) { struct block e, ikey, y; int k; register unsigned char *p, *q, *r; e = *a; transpose(&e, EP, 48); for (k = rots[i]; k; k--) rotate(key); ikey = *key; transpose(&ikey, &KeyTr2, 48); p = &(y.b_data[48]); q = &(e.b_data[48]); r = &(ikey.b_data[48]); while (p > y.b_data) { *--p = *--q ^ *--r; } q = x->b_data; for (k = 0; k < 8; k++) { register int xb, r; r = *p++ << 5; r += *p++ << 3; r += *p++ << 2; r += *p++ << 1; r += *p++; r += *p++ << 4; xb = s_boxes[k][r]; *q++ = (char) (xb >> 3) & 1; *q++ = (char) (xb>>2) & 1; *q++ = (char) (xb>>1) & 1; *q++ = (char) (xb & 1); } transpose(x, &ptr, 32); } void definekey(char *k) { key = *((struct block *) k); transpose(&key, &KeyTr1, 56); } void encrypt(char *blck, int edflag) { register struct block *p = (struct block *) blck; register int i; transpose(p, &InitialTr, 64); for (i = 15; i>= 0; i--) { int j = edflag ? i : 15 - i; register int k; struct block b, x; b = *p; for (k = 31; k >= 0; k--) { p->b_data[k] = b.b_data[k + 32]; } f(j, &key, p, &x); for (k = 31; k >= 0; k--) { p->b_data[k+32] = b.b_data[k] ^ x.b_data[k]; } } transpose(p, &swap, 64); transpose(p, &FinalTr, 64); } char *crypt(char *pw, char *salt) { char pwb[66]; static char result[16]; register char *p = pwb; struct ordering new_etr; register int i; while (*pw && p < &pwb[64]) { register int j = 7; while (j--) { *p++ = (*pw >> j) & 01; } pw++; *p++ = 0; } while (p < &pwb[64]) *p++ = 0; definekey(p = pwb); while (p < &pwb[66]) *p++ = 0; new_etr = etr; EP = &new_etr; for (i = 0; i < 2; i++) { register char c = *salt++; register int j; result[i] = c; if ( c > 'Z') c -= 6 + 7 + '.'; /* c was a lower case letter */ else if ( c > '9') c -= 7 + '.';/* c was upper case letter */ else c -= '.'; /* c was digit, '.' or '/'. */ /* now, 0 <= c <= 63 */ for (j = 0; j < 6; j++) { if ((c >> j) & 01) { int t = 6*i + j; int temp = new_etr.o_data[t]; new_etr.o_data[t] = new_etr.o_data[t+24]; new_etr.o_data[t+24] = (char) temp; } } } if (result[1] == 0) result[1] = result[0]; for (i = 0; i < 25; i++) encrypt(pwb,0); EP = &etr; p = pwb; pw = result+2; while (p < &pwb[66]) { register int c = 0; register int j = 6; while (j--) { c <<= 1; c |= *p++; } c += '.'; /* becomes >= '.' */ if (c > '9') c += 7; /* not in [./0-9], becomes upper */ if (c > 'Z') c += 6; /* not in [A-Z], becomes lower */ *pw++ = (char) c; } *pw = 0; return result; } ruby-1.2.3/missing/dir.h100644 774 145 3113 6572431730 13140 0ustar matzNaCl/* $RCSfile: dir.h,v $$Revision: 4.0.1.1 $$Date: 91/06/07 11:22:10 $ * * (C) Copyright 1987, 1990 Diomidis Spinellis. * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the README file. * * $Log: dir.h,v $ * Revision 4.0.1.1 91/06/07 11:22:10 lwall * patch4: new copyright notice * * Revision 4.0 91/03/20 01:34:20 lwall * 4.0 baseline. * * Revision 3.0.1.1 90/03/27 16:07:08 lwall * patch16: MSDOS support * * Revision 1.1 90/03/18 20:32:29 dds * Initial revision * * */ /* * defines the type returned by the directory(3) functions */ #ifndef __DIR_INCLUDED #define __DIR_INCLUDED /*Directory entry size */ #ifdef DIRSIZ #undef DIRSIZ #endif #define DIRSIZ(rp) (sizeof(struct direct)) /* * Structure of a directory entry */ struct direct { ino_t d_ino; /* inode number (not used by MS-DOS) */ int d_namlen; /* Name length */ char d_name[256]; /* file name */ }; struct _dir_struc { /* Structure used by dir operations */ char *start; /* Starting position */ char *curr; /* Current position */ long size; /* Size of string table */ long nfiles; /* number if filenames in table */ struct direct dirstr; /* Directory structure to return */ }; typedef struct _dir_struc DIR; /* Type returned by dir operations */ DIR *cdecl opendir(char *filename); struct direct *readdir(DIR *dirp); long telldir(DIR *dirp); void seekdir(DIR *dirp,long loc); void rewinddir(DIR *dirp); void closedir(DIR *dirp); #endif /* __DIR_INCLUDED */ ruby-1.2.3/missing/dup2.c100644 774 145 1276 6457556236 13252 0ustar matzNaCl/* * Copyright (c) 1991, Larry Wall * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the README file. */ #include "defines.h" #if defined(HAVE_FCNTL) && defined(F_DUPFD) # include #endif int dup2(oldfd,newfd) int oldfd; int newfd; { #if defined(HAVE_FCNTL) && defined(F_DUPFD) close(newfd); return fcntl(oldfd, F_DUPFD, newfd); #else int fdtmp[256]; int fdx = 0; int fd; if (oldfd == newfd) return 0; close(newfd); while ((fd = dup(oldfd)) != newfd) /* good enough for low fd's */ fdtmp[fdx++] = fd; while (fdx > 0) close(fdtmp[--fdx]); return 0; #endif } ruby-1.2.3/missing/file.h100644 774 145 1613 6513322172 13276 0ustar matzNaCl/* This is file FILE.H */ /* ** Copyright (C) 1991 DJ Delorie, 24 Kirsten Ave, Rochester NH 03867-2954 ** ** This file is distributed under the terms listed in the document ** "copying.dj", available from DJ Delorie at the address above. ** A copy of "copying.dj" should accompany this file; if not, a copy ** should be available from where this file was obtained. This file ** may not be distributed without a verbatim copy of "copying.dj". ** ** This file is distributed WITHOUT ANY WARRANTY; without even the implied ** warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. */ #ifndef _FILE_H_ #define _FILE_H_ #include #define L_SET 0 #define L_CURR 1 #define L_INCR 1 #define L_XTND 2 #define F_OK 0 /* does file exist */ #define X_OK 1 /* is it executable by caller */ #define W_OK 2 /* is it writable by caller */ #define R_OK 4 /* is it readable by caller */ #endif ruby-1.2.3/missing/flock.c100644 774 145 3431 6457556236 13471 0ustar matzNaCl#include "config.h" #if defined(HAVE_LOCKF) #include #include /* Emulate flock() with lockf() or fcntl(). This is just to increase portability of scripts. The calls might not be completely interchangeable. What's really needed is a good file locking module. */ # ifndef F_ULOCK # define F_ULOCK 0 /* Unlock a previously locked region */ # endif # ifndef F_LOCK # define F_LOCK 1 /* Lock a region for exclusive use */ # endif # ifndef F_TLOCK # define F_TLOCK 2 /* Test and lock a region for exclusive use */ # endif # ifndef F_TEST # define F_TEST 3 /* Test a region for other processes locks */ # endif /* These are the flock() constants. Since this sytems doesn't have flock(), the values of the constants are probably not available. */ # ifndef LOCK_SH # define LOCK_SH 1 # endif # ifndef LOCK_EX # define LOCK_EX 2 # endif # ifndef LOCK_NB # define LOCK_NB 4 # endif # ifndef LOCK_UN # define LOCK_UN 8 # endif int flock(fd, operation) int fd; int operation; { int i; switch (operation) { /* LOCK_SH - get a shared lock */ case LOCK_SH: /* LOCK_EX - get an exclusive lock */ case LOCK_EX: i = lockf (fd, F_LOCK, 0); break; /* LOCK_SH|LOCK_NB - get a non-blocking shared lock */ case LOCK_SH|LOCK_NB: /* LOCK_EX|LOCK_NB - get a non-blocking exclusive lock */ case LOCK_EX|LOCK_NB: i = lockf (fd, F_TLOCK, 0); if (i == -1) if ((errno == EAGAIN) || (errno == EACCES)) errno = EWOULDBLOCK; break; /* LOCK_UN - unlock */ case LOCK_UN: i = lockf (fd, F_ULOCK, 0); break; /* Default - can't decipher operation */ default: i = -1; errno = EINVAL; break; } return i; } #else int flock(fd, operation) int fd; int operation; { rb_notimplement(); return -1; } #endif ruby-1.2.3/missing/memcmp.c100644 774 145 507 6476475513 13631 0ustar matzNaCl/* * memcmp --- compare memories. * */ int memcmp(s1,s2,len) char *s1; char *s2; register int len; { register unsigned char *a = (unsigned char*)s1; register unsigned char *b = (unsigned char*)s2; register int tmp; while (len--) { if (tmp = *a++ - *b++) return tmp; } return 0; } ruby-1.2.3/missing/memmove.c100644 774 145 553 6457556236 14022 0ustar matzNaCl/* * 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-1.2.3/missing/mkdir.c100644 774 145 4743 6457556236 13510 0ustar matzNaCl/* * 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 #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/rmdir failed */ } return 0; } ruby-1.2.3/missing/nt.c100644 774 145 130422 6646533451 13047 0ustar matzNaCl/* * Copyright (c) 1993, Intergraph Corporation * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the perl README file. * * Various Unix compatibility functions and NT specific functions. * * Some of this code was derived from the MSDOS port(s) and the OS/2 port. * */ #include "ruby.h" #include #include #include /* #include */ #include #include #include #include #include #include #include #include "nt.h" #include "dir.h" #ifndef index #define index(x, y) strchr((x), (y)) #endif #ifndef bool #define bool int #endif bool NtSyncProcess = TRUE; #if 0 // declared in header file extern char **environ; #define environ _environ #endif static bool NtHasRedirection (char *); static int valid_filename(char *s); static void StartSockets (); static char *str_grow(struct RString *str, size_t new_size); char *NTLoginName; DWORD Win32System = (DWORD)-1; static DWORD IdOS(void) { static OSVERSIONINFO osver; if (osver.dwPlatformId != Win32System) { memset(&osver, 0, sizeof(OSVERSIONINFO)); osver.dwOSVersionInfoSize = sizeof(OSVERSIONINFO); GetVersionEx(&osver); Win32System = osver.dwPlatformId; } return (Win32System); } static int IsWin95(void) { return (IdOS() == VER_PLATFORM_WIN32_WINDOWS); } static int IsWinNT(void) { return (IdOS() == VER_PLATFORM_WIN32_NT); } /* simulate flock by locking a range on the file */ #define LK_ERR(f,i) ((f) ? (i = 0) : (errno = GetLastError())) #define LK_LEN 0xffff0000 int flock(int fd, int oper) { OVERLAPPED o; int i = -1; HANDLE fh; fh = (HANDLE)_get_osfhandle(fd); memset(&o, 0, sizeof(o)); if(IsWinNT()) { switch(oper) { case LOCK_SH: /* shared lock */ LK_ERR(LockFileEx(fh, 0, 0, LK_LEN, 0, &o),i); break; case LOCK_EX: /* exclusive lock */ LK_ERR(LockFileEx(fh, LOCKFILE_EXCLUSIVE_LOCK, 0, LK_LEN, 0, &o),i); break; case LOCK_SH|LOCK_NB: /* non-blocking shared lock */ LK_ERR(LockFileEx(fh, LOCKFILE_FAIL_IMMEDIATELY, 0, LK_LEN, 0, &o),i); break; case LOCK_EX|LOCK_NB: /* non-blocking exclusive lock */ LK_ERR(LockFileEx(fh, LOCKFILE_EXCLUSIVE_LOCK|LOCKFILE_FAIL_IMMEDIATELY, 0, LK_LEN, 0, &o),i); if(errno == EDOM) errno = EWOULDBLOCK; break; case LOCK_UN: /* unlock lock */ if (UnlockFileEx(fh, 0, LK_LEN, 0, &o)) { i = 0; } else { /* GetLastError() must returns `ERROR_NOT_LOCKED' */ errno = EWOULDBLOCK; } if(errno == EDOM) errno = EWOULDBLOCK; break; default: /* unknown */ errno = EINVAL; break; } } else if(IsWin95()) { switch(oper) { case LOCK_EX: while(i == -1) { LK_ERR(LockFile(fh, 0, 0, LK_LEN, 0), i); if(errno != EDOM && i == -1) break; } break; case LOCK_EX | LOCK_NB: LK_ERR(LockFile(fh, 0, 0, LK_LEN, 0), i); if(errno == EDOM) errno = EWOULDBLOCK; break; case LOCK_UN: LK_ERR(UnlockFile(fh, 0, 0, LK_LEN, 0), i); if(errno == EDOM) errno = EWOULDBLOCK; break; default: errno = EINVAL; break; } } return i; } #undef LK_ERR #undef LK_LEN //#undef const //FILE *fdopen(int, const char *); #if 0 void sleep(unsigned int len) { time_t end; end = time((time_t *)0) + len; while (time((time_t *)0) < end) ; } #endif // // Initialization stuff // void NtInitialize(int *argc, char ***argv) { WORD version; int ret; // // subvert cmd.exe\'s feeble attempt at command line parsing // *argc = NtMakeCmdVector((char *)GetCommandLine(), argv, TRUE); // // Now set up the correct time stuff // tzset(); // Initialize Winsock StartSockets(); } char *getlogin() { char buffer[200]; int len = 200; extern char *NTLoginName; if (NTLoginName == NULL) { if (GetUserName(buffer, &len)) { NTLoginName = ALLOC_N(char, len+1); strncpy(NTLoginName, buffer, len); NTLoginName[len] = '\0'; } else { NTLoginName = ""; } } return NTLoginName; } #if 1 // popen stuff // // use these so I can remember which index is which // #define NtPipeRead 0 // index of pipe read descriptor #define NtPipeWrite 1 // index of pipe write descriptor #define NtPipeSize 1024 // size of pipe buffer #define MYPOPENSIZE 256 // size of book keeping structure struct { int inuse; int pid; HANDLE oshandle; FILE *pipe; } MyPopenRecord[MYPOPENSIZE]; int SafeFree(char **vec, int vecc) { // vec // | // V ^---------------------V // +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ // | | | .... | NULL | | ..... |\0 | | ..... |\0 |... // +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ // |- elements+1 -| ^ 1st element ^ 2nd element char *p; p = (char *)vec; free(p); return 0; } static char *szInternalCmds[] = { "append", "break", "call", "cd", "chdir", "cls", "copy", "date", "del", "dir", "echo", "erase", "label", "md", "mkdir", "path", "pause", "rd", "rem", "ren", "rename", "rmdir", "set", "start", "time", "type", "ver", "vol", NULL }; int isInternalCmd(char *cmd) { int i, fRet=0; char **vec; int vecc = NtMakeCmdVector(cmd, &vec, FALSE); NtMakeCmdVector(cmd, &vec, FALSE); for( i = 0; szInternalCmds[i] ; i++){ if(!strcmp(szInternalCmds[i], vec[0])){ fRet = 1; break; } } SafeFree (vec, vecc); return fRet; } FILE * mypopen (char *cmd, char *mode) { FILE *fp; int saved, reading; int pipemode; int pipes[2]; int pid; int slot; static initialized = 0; // // if first time through, intialize our book keeping structure // if (!initialized++) { for (slot = 0; slot < MYPOPENSIZE; slot++) MyPopenRecord[slot].inuse = FALSE; } //printf("mypopen %s\n", cmd); // // find a free popen slot // for (slot = 0; slot < MYPOPENSIZE && MyPopenRecord[slot].inuse; slot++) ; if (slot > MYPOPENSIZE) { return NULL; } // // Figure out what we\'re doing... // reading = (*mode == 'r') ? TRUE : FALSE; pipemode = (*(mode+1) == 'b') ? O_BINARY : O_TEXT; // // Now get a pipe // #if 0 if (_pipe(pipes, NtPipeSize, pipemode) == -1) { return NULL; } if (reading) { // // we\'re reading from the pipe, so we must hook up the // write end of the pipe to the new processes stdout. // To do this we must save our file handle from stdout // by _dup\'ing it, then setting our stdout to be the pipe\'s // write descriptor. We must also make the write handle // inheritable so the new process can use it. if ((saved = _dup(fileno(stdout))) == -1) { _close(pipes[NtPipeRead]); _close(pipes[NtPipeWrite]); return NULL; } if (_dup2 (pipes[NtPipeWrite], fileno(stdout)) == -1) { _close(pipes[NtPipeRead]); _close(pipes[NtPipeWrite]); return NULL; } } else { // // must be writing to the new process. Do the opposite of // the above, i.e. hook up the processes stdin to the read // end of the pipe. // if ((saved = _dup(fileno(stdin))) == -1) { _close(pipes[NtPipeRead]); _close(pipes[NtPipeWrite]); return NULL; } if (_dup2(pipes[NtPipeRead], fileno(stdin)) == -1) { _close(pipes[NtPipeRead]); _close(pipes[NtPipeWrite]); return NULL; } } // // Start the new process. Must set _fileinfo to non-zero value // for file descriptors to be inherited. Reset after the process // is started. // if (NtHasRedirection(cmd)) { docmd: pid = spawnlpe(_P_NOWAIT, "cmd.exe", "/c", cmd, 0, environ); if (pid == -1) { _close(pipes[NtPipeRead]); _close(pipes[NtPipeWrite]); return NULL; } } else { char **vec; int vecc = NtMakeCmdVector(cmd, &vec, FALSE); //pid = spawnvpe (_P_NOWAIT, vec[0], vec, environ); pid = spawnvpe (_P_WAIT, vec[0], vec, environ); if (pid == -1) { goto docmd; } Safefree (vec, vecc); } if (reading) { // // We need to close our instance of the inherited pipe write // handle now that it's been inherited so that it will actually close // when the child process ends. // if (_close(pipes[NtPipeWrite]) == -1) { _close(pipes[NtPipeRead]); return NULL; } if (_dup2 (saved, fileno(stdout)) == -1) { _close(pipes[NtPipeRead]); return NULL; } _close(saved); // // Now get a stream pointer to return to the calling program. // if ((fp = (FILE *) fdopen(pipes[NtPipeRead], mode)) == NULL) { return NULL; } } else { // // need to close our read end of the pipe so that it will go // away when the write end is closed. // if (_close(pipes[NtPipeRead]) == -1) { _close(pipes[NtPipeWrite]); return NULL; } if (_dup2 (saved, fileno(stdin)) == -1) { _close(pipes[NtPipeWrite]); return NULL; } _close(saved); // // Now get a stream pointer to return to the calling program. // if ((fp = (FILE *) fdopen(pipes[NtPipeWrite], mode)) == NULL) { _close(pipes[NtPipeWrite]); return NULL; } } // // do the book keeping // MyPopenRecord[slot].inuse = TRUE; MyPopenRecord[slot].pipe = fp; MyPopenRecord[slot].pid = pid; return fp; #else { int p[2]; BOOL fRet; HANDLE hInFile, hOutFile, hStdin, hStdout; LPCSTR lpApplicationName = NULL; LPTSTR lpCommandLine; LPTSTR lpCmd2 = NULL; DWORD dwCreationFlags; STARTUPINFO aStartupInfo; PROCESS_INFORMATION aProcessInformation; SECURITY_ATTRIBUTES sa; int fd; sa.nLength = sizeof (SECURITY_ATTRIBUTES); sa.lpSecurityDescriptor = NULL; sa.bInheritHandle = TRUE; if (!reading) { FILE *fp; fp = (_popen)(cmd, mode); MyPopenRecord[slot].inuse = TRUE; MyPopenRecord[slot].pipe = fp; MyPopenRecord[slot].pid = -1; if (!fp) Fatal("cannot open pipe \"%s\" (%s)", cmd, strerror(errno)); return fp; } fRet = CreatePipe(&hInFile, &hOutFile, &sa, 2048L); if (!fRet) Fatal("cannot open pipe \"%s\" (%s)", cmd, strerror(errno)); memset(&aStartupInfo, 0, sizeof (STARTUPINFO)); memset(&aProcessInformation, 0, sizeof (PROCESS_INFORMATION)); aStartupInfo.cb = sizeof (STARTUPINFO); aStartupInfo.dwFlags = STARTF_USESTDHANDLES; if (reading) { aStartupInfo.hStdInput = GetStdHandle(STD_OUTPUT_HANDLE);//hStdin; aStartupInfo.hStdError = INVALID_HANDLE_VALUE; //for save DuplicateHandle(GetCurrentProcess(), GetStdHandle(STD_OUTPUT_HANDLE), GetCurrentProcess(), &hStdout, 0, FALSE, DUPLICATE_SAME_ACCESS ); //for redirect DuplicateHandle(GetCurrentProcess(), GetStdHandle(STD_INPUT_HANDLE), GetCurrentProcess(), &hStdin, 0, TRUE, DUPLICATE_SAME_ACCESS ); aStartupInfo.hStdOutput = hOutFile; } else { aStartupInfo.hStdOutput = GetStdHandle(STD_OUTPUT_HANDLE); //hStdout; aStartupInfo.hStdError = INVALID_HANDLE_VALUE; // for save DuplicateHandle(GetCurrentProcess(), GetStdHandle(STD_INPUT_HANDLE), GetCurrentProcess(), &hStdin, 0, FALSE, DUPLICATE_SAME_ACCESS ); //for redirect DuplicateHandle(GetCurrentProcess(), GetStdHandle(STD_OUTPUT_HANDLE), GetCurrentProcess(), &hStdout, 0, TRUE, DUPLICATE_SAME_ACCESS ); aStartupInfo.hStdInput = hInFile; } dwCreationFlags = (NORMAL_PRIORITY_CLASS); lpCommandLine = cmd; if (NtHasRedirection(cmd) || isInternalCmd(cmd)) { lpApplicationName = getenv("COMSPEC"); lpCmd2 = malloc(strlen(lpApplicationName) + 1 + strlen(cmd) + sizeof (" /c ")); if (lpCmd2 == NULL) Fatal("Mypopen: malloc failed"); sprintf(lpCmd2, "%s %s%s", lpApplicationName, " /c ", cmd); lpCommandLine = lpCmd2; } fRet = CreateProcess(lpApplicationName, lpCommandLine, &sa, &sa, sa.bInheritHandle, dwCreationFlags, NULL, NULL, &aStartupInfo, &aProcessInformation); if (!fRet) { CloseHandle(hInFile); CloseHandle(hOutFile); Fatal("cannot fork for \"%s\" (%s)", cmd, strerror(errno)); } CloseHandle(aProcessInformation.hThread); if (reading) { HANDLE hDummy; fd = _open_osfhandle((long)hInFile, (_O_RDONLY | pipemode)); CloseHandle(hOutFile); DuplicateHandle(GetCurrentProcess(), hStdout, GetCurrentProcess(), &hDummy, 0, TRUE, (DUPLICATE_SAME_ACCESS | DUPLICATE_CLOSE_SOURCE) ); } else { HANDLE hDummy; fd = _open_osfhandle((long)hOutFile, (_O_WRONLY | pipemode)); CloseHandle(hInFile); DuplicateHandle(GetCurrentProcess(), hStdin, GetCurrentProcess(), &hDummy, 0, TRUE, (DUPLICATE_SAME_ACCESS | DUPLICATE_CLOSE_SOURCE) ); } if (fd == -1) Fatal("cannot open pipe \"%s\" (%s)", cmd, strerror(errno)); if ((fp = (FILE *) fdopen(fd, mode)) == NULL) return NULL; if (lpCmd2) free(lpCmd2); MyPopenRecord[slot].inuse = TRUE; MyPopenRecord[slot].pipe = fp; MyPopenRecord[slot].oshandle = (reading ? hInFile : hOutFile); MyPopenRecord[slot].pid = (int)aProcessInformation.hProcess; return fp; } #endif } int mypclose(FILE *fp) { int i; int exitcode; Sleep(100); for (i = 0; i < MYPOPENSIZE; i++) { if (MyPopenRecord[i].inuse && MyPopenRecord[i].pipe == fp) break; } if (i >= MYPOPENSIZE) { Fatal("Invalid file pointer passed to mypclose!\n"); } // // get the return status of the process // #if 0 if (_cwait(&exitcode, MyPopenRecord[i].pid, WAIT_CHILD) == -1) { if (errno == ECHILD) { fprintf(stderr, "mypclose: nosuch child as pid %x\n", MyPopenRecord[i].pid); } } #else for (;;) { if (GetExitCodeProcess((HANDLE)MyPopenRecord[i].pid, &exitcode)) { if (exitcode == STILL_ACTIVE) { //printf("Process is Active.\n"); Sleep(100); TerminateProcess((HANDLE)MyPopenRecord[i].pid, 0); // ugly... continue; } else if (exitcode == 0) { //printf("done.\n"); break; } else { //printf("never.\n"); break; } } } #endif // // close the pipe // CloseHandle(MyPopenRecord[i].oshandle); fflush(fp); fclose(fp); // // free this slot // MyPopenRecord[i].inuse = FALSE; MyPopenRecord[i].pipe = NULL; MyPopenRecord[i].pid = 0; return exitcode; } #endif #if 1 typedef char* CHARP; /* * The following code is based on the do_exec and do_aexec functions * in file doio.c */ int do_spawn(cmd) char *cmd; { register char **a; register char *s; char **argv; int status; char *shell, *cmd2; int mode = NtSyncProcess ? P_WAIT : P_NOWAIT; /* save an extra exec if possible */ if ((shell = getenv("RUBYSHELL")) != 0) { if (NtHasRedirection(cmd)) { int i; char *p; char *argv[4]; char *cmdline = ALLOC_N(char, (strlen(cmd) * 2 + 1)); p=cmdline; *p++ = '"'; for (s=cmd; *s;) { if (*s == '"') *p++ = '\\'; /* Escape d-quote */ *p++ = *s++; } *p++ = '"'; *p = '\0'; /* fprintf(stderr, "do_spawn: %s %s\n", shell, cmdline); */ argv[0] = shell; argv[1] = "-c"; argv[2] = cmdline; argv[4] = NULL; status = spawnvpe(mode, argv[0], argv, environ); /* return spawnle(mode, shell, shell, "-c", cmd, (char*)0, environ); */ free(cmdline); return status; } } else if ((shell = getenv("COMSPEC")) != 0) { if (NtHasRedirection(cmd) /* || isInternalCmd(cmd) */) { do_comspec_shell: return spawnle(mode, shell, shell, "/c", cmd, (char*)0, environ); } } argv = ALLOC_N(CHARP, (strlen(cmd) / 2 + 2)); cmd2 = ALLOC_N(char, (strlen(cmd) + 1)); strcpy(cmd2, cmd); a = argv; for (s = cmd2; *s;) { while (*s && isspace(*s)) s++; if (*s) *(a++) = s; while (*s && !isspace(*s)) s++; if (*s) *s++ = '\0'; } *a = NULL; if (argv[0]) { if ((status = spawnvpe(mode, argv[0], argv, environ)) == -1) { free(argv); free(cmd2); return -1; } } free(cmd2); free(argv); return status; } #endif typedef struct _NtCmdLineElement { struct _NtCmdLineElement *next, *prev; char *str; int len; int flags; } NtCmdLineElement; // // Possible values for flags // #define NTGLOB 0x1 // element contains a wildcard #define NTMALLOC 0x2 // string in element was malloc'ed #define NTSTRING 0x4 // element contains a quoted string NtCmdLineElement *NtCmdHead = NULL, *NtCmdTail = NULL; void NtFreeCmdLine(void) { NtCmdLineElement *ptr; while(NtCmdHead) { ptr = NtCmdHead; NtCmdHead = NtCmdHead->next; free(ptr); } NtCmdHead = NtCmdTail = NULL; } // // This function expands wild card characters that were spotted // during the parse phase. The idea here is to call FindFirstFile and // FindNextFile with the wildcard pattern specified, and splice in the // resulting list of new names. If the wildcard pattern doesn\'t match // any existing files, just leave it in the list. // void NtCmdGlob (NtCmdLineElement *patt) { WIN32_FIND_DATA fd; HANDLE fh; char buffer[512]; NtCmdLineElement *tmphead, *tmptail, *tmpcurr; strncpy(buffer, patt->str, patt->len); buffer[patt->len] = '\0'; if ((fh = FindFirstFile (buffer, &fd)) == INVALID_HANDLE_VALUE) { return; } tmphead = tmptail = NULL; do { tmpcurr = ALLOC(NtCmdLineElement); if (tmpcurr == NULL) { fprintf(stderr, "Out of Memory in globbing!\n"); while (tmphead) { tmpcurr = tmphead; tmphead = tmphead->next; free(tmpcurr->str); free(tmpcurr); } return; } memset (tmpcurr, 0, sizeof(*tmpcurr)); tmpcurr->len = strlen(fd.cFileName); tmpcurr->str = ALLOC_N(char, tmpcurr->len+1); if (tmpcurr->str == NULL) { fprintf(stderr, "Out of Memory in globbing!\n"); while (tmphead) { tmpcurr = tmphead; tmphead = tmphead->next; free(tmpcurr->str); free(tmpcurr); } return; } strcpy(tmpcurr->str, fd.cFileName); tmpcurr->flags |= NTMALLOC; if (tmptail) { tmptail->next = tmpcurr; tmpcurr->prev = tmptail; tmptail = tmpcurr; } else { tmptail = tmphead = tmpcurr; } } while(FindNextFile(fh, &fd)); // // ok, now we\'ve got a list of files that matched the wildcard // specification. Put it in place of the pattern structure. // tmphead->prev = patt->prev; tmptail->next = patt->next; if (tmphead->prev) tmphead->prev->next = tmphead; if (tmptail->next) tmptail->next->prev = tmptail; // // Now get rid of the pattern structure // if (patt->flags & NTMALLOC) free(patt->str); // free(patt); //TODO: memory leak occures here. we have to fix it. } // // Check a command string to determine if it has I/O redirection // characters that require it to be executed by a command interpreter // static bool NtHasRedirection (char *cmd) { int inquote = 0; char quote = '\0'; char *ptr ; // // Scan the string, looking for redirection (< or >) or pipe // characters (|) that are not in a quoted string // for (ptr = cmd; *ptr; ptr++) { switch (*ptr) { case '\'': case '\"': if (inquote) { if (quote == *ptr) { inquote = 0; quote = '\0'; } } else { quote = *ptr; inquote++; } break; case '>': case '<': if (!inquote) return TRUE; } } return FALSE; } int NtMakeCmdVector (char *cmdline, char ***vec, int InputCmd) { int cmdlen = strlen(cmdline); int done, instring, globbing, quoted, len; int newline, need_free = 0, i; int elements, strsz; int slashes = 0; char *ptr, *base, *buffer; char **vptr; char quote; NtCmdLineElement *curr; // // just return if we don\'t have a command line // if (cmdlen == 0) { *vec = NULL; return 0; } // // strip trailing white space // ptr = cmdline+(cmdlen - 1); while(ptr >= cmdline && isspace(*ptr)) --ptr; *++ptr = '\0'; // // check for newlines and formfeeds. If we find any, make a new // command string that replaces them with escaped sequences (\n or \f) // for (ptr = cmdline, newline = 0; *ptr; ptr++) { if (*ptr == '\n' || *ptr == '\f') newline++; } if (newline) { base = ALLOC_N(char, strlen(cmdline) + 1 + newline + slashes); if (base == NULL) { fprintf(stderr, "malloc failed!\n"); return 0; } for (i = 0, ptr = base; (unsigned) i < strlen(cmdline); i++) { switch (cmdline[i]) { case '\n': *ptr++ = '\\'; *ptr++ = 'n'; break; default: *ptr++ = cmdline[i]; } } *ptr = '\0'; cmdline = base; need_free++; } // // Ok, parse the command line, building a list of CmdLineElements. // When we\'ve finished, and it\'s an input command (meaning that it\'s // the processes argv), we\'ll do globing and then build the argument // vector. // The outer loop does one interation for each element seen. // The inner loop does one interation for each character in the element. // for (done = 0, ptr = cmdline; *ptr;) { // // zap any leading whitespace // while(isspace(*ptr)) ptr++; base = ptr; for (done = newline = globbing = instring = quoted = 0; *ptr && !done; ptr++) { // // Switch on the current character. We only care about the // white-space characters, the wild-card characters, and the // quote characters. // switch (*ptr) { case ' ': case '\t': #if 0 case '/': // have to do this for NT/DOS option strings // // check to see if we\'re parsing an option switch // if (*ptr == '/' && base == ptr) continue; #endif // // if we\'re not in a string, then we\'re finished with this // element // if (!instring) done++; break; case '*': case '?': // // record the fact that this element has a wildcard character // N.B. Don\'t glob if inside a single quoted string // if (!(instring && quote == '\'')) globbing++; break; case '\n': // // If this string contains a newline, mark it as such so // we can replace it with the two character sequence "\n" // (cmd.exe doesn\'t like raw newlines in strings...sigh). // newline++; break; case '\'': case '\"': // // if we\'re already in a string, see if this is the // terminating close-quote. If it is, we\'re finished with // the string, but not neccessarily with the element. // If we\'re not already in a string, start one. // if (instring) { if (quote == *ptr) { instring = 0; quote = '\0'; } } else { instring++; quote = *ptr; quoted++; } break; } } // // need to back up ptr by one due to last increment of for loop // (if we got out by seeing white space) // if (*ptr) ptr--; // // when we get here, we\'ve got a pair of pointers to the element, // base and ptr. Base points to the start of the element while ptr // points to the character following the element. // curr = ALLOC(NtCmdLineElement); if (curr == NULL) { NtFreeCmdLine(); fprintf(stderr, "Out of memory!!\n"); *vec = NULL; return 0; } memset (curr, 0, sizeof(*curr)); len = ptr - base; // // if it\'s an input vector element and it\'s enclosed by quotes, // we can remove them. // if (InputCmd && ((base[0] == '\"' && base[len-1] == '\"') || (base[0] == '\'' && base[len-1] == '\''))) { base++; len -= 2; } curr->str = base; curr->len = len; curr->flags |= (globbing ? NTGLOB : 0); // // Now put it in the list of elements // if (NtCmdTail) { NtCmdTail->next = curr; curr->prev = NtCmdTail; NtCmdTail = curr; } else { NtCmdHead = NtCmdTail = curr; } } if (InputCmd) { // // When we get here we\'ve finished parsing the command line. Now // we need to run the list, expanding any globbing patterns. // for(curr = NtCmdHead; curr; curr = curr->next) { if (curr->flags & NTGLOB) { NtCmdGlob(curr); } } } // // Almost done! // Count up the elements, then allocate space for a vector of pointers // (argv) and a string table for the elements. // for (elements = 0, strsz = 0, curr = NtCmdHead; curr; curr = curr->next) { elements++; strsz += (curr->len + 1); } len = (elements+1)*sizeof(char *) + strsz; buffer = ALLOC_N(char, len); if (buffer == NULL) { fprintf(stderr, "Out of memory!!\n"); NtFreeCmdLine(); *vec = NULL; return 0; } memset (buffer, 0, len); // // make vptr point to the start of the buffer // and ptr point to the area we\'ll consider the string table. // // buffer (*vec) // | // V ^---------------------V // +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ // | | | .... | NULL | | ..... |\0 | | ..... |\0 |... // +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ // |- elements+1 -| ^ 1st element ^ 2nd element vptr = (char **) buffer; ptr = buffer + (elements+1) * sizeof(char *); for (curr = NtCmdHead; curr; curr = curr->next) { strncpy (ptr, curr->str, curr->len); ptr[curr->len] = '\0'; *vptr++ = ptr; ptr += curr->len + 1; } NtFreeCmdLine(); *vec = (char **) buffer; return elements; } #if 1 // // UNIX compatible directory access functions for NT // // // File names are converted to lowercase if the // CONVERT_TO_LOWER_CASE variable is defined. // #define CONVERT_TO_LOWER_CASE #define PATHLEN 1024 // // The idea here is to read all the directory names into a string table // (separated by nulls) and when one of the other dir functions is called // return the pointer to the current file name. // DIR * opendir(char *filename) { DIR *p; long len; long idx; char scannamespc[PATHLEN]; char *scanname = scannamespc; struct stat sbuf; WIN32_FIND_DATA FindData; HANDLE fh; char root[PATHLEN]; char volname[PATHLEN]; DWORD serial, maxname, flags; BOOL downcase; char *dummy; // // check to see if we\'ve got a directory // if (stat (filename, &sbuf) < 0 || sbuf.st_mode & _S_IFDIR == 0) { return NULL; } // // check out the file system characteristics // if (GetFullPathName(filename, PATHLEN, root, &dummy)) { if (dummy = strchr(root, '\\')) *++dummy = '\0'; if (GetVolumeInformation(root, volname, PATHLEN, &serial, &maxname, &flags, 0, 0)) { downcase = !(flags & FS_CASE_SENSITIVE); } } else { downcase = TRUE; } // // Get us a DIR structure // p = xcalloc(sizeof(DIR), 1); if (p == NULL) return NULL; // // Create the search pattern // strcpy(scanname, filename); if (index("/\\", *(scanname + strlen(scanname) - 1)) == NULL) strcat(scanname, "/*"); else strcat(scanname, "*"); // // do the FindFirstFile call // fh = FindFirstFile (scanname, &FindData); if (fh == INVALID_HANDLE_VALUE) { return NULL; } // // now allocate the first part of the string table for the // filenames that we find. // idx = strlen(FindData.cFileName)+1; p->start = ALLOC_N(char, idx); strcpy (p->start, FindData.cFileName); if (downcase) strlwr(p->start); p->nfiles++; // // loop finding all the files that match the wildcard // (which should be all of them in this directory!). // the variable idx should point one past the null terminator // of the previous string found. // while (FindNextFile(fh, &FindData)) { len = strlen (FindData.cFileName); // // bump the string table size by enough for the // new name and it's null terminator // #define Renew(x, y, z) (x = (z *)realloc(x, y)) Renew (p->start, idx+len+1, char); if (p->start == NULL) { Fatal ("opendir: malloc failed!\n"); } strcpy(&p->start[idx], FindData.cFileName); if (downcase) strlwr(&p->start[idx]); p->nfiles++; idx += len+1; } FindClose(fh); p->size = idx; p->curr = p->start; return p; } // // Readdir just returns the current string pointer and bumps the // string pointer to the next entry. // struct direct * readdir(DIR *dirp) { int len; static int dummy = 0; if (dirp->curr) { // // first set up the structure to return // len = strlen(dirp->curr); strcpy(dirp->dirstr.d_name, dirp->curr); dirp->dirstr.d_namlen = len; // // Fake inode // dirp->dirstr.d_ino = dummy++; // // Now set up for the next call to readdir // dirp->curr += len + 1; if (dirp->curr >= (dirp->start + dirp->size)) { dirp->curr = NULL; } return &(dirp->dirstr); } else return NULL; } // // Telldir returns the current string pointer position // long telldir(DIR *dirp) { return (long) dirp->curr; /* ouch! pointer to long cast */ } // // Seekdir moves the string pointer to a previously saved position // (Saved by telldir). void seekdir(DIR *dirp, long loc) { dirp->curr = (char *) loc; /* ouch! long to pointer cast */ } // // Rewinddir resets the string pointer to the start // void rewinddir(DIR *dirp) { dirp->curr = dirp->start; } // // This just free\'s the memory allocated by opendir // void closedir(DIR *dirp) { free(dirp->start); free(dirp); } #endif // // 98.2% of this code was lifted from the OS2 port. (JCW) // #if 0 // add_suffix is in util.c too. /* * Suffix appending for in-place editing under MS-DOS and OS/2 (and now NT!). * * Here are the rules: * * Style 0: Append the suffix exactly as standard perl would do it. * If the filesystem groks it, use it. (HPFS will always * grok it. So will NTFS. FAT will rarely accept it.) * * Style 1: The suffix begins with a '.'. The extension is replaced. * If the name matches the original name, use the fallback method. * * Style 2: The suffix is a single character, not a '.'. Try to add the * suffix to the following places, using the first one that works. * [1] Append to extension. * [2] Append to filename, * [3] Replace end of extension, * [4] Replace end of filename. * If the name matches the original name, use the fallback method. * * Style 3: Any other case: Ignore the suffix completely and use the * fallback method. * * Fallback method: Change the extension to ".$$$". If that matches the * original name, then change the extension to ".~~~". * * If filename is more than 1000 characters long, we die a horrible * death. Sorry. * * The filename restriction is a cheat so that we can use buf[] to store * assorted temporary goo. * * Examples, assuming style 0 failed. * * suffix = ".bak" (style 1) * foo.bar => foo.bak * foo.bak => foo.$$$ (fallback) * foo.$$$ => foo.~~~ (fallback) * makefile => makefile.bak * * suffix = "~" (style 2) * foo.c => foo.c~ * foo.c~ => foo.c~~ * foo.c~~ => foo~.c~~ * foo~.c~~ => foo~~.c~~ * foo~~~~~.c~~ => foo~~~~~.$$$ (fallback) * * foo.pas => foo~.pas * makefile => makefile.~ * longname.fil => longname.fi~ * longname.fi~ => longnam~.fi~ * longnam~.fi~ => longnam~.$$$ * */ static char suffix1[] = ".$$$"; static char suffix2[] = ".~~~"; #define ext (&buf[1000]) #define strEQ(s1,s2) (strcmp(s1,s2) == 0) void add_suffix(struct RString *str, char *suffix) { int baselen; int extlen = strlen(suffix); char *s, *t, *p; int slen; char buf[1024]; if (str->len > 1000) Fatal("Cannot do inplace edit on long filename (%d characters)", str->len); /* Style 0 */ slen = str->len; str_cat(str, suffix, extlen); if (valid_filename(str->ptr)) return; /* Fooey, style 0 failed. Fix str before continuing. */ str->ptr[str->len = slen] = '\0'; slen = extlen; t = buf; baselen = 0; s = str->ptr; while ( (*t = *s) && *s != '.') { baselen++; if (*s == '\\' || *s == '/') baselen = 0; s++; t++; } p = t; t = ext; extlen = 0; while (*t++ = *s++) extlen++; if (extlen == 0) { ext[0] = '.'; ext[1] = 0; extlen++; } if (*suffix == '.') { /* Style 1 */ if (strEQ(ext, suffix)) goto fallback; strcpy(p, suffix); } else if (suffix[1] == '\0') { /* Style 2 */ if (extlen < 4) { ext[extlen] = *suffix; ext[++extlen] = '\0'; } else if (baselen < 8) { *p++ = *suffix; } else if (ext[3] != *suffix) { ext[3] = *suffix; } else if (buf[7] != *suffix) { buf[7] = *suffix; } else goto fallback; strcpy(p, ext); } else { /* Style 3: Panic */ fallback: (void)memcpy(p, strEQ(ext, suffix1) ? suffix2 : suffix1, 5); } str_grow(str, strlen(buf)); memcpy(str->ptr, buf, str->len); } #endif static int valid_filename(char *s) { int fd; // // if the file exists, then it\'s a valid filename! // if (_access(s, 0) == 0) { return 1; } // // It doesn\'t exist, so see if we can open it. // if ((fd = _open(s, _O_CREAT, 0666)) >= 0) { close(fd); _unlink (s); // don\'t leave it laying around return 1; } return 0; } // // This is a clone of fdopen so that we can handle the // brain damaged version of sockets that NT gets to use. // // The problem is that sockets are not real file handles and // cannot be fdopen\'ed. This causes problems in the do_socket // routine in doio.c, since it tries to create two file pointers // for the socket just created. We\'ll fake out an fdopen and see // if we can prevent perl from trying to do stdio on sockets. // FILE * myfdopen (int fd, const char *mode) { FILE *fp; char sockbuf[80]; int optlen; int retval; extern int errno; //fprintf(stderr, "myfdopen()\n"); retval = getsockopt((SOCKET)fd, SOL_SOCKET, SO_TYPE, sockbuf, &optlen); if (retval == SOCKET_ERROR) { int iRet; iRet = WSAGetLastError(); if (iRet == WSAENOTSOCK || iRet == WSANOTINITIALISED) return (_fdopen(fd, mode)); } // // If we get here, then fd is actually a socket. // fp = xcalloc(sizeof(FILE), 1); #if _MSC_VER < 800 fileno(fp) = fd; #else fp->_file = fd; #endif if (*mode == 'r') fp->_flag = _IOREAD; else fp->_flag = _IOWRT; return fp; } // // Since the errors returned by the socket error function // WSAGetLastError() are not known by the library routine strerror // we have to roll our own. // #undef strerror char * mystrerror(int e) { static char buffer[512]; extern int sys_nerr; DWORD source = 0; if (e < 0 || e > sys_nerr) { if (e < 0) e = GetLastError(); if (FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM, &source, e, 0, buffer, 512, NULL) == 0) { strcpy (buffer, "Unknown Error"); } return buffer; } return strerror(e); } // // various stubs // // Ownership // // Just pretend that everyone is a superuser. NT will let us know if // we don\'t really have permission to do something. // #define ROOT_UID 0 #define ROOT_GID 0 UIDTYPE getuid(void) { return ROOT_UID; } UIDTYPE geteuid(void) { return ROOT_UID; } GIDTYPE getgid(void) { return ROOT_GID; } GIDTYPE getegid(void) { return ROOT_GID; } int setuid(int uid) { return (uid == ROOT_UID ? 0 : -1); } int setgid(int gid) { return (gid == ROOT_GID ? 0 : -1); } // // File system stuff // int /* ioctl(int i, unsigned int u, char *data) */ ioctl(int i, unsigned int u, long data) { return -1; } // // Networking trampolines // These are used to avoid socket startup/shutdown overhead in case // the socket routines aren\'t used. // #undef select static int NtSocketsInitialized = 0; long myselect (int nfds, fd_set *rd, fd_set *wr, fd_set *ex, struct timeval *timeout) { long r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = select (nfds, rd, wr, ex, timeout)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } static void StartSockets () { WORD version; WSADATA retdata; int ret; // // initalize the winsock interface and insure that it\'s // cleaned up at exit. // version = MAKEWORD(1, 1); if (ret = WSAStartup(version, &retdata)) Fatal ("Unable to locate winsock library!\n"); if (LOBYTE(retdata.wVersion) != 1) Fatal("could not find version 1 of winsock dll\n"); if (HIBYTE(retdata.wVersion) != 1) Fatal("could not find version 1 of winsock dll\n"); atexit((void (*)(void)) WSACleanup); } #undef accept SOCKET myaccept (SOCKET s, struct sockaddr *addr, int *addrlen) { SOCKET r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = accept (s, addr, addrlen)) == INVALID_SOCKET) errno = WSAGetLastError(); return r; } #undef bind int mybind (SOCKET s, struct sockaddr *addr, int addrlen) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = bind (s, addr, addrlen)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef connect int myconnect (SOCKET s, struct sockaddr *addr, int addrlen) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = connect (s, addr, addrlen)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef getpeername int mygetpeername (SOCKET s, struct sockaddr *addr, int *addrlen) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = getpeername (s, addr, addrlen)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef getsockname int mygetsockname (SOCKET s, struct sockaddr *addr, int *addrlen) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = getsockname (s, addr, addrlen)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef getsockopt int mygetsockopt (SOCKET s, int level, int optname, char *optval, int *optlen) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = getsockopt (s, level, optname, optval, optlen)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef ioctlsocket int myioctlsocket (SOCKET s, long cmd, u_long *argp) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = ioctlsocket (s, cmd, argp)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef listen int mylisten (SOCKET s, int backlog) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = listen (s, backlog)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef recv int myrecv (SOCKET s, char *buf, int len, int flags) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = recv (s, buf, len, flags)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef recvfrom int myrecvfrom (SOCKET s, char *buf, int len, int flags, struct sockaddr *from, int *fromlen) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = recvfrom (s, buf, len, flags, from, fromlen)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef send int mysend (SOCKET s, char *buf, int len, int flags) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = send (s, buf, len, flags)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef sendto int mysendto (SOCKET s, char *buf, int len, int flags, struct sockaddr *to, int tolen) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = sendto (s, buf, len, flags, to, tolen)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef setsockopt int mysetsockopt (SOCKET s, int level, int optname, char *optval, int optlen) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = setsockopt (s, level, optname, optval, optlen)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef shutdown int myshutdown (SOCKET s, int how) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = shutdown (s, how)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef socket SOCKET mysocket (int af, int type, int protocol) { SOCKET s; if (!NtSocketsInitialized++) { StartSockets(); } if ((s = socket (af, type, protocol)) == INVALID_SOCKET) { errno = WSAGetLastError(); //fprintf(stderr, "socket fail (%d)", WSAGetLastError()); } return s; } #undef gethostbyaddr struct hostent * mygethostbyaddr (char *addr, int len, int type) { struct hostent *r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = gethostbyaddr (addr, len, type)) == NULL) errno = WSAGetLastError(); return r; } #undef gethostbyname struct hostent * mygethostbyname (char *name) { struct hostent *r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = gethostbyname (name)) == NULL) errno = WSAGetLastError(); return r; } #undef gethostname int mygethostname (char *name, int len) { int r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = gethostname (name, len)) == SOCKET_ERROR) errno = WSAGetLastError(); return r; } #undef getprotobyname struct protoent * mygetprotobyname (char *name) { struct protoent *r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = getprotobyname (name)) == NULL) errno = WSAGetLastError(); return r; } #undef getprotobynumber struct protoent * mygetprotobynumber (int num) { struct protoent *r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = getprotobynumber (num)) == NULL) errno = WSAGetLastError(); return r; } #undef getservbyname struct servent * mygetservbyname (char *name, char *proto) { struct servent *r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = getservbyname (name, proto)) == NULL) errno = WSAGetLastError(); return r; } #undef getservbyport struct servent * mygetservbyport (int port, char *proto) { struct servent *r; if (!NtSocketsInitialized++) { StartSockets(); } if ((r = getservbyport (port, proto)) == NULL) errno = WSAGetLastError(); return r; } // // Networking stubs // void endhostent() {} void endnetent() {} void endprotoent() {} void endservent() {} struct netent *getnetent (void) {return (struct netent *) NULL;} struct netent *getnetbyaddr(char *name) {return (struct netent *)NULL;} struct netent *getnetbyname(long net, int type) {return (struct netent *)NULL;} struct protoent *getprotoent (void) {return (struct protoent *) NULL;} struct servent *getservent (void) {return (struct servent *) NULL;} void sethostent (int stayopen) {} void setnetent (int stayopen) {} void setprotoent (int stayopen) {} void setservent (int stayopen) {} #ifndef WNOHANG #define WNOHANG -1 #endif pid_t waitpid (pid_t pid, int *stat_loc, int options) { DWORD timeout; if (options == WNOHANG) { timeout = 0; } else { timeout = INFINITE; } if (WaitForSingleObject((HANDLE) pid, timeout) == WAIT_OBJECT_0) { pid = _cwait(stat_loc, pid, 0); return pid; } return 0; } #include void _cdecl gettimeofday(struct timeval *tv, struct timezone *tz) { struct timeb tb; ftime(&tb); tv->tv_sec = tb.time; tv->tv_usec = tb.millitm * 1000; } char * getcwd(buffer, size) char *buffer; int size; { int length; char *bp; if (_getcwd(buffer, size) == NULL) { return NULL; } length = strlen(buffer); if (length >= size) { return NULL; } for (bp = buffer; *bp != '\0'; bp++) { if (*bp == '\\') { *bp = '/'; } } return buffer; } static char * str_grow(struct RString *str, size_t new_size) { char *p; p = realloc(str->ptr, new_size); if (p == NULL) Fatal("cannot grow string\n"); str->len = new_size; str->ptr = p; return p; } int chown(char *path, int owner, int group) { return 0; } int kill(int pid, int sig) { #if 1 if (pid == GetCurrentProcessId()) return raise(sig); if (sig == 2 && pid > 0) if (GenerateConsoleCtrlEvent(CTRL_C_EVENT, (DWORD)pid)) return 0; return -1; #else return 0; #endif } int link(char *from, char *to) { return -1; } int wait() { return 0; } ruby-1.2.3/missing/nt.h100644 774 145 16702 6607047472 13040 0ustar matzNaCl#ifndef EXT_NT_H #define EXT_NT_H /* * Copyright (c) 1993, Intergraph Corporation * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the perl README file. * */ #if defined(IMPORT) #define EXTERN extern __declspec(dllimport) #elif defined(EXPORT) #define EXTERN extern __declspec(dllexport) #endif // // Definitions for NT port of Perl // // // GRRRR!!!! Windows Nonsense. // Define the following so we don't get tons of extra stuff // when we include windows.h // #if 0 #define NOGDICAPMASKS #define NOVIRTUALKEYCODES #define NOWINMESSAGES #define NOWINSTYLES #define NOSYSMETRICS #define NOMENUS #define NOICONS #define NOKEYSTATES #define NOSYSCOMMANDS #define NORASTEROPS #define NOSHOWWINDOW #define OEMRESOURCE #define NOATOM #define NOCLIPBOARD #define NOCOLOR #define NOCTLMGR #define NODRAWTEXT #define NOGDI //#define NOKERNEL //#define NOUSER #define NONLS #define NOMB #define NOMEMMGR #define NOMETAFILE #define NOMINMAX #define NOMSG #define NOOPENFILE #define NOSCROLL #define NOSERVICE #define NOSOUND #define NOTEXTMETRIC #define NOWH #define NOWINOFFSETS #define NOCOMM #define NOKANJI #define NOHELP #define NOPROFILER #define NODEFERWINDOWPOS #endif // // Ok now we can include the normal include files. // // #include conflict with varargs.h? // There is function-name conflitct, so we rename it #if !defined(IN) && !defined(FLOAT) #define OpenFile WINAPI_OpenFile #include #include #undef OpenFile #endif // // We\'re not using Microsoft\'s "extensions" to C for // Structured Exception Handling (SEH) so we can nuke these // #undef try #undef except #undef finally #undef leave #include #include #include #include #include #include #include #include #include // // Grrr... // #define access _access #define chmod _chmod #define chsize _chsize #define close _close #define creat _creat #define dup _dup #define dup2 _dup2 #define eof _eof #define filelength _filelength #define isatty _isatty #define locking _locking #define lseek _lseek #define mktemp _mktemp #define open _open #define read _read #define setmode _setmode #define sopen _sopen #define tell _tell #define umask _umask #define unlink _unlink #define write _write #define execl _execl #define execle _execle #define execlp _execlp #define execlpe _execlpe #define execv _execv #define execve _execve #define execvp _execvp #define execvpe _execvpe #define getpid _getpid #define spawnl _spawnl #define spawnle _spawnle #define spawnlp _spawnlp #define spawnlpe _spawnlpe #define spawnv _spawnv #define spawnve _spawnve #define spawnvp _spawnvp #define spawnvpe _spawnvpe #if _MSC_VER < 800 #define fileno _fileno #endif #define utime _utime //#define pipe _pipe #define perror _perror /* these are defined in nt.c */ extern int NtMakeCmdVector(char *, char ***, int); /* extern void NtInitialize(int *, char ***); */ extern char *NtGetLib(void); extern char *NtGetBin(void); extern FILE *mypopen(char *, char *); extern int flock(int fd, int oper); extern FILE * myfdopen(int, char*); extern SOCKET myaccept(SOCKET, struct sockaddr *, int *); extern int mybind(SOCKET, struct sockaddr *, int); extern int myconnect(SOCKET, struct sockaddr *, int); extern int mygetpeername(SOCKET, struct sockaddr *, int *); extern int mygetsockname(SOCKET, struct sockaddr *, int *); extern int mygetsockopt(SOCKET, int, int, char *, int *); extern int myioctlsocket(SOCKET, long, u_long *); extern int mylisten(SOCKET, int); extern int myrecv(SOCKET, char *, int, int); extern int myrecvfrom(SOCKET, char *, int, int, struct sockaddr *, int *); extern int mysend(SOCKET, char *, int, int); extern int mysendto(SOCKET, char *, int, int, struct sockaddr *, int); extern int mysetsockopt(SOCKET, int, int, char *, int); extern int myshutdown(SOCKET, int); extern SOCKET mysocket(int, int, int); extern struct hostent * mygethostbyaddr(char *, int, int); extern struct hostent * mygethostbyname(char *); extern int mygethostname(char *, int); extern struct protoent * mygetprotobyname(char *); extern struct protoent * mygetprotobynumber(int); extern struct servent * mygetservbyname(char *, char *); extern struct servent * mygetservbyport(int, char *); // // define this so we can do inplace editing // #define SUFFIX // // stubs // // extern int ioctl (int, unsigned int, char *); extern int ioctl (int, unsigned int, long); #if 0 extern void sleep (unsigned int); #else #define sleep(x) Sleep(x*1000) #endif extern UIDTYPE getuid (void); extern UIDTYPE geteuid (void); extern GIDTYPE getgid (void); extern GIDTYPE getegid (void); extern int setuid (int); extern int setgid (int); #undef IN /* confict in parse.c */ #if 0 extern int sys_nerr; extern char *sys_errlist[]; #endif extern char *mystrerror(int); #define strerror(e) mystrerror(e) #define PIPE_BUF 1024 #define HAVE_STDLIB_H 1 #define HAVE_GETLOGIN 1 #define HAVE_WAITPID 1 #define HAVE_GETCWD 1 #define LOCK_SH 1 #define LOCK_EX 2 #define LOCK_NB 4 #define LOCK_UN 8 #ifndef EWOULDBLOCK #define EWOULDBLOCK 10035 /* EBASEERR + 35 (winsock.h) */ #endif #define O_BINARY 0x8000 #ifdef popen #undef popen #define popen mypopen #endif #ifdef pclose #undef pclose #define pclose mypclose #endif /* #undef va_start */ /* #undef va_end */ #ifdef fdopen #undef fdopen #endif #define fdopen myfdopen #ifdef accept #undef accept #endif #define accept myaccept #ifdef bind #undef bind #endif #define bind mybind #ifdef connect #undef connect #endif #define connect myconnect #ifdef getpeername #undef getpeername #endif #define getpeername mygetpeername #ifdef getsockname #undef getsockname #endif #define getsockname mygetsockname #ifdef getsockopt #undef getsockopt #endif #define getsockopt mygetsockopt #ifdef ioctlsocket #undef ioctlsocket #endif #define ioctlsocket myioctlsocket #ifdef listen #undef listen #endif #define listen mylisten #ifdef recv #undef recv #endif #define recv myrecv #ifdef recvfrom #undef recvfrom #endif #define recvfrom myrecvfrom #ifdef send #undef send #endif #define send mysend #ifdef sendto #undef sendto #endif #define sendto mysendto #ifdef setsockopt #undef setsockopt #endif #define setsockopt mysetsockopt #ifdef shutdown #undef shutdown #endif #define shutdown myshutdown #ifdef socket #undef socket #endif #define socket mysocket #ifdef gethostbyaddr #undef gethostbyaddr #endif #define gethostbyaddr mygethostbyaddr #ifdef gethostbyname #undef gethostbyname #endif #define gethostbyname mygethostbyname #ifdef gethostname #undef gethostname #endif #define gethostname mygethostname #ifdef getprotobyname #undef getprotobyname #endif #define getprotobyname mygetprotobyname #ifdef getprotobynumber #undef getprotobynumber #endif #define getprotobynumber mygetprotobynumber #ifdef getservbyname #undef getservbyname #endif #define getservbyname mygetservbyname #ifdef getservbyport #undef getservbyport #endif #define getservbyport mygetservbyport #endif ruby-1.2.3/missing/setenv.c100644 774 145 10403 6650767730 13712 0ustar matzNaCl/* * Copyright (c) 1991, Larry Wall * * You may distribute under the terms of either the GNU General Public * License or the Artistic License, as specified in the README file. */ void *xmalloc (); void *xcalloc (); void *xrealloc (); #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)) #if defined(NT) && defined(_MSC_VER) extern char **_environ; #define environ _environ #else extern char **environ; #endif extern char **origenviron; #ifndef NT char *strdup(); #endif #ifdef USE_WIN32_RTL_ENV #include #endif static int envix(nam) char *nam; { register int i, len = strlen(nam); for (i = 0; environ[i]; i++) { if (memcmp(environ[i],nam,len) == 0 && environ[i][len] == '=') break; /* memcmp must come first to avoid */ } /* potential SEGV's */ return i; } #ifndef WIN32 void setenv(nam,val, n) char *nam, *val; int n; { register int i=envix(nam); /* where does it go? */ if (environ == origenviron) { /* need we copy environment? */ int j; int max; char **tmpenv; /*SUPPRESS 530*/ for (max = i; environ[max]; max++) ; tmpenv = ALLOC_N(char*, max+2); for (j=0; j #define min(a,b) (((a)>(b))?(b):(a)) int strcasecmp(p1, p2) char *p1, *p2; { for ( ; *p1 && *p2; p1++, p2++) { if (toupper(*p1) != toupper(*p2)) return toupper(*p1) - toupper(*p2); } return strlen(p1) - strlen(p2); } ruby-1.2.3/missing/strchr.c100644 774 145 1340 6501437064 13660 0ustar matzNaCl/* * strchr --- search a string for a character * * We supply this routine for those systems that aren't standard yet. */ #include char * strchr(str, c) register const char *str, c; { if (c == '\0') { /* thanks to Mike Brennan ... */ do { if (*str == c) return (char *) str; } while (*str++); } else { for (; *str; str++) if (*str == c) return (char *) str; } return NULL; } /* * strrchr --- find the last occurrence of a character in a string * * We supply this routine for those systems that aren't standard yet. */ char * strrchr(str, c) register const char *str, c; { register const char *save = NULL; for (; *str; str++) if (*str == c) save = str; return (char *) save; } ruby-1.2.3/missing/strdup.c100644 774 145 673 6457652070 13672 0ustar matzNaCl/************************************************ strdup.c - $Author: matz $ $Date: 1998/01/16 12:36:08 $ 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-1.2.3/missing/strerror.c100644 774 145 521 6457556236 14232 0ustar matzNaCl/* * 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-1.2.3/missing/strftime.c100644 774 145 52507 6457556236 14260 0ustar matzNaCl/* * 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 a an RFC822 time format, add MAILHEADER_EXT. * For ISO week years, add ISO_DATE_EXT. * For complete POSIX semantics, add POSIX_SEMANTICS. * * The code for %c, %x, and %X now follows the 1003.2 specification for * the POSIX locale. * 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 * Updated January, 1995 * Updated September, 1995 * Updated January, 1996 * * 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 * %z code from chip@chinacat.unicom.com * Applied September 1995 * %V code fixed (again) and %G, %g added, * January 1996 */ #ifndef GAWK #include #include #include #include #endif #if defined(TM_IN_SYS_TIME) || ! defined(GAWK) #include #include #endif /* 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 */ #define MAILHEADER_EXT 1 /* add %z for HHMM format */ #define ISO_DATE_EXT 1 /* %G and %g for year of ISO week */ #ifndef GAWK #define POSIX_SEMANTICS 1 /* call tzset() if TZ changes */ #endif #if defined(ISO_DATE_EXT) #if ! defined(POSIX2_DATE) #define POSIX2_DATE 1 #endif #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]; extern int daylight; #ifdef SOLARIS extern long timezone, altzone; #else extern int timezone, altzone; #endif #endif #undef min /* just in case */ /* 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); } #undef max /* also, just in case */ /* 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]; long off; int i, w, y; static short first = 1; #ifdef POSIX_SEMANTICS static char *savetz = NULL; static int savetzlen = 0; char *tz; #endif /* POSIX_SEMANTICS */ #ifndef HAVE_TM_ZONE #ifndef HAVE_TM_NAME #ifndef HAVE_TZNAME extern char *timezone(); struct timeval tv; struct timezone zone; #endif /* HAVE_TZNAME */ #endif /* HAVE_TM_NAME */ #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 */ strftime(tbuf, sizeof tbuf, "%a %b %e %H:%M:%S %Y", timeptr); 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 */ strftime(tbuf, sizeof tbuf, "%m/%d/%y", timeptr); break; case 'X': /* appropriate time representation */ strftime(tbuf, sizeof tbuf, "%H:%M:%S", timeptr); 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; #ifdef MAILHEADER_EXT /* * From: Chip Rosenthal * Date: Sun, 19 Mar 1995 00:33:29 -0600 (CST) * * Warning: the %z [code] is implemented by inspecting the * timezone name conditional compile settings, and * inferring a method to get timezone offsets. I've tried * this code on a couple of machines, but I don't doubt * there is some system out there that won't like it. * Maybe the easiest thing to do would be to bracket this * with an #ifdef that can turn it off. The %z feature * would be an admittedly obscure one that most folks can * live without, but it would be a great help to those of * us that muck around with various message processors. */ case 'z': /* time zone offset east of GMT e.g. -0600 */ #ifdef HAVE_TM_NAME /* * Systems with tm_name probably have tm_tzadj as * secs west of GMT. Convert to mins east of GMT. */ off = -timeptr->tm_tzadj / 60; #else /* !HAVE_TM_NAME */ #ifdef HAVE_TM_ZONE /* * Systems with tm_zone probably have tm_gmtoff as * secs east of GMT. Convert to mins east of GMT. */ off = timeptr->tm_gmtoff / 60; #else /* !HAVE_TM_ZONE */ #if HAVE_TZNAME /* * Systems with tzname[] probably have timezone as * secs west of GMT. Convert to mins east of GMT. */ off = -(daylight ? timezone : altzone) / 60; #else /* !HAVE_TZNAME */ off = -zone.tz_minuteswest; #endif /* !HAVE_TZNAME */ #endif /* !HAVE_TM_ZONE */ #endif /* !HAVE_TM_NAME */ if (off < 0) { tbuf[0] = '-'; off = -off; } else { tbuf[0] = '+'; } sprintf(tbuf+1, "%02d%02d", off/60, off%60); break; #endif /* MAILHEADER_EXT */ case 'Z': /* time zone name or abbrevation */ #ifdef HAVE_TZNAME i = (daylight && timeptr->tm_isdst > 0); /* 0 or 1 */ strcpy(tbuf, tzname[i]); #else #ifdef HAVE_TM_ZONE strcpy(tbuf, timeptr->tm_zone); #else #ifdef HAVE_TM_NAME strcpy(tbuf, timeptr->tm_name); #else gettimeofday(& tv, & zone); strcpy(tbuf, timezone(zone.tz_minuteswest, timeptr->tm_isdst > 0)); #endif /* HAVE_TM_NAME */ #endif /* HAVE_TM_ZONE */ #endif /* HAVE_TZNAME */ 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 */ 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 */ #ifdef ISO_DATE_EXT case 'G': case 'g': /* * Year of ISO week. * * If it's December but the ISO week number is one, * that week is in next year. * If it's January but the ISO week number is 52 or * 53, that week is in last year. * Otherwise, it's this year. */ w = iso8601wknum(timeptr); if (timeptr->tm_mon == 11 && w == 1) y = 1900 + timeptr->tm_year + 1; else if (timeptr->tm_mon == 0 && w >= 52) y = 1900 + timeptr->tm_year - 1; else y = 1900 + timeptr->tm_year; if (*format == 'G') sprintf(tbuf, "%d", y); else sprintf(tbuf, "%02d", y % 100); break; #endif ISO_DATE_EXT 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 * year (52 or 53), 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: /* Wednesday */ 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; } if (timeptr->tm_mon == 11) { /* * The last week of the year * can be in week 1 of next year. * Sigh. * * This can only happen if * M T W * 29 30 31 * 30 31 * 31 */ int wday, mday; wday = timeptr->tm_wday; mday = timeptr->tm_mday; if ( (wday == 1 && (mday >= 29 && mday <= 31)) || (wday == 2 && (mday == 30 || mday == 31)) || (wday == 3 && mday == 31)) weeknum = 1; } 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) VMS 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", "(%%z) timezone offset east of GMT as HHMM (e.g. -0500) %z", (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-1.2.3/missing/strstr.c100644 774 145 3606 6457652070 13731 0ustar matzNaCl/* * 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: /home/cvsroot/ruby/missing/strstr.c,v 1.1.1.1.4.1 1998/01/16 12:36:08 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-1.2.3/missing/strtol.c100644 774 145 4066 6457556236 13727 0ustar matzNaCl/* * 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-1.2.3/missing/strtoul.c100644 774 145 10070 6457556236 14124 0ustar matzNaCl/* * 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-1.2.3/missing/vsnprintf.c100644 774 145 65264 6652107370 14444 0ustar matzNaCl/*- * Copyright (c) 1990, 1993 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley by * Chris Torek. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ /* SNPRINTF.C * fjc 7-31-97 Modified by Mib Software to be a standalone snprintf.c module. * http://www.mibsoftware.com * Mib Software does not warrant this software any differently than the * University of California, Berkeley as described above. All warranties * are disclaimed. Use this software at your own risk. * * All code referencing FILE * functions was eliminated, since it could * never be called. All header files and necessary files are collapsed * into one file, internal functions are declared static. This should * allow inclusion into libraries with less chance of namespace collisions. * * snprintf should be the only externally visible item. * * As of 7-31-97 FLOATING_POINT is NOT provided. The code is somewhat * non-portable, so it is disabled. */ /* Define FLOATING_POINT to get floating point. */ /* #define FLOATING_POINT */ #include #define u_long unsigned long #define u_short unsigned short #define u_int unsigned int #undef __P #if defined(__STDC__) # include # if !defined(__P) # define __P(x) x # endif #else # define __P(x) () # if !defined(const) # define const # endif # include #endif #ifndef _BSD_VA_LIST_ #define _BSD_VA_LIST_ va_list #endif #ifdef __STDC__ # include #else # ifndef LONG_MAX # ifdef HAVE_LIMITS_H # include # else /* assuming 32bit(2's compliment) long */ # define LONG_MAX 2147483647 # endif # endif #endif #if defined(__hpux) && !defined(__GNUC__) #define const #endif #if defined(sgi) #undef __const #define __const #endif /* People who don't like const sys_error */ #ifdef NT typedef long size_t; #endif #ifndef NULL #define NULL 0 #endif /* * NB: to fit things in six character monocase externals, the stdio * code uses the prefix `__s' for stdio objects, typically followed * by a three-character attempt at a mnemonic. */ /* stdio buffers */ struct __sbuf { unsigned char *_base; int _size; }; /* * stdio state variables. * * The following always hold: * * if (_flags&(__SLBF|__SWR)) == (__SLBF|__SWR), * _lbfsize is -_bf._size, else _lbfsize is 0 * if _flags&__SRD, _w is 0 * if _flags&__SWR, _r is 0 * * This ensures that the getc and putc macros (or inline functions) never * try to write or read from a file that is in `read' or `write' mode. * (Moreover, they can, and do, automatically switch from read mode to * write mode, and back, on "r+" and "w+" files.) * * _lbfsize is used only to make the inline line-buffered output stream * code as compact as possible. * * _ub, _up, and _ur are used when ungetc() pushes back more characters * than fit in the current _bf, or when ungetc() pushes back a character * that does not match the previous one in _bf. When this happens, * _ub._base becomes non-nil (i.e., a stream has ungetc() data iff * _ub._base!=NULL) and _up and _ur save the current values of _p and _r. * * NB: see WARNING above before changing the layout of this structure! */ typedef struct __sFILE { unsigned char *_p; /* current position in (some) buffer */ int _r; /* read space left for getc() */ int _w; /* write space left for putc() */ short _flags; /* flags, below; this FILE is free if 0 */ short _file; /* fileno, if Unix descriptor, else -1 */ struct __sbuf _bf; /* the buffer (at least 1 byte, if !NULL) */ int _lbfsize; /* 0 or -_bf._size, for inline putc */ } FILE; #define __SLBF 0x0001 /* line buffered */ #define __SNBF 0x0002 /* unbuffered */ #define __SRD 0x0004 /* OK to read */ #define __SWR 0x0008 /* OK to write */ /* RD and WR are never simultaneously asserted */ #define __SRW 0x0010 /* open for reading & writing */ #define __SEOF 0x0020 /* found EOF */ #define __SERR 0x0040 /* found error */ #define __SMBF 0x0080 /* _buf is from malloc */ #define __SAPP 0x0100 /* fdopen()ed in append mode */ #define __SSTR 0x0200 /* this is an sprintf/snprintf string */ #define __SOPT 0x0400 /* do fseek() optimisation */ #define __SNPT 0x0800 /* do not do fseek() optimisation */ #define __SOFF 0x1000 /* set iff _offset is in fact correct */ #define __SMOD 0x2000 /* true => fgetln modified _p text */ #define EOF (-1) #define __sfeof(p) (((p)->_flags & __SEOF) != 0) #define __sferror(p) (((p)->_flags & __SERR) != 0) #define __sclearerr(p) ((void)((p)->_flags &= ~(__SERR|__SEOF))) #define __sfileno(p) ((p)->_file) #define feof(p) __sfeof(p) #define ferror(p) __sferror(p) #define clearerr(p) __sclearerr(p) #ifndef _ANSI_SOURCE #define fileno(p) __sfileno(p) #endif #if defined(__hpux) && !defined(__GNUC__) #include #endif /* * I/O descriptors for __sfvwrite(). */ struct __siov { void *iov_base; size_t iov_len; }; struct __suio { struct __siov *uio_iov; int uio_iovcnt; int uio_resid; }; /* * Write some memory regions. Return zero on success, EOF on error. * * This routine is large and unsightly, but most of the ugliness due * to the three different kinds of output buffering is handled here. */ static BSD__sfvwrite(fp, uio) register FILE *fp; register struct __suio *uio; { register size_t len; register char *p; register struct __siov *iov; register int w, s; char *nl; int nlknown, nldist; if ((len = uio->uio_resid) == 0) return (0); #ifndef __hpux #define MIN(a, b) ((a) < (b) ? (a) : (b)) #endif #define COPY(n) (void)memcpy((void *)fp->_p, (void *)p, (size_t)(n)) iov = uio->uio_iov; p = iov->iov_base; len = iov->iov_len; iov++; #define GETIOV(extra_work) \ while (len == 0) { \ extra_work; \ p = iov->iov_base; \ len = iov->iov_len; \ iov++; \ } if (fp->_flags & __SNBF) { /* fjc 7-31-97 Will never happen. We are working with strings only */ } else if ((fp->_flags & __SLBF) == 0) { /* * Fully buffered: fill partially full buffer, if any, * and then flush. If there is no partial buffer, write * one _bf._size byte chunk directly (without copying). * * String output is a special case: write as many bytes * as fit, but pretend we wrote everything. This makes * snprintf() return the number of bytes needed, rather * than the number used, and avoids its write function * (so that the write function can be invalid). */ do { GETIOV(;); w = fp->_w; if (fp->_flags & __SSTR) { if (len < w) w = len; COPY(w); /* copy MIN(fp->_w,len), */ fp->_w -= w; fp->_p += w; w = len; /* but pretend copied all */ } else { /* fjc 7-31-97 Will never happen. We are working with strings only */ } p += w; len -= w; } while ((uio->uio_resid -= w) != 0); } else { /* fjc 7-31-97 Will never happen. We are working with strings only */ } return (0); err: fp->_flags |= __SERR; return (EOF); } /* * Actual printf innards. * * This code is large and complicated... */ #if !defined(__CYGWIN32__) && defined(__hpux) && !defined(__GNUC__) #include #endif /* * Flush out all the vectors defined by the given uio, * then reset it so that it can be reused. */ static int BSD__sprint(fp, uio) FILE *fp; register struct __suio *uio; { register int err; if (uio->uio_resid == 0) { uio->uio_iovcnt = 0; return (0); } err = BSD__sfvwrite(fp, uio); uio->uio_resid = 0; uio->uio_iovcnt = 0; return (err); } /* * Helper function for `fprintf to unbuffered unix file': creates a * temporary buffer. We only work on write-only files; this avoids * worries about ungetc buffers and so forth. */ static int BSD__sbprintf(fp, fmt, ap) register FILE *fp; const char *fmt; va_list ap; { /* We don't support files. */ return 0; } /* * Macros for converting digits to letters and vice versa */ #define to_digit(c) ((c) - '0') #define is_digit(c) ((unsigned)to_digit(c) <= 9) #define to_char(n) ((n) + '0') /* * Convert an unsigned long to ASCII for printf purposes, returning * a pointer to the first character of the string representation. * Octal numbers can be forced to have a leading zero; hex numbers * use the given digits. */ static char * BSD__ultoa(val, endp, base, octzero, xdigs) register u_long val; char *endp; int base, octzero; char *xdigs; { register char *cp = endp; register long sval; /* * Handle the three cases separately, in the hope of getting * better/faster code. */ switch (base) { case 10: if (val < 10) { /* many numbers are 1 digit */ *--cp = to_char(val); return (cp); } /* * On many machines, unsigned arithmetic is harder than * signed arithmetic, so we do at most one unsigned mod and * divide; this is sufficient to reduce the range of * the incoming value to where signed arithmetic works. */ if (val > LONG_MAX) { *--cp = to_char(val % 10); sval = val / 10; } else sval = val; do { *--cp = to_char(sval % 10); sval /= 10; } while (sval != 0); break; case 8: do { *--cp = to_char(val & 7); val >>= 3; } while (val); if (octzero && *cp != '0') *--cp = '0'; break; case 16: do { *--cp = xdigs[val & 15]; val >>= 4; } while (val); break; default: /* oops */ /* abort(); */ break; /* fjc 7-31-97. Don't reference abort() here */ } return (cp); } #ifdef FLOATING_POINT #include #include "floatio.h" #define BUF (MAXEXP+MAXFRACT+1) /* + decimal point */ #define DEFPREC 6 static char *cvt __P((double, int, int, char *, int *, int, int *)); static int exponent __P((char *, int, int)); #else /* no FLOATING_POINT */ #define BUF 68 #endif /* FLOATING_POINT */ /* * Flags used during conversion. */ #define ALT 0x001 /* alternate form */ #define HEXPREFIX 0x002 /* add 0x or 0X prefix */ #define LADJUST 0x004 /* left adjustment */ #define LONGDBL 0x008 /* long double; unimplemented */ #define LONGINT 0x010 /* long integer */ #ifdef _HAVE_SANE_QUAD_ #define QUADINT 0x020 /* quad integer */ #endif /* _HAVE_SANE_QUAD_ */ #define SHORTINT 0x040 /* short integer */ #define ZEROPAD 0x080 /* zero (as opposed to blank) pad */ #define FPT 0x100 /* Floating point number */ static int BSD_vfprintf(fp, fmt0, ap) FILE *fp; const char *fmt0; va_list ap; { register char *fmt; /* format string */ register int ch; /* character from fmt */ register int n; /* handy integer (short term usage) */ register char *cp; /* handy char pointer (short term usage) */ register struct __siov *iovp;/* for PRINT macro */ register int flags; /* flags as above */ int ret; /* return value accumulator */ int width; /* width from format (%8d), or 0 */ int prec; /* precision from format (%.3d), or -1 */ char sign; /* sign prefix (' ', '+', '-', or \0) */ #ifdef FLOATING_POINT char softsign; /* temporary negative sign for floats */ double _double; /* double precision arguments %[eEfgG] */ int expt; /* integer value of exponent */ int expsize; /* character count for expstr */ int ndig; /* actual number of digits returned by cvt */ char expstr[7]; /* buffer for exponent string */ #endif u_long ulval; /* integer arguments %[diouxX] */ #ifdef _HAVE_SANE_QUAD_ u_quad_t uqval; /* %q integers */ #endif /* _HAVE_SANE_QUAD_ */ int base; /* base for [diouxX] conversion */ int dprec; /* a copy of prec if [diouxX], 0 otherwise */ int fieldsz; /* field size expanded by sign, etc */ int realsz; /* field size expanded by dprec */ int size; /* size of converted field or string */ char *xdigs; /* digits for [xX] conversion */ #define NIOV 8 struct __suio uio; /* output information: summary */ struct __siov iov[NIOV];/* ... and individual io vectors */ char buf[BUF]; /* space for %c, %[diouxX], %[eEfgG] */ char ox[2]; /* space for 0x hex-prefix */ /* * Choose PADSIZE to trade efficiency vs. size. If larger printf * fields occur frequently, increase PADSIZE and make the initialisers * below longer. */ #define PADSIZE 16 /* pad chunk size */ static char blanks[PADSIZE] = {' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' ',' '}; static char zeroes[PADSIZE] = {'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0'}; /* * BEWARE, these `goto error' on error, and PAD uses `n'. */ #define PRINT(ptr, len) { \ iovp->iov_base = (ptr); \ iovp->iov_len = (len); \ uio.uio_resid += (len); \ iovp++; \ if (++uio.uio_iovcnt >= NIOV) { \ if (BSD__sprint(fp, &uio)) \ goto error; \ iovp = iov; \ } \ } #define PAD(howmany, with) { \ if ((n = (howmany)) > 0) { \ while (n > PADSIZE) { \ PRINT(with, PADSIZE); \ n -= PADSIZE; \ } \ PRINT(with, n); \ } \ } #define FLUSH() { \ if (uio.uio_resid && BSD__sprint(fp, &uio)) \ goto error; \ uio.uio_iovcnt = 0; \ iovp = iov; \ } /* * To extend shorts properly, we need both signed and unsigned * argument extraction methods. */ #define SARG() \ (flags&LONGINT ? va_arg(ap, long) : \ flags&SHORTINT ? (long)(short)va_arg(ap, int) : \ (long)va_arg(ap, int)) #define UARG() \ (flags&LONGINT ? va_arg(ap, u_long) : \ flags&SHORTINT ? (u_long)(u_short)va_arg(ap, int) : \ (u_long)va_arg(ap, u_int)) /* optimise fprintf(stderr) (and other unbuffered Unix files) */ if ((fp->_flags & (__SNBF|__SWR|__SRW)) == (__SNBF|__SWR) && fp->_file >= 0) return (BSD__sbprintf(fp, fmt0, ap)); fmt = (char *)fmt0; uio.uio_iov = iovp = iov; uio.uio_resid = 0; uio.uio_iovcnt = 0; ret = 0; /* * Scan the format for conversions (`%' character). */ for (;;) { for (cp = fmt; (ch = *fmt) != '\0' && ch != '%'; fmt++) /* void */; if ((n = fmt - cp) != 0) { PRINT(cp, n); ret += n; } if (ch == '\0') goto done; fmt++; /* skip over '%' */ flags = 0; dprec = 0; width = 0; prec = -1; sign = '\0'; rflag: ch = *fmt++; reswitch: switch (ch) { case ' ': /* * ``If the space and + flags both appear, the space * flag will be ignored.'' * -- ANSI X3J11 */ if (!sign) sign = ' '; goto rflag; case '#': flags |= ALT; goto rflag; case '*': /* * ``A negative field width argument is taken as a * - flag followed by a positive field width.'' * -- ANSI X3J11 * They don't exclude field widths read from args. */ if ((width = va_arg(ap, int)) >= 0) goto rflag; width = -width; /* FALLTHROUGH */ case '-': flags |= LADJUST; goto rflag; case '+': sign = '+'; goto rflag; case '.': if ((ch = *fmt++) == '*') { n = va_arg(ap, int); prec = n < 0 ? -1 : n; goto rflag; } n = 0; while (is_digit(ch)) { n = 10 * n + to_digit(ch); ch = *fmt++; } prec = n < 0 ? -1 : n; goto reswitch; case '0': /* * ``Note that 0 is taken as a flag, not as the * beginning of a field width.'' * -- ANSI X3J11 */ flags |= ZEROPAD; goto rflag; case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': n = 0; do { n = 10 * n + to_digit(ch); ch = *fmt++; } while (is_digit(ch)); width = n; goto reswitch; #ifdef FLOATING_POINT case 'L': flags |= LONGDBL; goto rflag; #endif case 'h': flags |= SHORTINT; goto rflag; case 'l': flags |= LONGINT; goto rflag; #ifdef _HAVE_SANE_QUAD_ case 'q': flags |= QUADINT; goto rflag; #endif /* _HAVE_SANE_QUAD_ */ case 'c': *(cp = buf) = va_arg(ap, int); size = 1; sign = '\0'; break; case 'D': flags |= LONGINT; /*FALLTHROUGH*/ case 'd': case 'i': #ifdef _HAVE_SANE_QUAD_ if (flags & QUADINT) { uqval = va_arg(ap, quad_t); if ((quad_t)uqval < 0) { uqval = -uqval; sign = '-'; } } else { #else /* _HAVE_SANE_QUAD_ */ { #endif /* _HAVE_SANE_QUAD_ */ ulval = SARG(); if ((long)ulval < 0) { ulval = -ulval; sign = '-'; } } base = 10; goto number; #ifdef FLOATING_POINT case 'e': /* anomalous precision */ case 'E': prec = (prec == -1) ? DEFPREC + 1 : prec + 1; /* FALLTHROUGH */ goto fp_begin; case 'f': /* always print trailing zeroes */ if (prec != 0) flags |= ALT; case 'g': case 'G': if (prec == -1) prec = DEFPREC; fp_begin: _double = va_arg(ap, double); /* do this before tricky precision changes */ if (isinf(_double)) { if (_double < 0) sign = '-'; cp = "Inf"; size = 3; break; } if (isnan(_double)) { cp = "NaN"; size = 3; break; } flags |= FPT; cp = cvt(_double, prec, flags, &softsign, &expt, ch, &ndig); if (ch == 'g' || ch == 'G') { if (expt <= -4 || expt > prec) ch = (ch == 'g') ? 'e' : 'E'; else ch = 'g'; } if (ch <= 'e') { /* 'e' or 'E' fmt */ --expt; expsize = exponent(expstr, expt, ch); size = expsize + ndig; if (ndig > 1 || flags & ALT) ++size; } else if (ch == 'f') { /* f fmt */ if (expt > 0) { size = expt; if (prec || flags & ALT) size += prec + 1; } else /* "0.X" */ size = prec + 2; } else if (expt >= ndig) { /* fixed g fmt */ size = expt; if (flags & ALT) ++size; } else size = ndig + (expt > 0 ? 1 : 2 - expt); if (softsign) sign = '-'; break; #endif /* FLOATING_POINT */ case 'n': #ifdef _HAVE_SANE_QUAD_ if (flags & QUADINT) *va_arg(ap, quad_t *) = ret; else if (flags & LONGINT) #else /* _HAVE_SANE_QUAD_ */ if (flags & LONGINT) #endif /* _HAVE_SANE_QUAD_ */ *va_arg(ap, long *) = ret; else if (flags & SHORTINT) *va_arg(ap, short *) = ret; else *va_arg(ap, int *) = ret; continue; /* no output */ case 'O': flags |= LONGINT; /*FALLTHROUGH*/ case 'o': #ifdef _HAVE_SANE_QUAD_ if (flags & QUADINT) uqval = va_arg(ap, u_quad_t); else #endif /* _HAVE_SANE_QUAD_ */ ulval = UARG(); base = 8; goto nosign; case 'p': /* * ``The argument shall be a pointer to void. The * value of the pointer is converted to a sequence * of printable characters, in an implementation- * defined manner.'' * -- ANSI X3J11 */ ulval = (u_long)va_arg(ap, void *); base = 16; xdigs = "0123456789abcdef"; #ifdef _HAVE_SANE_QUAD_ flags = (flags & ~QUADINT) | HEXPREFIX; #else /* _HAVE_SANE_QUAD_ */ flags = (flags) | HEXPREFIX; #endif /* _HAVE_SANE_QUAD_ */ ch = 'x'; goto nosign; case 's': if ((cp = va_arg(ap, char *)) == NULL) cp = "(null)"; if (prec >= 0) { /* * can't use strlen; can only look for the * NUL in the first `prec' characters, and * strlen() will go further. */ char *p = (char *)memchr(cp, 0, prec); if (p != NULL) { size = p - cp; if (size > prec) size = prec; } else size = prec; } else size = strlen(cp); sign = '\0'; break; case 'U': flags |= LONGINT; /*FALLTHROUGH*/ case 'u': #ifdef _HAVE_SANE_QUAD_ if (flags & QUADINT) uqval = va_arg(ap, u_quad_t); else #endif /* _HAVE_SANE_QUAD_ */ ulval = UARG(); base = 10; goto nosign; case 'X': xdigs = "0123456789ABCDEF"; goto hex; case 'x': xdigs = "0123456789abcdef"; hex: #ifdef _HAVE_SANE_QUAD_ if (flags & QUADINT) uqval = va_arg(ap, u_quad_t); else #endif /* _HAVE_SANE_QUAD_ */ ulval = UARG(); base = 16; /* leading 0x/X only if non-zero */ if (flags & ALT && #ifdef _HAVE_SANE_QUAD_ (flags & QUADINT ? uqval != 0 : ulval != 0)) #else /* _HAVE_SANE_QUAD_ */ ulval != 0) #endif /* _HAVE_SANE_QUAD_ */ flags |= HEXPREFIX; /* unsigned conversions */ nosign: sign = '\0'; /* * ``... diouXx conversions ... if a precision is * specified, the 0 flag will be ignored.'' * -- ANSI X3J11 */ number: if ((dprec = prec) >= 0) flags &= ~ZEROPAD; /* * ``The result of converting a zero value with an * explicit precision of zero is no characters.'' * -- ANSI X3J11 */ cp = buf + BUF; #ifdef _HAVE_SANE_QUAD_ if (flags & QUADINT) { if (uqval != 0 || prec != 0) cp = __uqtoa(uqval, cp, base, flags & ALT, xdigs); } else { #else /* _HAVE_SANE_QUAD_ */ { #endif /* _HAVE_SANE_QUAD_ */ if (ulval != 0 || prec != 0) cp = BSD__ultoa(ulval, cp, base, flags & ALT, xdigs); } size = buf + BUF - cp; break; default: /* "%?" prints ?, unless ? is NUL */ if (ch == '\0') goto done; /* pretend it was %c with argument ch */ cp = buf; *cp = ch; size = 1; sign = '\0'; break; } /* * All reasonable formats wind up here. At this point, `cp' * points to a string which (if not flags&LADJUST) should be * padded out to `width' places. If flags&ZEROPAD, it should * first be prefixed by any sign or other prefix; otherwise, * it should be blank padded before the prefix is emitted. * After any left-hand padding and prefixing, emit zeroes * required by a decimal [diouxX] precision, then print the * string proper, then emit zeroes required by any leftover * floating precision; finally, if LADJUST, pad with blanks. * * Compute actual size, so we know how much to pad. * fieldsz excludes decimal prec; realsz includes it. */ fieldsz = size; if (sign) fieldsz++; else if (flags & HEXPREFIX) fieldsz += 2; realsz = dprec > fieldsz ? dprec : fieldsz; /* right-adjusting blank padding */ if ((flags & (LADJUST|ZEROPAD)) == 0) PAD(width - realsz, blanks); /* prefix */ if (sign) { PRINT(&sign, 1); } else if (flags & HEXPREFIX) { ox[0] = '0'; ox[1] = ch; PRINT(ox, 2); } /* right-adjusting zero padding */ if ((flags & (LADJUST|ZEROPAD)) == ZEROPAD) PAD(width - realsz, zeroes); /* leading zeroes from decimal precision */ PAD(dprec - fieldsz, zeroes); /* the string or number proper */ #ifdef FLOATING_POINT if ((flags & FPT) == 0) { PRINT(cp, size); } else { /* glue together f_p fragments */ if (ch >= 'f') { /* 'f' or 'g' */ if (_double == 0) { /* kludge for __dtoa irregularity */ if (prec == 0 || (flags & ALT) == 0) { PRINT("0", 1); } else { PRINT("0.", 2); PAD(ndig - 1, zeroes); } } else if (expt <= 0) { PRINT("0.", 2); PAD(-expt, zeroes); PRINT(cp, ndig); } else if (expt >= ndig) { PRINT(cp, ndig); PAD(expt - ndig, zeroes); if (flags & ALT) PRINT(".", 1); } else { PRINT(cp, expt); cp += expt; PRINT(".", 1); PRINT(cp, ndig-expt); } } else { /* 'e' or 'E' */ if (ndig > 1 || flags & ALT) { ox[0] = *cp++; ox[1] = '.'; PRINT(ox, 2); if (_double || flags & ALT == 0) { PRINT(cp, ndig-1); } else /* 0.[0..] */ /* __dtoa irregularity */ PAD(ndig - 1, zeroes); } else /* XeYYY */ PRINT(cp, 1); PRINT(expstr, expsize); } } #else PRINT(cp, size); #endif /* left-adjusting padding (always blank) */ if (flags & LADJUST) PAD(width - realsz, blanks); /* finally, adjust ret */ ret += width > realsz ? width : realsz; FLUSH(); /* copy out the I/O vectors */ } done: FLUSH(); error: return (__sferror(fp) ? EOF : ret); /* NOTREACHED */ } #ifdef FLOATING_POINT extern char *BSD__dtoa __P((double, int, int, int *, int *, char **)); static char * cvt(value, ndigits, flags, sign, decpt, ch, length) double value; int ndigits, flags, *decpt, ch, *length; char *sign; { int mode, dsgn; char *digits, *bp, *rve; if (ch == 'f') mode = 3; else { mode = 2; } if (value < 0) { value = -value; *sign = '-'; } else *sign = '\000'; digits = BSD__dtoa(value, mode, ndigits, decpt, &dsgn, &rve); if (flags & ALT) { /* Print trailing zeros */ bp = digits + ndigits; if (ch == 'f') { if (*digits == '0' && value) *decpt = -ndigits + 1; bp += *decpt; } if (value == 0) /* kludge for __dtoa irregularity */ rve = bp; while (rve < bp) *rve++ = '0'; } *length = rve - digits; return (digits); } static int exponent(p0, exp, fmtch) char *p0; int exp, fmtch; { register char *p, *t; char expbuf[MAXEXP]; p = p0; *p++ = fmtch; if (exp < 0) { exp = -exp; *p++ = '-'; } else *p++ = '+'; t = expbuf + MAXEXP; if (exp > 9) { do { *--t = to_char(exp % 10); } while ((exp /= 10) > 9); *--t = to_char(exp); for (; t < expbuf + MAXEXP; *p++ = *t++); } else { *p++ = '0'; *p++ = to_char(exp); } return (p - p0); } #endif /* FLOATING_POINT */ int vsnprintf(str, n, fmt, ap) char *str; size_t n; const char *fmt; _BSD_VA_LIST_ ap; { int ret; FILE f; if ((int)n < 1) return (EOF); f._flags = __SWR | __SSTR; f._bf._base = f._p = (unsigned char *)str; f._bf._size = f._w = n - 1; ret = BSD_vfprintf(&f, fmt, ap); *f._p = 0; return (ret); } #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)snprintf.c 8.1 (Berkeley) 6/4/93"; #endif /* LIBC_SCCS and not lint */ #include #if defined(__STDC__) # include #else # include #endif int #if defined(__STDC__) snprintf(char *str, size_t n, char const *fmt, ...) #else snprintf(str, n, fmt, va_alist) char *str, *fmt; size_t n; va_dcl #endif { int ret; va_list ap; FILE f; if ((int)n < 1) return (EOF); #if defined(__STDC__) va_start(ap, fmt); #else va_start(ap); #endif f._flags = __SWR | __SSTR; f._bf._base = f._p = (unsigned char *)str; f._bf._size = f._w = n - 1; ret = BSD_vfprintf(&f, fmt, ap); *f._p = 0; va_end(ap); return (ret); } ruby-1.2.3/missing/x68.c100644 774 145 1055 6505430046 13000 0ustar matzNaCl#include "config.h" #if !HAVE_SELECT #include "x68/select.c" #endif #if MISSING__DTOS18 #include "x68/_dtos18.c" #endif #if MISSING_FCONVERT #include "x68/_round.c" #include "x68/fconvert.c" #endif /* missing some basic syscalls */ int link(const char *src, const char *dst) { return symlink(src, dst); } #include #include struct timezone { int tz_minueswest; int tz_dsttime; }; int gettimeofday(struct timeval *tv, struct timezone *tz) { tv->tv_sec = (long)time((time_t*)0); tv->tv_usec = 0; return 0; } ruby-1.2.3/sample/ 40755 774 145 0 6662164572 11735 5ustar matzNaClruby-1.2.3/sample/README100644 774 145 4003 6620244304 12671 0ustar matzNaClREADME this file biorhythm.rb biorhythm calculator cal.rb cal(1) clone cbreak.rb no echo done by ioctl clnt.rb socket client dbmtest.rb test for dbm dir.rb directory access dstore.rb object database on dbm eval.rb simple evaluator export.rb method access example exyacc.rb extrace BNF from yacc file fact.rb factorial calculator fib.awk Fibonacci number (AWK) fib.pl Fibonacci number (Perl) fib.py Fibonacci number (Python) fib.rb Fibonacci number (Ruby) fib.scm Fibonacci number (Scheme) freq.rb count word occurrence from.rb scan mail spool fullpath.rb convert ls -lR to fullpath format getopts.test test fot getopt.rb goodfriday.rb print various christian calendar event. inf-ruby.el program to run ruby under emacs io.rb io test less.rb front end for less list.rb stupid object sample list2.rb stupid object sample list3.rb stupid object sample mine.rb simple mine sweeper mkproto.rb extract protptype from C mpart.rb split file int multi part mrshtest.rb test marshal observ.rb observer design pattern sample occur.pl count word occurrence (Perl) occur.rb count word occurrence (Ruby) occur2.rb count word occurrence - another style philos.rb famous dining philosophers pi.rb calculate PI rbc.rb interactive ruby, to be removed by irb rcs.awk random character stereogram (AWK) rcs.rb random character stereogram (Ruby) rcs.dat data for random character stereogram regx.rb regular expression tester ruby-mode.el ruby mode for emacs rubydb2x.el ruby debugger support for emacs 19.2x or before rubydb3x.el ruby debugger support for emacs 19.3x or later sieve.rb sieve of Eratosthenes svr.rb socket server test.rb test suite used by `make test' time.rb /usr/bin/time clone tkbiff.rb mail notifier using Tk tkbrowse.rb directory browser using Tk tkdialog.rb dialog example tkfrom.rb scan mail spool using Tk tkhello.rb simple Tk example tkline.rb simple Tk example tktimer.rb stopwatch trojan.rb simple tool to find file that may be trojan horse. tsvr.rb socket server using thread uumerge.rb merge files and uudecode them ruby-1.2.3/sample/biorhythm.rb100644 774 145 7472 6457652072 14375 0ustar matzNaCl#!/usr/local/bin/ruby # # biorhythm.rb - # $Release Version: $ # $Revision: 1.1.1.1.4.1 $ # $Date: 1998/01/16 12:36:10 $ # by Yasuo OHBA(STAFS Development Room) # # -- # # # include Math require "date.rb" require "parsearg.rb" def usage() print "Usage:\n" print "biorhythm.rb [options]\n" print " options...\n" print " -D YYYYMMDD(birthday) : すべて default 値を使う. \n" print " --sdate | --date YYYYMMDD : system date もしくは指定した日付を使う.\n" print " --birthday YYYYMMDD : 誕生日の指定をする. \n" print " -v | -g : Values or Graph の指定. \n" print " --days DAYS : 期間の指定をする(Graph の時のみ有効). \n" print " --help : help\n" end $USAGE = 'usage' def printHeader(y, m, d, p, w) print "\n>>> Biorhythm <<<\n" printf "The birthday %04d.%02d.%02d is a %s\n", y, m, d, w printf "Age in days: [%d]\n\n", p end def getPosition(z) pi = 3.14159265 phys = (50.0 * (1.0 + sin((z / 23.0 - (z / 23)) * 360.0 * pi / 180.0))).to_i emot = (50.0 * (1.0 + sin((z / 28.0 - (z / 28)) * 360.0 * pi / 180.0))).to_i geist =(50.0 * (1.0 + sin((z / 33.0 - (z / 33)) * 360.0 * pi / 180.0))).to_i return phys, emot, geist end # # main program # parseArgs(0, nil, "vg", "D:", "sdate", "date:", "birthday:", "days:") if $OPT_D dd = Date.new(Time.now.strftime("%Y%m%d")) bd = Date.new($OPT_D) ausgabeart = "g" else if $OPT_birthday bd = Date.new($OPT_birthday) else printf(STDERR, "Birthday (YYYYMMDD) : ") if (si = STDIN.gets.chop) != "" bd = Date.new(si) end end if !bd printf STDERR, "BAD Input Birthday!!\n" exit() end if $OPT_sdate dd = Date.new(Time.now.strftime("%Y%m%d")) elsif $OPT_date dd = Date.new($OPT_date) else printf(STDERR, "Date [ for Systemdate] (YYYYMMDD) : ") if (si = STDIN.gets.chop) != "" dd = Date.new(si) end end if !dd dd = Date.new(Time.now.strftime("%Y%m%d")) end if $OPT_v ausgabeart = "v" elsif $OPT_g ausgabeart = "g" else printf(STDERR, "Values for today or Graph (v/g) [default g] : ") ausgabeart = STDIN.gets.chop end end if (ausgabeart == "v") printHeader(bd.year, bd.month, bd.day, dd.period - bd.period, bd.name_of_week) print "\n" phys, emot, geist = getPosition(dd.period - bd.period) printf "Biorhythm: %04d.%02d.%02d\n", dd.year, dd.month, dd.day printf "Physical: %d%%\n", phys printf "Emotional: %d%%\n", emot printf "Mental: %d%%\n", geist print "\n" else if $OPT_days display_period = $OPT_days.to_i elsif $OPT_D display_period = 9 else printf(STDERR, "Graph for how many days [default 10] : ") display_period = STDIN.gets.chop if (display_period == "") display_period = 9 else display_period = display_period.to_i - 1 end end printHeader(bd.year, bd.month, bd.day, dd.period - bd.period, bd.name_of_week) print " P=physical, E=emotional, M=mental\n" print " -------------------------+-------------------------\n" print " Bad Condition | Good Condition\n" print " -------------------------+-------------------------\n" for z in (dd.period - bd.period)..(dd.period - bd.period + display_period) phys, emot, geist = getPosition(z) printf "%04d.%02d.%02d : ", dd.year, dd.month, dd.day p = (phys / 2.0 + 0.5).to_i e = (emot / 2.0 + 0.5).to_i g = (geist / 2.0 + 0.5).to_i graph = "." * 51 graph[25] = ?| graph[p] = ?P graph[e] = ?E graph[g] = ?M print graph, "\n" dd = dd + 1 end print " -------------------------+-------------------------\n\n" end ruby-1.2.3/sample/cal.rb100644 774 145 5100 6660755736 13120 0ustar matzNaCl#! /usr/local/bin/ruby # cal.rb (bsd compatible version): Written by Tadayoshi Funaba 1998, 1999 # $Id: bsdcal.rb,v 1.3 1999/02/06 08:52:21 tadf Exp $ require 'date2' $tab = { 'cn' => true, # China 'de' => 2342032, # Germany (protestant states) 'dk' => 2342032, # Denmark 'es' => 2299161, # Spain 'fi' => 2361390, # Finland 'fr' => 2299227, # France 'gb' => 2361222, # United Kingdom 'gr' => 2423868, # Greece 'hu' => 2301004, # Hungary 'it' => 2299161, # Italy 'jp' => true, # Japan 'no' => 2342032, # Norway 'pl' => 2299161, # Poland 'pt' => 2299161, # Portugal 'ru' => 2421639, # Russia 'se' => 2361390, # Sweden 'us' => 2361222, # United States 'os' => false, # (old style) 'ns' => true # (new style) } $cc = 'gb' def usage $stderr.puts 'usage: cal [-c iso3166] [-jy] [[month] year]' exit 1 end def cal(m, y, gs) for d in 1..31 break if jd = Date.exist?(y, m, d, gs) end fst = cur = Date.new(jd, gs) ti = Date::MONTHNAMES[m] ti << ' ' << y.to_s unless $yr mo = ti.center((($w + 1) * 7) - 1) << "\n" mo << ['S', 'M', 'Tu', 'W', 'Th', 'F', 'S']. collect{|x| x.rjust($w)}.join(' ') << "\n" mo << ' ' * (($w + 1) * fst.wday) while cur.mon == fst.mon mo << (if $jd then cur.yday else cur.mday end).to_s.rjust($w) mo << (if (cur += 1).wday != 0 then "\s" else "\n" end) end mo << "\n" * (6 - ((fst.wday + (cur - fst)) / 7)) mo end def zip(xs) yr = '' until xs.empty? ln = (if $jd then l, r, *xs = xs; [l, r] else l, c, r, *xs = xs; [l, c, r] end). collect{|x| x.split(/\n/no, -1)} 8.times do yr << ln.collect{|x| x.shift.ljust((($w + 1) * 7) - 1)}.join(' ') << "\n" end end yr end while /^-([^-].*)$/no =~ $*[0] a = $1 if /^c(.+)?$/no =~ a then if $1 then $cc = $1.downcase elsif $*.length >= 2 then $cc = $*[1].downcase $*.shift else usage end else a.scan(/./no) do |c| case c when 'j'; $jd = true when 'y'; $yr = true else usage end end end $*.shift end $*.shift if /^--/no =~ $*[0] usage if (gs = $tab[$cc]).nil? case $*.length when 0 td = Date.today m = td.mon y = td.year when 1 y = $*[0].to_i $yr = true when 2 m = $*[0].to_i y = $*[1].to_i else usage end usage unless m.nil? or (1..12) === m usage unless y >= -4712 $w = if $jd then 3 else 2 end unless $yr then print cal(m, y, gs) else print y.to_s.center(((($w + 1) * 7) - 1) * (if $jd then 2 else 3 end) + (if $jd then 2 else 4 end)), "\n\n", zip((1..12).collect{|m| cal(m, y, gs)}), "\n" end ruby-1.2.3/sample/cbreak.rb100644 774 145 1064 6457557277 13621 0ustar matzNaCl# 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-1.2.3/sample/clnt.rb100644 774 145 603 6457556236 13302 0ustar matzNaCl# socket example - client side # usage: ruby clnt.rb [host] port require "socket" 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.readline) end s.close ruby-1.2.3/sample/dbmtest.rb100644 774 145 353 6457556236 14006 0ustar matzNaCl# ruby dbm acess require "dbm" d = DBM.open("test") keys = d.keys if keys.length > 0 then for k in keys; print k, "\n"; end for v in d.values; print v, "\n"; end else d['foobar'] = 'FB' d['baz'] = 'BZ' d['quux'] = 'QX' end ruby-1.2.3/sample/dir.rb100644 774 145 252 6457556236 13120 0ustar matzNaCl# directory access # list all files but .*/*~/*.o dirp = Dir.open(".") for f in dirp $_ = f unless (~/^\./ || ~/~$/ || ~/\.o/) print f, "\n" end end dirp.close ruby-1.2.3/sample/eval.rb100644 774 145 1275 6457556236 13317 0ustar matzNaClline = '' indent=0 $stdout.sync = TRUE print "ruby> " while TRUE l = gets unless l break if line == '' else line = line + l if l =~ /,\s*$/ print "ruby| " next end if l =~ /^\s*(class|module|def|if|case|while|for|begin)\b[^_]/ indent += 1 end if l =~ /^\s*end\b[^_]/ indent -= 1 end if l =~ /\{\s*(\|.*\|)?\s*$/ indent += 1 end if l =~ /^\s*\}/ indent -= 1 end if indent > 0 print "ruby| " next end end begin print eval(line).inspect, "\n" rescue $! = 'exception raised' unless $! print "ERR: ", $!, "\n" end break if not l line = '' print "ruby> " end print "\n" ruby-1.2.3/sample/export.rb100644 774 145 643 6457556236 13667 0ustar matzNaCl# method access permission # output: # foobar # Foo class Foo public :printf def baz print "baz\n" end private :baz def quux print "in QUUX " baz() end end def foobar print "foobar\n" end f = Foo.new #Foo.private :printf class Foo # redefines foobar's scope public :foobar end f.foobar f.printf "%s\n", Foo f.quux class Bar0 f *= n n -= 1 end return f end print fact(ARGV[0].to_i), "\n" ruby-1.2.3/sample/fib.awk100644 774 145 163 6457556236 13262 0ustar matzNaCl function fib(n) { if ( n<2 ) return n; else return fib(n-2) + fib(n-1) } BEGIN { print fib(20); } ruby-1.2.3/sample/fib.pl100644 774 145 246 6457556236 13115 0ustar matzNaCl sub fib { local($n)=@_; if( $n<2 ){ return $n; } { return &fib($n-2)+&fib($n-1) } } print &fib(20), "\n"; ruby-1.2.3/sample/fib.py100644 774 145 202 6475467317 13123 0ustar matzNaCl# calculate Fibonacci(20) # for benchmark def fib(n): if n<2: return n else: return fib(n-2)+fib(n-1) print fib(20) ruby-1.2.3/sample/fib.rb100644 774 145 201 6457556236 13074 0ustar matzNaCl# 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-1.2.3/sample/fib.scm100644 774 145 155 6465250125 13246 0ustar matzNaCl(define (fib n) (if (< n 2) n (+ (fib (- n 2)) (fib (- n 1))))) (display (fib 20)) (newline) ruby-1.2.3/sample/freq.rb100644 774 145 354 6533206360 13263 0ustar matzNaCl# word occurrence listing # usege: ruby freq.rb file.. freq = {} while gets while sub!(/\w+/, '') word = $& freq[word] = freq.fetch(word, 0)+1 end end for word in freq.keys.sort printf("%s -- %d\n", word, freq[word]) end ruby-1.2.3/sample/from.rb100755 774 145 3246 6522025477 13325 0ustar matzNaCl#! /usr/local/bin/ruby require "parsedate" require "kconv" require "mailread" include ParseDate include Kconv class String def kconv(code = Kconv::EUC) Kconv.kconv(self, code, Kconv::AUTO) end def kjust(len) len += 1 me = self[0, len].ljust(len) if me =~ /.$/ and $&.size == 2 me[-2, 2] = ' ' end me.chop! end end if ARGV[0] == '-w' wait = TRUE ARGV.shift end if ARGV.length == 0 file = ENV['MAIL'] user = ENV['USER'] || ENV['USERNAME'] || ENV['LOGNAME'] else file = user = ARGV[0] ARGV.clear end if file == nil or !File.exist? file [ENV['SPOOLDIR'], '/usr/spool', '/var/spool', '/usr', '/var'].each do |m| if File.exist? f = "#{m}/mail/#{user}" file = f break end end end $outcount = 0; def fromout(date, from, subj) return if !date y = m = d = 0 y, m, d = parsedate(date) if date if from from.gsub! /\n/, "" else from = "sombody@somewhere" end if subj subj.gsub! /\n/, "" else subj = "(nil)" end if ENV['LANG'] =~ /sjis/i lang = Kconv::SJIS else lang = Kconv::EUC end from = from.kconv(lang).kjust(28) subj = subj.kconv(lang).kjust(40) printf "%02d/%02d/%02d [%s] %s\n",y%100,m,d,from,subj $outcount += 1 end if File.exist?(file) atime = File.atime(file) mtime = File.mtime(file) f = open(file, "r") begin until f.eof? mail = Mail.new(f) fromout mail.header['Date'],mail.header['From'],mail.header['Subject'] end ensure f.close File.utime(atime, mtime, file) end end if $outcount == 0 print "You have no mail.\n" sleep 2 if wait elsif wait system "stty cbreak -echo" getc() system "stty cooked echo" end ruby-1.2.3/sample/fullpath.rb100644 774 145 517 6457556236 14165 0ustar matzNaCl#! /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-1.2.3/sample/getopts.test100755 774 145 1231 6457556236 14424 0ustar matzNaCl#! /usr/local/bin/ruby load("parsearg.rb") def usage() printf "Usage:\n" printf "%s -d [-x x] [-y y] [--geometry geom] [--version] [string ...]\n", $0 end $USAGE = 'usage' parseArgs(0, "d&(x|y)", "dfg", "x:", "y:", "geometry:800x600", "version") if ($OPT_d) if $OPT_version printf "version 1.0\n" end 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 if $OPT_f printf "f = TRUE\n" end if $OPT_g printf "g = TRUE\n" end end while (ARGV.length != 0) print "other = ", ARGV[0], "\n" ARGV.shift end ruby-1.2.3/sample/goodfriday.rb100644 774 145 2374 6501437064 14503 0ustar matzNaCl#! /usr/local/bin/ruby # goodfriday.rb: Written by Tadayoshi Funaba 1998 # $Id: goodfriday.rb,v 1.1 1998/03/08 09:44:44 tadf Exp $ require 'date2' def easter(y) g = (y % 19) + 1 c = (y / 100) + 1 x = (3 * c / 4) - 12 z = ((8 * c + 5) / 25) - 5 d = (5 * y / 4) - x - 10 e = (11 * g + 20 + z - x) % 30 e += 1 if e == 25 and g > 11 or e == 24 n = 44 - e n += 30 if n < 21 n = n + 7 - ((d + n) % 7) if n <= 31 then [y, 3, n] else [y, 4, n - 31] end end es = Date.new3(*easter(Time.now.year)) [[-9*7, 'Septuagesima Sunday'], [-8*7, 'Sexagesima Sunday'], [-7*7, 'Quinquagesima Sunday (Shrove Sunday)'], [-48, 'Shrove Monday'], [-47, 'Shrove Tuesday'], [-46, 'Ash Wednesday'], [-6*7, 'Quadragesima Sunday'], [-3*7, 'Mothering Sunday'], [-2*7, 'Passion Sunday'], [-7, 'Palm Sunday'], [-3, 'Maunday Thursday'], [-2, 'Good Friday'], [-1, 'Easter Eve'], [0, 'Easter Day'], [1, 'Easter Monday'], [7, 'Low Sunday'], [5*7, 'Rogation Sunday'], [39, 'Ascension Day (Holy Thursday)'], [42, 'Sunday after Ascension Day'], [7*7, 'Pentecost (Whitsunday)'], [50, 'Whitmonday'], [8*7, 'Trinity Sunday'], [60, 'Corpus Christi (Thursday after Trinity)']]. each do |xs| puts ((es + xs.shift).to_s + ' ' + xs.shift) end ruby-1.2.3/sample/inf-ruby.el100644 774 145 25136 6530474014 14123 0ustar matzNaCl(J;;;(B (J-*-Emacs-Lisp-*-(B ;;; ;;; $Id: inf-ruby.el,v 1.4 1998/05/20 02:45:58 senda Exp $ ;;; $Author: senda $ ;;; $Date: 1998/05/20 02:45:58 $ ;;; ;;; Inferior Ruby Mode - ruby process in a buffer. ;;; adapted from cmuscheme.el ;;; ;;; Usage: ;;; ;;; (0) check ruby-program-name variable that can run your environment. ;;; ;;; (1) modify .emacs to use ruby-mode ;;; for example : ;;; ;;; (autoload 'ruby-mode "ruby-mode" ;;; "Mode for editing ruby source files") ;;; (setq auto-mode-alist ;;; (append '(("\\.rb$" . ruby-mode)) auto-mode-alist)) ;;; (setq interpreter-mode-alist (append '(("^#!.*ruby" . ruby-mode)) ;;; interpreter-mode-alist)) ;;; ;;; (2) set to road inf-ruby and set inf-ruby key definition in ruby-mode. ;;; ;;; (autoload 'run-ruby "inf-ruby" ;;; "Run an inferior Ruby process") ;;; (autoload 'inf-ruby-keys "inf-ruby" ;;; "Set local key defs for inf-ruby in ruby-mode") ;;; (add-hook 'ruby-mode-hook ;;; '(lambda () ;;; (inf-ruby-keys) ;;; )) ;;; ;;; HISTORY ;;; senda - 8 Apr 1998: Created. ;;; $Log: inf-ruby.el,v $ ;;; Revision 1.4 1998/05/20 02:45:58 senda ;;; default program to irb ;;; ;;; Revision 1.3 1998/04/10 04:11:30 senda ;;; modification by Matsumoto san (1.1b9_09) ;;; remove-in-string defined ;;; global variable : ;;; inferior-ruby-first-prompt-pattern ;;; inferior-ruby-prompt-pattern ;;; defined ;;; ;;; Revision 1.2 1998/04/09 07:53:42 senda ;;; remove M-C-x in inferior-ruby-mode ;;; ;;; Revision 1.1 1998/04/09 07:28:36 senda ;;; Initial revision ;;; ;;; (require 'comint) (require 'ruby-mode) ;; ;; you may change these variables ;; ;(defvar ruby-program-name "rbc --noreadline" ; "*Program invoked by the run-ruby command") ; ;(defvar inferior-ruby-first-prompt-pattern "^rbc0> *" ; "first prompt regex pattern of ruby interpreter.") ; ;(defvar inferior-ruby-prompt-pattern "^\\(rbc.[>*\"'] *\\)+" ; "prompt regex pattern of ruby interpreter.") ;;;; for irb (defvar ruby-program-name "irb --inf-ruby-mode" "*Program invoked by the run-ruby command") (defvar inferior-ruby-first-prompt-pattern "^irb(.*)[0-9:]+0> *" "first prompt regex pattern of ruby interpreter.") (defvar inferior-ruby-prompt-pattern "^\\(irb(.*)[0-9:]+[>*\"'] *\\)+" "prompt regex pattern of ruby interpreter.") ;; ;; mode variables ;; (defvar inferior-ruby-mode-hook nil "*Hook for customising inferior-ruby mode.") (defvar inferior-ruby-mode-map nil "*Mode map for inferior-ruby-mode") (cond ((not inferior-ruby-mode-map) (setq inferior-ruby-mode-map (copy-keymap comint-mode-map)) ; (define-key inferior-ruby-mode-map "\M-\C-x" ;gnu convention ; 'ruby-send-definition) ; (define-key inferior-ruby-mode-map "\C-x\C-e" 'ruby-send-last-sexp) (define-key inferior-ruby-mode-map "\C-c\C-l" 'ruby-load-file) )) (defun inf-ruby-keys () "Set local key defs for inf-ruby in ruby-mode" (define-key ruby-mode-map "\M-\C-x" 'ruby-send-definition) ; (define-key ruby-mode-map "\C-x\C-e" 'ruby-send-last-sexp) (define-key ruby-mode-map "\C-c\C-e" 'ruby-send-definition) (define-key ruby-mode-map "\C-c\M-e" 'ruby-send-definition-and-go) (define-key ruby-mode-map "\C-c\C-r" 'ruby-send-region) (define-key ruby-mode-map "\C-c\M-r" 'ruby-send-region-and-go) (define-key ruby-mode-map "\C-c\C-z" 'switch-to-ruby) (define-key ruby-mode-map "\C-c\C-l" 'ruby-load-file) (define-key ruby-mode-map "\C-c\C-s" 'run-ruby) ) (defvar ruby-buffer nil "current ruby (actually irb) process buffer.") (defun inferior-ruby-mode () "Major mode for interacting with an inferior ruby (irb) process. The following commands are available: \\{inferior-ruby-mode-map} A ruby process can be fired up with M-x run-ruby. Customisation: Entry to this mode runs the hooks on comint-mode-hook and inferior-ruby-mode-hook (in that order). You can send text to the inferior ruby process from other buffers containing Ruby source. switch-to-ruby switches the current buffer to the ruby process buffer. ruby-send-definition sends the current definition to the ruby process. ruby-send-region sends the current region to the ruby process. ruby-send-definition-and-go, ruby-send-region-and-go, switch to the ruby process buffer after sending their text. For information on running multiple processes in multiple buffers, see documentation for variable ruby-buffer. Commands: Return after the end of the process' output sends the text from the end of process to point. Return before the end of the process' output copies the sexp ending at point to the end of the process' output, and sends it. Delete converts tabs to spaces as it moves back. Tab indents for ruby; with argument, shifts rest of expression rigidly with the current line. C-M-q does Tab on each line starting within following expression. Paragraphs are separated only by blank lines. # start comments. If you accidentally suspend your process, use \\[comint-continue-subjob] to continue it." (interactive) (comint-mode) ;; Customise in inferior-ruby-mode-hook ;(setq comint-prompt-regexp "^[^>\n]*>+ *") (setq comint-prompt-regexp inferior-ruby-prompt-pattern) ;;(scheme-mode-variables) (ruby-mode-variables) (setq major-mode 'inferior-ruby-mode) (setq mode-name "Inferior Ruby") (setq mode-line-process '(":%s")) (use-local-map inferior-ruby-mode-map) (setq comint-input-filter (function ruby-input-filter)) (setq comint-get-old-input (function ruby-get-old-input)) (run-hooks 'inferior-ruby-mode-hook)) (defvar inferior-ruby-filter-regexp "\\`\\s *\\S ?\\S ?\\s *\\'" "*Input matching this regexp are not saved on the history list. Defaults to a regexp ignoring all inputs of 0, 1, or 2 letters.") (defun ruby-input-filter (str) "Don't save anything matching inferior-ruby-filter-regexp" (not (string-match inferior-ruby-filter-regexp str))) ;; adapted from replace-in-string in XEmacs (subr.el) (defun remove-in-string (str regexp) "Remove all matches in STR for REGEXP and returns the new string." (let ((rtn-str "") (start 0) match prev-start) (while (setq match (string-match regexp str start)) (setq prev-start start start (match-end 0) rtn-str (concat rtn-str (substring str prev-start match)))) (concat rtn-str (substring str start)))) (defun ruby-get-old-input () "Snarf the sexp ending at point" (save-excursion (let ((end (point))) (re-search-backward inferior-ruby-first-prompt-pattern) (remove-in-string (buffer-substring (point) end) inferior-ruby-prompt-pattern) ))) (defun ruby-args-to-list (string) (let ((where (string-match "[ \t]" string))) (cond ((null where) (list string)) ((not (= where 0)) (cons (substring string 0 where) (ruby-args-to-list (substring string (+ 1 where) (length string))))) (t (let ((pos (string-match "[^ \t]" string))) (if (null pos) nil (ruby-args-to-list (substring string pos (length string))))))))) (defun run-ruby (cmd) "Run an inferior Ruby process, input and output via buffer *ruby*. If there is a process already running in `*ruby*', switch to that buffer. With argument, allows you to edit the command line (default is value of `ruby-program-name'). Runs the hooks `inferior-ruby-mode-hook' \(after the `comint-mode-hook' is run). \(Type \\[describe-mode] in the process buffer for a list of commands.)" (interactive (list (if current-prefix-arg (read-string "Run Ruby: " ruby-program-name) ruby-program-name))) (if (not (comint-check-proc "*ruby*")) (let ((cmdlist (ruby-args-to-list cmd))) (set-buffer (apply 'make-comint "ruby" (car cmdlist) nil (cdr cmdlist))) (inferior-ruby-mode))) (setq ruby-program-name cmd) (setq ruby-buffer "*ruby*") (pop-to-buffer "*ruby*")) (defun ruby-send-region (start end) "Send the current region to the inferior Ruby process." (interactive "r") (comint-send-region (ruby-proc) start end) (comint-send-string (ruby-proc) "\n")) (defun ruby-send-definition () "Send the current definition to the inferior Ruby process." (interactive) (save-excursion (ruby-end-of-defun) (let ((end (point))) (ruby-beginning-of-defun) (ruby-send-region (point) end)))) ;(defun ruby-send-last-sexp () ; "Send the previous sexp to the inferior Ruby process." ; (interactive) ; (ruby-send-region (save-excursion (backward-sexp) (point)) (point))) (defun switch-to-ruby (eob-p) "Switch to the ruby process buffer. With argument, positions cursor at end of buffer." (interactive "P") (if (get-buffer ruby-buffer) (pop-to-buffer ruby-buffer) (error "No current process buffer. See variable ruby-buffer.")) (cond (eob-p (push-mark) (goto-char (point-max))))) (defun ruby-send-region-and-go (start end) "Send the current region to the inferior Ruby process. Then switch to the process buffer." (interactive "r") (ruby-send-region start end) (switch-to-ruby t)) (defun ruby-send-definition-and-go () "Send the current definition to the inferior Ruby. Then switch to the process buffer." (interactive) (ruby-send-definition) (switch-to-ruby t)) (defvar ruby-source-modes '(ruby-mode) "*Used to determine if a buffer contains Ruby source code. If it's loaded into a buffer that is in one of these major modes, it's considered a ruby source file by ruby-load-file. Used by these commands to determine defaults.") (defvar ruby-prev-l/c-dir/file nil "Caches the last (directory . file) pair. Caches the last pair used in the last ruby-load-file command. Used for determining the default in the next one.") (defun ruby-load-file (file-name) "Load a Ruby file into the inferior Ruby process." (interactive (comint-get-source "Load Ruby file: " ruby-prev-l/c-dir/file ruby-source-modes t)) ; T because LOAD ; needs an exact name (comint-check-source file-name) ; Check to see if buffer needs saved. (setq ruby-prev-l/c-dir/file (cons (file-name-directory file-name) (file-name-nondirectory file-name))) (comint-send-string (ruby-proc) (concat "(load \"" file-name "\"\)\n"))) (defun ruby-proc () "Returns the current ruby process. See variable ruby-buffer." (let ((proc (get-buffer-process (if (eq major-mode 'inferior-ruby-mode) (current-buffer) ruby-buffer)))) (or proc (error "No current process. See variable ruby-buffer")))) ;;; Do the user's customisation... (defvar inf-ruby-load-hook nil "This hook is run when inf-ruby is loaded in. This is a good place to put keybindings.") (run-hooks 'inf-ruby-load-hook) (provide 'inf-ruby) ;;; inf-ruby.el ends here ruby-1.2.3/sample/less.rb100755 774 145 636 6457556236 13321 0ustar matzNaCl#! /usr/local/bin/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-1.2.3/sample/list.rb100644 774 145 2537 6457556236 13345 0ustar matzNaCl# Linked list example class MyElem # オブジェクト生成時に自動的に呼ばれるメソッド def initialize(item) # @変数はインスタンス変数(宣言は要らない) @data = item @succ = nil end def data @data end def succ @succ end # 「obj.data = val」としたときに暗黙に呼ばれるメソッド def succ=(new) @succ = new end end class MyList def add_to_list(obj) elt = MyElem.new(obj) if @head @tail.succ = elt else @head = elt end @tail = elt end def each elt = @head while elt yield elt elt = elt.succ end end # オブジェクトを文字列に変換するメソッド # これを再定義するとprintでの表現が変わる def to_s str = " 0 && y > 0 then open(x-1,y-1) end if y > 0 then open(x, y-1) end if x < @wi-1 && y > 0 then open(x+1,y-1) end if x > 0 then open(x-1,y) end if x < @wi-1 then open(x+1,y) end if x > 0 && y < @hi-1 then open(x-1,y+1) end if y < @hi -1 then open(x,y+1) end if x < @wi -1 && y < @hi -1 then open(x+1,y+1) end move end def count(x,y) fetch(x-1,y-1)+fetch(x,y-1)+fetch(x+1,y-1)+ fetch(x-1, y)+fetch(x+1,y)+ fetch(x-1,y+1)+fetch(x,y+1)+fetch(x+1,y+1) end def fetch(x,y) if x < 0 then 0 elsif x >= @wi then 0 elsif y < 0 then 0 elsif y >= @hi then 0 else @data[x*@wi+y] end end def over(e) 0.upto(@hi-1){ |y| print pos(0,y) 0.upto(@wi-1){ |x| st=@state[y*@wi+x] if (@cx==x) &&( @cy==y) && e==1 then print "@@" elsif st != "MARK" then if fetch(x,y)==1 then m= "$B!|(B" else m= @num[count(x,y)] end print clrstr(45,m) else if fetch(x,y)==1 then m= "$B!|(B" else m= @num[count(x,y)] end print clrstr(43,m) end } } if e==1 then print pos(0,@hi),"*** OVER ***" else print pos(0,@hi),"*** YOU WIN !! ***" end end def down if @cy < @hi-1 then @cy=@cy+1; move end end def up if @cy > 0 then @cy=@cy-1; move end end def left if @cx > 0 then @cx=@cx-1; move end end def right if @cx < @wi-1 then @cx=@cx+1; move end end def move print pos(0,@hi),"$B;D$j(B:",@mc,"/",@total," " print pos(@cx,@cy) end def quit print pos(0,@hi) end def remain @mc+@total end end bd=Board.new(10,10,10) system("stty raw -echo") while (c=getc) != ?q case c when ?n # new game bd.reset when ?m # mark bd.mark when ?j bd.down when ?k bd.up when ?h bd.left when ?l bd.right when ?\s if bd.open == 1 then bd.over(1) if (c=getc) == ?q then break end bd.reset end end if bd.remain==0 then bd.over(0) if (c=getc) == ?q then break end bd.reset end end bd.quit system("stty -raw echo") print "\n" ruby-1.2.3/sample/mkproto.rb100644 774 145 1072 6620243322 14033 0ustar matzNaCl$/ = nil while gets() if /^((void|VALUE|int|char *\*|ID|struct [\w_]+ *\*|st_table *\*) *)?\n([\w\d_]+)\(.*\)\n\s*((.+;\n)*)\{/ $_ = $' printf "%s %s(", $2, $3 args = [] for arg in $4.split(/;\n\s*/) arg.gsub! ' +', ' ' if arg =~ /,/ if arg =~ /(([^*]+) *\** *[\w\d_]+),/ type = $2.strip args.push $1.strip arg = $' else type = "" end while arg.sub!(/(\** *[\w\d_]+)(,|$)/, "") args.push type + " " + $1.strip end else args.push arg.strip end end printf "%s);\n", args.join(', ') redo end end ruby-1.2.3/sample/mpart.rb100755 774 145 1345 6457556236 13514 0ustar matzNaCl#! ./ruby # split into multi part # usage: mpart.rb [-nnn] file.. lines = 1000 if (ARGV[0] =~ /^-(\d+)$/ ) lines = $1.to_i; ARGV.shift; end basename = ARGV[0] extname = "part" part = 1 line = 0 fline = 0 for i in ifp = open(basename) fline = fline + 1 end ifp.close parts = fline / lines + 1 for i in ifp = open(basename) if line == 0 ofp = open(sprintf("%s.%s%02d", basename, extname, part), "w") printf(ofp, "%s part%02d/%02d\n", basename, part, parts) ofp.write("BEGIN--cut here--cut here\n") end ofp.write(i) line = line + 1 if line >= 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-1.2.3/sample/mrshtest.rb100644 774 145 375 6457556236 14221 0ustar matzNaClrequire "marshal" include Marshal a = 25.6; pt = Struct.new('Point', :x,:y); x = pt.new(10, 10) y = pt.new(20, 20) rt = Struct.new('Rectangle', :origin,:corner); z = rt.new(x, y) c = Object.new s = [a, x, z, c, c, "fff"]; p s d = dump(s); p d p load(d) ruby-1.2.3/sample/observ.rb100644 774 145 726 6536640500 13632 0ustar matzNaCl#! /usr/local/bin/ruby require "thread" require "observer" class Tick include Observable def initialize Thread.start do loop do sleep 0.999 now = Time.now changed notify_observers(now.hour, now.min, now.sec) end end end end class Clock def initialize(tick) @tick = tick @tick.add_observer(self) end def update(h, m, s) printf "\e[8D%02d:%02d:%02d", h, m, s STDOUT.flush end end clock = Clock.new(Tick.new) sleep ruby-1.2.3/sample/occur.pl100644 774 145 166 6457556236 13471 0ustar matzNaClwhile (<>) { for (split(/\W+/)) { $freq{$_}++; } } for (sort keys %freq) { print "$_ -- $freq{$_}\n"; } ruby-1.2.3/sample/occur.rb100644 774 145 323 6457556236 13454 0ustar matzNaCl# 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-1.2.3/sample/occur2.rb100644 774 145 425 6457556236 13541 0ustar matzNaCl# word occurrence listing # usege: ruby occur2.rb file.. freq = {} while gets() for word in $_.split(/\W+/) begin freq[word] = freq[word] + 1 rescue freq[word] = 1 end end end for word in freq.keys.sort printf("%s -- %d\n", word, freq[word]) end ruby-1.2.3/sample/philos.rb100644 774 145 1370 6457556236 13662 0ustar matzNaCl# # The Dining Philosophers - thread example # require "thread" srand #srand N=9 # number of philosophers $forks = [] for i in 0..N-1 $forks[i] = Mutex.new end $state = "-o"*N def wait sleep rand(20)/10.0 end def think(n) wait end def eat(n) wait end def philosopher(n) while TRUE think n $forks[n].lock if not $forks[(n+1)%N].try_lock $forks[n].unlock # avoid deadlock next end $state[n*2] = ?|; $state[(n+1)%N*2] = ?|; $state[n*2+1] = ?*; print $state, "\n" eat(n) $state[n*2] = ?-; $state[(n+1)%N*2] = ?-; $state[n*2+1] = ?o; print $state, "\n" $forks[n].unlock $forks[(n+1)%N].unlock end end for i in 0..N-1 Thread.start{philosopher(i)} sleep 0.1 end sleep ruby-1.2.3/sample/pi.rb100644 774 145 506 6457556237 12755 0ustar matzNaCl#!/usr/local/bin/ruby k, a, b, a1, b1 = 2, 4, 1, 12, 4 while TRUE # Next approximation p, q, k = k*k, 2*k+1, k+1 a, b, a1, b1 = a1, b1, p*a+q*a1, p*b+q*b1 # Print common digits d = a / b d1 = a1 / b1 while d == d1 print d $stdout.flush a, a1 = 10*(a%b), 10*(a1%b1) d, d1 = a/b, a1/b1 end end ruby-1.2.3/sample/rbc.rb100644 774 145 51430 6564731263 13146 0ustar matzNaCl#!/usr/local/bin/ruby # # rbc.rb - # $Release Version: 0.8 $ # $Revision: 1.8 $ # $Date: 1998/03/11 05:43:00 $ # by Keiju ISHITSUKA(Nippon Rational Inc.) # # -- # Usage: # # rbc.rb [options] file_name opts # options: # -d debug mode (not recommended) # -f does not read ~/.irbrc # -m bc mode (rational/matrix calc) # -r load-module same as `ruby -r' # --inspect use inspect for result output # (default for non-bc mode) # --noinspect does not use inspect for result output # --noreadline does not use readline library # (default: try to use readline) # # additional private method (as function): # exit, quit terminate the interpreter # inspect_mode(sw = nil) toggle inspect mode # trace_load(sw = nil) change trace mode for file loading using # load/require. (default: trace-mode on) # require "e2mmap.rb" $stdout.sync = TRUE module BC_APPLICATION__ RCS_ID='-$Id: rbc.rb,v 1.8 1998/03/11 05:43:00 keiju Exp keiju $-' extend Exception2MessageMapper def_exception :UnrecognizedSwitch, "Unrecognized switch: %s" CONFIG = {} CONFIG[0] = $0 CONFIG[:USE_READLINE] = TRUE CONFIG[:LOAD_MODULES] = [] CONFIG[:INSPECT] = nil CONFIG[:TRACE_LOAD] = FALSE CONFIG[:RC] = TRUE CONFIG[:DEBUG] = FALSE while opt = ARGV.shift case opt when "-d" CONFIG[:DEBUG] = TRUE when "-m" CONFIG[:INSPECT] = FALSE if CONFIG[:INSPECT].nil? require "mathn.rb" include Math when "-r" opt = ARGV.shift CONFIG[:LOAD_MODULES].push opt if opt when "-f" opt = ARGV.shift CONFIG[:RC] = FALSE when "--inspect" CONFIG[:INSPECT] = TRUE when "--noinspect" CONFIG[:INSPECT] = FALSE when "--noreadline" CONFIG[:USE_READLINE] = FALSE when /^-/ # print UnrecognizedSwitch.inspect, "\n" BC_APPLICATION__.fail UnrecognizedSwitch, opt else CONFIG[:USE_READLINE] = FALSE $0 = opt break end end CONFIG[:INSPECT] = TRUE if CONFIG[:INSPECT].nil? PROMPTi = "rbc%d> " PROMPTs = "rbc%d%s " PROMPTe = "rbc%d* " class BC def initialize lex_init end def eval_input(io, cont, bind) line = '' @io = io @ltype = nil @quoted = nil @indent = 0 @lex_state = EXPR_BEG @io.prompt = format(PROMPTi, @indent) loop do @continue = FALSE l = @io.gets unless l break if line == '' else line = line + l lex(l) if l != "\n" print @quoted.inspect, "\n" if CONFIG[:DEBUG] if @ltype @io.prompt = format(PROMPTs, @indent, @ltype) next elsif @continue @io.prompt = format(PROMPTe, @indent) next elsif @indent > 0 @io.prompt = format(PROMPTi, @indent) next end end if line != "\n" begin if CONFIG[:INSPECT] print((cont._=eval(line, bind)).inspect, "\n") else print((cont._=eval(line, bind)), "\n") end rescue # $! = 'exception raised' unless $! # print "ERR: ", $!, "\n" $! = RuntimeError.new("exception raised") unless $! print $!.type, ": ", $!, "\n" end end break if not l line = '' indent = 0 @io.prompt = format(PROMPTi, indent) end print "\n" end EXPR_BEG = :EXPR_BEG EXPR_MID = :EXPR_MID EXPR_END = :EXPR_END EXPR_ARG = :EXPR_ARG EXPR_FNAME = :EXPR_FNAME CLAUSE_STATE_TRANS = { "alias" => EXPR_FNAME, "and" => EXPR_BEG, "begin" => EXPR_BEG, "case" => EXPR_BEG, "class" => EXPR_BEG, "def" => EXPR_FNAME, "defined?" => EXPR_END, "do" => EXPR_BEG, "else" => EXPR_BEG, "elsif" => EXPR_BEG, "end" => EXPR_END, "ensure" => EXPR_BEG, "for" => EXPR_BEG, "if" => EXPR_BEG, "in" => EXPR_BEG, "module" => EXPR_BEG, "nil" => EXPR_END, "not" => EXPR_BEG, "or" => EXPR_BEG, "rescue" => EXPR_MID, "return" => EXPR_MID, "self" => EXPR_END, "super" => EXPR_END, "then" => EXPR_BEG, "undef" => EXPR_FNAME, "unless" => EXPR_BEG, "until" => EXPR_BEG, "when" => EXPR_BEG, "while" => EXPR_BEG, "yield" => EXPR_END } ENINDENT_CLAUSE = [ "case", "class", "def", "do", "for", "if", "module", "unless", "until", "while", "begin" #, "when" ] DEINDENT_CLAUSE = ["end" #, "when" ] PARCENT_LTYPE = { "q" => "\'", "Q" => "\"", "x" => "\`", "r" => "\/" } PARCENT_PAREN = { "{" => "}", "[" => "]", "<" => ">", "(" => ")" } def lex_init() @OP = Trie.new @OP.def_rules("\0", "\004", "\032"){} @OP.def_rules(" ", "\t", "\f", "\r", "\13") do @space_seen = TRUE next end @OP.def_rule("#") do |op, rests| @ltype = "#" identify_comment(rests) end @OP.def_rule("\n") do print "\\n\n" if CONFIG[:DEBUG] if @lex_state == EXPR_BEG || @lex_state == EXPR_FNAME @continue = TRUE else @lex_state = EXPR_BEG end end @OP.def_rules("*", "*=", "**=", "**") {@lex_state = EXPR_BEG} @OP.def_rules("!", "!=", "!~") {@lex_state = EXPR_BEG} @OP.def_rules("=", "==", "===", "=~", "<=>") {@lex_state = EXPR_BEG} @OP.def_rules("<", "<=", "<<") {@lex_state = EXPR_BEG} @OP.def_rules(">", ">=", ">>") {@lex_state = EXPR_BEG} @OP.def_rules("'", '"') do |op, rests| @ltype = op @quoted = op identify_string(rests) end @OP.def_rules("`") do |op, rests| if @lex_state != EXPR_FNAME @ltype = op @quoted = op identify_string(rests) end end @OP.def_rules('?') do |op, rests| @lex_state = EXPR_END identify_question(rests) end @OP.def_rules("&", "&&", "&=", "|", "||", "|=") do @lex_state = EXPR_BEG end @OP.def_rule("+@", proc{@lex_state == EXPR_FNAME}) {} @OP.def_rule("-@", proc{@lex_state == EXPR_FNAME}) {} @OP.def_rules("+=", "-=") {@lex_state = EXPR_BEG} @OP.def_rules("+", "-") do |op, rests| if @lex_state == EXPR_ARG if @space_seen and rests[0] =~ /[0-9]/ identify_number(rests) else @lex_state = EXPR_BEG end elsif @lex_state != EXPR_END and rests[0] =~ /[0-9]/ identify_number(rests) else @lex_state = EXPR_BEG end end @OP.def_rule(".") do |op, rests| @lex_state = EXPR_BEG if rests[0] =~ /[0-9]/ rests.unshift op identify_number(rests) else # obj.if などの対応 identify_identifier(rests, TRUE) @lex_state = EXPR_ARG end end @OP.def_rules("..", "...") {@lex_state = EXPR_BEG} lex_int2 end def lex_int2 @OP.def_rules("]", "}", ")") do @lex_state = EXPR_END @indent -= 1 end @OP.def_rule(":") {|op,rests| identify_identifier(rests, TRUE) } @OP.def_rule("::") {|op,rests| identify_identifier(rests, TRUE); } @OP.def_rule("/") do |op, rests| if @lex_state == EXPR_BEG || @lex_state == EXPR_MID @ltype = op @quoted = op identify_string(rests) elsif rests[0] == '=' rests.shift @lex_state = EXPR_BEG elsif @lex_state == EXPR_ARG and @space_seen and rests[0] =~ /\s/ @ltype = op @quoted = op identify_string(rests) else @lex_state = EXPR_BEG end end @OP.def_rules("^", "^=") {@lex_state = EXPR_BEG} @OP.def_rules(",", ";") {@lex_state = EXPR_BEG} @OP.def_rule("~") {@lex_state = EXPR_BEG} @OP.def_rule("~@", proc{@lex_state = EXPR_FNAME}) {} @OP.def_rule("(") do @lex_state = EXPR_BEG @indent += 1 end @OP.def_rule("[]", proc{@lex_state == EXPR_FNAME}) {} @OP.def_rule("[]=", proc{@lex_state == EXPR_FNAME}) {} @OP.def_rule("[") do @indent += 1 if @lex_state != EXPR_FNAME @lex_state = EXPR_BEG end end @OP.def_rule("{") do @lex_state = EXPR_BEG @indent += 1 end @OP.def_rule('\\') {|op, rests| identify_escape(rests)} #') @OP.def_rule('%') do |op, rests| if @lex_state == EXPR_BEG || @lex_state == EXPR_MID identify_quotation(rests) elsif rests[0] == '=' rests.shift elsif @lex_state == EXPR_ARG and @space_seen and rests[0] =~ /\s/ identify_quotation(rests) else @lex_state = EXPR_BEG end end @OP.def_rule('$') do |op, rests| identify_gvar(rests) end @OP.def_rule('@') do |op, rests| if rests[0] =~ /[\w_]/ rests.unshift op identify_identifier(rests) end end @OP.def_rule("def", proc{|op, chrs| /\s/ =~ chrs[0]}) do |op, rests| @indent += 1 @lex_state = EXPR_END until rests[0] == "\n" or rests[0] == ";" rests.shift end end @OP.def_rule("") do |op, rests| printf "MATCH: start %s: %s\n", op, rests.inspect if CONFIG[:DEBUG] if rests[0] =~ /[0-9]/ identify_number(rests) elsif rests[0] =~ /[\w_]/ identify_identifier(rests) end printf "MATCH: end %s: %s\n", op, rests.inspect if CONFIG[:DEBUG] end p @OP if CONFIG[:DEBUG] end def lex(l) chrs = l.split(//) tokens = [] case @ltype when "'", '"', '`', '/' identify_string(chrs) return if chrs.empty? when "#" identify_comment(chrs) return when "=" if l =~ /^=end/ $ltype = nil return end else if l =~ /^=begin/ $ltype = "=" return end end until chrs.empty? @space_seen = FALSE printf "perse: %s\n", chrs.join("") if CONFIG[:DEBUG] @OP.match(chrs) printf "lex_state: %s continue: %s\n", @lex_state.id2name, @continue if CONFIG[:DEBUG] end end def identify_gvar(chrs) @lex_state = EXPR_END ch = chrs.shift case ch when /[_~*$?!@/\\;,.=:<>"]/ #" return when "-" ch = chrs.shift return when "&", "`", "'", "+" return when /[1-9]/ chrs.unshift ch v = "$" while (ch = chrs.shift) =~ /[0-9]/ end chrs.unshift ch return when /\w/ chrs.unshift ch chrs.unshift "$" identify_identifier(chrs) return else chrs.unshift ch return end end def identify_identifier(chrs, escaped = FALSE) token = "" token.concat chrs.shift if chrs[0] =~ /[$@]/ or escaped while (ch = chrs.shift) =~ /\w|_/ print ":", ch, ":" if CONFIG[:DEBUG] token.concat ch end chrs.unshift ch if ch == "!" or ch == "?" chrs.shift token.concat ch end # fix token if token =~ /^[$@]/ or escaped @lex_state = EXPR_END return end print token, "\n" if CONFIG[:DEBUG] if state = CLAUSE_STATE_TRANS[token] if @lex_state != EXPR_BEG and token =~ /^(if|unless|while|until)/ # 修飾子 else if ENINDENT_CLAUSE.include?(token) @indent += 1 elsif DEINDENT_CLAUSE.include?(token) @indent -= 1 end end @lex_state = state return end if @lex_state == EXPR_FNAME @lex_state = EXPR_END if chrs[0] == '=' chrs.shift end elsif @lex_state == EXPR_BEG @lex_state = EXPR_ARG else @lex_state = EXPR_END end end def identify_quotation(chrs) ch = chrs.shift if lt = PARCENT_LTYPE[ch] ch = chrs.shift else lt = "\"" end if ch !~ /\W/ chrs.unshift ch next end @ltype = lt unless @quoted = PARCENT_PAREN[ch] @quoted = ch end identify_string(chrs) end def identify_number(chrs) @lex_state = EXPR_END ch = chrs.shift case ch when /0/ if (ch = chrs[0]) == "x" chrs.shift match = /[0-9a-f_]/ else match = /[0-7_]/ end while ch = chrs.shift if ch !~ match chrs.unshift ch break end end return end while ch = chrs.shift case ch when /[0-9]/ when "e", "E" # type = FLOAT unless (ch = chrs.shift) == "+" or ch == "-" chrs.unshift ch end when "." # type = FLOAT when "_" else chrs.unshift ch return end end end def identify_question(chrs) @lex_state = EXPR_END if chrs.shift == "\\" #" identify_escape(chrs) end end def identify_string(chrs) while ch = chrs.shift if @quoted == ch if @ltype == "/" if chrs[0] =~ /i|o|n|e|s/ chrs.shift end end @ltype = nil @quoted = nil @lex_state = EXPR_END break elsif ch == '\\' #' identify_escape(chrs) end end end def identify_comment(chrs) while ch = chrs.shift if ch == "\\" #" identify_escape(chrs) end if ch == "\n" @ltype = nil chrs.unshift ch break end end end def identify_escape(chrs) ch = chrs.shift case ch when "\n", "\r", "\f" @continue = TRUE when "\\", "n", "t", "r", "f", "v", "a", "e", "b" #" when /[0-7]/ chrs.unshift ch 3.times do ch = chrs.shift case ch when /[0-7]/ when nil break else chrs.unshift ch break end end when "x" 2.times do ch = chrs.shift case ch when /[0-9a-fA-F]/ when nil break else chrs.unshift ch break end end when "M" if (ch = chrs.shift) != '-' chrs.unshift ch elsif (ch = chrs.shift) == "\\" #" identify_escape(chrs) end return when "C", "c", "^" if ch == "C" and (ch = chrs.shift) != "-" chrs.unshift ch elsif (ch = chrs.shift) == "\\" #" identify_escape(chrs) end return end end end class Trie extend Exception2MessageMapper def_exception :ErrNodeNothing, "node nothing" def_exception :ErrNodeAlreadyExists, "node already exists" class Node # postprocがなければ抽象ノード, nilじゃなければ具象ノード def initialize(preproc = nil, postproc = nil) @Tree = {} @preproc = preproc @postproc = postproc end attr :preproc, TRUE attr :postproc, TRUE def search(chrs, opt = nil) return self if chrs.empty? ch = chrs.shift if node = @Tree[ch] node.search(chrs, opt) else if opt chrs.unshift ch self.create_subnode(chrs) else Trie.fail ErrNodeNothing end end end def create_subnode(chrs, preproc = nil, postproc = nil) if chrs.empty? if @postproc p node Trie.fail ErrNodeAlreadyExists else print "Warn: change abstruct node to real node\n" if CONFIG[:DEBUG] @preproc = preproc @postproc = postproc end return self end ch = chrs.shift if node = @Tree[ch] if chrs.empty? if node.postproc p node Trie.fail ErrNodeAlreadyExists else print "Warn: change abstruct node to real node\n" if CONFIG[:DEBUG] node.preproc = preproc node.postproc = postproc end else node.create_subnode(chrs, preproc, postproc) end else if chrs.empty? node = Node.new(preproc, postproc) else node = Node.new node.create_subnode(chrs, preproc, postproc) end @Tree[ch] = node end node end def match(chrs, op = "") print "match>: ", chrs, "op:", op, "\n" if CONFIG[:DEBUG] if chrs.empty? if @preproc.nil? || @preproc.call(op, chrs) printf "op1: %s\n", op if CONFIG[:DEBUG] @postproc.call(op, chrs) "" else nil end else ch = chrs.shift if node = @Tree[ch] if ret = node.match(chrs, op+ch) return ch+ret else chrs.unshift ch if @postproc and @preproc.nil? || @preproc.call(op, chrs) printf "op2: %s\n", op.inspect if CONFIG[:DEBUG] @postproc.call(op, chrs) return "" else return nil end end else chrs.unshift ch if @postproc and @preproc.nil? || @preproc.call(op, chrs) printf "op3: %s\n", op if CONFIG[:DEBUG] @postproc.call(op, chrs) return "" else return nil end end end end end def initialize @head = Node.new("") end def def_rule(token, preproc = nil, postproc = nil) # print node.inspect, "\n" if CONFIG[:DEBUG] postproc = proc if iterator? node = create(token, preproc, postproc) end def def_rules(*tokens) if iterator? p = proc end for token in tokens def_rule(token, nil, p) end end def preporc(token, proc) node = search(token) node.preproc=proc end def postproc(token) node = search(token, proc) node.postproc=proc end def search(token) @head.search(token.split(//)) end def create(token, preproc = nil, postproc = nil) @head.create_subnode(token.split(//), preproc, postproc) end def match(token) token = token.split(//) if token.kind_of?(String) ret = @head.match(token) printf "match end: %s:%s", ret, token.inspect if CONFIG[:DEBUG] ret end def inspect format("", @head.inspect) end end if /^-tt(.*)$/ =~ ARGV[0] # Tracer.on case $1 when "1" tr = Trie.new print "0: ", tr.inspect, "\n" tr.def_rule("=") {print "=\n"} print "1: ", tr.inspect, "\n" tr.def_rule("==") {print "==\n"} print "2: ", tr.inspect, "\n" print "case 1:\n" print tr.match("="), "\n" print "case 2:\n" print tr.match("=="), "\n" print "case 3:\n" print tr.match("=>"), "\n" when "2" tr = Trie.new print "0: ", tr.inspect, "\n" tr.def_rule("=") {print "=\n"} print "1: ", tr.inspect, "\n" tr.def_rule("==", proc{FALSE}) {print "==\n"} print "2: ", tr.inspect, "\n" print "case 1:\n" print tr.match("="), "\n" print "case 2:\n" print tr.match("=="), "\n" print "case 3:\n" print tr.match("=>"), "\n" end exit end module CONTEXT def _=(value) CONFIG[:_] = value eval "_=BC_APPLICATION__::CONFIG[:_]", CONFIG[:BIND] end # def _ # eval "_", CONFIG[:BIND] # end def quit exit end def trace_load(opt = nil) if !opt.nil? CONFIG[:TRACE_LOAD] = opt else CONFIG[:TRACE_LOAD] = !CONFIG[:TRACE_LOAD] end print "Switch to load/require #{unless CONFIG[:TRACE_LOAD]; ' non';end} trace mode.\n" if CONFIG[:TRACE_LOAD] eval %{ class << self alias load rbc_load alias require rbc_require end } else eval %{ class << self alias load rbc_load_org alias require rbc_require_org end } end CONFIG[:TRACE_LOAD] end alias rbc_load_org load def rbc_load(file_name) return true if load_sub(file_name) raise LoadError, "No such file to load -- #{file_name}" end alias rbc_require_org require def rbc_require(file_name) rex = Regexp.new("#{Regexp.quote(file_name)}(\.o|\.rb)?") return false if $".find{|f| f =~ rex} case file_name when /\.rb$/ if load_sub(file_name) $".push file_name return true end when /\.(so|o|sl)$/ rbc_require_org(file_name) end if load_sub(f = file_name + ".rb") $".push f return true end rbc_require_org(file_name) end def load_sub(fn) if fn =~ /^#{Regexp.quote(File::Separator)}/ return false unless File.exist?(fn) BC.new.eval_input FileInputMethod.new(fn), self, CONFIG[:BIND] return true end for path in $: if File.exist?(f = File.join(path, fn)) BC.new.eval_input FileInputMethod.new(f), self, CONFIG[:BIND] return true end end return false end def inspect_mode(opt = nil) if opt CONFIG[:INSPECT] = opt else CONFIG[:INSPECT] = !CONFIG[:INSPECT] end print "Switch to#{unless CONFIG[:INSPECT]; ' non';end} inspect mode.\n" CONFIG[:INSPECT] end def run(bind) CONFIG[:BIND] = bind if CONFIG[:RC] rc = File.expand_path("~/.irbrc") if File.exists?(rc) begin load rc rescue print "load error: #{rc}\n" print $!.type, ": ", $!, "\n" for err in $@[0, $@.size - 2] print "\t", err, "\n" end end end end if CONFIG[:TRACE_LOAD] trace_load true end for m in CONFIG[:LOAD_MODULES] begin require m rescue print $@[0], ":", $!.type, ": ", $!, "\n" end end if !$0.equal?(CONFIG[0]) io = FileInputMethod.new($0) elsif defined? Readline io = ReadlineInputMethod.new else io = StdioInputMethod.new end BC.new.eval_input io, self, CONFIG[:BIND] end end class InputMethod attr :prompt, TRUE def gets end public :gets end class StdioInputMethod < InputMethod def gets print @prompt $stdin.gets end end class FileInputMethod < InputMethod def initialize(file) @io = open(file) end def gets l = @io.gets print @prompt, l l end end if CONFIG[:USE_READLINE] begin require "readline" print "use readline module\n" class ReadlineInputMethod < InputMethod include Readline def gets if l = readline(@prompt, TRUE) l + "\n" else l end end end rescue CONFIG[:USE_READLINE] = FALSE end end end extend BC_APPLICATION__::CONTEXT run(binding) ruby-1.2.3/sample/rcs.awk100644 774 145 1176 6457556237 13337 0ustar matzNaClBEGIN { sw = 40.0; dw = 78.0; hdw = dw / 2.0; w = 20.0; h =1.0; d = 0.2; ss="abcdefghijklmnopqrstuvwxyz0123456789!#$%^&*()-=\\[];'`,./"; rnd = srand(); } { xr = -hdw; y = h * 1.0; maxxl = -999; s = ""; while (xr < hdw) { x = xr * (1 + y) - y * w / 2; i = (x / (1 + h) + sw /2); c = (0 < i && i < length($0)) ? substr($0, i, 1) : "0"; y = h - d * c; xl = xr - w * y / (1 + y); if (xl < -hdw || xl >= hdw || xl <= maxxl) { t = rand() * length(ss); c = substr(ss, t, 1); } else { c = substr(s, xl + hdw, 1); maxxl = xl; } s = s c; xr = xr + 1; } print s; } ruby-1.2.3/sample/rcs.dat100644 774 145 1123 6457556237 13315 0ustar matzNaCl0000000000000000220000000000000000 0000000000000111221110000000000000 0000000000111112222111110000000000 0000000111111112222111111110000000 0000111111111122222211111111110000 0111111111111222222221111111111110 2222222222222222222222222222222222 1122222222222222222222222222222211 0111122222222222222222222222211110 0011111122222222222222222211111100 0001111111222222222222221111111000 0000111112222222222222222111110000 0000011122222222112222222211100000 0000001122222221111222222211000000 0000000122221111111111222210000000 0000000221111111111111111220000000 0000000000000000000000000000000000 ruby-1.2.3/sample/rcs.rb100644 774 145 1502 6457556237 13151 0ustar matzNaCl# random dot steraogram # usage: rcs.rb rcs.dat sw = 40.0 # p^[ dw = 78.0 # Random Character Streogram hdw = dw / 2.0 w = 20.0 # h =1.0 # d = 0.2 # P ss="abcdefghijklmnopqrstuvwxyz0123456789#!$%^&*()-=\\[];'`,./" rnd = srand() while gets() # print($_) xr = -hdw; y = h * 1.0; maxxl = -999 s = ""; while xr < hdw x = xr * (1 + y) - y * w / 2 i = (x / (1 + h) + sw / 2) if (1 < i && i < $_.length); c = $_[i, 1].to_i else c = 0 end y = h - d * c xl = xr - w * y / (1 + y); if xl < -hdw || xl >= hdw || xl <= maxxl tt = rand(ss.length) c = ss[tt, 1] else c = s[xl + hdw, 1] maxxl = xl end s += c xr += 1 end print(s, "\n") end ruby-1.2.3/sample/regx.rb100644 774 145 500 6457556237 13304 0ustar matzNaClst = "\033[7m" en = "\033[m" #st = "<<" #en = ">>" while TRUE print "str> " STDOUT.flush input = gets break if not input if input != "" str = input str.chop! end print "pat> " STDOUT.flush re = gets break if not re re.chop! str.gsub! re, "#{st}\\&#{en}" print str, "\n" end print "\n" ruby-1.2.3/sample/ruby-mode.el100644 774 145 50351 6646521211 14270 0ustar matzNaCl;;; ;;; ruby-mode.el - ;;; ;;; $Author: matz $ ;;; $Date: 1999/01/12 01:16:57 $ ;;; created at: Fri Feb 4 14:49:13 JST 1994 ;;; (defconst ruby-mode-revision "$Revision: 1.1.1.2.2.24 $") (defconst ruby-mode-version (progn (string-match "[0-9.]+" ruby-mode-revision) (substring ruby-mode-revision (match-beginning 0) (match-end 0)))) (defconst ruby-block-beg-re "class\\|module\\|def\\|if\\|unless\\|case\\|while\\|until\\|for\\|begin\\|do" ) (defconst ruby-indent-beg-re "\\(\\s *\\(class\\|module\\|def\\)\\)\\|if\\|unless\\|case\\|while\\|until\\|for\\|begin" ) (defconst ruby-modifier-re "if\\|unless\\|while\\|until" ) (defconst ruby-block-mid-re "then\\|else\\|elsif\\|when\\|rescue\\|ensure" ) (defconst ruby-block-op-re "and\\|or\\|not" ) (defconst ruby-block-end-re "end") (defconst ruby-delimiter (concat "[?$/%(){}#\"'`.:]\\|\\[\\|\\]\\|\\<\\(" ruby-block-beg-re "\\|" ruby-block-end-re "\\)\\>\\|^=begin") ) (defconst ruby-negative (concat "^[ \t]*\\(\\(" ruby-block-mid-re "\\)\\>\\|\\(" ruby-block-end-re "\\)\\>\\|\\}\\|\\]\\)") ) (defconst ruby-operator-chars ",.+*/%-&|^~=<>:") (defconst ruby-operator-re (concat "[" ruby-operator-chars "]")) (defconst ruby-symbol-chars "a-zA-Z0-9_") (defconst ruby-symbol-re (concat "[" ruby-symbol-chars "]")) (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 "{" 'ruby-electric-brace) (define-key ruby-mode-map "}" 'ruby-electric-brace) (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 "\e\C-b" 'ruby-beginning-of-block) (define-key ruby-mode-map "\e\C-f" 'ruby-end-of-block) (define-key ruby-mode-map "\e\C-p" 'ruby-beginning-of-block) (define-key ruby-mode-map "\e\C-n" 'ruby-end-of-block) (define-key ruby-mode-map "\e\C-h" 'ruby-mark-defun) (define-key ruby-mode-map "\t" 'ruby-indent-command) (define-key ruby-mode-map "\C-c\C-e" 'ruby-insert-end) (define-key ruby-mode-map "\C-j" 'ruby-reindent-then-newline-and-indent) (define-key ruby-mode-map "\C-m" '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 ?\` "\"" ruby-mode-syntax-table) (modify-syntax-entry ?# "<" ruby-mode-syntax-table) (modify-syntax-entry ?\n ">" 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) (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-variables () (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 "\\(^\\|\\s-\\);?#+ *") (make-local-variable 'parse-sexp-ignore-comments) (setq parse-sexp-ignore-comments t) (make-local-variable 'paragraph-start) (setq paragraph-start (concat "$\\|" page-delimiter)) (make-local-variable 'paragraph-separate) (setq paragraph-separate paragraph-start) (make-local-variable 'paragraph-ignore-fill-prefix) (setq paragraph-ignore-fill-prefix t)) (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) (ruby-mode-variables) (run-hooks 'ruby-mode-hook)) (defun ruby-current-indentation () (save-excursion (beginning-of-line) (back-to-indentation) (current-column))) (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) (if x (let (shift top beg) (and (< x 0) (error "invalid nest")) (setq shift (current-column)) (beginning-of-line) (setq beg (point)) (back-to-indentation) (setq top (current-column)) (skip-chars-backward " \t") (cond ((>= x shift) (setq shift 0)) ((>= shift top) (setq shift (- shift top))) (t (setq shift 0))) (if (and (bolp) (= x top)) (move-to-column (+ x shift)) (move-to-column top) (delete-region beg (point)) (beginning-of-line) (indent-to x) (move-to-column (+ x shift)))))) (defun ruby-expr-beg (&optional modifier pnt) (save-excursion (if (looking-at "\\?") (progn (or (bolp) (forward-char -1)) (not (looking-at "\\sw"))) (store-match-data nil) (skip-chars-backward " \t") (or (bolp) (forward-char -1)) (or (bolp) (looking-at ruby-operator-re) (looking-at "[\\[({]") (and (not modifier) (looking-at "[!?]")) (and (looking-at ruby-symbol-re) (forward-word -1) (if (and (not modifier) (bolp)) t (if (or (looking-at ruby-block-beg-re) (looking-at ruby-block-op-re) (looking-at ruby-block-mid-re)) (progn (goto-char (match-end 0)) (looking-at "\\>"))))))))) (defun ruby-parse-region (start end) (let ((indent-point end) (indent 0) (in-string nil) (in-paren nil) (depth 0) (nest nil) (pcol nil)) (save-excursion (if start (goto-char start) (ruby-beginning-of-indent)) (save-restriction (narrow-to-region (point) end) (while (and (> indent-point (point)) (re-search-forward ruby-delimiter indent-point t)) (let ((pnt (point)) w) (goto-char (match-beginning 0)) (cond ((or (looking-at "\"") ;skip string (looking-at "'") (looking-at "`")) (setq w (char-after (point))) (cond ((and (not (eobp)) (re-search-forward (format "[^\\]\\(\\\\\\\\\\)*%c" w) indent-point t)) nil) (t (setq in-string (point)) (goto-char indent-point)))) ((looking-at "/") (cond ((and (not (eobp)) (ruby-expr-beg)) (if (re-search-forward "[^\\]/" indent-point t) nil (setq in-string (point)) (goto-char indent-point))) (t (goto-char pnt)))) ((looking-at "%") (cond ((and (not (eobp)) (ruby-expr-beg) (looking-at "%[Qqrxw]?\\(.\\)")) (setq w (buffer-substring (match-beginning 1) (match-end 1))) (cond ((string= w "[") (setq w "]")) ((string= w "{") (setq w "}")) ((string= w "(") (setq w ")")) ((string= w "<") (setq w ">"))) (goto-char (match-end 0)) (if (search-forward w indent-point t) nil (setq in-string (point)) (goto-char indent-point))) (t (goto-char pnt)))) ((looking-at "\\?") ;skip ?char (cond ((ruby-expr-beg) (looking-at "?\\(\\\\C-\\|\\\\M-\\)*.") (goto-char (match-end 0))) (t (goto-char pnt)))) ((looking-at "\\$") ;skip $char (goto-char pnt) (forward-char 1)) ((looking-at "#") ;skip comment (forward-line 1) (goto-char (point)) ) ((looking-at "(") (setq nest (cons (cons (char-after (point)) pnt) nest)) (setq pcol (cons (cons pnt depth) pcol)) (setq depth 0) (goto-char pnt) ) ((looking-at "[\\[{]") (setq nest (cons (cons (char-after (point)) pnt) nest)) (setq depth (1+ depth)) (goto-char pnt) ) ((looking-at ")") (setq nest (cdr nest)) (setq depth (cdr (car pcol))) (setq pcol (cdr pcol)) (goto-char pnt)) ((looking-at "[])}]") (setq nest (cdr nest)) (setq depth (1- depth)) (goto-char pnt)) ((looking-at ruby-block-end-re) (if (or (and (not (bolp)) (progn (forward-char -1) (eq ?_ (char-after (point))))) (progn (goto-char pnt) (setq w (char-after (point))) (or (eq ?_ w) (eq ?! w) (eq ?? w)))) nil (setq nest (cdr nest)) (setq depth (1- depth))) (goto-char pnt)) ((looking-at "def\\s +[^(\n;]*") (if (or (bolp) (progn (forward-char -1) (not (eq ?_ (char-after (point)))))) (progn (setq nest (cons (cons nil pnt) nest)) (setq depth (1+ depth)))) (goto-char (match-end 0))) ((looking-at ruby-block-beg-re) (and (or (bolp) (progn (forward-char -1) (not (eq ?_ (char-after (point)))))) (goto-char pnt) (setq w (char-after (point))) (not (eq ?_ w)) (not (eq ?! w)) (not (eq ?? w)) (skip-chars-forward " \t") (if (not (eolp)) (progn (goto-char (match-beginning 0)) (if (looking-at ruby-modifier-re) (ruby-expr-beg t) t)) t) (goto-char pnt) (setq nest (cons (cons nil pnt) nest)) (setq depth (1+ depth))) (goto-char pnt)) ((looking-at ":\\([a-zA-Z_][a-zA-Z_0-9]*\\)?") (goto-char (match-end 0))) ((or (looking-at "\\.") (looking-at "\\.\\.\\.?") (looking-at "\\.[0-9]+") (looking-at "\\.[a-zA-Z_0-9]+")) (goto-char (match-end 0))) ((looking-at "^=begin") (if (re-search-forward "^=end" indent-point t) (forward-line 1) (setq in-string (match-end 0)) (goto-char indent-point))) (t (error (format "bad string %s" (buffer-substring (point) pnt) ))))))) (list in-string (car nest) depth (car (car pcol)))))) (defun ruby-indent-size (pos nest) (+ pos (* (if nest nest 1) ruby-indent-level))) (defun ruby-calculate-indent (&optional parse-start) (save-excursion (beginning-of-line) (let ((indent-point (point)) (case-fold-search nil) state bol eol (indent 0)) (if parse-start (goto-char parse-start) (ruby-beginning-of-indent) (setq parse-start (point))) (back-to-indentation) (setq indent (current-column)) (setq state (ruby-parse-region parse-start indent-point)) (cond ((nth 0 state) ; within string (setq indent nil)) ; do nothing ((car (nth 1 state)) ; in paren (goto-char (cdr (nth 1 state))) (if (eq (car (nth 1 state)) ?\( ) (let ((column (current-column)) (s (ruby-parse-region (point) indent-point))) (cond ((and (nth 2 s) (> (nth 2 s) 0)) (goto-char (cdr (nth 1 s))) (forward-word -1) (setq indent (ruby-indent-size (current-column) (nth 2 state)))) (t (setq indent (current-column))))) (cond ((nth 3 state) (goto-char (nth 3 state)) (setq indent (ruby-indent-size (current-column) (nth 2 state)))) (t (goto-char parse-start) (back-to-indentation) (setq indent (ruby-indent-size (current-column) (nth 2 state))))) )) ((and (nth 2 state)(> (nth 2 state) 0)) ; in nest (if (null (cdr (nth 1 state))) (error "invalid nest")) (goto-char (cdr (nth 1 state))) (forward-word -1) ; skip back a keyword (cond ((looking-at "do") ; iter block is a special case (cond ((nth 3 state) (goto-char (nth 3 state)) (setq indent (ruby-indent-size (current-column) (nth 2 state)))) (t (goto-char parse-start) (back-to-indentation) (setq indent (ruby-indent-size (current-column) (nth 2 state)))))) (t (setq indent (+ (current-column) ruby-indent-level))))) ((and (nth 2 state) (< (nth 2 state) 0)) ; in negative nest (setq indent (ruby-indent-size (current-column) (nth 2 state))))) (cond (indent (goto-char indent-point) (end-of-line) (setq eol (point)) (beginning-of-line) (cond ((re-search-forward ruby-negative eol t) (and (not (eq ?_ (char-after (match-end 0)))) (setq indent (- indent ruby-indent-level)))) ;;operator terminated lines ((and (save-excursion (beginning-of-line) (not (bobp))) (or (null (car (nth 1 state))) ;not in parens (and (eq (car (nth 1 state)) ?\{) (save-excursion ;except non-block braces (goto-char (cdr (nth 1 state))) (or (bobp) (forward-char -1)) (not (ruby-expr-beg)))))) ;; goto beginning of non-empty no-comment line (let (end done) (while (not done) (skip-chars-backward " \t\n") (setq end (point)) (beginning-of-line) (if (re-search-forward "^\\s *#" end t) (beginning-of-line) (setq done t)))) (setq bol (point)) (end-of-line) (skip-chars-backward " \t") (and (re-search-backward "#" (save-excursion (beginning-of-line) (point)) t) (setq state (ruby-parse-region parse-start (point))) (nth 0 state) (goto-char (nth 0 state))) (or (bobp) (forward-char -1)) (and (or (and (looking-at ruby-symbol-re) (skip-chars-backward ruby-symbol-chars) (looking-at ruby-block-op-re) (save-excursion (goto-char (match-end 0)) (not (looking-at "[a-z_]")))) (and (looking-at ruby-operator-re) (or (not (eq ?/ (char-after (point)))) (null (nth 0 (ruby-parse-region parse-start (point))))) (not (eq (char-after (1- (point))) ?$)) (or (not (eq ?| (char-after (point)))) (save-excursion (or (eolp) (forward-char -1)) (and (search-backward "|") (skip-chars-backward " \t\n") (and (not (eolp)) (progn (forward-char -1) (not (looking-at "\\{"))) (progn (forward-word -1) (not (looking-at "do\\>[^_]"))))))))) (setq indent (+ indent ruby-indent-level))))))) indent))) (defun ruby-electric-brace (arg) (interactive "P") (self-insert-command (prefix-numeric-value arg)) (ruby-indent-line t)) (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-beginning-of-indent () (and (re-search-backward (concat "^\\(" ruby-indent-beg-re "\\)\\b") nil 'move) (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-move-to-block (n) (let (start pos done down) (setq start (ruby-calculate-indent)) (if (eobp) nil (while (and (not (bobp)) (not done)) (forward-line n) (cond ((looking-at "^$")) ((looking-at "^\\s *#")) (t (setq pos (current-indentation)) (cond ((< start pos) (setq down t)) ((and down (= pos start)) (setq done t)) ((> start pos) (setq done t))))) (if done (progn (back-to-indentation) (if (looking-at ruby-block-mid-re) (setq done nil))))))) (back-to-indentation)) (defun ruby-beginning-of-block () "Move backward to next beginning-of-block" (interactive) (ruby-move-to-block -1)) (defun ruby-end-of-block () "Move forward to next beginning-of-block" (interactive) (ruby-move-to-block 1)) (defun ruby-reindent-then-newline-and-indent () (interactive "*") (save-excursion (delete-region (point) (progn (skip-chars-backward " \t") (point)))) (newline) (save-excursion (forward-line -1) (indent-according-to-mode)) (indent-according-to-mode)) (fset 'ruby-encomment-region (symbol-function 'comment-region)) (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) (save-excursion (ruby-indent-line))))) (defun ruby-insert-end () (interactive) (insert "end") (ruby-indent-line t) (end-of-line)) (defun ruby-mark-defun () "Put mark at end of this Ruby function, point at beginning." (interactive) (push-mark (point)) (ruby-end-of-defun) (push-mark (point) nil t) (ruby-beginning-of-defun) (re-search-backward "^\n" (- (point) 1) t)) (cond ((featurep 'hilit19) (hilit-set-mode-patterns 'ruby-mode '(("[^$\\?]\\(\"[^\\\"]*\\(\\\\\\(.\\|\n\\)[^\\\"]*\\)*\"\\)" 1 string) ("[^$\\?]\\('[^\\']*\\(\\\\\\(.\\|\n\\)[^\\']*\\)*'\\)" 1 string) ("[^$\\?]\\(`[^\\`]*\\(\\\\\\(.\\|\n\\)[^\\`]*\\)*`\\)" 1 string) ("^\\s *#.*$" nil comment) ("[^$@?\\]\\(#[^$@{\n].*$\\)" 1 comment) ("[^a-zA-Z_]\\(\\?\\(\\\\[CM]-\\)*.\\)" 1 string) ("^\\s *\\(require\\|load\\).*$" nil include) ("^\\s *\\(include\\|alias\\|undef\\).*$" nil decl) ("^\\s *\\<\\(class\\|def\\|module\\)\\>" "[)\n;]" defun) ("[^_]\\<\\(begin\\|case\\|else\\|elsif\\|end\\|ensure\\|for\\|if\\|unless\\|rescue\\|then\\|when\\|while\\|until\\|do\\)\\>[^_]" 1 defun) ("[^_]\\<\\(and\\|break\\|next\\|raise\\|fail\\|in\\|not\\|or\\|redo\\|retry\\|return\\|super\\|yield\\|self\\|nil\\)\\>[^_]" 1 keyword) ("\\$\\(.\\|\\sw+\\)" nil type) ("[$@].[a-zA-Z_0-9]*" nil struct) ("^__END__" nil label)))) ((featurep 'font-lock) (or (boundp 'font-lock-variable-name-face) (setq font-lock-variable-name-face font-lock-type-face)) (defvar ruby-font-lock-keywords (list (cons (concat "\\(^\\|[^_:.]\\|\\.\\.\\)\\b\\(" (mapconcat 'identity '("alias" "and" "begin" "break" "case" "class" "def" "do" "elsif" "else" "fail" "ensure" "for" "end" "if" "in" "module" "next" "not" "or" "raise" "redo" "rescue" "retry" "return" "then" "self" "super" "unless" "undef" "until" "when" "while" ) "\\|") "\\)\\b") 2) ;; variables '("\\b\\(nil\\|self\\|true\\|false\\)\\b" 1 font-lock-variable-name-face) ;; variables '("[$@].[a-zA-Z0-9_]*" 0 font-lock-variable-name-face) ;; constants '("\\(^\\|[^_]\\)\\b\\([A-Z]+[a-zA-Z0-9_]*\\)" 2 font-lock-type-face) ;; functions '("^\\s *def\\s *\\<\\(\\(\\w\\|\\s_\\)+\\.\\)?\\(\\(\\w\\|\\s_\\)+\\)\\>" 3 font-lock-function-name-face t)) "*Additional expressions to highlight in ruby mode.") (if (and (>= (string-to-int emacs-version) 19) (not (featurep 'xemacs))) (add-hook 'ruby-mode-hook (lambda () (make-local-variable 'font-lock-defaults) (setq font-lock-defaults '((ruby-font-lock-keywords) nil nil ((?\_ . "w")))))) (add-hook 'ruby-mode-hook (lambda () (setq font-lock-keywords ruby-font-lock-keywords)))))) (provide 'ruby-mode) ruby-1.2.3/sample/rubydb2x.el100644 774 145 10601 6457556237 14140 0ustar matzNaCl(require 'gud) (provide 'rubydb) ;; ====================================================================== ;; rubydb functions ;;; History of argument lists passed to rubydb. (defvar gud-rubydb-history nil) (defun gud-rubydb-massage-args (file args) (cons "-I" (cons "." (cons "-r" (cons "debug" (cons file args)))))) ;; There's no guarantee that Emacs will hand the filter the entire ;; marker at once; it could be broken up across several strings. We ;; might even receive a big chunk with several markers in it. If we ;; receive a chunk of text which looks like it might contain the ;; beginning of a marker, we save it here between calls to the ;; filter. (defvar gud-rubydb-marker-acc "") (defun gud-rubydb-marker-filter (string) (save-match-data (setq gud-marker-acc (concat gud-marker-acc string)) (let ((output "")) ;; Process all the complete markers in this chunk. (while (string-match "\032\032\\([^:\n]*\\):\\([0-9]*\\):.*\n" gud-marker-acc) (setq ;; Extract the frame position from the marker. gud-last-frame (cons (substring gud-marker-acc (match-beginning 1) (match-end 1)) (string-to-int (substring gud-marker-acc (match-beginning 2) (match-end 2)))) ;; Append any text before the marker to the output we're going ;; to return - we don't include the marker in this text. output (concat output (substring gud-marker-acc 0 (match-beginning 0))) ;; Set the accumulator to the remaining text. gud-marker-acc (substring gud-marker-acc (match-end 0)))) ;; Does the remaining text look like it might end with the ;; beginning of another marker? If it does, then keep it in ;; gud-marker-acc until we receive the rest of it. Since we ;; know the full marker regexp above failed, it's pretty simple to ;; test for marker starts. (if (string-match "\032.*\\'" gud-marker-acc) (progn ;; Everything before the potential marker start can be output. (setq output (concat output (substring gud-marker-acc 0 (match-beginning 0)))) ;; Everything after, we save, to combine with later input. (setq gud-marker-acc (substring gud-marker-acc (match-beginning 0)))) (setq output (concat output gud-marker-acc) gud-marker-acc "")) output))) (defun gud-rubydb-find-file (f) (find-file-noselect f)) (defvar rubydb-command-name "ruby" "File name for executing ruby.") ;;;###autoload (defun rubydb (command-line) "Run rubydb on program FILE in buffer *gud-FILE*. The directory containing FILE becomes the initial working directory and source-file directory for your debugger." (interactive (list (read-from-minibuffer "Run rubydb (like this): " (if (consp gud-rubydb-history) (car gud-rubydb-history) (concat rubydb-command-name " ")) nil nil '(gud-rubydb-history . 1)))) (gud-overload-functions '((gud-massage-args . gud-rubydb-massage-args) (gud-marker-filter . gud-rubydb-marker-filter) (gud-find-file . gud-rubydb-find-file) )) (gud-common-init command-line) (gud-def gud-break "b %l" "\C-b" "Set breakpoint at current line.") ; (gud-def gud-remove "clear %l" "\C-d" "Remove breakpoint at current line") (gud-def gud-step "s" "\C-s" "Step one source line with display.") (gud-def gud-next "n" "\C-n" "Step one line (skip functions).") (gud-def gud-cont "c" "\C-r" "Continue with display.") (gud-def gud-finish "finish" "\C-f" "Finish executing current function.") (gud-def gud-up "up %p" "<" "Up N stack frames (numeric arg).") (gud-def gud-down "down %p" ">" "Down N stack frames (numeric arg).") (gud-def gud-print "p %e" "\C-p" "Evaluate ruby expression at point.") (setq comint-prompt-regexp "^(rdb:-) ") (setq paragraph-start comint-prompt-regexp) (run-hooks 'rubydb-mode-hook) ) ruby-1.2.3/sample/rubydb3x.el100644 774 145 7500 6457556237 14125 0ustar matzNaCl(require 'gud) (provide 'rubydb) ;; ====================================================================== ;; rubydb functions ;;; History of argument lists passed to rubydb. (defvar gud-rubydb-history nil) (defun gud-rubydb-massage-args (file args) (cons "-r" (cons "debug" args))) ;; There's no guarantee that Emacs will hand the filter the entire ;; marker at once; it could be broken up across several strings. We ;; might even receive a big chunk with several markers in it. If we ;; receive a chunk of text which looks like it might contain the ;; beginning of a marker, we save it here between calls to the ;; filter. (defvar gud-rubydb-marker-acc "") (defun gud-rubydb-marker-filter (string) (setq gud-marker-acc (concat gud-marker-acc string)) (let ((output "")) ;; Process all the complete markers in this chunk. (while (string-match "\032\032\\([^:\n]*\\):\\([0-9]*\\):.*\n" gud-marker-acc) (setq ;; Extract the frame position from the marker. gud-last-frame (cons (substring gud-marker-acc (match-beginning 1) (match-end 1)) (string-to-int (substring gud-marker-acc (match-beginning 2) (match-end 2)))) ;; Append any text before the marker to the output we're going ;; to return - we don't include the marker in this text. output (concat output (substring gud-marker-acc 0 (match-beginning 0))) ;; Set the accumulator to the remaining text. gud-marker-acc (substring gud-marker-acc (match-end 0)))) ;; Does the remaining text look like it might end with the ;; beginning of another marker? If it does, then keep it in ;; gud-marker-acc until we receive the rest of it. Since we ;; know the full marker regexp above failed, it's pretty simple to ;; test for marker starts. (if (string-match "\032.*\\'" gud-marker-acc) (progn ;; Everything before the potential marker start can be output. (setq output (concat output (substring gud-marker-acc 0 (match-beginning 0)))) ;; Everything after, we save, to combine with later input. (setq gud-marker-acc (substring gud-marker-acc (match-beginning 0)))) (setq output (concat output gud-marker-acc) gud-marker-acc "")) output)) (defun gud-rubydb-find-file (f) (save-excursion (let ((buf (find-file-noselect f))) (set-buffer buf) (gud-make-debug-menu) buf))) (defvar rubydb-command-name "ruby" "File name for executing ruby.") ;;;###autoload (defun rubydb (command-line) "Run rubydb on program FILE in buffer *gud-FILE*. The directory containing FILE becomes the initial working directory and source-file directory for your debugger." (interactive (list (read-from-minibuffer "Run rubydb (like this): " (if (consp gud-rubydb-history) (car gud-rubydb-history) (concat rubydb-command-name " ")) nil nil '(gud-rubydb-history . 1)))) (gud-common-init command-line 'gud-rubydb-massage-args 'gud-rubydb-marker-filter 'gud-rubydb-find-file) (gud-def gud-break "b %l" "\C-b" "Set breakpoint at current line.") ; (gud-def gud-remove "clear %l" "\C-d" "Remove breakpoint at current line") (gud-def gud-step "s" "\C-s" "Step one source line with display.") (gud-def gud-next "n" "\C-n" "Step one line (skip functions).") (gud-def gud-cont "c" "\C-r" "Continue with display.") (gud-def gud-finish "finish" "\C-f" "Finish executing current function.") (gud-def gud-up "up %p" "<" "Up N stack frames (numeric arg).") (gud-def gud-down "down %p" ">" "Down N stack frames (numeric arg).") (gud-def gud-print "p %e" "\C-p" "Evaluate ruby expression at point.") (setq comint-prompt-regexp "^(rdb:-) ") (setq paragraph-start comint-prompt-regexp) (run-hooks 'rubydb-mode-hook) ) ruby-1.2.3/sample/sieve.rb100644 774 145 375 6457556237 13464 0ustar matzNaCl# sieve of Eratosthenes sieve = [] if ! max = ARGV.shift; max = 100; end max = max.to_i print "1" for i in 2 .. max begin for d in sieve fail if i % d == 0 end print ", " print i sieve.push(i) rescue end end print "\n" ruby-1.2.3/sample/svr.rb100644 774 145 763 6457556237 13164 0ustar matzNaCl# socket example - server side # usage: ruby svr.rb require "socket" gs = TCPserver.open(0) addr = gs.addr addr.shift printf("server is on %d\n", addr.join(":")) socks = [gs] while TRUE nsock = select(socks); next if nsock == nil for s in nsock[0] if s == gs ns = s.accept socks.push(ns) print(s, " is accepted\n") 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-1.2.3/sample/test.rb100644 774 145 40155 6621514356 13355 0ustar matzNaCl#! /usr/local/bin/ruby $testnum=0 $ntest=0 $failed = 0 def check(what) printf "%s\n", what $what = what $testnum = 0 end def ok(cond) $testnum+=1 $ntest+=1 if cond printf "ok %d\n", $testnum else where = caller[0] printf "not ok %s %d -- %s\n", $what, $testnum, where $failed+=1 end end # make sure conditional operators work check "assignment" a=[]; a[0] ||= "bar"; ok(a[0] == "bar") h={}; h["foo"] ||= "bar"; ok(h["foo"] == "bar") aa = 5 aa ||= 25 ok(aa == 5) bb ||= 25 ok(bb == 25) cc &&=33 ok(cc == nil) cc = 5 cc &&=44 ok(cc == 44) check "condition" $x = '0'; $x == $x && ok(true) $x != $x && ok(false) $x == $x || ok(false) $x != $x || ok(true) # first test to see if we can run the tests. check "if/unless"; $x = 'test'; ok(if $x == $x then true else false end) $bad = false unless $x == $x $bad = true end ok(!$bad) ok(unless $x != $x then true else false end) check "case" case 5 when 1, 2, 3, 4, 6, 7, 8 ok(false) when 5 ok(true) end case 5 when 5 ok(true) when 1..10 ok(false) end case 5 when 1..10 ok(true) else ok(false) end case 5 when 5 ok(true) else ok(false) end case "foobar" when /^f.*r$/ ok(true) else ok(false) end check "while/until"; tmp = open("while_tmp", "w") tmp.print "tvi925\n"; tmp.print "tvi920\n"; tmp.print "vt100\n"; tmp.print "Amiga\n"; tmp.print "paper\n"; tmp.close # test break tmp = open("while_tmp", "r") ok(tmp.kind_of?(File)) while tmp.gets() break if /vt100/ end ok(!tmp.eof? && /vt100/) tmp.close # test next $bad = false tmp = open("while_tmp", "r") while tmp.gets() next if /vt100/; $bad = 1 if /vt100/; end ok(!(!tmp.eof? || /vt100/ || $bad)) tmp.close # test redo $bad = false tmp = open("while_tmp", "r") while tmp.gets() if gsub!('vt100', 'VT100') gsub!('VT100', 'Vt100') redo; end $bad = 1 if /vt100/; $bad = 1 if /VT100/; end ok(tmp.eof? && !$bad) tmp.close sum=0 for i in 1..10 sum += i i -= 1 if i > 0 redo end end ok(sum == 220) # test interval $bad = false tmp = open("while_tmp", "r") while tmp.gets() break unless 1..2 if /vt100/ || /Amiga/ || /paper/ $bad = true break end end ok(!$bad) tmp.close File.unlink "while_tmp" or `/bin/rm -f "while_tmp"` ok(!File.exist?("while_tmp")) i = 0 until i>4 i+=1 end ok(i>4) # exception handling check "exception"; begin fail "this must be handled" ok(false) rescue ok(true) end $bad = true begin fail "this must be handled no.2" rescue if $bad $bad = false retry ok(false) end end ok(true) # exception in rescue clause $string = "this must be handled no.3" begin begin fail "exception in rescue clause" rescue fail $string end ok(false) rescue ok(true) if $! == $string end # exception in ensure clause begin begin fail "this must be handled no.4" ensure fail "exception in ensure clause" end ok(false) rescue ok(true) end $bad = true begin begin fail "this must be handled no.5" ensure $bad = false end rescue end ok(!$bad) $bad = true begin begin fail "this must be handled no.6" ensure $bad = false end rescue end ok(!$bad) $bad = true while true begin break ensure $bad = false end end ok(!$bad) ok(catch(:foo) { loop do loop do throw :foo, true break end break ok(false) # should no reach here end false }) check "array" ok([1, 2] + [3, 4] == [1, 2, 3, 4]) ok([1, 2] * 2 == [1, 2, 1, 2]) ok([1, 2] * ":" == "1:2") ok([1, 2].hash == [1, 2].hash) ok([1,2,3] & [2,3,4] == [2,3]) ok([1,2,3] | [2,3,4] == [1,2,3,4]) ok([1,2,3] - [2,3] == [1]) $x = [0, 1, 2, 3, 4, 5] ok($x[2] == 2) ok($x[1..3] == [1, 2, 3]) ok($x[1,3] == [1, 2, 3]) $x[0, 2] = 10 ok($x[0] == 10 && $x[1] == 2) $x[0, 0] = -1 ok($x[0] == -1 && $x[1] == 10) $x[-1, 1] = 20 ok($x[-1] == 20 && $x.pop == 20) # array and/or ok(([1,2,3]&[2,4,6]) == [2]) ok(([1,2,3]|[2,4,6]) == [1,2,3,4,6]) # compact $x = [nil, 1, nil, nil, 5, nil, nil] $x.compact! ok($x == [1, 5]) # uniq $x = [1, 1, 4, 2, 5, 4, 5, 1, 2] $x.uniq! ok($x == [1, 4, 2, 5]) # empty? ok(!$x.empty?) $x = [] ok($x.empty?) # sort $x = ["it", "came", "to", "pass", "that", "..."] $x = $x.sort.join(" ") ok($x == "... came it pass that to") $x = [2,5,3,1,7] $x.sort!{|a,b| a<=>b} # sort with condition ok($x == [1,2,3,5,7]) $x.sort!{|a,b| b-a} # reverse sort ok($x == [7,5,3,2,1]) # split test $x = "The Book of Mormon" ok($x.split(//).reverse!.join == $x.reverse) ok($x.reverse == $x.reverse!) ok("1 byte string".split(//).reverse.join(":") == "g:n:i:r:t:s: :e:t:y:b: :1") $x = "a b c d" ok($x.split == ['a', 'b', 'c', 'd']) ok($x.split(' ') == ['a', 'b', 'c', 'd']) ok(defined? "a".chomp) ok("abc".scan(/./) == ["a", "b", "c"]) ok("1a2b3c".scan(/(\d.)/) == [["1a"], ["2b"], ["3c"]]) # non-greedy match ok("a=12;b=22".scan(/(.*?)=(\d*);?/) == [["a", "12"], ["b", "22"]]) $x = [1] ok(($x * 5).join(":") == '1:1:1:1:1') ok(($x * 1).join(":") == '1') ok(($x * 0).join(":") == '') *$x = 1..7 ok($x.size == 7) ok($x == [1, 2, 3, 4, 5, 6, 7]) check "hash" $x = {1=>2, 2=>4, 3=>6} $y = {1, 2, 2, 4, 3, 6} ok($x[1] == 2) ok(begin for k,v in $y fail if k*2 != v end true rescue false end) ok($x.length == 3) ok($x.has_key?(1)) ok($x.has_value?(4)) ok($x.indexes(2,3) == [4,6]) ok($x == {1=>2, 2=>4, 3=>6}) $z = $y.keys.join(":") ok($z == "1:2:3") $z = $y.values.join(":") ok($z == "2:4:6") ok($x == $y) $y.shift ok($y.length == 2) $z = [1,2] $y[$z] = 256 ok($y[$z] == 256) check "iterator" ok(!iterator?) def ttt ok(iterator?) end ttt{} # yield at top level ok(!defined?(yield)) $x = [1, 2, 3, 4] $y = [] # iterator over array for i in $x $y.push i end ok($x == $y) # nested iterator def tt 1.upto(10) {|i| yield i } end tt{|i| break if i == 5} ok(i == 5) # iterator break/redo/next/retry unless defined? loop def loop while true yield end end ok(false) else ok(true) end done = true loop{ break done = false } ok(done) done = false $bad = false loop { break if done done = true next $bad = true } ok(!$bad) done = false $bad = false loop { break if done done = true redo $bad = true } ok(!$bad) $x = [] for i in 1 .. 7 $x.push i end ok($x.size == 7) ok($x == [1, 2, 3, 4, 5, 6, 7]) $done = false $x = [] for i in 1 .. 7 # see how retry works in iterator loop if i == 4 and not $done $done = true retry end $x.push(i) end ok($x.size == 10) ok($x == [1, 2, 3, 1, 2, 3, 4, 5, 6, 7]) # append method to built-in class class Array def iter_test1 collect{|e| [e, yield(e)]}.sort{|a,b|a[1]<=>b[1]} end def iter_test2 a = collect{|e| [e, yield(e)]} a.sort{|a,b|a[1]<=>b[1]} end end $x = [[1,2],[3,4],[5,6]] ok($x.iter_test1{|x|x} == $x.iter_test2{|x|x}) check "bignum" def fact(n) return 1 if n == 0 f = 1 while n>0 f *= n n -= 1 end return f end fact(3) $x = fact(40) ok($x == $x) ok($x == fact(40)) ok($x < $x+2) ok($x > $x-2) ok($x == 815915283247897734345611269596115894272000000000) ok($x != 815915283247897734345611269596115894272000000001) ok($x+1 == 815915283247897734345611269596115894272000000001) ok($x/fact(20) == 335367096786357081410764800000) $x = -$x ok($x == -815915283247897734345611269596115894272000000000) ok(2-(2**32) == -(2**32-2)) ok(2**32 - 5 == (2**32-3)-2) $good = true; for i in 1000..1014 $good = false if ((1<> 1 $good = false if (n1 != n2) end ok($good) $good = true; for i in 4000..4096 n1 = 1 << i; if (n1**2-1) / (n1+1) != (n1-1) $good = false end end ok($good) check "string & char" ok("abcd" == "abcd") ok("abcd" =~ "abcd") ok("abcd" === "abcd") ok("abc" !~ /^$/) ok("abc\n" !~ /^$/) ok("abc" !~ /^d*$/) ok(("abc" =~ /d*$/) == 3) ok("" =~ /^$/) ok("\n" =~ /^$/) ok("a\n\n" =~ /^$/) "abcabc" =~ /.*a/ ok($& == "abca") "abcabc" =~ /.*c/ ok($& == "abcabc") "abcabc" =~ /.*?a/ ok($& == "a") "abcabc" =~ /.*?c/ ok($& == "abc") $foo = "abc" ok("#$foo = abc" == "abc = abc") ok("#{$foo} = abc" == "abc = abc") foo = "abc" ok("#{foo} = abc" == "abc = abc") ok('-' * 5 == '-----') ok('-' * 1 == '-') ok('-' * 0 == '') foo = '-' ok(foo * 5 == '-----') ok(foo * 1 == '-') ok(foo * 0 == '') $x = "a.gif" ok($x.sub(/.*\.([^\.]+)$/, '\1') == "gif") ok($x.sub(/.*\.([^\.]+)$/, 'b.\1') == "b.gif") ok($x.sub(/.*\.([^\.]+)$/, '\2') == "") ok($x.sub(/.*\.([^\.]+)$/, 'a\2b') == "ab") ok($x.sub(/.*\.([^\.]+)$/, '<\&>') == "") # character constants(assumes ASCII) ok("a"[0] == ?a) ok(?a == ?a) ok(?\C-a == 1) ok(?\M-a == 225) ok(?\M-\C-a == 129) ok("a".upcase![0] == ?A) ok("A".downcase![0] == ?a) ok("abc".tr!("a-z", "A-Z") == "ABC") ok("aabbcccc".tr_s!("a-z", "A-Z") == "ABC") ok("abc".tr!("0-9", "A-Z") == nil) ok("abcc".squeeze!("a-z") == "abc") ok("abcd".delete!("bc") == "ad") $x = "abcdef" $y = [ ?a, ?b, ?c, ?d, ?e, ?f ] $bad = false $x.each_byte {|i| if i != $y.shift $bad = true break end } ok(!$bad) check "asignment" a = nil ok(defined?(a)) ok(a == nil) # multiple asignment a, b = 1, 2 ok(a == 1 && b == 2) a, b = b, a ok(a == 2 && b == 1) a, = 1,2 ok(a == 1) a, *b = 1, 2, 3 ok(a == 1 && b == [2, 3]) *a = 1, 2, 3 ok(a == [1, 2, 3]) *a = 1..3 ok(a == [1, 2, 3]) check "call" def aaa(a, b=100, *rest) res = [a, b] res += rest if rest return res end # not enough argument begin aaa() # need at least 1 arg ok(false) rescue ok(true) end begin aaa # no arg given (exception raised) ok(false) rescue ok(true) end ok(aaa(1) == [1, 100]) ok(aaa(1, 2) == [1, 2]) ok(aaa(1, 2, 3, 4) == [1, 2, 3, 4]) ok(aaa(1, *[2, 3, 4]) == [1, 2, 3, 4]) check "proc" $proc = proc{|i| i} ok($proc.call(2) == 2) ok($proc.call(3) == 3) $proc = proc{|i| i*2} ok($proc.call(2) == 4) ok($proc.call(3) == 6) proc{ iii=5 # nested local variable $proc = proc{|i| iii = i } $proc2 = proc { $x = iii # nested variables shared by procs } # scope of nested variables ok(defined?(iii)) }.call ok(!defined?(iii)) # out of scope $x=0 $proc.call(5) $proc2.call ok($x == 5) if defined? Process.kill check "signal" $x = 0 trap "SIGINT", proc{|sig| $x = 2} Process.kill "SIGINT", $$ sleep 0.1 ok($x == 2) trap "SIGINT", proc{fail "Interrupt"} x = false begin Process.kill "SIGINT", $$ sleep 0.1 rescue x = $! end ok(x && /Interrupt/ =~ x) end check "eval" ok(eval("") == nil) $bad=false eval 'while false; $bad = true; print "foo\n" end' ok(!$bad) ok(eval('TRUE')) ok(eval('true')) ok(!eval('NIL')) ok(!eval('nil')) ok(!eval('FALSE')) ok(!eval('false')) $foo = 'ok(true)' begin eval $foo rescue ok(false) end ok(eval("$foo") == 'ok(true)') ok(eval("true") == true) i = 5 ok(eval("i == 5")) ok(eval("i") == 5) ok(eval("defined? i")) # eval with binding def test_ev local1 = "local1" lambda { local2 = "local2" return binding }.call end $x = test_ev ok(eval("local1", $x) == "local1") # normal local var ok(eval("local2", $x) == "local2") # nested local var $bad = true begin p eval("local1") rescue NameError # must raise error $bad = false end ok(!$bad) module EvTest EVTEST1 = 25 evtest2 = 125 $x = binding end ok(eval("EVTEST1", $x) == 25) # constant in module ok(eval("evtest2", $x) == 125) # local var in module $bad = true begin eval("EVTEST1") rescue NameError # must raise error $bad = false end ok(!$bad) x = proc{} eval "i4 = 1", x ok(eval("i4", x) == 1) x = proc{proc{}}.call eval "i4 = 22", x ok(eval("i4", x) == 22) $x = [] x = proc{proc{}}.call eval "(0..9).each{|i5| $x[i5] = proc{i5*2}}", x ok($x[4].call == 8) x = binding eval "i = 1", x ok(eval("i", x) == 1) x = proc{binding}.call eval "i = 22", x ok(eval("i", x) == 22) $x = [] x = proc{binding}.call eval "(0..9).each{|i5| $x[i5] = proc{i5*2}}", x ok($x[4].call == 8) proc { p = binding eval "foo11 = 1", p proc{foo11=22}.call ok(eval("foo11", p) == eval("foo11")) ok(eval("foo11") == 1) }.call p1 = proc{i6 = 0; proc{i6}}.call ok(p1.call == 0) eval "i6=5", p1 ok(p1.call == 5) ok(!defined?(i6)) p1 = proc{i6 = 0; proc{i6}}.call i6 = nil ok(p1.call == 0) eval "i6=1", p1 ok(p1.call == 1) eval "i6=5", p1 ok(p1.call == 5) ok(i6 == nil) check "system" ok(`echo foobar` == "foobar\n") ok(`./ruby -e 'print "foobar"'` == 'foobar') tmp = open("script_tmp", "w") tmp.print "print $zzz\n"; tmp.close ok(`./ruby -s script_tmp -zzz` == 'true') ok(`./ruby -s script_tmp -zzz=555` == '555') tmp = open("script_tmp", "w") tmp.print "#! /usr/local/bin/ruby -s\n"; tmp.print "print $zzz\n"; tmp.close ok(`./ruby script_tmp -zzz=678` == '678') tmp = open("script_tmp", "w") tmp.print "this is a leading junk\n"; tmp.print "#! /usr/local/bin/ruby -s\n"; tmp.print "print $zzz\n"; tmp.print "__END__\n"; tmp.print "this is a trailing junk\n"; tmp.close ok(`./ruby -x script_tmp` == 'nil') ok(`./ruby -x script_tmp -zzz=555` == '555') tmp = open("script_tmp", "w") for i in 1..5 tmp.print i, "\n" end tmp.close `./ruby -i.bak -pe 'sub(/^[0-9]+$/){$&.to_i * 5}' script_tmp` done = true tmp = open("script_tmp", "r") while tmp.gets if $_.to_i % 5 != 0 done = false break end end tmp.close ok(done) File.unlink "script_tmp" or `/bin/rm -f "script_tmp"` File.unlink "script_tmp.bak" or `/bin/rm -f "script_tmp.bak"` $bad = false for script in Dir["{lib,sample}/*.rb"] unless `./ruby -c #{script}`.chomp == "Syntax OK" $bad = true end end ok(!$bad) check "const" TEST1 = 1 TEST2 = 2 module Const TEST3 = 3 TEST4 = 4 end module Const2 TEST3 = 6 TEST4 = 8 end include Const ok([TEST1,TEST2,TEST3,TEST4] == [1,2,3,4]) include Const2 STDERR.print "intentionally redefines TEST3, TEST4\n" if $VERBOSE ok([TEST1,TEST2,TEST3,TEST4] == [1,2,6,8]) check "clone" foo = Object.new def foo.test "test" end bar = foo.clone def bar.test2 "test2" end ok(bar.test2 == "test2") ok(bar.test == "test") ok(foo.test == "test") begin foo.test2 ok false rescue ok true end check "marshal" $x = [1,2,3,[4,5,"foo"],{1=>"bar"},2.5,fact(30)] $y = Marshal.dump($x) ok($x == Marshal.load($y)) check "pack" $format = "c2x5CCxsdila6"; # Need the expression in here to force ary[5] to be numeric. This avoids # test2 failing because ary2 goes str->numeric->str and ary does not. ary = [1,-100,127,128,32767,987.654321098 / 100.0,12345,123456,"abcdef"] $x = ary.pack($format) ary2 = $x.unpack($format) ok(ary.length == ary2.length) ok(ary.join(':') == ary2.join(':')) ok($x =~ /def/) check "math" ok(Math.sqrt(4) == 2) include Math ok(sqrt(4) == 2) check "struct" struct_test = Struct.new("Test", :foo, :bar) ok(struct_test == Struct::Test) test = struct_test.new(1, 2) ok(test.foo == 1 && test.bar == 2) ok(test[0] == 1 && test[1] == 2) a, b = test ok(a == 1 && b == 2) test[0] = 22 ok(test.foo == 22) test.bar = 47 ok(test.bar == 47) check "variable" ok($$.instance_of?(Fixnum)) # read-only variable begin $$ = 5 ok false rescue ok true end foobar = "foobar" $_ = foobar ok($_ == foobar) check "trace" $x = 1234 $y = 0 trace_var :$x, proc{$y = $x} $x = 40414 ok($y == $x) untrace_var :$x $x = 19660208 ok($y != $x) trace_var :$x, proc{$x *= 2} $x = 5 ok($x == 10) untrace_var :$x check "defined?" ok(defined?($x)) # global variable ok(defined?($x) == 'global-variable')# returns description foo=5 ok(defined?(foo)) # local variable ok(defined?(Array)) # constant ok(defined?(Object.new)) # method ok(!defined?(Object.print)) # private method ok(defined?(1 == 2)) # operator expression def defined_test return !defined?(yield) end ok(defined_test) # not iterator ok(!defined_test{}) # called as iterator check "alias" class Alias0 def foo; "foo" end end class Alias1 0 printf "test: %d failed %d\n", $ntest, $failed else printf "end of test(test: %d)\n", $ntest end ruby-1.2.3/sample/time.rb100755 774 145 314 6457556237 13303 0ustar matzNaCl#! /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-1.2.3/sample/trojan.rb100644 774 145 473 6517526131 13630 0ustar matzNaCl#! /usr/local/bin/ruby path = ENV['PATH'].split(/:/) for dir in path if File.directory?(dir) for f in d = Dir.open(dir) fpath = dir+"/"+f if File.file?(fpath) && (File.stat(fpath).mode & 022) != 0 printf("file %s is writable from other users\n", fpath) end end d.close end end ruby-1.2.3/sample/tsvr.rb100644 774 145 624 6457556237 13344 0ustar matzNaCl# socket example - server side using thread # usage: ruby tsvr.rb require "socket" require "thread" gs = TCPserver.open(0) addr = gs.addr addr.shift printf("server is on %d\n", addr.join(":")) while TRUE ns = gs.accept print(ns, " is accepted\n") Thread.start do s = ns # save to dynamic variable while s.gets s.write($_) end print(s, " is gone\n") s.close end end ruby-1.2.3/sample/uumerge.rb100755 774 145 1434 6457557301 14033 0ustar matzNaCl#!/usr/local/bin/ruby if ARGV[0] == "-c" out_stdout = 1 ARGV.shift end $sawbegin = 0 $sawend = 0 while gets() if /^begin\s*(\d*)\s*(\S*)/ $mode, $file = $1, $2 $sawbegin+=1 if out_stdout out = STDOUT else out = open($file, "w") if $file != "" end out.binmode next end end raise "missing begin" unless $sawbegin out.binmode while gets() if /^end/ $sawend+=1 out.close unless out_stdout File.chmod $mode.oct, $file unless out_stdout next end sub(/[a-z]+$/, "") # handle stupid trailing lowercase letters next if /[a-z]/ next if !(((($_[0] - 32) & 077) + 2) / 3 == $_.length / 4) out << $_.unpack("u") if $sawbegin > $sawend end raise "missing end" if $sawbegin > $sawend raise "missing begin" if ! $sawbegin exit 0 ruby-1.2.3/win32/ 40755 774 145 0 6662164573 11417 5ustar matzNaClruby-1.2.3/win32/Makefile100644 774 145 15033 6646565652 13203 0ustar matzNaClSHELL = $(COMPSEC) #### Start of system configuration section. #### srcdir = . VPATH = .:./missing CC = cl YACC = byacc RANLIB = AR = INSTALL = ginstall -c INSTALL_PROGRAM = $(INSTALL) INSTALL_DATA = $(INSTALL) -m 644 PURIFY = CFLAGS = -nologo -DNT=1 -Ox -I. -I./missing LDFLAGS = $(CFLAGS) -Fm #CFLAGS = -nologo -DNT=1 -Zi -MD #LDFLAGS = $(CFLAGS) -Fm -MD LIBS = $(EXTLIBS) advapi32.lib wsock32.lib MISSING = crypt.obj setenv.obj vsnprintf.obj alloca.obj nt.obj prefix = binprefix = exec_prefix = bindir = libdir = STACK = 0x200000 ORGLIBPATH = $(LIB) #MISCLIBS = win32\sdbm.lib #### End of system configuration section. #### LIBRUBY = libruby.lib EXTOBJS = dmyext.obj MAINOBJ = main.obj OBJS = array.obj \ bignum.obj \ class.obj \ compar.obj \ dir.obj \ dln.obj \ enum.obj \ error.obj \ eval.obj \ file.obj \ fnmatch.obj \ gc.obj \ glob.obj \ hash.obj \ inits.obj \ io.obj \ math.obj \ marshal.obj \ numeric.obj \ object.obj \ pack.obj \ parse.obj \ process.obj \ random.obj \ range.obj \ re.obj \ regex.obj \ ruby.obj \ signal.obj \ sprintf.obj \ st.obj \ string.obj \ struct.obj \ time.obj \ util.obj \ variable.obj \ version.obj \ $(MISSING) all: miniruby.exe ext/Setup $(MISCLIBS) cd ext set LIB=..\..\win32;$(ORGLIBPATH) ..\miniruby .\extmk.rb static # ..\miniruby .\extmk.rb cd .. miniruby.exe: $(OBJS) $(MAINOBJ) $(EXTOBJS) @echo $(EXTOBJS) @echo $(LIBS) @rm -f miniruby.exe $(PURIFY) $(CC) $(LDFLAGS) $(MAINOBJ) $(OBJS) $(EXTOBJS) $(LIBS) -o miniruby.exe ruby.exe: $(LIBRUBY) $(MAINOBJ) $(EXTOBJS) rubymw.dll @rm -f ruby.exe # $(PURIFY) $(CC) $(LDFLAGS) $(MAINOBJ) $(EXTOBJS) $(LIBRUBY) $(LIBS) -o ruby.exe $(CC) $(LDFLAGS) $(MAINOBJ) -o ruby.exe rubymw.lib -link /STACK:$(STACK) rubymw.dll: $(LIBRUBY) $(EXTOBJS) set LIB=.\win32;$(ORGLIBPATH) @rm -f rubymw.dll $(PURIFY) $(CC) $(LDFLAGS) $(MAINOBJ) $(EXTOBJS) $(LIBRUBY) $(LIBS) -o rubymw.dll -link /DLL /DEF:ruby.def @mv rubymw.map rubydll.map $(LIBRUBY): $(OBJS) lib /OUT:$(LIBRUBY) $(OBJS) install:; $(INSTALL_PROGRAM) ruby.exe $(bindir)/ruby.exe @-strip $(bindir)/ruby @test -d $(libdir) || mkdir $(libdir) cd ext; ../miniruby ./extmk.rb install @for rb in `grep '^lib/' MANIFEST`; do \ $(INSTALL_DATA) $$rb $(libdir); \ done clean:; @rm -f $(OBJS) $(LIBRUBY) main.obj dmyext.obj *.pdb *.map *.exp @rm -f ext/extinit.c ext/extinit.obj cd ext ..\miniruby .\extmk.rb clean cd .. realclean: clean @rm -f Makefile ext/extmk.rb @rm -f config.cache config.h config.log config.status @rm -f core ruby miniruby *~ test:; @-./ruby sample/test.rb > ./ruby_test 2>&1; \ if grep '^end of test' ./ruby_test > /dev/null; then \ echo "test succeeded"; \ else \ grep '^sample/test.rb' ./ruby_test; \ grep '^not' ./ruby_test; \ echo "test failed";\ fi;\ rm -f ./ruby_test .c.obj: $(CC) $(CFLAGS) $(CPPFLAGS) -c $< alloca.obj: missing/alloca.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c missing/alloca.c crypt.obj: missing/crypt.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c missing/crypt.c dup2.obj: missing/dup2.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c missing/dup2.c flock.obj: missing/flock.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c missing/flock.c memmove.obj: missing/memmove.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/memmove.c mkdir.obj: missing/mkdir.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/mkdir.c setenv.obj: missing/setenv.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c missing/setenv.c strerror.obj: missing/strerror.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strerror.c strdup.obj: missing/strdup.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strdup.c strftime.obj: missing/strftime.c $(CC) -I. $(CFLAGS) $(CPPFLAGS) -c missing/strftime.c strstr.obj: missing/strstr.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strstr.c strtol.obj: missing/strtol.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strtol.c strtoul.obj: missing/strtoul.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/strtoul.c vsnprintf.obj: missing/vsnprintf.c $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/vsnprintf.c # when I use -I., there is confliction at "OpenFile" # so, set . into environment varible "include" nt.obj: missing/nt.c @set include=$(INCLUDE);. $(CC) $(CFLAGS) $(CPPFLAGS) -c missing/nt.c parse.c: parse.y $(YACC) $(YFLAGS) parse.y sed -e "s!^extern char \*getenv();!/* & */!" y.tab.c > parse.c @rm y.tab.c win32\sdbm.lib : win32\sdbm.c win32\sdbm.h cd win32 $(CC) $(CFLAGS) $(CPPFLAGS) -DMSDOS -c sdbm.c lib /OUT:sdbm.lib sdbm.obj copy sdbm.h ndbm.h cd .. # Prevent GNU make v3 from overflowing arg limit on SysV. .NOEXPORT: ### parse.obj : parse.y ruby.h defines.h config.h env.h node.h st.h regex.h ### array.obj: array.c ruby.h config.h defines.h bignum.obj: bignum.c ruby.h config.h defines.h class.obj: class.c ruby.h config.h defines.h node.h st.h compar.obj: compar.c ruby.h config.h defines.h dir.obj: dir.c ruby.h config.h defines.h dln.obj: dln.c config.h defines.h dln.h st.h dmyext.obj: dmyext.c enum.obj: enum.c ruby.h config.h defines.h error.obj: error.c ruby.h config.h defines.h env.h eval.obj: eval.c ruby.h config.h defines.h env.h node.h rubysig.h st.h dln.h file.obj: file.c ruby.h config.h defines.h rubyio.h rubysig.h fnmatch.obj: fnmatch.c config.h fnmatch.h gc.obj: gc.c ruby.h config.h defines.h env.h rubysig.h st.h node.h re.h regex.h glob.obj: glob.c config.h fnmatch.h hash.obj: hash.c ruby.h config.h defines.h st.h inits.obj: inits.c ruby.h config.h defines.h io.obj: io.c ruby.h config.h defines.h rubyio.h rubysig.h main.obj: main.c math.obj: math.c ruby.h config.h defines.h numeric.obj: numeric.c ruby.h config.h defines.h object.obj: object.c ruby.h config.h defines.h st.h pack.obj: pack.c ruby.h config.h defines.h process.obj: process.c ruby.h config.h defines.h rubysig.h st.h random.obj: random.c ruby.h config.h defines.h range.obj: range.c ruby.h config.h defines.h re.obj: re.c ruby.h config.h defines.h re.h regex.h regex.obj: regex.c config.h defines.h regex.h util.h ruby.obj: ruby.c ruby.h config.h defines.h re.h regex.h dln.h signal.obj: signal.c ruby.h config.h defines.h rubysig.h sprintf.obj: sprintf.c ruby.h config.h defines.h st.obj: st.c config.h st.h string.obj: string.c ruby.h config.h defines.h re.h regex.h struct.obj: struct.c ruby.h config.h defines.h time.obj: time.c ruby.h config.h defines.h util.obj: util.c defines.h config.h util.h variable.obj: variable.c ruby.h config.h defines.h env.h st.h version.obj: version.c ruby.h config.h defines.h version.h director.obj : director.c dir.h ruby-1.2.3/win32/config.h100644 774 145 3274 6575173424 13136 0ustar matzNaCl#define THREAD 1 #define SIZEOF_INT 4 #define SIZEOF_LONG 4 #define SIZEOF_VOIDP 4 #define HAVE_PROTOTYPES 1 #define HAVE_STDARG_PROTOTYPES 1 /* #define HAVE_ATTR_NORETURN 1 */ /* #define HAVE_DIRENT_H 1 */ /* #define HAVE_UNISTD_H 1 */ #define HAVE_STDLIB_H 1 #define HAVE_LIMITS_H 1 #define HAVE_SYS_FILE_H 1 /* #define HAVE_PWD_H 1 */ /* #define HAVE_SYS_TIME_H 1 */ /* #define HAVE_SYS_TIMES_H 1 */ /* #define HAVE_SYS_PARAM_H 1 */ /* #define HAVE_SYS_WAIT_H 1 */ #define HAVE_STRING_H 1 /* #define HAVE_UTIME_H 1 */ #define HAVE_MEMORY_H 1 /* #define HAVE_ST_BLKSIZE 1 */ #define HAVE_ST_RDEV 1 /* #define GETGROUPS_T gid_t */ #define GETGROUPS_T int #define RETSIGTYPE void #define HAVE_ALLOCA 1 #define vfork fork #define HAVE_FMOD 1 /* #define HAVE_RANDOM 1 */ /* #define HAVE_WAITPID 1 */ #define HAVE_GETCWD 1 /* #define HAVE_TRUNCATE 1 */ #define HAVE_CHSIZE 1 /* #define HAVE_TIMES 1 */ /* #define HAVE_UTIMES 1 */ /* #define HAVE_FCNTL 1 */ /* #define HAVE_SETITIMER 1 */ #define HAVE_GETGROUPS 1 /* #define HAVE_SIGPROCMASK 1 */ #define RSHIFT(x,y) ((x)>>y) #define FILE_COUNT _cnt #define DLEXT ".dll" #define RUBY_LIB ";/usr/local/lib/ruby;." #define RUBY_ARCHLIB "/usr/local/lib/ruby/i386-mswin32" #define RUBY_PLATFORM "i386-mswin32" /* NNN */ #define strcasecmp _strcmpi #define popen _popen #define pclose _pclose #define pipe _pipe #define bzero(x, y) memset(x, 0, y) #define S_IFMT _S_IFMT #define S_IFDIR _S_IFDIR #define S_IFCHR _S_IFCHR #define S_IFREG _S_IFREG #define S_IREAD _S_IREAD #define S_IWRITE _S_IWRITE #define S_IEXEC _S_IEXEC #define S_IFIFO _S_IFIFO #define UIDTYPE int #define GIDTYPE int #define pid_t int #define WNOHANG -1 //#define NT ruby-1.2.3/win32/ntsetup.bat100644 774 145 262 6457556237 13672 0ustar matzNaCl@echo off copy config.h .. copy Makefile .. copy ruby.def .. cd ..\ext copy Setup.nt Setup copy extmk.rb.nt extmk.rb cd .. echo type `nmake' to make ruby for mswin32. ruby-1.2.3/win32/ruby.def100644 774 145 12650 6650770021 13165 0ustar matzNaClLIBRARY rubymw.dll CODE LOADONCALL DATA LOADONCALL DESCRIPTION 'win32 rubymw.dll' EXPORTS ;global objects ;array.c: cArray ;bignum.c: cBignum ;eval.c: cProc ;file.c: cFile ;hash.c: cHash ;io.c: cIO ;numeric.c: cNumeric cFloat cInteger cFixnum ;object.c cObject cModule cClass cFixnum cData ;re.c: cRegexp ;string.c: cString cStruct ; procedures/methods ;missing/nt.c NtInitialize myfdopen myaccept mybind myconnect mygetpeername mygetsockname mygetsockopt myioctlsocket mylisten myrecv myrecvfrom mysend mysendto mysetsockopt myshutdown mysocket mygethostbyaddr mygethostbyname mygethostname mygetprotobyname mygetprotobynumber mygetservbyname mygetservbyport ;array.c memclear ary_freeze ary_new2 ary_new ary_new3 ary_new4 assoc_new ary_store ary_push ary_pop ary_shift ary_unshift ary_entry ary_each ary_join ary_to_s ary_reverse ary_sort_bang ary_sort ary_delete ary_delete_at ary_plus ary_concat ary_assoc ary_rassoc ary_includes ;bignum.c big_clone big_2comp big_norm uint2big int2big uint2inum int2inum str2inum big2str big2ulong big2long big_to_i dbl2big big2dbl big_to_f big_plus big_minus big_mul big_pow big_and big_or big_xor big_lshift big_rand ;class.c class_new singleton_class_new singleton_class_clone rb_define_class_id rb_define_class rb_define_class_under module_new rb_define_module_id rb_define_module rb_define_module_under rb_include_module rb_define_method_id rb_define_method rb_undef_method rb_define_private_method rb_define_protected_method rb_singleton_class rb_define_singleton_method rb_define_module_function rb_define_global_function rb_define_alias rb_define_attr rb_scan_args ; dln.c dln_load dln_find_exe dln_find_file ; enum.c rb_each enum_length ; error.c Error Error_Append Warn Warning Bug rb_check_type exc_new exc_new2 exc_new3 Raise TypeError ArgError NameError IndexError Fail rb_notimplement LoadError Fatal rb_sys_fail ;eval.c rb_clear_cache rb_alias rb_add_method rb_remove_method rb_disable_super rb_enable_super rb_method_boundp dyna_var_defined dyna_var_ref dyna_var_asgn rb_safe_level rb_set_safe_level rb_check_safe_str rb_secure ruby_init ruby_options ruby_run rb_eval_string rb_eval_cmd rb_trap_eval rb_test_false_or_nil rb_respond_to rb_exit rb_raise rb_fatal rb_interrupt iterator_p rb_yield_0 rb_yield rb_iterate rb_rescue rb_ensure rb_apply rb_funcall rb_funcall2 rb_backtrace rb_frame_last_func f_load rb_provide f_require class_new_instance rb_extend_object f_lambda gc_mark_threads thread_schedule thread_wait_fd thread_fd_writable thread_wait_for thread_alone thread_select thread_sleep thread_sleep_forever thread_create thread_interrupt ; file.c file_open eaccess file_s_expand_path ; gc.c xmalloc xcalloc xrealloc gc_s_enable gc_s_disable rb_global_variable rb_newobj data_object_alloc gc_mark_locations gc_mark_maybe gc_mark gc_force_recycle gc_mark_frame gc_gc ; hash.c rb_hash hash_new hash_aref hash_aset ; inits.c rb_call_inits ; io.c eof_error io_writable io_readable io_write io_gets_method io_gets io_getc io_ungetc io_fptr_finalize io_close io_binmode io_mode_flags rb_fopen rb_fdopen io_unbuffered io_reopen f_gets rb_str_setter ; numeric.c num_zerodiv num_coerce_bin float_new flo_pow num2long num2ulong num2fix fix2str fix_to_s num_upto fix_upto ; object.c rb_equal rb_eql obj_equal any_to_s rb_inspect obj_is_instance_of obj_is_kind_of obj_alloc rb_to_id rb_class_of rb_type rb_special_const_p rb_Integer rb_Float rb_String rb_Array ; parse.c ;;compile_string ;;compile_file ;;node_newnode nodetype nodeline id_attrset rb_intern rb_id2name rb_is_const_id rb_is_instance_id backref_get backref_set lastline_get lastline_set ; process.c rb_proc_exec rb_syswait ; range.c range_new range_beg_end ; re.c str_cicmp reg_search reg_nth_defined reg_nth_match reg_last_match reg_match_pre reg_match_post reg_match_last reg_new reg_regcomp reg_match reg_match2 reg_regsub rb_set_kcode ; ruby.c ruby_require_modules rb_load_file ruby_script ruby_prog_init ruby_set_argv ruby_process_options ; signal.c gc_mark_trap_list rb_trap_exit rb_trap_exec ; st.c st_init_table_with_size st_init_table st_init_numtable st_init_strtable st_free_table st_lookup st_insert st_add_direct st_find_or_add st_copy st_delete st_delete_safe st_foreach ; string.c str_new str_new2 str_new3 str_new4 obj_as_string str_dup str_plus str_times str_substr str_modify str_freeze str_dup_frozen str_taint str_tainted str_resize str_cat str_hash str_cmp str_upto str_inspect str_split ; struct.c struct_getmember struct_define struct_alloc struct_new struct_aref struct_aset ; time.c time_new time_timeval ; util.c scan_oct scan_hex add_suffix ;variable.c new_idhash rb_class_path rb_set_class_path rb_path2class rb_name_class rb_autoload f_autoload rb_class2name rb_global_entry gc_mark_global_tbl rb_define_hooked_variable rb_define_variable rb_define_readonly_variable rb_define_virtual_variable rb_gvar_get rb_gvar_set rb_gvar_set2 rb_gvar_defined rb_alias_variable rb_ivar_get rb_ivar_set rb_ivar_defined rb_const_get_at rb_const_get mod_constants rb_const_defined_at rb_autoload_defined rb_const_defined rb_const_set rb_define_const rb_define_global_const rb_iv_get rb_iv_set ; version.c show_version show_copyright ruby-1.2.3/win32/sdbm.c100644 774 145 47547 6517330233 12631 0ustar matzNaCl/* * sdbm - ndbm work-alike hashed database library * based on Per-Aake Larson's Dynamic Hashing algorithms. BIT 18 (1978). * author: oz@nexus.yorku.ca * status: public domain. * * core routines */ #ifndef lint /*char sdbm_rcsid[] = "$Id: sdbm.c,v 1.16 90/12/13 13:01:31 oz Exp $";*/ #endif #include "sdbm.h" /*#include "tune.h"*/ /* * sdbm - ndbm work-alike hashed database library * tuning and portability constructs [not nearly enough] * author: oz@nexus.yorku.ca */ #define BYTESIZ 8 #ifdef SVID #include #endif #ifdef __GO32__ #include #endif #ifdef BSD42 #define SEEK_SET L_SET #define memset(s,c,n) bzero(s, n) /* only when c is zero */ #define memcpy(s1,s2,n) bcopy(s2, s1, n) #define memcmp(s1,s2,n) bcmp(s1,s2,n) #endif /* * important tuning parms (hah) */ #define SEEDUPS /* always detect duplicates */ #define BADMESS /* generate a message for worst case: cannot make room after SPLTMAX splits */ /* * misc */ #ifdef DEBUG #define debug(x) printf x #else #define debug(x) #endif #ifdef BIG_E #define GET_SHORT(p, i) (((unsigned)((unsigned char *)(p))[(i)*2] << 8) + (((unsigned char *)(p))[(i)*2 + 1])) #define PUT_SHORT(p, i, s) (((unsigned char *)(p))[(i)*2] = (unsigned char)((s) >> 8), ((unsigned char *)(p))[(i)*2 + 1] = (unsigned char)(s)) #else #define GET_SHORT(p, i) ((p)[i]) #define PUT_SHORT(p, i, s) ((p)[i] = (s)) #endif /*#include "pair.h"*/ static int fitpair proto((char *, int)); static void putpair proto((char *, datum, datum)); static datum getpair proto((char *, datum)); static int delpair proto((char *, datum)); static int chkpage proto((char *)); static datum getnkey proto((char *, int)); static void splpage proto((char *, char *, long)); #ifdef SEEDUPS static int duppair proto((char *, datum)); #endif #ifdef MSDOS #include #include #include #endif #include #include #ifdef BSD42 #include #else #include /*#include */ #endif #ifndef O_BINARY #define O_BINARY 0 #endif #include #ifndef EPERM #define EPERM EACCES #endif #include #ifdef __STDC__ #include #endif #ifndef NULL #define NULL 0 #endif /* * externals */ #ifndef sun #ifndef MSDOS extern int errno; #endif #endif /* * forward */ static int getdbit proto((DBM *, long)); static int setdbit proto((DBM *, long)); static int getpage proto((DBM *, long)); static datum getnext proto((DBM *)); static int makroom proto((DBM *, long, int)); /* * useful macros */ #define bad(x) ((x).dptr == NULL || (x).dsize < 0) #define exhash(item) dbm_hash((item).dptr, (item).dsize) #define ioerr(db) ((db)->flags |= DBM_IOERR) #define OFF_PAG(off) (long) (off) * PBLKSIZ #define OFF_DIR(off) (long) (off) * DBLKSIZ static long masks[] = { 000000000000L, 000000000001L, 000000000003L, 000000000007L, 000000000017L, 000000000037L, 000000000077L, 000000000177L, 000000000377L, 000000000777L, 000000001777L, 000000003777L, 000000007777L, 000000017777L, 000000037777L, 000000077777L, 000000177777L, 000000377777L, 000000777777L, 000001777777L, 000003777777L, 000007777777L, 000017777777L, 000037777777L, 000077777777L, 000177777777L, 000377777777L, 000777777777L, 001777777777L, 003777777777L, 007777777777L, 017777777777L }; datum nullitem = {NULL, 0}; DBM * dbm_open(file, flags, mode) register char *file; register int flags; register int mode; { register DBM *db; register char *dirname; register char *pagname; register int n; if (file == NULL || !*file) return errno = EINVAL, (DBM *) NULL; /* * need space for two seperate filenames */ n = strlen(file) * 2 + strlen(DIRFEXT) + strlen(PAGFEXT) + 2; if ((dirname = malloc((unsigned) n)) == NULL) return errno = ENOMEM, (DBM *) NULL; /* * build the file names */ dirname = strcat(strcpy(dirname, file), DIRFEXT); pagname = strcpy(dirname + strlen(dirname) + 1, file); pagname = strcat(pagname, PAGFEXT); db = dbm_prep(dirname, pagname, flags, mode); free((char *) dirname); return db; } DBM * dbm_prep(dirname, pagname, flags, mode) char *dirname; char *pagname; int flags; int mode; { register DBM *db; struct stat dstat; if ((db = (DBM *) malloc(sizeof(DBM))) == NULL) return errno = ENOMEM, (DBM *) NULL; db->flags = 0; db->hmask = 0; db->blkptr = 0; db->keyptr = 0; /* * adjust user flags so that WRONLY becomes RDWR, * as required by this package. Also set our internal * flag for RDONLY. */ if (flags & O_WRONLY) flags = (flags & ~O_WRONLY) | O_RDWR; if (flags & O_RDONLY) db->flags = DBM_RDONLY; /* * open the files in sequence, and stat the dirfile. * If we fail anywhere, undo everything, return NULL. */ #ifdef MSDOS flags |= O_BINARY; #endif if ((db->pagf = open(pagname, flags, mode)) > -1) { if ((db->dirf = open(dirname, flags, mode)) > -1) { /* * need the dirfile size to establish max bit number. */ if (fstat(db->dirf, &dstat) == 0) { /* * zero size: either a fresh database, or one with a single, * unsplit data page: dirpage is all zeros. */ db->dirbno = (!dstat.st_size) ? 0 : -1; db->pagbno = -1; db->maxbno = dstat.st_size * (long) BYTESIZ; (void) memset(db->pagbuf, 0, PBLKSIZ); (void) memset(db->dirbuf, 0, DBLKSIZ); /* * success */ return db; } (void) close(db->dirf); } (void) close(db->pagf); } free((char *) db); return (DBM *) NULL; } void dbm_close(db) register DBM *db; { if (db == NULL) errno = EINVAL; else { (void) close(db->dirf); (void) close(db->pagf); free((char *) db); } } datum dbm_fetch(db, key) register DBM *db; datum key; { if (db == NULL || bad(key)) return errno = EINVAL, nullitem; if (getpage(db, exhash(key))) return getpair(db->pagbuf, key); return ioerr(db), nullitem; } int dbm_delete(db, key) register DBM *db; datum key; { if (db == NULL || bad(key)) return errno = EINVAL, -1; if (dbm_rdonly(db)) return errno = EPERM, -1; if (getpage(db, exhash(key))) { if (!delpair(db->pagbuf, key)) return -1; /* * update the page file */ if (lseek(db->pagf, OFF_PAG(db->pagbno), SEEK_SET) < 0 || write(db->pagf, db->pagbuf, PBLKSIZ) < 0) return ioerr(db), -1; return 0; } return ioerr(db), -1; } int dbm_store(db, key, val, flags) register DBM *db; datum key; datum val; int flags; { int need; register long hash; if (db == NULL || bad(key)) return errno = EINVAL, -1; if (dbm_rdonly(db)) return errno = EPERM, -1; need = key.dsize + val.dsize; /* * is the pair too big (or too small) for this database ?? */ if (need < 0 || need > PAIRMAX) return errno = EINVAL, -1; if (getpage(db, (hash = exhash(key)))) { /* * if we need to replace, delete the key/data pair * first. If it is not there, ignore. */ if (flags == DBM_REPLACE) (void) delpair(db->pagbuf, key); #ifdef SEEDUPS else if (duppair(db->pagbuf, key)) return 1; #endif /* * if we do not have enough room, we have to split. */ if (!fitpair(db->pagbuf, need)) if (!makroom(db, hash, need)) return ioerr(db), -1; /* * we have enough room or split is successful. insert the key, * and update the page file. */ (void) putpair(db->pagbuf, key, val); if (lseek(db->pagf, OFF_PAG(db->pagbno), SEEK_SET) < 0 || write(db->pagf, db->pagbuf, PBLKSIZ) < 0) return ioerr(db), -1; /* * success */ return 0; } return ioerr(db), -1; } /* * makroom - make room by splitting the overfull page * this routine will attempt to make room for SPLTMAX times before * giving up. */ static int makroom(db, hash, need) register DBM *db; long hash; int need; { long newp; char twin[PBLKSIZ]; #ifdef MSDOS char zer[PBLKSIZ]; #endif char *pag = db->pagbuf; char *new = twin; register int smax = SPLTMAX; long oldtail; do { /* * split the current page */ (void) splpage(pag, new, db->hmask + 1); /* * address of the new page */ newp = (hash & db->hmask) | (db->hmask + 1); debug(("newp: %ld\n", newp)); /* * write delay, read avoidence/cache shuffle: * select the page for incoming pair: if key is to go to the new page, * write out the previous one, and copy the new one over, thus making * it the current page. If not, simply write the new page, and we are * still looking at the page of interest. current page is not updated * here, as dbm_store will do so, after it inserts the incoming pair. */ #ifdef MSDOS /* * Fill hole with 0 if made it. * (hole is NOT read as 0) */ oldtail = lseek(db->pagf, 0L, SEEK_END); memset(zer, 0, PBLKSIZ); while (OFF_PAG(newp) > oldtail) { if (lseek(db->pagf, 0L, SEEK_END) < 0 || write(db->pagf, zer, PBLKSIZ) < 0) { return 0; } oldtail += PBLKSIZ; } #endif if (hash & (db->hmask + 1)) { if (lseek(db->pagf, OFF_PAG(db->pagbno), SEEK_SET) < 0 || write(db->pagf, db->pagbuf, PBLKSIZ) < 0) return 0; db->pagbno = newp; (void) memcpy(pag, new, PBLKSIZ); } else if (lseek(db->pagf, OFF_PAG(newp), SEEK_SET) < 0 || write(db->pagf, new, PBLKSIZ) < 0) return 0; if (!setdbit(db, db->curbit)) return 0; /* * see if we have enough room now */ if (fitpair(pag, need)) return 1; /* * try again... update curbit and hmask as getpage would have * done. because of our update of the current page, we do not * need to read in anything. BUT we have to write the current * [deferred] page out, as the window of failure is too great. */ db->curbit = 2 * db->curbit + ((hash & (db->hmask + 1)) ? 2 : 1); db->hmask |= (db->hmask + 1); if (lseek(db->pagf, OFF_PAG(db->pagbno), SEEK_SET) < 0 || write(db->pagf, db->pagbuf, PBLKSIZ) < 0) return 0; } while (--smax); /* * if we are here, this is real bad news. After SPLTMAX splits, * we still cannot fit the key. say goodnight. */ #ifdef BADMESS (void) write(2, "sdbm: cannot insert after SPLTMAX attempts.\n", 44); #endif return 0; } /* * the following two routines will break if * deletions aren't taken into account. (ndbm bug) */ datum dbm_firstkey(db) register DBM *db; { if (db == NULL) return errno = EINVAL, nullitem; /* * start at page 0 */ (void) memset(db->pagbuf, 0, PBLKSIZ); if (lseek(db->pagf, OFF_PAG(0), SEEK_SET) < 0 || read(db->pagf, db->pagbuf, PBLKSIZ) < 0) return ioerr(db), nullitem; db->pagbno = 0; db->blkptr = 0; db->keyptr = 0; return getnext(db); } datum dbm_nextkey(db) register DBM *db; { if (db == NULL) return errno = EINVAL, nullitem; return getnext(db); } /* * all important binary trie traversal */ static int getpage(db, hash) register DBM *db; register long hash; { register int hbit; register long dbit; register long pagb; dbit = 0; hbit = 0; while (dbit < db->maxbno && getdbit(db, dbit)) dbit = 2 * dbit + ((hash & ((long) 1 << hbit++)) ? 2 : 1); debug(("dbit: %d...", dbit)); db->curbit = dbit; db->hmask = masks[hbit]; pagb = hash & db->hmask; /* * see if the block we need is already in memory. * note: this lookaside cache has about 10% hit rate. */ if (pagb != db->pagbno) { /* * note: here, we assume a "hole" is read as 0s. * if not, must zero pagbuf first. */ (void) memset(db->pagbuf, 0, PBLKSIZ); if (lseek(db->pagf, OFF_PAG(pagb), SEEK_SET) < 0 || read(db->pagf, db->pagbuf, PBLKSIZ) < 0) return 0; if (!chkpage(db->pagbuf)) { return 0; } db->pagbno = pagb; debug(("pag read: %d\n", pagb)); } return 1; } static int getdbit(db, dbit) register DBM *db; register long dbit; { register long c; register long dirb; c = dbit / BYTESIZ; dirb = c / DBLKSIZ; if (dirb != db->dirbno) { if (lseek(db->dirf, OFF_DIR(dirb), SEEK_SET) < 0 || read(db->dirf, db->dirbuf, DBLKSIZ) < 0) return 0; db->dirbno = dirb; debug(("dir read: %d\n", dirb)); } return db->dirbuf[c % DBLKSIZ] & (1 << (dbit % BYTESIZ)); } static int setdbit(db, dbit) register DBM *db; register long dbit; { register long c; register long dirb; c = dbit / BYTESIZ; dirb = c / DBLKSIZ; if (dirb != db->dirbno) { if (lseek(db->dirf, OFF_DIR(dirb), SEEK_SET) < 0 || read(db->dirf, db->dirbuf, DBLKSIZ) < 0) return 0; db->dirbno = dirb; debug(("dir read: %d\n", dirb)); } db->dirbuf[c % DBLKSIZ] |= (1 << (dbit % BYTESIZ)); if (dbit >= db->maxbno) db->maxbno += (long) DBLKSIZ * BYTESIZ; if (lseek(db->dirf, OFF_DIR(dirb), SEEK_SET) < 0 || write(db->dirf, db->dirbuf, DBLKSIZ) < 0) return 0; return 1; } /* * getnext - get the next key in the page, and if done with * the page, try the next page in sequence */ static datum getnext(db) register DBM *db; { datum key; for (;;) { db->keyptr++; key = getnkey(db->pagbuf, db->keyptr); if (key.dptr != NULL) return key; /* * we either run out, or there is nothing on this page.. * try the next one... If we lost our position on the * file, we will have to seek. */ db->keyptr = 0; if (db->pagbno != db->blkptr++) if (lseek(db->pagf, OFF_PAG(db->blkptr), SEEK_SET) < 0) break; db->pagbno = db->blkptr; if (read(db->pagf, db->pagbuf, PBLKSIZ) <= 0) break; if (!chkpage(db->pagbuf)) { break; } } return ioerr(db), nullitem; } /* pair.c */ /* * sdbm - ndbm work-alike hashed database library * based on Per-Aake Larson's Dynamic Hashing algorithms. BIT 18 (1978). * author: oz@nexus.yorku.ca * status: public domain. * * page-level routines */ #ifndef lint /*char pair_rcsid[] = "$Id: sdbm.c,v 1.1.1.1.2.1 1998/01/16 12:36:12 matz Exp $";*/ #endif #ifndef BSD42 /*#include */ #endif #define exhash(item) dbm_hash((item).dptr, (item).dsize) /* * forward */ static int seepair proto((char *, int, char *, int)); /* * page format: * +------------------------------+ * ino | n | keyoff | datoff | keyoff | * +------------+--------+--------+ * | datoff | - - - ----> | * +--------+---------------------+ * | F R E E A R E A | * +--------------+---------------+ * | <---- - - - | data | * +--------+-----+----+----------+ * | key | data | key | * +--------+----------+----------+ * * calculating the offsets for free area: if the number * of entries (ino[0]) is zero, the offset to the END of * the free area is the block size. Otherwise, it is the * nth (ino[ino[0]]) entry's offset. */ static int fitpair(pag, need) char *pag; int need; { register int n; register int off; register int free; register short *ino = (short *) pag; off = ((n = GET_SHORT(ino,0)) > 0) ? GET_SHORT(ino,n) : PBLKSIZ; free = off - (n + 1) * sizeof(short); need += 2 * sizeof(short); debug(("free %d need %d\n", free, need)); return need <= free; } static void putpair(pag, key, val) char *pag; datum key; datum val; { register int n; register int off; register short *ino = (short *) pag; off = ((n = GET_SHORT(ino,0)) > 0) ? GET_SHORT(ino,n) : PBLKSIZ; /* * enter the key first */ off -= key.dsize; if (key.dsize) (void) memcpy(pag + off, key.dptr, key.dsize); PUT_SHORT(ino,n + 1,off); /* * now the data */ off -= val.dsize; if (val.dsize) (void) memcpy(pag + off, val.dptr, val.dsize); PUT_SHORT(ino,n + 2,off); /* * adjust item count */ PUT_SHORT(ino,0,GET_SHORT(ino,0) + 2); } static datum getpair(pag, key) char *pag; datum key; { register int i; register int n; datum val; register short *ino = (short *) pag; if ((n = GET_SHORT(ino,0)) == 0) return nullitem; if ((i = seepair(pag, n, key.dptr, key.dsize)) == 0) return nullitem; val.dptr = pag + GET_SHORT(ino,i + 1); val.dsize = GET_SHORT(ino,i) - GET_SHORT(ino,i + 1); return val; } #ifdef SEEDUPS static int duppair(pag, key) char *pag; datum key; { register short *ino = (short *) pag; return GET_SHORT(ino,0) > 0 && seepair(pag, GET_SHORT(ino,0), key.dptr, key.dsize) > 0; } #endif static datum getnkey(pag, num) char *pag; int num; { datum key; register int off; register short *ino = (short *) pag; num = num * 2 - 1; if (GET_SHORT(ino,0) == 0 || num > GET_SHORT(ino,0)) return nullitem; off = (num > 1) ? GET_SHORT(ino,num - 1) : PBLKSIZ; key.dptr = pag + GET_SHORT(ino,num); key.dsize = off - GET_SHORT(ino,num); return key; } static int delpair(pag, key) char *pag; datum key; { register int n; register int i; register short *ino = (short *) pag; if ((n = GET_SHORT(ino,0)) == 0) return 0; if ((i = seepair(pag, n, key.dptr, key.dsize)) == 0) return 0; /* * found the key. if it is the last entry * [i.e. i == n - 1] we just adjust the entry count. * hard case: move all data down onto the deleted pair, * shift offsets onto deleted offsets, and adjust them. * [note: 0 < i < n] */ if (i < n - 1) { register int m; register char *dst = pag + (i == 1 ? PBLKSIZ : GET_SHORT(ino,i - 1)); register char *src = pag + GET_SHORT(ino,i + 1); register int zoo = dst - src; debug(("free-up %d ", zoo)); /* * shift data/keys down */ m = GET_SHORT(ino,i + 1) - GET_SHORT(ino,n); #ifdef DUFF #define MOVB *--dst = *--src if (m > 0) { register int loop = (m + 8 - 1) >> 3; switch (m & (8 - 1)) { case 0: do { MOVB; case 7: MOVB; case 6: MOVB; case 5: MOVB; case 4: MOVB; case 3: MOVB; case 2: MOVB; case 1: MOVB; } while (--loop); } } #else #ifdef MEMMOVE memmove(dst, src, m); #else while (m--) *--dst = *--src; #endif #endif /* * adjust offset index up */ while (i < n - 1) { PUT_SHORT(ino,i, GET_SHORT(ino,i + 2) + zoo); i++; } } PUT_SHORT(ino, 0, GET_SHORT(ino, 0) - 2); return 1; } /* * search for the key in the page. * return offset index in the range 0 < i < n. * return 0 if not found. */ static int seepair(pag, n, key, siz) char *pag; register int n; register char *key; register int siz; { register int i; register int off = PBLKSIZ; register short *ino = (short *) pag; for (i = 1; i < n; i += 2) { if (siz == off - GET_SHORT(ino,i) && memcmp(key, pag + GET_SHORT(ino,i), siz) == 0) return i; off = GET_SHORT(ino,i + 1); } return 0; } static void splpage(pag, new, sbit) char *pag; char *new; long sbit; { datum key; datum val; register int n; register int off = PBLKSIZ; char cur[PBLKSIZ]; register short *ino = (short *) cur; (void) memcpy(cur, pag, PBLKSIZ); (void) memset(pag, 0, PBLKSIZ); (void) memset(new, 0, PBLKSIZ); n = GET_SHORT(ino,0); for (ino++; n > 0; ino += 2) { key.dptr = cur + GET_SHORT(ino,0); key.dsize = off - GET_SHORT(ino,0); val.dptr = cur + GET_SHORT(ino,1); val.dsize = GET_SHORT(ino,0) - GET_SHORT(ino,1); /* * select the page pointer (by looking at sbit) and insert */ (void) putpair((exhash(key) & sbit) ? new : pag, key, val); off = GET_SHORT(ino,1); n -= 2; } debug(("%d split %d/%d\n", ((short *) cur)[0] / 2, ((short *) new)[0] / 2, ((short *) pag)[0] / 2)); } /* * check page sanity: * number of entries should be something * reasonable, and all offsets in the index should be in order. * this could be made more rigorous. */ static int chkpage(pag) char *pag; { register int n; register int off; register short *ino = (short *) pag; if ((n = GET_SHORT(ino,0)) < 0 || n > PBLKSIZ / sizeof(short)) return 0; if (n > 0) { off = PBLKSIZ; for (ino++; n > 0; ino += 2) { if (GET_SHORT(ino,0) > off || GET_SHORT(ino,1) > off || GET_SHORT(ino,1) > GET_SHORT(ino,0)) return 0; off = GET_SHORT(ino,1); n -= 2; } } return 1; } /* hash.c */ /* * sdbm - ndbm work-alike hashed database library * based on Per-Aake Larson's Dynamic Hashing algorithms. BIT 18 (1978). * author: oz@nexus.yorku.ca * status: public domain. keep it that way. * * hashing routine */ /* * polynomial conversion ignoring overflows * [this seems to work remarkably well, in fact better * then the ndbm hash function. Replace at your own risk] * use: 65599 nice. * 65587 even better. */ long dbm_hash(str, len) register char *str; register int len; { register unsigned long n = 0; #ifdef DUFF #define HASHC n = *str++ + 65599 * n if (len > 0) { register int loop = (len + 8 - 1) >> 3; switch(len & (8 - 1)) { case 0: do { HASHC; case 7: HASHC; case 6: HASHC; case 5: HASHC; case 4: HASHC; case 3: HASHC; case 2: HASHC; case 1: HASHC; } while (--loop); } } #else while (len--) n = ((*str++) & 255) + 65587L * n; #endif return n; } ruby-1.2.3/win32/sdbm.h100644 774 145 4320 6457557301 12606 0ustar matzNaCl/* * sdbm - ndbm work-alike hashed database library * based on Per-Ake Larson's Dynamic Hashing algorithms. BIT 18 (1978). * author: oz@nexus.yorku.ca * status: public domain. */ #ifndef _NDBM_H_ #define _NDBM_H_ #define DBLKSIZ 4096 #define PBLKSIZ 1024 #define PAIRMAX 1008 /* arbitrary on PBLKSIZ-N */ #define SPLTMAX 10 /* maximum allowed splits */ /* for a single insertion */ #define DIRFEXT ".dir" #define PAGFEXT ".pag" typedef struct { int dirf; /* directory file descriptor */ int pagf; /* page file descriptor */ int flags; /* status/error flags, see below */ long maxbno; /* size of dirfile in bits */ long curbit; /* current bit number */ long hmask; /* current hash mask */ long blkptr; /* current block for nextkey */ int keyptr; /* current key for nextkey */ long blkno; /* current page to read/write */ long pagbno; /* current page in pagbuf */ char pagbuf[PBLKSIZ]; /* page file block buffer */ long dirbno; /* current block in dirbuf */ char dirbuf[DBLKSIZ]; /* directory file block buffer */ } DBM; #define DBM_RDONLY 0x1 /* data base open read-only */ #define DBM_IOERR 0x2 /* data base I/O error */ /* * utility macros */ #define dbm_rdonly(db) ((db)->flags & DBM_RDONLY) #define dbm_error(db) ((db)->flags & DBM_IOERR) #define dbm_clearerr(db) ((db)->flags &= ~DBM_IOERR) /* ouch */ #define dbm_dirfno(db) ((db)->dirf) #define dbm_pagfno(db) ((db)->pagf) typedef struct { char *dptr; int dsize; } datum; extern datum nullitem; #if defined(__STDC__) || defined(MSDOS) #define proto(p) p #else #define proto(p) () #endif /* * flags to dbm_store */ #define DBM_INSERT 0 #define DBM_REPLACE 1 /* * ndbm interface */ extern DBM *dbm_open proto((char *, int, int)); extern void dbm_close proto((DBM *)); extern datum dbm_fetch proto((DBM *, datum)); extern int dbm_delete proto((DBM *, datum)); extern int dbm_store proto((DBM *, datum, datum, int)); extern datum dbm_firstkey proto((DBM *)); extern datum dbm_nextkey proto((DBM *)); /* * other */ extern DBM *dbm_prep proto((char *, char *, int, int)); extern long dbm_hash proto((char *, int)); #endif /* _NDBM_H_ */ ruby-1.2.3/x68/ 40755 774 145 0 6662164573 11102 5ustar matzNaClruby-1.2.3/x68/fconvert.c100644 774 145 3170 6457652076 13174 0ustar matzNaCl/* * PROJECT C Library, X68000 PROGRAMMING INTERFACE DEFINITION * -------------------------------------------------------------------- * This file is written by the Project C Library Group, and completely * in public domain. You can freely use, copy, modify, and redistribute * the whole contents, without this notice. * -------------------------------------------------------------------- * $Id: fconvert.c,v 1.1.1.1.4.1 1998/01/16 12:36:14 matz Exp $ */ /* changed 1997.2.3 by K.Okabe */ /* System headers */ #include #include /* Functions */ char *fconvert (double x, int ndigit, int *decpt, int *sign, char *buffer) { int pos, n; char *src, *dst; char string[24]; int figup; /* 18桁の文字列に変換 */ _dtos18 (x, decpt, sign, string); /* コピー元アドレスを設定 */ src = string; /* コピー先アドレスを設定 */ dst = buffer; /* 小数点位置を得る */ pos = *decpt; /* 小数点位置が負なら */ if (pos < 0) { /* 埋める桁数を計算 */ n = min (-pos, ndigit); /* 先頭を0で埋める */ while (n-- > 0) *dst++ = '0'; /* 小数点位置は0になる */ *decpt = 0; } /* 残りのコピー桁数 */ n = ndigit + pos; /* 格納先にコピー */ while (n-- > 0) { /* 足りない部分は0で埋める */ if (*src == '\0') { while (n-- >= 0) *dst++ = '0'; break; } /* 変換文字列からコピー */ *dst++ = *src++; } /* 丸める */ *decpt += (figup = _round (buffer, dst, *src)); /* 繰り上がりがあれば末尾に0を追加する */ if (figup) *dst++ = '0'; /* 終端に NUL を打つ */ *dst = '\0'; /* アドレスを返す */ return buffer; } ruby-1.2.3/x68/select.c100644 774 145 6266 6457652076 12636 0ustar matzNaCl/* * PROJECT C Library, X68000 PROGRAMMING INTERFACE DEFINITION * -------------------------------------------------------------------- * This file is written by the Project C Library Group, and completely * in public domain. You can freely use, copy, modify, and redistribute * the whole contents, without this notice. * -------------------------------------------------------------------- * $Id: select.c,v 1.1.1.1.4.1 1998/01/16 12:36:14 matz Exp $ */ #ifndef __IOCS_INLINE__ #define __IOCS_INLINE__ #define __DOS_INLINE__ #define __DOS_DOSCALL__ #endif /* System headers */ #include #include #include #include #include #include #include #if 0 #include #include #endif #include /* Macros */ #define XFD_ISSET(fd,fds) ((fds) && FD_ISSET ((fd), (fds))) #define isreadable(mode) ((mode) == O_RDONLY || (mode) == O_RDWR) #define iswritable(mode) ((mode) == O_WRONLY || (mode) == O_RDWR) #ifndef _POSIX_FD_SETSIZE #define _POSIX_FD_SETSIZE OPEN_MAX #endif /* Functions */ int select (int fds, fd_set *rfds, fd_set *wfds, fd_set *efds, struct timeval *timeout) { fd_set oread, owrite, oexcept; int ticks, start; int nfds; if (fds > _POSIX_FD_SETSIZE) { errno = EINVAL; return -1; } FD_ZERO (&oread); FD_ZERO (&owrite); FD_ZERO (&oexcept); nfds = 0; ticks = -1; if (timeout) { ticks = timeout->tv_sec * 100 + timeout->tv_usec / 10000; if (ticks < 0) { errno = EINVAL; return -1; } } start = _iocs_ontime (); for (;;) { { int fd; for (fd = 0; fd < fds; fd++) { int accmode; if (_fddb[fd].inuse == _FD_NOTUSED) continue; accmode = _fddb[fd].oflag & O_ACCMODE; if (isatty (fd)) { if (XFD_ISSET (fd, rfds) && isreadable (accmode) && _dos_k_keysns ()) { FD_SET (fd, &oread); nfds++; } if (XFD_ISSET (fd, wfds) && iswritable (accmode)) { FD_SET (fd, &owrite); nfds++; } } #if 0 else if (_fddb[fd].sockno >= 0) { if (XFD_ISSET (fd, rfds) && _socklen (_fddb[fd].sockno, 0)) { FD_SET (fd, &oread); nfds++; } if (XFD_ISSET (fd, wfds) /* && _socklen (_fddb[fd].sockno, 1) == 0 */) { FD_SET (fd, &owrite); nfds++; } } #endif else { if (XFD_ISSET (fd, rfds) && isreadable (accmode) && _dos_ioctrlis (fd)) { FD_SET (fd, &oread); nfds++; } if (XFD_ISSET (fd, wfds) && iswritable (accmode) && _dos_ioctrlos (fd)) { FD_SET (fd, &owrite); nfds++; } } } } { int rest; if ((rest = (_iocs_ontime () - start) % 8640000) < 0) rest += 8640000; if (nfds != 0) { if (ticks >= 0) { int left; if ((left = ticks - rest) < 0) left = 0; timeout->tv_sec = left / 100; timeout->tv_usec = (left % 100) * 10000; } if (rfds) *rfds = oread; if (wfds) *wfds = owrite; if (efds) *efds = oexcept; return nfds; } if (ticks >= 0 && rest > ticks) return 0; } _dos_change_pr (); } } ruby-1.2.3/x68/_dtos18.c100644 774 145 13122 6457652075 12644 0ustar matzNaCl/* * PROJECT C Library, X68000 PROGRAMMING INTERFACE DEFINITION * -------------------------------------------------------------------- * This file is written by the Project C Library Group, and completely * in public domain. You can freely use, copy, modify, and redistribute * the whole contents, without this notice. * -------------------------------------------------------------------- * $Id: _dtos18.c,v 1.1.1.1.4.1 1998/01/16 12:36:13 matz Exp $ */ /* System headers */ #include #include /* ** 本関数は浮動小数点を倍精度整数に変換してから文字列にするため、精度的には ** 倍精度整数に格納できる桁数までしか扱うことができない。したがって最高精度 ** は18桁である。 */ /* File scope variables */ static double _pos1[32] = { 1.0e+17, /* + 0 */ 1.0e+18, /* + 1 */ 1.0e+19, /* + 2 */ 1.0e+20, /* + 3 */ 1.0e+21, /* + 4 */ 1.0e+22, /* + 5 */ 1.0e+23, /* + 6 */ 1.0e+24, /* + 7 */ 1.0e+25, /* + 8 */ 1.0e+26, /* + 9 */ 1.0e+27, /* +10 */ 1.0e+28, /* +11 */ 1.0e+29, /* +12 */ 1.0e+30, /* +13 */ 1.0e+31, /* +14 */ 1.0e+32, /* +15 */ 1.0e+33, /* +16 */ 1.0e+34, /* +17 */ 1.0e+35, /* +18 */ 1.0e+36, /* +19 */ 1.0e+37, /* +20 */ 1.0e+38, /* +21 */ 1.0e+39, /* +22 */ 1.0e+40, /* +23 */ 1.0e+41, /* +24 */ 1.0e+42, /* +25 */ 1.0e+43, /* +26 */ 1.0e+44, /* +27 */ 1.0e+45, /* +28 */ 1.0e+46, /* +29 */ 1.0e+47, /* +30 */ 1.0e+48, /* +31 */ }; /* File scope variables */ static double _neg1[32] = { 1.0e+17, /* - 0 */ 1.0e+16, /* - 1 */ 1.0e+15, /* - 2 */ 1.0e+14, /* - 3 */ 1.0e+13, /* - 4 */ 1.0e+12, /* - 5 */ 1.0e+11, /* - 6 */ 1.0e+10, /* - 7 */ 1.0e+9, /* - 8 */ 1.0e+8, /* - 9 */ 1.0e+7, /* -10 */ 1.0e+6, /* -11 */ 1.0e+5, /* -12 */ 1.0e+4, /* -13 */ 1.0e+3, /* -14 */ 1.0e+2, /* -15 */ 1.0e+1, /* -16 */ 1.0e+0, /* -17 */ 1.0e-1, /* -18 */ 1.0e-2, /* -19 */ 1.0e-3, /* -20 */ 1.0e-4, /* -21 */ 1.0e-5, /* -22 */ 1.0e-6, /* -23 */ 1.0e-7, /* -24 */ 1.0e-8, /* -25 */ 1.0e-9, /* -26 */ 1.0e-10, /* -27 */ 1.0e-11, /* -28 */ 1.0e-12, /* -29 */ 1.0e-13, /* -30 */ 1.0e-14, /* -31 */ }; /* File scope variables */ static double _pos2[10] = { 1.0e+0, /* 000 */ 1.0e+32, /* 001 */ 1.0e+64, /* 010 */ 1.0e+96, /* 011 */ 1.0e+128, /* 100 */ 1.0e+160, /* 101 */ 1.0e+192, /* 110 */ 1.0e+224, /* 111 */ 1.0e+256, /* 1000 */ 1.0e+288, /* 1001 */ }; /* File scope variables */ static double _neg2[10] = { 1.0e-0, /* 000 */ 1.0e-32, /* 001 */ 1.0e-64, /* 010 */ 1.0e-96, /* 011 */ 1.0e-128, /* 100 */ 1.0e-160, /* 101 */ 1.0e-192, /* 110 */ 1.0e-224, /* 111 */ 1.0e-256, /* 1000 */ 1.0e-288, /* 1001 */ }; /* File scope functions */ static int _cmpd (double x, double y) { unsigned long vx, vy, rc; unsigned long *x_ptr = (unsigned long *) &x; unsigned long *y_ptr = (unsigned long *) &y; /* xの指数ビットを取り出す */ vx = x_ptr[0] & 0x7FF00000; /* yの指数ビットを取り出す */ vy = y_ptr[0] & 0x7FF00000; /* 指数ビットだけで判断する */ if ((rc = vy - vx) != 0) return rc; /* xの有効数字の上位ビットを取り出す */ vx = x_ptr[0] & 0x000FFFFF; /* yの有効数字の上位ビットを取り出す */ vy = y_ptr[0] & 0x000FFFFF; /* 上位ビットだけで判断する */ if ((rc = vy - vx) != 0) return rc; /* xの有効数字の下位ビットを取り出す */ vx = x_ptr[1]; /* yの有効数字の下位ビットを取り出す */ vy = y_ptr[1]; /* 最終判断 */ return vy - vx; } /* Functions */ void _dtos18 (double x, int *decpt, int *sign, char *buffer) { short e2; int e, n; /* 基数2の指数を求める(バイアスなしの状態) */ e2 = (((unsigned short *) &x)[0] & 0x7FF0U) >> 4; /* 指数が0の場合は±0.0チェック */ if (e2 == 0) { unsigned long hi = ((unsigned long *) &x)[0] & 0xFFFFF; unsigned long lo = ((unsigned long *) &x)[1]; /* 有効数字が全部0かどうか */ if (hi == 0 && lo == 0) { /* 文字列を設定 */ buffer[0] = '0'; /* NULを設定 */ buffer[1] = '\0'; /* 小数点位置を計算 */ *decpt = 1; /* 符号を計算 */ /* *sign = hi & 0x80000000UL; */ *sign = 0; /* 確定 */ return; } } /* 2の指数にバイアスをかけてから10の指数を概算 (approx. log10(2)) */ e = ((int) ((e2 - 1023) * 77)) >> 8; /* 指数が正の場合 */ if (e >= 0) { /* 指数が32より小さい場合はテーブル1から */ if (e < 32) x *= _neg1[e]; /* 指数が32より大きい場合はテーブル1,2から */ else x *= _neg1[e & 31] * _neg2[e >> 5]; } /* 指数が負の場合 */ else { /* 絶対値を計算 */ n = -e; /* 絶対値が32より小さい場合はテーブル1から */ if (n < 32) x *= _pos1[n]; /* 絶対値が32より大きい場合はテーブル1,2から */ else { x *= _pos1[n & 31]; x *= _pos2[n >> 5]; } } /* スケーリングしすぎた場合は戻す */ if (_cmpd (1.0e+18, x) >= 0) { e++; x *= 1.0e-1; } /* スケーリングし足りない場合は追加 */ else if (_cmpd (1.0e+17, x) < 0) { e--; x *= 1.0e+1; } /* 小数点位置を計算 */ *decpt = e + 1; /* 符号を計算 */ *sign = ((unsigned char *) &x)[0] & 0x80U; /* 文字列に変換 */ _ulltoa ((unsigned long long) x, buffer); } ruby-1.2.3/x68/_round.c100644 774 145 2013 6457652075 12626 0ustar matzNaCl/* * PROJECT C Library, X68000 PROGRAMMING INTERFACE DEFINITION * -------------------------------------------------------------------- * This file is written by the Project C Library Group, and completely * in public domain. You can freely use, copy, modify, and redistribute * the whole contents, without this notice. * -------------------------------------------------------------------- * $Id: _round.c,v 1.1.1.1.4.1 1998/01/16 12:36:13 matz Exp $ */ /* changed 1997.2.2 by K.Okabe */ /* System headers */ #include #include /* Functions */ int _round (char *top, char *cur, int undig) { char *ptr; /* 最後が5未満なら丸めは必要ない */ if (undig < '5') return 0; /* ポインタ設定 */ ptr = cur - 1; /* 先頭まで戻りながら丸め処理 */ while (ptr >= top) { /* 繰り上がらなければそれで終わり */ if (++(*ptr) <= '9') return 0; /* その桁を0に戻す */ *ptr-- = '0'; } /* 先頭を1にする */ *++ptr = '1'; /* 繰り上がりをしらせる */ return 1; }