pax_global_header00006660000000000000000000000064123317135620014515gustar00rootroot0000000000000052 comment=dcfb60b7f1a34e7c1c51e6660fe2d5cb7ed3685b ocaml-re-ocaml-re-1.2.2/000077500000000000000000000000001233171356200147135ustar00rootroot00000000000000ocaml-re-ocaml-re-1.2.2/.gitignore000066400000000000000000000001151233171356200167000ustar00rootroot00000000000000.*.swp _build/ *.bak setup.data setup.log setup.bin *.native *.byte *.docdir ocaml-re-ocaml-re-1.2.2/CHANGES000066400000000000000000000021741233171356200157120ustar00rootroot000000000000001.2.2 (05-May-2014): * Add a Re.whole_string convenience function to only match whole strings * Add a ?anchored parameter to functions in Re_glob to specify whole string matching * Document Re_glob module * Fix compilation of submatches occurring inside a Kleen star * Fix word boundary matching * Fix definition of Re.xdigit * Fix Re.exec_partial function * Fix compilation of patterns of the shape r1r2|r1r3 * Fixed compilation of re.cmxs (Vincent Bernardoff) * Improved matching of anchored regular expressions: stop as soon as we know there cannot possibly be any match. * Updated to OASIS 0.4.x (Vincent Bernardoff) * Add the linking exception to the license 1.2.1 (07-Apr-2013): * Correct OASIS metadata (Christophe Troestler). * Fix typo in Invalid_arg error message (Jeremy Yallop). 1.2.0 (15-Jan-2012): * Rename Pcre module to `Re_pcre` to make it more suitable for upstream packaging (it currently conflicts with the `Pcre` package). (Mehdi Dogguy). 1.1.0 (05-Sep-2012): * Add a basic Pcre wrapper around Re_perl for porting applications using that API (Thomas Gazagnaire). 1.0.0 (01-Aug-2012): * Initial public release. ocaml-re-ocaml-re-1.2.2/INSTALL000066400000000000000000000005251233171356200157460ustar00rootroot00000000000000 Requirements The installation procedure defined in the Makefile requires findlib (http://www.ocaml-programming.de/packages/documentation/findlib/). Installation - Compile with "make all". - If you have ocamlopt, do also "make opt". - Become super-user if necessary and do "make install" (A "make uninstall" removes the library.) ocaml-re-ocaml-re-1.2.2/LICENSE000066400000000000000000000655121233171356200157310ustar00rootroot00000000000000This Software is distributed under the terms of the GNU Lesser General Public License version 2.1 (included below), or (at your option) any later version. As a special exception to the GNU Library General Public License, you may link, statically or dynamically, a "work that uses the Library" with a publicly distributed version of the Library to produce an executable file containing portions of the Library, and distribute that executable file under terms of your choice, without any of the additional requirements listed in clause 6 of the GNU Library General Public License. By "a publicly distributed version of the Library", we mean either the unmodified Library, or a modified version of the Library that is distributed under the conditions defined in clause 3 of the GNU Library General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Library General Public License. ---------------------------------------------------------------------- GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, 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 library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete 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 distribute a copy of this License along with the Library. 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 Library or any portion of it, thus forming a work based on the Library, 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) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, 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 Library, 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 Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you 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. If distribution of 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 satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be 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. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library 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. 9. 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 Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library 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 with this License. 11. 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 Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library 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 Library. 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. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library 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. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library 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 Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, 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 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. 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 LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), 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 Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. 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) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! ocaml-re-ocaml-re-1.2.2/Makefile000066400000000000000000000010541233171356200163530ustar00rootroot00000000000000.PHONY: all clean install build all: build doc NAME=re setup.bin: setup.ml ocamlopt.opt -o $@ $< || ocamlopt -o $@ $< || ocamlc -o $@ $< rm -f setup.cmx setup.cmi setup.o setup.cmo setup.data: setup.bin ./setup.bin -configure build: setup.data setup.bin ./setup.bin -build doc: setup.data setup.bin ./setup.bin -doc install: setup.bin ./setup.bin -install test: setup.bin build ./setup.bin -test reinstall: setup.bin ocamlfind remove $(NAME) || true ./setup.bin -reinstall clean: ocamlbuild -clean rm -f setup.data setup.log setup.bin ocaml-re-ocaml-re-1.2.2/README.md000066400000000000000000000054451233171356200162020ustar00rootroot00000000000000Description =========== Re is a regular expression library for OCaml. Contact ======= This library has been written by Jerome Vouillon (Jerome.Vouillon@pps.univ-paris-diderot.fr). It can be downloaded from Bug reports, suggestions and contributions are welcome. Features ======== The following styles of regular expressions are supported: - Perl-style regular expressions (module `Re_perl`); - Posix extended regular expressions (module `Re_posix`); - Emacs-style regular expressions (module `Re_emacs`); - Shell-style file globbing (module `Re_glob`). It is also possible to build regular expressions by combining simpler regular expressions (module `Re`). The most notable missing features are **back-references** and look-ahead/look-behind **assertions**. There is also a subset of the PCRE interface available in the `Re.pcre` library. This makes it easier to port code from that library to Re without any changes beyond replacing the `pcre` findlib package with `re.pcre`. Performances ============ The matches are performed by lazily building a DFA (deterministic finite automaton) from the regular expression. As a consequence, matching takes linear time in the length of the matched string. The compilation of patterns is slower than with libraries using back-tracking, such as PCRE. But, once a large enough part of the DFA is built, matching is extremely fast. Of course, for some combinations of regular expression and string, the part of the DFA that needs to be build is so large that this point is never reached, and matching will be slow. This is not expected to happen often in practice, and actually a lot of expressions that behaves badly with a backtracking implementation are very efficient with this implementation. The library is at the moment entirely written in OCaml. As a consequence, regular expression matching is much slower when the library is compiled to bytecode than when it is compiled to native code. Here are some timing results (Pentium III 500Mhz): * Scanning a 1Mb string containing only `a`s, except for the last character which is a `b`, searching for the pattern `aa?b` (repeated 100 times): - RE: 2.6s - PCRE: 68s * Regular expression example from http://www.bagley.org/~doug/shootout/ [1] - RE: 0.43s - PCRE: 3.68s [1] this page is no longer up but is available via the Internet Archive http://web.archive.org/web/20010429190941/http://www.bagley.org/~doug/shootout/bench/regexmatch/ * The large regular expression (about 2000 characters long) that Unison uses with my preference file to decide whether a file should be ignored or not. This expression is matched against a filename about 20000 times. - RE: 0.31s - PCRE: 3.7s However, RE is only faster than PCRE when there are more than about 300 filenames. ocaml-re-ocaml-re-1.2.2/TODO.txt000066400000000000000000000046531233171356200162310ustar00rootroot00000000000000* To compile r{i,j} we need a sequence that does not match epsilon (or a constructor around an expression telling that this expression does not match epsilon) * A subexpression repeated by an asterisk ( '*' ) or an interval expression shall not match a null expression unless this is the only match for the repetition or it is necessary to satisfy the exact or minimum number of occurrences for the interval expression. * There might be a typo in deriv_1/delta_1: should we generate 'TMatch mark' or 'TMatch mark'? (neither is correct!) POSIX: "(a?)*" "b" "" "(a?)*" "ab" "a" "((a)|(b))*" "ab" -> "b" none "b" Str "(a?)*" "b" no submatch "(a?)*" "ab" "a" "((a)|(b))*" "ab" -> "b" "a" "b" Javascript "(a?)*" "b" no submatch "(a?)*" "ab" "a" "((a)|(b))*" "ab" -> "b" none "b" PCRE "(a?)*" "b" "" "(a?)*" "ab" "" "(a?)*?" "b" "" "(a?)*?" "ab" "a" "((a)|(b))*" "ab" -> "b" "a" "b" Emacs "(a?)*" "b" "" "(a?)*" "ab" "" "(a?)*?" "b" "" "(a?)*?" "ab" "a" "((a)|(b))*" "ab" -> "b" "a" "b" r{0,0} = eps r{i+1,j+1} = r,r{i,j} r{0,j+1} = r,r{0,j} | eps PCRE/Emacs r{0,j+1} = (r-eps},r{0,j} | eps JavaScript * Rewrite sequences of sequences when possible... High priority ============= * Improve the Perl regular expressions parser * Character classes (in the three regular expression parsers) * Reduce memory usage - More compact representation of character sequences - Special notation for "anything but this set of characters" (more generally, optimize the compilation of regular expressions) * Simple optimisations - alt containing alt - epsilon elimination - Seq (Seq (x,y), z) => Seq (x, Seq (y, z)) under some circumstances (x or y has a fixed length) ... * Test suite Medium priority =============== * Implement back-references * Implement look-ahead and look-behind assertions Low priority ============ * Optimize the main loop for processor that are not register starved * Rewrite the main loops in C (but keep the option to compile a pure OCaml version) * Limit the size of the cached DFAs by removing states that have not been used recently * Documentation Other ideas =========== * It would be great to have a more generic interface (parameterized over some abstract tokens). * Compile checked printers parameterized over match groups (DRY for literal subexpressions) ocaml-re-ocaml-re-1.2.2/_oasis000066400000000000000000000035341233171356200161200ustar00rootroot00000000000000OASISFormat: 0.4 Name: re Version: 1.2.1 Synopsis: Pure OCaml regular expression library Authors: Jerome Vouillon, Thomas Gazagnaire, Anil Madhavapeddy License: LGPL-2.0 with OCaml linking exception Plugins: META (0.4) BuildTools: ocamlbuild Library re Path: lib InternalModules: Cset, Automata Modules: Re Findlibname: re Library re_emacs Path: lib XMETADescription: Emacs-compatible regexps Modules: Re_emacs Findlibname: emacs FindlibParent: re BuildDepends: re Library re_str Path: lib XMETADescription: Str-compatible regexps Modules: Re_str Findlibname: str FindlibParent: re BuildDepends: re,re.emacs Library re_posix Path: lib Modules: Re_posix XMETADescription: POSIX-compatible regexps Findlibname: posix FindlibParent: re BuildDepends: re Library re_glob Path: lib Modules: Re_glob XMETADescription: Shell glob regexps Findlibname: glob FindlibParent: re BuildDepends: re Library re_perl Path: lib Modules: Re_perl XMETADescription: Perl-compatible regexps Findlibname: perl FindlibParent: re BuildDepends: re Library re_pcre Path: lib Modules: Re_pcre XMETADescription: subset of PCRE using the Re engine Findlibname: pcre FindlibParent: re BuildDepends: re, re.perl Executable re_match Path: lib_test MainIs: re_match.ml Build$: flag(tests) Custom: true CompiledObject: best Install: false BuildDepends: re Test re_match Run$: flag(tests) Command: $re_match WorkingDirectory: lib_test Document "re-api" Title: API reference for Re Type: ocamlbuild (0.3) Install: true InstallDir: $htmldir/api BuildTools: ocamldoc XOCamlbuildPath: ./lib XOCamlbuildLibraries: re, re.emacs, re.glob, re.posix, re.perl, re.str, re.pcre ocaml-re-ocaml-re-1.2.2/_tags000066400000000000000000000017651233171356200157440ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 765eea75f5a84e4963d39fb04771046f) # Ignore VCS directories, you can use the same kind of rule outside # OASIS_START/STOP if you want to exclude directories that contains # useless stuff for the build process <**/.svn>: -traverse <**/.svn>: not_hygienic ".bzr": -traverse ".bzr": not_hygienic ".hg": -traverse ".hg": not_hygienic ".git": -traverse ".git": not_hygienic "_darcs": -traverse "_darcs": not_hygienic # Library re "lib/re.cmxs": use_re # Library re_emacs "lib/re_emacs.cmxs": use_re_emacs # Library re_str "lib/re_str.cmxs": use_re_str : use_re_emacs # Library re_posix "lib/re_posix.cmxs": use_re_posix # Library re_glob "lib/re_glob.cmxs": use_re_glob # Library re_perl "lib/re_perl.cmxs": use_re_perl # Library re_pcre "lib/re_pcre.cmxs": use_re_pcre : use_re : use_re_perl # Executable re_match : use_re : use_re : custom # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/000077500000000000000000000000001233171356200154615ustar00rootroot00000000000000ocaml-re-ocaml-re-1.2.2/lib/META000066400000000000000000000036351233171356200161410ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 1967532634a185c8bdb782ac532c962d) version = "1.2.1" description = "Pure OCaml regular expression library" archive(byte) = "re.cma" archive(byte, plugin) = "re.cma" archive(native) = "re.cmxa" archive(native, plugin) = "re.cmxs" exists_if = "re.cma" package "str" ( version = "1.2.1" description = "Str-compatible regexps" requires = "re re.emacs" archive(byte) = "re_str.cma" archive(byte, plugin) = "re_str.cma" archive(native) = "re_str.cmxa" archive(native, plugin) = "re_str.cmxs" exists_if = "re_str.cma" ) package "posix" ( version = "1.2.1" description = "POSIX-compatible regexps" requires = "re" archive(byte) = "re_posix.cma" archive(byte, plugin) = "re_posix.cma" archive(native) = "re_posix.cmxa" archive(native, plugin) = "re_posix.cmxs" exists_if = "re_posix.cma" ) package "perl" ( version = "1.2.1" description = "Perl-compatible regexps" requires = "re" archive(byte) = "re_perl.cma" archive(byte, plugin) = "re_perl.cma" archive(native) = "re_perl.cmxa" archive(native, plugin) = "re_perl.cmxs" exists_if = "re_perl.cma" ) package "pcre" ( version = "1.2.1" description = "subset of PCRE using the Re engine" requires = "re re.perl" archive(byte) = "re_pcre.cma" archive(byte, plugin) = "re_pcre.cma" archive(native) = "re_pcre.cmxa" archive(native, plugin) = "re_pcre.cmxs" exists_if = "re_pcre.cma" ) package "glob" ( version = "1.2.1" description = "Shell glob regexps" requires = "re" archive(byte) = "re_glob.cma" archive(byte, plugin) = "re_glob.cma" archive(native) = "re_glob.cmxa" archive(native, plugin) = "re_glob.cmxs" exists_if = "re_glob.cma" ) package "emacs" ( version = "1.2.1" description = "Emacs-compatible regexps" requires = "re" archive(byte) = "re_emacs.cma" archive(byte, plugin) = "re_emacs.cma" archive(native) = "re_emacs.cmxa" archive(native, plugin) = "re_emacs.cmxs" exists_if = "re_emacs.cma" ) # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/automata.ml000066400000000000000000000442571233171356200176420ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) type sem = [ `Longest | `Shortest | `First ] type rep_kind = [ `Greedy | `Non_greedy ] type category = int type mark = int type idx = int type expr = { id : int; def : def } and def = Cst of Cset.t | Alt of expr list | Seq of sem * expr * expr | Eps | Rep of rep_kind * sem * expr | Mark of int | Erase of int * int | Before of category | After of category let def e = e.def type mark_offsets = (int * int) list type e = TSeq of e list * expr * sem | TExp of mark_offsets * expr | TMatch of mark_offsets (****) let print_kind ch k = Format.fprintf ch "%s" (match k with `Shortest -> "short" | `Longest -> "long" | `First -> "first") let rec print_expr ch e = match e.def with Cst l -> Format.fprintf ch "@[<3>(cst@ %a)@]" Cset.print l; | Alt l -> Format.fprintf ch "@[<3>(alt"; List.iter (fun e -> Format.fprintf ch "@ %a" print_expr e) l; Format.fprintf ch ")@]" | Seq (k, e, e') -> Format.fprintf ch "@[<3>(seq %a@ %a@ %a)@]" print_kind k print_expr e print_expr e' | Eps -> Format.fprintf ch "eps" | Rep (rk, k, e) -> Format.fprintf ch "@[<3>(rep@ %a %a)@]" print_kind k print_expr e | Mark i -> Format.fprintf ch "@[<3>(mark@ %d)@]" i | Erase (b, e) -> Format.fprintf ch "@[<3>(erase@ %d %d)@]" b e | Before c -> Format.fprintf ch "@[<3>(before@ %d)@]" c | After c -> Format.fprintf ch "@[<3>(after@ %d)@]" c let print_marks ch l = match l with [] -> () | (a, i) :: r -> Format.fprintf ch "%d-%d" a i; List.iter (fun (a, i) -> Format.fprintf ch " %d-%d" a i) r let rec print_state_rec ch e y = match e with TMatch marks -> Format.fprintf ch "@[<2>(Match@ %a)@]" print_marks marks | TSeq (l', x, kind) -> Format.fprintf ch "@[<2>(Seq@ "; print_state_lst ch l' x; Format.fprintf ch " %a)@]" print_expr x | TExp (marks, {def = Eps}) -> Format.fprintf ch "(Exp %d (%a) (eps))" y.id print_marks marks | TExp (marks, x) -> Format.fprintf ch "(Exp %d (%a) %a)" x.id print_marks marks print_expr x and print_state_lst ch l y = match l with [] -> Format.fprintf ch "()" | e :: rem -> print_state_rec ch e y; List.iter (fun e -> Format.fprintf ch " | "; print_state_rec ch e y) rem let print_state ch l = print_state_lst ch l { id = 0; def = Eps } (****) let rec first f l = match l with [] -> None | x :: r -> match f x with None -> first f r | Some _ as res -> res (****) type ids = int ref let create_ids () = ref 0 let eps_expr = { id = 0; def = Eps } let mk_expr ids def = incr ids; { id = !ids; def = def } let empty ids = mk_expr ids (Alt []) let cst ids s = if s = [] then empty ids else mk_expr ids (Cst s) let alt ids l = match l with [] -> empty ids | [c] -> c | l -> mk_expr ids (Alt l) let seq ids kind x y = match x.def, y.def with Alt [], _ -> x | _, Alt [] -> y | Eps, _ -> y | _, Eps when kind = `First -> x | _ -> mk_expr ids (Seq (kind, x, y)) let eps ids = mk_expr ids Eps let rep ids kind sem x = mk_expr ids (Rep (kind, sem, x)) let mark ids m = mk_expr ids (Mark m) let erase ids m m' = mk_expr ids (Erase (m, m')) let before ids c = mk_expr ids (Before c) let after ids c = mk_expr ids (After c) let texp marks x = TExp (marks, x) let tseq kind x y rem = match x with [] -> rem | [TExp (marks, {def = Eps})] -> TExp (marks, y) :: rem | _ -> TSeq (x, y, kind) :: rem (****) let rec rename ids x = match x.def with Cst _ | Eps | Mark _ | Erase _ | Before _ | After _ -> mk_expr ids x.def | Alt l -> mk_expr ids (Alt (List.map (rename ids) l)) | Seq (k, y, z) -> mk_expr ids (Seq (k, rename ids y, rename ids z)) | Rep (g, k, y) -> mk_expr ids (Rep (g, k, rename ids y)) (****) type hash = int type mark_infos = int array type status = [`Failed | `Match of mark_infos | `Running] type state = int * category * e list * status option ref * hash let dummy_state = (-1, -1, [], ref None, -1) let hash_combine h accu = accu * 65599 + h let rec hash_marks l accu = match l with [] -> accu | (a, i) :: r -> hash_marks r (hash_combine a (hash_combine i accu)) let rec hash_e l accu = match l with [] -> accu | TSeq (l', e, _) :: r -> hash_e r (hash_combine 0x172a1bce (hash_combine e.id (hash_e l' accu))) | TExp (marks, e) :: r -> hash_e r (hash_combine 0x2b4c0d77 (hash_combine e.id (hash_marks marks accu))) | TMatch marks :: r -> hash_e r (hash_combine 0x1c205ad5 (hash_marks marks accu)) let hash_state idx cat desc = hash_e desc (hash_combine idx (hash_combine cat 0)) land 0x3FFFFFFF let mk_state idx cat desc = (idx, cat, desc, ref None, hash_state idx cat desc) let create_state cat e = mk_state 0 cat [TExp ([], e)] let rec equal_e l1 l2 = match l1, l2 with [], [] -> true | TSeq (l1', e1, _) :: r1, TSeq (l2', e2, _) :: r2 -> e1.id = e2.id && equal_e l1' l2' && equal_e r1 r2 | TExp (marks1, e1) :: r1, TExp (marks2, e2) :: r2 -> e1.id = e2.id && marks1 = marks2 && equal_e r1 r2 | TMatch marks1 :: r1, TMatch marks2 :: r2 -> marks1 = marks2 && equal_e r1 r2 | _ -> false let equal_state (idx1, cat1, desc1, _, h1) (idx2, cat2, desc2, _, h2) = (h1 : int) = h2 && (idx1 : int) = idx2 && (cat1 : int) = cat2 && equal_e desc1 desc2 let compare_state (idx1, cat1, desc1, _, h1) (idx2, cat2, desc2, _, h2) = let c = compare (h1 : int) h2 in if c <> 0 then c else let c = compare (cat1 : int) cat2 in if c <> 0 then c else compare desc1 desc2 module States = Hashtbl.Make (struct type t = state let equal = equal_state let hash (_, _, _, _, h) = h end) (**** Find a free index ****) type working_area = bool array ref let create_working_area () = ref [| false |] let index_count w = Array.length !w let reset_table a = Array.fill a 0 (Array.length a) false let rec mark_used_indices tbl l = List.iter (fun x -> match x with TSeq (l, _, _) -> mark_used_indices tbl l | TExp (marks, _) -> List.iter (fun (_, i) -> if i >= 0 then tbl.(i) <- true) marks | TMatch marks -> List.iter (fun (_, i) -> if i >= 0 then tbl.(i) <- true) marks) l let rec find_free tbl idx len = if idx = len || not tbl.(idx) then idx else find_free tbl (idx + 1) len let free_index tbl_ref l = let tbl = !tbl_ref in reset_table tbl; mark_used_indices tbl l; let len = Array.length tbl in let idx = find_free tbl 0 len in if idx = len then tbl_ref := Array.make (2 * len) false; idx (**** Computation of the next state ****) let remove_matches l = List.filter (fun x -> match x with TMatch _ -> false | _ -> true) l let rec split_at_match_rec l' l = match l with [] -> assert false | TMatch _ :: r -> (List.rev l', remove_matches r) | x :: r -> split_at_match_rec (x :: l') r let split_at_match l = split_at_match_rec [] l let rec remove_duplicates prev l y = match l with [] -> ([], prev) | TMatch _ as x :: r -> (* Truncate after first match *) ([x], prev) | TSeq (l', x, kind) :: r -> let (l'', prev') = remove_duplicates prev l' x in let (r', prev'') = remove_duplicates prev' r y in (tseq kind l'' x r', prev'') | TExp (marks, {def = Eps}) as e :: r -> if List.memq y.id prev then remove_duplicates prev r y else let (r', prev') = remove_duplicates (y.id :: prev) r y in (e :: r', prev') | TExp (marks, x) as e :: r -> if List.memq x.id prev then remove_duplicates prev r y else let (r', prev') = remove_duplicates (x.id :: prev) r y in (e :: r', prev') let rec marks_set_idx used idx marks = match marks with (a, -1) :: rem -> used := true; (a, idx) :: marks_set_idx used idx rem | _ -> marks let rec set_idx used idx l = match l with [] -> [] | TMatch marks :: r -> TMatch (marks_set_idx used idx marks) :: set_idx used idx r | TSeq (l', x, kind) :: r -> TSeq (set_idx used idx l', x, kind) :: set_idx used idx r | TExp (marks, x) :: r -> TExp (marks_set_idx used idx marks, x) :: set_idx used idx r let rec filter_marks b e marks = List.filter (fun (i, _) -> i < b || i > e) marks let rec delta_1 marks c cat' cat x rem = (*Format.eprintf "%d@." x.id;*) match x.def with Cst s -> if Cset.mem c s then texp marks eps_expr :: rem else rem | Alt l -> delta_2 marks c cat' cat l rem | Seq (kind, y, z) -> let y' = delta_1 marks c cat' cat y [] in delta_seq c cat' cat kind y' z rem | Rep (rep_kind, kind, y) -> let y' = delta_1 marks c cat' cat y [] in let (y'', marks') = match first (fun x -> match x with TMatch marks -> Some marks | _ -> None) y' with None -> (y', marks) | Some marks' -> (remove_matches y', marks') in begin match rep_kind with `Greedy -> tseq kind y'' x (TMatch marks' :: rem) | `Non_greedy -> TMatch marks :: tseq kind y'' x rem end | Eps -> TMatch marks :: rem | Mark i -> TMatch ((i, -1) :: List.remove_assq i marks) :: rem | Erase (b, e) -> TMatch (filter_marks b e marks) :: rem | Before cat'' -> if cat land cat'' <> 0 then TMatch marks :: rem else rem | After cat'' -> if cat' land cat'' <> 0 then TMatch marks :: rem else rem and delta_2 marks c cat' cat l rem = match l with [] -> rem | y :: r -> delta_1 marks c cat' cat y (delta_2 marks c cat' cat r rem) and delta_seq c cat' cat kind y z rem = match first (fun x -> match x with TMatch marks -> Some marks | _ -> None) y with None -> tseq kind y z rem | Some marks -> match kind with `Longest -> tseq kind (remove_matches y) z (delta_1 marks c cat' cat z rem) | `Shortest -> delta_1 marks c cat' cat z (tseq kind (remove_matches y) z rem) | `First -> let (y', y'') = split_at_match y in tseq kind y' z (delta_1 marks c cat' cat z (tseq kind y'' z rem)) let rec delta_3 c cat' cat x rem = match x with TSeq (y, z, kind) -> let y' = delta_4 c cat' cat y [] in delta_seq c cat' cat kind y' z rem | TExp (marks, e) -> delta_1 marks c cat' cat e rem | TMatch _ -> x :: rem and delta_4 c cat' cat l rem = match l with [] -> rem | y :: r -> delta_3 c cat' cat y (delta_4 c cat' cat r rem) let delta tbl_ref cat' char (_, cat, expr, _, _) = let (expr', _) = remove_duplicates [] (delta_4 char cat cat' expr []) eps_expr in let idx = free_index tbl_ref expr' in let used = ref false in let expr'' = set_idx used idx expr' in mk_state idx cat' expr'' (****) let rec red_tr l = match l with [] | [_] -> l | ((s1, st1) as tr1) :: ((s2, st2) as tr2) :: rem -> if equal_state st1 st2 then red_tr ((Cset.union s1 s2, st1) :: rem) else tr1 :: red_tr (tr2 :: rem) let simpl_tr l = List.sort (fun (s1, _) (s2, _) -> compare s1 s2) (red_tr (List.sort (fun (_, st1) (_, st2) -> compare_state st1 st2) l)) (****) let rec prepend s x l = match s, l with [], _ -> l | _, [] -> [] | (c, c') :: r, ([d, d'], x') :: r' when c' < d -> prepend r x l | (c, c') :: r, ([d, d'], x') :: r' -> if c <= d then begin if c' < d' then ([d, c'], x @ x') :: prepend r x (([c' + 1, d'], x') :: r') else ([d, d'], x @ x') :: prepend s x r' end else begin if c > d' then ([d, d'], x') :: prepend s x r' else ([d, c - 1], x') :: prepend s x (([c, d'], x') :: r') end | _ -> assert false let prepend_deriv d l = List.fold_right (fun (s, x) l -> prepend s x l) d l let rec restrict s l = match l with [] -> [] | (s', x') :: rem -> let s'' = Cset.inter s s' in if s'' = [] then restrict s rem else (s'', x') :: restrict s rem let rec remove_marks b e rem = if b > e then rem else remove_marks b (e - 1) ((e, -2) :: rem) let rec merge_marks old nw = match nw with [] -> old | (i, v) :: rem -> let nw' = merge_marks (List.remove_assq i old) rem in if v = -2 then nw' else (i, v) :: nw' let rec prepend_marks_expr m e = match e with TSeq (l, e', s) -> TSeq (prepend_marks_expr_lst m l, e', s) | TExp (m', e') -> TExp (merge_marks m m', e') | TMatch m' -> TMatch (merge_marks m m') and prepend_marks_expr_lst m l = List.map (prepend_marks_expr m) l let prepend_marks (m : mark_offsets) l = List.map (fun (s, x) -> (s, prepend_marks_expr_lst m x)) l let rec deriv_1 all_chars categories marks cat x rem = match x.def with Cst s -> prepend s [texp marks eps_expr] rem | Alt l -> deriv_2 all_chars categories marks cat l rem | Seq (kind, y, z) -> let y' = deriv_1 all_chars categories marks cat y [(all_chars, [])] in deriv_seq all_chars categories cat kind y' z rem | Rep (rep_kind, kind, y) -> let y' = deriv_1 all_chars categories marks cat y [(all_chars, [])] in List.fold_right (fun (s, z) rem -> let (z', marks') = match first (fun z -> match z with TMatch marks -> Some marks | _ -> None) z with None -> (z, marks) | Some marks' -> (remove_matches z, marks') in prepend s (match rep_kind with `Greedy -> tseq kind z' x [TMatch marks'] | `Non_greedy -> TMatch marks :: tseq kind z' x []) rem) y' rem | Eps -> prepend all_chars [TMatch marks] rem | Mark i -> prepend all_chars [TMatch ((i, -1) :: List.remove_assq i marks)] rem | Erase (b, e) -> prepend all_chars [TMatch (remove_marks b e (filter_marks b e marks))] rem | Before cat' -> prepend (List.assq cat' categories) [TMatch marks] rem | After cat' -> if cat land cat' <> 0 then prepend all_chars [TMatch marks] rem else rem and deriv_2 all_chars categories marks cat l rem = match l with [] -> rem | y :: r -> deriv_1 all_chars categories marks cat y (deriv_2 all_chars categories marks cat r rem) and deriv_seq all_chars categories cat kind y z rem = if List.exists (fun (s, xl) -> List.exists (fun x -> match x with TMatch _ -> true | _ -> false) xl) y then let z' = deriv_1 all_chars categories [] cat z [(all_chars, [])] in List.fold_right (fun (s, y) rem -> match first (fun x -> match x with TMatch marks -> Some marks | _ -> None) y with None -> prepend s (tseq kind y z []) rem | Some marks -> let z'' = prepend_marks marks z' in match kind with `Longest -> prepend s (tseq kind (remove_matches y) z []) ( prepend_deriv (restrict s z'') rem) | `Shortest -> prepend_deriv (restrict s z'') ( prepend s (tseq kind (remove_matches y) z []) rem) | `First -> let (y', y'') = split_at_match y in prepend s (tseq kind y' z []) ( prepend_deriv (restrict s z'') ( prepend s (tseq kind y'' z []) rem))) y rem else List.fold_right (fun (s, xl) rem -> prepend s (tseq kind xl z []) rem) y rem let rec deriv_3 all_chars categories cat x rem = match x with TSeq (y, z, kind) -> let y' = deriv_4 all_chars categories cat y [(all_chars, [])] in deriv_seq all_chars categories cat kind y' z rem | TExp (marks, e) -> deriv_1 all_chars categories marks cat e rem | TMatch _ -> prepend all_chars [x] rem and deriv_4 all_chars categories cat l rem = match l with [] -> rem | y :: r -> deriv_3 all_chars categories cat y (deriv_4 all_chars categories cat r rem) let deriv tbl_ref all_chars categories (_, cat, expr, _, _) = let der = deriv_4 all_chars categories cat expr [(all_chars, [])] in simpl_tr (List.fold_right (fun (s, expr) rem -> let (expr', _) = remove_duplicates [] expr eps_expr in (* Format.eprintf "@[<3>@[%a@]: %a / %a@]@." Cset.print s print_state expr print_state expr'; *) let idx = free_index tbl_ref expr' in let used = ref false in let expr'' = set_idx used idx expr' in List.fold_right (fun (cat', s') rem -> let s'' = Cset.inter s s' in if s'' = [] then rem else (s'', mk_state idx cat' expr'') :: rem) categories rem) der []) (****) let flatten_match m = let ma = List.fold_left (fun ma (i, _) -> max ma i) (-1) m in let res = Array.create (ma + 1) (-1) in List.iter (fun (i, v) -> res.(i) <- v) m; res let status (_, _, desc, status, _) = match !status with Some st -> st | None -> let st = match desc with [] -> `Failed | TMatch m :: _ -> `Match (flatten_match m) | _ -> `Running in status := Some st; st ocaml-re-ocaml-re-1.2.2/lib/automata.mli000066400000000000000000000052171233171356200200040ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) (* Regular expressions *) type category = int type mark = int type sem = [ `Longest | `Shortest | `First ] type rep_kind = [ `Greedy | `Non_greedy ] type expr type def = Cst of Cset.t | Alt of expr list | Seq of sem * expr * expr | Eps | Rep of rep_kind * sem * expr | Mark of mark | Erase of mark * mark | Before of category | After of category val def : expr -> def val print_expr : Format.formatter -> expr -> unit type ids val create_ids : unit -> ids val cst : ids -> Cset.t -> expr val empty : ids -> expr val alt : ids -> expr list -> expr val seq : ids -> sem -> expr -> expr -> expr val eps : ids -> expr val rep : ids -> rep_kind -> sem -> expr -> expr val mark : ids -> mark -> expr val erase : ids -> mark -> mark -> expr val before : ids -> category -> expr val after : ids -> category -> expr val rename : ids -> expr -> expr (****) (* States of the automata *) type idx = int type mark_offsets = (mark * idx) list type e = TSeq of e list * expr * sem | TExp of mark_offsets * expr | TMatch of mark_offsets val print_state : Format.formatter -> e list -> unit type hash type mark_infos = int array type status = [`Failed | `Match of mark_infos | `Running] type state = idx * category * e list * status option ref * hash val dummy_state : state val mk_state : idx -> category -> e list -> state val create_state : category -> expr -> state module States : Hashtbl.S with type key = state (****) (* Computation of the states following a given state *) type working_area val create_working_area : unit -> working_area val index_count : working_area -> int val delta : working_area -> category -> Cset.c -> state -> state val deriv : working_area -> Cset.t -> (category * Cset.t) list -> state -> (Cset.t * state) list (****) val status : state -> status ocaml-re-ocaml-re-1.2.2/lib/cset.ml000066400000000000000000000056701233171356200167610ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) type c = int type t = (c * c) list let rec union l l' = match l, l' with _, [] -> l | [], _ -> l' | (c1, c2)::r, (c1', c2')::r' -> if c2 + 1 < c1' then (c1, c2)::union r l' else if c2' + 1 < c1 then (c1', c2')::union l r' else if c2 < c2' then union r ((min c1 c1', c2')::r') else union ((min c1 c1', c2)::r) r' let rec inter l l' = match l, l' with _, [] -> [] | [], _ -> [] | (c1, c2)::r, (c1', c2')::r' -> if c2 < c1' then inter r l' else if c2' < c1 then inter l r' else if c2 < c2' then (max c1 c1', c2)::inter r l' else (max c1 c1', c2')::inter l r' let rec diff l l' = match l, l' with _, [] -> l | [], _ -> [] | (c1, c2)::r, (c1', c2')::r' -> if c2 < c1' then (c1, c2)::diff r l' else if c2' < c1 then diff l r' else let r'' = if c2' < c2 then (c2' + 1, c2) :: r else r in if c1 < c1' then (c1, c1' - 1)::diff r'' r' else diff r'' r' let single c = [c, c] let add c l = union (single c) l let seq c c' = if c <= c' then [c, c'] else [c', c] let rec offset o l = match l with [] -> [] | (c1, c2) :: r -> (c1 + o, c2 + o) :: offset o r let empty = [] let rec mem (c : int) s = match s with [] -> false | (c1, c2) :: rem -> if c <= c2 then c >= c1 else mem c rem (****) type hash = int let rec hash_rec l = match l with [] -> 0 | (i, j)::r -> i + 13 * j + 257 * hash_rec r let hash l = (hash_rec l) land 0x3FFFFFFF module Map = Map.Make (struct type t = int * (int * int) list let compare (i, u) (j, v) = let c = compare i j in if c <> 0 then c else compare u v end) (****) let print_one ch c1 c2 = if c1 = c2 then Format.fprintf ch "@ %d" c1 else Format.fprintf ch "@ %d-%d" c1 c2 let print ch l = match l with [] -> () | (c1, c2) :: rem -> print_one ch c1 c2; List.iter (fun (c1, c2) -> Format.fprintf ch "@ "; print_one ch c1 c2) rem ocaml-re-ocaml-re-1.2.2/lib/cset.mli000066400000000000000000000024341233171356200171250ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) (* Character sets, represented as sorted list of intervals *) type c = int type t = (c * c) list val union : t -> t -> t val inter : t -> t -> t val diff : t -> t -> t val offset : int -> t -> t val empty : t val single : c -> t val seq : c -> c -> t val add : c -> t -> t val mem : c -> t -> bool type hash val hash : t -> hash module Map : Map.S with type key = hash * t val print : Format.formatter -> t -> unit ocaml-re-ocaml-re-1.2.2/lib/re-api.odocl000066400000000000000000000002101233171356200176510ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 6d7c6cc012fc4f435c31b8d8e968ddbd) Re Re_emacs Re_glob Re_posix Re_perl Re_str Re_pcre # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re.ml000066400000000000000000000715631233171356200164350ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) let rec first f l = match l with [] -> None | x :: r -> match f x with None -> first f r | Some _ as res -> res let rec iter n f v = if n = 0 then v else iter (n - 1) f (f v) (****) let unknown = -2 let break = -3 type 'a match_info = [ `Match of 'a | `Failed | `Running ] type state = { idx : int; (* Index of the current position in the position table. Not yet computed transitions point to a dummy state where [idx] is set to [unknown]; If [idx] is set to [break] for states that either always succeed or always fail. *) real_idx : int; (* The real index, in case [idx] is set to [break] *) next : state array; (* Transition table, indexed by color *) mutable final : (Automata.category * (Automata.idx * Automata.mark_infos match_info)) list; (* Mapping from the category of the next character to - the index where the next position should be saved - possibly, the list of marks (and the corresponding indices) corresponding to the best match *) desc : Automata.state (* Description of this state of the automata *) } (* Automata (compiled regular expression) *) type re = { initial : Automata.expr; (* The whole regular expression *) mutable initial_states : (int * state) list; (* Initial states, indexed by initial category *) cols : string; (* Color table *) col_repr : string; (* Table from colors to one character of this color *) ncol : int; (* Number of colors *) lnl : int; (* Color of the last newline *) mutable tbl : Automata.working_area; (* Temporary table used to compute the first available index when computing a new state *) states : state Automata.States.t; (* States of the deterministic automata *) group_count : int (* Number of groups in the regular expression *) } let print_re ch re = Automata.print_expr ch re.initial (* Information used during matching *) type info = { re : re; (* The automata *) i_cols : string; (* Color table ([x.i_cols = x.re.cols]) Sortcut used for performance reasons *) mutable positions : int array; (* Array of mark positions The mark are off by one for performance reasons *) mutable pos : int; (* Position where the match is started *) mutable last : int (* Position where the match should stop *) } (****) let cat_inexistant = 1 let cat_letter = 2 let cat_not_letter = 4 let cat_newline = 8 let cat_lastnewline = 16 let cat_search_boundary = 32 let category re c = if c = -1 then cat_inexistant else (* Special category for the last newline *) if c = re.lnl then cat_lastnewline lor cat_newline lor cat_not_letter else match re.col_repr.[c] with (* Should match [cword] definition *) 'a'..'z' | 'A'..'Z' | '0'..'9' | '_' | '\170' | '\181' | '\186' | '\192'..'\214' | '\216'..'\246' | '\248'..'\255' -> cat_letter | '\n' -> cat_not_letter lor cat_newline | _ -> cat_not_letter (****) let dummy_next = [||] let unknown_state = { idx = unknown; real_idx = 0; next = dummy_next; final = []; desc = Automata.dummy_state } let count = ref 0 let mk_state ncol ((idx, _, _, _, _) as desc) = let break_state = match Automata.status desc with `Running -> false | _ -> true in { idx = if break_state then break else idx; real_idx = idx; next = if break_state then dummy_next else Array.make ncol unknown_state; final = []; desc = desc } let find_state re desc = try Automata.States.find re.states desc with Not_found -> let st = mk_state re.ncol desc in Automata.States.add re.states desc st; st (**** Match with marks ****) let delta info cat c st = let (idx, _, _, _, _) as desc = Automata.delta info.re.tbl cat c st.desc in let len = Array.length info.positions in if idx = len && len > 0 then begin let pos = info.positions in info.positions <- Array.make (2 * len) 0; Array.blit pos 0 info.positions 0 len end; desc let validate info s pos st = let c = Char.code info.i_cols.[Char.code s.[pos]] in let cat = category info.re c in let desc' = delta info cat c st in let st' = find_state info.re desc' in st.next.(c) <- st' (* let rec loop info s pos st = if pos < info.last then let st' = st.next.(Char.code info.i_cols.[Char.code s.[pos]]) in let idx = st'.idx in if idx >= 0 then begin info.positions.(idx) <- pos; loop info s (pos + 1) st' end else if idx = break then begin info.positions.(st'.real_idx) <- pos; st' end else begin (* Unknown *) validate info s pos st; loop info s pos st end else st *) let rec loop info s pos st = if pos < info.last then let st' = st.next.(Char.code info.i_cols.[Char.code s.[pos]]) in loop2 info s pos st st' else st and loop2 info s pos st st' = let idx = st'.idx in if idx >= 0 then begin let pos = pos + 1 in if pos < info.last then begin (* It is important to place these reads before the write *) (* But then, we don't have enough registers left to store the right position. So, we store the position plus one. *) let st'' = st'.next.(Char.code info.i_cols.[Char.code s.[pos]]) in info.positions.(idx) <- pos; loop2 info s pos st' st'' end else begin info.positions.(idx) <- pos; st' end end else if idx = break then begin info.positions.(st'.real_idx) <- pos + 1; st' end else begin (* Unknown *) validate info s pos st; loop info s pos st end let rec loop_no_mark info s pos last st = if pos < last then let st' = st.next.(Char.code info.i_cols.[Char.code s.[pos]]) in let idx = st'.idx in if idx >= 0 then loop_no_mark info s (pos + 1) last st' else if idx = break then st' else begin (* Unknown *) validate info s pos st; loop_no_mark info s pos last st end else st let final info st cat = try List.assq cat st.final with Not_found -> let (idx, _, _, _, _) as st' = delta info cat (-1) st in let res = (idx, Automata.status st') in st.final <- (cat, res) :: st.final; res let find_initial_state re cat = try List.assq cat re.initial_states with Not_found -> let st = find_state re (Automata.create_state cat re.initial) in re.initial_states <- (cat, st) :: re.initial_states; st let dummy_substrings = `Match ("", [], [||], 0) let get_color re s pos = if pos < 0 then -1 else let slen = String.length s in if pos >= slen then -1 else (* Special case for the last newline *) if pos = slen - 1 && re.lnl <> -1 && s.[pos] = '\n' then re.lnl else Char.code re.cols.[Char.code s.[pos]] let rec handle_last_newline info pos st groups = let st' = st.next.(info.re.lnl) in let idx = st'.idx in if idx >= 0 then begin if groups then info.positions.(idx) <- pos + 1; st' end else if idx = break then begin if groups then info.positions.(st'.real_idx) <- pos + 1; st' end else begin (* Unknown *) let c = info.re.lnl in let real_c = Char.code info.i_cols.[Char.code '\n'] in let cat = category info.re c in let desc' = delta info cat real_c st in let st' = find_state info.re desc' in st.next.(c) <- st'; handle_last_newline info pos st groups end let rec scan_str info s initial_state groups = let pos = info.pos in let last = info.last in if last = String.length s && info.re.lnl <> -1 && last > pos && s.[last - 1] = '\n' then begin info.last <- last - 1; let st = scan_str info s initial_state groups in if st.idx = break then st else handle_last_newline info (last - 1) st groups end else if groups then loop info s pos initial_state else loop_no_mark info s pos last initial_state let match_str groups partial re s pos len = let slen = String.length s in let last = if len = -1 then slen else pos + len in let info = { re = re; i_cols = re.cols; pos = pos; last = last; positions = if groups then begin let n = Automata.index_count re.tbl + 1 in if n <= 10 then [|0;0;0;0;0;0;0;0;0;0|] else Array.make n 0 end else [||] } in let initial_cat = if pos = 0 then cat_search_boundary lor cat_inexistant else cat_search_boundary lor category re (get_color re s (pos - 1)) in let initial_state = find_initial_state re initial_cat in let st = scan_str info s initial_state groups in let res = if st.idx = break || partial then Automata.status st.desc else let final_cat = if last = slen then cat_search_boundary lor cat_inexistant else cat_search_boundary lor category re (get_color re s last) in let (idx, res) = final info st final_cat in if groups then info.positions.(idx) <- last + 1; res in match res with `Match m -> `Match (s, m, info.positions, re.group_count) | (`Failed | `Running) as res -> res let mk_re init cols col_repr ncol lnl group_count = { initial = init; initial_states = []; cols = cols; col_repr = col_repr; ncol = ncol; lnl = lnl; tbl = Automata.create_working_area (); states = Automata.States.create 97; group_count = group_count } (**** Character sets ****) let cany = [0, 255] let cseq c c' = Cset.seq (Char.code c) (Char.code c') let cadd c s = Cset.add (Char.code c) s let csingle c = Cset.single (Char.code c) let rec interval i j = if i > j then [] else i :: interval (i + 1) j let rec cset_hash_rec l = match l with [] -> 0 | (i, j)::r -> i + 13 * j + 257 * cset_hash_rec r let cset_hash l = (cset_hash_rec l) land 0x3FFFFFFF module CSetMap = Map.Make (struct type t = int * (int * int) list let compare (i, u) (j, v) = let c = compare i j in if c <> 0 then c else compare u v end) let trans_set cache cm s = match s with [i, j] when i = j -> csingle cm.[i] | _ -> let v = (cset_hash_rec s, s) in try CSetMap.find v !cache with Not_found -> let l = List.fold_right (fun (i, j) l -> Cset.union (cseq cm.[i] cm.[j]) l) s Cset.empty in cache := CSetMap.add v l !cache; l (****) type sem_status = Compulsory | Indicative type regexp = Set of Cset.t | Sequence of regexp list | Alternative of regexp list | Repeat of regexp * int * int option | Beg_of_line | End_of_line | Beg_of_word | End_of_word | Not_bound | Beg_of_str | End_of_str | Last_end_of_line | Start | Stop | Sem of Automata.sem * regexp | Sem_greedy of Automata.rep_kind * regexp | Group of regexp | No_group of regexp | Nest of regexp | Case of regexp | No_case of regexp | Intersection of regexp list | Complement of regexp list | Difference of regexp * regexp let rec is_charset r = match r with Set _ -> true | Alternative l | Intersection l | Complement l -> List.for_all is_charset l | Difference (r, r') -> is_charset r && is_charset r' | Sem (_, r) | Sem_greedy (_, r) | No_group r | Case r | No_case r -> is_charset r | Sequence _ | Repeat _ | Beg_of_line | End_of_line | Beg_of_word | End_of_word | Beg_of_str | End_of_str | Not_bound | Last_end_of_line | Start | Stop | Group _ | Nest _ -> false (**** Colormap ****) (*XXX Use a better algorithm allowing non-contiguous regions? *) let rec split s cm = match s with [] -> () | (i, j)::r -> cm.[i] <- '\001'; cm.[j + 1] <- '\001'; split r cm let cupper = Cset.union (cseq 'A' 'Z') (Cset.union (cseq '\192' '\214') (cseq '\216' '\222')) let clower = Cset.offset 32 cupper let calpha = List.fold_right cadd ['\170'; '\181'; '\186'; '\223'; '\255'] (Cset.union clower cupper) let cdigit = cseq '0' '9' let calnum = Cset.union calpha cdigit let cword = cadd '_' calnum let rec colorize c regexp = let lnl = ref false in let rec colorize regexp = match regexp with Set s -> split s c | Sequence l -> List.iter colorize l | Alternative l -> List.iter colorize l | Repeat (r, _, _) -> colorize r | Beg_of_line | End_of_line -> split (csingle '\n') c | Beg_of_word | End_of_word | Not_bound -> split cword c | Beg_of_str | End_of_str | Start | Stop -> () | Last_end_of_line -> lnl := true | Sem (_, r) | Sem_greedy (_, r) | Group r | No_group r | Nest r -> colorize r | Case _ | No_case _ | Intersection _ | Complement _ | Difference _ -> assert false in colorize regexp; !lnl let make_cmap () = String.make 257 '\000' let flatten_cmap cm = let c = String.create 256 in let col_repr = String.create 256 in let v = ref 0 in c.[0] <- '\000'; col_repr.[0] <- '\000'; for i = 1 to 255 do if cm.[i] <> '\000' then incr v; c.[i] <- Char.chr !v; col_repr.[!v] <- Char.chr i done; (c, String.sub col_repr 0 (!v + 1), !v + 1) (**** Compilation ****) let rec equal x1 x2 = match x1, x2 with Set s1, Set s2 -> s1 = s2 | Sequence l1, Sequence l2 -> eq_list l1 l2 | Alternative l1, Alternative l2 -> eq_list l1 l2 | Repeat (x1', i1, j1), Repeat (x2', i2, j2) -> i1 = i2 && j1 = j2 && equal x1' x2' | Beg_of_line, Beg_of_line | End_of_line, End_of_line | Beg_of_word, Beg_of_word | End_of_word, End_of_word | Not_bound, Not_bound | Beg_of_str, Beg_of_str | End_of_str, End_of_str | Last_end_of_line, Last_end_of_line | Start, Start | Stop, Stop -> true | Sem (sem1, x1'), Sem (sem2, x2') -> sem1 = sem2 && equal x1' x2' | Sem_greedy (k1, x1'), Sem_greedy (k2, x2') -> k1 = k2 && equal x1' x2' | Group _, Group _ -> (* Do not merge groups! *) false | No_group x1', No_group x2' -> equal x1' x2' | Nest x1', Nest x2' -> equal x1' x2' | Case x1', Case x2' -> equal x1' x2' | No_case x1', No_case x2' -> equal x1' x2' | Intersection l1, Intersection l2 -> eq_list l1 l2 | Complement l1, Complement l2 -> eq_list l1 l2 | Difference (x1', x1''), Difference (x2', x2'') -> equal x1' x2' && equal x1'' x2'' | _ -> false and eq_list l1 l2 = match l1, l2 with [], [] -> true | x1 :: r1, x2 :: r2 -> equal x1 x2 && eq_list r1 r2 | _ -> false let sequence l = match l with [x] -> x | l -> Sequence l let rec merge_sequences l = match l with [] -> l | Alternative l' :: r -> merge_sequences (l' @ r) | Sequence (x :: y) :: r -> begin match merge_sequences r with Sequence (x' :: y') :: r' when equal x x' -> Sequence [x; Alternative [sequence y; sequence y']] :: r' | r' -> Sequence (x :: y) :: r' end | x :: r -> x :: merge_sequences r module A = Automata let enforce_kind ids kind kind' cr = match kind, kind' with `First, `First -> cr | `First, k -> A.seq ids k cr (A.eps ids) | _ -> cr (* XXX should probably compute a category mask *) let rec translate ids kind ign_group ign_case greedy pos cache c r = match r with Set s -> (A.cst ids (trans_set cache c s), kind) | Sequence l -> (trans_seq ids kind ign_group ign_case greedy pos cache c l, kind) | Alternative l -> begin match merge_sequences l with [r'] -> let (cr, kind') = translate ids kind ign_group ign_case greedy pos cache c r' in (enforce_kind ids kind kind' cr, kind) | l' -> (A.alt ids (List.map (fun r' -> let (cr, kind') = translate ids kind ign_group ign_case greedy pos cache c r' in enforce_kind ids kind kind' cr) (merge_sequences l)), kind) end | Repeat (r', i, j) -> let (cr, kind') = translate ids kind ign_group ign_case greedy pos cache c r' in let rem = match j with None -> A.rep ids greedy kind' cr | Some j -> let f = match greedy with `Greedy -> fun rem -> A.alt ids [A.seq ids kind' (A.rename ids cr) rem; A.eps ids] | `Non_greedy -> fun rem -> A.alt ids [A.eps ids; A.seq ids kind' (A.rename ids cr) rem] in iter (j - i) f (A.eps ids) in (iter i (fun rem -> A.seq ids kind' (A.rename ids cr) rem) rem, kind) | Beg_of_line -> (A.after ids (cat_inexistant lor cat_newline), kind) | End_of_line -> (A.before ids (cat_inexistant lor cat_newline), kind) | Beg_of_word -> (A.seq ids `First (A.after ids (cat_inexistant lor cat_not_letter)) (A.before ids (cat_inexistant lor cat_letter)), kind) | End_of_word -> (A.seq ids `First (A.after ids (cat_inexistant lor cat_letter)) (A.before ids (cat_inexistant lor cat_not_letter)), kind) | Not_bound -> (A.alt ids [A.seq ids `First (A.after ids cat_letter) (A.before ids cat_letter); A.seq ids `First (A.after ids cat_letter) (A.before ids cat_letter)], kind) | Beg_of_str -> (A.after ids cat_inexistant, kind) | End_of_str -> (A.before ids cat_inexistant, kind) | Last_end_of_line -> (A.before ids (cat_inexistant lor cat_lastnewline), kind) | Start -> (A.after ids cat_search_boundary, kind) | Stop -> (A.before ids cat_search_boundary, kind) | Sem (kind', r') -> let (cr, kind'') = translate ids kind' ign_group ign_case greedy pos cache c r' in (enforce_kind ids kind' kind'' cr, kind') | Sem_greedy (greedy', r') -> translate ids kind ign_group ign_case greedy' pos cache c r' | Group r' -> if ign_group then translate ids kind ign_group ign_case greedy pos cache c r' else let p = !pos in pos := !pos + 2; let (cr, kind') = translate ids kind ign_group ign_case greedy pos cache c r' in (A.seq ids `First (A.mark ids p) ( A.seq ids `First cr (A.mark ids (p + 1))), kind') | No_group r' -> translate ids kind true ign_case greedy pos cache c r' | Nest r' -> let b = !pos in let (cr, kind') = translate ids kind ign_group ign_case greedy pos cache c r' in let e = !pos - 1 in if e < b then (cr, kind') else (A.seq ids `First (A.erase ids b e) cr, kind') | Difference _ | Complement _ | Intersection _ | No_case _ | Case _ -> assert false and trans_seq ids kind ign_group ign_case greedy pos cache c l = match l with [] -> A.eps ids | [r] -> let (cr', kind') = translate ids kind ign_group ign_case greedy pos cache c r in enforce_kind ids kind kind' cr' | r :: rem -> let (cr', kind') = translate ids kind ign_group ign_case greedy pos cache c r in let cr'' = trans_seq ids kind ign_group ign_case greedy pos cache c rem in if A.def cr'' = A.Eps then cr' else if A.def cr' = A.Eps then cr'' else A.seq ids kind' cr' cr'' (**** Case ****) let case_insens s = Cset.union s (Cset.union (Cset.offset 32 (Cset.inter s cupper)) (Cset.offset (-32) (Cset.inter s clower))) let as_set r = match r with Set s -> s | _ -> assert false (* XXX Should split alternatives into (1) charsets and (2) more complex regular expressions; alternative should therefore probably be flatten here *) let rec handle_case ign_case r = match r with Set s -> Set (if ign_case then case_insens s else s) | Sequence l -> Sequence (List.map (handle_case ign_case) l) | Alternative l -> let l' = List.map (handle_case ign_case) l in if is_charset (Alternative l') then Set (List.fold_left (fun s r -> Cset.union s (as_set r)) Cset.empty l') else Alternative l' | Repeat (r, i, j) -> Repeat (handle_case ign_case r, i, j) | Beg_of_line | End_of_line | Beg_of_word | End_of_word | Not_bound | Beg_of_str | End_of_str | Last_end_of_line | Start | Stop -> r | Sem (k, r) -> let r' = handle_case ign_case r in if is_charset r' then r' else Sem (k, r') | Sem_greedy (k, r) -> let r' = handle_case ign_case r in if is_charset r' then r' else Sem_greedy (k, r') | Group r -> Group (handle_case ign_case r) | No_group r -> let r' = handle_case ign_case r in if is_charset r' then r' else No_group r' | Nest r -> let r' = handle_case ign_case r in if is_charset r' then r' else Nest r' | Case r -> handle_case false r | No_case r -> handle_case true r | Intersection l -> let l' = List.map (fun r -> handle_case ign_case r) l in Set (List.fold_left (fun s r -> Cset.inter s (as_set r)) cany l') | Complement l -> let l' = List.map (fun r -> handle_case ign_case r) l in Set (Cset.diff cany (List.fold_left (fun s r -> Cset.union s (as_set r)) Cset.empty l')) | Difference (r, r') -> Set (Cset.inter (as_set (handle_case ign_case r)) (Cset.diff cany (as_set (handle_case ign_case r')))) (****) let compile_1 regexp = let regexp = handle_case false regexp in let c = make_cmap () in let need_lnl = colorize c regexp in let (col, col_repr, ncol) = flatten_cmap c in let lnl = if need_lnl then ncol else -1 in let ncol = if need_lnl then ncol + 1 else ncol in let ids = A.create_ids () in let pos = ref 0 in let (r, kind) = translate ids `First false false `Greedy pos (ref CSetMap.empty) col regexp in let r = enforce_kind ids `First kind r in (*Format.eprintf "<%d %d>@." !ids ncol;*) mk_re r col col_repr ncol lnl (!pos / 2) (****) let rec anchored r = match r with | Sequence l -> List.exists anchored l | Alternative l -> List.for_all anchored l | Repeat (r, i, _) -> i > 0 && anchored r | Set _ | Beg_of_line | End_of_line | Beg_of_word | End_of_word | Not_bound | End_of_str | Last_end_of_line | Stop | Intersection _ | Complement _ | Difference _ -> false | Beg_of_str | Start -> true | Sem (_, r) | Sem_greedy (_, r) | Group r | No_group r | Nest r | Case r | No_case r -> anchored r (****) type t = regexp let str s = let l = ref [] in for i = String.length s - 1 downto 0 do l := Set (csingle s.[i]) :: !l done; Sequence !l let char c = Set (csingle c) let alt l = match l with [r] -> r | _ -> Alternative l let seq l = match l with [r] -> r | _ -> Sequence l let empty = alt [] let epsilon = seq [] let repn r i j = if i < 0 then invalid_arg "Re.repn"; begin match j with Some j when j < i -> invalid_arg "Re.repn" | _ -> () end; Repeat (r, i, j) let rep r = repn r 0 None let rep1 r = repn r 1 None let opt r = repn r 0 (Some 1) let bol = Beg_of_line let eol = End_of_line let bow = Beg_of_word let eow = End_of_word let word r = seq [bow; r; eow] let not_boundary = Not_bound let bos = Beg_of_str let eos = End_of_str let whole_string r = seq [bos; r; eos] let leol = Last_end_of_line let start = Start let stop = Stop let longest r = Sem (`Longest, r) let shortest r = Sem (`Shortest, r) let first r = Sem (`First, r) let greedy r = Sem_greedy (`Greedy, r) let non_greedy r = Sem_greedy (`Non_greedy, r) let group r = Group r let no_group r = No_group r let nest r = Nest r let set str = let s = ref [] in for i = 0 to String.length str - 1 do s := Cset.union (csingle str.[i]) !s done; Set !s let rg c c' = Set (cseq c c') let inter l = let r = Intersection l in if is_charset r then r else invalid_arg "Re.inter" let compl l = let r = Complement l in if is_charset r then r else invalid_arg "Re.compl" let diff r r' = let r'' = Difference (r, r') in if is_charset r'' then r'' else invalid_arg "Re.diff" let any = Set cany let notnl = Set (Cset.diff cany (csingle '\n')) let lower = alt [rg 'a' 'z'; char '\181'; rg '\223' '\246'; rg '\248' '\255'] let upper = alt [rg 'A' 'Z'; rg '\192' '\214'; rg '\216' '\222'] let alpha = alt [lower; upper; char '\170'; char '\186'] let digit = rg '0' '9' let alnum = alt [alpha; digit] let ascii = rg '\000' '\127' let blank = set "\t " let cntrl = alt [rg '\000' '\031'; rg '\127' '\159'] let graph = alt [rg '\033' '\126'; rg '\160' '\255'] let print = alt [rg '\032' '\126'; rg '\160' '\255'] let punct = alt [rg '\033' '\047'; rg '\058' '\064'; rg '\091' '\096'; rg '\123' '\126'; rg '\160' '\169'; rg '\171' '\180'; rg '\182' '\185'; rg '\187' '\191'; char '\215'; char '\247'] let space = alt [char ' '; rg '\009' '\013'] let xdigit = alt [digit; rg 'a' 'f'; rg 'A' 'F'] let case r = Case r let no_case r = No_case r (****) type substrings = (string * Automata.mark_infos * int array * int) let compile r = compile_1 (if anchored r then group r else seq [shortest (rep any); group r]) let exec ?(pos = 0) ?(len = -1) re s = if pos < 0 || len < -1 || pos + len > String.length s then invalid_arg "Re.exec"; match match_str true false re s pos len with `Match substr -> substr | _ -> raise Not_found let execp ?(pos = 0) ?(len = -1) re s = if pos < 0 || len < -1 || pos + len > String.length s then invalid_arg "Re.execp"; match match_str false false re s pos len with `Match substr -> true | _ -> false let exec_partial ?(pos = 0) ?(len = -1) re s = if pos < 0 || len < -1 || pos + len > String.length s then invalid_arg "Re.exec_partial"; match match_str false true re s pos len with `Match _ -> `Full | `Running -> `Partial | `Failed -> `Mismatch let rec find_mark (i : int) l = match l with [] -> raise Not_found | (j, idx) :: r -> if i = j then idx else find_mark i r let get (s, marks, pos, _) i = if 2 * i + 1 >= Array.length marks then raise Not_found; let m1 = marks.(2 * i) in if m1 = -1 then raise Not_found; let p1 = pos.(m1) - 1 in let p2 = pos.(marks.(2 * i + 1)) - 1 in String.sub s p1 (p2 - p1) let get_ofs (s, marks, pos, _) i = if 2 * i + 1 >= Array.length marks then raise Not_found; let m1 = marks.(2 * i) in if m1 = -1 then raise Not_found; let p1 = pos.(m1) - 1 in let p2 = pos.(marks.(2 * i + 1)) - 1 in (p1, p2) let test (s, marks, pos, _) i = if 2 * i >= Array.length marks then false else let idx = marks.(2 * i) in idx <> -1 let dummy_offset = (-1, -1) let get_all_ofs (s, marks, pos, count) = let res = Array.make count dummy_offset in for i = 0 to Array.length marks / 2 - 1 do let m1 = marks.(2 * i) in if m1 <> -1 then begin let p1 = pos.(m1) in let p2 = pos.(marks.(2 * i + 1)) in res.(i) <- (p1 - 1, p2 - 1) end done; res let dummy_string = "" let get_all (s, marks, pos, count) = let res = Array.make count dummy_string in for i = 0 to Array.length marks / 2 - 1 do let m1 = marks.(2 * i) in if m1 <> -1 then begin let p1 = pos.(m1) in let p2 = pos.(marks.(2 * i + 1)) in res.(i) <- String.sub s (p1 - 1) (p2 - p1) end done; res (**********************************) (* Information about the previous character: - does not exists - is a letter - is not a letter - is a newline - is last newline Beginning of word: - previous is not a letter or does not exist - current is a letter or does not exist End of word: - previous is a letter or does not exist - current is not a letter or does not exist Beginning of line: - previous is a newline or does not exist Beginning of buffer: - previous does not exist End of buffer - current does not exist End of line - current is a newline or does not exist *) (* Rep: e = T,e | () - semantics of the comma (shortest/longest/first) - semantics of the union (greedy/non-greedy) Bounded repetition a{0,3} = (a,(a,a?)?)? *) ocaml-re-ocaml-re-1.2.2/lib/re.mldylib000066400000000000000000000001451233171356200174450ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 0a7dd4de0a81b2a07f8b93c4915dfbc9) Re Cset Automata # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re.mli000066400000000000000000000116671233171356200166050ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) type t (* Regular expression *) type re (* Compiled regular expression *) type substrings (* Match informations *) (* Compilation and execution of a regular expression *) val compile : t -> re val exec : ?pos:int -> (* Default: 0 *) ?len:int -> (* Default: -1 (until end of string) *) re -> string -> substrings val execp : ?pos:int -> (* Default: 0 *) ?len:int -> (* Default: -1 (until end of string) *) re -> string -> bool val exec_partial : ?pos:int -> (* Default: 0 *) ?len:int -> (* Default: -1 (until end of string) *) re -> string -> [ `Full | `Partial | `Mismatch ] (* Substring extraction *) val get : substrings -> int -> string (* Raise [Not_found] if the group did not match *) val get_ofs : substrings -> int -> int * int (* Raise [Not_found] if the group did not match *) val get_all : substrings -> string array (* Return the empty string for each group which did not match *) val get_all_ofs : substrings -> (int * int) array (* Return [(-1,-1)] for each group which did not match *) val test : substrings -> int -> bool (* Test whether a group matched *) (* String expressions (literal match) *) val str : string -> t val char : char -> t (* Basic operations on regular expressions *) val alt : t list -> t (* Alternative *) val seq : t list -> t (* Sequence *) val empty : t (* Match nothing *) val epsilon : t (* Empty word *) val rep : t -> t (* 0 or more matches *) val rep1 : t -> t (* 1 or more matches *) val repn : t -> int -> int option -> t (* Repeated matches *) val opt : t -> t (* 0 or 1 matches *) (* String, line, word *) val bol : t (* Beginning of line *) val eol : t (* End of line *) val bow : t (* Beginning of word *) val eow : t (* End of word *) val bos : t (* Beginning of string *) val eos : t (* End of string *) val leol : t (* Last end of line or end of string *) val start : t (* Initial position *) val stop : t (* Final position *) val word : t -> t (* Word *) val not_boundary : t (* Not at a word boundary *) val whole_string : t -> t (* Only matches the whole string *) (* Match semantics *) val longest : t -> t (* Longest match *) val shortest : t -> t (* Shortest match *) val first : t -> t (* First match *) (* Repeated match modifiers *) val greedy : t -> t (* Greedy *) val non_greedy : t -> t (* Non-greedy *) (* Groups (or submatches) *) val group : t -> t (* Delimit a group *) val no_group : t -> t (* Remove all groups *) val nest : t -> t (* when matching against [nest e], only the group matching in the last match of e will be considered as matching *) (* Character sets *) val set : string -> t (* Any character of the string *) val rg : char -> char -> t (* Character ranges *) val inter : t list -> t (* Intersection of character sets *) val diff : t -> t -> t (* Difference of character sets *) val compl : t list -> t (* Complement of union *) (* Predefined character sets *) val any : t (* Any character *) val notnl : t (* Any character but a newline *) val alnum : t val alpha : t val ascii : t val blank : t val cntrl : t val digit : t val graph : t val lower : t val print : t val punct : t val space : t val upper : t val xdigit : t (* Case modifiers *) val case : t -> t (* Case sensitive matching *) val no_case : t -> t (* Case insensitive matching *) (****) (* Internal debugging *) val print_re : Format.formatter -> re -> unit ocaml-re-ocaml-re-1.2.2/lib/re.mllib000066400000000000000000000001451233171356200171100ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 0a7dd4de0a81b2a07f8b93c4915dfbc9) Re Cset Automata # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_emacs.ml000066400000000000000000000073461233171356200176030ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) exception Parse_error exception Not_supported let parse s = let i = ref 0 in let l = String.length s in let eos () = !i = l in let test c = not (eos ()) && s.[!i] = c in let test2 c c' = !i + 1 < l && s.[!i] = c && s.[!i + 1] = c' in let accept c = let r = test c in if r then incr i; r in let accept2 c c' = let r = test2 c c' in if r then i := !i + 2; r in let get () = let r = s.[!i] in incr i; r in let rec regexp () = regexp' (branch ()) and regexp' left = if accept2 '\\' '|' then regexp' (Re.alt [left; branch ()]) else left and branch () = branch' [] and branch' left = if eos () || test2 '\\' '|' || test2 '\\' ')' then Re.seq (List.rev left) else branch' (piece () :: left) and piece () = let r = atom () in if accept '*' then Re.rep r else if accept '+' then Re.rep1 r else if accept '?' then Re.opt r else r and atom () = if accept '.' then begin Re.notnl end else if accept '^' then begin Re.bol end else if accept '$' then begin Re.eol end else if accept '[' then begin if accept '^' then Re.compl (bracket []) else Re.alt (bracket []) end else if accept '\\' then begin if accept '(' then begin let r = regexp () in if not (accept2 '\\' ')') then raise Parse_error; Re.group r end else if accept '`' then Re.bos else if accept '\'' then Re.eos else if accept '=' then Re.start else if accept 'b' then Re.alt [Re.bow; Re.eow] else if accept 'B' then Re.not_boundary else if accept '<' then Re.bow else if accept '>' then Re.eow else if accept 'w' then Re.alt [Re.alnum; Re.char '_'] else if accept 'W' then Re.compl [Re.alnum; Re.char '_'] else begin if eos () then raise Parse_error; match get () with '*' | '+' | '?' | '[' | ']' | '.' | '^' | '$' | '\\' as c -> Re.char c | '0' .. '9' -> raise Not_supported | _ -> raise Parse_error end end else begin if eos () then raise Parse_error; match get () with '*' | '+' | '?' -> raise Parse_error | c -> Re.char c end and bracket s = if s <> [] && accept ']' then s else begin let c = char () in if accept '-' then begin if accept ']' then Re.char c :: Re.char '-' :: s else begin let c' = char () in bracket (Re.rg c c' :: s) end end else bracket (Re.char c :: s) end and char () = if eos () then raise Parse_error; get () in let res = regexp () in if not (eos ()) then raise Parse_error; res let re ?(case = true) s = let r = parse s in if case then r else Re.no_case r let compile = Re.compile let compile_pat ?(case = true) s = compile (re ~case s) ocaml-re-ocaml-re-1.2.2/lib/re_emacs.mldylib000066400000000000000000000001351233171356200206140ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 05b5d967ad075a747ac1f5fa1aeaf527) Re_emacs # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_emacs.mli000066400000000000000000000023371233171356200177470ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) (* Errors that can be raised during the parsing of the regular expression *) exception Parse_error exception Not_supported (* Parsing of an Emacs-style regular expression *) val re : ?case:bool -> string -> Re.t (* Regular expression compilation *) val compile : Re.t -> Re.re (* Same as [Re.compile] *) val compile_pat : ?case:bool -> string -> Re.re ocaml-re-ocaml-re-1.2.2/lib/re_emacs.mllib000066400000000000000000000001351233171356200202570ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 05b5d967ad075a747ac1f5fa1aeaf527) Re_emacs # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_glob.ml000066400000000000000000000102631233171356200174260ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) exception Parse_error let gany = Re.compl [Re.char '/'] let notdot = Re.compl [Re.char '.'; Re.char '/'] let dot = Re.char '.' type loc = Beg | BegAny | Mid let beg_start = Re.opt (Re.seq [notdot; Re.rep gany]) let beg_start' = Re.seq [notdot; Re.rep gany] let glob_parse ?anchored init s = let i = ref 0 in let l = String.length s in let eos () = !i = l in let test c = not (eos ()) && s.[!i] = c in let accept c = let r = test c in if r then incr i; r in let get () = let r = s.[!i] in incr i; r in let rec expr () = expr' init [] and expr' beg left = if eos () then match beg with Mid | Beg -> Re.seq (List.rev left) | BegAny -> Re.seq (List.rev (beg_start :: left)) else let (piec, beg) = piece beg in expr' beg (piec :: left) and piece beg = if accept '*' then begin if beg <> Mid then (Re.seq [], BegAny) else (Re.rep gany, Mid) end else if accept '?' then (begin match beg with Beg -> notdot | BegAny -> Re.seq [notdot; Re.rep gany] | Mid -> gany end, Mid) else if accept '[' then begin let set = if accept '^' || accept '!' then Re.compl (bracket []) else Re.alt (bracket []) in (begin match beg with Beg -> Re.inter [notdot; set] | BegAny -> Re.alt [Re.seq [beg_start; Re.inter [notdot; set]]; Re.seq [beg_start'; Re.inter [dot; set]]] | Mid -> Re.inter [gany; set] end, Mid) end else let c = char () in ((if beg <> BegAny then Re.char c else if c = '.' then Re.seq [beg_start'; Re.char c] else Re.seq [beg_start; Re.char c]), if c = '/' then init else Mid) and bracket s = if s <> [] && accept ']' then s else begin let c = char () in if accept '-' then begin if accept ']' then Re.char c :: Re.char '-' :: s else begin let c' = char () in bracket (Re.rg c c' :: s) end end else bracket (Re.char c :: s) end and char () = ignore (accept '\\'); if eos () then raise Parse_error; get () in let res = expr () in if anchored = None then res else Re.whole_string res let rec mul l l' = List.flatten (List.map (fun s -> List.map (fun s' -> s ^ s') l') l) let explode str = let l = String.length str in let rec expl inner s i acc beg = if i >= l then begin if inner then raise Parse_error; (mul beg [String.sub str s (i - s)], i) end else match str.[i] with '\\' -> expl inner s (i + 2) acc beg | '{' -> let (t, i') = expl true (i + 1) (i + 1) [] [""] in expl inner i' i' acc (mul beg (mul [String.sub str s (i - s)] t)) | ',' when inner -> expl inner (i + 1) (i + 1) (mul beg [String.sub str s (i - s)] @ acc) [""] | '}' when inner -> (mul beg [String.sub str s (i - s)] @ acc, i + 1) | _ -> expl inner s (i + 1) acc beg in List.rev (fst (expl false 0 0 [] [""])) let glob' ?anchored nodot s = glob_parse ?anchored (if nodot then Beg else Mid) s let glob ?anchored s = glob' ?anchored true s let globx' ?anchored nodot s = Re.alt (List.map (glob' ?anchored nodot) (explode s)) let globx ?anchored s = globx' ?anchored true s ocaml-re-ocaml-re-1.2.2/lib/re_glob.mldylib000066400000000000000000000001341233171356200204460ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 1506cb2624d26dc70fd66045bbadec27) Re_glob # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_glob.mli000066400000000000000000000036211233171356200175770ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) exception Parse_error val glob : ?anchored:unit -> string -> Re.t (* Implements the semantics of shells patterns. The returned regular expression is unanchored by default. If the [anchored] parameter is provided, the regular expression will only matches whole strings. Character '/' must be explicitely matched. A dot at the beginning of a file name must be explicitely matched as well. Character '*' matches any sequence of characters and character '?' matches a single character, provided these restrictions are satisfied, A sequence '[...]' matches any of the enclosed characters. A backslash escapes the following character. *) val glob' : ?anchored:unit -> bool -> string -> Re.t (* Same, but allows to choose whether dots at the beginning of a file name need to be explicitly matched (true) or not (false) *) val globx : ?anchored:unit -> string -> Re.t val globx' : ?anchored:unit -> bool -> string -> Re.t (* These two functions also recognize the pattern {..,..} *) ocaml-re-ocaml-re-1.2.2/lib/re_glob.mllib000066400000000000000000000001341233171356200201110ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 1506cb2624d26dc70fd66045bbadec27) Re_glob # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_pcre.ml000066400000000000000000000036061233171356200174370ustar00rootroot00000000000000type regexp = Re.re let regexp ?(flags = []) pat = let opts = List.map (function | `CASELESS -> `Caseless ) flags in Re_perl.compile_pat ~opts pat let extract ~rex s = Re.get_all (Re.exec rex s) let exec ~rex ?pos s = Re.exec rex ?pos s let get_substring s i = Re.get s i let get_substring_ofs s i = Re.get_ofs s i let pmatch ~rex s = Re.execp rex s let substitute ~rex ~subst str = let b = Buffer.create 1024 in let rec loop pos = if pos >= String.length str then Buffer.contents b else if Re.execp ~pos rex str then ( let ss = Re.exec ~pos rex str in let start, fin = Re.get_ofs ss 0 in let pat = Re.get ss 0 in Buffer.add_substring b str pos (start - pos); Buffer.add_string b (subst pat); loop fin ) else ( Buffer.add_substring b str pos (String.length str - pos); loop (String.length str) ) in loop 0 let split ~rex str = let rec loop accu pos = if pos >= String.length str then List.rev accu else if Re.execp ~pos rex str then ( let ss = Re.exec ~pos rex str in let start, fin = Re.get_ofs ss 0 in let s = String.sub str pos (start - pos) in loop (s :: accu) fin ) else ( let s = String.sub str pos (String.length str - pos) in loop (s :: accu) (String.length str) ) in loop [] 0 (* From PCRE *) let string_unsafe_sub s ofs len = let r = String.create len in String.unsafe_blit s ofs r 0 len; r let quote s = let len = String.length s in let buf = String.create (len lsl 1) in let pos = ref 0 in for i = 0 to len - 1 do match String.unsafe_get s i with | '\\' | '^' | '$' | '.' | '[' | '|' | '(' | ')' | '?' | '*' | '+' | '{' as c -> String.unsafe_set buf !pos '\\'; incr pos; String.unsafe_set buf !pos c; incr pos | c -> String.unsafe_set buf !pos c; incr pos done; string_unsafe_sub buf 0 !pos ocaml-re-ocaml-re-1.2.2/lib/re_pcre.mldylib000066400000000000000000000001341233171356200204540ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 0a8149eaf0a236ad41ceca93e1eb2eb1) Re_pcre # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_pcre.mllib000066400000000000000000000001341233171356200201170ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 0a8149eaf0a236ad41ceca93e1eb2eb1) Re_pcre # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_perl.ml000066400000000000000000000152341233171356200174500ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) exception Parse_error exception Not_supported let parse multiline dollar_endonly dotall ungreedy s = let i = ref 0 in let l = String.length s in let eos () = !i = l in let test c = not (eos ()) && s.[!i] = c in let accept c = let r = test c in if r then incr i; r in let get () = let r = s.[!i] in incr i; r in let unget () = decr i in let greedy_mod r = let gr = accept '?' in let gr = if ungreedy then not gr else gr in if gr then Re.non_greedy r else Re.greedy r in let rec regexp () = regexp' (branch ()) and regexp' left = if accept '|' then regexp' (Re.alt [left; branch ()]) else left and branch () = branch' [] and branch' left = if eos () || test '|' || test ')' then Re.seq (List.rev left) else branch' (piece () :: left) and piece () = let r = atom () in if accept '*' then greedy_mod (Re.rep r) else if accept '+' then greedy_mod (Re.rep1 r) else if accept '?' then greedy_mod (Re.opt r) else if accept '{' then match integer () with Some i -> let j = if accept ',' then integer () else Some i in if not (accept '}') then raise Parse_error; begin match j with Some j when j < i -> raise Parse_error | _ -> () end; greedy_mod (Re.repn r i j) | None -> unget (); r else r and atom () = if accept '.' then begin if dotall then Re.any else Re.notnl end else if accept '(' then begin if accept '?' then begin if accept ':' then begin let r = regexp () in if not (accept ')') then raise Parse_error; r end else if accept '#' then begin comment () end else raise Parse_error end else begin let r = regexp () in if not (accept ')') then raise Parse_error; Re.group r end end else if accept '^' then begin if multiline then Re.bol else Re.bos end else if accept '$' then begin if multiline then Re.eol else if dollar_endonly then Re.leol else Re.eos end else if accept '[' then begin if accept '^' then Re.compl (bracket []) else Re.alt (bracket []) end else if accept '\\' then begin (* XXX - Back-references - \cx (control-x), \e, \f, \n, \r, \t, \xhh, \ddd *) if eos () then raise Parse_error; match get () with 'w' -> Re.alt [Re.alnum; Re.char '_'] | 'W' -> Re.compl [Re.alnum; Re.char '_'] | 's' -> Re.space | 'S' -> Re.compl [Re.space] | 'd' -> Re.digit | 'D' -> Re.compl [Re.digit] | 'b' -> Re.alt [Re.bow; Re.eow] | 'B' -> Re.not_boundary | 'A' -> Re.bos | 'Z' -> Re.leol | 'z' -> Re.eos | 'G' -> Re.start | 'a'..'z' | 'A'..'Z' -> raise Parse_error | '0'..'9' -> raise Not_supported | c -> Re.char c end else begin if eos () then raise Parse_error; match get () with '*' | '+' | '?' | '{' | '\\' -> raise Parse_error | c -> Re.char c end and integer () = if eos () then None else match get () with '0'..'9' as d -> integer' (Char.code d - Char.code '0') | _ -> unget (); None and integer' i = if eos () then Some i else match get () with '0'..'9' as d -> let i' = 10 * i + (Char.code d - Char.code '0') in if i' < i then raise Parse_error; integer' i' | _ -> unget (); Some i and bracket s = if s <> [] && accept ']' then s else begin match char () with `Char c -> if accept '-' then begin if accept ']' then Re.char c :: Re.char '-' :: s else begin match char () with `Char c' -> bracket (Re.rg c c' :: s) | `Set st' -> Re.char c :: Re.char '-' :: st' :: s end end else bracket (Re.char c :: s) | `Set st -> bracket (st :: s) end and char () = if eos () then raise Parse_error; let c = get () in if c = '[' then begin if accept '=' || accept ':' then raise Not_supported; if accept '.' then begin if eos () then raise Parse_error; let c = get () in if not (accept '.') then raise Not_supported; if not (accept ']') then raise Parse_error; `Char c end else `Char c end else if c = '\\' then begin let c = get () in (* XXX \127, ... *) match c with 'b' -> `Char '\008' | 'n' -> `Char '\n' (*XXX*) | 'r' -> `Char '\r' (*XXX*) | 't' -> `Char '\t' (*XXX*) | 'w' -> `Set (Re.alt [Re.alnum; Re.char '_']) | 'W' -> `Set (Re.compl [Re.alnum; Re.char '_']) | 's' -> `Set (Re.space) | 'S' -> `Set (Re.compl [Re.space]) | 'd' -> `Set (Re.digit) | 'D' -> `Set (Re.compl [Re.digit]) | 'a'..'z' | 'A'..'Z' -> raise Parse_error | '0'..'9' -> raise Not_supported | _ -> `Char c end else `Char c and comment () = if accept ')' then Re.epsilon else begin incr i; comment () end in let res = regexp () in if not (eos ()) then raise Parse_error; res type opt = [ `Ungreedy | `Dotall | `Dollar_endonly | `Multiline | `Anchored | `Caseless ] let re ?(opts = []) s = let r = parse (List.memq `Multiline opts) (List.memq `Dollar_endonly opts) (List.memq `Dotall opts) (List.memq `Ungreedy opts) s in let r = if List.memq `Anchored opts then Re.seq [Re.start; r] else r in let r = if List.memq `Caseless opts then Re.no_case r else r in r let compile = Re.compile let compile_pat ?(opts = []) s = compile (re ~opts s) ocaml-re-ocaml-re-1.2.2/lib/re_perl.mldylib000066400000000000000000000001341233171356200204650ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 0da0de88cc2ea375a725bb3124e688dc) Re_perl # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_perl.mli000066400000000000000000000025061233171356200176170ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) (* Errors that can be raised during the parsing of the regular expression *) exception Parse_error exception Not_supported type opt = [ `Ungreedy | `Dotall | `Dollar_endonly | `Multiline | `Anchored | `Caseless ] (* Parsing of a Perl-style regular expression *) val re : ?opts:opt list -> string -> Re.t (* Regular expression compilation *) val compile : Re.t -> Re.re (* (Same as [Re.compile]) *) val compile_pat : ?opts:opt list -> string -> Re.re ocaml-re-ocaml-re-1.2.2/lib/re_perl.mllib000066400000000000000000000001341233171356200201300ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 0da0de88cc2ea375a725bb3124e688dc) Re_perl # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_posix.ml000066400000000000000000000115611233171356200176470ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) (* What we could (should?) do: - a* ==> longest ((shortest (no_group a)* ), a | ()) (!!!) - abc understood as (ab)c - "((a?)|b)" against "ab" should not bind the first subpattern to anything Note that it should be possible to handle "(((ab)c)d)e" efficiently *) exception Parse_error exception Not_supported let parse newline s = let i = ref 0 in let l = String.length s in let eos () = !i = l in let test c = not (eos ()) && s.[!i] = c in let accept c = let r = test c in if r then incr i; r in let get () = let r = s.[!i] in incr i; r in let unget () = decr i in let rec regexp () = regexp' (branch ()) and regexp' left = if accept '|' then regexp' (Re.alt [left; branch ()]) else left and branch () = branch' [] and branch' left = if eos () || test '|' || test ')' then Re.seq (List.rev left) else branch' (piece () :: left) and piece () = let r = atom () in if accept '*' then Re.rep (Re.nest r) else if accept '+' then Re.rep1 (Re.nest r) else if accept '?' then Re.opt r else if accept '{' then match integer () with Some i -> let j = if accept ',' then integer () else Some i in if not (accept '}') then raise Parse_error; begin match j with Some j when j < i -> raise Parse_error | _ -> () end; Re.repn (Re.nest r) i j | None -> unget (); r else r and atom () = if accept '.' then begin if newline then Re.notnl else Re.any end else if accept '(' then begin let r = regexp () in if not (accept ')') then raise Parse_error; Re.group r end else if accept '^' then begin if newline then Re.bol else Re.bos end else if accept '$' then begin if newline then Re.eol else Re.eos end else if accept '[' then begin if accept '^' then Re.diff (Re.compl (bracket [])) (Re.char '\n') else Re.alt (bracket []) end else if accept '\\' then begin if eos () then raise Parse_error; match get () with '|' | '(' | ')' | '*' | '+' | '?' | '[' | '.' | '^' | '$' | '{' | '\\' as c -> Re.char c | _ -> raise Parse_error end else begin if eos () then raise Parse_error; match get () with '*' | '+' | '?' | '{' | '\\' -> raise Parse_error | c -> Re.char c end and integer () = if eos () then None else match get () with '0'..'9' as d -> integer' (Char.code d - Char.code '0') | _ -> unget (); None and integer' i = if eos () then Some i else match get () with '0'..'9' as d -> let i' = 10 * i + (Char.code d - Char.code '0') in if i' < i then raise Parse_error; integer' i' | _ -> unget (); Some i and bracket s = if s <> [] && accept ']' then s else begin let c = char () in if accept '-' then begin if accept ']' then Re.char c :: Re.char '-' :: s else begin let c' = char () in bracket (Re.rg c c' :: s) end end else bracket (Re.char c :: s) end and char () = if eos () then raise Parse_error; let c = get () in if c = '[' then begin if accept '=' then raise Not_supported else if accept ':' then begin raise Not_supported (*XXX*) end else if accept '.' then begin if eos () then raise Parse_error; let c = get () in if not (accept '.') then raise Not_supported; if not (accept ']') then raise Parse_error; c end else c end else c in let res = regexp () in if not (eos ()) then raise Parse_error; res type opt = [`ICase | `NoSub | `Newline] let re ?(opts = []) s = let r = parse (List.memq `Newline opts) s in let r = if List.memq `ICase opts then Re.no_case r else r in let r = if List.memq `NoSub opts then Re.no_group r else r in r let compile re = Re.compile (Re.longest re) let compile_pat ?(opts = []) s = compile (re ~opts s) ocaml-re-ocaml-re-1.2.2/lib/re_posix.mldylib000066400000000000000000000001351233171356200206660ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 1f05cbe7ce6cb8123eb3d95f49091839) Re_posix # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_posix.mli000066400000000000000000000057051233171356200200230ustar00rootroot00000000000000(* RE - A regular expression library Copyright (C) 2001 Jerome Vouillon email: Jerome.Vouillon@pps.jussieu.fr This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, with linking exception; either version 2.1 of the License, or (at your option) any later version. This 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) (* References: http://www.opengroup.org/onlinepubs/007908799/xbd/re.html http://www.opengroup.org/onlinepubs/007908799/xsh/regcomp.html *) (* XXX Character classes *) (* Errors that can be raised during the parsing of the regular expression *) exception Parse_error exception Not_supported type opt = [`ICase | `NoSub | `Newline] (* Parsing of a Posix extended regular expression *) val re : ?opts:(opt list) -> string -> Re.t (* Regular expression compilation *) val compile : Re.t -> Re.re (* [compile r] is defined as [Re.compile (Re.longest r)] *) val compile_pat : ?opts:(opt list) -> string -> Re.re (* Deviation from the standard / ambiguities in the standard --------------------------------------------------------- We tested the behavior of the Linux library (glibc) and the Solaris library. (1) An expression [efg] should be parsed as [(ef)g]. All implementations parse it as [e(fg)]. (2) When matching the pattern "((a)|b)*" against the string "ab", the sub-expression "((a)|b)" should match "b", and the sub-expression "(a)" should not match anything. In both implementation, the sub-expression "(a)" matches "a". (3) When matching the pattern "(aa?)*" against the string "aaa", it is not clear whether the final match of the sub-expression "(aa?)" is the last "a" (all matches of the sub-expression are successively maximized), or "aa" (the final match is maximized). Both implementations implements the first case. (4) When matching the pattern "((a?)|b)*" against the string "ab", the sub-expression "((a?)|b)" should match the empty string at the end of the string (it is better to match the empty string than to match nothing). In both implementations, this sub-expression matches "b". (Strangely, in the Linux implementation, the sub-expression "(a?)" correctly matches the empty string at the end of the string) This library behaves the same way as the other libraries for all points, except for (2) and (4) where it follows the standard. The behavior of this library in theses four cases may change in future releases. *) ocaml-re-ocaml-re-1.2.2/lib/re_posix.mllib000066400000000000000000000001351233171356200203310ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: 1f05cbe7ce6cb8123eb3d95f49091839) Re_posix # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_str.ml000066400000000000000000000201531233171356200173120ustar00rootroot00000000000000(***********************************************************************) (* *) (* Objective Caml *) (* *) (* Xavier Leroy, projet Cristal, INRIA Rocquencourt *) (* *) (* Copyright 1996 Institut National de Recherche en Informatique et *) (* en Automatique. All rights reserved. This file is distributed *) (* under the terms of the GNU Library General Public License, with *) (* linking exception. *) (* *) (***********************************************************************) (* Modified by Jerome.Vouillon@pps.jussieu.fr for integration in RE *) (* $Id: re_str.ml,v 1.3 2002/07/03 15:47:54 vouillon Exp $ *) type regexp = { re : Re.t; mutable mtch : Re.re option; mutable srch : Re.re option } let compile_regexp s c = { re = Re_emacs.re ~case:(not c) s; mtch = None; srch = None } let rec get_mtch re = match re.mtch with Some r -> r | None -> re.mtch <- Some (Re.compile (Re.seq [Re.start; re.re])); get_mtch re let rec get_srch re = match re.srch with Some r -> r | None -> re.srch <- Some (Re.compile re.re); get_srch re let state = ref None let string_match re s p = try state := Some (Re.exec ~pos:p (get_mtch re) s); true with Not_found -> state := None; false let string_partial_match re s p = match Re.exec_partial ~pos:p (get_mtch re) s with `Full -> string_match re s p | `Partial -> true | `Mismatch -> false let search_forward re s p = try let res = Re.exec ~pos:p (get_srch re) s in state := Some res; fst (Re.get_ofs res 0) with Not_found -> state := None; raise Not_found let rec search_backward re s p = try let res = Re.exec ~pos:p (get_mtch re) s in state := Some res; p with Not_found -> state := None; if p = 0 then raise Not_found else search_backward re s (p - 1) let beginning_group i = match !state with Some m -> fst (Re.get_ofs m i) | None -> raise Not_found let end_group i = match !state with Some m -> snd (Re.get_ofs m i) | None -> raise Not_found let get_len i = match !state with None -> 0 | Some m -> try let (b, e) = Re.get_ofs m i in e - b with Not_found -> 0 let rec repl_length repl p q len = if p < len then begin if repl.[p] <> '\\' then repl_length repl (p + 1) (q + 1) len else begin let p = p + 1 in if p = len then failwith "Str.replace: illegal backslash sequence"; match repl.[p] with '\\' -> repl_length repl (p + 1) (q + 1) len | '0' .. '9' as c -> repl_length repl (p + 1) (q + get_len (Char.code c - Char.code '0')) len | _ -> repl_length repl (p + 1) (q + 2) len end end else q let rec replace orig repl p res q len = if p < len then begin let c = repl.[p] in if c <> '\\' then begin res.[q] <- c; replace orig repl (p + 1) res (q + 1) len end else begin match repl.[p + 1] with '\\' -> res.[q] <- '\\'; replace orig repl (p + 2) res (q + 1) len | '0' .. '9' as c -> let d = try match !state with None -> raise Not_found | Some m -> let (b, e) = Re.get_ofs m (Char.code c - Char.code '0') in let d = e - b in if d > 0 then String.blit orig b res q d; d with Not_found -> 0 in replace repl orig (p + 2) res (q + d) len | c -> res.[q] <- '\\'; res.[q + 1] <- c; replace repl orig (p + 2) res (q + 2) len end end let replacement_text repl orig = let len = String.length repl in let res = String.create (repl_length repl 0 0 len) in replace orig repl 0 res 0 (String.length repl); res let quote s = let len = String.length s in let buf = String.create (2 * len) in let pos = ref 0 in for i = 0 to len - 1 do match s.[i] with '[' | ']' | '*' | '.' | '\\' | '?' | '+' | '^' | '$' as c -> buf.[!pos] <- '\\'; buf.[!pos + 1] <- c; pos := !pos + 2 | c -> buf.[!pos] <- c; pos := !pos + 1 done; String.sub buf 0 !pos let string_before s n = String.sub s 0 n let string_after s n = String.sub s n (String.length s - n) let first_chars s n = String.sub s 0 n let last_chars s n = String.sub s (String.length s - n) n let regexp e = compile_regexp e false let regexp_case_fold e = compile_regexp e true let regexp_string s = compile_regexp (quote s) false let regexp_string_case_fold s = compile_regexp (quote s) true let group_beginning n = if n < 0 || n >= 10 then invalid_arg "Str.group_beginning" else let pos = beginning_group n in if pos = -1 then raise Not_found else pos let group_end n = if n < 0 || n >= 10 then invalid_arg "Str.group_end" else let pos = end_group n in if pos = -1 then raise Not_found else pos let matched_group n txt = let b = group_beginning n and e = group_end n in String.sub txt b (e-b) let replace_matched repl matched = replacement_text repl matched let match_beginning () = group_beginning 0 and match_end () = group_end 0 and matched_string txt = matched_group 0 txt let substitute_first expr repl_fun text = try let pos = search_forward expr text 0 in String.concat "" [string_before text pos; repl_fun text; string_after text (match_end())] with Not_found -> text let global_substitute expr repl_fun text = let rec replace start last_was_empty = try let startpos = if last_was_empty then start + 1 else start in if startpos > String.length text then raise Not_found; let pos = search_forward expr text startpos in let end_pos = match_end() in let repl_text = repl_fun text in String.sub text start (pos-start) :: repl_text :: replace end_pos (end_pos = pos) with Not_found -> [string_after text start] in String.concat "" (replace 0 false) let global_replace expr repl text = global_substitute expr (replacement_text repl) text and replace_first expr repl text = substitute_first expr (replacement_text repl) text let bounded_split expr text num = let start = if string_match expr text 0 then match_end() else 0 in let rec split start n = if start >= String.length text then [] else if n = 1 then [string_after text start] else try let pos = search_forward expr text start in String.sub text start (pos-start) :: split (match_end()) (n-1) with Not_found -> [string_after text start] in split start num let split expr text = bounded_split expr text 0 let bounded_split_delim expr text num = let rec split start n = if start > String.length text then [] else if n = 1 then [string_after text start] else try let pos = search_forward expr text start in String.sub text start (pos-start) :: split (match_end()) (n-1) with Not_found -> [string_after text start] in if text = "" then [] else split 0 num let split_delim expr text = bounded_split_delim expr text 0 type split_result = Text of string | Delim of string let bounded_full_split expr text num = let rec split start n = if start >= String.length text then [] else if n = 1 then [Text(string_after text start)] else try let pos = search_forward expr text start in let s = matched_string text in if pos > start then Text(String.sub text start (pos-start)) :: Delim(s) :: split (match_end()) (n-1) else Delim(s) :: split (match_end()) (n-1) with Not_found -> [Text(string_after text start)] in split 0 num let full_split expr text = bounded_full_split expr text 0 ocaml-re-ocaml-re-1.2.2/lib/re_str.mldylib000066400000000000000000000001331233171356200203320ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: bfe95f96a3ef4749a76fe1bb27311ad7) Re_str # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib/re_str.mli000066400000000000000000000241001233171356200174570ustar00rootroot00000000000000(***********************************************************************) (* *) (* Objective Caml *) (* *) (* Xavier Leroy, projet Cristal, INRIA Rocquencourt *) (* *) (* Copyright 1996 Institut National de Recherche en Informatique et *) (* en Automatique. All rights reserved. This file is distributed *) (* under the terms of the GNU Library General Public License, with *) (* linking exception. *) (* *) (***********************************************************************) (* $Id: re_str.mli,v 1.1 2002/01/16 14:16:04 vouillon Exp $ *) (* Module [Str]: regular expressions and high-level string processing *) (*** Regular expressions *) type regexp (* The type of compiled regular expressions. *) val regexp: string -> regexp (* Compile a regular expression. The syntax for regular expressions is the same as in Gnu Emacs. The special characters are [$^.*+?[]]. The following constructs are recognized: - [. ] matches any character except newline - [* ] (postfix) matches the previous expression zero, one or several times - [+ ] (postfix) matches the previous expression one or several times - [? ] (postfix) matches the previous expression once or not at all - [[..] ] character set; ranges are denoted with [-], as in [[a-z]]; an initial [^], as in [[^0-9]], complements the set - [^ ] matches at beginning of line - [$ ] matches at end of line - [\| ] (infix) alternative between two expressions - [\(..\)] grouping and naming of the enclosed expression - [\1 ] the text matched by the first [\(...\)] expression ([\2] for the second expression, etc) - [\b ] matches word boundaries - [\ ] quotes special characters. *) val regexp_case_fold: string -> regexp (* Same as [regexp], but the compiled expression will match text in a case-insensitive way: uppercase and lowercase letters will be considered equivalent. *) val quote: string -> string (* [Str.quote s] returns a regexp string that matches exactly [s] and nothing else. *) val regexp_string: string -> regexp val regexp_string_case_fold: string -> regexp (* [Str.regexp_string s] returns a regular expression that matches exactly [s] and nothing else. [Str.regexp_string_case_fold] is similar, but the regexp matches in a case-insensitive way. *) (*** String matching and searching *) val string_match: regexp -> string -> int -> bool (* [string_match r s start] tests whether the characters in [s] starting at position [start] match the regular expression [r]. The first character of a string has position [0], as usual. *) val search_forward: regexp -> string -> int -> int (* [search_forward r s start] searchs the string [s] for a substring matching the regular expression [r]. The search starts at position [start] and proceeds towards the end of the string. Return the position of the first character of the matched substring, or raise [Not_found] if no substring matches. *) val search_backward: regexp -> string -> int -> int (* Same as [search_forward], but the search proceeds towards the beginning of the string. *) val string_partial_match: regexp -> string -> int -> bool (* Similar to [string_match], but succeeds whenever the argument string is a prefix of a string that matches. This includes the case of a true complete match. *) val matched_string: string -> string (* [matched_string s] returns the substring of [s] that was matched by the latest [string_match], [search_forward] or [search_backward]. The user must make sure that the parameter [s] is the same string that was passed to the matching or searching function. *) val match_beginning: unit -> int val match_end: unit -> int (* [match_beginning()] returns the position of the first character of the substring that was matched by [string_match], [search_forward] or [search_backward]. [match_end()] returns the position of the character following the last character of the matched substring. *) val matched_group: int -> string -> string (* [matched_group n s] returns the substring of [s] that was matched by the [n]th group [\(...\)] of the regular expression during the latest [string_match], [search_forward] or [search_backward]. The user must make sure that the parameter [s] is the same string that was passed to the matching or searching function. [matched_group n s] raises [Not_found] if the [n]th group of the regular expression was not matched. This can happen with groups inside alternatives [\|], options [?] or repetitions [*]. For instance, the empty string will match [\(a\)*], but [matched_group 1 ""] will raise [Not_found] because the first group itself was not matched. *) val group_beginning: int -> int val group_end: int -> int (* [group_beginning n] returns the position of the first character of the substring that was matched by the [n]th group of the regular expression. [group_end n] returns the position of the character following the last character of the matched substring. Both functions raise [Not_found] if the [n]th group of the regular expression was not matched. *) (*** Replacement *) val global_replace: regexp -> string -> string -> string (* [global_replace regexp templ s] returns a string identical to [s], except that all substrings of [s] that match [regexp] have been replaced by [templ]. The replacement template [templ] can contain [\1], [\2], etc; these sequences will be replaced by the text matched by the corresponding group in the regular expression. [\0] stands for the text matched by the whole regular expression. *) val replace_first: regexp -> string -> string -> string (* Same as [global_replace], except that only the first substring matching the regular expression is replaced. *) val global_substitute: regexp -> (string -> string) -> string -> string (* [global_substitute regexp subst s] returns a string identical to [s], except that all substrings of [s] that match [regexp] have been replaced by the result of function [subst]. The function [subst] is called once for each matching substring, and receives [s] (the whole text) as argument. *) val substitute_first: regexp -> (string -> string) -> string -> string (* Same as [global_substitute], except that only the first substring matching the regular expression is replaced. *) val replace_matched : string -> string -> string (* [replace_matched repl s] returns the replacement text [repl] in which [\1], [\2], etc. have been replaced by the text matched by the corresponding groups in the most recent matching operation. [s] must be the same string that was matched during this matching operation. *) (*** Splitting *) val split: regexp -> string -> string list (* [split r s] splits [s] into substrings, taking as delimiters the substrings that match [r], and returns the list of substrings. For instance, [split (regexp "[ \t]+") s] splits [s] into blank-separated words. An occurrence of the delimiter at the beginning and at the end of the string is ignored. *) val bounded_split: regexp -> string -> int -> string list (* Same as [split], but splits into at most [n] substrings, where [n] is the extra integer parameter. *) val split_delim: regexp -> string -> string list val bounded_split_delim: regexp -> string -> int -> string list (* Same as [split] and [bounded_split], but occurrences of the delimiter at the beginning and at the end of the string are recognized and returned as empty strings in the result. For instance, [split_delim (regexp " ") " abc "] returns [[""; "abc"; ""]], while [split] with the same arguments returns [["abc"]]. *) type split_result = Text of string | Delim of string val full_split: regexp -> string -> split_result list val bounded_full_split: regexp -> string -> int -> split_result list (* Same as [split_delim] and [bounded_split_delim], but returns the delimiters as well as the substrings contained between delimiters. The former are tagged [Delim] in the result list; the latter are tagged [Text]. For instance, [full_split (regexp "[{}]") "{ab}"] returns [[Delim "{"; Text "ab"; Delim "}"]]. *) (*** Extracting substrings *) val string_before: string -> int -> string (* [string_before s n] returns the substring of all characters of [s] that precede position [n] (excluding the character at position [n]). *) val string_after: string -> int -> string (* [string_after s n] returns the substring of all characters of [s] that follow position [n] (including the character at position [n]). *) val first_chars: string -> int -> string (* [first_chars s n] returns the first [n] characters of [s]. This is the same function as [string_before]. *) val last_chars: string -> int -> string (* [last_chars s n] returns the last [n] characters of [s]. *) ocaml-re-ocaml-re-1.2.2/lib/re_str.mllib000066400000000000000000000001331233171356200177750ustar00rootroot00000000000000# OASIS_START # DO NOT EDIT (digest: bfe95f96a3ef4749a76fe1bb27311ad7) Re_str # OASIS_STOP ocaml-re-ocaml-re-1.2.2/lib_test/000077500000000000000000000000001233171356200165205ustar00rootroot00000000000000ocaml-re-ocaml-re-1.2.2/lib_test/.cvsignore000066400000000000000000000001111233171356200205110ustar00rootroot00000000000000*.cmi *.cmx re_match pcre_match re_scan pcre_scan unison unison2 unison3 ocaml-re-ocaml-re-1.2.2/lib_test/Input000066400000000000000000000010671233171356200175460ustar00rootroot00000000000000datafile for regex matching of phone numbers test the following numbers should match: (111) 111 1111 111 222-2222 (111) 333-3333 111 444 4444 foo (111) 555 5555 foo 111 666-6666 foo (111) 777-7777 foo 111 888 8888 foo (111) 999 9999 bar foo 111 000-0000 bar foo (111) 232-1111 bar foo 111 242 1111 bar The following should fail to match: 2(212) 222 2222 2232 222-2222 (242) 222-22222 2252 222 2222 foo (262) 2222222 foo 272 2222222 foo (282) 222-22227 foo 292 222 22222 foo (202).222 2222 bar foo 211@22222222 bar foo (213 222-2222 bar foo 214) 222 2222 bar ocaml-re-ocaml-re-1.2.2/lib_test/Makefile000066400000000000000000000013061233171356200201600ustar00rootroot00000000000000re_scan: re_scan.ml ../re.cmxa ocamlopt -o re_scan -I .. re.cmxa re_scan.ml pcre_scan: pcre_scan.ml ocamlopt -o pcre_scan -I +contrib pcre.cmxa pcre_scan.ml re_match: re_match.ml ../re.cmxa ocamlopt -o re_match -I .. re.cmxa re_match.ml pcre_match: pcre_match.ml ocamlopt -o pcre_match -I +contrib pcre.cmxa pcre_match.ml unison3: unison3.ml ocamlopt -o unison3 unix.cmxa -I +contrib pcre.cmxa unison3.ml unison: unison.ml ../re.cmxa ocamlopt -o unison unix.cmxa -I .. re.cmxa unison.ml unison2: unison2.ml ocamlopt -o unison2 unix.cmxa -I ../../unison/src re.cmx unison2.ml clean: rm -f re_scan pcre_scan re_match pcre_match unison unison2 unison3 rm -f *.cmi *.cmo *.cmx *.cma *.cmxa *.a *.o ocaml-re-ocaml-re-1.2.2/lib_test/env.ml000066400000000000000000000013661233171356200176500ustar00rootroot00000000000000open Fort let id x = x let not_found () = raise Not_found let str_printer s = "\"" ^ String.escaped s ^ "\"" let ofs_printer (i0,i1) = Printf.sprintf "(%d,%d)" i0 i1 let list_printer f l = "[" ^ (String.concat "; " (List.map f l)) ^ "]" let arr_printer f a = "[|" ^ (String.concat "; " (List.map f (Array.to_list a))) ^ "|]" let arr_str_printer = arr_printer str_printer let arr_ofs_printer = arr_printer ofs_printer let expect_eq_bool = expect_equal_app ~printer:string_of_bool let expect_eq_str = expect_equal_app ~printer:str_printer let expect_eq_ofs = expect_equal_app ~printer:ofs_printer let expect_eq_arr_str = expect_equal_app ~printer:arr_str_printer let expect_eq_arr_ofs = expect_equal_app ~printer:arr_ofs_printer ocaml-re-ocaml-re-1.2.2/lib_test/glob.ml000066400000000000000000000020061233171356200177730ustar00rootroot00000000000000(** This is a little command line tool to test the library. @author Christian Lindig *) module R = Re module G = Re_glob exception Error of string let error fmt = Printf.kprintf (fun msg -> raise (Error msg)) fmt let eprintf = Printf.eprintf let printf = Printf.printf let (@@) f x = f x let glob pattern str = let rx = R.compile @@ R.whole_string @@ G.globx pattern in (* let () = R.print_re Format.std_formatter rx in *) if R.execp rx str then printf "%s matches: %s\n" pattern str else printf "%s doesn't match: %s\n" pattern str let main () = let argv = Array.to_list Sys.argv in let this = List.hd argv in let args = List.tl argv in match args with | [] | [_] -> error "usage: %s pattern string .." this | p :: strs -> List.iter (glob p) strs let () = try main (); exit 0 with | Error(msg) -> eprintf "Error: %s\n" msg; exit 1 | _ -> eprintf "unknown exception raised\n"; exit 1 ocaml-re-ocaml-re-1.2.2/lib_test/longest.c000066400000000000000000000022031233171356200203340ustar00rootroot00000000000000 #include #include main () { regex_t preg; regmatch_t pmatch[3]; regcomp (&preg, "(aa?)*", REG_EXTENDED); regexec (&preg, "aaa", 2, pmatch, 0); printf ("%d %d %d %d (expected: 0 3 1 3)\n", pmatch[0].rm_so, pmatch[0].rm_eo, pmatch[1].rm_so, pmatch[1].rm_eo); regcomp (&preg, "(a*)(ab)?b*", REG_EXTENDED); regexec (&preg, "aaabb", 3, pmatch, 0); printf ("%d %d %d %d %d %d (expected: 0 5 0 2 2 4)\n", pmatch[0].rm_so, pmatch[0].rm_eo, pmatch[1].rm_so, pmatch[1].rm_eo, pmatch[2].rm_so, pmatch[2].rm_eo); regcomp (&preg, "((a?)|b)*", REG_EXTENDED); regexec (&preg, "ab", 3, pmatch, 0); printf ("%d %d %d %d %d %d (expected: 0 2 1 2 -1 -1)\n", pmatch[0].rm_so, pmatch[0].rm_eo, pmatch[1].rm_so, pmatch[1].rm_eo, pmatch[2].rm_so, pmatch[2].rm_eo); regcomp (&preg, "((a)|b)*", REG_EXTENDED); regexec (&preg, "ab", 3, pmatch, 0); printf ("%d %d %d %d %d %d (expected: 0 2 1 2 -1 -1)\n", pmatch[0].rm_so, pmatch[0].rm_eo, pmatch[1].rm_so, pmatch[1].rm_eo, pmatch[2].rm_so, pmatch[2].rm_eo); } ocaml-re-ocaml-re-1.2.2/lib_test/pcre_match.ml000066400000000000000000000027001233171356200211560ustar00rootroot00000000000000(* * $Id: pcre_match.ml,v 1.1.1.1 2001/09/21 15:54:12 vouillon Exp $ * http://www.bagley.org/~doug/shootout/ * from: Markus Mottl *) open Re_pcre let rex = regexp ~flags:[`EXTENDED] "(?: ^ | [^\d\(]) # must be preceeded by non-digit (\(\d\d\d\)|\d\d\d) # match 1: area code [ ] # area code followed by one space \d\d\d # prefix of 3 digits [ -] # separator is either space or dash \d\d\d\d # last 4 digits (?: \D|$) # must be followed by a non-digit (or EOL)" let phones = let lines = ref [] in foreach_line (fun line -> lines := line :: !lines); List.rev !lines let check_phone irflags ar cnt must_print line = try unsafe_pcre_exec irflags rex 0 line 4 ar; let num = String.copy "(...) ...-...." and pos = Array.unsafe_get ar 2 in let ofs = if String.unsafe_get line pos = '(' then 1 else 0 in let pos = pos + ofs in String.unsafe_blit line pos num 1 3; let pos = pos + ofs + 4 in String.unsafe_blit line pos num 6 3; String.unsafe_blit line (pos + 4) num 10 4; if must_print then Printf.printf "%d: %s\n" !cnt num; incr cnt with Not_found -> () let n = if Array.length Sys.argv > 1 then int_of_string Sys.argv.(1) else 1;; for i = 2 to n do List.iter (check_phone (rflags []) (Array.create 6 0) (ref 1) false) phones done; List.iter (check_phone (rflags []) (Array.create 6 0) (ref 1) true) phones ocaml-re-ocaml-re-1.2.2/lib_test/pcre_scan.ml000077500000000000000000000002511233171356200210100ustar00rootroot00000000000000 let x = Re_pcre.regexp "aa?b" let _ = let s = String.make (1024*1024) 'a' in s.[1024*1024-1] <- 'b'; for i = 0 to 99 do ignore (Re_pcre.exec ~rex:x s) done ocaml-re-ocaml-re-1.2.2/lib_test/perl_scan.pl000066400000000000000000000001441233171356200210220ustar00rootroot00000000000000$s = 'a' x (1024 * 1024 - 1) . 'b'; for ($i = 1; $i < 100; $i++) { print "$&\n" if $s =~ /aa?b/ ; } ocaml-re-ocaml-re-1.2.2/lib_test/re_match.ml000066400000000000000000000033171233171356200206400ustar00rootroot00000000000000(* * $Id: re_match.ml,v 1.2 2001/10/03 15:04:59 vouillon Exp $ * http://www.bagley.org/~doug/shootout/ * from: Markus Mottl *) let rex = let three_digits = Re.seq [Re.digit; Re.digit; Re.digit] in Re.compile (Re.seq [(* Must be preceeded by a non-digit *) Re.alt [Re.bol; Re.compl [Re.digit; Re.char '(']]; (* Area code *) Re.group (Re.alt [Re.seq [Re.char '('; three_digits; Re.char ')']; three_digits]); (* One space *) Re.char ' '; (* Prefix of 3 digits *) three_digits; (* Separator: either a space or a dash *) Re.set " -"; (* Last for digits *) three_digits; Re.digit; (* Must be followed by a non-digit (or EOL) *) Re.alt [Re.eol; Re.compl [Re.digit]]]) let foreach_line ?(ic = stdin) f = try while true do f (input_line ic) done with End_of_file -> () let phones = let lines = ref [] in let ic = open_in "Input" in foreach_line ~ic (fun line -> lines := line :: !lines); close_in ic; List.rev !lines let check_phone cnt must_print line = try let matches = Re.exec rex line in let num = String.copy "(...) ...-...." and (pos, _) = Re.get_ofs matches 1 in let ofs = if line.[pos] = '(' then 1 else 0 in let pos = pos + ofs in String.blit line pos num 1 3; let pos = pos + ofs + 4 in String.blit line pos num 6 3; String.blit line (pos + 4) num 10 4; if must_print then Printf.printf "%d: %s\n" !cnt num; incr cnt with Not_found -> () let n = if Array.length Sys.argv > 1 then int_of_string Sys.argv.(1) else 1;; for i = 2 to n do List.iter (check_phone (ref 1) false) phones done; List.iter (check_phone (ref 1) true) phones ocaml-re-ocaml-re-1.2.2/lib_test/re_scan.ml000066400000000000000000000003021233171356200204570ustar00rootroot00000000000000 open Re let x = compile (seq [char 'a'; opt (char 'a'); char 'b']) let _ = let s = String.make (1024*1024) 'a' in s.[1024*1024-1] <- 'b'; for i = 0 to 99 do ignore (exec x s) done ocaml-re-ocaml-re-1.2.2/lib_test/scan.ml000077500000000000000000000067721233171356200200150ustar00rootroot00000000000000type state = { idx : int; next : state array } type info = { i_cols : string; last : int } let unknown = {idx = -1; next = [||]} let st1 = { idx = 0; next = Array.make 256 unknown } let st2 = { idx = 0; next = Array.make 256 st1 } let cols = String.create 256 let _ = for i = 0 to 255 do st1.next.(i) <- st2; cols.[i] <- Char.chr i done (* 1.33 let rec loop s pos last st = if pos < last then begin ignore s.[pos]; loop s (pos + 1) last st.next.(127) end let exec s = loop s 0 (String.length s) st1 *) (* 1.67 let rec loop s pos last st = if pos < last then begin ignore s.[pos]; loop s (pos + 1) last st.next.(127) end let exec s = loop s 0 (String.length s) st1 *) (* 1.76 let rec loop s pos last st = if pos < last then begin let c = s.[pos] in let st' = st.next.(Char.code c) in loop s (pos + 1) last st' end let exec s = loop s 0 (String.length s) st1 *) (* 1.81 let rec loop cols s pos last st = if pos < last then begin let c' = cols.[Char.code s.[pos]] in let st' = st.next.(Char.code c') in loop cols s (pos + 1) last st' end let exec s = loop cols s 0 (String.length s) st1 *) (* 1.84 let rec loop info s pos last st = if pos < last then begin let c' = info.i_cols.[Char.code s.[pos]] in let st' = st.next.(Char.code c') in loop info s (pos + 1) last st' end let exec s = loop {i_cols = cols; last = String.length s} s 0 (String.length s) st1 *) (* 1.95 let rec loop info s pos last st = if pos < info.last then begin let c' = info.i_cols.[Char.code s.[pos]] in let st' = st.next.(Char.code c') in loop info s (pos + 1) last st' end let exec s = loop {i_cols = cols; last = String.length s} s 0 (String.length s) st1 *) (* 1.85 let rec loop info s pos cols st = if pos < info.last then begin let c' = cols.[Char.code s.[pos]] in let st' = st.next.(Char.code c') in loop info s (pos + 1) cols st' end let exec s = loop {i_cols = cols; last = String.length s} s 0 cols st1 *) let rec loop info s pos cols st = if pos < info.last then begin let c1 = cols.[Char.code s.[pos]] in let st1 = st.next.(Char.code c1) in let pos = pos + 1 in let c2 = cols.[Char.code s.[pos]] in let st2 = st1.next.(Char.code c2) in let pos = pos + 1 in let c3 = cols.[Char.code s.[pos]] in let st3 = st2.next.(Char.code c3) in let pos = pos + 1 in let c4 = cols.[Char.code s.[pos]] in let st4 = st3.next.(Char.code c4) in loop info s (pos + 1) cols st4 end let exec s = loop {i_cols = cols; last = String.length s} s 0 cols st1 (* 2.20 let rec loop info s pos last st idx = if idx >= 0 then begin if pos < last then begin let c' = info.i_cols.[Char.code s.[pos]] in let st' = st.next.(Char.code c') in let idx = st'.idx in loop info s (pos + 1) last st' idx end end else () let exec s = loop {i_cols = cols; last = String.length s} s 0 (String.length s) st1 0 *) (* let rec loop info s pos cols st st' = if pos < info.last then begin let c' = cols.[Char.code s.[pos]] in let idx = st.idx in if idx >= 0 then begin let st' = st.next.(Char.code c') in loop info s (pos + 1) cols st' st end else if idx = -1 then () else (* Unknown *) validate info s pos st' end and validate info s pos st' = validate info s pos st' let exec s = loop {i_cols = cols; last = String.length s} s 0 cols st1 st1 *) let _ = let s = String.make (1024*1024) 'a' in s.[1024*1024-1] <- 'b'; for i = 0 to 99 do ignore (exec s) done ocaml-re-ocaml-re-1.2.2/lib_test/test_emacs.ml000066400000000000000000000056521233171356200212110ustar00rootroot00000000000000open Re open Re_emacs let eq_re r s = Fort.expect_equal_app ~msg:s id r re s ;; (* * Tests based on description of emacs regular expressions given at * http://www.gnu.org/manual/elisp-manual-20-2.5/html_chapter/elisp_34.html *) expect_pass "ordinary characters" (fun () -> eq_re (char 'a') "a"; ); expect_pass "concatenation" (fun () -> eq_re (seq [char 'a'; char 'b']) "ab"; ); expect_pass "escaping special characters" (fun () -> eq_re (char '.') "\."; eq_re (char '*') "\*"; eq_re (char '+') "\+"; eq_re (char '?') "\?"; eq_re (char '[') "\["; eq_re (char ']') "\]"; eq_re (char '^') "\^"; eq_re (char '$') "\$"; eq_re (char '\\') "\\\\"; ); expect_pass "special characters" (fun () -> eq_re notnl "."; eq_re (rep (char 'a')) "a*"; eq_re (rep1 (char 'a')) "a+"; eq_re (opt (char 'a')) "a?"; eq_re (alt [char 'b'; char 'a']) "[ab]"; eq_re (rg 'a' 'z') "[a-z]"; eq_re (alt [char '.'; char '%'; char '$'; rg 'a' 'z']) "[a-z$%.]"; eq_re (alt [char 'a'; char ']']) "[]a]"; eq_re (alt [char ']'; char '-']) "[]-]"; eq_re (alt [char '^'; char 'a']) "[a^]"; eq_re (compl [rg 'a' 'z']) "[^a-z]"; eq_re (compl [char '$'; rg 'a' 'z']) "[^a-z$]"; eq_re bol "^"; eq_re eol "$"; ); expect_pass "historical compatibility (not supported)" (fun () -> expect_equal_app (fun () -> raise Parse_error) () re "*ab"; expect_equal_app (fun () -> raise Parse_error) () re "+ab"; expect_equal_app (fun () -> raise Parse_error) () re "?ab"; ); expect_pass "alternative" (fun () -> eq_re (alt [char 'a'; char 'b']) "a\|b"; eq_re (alt [seq [char 'a'; char 'a']; seq [char 'b'; char 'b']]) "aa\|bb"; ); expect_pass "grouping" (fun () -> eq_re (group (char 'a')) "\(a\)"; eq_re (seq [group (alt [char 'a'; char 'b']); char 'c']) "\(a\|b\)c" ); expect_pass "backreferences" (fun () -> expect_equal_app (fun () -> raise Not_supported) () re "\0" ); expect_pass "word-constituent" (fun () -> eq_re (alt [alnum; char '_']) "\w"; eq_re (compl [alnum; char '_']) "\W"; ); (* syntax codes... ? *) expect_pass "contexts" (fun () -> eq_re bos "\`"; eq_re eos "\'"; eq_re start "\="; eq_re (alt [bow; eow]) "\\b"; eq_re not_boundary "\B"; eq_re bow "\<"; eq_re eow "\>"; ); ocaml-re-ocaml-re-1.2.2/lib_test/test_perl.ml000066400000000000000000000123231233171356200210540ustar00rootroot00000000000000open Re open Re_perl let eq_re ?opts r s = expect_equal_app ~msg:s id r (re ?opts) s ;; (* * Tests based on description of Perl regular expressions given at * http://www.perl.com/CPAN-local/doc/manual/html/pod/perlre.html *) expect_pass "ordinary characters" (fun () -> eq_re (char 'a') "a"; ); expect_pass "concatenation" (fun () -> eq_re (seq [char 'a'; char 'b']) "ab"; ); expect_pass "escaping metacharacters" (fun () -> eq_re (char '^') "\^"; eq_re (char '.') "\."; eq_re (char '$') "\$"; eq_re (char '|') "\|"; eq_re (char '(') "\("; eq_re (char ')') "\)"; eq_re (char '[') "\["; eq_re (char ']') "\]"; eq_re (char '*') "\*"; eq_re (char '+') "\+"; eq_re (char '?') "\?"; eq_re (char '\\') "\\\\"; ); expect_pass "basic metacharacters" (fun () -> eq_re bos "^"; eq_re notnl "."; eq_re eos "$"; eq_re (alt [char 'a'; char 'b']) "a|b"; eq_re (alt [seq [char 'a'; char 'a']; seq [char 'b'; char 'b']]) "aa|bb"; eq_re (group (char 'a')) "(a)"; eq_re (seq [group (alt [char 'a'; char 'b']); char 'c']) "(a|b)c"; eq_re (alt [char 'b'; char 'a']) "[ab]"; eq_re (rg 'a' 'z') "[a-z]"; eq_re (alt [char '.'; char '%'; char '$'; rg 'a' 'z']) "[a-z$%.]"; eq_re (alt [char 'z'; char 'a'; char '-']) "[-az]"; eq_re (alt [char 'z'; char '-'; char 'a']) "[az-]"; eq_re (alt [char 'z'; char '-'; char 'a']) "[a\-z]"; eq_re (alt [char 'a'; char ']']) "[]a]"; eq_re (alt [char ']'; char '-']) "[]-]"; eq_re (alt [char '^'; char 'a']) "[a^]"; eq_re (compl [rg 'a' 'z']) "[^a-z]"; eq_re (compl [char '$'; rg 'a' 'z']) "[^a-z$]"; ); expect_pass "greedy quantifiers" (fun () -> eq_re (greedy (rep (char 'a'))) "a*"; eq_re (greedy (rep1 (char 'a'))) "a+"; eq_re (greedy (opt (char 'a'))) "a?"; eq_re (greedy (repn (char 'a') 10 (Some 10))) "a{10}"; eq_re (greedy (repn (char 'a') 10 None)) "a{10,}"; eq_re (greedy (repn (char 'a') 10 (Some 12))) "a{10,12}"; ); expect_pass "non-greedy quantifiers" (fun () -> eq_re (non_greedy (rep (char 'a'))) "a*?"; eq_re (non_greedy (rep1 (char 'a'))) "a+?"; eq_re (non_greedy (opt (char 'a'))) "a??"; eq_re (non_greedy (repn (char 'a') 10 (Some 10))) "a{10}?"; eq_re (non_greedy (repn (char 'a') 10 None)) "a{10,}?"; eq_re (non_greedy (repn (char 'a') 10 (Some 12))) "a{10,12}?"; ); (* escape sequences (\t, etc) ? *) expect_pass "character sets" (fun () -> eq_re (alt [alnum; char '_']) "\w"; eq_re (compl [alnum; char '_']) "\W"; eq_re space "\s"; eq_re (compl [space]) "\S"; eq_re digit "\d"; eq_re (compl [digit]) "\D"; ); expect_pass "sets in classes" (fun () -> eq_re (alt [space; char 'a']) "[a\s]"; ); expect_pass "zero-width assertions" (fun () -> eq_re (alt [bow; eow]) "\\b"; eq_re not_boundary "\B"; eq_re bos "\A"; eq_re leol "\Z"; eq_re eos "\z"; eq_re start "\G"; ); expect_pass "backreferences" (fun () -> expect_equal_app (fun () -> raise Not_supported) () re "\0" ); expect_pass "comments" (fun () -> eq_re (seq [char 'a'; epsilon; char 'b']) "a(?#comment)b"; ); expect_pass "clustering" (fun () -> (* modifier support ? *) eq_re (char 'a') "(?:a)"; eq_re (seq [alt [char 'a'; char 'b']; char 'c']) "(?:a|b)c"; ); (* lookahead assertions *) (* independent subexpression *) (* conditional expression *) (* pattern-match modifiers *) expect_pass "options" (fun () -> eq_re ~opts:[`Anchored] (seq [start; char 'a']) "a"; eq_re ~opts:[`Caseless] (no_case (char 'b')) "b"; eq_re ~opts:[`Dollar_endonly] leol "$"; eq_re ~opts:[`Dollar_endonly; `Multiline] eol "$"; eq_re ~opts:[`Dotall] any "."; (* Extended ? *) eq_re ~opts:[`Multiline] bol "^"; eq_re ~opts:[`Multiline] eol "$"; eq_re ~opts:[`Ungreedy] (non_greedy (rep (char 'a'))) "a*"; eq_re ~opts:[`Ungreedy] (greedy (rep (char 'a'))) "a*?"; ); ocaml-re-ocaml-re-1.2.2/lib_test/test_re.ml000066400000000000000000000254151233171356200205260ustar00rootroot00000000000000open Re let re_match ?pos ?len r s res = expect_equal_app ~msg:(str_printer s) ~printer:arr_ofs_printer id res (fun () -> get_all_ofs (exec ?pos ?len (compile r) s)) () ;; let re_fail ?pos ?len r s = expect_equal_app ~msg:(str_printer s) ~printer:arr_ofs_printer not_found () (fun () -> get_all_ofs (exec ?pos ?len (compile r) s)) () ;; (* Substring Extraction *) let _ = let r = seq [group (char 'a'); opt (group (char 'a')); group (char 'b')] in let m = exec (compile r) "ab" in expect_pass "get" (fun () -> expect_eq_str id "ab" (get m) 0; expect_eq_str id "a" (get m) 1; expect_eq_str not_found () (get m) 2; expect_eq_str id "b" (get m) 3; expect_eq_str not_found () (get m) 4; ); expect_pass "get_ofs" (fun () -> expect_eq_ofs id (0,2) (get_ofs m) 0; expect_eq_ofs id (0,1) (get_ofs m) 1; expect_eq_ofs not_found () (get_ofs m) 2; expect_eq_ofs id (1,2) (get_ofs m) 3; expect_eq_ofs not_found () (get_ofs m) 4; ); expect_pass "get_all" (fun () -> expect_eq_arr_str id [|"ab";"a";"";"b"|] get_all m ); expect_pass "get_all_ofs" (fun () -> expect_eq_arr_ofs id [|(0,2);(0,1);(-1,-1);(1,2)|] get_all_ofs m ); expect_pass "test" (fun () -> expect_eq_bool id true (test m) 0; expect_eq_bool id true (test m) 1; expect_eq_bool id false (test m) 2; expect_eq_bool id true (test m) 3; expect_eq_bool id false (test m) 4; ); ;; (* Literal Match *) expect_pass "str" (fun () -> re_match (str "a") "a" [|(0,1)|]; re_fail (str "a") "b"; ); expect_pass "char" (fun () -> re_match (char 'a') "a" [|(0,1)|]; re_fail (char 'a') "b"; ); (* Basic Operations *) expect_pass "alt" (fun () -> re_match (alt [char 'a'; char 'b']) "a" [|(0,1)|]; re_match (alt [char 'a'; char 'b']) "b" [|(0,1)|]; re_fail (alt [char 'a'; char 'b']) "c"; ); expect_pass "seq" (fun () -> re_match (seq [char 'a'; char 'b']) "ab" [|(0,2)|]; re_fail (seq [char 'a'; char 'b']) "ac"; ); expect_pass "empty" (fun () -> re_fail (empty) ""; re_fail (empty) "a"; ); expect_pass "epsilon" (fun () -> re_match (epsilon) "" [|(0,0)|]; re_match (epsilon) "a" [|(0,0)|]; ); expect_pass "rep" (fun () -> re_match (rep (char 'a')) "" [|(0,0)|]; re_match (rep (char 'a')) "a" [|(0,1)|]; re_match (rep (char 'a')) "aa" [|(0,2)|]; re_match (rep (char 'a')) "b" [|(0,0)|]; ); expect_pass "rep1" (fun () -> re_match (rep1 (char 'a')) "a" [|(0,1)|]; re_match (rep1 (char 'a')) "aa" [|(0,2)|]; re_fail (rep1 (char 'a')) ""; re_fail (rep1 (char 'a')) "b"; ); expect_pass "repn" (fun () -> re_match (repn (char 'a') 0 None) "" [|(0,0)|]; re_match (repn (char 'a') 0 (Some 0)) "" [|(0,0)|]; re_match (repn (char 'a') 1 (Some 2)) "a" [|(0,1)|]; re_match (repn (char 'a') 1 (Some 2)) "aa" [|(0,2)|]; re_fail (repn (char 'a') 1 (Some 2)) ""; re_match (repn (char 'a') 1 (Some 2)) "aaa" [|(0,2)|]; expect_equal_app invalid_arg "Re.repn" (fun () -> repn empty (-1) None) (); expect_equal_app invalid_arg "Re.repn" (fun () -> repn empty 1 (Some 0)) (); ); expect_pass "opt" (fun () -> re_match (opt (char 'a')) "" [|(0,0)|]; re_match (opt (char 'a')) "a" [|(0,1)|]; ); (* String, line, word *) expect_pass "bol" (fun () -> re_match (seq [bol; char 'a']) "ab" [|(0,1)|]; re_match (seq [bol; char 'a']) "b\na" [|(2,3)|]; re_fail (seq [bol; char 'a']) "ba"; ); expect_pass "eol" (fun () -> re_match (seq [char 'a'; eol]) "ba" [|(1,2)|]; re_match (seq [char 'a'; eol]) "a\nb" [|(0,1)|]; re_match (seq [char 'a'; eol]) "ba\n" [|(1,2)|]; re_fail (seq [char 'a'; eol]) "ab"; ); expect_pass "bow" (fun () -> re_match (seq [bow; char 'a']) "a" [|(0,1)|]; re_match (seq [bow; char 'a']) "bb aa" [|(3,4)|]; re_fail (seq [bow; char 'a']) "ba ba"; ); expect_pass "eow" (fun () -> re_match (seq [char 'a'; eow]) "a" [|(0,1)|]; re_match (seq [char 'a'; eow]) "bb aa" [|(4,5)|]; re_fail (seq [char 'a'; eow]) "ab ab"; ); expect_pass "bos" (fun () -> re_match (seq [bos; char 'a']) "ab" [|(0,1)|]; re_fail (seq [bos; char 'a']) "b\na"; re_fail (seq [bos; char 'a']) "ba"; ); expect_pass "eos" (fun () -> re_match (seq [char 'a'; eos]) "ba" [|(1,2)|]; re_fail (seq [char 'a'; eos]) "a\nb"; re_fail (seq [char 'a'; eos]) "ba\n"; re_fail (seq [char 'a'; eos]) "ab"; ); expect_pass "leol" (fun () -> re_match (seq [char 'a'; leol]) "ba" [|(1,2)|]; re_fail (seq [char 'a'; leol]) "a\nb"; re_match (seq [char 'a'; leol]) "ba\n" [|(1,2)|]; re_fail (seq [char 'a'; leol]) "ab"; re_match (alt [str "b\n"; seq [char 'a'; leol]]) "ab\n" [|(1,3)|]; ); expect_pass "start" (fun () -> re_match ~pos:1 (seq [start; char 'a']) "xab" [|(1,2)|]; re_fail ~pos:1 (seq [start; char 'a']) "xb\na"; re_fail ~pos:1 (seq [start; char 'a']) "xba"; ); expect_pass "stop" (fun () -> re_match ~len:2 (seq [char 'a'; stop]) "bax" [|(1,2)|]; re_fail ~len:3 (seq [char 'a'; stop]) "a\nbx"; re_fail ~len:3 (seq [char 'a'; stop]) "ba\nx"; re_fail ~len:2 (seq [char 'a'; stop]) "abx"; ); expect_pass "word" (fun () -> re_match (word (str "aa")) "aa" [|(0,2)|]; re_match (word (str "aa")) "bb aa" [|(3,5)|]; re_fail (word (str "aa")) "aaa"; ); expect_pass "not_boundary" (fun () -> re_match (seq [not_boundary; char 'b'; not_boundary]) "abc" [|(1,2)|]; re_fail (seq [not_boundary; char 'a']) "abc"; re_fail (seq [char 'c'; not_boundary]) "abc"; ); (* Match semantics *) expect_pass "default match semantics" (fun () -> re_match (seq [(rep (alt [char 'a'; char 'b'])); char 'b']) "aabaab" [|(0,6)|]; re_match (alt [str "aa"; str "aaa"]) "aaaa" [|(0, 2)|]; re_match (alt [str "aaa"; str "aa"]) "aaaa" [|(0, 3)|]; ); expect_pass "shortest match" (fun () -> re_match (shortest (seq [(rep (alt [char 'a'; char 'b'])); char 'b'])) "aabaab" [|(0,3)|]; re_match (shortest (alt [str "aa"; str "aaa"])) "aaaa" [|(0, 2)|]; re_match (shortest (alt [str "aaa"; str "aa"])) "aaaa" [|(0, 2)|]; ); expect_pass "longest match" (fun () -> re_match (longest (seq [(rep (alt [char 'a'; char 'b'])); char 'b'])) "aabaab" [|(0,6)|]; re_match (longest (alt [str "aa"; str "aaa"])) "aaaa" [|(0, 3)|]; re_match (longest (alt [str "aaa"; str "aa"])) "aaaa" [|(0, 3)|]; ); expect_pass "first match" (fun () -> re_match (first (seq [(rep (alt [char 'a'; char 'b'])); char 'b'])) "aabaab" [|(0,6)|]; re_match (first (alt [str "aa"; str "aaa"])) "aaaa" [|(0, 2)|]; re_match (first (alt [str "aaa"; str "aa"])) "aaaa" [|(0, 3)|]; ); expect_pass "greedy" (fun () -> re_match (greedy (seq [(rep (alt [char 'a'; char 'b'])); char 'b'])) "aabaab" [|(0,6)|]; re_match (greedy (rep (group (opt (char 'a'))))) "aa" [|(0,2); (2,2)|]; ); expect_pass "non_greedy" (fun () -> re_match (non_greedy (longest (seq [(rep (alt [char 'a'; char 'b'])); char 'b']))) "aabaab" [|(0,6)|]; re_match (non_greedy (first (seq [(rep (alt [char 'a'; char 'b'])); char 'b']))) "aabaab" [|(0,3)|]; re_match (non_greedy (longest (rep (group (opt (char 'a')))))) "aa" [|(0,2); (1,2)|]; ); expect_pass "match semantics" (fun () -> let r = rep (group (alt [str "aaa"; str "aa"])) in re_match (longest r) "aaaaaaa" [|(0,7); (5, 7)|]; re_match (first r) "aaaaaaa" [|(0,6); (3, 6)|]; re_match (first (non_greedy r)) "aaaaaaa" [|(0,0); (-1, -1)|]; re_match (shortest r) "aaaaaaa" [|(0,0); (-1, -1)|]; let r' = rep (group (shortest (alt [str "aaa"; str "aa"]))) in re_match (longest r') "aaaaaaa" [|(0,7); (4, 7)|]; re_match (first r') "aaaaaaa" [|(0,6); (4, 6)|]; ); (* Group (or submatch) *) expect_pass "group" (fun () -> let r = seq [group (char 'a'); opt (group (char 'a')); group (char 'b')] in expect_eq_arr_ofs id [|(0,2);(0,1);(-1,-1);(1,2)|] (fun () -> get_all_ofs (exec (compile r) "ab")) () ); expect_pass "no_group" (fun () -> let r = no_group ( seq [group (char 'a'); opt (group (char 'a')); group (char 'b')] ) in expect_eq_arr_ofs id [|(0,2)|] (fun () -> get_all_ofs (exec (compile r) "ab")) () ); expect_pass "nest" (fun () -> let r = rep (nest (alt [group (char 'a'); char 'b'])) in re_match r "ab" [|(0,2); (-1, -1)|]; re_match r "ba" [|(0,2); (1, 2)|]; ); (* Character set *) expect_pass "set" (fun () -> re_match (rep1 (set "abcd")) "bcbadbabcdba" [|(0,12)|]; re_fail (set "abcd") "e"; ); expect_pass "rg" (fun () -> re_match (rep1 (rg '0' '9')) "0123456789" [|(0,10)|]; re_fail (rep1 (rg '0' '9')) "a"; ); expect_pass "inter" (fun () -> re_match (rep1 (inter [rg '0' '9'; rg '4' '6'])) "456" [|(0,3)|]; re_fail (rep1 (inter [rg '0' '9'; rg '4' '6'])) "7"; re_match (inter [alt [char 'a'; char 'b']; char 'b']) "b" [|(0,1)|]; ); expect_pass "diff" (fun () -> re_match (rep1 (diff (rg '0' '9') (rg '4' '6'))) "0123789" [|(0,7)|]; re_fail (rep1 (diff (rg '0' '9') (rg '4' '6'))) "4"; ); expect_pass "compl" (fun () -> re_match (rep1 (compl [rg '0' '9'; rg 'a' 'z'])) "A:Z+" [|(0,4)|]; re_fail (rep1 (compl [rg '0' '9'; rg 'a' 'z'])) "0"; re_fail (rep1 (compl [rg '0' '9'; rg 'a' 'z'])) "a"; ); (* Predefined character sets - should these be tested exhaustively? *) (* Case modifiers *) expect_pass "case" (fun () -> re_match (case (str "abc")) "abc" [|(0,3)|]; re_match (no_case (case (str "abc"))) "abc" [|(0,3)|]; re_fail (case (str "abc")) "ABC"; re_fail (no_case (case (str "abc"))) "ABC"; ); expect_pass "no_case" (fun () -> re_match (no_case (str "abc")) "abc" [|(0,3)|]; re_match (no_case (str "abc")) "ABC" [|(0,3)|]; re_match (case (no_case (str "abc"))) "abc" [|(0,3)|]; re_match (case (no_case (str "abc"))) "ABC" [|(0,3)|]; ); (* Fixed bugs *) expect_pass "bugs" (fun () -> try ignore (Re.compile (Re_perl.re "(.*?)(\\WPl|\\Bpl)(.*)")) with _ -> fail "bug in Re.handle_case" ); ocaml-re-ocaml-re-1.2.2/lib_test/test_str.ml000066400000000000000000000077131233171356200207310ustar00rootroot00000000000000let eq_match ?pos ?len ?(case = true) r s = expect_equal_app ~msg:(str_printer s) ~printer:arr_ofs_printer (fun () -> let pos = match pos with None -> 0 | Some p -> p in let pat = if case then Str.regexp r else Str.regexp_case_fold r in let s_start = Str.search_forward pat s pos in (* need a better way to determine group count - maybe parse the regular expression ? *) let n_groups = try let m = Re.exec ~pos ?len (Re.compile (Re_emacs.re ~case r)) s in Array.length (Re.get_all_ofs m) with _ -> 0 in (* extract all offset information *) let rec get_all_ofs i acc = if i >= n_groups then Array.of_list (List.rev acc) else let g_begin = try Str.group_beginning i with _ -> -1 in let g_end = try Str.group_end i with _ -> -1 in get_all_ofs (i + 1) ((g_begin, g_end) :: acc) in get_all_ofs 0 [] ) () (fun () -> Re.get_all_ofs ( Re.exec ?pos ?len (Re_emacs.compile (Re_emacs.re ~case r)) s ) ) () ;; (* Literal Match *) expect_pass "str" (fun () -> eq_match "a" "a"; eq_match "a" "b"; ); (* Basic Operations *) expect_pass "alt" (fun () -> eq_match "a\|b" "a"; eq_match "a\|b" "b"; eq_match "a\|b" "c"; ); expect_pass "seq" (fun () -> eq_match "ab" "ab"; eq_match "ab" "ac"; ); expect_pass "epsilon" (fun () -> eq_match "" ""; eq_match "" "a"; ); expect_pass "rep" (fun () -> eq_match "a*" ""; eq_match "a*" "a"; eq_match "a*" "aa"; eq_match "a*" "b"; ); expect_pass "rep1" (fun () -> eq_match "a+" "a"; eq_match "a+" "aa"; eq_match "a+" ""; eq_match "a+" "b"; ); expect_pass "opt" (fun () -> eq_match "a?" ""; eq_match "a?" "a"; ); (* String, line, word *) expect_pass "bol" (fun () -> eq_match "^a" "ab"; eq_match "^a" "b\na"; eq_match "^a" "ba"; ); expect_pass "eol" (fun () -> eq_match "a$" "ba"; eq_match "a$" "a\nb"; eq_match "a$" "ba\n"; eq_match "a$" "ab"; ); expect_pass "bow" (fun () -> eq_match "\ eq_match "\>a" "a"; eq_match "\>a" "bb aa"; eq_match "\>a" "ab ab"; ); expect_pass "bos" (fun () -> eq_match "\`a" "ab"; eq_match "\`a" "b\na"; eq_match "\`a" "ba"; ); expect_pass "eos" (fun () -> eq_match "a\'" "ba"; eq_match "a\'" "a\nb"; eq_match "a\'" "ba\n"; eq_match "a\'" "ab"; ); expect_pass "start" (fun () -> eq_match ~pos:1 "\=a" "xab"; eq_match ~pos:1 "\=a" "xb\na"; eq_match ~pos:1 "\=a" "xba"; ); expect_pass "not_boundary" (fun () -> eq_match "\Bb\B" "abc"; eq_match "\Ba" "abc"; eq_match "c\B" "abc"; ); (* Match semantics *) expect_pass "match semantics" (fun () -> eq_match "\(a\|b\)*b" "aabaab"; eq_match "aa\|aaa" "aaaa"; eq_match "aaa\|aa" "aaaa"; ); (* Group (or submatch) *) expect_pass "group" (fun () -> eq_match "\(a\)\(a\)?\(b\)" "ab"; ); (* Character set *) expect_pass "rg" (fun () -> eq_match "[0-9]+" "0123456789"; eq_match "[0-9]+" "a"; ); expect_pass "compl" (fun () -> eq_match "[^0-9a-z]+" "A:Z+"; eq_match "[^0-9a-z]+" "0"; eq_match "[^0-9a-z]+" "a"; ); (* Case modifiers *) expect_pass "no_case" (fun () -> eq_match ~case:false "abc" "abc"; eq_match ~case:false "abc" "ABC"; ); ocaml-re-ocaml-re-1.2.2/lib_test/unison.ml000066400000000000000000000112301233171356200203620ustar00rootroot00000000000000let desc = [ `Path "lablgtk-1.00/config.make"; `Path "lablgtk-1.00/lablgtktop_t"; `Path "lablgtk-1.00/lablgtktop"; `Path "lablgtk-1.00/lablgtkrun"; `Path "lablgtk-1.00/lablgtk"; `Path "unison3/src/unison"; `Name "core"; `Path "lipe/caisse/val_parse.h"; `Path "lipe/caisse/val_parse.c"; `Path "lipe/caisse/val_lex.c"; `Path "lipe/caisse/caisse"; `Path "lipe/runtime"; `Path "lipe/demo"; `Path "unison2/doc/unison-manual.ps"; `Path "unison/doc/unison-mal.ps"; `Name "*.ppi"; `Path "unison2/src/unison"; `Path "Xduce/xduce/pref.ml"; `Path "Xduce/xduce/xduce{,.opt}"; `Path "unison/src/TAGS"; `Path "unison/src/unison"; `Name "*.old"; `Name "#*#"; `Name "*.cm{i,o,x,a,xa}"; `Name "*.vo"; `Name "*{~,.aux,.bbl,.blg,.log,.toc,.o,.a}"; `Name "gmon.out"; `Name "ocamlprof.dump"; `Name "CVS"; `Name ".*.prcs_aux"; `Path "icfp2000/tools/src2tex"; `Path "icfp2000/temp.dvi"; `Path "icfp2000/main.dvi"; `Path "icfp2000/whole.dvi"; `Path "icfp2000/regsub.ps"; `Path "Views/main.dvi"; `Path "lipe/perso/caisse"; `Name "obsolete"; `Path "misc/fingerprint/cksum/cksum"; `Path "misc/relay/relay"; `Path "Xduce/xduce.current/xduce.opt"; `Path "Xduce/xduce.current/pref.ml"; `Path "Xduce/xduce.new/pref.ml"; `Path "Xduce/xduce.new/xduce.opt"; `Path "profiler/profiler"; `Path "ocaml/boot/Saved"; `Path "ocaml/byterun/ocamlrun"; `Path "ocaml/config/Makefile"; `Path "ocaml/config/m.h"; `Path "ocaml/config/s.h"; `Path "ocaml/expunge"; `Path "ocaml/asmcomp/arch.ml"; `Path "ocaml/asmcomp/emit.ml"; `Path "ocaml/asmcomp/proc.ml"; `Path "ocaml/asmcomp/reload.ml"; `Path "ocaml/asmcomp/scheduling.ml"; `Path "ocaml/asmcomp/selection.ml"; `Path "ocaml/debugger/ocamldebug"; `Path "ocaml/lex/ocamllex"; `Path "ocaml/ocaml"; `Path "ocaml/ocamlc"; `Path "ocaml/ocamlopt"; `Path "ocaml/otherlibs/dynlink/extract_crc"; `Path "ocaml/otherlibs/labltk/browser/ocamlbrowser"; `Path "ocaml/otherlibs/labltk/compiler/tkcompiler"; `Path "ocaml/otherlibs/str/regex-0.12/config.status"; `Path "ocaml/stdlib/camlheader"; `Path "ocaml/tools/cvt_emit"; `Path "ocaml/boot/camlheader"; `Path "ocaml/boot/ocamlrun"; `Path "ocaml/boot/ocamlyacc"; `Path "ocaml/otherlibs/labltk/lib/.depend"; `Path "ocaml/otherlibs/labltk/lib/labltk"; `Path "ocaml/otherlibs/labltk/lib/labltktop"; `Path "ocaml/otherlibs/labltk/lib/tk.ml"; `Path "ocaml/tools/ocamlcp"; `Path "ocaml/tools/ocamldep"; `Path "ocaml/tools/ocamlmktop"; `Path "ocaml/tools/ocamlprof"; `Path "ocaml/utils/config.ml"; `Path "ocaml/yacc/ocamlyacc"; `Path "Xduce/interleave/tools/src2tex"; `Path "xml/parser"; `Path "ocaml/ocamlopt.opt"; `Path "ocaml/boot/ocamlc"; `Path "ocaml/boot/ocamllex"; `Path "ocaml/ocamlc.opt"; `Path "specs/tools/src2f"; `Path "specs/tools/src2tex" ] let paths = [ "These"; "Xduce"; "unison"; "unison2"; "unison3"; "tinkertype"; "lipe"; "icfp2000"; "Views"; "sync"; "misc"; "lablgtk-1.00"; "mydb"; "yacc"; "db-papers"; "submissions"; "xml"; "profiler"; "specs"; "ocaml"; "rx" ] let rec children p = let rec loop ch dir = try let file = Unix.readdir dir in let ch' = if file = "." || file = ".." then ch else file :: ch in loop ch' dir with End_of_file -> ch in let dir = Unix.opendir p in let result = loop [] dir in Unix.closedir dir; result let is_dir p = try (Unix.lstat p).Unix.st_kind = Unix.S_DIR with Unix.Unix_error _ -> false let prefix ="/home/jerome/" let count = ref 0 let hit = ref 0 let rec visit rx p = (*incr count; if !count > 0 then raise Exit;*) try incr count; ignore (Re.exec ~group:false rx p); (*Format.eprintf "-%s@." p*) with Not_found -> (*Format.eprintf "+%s@." p;*) let fp = prefix ^ p in incr hit; if is_dir fp then List.iter (fun n -> visit rx (p ^ "/" ^ n)) (children fp) let _ = for i = 0 to 9 do count := 0; hit := 0; let rx = Re.seq [ Re.bos; Re.alt (List.map (fun p -> match p with `Path s -> Re_glob.globx s | `Name s -> Re.seq [Re.no_group (Re_posix.re "(.*/)?"); Re_glob.globx s]) desc); Re.eos ] in let rx = Re.compile rx in begin try List.iter (fun p -> visit rx p) paths with Exit -> () end; Format.eprintf "%d/%d@." !hit !count; done ocaml-re-ocaml-re-1.2.2/lib_test/unison2.ml000066400000000000000000000104511233171356200204500ustar00rootroot00000000000000let desc = [ `Path "lablgtk-1.00/config.make"; `Path "lablgtk-1.00/lablgtktop_t"; `Path "lablgtk-1.00/lablgtktop"; `Path "lablgtk-1.00/lablgtkrun"; `Path "lablgtk-1.00/lablgtk"; `Path "unison3/src/unison"; `Name "core"; `Path "lipe/caisse/val_parse.h"; `Path "lipe/caisse/val_parse.c"; `Path "lipe/caisse/val_lex.c"; `Path "lipe/caisse/caisse"; `Path "lipe/runtime"; `Path "lipe/demo"; `Path "unison2/doc/unison-manual.ps"; `Path "unison/doc/unison-mal.ps"; `Name "*.ppi"; `Path "unison2/src/unison"; `Path "Xduce/xduce/pref.ml"; `Path "Xduce/xduce/xduce{,.opt}"; `Path "unison/src/TAGS"; `Path "unison/src/unison"; `Name "*.old"; `Name "#*#"; `Name "*.cm{i,o,x,a,xa}"; `Name "*.vo"; `Name "*{~,.aux,.bbl,.blg,.log,.toc,.o,.a}"; `Name "gmon.out"; `Name "ocamlprof.dump"; `Name "CVS"; `Name ".*.prcs_aux"; `Path "icfp2000/tools/src2tex"; `Path "icfp2000/temp.dvi"; `Path "icfp2000/main.dvi"; `Path "icfp2000/whole.dvi"; `Path "icfp2000/regsub.ps"; `Path "Views/main.dvi"; `Path "lipe/perso/caisse"; `Name "obsolete"; `Path "misc/fingerprint/cksum/cksum"; `Path "misc/relay/relay"; `Path "Xduce/xduce.current/xduce.opt"; `Path "Xduce/xduce.current/pref.ml"; `Path "Xduce/xduce.new/pref.ml"; `Path "Xduce/xduce.new/xduce.opt"; `Path "profiler/profiler"; `Path "ocaml/boot/Saved"; `Path "ocaml/byterun/ocamlrun"; `Path "ocaml/config/Makefile"; `Path "ocaml/config/m.h"; `Path "ocaml/config/s.h"; `Path "ocaml/expunge"; `Path "ocaml/asmcomp/arch.ml"; `Path "ocaml/asmcomp/emit.ml"; `Path "ocaml/asmcomp/proc.ml"; `Path "ocaml/asmcomp/reload.ml"; `Path "ocaml/asmcomp/scheduling.ml"; `Path "ocaml/asmcomp/selection.ml"; `Path "ocaml/debugger/ocamldebug"; `Path "ocaml/lex/ocamllex"; `Path "ocaml/ocaml"; `Path "ocaml/ocamlc"; `Path "ocaml/ocamlopt"; `Path "ocaml/otherlibs/dynlink/extract_crc"; `Path "ocaml/otherlibs/labltk/browser/ocamlbrowser"; `Path "ocaml/otherlibs/labltk/compiler/tkcompiler"; `Path "ocaml/otherlibs/str/regex-0.12/config.status"; `Path "ocaml/stdlib/camlheader"; `Path "ocaml/tools/cvt_emit"; `Path "ocaml/boot/camlheader"; `Path "ocaml/boot/ocamlrun"; `Path "ocaml/boot/ocamlyacc"; `Path "ocaml/otherlibs/labltk/lib/.depend"; `Path "ocaml/otherlibs/labltk/lib/labltk"; `Path "ocaml/otherlibs/labltk/lib/labltktop"; `Path "ocaml/otherlibs/labltk/lib/tk.ml"; `Path "ocaml/tools/ocamlcp"; `Path "ocaml/tools/ocamldep"; `Path "ocaml/tools/ocamlmktop"; `Path "ocaml/tools/ocamlprof"; `Path "ocaml/utils/config.ml"; `Path "ocaml/yacc/ocamlyacc"; `Path "Xduce/interleave/tools/src2tex"; `Path "xml/parser"; `Path "ocaml/ocamlopt.opt"; `Path "ocaml/boot/ocamlc"; `Path "ocaml/boot/ocamllex"; `Path "ocaml/ocamlc.opt"; `Path "specs/tools/src2f"; `Path "specs/tools/src2tex" ] let paths = [ "These"; "Xduce"; "unison"; "unison2"; "unison3"; "tinkertype"; "lipe"; "icfp2000"; "Views"; "sync"; "misc"; "lablgtk-1.00"; "mydb"; "yacc"; "db-papers"; "submissions"; "xml"; "profiler"; "specs"; "ocaml"; "rx" ] let rec children p = let rec loop ch dir = try let file = Unix.readdir dir in let ch' = if file = "." || file = ".." then ch else file :: ch in loop ch' dir with End_of_file -> ch in let dir = Unix.opendir p in let result = loop [] dir in Unix.closedir dir; result let is_dir p = try (Unix.lstat p).Unix.st_kind = Unix.S_DIR with Unix.Unix_error _ -> false let prefix ="/home/jerome/" let rec visit rx p = if Rx.match_string rx p then ((*Format.eprintf "-%s@." p*)) else begin (*Format.eprintf "+%s@." p;*) let fp = prefix ^ p in if is_dir fp then List.iter (fun n -> visit rx (p ^ "/" ^ n)) (children fp) end let _ = let rx = Rx.alt (List.map (fun p -> match p with `Path s -> Rx.globx s | `Name s -> Rx.seq [Rx.rx "(.*/)?"; Rx.globx s]) desc); in List.iter (fun p -> visit rx p) paths ocaml-re-ocaml-re-1.2.2/lib_test/unison3.ml000066400000000000000000000117431233171356200204560ustar00rootroot00000000000000let desc = [ `Path "lablgtk-1.00/config.make"; `Path "lablgtk-1.00/lablgtktop_t"; `Path "lablgtk-1.00/lablgtktop"; `Path "lablgtk-1.00/lablgtkrun"; `Path "lablgtk-1.00/lablgtk"; `Path "unison3/src/unison"; `Name "core"; `Path "lipe/caisse/val_parse.h"; `Path "lipe/caisse/val_parse.c"; `Path "lipe/caisse/val_lex.c"; `Path "lipe/caisse/caisse"; `Path "lipe/runtime"; `Path "lipe/demo"; `Path "unison2/doc/unison-manual.ps"; `Path "unison/doc/unison-mal.ps"; `Name "*.ppi"; `Path "unison2/src/unison"; `Path "Xduce/xduce/pref.ml"; `Path "Xduce/xduce/xduce"; `Path "Xduce/xduce/xduce.opt"; `Path "unison/src/TAGS"; `Path "unison/src/unison"; `Name "*.old"; `Name "#*#"; `Name "*.cmi"; `Name "*.cmo"; `Name "*.cmx"; `Name "*.cma"; `Name "*.cmxa"; `Name "*.vo"; `Name "*~"; `Name "*.aux"; `Name "*.bbl"; `Name "*.blg"; `Name "*.log"; `Name "*.toc"; `Name "*.o"; `Name "*.a"; `Name "gmon.out"; `Name "ocamlprof.dump"; `Name "CVS"; `Name ".*.prcs_aux"; `Path "icfp2000/tools/src2tex"; `Path "icfp2000/temp.dvi"; `Path "icfp2000/main.dvi"; `Path "icfp2000/whole.dvi"; `Path "icfp2000/regsub.ps"; `Path "Views/main.dvi"; `Path "lipe/perso/caisse"; `Name "obsolete"; `Path "misc/fingerprint/cksum/cksum"; `Path "misc/relay/relay"; `Path "Xduce/xduce.current/xduce.opt"; `Path "Xduce/xduce.current/pref.ml"; `Path "Xduce/xduce.new/pref.ml"; `Path "Xduce/xduce.new/xduce.opt"; `Path "profiler/profiler"; `Path "ocaml/boot/Saved"; `Path "ocaml/byterun/ocamlrun"; `Path "ocaml/config/Makefile"; `Path "ocaml/config/m.h"; `Path "ocaml/config/s.h"; `Path "ocaml/expunge"; `Path "ocaml/asmcomp/arch.ml"; `Path "ocaml/asmcomp/emit.ml"; `Path "ocaml/asmcomp/proc.ml"; `Path "ocaml/asmcomp/reload.ml"; `Path "ocaml/asmcomp/scheduling.ml"; `Path "ocaml/asmcomp/selection.ml"; `Path "ocaml/debugger/ocamldebug"; `Path "ocaml/lex/ocamllex"; `Path "ocaml/ocaml"; `Path "ocaml/ocamlc"; `Path "ocaml/ocamlopt"; `Path "ocaml/otherlibs/dynlink/extract_crc"; `Path "ocaml/otherlibs/labltk/browser/ocamlbrowser"; `Path "ocaml/otherlibs/labltk/compiler/tkcompiler"; `Path "ocaml/otherlibs/str/regex-0.12/config.status"; `Path "ocaml/stdlib/camlheader"; `Path "ocaml/tools/cvt_emit"; `Path "ocaml/boot/camlheader"; `Path "ocaml/boot/ocamlrun"; `Path "ocaml/boot/ocamlyacc"; `Path "ocaml/otherlibs/labltk/lib/.depend"; `Path "ocaml/otherlibs/labltk/lib/labltk"; `Path "ocaml/otherlibs/labltk/lib/labltktop"; `Path "ocaml/otherlibs/labltk/lib/tk.ml"; `Path "ocaml/tools/ocamlcp"; `Path "ocaml/tools/ocamldep"; `Path "ocaml/tools/ocamlmktop"; `Path "ocaml/tools/ocamlprof"; `Path "ocaml/utils/config.ml"; `Path "ocaml/yacc/ocamlyacc"; `Path "Xduce/interleave/tools/src2tex"; `Path "xml/parser"; `Path "ocaml/ocamlopt.opt"; `Path "ocaml/boot/ocamlc"; `Path "ocaml/boot/ocamllex"; `Path "ocaml/ocamlc.opt"; `Path "specs/tools/src2f"; `Path "specs/tools/src2tex" ] let translate_char c = match c with '.' -> "\." | '*' -> "[^/]*" | _ -> String.make 1 c let translate_str s = let res = ref "" in for i = 0 to String.length s - 1 do res := !res ^ translate_char s.[i] done; !res let paths = [ "These"; "Xduce"; "unison"; "unison2"; "unison3"; "tinkertype"; "lipe"; "icfp2000"; "Views"; "sync"; "misc"; "lablgtk-1.00"; "mydb"; "yacc"; "db-papers"; "submissions"; "xml"; "profiler"; "specs"; "ocaml"; "rx" ] let rec children p = let rec loop ch dir = try let file = Unix.readdir dir in let ch' = if file = "." || file = ".." then ch else file :: ch in loop ch' dir with End_of_file -> ch in let dir = Unix.opendir p in let result = loop [] dir in Unix.closedir dir; result let is_dir p = try (Unix.lstat p).Unix.st_kind = Unix.S_DIR with Unix.Unix_error _ -> false let prefix ="/home/jerome/" let count = ref 0 let rec visit rx p = (*incr count; if !count > 50 then raise Exit;*) try ignore (Re_pcre.exec ~rex:rx p); (*Format.eprintf "-%s@." p*) with Not_found -> (*Format.eprintf "+%s@." p;*) let fp = prefix ^ p in if is_dir fp then List.iter (fun n -> visit rx (p ^ "/" ^ n)) (children fp) let _ = let l = List.map (fun p -> match p with `Path s -> translate_str s | `Name s -> "(?:.*/)?" ^ translate_str s) desc in let rx = "^(?:" ^ begin match l with x :: r -> x ^ List.fold_right (fun x rem -> "|" ^ x ^ rem) r "" | [] -> assert false end ^ ")$" in Format.eprintf "%s@." rx; for i = 0 to 9 do count := 0; let rx = Re_pcre.regexp rx in try List.iter (fun p -> visit rx p) paths with Exit -> () done ocaml-re-ocaml-re-1.2.2/myocamlbuild.ml000066400000000000000000000407541233171356200177400ustar00rootroot00000000000000(* OASIS_START *) (* DO NOT EDIT (digest: 3372e5c19b94735936c0fd2ebe57dc02) *) module OASISGettext = struct (* # 22 "src/oasis/OASISGettext.ml" *) let ns_ str = str let s_ str = str let f_ (str: ('a, 'b, 'c, 'd) format4) = str let fn_ fmt1 fmt2 n = if n = 1 then fmt1^^"" else fmt2^^"" let init = [] end module OASISExpr = struct (* # 22 "src/oasis/OASISExpr.ml" *) open OASISGettext type test = string type flag = string type t = | EBool of bool | ENot of t | EAnd of t * t | EOr of t * t | EFlag of flag | ETest of test * string type 'a choices = (t * 'a) list let eval var_get t = let rec eval' = function | EBool b -> b | ENot e -> not (eval' e) | EAnd (e1, e2) -> (eval' e1) && (eval' e2) | EOr (e1, e2) -> (eval' e1) || (eval' e2) | EFlag nm -> let v = var_get nm in assert(v = "true" || v = "false"); (v = "true") | ETest (nm, vl) -> let v = var_get nm in (v = vl) in eval' t let choose ?printer ?name var_get lst = let rec choose_aux = function | (cond, vl) :: tl -> if eval var_get cond then vl else choose_aux tl | [] -> let str_lst = if lst = [] then s_ "" else String.concat (s_ ", ") (List.map (fun (cond, vl) -> match printer with | Some p -> p vl | None -> s_ "") lst) in match name with | Some nm -> failwith (Printf.sprintf (f_ "No result for the choice list '%s': %s") nm str_lst) | None -> failwith (Printf.sprintf (f_ "No result for a choice list: %s") str_lst) in choose_aux (List.rev lst) end # 132 "myocamlbuild.ml" module BaseEnvLight = struct (* # 22 "src/base/BaseEnvLight.ml" *) module MapString = Map.Make(String) type t = string MapString.t let default_filename = Filename.concat (Sys.getcwd ()) "setup.data" let load ?(allow_empty=false) ?(filename=default_filename) () = if Sys.file_exists filename then begin let chn = open_in_bin filename in let st = Stream.of_channel chn in let line = ref 1 in let st_line = Stream.from (fun _ -> try match Stream.next st with | '\n' -> incr line; Some '\n' | c -> Some c with Stream.Failure -> None) in let lexer = Genlex.make_lexer ["="] st_line in let rec read_file mp = match Stream.npeek 3 lexer with | [Genlex.Ident nm; Genlex.Kwd "="; Genlex.String value] -> Stream.junk lexer; Stream.junk lexer; Stream.junk lexer; read_file (MapString.add nm value mp) | [] -> mp | _ -> failwith (Printf.sprintf "Malformed data file '%s' line %d" filename !line) in let mp = read_file MapString.empty in close_in chn; mp end else if allow_empty then begin MapString.empty end else begin failwith (Printf.sprintf "Unable to load environment, the file '%s' doesn't exist." filename) end let rec var_expand str env = let buff = Buffer.create ((String.length str) * 2) in Buffer.add_substitute buff (fun var -> try var_expand (MapString.find var env) env with Not_found -> failwith (Printf.sprintf "No variable %s defined when trying to expand %S." var str)) str; Buffer.contents buff let var_get name env = var_expand (MapString.find name env) env let var_choose lst env = OASISExpr.choose (fun nm -> var_get nm env) lst end # 237 "myocamlbuild.ml" module MyOCamlbuildFindlib = struct (* # 22 "src/plugins/ocamlbuild/MyOCamlbuildFindlib.ml" *) (** OCamlbuild extension, copied from * http://brion.inria.fr/gallium/index.php/Using_ocamlfind_with_ocamlbuild * by N. Pouillard and others * * Updated on 2009/02/28 * * Modified by Sylvain Le Gall *) open Ocamlbuild_plugin (* these functions are not really officially exported *) let run_and_read = Ocamlbuild_pack.My_unix.run_and_read let blank_sep_strings = Ocamlbuild_pack.Lexers.blank_sep_strings let exec_from_conf exec = let exec = let env_filename = Pathname.basename BaseEnvLight.default_filename in let env = BaseEnvLight.load ~filename:env_filename ~allow_empty:true () in try BaseEnvLight.var_get exec env with Not_found -> Printf.eprintf "W: Cannot get variable %s\n" exec; exec in let fix_win32 str = if Sys.os_type = "Win32" then begin let buff = Buffer.create (String.length str) in (* Adapt for windowsi, ocamlbuild + win32 has a hard time to handle '\\'. *) String.iter (fun c -> Buffer.add_char buff (if c = '\\' then '/' else c)) str; Buffer.contents buff end else begin str end in fix_win32 exec let split s ch = let buf = Buffer.create 13 in let x = ref [] in let flush () = x := (Buffer.contents buf) :: !x; Buffer.clear buf in String.iter (fun c -> if c = ch then flush () else Buffer.add_char buf c) s; flush (); List.rev !x let split_nl s = split s '\n' let before_space s = try String.before s (String.index s ' ') with Not_found -> s (* ocamlfind command *) let ocamlfind x = S[Sh (exec_from_conf "ocamlfind"); x] (* This lists all supported packages. *) let find_packages () = List.map before_space (split_nl & run_and_read "ocamlfind list") (* Mock to list available syntaxes. *) let find_syntaxes () = ["camlp4o"; "camlp4r"] let well_known_syntax = [ "camlp4.quotations.o"; "camlp4.quotations.r"; "camlp4.exceptiontracer"; "camlp4.extend"; "camlp4.foldgenerator"; "camlp4.listcomprehension"; "camlp4.locationstripper"; "camlp4.macro"; "camlp4.mapgenerator"; "camlp4.metagenerator"; "camlp4.profiler"; "camlp4.tracer" ] let dispatch = function | After_options -> (* By using Before_options one let command line options have an higher * priority on the contrary using After_options will guarantee to have * the higher priority override default commands by ocamlfind ones *) Options.ocamlc := ocamlfind & A"ocamlc"; Options.ocamlopt := ocamlfind & A"ocamlopt"; Options.ocamldep := ocamlfind & A"ocamldep"; Options.ocamldoc := ocamlfind & A"ocamldoc"; Options.ocamlmktop := ocamlfind & A"ocamlmktop"; Options.ocamlmklib := ocamlfind & A"ocamlmklib" | After_rules -> (* When one link an OCaml library/binary/package, one should use * -linkpkg *) flag ["ocaml"; "link"; "program"] & A"-linkpkg"; (* For each ocamlfind package one inject the -package option when * compiling, computing dependencies, generating documentation and * linking. *) List.iter begin fun pkg -> let base_args = [A"-package"; A pkg] in (* TODO: consider how to really choose camlp4o or camlp4r. *) let syn_args = [A"-syntax"; A "camlp4o"] in let args = (* Heuristic to identify syntax extensions: whether they end in ".syntax"; some might not. *) if Filename.check_suffix pkg "syntax" || List.mem pkg well_known_syntax then syn_args @ base_args else base_args in flag ["ocaml"; "compile"; "pkg_"^pkg] & S args; flag ["ocaml"; "ocamldep"; "pkg_"^pkg] & S args; flag ["ocaml"; "doc"; "pkg_"^pkg] & S args; flag ["ocaml"; "link"; "pkg_"^pkg] & S base_args; flag ["ocaml"; "infer_interface"; "pkg_"^pkg] & S args; end (find_packages ()); (* Like -package but for extensions syntax. Morover -syntax is useless * when linking. *) List.iter begin fun syntax -> flag ["ocaml"; "compile"; "syntax_"^syntax] & S[A"-syntax"; A syntax]; flag ["ocaml"; "ocamldep"; "syntax_"^syntax] & S[A"-syntax"; A syntax]; flag ["ocaml"; "doc"; "syntax_"^syntax] & S[A"-syntax"; A syntax]; flag ["ocaml"; "infer_interface"; "syntax_"^syntax] & S[A"-syntax"; A syntax]; end (find_syntaxes ()); (* The default "thread" tag is not compatible with ocamlfind. * Indeed, the default rules add the "threads.cma" or "threads.cmxa" * options when using this tag. When using the "-linkpkg" option with * ocamlfind, this module will then be added twice on the command line. * * To solve this, one approach is to add the "-thread" option when using * the "threads" package using the previous plugin. *) flag ["ocaml"; "pkg_threads"; "compile"] (S[A "-thread"]); flag ["ocaml"; "pkg_threads"; "doc"] (S[A "-I"; A "+threads"]); flag ["ocaml"; "pkg_threads"; "link"] (S[A "-thread"]); flag ["ocaml"; "pkg_threads"; "infer_interface"] (S[A "-thread"]); flag ["ocaml"; "package(threads)"; "compile"] (S[A "-thread"]); flag ["ocaml"; "package(threads)"; "doc"] (S[A "-I"; A "+threads"]); flag ["ocaml"; "package(threads)"; "link"] (S[A "-thread"]); flag ["ocaml"; "package(threads)"; "infer_interface"] (S[A "-thread"]); | _ -> () end module MyOCamlbuildBase = struct (* # 22 "src/plugins/ocamlbuild/MyOCamlbuildBase.ml" *) (** Base functions for writing myocamlbuild.ml @author Sylvain Le Gall *) open Ocamlbuild_plugin module OC = Ocamlbuild_pack.Ocaml_compiler type dir = string type file = string type name = string type tag = string (* # 62 "src/plugins/ocamlbuild/MyOCamlbuildBase.ml" *) type t = { lib_ocaml: (name * dir list * string list) list; lib_c: (name * dir * file list) list; flags: (tag list * (spec OASISExpr.choices)) list; (* Replace the 'dir: include' from _tags by a precise interdepends in * directory. *) includes: (dir * dir list) list; } let env_filename = Pathname.basename BaseEnvLight.default_filename let dispatch_combine lst = fun e -> List.iter (fun dispatch -> dispatch e) lst let tag_libstubs nm = "use_lib"^nm^"_stubs" let nm_libstubs nm = nm^"_stubs" let dispatch t e = let env = BaseEnvLight.load ~filename:env_filename ~allow_empty:true () in match e with | Before_options -> let no_trailing_dot s = if String.length s >= 1 && s.[0] = '.' then String.sub s 1 ((String.length s) - 1) else s in List.iter (fun (opt, var) -> try opt := no_trailing_dot (BaseEnvLight.var_get var env) with Not_found -> Printf.eprintf "W: Cannot get variable %s\n" var) [ Options.ext_obj, "ext_obj"; Options.ext_lib, "ext_lib"; Options.ext_dll, "ext_dll"; ] | After_rules -> (* Declare OCaml libraries *) List.iter (function | nm, [], intf_modules -> ocaml_lib nm; let cmis = List.map (fun m -> (String.uncapitalize m) ^ ".cmi") intf_modules in dep ["ocaml"; "link"; "library"; "file:"^nm^".cma"] cmis | nm, dir :: tl, intf_modules -> ocaml_lib ~dir:dir (dir^"/"^nm); List.iter (fun dir -> List.iter (fun str -> flag ["ocaml"; "use_"^nm; str] (S[A"-I"; P dir])) ["compile"; "infer_interface"; "doc"]) tl; let cmis = List.map (fun m -> dir^"/"^(String.uncapitalize m)^".cmi") intf_modules in dep ["ocaml"; "link"; "library"; "file:"^dir^"/"^nm^".cma"] cmis) t.lib_ocaml; (* Declare directories dependencies, replace "include" in _tags. *) List.iter (fun (dir, include_dirs) -> Pathname.define_context dir include_dirs) t.includes; (* Declare C libraries *) List.iter (fun (lib, dir, headers) -> (* Handle C part of library *) flag ["link"; "library"; "ocaml"; "byte"; tag_libstubs lib] (S[A"-dllib"; A("-l"^(nm_libstubs lib)); A"-cclib"; A("-l"^(nm_libstubs lib))]); flag ["link"; "library"; "ocaml"; "native"; tag_libstubs lib] (S[A"-cclib"; A("-l"^(nm_libstubs lib))]); flag ["link"; "program"; "ocaml"; "byte"; tag_libstubs lib] (S[A"-dllib"; A("dll"^(nm_libstubs lib))]); (* When ocaml link something that use the C library, then one need that file to be up to date. *) dep ["link"; "ocaml"; "program"; tag_libstubs lib] [dir/"lib"^(nm_libstubs lib)^"."^(!Options.ext_lib)]; dep ["compile"; "ocaml"; "program"; tag_libstubs lib] [dir/"lib"^(nm_libstubs lib)^"."^(!Options.ext_lib)]; (* TODO: be more specific about what depends on headers *) (* Depends on .h files *) dep ["compile"; "c"] headers; (* Setup search path for lib *) flag ["link"; "ocaml"; "use_"^lib] (S[A"-I"; P(dir)]); ) t.lib_c; (* Add flags *) List.iter (fun (tags, cond_specs) -> let spec = BaseEnvLight.var_choose cond_specs env in let rec eval_specs = function | S lst -> S (List.map eval_specs lst) | A str -> A (BaseEnvLight.var_expand str env) | spec -> spec in flag tags & (eval_specs spec)) t.flags | _ -> () let dispatch_default t = dispatch_combine [ dispatch t; MyOCamlbuildFindlib.dispatch; ] end # 594 "myocamlbuild.ml" open Ocamlbuild_plugin;; let package_default = { MyOCamlbuildBase.lib_ocaml = [ ("re", ["lib"], []); ("re_emacs", ["lib"], []); ("re_str", ["lib"], []); ("re_posix", ["lib"], []); ("re_glob", ["lib"], []); ("re_perl", ["lib"], []); ("re_pcre", ["lib"], []) ]; lib_c = []; flags = []; includes = [("lib_test", ["lib"])] } ;; let dispatch_default = MyOCamlbuildBase.dispatch_default package_default;; # 617 "myocamlbuild.ml" (* OASIS_STOP *) Ocamlbuild_plugin.dispatch dispatch_default;; ocaml-re-ocaml-re-1.2.2/setup.ml000066400000000000000000005631571233171356200164260ustar00rootroot00000000000000(* setup.ml generated for the first time by OASIS v0.2.1~alpha1 *) (* OASIS_START *) (* DO NOT EDIT (digest: 4f6f2d76da30e8c558142a5420989416) *) (* Regenerated by OASIS v0.4.4 Visit http://oasis.forge.ocamlcore.org for more information and documentation about functions used in this file. *) module OASISGettext = struct (* # 22 "src/oasis/OASISGettext.ml" *) let ns_ str = str let s_ str = str let f_ (str: ('a, 'b, 'c, 'd) format4) = str let fn_ fmt1 fmt2 n = if n = 1 then fmt1^^"" else fmt2^^"" let init = [] end module OASISContext = struct (* # 22 "src/oasis/OASISContext.ml" *) open OASISGettext type level = [ `Debug | `Info | `Warning | `Error] type t = { (* TODO: replace this by a proplist. *) quiet: bool; info: bool; debug: bool; ignore_plugins: bool; ignore_unknown_fields: bool; printf: level -> string -> unit; } let printf lvl str = let beg = match lvl with | `Error -> s_ "E: " | `Warning -> s_ "W: " | `Info -> s_ "I: " | `Debug -> s_ "D: " in prerr_endline (beg^str) let default = ref { quiet = false; info = false; debug = false; ignore_plugins = false; ignore_unknown_fields = false; printf = printf; } let quiet = {!default with quiet = true} let fspecs () = (* TODO: don't act on default. *) let ignore_plugins = ref false in ["-quiet", Arg.Unit (fun () -> default := {!default with quiet = true}), s_ " Run quietly"; "-info", Arg.Unit (fun () -> default := {!default with info = true}), s_ " Display information message"; "-debug", Arg.Unit (fun () -> default := {!default with debug = true}), s_ " Output debug message"; "-ignore-plugins", Arg.Set ignore_plugins, s_ " Ignore plugin's field."; "-C", (* TODO: remove this chdir. *) Arg.String (fun str -> Sys.chdir str), s_ "dir Change directory before running."], fun () -> {!default with ignore_plugins = !ignore_plugins} end module OASISString = struct (* # 22 "src/oasis/OASISString.ml" *) (** Various string utilities. Mostly inspired by extlib and batteries ExtString and BatString libraries. @author Sylvain Le Gall *) let nsplitf str f = if str = "" then [] else let buf = Buffer.create 13 in let lst = ref [] in let push () = lst := Buffer.contents buf :: !lst; Buffer.clear buf in let str_len = String.length str in for i = 0 to str_len - 1 do if f str.[i] then push () else Buffer.add_char buf str.[i] done; push (); List.rev !lst (** [nsplit c s] Split the string [s] at char [c]. It doesn't include the separator. *) let nsplit str c = nsplitf str ((=) c) let find ~what ?(offset=0) str = let what_idx = ref 0 in let str_idx = ref offset in while !str_idx < String.length str && !what_idx < String.length what do if str.[!str_idx] = what.[!what_idx] then incr what_idx else what_idx := 0; incr str_idx done; if !what_idx <> String.length what then raise Not_found else !str_idx - !what_idx let sub_start str len = let str_len = String.length str in if len >= str_len then "" else String.sub str len (str_len - len) let sub_end ?(offset=0) str len = let str_len = String.length str in if len >= str_len then "" else String.sub str 0 (str_len - len) let starts_with ~what ?(offset=0) str = let what_idx = ref 0 in let str_idx = ref offset in let ok = ref true in while !ok && !str_idx < String.length str && !what_idx < String.length what do if str.[!str_idx] = what.[!what_idx] then incr what_idx else ok := false; incr str_idx done; if !what_idx = String.length what then true else false let strip_starts_with ~what str = if starts_with ~what str then sub_start str (String.length what) else raise Not_found let ends_with ~what ?(offset=0) str = let what_idx = ref ((String.length what) - 1) in let str_idx = ref ((String.length str) - 1) in let ok = ref true in while !ok && offset <= !str_idx && 0 <= !what_idx do if str.[!str_idx] = what.[!what_idx] then decr what_idx else ok := false; decr str_idx done; if !what_idx = -1 then true else false let strip_ends_with ~what str = if ends_with ~what str then sub_end str (String.length what) else raise Not_found let replace_chars f s = let buf = String.make (String.length s) 'X' in for i = 0 to String.length s - 1 do buf.[i] <- f s.[i] done; buf end module OASISUtils = struct (* # 22 "src/oasis/OASISUtils.ml" *) open OASISGettext module MapExt = struct module type S = sig include Map.S val add_list: 'a t -> (key * 'a) list -> 'a t val of_list: (key * 'a) list -> 'a t val to_list: 'a t -> (key * 'a) list end module Make (Ord: Map.OrderedType) = struct include Map.Make(Ord) let rec add_list t = function | (k, v) :: tl -> add_list (add k v t) tl | [] -> t let of_list lst = add_list empty lst let to_list t = fold (fun k v acc -> (k, v) :: acc) t [] end end module MapString = MapExt.Make(String) module SetExt = struct module type S = sig include Set.S val add_list: t -> elt list -> t val of_list: elt list -> t val to_list: t -> elt list end module Make (Ord: Set.OrderedType) = struct include Set.Make(Ord) let rec add_list t = function | e :: tl -> add_list (add e t) tl | [] -> t let of_list lst = add_list empty lst let to_list = elements end end module SetString = SetExt.Make(String) let compare_csl s1 s2 = String.compare (String.lowercase s1) (String.lowercase s2) module HashStringCsl = Hashtbl.Make (struct type t = string let equal s1 s2 = (String.lowercase s1) = (String.lowercase s2) let hash s = Hashtbl.hash (String.lowercase s) end) module SetStringCsl = SetExt.Make (struct type t = string let compare = compare_csl end) let varname_of_string ?(hyphen='_') s = if String.length s = 0 then begin invalid_arg "varname_of_string" end else begin let buf = OASISString.replace_chars (fun c -> if ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z') || ('0' <= c && c <= '9') then c else hyphen) s; in let buf = (* Start with a _ if digit *) if '0' <= s.[0] && s.[0] <= '9' then "_"^buf else buf in String.lowercase buf end let varname_concat ?(hyphen='_') p s = let what = String.make 1 hyphen in let p = try OASISString.strip_ends_with ~what p with Not_found -> p in let s = try OASISString.strip_starts_with ~what s with Not_found -> s in p^what^s let is_varname str = str = varname_of_string str let failwithf fmt = Printf.ksprintf failwith fmt end module PropList = struct (* # 22 "src/oasis/PropList.ml" *) open OASISGettext type name = string exception Not_set of name * string option exception No_printer of name exception Unknown_field of name * name let () = Printexc.register_printer (function | Not_set (nm, Some rsn) -> Some (Printf.sprintf (f_ "Field '%s' is not set: %s") nm rsn) | Not_set (nm, None) -> Some (Printf.sprintf (f_ "Field '%s' is not set") nm) | No_printer nm -> Some (Printf.sprintf (f_ "No default printer for value %s") nm) | Unknown_field (nm, schm) -> Some (Printf.sprintf (f_ "Field %s is not defined in schema %s") nm schm) | _ -> None) module Data = struct type t = (name, unit -> unit) Hashtbl.t let create () = Hashtbl.create 13 let clear t = Hashtbl.clear t (* # 78 "src/oasis/PropList.ml" *) end module Schema = struct type ('ctxt, 'extra) value = { get: Data.t -> string; set: Data.t -> ?context:'ctxt -> string -> unit; help: (unit -> string) option; extra: 'extra; } type ('ctxt, 'extra) t = { name: name; fields: (name, ('ctxt, 'extra) value) Hashtbl.t; order: name Queue.t; name_norm: string -> string; } let create ?(case_insensitive=false) nm = { name = nm; fields = Hashtbl.create 13; order = Queue.create (); name_norm = (if case_insensitive then String.lowercase else fun s -> s); } let add t nm set get extra help = let key = t.name_norm nm in if Hashtbl.mem t.fields key then failwith (Printf.sprintf (f_ "Field '%s' is already defined in schema '%s'") nm t.name); Hashtbl.add t.fields key { set = set; get = get; help = help; extra = extra; }; Queue.add nm t.order let mem t nm = Hashtbl.mem t.fields nm let find t nm = try Hashtbl.find t.fields (t.name_norm nm) with Not_found -> raise (Unknown_field (nm, t.name)) let get t data nm = (find t nm).get data let set t data nm ?context x = (find t nm).set data ?context x let fold f acc t = Queue.fold (fun acc k -> let v = find t k in f acc k v.extra v.help) acc t.order let iter f t = fold (fun () -> f) () t let name t = t.name end module Field = struct type ('ctxt, 'value, 'extra) t = { set: Data.t -> ?context:'ctxt -> 'value -> unit; get: Data.t -> 'value; sets: Data.t -> ?context:'ctxt -> string -> unit; gets: Data.t -> string; help: (unit -> string) option; extra: 'extra; } let new_id = let last_id = ref 0 in fun () -> incr last_id; !last_id let create ?schema ?name ?parse ?print ?default ?update ?help extra = (* Default value container *) let v = ref None in (* If name is not given, create unique one *) let nm = match name with | Some s -> s | None -> Printf.sprintf "_anon_%d" (new_id ()) in (* Last chance to get a value: the default *) let default () = match default with | Some d -> d | None -> raise (Not_set (nm, Some (s_ "no default value"))) in (* Get data *) let get data = (* Get value *) try (Hashtbl.find data nm) (); match !v with | Some x -> x | None -> default () with Not_found -> default () in (* Set data *) let set data ?context x = let x = match update with | Some f -> begin try f ?context (get data) x with Not_set _ -> x end | None -> x in Hashtbl.replace data nm (fun () -> v := Some x) in (* Parse string value, if possible *) let parse = match parse with | Some f -> f | None -> fun ?context s -> failwith (Printf.sprintf (f_ "Cannot parse field '%s' when setting value %S") nm s) in (* Set data, from string *) let sets data ?context s = set ?context data (parse ?context s) in (* Output value as string, if possible *) let print = match print with | Some f -> f | None -> fun _ -> raise (No_printer nm) in (* Get data, as a string *) let gets data = print (get data) in begin match schema with | Some t -> Schema.add t nm sets gets extra help | None -> () end; { set = set; get = get; sets = sets; gets = gets; help = help; extra = extra; } let fset data t ?context x = t.set data ?context x let fget data t = t.get data let fsets data t ?context s = t.sets data ?context s let fgets data t = t.gets data end module FieldRO = struct let create ?schema ?name ?parse ?print ?default ?update ?help extra = let fld = Field.create ?schema ?name ?parse ?print ?default ?update ?help extra in fun data -> Field.fget data fld end end module OASISMessage = struct (* # 22 "src/oasis/OASISMessage.ml" *) open OASISGettext open OASISContext let generic_message ~ctxt lvl fmt = let cond = if ctxt.quiet then false else match lvl with | `Debug -> ctxt.debug | `Info -> ctxt.info | _ -> true in Printf.ksprintf (fun str -> if cond then begin ctxt.printf lvl str end) fmt let debug ~ctxt fmt = generic_message ~ctxt `Debug fmt let info ~ctxt fmt = generic_message ~ctxt `Info fmt let warning ~ctxt fmt = generic_message ~ctxt `Warning fmt let error ~ctxt fmt = generic_message ~ctxt `Error fmt end module OASISVersion = struct (* # 22 "src/oasis/OASISVersion.ml" *) open OASISGettext type s = string type t = string type comparator = | VGreater of t | VGreaterEqual of t | VEqual of t | VLesser of t | VLesserEqual of t | VOr of comparator * comparator | VAnd of comparator * comparator (* Range of allowed characters *) let is_digit c = '0' <= c && c <= '9' let is_alpha c = ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z') let is_special = function | '.' | '+' | '-' | '~' -> true | _ -> false let rec version_compare v1 v2 = if v1 <> "" || v2 <> "" then begin (* Compare ascii string, using special meaning for version * related char *) let val_ascii c = if c = '~' then -1 else if is_digit c then 0 else if c = '\000' then 0 else if is_alpha c then Char.code c else (Char.code c) + 256 in let len1 = String.length v1 in let len2 = String.length v2 in let p = ref 0 in (** Compare ascii part *) let compare_vascii () = let cmp = ref 0 in while !cmp = 0 && !p < len1 && !p < len2 && not (is_digit v1.[!p] && is_digit v2.[!p]) do cmp := (val_ascii v1.[!p]) - (val_ascii v2.[!p]); incr p done; if !cmp = 0 && !p < len1 && !p = len2 then val_ascii v1.[!p] else if !cmp = 0 && !p = len1 && !p < len2 then - (val_ascii v2.[!p]) else !cmp in (** Compare digit part *) let compare_digit () = let extract_int v p = let start_p = !p in while !p < String.length v && is_digit v.[!p] do incr p done; let substr = String.sub v !p ((String.length v) - !p) in let res = match String.sub v start_p (!p - start_p) with | "" -> 0 | s -> int_of_string s in res, substr in let i1, tl1 = extract_int v1 (ref !p) in let i2, tl2 = extract_int v2 (ref !p) in i1 - i2, tl1, tl2 in match compare_vascii () with | 0 -> begin match compare_digit () with | 0, tl1, tl2 -> if tl1 <> "" && is_digit tl1.[0] then 1 else if tl2 <> "" && is_digit tl2.[0] then -1 else version_compare tl1 tl2 | n, _, _ -> n end | n -> n end else begin 0 end let version_of_string str = str let string_of_version t = t let version_compare_string s1 s2 = version_compare (version_of_string s1) (version_of_string s2) let chop t = try let pos = String.rindex t '.' in String.sub t 0 pos with Not_found -> t let rec comparator_apply v op = match op with | VGreater cv -> (version_compare v cv) > 0 | VGreaterEqual cv -> (version_compare v cv) >= 0 | VLesser cv -> (version_compare v cv) < 0 | VLesserEqual cv -> (version_compare v cv) <= 0 | VEqual cv -> (version_compare v cv) = 0 | VOr (op1, op2) -> (comparator_apply v op1) || (comparator_apply v op2) | VAnd (op1, op2) -> (comparator_apply v op1) && (comparator_apply v op2) let rec string_of_comparator = function | VGreater v -> "> "^(string_of_version v) | VEqual v -> "= "^(string_of_version v) | VLesser v -> "< "^(string_of_version v) | VGreaterEqual v -> ">= "^(string_of_version v) | VLesserEqual v -> "<= "^(string_of_version v) | VOr (c1, c2) -> (string_of_comparator c1)^" || "^(string_of_comparator c2) | VAnd (c1, c2) -> (string_of_comparator c1)^" && "^(string_of_comparator c2) let rec varname_of_comparator = let concat p v = OASISUtils.varname_concat p (OASISUtils.varname_of_string (string_of_version v)) in function | VGreater v -> concat "gt" v | VLesser v -> concat "lt" v | VEqual v -> concat "eq" v | VGreaterEqual v -> concat "ge" v | VLesserEqual v -> concat "le" v | VOr (c1, c2) -> (varname_of_comparator c1)^"_or_"^(varname_of_comparator c2) | VAnd (c1, c2) -> (varname_of_comparator c1)^"_and_"^(varname_of_comparator c2) let rec comparator_ge v' = let cmp v = version_compare v v' >= 0 in function | VEqual v | VGreaterEqual v | VGreater v -> cmp v | VLesserEqual _ | VLesser _ -> false | VOr (c1, c2) -> comparator_ge v' c1 || comparator_ge v' c2 | VAnd (c1, c2) -> comparator_ge v' c1 && comparator_ge v' c2 end module OASISLicense = struct (* # 22 "src/oasis/OASISLicense.ml" *) (** License for _oasis fields @author Sylvain Le Gall *) type license = string type license_exception = string type license_version = | Version of OASISVersion.t | VersionOrLater of OASISVersion.t | NoVersion type license_dep_5_unit = { license: license; excption: license_exception option; version: license_version; } type license_dep_5 = | DEP5Unit of license_dep_5_unit | DEP5Or of license_dep_5 list | DEP5And of license_dep_5 list type t = | DEP5License of license_dep_5 | OtherLicense of string (* URL *) end module OASISExpr = struct (* # 22 "src/oasis/OASISExpr.ml" *) open OASISGettext type test = string type flag = string type t = | EBool of bool | ENot of t | EAnd of t * t | EOr of t * t | EFlag of flag | ETest of test * string type 'a choices = (t * 'a) list let eval var_get t = let rec eval' = function | EBool b -> b | ENot e -> not (eval' e) | EAnd (e1, e2) -> (eval' e1) && (eval' e2) | EOr (e1, e2) -> (eval' e1) || (eval' e2) | EFlag nm -> let v = var_get nm in assert(v = "true" || v = "false"); (v = "true") | ETest (nm, vl) -> let v = var_get nm in (v = vl) in eval' t let choose ?printer ?name var_get lst = let rec choose_aux = function | (cond, vl) :: tl -> if eval var_get cond then vl else choose_aux tl | [] -> let str_lst = if lst = [] then s_ "" else String.concat (s_ ", ") (List.map (fun (cond, vl) -> match printer with | Some p -> p vl | None -> s_ "") lst) in match name with | Some nm -> failwith (Printf.sprintf (f_ "No result for the choice list '%s': %s") nm str_lst) | None -> failwith (Printf.sprintf (f_ "No result for a choice list: %s") str_lst) in choose_aux (List.rev lst) end module OASISText = struct (* # 22 "src/oasis/OASISText.ml" *) type elt = | Para of string | Verbatim of string | BlankLine type t = elt list end module OASISTypes = struct (* # 22 "src/oasis/OASISTypes.ml" *) type name = string type package_name = string type url = string type unix_dirname = string type unix_filename = string type host_dirname = string type host_filename = string type prog = string type arg = string type args = string list type command_line = (prog * arg list) type findlib_name = string type findlib_full = string type compiled_object = | Byte | Native | Best type dependency = | FindlibPackage of findlib_full * OASISVersion.comparator option | InternalLibrary of name type tool = | ExternalTool of name | InternalExecutable of name type vcs = | Darcs | Git | Svn | Cvs | Hg | Bzr | Arch | Monotone | OtherVCS of url type plugin_kind = [ `Configure | `Build | `Doc | `Test | `Install | `Extra ] type plugin_data_purpose = [ `Configure | `Build | `Install | `Clean | `Distclean | `Install | `Uninstall | `Test | `Doc | `Extra | `Other of string ] type 'a plugin = 'a * name * OASISVersion.t option type all_plugin = plugin_kind plugin type plugin_data = (all_plugin * plugin_data_purpose * (unit -> unit)) list (* # 115 "src/oasis/OASISTypes.ml" *) type 'a conditional = 'a OASISExpr.choices type custom = { pre_command: (command_line option) conditional; post_command: (command_line option) conditional; } type common_section = { cs_name: name; cs_data: PropList.Data.t; cs_plugin_data: plugin_data; } type build_section = { bs_build: bool conditional; bs_install: bool conditional; bs_path: unix_dirname; bs_compiled_object: compiled_object; bs_build_depends: dependency list; bs_build_tools: tool list; bs_c_sources: unix_filename list; bs_data_files: (unix_filename * unix_filename option) list; bs_ccopt: args conditional; bs_cclib: args conditional; bs_dlllib: args conditional; bs_dllpath: args conditional; bs_byteopt: args conditional; bs_nativeopt: args conditional; } type library = { lib_modules: string list; lib_pack: bool; lib_internal_modules: string list; lib_findlib_parent: findlib_name option; lib_findlib_name: findlib_name option; lib_findlib_containers: findlib_name list; } type object_ = { obj_modules: string list; obj_findlib_fullname: findlib_name list option; } type executable = { exec_custom: bool; exec_main_is: unix_filename; } type flag = { flag_description: string option; flag_default: bool conditional; } type source_repository = { src_repo_type: vcs; src_repo_location: url; src_repo_browser: url option; src_repo_module: string option; src_repo_branch: string option; src_repo_tag: string option; src_repo_subdir: unix_filename option; } type test = { test_type: [`Test] plugin; test_command: command_line conditional; test_custom: custom; test_working_directory: unix_filename option; test_run: bool conditional; test_tools: tool list; } type doc_format = | HTML of unix_filename | DocText | PDF | PostScript | Info of unix_filename | DVI | OtherDoc type doc = { doc_type: [`Doc] plugin; doc_custom: custom; doc_build: bool conditional; doc_install: bool conditional; doc_install_dir: unix_filename; doc_title: string; doc_authors: string list; doc_abstract: string option; doc_format: doc_format; doc_data_files: (unix_filename * unix_filename option) list; doc_build_tools: tool list; } type section = | Library of common_section * build_section * library | Object of common_section * build_section * object_ | Executable of common_section * build_section * executable | Flag of common_section * flag | SrcRepo of common_section * source_repository | Test of common_section * test | Doc of common_section * doc type section_kind = [ `Library | `Object | `Executable | `Flag | `SrcRepo | `Test | `Doc ] type package = { oasis_version: OASISVersion.t; ocaml_version: OASISVersion.comparator option; findlib_version: OASISVersion.comparator option; alpha_features: string list; beta_features: string list; name: package_name; version: OASISVersion.t; license: OASISLicense.t; license_file: unix_filename option; copyrights: string list; maintainers: string list; authors: string list; homepage: url option; synopsis: string; description: OASISText.t option; categories: url list; conf_type: [`Configure] plugin; conf_custom: custom; build_type: [`Build] plugin; build_custom: custom; install_type: [`Install] plugin; install_custom: custom; uninstall_custom: custom; clean_custom: custom; distclean_custom: custom; files_ab: unix_filename list; sections: section list; plugins: [`Extra] plugin list; disable_oasis_section: unix_filename list; schema_data: PropList.Data.t; plugin_data: plugin_data; } end module OASISFeatures = struct (* # 22 "src/oasis/OASISFeatures.ml" *) open OASISTypes open OASISUtils open OASISGettext open OASISVersion module MapPlugin = Map.Make (struct type t = plugin_kind * name let compare = Pervasives.compare end) module Data = struct type t = { oasis_version: OASISVersion.t; plugin_versions: OASISVersion.t option MapPlugin.t; alpha_features: string list; beta_features: string list; } let create oasis_version alpha_features beta_features = { oasis_version = oasis_version; plugin_versions = MapPlugin.empty; alpha_features = alpha_features; beta_features = beta_features } let of_package pkg = create pkg.OASISTypes.oasis_version pkg.OASISTypes.alpha_features pkg.OASISTypes.beta_features let add_plugin (plugin_kind, plugin_name, plugin_version) t = {t with plugin_versions = MapPlugin.add (plugin_kind, plugin_name) plugin_version t.plugin_versions} let plugin_version plugin_kind plugin_name t = MapPlugin.find (plugin_kind, plugin_name) t.plugin_versions let to_string t = Printf.sprintf "oasis_version: %s; alpha_features: %s; beta_features: %s; \ plugins_version: %s" (OASISVersion.string_of_version t.oasis_version) (String.concat ", " t.alpha_features) (String.concat ", " t.beta_features) (String.concat ", " (MapPlugin.fold (fun (_, plg) ver_opt acc -> (plg^ (match ver_opt with | Some v -> " "^(OASISVersion.string_of_version v) | None -> "")) :: acc) t.plugin_versions [])) end type origin = | Field of string * string | Section of string | NoOrigin type stage = Alpha | Beta let string_of_stage = function | Alpha -> "alpha" | Beta -> "beta" let field_of_stage = function | Alpha -> "AlphaFeatures" | Beta -> "BetaFeatures" type publication = InDev of stage | SinceVersion of OASISVersion.t type t = { name: string; plugin: all_plugin option; publication: publication; description: unit -> string; } (* TODO: mutex protect this. *) let all_features = Hashtbl.create 13 let since_version ver_str = SinceVersion (version_of_string ver_str) let alpha = InDev Alpha let beta = InDev Beta let to_string t = Printf.sprintf "feature: %s; plugin: %s; publication: %s" t.name (match t.plugin with | None -> "" | Some (_, nm, _) -> nm) (match t.publication with | InDev stage -> string_of_stage stage | SinceVersion ver -> ">= "^(OASISVersion.string_of_version ver)) let data_check t data origin = let no_message = "no message" in let check_feature features stage = let has_feature = List.mem t.name features in if not has_feature then match origin with | Field (fld, where) -> Some (Printf.sprintf (f_ "Field %s in %s is only available when feature %s \ is in field %s.") fld where t.name (field_of_stage stage)) | Section sct -> Some (Printf.sprintf (f_ "Section %s is only available when features %s \ is in field %s.") sct t.name (field_of_stage stage)) | NoOrigin -> Some no_message else None in let version_is_good ~min_version version fmt = let version_is_good = OASISVersion.comparator_apply version (OASISVersion.VGreaterEqual min_version) in Printf.ksprintf (fun str -> if version_is_good then None else Some str) fmt in match origin, t.plugin, t.publication with | _, _, InDev Alpha -> check_feature data.Data.alpha_features Alpha | _, _, InDev Beta -> check_feature data.Data.beta_features Beta | Field(fld, where), None, SinceVersion min_version -> version_is_good ~min_version data.Data.oasis_version (f_ "Field %s in %s is only valid since OASIS v%s, update \ OASISFormat field from '%s' to '%s' after checking \ OASIS changelog.") fld where (string_of_version min_version) (string_of_version data.Data.oasis_version) (string_of_version min_version) | Field(fld, where), Some(plugin_knd, plugin_name, _), SinceVersion min_version -> begin try let plugin_version_current = try match Data.plugin_version plugin_knd plugin_name data with | Some ver -> ver | None -> failwithf (f_ "Field %s in %s is only valid for the OASIS \ plugin %s since v%s, but no plugin version is \ defined in the _oasis file, change '%s' to \ '%s (%s)' in your _oasis file.") fld where plugin_name (string_of_version min_version) plugin_name plugin_name (string_of_version min_version) with Not_found -> failwithf (f_ "Field %s in %s is only valid when the OASIS plugin %s \ is defined.") fld where plugin_name in version_is_good ~min_version plugin_version_current (f_ "Field %s in %s is only valid for the OASIS plugin %s \ since v%s, update your plugin from '%s (%s)' to \ '%s (%s)' after checking the plugin's changelog.") fld where plugin_name (string_of_version min_version) plugin_name (string_of_version plugin_version_current) plugin_name (string_of_version min_version) with Failure msg -> Some msg end | Section sct, None, SinceVersion min_version -> version_is_good ~min_version data.Data.oasis_version (f_ "Section %s is only valid for since OASIS v%s, update \ OASISFormat field from '%s' to '%s' after checking OASIS \ changelog.") sct (string_of_version min_version) (string_of_version data.Data.oasis_version) (string_of_version min_version) | Section sct, Some(plugin_knd, plugin_name, _), SinceVersion min_version -> begin try let plugin_version_current = try match Data.plugin_version plugin_knd plugin_name data with | Some ver -> ver | None -> failwithf (f_ "Section %s is only valid for the OASIS \ plugin %s since v%s, but no plugin version is \ defined in the _oasis file, change '%s' to \ '%s (%s)' in your _oasis file.") sct plugin_name (string_of_version min_version) plugin_name plugin_name (string_of_version min_version) with Not_found -> failwithf (f_ "Section %s is only valid when the OASIS plugin %s \ is defined.") sct plugin_name in version_is_good ~min_version plugin_version_current (f_ "Section %s is only valid for the OASIS plugin %s \ since v%s, update your plugin from '%s (%s)' to \ '%s (%s)' after checking the plugin's changelog.") sct plugin_name (string_of_version min_version) plugin_name (string_of_version plugin_version_current) plugin_name (string_of_version min_version) with Failure msg -> Some msg end | NoOrigin, None, SinceVersion min_version -> version_is_good ~min_version data.Data.oasis_version "%s" no_message | NoOrigin, Some(plugin_knd, plugin_name, _), SinceVersion min_version -> begin try let plugin_version_current = match Data.plugin_version plugin_knd plugin_name data with | Some ver -> ver | None -> raise Not_found in version_is_good ~min_version plugin_version_current "%s" no_message with Not_found -> Some no_message end let data_assert t data origin = match data_check t data origin with | None -> () | Some str -> failwith str let data_test t data = match data_check t data NoOrigin with | None -> true | Some str -> false let package_test t pkg = data_test t (Data.of_package pkg) let create ?plugin name publication description = let () = if Hashtbl.mem all_features name then failwithf "Feature '%s' is already declared." name in let t = { name = name; plugin = plugin; publication = publication; description = description; } in Hashtbl.add all_features name t; t let get_stage name = try (Hashtbl.find all_features name).publication with Not_found -> failwithf (f_ "Feature %s doesn't exist.") name let list () = Hashtbl.fold (fun _ v acc -> v :: acc) all_features [] (* * Real flags. *) let features = create "features_fields" (since_version "0.4") (fun () -> s_ "Enable to experiment not yet official features.") let flag_docs = create "flag_docs" (since_version "0.3") (fun () -> s_ "Building docs require '-docs' flag at configure.") let flag_tests = create "flag_tests" (since_version "0.3") (fun () -> s_ "Running tests require '-tests' flag at configure.") let pack = create "pack" (since_version "0.3") (fun () -> s_ "Allow to create packed library.") let section_object = create "section_object" beta (fun () -> s_ "Implement an object section.") let dynrun_for_release = create "dynrun_for_release" alpha (fun () -> s_ "Make '-setup-update dynamic' suitable for releasing project.") let compiled_setup_ml = create "compiled_setup_ml" alpha (fun () -> s_ "It compiles the setup.ml and speed-up actions done with it.") let disable_oasis_section = create "disable_oasis_section" alpha (fun () -> s_ "Allows the OASIS section comments and digest to be omitted in \ generated files.") end module OASISUnixPath = struct (* # 22 "src/oasis/OASISUnixPath.ml" *) type unix_filename = string type unix_dirname = string type host_filename = string type host_dirname = string let current_dir_name = "." let parent_dir_name = ".." let is_current_dir fn = fn = current_dir_name || fn = "" let concat f1 f2 = if is_current_dir f1 then f2 else let f1' = try OASISString.strip_ends_with ~what:"/" f1 with Not_found -> f1 in f1'^"/"^f2 let make = function | hd :: tl -> List.fold_left (fun f p -> concat f p) hd tl | [] -> invalid_arg "OASISUnixPath.make" let dirname f = try String.sub f 0 (String.rindex f '/') with Not_found -> current_dir_name let basename f = try let pos_start = (String.rindex f '/') + 1 in String.sub f pos_start ((String.length f) - pos_start) with Not_found -> f let chop_extension f = try let last_dot = String.rindex f '.' in let sub = String.sub f 0 last_dot in try let last_slash = String.rindex f '/' in if last_slash < last_dot then sub else f with Not_found -> sub with Not_found -> f let capitalize_file f = let dir = dirname f in let base = basename f in concat dir (String.capitalize base) let uncapitalize_file f = let dir = dirname f in let base = basename f in concat dir (String.uncapitalize base) end module OASISHostPath = struct (* # 22 "src/oasis/OASISHostPath.ml" *) open Filename module Unix = OASISUnixPath let make = function | [] -> invalid_arg "OASISHostPath.make" | hd :: tl -> List.fold_left Filename.concat hd tl let of_unix ufn = if Sys.os_type = "Unix" then ufn else make (List.map (fun p -> if p = Unix.current_dir_name then current_dir_name else if p = Unix.parent_dir_name then parent_dir_name else p) (OASISString.nsplit ufn '/')) end module OASISSection = struct (* # 22 "src/oasis/OASISSection.ml" *) open OASISTypes let section_kind_common = function | Library (cs, _, _) -> `Library, cs | Object (cs, _, _) -> `Object, cs | Executable (cs, _, _) -> `Executable, cs | Flag (cs, _) -> `Flag, cs | SrcRepo (cs, _) -> `SrcRepo, cs | Test (cs, _) -> `Test, cs | Doc (cs, _) -> `Doc, cs let section_common sct = snd (section_kind_common sct) let section_common_set cs = function | Library (_, bs, lib) -> Library (cs, bs, lib) | Object (_, bs, obj) -> Object (cs, bs, obj) | Executable (_, bs, exec) -> Executable (cs, bs, exec) | Flag (_, flg) -> Flag (cs, flg) | SrcRepo (_, src_repo) -> SrcRepo (cs, src_repo) | Test (_, tst) -> Test (cs, tst) | Doc (_, doc) -> Doc (cs, doc) (** Key used to identify section *) let section_id sct = let k, cs = section_kind_common sct in k, cs.cs_name let string_of_section sct = let k, nm = section_id sct in (match k with | `Library -> "library" | `Object -> "object" | `Executable -> "executable" | `Flag -> "flag" | `SrcRepo -> "src repository" | `Test -> "test" | `Doc -> "doc") ^" "^nm let section_find id scts = List.find (fun sct -> id = section_id sct) scts module CSection = struct type t = section let id = section_id let compare t1 t2 = compare (id t1) (id t2) let equal t1 t2 = (id t1) = (id t2) let hash t = Hashtbl.hash (id t) end module MapSection = Map.Make(CSection) module SetSection = Set.Make(CSection) end module OASISBuildSection = struct (* # 22 "src/oasis/OASISBuildSection.ml" *) end module OASISExecutable = struct (* # 22 "src/oasis/OASISExecutable.ml" *) open OASISTypes let unix_exec_is (cs, bs, exec) is_native ext_dll suffix_program = let dir = OASISUnixPath.concat bs.bs_path (OASISUnixPath.dirname exec.exec_main_is) in let is_native_exec = match bs.bs_compiled_object with | Native -> true | Best -> is_native () | Byte -> false in OASISUnixPath.concat dir (cs.cs_name^(suffix_program ())), if not is_native_exec && not exec.exec_custom && bs.bs_c_sources <> [] then Some (dir^"/dll"^cs.cs_name^"_stubs"^(ext_dll ())) else None end module OASISLibrary = struct (* # 22 "src/oasis/OASISLibrary.ml" *) open OASISTypes open OASISUtils open OASISGettext open OASISSection (* Look for a module file, considering capitalization or not. *) let find_module source_file_exists bs modul = let possible_base_fn = List.map (OASISUnixPath.concat bs.bs_path) [modul; OASISUnixPath.uncapitalize_file modul; OASISUnixPath.capitalize_file modul] in (* TODO: we should be able to be able to determine the source for every * files. Hence we should introduce a Module(source: fn) for the fields * Modules and InternalModules *) List.fold_left (fun acc base_fn -> match acc with | `No_sources _ -> begin let file_found = List.fold_left (fun acc ext -> if source_file_exists (base_fn^ext) then (base_fn^ext) :: acc else acc) [] [".ml"; ".mli"; ".mll"; ".mly"] in match file_found with | [] -> acc | lst -> `Sources (base_fn, lst) end | `Sources _ -> acc) (`No_sources possible_base_fn) possible_base_fn let source_unix_files ~ctxt (cs, bs, lib) source_file_exists = List.fold_left (fun acc modul -> match find_module source_file_exists bs modul with | `Sources (base_fn, lst) -> (base_fn, lst) :: acc | `No_sources _ -> OASISMessage.warning ~ctxt (f_ "Cannot find source file matching \ module '%s' in library %s") modul cs.cs_name; acc) [] (lib.lib_modules @ lib.lib_internal_modules) let generated_unix_files ~ctxt ~is_native ~has_native_dynlink ~ext_lib ~ext_dll ~source_file_exists (cs, bs, lib) = let find_modules lst ext = let find_module modul = match find_module source_file_exists bs modul with | `Sources (base_fn, [fn]) when ext <> "cmi" && Filename.check_suffix fn ".mli" -> None (* No implementation files for pure interface. *) | `Sources (base_fn, _) -> Some [base_fn] | `No_sources lst -> OASISMessage.warning ~ctxt (f_ "Cannot find source file matching \ module '%s' in library %s") modul cs.cs_name; Some lst in List.fold_left (fun acc nm -> match find_module nm with | None -> acc | Some base_fns -> List.map (fun base_fn -> base_fn ^"."^ext) base_fns :: acc) [] lst in (* The headers that should be compiled along *) let headers = if lib.lib_pack then [] else find_modules lib.lib_modules "cmi" in (* The .cmx that be compiled along *) let cmxs = let should_be_built = match bs.bs_compiled_object with | Native -> true | Best -> is_native | Byte -> false in if should_be_built then if lib.lib_pack then find_modules [cs.cs_name] "cmx" else find_modules (lib.lib_modules @ lib.lib_internal_modules) "cmx" else [] in let acc_nopath = [] in (* Compute what libraries should be built *) let acc_nopath = (* Add the packed header file if required *) let add_pack_header acc = if lib.lib_pack then [cs.cs_name^".cmi"] :: acc else acc in let byte acc = add_pack_header ([cs.cs_name^".cma"] :: acc) in let native acc = let acc = add_pack_header (if has_native_dynlink then [cs.cs_name^".cmxs"] :: acc else acc) in [cs.cs_name^".cmxa"] :: [cs.cs_name^ext_lib] :: acc in match bs.bs_compiled_object with | Native -> byte (native acc_nopath) | Best when is_native -> byte (native acc_nopath) | Byte | Best -> byte acc_nopath in (* Add C library to be built *) let acc_nopath = if bs.bs_c_sources <> [] then begin ["lib"^cs.cs_name^"_stubs"^ext_lib] :: ["dll"^cs.cs_name^"_stubs"^ext_dll] :: acc_nopath end else acc_nopath in (* All the files generated *) List.rev_append (List.rev_map (List.rev_map (OASISUnixPath.concat bs.bs_path)) acc_nopath) (headers @ cmxs) end module OASISObject = struct (* # 22 "src/oasis/OASISObject.ml" *) open OASISTypes open OASISGettext let source_unix_files ~ctxt (cs, bs, obj) source_file_exists = List.fold_left (fun acc modul -> match OASISLibrary.find_module source_file_exists bs modul with | `Sources (base_fn, lst) -> (base_fn, lst) :: acc | `No_sources _ -> OASISMessage.warning ~ctxt (f_ "Cannot find source file matching \ module '%s' in object %s") modul cs.cs_name; acc) [] obj.obj_modules let generated_unix_files ~ctxt ~is_native ~source_file_exists (cs, bs, obj) = let find_module ext modul = match OASISLibrary.find_module source_file_exists bs modul with | `Sources (base_fn, _) -> [base_fn ^ ext] | `No_sources lst -> OASISMessage.warning ~ctxt (f_ "Cannot find source file matching \ module '%s' in object %s") modul cs.cs_name ; lst in let header, byte, native, c_object, f = match obj.obj_modules with | [ m ] -> (find_module ".cmi" m, find_module ".cmo" m, find_module ".cmx" m, find_module ".o" m, fun x -> x) | _ -> ([cs.cs_name ^ ".cmi"], [cs.cs_name ^ ".cmo"], [cs.cs_name ^ ".cmx"], [cs.cs_name ^ ".o"], OASISUnixPath.concat bs.bs_path) in List.map (List.map f) ( match bs.bs_compiled_object with | Native -> native :: c_object :: byte :: header :: [] | Best when is_native -> native :: c_object :: byte :: header :: [] | Byte | Best -> byte :: header :: []) end module OASISFindlib = struct (* # 22 "src/oasis/OASISFindlib.ml" *) open OASISTypes open OASISUtils open OASISGettext open OASISSection type library_name = name type findlib_part_name = name type 'a map_of_findlib_part_name = 'a OASISUtils.MapString.t exception InternalLibraryNotFound of library_name exception FindlibPackageNotFound of findlib_name type group_t = | Container of findlib_name * group_t list | Package of (findlib_name * common_section * build_section * [`Library of library | `Object of object_] * group_t list) type data = common_section * build_section * [`Library of library | `Object of object_] type tree = | Node of (data option) * (tree MapString.t) | Leaf of data let findlib_mapping pkg = (* Map from library name to either full findlib name or parts + parent. *) let fndlb_parts_of_lib_name = let fndlb_parts cs lib = let name = match lib.lib_findlib_name with | Some nm -> nm | None -> cs.cs_name in let name = String.concat "." (lib.lib_findlib_containers @ [name]) in name in List.fold_left (fun mp -> function | Library (cs, _, lib) -> begin let lib_name = cs.cs_name in let fndlb_parts = fndlb_parts cs lib in if MapString.mem lib_name mp then failwithf (f_ "The library name '%s' is used more than once.") lib_name; match lib.lib_findlib_parent with | Some lib_name_parent -> MapString.add lib_name (`Unsolved (lib_name_parent, fndlb_parts)) mp | None -> MapString.add lib_name (`Solved fndlb_parts) mp end | Object (cs, _, obj) -> begin let obj_name = cs.cs_name in if MapString.mem obj_name mp then failwithf (f_ "The object name '%s' is used more than once.") obj_name; let findlib_full_name = match obj.obj_findlib_fullname with | Some ns -> String.concat "." ns | None -> obj_name in MapString.add obj_name (`Solved findlib_full_name) mp end | Executable _ | Test _ | Flag _ | SrcRepo _ | Doc _ -> mp) MapString.empty pkg.sections in (* Solve the above graph to be only library name to full findlib name. *) let fndlb_name_of_lib_name = let rec solve visited mp lib_name lib_name_child = if SetString.mem lib_name visited then failwithf (f_ "Library '%s' is involved in a cycle \ with regard to findlib naming.") lib_name; let visited = SetString.add lib_name visited in try match MapString.find lib_name mp with | `Solved fndlb_nm -> fndlb_nm, mp | `Unsolved (lib_nm_parent, post_fndlb_nm) -> let pre_fndlb_nm, mp = solve visited mp lib_nm_parent lib_name in let fndlb_nm = pre_fndlb_nm^"."^post_fndlb_nm in fndlb_nm, MapString.add lib_name (`Solved fndlb_nm) mp with Not_found -> failwithf (f_ "Library '%s', which is defined as the findlib parent of \ library '%s', doesn't exist.") lib_name lib_name_child in let mp = MapString.fold (fun lib_name status mp -> match status with | `Solved _ -> (* Solved initialy, no need to go further *) mp | `Unsolved _ -> let _, mp = solve SetString.empty mp lib_name "" in mp) fndlb_parts_of_lib_name fndlb_parts_of_lib_name in MapString.map (function | `Solved fndlb_nm -> fndlb_nm | `Unsolved _ -> assert false) mp in (* Convert an internal library name to a findlib name. *) let findlib_name_of_library_name lib_nm = try MapString.find lib_nm fndlb_name_of_lib_name with Not_found -> raise (InternalLibraryNotFound lib_nm) in (* Add a library to the tree. *) let add sct mp = let fndlb_fullname = let cs, _, _ = sct in let lib_name = cs.cs_name in findlib_name_of_library_name lib_name in let rec add_children nm_lst (children: tree MapString.t) = match nm_lst with | (hd :: tl) -> begin let node = try add_node tl (MapString.find hd children) with Not_found -> (* New node *) new_node tl in MapString.add hd node children end | [] -> (* Should not have a nameless library. *) assert false and add_node tl node = if tl = [] then begin match node with | Node (None, children) -> Node (Some sct, children) | Leaf (cs', _, _) | Node (Some (cs', _, _), _) -> (* TODO: allow to merge Package, i.e. * archive(byte) = "foo.cma foo_init.cmo" *) let cs, _, _ = sct in failwithf (f_ "Library '%s' and '%s' have the same findlib name '%s'") cs.cs_name cs'.cs_name fndlb_fullname end else begin match node with | Leaf data -> Node (Some data, add_children tl MapString.empty) | Node (data_opt, children) -> Node (data_opt, add_children tl children) end and new_node = function | [] -> Leaf sct | hd :: tl -> Node (None, MapString.add hd (new_node tl) MapString.empty) in add_children (OASISString.nsplit fndlb_fullname '.') mp in let rec group_of_tree mp = MapString.fold (fun nm node acc -> let cur = match node with | Node (Some (cs, bs, lib), children) -> Package (nm, cs, bs, lib, group_of_tree children) | Node (None, children) -> Container (nm, group_of_tree children) | Leaf (cs, bs, lib) -> Package (nm, cs, bs, lib, []) in cur :: acc) mp [] in let group_mp = List.fold_left (fun mp -> function | Library (cs, bs, lib) -> add (cs, bs, `Library lib) mp | Object (cs, bs, obj) -> add (cs, bs, `Object obj) mp | _ -> mp) MapString.empty pkg.sections in let groups = group_of_tree group_mp in let library_name_of_findlib_name = Lazy.lazy_from_fun (fun () -> (* Revert findlib_name_of_library_name. *) MapString.fold (fun k v mp -> MapString.add v k mp) fndlb_name_of_lib_name MapString.empty) in let library_name_of_findlib_name fndlb_nm = try MapString.find fndlb_nm (Lazy.force library_name_of_findlib_name) with Not_found -> raise (FindlibPackageNotFound fndlb_nm) in groups, findlib_name_of_library_name, library_name_of_findlib_name let findlib_of_group = function | Container (fndlb_nm, _) | Package (fndlb_nm, _, _, _, _) -> fndlb_nm let root_of_group grp = let rec root_lib_aux = (* We do a DFS in the group. *) function | Container (_, children) -> List.fold_left (fun res grp -> if res = None then root_lib_aux grp else res) None children | Package (_, cs, bs, lib, _) -> Some (cs, bs, lib) in match root_lib_aux grp with | Some res -> res | None -> failwithf (f_ "Unable to determine root library of findlib library '%s'") (findlib_of_group grp) end module OASISFlag = struct (* # 22 "src/oasis/OASISFlag.ml" *) end module OASISPackage = struct (* # 22 "src/oasis/OASISPackage.ml" *) end module OASISSourceRepository = struct (* # 22 "src/oasis/OASISSourceRepository.ml" *) end module OASISTest = struct (* # 22 "src/oasis/OASISTest.ml" *) end module OASISDocument = struct (* # 22 "src/oasis/OASISDocument.ml" *) end module OASISExec = struct (* # 22 "src/oasis/OASISExec.ml" *) open OASISGettext open OASISUtils open OASISMessage (* TODO: I don't like this quote, it is there because $(rm) foo expands to * 'rm -f' foo... *) let run ~ctxt ?f_exit_code ?(quote=true) cmd args = let cmd = if quote then if Sys.os_type = "Win32" then if String.contains cmd ' ' then (* Double the 1st double quote... win32... sigh *) "\""^(Filename.quote cmd) else cmd else Filename.quote cmd else cmd in let cmdline = String.concat " " (cmd :: args) in info ~ctxt (f_ "Running command '%s'") cmdline; match f_exit_code, Sys.command cmdline with | None, 0 -> () | None, i -> failwithf (f_ "Command '%s' terminated with error code %d") cmdline i | Some f, i -> f i let run_read_output ~ctxt ?f_exit_code cmd args = let fn = Filename.temp_file "oasis-" ".txt" in try begin let () = run ~ctxt ?f_exit_code cmd (args @ [">"; Filename.quote fn]) in let chn = open_in fn in let routput = ref [] in begin try while true do routput := (input_line chn) :: !routput done with End_of_file -> () end; close_in chn; Sys.remove fn; List.rev !routput end with e -> (try Sys.remove fn with _ -> ()); raise e let run_read_one_line ~ctxt ?f_exit_code cmd args = match run_read_output ~ctxt ?f_exit_code cmd args with | [fst] -> fst | lst -> failwithf (f_ "Command return unexpected output %S") (String.concat "\n" lst) end module OASISFileUtil = struct (* # 22 "src/oasis/OASISFileUtil.ml" *) open OASISGettext let file_exists_case fn = let dirname = Filename.dirname fn in let basename = Filename.basename fn in if Sys.file_exists dirname then if basename = Filename.current_dir_name then true else List.mem basename (Array.to_list (Sys.readdir dirname)) else false let find_file ?(case_sensitive=true) paths exts = (* Cardinal product of two list *) let ( * ) lst1 lst2 = List.flatten (List.map (fun a -> List.map (fun b -> a, b) lst2) lst1) in let rec combined_paths lst = match lst with | p1 :: p2 :: tl -> let acc = (List.map (fun (a, b) -> Filename.concat a b) (p1 * p2)) in combined_paths (acc :: tl) | [e] -> e | [] -> [] in let alternatives = List.map (fun (p, e) -> if String.length e > 0 && e.[0] <> '.' then p ^ "." ^ e else p ^ e) ((combined_paths paths) * exts) in List.find (fun file -> (if case_sensitive then file_exists_case file else Sys.file_exists file) && not (Sys.is_directory file) ) alternatives let which ~ctxt prg = let path_sep = match Sys.os_type with | "Win32" -> ';' | _ -> ':' in let path_lst = OASISString.nsplit (Sys.getenv "PATH") path_sep in let exec_ext = match Sys.os_type with | "Win32" -> "" :: (OASISString.nsplit (Sys.getenv "PATHEXT") path_sep) | _ -> [""] in find_file ~case_sensitive:false [path_lst; [prg]] exec_ext (**/**) let rec fix_dir dn = (* Windows hack because Sys.file_exists "src\\" = false when * Sys.file_exists "src" = true *) let ln = String.length dn in if Sys.os_type = "Win32" && ln > 0 && dn.[ln - 1] = '\\' then fix_dir (String.sub dn 0 (ln - 1)) else dn let q = Filename.quote (**/**) let cp ~ctxt ?(recurse=false) src tgt = if recurse then match Sys.os_type with | "Win32" -> OASISExec.run ~ctxt "xcopy" [q src; q tgt; "/E"] | _ -> OASISExec.run ~ctxt "cp" ["-r"; q src; q tgt] else OASISExec.run ~ctxt (match Sys.os_type with | "Win32" -> "copy" | _ -> "cp") [q src; q tgt] let mkdir ~ctxt tgt = OASISExec.run ~ctxt (match Sys.os_type with | "Win32" -> "md" | _ -> "mkdir") [q tgt] let rec mkdir_parent ~ctxt f tgt = let tgt = fix_dir tgt in if Sys.file_exists tgt then begin if not (Sys.is_directory tgt) then OASISUtils.failwithf (f_ "Cannot create directory '%s', a file of the same name already \ exists") tgt end else begin mkdir_parent ~ctxt f (Filename.dirname tgt); if not (Sys.file_exists tgt) then begin f tgt; mkdir ~ctxt tgt end end let rmdir ~ctxt tgt = if Sys.readdir tgt = [||] then begin match Sys.os_type with | "Win32" -> OASISExec.run ~ctxt "rd" [q tgt] | _ -> OASISExec.run ~ctxt "rm" ["-r"; q tgt] end else begin OASISMessage.error ~ctxt (f_ "Cannot remove directory '%s': not empty.") tgt end let glob ~ctxt fn = let basename = Filename.basename fn in if String.length basename >= 2 && basename.[0] = '*' && basename.[1] = '.' then begin let ext_len = (String.length basename) - 2 in let ext = String.sub basename 2 ext_len in let dirname = Filename.dirname fn in Array.fold_left (fun acc fn -> try let fn_ext = String.sub fn ((String.length fn) - ext_len) ext_len in if fn_ext = ext then (Filename.concat dirname fn) :: acc else acc with Invalid_argument _ -> acc) [] (Sys.readdir dirname) end else begin if file_exists_case fn then [fn] else [] end end # 2878 "setup.ml" module BaseEnvLight = struct (* # 22 "src/base/BaseEnvLight.ml" *) module MapString = Map.Make(String) type t = string MapString.t let default_filename = Filename.concat (Sys.getcwd ()) "setup.data" let load ?(allow_empty=false) ?(filename=default_filename) () = if Sys.file_exists filename then begin let chn = open_in_bin filename in let st = Stream.of_channel chn in let line = ref 1 in let st_line = Stream.from (fun _ -> try match Stream.next st with | '\n' -> incr line; Some '\n' | c -> Some c with Stream.Failure -> None) in let lexer = Genlex.make_lexer ["="] st_line in let rec read_file mp = match Stream.npeek 3 lexer with | [Genlex.Ident nm; Genlex.Kwd "="; Genlex.String value] -> Stream.junk lexer; Stream.junk lexer; Stream.junk lexer; read_file (MapString.add nm value mp) | [] -> mp | _ -> failwith (Printf.sprintf "Malformed data file '%s' line %d" filename !line) in let mp = read_file MapString.empty in close_in chn; mp end else if allow_empty then begin MapString.empty end else begin failwith (Printf.sprintf "Unable to load environment, the file '%s' doesn't exist." filename) end let rec var_expand str env = let buff = Buffer.create ((String.length str) * 2) in Buffer.add_substitute buff (fun var -> try var_expand (MapString.find var env) env with Not_found -> failwith (Printf.sprintf "No variable %s defined when trying to expand %S." var str)) str; Buffer.contents buff let var_get name env = var_expand (MapString.find name env) env let var_choose lst env = OASISExpr.choose (fun nm -> var_get nm env) lst end # 2983 "setup.ml" module BaseContext = struct (* # 22 "src/base/BaseContext.ml" *) (* TODO: get rid of this module. *) open OASISContext let args () = fst (fspecs ()) let default = default end module BaseMessage = struct (* # 22 "src/base/BaseMessage.ml" *) (** Message to user, overrid for Base @author Sylvain Le Gall *) open OASISMessage open BaseContext let debug fmt = debug ~ctxt:!default fmt let info fmt = info ~ctxt:!default fmt let warning fmt = warning ~ctxt:!default fmt let error fmt = error ~ctxt:!default fmt end module BaseEnv = struct (* # 22 "src/base/BaseEnv.ml" *) open OASISGettext open OASISUtils open PropList module MapString = BaseEnvLight.MapString type origin_t = | ODefault | OGetEnv | OFileLoad | OCommandLine type cli_handle_t = | CLINone | CLIAuto | CLIWith | CLIEnable | CLIUser of (Arg.key * Arg.spec * Arg.doc) list type definition_t = { hide: bool; dump: bool; cli: cli_handle_t; arg_help: string option; group: string option; } let schema = Schema.create "environment" (* Environment data *) let env = Data.create () (* Environment data from file *) let env_from_file = ref MapString.empty (* Lexer for var *) let var_lxr = Genlex.make_lexer [] let rec var_expand str = let buff = Buffer.create ((String.length str) * 2) in Buffer.add_substitute buff (fun var -> try (* TODO: this is a quick hack to allow calling Test.Command * without defining executable name really. I.e. if there is * an exec Executable toto, then $(toto) should be replace * by its real name. It is however useful to have this function * for other variable that depend on the host and should be * written better than that. *) let st = var_lxr (Stream.of_string var) in match Stream.npeek 3 st with | [Genlex.Ident "utoh"; Genlex.Ident nm] -> OASISHostPath.of_unix (var_get nm) | [Genlex.Ident "utoh"; Genlex.String s] -> OASISHostPath.of_unix s | [Genlex.Ident "ocaml_escaped"; Genlex.Ident nm] -> String.escaped (var_get nm) | [Genlex.Ident "ocaml_escaped"; Genlex.String s] -> String.escaped s | [Genlex.Ident nm] -> var_get nm | _ -> failwithf (f_ "Unknown expression '%s' in variable expansion of %s.") var str with | Unknown_field (_, _) -> failwithf (f_ "No variable %s defined when trying to expand %S.") var str | Stream.Error e -> failwithf (f_ "Syntax error when parsing '%s' when trying to \ expand %S: %s") var str e) str; Buffer.contents buff and var_get name = let vl = try Schema.get schema env name with Unknown_field _ as e -> begin try MapString.find name !env_from_file with Not_found -> raise e end in var_expand vl let var_choose ?printer ?name lst = OASISExpr.choose ?printer ?name var_get lst let var_protect vl = let buff = Buffer.create (String.length vl) in String.iter (function | '$' -> Buffer.add_string buff "\\$" | c -> Buffer.add_char buff c) vl; Buffer.contents buff let var_define ?(hide=false) ?(dump=true) ?short_desc ?(cli=CLINone) ?arg_help ?group name (* TODO: type constraint on the fact that name must be a valid OCaml id *) dflt = let default = [ OFileLoad, (fun () -> MapString.find name !env_from_file); ODefault, dflt; OGetEnv, (fun () -> Sys.getenv name); ] in let extra = { hide = hide; dump = dump; cli = cli; arg_help = arg_help; group = group; } in (* Try to find a value that can be defined *) let var_get_low lst = let errors, res = List.fold_left (fun (errors, res) (o, v) -> if res = None then begin try errors, Some (v ()) with | Not_found -> errors, res | Failure rsn -> (rsn :: errors), res | e -> (Printexc.to_string e) :: errors, res end else errors, res) ([], None) (List.sort (fun (o1, _) (o2, _) -> Pervasives.compare o2 o1) lst) in match res, errors with | Some v, _ -> v | None, [] -> raise (Not_set (name, None)) | None, lst -> raise (Not_set (name, Some (String.concat (s_ ", ") lst))) in let help = match short_desc with | Some fs -> Some fs | None -> None in let var_get_lst = FieldRO.create ~schema ~name ~parse:(fun ?(context=ODefault) s -> [context, fun () -> s]) ~print:var_get_low ~default ~update:(fun ?context x old_x -> x @ old_x) ?help extra in fun () -> var_expand (var_get_low (var_get_lst env)) let var_redefine ?hide ?dump ?short_desc ?cli ?arg_help ?group name dflt = if Schema.mem schema name then begin (* TODO: look suspsicious, we want to memorize dflt not dflt () *) Schema.set schema env ~context:ODefault name (dflt ()); fun () -> var_get name end else begin var_define ?hide ?dump ?short_desc ?cli ?arg_help ?group name dflt end let var_ignore (e: unit -> string) = () let print_hidden = var_define ~hide:true ~dump:false ~cli:CLIAuto ~arg_help:"Print even non-printable variable. (debug)" "print_hidden" (fun () -> "false") let var_all () = List.rev (Schema.fold (fun acc nm def _ -> if not def.hide || bool_of_string (print_hidden ()) then nm :: acc else acc) [] schema) let default_filename = BaseEnvLight.default_filename let load ?allow_empty ?filename () = env_from_file := BaseEnvLight.load ?allow_empty ?filename () let unload () = env_from_file := MapString.empty; Data.clear env let dump ?(filename=default_filename) () = let chn = open_out_bin filename in let output nm value = Printf.fprintf chn "%s=%S\n" nm value in let mp_todo = (* Dump data from schema *) Schema.fold (fun mp_todo nm def _ -> if def.dump then begin try let value = Schema.get schema env nm in output nm value with Not_set _ -> () end; MapString.remove nm mp_todo) !env_from_file schema in (* Dump data defined outside of schema *) MapString.iter output mp_todo; (* End of the dump *) close_out chn let print () = let printable_vars = Schema.fold (fun acc nm def short_descr_opt -> if not def.hide || bool_of_string (print_hidden ()) then begin try let value = Schema.get schema env nm in let txt = match short_descr_opt with | Some s -> s () | None -> nm in (txt, value) :: acc with Not_set _ -> acc end else acc) [] schema in let max_length = List.fold_left max 0 (List.rev_map String.length (List.rev_map fst printable_vars)) in let dot_pad str = String.make ((max_length - (String.length str)) + 3) '.' in Printf.printf "\nConfiguration: \n"; List.iter (fun (name, value) -> Printf.printf "%s: %s %s\n" name (dot_pad name) value) (List.rev printable_vars); Printf.printf "\n%!" let args () = let arg_concat = OASISUtils.varname_concat ~hyphen:'-' in [ "--override", Arg.Tuple ( let rvr = ref "" in let rvl = ref "" in [ Arg.Set_string rvr; Arg.Set_string rvl; Arg.Unit (fun () -> Schema.set schema env ~context:OCommandLine !rvr !rvl) ] ), "var+val Override any configuration variable."; ] @ List.flatten (Schema.fold (fun acc name def short_descr_opt -> let var_set s = Schema.set schema env ~context:OCommandLine name s in let arg_name = OASISUtils.varname_of_string ~hyphen:'-' name in let hlp = match short_descr_opt with | Some txt -> txt () | None -> "" in let arg_hlp = match def.arg_help with | Some s -> s | None -> "str" in let default_value = try Printf.sprintf (f_ " [%s]") (Schema.get schema env name) with Not_set _ -> "" in let args = match def.cli with | CLINone -> [] | CLIAuto -> [ arg_concat "--" arg_name, Arg.String var_set, Printf.sprintf (f_ "%s %s%s") arg_hlp hlp default_value ] | CLIWith -> [ arg_concat "--with-" arg_name, Arg.String var_set, Printf.sprintf (f_ "%s %s%s") arg_hlp hlp default_value ] | CLIEnable -> let dflt = if default_value = " [true]" then s_ " [default: enabled]" else s_ " [default: disabled]" in [ arg_concat "--enable-" arg_name, Arg.Unit (fun () -> var_set "true"), Printf.sprintf (f_ " %s%s") hlp dflt; arg_concat "--disable-" arg_name, Arg.Unit (fun () -> var_set "false"), Printf.sprintf (f_ " %s%s") hlp dflt ] | CLIUser lst -> lst in args :: acc) [] schema) end module BaseArgExt = struct (* # 22 "src/base/BaseArgExt.ml" *) open OASISUtils open OASISGettext let parse argv args = (* Simulate command line for Arg *) let current = ref 0 in try Arg.parse_argv ~current:current (Array.concat [[|"none"|]; argv]) (Arg.align args) (failwithf (f_ "Don't know what to do with arguments: '%s'")) (s_ "configure options:") with | Arg.Help txt -> print_endline txt; exit 0 | Arg.Bad txt -> prerr_endline txt; exit 1 end module BaseCheck = struct (* # 22 "src/base/BaseCheck.ml" *) open BaseEnv open BaseMessage open OASISUtils open OASISGettext let prog_best prg prg_lst = var_redefine prg (fun () -> let alternate = List.fold_left (fun res e -> match res with | Some _ -> res | None -> try Some (OASISFileUtil.which ~ctxt:!BaseContext.default e) with Not_found -> None) None prg_lst in match alternate with | Some prg -> prg | None -> raise Not_found) let prog prg = prog_best prg [prg] let prog_opt prg = prog_best prg [prg^".opt"; prg] let ocamlfind = prog "ocamlfind" let version var_prefix cmp fversion () = (* Really compare version provided *) let var = var_prefix^"_version_"^(OASISVersion.varname_of_comparator cmp) in var_redefine ~hide:true var (fun () -> let version_str = match fversion () with | "[Distributed with OCaml]" -> begin try (var_get "ocaml_version") with Not_found -> warning (f_ "Variable ocaml_version not defined, fallback \ to default"); Sys.ocaml_version end | res -> res in let version = OASISVersion.version_of_string version_str in if OASISVersion.comparator_apply version cmp then version_str else failwithf (f_ "Cannot satisfy version constraint on %s: %s (version: %s)") var_prefix (OASISVersion.string_of_comparator cmp) version_str) () let package_version pkg = OASISExec.run_read_one_line ~ctxt:!BaseContext.default (ocamlfind ()) ["query"; "-format"; "%v"; pkg] let package ?version_comparator pkg () = let var = OASISUtils.varname_concat "pkg_" (OASISUtils.varname_of_string pkg) in let findlib_dir pkg = let dir = OASISExec.run_read_one_line ~ctxt:!BaseContext.default (ocamlfind ()) ["query"; "-format"; "%d"; pkg] in if Sys.file_exists dir && Sys.is_directory dir then dir else failwithf (f_ "When looking for findlib package %s, \ directory %s return doesn't exist") pkg dir in let vl = var_redefine var (fun () -> findlib_dir pkg) () in ( match version_comparator with | Some ver_cmp -> ignore (version var ver_cmp (fun _ -> package_version pkg) ()) | None -> () ); vl end module BaseOCamlcConfig = struct (* # 22 "src/base/BaseOCamlcConfig.ml" *) open BaseEnv open OASISUtils open OASISGettext module SMap = Map.Make(String) let ocamlc = BaseCheck.prog_opt "ocamlc" let ocamlc_config_map = (* Map name to value for ocamlc -config output (name ^": "^value) *) let rec split_field mp lst = match lst with | line :: tl -> let mp = try let pos_semicolon = String.index line ':' in if pos_semicolon > 1 then ( let name = String.sub line 0 pos_semicolon in let linelen = String.length line in let value = if linelen > pos_semicolon + 2 then String.sub line (pos_semicolon + 2) (linelen - pos_semicolon - 2) else "" in SMap.add name value mp ) else ( mp ) with Not_found -> ( mp ) in split_field mp tl | [] -> mp in let cache = lazy (var_protect (Marshal.to_string (split_field SMap.empty (OASISExec.run_read_output ~ctxt:!BaseContext.default (ocamlc ()) ["-config"])) [])) in var_redefine "ocamlc_config_map" ~hide:true ~dump:false (fun () -> (* TODO: update if ocamlc change !!! *) Lazy.force cache) let var_define nm = (* Extract data from ocamlc -config *) let avlbl_config_get () = Marshal.from_string (ocamlc_config_map ()) 0 in let chop_version_suffix s = try String.sub s 0 (String.index s '+') with _ -> s in let nm_config, value_config = match nm with | "ocaml_version" -> "version", chop_version_suffix | _ -> nm, (fun x -> x) in var_redefine nm (fun () -> try let map = avlbl_config_get () in let value = SMap.find nm_config map in value_config value with Not_found -> failwithf (f_ "Cannot find field '%s' in '%s -config' output") nm (ocamlc ())) end module BaseStandardVar = struct (* # 22 "src/base/BaseStandardVar.ml" *) open OASISGettext open OASISTypes open OASISExpr open BaseCheck open BaseEnv let ocamlfind = BaseCheck.ocamlfind let ocamlc = BaseOCamlcConfig.ocamlc let ocamlopt = prog_opt "ocamlopt" let ocamlbuild = prog "ocamlbuild" (**/**) let rpkg = ref None let pkg_get () = match !rpkg with | Some pkg -> pkg | None -> failwith (s_ "OASIS Package is not set") let var_cond = ref [] let var_define_cond ~since_version f dflt = let holder = ref (fun () -> dflt) in let since_version = OASISVersion.VGreaterEqual (OASISVersion.version_of_string since_version) in var_cond := (fun ver -> if OASISVersion.comparator_apply ver since_version then holder := f ()) :: !var_cond; fun () -> !holder () (**/**) let pkg_name = var_define ~short_desc:(fun () -> s_ "Package name") "pkg_name" (fun () -> (pkg_get ()).name) let pkg_version = var_define ~short_desc:(fun () -> s_ "Package version") "pkg_version" (fun () -> (OASISVersion.string_of_version (pkg_get ()).version)) let c = BaseOCamlcConfig.var_define let os_type = c "os_type" let system = c "system" let architecture = c "architecture" let ccomp_type = c "ccomp_type" let ocaml_version = c "ocaml_version" (* TODO: Check standard variable presence at runtime *) let standard_library_default = c "standard_library_default" let standard_library = c "standard_library" let standard_runtime = c "standard_runtime" let bytecomp_c_compiler = c "bytecomp_c_compiler" let native_c_compiler = c "native_c_compiler" let model = c "model" let ext_obj = c "ext_obj" let ext_asm = c "ext_asm" let ext_lib = c "ext_lib" let ext_dll = c "ext_dll" let default_executable_name = c "default_executable_name" let systhread_supported = c "systhread_supported" let flexlink = BaseCheck.prog "flexlink" let flexdll_version = var_define ~short_desc:(fun () -> "FlexDLL version (Win32)") "flexdll_version" (fun () -> let lst = OASISExec.run_read_output ~ctxt:!BaseContext.default (flexlink ()) ["-help"] in match lst with | line :: _ -> Scanf.sscanf line "FlexDLL version %s" (fun ver -> ver) | [] -> raise Not_found) (**/**) let p name hlp dflt = var_define ~short_desc:hlp ~cli:CLIAuto ~arg_help:"dir" name dflt let (/) a b = if os_type () = Sys.os_type then Filename.concat a b else if os_type () = "Unix" then OASISUnixPath.concat a b else OASISUtils.failwithf (f_ "Cannot handle os_type %s filename concat") (os_type ()) (**/**) let prefix = p "prefix" (fun () -> s_ "Install architecture-independent files dir") (fun () -> match os_type () with | "Win32" -> let program_files = Sys.getenv "PROGRAMFILES" in program_files/(pkg_name ()) | _ -> "/usr/local") let exec_prefix = p "exec_prefix" (fun () -> s_ "Install architecture-dependent files in dir") (fun () -> "$prefix") let bindir = p "bindir" (fun () -> s_ "User executables") (fun () -> "$exec_prefix"/"bin") let sbindir = p "sbindir" (fun () -> s_ "System admin executables") (fun () -> "$exec_prefix"/"sbin") let libexecdir = p "libexecdir" (fun () -> s_ "Program executables") (fun () -> "$exec_prefix"/"libexec") let sysconfdir = p "sysconfdir" (fun () -> s_ "Read-only single-machine data") (fun () -> "$prefix"/"etc") let sharedstatedir = p "sharedstatedir" (fun () -> s_ "Modifiable architecture-independent data") (fun () -> "$prefix"/"com") let localstatedir = p "localstatedir" (fun () -> s_ "Modifiable single-machine data") (fun () -> "$prefix"/"var") let libdir = p "libdir" (fun () -> s_ "Object code libraries") (fun () -> "$exec_prefix"/"lib") let datarootdir = p "datarootdir" (fun () -> s_ "Read-only arch-independent data root") (fun () -> "$prefix"/"share") let datadir = p "datadir" (fun () -> s_ "Read-only architecture-independent data") (fun () -> "$datarootdir") let infodir = p "infodir" (fun () -> s_ "Info documentation") (fun () -> "$datarootdir"/"info") let localedir = p "localedir" (fun () -> s_ "Locale-dependent data") (fun () -> "$datarootdir"/"locale") let mandir = p "mandir" (fun () -> s_ "Man documentation") (fun () -> "$datarootdir"/"man") let docdir = p "docdir" (fun () -> s_ "Documentation root") (fun () -> "$datarootdir"/"doc"/"$pkg_name") let htmldir = p "htmldir" (fun () -> s_ "HTML documentation") (fun () -> "$docdir") let dvidir = p "dvidir" (fun () -> s_ "DVI documentation") (fun () -> "$docdir") let pdfdir = p "pdfdir" (fun () -> s_ "PDF documentation") (fun () -> "$docdir") let psdir = p "psdir" (fun () -> s_ "PS documentation") (fun () -> "$docdir") let destdir = p "destdir" (fun () -> s_ "Prepend a path when installing package") (fun () -> raise (PropList.Not_set ("destdir", Some (s_ "undefined by construct")))) let findlib_version = var_define "findlib_version" (fun () -> BaseCheck.package_version "findlib") let is_native = var_define "is_native" (fun () -> try let _s: string = ocamlopt () in "true" with PropList.Not_set _ -> let _s: string = ocamlc () in "false") let ext_program = var_define "suffix_program" (fun () -> match os_type () with | "Win32" | "Cygwin" -> ".exe" | _ -> "") let rm = var_define ~short_desc:(fun () -> s_ "Remove a file.") "rm" (fun () -> match os_type () with | "Win32" -> "del" | _ -> "rm -f") let rmdir = var_define ~short_desc:(fun () -> s_ "Remove a directory.") "rmdir" (fun () -> match os_type () with | "Win32" -> "rd" | _ -> "rm -rf") let debug = var_define ~short_desc:(fun () -> s_ "Turn ocaml debug flag on") ~cli:CLIEnable "debug" (fun () -> "true") let profile = var_define ~short_desc:(fun () -> s_ "Turn ocaml profile flag on") ~cli:CLIEnable "profile" (fun () -> "false") let tests = var_define_cond ~since_version:"0.3" (fun () -> var_define ~short_desc:(fun () -> s_ "Compile tests executable and library and run them") ~cli:CLIEnable "tests" (fun () -> "false")) "true" let docs = var_define_cond ~since_version:"0.3" (fun () -> var_define ~short_desc:(fun () -> s_ "Create documentations") ~cli:CLIEnable "docs" (fun () -> "true")) "true" let native_dynlink = var_define ~short_desc:(fun () -> s_ "Compiler support generation of .cmxs.") ~cli:CLINone "native_dynlink" (fun () -> let res = let ocaml_lt_312 () = OASISVersion.comparator_apply (OASISVersion.version_of_string (ocaml_version ())) (OASISVersion.VLesser (OASISVersion.version_of_string "3.12.0")) in let flexdll_lt_030 () = OASISVersion.comparator_apply (OASISVersion.version_of_string (flexdll_version ())) (OASISVersion.VLesser (OASISVersion.version_of_string "0.30")) in let has_native_dynlink = let ocamlfind = ocamlfind () in try let fn = OASISExec.run_read_one_line ~ctxt:!BaseContext.default ocamlfind ["query"; "-predicates"; "native"; "dynlink"; "-format"; "%d/%a"] in Sys.file_exists fn with _ -> false in if not has_native_dynlink then false else if ocaml_lt_312 () then false else if (os_type () = "Win32" || os_type () = "Cygwin") && flexdll_lt_030 () then begin BaseMessage.warning (f_ ".cmxs generation disabled because FlexDLL needs to be \ at least 0.30. Please upgrade FlexDLL from %s to 0.30.") (flexdll_version ()); false end else true in string_of_bool res) let init pkg = rpkg := Some pkg; List.iter (fun f -> f pkg.oasis_version) !var_cond end module BaseFileAB = struct (* # 22 "src/base/BaseFileAB.ml" *) open BaseEnv open OASISGettext open BaseMessage let to_filename fn = let fn = OASISHostPath.of_unix fn in if not (Filename.check_suffix fn ".ab") then warning (f_ "File '%s' doesn't have '.ab' extension") fn; Filename.chop_extension fn let replace fn_lst = let buff = Buffer.create 13 in List.iter (fun fn -> let fn = OASISHostPath.of_unix fn in let chn_in = open_in fn in let chn_out = open_out (to_filename fn) in ( try while true do Buffer.add_string buff (var_expand (input_line chn_in)); Buffer.add_char buff '\n' done with End_of_file -> () ); Buffer.output_buffer chn_out buff; Buffer.clear buff; close_in chn_in; close_out chn_out) fn_lst end module BaseLog = struct (* # 22 "src/base/BaseLog.ml" *) open OASISUtils let default_filename = Filename.concat (Filename.dirname BaseEnv.default_filename) "setup.log" module SetTupleString = Set.Make (struct type t = string * string let compare (s11, s12) (s21, s22) = match String.compare s11 s21 with | 0 -> String.compare s12 s22 | n -> n end) let load () = if Sys.file_exists default_filename then begin let chn = open_in default_filename in let scbuf = Scanf.Scanning.from_file default_filename in let rec read_aux (st, lst) = if not (Scanf.Scanning.end_of_input scbuf) then begin let acc = try Scanf.bscanf scbuf "%S %S\n" (fun e d -> let t = e, d in if SetTupleString.mem t st then st, lst else SetTupleString.add t st, t :: lst) with Scanf.Scan_failure _ -> failwith (Scanf.bscanf scbuf "%l" (fun line -> Printf.sprintf "Malformed log file '%s' at line %d" default_filename line)) in read_aux acc end else begin close_in chn; List.rev lst end in read_aux (SetTupleString.empty, []) end else begin [] end let register event data = let chn_out = open_out_gen [Open_append; Open_creat; Open_text] 0o644 default_filename in Printf.fprintf chn_out "%S %S\n" event data; close_out chn_out let unregister event data = if Sys.file_exists default_filename then begin let lst = load () in let chn_out = open_out default_filename in let write_something = ref false in List.iter (fun (e, d) -> if e <> event || d <> data then begin write_something := true; Printf.fprintf chn_out "%S %S\n" e d end) lst; close_out chn_out; if not !write_something then Sys.remove default_filename end let filter events = let st_events = List.fold_left (fun st e -> SetString.add e st) SetString.empty events in List.filter (fun (e, _) -> SetString.mem e st_events) (load ()) let exists event data = List.exists (fun v -> (event, data) = v) (load ()) end module BaseBuilt = struct (* # 22 "src/base/BaseBuilt.ml" *) open OASISTypes open OASISGettext open BaseStandardVar open BaseMessage type t = | BExec (* Executable *) | BExecLib (* Library coming with executable *) | BLib (* Library *) | BObj (* Library *) | BDoc (* Document *) let to_log_event_file t nm = "built_"^ (match t with | BExec -> "exec" | BExecLib -> "exec_lib" | BLib -> "lib" | BObj -> "obj" | BDoc -> "doc")^ "_"^nm let to_log_event_done t nm = "is_"^(to_log_event_file t nm) let register t nm lst = BaseLog.register (to_log_event_done t nm) "true"; List.iter (fun alt -> let registered = List.fold_left (fun registered fn -> if OASISFileUtil.file_exists_case fn then begin BaseLog.register (to_log_event_file t nm) (if Filename.is_relative fn then Filename.concat (Sys.getcwd ()) fn else fn); true end else registered) false alt in if not registered then warning (f_ "Cannot find an existing alternative files among: %s") (String.concat (s_ ", ") alt)) lst let unregister t nm = List.iter (fun (e, d) -> BaseLog.unregister e d) (BaseLog.filter [to_log_event_file t nm; to_log_event_done t nm]) let fold t nm f acc = List.fold_left (fun acc (_, fn) -> if OASISFileUtil.file_exists_case fn then begin f acc fn end else begin warning (f_ "File '%s' has been marked as built \ for %s but doesn't exist") fn (Printf.sprintf (match t with | BExec | BExecLib -> (f_ "executable %s") | BLib -> (f_ "library %s") | BObj -> (f_ "object %s") | BDoc -> (f_ "documentation %s")) nm); acc end) acc (BaseLog.filter [to_log_event_file t nm]) let is_built t nm = List.fold_left (fun is_built (_, d) -> (try bool_of_string d with _ -> false)) false (BaseLog.filter [to_log_event_done t nm]) let of_executable ffn (cs, bs, exec) = let unix_exec_is, unix_dll_opt = OASISExecutable.unix_exec_is (cs, bs, exec) (fun () -> bool_of_string (is_native ())) ext_dll ext_program in let evs = (BExec, cs.cs_name, [[ffn unix_exec_is]]) :: (match unix_dll_opt with | Some fn -> [BExecLib, cs.cs_name, [[ffn fn]]] | None -> []) in evs, unix_exec_is, unix_dll_opt let of_library ffn (cs, bs, lib) = let unix_lst = OASISLibrary.generated_unix_files ~ctxt:!BaseContext.default ~source_file_exists:(fun fn -> OASISFileUtil.file_exists_case (OASISHostPath.of_unix fn)) ~is_native:(bool_of_string (is_native ())) ~has_native_dynlink:(bool_of_string (native_dynlink ())) ~ext_lib:(ext_lib ()) ~ext_dll:(ext_dll ()) (cs, bs, lib) in let evs = [BLib, cs.cs_name, List.map (List.map ffn) unix_lst] in evs, unix_lst let of_object ffn (cs, bs, obj) = let unix_lst = OASISObject.generated_unix_files ~ctxt:!BaseContext.default ~source_file_exists:(fun fn -> OASISFileUtil.file_exists_case (OASISHostPath.of_unix fn)) ~is_native:(bool_of_string (is_native ())) (cs, bs, obj) in let evs = [BObj, cs.cs_name, List.map (List.map ffn) unix_lst] in evs, unix_lst end module BaseCustom = struct (* # 22 "src/base/BaseCustom.ml" *) open BaseEnv open BaseMessage open OASISTypes open OASISGettext let run cmd args extra_args = OASISExec.run ~ctxt:!BaseContext.default ~quote:false (var_expand cmd) (List.map var_expand (args @ (Array.to_list extra_args))) let hook ?(failsafe=false) cstm f e = let optional_command lst = let printer = function | Some (cmd, args) -> String.concat " " (cmd :: args) | None -> s_ "No command" in match var_choose ~name:(s_ "Pre/Post Command") ~printer lst with | Some (cmd, args) -> begin try run cmd args [||] with e when failsafe -> warning (f_ "Command '%s' fail with error: %s") (String.concat " " (cmd :: args)) (match e with | Failure msg -> msg | e -> Printexc.to_string e) end | None -> () in let res = optional_command cstm.pre_command; f e in optional_command cstm.post_command; res end module BaseDynVar = struct (* # 22 "src/base/BaseDynVar.ml" *) open OASISTypes open OASISGettext open BaseEnv open BaseBuilt let init pkg = (* TODO: disambiguate exec vs other variable by adding exec_VARNAME. *) (* TODO: provide compile option for library libary_byte_args_VARNAME... *) List.iter (function | Executable (cs, bs, exec) -> if var_choose bs.bs_build then var_ignore (var_redefine (* We don't save this variable *) ~dump:false ~short_desc:(fun () -> Printf.sprintf (f_ "Filename of executable '%s'") cs.cs_name) (OASISUtils.varname_of_string cs.cs_name) (fun () -> let fn_opt = fold BExec cs.cs_name (fun _ fn -> Some fn) None in match fn_opt with | Some fn -> fn | None -> raise (PropList.Not_set (cs.cs_name, Some (Printf.sprintf (f_ "Executable '%s' not yet built.") cs.cs_name))))) | Library _ | Object _ | Flag _ | Test _ | SrcRepo _ | Doc _ -> ()) pkg.sections end module BaseTest = struct (* # 22 "src/base/BaseTest.ml" *) open BaseEnv open BaseMessage open OASISTypes open OASISExpr open OASISGettext let test lst pkg extra_args = let one_test (failure, n) (test_plugin, cs, test) = if var_choose ~name:(Printf.sprintf (f_ "test %s run") cs.cs_name) ~printer:string_of_bool test.test_run then begin let () = info (f_ "Running test '%s'") cs.cs_name in let back_cwd = match test.test_working_directory with | Some dir -> let cwd = Sys.getcwd () in let chdir d = info (f_ "Changing directory to '%s'") d; Sys.chdir d in chdir dir; fun () -> chdir cwd | None -> fun () -> () in try let failure_percent = BaseCustom.hook test.test_custom (test_plugin pkg (cs, test)) extra_args in back_cwd (); (failure_percent +. failure, n + 1) with e -> begin back_cwd (); raise e end end else begin info (f_ "Skipping test '%s'") cs.cs_name; (failure, n) end in let failed, n = List.fold_left one_test (0.0, 0) lst in let failure_percent = if n = 0 then 0.0 else failed /. (float_of_int n) in let msg = Printf.sprintf (f_ "Tests had a %.2f%% failure rate") (100. *. failure_percent) in if failure_percent > 0.0 then failwith msg else info "%s" msg; (* Possible explanation why the tests where not run. *) if OASISFeatures.package_test OASISFeatures.flag_tests pkg && not (bool_of_string (BaseStandardVar.tests ())) && lst <> [] then BaseMessage.warning "Tests are turned off, consider enabling with \ 'ocaml setup.ml -configure --enable-tests'" end module BaseDoc = struct (* # 22 "src/base/BaseDoc.ml" *) open BaseEnv open BaseMessage open OASISTypes open OASISGettext let doc lst pkg extra_args = let one_doc (doc_plugin, cs, doc) = if var_choose ~name:(Printf.sprintf (f_ "documentation %s build") cs.cs_name) ~printer:string_of_bool doc.doc_build then begin info (f_ "Building documentation '%s'") cs.cs_name; BaseCustom.hook doc.doc_custom (doc_plugin pkg (cs, doc)) extra_args end in List.iter one_doc lst; if OASISFeatures.package_test OASISFeatures.flag_docs pkg && not (bool_of_string (BaseStandardVar.docs ())) && lst <> [] then BaseMessage.warning "Docs are turned off, consider enabling with \ 'ocaml setup.ml -configure --enable-docs'" end module BaseSetup = struct (* # 22 "src/base/BaseSetup.ml" *) open BaseEnv open BaseMessage open OASISTypes open OASISSection open OASISGettext open OASISUtils type std_args_fun = package -> string array -> unit type ('a, 'b) section_args_fun = name * (package -> (common_section * 'a) -> string array -> 'b) type t = { configure: std_args_fun; build: std_args_fun; doc: ((doc, unit) section_args_fun) list; test: ((test, float) section_args_fun) list; install: std_args_fun; uninstall: std_args_fun; clean: std_args_fun list; clean_doc: (doc, unit) section_args_fun list; clean_test: (test, unit) section_args_fun list; distclean: std_args_fun list; distclean_doc: (doc, unit) section_args_fun list; distclean_test: (test, unit) section_args_fun list; package: package; oasis_fn: string option; oasis_version: string; oasis_digest: Digest.t option; oasis_exec: string option; oasis_setup_args: string list; setup_update: bool; } (* Associate a plugin function with data from package *) let join_plugin_sections filter_map lst = List.rev (List.fold_left (fun acc sct -> match filter_map sct with | Some e -> e :: acc | None -> acc) [] lst) (* Search for plugin data associated with a section name *) let lookup_plugin_section plugin action nm lst = try List.assoc nm lst with Not_found -> failwithf (f_ "Cannot find plugin %s matching section %s for %s action") plugin nm action let configure t args = (* Run configure *) BaseCustom.hook t.package.conf_custom (fun () -> (* Reload if preconf has changed it *) begin try unload (); load (); with _ -> () end; (* Run plugin's configure *) t.configure t.package args; (* Dump to allow postconf to change it *) dump ()) (); (* Reload environment *) unload (); load (); (* Save environment *) print (); (* Replace data in file *) BaseFileAB.replace t.package.files_ab let build t args = BaseCustom.hook t.package.build_custom (t.build t.package) args let doc t args = BaseDoc.doc (join_plugin_sections (function | Doc (cs, e) -> Some (lookup_plugin_section "documentation" (s_ "build") cs.cs_name t.doc, cs, e) | _ -> None) t.package.sections) t.package args let test t args = BaseTest.test (join_plugin_sections (function | Test (cs, e) -> Some (lookup_plugin_section "test" (s_ "run") cs.cs_name t.test, cs, e) | _ -> None) t.package.sections) t.package args let all t args = let rno_doc = ref false in let rno_test = ref false in let arg_rest = ref [] in Arg.parse_argv ~current:(ref 0) (Array.of_list ((Sys.executable_name^" all") :: (Array.to_list args))) [ "-no-doc", Arg.Set rno_doc, s_ "Don't run doc target"; "-no-test", Arg.Set rno_test, s_ "Don't run test target"; "--", Arg.Rest (fun arg -> arg_rest := arg :: !arg_rest), s_ "All arguments for configure."; ] (failwithf (f_ "Don't know what to do with '%s'")) ""; info "Running configure step"; configure t (Array.of_list (List.rev !arg_rest)); info "Running build step"; build t [||]; (* Load setup.log dynamic variables *) BaseDynVar.init t.package; if not !rno_doc then begin info "Running doc step"; doc t [||]; end else begin info "Skipping doc step" end; if not !rno_test then begin info "Running test step"; test t [||] end else begin info "Skipping test step" end let install t args = BaseCustom.hook t.package.install_custom (t.install t.package) args let uninstall t args = BaseCustom.hook t.package.uninstall_custom (t.uninstall t.package) args let reinstall t args = uninstall t args; install t args let clean, distclean = let failsafe f a = try f a with e -> warning (f_ "Action fail with error: %s") (match e with | Failure msg -> msg | e -> Printexc.to_string e) in let generic_clean t cstm mains docs tests args = BaseCustom.hook ~failsafe:true cstm (fun () -> (* Clean section *) List.iter (function | Test (cs, test) -> let f = try List.assoc cs.cs_name tests with Not_found -> fun _ _ _ -> () in failsafe (f t.package (cs, test)) args | Doc (cs, doc) -> let f = try List.assoc cs.cs_name docs with Not_found -> fun _ _ _ -> () in failsafe (f t.package (cs, doc)) args | Library _ | Object _ | Executable _ | Flag _ | SrcRepo _ -> ()) t.package.sections; (* Clean whole package *) List.iter (fun f -> failsafe (f t.package) args) mains) () in let clean t args = generic_clean t t.package.clean_custom t.clean t.clean_doc t.clean_test args in let distclean t args = (* Call clean *) clean t args; (* Call distclean code *) generic_clean t t.package.distclean_custom t.distclean t.distclean_doc t.distclean_test args; (* Remove generated file *) List.iter (fun fn -> if Sys.file_exists fn then begin info (f_ "Remove '%s'") fn; Sys.remove fn end) (BaseEnv.default_filename :: BaseLog.default_filename :: (List.rev_map BaseFileAB.to_filename t.package.files_ab)) in clean, distclean let version t _ = print_endline t.oasis_version let update_setup_ml, no_update_setup_ml_cli = let b = ref true in b, ("-no-update-setup-ml", Arg.Clear b, s_ " Don't try to update setup.ml, even if _oasis has changed.") let default_oasis_fn = "_oasis" let update_setup_ml t = let oasis_fn = match t.oasis_fn with | Some fn -> fn | None -> default_oasis_fn in let oasis_exec = match t.oasis_exec with | Some fn -> fn | None -> "oasis" in let ocaml = Sys.executable_name in let setup_ml, args = match Array.to_list Sys.argv with | setup_ml :: args -> setup_ml, args | [] -> failwith (s_ "Expecting non-empty command line arguments.") in let ocaml, setup_ml = if Sys.executable_name = Sys.argv.(0) then (* We are not running in standard mode, probably the script * is precompiled. *) "ocaml", "setup.ml" else ocaml, setup_ml in let no_update_setup_ml_cli, _, _ = no_update_setup_ml_cli in let do_update () = let oasis_exec_version = OASISExec.run_read_one_line ~ctxt:!BaseContext.default ~f_exit_code: (function | 0 -> () | 1 -> failwithf (f_ "Executable '%s' is probably an old version \ of oasis (< 0.3.0), please update to version \ v%s.") oasis_exec t.oasis_version | 127 -> failwithf (f_ "Cannot find executable '%s', please install \ oasis v%s.") oasis_exec t.oasis_version | n -> failwithf (f_ "Command '%s version' exited with code %d.") oasis_exec n) oasis_exec ["version"] in if OASISVersion.comparator_apply (OASISVersion.version_of_string oasis_exec_version) (OASISVersion.VGreaterEqual (OASISVersion.version_of_string t.oasis_version)) then begin (* We have a version >= for the executable oasis, proceed with * update. *) (* TODO: delegate this check to 'oasis setup'. *) if Sys.os_type = "Win32" then failwithf (f_ "It is not possible to update the running script \ setup.ml on Windows. Please update setup.ml by \ running '%s'.") (String.concat " " (oasis_exec :: "setup" :: t.oasis_setup_args)) else begin OASISExec.run ~ctxt:!BaseContext.default ~f_exit_code: (function | 0 -> () | n -> failwithf (f_ "Unable to update setup.ml using '%s', \ please fix the problem and retry.") oasis_exec) oasis_exec ("setup" :: t.oasis_setup_args); OASISExec.run ~ctxt:!BaseContext.default ocaml (setup_ml :: args) end end else failwithf (f_ "The version of '%s' (v%s) doesn't match the version of \ oasis used to generate the %s file. Please install at \ least oasis v%s.") oasis_exec oasis_exec_version setup_ml t.oasis_version in if !update_setup_ml then begin try match t.oasis_digest with | Some dgst -> if Sys.file_exists oasis_fn && dgst <> Digest.file default_oasis_fn then begin do_update (); true end else false | None -> false with e -> error (f_ "Error when updating setup.ml. If you want to avoid this error, \ you can bypass the update of %s by running '%s %s %s %s'") setup_ml ocaml setup_ml no_update_setup_ml_cli (String.concat " " args); raise e end else false let setup t = let catch_exn = ref true in try let act_ref = ref (fun _ -> failwithf (f_ "No action defined, run '%s %s -help'") Sys.executable_name Sys.argv.(0)) in let extra_args_ref = ref [] in let allow_empty_env_ref = ref false in let arg_handle ?(allow_empty_env=false) act = Arg.Tuple [ Arg.Rest (fun str -> extra_args_ref := str :: !extra_args_ref); Arg.Unit (fun () -> allow_empty_env_ref := allow_empty_env; act_ref := act); ] in Arg.parse (Arg.align ([ "-configure", arg_handle ~allow_empty_env:true configure, s_ "[options*] Configure the whole build process."; "-build", arg_handle build, s_ "[options*] Build executables and libraries."; "-doc", arg_handle doc, s_ "[options*] Build documents."; "-test", arg_handle test, s_ "[options*] Run tests."; "-all", arg_handle ~allow_empty_env:true all, s_ "[options*] Run configure, build, doc and test targets."; "-install", arg_handle install, s_ "[options*] Install libraries, data, executables \ and documents."; "-uninstall", arg_handle uninstall, s_ "[options*] Uninstall libraries, data, executables \ and documents."; "-reinstall", arg_handle reinstall, s_ "[options*] Uninstall and install libraries, data, \ executables and documents."; "-clean", arg_handle ~allow_empty_env:true clean, s_ "[options*] Clean files generated by a build."; "-distclean", arg_handle ~allow_empty_env:true distclean, s_ "[options*] Clean files generated by a build and configure."; "-version", arg_handle ~allow_empty_env:true version, s_ " Display version of OASIS used to generate this setup.ml."; "-no-catch-exn", Arg.Clear catch_exn, s_ " Don't catch exception, useful for debugging."; ] @ (if t.setup_update then [no_update_setup_ml_cli] else []) @ (BaseContext.args ()))) (failwithf (f_ "Don't know what to do with '%s'")) (s_ "Setup and run build process current package\n"); (* Build initial environment *) load ~allow_empty:!allow_empty_env_ref (); (** Initialize flags *) List.iter (function | Flag (cs, {flag_description = hlp; flag_default = choices}) -> begin let apply ?short_desc () = var_ignore (var_define ~cli:CLIEnable ?short_desc (OASISUtils.varname_of_string cs.cs_name) (fun () -> string_of_bool (var_choose ~name:(Printf.sprintf (f_ "default value of flag %s") cs.cs_name) ~printer:string_of_bool choices))) in match hlp with | Some hlp -> apply ~short_desc:(fun () -> hlp) () | None -> apply () end | _ -> ()) t.package.sections; BaseStandardVar.init t.package; BaseDynVar.init t.package; if t.setup_update && update_setup_ml t then () else !act_ref t (Array.of_list (List.rev !extra_args_ref)) with e when !catch_exn -> error "%s" (Printexc.to_string e); exit 1 end # 5394 "setup.ml" module InternalConfigurePlugin = struct (* # 22 "src/plugins/internal/InternalConfigurePlugin.ml" *) (** Configure using internal scheme @author Sylvain Le Gall *) open BaseEnv open OASISTypes open OASISUtils open OASISGettext open BaseMessage (** Configure build using provided series of check to be done * and then output corresponding file. *) let configure pkg argv = let var_ignore_eval var = let _s: string = var () in () in let errors = ref SetString.empty in let buff = Buffer.create 13 in let add_errors fmt = Printf.kbprintf (fun b -> errors := SetString.add (Buffer.contents b) !errors; Buffer.clear b) buff fmt in let warn_exception e = warning "%s" (Printexc.to_string e) in (* Check tools *) let check_tools lst = List.iter (function | ExternalTool tool -> begin try var_ignore_eval (BaseCheck.prog tool) with e -> warn_exception e; add_errors (f_ "Cannot find external tool '%s'") tool end | InternalExecutable nm1 -> (* Check that matching tool is built *) List.iter (function | Executable ({cs_name = nm2}, {bs_build = build}, _) when nm1 = nm2 -> if not (var_choose build) then add_errors (f_ "Cannot find buildable internal executable \ '%s' when checking build depends") nm1 | _ -> ()) pkg.sections) lst in let build_checks sct bs = if var_choose bs.bs_build then begin if bs.bs_compiled_object = Native then begin try var_ignore_eval BaseStandardVar.ocamlopt with e -> warn_exception e; add_errors (f_ "Section %s requires native compilation") (OASISSection.string_of_section sct) end; (* Check tools *) check_tools bs.bs_build_tools; (* Check depends *) List.iter (function | FindlibPackage (findlib_pkg, version_comparator) -> begin try var_ignore_eval (BaseCheck.package ?version_comparator findlib_pkg) with e -> warn_exception e; match version_comparator with | None -> add_errors (f_ "Cannot find findlib package %s") findlib_pkg | Some ver_cmp -> add_errors (f_ "Cannot find findlib package %s (%s)") findlib_pkg (OASISVersion.string_of_comparator ver_cmp) end | InternalLibrary nm1 -> (* Check that matching library is built *) List.iter (function | Library ({cs_name = nm2}, {bs_build = build}, _) when nm1 = nm2 -> if not (var_choose build) then add_errors (f_ "Cannot find buildable internal library \ '%s' when checking build depends") nm1 | _ -> ()) pkg.sections) bs.bs_build_depends end in (* Parse command line *) BaseArgExt.parse argv (BaseEnv.args ()); (* OCaml version *) begin match pkg.ocaml_version with | Some ver_cmp -> begin try var_ignore_eval (BaseCheck.version "ocaml" ver_cmp BaseStandardVar.ocaml_version) with e -> warn_exception e; add_errors (f_ "OCaml version %s doesn't match version constraint %s") (BaseStandardVar.ocaml_version ()) (OASISVersion.string_of_comparator ver_cmp) end | None -> () end; (* Findlib version *) begin match pkg.findlib_version with | Some ver_cmp -> begin try var_ignore_eval (BaseCheck.version "findlib" ver_cmp BaseStandardVar.findlib_version) with e -> warn_exception e; add_errors (f_ "Findlib version %s doesn't match version constraint %s") (BaseStandardVar.findlib_version ()) (OASISVersion.string_of_comparator ver_cmp) end | None -> () end; (* Make sure the findlib version is fine for the OCaml compiler. *) begin let ocaml_ge4 = OASISVersion.version_compare (OASISVersion.version_of_string (BaseStandardVar.ocaml_version())) (OASISVersion.version_of_string "4.0.0") >= 0 in if ocaml_ge4 then let findlib_lt132 = OASISVersion.version_compare (OASISVersion.version_of_string (BaseStandardVar.findlib_version())) (OASISVersion.version_of_string "1.3.2") < 0 in if findlib_lt132 then add_errors "OCaml >= 4.0.0 requires Findlib version >= 1.3.2" end; (* FlexDLL *) if BaseStandardVar.os_type () = "Win32" || BaseStandardVar.os_type () = "Cygwin" then begin try var_ignore_eval BaseStandardVar.flexlink with e -> warn_exception e; add_errors (f_ "Cannot find 'flexlink'") end; (* Check build depends *) List.iter (function | Executable (_, bs, _) | Library (_, bs, _) as sct -> build_checks sct bs | Doc (_, doc) -> if var_choose doc.doc_build then check_tools doc.doc_build_tools | Test (_, test) -> if var_choose test.test_run then check_tools test.test_tools | _ -> ()) pkg.sections; (* Check if we need native dynlink (presence of libraries that compile to * native) *) begin let has_cmxa = List.exists (function | Library (_, bs, _) -> var_choose bs.bs_build && (bs.bs_compiled_object = Native || (bs.bs_compiled_object = Best && bool_of_string (BaseStandardVar.is_native ()))) | _ -> false) pkg.sections in if has_cmxa then var_ignore_eval BaseStandardVar.native_dynlink end; (* Check errors *) if SetString.empty != !errors then begin List.iter (fun e -> error "%s" e) (SetString.elements !errors); failwithf (fn_ "%d configuration error" "%d configuration errors" (SetString.cardinal !errors)) (SetString.cardinal !errors) end end module InternalInstallPlugin = struct (* # 22 "src/plugins/internal/InternalInstallPlugin.ml" *) (** Install using internal scheme @author Sylvain Le Gall *) open BaseEnv open BaseStandardVar open BaseMessage open OASISTypes open OASISFindlib open OASISGettext open OASISUtils let exec_hook = ref (fun (cs, bs, exec) -> cs, bs, exec) let lib_hook = ref (fun (cs, bs, lib) -> cs, bs, lib, []) let obj_hook = ref (fun (cs, bs, obj) -> cs, bs, obj, []) let doc_hook = ref (fun (cs, doc) -> cs, doc) let install_file_ev = "install-file" let install_dir_ev = "install-dir" let install_findlib_ev = "install-findlib" let win32_max_command_line_length = 8000 let split_install_command ocamlfind findlib_name meta files = if Sys.os_type = "Win32" then (* Arguments for the first command: *) let first_args = ["install"; findlib_name; meta] in (* Arguments for remaining commands: *) let other_args = ["install"; findlib_name; "-add"] in (* Extract as much files as possible from [files], [len] is the current command line length: *) let rec get_files len acc files = match files with | [] -> (List.rev acc, []) | file :: rest -> let len = len + 1 + String.length file in if len > win32_max_command_line_length then (List.rev acc, files) else get_files len (file :: acc) rest in (* Split the command into several commands. *) let rec split args files = match files with | [] -> [] | _ -> (* Length of "ocamlfind install [META|-add]" *) let len = List.fold_left (fun len arg -> len + 1 (* for the space *) + String.length arg) (String.length ocamlfind) args in match get_files len [] files with | ([], _) -> failwith (s_ "Command line too long.") | (firsts, others) -> let cmd = args @ firsts in (* Use -add for remaining commands: *) let () = let findlib_ge_132 = OASISVersion.comparator_apply (OASISVersion.version_of_string (BaseStandardVar.findlib_version ())) (OASISVersion.VGreaterEqual (OASISVersion.version_of_string "1.3.2")) in if not findlib_ge_132 then failwithf (f_ "Installing the library %s require to use the \ flag '-add' of ocamlfind because the command \ line is too long. This flag is only available \ for findlib 1.3.2. Please upgrade findlib from \ %s to 1.3.2") findlib_name (BaseStandardVar.findlib_version ()) in let cmds = split other_args others in cmd :: cmds in (* The first command does not use -add: *) split first_args files else ["install" :: findlib_name :: meta :: files] let install pkg argv = let in_destdir = try let destdir = destdir () in (* Practically speaking destdir is prepended * at the beginning of the target filename *) fun fn -> destdir^fn with PropList.Not_set _ -> fun fn -> fn in let install_file ?tgt_fn src_file envdir = let tgt_dir = in_destdir (envdir ()) in let tgt_file = Filename.concat tgt_dir (match tgt_fn with | Some fn -> fn | None -> Filename.basename src_file) in (* Create target directory if needed *) OASISFileUtil.mkdir_parent ~ctxt:!BaseContext.default (fun dn -> info (f_ "Creating directory '%s'") dn; BaseLog.register install_dir_ev dn) tgt_dir; (* Really install files *) info (f_ "Copying file '%s' to '%s'") src_file tgt_file; OASISFileUtil.cp ~ctxt:!BaseContext.default src_file tgt_file; BaseLog.register install_file_ev tgt_file in (* Install data into defined directory *) let install_data srcdir lst tgtdir = let tgtdir = OASISHostPath.of_unix (var_expand tgtdir) in List.iter (fun (src, tgt_opt) -> let real_srcs = OASISFileUtil.glob ~ctxt:!BaseContext.default (Filename.concat srcdir src) in if real_srcs = [] then failwithf (f_ "Wildcard '%s' doesn't match any files") src; List.iter (fun fn -> install_file fn (fun () -> match tgt_opt with | Some s -> OASISHostPath.of_unix (var_expand s) | None -> tgtdir)) real_srcs) lst in (** Install all libraries *) let install_libs pkg = let files_of_library (f_data, acc) data_lib = let cs, bs, lib, lib_extra = !lib_hook data_lib in if var_choose bs.bs_install && BaseBuilt.is_built BaseBuilt.BLib cs.cs_name then begin let acc = (* Start with acc + lib_extra *) List.rev_append lib_extra acc in let acc = (* Add uncompiled header from the source tree *) let path = OASISHostPath.of_unix bs.bs_path in List.fold_left (fun acc modul -> try List.find OASISFileUtil.file_exists_case (List.map (Filename.concat path) [modul^".mli"; modul^".ml"; String.uncapitalize modul^".mli"; String.capitalize modul^".mli"; String.uncapitalize modul^".ml"; String.capitalize modul^".ml"]) :: acc with Not_found -> begin warning (f_ "Cannot find source header for module %s \ in library %s") modul cs.cs_name; acc end) acc lib.lib_modules in let acc = (* Get generated files *) BaseBuilt.fold BaseBuilt.BLib cs.cs_name (fun acc fn -> fn :: acc) acc in let f_data () = (* Install data associated with the library *) install_data bs.bs_path bs.bs_data_files (Filename.concat (datarootdir ()) pkg.name); f_data () in (f_data, acc) end else begin (f_data, acc) end and files_of_object (f_data, acc) data_obj = let cs, bs, obj, obj_extra = !obj_hook data_obj in if var_choose bs.bs_install && BaseBuilt.is_built BaseBuilt.BObj cs.cs_name then begin let acc = (* Start with acc + obj_extra *) List.rev_append obj_extra acc in let acc = (* Add uncompiled header from the source tree *) let path = OASISHostPath.of_unix bs.bs_path in List.fold_left (fun acc modul -> try List.find OASISFileUtil.file_exists_case (List.map (Filename.concat path) [modul^".mli"; modul^".ml"; String.uncapitalize modul^".mli"; String.capitalize modul^".mli"; String.uncapitalize modul^".ml"; String.capitalize modul^".ml"]) :: acc with Not_found -> begin warning (f_ "Cannot find source header for module %s \ in object %s") modul cs.cs_name; acc end) acc obj.obj_modules in let acc = (* Get generated files *) BaseBuilt.fold BaseBuilt.BObj cs.cs_name (fun acc fn -> fn :: acc) acc in let f_data () = (* Install data associated with the object *) install_data bs.bs_path bs.bs_data_files (Filename.concat (datarootdir ()) pkg.name); f_data () in (f_data, acc) end else begin (f_data, acc) end in (* Install one group of library *) let install_group_lib grp = (* Iterate through all group nodes *) let rec install_group_lib_aux data_and_files grp = let data_and_files, children = match grp with | Container (_, children) -> data_and_files, children | Package (_, cs, bs, `Library lib, children) -> files_of_library data_and_files (cs, bs, lib), children | Package (_, cs, bs, `Object obj, children) -> files_of_object data_and_files (cs, bs, obj), children in List.fold_left install_group_lib_aux data_and_files children in (* Findlib name of the root library *) let findlib_name = findlib_of_group grp in (* Determine root library *) let root_lib = root_of_group grp in (* All files to install for this library *) let f_data, files = install_group_lib_aux (ignore, []) grp in (* Really install, if there is something to install *) if files = [] then begin warning (f_ "Nothing to install for findlib library '%s'") findlib_name end else begin let meta = (* Search META file *) let _, bs, _ = root_lib in let res = Filename.concat bs.bs_path "META" in if not (OASISFileUtil.file_exists_case res) then failwithf (f_ "Cannot find file '%s' for findlib library %s") res findlib_name; res in let files = (* Make filename shorter to avoid hitting command max line length * too early, esp. on Windows. *) let remove_prefix p n = let plen = String.length p in let nlen = String.length n in if plen <= nlen && String.sub n 0 plen = p then begin let fn_sep = if Sys.os_type = "Win32" then '\\' else '/' in let cutpoint = plen + (if plen < nlen && n.[plen] = fn_sep then 1 else 0) in String.sub n cutpoint (nlen - cutpoint) end else n in List.map (remove_prefix (Sys.getcwd ())) files in info (f_ "Installing findlib library '%s'") findlib_name; let ocamlfind = ocamlfind () in let commands = split_install_command ocamlfind findlib_name meta files in List.iter (OASISExec.run ~ctxt:!BaseContext.default ocamlfind) commands; BaseLog.register install_findlib_ev findlib_name end; (* Install data files *) f_data (); in let group_libs, _, _ = findlib_mapping pkg in (* We install libraries in groups *) List.iter install_group_lib group_libs in let install_execs pkg = let install_exec data_exec = let cs, bs, exec = !exec_hook data_exec in if var_choose bs.bs_install && BaseBuilt.is_built BaseBuilt.BExec cs.cs_name then begin let exec_libdir () = Filename.concat (libdir ()) pkg.name in BaseBuilt.fold BaseBuilt.BExec cs.cs_name (fun () fn -> install_file ~tgt_fn:(cs.cs_name ^ ext_program ()) fn bindir) (); BaseBuilt.fold BaseBuilt.BExecLib cs.cs_name (fun () fn -> install_file fn exec_libdir) (); install_data bs.bs_path bs.bs_data_files (Filename.concat (datarootdir ()) pkg.name) end in List.iter (function | Executable (cs, bs, exec)-> install_exec (cs, bs, exec) | _ -> ()) pkg.sections in let install_docs pkg = let install_doc data = let cs, doc = !doc_hook data in if var_choose doc.doc_install && BaseBuilt.is_built BaseBuilt.BDoc cs.cs_name then begin let tgt_dir = OASISHostPath.of_unix (var_expand doc.doc_install_dir) in BaseBuilt.fold BaseBuilt.BDoc cs.cs_name (fun () fn -> install_file fn (fun () -> tgt_dir)) (); install_data Filename.current_dir_name doc.doc_data_files doc.doc_install_dir end in List.iter (function | Doc (cs, doc) -> install_doc (cs, doc) | _ -> ()) pkg.sections in install_libs pkg; install_execs pkg; install_docs pkg (* Uninstall already installed data *) let uninstall _ argv = List.iter (fun (ev, data) -> if ev = install_file_ev then begin if OASISFileUtil.file_exists_case data then begin info (f_ "Removing file '%s'") data; Sys.remove data end else begin warning (f_ "File '%s' doesn't exist anymore") data end end else if ev = install_dir_ev then begin if Sys.file_exists data && Sys.is_directory data then begin if Sys.readdir data = [||] then begin info (f_ "Removing directory '%s'") data; OASISFileUtil.rmdir ~ctxt:!BaseContext.default data end else begin warning (f_ "Directory '%s' is not empty (%s)") data (String.concat ", " (Array.to_list (Sys.readdir data))) end end else begin warning (f_ "Directory '%s' doesn't exist anymore") data end end else if ev = install_findlib_ev then begin info (f_ "Removing findlib library '%s'") data; OASISExec.run ~ctxt:!BaseContext.default (ocamlfind ()) ["remove"; data] end else failwithf (f_ "Unknown log event '%s'") ev; BaseLog.unregister ev data) (* We process event in reverse order *) (List.rev (BaseLog.filter [install_file_ev; install_dir_ev; install_findlib_ev])) end # 6243 "setup.ml" module OCamlbuildCommon = struct (* # 22 "src/plugins/ocamlbuild/OCamlbuildCommon.ml" *) (** Functions common to OCamlbuild build and doc plugin *) open OASISGettext open BaseEnv open BaseStandardVar open OASISTypes type extra_args = string list let ocamlbuild_clean_ev = "ocamlbuild-clean" let ocamlbuildflags = var_define ~short_desc:(fun () -> "OCamlbuild additional flags") "ocamlbuildflags" (fun () -> "") (** Fix special arguments depending on environment *) let fix_args args extra_argv = List.flatten [ if (os_type ()) = "Win32" then [ "-classic-display"; "-no-log"; "-no-links"; "-install-lib-dir"; (Filename.concat (standard_library ()) "ocamlbuild") ] else []; if not (bool_of_string (is_native ())) || (os_type ()) = "Win32" then [ "-byte-plugin" ] else []; args; if bool_of_string (debug ()) then ["-tag"; "debug"] else []; if bool_of_string (profile ()) then ["-tag"; "profile"] else []; OASISString.nsplit (ocamlbuildflags ()) ' '; Array.to_list extra_argv; ] (** Run 'ocamlbuild -clean' if not already done *) let run_clean extra_argv = let extra_cli = String.concat " " (Array.to_list extra_argv) in (* Run if never called with these args *) if not (BaseLog.exists ocamlbuild_clean_ev extra_cli) then begin OASISExec.run ~ctxt:!BaseContext.default (ocamlbuild ()) (fix_args ["-clean"] extra_argv); BaseLog.register ocamlbuild_clean_ev extra_cli; at_exit (fun () -> try BaseLog.unregister ocamlbuild_clean_ev extra_cli with _ -> ()) end (** Run ocamlbuild, unregister all clean events *) let run_ocamlbuild args extra_argv = (* TODO: enforce that target in args must be UNIX encoded i.e. toto/index.html *) OASISExec.run ~ctxt:!BaseContext.default (ocamlbuild ()) (fix_args args extra_argv); (* Remove any clean event, we must run it again *) List.iter (fun (e, d) -> BaseLog.unregister e d) (BaseLog.filter [ocamlbuild_clean_ev]) (** Determine real build directory *) let build_dir extra_argv = let rec search_args dir = function | "-build-dir" :: dir :: tl -> search_args dir tl | _ :: tl -> search_args dir tl | [] -> dir in search_args "_build" (fix_args [] extra_argv) end module OCamlbuildPlugin = struct (* # 22 "src/plugins/ocamlbuild/OCamlbuildPlugin.ml" *) (** Build using ocamlbuild @author Sylvain Le Gall *) open OASISTypes open OASISGettext open OASISUtils open OASISString open BaseEnv open OCamlbuildCommon open BaseStandardVar open BaseMessage let cond_targets_hook = ref (fun lst -> lst) let build extra_args pkg argv = (* Return the filename in build directory *) let in_build_dir fn = Filename.concat (build_dir argv) fn in (* Return the unix filename in host build directory *) let in_build_dir_of_unix fn = in_build_dir (OASISHostPath.of_unix fn) in let cond_targets = List.fold_left (fun acc -> function | Library (cs, bs, lib) when var_choose bs.bs_build -> begin let evs, unix_files = BaseBuilt.of_library in_build_dir_of_unix (cs, bs, lib) in let tgts = List.flatten (List.filter (fun l -> l <> []) (List.map (List.filter (fun fn -> ends_with ~what:".cma" fn || ends_with ~what:".cmxs" fn || ends_with ~what:".cmxa" fn || ends_with ~what:(ext_lib ()) fn || ends_with ~what:(ext_dll ()) fn)) unix_files)) in match tgts with | _ :: _ -> (evs, tgts) :: acc | [] -> failwithf (f_ "No possible ocamlbuild targets for library %s") cs.cs_name end | Object (cs, bs, obj) when var_choose bs.bs_build -> begin let evs, unix_files = BaseBuilt.of_object in_build_dir_of_unix (cs, bs, obj) in let tgts = List.flatten (List.filter (fun l -> l <> []) (List.map (List.filter (fun fn -> ends_with ".cmo" fn || ends_with ".cmx" fn)) unix_files)) in match tgts with | _ :: _ -> (evs, tgts) :: acc | [] -> failwithf (f_ "No possible ocamlbuild targets for object %s") cs.cs_name end | Executable (cs, bs, exec) when var_choose bs.bs_build -> begin let evs, unix_exec_is, unix_dll_opt = BaseBuilt.of_executable in_build_dir_of_unix (cs, bs, exec) in let target ext = let unix_tgt = (OASISUnixPath.concat bs.bs_path (OASISUnixPath.chop_extension exec.exec_main_is))^ext in let evs = (* Fix evs, we want to use the unix_tgt, without copying *) List.map (function | BaseBuilt.BExec, nm, lst when nm = cs.cs_name -> BaseBuilt.BExec, nm, [[in_build_dir_of_unix unix_tgt]] | ev -> ev) evs in evs, [unix_tgt] in (* Add executable *) let acc = match bs.bs_compiled_object with | Native -> (target ".native") :: acc | Best when bool_of_string (is_native ()) -> (target ".native") :: acc | Byte | Best -> (target ".byte") :: acc in acc end | Library _ | Object _ | Executable _ | Test _ | SrcRepo _ | Flag _ | Doc _ -> acc) [] (* Keep the pkg.sections ordered *) (List.rev pkg.sections); in (* Check and register built files *) let check_and_register (bt, bnm, lst) = List.iter (fun fns -> if not (List.exists OASISFileUtil.file_exists_case fns) then failwithf (fn_ "Expected built file %s doesn't exist." "None of expected built files %s exists." (List.length fns)) (String.concat (s_ " or ") (List.map (Printf.sprintf "'%s'") fns))) lst; (BaseBuilt.register bt bnm lst) in (* Run the hook *) let cond_targets = !cond_targets_hook cond_targets in (* Run a list of target... *) run_ocamlbuild (List.flatten (List.map snd cond_targets) @ extra_args) argv; (* ... and register events *) List.iter check_and_register (List.flatten (List.map fst cond_targets)) let clean pkg extra_args = run_clean extra_args; List.iter (function | Library (cs, _, _) -> BaseBuilt.unregister BaseBuilt.BLib cs.cs_name | Executable (cs, _, _) -> BaseBuilt.unregister BaseBuilt.BExec cs.cs_name; BaseBuilt.unregister BaseBuilt.BExecLib cs.cs_name | _ -> ()) pkg.sections end module OCamlbuildDocPlugin = struct (* # 22 "src/plugins/ocamlbuild/OCamlbuildDocPlugin.ml" *) (* Create documentation using ocamlbuild .odocl files @author Sylvain Le Gall *) open OASISTypes open OASISGettext open OASISMessage open OCamlbuildCommon open BaseStandardVar type run_t = { extra_args: string list; run_path: unix_filename; } let doc_build run pkg (cs, doc) argv = let index_html = OASISUnixPath.make [ run.run_path; cs.cs_name^".docdir"; "index.html"; ] in let tgt_dir = OASISHostPath.make [ build_dir argv; OASISHostPath.of_unix run.run_path; cs.cs_name^".docdir"; ] in run_ocamlbuild (index_html :: run.extra_args) argv; List.iter (fun glb -> BaseBuilt.register BaseBuilt.BDoc cs.cs_name [OASISFileUtil.glob ~ctxt:!BaseContext.default (Filename.concat tgt_dir glb)]) ["*.html"; "*.css"] let doc_clean run pkg (cs, doc) argv = run_clean argv; BaseBuilt.unregister BaseBuilt.BDoc cs.cs_name end # 6616 "setup.ml" module CustomPlugin = struct (* # 22 "src/plugins/custom/CustomPlugin.ml" *) (** Generate custom configure/build/doc/test/install system @author *) open BaseEnv open OASISGettext open OASISTypes type t = { cmd_main: command_line conditional; cmd_clean: (command_line option) conditional; cmd_distclean: (command_line option) conditional; } let run = BaseCustom.run let main t _ extra_args = let cmd, args = var_choose ~name:(s_ "main command") t.cmd_main in run cmd args extra_args let clean t pkg extra_args = match var_choose t.cmd_clean with | Some (cmd, args) -> run cmd args extra_args | _ -> () let distclean t pkg extra_args = match var_choose t.cmd_distclean with | Some (cmd, args) -> run cmd args extra_args | _ -> () module Build = struct let main t pkg extra_args = main t pkg extra_args; List.iter (fun sct -> let evs = match sct with | Library (cs, bs, lib) when var_choose bs.bs_build -> begin let evs, _ = BaseBuilt.of_library OASISHostPath.of_unix (cs, bs, lib) in evs end | Executable (cs, bs, exec) when var_choose bs.bs_build -> begin let evs, _, _ = BaseBuilt.of_executable OASISHostPath.of_unix (cs, bs, exec) in evs end | _ -> [] in List.iter (fun (bt, bnm, lst) -> BaseBuilt.register bt bnm lst) evs) pkg.sections let clean t pkg extra_args = clean t pkg extra_args; (* TODO: this seems to be pretty generic (at least wrt to ocamlbuild * considering moving this to BaseSetup? *) List.iter (function | Library (cs, _, _) -> BaseBuilt.unregister BaseBuilt.BLib cs.cs_name | Executable (cs, _, _) -> BaseBuilt.unregister BaseBuilt.BExec cs.cs_name; BaseBuilt.unregister BaseBuilt.BExecLib cs.cs_name | _ -> ()) pkg.sections let distclean t pkg extra_args = distclean t pkg extra_args end module Test = struct let main t pkg (cs, test) extra_args = try main t pkg extra_args; 0.0 with Failure s -> BaseMessage.warning (f_ "Test '%s' fails: %s") cs.cs_name s; 1.0 let clean t pkg (cs, test) extra_args = clean t pkg extra_args let distclean t pkg (cs, test) extra_args = distclean t pkg extra_args end module Doc = struct let main t pkg (cs, _) extra_args = main t pkg extra_args; BaseBuilt.register BaseBuilt.BDoc cs.cs_name [] let clean t pkg (cs, _) extra_args = clean t pkg extra_args; BaseBuilt.unregister BaseBuilt.BDoc cs.cs_name let distclean t pkg (cs, _) extra_args = distclean t pkg extra_args end end # 6764 "setup.ml" open OASISTypes;; let setup_t = { BaseSetup.configure = InternalConfigurePlugin.configure; build = OCamlbuildPlugin.build []; test = [ ("re_match", CustomPlugin.Test.main { CustomPlugin.cmd_main = [(OASISExpr.EBool true, ("$re_match", []))]; cmd_clean = [(OASISExpr.EBool true, None)]; cmd_distclean = [(OASISExpr.EBool true, None)] }) ]; doc = [ ("re-api", OCamlbuildDocPlugin.doc_build {OCamlbuildDocPlugin.extra_args = []; run_path = "./lib"}) ]; install = InternalInstallPlugin.install; uninstall = InternalInstallPlugin.uninstall; clean = [OCamlbuildPlugin.clean]; clean_test = [ ("re_match", CustomPlugin.Test.clean { CustomPlugin.cmd_main = [(OASISExpr.EBool true, ("$re_match", []))]; cmd_clean = [(OASISExpr.EBool true, None)]; cmd_distclean = [(OASISExpr.EBool true, None)] }) ]; clean_doc = [ ("re-api", OCamlbuildDocPlugin.doc_clean {OCamlbuildDocPlugin.extra_args = []; run_path = "./lib"}) ]; distclean = []; distclean_test = [ ("re_match", CustomPlugin.Test.distclean { CustomPlugin.cmd_main = [(OASISExpr.EBool true, ("$re_match", []))]; cmd_clean = [(OASISExpr.EBool true, None)]; cmd_distclean = [(OASISExpr.EBool true, None)] }) ]; distclean_doc = []; package = { oasis_version = "0.4"; ocaml_version = None; findlib_version = None; alpha_features = []; beta_features = []; name = "re"; version = "1.2.1"; license = OASISLicense.DEP5License (OASISLicense.DEP5Unit { OASISLicense.license = "LGPL"; excption = Some "OCaml linking"; version = OASISLicense.Version "2.0" }); license_file = None; copyrights = []; maintainers = []; authors = ["Jerome Vouillon"; "Thomas Gazagnaire"; "Anil Madhavapeddy"]; homepage = None; synopsis = "Pure OCaml regular expression library"; description = None; categories = []; conf_type = (`Configure, "internal", Some "0.4"); conf_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)] }; build_type = (`Build, "ocamlbuild", Some "0.4"); build_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)] }; install_type = (`Install, "internal", Some "0.4"); install_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)] }; uninstall_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)] }; clean_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)] }; distclean_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)] }; files_ab = []; sections = [ Library ({ cs_name = "re"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { bs_build = [(OASISExpr.EBool true, true)]; bs_install = [(OASISExpr.EBool true, true)]; bs_path = "lib"; bs_compiled_object = Best; bs_build_depends = []; bs_build_tools = [ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])] }, { lib_modules = ["Re"]; lib_pack = false; lib_internal_modules = ["Cset"; "Automata"]; lib_findlib_parent = None; lib_findlib_name = Some "re"; lib_findlib_containers = [] }); Library ({ cs_name = "re_emacs"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { bs_build = [(OASISExpr.EBool true, true)]; bs_install = [(OASISExpr.EBool true, true)]; bs_path = "lib"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "re"]; bs_build_tools = [ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])] }, { lib_modules = ["Re_emacs"]; lib_pack = false; lib_internal_modules = []; lib_findlib_parent = Some "re"; lib_findlib_name = Some "emacs"; lib_findlib_containers = [] }); Library ({ cs_name = "re_str"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { bs_build = [(OASISExpr.EBool true, true)]; bs_install = [(OASISExpr.EBool true, true)]; bs_path = "lib"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "re"; InternalLibrary "re_emacs"]; bs_build_tools = [ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])] }, { lib_modules = ["Re_str"]; lib_pack = false; lib_internal_modules = []; lib_findlib_parent = Some "re"; lib_findlib_name = Some "str"; lib_findlib_containers = [] }); Library ({ cs_name = "re_posix"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { bs_build = [(OASISExpr.EBool true, true)]; bs_install = [(OASISExpr.EBool true, true)]; bs_path = "lib"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "re"]; bs_build_tools = [ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])] }, { lib_modules = ["Re_posix"]; lib_pack = false; lib_internal_modules = []; lib_findlib_parent = Some "re"; lib_findlib_name = Some "posix"; lib_findlib_containers = [] }); Library ({ cs_name = "re_glob"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { bs_build = [(OASISExpr.EBool true, true)]; bs_install = [(OASISExpr.EBool true, true)]; bs_path = "lib"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "re"]; bs_build_tools = [ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])] }, { lib_modules = ["Re_glob"]; lib_pack = false; lib_internal_modules = []; lib_findlib_parent = Some "re"; lib_findlib_name = Some "glob"; lib_findlib_containers = [] }); Library ({ cs_name = "re_perl"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { bs_build = [(OASISExpr.EBool true, true)]; bs_install = [(OASISExpr.EBool true, true)]; bs_path = "lib"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "re"]; bs_build_tools = [ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])] }, { lib_modules = ["Re_perl"]; lib_pack = false; lib_internal_modules = []; lib_findlib_parent = Some "re"; lib_findlib_name = Some "perl"; lib_findlib_containers = [] }); Library ({ cs_name = "re_pcre"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { bs_build = [(OASISExpr.EBool true, true)]; bs_install = [(OASISExpr.EBool true, true)]; bs_path = "lib"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "re"; InternalLibrary "re_perl"]; bs_build_tools = [ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])] }, { lib_modules = ["Re_pcre"]; lib_pack = false; lib_internal_modules = []; lib_findlib_parent = Some "re"; lib_findlib_name = Some "pcre"; lib_findlib_containers = [] }); Executable ({ cs_name = "re_match"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { bs_build = [ (OASISExpr.EBool true, false); (OASISExpr.EFlag "tests", true) ]; bs_install = [(OASISExpr.EBool true, false)]; bs_path = "lib_test"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "re"]; bs_build_tools = [ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])] }, {exec_custom = true; exec_main_is = "re_match.ml"}); Test ({ cs_name = "re_match"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { test_type = (`Test, "custom", Some "0.4"); test_command = [(OASISExpr.EBool true, ("$re_match", []))]; test_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)] }; test_working_directory = Some "lib_test"; test_run = [ (OASISExpr.ENot (OASISExpr.EFlag "tests"), false); (OASISExpr.EFlag "tests", false); (OASISExpr.EAnd (OASISExpr.EFlag "tests", OASISExpr.EFlag "tests"), true) ]; test_tools = [ExternalTool "ocamlbuild"] }); Doc ({ cs_name = "re-api"; cs_data = PropList.Data.create (); cs_plugin_data = [] }, { doc_type = (`Doc, "ocamlbuild", Some "0.3"); doc_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)] }; doc_build = [ (OASISExpr.ENot (OASISExpr.EFlag "docs"), false); (OASISExpr.EFlag "docs", true) ]; doc_install = [(OASISExpr.EBool true, true)]; doc_install_dir = "$htmldir/api"; doc_title = "API reference for Re"; doc_authors = []; doc_abstract = None; doc_format = OtherDoc; doc_data_files = []; doc_build_tools = [ExternalTool "ocamlbuild"; ExternalTool "ocamldoc"] }) ]; plugins = [(`Extra, "META", Some "0.4")]; disable_oasis_section = []; schema_data = PropList.Data.create (); plugin_data = [] }; oasis_fn = Some "_oasis"; oasis_version = "0.4.4"; oasis_digest = Some "\203,\179\148\209\248\201\004\186\200\135\244t9\247\209"; oasis_exec = None; oasis_setup_args = []; setup_update = false };; let setup () = BaseSetup.setup setup_t;; # 7195 "setup.ml" (* OASIS_STOP *) let () = setup ();;