BSON-XS-v0.8.2/000755 000766 000024 00000000000 13572251451 013240 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/bson/000755 000766 000024 00000000000 13572251451 014201 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/devel/000755 000766 000024 00000000000 13572251451 014337 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/inc/000755 000766 000024 00000000000 13572251451 014011 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/LICENSE000644 000766 000024 00000026354 13572251451 014257 0ustar00davidstaff000000 000000 This software is Copyright (c) 2019 by MongoDB, Inc. This is free software, licensed under: The Apache License, Version 2.0, January 2004 Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. BSON-XS-v0.8.2/cpanfile000644 000766 000024 00000004533 13572251451 014751 0ustar00davidstaff000000 000000 requires "BSON" => "1.012000"; requires "XSLoader" => "0"; requires "boolean" => "0"; requires "perl" => "5.010001"; requires "strict" => "0"; requires "version" => "0"; requires "warnings" => "0"; on 'test' => sub { requires "B" => "0"; requires "BSON" => "1.012000"; requires "BSON::OID" => "0"; requires "BSON::Types" => "0"; requires "Carp" => "0"; requires "Data::Dumper" => "0"; requires "Devel::Peek" => "0"; requires "Exporter" => "0"; requires "ExtUtils::MakeMaker" => "0"; requires "File::Spec" => "0"; requires "JSON::MaybeXS" => "0"; requires "JSON::PP" => "2.97001"; requires "MIME::Base64" => "0"; requires "Math::BigInt" => "0"; requires "Path::Tiny" => "0.054"; requires "Scalar::Util" => "0"; requires "Test::Deep" => "0"; requires "Test::Fatal" => "0"; requires "Test::More" => "0.96"; requires "Tie::IxHash" => "0"; requires "base" => "0"; requires "constant" => "0"; requires "lib" => "0"; requires "perl" => "5.010001"; requires "utf8" => "0"; }; on 'test' => sub { recommends "CPAN::Meta" => "2.120900"; }; on 'configure' => sub { requires "Config::AutoConf" => "0.22"; requires "ExtUtils::MakeMaker" => "0"; requires "Path::Tiny" => "0.052"; requires "perl" => "5.008"; }; on 'develop' => sub { requires "BSON" => "0"; requires "BSON::Types" => "0"; requires "Dist::Zilla" => "5"; requires "Dist::Zilla::Plugin::MakeMaker::Awesome" => "0.35"; requires "Dist::Zilla::Plugin::Prereqs" => "0"; requires "Dist::Zilla::Plugin::ReleaseStatus::FromVersion" => "0"; requires "Dist::Zilla::Plugin::RemovePrereqs" => "0"; requires "Dist::Zilla::PluginBundle::DAGOLDEN" => "0.072"; requires "File::Spec" => "0"; requires "File::Temp" => "0"; requires "IO::Handle" => "0"; requires "IPC::Open3" => "0"; requires "Pod::Coverage::TrustPod" => "0"; requires "Pod::Wordlist" => "0"; requires "Software::License::Apache_2_0" => "0"; requires "Test::CPAN::Meta" => "0"; requires "Test::LeakTrace" => "0"; requires "Test::MinimumVersion" => "0"; requires "Test::More" => "0.96"; requires "Test::Perl::Critic" => "0"; requires "Test::Pod" => "1.41"; requires "Test::Pod::Coverage" => "1.08"; requires "Test::Portability::Files" => "0"; requires "Test::Spelling" => "0.12"; requires "Test::Version" => "1"; requires "Tie::IxHash" => "0"; requires "inc::MakeMaker" => "0"; }; BSON-XS-v0.8.2/Changes000644 000766 000024 00000005714 13572251451 014542 0ustar00davidstaff000000 000000 Revision history for BSON-XS v0.8.2 2019-12-05 13:57:34-05:00 America/New_York [Fixed] - PERL-1128 Fixed gettid build conflict with newer gcc v0.8.1 2019-08-13 08:19:37-04:00 America/New_York [!!! END OF LIFE NOTICE !!!] - Version v0.8.0 is the final feature release of the MongoDB BSON::XS library. The library is now in a 12-month "sunset" period and will receive security patches and critical bug fixes only. The BSON::XS library will be end-of-life and unsupported on August 13, 2020. v0.8.0 2019-07-12 13:57:20-04:00 America/New_York [Added] - Added support for BSON::Array from BSON v1.12.0. v0.6.0 2018-11-29 17:08:47-05:00 America/New_York [Changed] - PERL-1031 Limit BSON max-depth - PERL-1040 Improve error message for unknown BSON type [Prereqs] - Requires BSON v1.10.0 [Testing] - Synchronize tests with BSON.pm v0.4.6 2018-10-12 11:50:05-04:00 America/New_York [Bug fixes] - PERL-1016 Fix BSON timestamp decoding on 32-bit perls. v0.4.5 2018-10-11 21:38:03-04:00 America/New_York [Bug fixes] - PERL-1013 Fix binary subtype 2 and Decimal128 encoding on big-endian platforms. [Testing] - Synchronize tests with BSON.pm [Prereqs] - Requires BSON.pm v1.8.1 v0.4.4 2018-09-12 23:14:04-04:00 America/New_York [Bug fixes] - PERL-998 Don't wrap top-level documents in a BSON::DBRef, even if they have keys that resemble it [Testing] - Synchronize tests with BSON.pm [Prereqs] - Requires BSON.pm v1.8.0 v0.4.3 2018-07-10 09:51:48-04:00 America/New_York [Testing] - PERL-954 Prevent deprecation warnings from use of deprecated MongoDB v2.0.0 classes in test code. - Synchronize tests with BSON.pm [Prereqs] - PERL-955 Windows requires Vista or later v0.4.2 2018-06-13 10:01:13-04:00 America/New_York [Bug fixes] - PERL-931 Fix memory leaks and early free - PERL-932 Fix possible stack corruption in BSON::Doc encoding on Perls <= 5.24 [Prereqs] - Bumped BSON.pm prereq to v1.6.3 v0.4.1 2018-05-25 13:19:41-04:00 America/New_York [Bug fixes] - PERL-898 Fix memory leaks decoding CODEWSCOPE and DBRefs - PERL-902 Implement type wrapper ISA optimization - PERL-910 Fix bug with ordered hashes and unicode keys v0.4.0 2018-05-17 16:35:23-04:00 America/New_York [!!! Incompatible Changes !!!] - PERL-742 Requires Perl 5.10.1 or later [Fixes] - PERL-894 Fix bug coercing strings to number - PERL-894 apply prefer_numeric only to pure strings v0.2.2 2016-10-27 17:55:25-04:00 America/New_York [Fixes] - Add missing dynamic configuration step to Makefile.PL - Add more portability fixes for older Perls v0.2.1 2016-10-27 10:26:55-04:00 America/New_York [Fixes] - Fix portability of XS to older Perls v0.2.0 2016-10-24 21:42:33-04:00 America/New_York - First release BSON-XS-v0.8.2/corpus/000755 000766 000024 00000000000 13572251451 014553 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/MANIFEST000644 000766 000024 00000007175 13572251451 014403 0ustar00davidstaff000000 000000 # This file was automatically generated by Dist::Zilla::Plugin::Manifest v6.012. CONTRIBUTING.mkdn Changes LICENSE MANIFEST META.json META.yml Makefile.PL README bson/b64_ntop.h bson/b64_pton.h bson/bson-atomic.c bson/bson-atomic.h bson/bson-clock.c bson/bson-clock.h bson/bson-compat.h bson/bson-config.h.in bson/bson-context-private.h bson/bson-context.c bson/bson-context.h bson/bson-decimal128.c bson/bson-decimal128.h bson/bson-endian.h bson/bson-error.c bson/bson-error.h bson/bson-iso8601-private.h bson/bson-iso8601.c bson/bson-iter.c bson/bson-iter.h bson/bson-keys.c bson/bson-keys.h bson/bson-macros.h bson/bson-md5.c bson/bson-md5.h bson/bson-memory.c bson/bson-memory.h bson/bson-oid.c bson/bson-oid.h bson/bson-private.h bson/bson-reader.c bson/bson-reader.h bson/bson-stdint-win32.h bson/bson-stdint.h bson/bson-string.c bson/bson-string.h bson/bson-thread-private.h bson/bson-timegm-private.h bson/bson-timegm.c bson/bson-types.h bson/bson-utf8.c bson/bson-utf8.h bson/bson-value.c bson/bson-value.h bson/bson-version.c bson/bson-version.h bson/bson-writer.c bson/bson-writer.h bson/bson.c bson/bson.h corpus/README.md corpus/array.json corpus/binary.json corpus/boolean.json corpus/code.json corpus/code_w_scope.json corpus/datetime.json corpus/dbpointer.json corpus/dbref.json corpus/decimal128-1.json corpus/decimal128-2.json corpus/decimal128-3.json corpus/decimal128-4.json corpus/decimal128-5.json corpus/decimal128-6.json corpus/decimal128-7.json corpus/decode-dump.pl corpus/deprecated/dbpointer.json corpus/deprecated/symbol.json corpus/deprecated/undefined.json corpus/document.json corpus/double.json corpus/encode-dump.pl corpus/int32.json corpus/int64.json corpus/maxkey.json corpus/minkey.json corpus/multi-type-deprecated.json corpus/multi-type.json corpus/null.json corpus/oid.json corpus/regex.json corpus/string.json corpus/symbol.json corpus/timestamp.json corpus/top.json corpus/undefined.json cpanfile devel/sync-bson-tests.pl dist.ini inc/BSONConfig.pm inc/MM_pkg_MY.pl inc/MakeMaker.pm lib/BSON/XS.pm perlcritic.rc ppport.h pstdint.h t/00-report-prereqs.dd t/00-report-prereqs.t t/README t/backend.t t/common/bson_array.t t/common/create_oid.t t/common/cycle.t t/common/dualvar.t t/common/errors.t t/common/number_heuristics.t t/common/options.t t/common/tied.t t/common/top-array.t t/corpus/array.t t/corpus/binary.t t/corpus/boolean.t t/corpus/code.t t/corpus/code_w_scope.t t/corpus/corpus.pl t/corpus/datetime.t t/corpus/dbpointer.t t/corpus/dbref.t t/corpus/decimal128-1.t t/corpus/decimal128-2.t t/corpus/decimal128-3.t t/corpus/decimal128-4.t t/corpus/decimal128-5.t t/corpus/decimal128-6.t t/corpus/decimal128-7.t t/corpus/document.t t/corpus/double.t t/corpus/int32.t t/corpus/int64.t t/corpus/maxkey.t t/corpus/minkey.t t/corpus/multi-type.t t/corpus/null.t t/corpus/oid.t t/corpus/regex.t t/corpus/string.t t/corpus/symbol.t t/corpus/timestamp.t t/corpus/top.t t/corpus/undefined.t t/lib/CorpusTest.pm t/lib/TestTie.pm t/lib/TestUtils.pm t/mapping/binary.t t/mapping/boolean.t t/mapping/code.t t/mapping/dbref.t t/mapping/decimal128.t t/mapping/double.t t/mapping/hashref.t t/mapping/int32.t t/mapping/int64.t t/mapping/minmaxkey.t t/mapping/oid.t t/mapping/regex.t t/mapping/string.t t/mapping/time.t t/mapping/timestamp.t t/pvtlib/CleanEnv.pm t/regression/boolean_copy.t t/regression/scalar_ref_value.t t/regression/undef_round_trip.t testing/build.pl testing/config.yml testing/test.pl testing/write-config.pl tidyall.ini xs/XS.xs xt/author/00-compile.t xt/author/critic.t xt/author/minimum-version.t xt/author/pod-coverage.t xt/author/pod-spell.t xt/author/pod-syntax.t xt/author/portability.t xt/author/test-version.t xt/leaktest.t xt/release/distmeta.t BSON-XS-v0.8.2/perlcritic.rc000644 000766 000024 00000001166 13572251451 015732 0ustar00davidstaff000000 000000 severity = 5 verbose = 8 [Variables::ProhibitPunctuationVars] allow = $@ $! [TestingAndDebugging::ProhibitNoStrict] allow = refs [Variables::ProhibitEvilVariables] variables = $DB::single # Turn these off [-BuiltinFunctions::ProhibitStringyEval] [-ControlStructures::ProhibitPostfixControls] [-ControlStructures::ProhibitUnlessBlocks] [-Documentation::RequirePodSections] [-InputOutput::ProhibitInteractiveTest] [-References::ProhibitDoubleSigils] [-RegularExpressions::RequireExtendedFormatting] [-InputOutput::ProhibitTwoArgOpen] [-Modules::ProhibitEvilModules] # Turn this on [Lax::ProhibitStringyEval::ExceptForRequire] BSON-XS-v0.8.2/CONTRIBUTING.mkdn000644 000766 000024 00000006604 13572251451 016030 0ustar00davidstaff000000 000000 ## HOW TO CONTRIBUTE Thank you for considering contributing to this distribution. This file contains instructions that will help you work with the source code. The distribution is managed with Dist::Zilla. This means that many of the usual files you might expect are not in the repository, but are generated at release time, as is much of the documentation. Some generated files are kept in the repository as a convenience (e.g. Makefile.PL or cpanfile). Generally, **you do not need Dist::Zilla to contribute patches**. You do need Dist::Zilla to create a tarball. See below for guidance. ### Getting dependencies If you have App::cpanminus 1.6 or later installed, you can use `cpanm` to satisfy dependencies like this: $ cpanm --installdeps . Otherwise, look for either a `Makefile.PL` or `cpanfile` file for a list of dependencies to satisfy. ### Running tests You can run tests directly using the `prove` tool: $ prove -l $ prove -lv t/some_test_file.t For most of my distributions, `prove` is entirely sufficient for you to test any patches you have. I use `prove` for 99% of my testing during development. ### Code style and tidying Please try to match any existing coding style. If there is a `.perltidyrc` file, please install Perl::Tidy and use perltidy before submitting patches. If there is a `tidyall.ini` file, you can also install Code::TidyAll and run `tidyall` on a file or `tidyall -a` to tidy all files. ### Patching documentation Much of the documentation Pod is generated at release time. Some is generated boilerplate; other documentation is built from pseudo-POD directives in the source like C<=method> or C<=func>. If you would like to submit a documentation edit, please limit yourself to the documentation you see. If you see typos or documentation issues in the generated docs, please email or open a bug ticket instead of patching. ### Where to send patches and pull requests If you found this distribution on Github, sending a pull-request is the best way to contribute. If a pull-request isn't possible, a bug ticket with a patch file is the next best option. As a last resort, an email to the author(s) is acceptable. ## Installing and using Dist::Zilla Dist::Zilla is not required for contributing, but if you'd like to learn more, this section will get you up to speed. Dist::Zilla is a very powerful authoring tool, optimized for maintaining a large number of distributions with a high degree of automation, but it has a large dependency chain, a bit of a learning curve and requires a number of author-specific plugins. To install it from CPAN, I recommend one of the following approaches for the quickest installation: # using CPAN.pm, but bypassing non-functional pod tests $ cpan TAP::Harness::Restricted $ PERL_MM_USE_DEFAULT=1 HARNESS_CLASS=TAP::Harness::Restricted cpan Dist::Zilla # using cpanm, bypassing *all* tests $ cpanm -n Dist::Zilla In either case, it's probably going to take about 10 minutes. Go for a walk, go get a cup of your favorite beverage, take a bathroom break, or whatever. When you get back, Dist::Zilla should be ready for you. Then you need to install any plugins specific to this distribution: $ cpan `dzil authordeps` $ dzil authordeps | cpanm Once installed, here are some dzil commands you might try: $ dzil build $ dzil test $ dzil xtest You can learn more about Dist::Zilla at http://dzil.org/ BSON-XS-v0.8.2/ppport.h000644 000766 000024 00000606605 13572251451 014752 0ustar00davidstaff000000 000000 #if 0 <<'SKIP'; #endif /* ---------------------------------------------------------------------- ppport.h -- Perl/Pollution/Portability Version 3.42 Automatically created by Devel::PPPort running under perl 5.026001. Do NOT edit this file directly! -- Edit PPPort_pm.PL and the includes in parts/inc/ instead. Use 'perldoc ppport.h' to view the documentation below. ---------------------------------------------------------------------- SKIP =pod =head1 NAME ppport.h - Perl/Pollution/Portability version 3.42 =head1 SYNOPSIS perl ppport.h [options] [source files] Searches current directory for files if no [source files] are given --help show short help --version show version --patch=file write one patch file with changes --copy=suffix write changed copies with suffix --diff=program use diff program and options --compat-version=version provide compatibility with Perl version --cplusplus accept C++ comments --quiet don't output anything except fatal errors --nodiag don't show diagnostics --nohints don't show hints --nochanges don't suggest changes --nofilter don't filter input files --strip strip all script and doc functionality from ppport.h --list-provided list provided API --list-unsupported list unsupported API --api-info=name show Perl API portability information =head1 COMPATIBILITY This version of F is designed to support operation with Perl installations back to 5.003, and has been tested up to 5.20. =head1 OPTIONS =head2 --help Display a brief usage summary. =head2 --version Display the version of F. =head2 --patch=I If this option is given, a single patch file will be created if any changes are suggested. This requires a working diff program to be installed on your system. =head2 --copy=I If this option is given, a copy of each file will be saved with the given suffix that contains the suggested changes. This does not require any external programs. Note that this does not automagically add a dot between the original filename and the suffix. If you want the dot, you have to include it in the option argument. If neither C<--patch> or C<--copy> are given, the default is to simply print the diffs for each file. This requires either C or a C program to be installed. =head2 --diff=I Manually set the diff program and options to use. The default is to use C, when installed, and output unified context diffs. =head2 --compat-version=I Tell F to check for compatibility with the given Perl version. The default is to check for compatibility with Perl version 5.003. You can use this option to reduce the output of F if you intend to be backward compatible only down to a certain Perl version. =head2 --cplusplus Usually, F will detect C++ style comments and replace them with C style comments for portability reasons. Using this option instructs F to leave C++ comments untouched. =head2 --quiet Be quiet. Don't print anything except fatal errors. =head2 --nodiag Don't output any diagnostic messages. Only portability alerts will be printed. =head2 --nohints Don't output any hints. Hints often contain useful portability notes. Warnings will still be displayed. =head2 --nochanges Don't suggest any changes. Only give diagnostic output and hints unless these are also deactivated. =head2 --nofilter Don't filter the list of input files. By default, files not looking like source code (i.e. not *.xs, *.c, *.cc, *.cpp or *.h) are skipped. =head2 --strip Strip all script and documentation functionality from F. This reduces the size of F dramatically and may be useful if you want to include F in smaller modules without increasing their distribution size too much. The stripped F will have a C<--unstrip> option that allows you to undo the stripping, but only if an appropriate C module is installed. =head2 --list-provided Lists the API elements for which compatibility is provided by F. Also lists if it must be explicitly requested, if it has dependencies, and if there are hints or warnings for it. =head2 --list-unsupported Lists the API elements that are known not to be supported by F and below which version of Perl they probably won't be available or work. =head2 --api-info=I Show portability information for API elements matching I. If I is surrounded by slashes, it is interpreted as a regular expression. =head1 DESCRIPTION In order for a Perl extension (XS) module to be as portable as possible across differing versions of Perl itself, certain steps need to be taken. =over 4 =item * Including this header is the first major one. This alone will give you access to a large part of the Perl API that hasn't been available in earlier Perl releases. Use perl ppport.h --list-provided to see which API elements are provided by ppport.h. =item * You should avoid using deprecated parts of the API. For example, using global Perl variables without the C prefix is deprecated. Also, some API functions used to have a C prefix. Using this form is also deprecated. You can safely use the supported API, as F will provide wrappers for older Perl versions. =item * If you use one of a few functions or variables that were not present in earlier versions of Perl, and that can't be provided using a macro, you have to explicitly request support for these functions by adding one or more C<#define>s in your source code before the inclusion of F. These functions or variables will be marked C in the list shown by C<--list-provided>. Depending on whether you module has a single or multiple files that use such functions or variables, you want either C or global variants. For a C function or variable (used only in a single source file), use: #define NEED_function #define NEED_variable For a global function or variable (used in multiple source files), use: #define NEED_function_GLOBAL #define NEED_variable_GLOBAL Note that you mustn't have more than one global request for the same function or variable in your project. Function / Variable Static Request Global Request ----------------------------------------------------------------------------------------- PL_parser NEED_PL_parser NEED_PL_parser_GLOBAL PL_signals NEED_PL_signals NEED_PL_signals_GLOBAL SvRX() NEED_SvRX NEED_SvRX_GLOBAL caller_cx() NEED_caller_cx NEED_caller_cx_GLOBAL croak_xs_usage() NEED_croak_xs_usage NEED_croak_xs_usage_GLOBAL die_sv() NEED_die_sv NEED_die_sv_GLOBAL eval_pv() NEED_eval_pv NEED_eval_pv_GLOBAL grok_bin() NEED_grok_bin NEED_grok_bin_GLOBAL grok_hex() NEED_grok_hex NEED_grok_hex_GLOBAL grok_number() NEED_grok_number NEED_grok_number_GLOBAL grok_numeric_radix() NEED_grok_numeric_radix NEED_grok_numeric_radix_GLOBAL grok_oct() NEED_grok_oct NEED_grok_oct_GLOBAL gv_fetchpvn_flags() NEED_gv_fetchpvn_flags NEED_gv_fetchpvn_flags_GLOBAL load_module() NEED_load_module NEED_load_module_GLOBAL mess() NEED_mess NEED_mess_GLOBAL mess_nocontext() NEED_mess_nocontext NEED_mess_nocontext_GLOBAL mess_sv() NEED_mess_sv NEED_mess_sv_GLOBAL mg_findext() NEED_mg_findext NEED_mg_findext_GLOBAL my_snprintf() NEED_my_snprintf NEED_my_snprintf_GLOBAL my_sprintf() NEED_my_sprintf NEED_my_sprintf_GLOBAL my_strlcat() NEED_my_strlcat NEED_my_strlcat_GLOBAL my_strlcpy() NEED_my_strlcpy NEED_my_strlcpy_GLOBAL newCONSTSUB() NEED_newCONSTSUB NEED_newCONSTSUB_GLOBAL newRV_noinc() NEED_newRV_noinc NEED_newRV_noinc_GLOBAL newSV_type() NEED_newSV_type NEED_newSV_type_GLOBAL newSVpvn_flags() NEED_newSVpvn_flags NEED_newSVpvn_flags_GLOBAL newSVpvn_share() NEED_newSVpvn_share NEED_newSVpvn_share_GLOBAL pv_display() NEED_pv_display NEED_pv_display_GLOBAL pv_escape() NEED_pv_escape NEED_pv_escape_GLOBAL pv_pretty() NEED_pv_pretty NEED_pv_pretty_GLOBAL sv_2pv_flags() NEED_sv_2pv_flags NEED_sv_2pv_flags_GLOBAL sv_2pvbyte() NEED_sv_2pvbyte NEED_sv_2pvbyte_GLOBAL sv_catpvf_mg() NEED_sv_catpvf_mg NEED_sv_catpvf_mg_GLOBAL sv_catpvf_mg_nocontext() NEED_sv_catpvf_mg_nocontext NEED_sv_catpvf_mg_nocontext_GLOBAL sv_pvn_force_flags() NEED_sv_pvn_force_flags NEED_sv_pvn_force_flags_GLOBAL sv_setpvf_mg() NEED_sv_setpvf_mg NEED_sv_setpvf_mg_GLOBAL sv_setpvf_mg_nocontext() NEED_sv_setpvf_mg_nocontext NEED_sv_setpvf_mg_nocontext_GLOBAL sv_unmagicext() NEED_sv_unmagicext NEED_sv_unmagicext_GLOBAL vload_module() NEED_vload_module NEED_vload_module_GLOBAL vmess() NEED_vmess NEED_vmess_GLOBAL vnewSVpvf() NEED_vnewSVpvf NEED_vnewSVpvf_GLOBAL warner() NEED_warner NEED_warner_GLOBAL To avoid namespace conflicts, you can change the namespace of the explicitly exported functions / variables using the C macro. Just C<#define> the macro before including C: #define DPPP_NAMESPACE MyOwnNamespace_ #include "ppport.h" The default namespace is C. =back The good thing is that most of the above can be checked by running F on your source code. See the next section for details. =head1 EXAMPLES To verify whether F is needed for your module, whether you should make any changes to your code, and whether any special defines should be used, F can be run as a Perl script to check your source code. Simply say: perl ppport.h The result will usually be a list of patches suggesting changes that should at least be acceptable, if not necessarily the most efficient solution, or a fix for all possible problems. If you know that your XS module uses features only available in newer Perl releases, if you're aware that it uses C++ comments, and if you want all suggestions as a single patch file, you could use something like this: perl ppport.h --compat-version=5.6.0 --cplusplus --patch=test.diff If you only want your code to be scanned without any suggestions for changes, use: perl ppport.h --nochanges You can specify a different C program or options, using the C<--diff> option: perl ppport.h --diff='diff -C 10' This would output context diffs with 10 lines of context. If you want to create patched copies of your files instead, use: perl ppport.h --copy=.new To display portability information for the C function, use: perl ppport.h --api-info=newSVpvn Since the argument to C<--api-info> can be a regular expression, you can use perl ppport.h --api-info=/_nomg$/ to display portability information for all C<_nomg> functions or perl ppport.h --api-info=/./ to display information for all known API elements. =head1 BUGS If this version of F is causing failure during the compilation of this module, please check if newer versions of either this module or C are available on CPAN before sending a bug report. If F was generated using the latest version of C and is causing failure of this module, please send a bug report to L. Please include the following information: =over 4 =item 1. The complete output from running "perl -V" =item 2. This file. =item 3. The name and version of the module you were trying to build. =item 4. A full log of the build that failed. =item 5. Any other information that you think could be relevant. =back For the latest version of this code, please get the C module from CPAN. =head1 COPYRIGHT Version 3.x, Copyright (c) 2004-2013, Marcus Holland-Moritz. Version 2.x, Copyright (C) 2001, Paul Marquess. Version 1.x, Copyright (C) 1999, Kenneth Albanowski. This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =head1 SEE ALSO See L. =cut use strict; # Disable broken TRIE-optimization BEGIN { eval '${^RE_TRIE_MAXBUF} = -1' if "$]" >= 5.009004 && "$]" <= 5.009005 } my $VERSION = 3.42; my %opt = ( quiet => 0, diag => 1, hints => 1, changes => 1, cplusplus => 0, filter => 1, strip => 0, version => 0, ); my($ppport) = $0 =~ /([\w.]+)$/; my $LF = '(?:\r\n|[\r\n])'; # line feed my $HS = "[ \t]"; # horizontal whitespace # Never use C comments in this file! my $ccs = '/'.'*'; my $cce = '*'.'/'; my $rccs = quotemeta $ccs; my $rcce = quotemeta $cce; eval { require Getopt::Long; Getopt::Long::GetOptions(\%opt, qw( help quiet diag! filter! hints! changes! cplusplus strip version patch=s copy=s diff=s compat-version=s list-provided list-unsupported api-info=s )) or usage(); }; if ($@ and grep /^-/, @ARGV) { usage() if "@ARGV" =~ /^--?h(?:elp)?$/; die "Getopt::Long not found. Please don't use any options.\n"; } if ($opt{version}) { print "This is $0 $VERSION.\n"; exit 0; } usage() if $opt{help}; strip() if $opt{strip}; if (exists $opt{'compat-version'}) { my($r,$v,$s) = eval { parse_version($opt{'compat-version'}) }; if ($@) { die "Invalid version number format: '$opt{'compat-version'}'\n"; } die "Only Perl 5 is supported\n" if $r != 5; die "Invalid version number: $opt{'compat-version'}\n" if $v >= 1000 || $s >= 1000; $opt{'compat-version'} = sprintf "%d.%03d%03d", $r, $v, $s; } else { $opt{'compat-version'} = 5; } my %API = map { /^(\w+)\|([^|]*)\|([^|]*)\|(\w*)$/ ? ( $1 => { ($2 ? ( base => $2 ) : ()), ($3 ? ( todo => $3 ) : ()), (index($4, 'v') >= 0 ? ( varargs => 1 ) : ()), (index($4, 'p') >= 0 ? ( provided => 1 ) : ()), (index($4, 'n') >= 0 ? ( nothxarg => 1 ) : ()), } ) : die "invalid spec: $_" } qw( AvFILLp|5.004050||p AvFILL||| BhkDISABLE||5.024000| BhkENABLE||5.024000| BhkENTRY_set||5.024000| BhkENTRY||| BhkFLAGS||| CALL_BLOCK_HOOKS||| CLASS|||n CPERLscope|5.005000||p CX_CURPAD_SAVE||| CX_CURPAD_SV||| C_ARRAY_END|5.013002||p C_ARRAY_LENGTH|5.008001||p CopFILEAV|5.006000||p CopFILEGV_set|5.006000||p CopFILEGV|5.006000||p CopFILESV|5.006000||p CopFILE_set|5.006000||p CopFILE|5.006000||p CopSTASHPV_set|5.006000||p CopSTASHPV|5.006000||p CopSTASH_eq|5.006000||p CopSTASH_set|5.006000||p CopSTASH|5.006000||p CopyD|5.009002|5.004050|p Copy||| CvPADLIST||5.008001| CvSTASH||| CvWEAKOUTSIDE||| DECLARATION_FOR_LC_NUMERIC_MANIPULATION||5.021010|n DEFSV_set|5.010001||p DEFSV|5.004050||p DO_UTF8||5.006000| END_EXTERN_C|5.005000||p ENTER||| ERRSV|5.004050||p EXTEND||| EXTERN_C|5.005000||p F0convert|||n FREETMPS||| GIMME_V||5.004000|n GIMME|||n GROK_NUMERIC_RADIX|5.007002||p G_ARRAY||| G_DISCARD||| G_EVAL||| G_METHOD|5.006001||p G_NOARGS||| G_SCALAR||| G_VOID||5.004000| GetVars||| GvAV||| GvCV||| GvHV||| GvSV||| Gv_AMupdate||5.011000| HEf_SVKEY|5.003070||p HeHASH||5.003070| HeKEY||5.003070| HeKLEN||5.003070| HePV||5.004000| HeSVKEY_force||5.003070| HeSVKEY_set||5.004000| HeSVKEY||5.003070| HeUTF8|5.010001|5.008000|p HeVAL||5.003070| HvENAMELEN||5.015004| HvENAMEUTF8||5.015004| HvENAME||5.013007| HvNAMELEN_get|5.009003||p HvNAMELEN||5.015004| HvNAMEUTF8||5.015004| HvNAME_get|5.009003||p HvNAME||| INT2PTR|5.006000||p IN_LOCALE_COMPILETIME|5.007002||p IN_LOCALE_RUNTIME|5.007002||p IN_LOCALE|5.007002||p IN_PERL_COMPILETIME|5.008001||p IS_NUMBER_GREATER_THAN_UV_MAX|5.007002||p IS_NUMBER_INFINITY|5.007002||p IS_NUMBER_IN_UV|5.007002||p IS_NUMBER_NAN|5.007003||p IS_NUMBER_NEG|5.007002||p IS_NUMBER_NOT_INT|5.007002||p IVSIZE|5.006000||p IVTYPE|5.006000||p IVdf|5.006000||p LEAVE||| LINKLIST||5.013006| LVRET||| MARK||| MULTICALL||5.024000| MUTABLE_PTR|5.010001||p MUTABLE_SV|5.010001||p MY_CXT_CLONE|5.009002||p MY_CXT_INIT|5.007003||p MY_CXT|5.007003||p MoveD|5.009002|5.004050|p Move||| NOOP|5.005000||p NUM2PTR|5.006000||p NVTYPE|5.006000||p NVef|5.006001||p NVff|5.006001||p NVgf|5.006001||p Newxc|5.009003||p Newxz|5.009003||p Newx|5.009003||p Nullav||| Nullch||| Nullcv||| Nullhv||| Nullsv||| OP_CLASS||5.013007| OP_DESC||5.007003| OP_NAME||5.007003| OP_TYPE_IS_OR_WAS||5.019010| OP_TYPE_IS||5.019007| ORIGMARK||| OpHAS_SIBLING|5.021007||p OpLASTSIB_set|5.021011||p OpMAYBESIB_set|5.021011||p OpMORESIB_set|5.021011||p OpSIBLING|5.021007||p PAD_BASE_SV||| PAD_CLONE_VARS||| PAD_COMPNAME_FLAGS||| PAD_COMPNAME_GEN_set||| PAD_COMPNAME_GEN||| PAD_COMPNAME_OURSTASH||| PAD_COMPNAME_PV||| PAD_COMPNAME_TYPE||| PAD_RESTORE_LOCAL||| PAD_SAVE_LOCAL||| PAD_SAVE_SETNULLPAD||| PAD_SETSV||| PAD_SET_CUR_NOSAVE||| PAD_SET_CUR||| PAD_SVl||| PAD_SV||| PERLIO_FUNCS_CAST|5.009003||p PERLIO_FUNCS_DECL|5.009003||p PERL_ABS|5.008001||p PERL_ARGS_ASSERT_CROAK_XS_USAGE|||p PERL_BCDVERSION|5.024000||p PERL_GCC_BRACE_GROUPS_FORBIDDEN|5.008001||p PERL_HASH|5.003070||p PERL_INT_MAX|5.003070||p PERL_INT_MIN|5.003070||p PERL_LONG_MAX|5.003070||p PERL_LONG_MIN|5.003070||p PERL_MAGIC_arylen|5.007002||p PERL_MAGIC_backref|5.007002||p PERL_MAGIC_bm|5.007002||p PERL_MAGIC_collxfrm|5.007002||p PERL_MAGIC_dbfile|5.007002||p PERL_MAGIC_dbline|5.007002||p PERL_MAGIC_defelem|5.007002||p PERL_MAGIC_envelem|5.007002||p PERL_MAGIC_env|5.007002||p PERL_MAGIC_ext|5.007002||p PERL_MAGIC_fm|5.007002||p PERL_MAGIC_glob|5.024000||p PERL_MAGIC_isaelem|5.007002||p PERL_MAGIC_isa|5.007002||p PERL_MAGIC_mutex|5.024000||p PERL_MAGIC_nkeys|5.007002||p PERL_MAGIC_overload_elem|5.024000||p PERL_MAGIC_overload_table|5.007002||p PERL_MAGIC_overload|5.024000||p PERL_MAGIC_pos|5.007002||p PERL_MAGIC_qr|5.007002||p PERL_MAGIC_regdata|5.007002||p PERL_MAGIC_regdatum|5.007002||p PERL_MAGIC_regex_global|5.007002||p PERL_MAGIC_shared_scalar|5.007003||p PERL_MAGIC_shared|5.007003||p PERL_MAGIC_sigelem|5.007002||p PERL_MAGIC_sig|5.007002||p PERL_MAGIC_substr|5.007002||p PERL_MAGIC_sv|5.007002||p PERL_MAGIC_taint|5.007002||p PERL_MAGIC_tiedelem|5.007002||p PERL_MAGIC_tiedscalar|5.007002||p PERL_MAGIC_tied|5.007002||p PERL_MAGIC_utf8|5.008001||p PERL_MAGIC_uvar_elem|5.007003||p PERL_MAGIC_uvar|5.007002||p PERL_MAGIC_vec|5.007002||p PERL_MAGIC_vstring|5.008001||p PERL_PV_ESCAPE_ALL|5.009004||p PERL_PV_ESCAPE_FIRSTCHAR|5.009004||p PERL_PV_ESCAPE_NOBACKSLASH|5.009004||p PERL_PV_ESCAPE_NOCLEAR|5.009004||p PERL_PV_ESCAPE_QUOTE|5.009004||p PERL_PV_ESCAPE_RE|5.009005||p PERL_PV_ESCAPE_UNI_DETECT|5.009004||p PERL_PV_ESCAPE_UNI|5.009004||p PERL_PV_PRETTY_DUMP|5.009004||p PERL_PV_PRETTY_ELLIPSES|5.010000||p PERL_PV_PRETTY_LTGT|5.009004||p PERL_PV_PRETTY_NOCLEAR|5.010000||p PERL_PV_PRETTY_QUOTE|5.009004||p PERL_PV_PRETTY_REGPROP|5.009004||p PERL_QUAD_MAX|5.003070||p PERL_QUAD_MIN|5.003070||p PERL_REVISION|5.006000||p PERL_SCAN_ALLOW_UNDERSCORES|5.007003||p PERL_SCAN_DISALLOW_PREFIX|5.007003||p PERL_SCAN_GREATER_THAN_UV_MAX|5.007003||p PERL_SCAN_SILENT_ILLDIGIT|5.008001||p PERL_SHORT_MAX|5.003070||p PERL_SHORT_MIN|5.003070||p PERL_SIGNALS_UNSAFE_FLAG|5.008001||p PERL_SUBVERSION|5.006000||p PERL_SYS_INIT3||5.006000| PERL_SYS_INIT||| PERL_SYS_TERM||5.024000| PERL_UCHAR_MAX|5.003070||p PERL_UCHAR_MIN|5.003070||p PERL_UINT_MAX|5.003070||p PERL_UINT_MIN|5.003070||p PERL_ULONG_MAX|5.003070||p PERL_ULONG_MIN|5.003070||p PERL_UNUSED_ARG|5.009003||p PERL_UNUSED_CONTEXT|5.009004||p PERL_UNUSED_DECL|5.007002||p PERL_UNUSED_RESULT|5.021001||p PERL_UNUSED_VAR|5.007002||p PERL_UQUAD_MAX|5.003070||p PERL_UQUAD_MIN|5.003070||p PERL_USE_GCC_BRACE_GROUPS|5.009004||p PERL_USHORT_MAX|5.003070||p PERL_USHORT_MIN|5.003070||p PERL_VERSION|5.006000||p PL_DBsignal|5.005000||p PL_DBsingle|||pn PL_DBsub|||pn PL_DBtrace|||pn PL_Sv|5.005000||p PL_bufend|5.024000||p PL_bufptr|5.024000||p PL_check||5.006000| PL_compiling|5.004050||p PL_comppad_name||5.017004| PL_comppad||5.008001| PL_copline|5.024000||p PL_curcop|5.004050||p PL_curpad||5.005000| PL_curstash|5.004050||p PL_debstash|5.004050||p PL_defgv|5.004050||p PL_diehook|5.004050||p PL_dirty|5.004050||p PL_dowarn|||pn PL_errgv|5.004050||p PL_error_count|5.024000||p PL_expect|5.024000||p PL_hexdigit|5.005000||p PL_hints|5.005000||p PL_in_my_stash|5.024000||p PL_in_my|5.024000||p PL_keyword_plugin||5.011002| PL_last_in_gv|||n PL_laststatval|5.005000||p PL_lex_state|5.024000||p PL_lex_stuff|5.024000||p PL_linestr|5.024000||p PL_modglobal||5.005000|n PL_na|5.004050||pn PL_no_modify|5.006000||p PL_ofsgv|||n PL_opfreehook||5.011000|n PL_parser|5.009005||p PL_peepp||5.007003|n PL_perl_destruct_level|5.004050||p PL_perldb|5.004050||p PL_ppaddr|5.006000||p PL_rpeepp||5.013005|n PL_rsfp_filters|5.024000||p PL_rsfp|5.024000||p PL_rs|||n PL_signals|5.008001||p PL_stack_base|5.004050||p PL_stack_sp|5.004050||p PL_statcache|5.005000||p PL_stdingv|5.004050||p PL_sv_arenaroot|5.004050||p PL_sv_no|5.004050||pn PL_sv_undef|5.004050||pn PL_sv_yes|5.004050||pn PL_tainted|5.004050||p PL_tainting|5.004050||p PL_tokenbuf|5.024000||p POP_MULTICALL||5.024000| POPi|||n POPl|||n POPn|||n POPpbytex||5.007001|n POPpx||5.005030|n POPp|||n POPs|||n POPul||5.006000|n POPu||5.004000|n PTR2IV|5.006000||p PTR2NV|5.006000||p PTR2UV|5.006000||p PTR2nat|5.009003||p PTR2ul|5.007001||p PTRV|5.006000||p PUSHMARK||| PUSH_MULTICALL||5.024000| PUSHi||| PUSHmortal|5.009002||p PUSHn||| PUSHp||| PUSHs||| PUSHu|5.004000||p PUTBACK||| PadARRAY||5.024000| PadMAX||5.024000| PadlistARRAY||5.024000| PadlistMAX||5.024000| PadlistNAMESARRAY||5.024000| PadlistNAMESMAX||5.024000| PadlistNAMES||5.024000| PadlistREFCNT||5.017004| PadnameIsOUR||| PadnameIsSTATE||| PadnameLEN||5.024000| PadnameOURSTASH||| PadnameOUTER||| PadnamePV||5.024000| PadnameREFCNT_dec||5.024000| PadnameREFCNT||5.024000| PadnameSV||5.024000| PadnameTYPE||| PadnameUTF8||5.021007| PadnamelistARRAY||5.024000| PadnamelistMAX||5.024000| PadnamelistREFCNT_dec||5.024000| PadnamelistREFCNT||5.024000| PerlIO_clearerr||5.007003| PerlIO_close||5.007003| PerlIO_context_layers||5.009004| PerlIO_eof||5.007003| PerlIO_error||5.007003| PerlIO_fileno||5.007003| PerlIO_fill||5.007003| PerlIO_flush||5.007003| PerlIO_get_base||5.007003| PerlIO_get_bufsiz||5.007003| PerlIO_get_cnt||5.007003| PerlIO_get_ptr||5.007003| PerlIO_read||5.007003| PerlIO_restore_errno||| PerlIO_save_errno||| PerlIO_seek||5.007003| PerlIO_set_cnt||5.007003| PerlIO_set_ptrcnt||5.007003| PerlIO_setlinebuf||5.007003| PerlIO_stderr||5.007003| PerlIO_stdin||5.007003| PerlIO_stdout||5.007003| PerlIO_tell||5.007003| PerlIO_unread||5.007003| PerlIO_write||5.007003| PoisonFree|5.009004||p PoisonNew|5.009004||p PoisonWith|5.009004||p Poison|5.008000||p READ_XDIGIT||5.017006| RESTORE_LC_NUMERIC||5.024000| RETVAL|||n Renewc||| Renew||| SAVECLEARSV||| SAVECOMPPAD||| SAVEPADSV||| SAVETMPS||| SAVE_DEFSV|5.004050||p SPAGAIN||| SP||| START_EXTERN_C|5.005000||p START_MY_CXT|5.007003||p STMT_END|||p STMT_START|||p STORE_LC_NUMERIC_FORCE_TO_UNDERLYING||5.024000| STORE_LC_NUMERIC_SET_TO_NEEDED||5.024000| STR_WITH_LEN|5.009003||p ST||| SV_CONST_RETURN|5.009003||p SV_COW_DROP_PV|5.008001||p SV_COW_SHARED_HASH_KEYS|5.009005||p SV_GMAGIC|5.007002||p SV_HAS_TRAILING_NUL|5.009004||p SV_IMMEDIATE_UNREF|5.007001||p SV_MUTABLE_RETURN|5.009003||p SV_NOSTEAL|5.009002||p SV_SMAGIC|5.009003||p SV_UTF8_NO_ENCODING|5.008001||p SVfARG|5.009005||p SVf_UTF8|5.006000||p SVf|5.006000||p SVt_INVLIST||5.019002| SVt_IV||| SVt_NULL||| SVt_NV||| SVt_PVAV||| SVt_PVCV||| SVt_PVFM||| SVt_PVGV||| SVt_PVHV||| SVt_PVIO||| SVt_PVIV||| SVt_PVLV||| SVt_PVMG||| SVt_PVNV||| SVt_PV||| SVt_REGEXP||5.011000| Safefree||| Slab_Alloc||| Slab_Free||| Slab_to_ro||| Slab_to_rw||| StructCopy||| SvCUR_set||| SvCUR||| SvEND||| SvGAMAGIC||5.006001| SvGETMAGIC|5.004050||p SvGROW||| SvIOK_UV||5.006000| SvIOK_notUV||5.006000| SvIOK_off||| SvIOK_only_UV||5.006000| SvIOK_only||| SvIOK_on||| SvIOKp||| SvIOK||| SvIVX||| SvIV_nomg|5.009001||p SvIV_set||| SvIVx||| SvIV||| SvIsCOW_shared_hash||5.008003| SvIsCOW||5.008003| SvLEN_set||| SvLEN||| SvLOCK||5.007003| SvMAGIC_set|5.009003||p SvNIOK_off||| SvNIOKp||| SvNIOK||| SvNOK_off||| SvNOK_only||| SvNOK_on||| SvNOKp||| SvNOK||| SvNVX||| SvNV_nomg||5.013002| SvNV_set||| SvNVx||| SvNV||| SvOK||| SvOOK_offset||5.011000| SvOOK||| SvPOK_off||| SvPOK_only_UTF8||5.006000| SvPOK_only||| SvPOK_on||| SvPOKp||| SvPOK||| SvPVX_const|5.009003||p SvPVX_mutable|5.009003||p SvPVX||| SvPV_const|5.009003||p SvPV_flags_const_nolen|5.009003||p SvPV_flags_const|5.009003||p SvPV_flags_mutable|5.009003||p SvPV_flags|5.007002||p SvPV_force_flags_mutable|5.009003||p SvPV_force_flags_nolen|5.009003||p SvPV_force_flags|5.007002||p SvPV_force_mutable|5.009003||p SvPV_force_nolen|5.009003||p SvPV_force_nomg_nolen|5.009003||p SvPV_force_nomg|5.007002||p SvPV_force|||p SvPV_mutable|5.009003||p SvPV_nolen_const|5.009003||p SvPV_nolen|5.006000||p SvPV_nomg_const_nolen|5.009003||p SvPV_nomg_const|5.009003||p SvPV_nomg_nolen|5.013007||p SvPV_nomg|5.007002||p SvPV_renew|5.009003||p SvPV_set||| SvPVbyte_force||5.009002| SvPVbyte_nolen||5.006000| SvPVbytex_force||5.006000| SvPVbytex||5.006000| SvPVbyte|5.006000||p SvPVutf8_force||5.006000| SvPVutf8_nolen||5.006000| SvPVutf8x_force||5.006000| SvPVutf8x||5.006000| SvPVutf8||5.006000| SvPVx||| SvPV||| SvREFCNT_dec_NN||5.017007| SvREFCNT_dec||| SvREFCNT_inc_NN|5.009004||p SvREFCNT_inc_simple_NN|5.009004||p SvREFCNT_inc_simple_void_NN|5.009004||p SvREFCNT_inc_simple_void|5.009004||p SvREFCNT_inc_simple|5.009004||p SvREFCNT_inc_void_NN|5.009004||p SvREFCNT_inc_void|5.009004||p SvREFCNT_inc|||p SvREFCNT||| SvROK_off||| SvROK_on||| SvROK||| SvRV_set|5.009003||p SvRV||| SvRXOK|5.009005||p SvRX|5.009005||p SvSETMAGIC||| SvSHARED_HASH|5.009003||p SvSHARE||5.007003| SvSTASH_set|5.009003||p SvSTASH||| SvSetMagicSV_nosteal||5.004000| SvSetMagicSV||5.004000| SvSetSV_nosteal||5.004000| SvSetSV||| SvTAINTED_off||5.004000| SvTAINTED_on||5.004000| SvTAINTED||5.004000| SvTAINT||| SvTHINKFIRST||| SvTRUE_nomg||5.013006| SvTRUE||| SvTYPE||| SvUNLOCK||5.007003| SvUOK|5.007001|5.006000|p SvUPGRADE||| SvUTF8_off||5.006000| SvUTF8_on||5.006000| SvUTF8||5.006000| SvUVXx|5.004000||p SvUVX|5.004000||p SvUV_nomg|5.009001||p SvUV_set|5.009003||p SvUVx|5.004000||p SvUV|5.004000||p SvVOK||5.008001| SvVSTRING_mg|5.009004||p THIS|||n UNDERBAR|5.009002||p UTF8SKIP||5.006000| UTF8_MAXBYTES|5.009002||p UVCHR_SKIP||5.022000| UVSIZE|5.006000||p UVTYPE|5.006000||p UVXf|5.007001||p UVof|5.006000||p UVuf|5.006000||p UVxf|5.006000||p WARN_ALL|5.006000||p WARN_AMBIGUOUS|5.006000||p WARN_ASSERTIONS|5.024000||p WARN_BAREWORD|5.006000||p WARN_CLOSED|5.006000||p WARN_CLOSURE|5.006000||p WARN_DEBUGGING|5.006000||p WARN_DEPRECATED|5.006000||p WARN_DIGIT|5.006000||p WARN_EXEC|5.006000||p WARN_EXITING|5.006000||p WARN_GLOB|5.006000||p WARN_INPLACE|5.006000||p WARN_INTERNAL|5.006000||p WARN_IO|5.006000||p WARN_LAYER|5.008000||p WARN_MALLOC|5.006000||p WARN_MISC|5.006000||p WARN_NEWLINE|5.006000||p WARN_NUMERIC|5.006000||p WARN_ONCE|5.006000||p WARN_OVERFLOW|5.006000||p WARN_PACK|5.006000||p WARN_PARENTHESIS|5.006000||p WARN_PIPE|5.006000||p WARN_PORTABLE|5.006000||p WARN_PRECEDENCE|5.006000||p WARN_PRINTF|5.006000||p WARN_PROTOTYPE|5.006000||p WARN_QW|5.006000||p WARN_RECURSION|5.006000||p WARN_REDEFINE|5.006000||p WARN_REGEXP|5.006000||p WARN_RESERVED|5.006000||p WARN_SEMICOLON|5.006000||p WARN_SEVERE|5.006000||p WARN_SIGNAL|5.006000||p WARN_SUBSTR|5.006000||p WARN_SYNTAX|5.006000||p WARN_TAINT|5.006000||p WARN_THREADS|5.008000||p WARN_UNINITIALIZED|5.006000||p WARN_UNOPENED|5.006000||p WARN_UNPACK|5.006000||p WARN_UNTIE|5.006000||p WARN_UTF8|5.006000||p WARN_VOID|5.006000||p WIDEST_UTYPE|5.015004||p XCPT_CATCH|5.009002||p XCPT_RETHROW|5.009002||p XCPT_TRY_END|5.009002||p XCPT_TRY_START|5.009002||p XPUSHi||| XPUSHmortal|5.009002||p XPUSHn||| XPUSHp||| XPUSHs||| XPUSHu|5.004000||p XSPROTO|5.010000||p XSRETURN_EMPTY||| XSRETURN_IV||| XSRETURN_NO||| XSRETURN_NV||| XSRETURN_PV||| XSRETURN_UNDEF||| XSRETURN_UV|5.008001||p XSRETURN_YES||| XSRETURN|||p XST_mIV||| XST_mNO||| XST_mNV||| XST_mPV||| XST_mUNDEF||| XST_mUV|5.008001||p XST_mYES||| XS_APIVERSION_BOOTCHECK||5.024000| XS_EXTERNAL||5.024000| XS_INTERNAL||5.024000| XS_VERSION_BOOTCHECK||5.024000| XS_VERSION||| XSprePUSH|5.006000||p XS||| XopDISABLE||5.024000| XopENABLE||5.024000| XopENTRYCUSTOM||5.024000| XopENTRY_set||5.024000| XopENTRY||5.024000| XopFLAGS||5.013007| ZeroD|5.009002||p Zero||| _aMY_CXT|5.007003||p _core_swash_init||| _load_PL_utf8_foldclosures||| _pMY_CXT|5.007003||p _to_fold_latin1||| _to_upper_title_latin1||| _to_utf8_case||| aMY_CXT_|5.007003||p aMY_CXT|5.007003||p aTHXR_|5.024000||p aTHXR|5.024000||p aTHX_|5.006000||p aTHX|5.006000||p add_above_Latin1_folds||| add_data|||n add_multi_match||| add_utf16_textfilter||| adjust_size_and_find_bucket|||n advance_one_LB||| advance_one_SB||| advance_one_WB||| alloc_maybe_populate_EXACT||| allocmy||| amagic_call||| amagic_cmp_locale||| amagic_cmp||| amagic_deref_call||5.013007| amagic_i_ncmp||| amagic_is_enabled||| amagic_ncmp||| anonymise_cv_maybe||| any_dup||| ao||| apply_attrs_my||| apply_attrs||| apply||| assert_uft8_cache_coherent||| assignment_type||| atfork_lock||5.007003|n atfork_unlock||5.007003|n av_arylen_p||5.009003| av_clear||| av_delete||5.006000| av_exists||5.006000| av_extend_guts||| av_extend||| av_fetch||| av_fill||| av_iter_p||5.011000| av_len||| av_make||| av_pop||| av_push||| av_reify||| av_shift||| av_store||| av_tindex||5.017009| av_top_index||5.017009| av_undef||| av_unshift||| ax|||n backup_one_LB||| backup_one_SB||| backup_one_WB||| bad_type_gv||| bad_type_pv||| bind_match||| block_end||5.004000| block_gimme||5.004000| block_start||5.004000| blockhook_register||5.013003| boolSV|5.004000||p boot_core_PerlIO||| boot_core_UNIVERSAL||| boot_core_mro||| bytes_cmp_utf8||5.013007| cBOOL|5.013000||p call_argv|5.006000||p call_atexit||5.006000| call_list||5.004000| call_method|5.006000||p call_pv|5.006000||p call_sv|5.006000||p caller_cx|5.013005|5.006000|p calloc||5.007002|n cando||| cast_i32||5.006000|n cast_iv||5.006000|n cast_ulong||5.006000|n cast_uv||5.006000|n check_type_and_open||| check_uni||| checkcomma||| ckWARN|5.006000||p ck_entersub_args_core||| ck_entersub_args_list||5.013006| ck_entersub_args_proto_or_list||5.013006| ck_entersub_args_proto||5.013006| ck_warner_d||5.011001|v ck_warner||5.011001|v ckwarn_common||| ckwarn_d||5.009003| ckwarn||5.009003| clear_defarray||5.023008| clear_special_blocks||| clone_params_del|||n clone_params_new|||n closest_cop||| cntrl_to_mnemonic|||n compute_EXACTish|||n construct_ahocorasick_from_trie||| cop_free||| cop_hints_2hv||5.013007| cop_hints_fetch_pvn||5.013007| cop_hints_fetch_pvs||5.013007| cop_hints_fetch_pv||5.013007| cop_hints_fetch_sv||5.013007| cophh_2hv||5.013007| cophh_copy||5.013007| cophh_delete_pvn||5.013007| cophh_delete_pvs||5.013007| cophh_delete_pv||5.013007| cophh_delete_sv||5.013007| cophh_fetch_pvn||5.013007| cophh_fetch_pvs||5.013007| cophh_fetch_pv||5.013007| cophh_fetch_sv||5.013007| cophh_free||5.013007| cophh_new_empty||5.024000| cophh_store_pvn||5.013007| cophh_store_pvs||5.013007| cophh_store_pv||5.013007| cophh_store_sv||5.013007| core_prototype||| coresub_op||| cr_textfilter||| croak_memory_wrap|5.019003||pn croak_no_mem|||n croak_no_modify|5.013003||pn croak_nocontext|||pvn croak_popstack|||n croak_sv|5.013001||p croak_xs_usage|5.010001||pn croak|||v csighandler||5.009003|n current_re_engine||| curse||| custom_op_desc||5.007003| custom_op_get_field||| custom_op_name||5.007003| custom_op_register||5.013007| custom_op_xop||5.013007| cv_clone_into||| cv_clone||| cv_const_sv_or_av|||n cv_const_sv||5.003070|n cv_dump||| cv_forget_slab||| cv_get_call_checker||5.013006| cv_name||5.021005| cv_set_call_checker_flags||5.021004| cv_set_call_checker||5.013006| cv_undef_flags||| cv_undef||| cvgv_from_hek||| cvgv_set||| cvstash_set||| cx_dump||5.005000| cx_dup||| cxinc||| dAXMARK|5.009003||p dAX|5.007002||p dITEMS|5.007002||p dMARK||| dMULTICALL||5.009003| dMY_CXT_SV|5.007003||p dMY_CXT|5.007003||p dNOOP|5.006000||p dORIGMARK||| dSP||| dTHR|5.004050||p dTHXR|5.024000||p dTHXa|5.006000||p dTHXoa|5.006000||p dTHX|5.006000||p dUNDERBAR|5.009002||p dVAR|5.009003||p dXCPT|5.009002||p dXSARGS||| dXSI32||| dXSTARG|5.006000||p deb_curcv||| deb_nocontext|||vn deb_stack_all||| deb_stack_n||| debop||5.005000| debprofdump||5.005000| debprof||| debstackptrs||5.007003| debstack||5.007003| debug_start_match||| deb||5.007003|v defelem_target||| del_sv||| delimcpy||5.004000|n deprecate_commaless_var_list||| despatch_signals||5.007001| destroy_matcher||| die_nocontext|||vn die_sv|5.013001||p die_unwind||| die|||v dirp_dup||| div128||| djSP||| do_aexec5||| do_aexec||| do_aspawn||| do_binmode||5.004050| do_chomp||| do_close||| do_delete_local||| do_dump_pad||| do_eof||| do_exec3||| do_execfree||| do_exec||| do_gv_dump||5.006000| do_gvgv_dump||5.006000| do_hv_dump||5.006000| do_ipcctl||| do_ipcget||| do_join||| do_magic_dump||5.006000| do_msgrcv||| do_msgsnd||| do_ncmp||| do_oddball||| do_op_dump||5.006000| do_open9||5.006000| do_openn||5.007001| do_open||5.003070| do_pmop_dump||5.006000| do_print||| do_readline||| do_seek||| do_semop||| do_shmio||| do_smartmatch||| do_spawn_nowait||| do_spawn||| do_sprintf||| do_sv_dump||5.006000| do_sysseek||| do_tell||| do_trans_complex_utf8||| do_trans_complex||| do_trans_count_utf8||| do_trans_count||| do_trans_simple_utf8||| do_trans_simple||| do_trans||| do_vecget||| do_vecset||| do_vop||| docatch||| doeval_compile||| dofile||| dofindlabel||| doform||| doing_taint||5.008001|n dooneliner||| doopen_pm||| doparseform||| dopoptoeval||| dopoptogivenfor||| dopoptolabel||| dopoptoloop||| dopoptosub_at||| dopoptowhen||| doref||5.009003| dounwind||| dowantarray||| drand48_init_r|||n drand48_r|||n dtrace_probe_call||| dtrace_probe_load||| dtrace_probe_op||| dtrace_probe_phase||| dump_all_perl||| dump_all||5.006000| dump_c_backtrace||| dump_eval||5.006000| dump_exec_pos||| dump_form||5.006000| dump_indent||5.006000|v dump_mstats||| dump_packsubs_perl||| dump_packsubs||5.006000| dump_sub_perl||| dump_sub||5.006000| dump_sv_child||| dump_trie_interim_list||| dump_trie_interim_table||| dump_trie||| dump_vindent||5.006000| dumpuntil||| dup_attrlist||| edit_distance|||n eval_pv|5.006000||p eval_sv|5.006000||p exec_failed||| expect_number||| fbm_compile||5.005000| fbm_instr||5.005000| feature_is_enabled||| filter_add||| filter_del||| filter_gets||| filter_read||| finalize_optree||| finalize_op||| find_and_forget_pmops||| find_array_subscript||| find_beginning||| find_byclass||| find_default_stash||| find_hash_subscript||| find_in_my_stash||| find_lexical_cv||| find_runcv_where||| find_runcv||5.008001| find_rundefsv||5.013002| find_script||| first_symbol|||n fixup_errno_string||| foldEQ_latin1||5.013008|n foldEQ_locale||5.013002|n foldEQ_utf8||5.013002| foldEQ||5.013002|n fold_constants||| forbid_setid||| force_ident_maybe_lex||| force_ident||| force_list||| force_next||| force_strict_version||| force_version||| force_word||| forget_pmop||| form_nocontext|||vn form||5.004000|v fp_dup||| fprintf_nocontext|||vn free_c_backtrace||| free_global_struct||| free_tied_hv_pool||| free_tmps||| gen_constant_list||| get_ANYOF_cp_list_for_ssc||| get_and_check_backslash_N_name||| get_aux_mg||| get_av|5.006000||p get_c_backtrace_dump||| get_c_backtrace||| get_context||5.006000|n get_cvn_flags||| get_cvs|5.011000||p get_cv|5.006000||p get_db_sub||| get_debug_opts||| get_hash_seed||| get_hv|5.006000||p get_mstats||| get_no_modify||| get_num||| get_op_descs||5.005000| get_op_names||5.005000| get_opargs||| get_ppaddr||5.006000| get_sv|5.006000||p get_vtbl||5.005030| getcwd_sv||5.007002| getenv_len||| glob_2number||| glob_assign_glob||| gp_dup||| gp_free||| gp_ref||| grok_atoUV|||n grok_bin|5.007003||p grok_bslash_N||| grok_hex|5.007003||p grok_infnan||5.021004| grok_number_flags||5.021002| grok_number|5.007002||p grok_numeric_radix|5.007002||p grok_oct|5.007003||p group_end||| gv_AVadd||| gv_HVadd||| gv_IOadd||| gv_SVadd||| gv_add_by_type||5.011000| gv_autoload4||5.004000| gv_autoload_pvn||5.015004| gv_autoload_pv||5.015004| gv_autoload_sv||5.015004| gv_check||| gv_const_sv||5.009003| gv_dump||5.006000| gv_efullname3||5.003070| gv_efullname4||5.006001| gv_efullname||| gv_fetchfile_flags||5.009005| gv_fetchfile||| gv_fetchmeth_autoload||5.007003| gv_fetchmeth_internal||| gv_fetchmeth_pv_autoload||5.015004| gv_fetchmeth_pvn_autoload||5.015004| gv_fetchmeth_pvn||5.015004| gv_fetchmeth_pv||5.015004| gv_fetchmeth_sv_autoload||5.015004| gv_fetchmeth_sv||5.015004| gv_fetchmethod_autoload||5.004000| gv_fetchmethod||| gv_fetchmeth||| gv_fetchpvn_flags|5.009002||p gv_fetchpvs|5.009004||p gv_fetchpv||| gv_fetchsv||| gv_fullname3||5.003070| gv_fullname4||5.006001| gv_fullname||| gv_handler||5.007001| gv_init_pvn||| gv_init_pv||5.015004| gv_init_svtype||| gv_init_sv||5.015004| gv_init||| gv_is_in_main||| gv_magicalize_isa||| gv_magicalize||| gv_name_set||5.009004| gv_override||| gv_setref||| gv_stashpvn_internal||| gv_stashpvn|5.003070||p gv_stashpvs|5.009003||p gv_stashpv||| gv_stashsvpvn_cached||| gv_stashsv||| handle_named_backref||| handle_possible_posix||| handle_regex_sets||| he_dup||| hek_dup||| hfree_next_entry||| hsplit||| hv_assert||| hv_auxinit_internal|||n hv_auxinit||| hv_clear_placeholders||5.009001| hv_clear||| hv_common_key_len||5.010000| hv_common||5.010000| hv_copy_hints_hv||5.009004| hv_delayfree_ent||5.004000| hv_delete_ent||5.003070| hv_delete||| hv_eiter_p||5.009003| hv_eiter_set||5.009003| hv_ename_add||| hv_ename_delete||| hv_exists_ent||5.003070| hv_exists||| hv_fetch_ent||5.003070| hv_fetchs|5.009003||p hv_fetch||| hv_fill||5.013002| hv_free_ent_ret||| hv_free_entries||| hv_free_ent||5.004000| hv_iterinit||| hv_iterkeysv||5.003070| hv_iterkey||| hv_iternextsv||| hv_iternext||| hv_iterval||| hv_ksplit||5.003070| hv_magic_check|||n hv_magic||| hv_name_set||5.009003| hv_notallowed||| hv_placeholders_get||5.009003| hv_placeholders_p||| hv_placeholders_set||5.009003| hv_rand_set||5.018000| hv_riter_p||5.009003| hv_riter_set||5.009003| hv_scalar||5.009001| hv_store_ent||5.003070| hv_stores|5.009004||p hv_store||| hv_undef_flags||| hv_undef||| ibcmp_locale||5.004000| ibcmp_utf8||5.007003| ibcmp||| incline||| incpush_if_exists||| incpush_use_sep||| incpush||| ingroup||| init_argv_symbols||| init_constants||| init_dbargs||| init_debugger||| init_global_struct||| init_ids||| init_interp||| init_main_stash||| init_perllib||| init_postdump_symbols||| init_predump_symbols||| init_stacks||5.005000| init_tm||5.007002| inplace_aassign||| instr|||n intro_my||5.004000| intuit_method||| intuit_more||| invert||| invoke_exception_hook||| io_close||| isALNUMC|5.006000||p isALPHANUMERIC||5.017008| isALPHA||| isASCII|5.006000||p isBLANK|5.006001||p isCNTRL|5.006000||p isDIGIT||| isFOO_lc||| isFOO_utf8_lc||| isGCB|||n isGRAPH|5.006000||p isIDCONT||5.017008| isIDFIRST||| isLB||| isLOWER||| isOCTAL||5.013005| isPRINT|5.004000||p isPSXSPC|5.006001||p isPUNCT|5.006000||p isSB||| isSPACE||| isUPPER||| isUTF8_CHAR||5.021001| isWB||| isWORDCHAR||5.013006| isXDIGIT|5.006000||p is_an_int||| is_ascii_string||5.011000| is_handle_constructor|||n is_invariant_string||5.021007|n is_lvalue_sub||5.007001| is_safe_syscall||5.019004| is_ssc_worth_it|||n is_utf8_char_buf||5.015008|n is_utf8_common||| is_utf8_string_loclen||5.009003|n is_utf8_string_loc||5.008001|n is_utf8_string||5.006001|n isa_lookup||| isinfnansv||| isinfnan||5.021004|n items|||n ix|||n jmaybe||| join_exact||| keyword_plugin_standard||| keyword||| leave_scope||| lex_stuff_pvs||5.013005| listkids||| list||| load_module_nocontext|||vn load_module|5.006000||pv localize||| looks_like_bool||| looks_like_number||| lop||| mPUSHi|5.009002||p mPUSHn|5.009002||p mPUSHp|5.009002||p mPUSHs|5.010001||p mPUSHu|5.009002||p mXPUSHi|5.009002||p mXPUSHn|5.009002||p mXPUSHp|5.009002||p mXPUSHs|5.010001||p mXPUSHu|5.009002||p magic_clear_all_env||| magic_cleararylen_p||| magic_clearenv||| magic_clearhints||| magic_clearhint||| magic_clearisa||| magic_clearpack||| magic_clearsig||| magic_copycallchecker||| magic_dump||5.006000| magic_existspack||| magic_freearylen_p||| magic_freeovrld||| magic_getarylen||| magic_getdebugvar||| magic_getdefelem||| magic_getnkeys||| magic_getpack||| magic_getpos||| magic_getsig||| magic_getsubstr||| magic_gettaint||| magic_getuvar||| magic_getvec||| magic_get||| magic_killbackrefs||| magic_methcall1||| magic_methcall|||v magic_methpack||| magic_nextpack||| magic_regdata_cnt||| magic_regdatum_get||| magic_regdatum_set||| magic_scalarpack||| magic_set_all_env||| magic_setarylen||| magic_setcollxfrm||| magic_setdbline||| magic_setdebugvar||| magic_setdefelem||| magic_setenv||| magic_sethint||| magic_setisa||| magic_setlvref||| magic_setmglob||| magic_setnkeys||| magic_setpack||| magic_setpos||| magic_setregexp||| magic_setsig||| magic_setsubstr||| magic_settaint||| magic_setutf8||| magic_setuvar||| magic_setvec||| magic_set||| magic_sizepack||| magic_wipepack||| make_matcher||| make_trie||| malloc_good_size|||n malloced_size|||n malloc||5.007002|n markstack_grow||5.021001| matcher_matches_sv||| maybe_multimagic_gv||| mayberelocate||| measure_struct||| memEQs|5.009005||p memEQ|5.004000||p memNEs|5.009005||p memNE|5.004000||p mem_collxfrm||| mem_log_alloc|||n mem_log_common|||n mem_log_free|||n mem_log_realloc|||n mess_alloc||| mess_nocontext|||pvn mess_sv|5.013001||p mess|5.006000||pv mfree||5.007002|n mg_clear||| mg_copy||| mg_dup||| mg_find_mglob||| mg_findext|5.013008||pn mg_find|||n mg_free_type||5.013006| mg_free||| mg_get||| mg_localize||| mg_magical|||n mg_set||| mg_size||5.005000| mini_mktime||5.007002|n minus_v||| missingterm||| mode_from_discipline||| modkids||| more_bodies||| more_sv||| moreswitches||| move_proto_attr||| mro_clean_isarev||| mro_gather_and_rename||| mro_get_from_name||5.010001| mro_get_linear_isa_dfs||| mro_get_linear_isa||5.009005| mro_get_private_data||5.010001| mro_isa_changed_in||| mro_meta_dup||| mro_meta_init||| mro_method_changed_in||5.009005| mro_package_moved||| mro_register||5.010001| mro_set_mro||5.010001| mro_set_private_data||5.010001| mul128||| mulexp10|||n multideref_stringify||| my_atof2||5.007002| my_atof||5.006000| my_attrs||| my_bcopy||5.004050|n my_bytes_to_utf8|||n my_bzero|||n my_chsize||| my_clearenv||| my_cxt_index||| my_cxt_init||| my_dirfd||5.009005|n my_exit_jump||| my_exit||| my_failure_exit||5.004000| my_fflush_all||5.006000| my_fork||5.007003|n my_kid||| my_lstat_flags||| my_lstat||5.024000| my_memcmp|||n my_memset|||n my_pclose||5.003070| my_popen_list||5.007001| my_popen||5.003070| my_setenv||| my_snprintf|5.009004||pvn my_socketpair||5.007003|n my_sprintf|5.009003||pvn my_stat_flags||| my_stat||5.024000| my_strftime||5.007002| my_strlcat|5.009004||pn my_strlcpy|5.009004||pn my_unexec||| my_vsnprintf||5.009004|n need_utf8|||n newANONATTRSUB||5.006000| newANONHASH||| newANONLIST||| newANONSUB||| newASSIGNOP||| newATTRSUB_x||| newATTRSUB||5.006000| newAVREF||| newAV||| newBINOP||| newCONDOP||| newCONSTSUB_flags||5.015006| newCONSTSUB|5.004050||p newCVREF||| newDEFSVOP||5.021006| newFORM||| newFOROP||5.013007| newGIVENOP||5.009003| newGIVWHENOP||| newGVOP||| newGVREF||| newGVgen_flags||5.015004| newGVgen||| newHVREF||| newHVhv||5.005000| newHV||| newIO||| newLISTOP||| newLOGOP||| newLOOPEX||| newLOOPOP||| newMETHOP_internal||| newMETHOP_named||5.021005| newMETHOP||5.021005| newMYSUB||5.017004| newNULLLIST||| newOP||| newPADOP||| newPMOP||| newPROG||| newPVOP||| newRANGE||| newRV_inc|5.004000||p newRV_noinc|5.004000||p newRV||| newSLICEOP||| newSTATEOP||| newSTUB||| newSUB||| newSVOP||| newSVREF||| newSV_type|5.009005||p newSVavdefelem||| newSVhek||5.009003| newSViv||| newSVnv||| newSVpadname||5.017004| newSVpv_share||5.013006| newSVpvf_nocontext|||vn newSVpvf||5.004000|v newSVpvn_flags|5.010001||p newSVpvn_share|5.007001||p newSVpvn_utf8|5.010001||p newSVpvn|5.004050||p newSVpvs_flags|5.010001||p newSVpvs_share|5.009003||p newSVpvs|5.009003||p newSVpv||| newSVrv||| newSVsv||| newSVuv|5.006000||p newSV||| newUNOP_AUX||5.021007| newUNOP||| newWHENOP||5.009003| newWHILEOP||5.013007| newXS_deffile||| newXS_len_flags||| newXSproto||5.006000| newXS||5.006000| new_constant||| new_he||| new_logop||| new_stackinfo||5.005000| new_version||5.009000| next_symbol||| nextargv||| nextchar||| ninstr|||n no_bareword_allowed||| no_fh_allowed||| no_op||| noperl_die|||vn not_a_number||| not_incrementable||| nothreadhook||5.008000| nuke_stacks||| num_overflow|||n oopsAV||| oopsHV||| op_append_elem||5.013006| op_append_list||5.013006| op_clear||| op_contextualize||5.013006| op_convert_list||5.021006| op_dump||5.006000| op_free||| op_integerize||| op_linklist||5.013006| op_lvalue_flags||| op_null||5.007002| op_parent|||n op_prepend_elem||5.013006| op_refcnt_lock||5.009002| op_refcnt_unlock||5.009002| op_relocate_sv||| op_sibling_splice||5.021002|n op_std_init||| open_script||| openn_cleanup||| openn_setup||| opmethod_stash||| opslab_force_free||| opslab_free_nopad||| opslab_free||| output_or_return_posix_warnings||| pMY_CXT_|5.007003||p pMY_CXT|5.007003||p pTHX_|5.006000||p pTHX|5.006000||p packWARN|5.007003||p pack_cat||5.007003| pack_rec||| package_version||| package||| packlist||5.008001| pad_add_anon||5.008001| pad_add_name_pvn||5.015001| pad_add_name_pvs||5.015001| pad_add_name_pv||5.015001| pad_add_name_sv||5.015001| pad_add_weakref||| pad_alloc_name||| pad_block_start||| pad_check_dup||| pad_compname_type||5.009003| pad_findlex||| pad_findmy_pvn||5.015001| pad_findmy_pvs||5.015001| pad_findmy_pv||5.015001| pad_findmy_sv||5.015001| pad_fixup_inner_anons||| pad_free||| pad_leavemy||| pad_new||5.008001| pad_push||| pad_reset||| pad_setsv||| pad_sv||| pad_swipe||| padlist_dup||| padlist_store||| padname_dup||| padname_free||| padnamelist_dup||| padnamelist_free||| parse_body||| parse_gv_stash_name||| parse_ident||| parse_lparen_question_flags||| parse_subsignature||| parse_unicode_opts||| parser_dup||| parser_free_nexttoke_ops||| parser_free||| path_is_searchable|||n peep||| pending_ident||| perl_alloc_using|||n perl_alloc|||n perl_clone_using|||n perl_clone|||n perl_construct|||n perl_destruct||5.007003|n perl_free|||n perl_parse||5.006000|n perl_run|||n pidgone||| pm_description||| pmop_dump||5.006000| pmruntime||| pmtrans||| pop_scope||| populate_ANYOF_from_invlist||| populate_isa|||v pregcomp||5.009005| pregexec||| pregfree2||5.011000| pregfree||| prescan_version||5.011004| printbuf||| printf_nocontext|||vn process_special_blocks||| ptr_hash|||n ptr_table_fetch||5.009005| ptr_table_find|||n ptr_table_free||5.009005| ptr_table_new||5.009005| ptr_table_split||5.009005| ptr_table_store||5.009005| push_scope||| put_charclass_bitmap_innards_common||| put_charclass_bitmap_innards_invlist||| put_charclass_bitmap_innards||| put_code_point||| put_range||| pv_display|5.006000||p pv_escape|5.009004||p pv_pretty|5.009004||p pv_uni_display||5.007003| qerror||| qsortsvu||| quadmath_format_needed|||n quadmath_format_single|||n re_compile||5.009005| re_croak2||| re_dup_guts||| re_exec_indentf|||v re_indentf|||v re_intuit_start||5.019001| re_intuit_string||5.006000| re_op_compile||| re_printf|||v realloc||5.007002|n reentrant_free||5.024000| reentrant_init||5.024000| reentrant_retry||5.024000|vn reentrant_size||5.024000| ref_array_or_hash||| refcounted_he_chain_2hv||| refcounted_he_fetch_pvn||| refcounted_he_fetch_pvs||| refcounted_he_fetch_pv||| refcounted_he_fetch_sv||| refcounted_he_free||| refcounted_he_inc||| refcounted_he_new_pvn||| refcounted_he_new_pvs||| refcounted_he_new_pv||| refcounted_he_new_sv||| refcounted_he_value||| refkids||| refto||| ref||5.024000| reg2Lanode||| reg_check_named_buff_matched|||n reg_named_buff_all||5.009005| reg_named_buff_exists||5.009005| reg_named_buff_fetch||5.009005| reg_named_buff_firstkey||5.009005| reg_named_buff_iter||| reg_named_buff_nextkey||5.009005| reg_named_buff_scalar||5.009005| reg_named_buff||| reg_node||| reg_numbered_buff_fetch||| reg_numbered_buff_length||| reg_numbered_buff_store||| reg_qr_package||| reg_recode||| reg_scan_name||| reg_skipcomment|||n reg_temp_copy||| reganode||| regatom||| regbranch||| regclass||| regcppop||| regcppush||| regcurly|||n regdump_extflags||| regdump_intflags||| regdump||5.005000| regdupe_internal||| regex_set_precedence|||n regexec_flags||5.005000| regfree_internal||5.009005| reghop3|||n reghop4|||n reghopmaybe3|||n reginclass||| reginitcolors||5.006000| reginsert||| regmatch||| regnext||5.005000| regnode_guts||| regpiece||| regprop||| regrepeat||| regtail_study||| regtail||| regtry||| reg||| repeatcpy|||n report_evil_fh||| report_redefined_cv||| report_uninit||| report_wrongway_fh||| require_pv||5.006000| require_tie_mod||| restore_magic||| rninstr|||n rpeep||| rsignal_restore||| rsignal_save||| rsignal_state||5.004000| rsignal||5.004000| run_body||| run_user_filter||| runops_debug||5.005000| runops_standard||5.005000| rv2cv_op_cv||5.013006| rvpv_dup||| rxres_free||| rxres_restore||| rxres_save||| safesyscalloc||5.006000|n safesysfree||5.006000|n safesysmalloc||5.006000|n safesysrealloc||5.006000|n same_dirent||| save_I16||5.004000| save_I32||| save_I8||5.006000| save_adelete||5.011000| save_aelem_flags||5.011000| save_aelem||5.004050| save_alloc||5.006000| save_aptr||| save_ary||| save_bool||5.008001| save_clearsv||| save_delete||| save_destructor_x||5.006000| save_destructor||5.006000| save_freeop||| save_freepv||| save_freesv||| save_generic_pvref||5.006001| save_generic_svref||5.005030| save_gp||5.004000| save_hash||| save_hdelete||5.011000| save_hek_flags|||n save_helem_flags||5.011000| save_helem||5.004050| save_hints||5.010001| save_hptr||| save_int||| save_item||| save_iv||5.005000| save_lines||| save_list||| save_long||| save_magic_flags||| save_mortalizesv||5.007001| save_nogv||| save_op||5.005000| save_padsv_and_mortalize||5.010001| save_pptr||| save_pushi32ptr||5.010001| save_pushptri32ptr||| save_pushptrptr||5.010001| save_pushptr||5.010001| save_re_context||5.006000| save_scalar_at||| save_scalar||| save_set_svflags||5.009000| save_shared_pvref||5.007003| save_sptr||| save_strlen||| save_svref||| save_vptr||5.006000| savepvn||| savepvs||5.009003| savepv||| savesharedpvn||5.009005| savesharedpvs||5.013006| savesharedpv||5.007003| savesharedsvpv||5.013006| savestack_grow_cnt||5.008001| savestack_grow||| savesvpv||5.009002| sawparens||| scalar_mod_type|||n scalarboolean||| scalarkids||| scalarseq||| scalarvoid||| scalar||| scan_bin||5.006000| scan_commit||| scan_const||| scan_formline||| scan_heredoc||| scan_hex||| scan_ident||| scan_inputsymbol||| scan_num||5.007001| scan_oct||| scan_pat||| scan_str||| scan_subst||| scan_trans||| scan_version||5.009001| scan_vstring||5.009005| scan_word||| search_const||| seed||5.008001| sequence_num||| set_ANYOF_arg||| set_caret_X||| set_context||5.006000|n set_numeric_local||5.006000| set_numeric_radix||5.006000| set_numeric_standard||5.006000| set_padlist|||n setdefout||| share_hek_flags||| share_hek||5.004000| should_warn_nl|||n si_dup||| sighandler|||n simplify_sort||| skip_to_be_ignored_text||| skipspace_flags||| softref2xv||| sortcv_stacked||| sortcv_xsub||| sortcv||| sortsv_flags||5.009003| sortsv||5.007003| space_join_names_mortal||| ss_dup||| ssc_add_range||| ssc_and||| ssc_anything||| ssc_clear_locale|||n ssc_cp_and||| ssc_finalize||| ssc_init||| ssc_intersection||| ssc_is_anything|||n ssc_is_cp_posixl_init|||n ssc_or||| ssc_union||| stack_grow||| start_subparse||5.004000| stdize_locale||| strEQ||| strGE||| strGT||| strLE||| strLT||| strNE||| str_to_version||5.006000| strip_return||| strnEQ||| strnNE||| study_chunk||| sub_crush_depth||| sublex_done||| sublex_push||| sublex_start||| sv_2bool_flags||5.013006| sv_2bool||| sv_2cv||| sv_2io||| sv_2iuv_common||| sv_2iuv_non_preserve||| sv_2iv_flags||5.009001| sv_2iv||| sv_2mortal||| sv_2nv_flags||5.013001| sv_2pv_flags|5.007002||p sv_2pv_nolen|5.006000||p sv_2pvbyte_nolen|5.006000||p sv_2pvbyte|5.006000||p sv_2pvutf8_nolen||5.006000| sv_2pvutf8||5.006000| sv_2pv||| sv_2uv_flags||5.009001| sv_2uv|5.004000||p sv_add_arena||| sv_add_backref||| sv_backoff|||n sv_bless||| sv_buf_to_ro||| sv_buf_to_rw||| sv_cat_decode||5.008001| sv_catpv_flags||5.013006| sv_catpv_mg|5.004050||p sv_catpv_nomg||5.013006| sv_catpvf_mg_nocontext|||pvn sv_catpvf_mg|5.006000|5.004000|pv sv_catpvf_nocontext|||vn sv_catpvf||5.004000|v sv_catpvn_flags||5.007002| sv_catpvn_mg|5.004050||p sv_catpvn_nomg|5.007002||p sv_catpvn||| sv_catpvs_flags||5.013006| sv_catpvs_mg||5.013006| sv_catpvs_nomg||5.013006| sv_catpvs|5.009003||p sv_catpv||| sv_catsv_flags||5.007002| sv_catsv_mg|5.004050||p sv_catsv_nomg|5.007002||p sv_catsv||| sv_chop||| sv_clean_all||| sv_clean_objs||| sv_clear||| sv_cmp_flags||5.013006| sv_cmp_locale_flags||5.013006| sv_cmp_locale||5.004000| sv_cmp||| sv_collxfrm_flags||5.013006| sv_collxfrm||| sv_copypv_flags||5.017002| sv_copypv_nomg||5.017002| sv_copypv||| sv_dec_nomg||5.013002| sv_dec||| sv_del_backref||| sv_derived_from_pvn||5.015004| sv_derived_from_pv||5.015004| sv_derived_from_sv||5.015004| sv_derived_from||5.004000| sv_destroyable||5.010000| sv_display||| sv_does_pvn||5.015004| sv_does_pv||5.015004| sv_does_sv||5.015004| sv_does||5.009004| sv_dump||| sv_dup_common||| sv_dup_inc_multiple||| sv_dup_inc||| sv_dup||| sv_eq_flags||5.013006| sv_eq||| sv_exp_grow||| sv_force_normal_flags||5.007001| sv_force_normal||5.006000| sv_free_arenas||| sv_free||| sv_gets||5.003070| sv_grow||| sv_i_ncmp||| sv_inc_nomg||5.013002| sv_inc||| sv_insert_flags||5.010001| sv_insert||| sv_isa||| sv_isobject||| sv_iv||5.005000| sv_len_utf8_nomg||| sv_len_utf8||5.006000| sv_len||| sv_magic_portable|5.024000|5.004000|p sv_magicext_mglob||| sv_magicext||5.007003| sv_magic||| sv_mortalcopy_flags||| sv_mortalcopy||| sv_ncmp||| sv_newmortal||| sv_newref||| sv_nolocking||5.007003| sv_nosharing||5.007003| sv_nounlocking||| sv_nv||5.005000| sv_only_taint_gmagic|||n sv_or_pv_pos_u2b||| sv_peek||5.005000| sv_pos_b2u_flags||5.019003| sv_pos_b2u_midway||| sv_pos_b2u||5.006000| sv_pos_u2b_cached||| sv_pos_u2b_flags||5.011005| sv_pos_u2b_forwards|||n sv_pos_u2b_midway|||n sv_pos_u2b||5.006000| sv_pvbyten_force||5.006000| sv_pvbyten||5.006000| sv_pvbyte||5.006000| sv_pvn_force_flags|5.007002||p sv_pvn_force||| sv_pvn_nomg|5.007003|5.005000|p sv_pvn||5.005000| sv_pvutf8n_force||5.006000| sv_pvutf8n||5.006000| sv_pvutf8||5.006000| sv_pv||5.006000| sv_recode_to_utf8||5.007003| sv_reftype||| sv_ref||5.015004| sv_replace||| sv_report_used||| sv_resetpvn||| sv_reset||| sv_rvweaken||5.006000| sv_sethek||| sv_setiv_mg|5.004050||p sv_setiv||| sv_setnv_mg|5.006000||p sv_setnv||| sv_setpv_mg|5.004050||p sv_setpvf_mg_nocontext|||pvn sv_setpvf_mg|5.006000|5.004000|pv sv_setpvf_nocontext|||vn sv_setpvf||5.004000|v sv_setpviv_mg||5.008001| sv_setpviv||5.008001| sv_setpvn_mg|5.004050||p sv_setpvn||| sv_setpvs_mg||5.013006| sv_setpvs|5.009004||p sv_setpv||| sv_setref_iv||| sv_setref_nv||| sv_setref_pvn||| sv_setref_pvs||5.024000| sv_setref_pv||| sv_setref_uv||5.007001| sv_setsv_flags||5.007002| sv_setsv_mg|5.004050||p sv_setsv_nomg|5.007002||p sv_setsv||| sv_setuv_mg|5.004050||p sv_setuv|5.004000||p sv_tainted||5.004000| sv_taint||5.004000| sv_true||5.005000| sv_unglob||| sv_uni_display||5.007003| sv_unmagicext|5.013008||p sv_unmagic||| sv_unref_flags||5.007001| sv_unref||| sv_untaint||5.004000| sv_upgrade||| sv_usepvn_flags||5.009004| sv_usepvn_mg|5.004050||p sv_usepvn||| sv_utf8_encode||5.006000| sv_utf8_upgrade_flags_grow||5.011000| sv_utf8_upgrade_flags||5.007002| sv_utf8_upgrade_nomg||5.007002| sv_utf8_upgrade||5.007001| sv_uv|5.005000||p sv_vcatpvf_mg|5.006000|5.004000|p sv_vcatpvfn_flags||5.017002| sv_vcatpvfn||5.004000| sv_vcatpvf|5.006000|5.004000|p sv_vsetpvf_mg|5.006000|5.004000|p sv_vsetpvfn||5.004000| sv_vsetpvf|5.006000|5.004000|p svtype||| swallow_bom||| swatch_get||| sync_locale||5.021004| sys_init3||5.010000|n sys_init||5.010000|n sys_intern_clear||| sys_intern_dup||| sys_intern_init||| sys_term||5.010000|n taint_env||| taint_proper||| tied_method|||v tmps_grow_p||| toFOLD_utf8||5.019001| toFOLD_uvchr||5.023009| toFOLD||5.019001| toLOWER_L1||5.019001| toLOWER_LC||5.004000| toLOWER_utf8||5.015007| toLOWER_uvchr||5.023009| toLOWER||| toTITLE_utf8||5.015007| toTITLE_uvchr||5.023009| toTITLE||5.019001| toUPPER_utf8||5.015007| toUPPER_uvchr||5.023009| toUPPER||| to_byte_substr||| to_lower_latin1|||n to_utf8_fold||5.015007| to_utf8_lower||5.015007| to_utf8_substr||| to_utf8_title||5.015007| to_utf8_upper||5.015007| tokenize_use||| tokeq||| tokereport||| too_few_arguments_pv||| too_many_arguments_pv||| translate_substr_offsets|||n try_amagic_bin||| try_amagic_un||| uiv_2buf|||n unlnk||| unpack_rec||| unpack_str||5.007003| unpackstring||5.008001| unreferenced_to_tmp_stack||| unshare_hek_or_pvn||| unshare_hek||| unsharepvn||5.003070| unwind_handler_stack||| update_debugger_info||| upg_version||5.009005| usage||| utf16_textfilter||| utf16_to_utf8_reversed||5.006001| utf16_to_utf8||5.006001| utf8_distance||5.006000| utf8_hop||5.006000|n utf8_length||5.007001| utf8_mg_len_cache_update||| utf8_mg_pos_cache_update||| utf8_to_uvchr_buf||5.015009| utf8n_to_uvchr||5.007001| utf8n_to_uvuni||5.007001| utilize||| uvchr_to_utf8_flags||5.007003| uvchr_to_utf8||5.007001| uvoffuni_to_utf8_flags||5.019004| uvuni_to_utf8_flags||5.007003| uvuni_to_utf8||5.007001| validate_suid||| varname||| vcmp||5.009000| vcroak||5.006000| vdeb||5.007003| vform||5.006000| visit||| vivify_defelem||| vivify_ref||| vload_module|5.006000||p vmess|5.006000|5.006000|p vnewSVpvf|5.006000|5.004000|p vnormal||5.009002| vnumify||5.009000| vstringify||5.009000| vverify||5.009003| vwarner||5.006000| vwarn||5.006000| wait4pid||| warn_nocontext|||pvn warn_sv|5.013001||p warner_nocontext|||vn warner|5.006000|5.004000|pv warn|||v was_lvalue_sub||| watch||| whichsig_pvn||5.015004| whichsig_pv||5.015004| whichsig_sv||5.015004| whichsig||| win32_croak_not_implemented|||n with_queued_errors||| wrap_op_checker||5.015008| write_to_stderr||| xs_boot_epilog||| xs_handshake|||vn xs_version_bootcheck||| yyerror_pvn||| yyerror_pv||| yyerror||| yylex||| yyparse||| yyunlex||| yywarn||| ); if (exists $opt{'list-unsupported'}) { my $f; for $f (sort { lc $a cmp lc $b } keys %API) { next unless $API{$f}{todo}; print "$f ", '.'x(40-length($f)), " ", format_version($API{$f}{todo}), "\n"; } exit 0; } # Scan for possible replacement candidates my(%replace, %need, %hints, %warnings, %depends); my $replace = 0; my($hint, $define, $function); sub find_api { my $code = shift; $code =~ s{ / (?: \*[^*]*\*+(?:[^$ccs][^*]*\*+)* / | /[^\r\n]*) | "[^"\\]*(?:\\.[^"\\]*)*" | '[^'\\]*(?:\\.[^'\\]*)*' }{}egsx; grep { exists $API{$_} } $code =~ /(\w+)/mg; } while () { if ($hint) { my $h = $hint->[0] eq 'Hint' ? \%hints : \%warnings; if (m{^\s*\*\s(.*?)\s*$}) { for (@{$hint->[1]}) { $h->{$_} ||= ''; # suppress warning with older perls $h->{$_} .= "$1\n"; } } else { undef $hint } } $hint = [$1, [split /,?\s+/, $2]] if m{^\s*$rccs\s+(Hint|Warning):\s+(\w+(?:,?\s+\w+)*)\s*$}; if ($define) { if ($define->[1] =~ /\\$/) { $define->[1] .= $_; } else { if (exists $API{$define->[0]} && $define->[1] !~ /^DPPP_\(/) { my @n = find_api($define->[1]); push @{$depends{$define->[0]}}, @n if @n } undef $define; } } $define = [$1, $2] if m{^\s*#\s*define\s+(\w+)(?:\([^)]*\))?\s+(.*)}; if ($function) { if (/^}/) { if (exists $API{$function->[0]}) { my @n = find_api($function->[1]); push @{$depends{$function->[0]}}, @n if @n } undef $function; } else { $function->[1] .= $_; } } $function = [$1, ''] if m{^DPPP_\(my_(\w+)\)}; $replace = $1 if m{^\s*$rccs\s+Replace:\s+(\d+)\s+$rcce\s*$}; $replace{$2} = $1 if $replace and m{^\s*#\s*define\s+(\w+)(?:\([^)]*\))?\s+(\w+)}; $replace{$2} = $1 if m{^\s*#\s*define\s+(\w+)(?:\([^)]*\))?\s+(\w+).*$rccs\s+Replace\s+$rcce}; $replace{$1} = $2 if m{^\s*$rccs\s+Replace (\w+) with (\w+)\s+$rcce\s*$}; if (m{^\s*$rccs\s+(\w+(\s*,\s*\w+)*)\s+depends\s+on\s+(\w+(\s*,\s*\w+)*)\s+$rcce\s*$}) { my @deps = map { s/\s+//g; $_ } split /,/, $3; my $d; for $d (map { s/\s+//g; $_ } split /,/, $1) { push @{$depends{$d}}, @deps; } } $need{$1} = 1 if m{^#if\s+defined\(NEED_(\w+)(?:_GLOBAL)?\)}; } for (values %depends) { my %s; $_ = [sort grep !$s{$_}++, @$_]; } if (exists $opt{'api-info'}) { my $f; my $count = 0; my $match = $opt{'api-info'} =~ m!^/(.*)/$! ? $1 : "^\Q$opt{'api-info'}\E\$"; for $f (sort { lc $a cmp lc $b } keys %API) { next unless $f =~ /$match/; print "\n=== $f ===\n\n"; my $info = 0; if ($API{$f}{base} || $API{$f}{todo}) { my $base = format_version($API{$f}{base} || $API{$f}{todo}); print "Supported at least starting from perl-$base.\n"; $info++; } if ($API{$f}{provided}) { my $todo = $API{$f}{todo} ? format_version($API{$f}{todo}) : "5.003"; print "Support by $ppport provided back to perl-$todo.\n"; print "Support needs to be explicitly requested by NEED_$f.\n" if exists $need{$f}; print "Depends on: ", join(', ', @{$depends{$f}}), ".\n" if exists $depends{$f}; print "\n$hints{$f}" if exists $hints{$f}; print "\nWARNING:\n$warnings{$f}" if exists $warnings{$f}; $info++; } print "No portability information available.\n" unless $info; $count++; } $count or print "Found no API matching '$opt{'api-info'}'."; print "\n"; exit 0; } if (exists $opt{'list-provided'}) { my $f; for $f (sort { lc $a cmp lc $b } keys %API) { next unless $API{$f}{provided}; my @flags; push @flags, 'explicit' if exists $need{$f}; push @flags, 'depend' if exists $depends{$f}; push @flags, 'hint' if exists $hints{$f}; push @flags, 'warning' if exists $warnings{$f}; my $flags = @flags ? ' ['.join(', ', @flags).']' : ''; print "$f$flags\n"; } exit 0; } my @files; my @srcext = qw( .xs .c .h .cc .cpp -c.inc -xs.inc ); my $srcext = join '|', map { quotemeta $_ } @srcext; if (@ARGV) { my %seen; for (@ARGV) { if (-e) { if (-f) { push @files, $_ unless $seen{$_}++; } else { warn "'$_' is not a file.\n" } } else { my @new = grep { -f } glob $_ or warn "'$_' does not exist.\n"; push @files, grep { !$seen{$_}++ } @new; } } } else { eval { require File::Find; File::Find::find(sub { $File::Find::name =~ /($srcext)$/i and push @files, $File::Find::name; }, '.'); }; if ($@) { @files = map { glob "*$_" } @srcext; } } if (!@ARGV || $opt{filter}) { my(@in, @out); my %xsc = map { /(.*)\.xs$/ ? ("$1.c" => 1, "$1.cc" => 1) : () } @files; for (@files) { my $out = exists $xsc{$_} || /\b\Q$ppport\E$/i || !/($srcext)$/i; push @{ $out ? \@out : \@in }, $_; } if (@ARGV && @out) { warning("Skipping the following files (use --nofilter to avoid this):\n| ", join "\n| ", @out); } @files = @in; } die "No input files given!\n" unless @files; my(%files, %global, %revreplace); %revreplace = reverse %replace; my $filename; my $patch_opened = 0; for $filename (@files) { unless (open IN, "<$filename") { warn "Unable to read from $filename: $!\n"; next; } info("Scanning $filename ..."); my $c = do { local $/; }; close IN; my %file = (orig => $c, changes => 0); # Temporarily remove C/XS comments and strings from the code my @ccom; $c =~ s{ ( ^$HS*\#$HS*include\b[^\r\n]+\b(?:\Q$ppport\E|XSUB\.h)\b[^\r\n]* | ^$HS*\#$HS*(?:define|elif|if(?:def)?)\b[^\r\n]* ) | ( ^$HS*\#[^\r\n]* | "[^"\\]*(?:\\.[^"\\]*)*" | '[^'\\]*(?:\\.[^'\\]*)*' | / (?: \*[^*]*\*+(?:[^$ccs][^*]*\*+)* / | /[^\r\n]* ) ) }{ defined $2 and push @ccom, $2; defined $1 ? $1 : "$ccs$#ccom$cce" }mgsex; $file{ccom} = \@ccom; $file{code} = $c; $file{has_inc_ppport} = $c =~ /^$HS*#$HS*include[^\r\n]+\b\Q$ppport\E\b/m; my $func; for $func (keys %API) { my $match = $func; $match .= "|$revreplace{$func}" if exists $revreplace{$func}; if ($c =~ /\b(?:Perl_)?($match)\b/) { $file{uses_replace}{$1}++ if exists $revreplace{$func} && $1 eq $revreplace{$func}; $file{uses_Perl}{$func}++ if $c =~ /\bPerl_$func\b/; if (exists $API{$func}{provided}) { $file{uses_provided}{$func}++; if (!exists $API{$func}{base} || $API{$func}{base} > $opt{'compat-version'}) { $file{uses}{$func}++; my @deps = rec_depend($func); if (@deps) { $file{uses_deps}{$func} = \@deps; for (@deps) { $file{uses}{$_} = 0 unless exists $file{uses}{$_}; } } for ($func, @deps) { $file{needs}{$_} = 'static' if exists $need{$_}; } } } if (exists $API{$func}{todo} && $API{$func}{todo} > $opt{'compat-version'}) { if ($c =~ /\b$func\b/) { $file{uses_todo}{$func}++; } } } } while ($c =~ /^$HS*#$HS*define$HS+(NEED_(\w+?)(_GLOBAL)?)\b/mg) { if (exists $need{$2}) { $file{defined $3 ? 'needed_global' : 'needed_static'}{$2}++; } else { warning("Possibly wrong #define $1 in $filename") } } for (qw(uses needs uses_todo needed_global needed_static)) { for $func (keys %{$file{$_}}) { push @{$global{$_}{$func}}, $filename; } } $files{$filename} = \%file; } # Globally resolve NEED_'s my $need; for $need (keys %{$global{needs}}) { if (@{$global{needs}{$need}} > 1) { my @targets = @{$global{needs}{$need}}; my @t = grep $files{$_}{needed_global}{$need}, @targets; @targets = @t if @t; @t = grep /\.xs$/i, @targets; @targets = @t if @t; my $target = shift @targets; $files{$target}{needs}{$need} = 'global'; for (@{$global{needs}{$need}}) { $files{$_}{needs}{$need} = 'extern' if $_ ne $target; } } } for $filename (@files) { exists $files{$filename} or next; info("=== Analyzing $filename ==="); my %file = %{$files{$filename}}; my $func; my $c = $file{code}; my $warnings = 0; for $func (sort keys %{$file{uses_Perl}}) { if ($API{$func}{varargs}) { unless ($API{$func}{nothxarg}) { my $changes = ($c =~ s{\b(Perl_$func\s*\(\s*)(?!aTHX_?)(\)|[^\s)]*\))} { $1 . ($2 eq ')' ? 'aTHX' : 'aTHX_ ') . $2 }ge); if ($changes) { warning("Doesn't pass interpreter argument aTHX to Perl_$func"); $file{changes} += $changes; } } } else { warning("Uses Perl_$func instead of $func"); $file{changes} += ($c =~ s{\bPerl_$func(\s*)\((\s*aTHX_?)?\s*} {$func$1(}g); } } for $func (sort keys %{$file{uses_replace}}) { warning("Uses $func instead of $replace{$func}"); $file{changes} += ($c =~ s/\b$func\b/$replace{$func}/g); } for $func (sort keys %{$file{uses_provided}}) { if ($file{uses}{$func}) { if (exists $file{uses_deps}{$func}) { diag("Uses $func, which depends on ", join(', ', @{$file{uses_deps}{$func}})); } else { diag("Uses $func"); } } $warnings += hint($func); } unless ($opt{quiet}) { for $func (sort keys %{$file{uses_todo}}) { print "*** WARNING: Uses $func, which may not be portable below perl ", format_version($API{$func}{todo}), ", even with '$ppport'\n"; $warnings++; } } for $func (sort keys %{$file{needed_static}}) { my $message = ''; if (not exists $file{uses}{$func}) { $message = "No need to define NEED_$func if $func is never used"; } elsif (exists $file{needs}{$func} && $file{needs}{$func} ne 'static') { $message = "No need to define NEED_$func when already needed globally"; } if ($message) { diag($message); $file{changes} += ($c =~ s/^$HS*#$HS*define$HS+NEED_$func\b.*$LF//mg); } } for $func (sort keys %{$file{needed_global}}) { my $message = ''; if (not exists $global{uses}{$func}) { $message = "No need to define NEED_${func}_GLOBAL if $func is never used"; } elsif (exists $file{needs}{$func}) { if ($file{needs}{$func} eq 'extern') { $message = "No need to define NEED_${func}_GLOBAL when already needed globally"; } elsif ($file{needs}{$func} eq 'static') { $message = "No need to define NEED_${func}_GLOBAL when only used in this file"; } } if ($message) { diag($message); $file{changes} += ($c =~ s/^$HS*#$HS*define$HS+NEED_${func}_GLOBAL\b.*$LF//mg); } } $file{needs_inc_ppport} = keys %{$file{uses}}; if ($file{needs_inc_ppport}) { my $pp = ''; for $func (sort keys %{$file{needs}}) { my $type = $file{needs}{$func}; next if $type eq 'extern'; my $suffix = $type eq 'global' ? '_GLOBAL' : ''; unless (exists $file{"needed_$type"}{$func}) { if ($type eq 'global') { diag("Files [@{$global{needs}{$func}}] need $func, adding global request"); } else { diag("File needs $func, adding static request"); } $pp .= "#define NEED_$func$suffix\n"; } } if ($pp && ($c =~ s/^(?=$HS*#$HS*define$HS+NEED_\w+)/$pp/m)) { $pp = ''; $file{changes}++; } unless ($file{has_inc_ppport}) { diag("Needs to include '$ppport'"); $pp .= qq(#include "$ppport"\n) } if ($pp) { $file{changes} += ($c =~ s/^($HS*#$HS*define$HS+NEED_\w+.*?)^/$1$pp/ms) || ($c =~ s/^(?=$HS*#$HS*include.*\Q$ppport\E)/$pp/m) || ($c =~ s/^($HS*#$HS*include.*XSUB.*\s*?)^/$1$pp/m) || ($c =~ s/^/$pp/); } } else { if ($file{has_inc_ppport}) { diag("No need to include '$ppport'"); $file{changes} += ($c =~ s/^$HS*?#$HS*include.*\Q$ppport\E.*?$LF//m); } } # put back in our C comments my $ix; my $cppc = 0; my @ccom = @{$file{ccom}}; for $ix (0 .. $#ccom) { if (!$opt{cplusplus} && $ccom[$ix] =~ s!^//!!) { $cppc++; $file{changes} += $c =~ s/$rccs$ix$rcce/$ccs$ccom[$ix] $cce/; } else { $c =~ s/$rccs$ix$rcce/$ccom[$ix]/; } } if ($cppc) { my $s = $cppc != 1 ? 's' : ''; warning("Uses $cppc C++ style comment$s, which is not portable"); } my $s = $warnings != 1 ? 's' : ''; my $warn = $warnings ? " ($warnings warning$s)" : ''; info("Analysis completed$warn"); if ($file{changes}) { if (exists $opt{copy}) { my $newfile = "$filename$opt{copy}"; if (-e $newfile) { error("'$newfile' already exists, refusing to write copy of '$filename'"); } else { local *F; if (open F, ">$newfile") { info("Writing copy of '$filename' with changes to '$newfile'"); print F $c; close F; } else { error("Cannot open '$newfile' for writing: $!"); } } } elsif (exists $opt{patch} || $opt{changes}) { if (exists $opt{patch}) { unless ($patch_opened) { if (open PATCH, ">$opt{patch}") { $patch_opened = 1; } else { error("Cannot open '$opt{patch}' for writing: $!"); delete $opt{patch}; $opt{changes} = 1; goto fallback; } } mydiff(\*PATCH, $filename, $c); } else { fallback: info("Suggested changes:"); mydiff(\*STDOUT, $filename, $c); } } else { my $s = $file{changes} == 1 ? '' : 's'; info("$file{changes} potentially required change$s detected"); } } else { info("Looks good"); } } close PATCH if $patch_opened; exit 0; sub try_use { eval "use @_;"; return $@ eq '' } sub mydiff { local *F = shift; my($file, $str) = @_; my $diff; if (exists $opt{diff}) { $diff = run_diff($opt{diff}, $file, $str); } if (!defined $diff and try_use('Text::Diff')) { $diff = Text::Diff::diff($file, \$str, { STYLE => 'Unified' }); $diff = <
$tmp") { print F $str; close F; if (open F, "$prog $file $tmp |") { while () { s/\Q$tmp\E/$file.patched/; $diff .= $_; } close F; unlink $tmp; return $diff; } unlink $tmp; } else { error("Cannot open '$tmp' for writing: $!"); } return undef; } sub rec_depend { my($func, $seen) = @_; return () unless exists $depends{$func}; $seen = {%{$seen||{}}}; return () if $seen->{$func}++; my %s; grep !$s{$_}++, map { ($_, rec_depend($_, $seen)) } @{$depends{$func}}; } sub parse_version { my $ver = shift; if ($ver =~ /^(\d+)\.(\d+)\.(\d+)$/) { return ($1, $2, $3); } elsif ($ver !~ /^\d+\.[\d_]+$/) { die "cannot parse version '$ver'\n"; } $ver =~ s/_//g; $ver =~ s/$/000000/; my($r,$v,$s) = $ver =~ /(\d+)\.(\d{3})(\d{3})/; $v = int $v; $s = int $s; if ($r < 5 || ($r == 5 && $v < 6)) { if ($s % 10) { die "cannot parse version '$ver'\n"; } } return ($r, $v, $s); } sub format_version { my $ver = shift; $ver =~ s/$/000000/; my($r,$v,$s) = $ver =~ /(\d+)\.(\d{3})(\d{3})/; $v = int $v; $s = int $s; if ($r < 5 || ($r == 5 && $v < 6)) { if ($s % 10) { die "invalid version '$ver'\n"; } $s /= 10; $ver = sprintf "%d.%03d", $r, $v; $s > 0 and $ver .= sprintf "_%02d", $s; return $ver; } return sprintf "%d.%d.%d", $r, $v, $s; } sub info { $opt{quiet} and return; print @_, "\n"; } sub diag { $opt{quiet} and return; $opt{diag} and print @_, "\n"; } sub warning { $opt{quiet} and return; print "*** ", @_, "\n"; } sub error { print "*** ERROR: ", @_, "\n"; } my %given_hints; my %given_warnings; sub hint { $opt{quiet} and return; my $func = shift; my $rv = 0; if (exists $warnings{$func} && !$given_warnings{$func}++) { my $warn = $warnings{$func}; $warn =~ s!^!*** !mg; print "*** WARNING: $func\n", $warn; $rv++; } if ($opt{hints} && exists $hints{$func} && !$given_hints{$func}++) { my $hint = $hints{$func}; $hint =~ s/^/ /mg; print " --- hint for $func ---\n", $hint; } $rv; } sub usage { my($usage) = do { local(@ARGV,$/)=($0); <> } =~ /^=head\d$HS+SYNOPSIS\s*^(.*?)\s*^=/ms; my %M = ( 'I' => '*' ); $usage =~ s/^\s*perl\s+\S+/$^X $0/; $usage =~ s/([A-Z])<([^>]+)>/$M{$1}$2$M{$1}/g; print < }; my($copy) = $self =~ /^=head\d\s+COPYRIGHT\s*^(.*?)^=\w+/ms; $copy =~ s/^(?=\S+)/ /gms; $self =~ s/^$HS+Do NOT edit.*?(?=^-)/$copy/ms; $self =~ s/^SKIP.*(?=^__DATA__)/SKIP if (\@ARGV && \$ARGV[0] eq '--unstrip') { eval { require Devel::PPPort }; \$@ and die "Cannot require Devel::PPPort, please install.\\n"; if (eval \$Devel::PPPort::VERSION < $VERSION) { die "$0 was originally generated with Devel::PPPort $VERSION.\\n" . "Your Devel::PPPort is only version \$Devel::PPPort::VERSION.\\n" . "Please install a newer version, or --unstrip will not work.\\n"; } Devel::PPPort::WriteFile(\$0); exit 0; } print <$0" or die "cannot strip $0: $!\n"; print OUT "$pl$c\n"; exit 0; } __DATA__ */ #ifndef _P_P_PORTABILITY_H_ #define _P_P_PORTABILITY_H_ #ifndef DPPP_NAMESPACE # define DPPP_NAMESPACE DPPP_ #endif #define DPPP_CAT2(x,y) CAT2(x,y) #define DPPP_(name) DPPP_CAT2(DPPP_NAMESPACE, name) #ifndef PERL_REVISION # if !defined(__PATCHLEVEL_H_INCLUDED__) && !(defined(PATCHLEVEL) && defined(SUBVERSION)) # define PERL_PATCHLEVEL_H_IMPLICIT # include # endif # if !(defined(PERL_VERSION) || (defined(SUBVERSION) && defined(PATCHLEVEL))) # include # endif # ifndef PERL_REVISION # define PERL_REVISION (5) /* Replace: 1 */ # define PERL_VERSION PATCHLEVEL # define PERL_SUBVERSION SUBVERSION /* Replace PERL_PATCHLEVEL with PERL_VERSION */ /* Replace: 0 */ # endif #endif #define D_PPP_DEC2BCD(dec) ((((dec)/100)<<8)|((((dec)%100)/10)<<4)|((dec)%10)) #define PERL_BCDVERSION ((D_PPP_DEC2BCD(PERL_REVISION)<<24)|(D_PPP_DEC2BCD(PERL_VERSION)<<12)|D_PPP_DEC2BCD(PERL_SUBVERSION)) /* It is very unlikely that anyone will try to use this with Perl 6 (or greater), but who knows. */ #if PERL_REVISION != 5 # error ppport.h only works with Perl version 5 #endif /* PERL_REVISION != 5 */ #ifndef dTHR # define dTHR dNOOP #endif #ifndef dTHX # define dTHX dNOOP #endif #ifndef dTHXa # define dTHXa(x) dNOOP #endif #ifndef pTHX # define pTHX void #endif #ifndef pTHX_ # define pTHX_ #endif #ifndef aTHX # define aTHX #endif #ifndef aTHX_ # define aTHX_ #endif #if (PERL_BCDVERSION < 0x5006000) # ifdef USE_THREADS # define aTHXR thr # define aTHXR_ thr, # else # define aTHXR # define aTHXR_ # endif # define dTHXR dTHR #else # define aTHXR aTHX # define aTHXR_ aTHX_ # define dTHXR dTHX #endif #ifndef dTHXoa # define dTHXoa(x) dTHXa(x) #endif #ifdef I_LIMITS # include #endif #ifndef PERL_UCHAR_MIN # define PERL_UCHAR_MIN ((unsigned char)0) #endif #ifndef PERL_UCHAR_MAX # ifdef UCHAR_MAX # define PERL_UCHAR_MAX ((unsigned char)UCHAR_MAX) # else # ifdef MAXUCHAR # define PERL_UCHAR_MAX ((unsigned char)MAXUCHAR) # else # define PERL_UCHAR_MAX ((unsigned char)~(unsigned)0) # endif # endif #endif #ifndef PERL_USHORT_MIN # define PERL_USHORT_MIN ((unsigned short)0) #endif #ifndef PERL_USHORT_MAX # ifdef USHORT_MAX # define PERL_USHORT_MAX ((unsigned short)USHORT_MAX) # else # ifdef MAXUSHORT # define PERL_USHORT_MAX ((unsigned short)MAXUSHORT) # else # ifdef USHRT_MAX # define PERL_USHORT_MAX ((unsigned short)USHRT_MAX) # else # define PERL_USHORT_MAX ((unsigned short)~(unsigned)0) # endif # endif # endif #endif #ifndef PERL_SHORT_MAX # ifdef SHORT_MAX # define PERL_SHORT_MAX ((short)SHORT_MAX) # else # ifdef MAXSHORT /* Often used in */ # define PERL_SHORT_MAX ((short)MAXSHORT) # else # ifdef SHRT_MAX # define PERL_SHORT_MAX ((short)SHRT_MAX) # else # define PERL_SHORT_MAX ((short) (PERL_USHORT_MAX >> 1)) # endif # endif # endif #endif #ifndef PERL_SHORT_MIN # ifdef SHORT_MIN # define PERL_SHORT_MIN ((short)SHORT_MIN) # else # ifdef MINSHORT # define PERL_SHORT_MIN ((short)MINSHORT) # else # ifdef SHRT_MIN # define PERL_SHORT_MIN ((short)SHRT_MIN) # else # define PERL_SHORT_MIN (-PERL_SHORT_MAX - ((3 & -1) == 3)) # endif # endif # endif #endif #ifndef PERL_UINT_MAX # ifdef UINT_MAX # define PERL_UINT_MAX ((unsigned int)UINT_MAX) # else # ifdef MAXUINT # define PERL_UINT_MAX ((unsigned int)MAXUINT) # else # define PERL_UINT_MAX (~(unsigned int)0) # endif # endif #endif #ifndef PERL_UINT_MIN # define PERL_UINT_MIN ((unsigned int)0) #endif #ifndef PERL_INT_MAX # ifdef INT_MAX # define PERL_INT_MAX ((int)INT_MAX) # else # ifdef MAXINT /* Often used in */ # define PERL_INT_MAX ((int)MAXINT) # else # define PERL_INT_MAX ((int)(PERL_UINT_MAX >> 1)) # endif # endif #endif #ifndef PERL_INT_MIN # ifdef INT_MIN # define PERL_INT_MIN ((int)INT_MIN) # else # ifdef MININT # define PERL_INT_MIN ((int)MININT) # else # define PERL_INT_MIN (-PERL_INT_MAX - ((3 & -1) == 3)) # endif # endif #endif #ifndef PERL_ULONG_MAX # ifdef ULONG_MAX # define PERL_ULONG_MAX ((unsigned long)ULONG_MAX) # else # ifdef MAXULONG # define PERL_ULONG_MAX ((unsigned long)MAXULONG) # else # define PERL_ULONG_MAX (~(unsigned long)0) # endif # endif #endif #ifndef PERL_ULONG_MIN # define PERL_ULONG_MIN ((unsigned long)0L) #endif #ifndef PERL_LONG_MAX # ifdef LONG_MAX # define PERL_LONG_MAX ((long)LONG_MAX) # else # ifdef MAXLONG # define PERL_LONG_MAX ((long)MAXLONG) # else # define PERL_LONG_MAX ((long) (PERL_ULONG_MAX >> 1)) # endif # endif #endif #ifndef PERL_LONG_MIN # ifdef LONG_MIN # define PERL_LONG_MIN ((long)LONG_MIN) # else # ifdef MINLONG # define PERL_LONG_MIN ((long)MINLONG) # else # define PERL_LONG_MIN (-PERL_LONG_MAX - ((3 & -1) == 3)) # endif # endif #endif #if defined(HAS_QUAD) && (defined(convex) || defined(uts)) # ifndef PERL_UQUAD_MAX # ifdef ULONGLONG_MAX # define PERL_UQUAD_MAX ((unsigned long long)ULONGLONG_MAX) # else # ifdef MAXULONGLONG # define PERL_UQUAD_MAX ((unsigned long long)MAXULONGLONG) # else # define PERL_UQUAD_MAX (~(unsigned long long)0) # endif # endif # endif # ifndef PERL_UQUAD_MIN # define PERL_UQUAD_MIN ((unsigned long long)0L) # endif # ifndef PERL_QUAD_MAX # ifdef LONGLONG_MAX # define PERL_QUAD_MAX ((long long)LONGLONG_MAX) # else # ifdef MAXLONGLONG # define PERL_QUAD_MAX ((long long)MAXLONGLONG) # else # define PERL_QUAD_MAX ((long long) (PERL_UQUAD_MAX >> 1)) # endif # endif # endif # ifndef PERL_QUAD_MIN # ifdef LONGLONG_MIN # define PERL_QUAD_MIN ((long long)LONGLONG_MIN) # else # ifdef MINLONGLONG # define PERL_QUAD_MIN ((long long)MINLONGLONG) # else # define PERL_QUAD_MIN (-PERL_QUAD_MAX - ((3 & -1) == 3)) # endif # endif # endif #endif /* This is based on code from 5.003 perl.h */ #ifdef HAS_QUAD # ifdef cray #ifndef IVTYPE # define IVTYPE int #endif #ifndef IV_MIN # define IV_MIN PERL_INT_MIN #endif #ifndef IV_MAX # define IV_MAX PERL_INT_MAX #endif #ifndef UV_MIN # define UV_MIN PERL_UINT_MIN #endif #ifndef UV_MAX # define UV_MAX PERL_UINT_MAX #endif # ifdef INTSIZE #ifndef IVSIZE # define IVSIZE INTSIZE #endif # endif # else # if defined(convex) || defined(uts) #ifndef IVTYPE # define IVTYPE long long #endif #ifndef IV_MIN # define IV_MIN PERL_QUAD_MIN #endif #ifndef IV_MAX # define IV_MAX PERL_QUAD_MAX #endif #ifndef UV_MIN # define UV_MIN PERL_UQUAD_MIN #endif #ifndef UV_MAX # define UV_MAX PERL_UQUAD_MAX #endif # ifdef LONGLONGSIZE #ifndef IVSIZE # define IVSIZE LONGLONGSIZE #endif # endif # else #ifndef IVTYPE # define IVTYPE long #endif #ifndef IV_MIN # define IV_MIN PERL_LONG_MIN #endif #ifndef IV_MAX # define IV_MAX PERL_LONG_MAX #endif #ifndef UV_MIN # define UV_MIN PERL_ULONG_MIN #endif #ifndef UV_MAX # define UV_MAX PERL_ULONG_MAX #endif # ifdef LONGSIZE #ifndef IVSIZE # define IVSIZE LONGSIZE #endif # endif # endif # endif #ifndef IVSIZE # define IVSIZE 8 #endif #ifndef LONGSIZE # define LONGSIZE 8 #endif #ifndef PERL_QUAD_MIN # define PERL_QUAD_MIN IV_MIN #endif #ifndef PERL_QUAD_MAX # define PERL_QUAD_MAX IV_MAX #endif #ifndef PERL_UQUAD_MIN # define PERL_UQUAD_MIN UV_MIN #endif #ifndef PERL_UQUAD_MAX # define PERL_UQUAD_MAX UV_MAX #endif #else #ifndef IVTYPE # define IVTYPE long #endif #ifndef LONGSIZE # define LONGSIZE 4 #endif #ifndef IV_MIN # define IV_MIN PERL_LONG_MIN #endif #ifndef IV_MAX # define IV_MAX PERL_LONG_MAX #endif #ifndef UV_MIN # define UV_MIN PERL_ULONG_MIN #endif #ifndef UV_MAX # define UV_MAX PERL_ULONG_MAX #endif #endif #ifndef IVSIZE # ifdef LONGSIZE # define IVSIZE LONGSIZE # else # define IVSIZE 4 /* A bold guess, but the best we can make. */ # endif #endif #ifndef UVTYPE # define UVTYPE unsigned IVTYPE #endif #ifndef UVSIZE # define UVSIZE IVSIZE #endif #ifndef sv_setuv # define sv_setuv(sv, uv) \ STMT_START { \ UV TeMpUv = uv; \ if (TeMpUv <= IV_MAX) \ sv_setiv(sv, TeMpUv); \ else \ sv_setnv(sv, (double)TeMpUv); \ } STMT_END #endif #ifndef newSVuv # define newSVuv(uv) ((uv) <= IV_MAX ? newSViv((IV)uv) : newSVnv((NV)uv)) #endif #ifndef sv_2uv # define sv_2uv(sv) ((PL_Sv = (sv)), (UV) (SvNOK(PL_Sv) ? SvNV(PL_Sv) : sv_2nv(PL_Sv))) #endif #ifndef SvUVX # define SvUVX(sv) ((UV)SvIVX(sv)) #endif #ifndef SvUVXx # define SvUVXx(sv) SvUVX(sv) #endif #ifndef SvUV # define SvUV(sv) (SvIOK(sv) ? SvUVX(sv) : sv_2uv(sv)) #endif #ifndef SvUVx # define SvUVx(sv) ((PL_Sv = (sv)), SvUV(PL_Sv)) #endif /* Hint: sv_uv * Always use the SvUVx() macro instead of sv_uv(). */ #ifndef sv_uv # define sv_uv(sv) SvUVx(sv) #endif #if !defined(SvUOK) && defined(SvIOK_UV) # define SvUOK(sv) SvIOK_UV(sv) #endif #ifndef XST_mUV # define XST_mUV(i,v) (ST(i) = sv_2mortal(newSVuv(v)) ) #endif #ifndef XSRETURN_UV # define XSRETURN_UV(v) STMT_START { XST_mUV(0,v); XSRETURN(1); } STMT_END #endif #ifndef PUSHu # define PUSHu(u) STMT_START { sv_setuv(TARG, (UV)(u)); PUSHTARG; } STMT_END #endif #ifndef XPUSHu # define XPUSHu(u) STMT_START { sv_setuv(TARG, (UV)(u)); XPUSHTARG; } STMT_END #endif #ifdef HAS_MEMCMP #ifndef memNE # define memNE(s1,s2,l) (memcmp(s1,s2,l)) #endif #ifndef memEQ # define memEQ(s1,s2,l) (!memcmp(s1,s2,l)) #endif #else #ifndef memNE # define memNE(s1,s2,l) (bcmp(s1,s2,l)) #endif #ifndef memEQ # define memEQ(s1,s2,l) (!bcmp(s1,s2,l)) #endif #endif #ifndef memEQs # define memEQs(s1, l, s2) \ (sizeof(s2)-1 == l && memEQ(s1, (s2 ""), (sizeof(s2)-1))) #endif #ifndef memNEs # define memNEs(s1, l, s2) !memEQs(s1, l, s2) #endif #ifndef MoveD # define MoveD(s,d,n,t) memmove((char*)(d),(char*)(s), (n) * sizeof(t)) #endif #ifndef CopyD # define CopyD(s,d,n,t) memcpy((char*)(d),(char*)(s), (n) * sizeof(t)) #endif #ifdef HAS_MEMSET #ifndef ZeroD # define ZeroD(d,n,t) memzero((char*)(d), (n) * sizeof(t)) #endif #else #ifndef ZeroD # define ZeroD(d,n,t) ((void)memzero((char*)(d), (n) * sizeof(t)), d) #endif #endif #ifndef PoisonWith # define PoisonWith(d,n,t,b) (void)memset((char*)(d), (U8)(b), (n) * sizeof(t)) #endif #ifndef PoisonNew # define PoisonNew(d,n,t) PoisonWith(d,n,t,0xAB) #endif #ifndef PoisonFree # define PoisonFree(d,n,t) PoisonWith(d,n,t,0xEF) #endif #ifndef Poison # define Poison(d,n,t) PoisonFree(d,n,t) #endif #ifndef Newx # define Newx(v,n,t) New(0,v,n,t) #endif #ifndef Newxc # define Newxc(v,n,t,c) Newc(0,v,n,t,c) #endif #ifndef Newxz # define Newxz(v,n,t) Newz(0,v,n,t) #endif #ifndef PERL_MAGIC_sv # define PERL_MAGIC_sv '\0' #endif #ifndef PERL_MAGIC_overload # define PERL_MAGIC_overload 'A' #endif #ifndef PERL_MAGIC_overload_elem # define PERL_MAGIC_overload_elem 'a' #endif #ifndef PERL_MAGIC_overload_table # define PERL_MAGIC_overload_table 'c' #endif #ifndef PERL_MAGIC_bm # define PERL_MAGIC_bm 'B' #endif #ifndef PERL_MAGIC_regdata # define PERL_MAGIC_regdata 'D' #endif #ifndef PERL_MAGIC_regdatum # define PERL_MAGIC_regdatum 'd' #endif #ifndef PERL_MAGIC_env # define PERL_MAGIC_env 'E' #endif #ifndef PERL_MAGIC_envelem # define PERL_MAGIC_envelem 'e' #endif #ifndef PERL_MAGIC_fm # define PERL_MAGIC_fm 'f' #endif #ifndef PERL_MAGIC_regex_global # define PERL_MAGIC_regex_global 'g' #endif #ifndef PERL_MAGIC_isa # define PERL_MAGIC_isa 'I' #endif #ifndef PERL_MAGIC_isaelem # define PERL_MAGIC_isaelem 'i' #endif #ifndef PERL_MAGIC_nkeys # define PERL_MAGIC_nkeys 'k' #endif #ifndef PERL_MAGIC_dbfile # define PERL_MAGIC_dbfile 'L' #endif #ifndef PERL_MAGIC_dbline # define PERL_MAGIC_dbline 'l' #endif #ifndef PERL_MAGIC_mutex # define PERL_MAGIC_mutex 'm' #endif #ifndef PERL_MAGIC_shared # define PERL_MAGIC_shared 'N' #endif #ifndef PERL_MAGIC_shared_scalar # define PERL_MAGIC_shared_scalar 'n' #endif #ifndef PERL_MAGIC_collxfrm # define PERL_MAGIC_collxfrm 'o' #endif #ifndef PERL_MAGIC_tied # define PERL_MAGIC_tied 'P' #endif #ifndef PERL_MAGIC_tiedelem # define PERL_MAGIC_tiedelem 'p' #endif #ifndef PERL_MAGIC_tiedscalar # define PERL_MAGIC_tiedscalar 'q' #endif #ifndef PERL_MAGIC_qr # define PERL_MAGIC_qr 'r' #endif #ifndef PERL_MAGIC_sig # define PERL_MAGIC_sig 'S' #endif #ifndef PERL_MAGIC_sigelem # define PERL_MAGIC_sigelem 's' #endif #ifndef PERL_MAGIC_taint # define PERL_MAGIC_taint 't' #endif #ifndef PERL_MAGIC_uvar # define PERL_MAGIC_uvar 'U' #endif #ifndef PERL_MAGIC_uvar_elem # define PERL_MAGIC_uvar_elem 'u' #endif #ifndef PERL_MAGIC_vstring # define PERL_MAGIC_vstring 'V' #endif #ifndef PERL_MAGIC_vec # define PERL_MAGIC_vec 'v' #endif #ifndef PERL_MAGIC_utf8 # define PERL_MAGIC_utf8 'w' #endif #ifndef PERL_MAGIC_substr # define PERL_MAGIC_substr 'x' #endif #ifndef PERL_MAGIC_defelem # define PERL_MAGIC_defelem 'y' #endif #ifndef PERL_MAGIC_glob # define PERL_MAGIC_glob '*' #endif #ifndef PERL_MAGIC_arylen # define PERL_MAGIC_arylen '#' #endif #ifndef PERL_MAGIC_pos # define PERL_MAGIC_pos '.' #endif #ifndef PERL_MAGIC_backref # define PERL_MAGIC_backref '<' #endif #ifndef PERL_MAGIC_ext # define PERL_MAGIC_ext '~' #endif #ifndef cBOOL # define cBOOL(cbool) ((cbool) ? (bool)1 : (bool)0) #endif #ifndef OpHAS_SIBLING # define OpHAS_SIBLING(o) (cBOOL((o)->op_sibling)) #endif #ifndef OpSIBLING # define OpSIBLING(o) (0 + (o)->op_sibling) #endif #ifndef OpMORESIB_set # define OpMORESIB_set(o, sib) ((o)->op_sibling = (sib)) #endif #ifndef OpLASTSIB_set # define OpLASTSIB_set(o, parent) ((o)->op_sibling = NULL) #endif #ifndef OpMAYBESIB_set # define OpMAYBESIB_set(o, sib, parent) ((o)->op_sibling = (sib)) #endif #ifndef HEf_SVKEY # define HEf_SVKEY -2 #endif #ifndef SvRX #if defined(NEED_SvRX) static void * DPPP_(my_SvRX)(pTHX_ SV *rv); static #else extern void * DPPP_(my_SvRX)(pTHX_ SV *rv); #endif #if defined(NEED_SvRX) || defined(NEED_SvRX_GLOBAL) #ifdef SvRX # undef SvRX #endif #define SvRX(a) DPPP_(my_SvRX)(aTHX_ a) void * DPPP_(my_SvRX)(pTHX_ SV *rv) { if (SvROK(rv)) { SV *sv = SvRV(rv); if (SvMAGICAL(sv)) { MAGIC *mg = mg_find(sv, PERL_MAGIC_qr); if (mg && mg->mg_obj) { return mg->mg_obj; } } } return 0; } #endif #endif #ifndef SvRXOK # define SvRXOK(sv) (!!SvRX(sv)) #endif #ifndef PERL_UNUSED_DECL # ifdef HASATTRIBUTE # if (defined(__GNUC__) && defined(__cplusplus)) || defined(__INTEL_COMPILER) # define PERL_UNUSED_DECL # else # define PERL_UNUSED_DECL __attribute__((unused)) # endif # else # define PERL_UNUSED_DECL # endif #endif #ifndef PERL_UNUSED_ARG # if defined(lint) && defined(S_SPLINT_S) /* www.splint.org */ # include # define PERL_UNUSED_ARG(x) NOTE(ARGUNUSED(x)) # else # define PERL_UNUSED_ARG(x) ((void)x) # endif #endif #ifndef PERL_UNUSED_VAR # define PERL_UNUSED_VAR(x) ((void)x) #endif #ifndef PERL_UNUSED_CONTEXT # ifdef USE_ITHREADS # define PERL_UNUSED_CONTEXT PERL_UNUSED_ARG(my_perl) # else # define PERL_UNUSED_CONTEXT # endif #endif #ifndef PERL_UNUSED_RESULT # if defined(__GNUC__) && defined(HASATTRIBUTE_WARN_UNUSED_RESULT) # define PERL_UNUSED_RESULT(v) STMT_START { __typeof__(v) z = (v); (void)sizeof(z); } STMT_END # else # define PERL_UNUSED_RESULT(v) ((void)(v)) # endif #endif #ifndef NOOP # define NOOP /*EMPTY*/(void)0 #endif #ifndef dNOOP # define dNOOP extern int /*@unused@*/ Perl___notused PERL_UNUSED_DECL #endif #ifndef NVTYPE # if defined(USE_LONG_DOUBLE) && defined(HAS_LONG_DOUBLE) # define NVTYPE long double # else # define NVTYPE double # endif typedef NVTYPE NV; #endif #ifndef INT2PTR # if (IVSIZE == PTRSIZE) && (UVSIZE == PTRSIZE) # define PTRV UV # define INT2PTR(any,d) (any)(d) # else # if PTRSIZE == LONGSIZE # define PTRV unsigned long # else # define PTRV unsigned # endif # define INT2PTR(any,d) (any)(PTRV)(d) # endif #endif #ifndef PTR2ul # if PTRSIZE == LONGSIZE # define PTR2ul(p) (unsigned long)(p) # else # define PTR2ul(p) INT2PTR(unsigned long,p) # endif #endif #ifndef PTR2nat # define PTR2nat(p) (PTRV)(p) #endif #ifndef NUM2PTR # define NUM2PTR(any,d) (any)PTR2nat(d) #endif #ifndef PTR2IV # define PTR2IV(p) INT2PTR(IV,p) #endif #ifndef PTR2UV # define PTR2UV(p) INT2PTR(UV,p) #endif #ifndef PTR2NV # define PTR2NV(p) NUM2PTR(NV,p) #endif #undef START_EXTERN_C #undef END_EXTERN_C #undef EXTERN_C #ifdef __cplusplus # define START_EXTERN_C extern "C" { # define END_EXTERN_C } # define EXTERN_C extern "C" #else # define START_EXTERN_C # define END_EXTERN_C # define EXTERN_C extern #endif #if defined(PERL_GCC_PEDANTIC) # ifndef PERL_GCC_BRACE_GROUPS_FORBIDDEN # define PERL_GCC_BRACE_GROUPS_FORBIDDEN # endif #endif #if defined(__GNUC__) && !defined(PERL_GCC_BRACE_GROUPS_FORBIDDEN) && !defined(__cplusplus) # ifndef PERL_USE_GCC_BRACE_GROUPS # define PERL_USE_GCC_BRACE_GROUPS # endif #endif #undef STMT_START #undef STMT_END #ifdef PERL_USE_GCC_BRACE_GROUPS # define STMT_START (void)( /* gcc supports ``({ STATEMENTS; })'' */ # define STMT_END ) #else # if defined(VOIDFLAGS) && (VOIDFLAGS) && (defined(sun) || defined(__sun__)) && !defined(__GNUC__) # define STMT_START if (1) # define STMT_END else (void)0 # else # define STMT_START do # define STMT_END while (0) # endif #endif #ifndef boolSV # define boolSV(b) ((b) ? &PL_sv_yes : &PL_sv_no) #endif /* DEFSV appears first in 5.004_56 */ #ifndef DEFSV # define DEFSV GvSV(PL_defgv) #endif #ifndef SAVE_DEFSV # define SAVE_DEFSV SAVESPTR(GvSV(PL_defgv)) #endif #ifndef DEFSV_set # define DEFSV_set(sv) (DEFSV = (sv)) #endif /* Older perls (<=5.003) lack AvFILLp */ #ifndef AvFILLp # define AvFILLp AvFILL #endif #ifndef ERRSV # define ERRSV get_sv("@",FALSE) #endif /* Hint: gv_stashpvn * This function's backport doesn't support the length parameter, but * rather ignores it. Portability can only be ensured if the length * parameter is used for speed reasons, but the length can always be * correctly computed from the string argument. */ #ifndef gv_stashpvn # define gv_stashpvn(str,len,create) gv_stashpv(str,create) #endif /* Replace: 1 */ #ifndef get_cv # define get_cv perl_get_cv #endif #ifndef get_sv # define get_sv perl_get_sv #endif #ifndef get_av # define get_av perl_get_av #endif #ifndef get_hv # define get_hv perl_get_hv #endif /* Replace: 0 */ #ifndef dUNDERBAR # define dUNDERBAR dNOOP #endif #ifndef UNDERBAR # define UNDERBAR DEFSV #endif #ifndef dAX # define dAX I32 ax = MARK - PL_stack_base + 1 #endif #ifndef dITEMS # define dITEMS I32 items = SP - MARK #endif #ifndef dXSTARG # define dXSTARG SV * targ = sv_newmortal() #endif #ifndef dAXMARK # define dAXMARK I32 ax = POPMARK; \ register SV ** const mark = PL_stack_base + ax++ #endif #ifndef XSprePUSH # define XSprePUSH (sp = PL_stack_base + ax - 1) #endif #if (PERL_BCDVERSION < 0x5005000) # undef XSRETURN # define XSRETURN(off) \ STMT_START { \ PL_stack_sp = PL_stack_base + ax + ((off) - 1); \ return; \ } STMT_END #endif #ifndef XSPROTO # define XSPROTO(name) void name(pTHX_ CV* cv) #endif #ifndef SVfARG # define SVfARG(p) ((void*)(p)) #endif #ifndef PERL_ABS # define PERL_ABS(x) ((x) < 0 ? -(x) : (x)) #endif #ifndef dVAR # define dVAR dNOOP #endif #ifndef SVf # define SVf "_" #endif #ifndef UTF8_MAXBYTES # define UTF8_MAXBYTES UTF8_MAXLEN #endif #ifndef CPERLscope # define CPERLscope(x) x #endif #ifndef PERL_HASH # define PERL_HASH(hash,str,len) \ STMT_START { \ const char *s_PeRlHaSh = str; \ I32 i_PeRlHaSh = len; \ U32 hash_PeRlHaSh = 0; \ while (i_PeRlHaSh--) \ hash_PeRlHaSh = hash_PeRlHaSh * 33 + *s_PeRlHaSh++; \ (hash) = hash_PeRlHaSh; \ } STMT_END #endif #ifndef PERLIO_FUNCS_DECL # ifdef PERLIO_FUNCS_CONST # define PERLIO_FUNCS_DECL(funcs) const PerlIO_funcs funcs # define PERLIO_FUNCS_CAST(funcs) (PerlIO_funcs*)(funcs) # else # define PERLIO_FUNCS_DECL(funcs) PerlIO_funcs funcs # define PERLIO_FUNCS_CAST(funcs) (funcs) # endif #endif /* provide these typedefs for older perls */ #if (PERL_BCDVERSION < 0x5009003) # ifdef ARGSproto typedef OP* (CPERLscope(*Perl_ppaddr_t))(ARGSproto); # else typedef OP* (CPERLscope(*Perl_ppaddr_t))(pTHX); # endif typedef OP* (CPERLscope(*Perl_check_t)) (pTHX_ OP*); #endif #ifndef isPSXSPC # define isPSXSPC(c) (isSPACE(c) || (c) == '\v') #endif #ifndef isBLANK # define isBLANK(c) ((c) == ' ' || (c) == '\t') #endif #ifdef EBCDIC #ifndef isALNUMC # define isALNUMC(c) isalnum(c) #endif #ifndef isASCII # define isASCII(c) isascii(c) #endif #ifndef isCNTRL # define isCNTRL(c) iscntrl(c) #endif #ifndef isGRAPH # define isGRAPH(c) isgraph(c) #endif #ifndef isPRINT # define isPRINT(c) isprint(c) #endif #ifndef isPUNCT # define isPUNCT(c) ispunct(c) #endif #ifndef isXDIGIT # define isXDIGIT(c) isxdigit(c) #endif #else # if (PERL_BCDVERSION < 0x5010000) /* Hint: isPRINT * The implementation in older perl versions includes all of the * isSPACE() characters, which is wrong. The version provided by * Devel::PPPort always overrides a present buggy version. */ # undef isPRINT # endif #ifndef WIDEST_UTYPE # ifdef QUADKIND # ifdef U64TYPE # define WIDEST_UTYPE U64TYPE # else # define WIDEST_UTYPE Quad_t # endif # else # define WIDEST_UTYPE U32 # endif #endif #ifndef isALNUMC # define isALNUMC(c) (isALPHA(c) || isDIGIT(c)) #endif #ifndef isASCII # define isASCII(c) ((WIDEST_UTYPE) (c) <= 127) #endif #ifndef isCNTRL # define isCNTRL(c) ((WIDEST_UTYPE) (c) < ' ' || (c) == 127) #endif #ifndef isGRAPH # define isGRAPH(c) (isALNUM(c) || isPUNCT(c)) #endif #ifndef isPRINT # define isPRINT(c) (((c) >= 32 && (c) < 127)) #endif #ifndef isPUNCT # define isPUNCT(c) (((c) >= 33 && (c) <= 47) || ((c) >= 58 && (c) <= 64) || ((c) >= 91 && (c) <= 96) || ((c) >= 123 && (c) <= 126)) #endif #ifndef isXDIGIT # define isXDIGIT(c) (isDIGIT(c) || ((c) >= 'a' && (c) <= 'f') || ((c) >= 'A' && (c) <= 'F')) #endif #endif /* Until we figure out how to support this in older perls... */ #if (PERL_BCDVERSION >= 0x5008000) #ifndef HeUTF8 # define HeUTF8(he) ((HeKLEN(he) == HEf_SVKEY) ? \ SvUTF8(HeKEY_sv(he)) : \ (U32)HeKUTF8(he)) #endif #endif #ifndef C_ARRAY_LENGTH # define C_ARRAY_LENGTH(a) (sizeof(a)/sizeof((a)[0])) #endif #ifndef C_ARRAY_END # define C_ARRAY_END(a) ((a) + C_ARRAY_LENGTH(a)) #endif #ifndef MUTABLE_PTR #if defined(__GNUC__) && !defined(PERL_GCC_BRACE_GROUPS_FORBIDDEN) # define MUTABLE_PTR(p) ({ void *_p = (p); _p; }) #else # define MUTABLE_PTR(p) ((void *) (p)) #endif #endif #ifndef MUTABLE_SV # define MUTABLE_SV(p) ((SV *)MUTABLE_PTR(p)) #endif #ifdef NEED_mess_sv #define NEED_mess #endif #ifdef NEED_mess #define NEED_mess_nocontext #define NEED_vmess #endif #ifndef croak_sv #if (PERL_BCDVERSION >= 0x5007003) || ( (PERL_BCDVERSION >= 0x5006001) && (PERL_BCDVERSION < 0x5007000) ) # if ( (PERL_BCDVERSION >= 0x5008000) && (PERL_BCDVERSION < 0x5008009) ) || ( (PERL_BCDVERSION >= 0x5009000) && (PERL_BCDVERSION < 0x5010001) ) # define D_PPP_FIX_UTF8_ERRSV(errsv, sv) \ STMT_START { \ if (sv != ERRSV) \ SvFLAGS(ERRSV) = (SvFLAGS(ERRSV) & ~SVf_UTF8) | \ (SvFLAGS(sv) & SVf_UTF8); \ } STMT_END # else # define D_PPP_FIX_UTF8_ERRSV(errsv, sv) STMT_START {} STMT_END # endif # define croak_sv(sv) \ STMT_START { \ if (SvROK(sv)) { \ sv_setsv(ERRSV, sv); \ croak(NULL); \ } else { \ D_PPP_FIX_UTF8_ERRSV(ERRSV, sv); \ croak("%" SVf, SVfARG(sv)); \ } \ } STMT_END #elif (PERL_BCDVERSION >= 0x5004000) # define croak_sv(sv) croak("%" SVf, SVfARG(sv)) #else # define croak_sv(sv) croak("%s", SvPV_nolen(sv)) #endif #endif #ifndef die_sv #if defined(NEED_die_sv) static OP * DPPP_(my_die_sv)(pTHX_ SV *sv); static #else extern OP * DPPP_(my_die_sv)(pTHX_ SV *sv); #endif #if defined(NEED_die_sv) || defined(NEED_die_sv_GLOBAL) #ifdef die_sv # undef die_sv #endif #define die_sv(a) DPPP_(my_die_sv)(aTHX_ a) #define Perl_die_sv DPPP_(my_die_sv) OP * DPPP_(my_die_sv)(pTHX_ SV *sv) { croak_sv(sv); return (OP *)NULL; } #endif #endif #ifndef warn_sv #if (PERL_BCDVERSION >= 0x5004000) # define warn_sv(sv) warn("%" SVf, SVfARG(sv)) #else # define warn_sv(sv) warn("%s", SvPV_nolen(sv)) #endif #endif #ifndef vmess #if defined(NEED_vmess) static SV * DPPP_(my_vmess)(pTHX_ const char * pat, va_list * args); static #else extern SV * DPPP_(my_vmess)(pTHX_ const char * pat, va_list * args); #endif #if defined(NEED_vmess) || defined(NEED_vmess_GLOBAL) #ifdef vmess # undef vmess #endif #define vmess(a,b) DPPP_(my_vmess)(aTHX_ a,b) #define Perl_vmess DPPP_(my_vmess) SV* DPPP_(my_vmess)(pTHX_ const char* pat, va_list* args) { mess(pat, args); return PL_mess_sv; } #endif #endif #if (PERL_BCDVERSION < 0x5006000) #undef mess #endif #if !defined(mess_nocontext) && !defined(Perl_mess_nocontext) #if defined(NEED_mess_nocontext) static SV * DPPP_(my_mess_nocontext)(const char * pat, ...); static #else extern SV * DPPP_(my_mess_nocontext)(const char * pat, ...); #endif #if defined(NEED_mess_nocontext) || defined(NEED_mess_nocontext_GLOBAL) #define mess_nocontext DPPP_(my_mess_nocontext) #define Perl_mess_nocontext DPPP_(my_mess_nocontext) SV* DPPP_(my_mess_nocontext)(const char* pat, ...) { dTHX; SV *sv; va_list args; va_start(args, pat); sv = vmess(pat, &args); va_end(args); return sv; } #endif #endif #ifndef mess #if defined(NEED_mess) static SV * DPPP_(my_mess)(pTHX_ const char * pat, ...); static #else extern SV * DPPP_(my_mess)(pTHX_ const char * pat, ...); #endif #if defined(NEED_mess) || defined(NEED_mess_GLOBAL) #define Perl_mess DPPP_(my_mess) SV* DPPP_(my_mess)(pTHX_ const char* pat, ...) { SV *sv; va_list args; va_start(args, pat); sv = vmess(pat, &args); va_end(args); return sv; } #ifdef mess_nocontext #define mess mess_nocontext #else #define mess Perl_mess_nocontext #endif #endif #endif #ifndef mess_sv #if defined(NEED_mess_sv) static SV * DPPP_(my_mess_sv)(pTHX_ SV * basemsg, bool consume); static #else extern SV * DPPP_(my_mess_sv)(pTHX_ SV * basemsg, bool consume); #endif #if defined(NEED_mess_sv) || defined(NEED_mess_sv_GLOBAL) #ifdef mess_sv # undef mess_sv #endif #define mess_sv(a,b) DPPP_(my_mess_sv)(aTHX_ a,b) #define Perl_mess_sv DPPP_(my_mess_sv) SV * DPPP_(my_mess_sv)(pTHX_ SV *basemsg, bool consume) { SV *tmp; SV *ret; if (SvPOK(basemsg) && SvCUR(basemsg) && *(SvEND(basemsg)-1) == '\n') { if (consume) return basemsg; ret = mess(""); SvSetSV_nosteal(ret, basemsg); return ret; } if (consume) { sv_catsv(basemsg, mess("")); return basemsg; } ret = mess(""); tmp = newSVsv(ret); SvSetSV_nosteal(ret, basemsg); sv_catsv(ret, tmp); sv_dec(tmp); return ret; } #endif #endif #ifndef warn_nocontext #define warn_nocontext warn #endif #ifndef croak_nocontext #define croak_nocontext croak #endif #ifndef croak_no_modify #define croak_no_modify() croak_nocontext("%s", PL_no_modify) #define Perl_croak_no_modify() croak_no_modify() #endif #ifndef croak_memory_wrap #if (PERL_BCDVERSION >= 0x5009002) || ( (PERL_BCDVERSION >= 0x5008006) && (PERL_BCDVERSION < 0x5009000) ) # define croak_memory_wrap() croak_nocontext("%s", PL_memory_wrap) #else # define croak_memory_wrap() croak_nocontext("panic: memory wrap") #endif #endif #ifndef croak_xs_usage #if defined(NEED_croak_xs_usage) static void DPPP_(my_croak_xs_usage)(const CV * const cv, const char * const params); static #else extern void DPPP_(my_croak_xs_usage)(const CV * const cv, const char * const params); #endif #if defined(NEED_croak_xs_usage) || defined(NEED_croak_xs_usage_GLOBAL) #define croak_xs_usage DPPP_(my_croak_xs_usage) #define Perl_croak_xs_usage DPPP_(my_croak_xs_usage) #ifndef PERL_ARGS_ASSERT_CROAK_XS_USAGE #define PERL_ARGS_ASSERT_CROAK_XS_USAGE assert(cv); assert(params) #endif void DPPP_(my_croak_xs_usage)(const CV *const cv, const char *const params) { dTHX; const GV *const gv = CvGV(cv); PERL_ARGS_ASSERT_CROAK_XS_USAGE; if (gv) { const char *const gvname = GvNAME(gv); const HV *const stash = GvSTASH(gv); const char *const hvname = stash ? HvNAME(stash) : NULL; if (hvname) croak("Usage: %s::%s(%s)", hvname, gvname, params); else croak("Usage: %s(%s)", gvname, params); } else { /* Pants. I don't think that it should be possible to get here. */ croak("Usage: CODE(0x%" UVxf ")(%s)", PTR2UV(cv), params); } } #endif #endif #ifndef PERL_SIGNALS_UNSAFE_FLAG #define PERL_SIGNALS_UNSAFE_FLAG 0x0001 #if (PERL_BCDVERSION < 0x5008000) # define D_PPP_PERL_SIGNALS_INIT PERL_SIGNALS_UNSAFE_FLAG #else # define D_PPP_PERL_SIGNALS_INIT 0 #endif #if defined(NEED_PL_signals) static U32 DPPP_(my_PL_signals) = D_PPP_PERL_SIGNALS_INIT; #elif defined(NEED_PL_signals_GLOBAL) U32 DPPP_(my_PL_signals) = D_PPP_PERL_SIGNALS_INIT; #else extern U32 DPPP_(my_PL_signals); #endif #define PL_signals DPPP_(my_PL_signals) #endif /* Hint: PL_ppaddr * Calling an op via PL_ppaddr requires passing a context argument * for threaded builds. Since the context argument is different for * 5.005 perls, you can use aTHXR (supplied by ppport.h), which will * automatically be defined as the correct argument. */ #if (PERL_BCDVERSION <= 0x5005005) /* Replace: 1 */ # define PL_ppaddr ppaddr # define PL_no_modify no_modify /* Replace: 0 */ #endif #if (PERL_BCDVERSION <= 0x5004005) /* Replace: 1 */ # define PL_DBsignal DBsignal # define PL_DBsingle DBsingle # define PL_DBsub DBsub # define PL_DBtrace DBtrace # define PL_Sv Sv # define PL_bufend bufend # define PL_bufptr bufptr # define PL_compiling compiling # define PL_copline copline # define PL_curcop curcop # define PL_curstash curstash # define PL_debstash debstash # define PL_defgv defgv # define PL_diehook diehook # define PL_dirty dirty # define PL_dowarn dowarn # define PL_errgv errgv # define PL_error_count error_count # define PL_expect expect # define PL_hexdigit hexdigit # define PL_hints hints # define PL_in_my in_my # define PL_laststatval laststatval # define PL_lex_state lex_state # define PL_lex_stuff lex_stuff # define PL_linestr linestr # define PL_na na # define PL_perl_destruct_level perl_destruct_level # define PL_perldb perldb # define PL_rsfp_filters rsfp_filters # define PL_rsfp rsfp # define PL_stack_base stack_base # define PL_stack_sp stack_sp # define PL_statcache statcache # define PL_stdingv stdingv # define PL_sv_arenaroot sv_arenaroot # define PL_sv_no sv_no # define PL_sv_undef sv_undef # define PL_sv_yes sv_yes # define PL_tainted tainted # define PL_tainting tainting # define PL_tokenbuf tokenbuf /* Replace: 0 */ #endif /* Warning: PL_parser * For perl versions earlier than 5.9.5, this is an always * non-NULL dummy. Also, it cannot be dereferenced. Don't * use it if you can avoid is and unless you absolutely know * what you're doing. * If you always check that PL_parser is non-NULL, you can * define DPPP_PL_parser_NO_DUMMY to avoid the creation of * a dummy parser structure. */ #if (PERL_BCDVERSION >= 0x5009005) # ifdef DPPP_PL_parser_NO_DUMMY # define D_PPP_my_PL_parser_var(var) ((PL_parser ? PL_parser : \ (croak("panic: PL_parser == NULL in %s:%d", \ __FILE__, __LINE__), (yy_parser *) NULL))->var) # else # ifdef DPPP_PL_parser_NO_DUMMY_WARNING # define D_PPP_parser_dummy_warning(var) # else # define D_PPP_parser_dummy_warning(var) \ warn("warning: dummy PL_" #var " used in %s:%d", __FILE__, __LINE__), # endif # define D_PPP_my_PL_parser_var(var) ((PL_parser ? PL_parser : \ (D_PPP_parser_dummy_warning(var) &DPPP_(dummy_PL_parser)))->var) #if defined(NEED_PL_parser) static yy_parser DPPP_(dummy_PL_parser); #elif defined(NEED_PL_parser_GLOBAL) yy_parser DPPP_(dummy_PL_parser); #else extern yy_parser DPPP_(dummy_PL_parser); #endif # endif /* PL_expect, PL_copline, PL_rsfp, PL_rsfp_filters, PL_linestr, PL_bufptr, PL_bufend, PL_lex_state, PL_lex_stuff, PL_tokenbuf depends on PL_parser */ /* Warning: PL_expect, PL_copline, PL_rsfp, PL_rsfp_filters, PL_linestr, PL_bufptr, PL_bufend, PL_lex_state, PL_lex_stuff, PL_tokenbuf * Do not use this variable unless you know exactly what you're * doing. It is internal to the perl parser and may change or even * be removed in the future. As of perl 5.9.5, you have to check * for (PL_parser != NULL) for this variable to have any effect. * An always non-NULL PL_parser dummy is provided for earlier * perl versions. * If PL_parser is NULL when you try to access this variable, a * dummy is being accessed instead and a warning is issued unless * you define DPPP_PL_parser_NO_DUMMY_WARNING. * If DPPP_PL_parser_NO_DUMMY is defined, the code trying to access * this variable will croak with a panic message. */ # define PL_expect D_PPP_my_PL_parser_var(expect) # define PL_copline D_PPP_my_PL_parser_var(copline) # define PL_rsfp D_PPP_my_PL_parser_var(rsfp) # define PL_rsfp_filters D_PPP_my_PL_parser_var(rsfp_filters) # define PL_linestr D_PPP_my_PL_parser_var(linestr) # define PL_bufptr D_PPP_my_PL_parser_var(bufptr) # define PL_bufend D_PPP_my_PL_parser_var(bufend) # define PL_lex_state D_PPP_my_PL_parser_var(lex_state) # define PL_lex_stuff D_PPP_my_PL_parser_var(lex_stuff) # define PL_tokenbuf D_PPP_my_PL_parser_var(tokenbuf) # define PL_in_my D_PPP_my_PL_parser_var(in_my) # define PL_in_my_stash D_PPP_my_PL_parser_var(in_my_stash) # define PL_error_count D_PPP_my_PL_parser_var(error_count) #else /* ensure that PL_parser != NULL and cannot be dereferenced */ # define PL_parser ((void *) 1) #endif #ifndef mPUSHs # define mPUSHs(s) PUSHs(sv_2mortal(s)) #endif #ifndef PUSHmortal # define PUSHmortal PUSHs(sv_newmortal()) #endif #ifndef mPUSHp # define mPUSHp(p,l) sv_setpvn(PUSHmortal, (p), (l)) #endif #ifndef mPUSHn # define mPUSHn(n) sv_setnv(PUSHmortal, (NV)(n)) #endif #ifndef mPUSHi # define mPUSHi(i) sv_setiv(PUSHmortal, (IV)(i)) #endif #ifndef mPUSHu # define mPUSHu(u) sv_setuv(PUSHmortal, (UV)(u)) #endif #ifndef mXPUSHs # define mXPUSHs(s) XPUSHs(sv_2mortal(s)) #endif #ifndef XPUSHmortal # define XPUSHmortal XPUSHs(sv_newmortal()) #endif #ifndef mXPUSHp # define mXPUSHp(p,l) STMT_START { EXTEND(sp,1); sv_setpvn(PUSHmortal, (p), (l)); } STMT_END #endif #ifndef mXPUSHn # define mXPUSHn(n) STMT_START { EXTEND(sp,1); sv_setnv(PUSHmortal, (NV)(n)); } STMT_END #endif #ifndef mXPUSHi # define mXPUSHi(i) STMT_START { EXTEND(sp,1); sv_setiv(PUSHmortal, (IV)(i)); } STMT_END #endif #ifndef mXPUSHu # define mXPUSHu(u) STMT_START { EXTEND(sp,1); sv_setuv(PUSHmortal, (UV)(u)); } STMT_END #endif /* Replace: 1 */ #ifndef call_sv # define call_sv perl_call_sv #endif #ifndef call_pv # define call_pv perl_call_pv #endif #ifndef call_argv # define call_argv perl_call_argv #endif #ifndef call_method # define call_method perl_call_method #endif #ifndef eval_sv # define eval_sv perl_eval_sv #endif /* Replace: 0 */ #ifndef PERL_LOADMOD_DENY # define PERL_LOADMOD_DENY 0x1 #endif #ifndef PERL_LOADMOD_NOIMPORT # define PERL_LOADMOD_NOIMPORT 0x2 #endif #ifndef PERL_LOADMOD_IMPORT_OPS # define PERL_LOADMOD_IMPORT_OPS 0x4 #endif #ifndef G_METHOD # define G_METHOD 64 # ifdef call_sv # undef call_sv # endif # if (PERL_BCDVERSION < 0x5006000) # define call_sv(sv, flags) ((flags) & G_METHOD ? perl_call_method((char *) SvPV_nolen_const(sv), \ (flags) & ~G_METHOD) : perl_call_sv(sv, flags)) # else # define call_sv(sv, flags) ((flags) & G_METHOD ? Perl_call_method(aTHX_ (char *) SvPV_nolen_const(sv), \ (flags) & ~G_METHOD) : Perl_call_sv(aTHX_ sv, flags)) # endif #endif /* Replace perl_eval_pv with eval_pv */ #ifndef eval_pv #if defined(NEED_eval_pv) static SV* DPPP_(my_eval_pv)(char *p, I32 croak_on_error); static #else extern SV* DPPP_(my_eval_pv)(char *p, I32 croak_on_error); #endif #if defined(NEED_eval_pv) || defined(NEED_eval_pv_GLOBAL) #ifdef eval_pv # undef eval_pv #endif #define eval_pv(a,b) DPPP_(my_eval_pv)(aTHX_ a,b) #define Perl_eval_pv DPPP_(my_eval_pv) SV* DPPP_(my_eval_pv)(char *p, I32 croak_on_error) { dSP; SV* sv = newSVpv(p, 0); PUSHMARK(sp); eval_sv(sv, G_SCALAR); SvREFCNT_dec(sv); SPAGAIN; sv = POPs; PUTBACK; if (croak_on_error && SvTRUEx(ERRSV)) croak_sv(ERRSV); return sv; } #endif #endif #ifndef vload_module #if defined(NEED_vload_module) static void DPPP_(my_vload_module)(U32 flags, SV *name, SV *ver, va_list *args); static #else extern void DPPP_(my_vload_module)(U32 flags, SV *name, SV *ver, va_list *args); #endif #if defined(NEED_vload_module) || defined(NEED_vload_module_GLOBAL) #ifdef vload_module # undef vload_module #endif #define vload_module(a,b,c,d) DPPP_(my_vload_module)(aTHX_ a,b,c,d) #define Perl_vload_module DPPP_(my_vload_module) void DPPP_(my_vload_module)(U32 flags, SV *name, SV *ver, va_list *args) { dTHR; dVAR; OP *veop, *imop; OP * const modname = newSVOP(OP_CONST, 0, name); /* 5.005 has a somewhat hacky force_normal that doesn't croak on SvREADONLY() if PL_compling is true. Current perls take care in ck_require() to correctly turn off SvREADONLY before calling force_normal_flags(). This seems a better fix than fudging PL_compling */ SvREADONLY_off(((SVOP*)modname)->op_sv); modname->op_private |= OPpCONST_BARE; if (ver) { veop = newSVOP(OP_CONST, 0, ver); } else veop = NULL; if (flags & PERL_LOADMOD_NOIMPORT) { imop = sawparens(newNULLLIST()); } else if (flags & PERL_LOADMOD_IMPORT_OPS) { imop = va_arg(*args, OP*); } else { SV *sv; imop = NULL; sv = va_arg(*args, SV*); while (sv) { imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv)); sv = va_arg(*args, SV*); } } { const line_t ocopline = PL_copline; COP * const ocurcop = PL_curcop; const int oexpect = PL_expect; #if (PERL_BCDVERSION >= 0x5004000) utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0), veop, modname, imop); #elif (PERL_BCDVERSION > 0x5003000) utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(), veop, modname, imop); #else utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(), modname, imop); #endif PL_expect = oexpect; PL_copline = ocopline; PL_curcop = ocurcop; } } #endif #endif #ifndef load_module #if defined(NEED_load_module) static void DPPP_(my_load_module)(U32 flags, SV *name, SV *ver, ...); static #else extern void DPPP_(my_load_module)(U32 flags, SV *name, SV *ver, ...); #endif #if defined(NEED_load_module) || defined(NEED_load_module_GLOBAL) #ifdef load_module # undef load_module #endif #define load_module DPPP_(my_load_module) #define Perl_load_module DPPP_(my_load_module) void DPPP_(my_load_module)(U32 flags, SV *name, SV *ver, ...) { va_list args; va_start(args, ver); vload_module(flags, name, ver, &args); va_end(args); } #endif #endif #ifndef newRV_inc # define newRV_inc(sv) newRV(sv) /* Replace */ #endif #ifndef newRV_noinc #if defined(NEED_newRV_noinc) static SV * DPPP_(my_newRV_noinc)(SV *sv); static #else extern SV * DPPP_(my_newRV_noinc)(SV *sv); #endif #if defined(NEED_newRV_noinc) || defined(NEED_newRV_noinc_GLOBAL) #ifdef newRV_noinc # undef newRV_noinc #endif #define newRV_noinc(a) DPPP_(my_newRV_noinc)(aTHX_ a) #define Perl_newRV_noinc DPPP_(my_newRV_noinc) SV * DPPP_(my_newRV_noinc)(SV *sv) { SV *rv = (SV *)newRV(sv); SvREFCNT_dec(sv); return rv; } #endif #endif /* Hint: newCONSTSUB * Returns a CV* as of perl-5.7.1. This return value is not supported * by Devel::PPPort. */ /* newCONSTSUB from IO.xs is in the core starting with 5.004_63 */ #if (PERL_BCDVERSION < 0x5004063) && (PERL_BCDVERSION != 0x5004005) #if defined(NEED_newCONSTSUB) static void DPPP_(my_newCONSTSUB)(HV *stash, const char *name, SV *sv); static #else extern void DPPP_(my_newCONSTSUB)(HV *stash, const char *name, SV *sv); #endif #if defined(NEED_newCONSTSUB) || defined(NEED_newCONSTSUB_GLOBAL) #ifdef newCONSTSUB # undef newCONSTSUB #endif #define newCONSTSUB(a,b,c) DPPP_(my_newCONSTSUB)(aTHX_ a,b,c) #define Perl_newCONSTSUB DPPP_(my_newCONSTSUB) /* This is just a trick to avoid a dependency of newCONSTSUB on PL_parser */ /* (There's no PL_parser in perl < 5.005, so this is completely safe) */ #define D_PPP_PL_copline PL_copline void DPPP_(my_newCONSTSUB)(HV *stash, const char *name, SV *sv) { U32 oldhints = PL_hints; HV *old_cop_stash = PL_curcop->cop_stash; HV *old_curstash = PL_curstash; line_t oldline = PL_curcop->cop_line; PL_curcop->cop_line = D_PPP_PL_copline; PL_hints &= ~HINT_BLOCK_SCOPE; if (stash) PL_curstash = PL_curcop->cop_stash = stash; newSUB( #if (PERL_BCDVERSION < 0x5003022) start_subparse(), #elif (PERL_BCDVERSION == 0x5003022) start_subparse(0), #else /* 5.003_23 onwards */ start_subparse(FALSE, 0), #endif newSVOP(OP_CONST, 0, newSVpv((char *) name, 0)), newSVOP(OP_CONST, 0, &PL_sv_no), /* SvPV(&PL_sv_no) == "" -- GMB */ newSTATEOP(0, Nullch, newSVOP(OP_CONST, 0, sv)) ); PL_hints = oldhints; PL_curcop->cop_stash = old_cop_stash; PL_curstash = old_curstash; PL_curcop->cop_line = oldline; } #endif #endif /* * Boilerplate macros for initializing and accessing interpreter-local * data from C. All statics in extensions should be reworked to use * this, if you want to make the extension thread-safe. See ext/re/re.xs * for an example of the use of these macros. * * Code that uses these macros is responsible for the following: * 1. #define MY_CXT_KEY to a unique string, e.g. "DynaLoader_guts" * 2. Declare a typedef named my_cxt_t that is a structure that contains * all the data that needs to be interpreter-local. * 3. Use the START_MY_CXT macro after the declaration of my_cxt_t. * 4. Use the MY_CXT_INIT macro such that it is called exactly once * (typically put in the BOOT: section). * 5. Use the members of the my_cxt_t structure everywhere as * MY_CXT.member. * 6. Use the dMY_CXT macro (a declaration) in all the functions that * access MY_CXT. */ #if defined(MULTIPLICITY) || defined(PERL_OBJECT) || \ defined(PERL_CAPI) || defined(PERL_IMPLICIT_CONTEXT) #ifndef START_MY_CXT /* This must appear in all extensions that define a my_cxt_t structure, * right after the definition (i.e. at file scope). The non-threads * case below uses it to declare the data as static. */ #define START_MY_CXT #if (PERL_BCDVERSION < 0x5004068) /* Fetches the SV that keeps the per-interpreter data. */ #define dMY_CXT_SV \ SV *my_cxt_sv = get_sv(MY_CXT_KEY, FALSE) #else /* >= perl5.004_68 */ #define dMY_CXT_SV \ SV *my_cxt_sv = *hv_fetch(PL_modglobal, MY_CXT_KEY, \ sizeof(MY_CXT_KEY)-1, TRUE) #endif /* < perl5.004_68 */ /* This declaration should be used within all functions that use the * interpreter-local data. */ #define dMY_CXT \ dMY_CXT_SV; \ my_cxt_t *my_cxtp = INT2PTR(my_cxt_t*,SvUV(my_cxt_sv)) /* Creates and zeroes the per-interpreter data. * (We allocate my_cxtp in a Perl SV so that it will be released when * the interpreter goes away.) */ #define MY_CXT_INIT \ dMY_CXT_SV; \ /* newSV() allocates one more than needed */ \ my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1));\ Zero(my_cxtp, 1, my_cxt_t); \ sv_setuv(my_cxt_sv, PTR2UV(my_cxtp)) /* This macro must be used to access members of the my_cxt_t structure. * e.g. MYCXT.some_data */ #define MY_CXT (*my_cxtp) /* Judicious use of these macros can reduce the number of times dMY_CXT * is used. Use is similar to pTHX, aTHX etc. */ #define pMY_CXT my_cxt_t *my_cxtp #define pMY_CXT_ pMY_CXT, #define _pMY_CXT ,pMY_CXT #define aMY_CXT my_cxtp #define aMY_CXT_ aMY_CXT, #define _aMY_CXT ,aMY_CXT #endif /* START_MY_CXT */ #ifndef MY_CXT_CLONE /* Clones the per-interpreter data. */ #define MY_CXT_CLONE \ dMY_CXT_SV; \ my_cxt_t *my_cxtp = (my_cxt_t*)SvPVX(newSV(sizeof(my_cxt_t)-1));\ Copy(INT2PTR(my_cxt_t*, SvUV(my_cxt_sv)), my_cxtp, 1, my_cxt_t);\ sv_setuv(my_cxt_sv, PTR2UV(my_cxtp)) #endif #else /* single interpreter */ #ifndef START_MY_CXT #define START_MY_CXT static my_cxt_t my_cxt; #define dMY_CXT_SV dNOOP #define dMY_CXT dNOOP #define MY_CXT_INIT NOOP #define MY_CXT my_cxt #define pMY_CXT void #define pMY_CXT_ #define _pMY_CXT #define aMY_CXT #define aMY_CXT_ #define _aMY_CXT #endif /* START_MY_CXT */ #ifndef MY_CXT_CLONE #define MY_CXT_CLONE NOOP #endif #endif #ifndef IVdf # if IVSIZE == LONGSIZE # define IVdf "ld" # define UVuf "lu" # define UVof "lo" # define UVxf "lx" # define UVXf "lX" # elif IVSIZE == INTSIZE # define IVdf "d" # define UVuf "u" # define UVof "o" # define UVxf "x" # define UVXf "X" # else # error "cannot define IV/UV formats" # endif #endif #ifndef NVef # if defined(USE_LONG_DOUBLE) && defined(HAS_LONG_DOUBLE) && \ defined(PERL_PRIfldbl) && (PERL_BCDVERSION != 0x5006000) /* Not very likely, but let's try anyway. */ # define NVef PERL_PRIeldbl # define NVff PERL_PRIfldbl # define NVgf PERL_PRIgldbl # else # define NVef "e" # define NVff "f" # define NVgf "g" # endif #endif #ifndef SvREFCNT_inc # ifdef PERL_USE_GCC_BRACE_GROUPS # define SvREFCNT_inc(sv) \ ({ \ SV * const _sv = (SV*)(sv); \ if (_sv) \ (SvREFCNT(_sv))++; \ _sv; \ }) # else # define SvREFCNT_inc(sv) \ ((PL_Sv=(SV*)(sv)) ? (++(SvREFCNT(PL_Sv)),PL_Sv) : NULL) # endif #endif #ifndef SvREFCNT_inc_simple # ifdef PERL_USE_GCC_BRACE_GROUPS # define SvREFCNT_inc_simple(sv) \ ({ \ if (sv) \ (SvREFCNT(sv))++; \ (SV *)(sv); \ }) # else # define SvREFCNT_inc_simple(sv) \ ((sv) ? (SvREFCNT(sv)++,(SV*)(sv)) : NULL) # endif #endif #ifndef SvREFCNT_inc_NN # ifdef PERL_USE_GCC_BRACE_GROUPS # define SvREFCNT_inc_NN(sv) \ ({ \ SV * const _sv = (SV*)(sv); \ SvREFCNT(_sv)++; \ _sv; \ }) # else # define SvREFCNT_inc_NN(sv) \ (PL_Sv=(SV*)(sv),++(SvREFCNT(PL_Sv)),PL_Sv) # endif #endif #ifndef SvREFCNT_inc_void # ifdef PERL_USE_GCC_BRACE_GROUPS # define SvREFCNT_inc_void(sv) \ ({ \ SV * const _sv = (SV*)(sv); \ if (_sv) \ (void)(SvREFCNT(_sv)++); \ }) # else # define SvREFCNT_inc_void(sv) \ (void)((PL_Sv=(SV*)(sv)) ? ++(SvREFCNT(PL_Sv)) : 0) # endif #endif #ifndef SvREFCNT_inc_simple_void # define SvREFCNT_inc_simple_void(sv) STMT_START { if (sv) SvREFCNT(sv)++; } STMT_END #endif #ifndef SvREFCNT_inc_simple_NN # define SvREFCNT_inc_simple_NN(sv) (++SvREFCNT(sv), (SV*)(sv)) #endif #ifndef SvREFCNT_inc_void_NN # define SvREFCNT_inc_void_NN(sv) (void)(++SvREFCNT((SV*)(sv))) #endif #ifndef SvREFCNT_inc_simple_void_NN # define SvREFCNT_inc_simple_void_NN(sv) (void)(++SvREFCNT((SV*)(sv))) #endif #ifndef newSV_type #if defined(NEED_newSV_type) static SV* DPPP_(my_newSV_type)(pTHX_ svtype const t); static #else extern SV* DPPP_(my_newSV_type)(pTHX_ svtype const t); #endif #if defined(NEED_newSV_type) || defined(NEED_newSV_type_GLOBAL) #ifdef newSV_type # undef newSV_type #endif #define newSV_type(a) DPPP_(my_newSV_type)(aTHX_ a) #define Perl_newSV_type DPPP_(my_newSV_type) SV* DPPP_(my_newSV_type)(pTHX_ svtype const t) { SV* const sv = newSV(0); sv_upgrade(sv, t); return sv; } #endif #endif #if (PERL_BCDVERSION < 0x5006000) # define D_PPP_CONSTPV_ARG(x) ((char *) (x)) #else # define D_PPP_CONSTPV_ARG(x) (x) #endif #ifndef newSVpvn # define newSVpvn(data,len) ((data) \ ? ((len) ? newSVpv((data), (len)) : newSVpv("", 0)) \ : newSV(0)) #endif #ifndef newSVpvn_utf8 # define newSVpvn_utf8(s, len, u) newSVpvn_flags((s), (len), (u) ? SVf_UTF8 : 0) #endif #ifndef SVf_UTF8 # define SVf_UTF8 0 #endif #ifndef newSVpvn_flags #if defined(NEED_newSVpvn_flags) static SV * DPPP_(my_newSVpvn_flags)(pTHX_ const char *s, STRLEN len, U32 flags); static #else extern SV * DPPP_(my_newSVpvn_flags)(pTHX_ const char *s, STRLEN len, U32 flags); #endif #if defined(NEED_newSVpvn_flags) || defined(NEED_newSVpvn_flags_GLOBAL) #ifdef newSVpvn_flags # undef newSVpvn_flags #endif #define newSVpvn_flags(a,b,c) DPPP_(my_newSVpvn_flags)(aTHX_ a,b,c) #define Perl_newSVpvn_flags DPPP_(my_newSVpvn_flags) SV * DPPP_(my_newSVpvn_flags)(pTHX_ const char *s, STRLEN len, U32 flags) { SV *sv = newSVpvn(D_PPP_CONSTPV_ARG(s), len); SvFLAGS(sv) |= (flags & SVf_UTF8); return (flags & SVs_TEMP) ? sv_2mortal(sv) : sv; } #endif #endif /* Backwards compatibility stuff... :-( */ #if !defined(NEED_sv_2pv_flags) && defined(NEED_sv_2pv_nolen) # define NEED_sv_2pv_flags #endif #if !defined(NEED_sv_2pv_flags_GLOBAL) && defined(NEED_sv_2pv_nolen_GLOBAL) # define NEED_sv_2pv_flags_GLOBAL #endif /* Hint: sv_2pv_nolen * Use the SvPV_nolen() or SvPV_nolen_const() macros instead of sv_2pv_nolen(). */ #ifndef sv_2pv_nolen # define sv_2pv_nolen(sv) SvPV_nolen(sv) #endif #ifdef SvPVbyte /* Hint: SvPVbyte * Does not work in perl-5.6.1, ppport.h implements a version * borrowed from perl-5.7.3. */ #if (PERL_BCDVERSION < 0x5007000) #if defined(NEED_sv_2pvbyte) static char * DPPP_(my_sv_2pvbyte)(pTHX_ SV *sv, STRLEN *lp); static #else extern char * DPPP_(my_sv_2pvbyte)(pTHX_ SV *sv, STRLEN *lp); #endif #if defined(NEED_sv_2pvbyte) || defined(NEED_sv_2pvbyte_GLOBAL) #ifdef sv_2pvbyte # undef sv_2pvbyte #endif #define sv_2pvbyte(a,b) DPPP_(my_sv_2pvbyte)(aTHX_ a,b) #define Perl_sv_2pvbyte DPPP_(my_sv_2pvbyte) char * DPPP_(my_sv_2pvbyte)(pTHX_ SV *sv, STRLEN *lp) { sv_utf8_downgrade(sv,0); return SvPV(sv,*lp); } #endif /* Hint: sv_2pvbyte * Use the SvPVbyte() macro instead of sv_2pvbyte(). */ #undef SvPVbyte #define SvPVbyte(sv, lp) \ ((SvFLAGS(sv) & (SVf_POK|SVf_UTF8)) == (SVf_POK) \ ? ((lp = SvCUR(sv)), SvPVX(sv)) : sv_2pvbyte(sv, &lp)) #endif #else # define SvPVbyte SvPV # define sv_2pvbyte sv_2pv #endif #ifndef sv_2pvbyte_nolen # define sv_2pvbyte_nolen(sv) sv_2pv_nolen(sv) #endif /* Hint: sv_pvn * Always use the SvPV() macro instead of sv_pvn(). */ /* Hint: sv_pvn_force * Always use the SvPV_force() macro instead of sv_pvn_force(). */ /* If these are undefined, they're not handled by the core anyway */ #ifndef SV_IMMEDIATE_UNREF # define SV_IMMEDIATE_UNREF 0 #endif #ifndef SV_GMAGIC # define SV_GMAGIC 0 #endif #ifndef SV_COW_DROP_PV # define SV_COW_DROP_PV 0 #endif #ifndef SV_UTF8_NO_ENCODING # define SV_UTF8_NO_ENCODING 0 #endif #ifndef SV_NOSTEAL # define SV_NOSTEAL 0 #endif #ifndef SV_CONST_RETURN # define SV_CONST_RETURN 0 #endif #ifndef SV_MUTABLE_RETURN # define SV_MUTABLE_RETURN 0 #endif #ifndef SV_SMAGIC # define SV_SMAGIC 0 #endif #ifndef SV_HAS_TRAILING_NUL # define SV_HAS_TRAILING_NUL 0 #endif #ifndef SV_COW_SHARED_HASH_KEYS # define SV_COW_SHARED_HASH_KEYS 0 #endif #if (PERL_BCDVERSION < 0x5007002) #if defined(NEED_sv_2pv_flags) static char * DPPP_(my_sv_2pv_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags); static #else extern char * DPPP_(my_sv_2pv_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags); #endif #if defined(NEED_sv_2pv_flags) || defined(NEED_sv_2pv_flags_GLOBAL) #ifdef sv_2pv_flags # undef sv_2pv_flags #endif #define sv_2pv_flags(a,b,c) DPPP_(my_sv_2pv_flags)(aTHX_ a,b,c) #define Perl_sv_2pv_flags DPPP_(my_sv_2pv_flags) char * DPPP_(my_sv_2pv_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags) { STRLEN n_a = (STRLEN) flags; return sv_2pv(sv, lp ? lp : &n_a); } #endif #if defined(NEED_sv_pvn_force_flags) static char * DPPP_(my_sv_pvn_force_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags); static #else extern char * DPPP_(my_sv_pvn_force_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags); #endif #if defined(NEED_sv_pvn_force_flags) || defined(NEED_sv_pvn_force_flags_GLOBAL) #ifdef sv_pvn_force_flags # undef sv_pvn_force_flags #endif #define sv_pvn_force_flags(a,b,c) DPPP_(my_sv_pvn_force_flags)(aTHX_ a,b,c) #define Perl_sv_pvn_force_flags DPPP_(my_sv_pvn_force_flags) char * DPPP_(my_sv_pvn_force_flags)(pTHX_ SV *sv, STRLEN *lp, I32 flags) { STRLEN n_a = (STRLEN) flags; return sv_pvn_force(sv, lp ? lp : &n_a); } #endif #endif #if (PERL_BCDVERSION < 0x5008008) || ( (PERL_BCDVERSION >= 0x5009000) && (PERL_BCDVERSION < 0x5009003) ) # define D_PPP_SVPV_NOLEN_LP_ARG &PL_na #else # define D_PPP_SVPV_NOLEN_LP_ARG 0 #endif #ifndef SvPV_const # define SvPV_const(sv, lp) SvPV_flags_const(sv, lp, SV_GMAGIC) #endif #ifndef SvPV_mutable # define SvPV_mutable(sv, lp) SvPV_flags_mutable(sv, lp, SV_GMAGIC) #endif #ifndef SvPV_flags # define SvPV_flags(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX(sv)) : sv_2pv_flags(sv, &lp, flags)) #endif #ifndef SvPV_flags_const # define SvPV_flags_const(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX_const(sv)) : \ (const char*) sv_2pv_flags(sv, &lp, flags|SV_CONST_RETURN)) #endif #ifndef SvPV_flags_const_nolen # define SvPV_flags_const_nolen(sv, flags) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? SvPVX_const(sv) : \ (const char*) sv_2pv_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, flags|SV_CONST_RETURN)) #endif #ifndef SvPV_flags_mutable # define SvPV_flags_mutable(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX_mutable(sv)) : \ sv_2pv_flags(sv, &lp, flags|SV_MUTABLE_RETURN)) #endif #ifndef SvPV_force # define SvPV_force(sv, lp) SvPV_force_flags(sv, lp, SV_GMAGIC) #endif #ifndef SvPV_force_nolen # define SvPV_force_nolen(sv) SvPV_force_flags_nolen(sv, SV_GMAGIC) #endif #ifndef SvPV_force_mutable # define SvPV_force_mutable(sv, lp) SvPV_force_flags_mutable(sv, lp, SV_GMAGIC) #endif #ifndef SvPV_force_nomg # define SvPV_force_nomg(sv, lp) SvPV_force_flags(sv, lp, 0) #endif #ifndef SvPV_force_nomg_nolen # define SvPV_force_nomg_nolen(sv) SvPV_force_flags_nolen(sv, 0) #endif #ifndef SvPV_force_flags # define SvPV_force_flags(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK|SVf_THINKFIRST)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX(sv)) : sv_pvn_force_flags(sv, &lp, flags)) #endif #ifndef SvPV_force_flags_nolen # define SvPV_force_flags_nolen(sv, flags) \ ((SvFLAGS(sv) & (SVf_POK|SVf_THINKFIRST)) == SVf_POK \ ? SvPVX(sv) : sv_pvn_force_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, flags)) #endif #ifndef SvPV_force_flags_mutable # define SvPV_force_flags_mutable(sv, lp, flags) \ ((SvFLAGS(sv) & (SVf_POK|SVf_THINKFIRST)) == SVf_POK \ ? ((lp = SvCUR(sv)), SvPVX_mutable(sv)) \ : sv_pvn_force_flags(sv, &lp, flags|SV_MUTABLE_RETURN)) #endif #ifndef SvPV_nolen # define SvPV_nolen(sv) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? SvPVX(sv) : sv_2pv_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, SV_GMAGIC)) #endif #ifndef SvPV_nolen_const # define SvPV_nolen_const(sv) \ ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? SvPVX_const(sv) : sv_2pv_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, SV_GMAGIC|SV_CONST_RETURN)) #endif #ifndef SvPV_nomg # define SvPV_nomg(sv, lp) SvPV_flags(sv, lp, 0) #endif #ifndef SvPV_nomg_const # define SvPV_nomg_const(sv, lp) SvPV_flags_const(sv, lp, 0) #endif #ifndef SvPV_nomg_const_nolen # define SvPV_nomg_const_nolen(sv) SvPV_flags_const_nolen(sv, 0) #endif #ifndef SvPV_nomg_nolen # define SvPV_nomg_nolen(sv) ((SvFLAGS(sv) & (SVf_POK)) == SVf_POK \ ? SvPVX(sv) : sv_2pv_flags(sv, D_PPP_SVPV_NOLEN_LP_ARG, 0)) #endif #ifndef SvPV_renew # define SvPV_renew(sv,n) STMT_START { SvLEN_set(sv, n); \ SvPV_set((sv), (char *) saferealloc( \ (Malloc_t)SvPVX(sv), (MEM_SIZE)((n)))); \ } STMT_END #endif #ifndef SvMAGIC_set # define SvMAGIC_set(sv, val) \ STMT_START { assert(SvTYPE(sv) >= SVt_PVMG); \ (((XPVMG*) SvANY(sv))->xmg_magic = (val)); } STMT_END #endif #if (PERL_BCDVERSION < 0x5009003) #ifndef SvPVX_const # define SvPVX_const(sv) ((const char*) (0 + SvPVX(sv))) #endif #ifndef SvPVX_mutable # define SvPVX_mutable(sv) (0 + SvPVX(sv)) #endif #ifndef SvRV_set # define SvRV_set(sv, val) \ STMT_START { assert(SvTYPE(sv) >= SVt_RV); \ (((XRV*) SvANY(sv))->xrv_rv = (val)); } STMT_END #endif #else #ifndef SvPVX_const # define SvPVX_const(sv) ((const char*)((sv)->sv_u.svu_pv)) #endif #ifndef SvPVX_mutable # define SvPVX_mutable(sv) ((sv)->sv_u.svu_pv) #endif #ifndef SvRV_set # define SvRV_set(sv, val) \ STMT_START { assert(SvTYPE(sv) >= SVt_RV); \ ((sv)->sv_u.svu_rv = (val)); } STMT_END #endif #endif #ifndef SvSTASH_set # define SvSTASH_set(sv, val) \ STMT_START { assert(SvTYPE(sv) >= SVt_PVMG); \ (((XPVMG*) SvANY(sv))->xmg_stash = (val)); } STMT_END #endif #if (PERL_BCDVERSION < 0x5004000) #ifndef SvUV_set # define SvUV_set(sv, val) \ STMT_START { assert(SvTYPE(sv) == SVt_IV || SvTYPE(sv) >= SVt_PVIV); \ (((XPVIV*) SvANY(sv))->xiv_iv = (IV) (val)); } STMT_END #endif #else #ifndef SvUV_set # define SvUV_set(sv, val) \ STMT_START { assert(SvTYPE(sv) == SVt_IV || SvTYPE(sv) >= SVt_PVIV); \ (((XPVUV*) SvANY(sv))->xuv_uv = (val)); } STMT_END #endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(vnewSVpvf) #if defined(NEED_vnewSVpvf) static SV * DPPP_(my_vnewSVpvf)(pTHX_ const char *pat, va_list *args); static #else extern SV * DPPP_(my_vnewSVpvf)(pTHX_ const char *pat, va_list *args); #endif #if defined(NEED_vnewSVpvf) || defined(NEED_vnewSVpvf_GLOBAL) #ifdef vnewSVpvf # undef vnewSVpvf #endif #define vnewSVpvf(a,b) DPPP_(my_vnewSVpvf)(aTHX_ a,b) #define Perl_vnewSVpvf DPPP_(my_vnewSVpvf) SV * DPPP_(my_vnewSVpvf)(pTHX_ const char *pat, va_list *args) { register SV *sv = newSV(0); sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)); return sv; } #endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_vcatpvf) # define sv_vcatpvf(sv, pat, args) sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)) #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_vsetpvf) # define sv_vsetpvf(sv, pat, args) sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)) #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_catpvf_mg) #if defined(NEED_sv_catpvf_mg) static void DPPP_(my_sv_catpvf_mg)(pTHX_ SV *sv, const char *pat, ...); static #else extern void DPPP_(my_sv_catpvf_mg)(pTHX_ SV *sv, const char *pat, ...); #endif #if defined(NEED_sv_catpvf_mg) || defined(NEED_sv_catpvf_mg_GLOBAL) #define Perl_sv_catpvf_mg DPPP_(my_sv_catpvf_mg) void DPPP_(my_sv_catpvf_mg)(pTHX_ SV *sv, const char *pat, ...) { va_list args; va_start(args, pat); sv_vcatpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*)); SvSETMAGIC(sv); va_end(args); } #endif #endif #ifdef PERL_IMPLICIT_CONTEXT #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_catpvf_mg_nocontext) #if defined(NEED_sv_catpvf_mg_nocontext) static void DPPP_(my_sv_catpvf_mg_nocontext)(SV *sv, const char *pat, ...); static #else extern void DPPP_(my_sv_catpvf_mg_nocontext)(SV *sv, const char *pat, ...); #endif #if defined(NEED_sv_catpvf_mg_nocontext) || defined(NEED_sv_catpvf_mg_nocontext_GLOBAL) #define sv_catpvf_mg_nocontext DPPP_(my_sv_catpvf_mg_nocontext) #define Perl_sv_catpvf_mg_nocontext DPPP_(my_sv_catpvf_mg_nocontext) void DPPP_(my_sv_catpvf_mg_nocontext)(SV *sv, const char *pat, ...) { dTHX; va_list args; va_start(args, pat); sv_vcatpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*)); SvSETMAGIC(sv); va_end(args); } #endif #endif #endif /* sv_catpvf_mg depends on sv_catpvf_mg_nocontext */ #ifndef sv_catpvf_mg # ifdef PERL_IMPLICIT_CONTEXT # define sv_catpvf_mg Perl_sv_catpvf_mg_nocontext # else # define sv_catpvf_mg Perl_sv_catpvf_mg # endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_vcatpvf_mg) # define sv_vcatpvf_mg(sv, pat, args) \ STMT_START { \ sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)); \ SvSETMAGIC(sv); \ } STMT_END #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_setpvf_mg) #if defined(NEED_sv_setpvf_mg) static void DPPP_(my_sv_setpvf_mg)(pTHX_ SV *sv, const char *pat, ...); static #else extern void DPPP_(my_sv_setpvf_mg)(pTHX_ SV *sv, const char *pat, ...); #endif #if defined(NEED_sv_setpvf_mg) || defined(NEED_sv_setpvf_mg_GLOBAL) #define Perl_sv_setpvf_mg DPPP_(my_sv_setpvf_mg) void DPPP_(my_sv_setpvf_mg)(pTHX_ SV *sv, const char *pat, ...) { va_list args; va_start(args, pat); sv_vsetpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*)); SvSETMAGIC(sv); va_end(args); } #endif #endif #ifdef PERL_IMPLICIT_CONTEXT #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_setpvf_mg_nocontext) #if defined(NEED_sv_setpvf_mg_nocontext) static void DPPP_(my_sv_setpvf_mg_nocontext)(SV *sv, const char *pat, ...); static #else extern void DPPP_(my_sv_setpvf_mg_nocontext)(SV *sv, const char *pat, ...); #endif #if defined(NEED_sv_setpvf_mg_nocontext) || defined(NEED_sv_setpvf_mg_nocontext_GLOBAL) #define sv_setpvf_mg_nocontext DPPP_(my_sv_setpvf_mg_nocontext) #define Perl_sv_setpvf_mg_nocontext DPPP_(my_sv_setpvf_mg_nocontext) void DPPP_(my_sv_setpvf_mg_nocontext)(SV *sv, const char *pat, ...) { dTHX; va_list args; va_start(args, pat); sv_vsetpvfn(sv, pat, strlen(pat), &args, Null(SV**), 0, Null(bool*)); SvSETMAGIC(sv); va_end(args); } #endif #endif #endif /* sv_setpvf_mg depends on sv_setpvf_mg_nocontext */ #ifndef sv_setpvf_mg # ifdef PERL_IMPLICIT_CONTEXT # define sv_setpvf_mg Perl_sv_setpvf_mg_nocontext # else # define sv_setpvf_mg Perl_sv_setpvf_mg # endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(sv_vsetpvf_mg) # define sv_vsetpvf_mg(sv, pat, args) \ STMT_START { \ sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*)); \ SvSETMAGIC(sv); \ } STMT_END #endif /* Hint: newSVpvn_share * The SVs created by this function only mimic the behaviour of * shared PVs without really being shared. Only use if you know * what you're doing. */ #ifndef newSVpvn_share #if defined(NEED_newSVpvn_share) static SV * DPPP_(my_newSVpvn_share)(pTHX_ const char *src, I32 len, U32 hash); static #else extern SV * DPPP_(my_newSVpvn_share)(pTHX_ const char *src, I32 len, U32 hash); #endif #if defined(NEED_newSVpvn_share) || defined(NEED_newSVpvn_share_GLOBAL) #ifdef newSVpvn_share # undef newSVpvn_share #endif #define newSVpvn_share(a,b,c) DPPP_(my_newSVpvn_share)(aTHX_ a,b,c) #define Perl_newSVpvn_share DPPP_(my_newSVpvn_share) SV * DPPP_(my_newSVpvn_share)(pTHX_ const char *src, I32 len, U32 hash) { SV *sv; if (len < 0) len = -len; if (!hash) PERL_HASH(hash, (char*) src, len); sv = newSVpvn((char *) src, len); sv_upgrade(sv, SVt_PVIV); SvIVX(sv) = hash; SvREADONLY_on(sv); SvPOK_on(sv); return sv; } #endif #endif #ifndef SvSHARED_HASH # define SvSHARED_HASH(sv) (0 + SvUVX(sv)) #endif #ifndef HvNAME_get # define HvNAME_get(hv) HvNAME(hv) #endif #ifndef HvNAMELEN_get # define HvNAMELEN_get(hv) (HvNAME_get(hv) ? (I32)strlen(HvNAME_get(hv)) : 0) #endif #ifndef gv_fetchpvn_flags #if defined(NEED_gv_fetchpvn_flags) static GV* DPPP_(my_gv_fetchpvn_flags)(pTHX_ const char* name, STRLEN len, int flags, int types); static #else extern GV* DPPP_(my_gv_fetchpvn_flags)(pTHX_ const char* name, STRLEN len, int flags, int types); #endif #if defined(NEED_gv_fetchpvn_flags) || defined(NEED_gv_fetchpvn_flags_GLOBAL) #ifdef gv_fetchpvn_flags # undef gv_fetchpvn_flags #endif #define gv_fetchpvn_flags(a,b,c,d) DPPP_(my_gv_fetchpvn_flags)(aTHX_ a,b,c,d) #define Perl_gv_fetchpvn_flags DPPP_(my_gv_fetchpvn_flags) GV* DPPP_(my_gv_fetchpvn_flags)(pTHX_ const char* name, STRLEN len, int flags, int types) { char *namepv = savepvn(name, len); GV* stash = gv_fetchpv(namepv, TRUE, SVt_PVHV); Safefree(namepv); return stash; } #endif #endif #ifndef GvSVn # define GvSVn(gv) GvSV(gv) #endif #ifndef isGV_with_GP # define isGV_with_GP(gv) isGV(gv) #endif #ifndef gv_fetchsv # define gv_fetchsv(name, flags, svt) gv_fetchpv(SvPV_nolen_const(name), flags, svt) #endif #ifndef get_cvn_flags # define get_cvn_flags(name, namelen, flags) get_cv(name, flags) #endif #ifndef gv_init_pvn # define gv_init_pvn(gv, stash, ptr, len, flags) gv_init(gv, stash, ptr, len, flags & GV_ADDMULTI ? TRUE : FALSE) #endif #ifndef WARN_ALL # define WARN_ALL 0 #endif #ifndef WARN_CLOSURE # define WARN_CLOSURE 1 #endif #ifndef WARN_DEPRECATED # define WARN_DEPRECATED 2 #endif #ifndef WARN_EXITING # define WARN_EXITING 3 #endif #ifndef WARN_GLOB # define WARN_GLOB 4 #endif #ifndef WARN_IO # define WARN_IO 5 #endif #ifndef WARN_CLOSED # define WARN_CLOSED 6 #endif #ifndef WARN_EXEC # define WARN_EXEC 7 #endif #ifndef WARN_LAYER # define WARN_LAYER 8 #endif #ifndef WARN_NEWLINE # define WARN_NEWLINE 9 #endif #ifndef WARN_PIPE # define WARN_PIPE 10 #endif #ifndef WARN_UNOPENED # define WARN_UNOPENED 11 #endif #ifndef WARN_MISC # define WARN_MISC 12 #endif #ifndef WARN_NUMERIC # define WARN_NUMERIC 13 #endif #ifndef WARN_ONCE # define WARN_ONCE 14 #endif #ifndef WARN_OVERFLOW # define WARN_OVERFLOW 15 #endif #ifndef WARN_PACK # define WARN_PACK 16 #endif #ifndef WARN_PORTABLE # define WARN_PORTABLE 17 #endif #ifndef WARN_RECURSION # define WARN_RECURSION 18 #endif #ifndef WARN_REDEFINE # define WARN_REDEFINE 19 #endif #ifndef WARN_REGEXP # define WARN_REGEXP 20 #endif #ifndef WARN_SEVERE # define WARN_SEVERE 21 #endif #ifndef WARN_DEBUGGING # define WARN_DEBUGGING 22 #endif #ifndef WARN_INPLACE # define WARN_INPLACE 23 #endif #ifndef WARN_INTERNAL # define WARN_INTERNAL 24 #endif #ifndef WARN_MALLOC # define WARN_MALLOC 25 #endif #ifndef WARN_SIGNAL # define WARN_SIGNAL 26 #endif #ifndef WARN_SUBSTR # define WARN_SUBSTR 27 #endif #ifndef WARN_SYNTAX # define WARN_SYNTAX 28 #endif #ifndef WARN_AMBIGUOUS # define WARN_AMBIGUOUS 29 #endif #ifndef WARN_BAREWORD # define WARN_BAREWORD 30 #endif #ifndef WARN_DIGIT # define WARN_DIGIT 31 #endif #ifndef WARN_PARENTHESIS # define WARN_PARENTHESIS 32 #endif #ifndef WARN_PRECEDENCE # define WARN_PRECEDENCE 33 #endif #ifndef WARN_PRINTF # define WARN_PRINTF 34 #endif #ifndef WARN_PROTOTYPE # define WARN_PROTOTYPE 35 #endif #ifndef WARN_QW # define WARN_QW 36 #endif #ifndef WARN_RESERVED # define WARN_RESERVED 37 #endif #ifndef WARN_SEMICOLON # define WARN_SEMICOLON 38 #endif #ifndef WARN_TAINT # define WARN_TAINT 39 #endif #ifndef WARN_THREADS # define WARN_THREADS 40 #endif #ifndef WARN_UNINITIALIZED # define WARN_UNINITIALIZED 41 #endif #ifndef WARN_UNPACK # define WARN_UNPACK 42 #endif #ifndef WARN_UNTIE # define WARN_UNTIE 43 #endif #ifndef WARN_UTF8 # define WARN_UTF8 44 #endif #ifndef WARN_VOID # define WARN_VOID 45 #endif #ifndef WARN_ASSERTIONS # define WARN_ASSERTIONS 46 #endif #ifndef packWARN # define packWARN(a) (a) #endif #ifndef ckWARN # ifdef G_WARN_ON # define ckWARN(a) (PL_dowarn & G_WARN_ON) # else # define ckWARN(a) PL_dowarn # endif #endif #if (PERL_BCDVERSION >= 0x5004000) && !defined(warner) #if defined(NEED_warner) static void DPPP_(my_warner)(U32 err, const char *pat, ...); static #else extern void DPPP_(my_warner)(U32 err, const char *pat, ...); #endif #if defined(NEED_warner) || defined(NEED_warner_GLOBAL) #define Perl_warner DPPP_(my_warner) void DPPP_(my_warner)(U32 err, const char *pat, ...) { SV *sv; va_list args; PERL_UNUSED_ARG(err); va_start(args, pat); sv = vnewSVpvf(pat, &args); va_end(args); sv_2mortal(sv); warn("%s", SvPV_nolen(sv)); } #define warner Perl_warner #define Perl_warner_nocontext Perl_warner #endif #endif /* concatenating with "" ensures that only literal strings are accepted as argument * note that STR_WITH_LEN() can't be used as argument to macros or functions that * under some configurations might be macros */ #ifndef STR_WITH_LEN # define STR_WITH_LEN(s) (s ""), (sizeof(s)-1) #endif #ifndef newSVpvs # define newSVpvs(str) newSVpvn(str "", sizeof(str) - 1) #endif #ifndef newSVpvs_flags # define newSVpvs_flags(str, flags) newSVpvn_flags(str "", sizeof(str) - 1, flags) #endif #ifndef newSVpvs_share # define newSVpvs_share(str) newSVpvn_share(str "", sizeof(str) - 1, 0) #endif #ifndef sv_catpvs # define sv_catpvs(sv, str) sv_catpvn(sv, str "", sizeof(str) - 1) #endif #ifndef sv_setpvs # define sv_setpvs(sv, str) sv_setpvn(sv, str "", sizeof(str) - 1) #endif #ifndef hv_fetchs # define hv_fetchs(hv, key, lval) hv_fetch(hv, key "", sizeof(key) - 1, lval) #endif #ifndef hv_stores # define hv_stores(hv, key, val) hv_store(hv, key "", sizeof(key) - 1, val, 0) #endif #ifndef gv_fetchpvs # define gv_fetchpvs(name, flags, svt) gv_fetchpvn_flags(name "", sizeof(name) - 1, flags, svt) #endif #ifndef gv_stashpvs # define gv_stashpvs(name, flags) gv_stashpvn(name "", sizeof(name) - 1, flags) #endif #ifndef get_cvs # define get_cvs(name, flags) get_cvn_flags(name "", sizeof(name)-1, flags) #endif #ifndef SvGETMAGIC # define SvGETMAGIC(x) STMT_START { if (SvGMAGICAL(x)) mg_get(x); } STMT_END #endif /* That's the best we can do... */ #ifndef sv_catpvn_nomg # define sv_catpvn_nomg sv_catpvn #endif #ifndef sv_catsv_nomg # define sv_catsv_nomg sv_catsv #endif #ifndef sv_setsv_nomg # define sv_setsv_nomg sv_setsv #endif #ifndef sv_pvn_nomg # define sv_pvn_nomg sv_pvn #endif #ifndef SvIV_nomg # define SvIV_nomg SvIV #endif #ifndef SvUV_nomg # define SvUV_nomg SvUV #endif #ifndef sv_catpv_mg # define sv_catpv_mg(sv, ptr) \ STMT_START { \ SV *TeMpSv = sv; \ sv_catpv(TeMpSv,ptr); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_catpvn_mg # define sv_catpvn_mg(sv, ptr, len) \ STMT_START { \ SV *TeMpSv = sv; \ sv_catpvn(TeMpSv,ptr,len); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_catsv_mg # define sv_catsv_mg(dsv, ssv) \ STMT_START { \ SV *TeMpSv = dsv; \ sv_catsv(TeMpSv,ssv); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setiv_mg # define sv_setiv_mg(sv, i) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setiv(TeMpSv,i); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setnv_mg # define sv_setnv_mg(sv, num) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setnv(TeMpSv,num); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setpv_mg # define sv_setpv_mg(sv, ptr) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setpv(TeMpSv,ptr); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setpvn_mg # define sv_setpvn_mg(sv, ptr, len) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setpvn(TeMpSv,ptr,len); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setsv_mg # define sv_setsv_mg(dsv, ssv) \ STMT_START { \ SV *TeMpSv = dsv; \ sv_setsv(TeMpSv,ssv); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_setuv_mg # define sv_setuv_mg(sv, i) \ STMT_START { \ SV *TeMpSv = sv; \ sv_setuv(TeMpSv,i); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef sv_usepvn_mg # define sv_usepvn_mg(sv, ptr, len) \ STMT_START { \ SV *TeMpSv = sv; \ sv_usepvn(TeMpSv,ptr,len); \ SvSETMAGIC(TeMpSv); \ } STMT_END #endif #ifndef SvVSTRING_mg # define SvVSTRING_mg(sv) (SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_vstring) : NULL) #endif /* Hint: sv_magic_portable * This is a compatibility function that is only available with * Devel::PPPort. It is NOT in the perl core. * Its purpose is to mimic the 5.8.0 behaviour of sv_magic() when * it is being passed a name pointer with namlen == 0. In that * case, perl 5.8.0 and later store the pointer, not a copy of it. * The compatibility can be provided back to perl 5.004. With * earlier versions, the code will not compile. */ #if (PERL_BCDVERSION < 0x5004000) /* code that uses sv_magic_portable will not compile */ #elif (PERL_BCDVERSION < 0x5008000) # define sv_magic_portable(sv, obj, how, name, namlen) \ STMT_START { \ SV *SvMp_sv = (sv); \ char *SvMp_name = (char *) (name); \ I32 SvMp_namlen = (namlen); \ if (SvMp_name && SvMp_namlen == 0) \ { \ MAGIC *mg; \ sv_magic(SvMp_sv, obj, how, 0, 0); \ mg = SvMAGIC(SvMp_sv); \ mg->mg_len = -42; /* XXX: this is the tricky part */ \ mg->mg_ptr = SvMp_name; \ } \ else \ { \ sv_magic(SvMp_sv, obj, how, SvMp_name, SvMp_namlen); \ } \ } STMT_END #else # define sv_magic_portable(a, b, c, d, e) sv_magic(a, b, c, d, e) #endif #if !defined(mg_findext) #if defined(NEED_mg_findext) static MAGIC * DPPP_(my_mg_findext)(SV * sv, int type, const MGVTBL *vtbl); static #else extern MAGIC * DPPP_(my_mg_findext)(SV * sv, int type, const MGVTBL *vtbl); #endif #if defined(NEED_mg_findext) || defined(NEED_mg_findext_GLOBAL) #define mg_findext DPPP_(my_mg_findext) #define Perl_mg_findext DPPP_(my_mg_findext) MAGIC * DPPP_(my_mg_findext)(SV * sv, int type, const MGVTBL *vtbl) { if (sv) { MAGIC *mg; #ifdef AvPAD_NAMELIST assert(!(SvTYPE(sv) == SVt_PVAV && AvPAD_NAMELIST(sv))); #endif for (mg = SvMAGIC (sv); mg; mg = mg->mg_moremagic) { if (mg->mg_type == type && mg->mg_virtual == vtbl) return mg; } } return NULL; } #endif #endif #if !defined(sv_unmagicext) #if defined(NEED_sv_unmagicext) static int DPPP_(my_sv_unmagicext)(pTHX_ SV * const sv, const int type, MGVTBL * vtbl); static #else extern int DPPP_(my_sv_unmagicext)(pTHX_ SV * const sv, const int type, MGVTBL * vtbl); #endif #if defined(NEED_sv_unmagicext) || defined(NEED_sv_unmagicext_GLOBAL) #ifdef sv_unmagicext # undef sv_unmagicext #endif #define sv_unmagicext(a,b,c) DPPP_(my_sv_unmagicext)(aTHX_ a,b,c) #define Perl_sv_unmagicext DPPP_(my_sv_unmagicext) int DPPP_(my_sv_unmagicext)(pTHX_ SV *const sv, const int type, MGVTBL *vtbl) { MAGIC* mg; MAGIC** mgp; if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv)) return 0; mgp = &(SvMAGIC(sv)); for (mg = *mgp; mg; mg = *mgp) { const MGVTBL* const virt = mg->mg_virtual; if (mg->mg_type == type && virt == vtbl) { *mgp = mg->mg_moremagic; if (virt && virt->svt_free) virt->svt_free(aTHX_ sv, mg); if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) { if (mg->mg_len > 0) Safefree(mg->mg_ptr); else if (mg->mg_len == HEf_SVKEY) /* Questionable on older perls... */ SvREFCNT_dec(MUTABLE_SV(mg->mg_ptr)); else if (mg->mg_type == PERL_MAGIC_utf8) Safefree(mg->mg_ptr); } if (mg->mg_flags & MGf_REFCOUNTED) SvREFCNT_dec(mg->mg_obj); Safefree(mg); } else mgp = &mg->mg_moremagic; } if (SvMAGIC(sv)) { if (SvMAGICAL(sv)) /* if we're under save_magic, wait for restore_magic; */ mg_magical(sv); /* else fix the flags now */ } else { SvMAGICAL_off(sv); SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT; } return 0; } #endif #endif #ifdef USE_ITHREADS #ifndef CopFILE # define CopFILE(c) ((c)->cop_file) #endif #ifndef CopFILEGV # define CopFILEGV(c) (CopFILE(c) ? gv_fetchfile(CopFILE(c)) : Nullgv) #endif #ifndef CopFILE_set # define CopFILE_set(c,pv) ((c)->cop_file = savepv(pv)) #endif #ifndef CopFILESV # define CopFILESV(c) (CopFILE(c) ? GvSV(gv_fetchfile(CopFILE(c))) : Nullsv) #endif #ifndef CopFILEAV # define CopFILEAV(c) (CopFILE(c) ? GvAV(gv_fetchfile(CopFILE(c))) : Nullav) #endif #ifndef CopSTASHPV # define CopSTASHPV(c) ((c)->cop_stashpv) #endif #ifndef CopSTASHPV_set # define CopSTASHPV_set(c,pv) ((c)->cop_stashpv = ((pv) ? savepv(pv) : Nullch)) #endif #ifndef CopSTASH # define CopSTASH(c) (CopSTASHPV(c) ? gv_stashpv(CopSTASHPV(c),GV_ADD) : Nullhv) #endif #ifndef CopSTASH_set # define CopSTASH_set(c,hv) CopSTASHPV_set(c, (hv) ? HvNAME(hv) : Nullch) #endif #ifndef CopSTASH_eq # define CopSTASH_eq(c,hv) ((hv) && (CopSTASHPV(c) == HvNAME(hv) \ || (CopSTASHPV(c) && HvNAME(hv) \ && strEQ(CopSTASHPV(c), HvNAME(hv))))) #endif #else #ifndef CopFILEGV # define CopFILEGV(c) ((c)->cop_filegv) #endif #ifndef CopFILEGV_set # define CopFILEGV_set(c,gv) ((c)->cop_filegv = (GV*)SvREFCNT_inc(gv)) #endif #ifndef CopFILE_set # define CopFILE_set(c,pv) CopFILEGV_set((c), gv_fetchfile(pv)) #endif #ifndef CopFILESV # define CopFILESV(c) (CopFILEGV(c) ? GvSV(CopFILEGV(c)) : Nullsv) #endif #ifndef CopFILEAV # define CopFILEAV(c) (CopFILEGV(c) ? GvAV(CopFILEGV(c)) : Nullav) #endif #ifndef CopFILE # define CopFILE(c) (CopFILESV(c) ? SvPVX(CopFILESV(c)) : Nullch) #endif #ifndef CopSTASH # define CopSTASH(c) ((c)->cop_stash) #endif #ifndef CopSTASH_set # define CopSTASH_set(c,hv) ((c)->cop_stash = (hv)) #endif #ifndef CopSTASHPV # define CopSTASHPV(c) (CopSTASH(c) ? HvNAME(CopSTASH(c)) : Nullch) #endif #ifndef CopSTASHPV_set # define CopSTASHPV_set(c,pv) CopSTASH_set((c), gv_stashpv(pv,GV_ADD)) #endif #ifndef CopSTASH_eq # define CopSTASH_eq(c,hv) (CopSTASH(c) == (hv)) #endif #endif /* USE_ITHREADS */ #if (PERL_BCDVERSION >= 0x5006000) #ifndef caller_cx # if defined(NEED_caller_cx) || defined(NEED_caller_cx_GLOBAL) static I32 DPPP_dopoptosub_at(const PERL_CONTEXT *cxstk, I32 startingblock) { I32 i; for (i = startingblock; i >= 0; i--) { register const PERL_CONTEXT * const cx = &cxstk[i]; switch (CxTYPE(cx)) { default: continue; case CXt_EVAL: case CXt_SUB: case CXt_FORMAT: return i; } } return i; } # endif # if defined(NEED_caller_cx) static const PERL_CONTEXT * DPPP_(my_caller_cx)(pTHX_ I32 count, const PERL_CONTEXT **dbcxp); static #else extern const PERL_CONTEXT * DPPP_(my_caller_cx)(pTHX_ I32 count, const PERL_CONTEXT **dbcxp); #endif #if defined(NEED_caller_cx) || defined(NEED_caller_cx_GLOBAL) #ifdef caller_cx # undef caller_cx #endif #define caller_cx(a,b) DPPP_(my_caller_cx)(aTHX_ a,b) #define Perl_caller_cx DPPP_(my_caller_cx) const PERL_CONTEXT * DPPP_(my_caller_cx)(pTHX_ I32 count, const PERL_CONTEXT **dbcxp) { register I32 cxix = DPPP_dopoptosub_at(cxstack, cxstack_ix); register const PERL_CONTEXT *cx; register const PERL_CONTEXT *ccstack = cxstack; const PERL_SI *top_si = PL_curstackinfo; for (;;) { /* we may be in a higher stacklevel, so dig down deeper */ while (cxix < 0 && top_si->si_type != PERLSI_MAIN) { top_si = top_si->si_prev; ccstack = top_si->si_cxstack; cxix = DPPP_dopoptosub_at(ccstack, top_si->si_cxix); } if (cxix < 0) return NULL; /* caller() should not report the automatic calls to &DB::sub */ if (PL_DBsub && GvCV(PL_DBsub) && cxix >= 0 && ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub)) count++; if (!count--) break; cxix = DPPP_dopoptosub_at(ccstack, cxix - 1); } cx = &ccstack[cxix]; if (dbcxp) *dbcxp = cx; if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) { const I32 dbcxix = DPPP_dopoptosub_at(ccstack, cxix - 1); /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the field below is defined for any cx. */ /* caller() should not report the automatic calls to &DB::sub */ if (PL_DBsub && GvCV(PL_DBsub) && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub)) cx = &ccstack[dbcxix]; } return cx; } # endif #endif /* caller_cx */ #endif /* 5.6.0 */ #ifndef IN_PERL_COMPILETIME # define IN_PERL_COMPILETIME (PL_curcop == &PL_compiling) #endif #ifndef IN_LOCALE_RUNTIME # define IN_LOCALE_RUNTIME (PL_curcop->op_private & HINT_LOCALE) #endif #ifndef IN_LOCALE_COMPILETIME # define IN_LOCALE_COMPILETIME (PL_hints & HINT_LOCALE) #endif #ifndef IN_LOCALE # define IN_LOCALE (IN_PERL_COMPILETIME ? IN_LOCALE_COMPILETIME : IN_LOCALE_RUNTIME) #endif #ifndef IS_NUMBER_IN_UV # define IS_NUMBER_IN_UV 0x01 #endif #ifndef IS_NUMBER_GREATER_THAN_UV_MAX # define IS_NUMBER_GREATER_THAN_UV_MAX 0x02 #endif #ifndef IS_NUMBER_NOT_INT # define IS_NUMBER_NOT_INT 0x04 #endif #ifndef IS_NUMBER_NEG # define IS_NUMBER_NEG 0x08 #endif #ifndef IS_NUMBER_INFINITY # define IS_NUMBER_INFINITY 0x10 #endif #ifndef IS_NUMBER_NAN # define IS_NUMBER_NAN 0x20 #endif #ifndef GROK_NUMERIC_RADIX # define GROK_NUMERIC_RADIX(sp, send) grok_numeric_radix(sp, send) #endif #ifndef PERL_SCAN_GREATER_THAN_UV_MAX # define PERL_SCAN_GREATER_THAN_UV_MAX 0x02 #endif #ifndef PERL_SCAN_SILENT_ILLDIGIT # define PERL_SCAN_SILENT_ILLDIGIT 0x04 #endif #ifndef PERL_SCAN_ALLOW_UNDERSCORES # define PERL_SCAN_ALLOW_UNDERSCORES 0x01 #endif #ifndef PERL_SCAN_DISALLOW_PREFIX # define PERL_SCAN_DISALLOW_PREFIX 0x02 #endif #ifndef grok_numeric_radix #if defined(NEED_grok_numeric_radix) static bool DPPP_(my_grok_numeric_radix)(pTHX_ const char ** sp, const char * send); static #else extern bool DPPP_(my_grok_numeric_radix)(pTHX_ const char ** sp, const char * send); #endif #if defined(NEED_grok_numeric_radix) || defined(NEED_grok_numeric_radix_GLOBAL) #ifdef grok_numeric_radix # undef grok_numeric_radix #endif #define grok_numeric_radix(a,b) DPPP_(my_grok_numeric_radix)(aTHX_ a,b) #define Perl_grok_numeric_radix DPPP_(my_grok_numeric_radix) bool DPPP_(my_grok_numeric_radix)(pTHX_ const char **sp, const char *send) { #ifdef USE_LOCALE_NUMERIC #ifdef PL_numeric_radix_sv if (PL_numeric_radix_sv && IN_LOCALE) { STRLEN len; char* radix = SvPV(PL_numeric_radix_sv, len); if (*sp + len <= send && memEQ(*sp, radix, len)) { *sp += len; return TRUE; } } #else /* older perls don't have PL_numeric_radix_sv so the radix * must manually be requested from locale.h */ #include dTHR; /* needed for older threaded perls */ struct lconv *lc = localeconv(); char *radix = lc->decimal_point; if (radix && IN_LOCALE) { STRLEN len = strlen(radix); if (*sp + len <= send && memEQ(*sp, radix, len)) { *sp += len; return TRUE; } } #endif #endif /* USE_LOCALE_NUMERIC */ /* always try "." if numeric radix didn't match because * we may have data from different locales mixed */ if (*sp < send && **sp == '.') { ++*sp; return TRUE; } return FALSE; } #endif #endif #ifndef grok_number #if defined(NEED_grok_number) static int DPPP_(my_grok_number)(pTHX_ const char * pv, STRLEN len, UV * valuep); static #else extern int DPPP_(my_grok_number)(pTHX_ const char * pv, STRLEN len, UV * valuep); #endif #if defined(NEED_grok_number) || defined(NEED_grok_number_GLOBAL) #ifdef grok_number # undef grok_number #endif #define grok_number(a,b,c) DPPP_(my_grok_number)(aTHX_ a,b,c) #define Perl_grok_number DPPP_(my_grok_number) int DPPP_(my_grok_number)(pTHX_ const char *pv, STRLEN len, UV *valuep) { const char *s = pv; const char *send = pv + len; const UV max_div_10 = UV_MAX / 10; const char max_mod_10 = UV_MAX % 10; int numtype = 0; int sawinf = 0; int sawnan = 0; while (s < send && isSPACE(*s)) s++; if (s == send) { return 0; } else if (*s == '-') { s++; numtype = IS_NUMBER_NEG; } else if (*s == '+') s++; if (s == send) return 0; /* next must be digit or the radix separator or beginning of infinity */ if (isDIGIT(*s)) { /* UVs are at least 32 bits, so the first 9 decimal digits cannot overflow. */ UV value = *s - '0'; /* This construction seems to be more optimiser friendly. (without it gcc does the isDIGIT test and the *s - '0' separately) With it gcc on arm is managing 6 instructions (6 cycles) per digit. In theory the optimiser could deduce how far to unroll the loop before checking for overflow. */ if (++s < send) { int digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { digit = *s - '0'; if (digit >= 0 && digit <= 9) { value = value * 10 + digit; if (++s < send) { /* Now got 9 digits, so need to check each time for overflow. */ digit = *s - '0'; while (digit >= 0 && digit <= 9 && (value < max_div_10 || (value == max_div_10 && digit <= max_mod_10))) { value = value * 10 + digit; if (++s < send) digit = *s - '0'; else break; } if (digit >= 0 && digit <= 9 && (s < send)) { /* value overflowed. skip the remaining digits, don't worry about setting *valuep. */ do { s++; } while (s < send && isDIGIT(*s)); numtype |= IS_NUMBER_GREATER_THAN_UV_MAX; goto skip_value; } } } } } } } } } } } } } } } } } } numtype |= IS_NUMBER_IN_UV; if (valuep) *valuep = value; skip_value: if (GROK_NUMERIC_RADIX(&s, send)) { numtype |= IS_NUMBER_NOT_INT; while (s < send && isDIGIT(*s)) /* optional digits after the radix */ s++; } } else if (GROK_NUMERIC_RADIX(&s, send)) { numtype |= IS_NUMBER_NOT_INT | IS_NUMBER_IN_UV; /* valuep assigned below */ /* no digits before the radix means we need digits after it */ if (s < send && isDIGIT(*s)) { do { s++; } while (s < send && isDIGIT(*s)); if (valuep) { /* integer approximation is valid - it's 0. */ *valuep = 0; } } else return 0; } else if (*s == 'I' || *s == 'i') { s++; if (s == send || (*s != 'N' && *s != 'n')) return 0; s++; if (s == send || (*s != 'F' && *s != 'f')) return 0; s++; if (s < send && (*s == 'I' || *s == 'i')) { s++; if (s == send || (*s != 'N' && *s != 'n')) return 0; s++; if (s == send || (*s != 'I' && *s != 'i')) return 0; s++; if (s == send || (*s != 'T' && *s != 't')) return 0; s++; if (s == send || (*s != 'Y' && *s != 'y')) return 0; s++; } sawinf = 1; } else if (*s == 'N' || *s == 'n') { /* XXX TODO: There are signaling NaNs and quiet NaNs. */ s++; if (s == send || (*s != 'A' && *s != 'a')) return 0; s++; if (s == send || (*s != 'N' && *s != 'n')) return 0; s++; sawnan = 1; } else return 0; if (sawinf) { numtype &= IS_NUMBER_NEG; /* Keep track of sign */ numtype |= IS_NUMBER_INFINITY | IS_NUMBER_NOT_INT; } else if (sawnan) { numtype &= IS_NUMBER_NEG; /* Keep track of sign */ numtype |= IS_NUMBER_NAN | IS_NUMBER_NOT_INT; } else if (s < send) { /* we can have an optional exponent part */ if (*s == 'e' || *s == 'E') { /* The only flag we keep is sign. Blow away any "it's UV" */ numtype &= IS_NUMBER_NEG; numtype |= IS_NUMBER_NOT_INT; s++; if (s < send && (*s == '-' || *s == '+')) s++; if (s < send && isDIGIT(*s)) { do { s++; } while (s < send && isDIGIT(*s)); } else return 0; } } while (s < send && isSPACE(*s)) s++; if (s >= send) return numtype; if (len == 10 && memEQ(pv, "0 but true", 10)) { if (valuep) *valuep = 0; return IS_NUMBER_IN_UV; } return 0; } #endif #endif /* * The grok_* routines have been modified to use warn() instead of * Perl_warner(). Also, 'hexdigit' was the former name of PL_hexdigit, * which is why the stack variable has been renamed to 'xdigit'. */ #ifndef grok_bin #if defined(NEED_grok_bin) static UV DPPP_(my_grok_bin)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); static #else extern UV DPPP_(my_grok_bin)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); #endif #if defined(NEED_grok_bin) || defined(NEED_grok_bin_GLOBAL) #ifdef grok_bin # undef grok_bin #endif #define grok_bin(a,b,c,d) DPPP_(my_grok_bin)(aTHX_ a,b,c,d) #define Perl_grok_bin DPPP_(my_grok_bin) UV DPPP_(my_grok_bin)(pTHX_ const char *start, STRLEN *len_p, I32 *flags, NV *result) { const char *s = start; STRLEN len = *len_p; UV value = 0; NV value_nv = 0; const UV max_div_2 = UV_MAX / 2; bool allow_underscores = *flags & PERL_SCAN_ALLOW_UNDERSCORES; bool overflowed = FALSE; if (!(*flags & PERL_SCAN_DISALLOW_PREFIX)) { /* strip off leading b or 0b. for compatibility silently suffer "b" and "0b" as valid binary numbers. */ if (len >= 1) { if (s[0] == 'b') { s++; len--; } else if (len >= 2 && s[0] == '0' && s[1] == 'b') { s+=2; len-=2; } } } for (; len-- && *s; s++) { char bit = *s; if (bit == '0' || bit == '1') { /* Write it in this wonky order with a goto to attempt to get the compiler to make the common case integer-only loop pretty tight. With gcc seems to be much straighter code than old scan_bin. */ redo: if (!overflowed) { if (value <= max_div_2) { value = (value << 1) | (bit - '0'); continue; } /* Bah. We're just overflowed. */ warn("Integer overflow in binary number"); overflowed = TRUE; value_nv = (NV) value; } value_nv *= 2.0; /* If an NV has not enough bits in its mantissa to * represent a UV this summing of small low-order numbers * is a waste of time (because the NV cannot preserve * the low-order bits anyway): we could just remember when * did we overflow and in the end just multiply value_nv by the * right amount. */ value_nv += (NV)(bit - '0'); continue; } if (bit == '_' && len && allow_underscores && (bit = s[1]) && (bit == '0' || bit == '1')) { --len; ++s; goto redo; } if (!(*flags & PERL_SCAN_SILENT_ILLDIGIT)) warn("Illegal binary digit '%c' ignored", *s); break; } if ( ( overflowed && value_nv > 4294967295.0) #if UVSIZE > 4 || (!overflowed && value > 0xffffffff ) #endif ) { warn("Binary number > 0b11111111111111111111111111111111 non-portable"); } *len_p = s - start; if (!overflowed) { *flags = 0; return value; } *flags = PERL_SCAN_GREATER_THAN_UV_MAX; if (result) *result = value_nv; return UV_MAX; } #endif #endif #ifndef grok_hex #if defined(NEED_grok_hex) static UV DPPP_(my_grok_hex)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); static #else extern UV DPPP_(my_grok_hex)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); #endif #if defined(NEED_grok_hex) || defined(NEED_grok_hex_GLOBAL) #ifdef grok_hex # undef grok_hex #endif #define grok_hex(a,b,c,d) DPPP_(my_grok_hex)(aTHX_ a,b,c,d) #define Perl_grok_hex DPPP_(my_grok_hex) UV DPPP_(my_grok_hex)(pTHX_ const char *start, STRLEN *len_p, I32 *flags, NV *result) { const char *s = start; STRLEN len = *len_p; UV value = 0; NV value_nv = 0; const UV max_div_16 = UV_MAX / 16; bool allow_underscores = *flags & PERL_SCAN_ALLOW_UNDERSCORES; bool overflowed = FALSE; const char *xdigit; if (!(*flags & PERL_SCAN_DISALLOW_PREFIX)) { /* strip off leading x or 0x. for compatibility silently suffer "x" and "0x" as valid hex numbers. */ if (len >= 1) { if (s[0] == 'x') { s++; len--; } else if (len >= 2 && s[0] == '0' && s[1] == 'x') { s+=2; len-=2; } } } for (; len-- && *s; s++) { xdigit = strchr((char *) PL_hexdigit, *s); if (xdigit) { /* Write it in this wonky order with a goto to attempt to get the compiler to make the common case integer-only loop pretty tight. With gcc seems to be much straighter code than old scan_hex. */ redo: if (!overflowed) { if (value <= max_div_16) { value = (value << 4) | ((xdigit - PL_hexdigit) & 15); continue; } warn("Integer overflow in hexadecimal number"); overflowed = TRUE; value_nv = (NV) value; } value_nv *= 16.0; /* If an NV has not enough bits in its mantissa to * represent a UV this summing of small low-order numbers * is a waste of time (because the NV cannot preserve * the low-order bits anyway): we could just remember when * did we overflow and in the end just multiply value_nv by the * right amount of 16-tuples. */ value_nv += (NV)((xdigit - PL_hexdigit) & 15); continue; } if (*s == '_' && len && allow_underscores && s[1] && (xdigit = strchr((char *) PL_hexdigit, s[1]))) { --len; ++s; goto redo; } if (!(*flags & PERL_SCAN_SILENT_ILLDIGIT)) warn("Illegal hexadecimal digit '%c' ignored", *s); break; } if ( ( overflowed && value_nv > 4294967295.0) #if UVSIZE > 4 || (!overflowed && value > 0xffffffff ) #endif ) { warn("Hexadecimal number > 0xffffffff non-portable"); } *len_p = s - start; if (!overflowed) { *flags = 0; return value; } *flags = PERL_SCAN_GREATER_THAN_UV_MAX; if (result) *result = value_nv; return UV_MAX; } #endif #endif #ifndef grok_oct #if defined(NEED_grok_oct) static UV DPPP_(my_grok_oct)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); static #else extern UV DPPP_(my_grok_oct)(pTHX_ const char * start, STRLEN * len_p, I32 * flags, NV * result); #endif #if defined(NEED_grok_oct) || defined(NEED_grok_oct_GLOBAL) #ifdef grok_oct # undef grok_oct #endif #define grok_oct(a,b,c,d) DPPP_(my_grok_oct)(aTHX_ a,b,c,d) #define Perl_grok_oct DPPP_(my_grok_oct) UV DPPP_(my_grok_oct)(pTHX_ const char *start, STRLEN *len_p, I32 *flags, NV *result) { const char *s = start; STRLEN len = *len_p; UV value = 0; NV value_nv = 0; const UV max_div_8 = UV_MAX / 8; bool allow_underscores = *flags & PERL_SCAN_ALLOW_UNDERSCORES; bool overflowed = FALSE; for (; len-- && *s; s++) { /* gcc 2.95 optimiser not smart enough to figure that this subtraction out front allows slicker code. */ int digit = *s - '0'; if (digit >= 0 && digit <= 7) { /* Write it in this wonky order with a goto to attempt to get the compiler to make the common case integer-only loop pretty tight. */ redo: if (!overflowed) { if (value <= max_div_8) { value = (value << 3) | digit; continue; } /* Bah. We're just overflowed. */ warn("Integer overflow in octal number"); overflowed = TRUE; value_nv = (NV) value; } value_nv *= 8.0; /* If an NV has not enough bits in its mantissa to * represent a UV this summing of small low-order numbers * is a waste of time (because the NV cannot preserve * the low-order bits anyway): we could just remember when * did we overflow and in the end just multiply value_nv by the * right amount of 8-tuples. */ value_nv += (NV)digit; continue; } if (digit == ('_' - '0') && len && allow_underscores && (digit = s[1] - '0') && (digit >= 0 && digit <= 7)) { --len; ++s; goto redo; } /* Allow \octal to work the DWIM way (that is, stop scanning * as soon as non-octal characters are seen, complain only iff * someone seems to want to use the digits eight and nine). */ if (digit == 8 || digit == 9) { if (!(*flags & PERL_SCAN_SILENT_ILLDIGIT)) warn("Illegal octal digit '%c' ignored", *s); } break; } if ( ( overflowed && value_nv > 4294967295.0) #if UVSIZE > 4 || (!overflowed && value > 0xffffffff ) #endif ) { warn("Octal number > 037777777777 non-portable"); } *len_p = s - start; if (!overflowed) { *flags = 0; return value; } *flags = PERL_SCAN_GREATER_THAN_UV_MAX; if (result) *result = value_nv; return UV_MAX; } #endif #endif #if !defined(my_snprintf) #if defined(NEED_my_snprintf) static int DPPP_(my_my_snprintf)(char * buffer, const Size_t len, const char * format, ...); static #else extern int DPPP_(my_my_snprintf)(char * buffer, const Size_t len, const char * format, ...); #endif #if defined(NEED_my_snprintf) || defined(NEED_my_snprintf_GLOBAL) #define my_snprintf DPPP_(my_my_snprintf) #define Perl_my_snprintf DPPP_(my_my_snprintf) int DPPP_(my_my_snprintf)(char *buffer, const Size_t len, const char *format, ...) { dTHX; int retval; va_list ap; va_start(ap, format); #ifdef HAS_VSNPRINTF retval = vsnprintf(buffer, len, format, ap); #else retval = vsprintf(buffer, format, ap); #endif va_end(ap); if (retval < 0 || (len > 0 && (Size_t)retval >= len)) Perl_croak(aTHX_ "panic: my_snprintf buffer overflow"); return retval; } #endif #endif #if !defined(my_sprintf) #if defined(NEED_my_sprintf) static int DPPP_(my_my_sprintf)(char * buffer, const char * pat, ...); static #else extern int DPPP_(my_my_sprintf)(char * buffer, const char * pat, ...); #endif #if defined(NEED_my_sprintf) || defined(NEED_my_sprintf_GLOBAL) #define my_sprintf DPPP_(my_my_sprintf) #define Perl_my_sprintf DPPP_(my_my_sprintf) int DPPP_(my_my_sprintf)(char *buffer, const char* pat, ...) { va_list args; va_start(args, pat); vsprintf(buffer, pat, args); va_end(args); return strlen(buffer); } #endif #endif #ifdef NO_XSLOCKS # ifdef dJMPENV # define dXCPT dJMPENV; int rEtV = 0 # define XCPT_TRY_START JMPENV_PUSH(rEtV); if (rEtV == 0) # define XCPT_TRY_END JMPENV_POP; # define XCPT_CATCH if (rEtV != 0) # define XCPT_RETHROW JMPENV_JUMP(rEtV) # else # define dXCPT Sigjmp_buf oldTOP; int rEtV = 0 # define XCPT_TRY_START Copy(top_env, oldTOP, 1, Sigjmp_buf); rEtV = Sigsetjmp(top_env, 1); if (rEtV == 0) # define XCPT_TRY_END Copy(oldTOP, top_env, 1, Sigjmp_buf); # define XCPT_CATCH if (rEtV != 0) # define XCPT_RETHROW Siglongjmp(top_env, rEtV) # endif #endif #if !defined(my_strlcat) #if defined(NEED_my_strlcat) static Size_t DPPP_(my_my_strlcat)(char * dst, const char * src, Size_t size); static #else extern Size_t DPPP_(my_my_strlcat)(char * dst, const char * src, Size_t size); #endif #if defined(NEED_my_strlcat) || defined(NEED_my_strlcat_GLOBAL) #define my_strlcat DPPP_(my_my_strlcat) #define Perl_my_strlcat DPPP_(my_my_strlcat) Size_t DPPP_(my_my_strlcat)(char *dst, const char *src, Size_t size) { Size_t used, length, copy; used = strlen(dst); length = strlen(src); if (size > 0 && used < size - 1) { copy = (length >= size - used) ? size - used - 1 : length; memcpy(dst + used, src, copy); dst[used + copy] = '\0'; } return used + length; } #endif #endif #if !defined(my_strlcpy) #if defined(NEED_my_strlcpy) static Size_t DPPP_(my_my_strlcpy)(char * dst, const char * src, Size_t size); static #else extern Size_t DPPP_(my_my_strlcpy)(char * dst, const char * src, Size_t size); #endif #if defined(NEED_my_strlcpy) || defined(NEED_my_strlcpy_GLOBAL) #define my_strlcpy DPPP_(my_my_strlcpy) #define Perl_my_strlcpy DPPP_(my_my_strlcpy) Size_t DPPP_(my_my_strlcpy)(char *dst, const char *src, Size_t size) { Size_t length, copy; length = strlen(src); if (size > 0) { copy = (length >= size) ? size - 1 : length; memcpy(dst, src, copy); dst[copy] = '\0'; } return length; } #endif #endif #ifndef PERL_PV_ESCAPE_QUOTE # define PERL_PV_ESCAPE_QUOTE 0x0001 #endif #ifndef PERL_PV_PRETTY_QUOTE # define PERL_PV_PRETTY_QUOTE PERL_PV_ESCAPE_QUOTE #endif #ifndef PERL_PV_PRETTY_ELLIPSES # define PERL_PV_PRETTY_ELLIPSES 0x0002 #endif #ifndef PERL_PV_PRETTY_LTGT # define PERL_PV_PRETTY_LTGT 0x0004 #endif #ifndef PERL_PV_ESCAPE_FIRSTCHAR # define PERL_PV_ESCAPE_FIRSTCHAR 0x0008 #endif #ifndef PERL_PV_ESCAPE_UNI # define PERL_PV_ESCAPE_UNI 0x0100 #endif #ifndef PERL_PV_ESCAPE_UNI_DETECT # define PERL_PV_ESCAPE_UNI_DETECT 0x0200 #endif #ifndef PERL_PV_ESCAPE_ALL # define PERL_PV_ESCAPE_ALL 0x1000 #endif #ifndef PERL_PV_ESCAPE_NOBACKSLASH # define PERL_PV_ESCAPE_NOBACKSLASH 0x2000 #endif #ifndef PERL_PV_ESCAPE_NOCLEAR # define PERL_PV_ESCAPE_NOCLEAR 0x4000 #endif #ifndef PERL_PV_ESCAPE_RE # define PERL_PV_ESCAPE_RE 0x8000 #endif #ifndef PERL_PV_PRETTY_NOCLEAR # define PERL_PV_PRETTY_NOCLEAR PERL_PV_ESCAPE_NOCLEAR #endif #ifndef PERL_PV_PRETTY_DUMP # define PERL_PV_PRETTY_DUMP PERL_PV_PRETTY_ELLIPSES|PERL_PV_PRETTY_QUOTE #endif #ifndef PERL_PV_PRETTY_REGPROP # define PERL_PV_PRETTY_REGPROP PERL_PV_PRETTY_ELLIPSES|PERL_PV_PRETTY_LTGT|PERL_PV_ESCAPE_RE #endif /* Hint: pv_escape * Note that unicode functionality is only backported to * those perl versions that support it. For older perl * versions, the implementation will fall back to bytes. */ #ifndef pv_escape #if defined(NEED_pv_escape) static char * DPPP_(my_pv_escape)(pTHX_ SV * dsv, char const * const str, const STRLEN count, const STRLEN max, STRLEN * const escaped, const U32 flags); static #else extern char * DPPP_(my_pv_escape)(pTHX_ SV * dsv, char const * const str, const STRLEN count, const STRLEN max, STRLEN * const escaped, const U32 flags); #endif #if defined(NEED_pv_escape) || defined(NEED_pv_escape_GLOBAL) #ifdef pv_escape # undef pv_escape #endif #define pv_escape(a,b,c,d,e,f) DPPP_(my_pv_escape)(aTHX_ a,b,c,d,e,f) #define Perl_pv_escape DPPP_(my_pv_escape) char * DPPP_(my_pv_escape)(pTHX_ SV *dsv, char const * const str, const STRLEN count, const STRLEN max, STRLEN * const escaped, const U32 flags) { const char esc = flags & PERL_PV_ESCAPE_RE ? '%' : '\\'; const char dq = flags & PERL_PV_ESCAPE_QUOTE ? '"' : esc; char octbuf[32] = "%123456789ABCDF"; STRLEN wrote = 0; STRLEN chsize = 0; STRLEN readsize = 1; #if defined(is_utf8_string) && defined(utf8_to_uvchr) bool isuni = flags & PERL_PV_ESCAPE_UNI ? 1 : 0; #endif const char *pv = str; const char * const end = pv + count; octbuf[0] = esc; if (!(flags & PERL_PV_ESCAPE_NOCLEAR)) sv_setpvs(dsv, ""); #if defined(is_utf8_string) && defined(utf8_to_uvchr) if ((flags & PERL_PV_ESCAPE_UNI_DETECT) && is_utf8_string((U8*)pv, count)) isuni = 1; #endif for (; pv < end && (!max || wrote < max) ; pv += readsize) { const UV u = #if defined(is_utf8_string) && defined(utf8_to_uvchr) isuni ? utf8_to_uvchr((U8*)pv, &readsize) : #endif (U8)*pv; const U8 c = (U8)u & 0xFF; if (u > 255 || (flags & PERL_PV_ESCAPE_ALL)) { if (flags & PERL_PV_ESCAPE_FIRSTCHAR) chsize = my_snprintf(octbuf, sizeof octbuf, "%" UVxf, u); else chsize = my_snprintf(octbuf, sizeof octbuf, "%cx{%" UVxf "}", esc, u); } else if (flags & PERL_PV_ESCAPE_NOBACKSLASH) { chsize = 1; } else { if (c == dq || c == esc || !isPRINT(c)) { chsize = 2; switch (c) { case '\\' : /* fallthrough */ case '%' : if (c == esc) octbuf[1] = esc; else chsize = 1; break; case '\v' : octbuf[1] = 'v'; break; case '\t' : octbuf[1] = 't'; break; case '\r' : octbuf[1] = 'r'; break; case '\n' : octbuf[1] = 'n'; break; case '\f' : octbuf[1] = 'f'; break; case '"' : if (dq == '"') octbuf[1] = '"'; else chsize = 1; break; default: chsize = my_snprintf(octbuf, sizeof octbuf, pv < end && isDIGIT((U8)*(pv+readsize)) ? "%c%03o" : "%c%o", esc, c); } } else { chsize = 1; } } if (max && wrote + chsize > max) { break; } else if (chsize > 1) { sv_catpvn(dsv, octbuf, chsize); wrote += chsize; } else { char tmp[2]; my_snprintf(tmp, sizeof tmp, "%c", c); sv_catpvn(dsv, tmp, 1); wrote++; } if (flags & PERL_PV_ESCAPE_FIRSTCHAR) break; } if (escaped != NULL) *escaped= pv - str; return SvPVX(dsv); } #endif #endif #ifndef pv_pretty #if defined(NEED_pv_pretty) static char * DPPP_(my_pv_pretty)(pTHX_ SV * dsv, char const * const str, const STRLEN count, const STRLEN max, char const * const start_color, char const * const end_color, const U32 flags); static #else extern char * DPPP_(my_pv_pretty)(pTHX_ SV * dsv, char const * const str, const STRLEN count, const STRLEN max, char const * const start_color, char const * const end_color, const U32 flags); #endif #if defined(NEED_pv_pretty) || defined(NEED_pv_pretty_GLOBAL) #ifdef pv_pretty # undef pv_pretty #endif #define pv_pretty(a,b,c,d,e,f,g) DPPP_(my_pv_pretty)(aTHX_ a,b,c,d,e,f,g) #define Perl_pv_pretty DPPP_(my_pv_pretty) char * DPPP_(my_pv_pretty)(pTHX_ SV *dsv, char const * const str, const STRLEN count, const STRLEN max, char const * const start_color, char const * const end_color, const U32 flags) { const U8 dq = (flags & PERL_PV_PRETTY_QUOTE) ? '"' : '%'; STRLEN escaped; if (!(flags & PERL_PV_PRETTY_NOCLEAR)) sv_setpvs(dsv, ""); if (dq == '"') sv_catpvs(dsv, "\""); else if (flags & PERL_PV_PRETTY_LTGT) sv_catpvs(dsv, "<"); if (start_color != NULL) sv_catpv(dsv, D_PPP_CONSTPV_ARG(start_color)); pv_escape(dsv, str, count, max, &escaped, flags | PERL_PV_ESCAPE_NOCLEAR); if (end_color != NULL) sv_catpv(dsv, D_PPP_CONSTPV_ARG(end_color)); if (dq == '"') sv_catpvs(dsv, "\""); else if (flags & PERL_PV_PRETTY_LTGT) sv_catpvs(dsv, ">"); if ((flags & PERL_PV_PRETTY_ELLIPSES) && escaped < count) sv_catpvs(dsv, "..."); return SvPVX(dsv); } #endif #endif #ifndef pv_display #if defined(NEED_pv_display) static char * DPPP_(my_pv_display)(pTHX_ SV * dsv, const char * pv, STRLEN cur, STRLEN len, STRLEN pvlim); static #else extern char * DPPP_(my_pv_display)(pTHX_ SV * dsv, const char * pv, STRLEN cur, STRLEN len, STRLEN pvlim); #endif #if defined(NEED_pv_display) || defined(NEED_pv_display_GLOBAL) #ifdef pv_display # undef pv_display #endif #define pv_display(a,b,c,d,e) DPPP_(my_pv_display)(aTHX_ a,b,c,d,e) #define Perl_pv_display DPPP_(my_pv_display) char * DPPP_(my_pv_display)(pTHX_ SV *dsv, const char *pv, STRLEN cur, STRLEN len, STRLEN pvlim) { pv_pretty(dsv, pv, cur, pvlim, NULL, NULL, PERL_PV_PRETTY_DUMP); if (len > cur && pv[cur] == '\0') sv_catpvs(dsv, "\\0"); return SvPVX(dsv); } #endif #endif #endif /* _P_P_PORTABILITY_H_ */ /* End of File ppport.h */ BSON-XS-v0.8.2/t/000755 000766 000024 00000000000 13572251451 013503 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/xt/000755 000766 000024 00000000000 13572251451 013673 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/README000644 000766 000024 00000002543 13572251451 014124 0ustar00davidstaff000000 000000 NAME BSON::XS - XS implementation of MongoDB's BSON serialization VERSION version v0.8.2 END OF LIFE NOTICE Version v0.8.0 is the final feature release of the MongoDB BSON::XS library. The library is now in a 12-month "sunset" period and will receive security patches and critical bug fixes only. The BSON::XS library will be end-of-life and unsupported on August 13, 2020. DESCRIPTION This module contains an XS implementation for BSON encoding and decoding. There is no public API. Use the BSON module and it will choose the best implementation for you. SUPPORT Bugs / Feature Requests Please report any bugs or feature requests through the issue tracker at . You will be notified automatically of any progress on your issue. Source Code This is open source software. The code repository is available for public review and contribution under the terms of the license. git clone https://github.com/mongodb/mongo-perl-bson-xs.git AUTHOR David Golden CONTRIBUTOR Paul "LeoNerd" Evans COPYRIGHT AND LICENSE This software is Copyright (c) 2019 by MongoDB, Inc. This is free software, licensed under: The Apache License, Version 2.0, January 2004 BSON-XS-v0.8.2/xs/000755 000766 000024 00000000000 13572251451 013672 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/testing/000755 000766 000024 00000000000 13572251451 014715 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/META.yml000644 000766 000024 00000003033 13572251451 014510 0ustar00davidstaff000000 000000 --- abstract: "XS implementation of MongoDB's BSON serialization" author: - 'David Golden ' build_requires: B: '0' BSON: '1.012000' BSON::OID: '0' BSON::Types: '0' Carp: '0' Data::Dumper: '0' Devel::Peek: '0' Exporter: '0' ExtUtils::MakeMaker: '0' File::Spec: '0' JSON::MaybeXS: '0' JSON::PP: '2.97001' MIME::Base64: '0' Math::BigInt: '0' Path::Tiny: '0.054' Scalar::Util: '0' Test::Deep: '0' Test::Fatal: '0' Test::More: '0.96' Tie::IxHash: '0' base: '0' constant: '0' lib: '0' perl: '5.010001' utf8: '0' configure_requires: Config::AutoConf: '0.22' ExtUtils::MakeMaker: '0' Path::Tiny: '0.052' perl: '5.008' dynamic_config: 0 generated_by: 'Dist::Zilla version 6.012, CPAN::Meta::Converter version 2.150010' license: apache meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: '1.4' name: BSON-XS no_index: directory: - corpus - examples - t - xt package: - DB provides: BSON::XS: file: lib/BSON/XS.pm version: v0.8.2 requires: BSON: '1.012000' XSLoader: '0' boolean: '0' perl: '5.010001' strict: '0' version: '0' warnings: '0' resources: bugtracker: https://jira.mongodb.org/browse/PERL homepage: https://github.com/mongodb/mongo-perl-bson-xs repository: https://github.com/mongodb/mongo-perl-bson-xs.git version: v0.8.2 x_authority: cpan:MONGODB x_contributors: - 'Paul "LeoNerd" Evans ' x_generated_by_perl: v5.30.0 x_serialization_backend: 'YAML::Tiny version 1.73' BSON-XS-v0.8.2/tidyall.ini000644 000766 000024 00000000240 13572251451 015377 0ustar00davidstaff000000 000000 ; Install Code::TidyAll ; run "tidyall -a" to tidy all files ; run "tidyall -g" to tidy only files modified from git [PerlTidy] select = {lib,t}/**/*.{pl,pm,t} BSON-XS-v0.8.2/lib/000755 000766 000024 00000000000 13572251451 014006 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/Makefile.PL000644 000766 000024 00000010147 13572251451 015215 0ustar00davidstaff000000 000000 use strict; use warnings; use lib 'inc'; use BSONConfig; BSONConfig::check_for_compiler(); use 5.010001; use ExtUtils::MakeMaker; my %WriteMakefileArgs = ( "ABSTRACT" => "XS implementation of MongoDB's BSON serialization", "AUTHOR" => "David Golden ", "CONFIGURE_REQUIRES" => { "Config::AutoConf" => "0.22", "ExtUtils::MakeMaker" => 0, "Path::Tiny" => "0.052" }, "DISTNAME" => "BSON-XS", "LICENSE" => "apache", "MIN_PERL_VERSION" => "5.010001", "NAME" => "BSON::XS", "OBJECT" => "xs/XS\$(OBJ_EXT) bson/bson-atomic\$(OBJ_EXT) bson/bson-clock\$(OBJ_EXT) bson/bson-context\$(OBJ_EXT) bson/bson-decimal128\$(OBJ_EXT) bson/bson-error\$(OBJ_EXT) bson/bson-iso8601\$(OBJ_EXT) bson/bson-iter\$(OBJ_EXT) bson/bson-keys\$(OBJ_EXT) bson/bson-md5\$(OBJ_EXT) bson/bson-memory\$(OBJ_EXT) bson/bson-oid\$(OBJ_EXT) bson/bson-reader\$(OBJ_EXT) bson/bson-string\$(OBJ_EXT) bson/bson-timegm\$(OBJ_EXT) bson/bson-utf8\$(OBJ_EXT) bson/bson-value\$(OBJ_EXT) bson/bson-version\$(OBJ_EXT) bson/bson-writer\$(OBJ_EXT) bson/bson\$(OBJ_EXT)", "PREREQ_PM" => { "BSON" => "1.012000", "XSLoader" => 0, "boolean" => 0, "strict" => 0, "version" => 0, "warnings" => 0 }, "TEST_REQUIRES" => { "B" => 0, "BSON" => "1.012000", "BSON::OID" => 0, "BSON::Types" => 0, "Carp" => 0, "Data::Dumper" => 0, "Devel::Peek" => 0, "Exporter" => 0, "ExtUtils::MakeMaker" => 0, "File::Spec" => 0, "JSON::MaybeXS" => 0, "JSON::PP" => "2.97001", "MIME::Base64" => 0, "Math::BigInt" => 0, "Path::Tiny" => "0.054", "Scalar::Util" => 0, "Test::Deep" => 0, "Test::Fatal" => 0, "Test::More" => "0.96", "Tie::IxHash" => 0, "base" => 0, "constant" => 0, "lib" => 0, "utf8" => 0 }, "VERSION" => "v0.8.2", "XS" => { "xs/XS.xs" => "xs/XS.c" }, "clean" => { "FILES" => "xs/XS\$(OBJ_EXT) bson/bson-atomic\$(OBJ_EXT) bson/bson-clock\$(OBJ_EXT) bson/bson-context\$(OBJ_EXT) bson/bson-decimal128\$(OBJ_EXT) bson/bson-error\$(OBJ_EXT) bson/bson-iso8601\$(OBJ_EXT) bson/bson-iter\$(OBJ_EXT) bson/bson-keys\$(OBJ_EXT) bson/bson-md5\$(OBJ_EXT) bson/bson-memory\$(OBJ_EXT) bson/bson-oid\$(OBJ_EXT) bson/bson-reader\$(OBJ_EXT) bson/bson-string\$(OBJ_EXT) bson/bson-timegm\$(OBJ_EXT) bson/bson-utf8\$(OBJ_EXT) bson/bson-value\$(OBJ_EXT) bson/bson-version\$(OBJ_EXT) bson/bson-writer\$(OBJ_EXT) bson/bson\$(OBJ_EXT)" }, "test" => { "TESTS" => "t/*.t t/common/*.t t/corpus/*.t t/mapping/*.t t/regression/*.t" } ); my %FallbackPrereqs = ( "B" => 0, "BSON" => "1.012000", "BSON::OID" => 0, "BSON::Types" => 0, "Carp" => 0, "Data::Dumper" => 0, "Devel::Peek" => 0, "Exporter" => 0, "ExtUtils::MakeMaker" => 0, "File::Spec" => 0, "JSON::MaybeXS" => 0, "JSON::PP" => "2.97001", "MIME::Base64" => 0, "Math::BigInt" => 0, "Path::Tiny" => "0.054", "Scalar::Util" => 0, "Test::Deep" => 0, "Test::Fatal" => 0, "Test::More" => "0.96", "Tie::IxHash" => 0, "XSLoader" => 0, "base" => 0, "boolean" => 0, "constant" => 0, "lib" => 0, "strict" => 0, "utf8" => 0, "version" => 0, "warnings" => 0 ); unless ( eval { ExtUtils::MakeMaker->VERSION('6.63_03') } ) { delete $WriteMakefileArgs{TEST_REQUIRES}; delete $WriteMakefileArgs{BUILD_REQUIRES}; $WriteMakefileArgs{PREREQ_PM} = \%FallbackPrereqs; } delete $WriteMakefileArgs{CONFIGURE_REQUIRES} unless eval { ExtUtils::MakeMaker->VERSION(6.52) }; BSONConfig::configure(\%WriteMakefileArgs); WriteMakefile(%WriteMakefileArgs); { package MY; use Config; sub const_cccmd { my $ret = shift->SUPER::const_cccmd(@_); return q{} unless $ret; if ( $Config{cc} =~ /^cl\b/i ) { warn 'you are using MSVC... we may not have gotten some options quite right.'; $ret .= ' /Fo$@'; } else { $ret .= ' -o $@'; } return $ret; } sub postamble { my $txt = <<'EOF'; cover : pure_all HARNESS_PERL_SWITCHES=-MDevel::Cover make test ptest : pure_all HARNESS_OPTIONS=j9 make test EOF $txt =~ s/^ +/\t/mg; return $txt; } } BSON-XS-v0.8.2/pstdint.h000644 000766 000024 00000063432 13572251451 015106 0ustar00davidstaff000000 000000 /* A portable stdint.h **************************************************************************** * BSD License: **************************************************************************** * * Copyright (c) 2005-2011 Paul Hsieh * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * **************************************************************************** * * Version 0.1.12 * * The ANSI C standard committee, for the C99 standard, specified the * inclusion of a new standard include file called stdint.h. This is * a very useful and long desired include file which contains several * very precise definitions for integer scalar types that is * critically important for making portable several classes of * applications including cryptography, hashing, variable length * integer libraries and so on. But for most developers its likely * useful just for programming sanity. * * The problem is that most compiler vendors have decided not to * implement the C99 standard, and the next C++ language standard * (which has a lot more mindshare these days) will be a long time in * coming and its unknown whether or not it will include stdint.h or * how much adoption it will have. Either way, it will be a long time * before all compilers come with a stdint.h and it also does nothing * for the extremely large number of compilers available today which * do not include this file, or anything comparable to it. * * So that's what this file is all about. Its an attempt to build a * single universal include file that works on as many platforms as * possible to deliver what stdint.h is supposed to. A few things * that should be noted about this file: * * 1) It is not guaranteed to be portable and/or present an identical * interface on all platforms. The extreme variability of the * ANSI C standard makes this an impossibility right from the * very get go. Its really only meant to be useful for the vast * majority of platforms that possess the capability of * implementing usefully and precisely defined, standard sized * integer scalars. Systems which are not intrinsically 2s * complement may produce invalid constants. * * 2) There is an unavoidable use of non-reserved symbols. * * 3) Other standard include files are invoked. * * 4) This file may come in conflict with future platforms that do * include stdint.h. The hope is that one or the other can be * used with no real difference. * * 5) In the current verison, if your platform can't represent * int32_t, int16_t and int8_t, it just dumps out with a compiler * error. * * 6) 64 bit integers may or may not be defined. Test for their * presence with the test: #ifdef INT64_MAX or #ifdef UINT64_MAX. * Note that this is different from the C99 specification which * requires the existence of 64 bit support in the compiler. If * this is not defined for your platform, yet it is capable of * dealing with 64 bits then it is because this file has not yet * been extended to cover all of your system's capabilities. * * 7) (u)intptr_t may or may not be defined. Test for its presence * with the test: #ifdef PTRDIFF_MAX. If this is not defined * for your platform, then it is because this file has not yet * been extended to cover all of your system's capabilities, not * because its optional. * * 8) The following might not been defined even if your platform is * capable of defining it: * * WCHAR_MIN * WCHAR_MAX * (u)int64_t * PTRDIFF_MIN * PTRDIFF_MAX * (u)intptr_t * * 9) The following have not been defined: * * WINT_MIN * WINT_MAX * * 10) The criteria for defining (u)int_least(*)_t isn't clear, * except for systems which don't have a type that precisely * defined 8, 16, or 32 bit types (which this include file does * not support anyways). Default definitions have been given. * * 11) The criteria for defining (u)int_fast(*)_t isn't something I * would trust to any particular compiler vendor or the ANSI C * committee. It is well known that "compatible systems" are * commonly created that have very different performance * characteristics from the systems they are compatible with, * especially those whose vendors make both the compiler and the * system. Default definitions have been given, but its strongly * recommended that users never use these definitions for any * reason (they do *NOT* deliver any serious guarantee of * improved performance -- not in this file, nor any vendor's * stdint.h). * * 12) The following macros: * * PRINTF_INTMAX_MODIFIER * PRINTF_INT64_MODIFIER * PRINTF_INT32_MODIFIER * PRINTF_INT16_MODIFIER * PRINTF_LEAST64_MODIFIER * PRINTF_LEAST32_MODIFIER * PRINTF_LEAST16_MODIFIER * PRINTF_INTPTR_MODIFIER * * are strings which have been defined as the modifiers required * for the "d", "u" and "x" printf formats to correctly output * (u)intmax_t, (u)int64_t, (u)int32_t, (u)int16_t, (u)least64_t, * (u)least32_t, (u)least16_t and (u)intptr_t types respectively. * PRINTF_INTPTR_MODIFIER is not defined for some systems which * provide their own stdint.h. PRINTF_INT64_MODIFIER is not * defined if INT64_MAX is not defined. These are an extension * beyond what C99 specifies must be in stdint.h. * * In addition, the following macros are defined: * * PRINTF_INTMAX_HEX_WIDTH * PRINTF_INT64_HEX_WIDTH * PRINTF_INT32_HEX_WIDTH * PRINTF_INT16_HEX_WIDTH * PRINTF_INT8_HEX_WIDTH * PRINTF_INTMAX_DEC_WIDTH * PRINTF_INT64_DEC_WIDTH * PRINTF_INT32_DEC_WIDTH * PRINTF_INT16_DEC_WIDTH * PRINTF_INT8_DEC_WIDTH * * Which specifies the maximum number of characters required to * print the number of that type in either hexadecimal or decimal. * These are an extension beyond what C99 specifies must be in * stdint.h. * * Compilers tested (all with 0 warnings at their highest respective * settings): Borland Turbo C 2.0, WATCOM C/C++ 11.0 (16 bits and 32 * bits), Microsoft Visual C++ 6.0 (32 bit), Microsoft Visual Studio * .net (VC7), Intel C++ 4.0, GNU gcc v3.3.3 * * This file should be considered a work in progress. Suggestions for * improvements, especially those which increase coverage are strongly * encouraged. * * Acknowledgements * * The following people have made significant contributions to the * development and testing of this file: * * Chris Howie * John Steele Scott * Dave Thorup * John Dill * */ #include #include #include /* * For gcc with _STDINT_H, fill in the PRINTF_INT*_MODIFIER macros, and * do nothing else. On the Mac OS X version of gcc this is _STDINT_H_. */ #if ((defined(__STDC__) && __STDC__ && __STDC_VERSION__ >= 199901L) || (defined (__WATCOMC__) && (defined (_STDINT_H_INCLUDED) || __WATCOMC__ >= 1250)) || (defined(__GNUC__) && (defined(_STDINT_H) || defined(_STDINT_H_) || defined (__UINT_FAST64_TYPE__)) )) && !defined (_PSTDINT_H_INCLUDED) #include #define _PSTDINT_H_INCLUDED # ifndef PRINTF_INT64_MODIFIER # define PRINTF_INT64_MODIFIER "ll" # endif # ifndef PRINTF_INT32_MODIFIER # define PRINTF_INT32_MODIFIER "l" # endif # ifndef PRINTF_INT16_MODIFIER # define PRINTF_INT16_MODIFIER "h" # endif # ifndef PRINTF_INTMAX_MODIFIER # define PRINTF_INTMAX_MODIFIER PRINTF_INT64_MODIFIER # endif # ifndef PRINTF_INT64_HEX_WIDTH # define PRINTF_INT64_HEX_WIDTH "16" # endif # ifndef PRINTF_INT32_HEX_WIDTH # define PRINTF_INT32_HEX_WIDTH "8" # endif # ifndef PRINTF_INT16_HEX_WIDTH # define PRINTF_INT16_HEX_WIDTH "4" # endif # ifndef PRINTF_INT8_HEX_WIDTH # define PRINTF_INT8_HEX_WIDTH "2" # endif # ifndef PRINTF_INT64_DEC_WIDTH # define PRINTF_INT64_DEC_WIDTH "20" # endif # ifndef PRINTF_INT32_DEC_WIDTH # define PRINTF_INT32_DEC_WIDTH "10" # endif # ifndef PRINTF_INT16_DEC_WIDTH # define PRINTF_INT16_DEC_WIDTH "5" # endif # ifndef PRINTF_INT8_DEC_WIDTH # define PRINTF_INT8_DEC_WIDTH "3" # endif # ifndef PRINTF_INTMAX_HEX_WIDTH # define PRINTF_INTMAX_HEX_WIDTH PRINTF_INT64_HEX_WIDTH # endif # ifndef PRINTF_INTMAX_DEC_WIDTH # define PRINTF_INTMAX_DEC_WIDTH PRINTF_INT64_DEC_WIDTH # endif /* * Something really weird is going on with Open Watcom. Just pull some of * these duplicated definitions from Open Watcom's stdint.h file for now. */ # if defined (__WATCOMC__) && __WATCOMC__ >= 1250 # if !defined (INT64_C) # define INT64_C(x) (x + (INT64_MAX - INT64_MAX)) # endif # if !defined (UINT64_C) # define UINT64_C(x) (x + (UINT64_MAX - UINT64_MAX)) # endif # if !defined (INT32_C) # define INT32_C(x) (x + (INT32_MAX - INT32_MAX)) # endif # if !defined (UINT32_C) # define UINT32_C(x) (x + (UINT32_MAX - UINT32_MAX)) # endif # if !defined (INT16_C) # define INT16_C(x) (x) # endif # if !defined (UINT16_C) # define UINT16_C(x) (x) # endif # if !defined (INT8_C) # define INT8_C(x) (x) # endif # if !defined (UINT8_C) # define UINT8_C(x) (x) # endif # if !defined (UINT64_MAX) # define UINT64_MAX 18446744073709551615ULL # endif # if !defined (INT64_MAX) # define INT64_MAX 9223372036854775807LL # endif # if !defined (UINT32_MAX) # define UINT32_MAX 4294967295UL # endif # if !defined (INT32_MAX) # define INT32_MAX 2147483647L # endif # if !defined (INTMAX_MAX) # define INTMAX_MAX INT64_MAX # endif # if !defined (INTMAX_MIN) # define INTMAX_MIN INT64_MIN # endif # endif #endif #ifndef _PSTDINT_H_INCLUDED #define _PSTDINT_H_INCLUDED #ifndef SIZE_MAX # define SIZE_MAX (~(size_t)0) #endif /* * Deduce the type assignments from limits.h under the assumption that * integer sizes in bits are powers of 2, and follow the ANSI * definitions. */ #ifndef UINT8_MAX # define UINT8_MAX 0xff #endif #ifndef uint8_t # if (UCHAR_MAX == UINT8_MAX) || defined (S_SPLINT_S) typedef unsigned char uint8_t; # define UINT8_C(v) ((uint8_t) v) # else # error "Platform not supported" # endif #endif #ifndef INT8_MAX # define INT8_MAX 0x7f #endif #ifndef INT8_MIN # define INT8_MIN INT8_C(0x80) #endif #ifndef int8_t # if (SCHAR_MAX == INT8_MAX) || defined (S_SPLINT_S) typedef signed char int8_t; # define INT8_C(v) ((int8_t) v) # else # error "Platform not supported" # endif #endif #ifndef UINT16_MAX # define UINT16_MAX 0xffff #endif #ifndef uint16_t #if (UINT_MAX == UINT16_MAX) || defined (S_SPLINT_S) typedef unsigned int uint16_t; # ifndef PRINTF_INT16_MODIFIER # define PRINTF_INT16_MODIFIER "" # endif # define UINT16_C(v) ((uint16_t) (v)) #elif (USHRT_MAX == UINT16_MAX) typedef unsigned short uint16_t; # define UINT16_C(v) ((uint16_t) (v)) # ifndef PRINTF_INT16_MODIFIER # define PRINTF_INT16_MODIFIER "h" # endif #else #error "Platform not supported" #endif #endif #ifndef INT16_MAX # define INT16_MAX 0x7fff #endif #ifndef INT16_MIN # define INT16_MIN INT16_C(0x8000) #endif #ifndef int16_t #if (INT_MAX == INT16_MAX) || defined (S_SPLINT_S) typedef signed int int16_t; # define INT16_C(v) ((int16_t) (v)) # ifndef PRINTF_INT16_MODIFIER # define PRINTF_INT16_MODIFIER "" # endif #elif (SHRT_MAX == INT16_MAX) typedef signed short int16_t; # define INT16_C(v) ((int16_t) (v)) # ifndef PRINTF_INT16_MODIFIER # define PRINTF_INT16_MODIFIER "h" # endif #else #error "Platform not supported" #endif #endif #ifndef UINT32_MAX # define UINT32_MAX (0xffffffffUL) #endif #ifndef uint32_t #if (ULONG_MAX == UINT32_MAX) || defined (S_SPLINT_S) typedef unsigned long uint32_t; # define UINT32_C(v) v ## UL # ifndef PRINTF_INT32_MODIFIER # define PRINTF_INT32_MODIFIER "l" # endif #elif (UINT_MAX == UINT32_MAX) typedef unsigned int uint32_t; # ifndef PRINTF_INT32_MODIFIER # define PRINTF_INT32_MODIFIER "" # endif # define UINT32_C(v) v ## U #elif (USHRT_MAX == UINT32_MAX) typedef unsigned short uint32_t; # define UINT32_C(v) ((unsigned short) (v)) # ifndef PRINTF_INT32_MODIFIER # define PRINTF_INT32_MODIFIER "" # endif #else #error "Platform not supported" #endif #endif #ifndef INT32_MAX # define INT32_MAX (0x7fffffffL) #endif #ifndef INT32_MIN # define INT32_MIN INT32_C(0x80000000) #endif #ifndef int32_t #if (LONG_MAX == INT32_MAX) || defined (S_SPLINT_S) typedef signed long int32_t; # define INT32_C(v) v ## L # ifndef PRINTF_INT32_MODIFIER # define PRINTF_INT32_MODIFIER "l" # endif #elif (INT_MAX == INT32_MAX) typedef signed int int32_t; # define INT32_C(v) v # ifndef PRINTF_INT32_MODIFIER # define PRINTF_INT32_MODIFIER "" # endif #elif (SHRT_MAX == INT32_MAX) typedef signed short int32_t; # define INT32_C(v) ((short) (v)) # ifndef PRINTF_INT32_MODIFIER # define PRINTF_INT32_MODIFIER "" # endif #else #error "Platform not supported" #endif #endif /* * The macro stdint_int64_defined is temporarily used to record * whether or not 64 integer support is available. It must be * defined for any 64 integer extensions for new platforms that are * added. */ #undef stdint_int64_defined #if (defined(__STDC__) && defined(__STDC_VERSION__)) || defined (S_SPLINT_S) # if (__STDC__ && __STDC_VERSION__ >= 199901L) || defined (S_SPLINT_S) # define stdint_int64_defined typedef long long int64_t; typedef unsigned long long uint64_t; # define UINT64_C(v) v ## ULL # define INT64_C(v) v ## LL # ifndef PRINTF_INT64_MODIFIER # define PRINTF_INT64_MODIFIER "ll" # endif # endif #endif #if !defined (stdint_int64_defined) # if defined(__GNUC__) # define stdint_int64_defined __extension__ typedef long long int64_t; __extension__ typedef unsigned long long uint64_t; # define UINT64_C(v) v ## ULL # define INT64_C(v) v ## LL # ifndef PRINTF_INT64_MODIFIER # define PRINTF_INT64_MODIFIER "ll" # endif # elif defined(__MWERKS__) || defined (__SUNPRO_C) || defined (__SUNPRO_CC) || defined (__APPLE_CC__) || defined (_LONG_LONG) || defined (_CRAYC) || defined (S_SPLINT_S) # define stdint_int64_defined typedef long long int64_t; typedef unsigned long long uint64_t; # define UINT64_C(v) v ## ULL # define INT64_C(v) v ## LL # ifndef PRINTF_INT64_MODIFIER # define PRINTF_INT64_MODIFIER "ll" # endif # elif (defined(__WATCOMC__) && defined(__WATCOM_INT64__)) || (defined(_MSC_VER) && _INTEGRAL_MAX_BITS >= 64) || (defined (__BORLANDC__) && __BORLANDC__ > 0x460) || defined (__alpha) || defined (__DECC) # define stdint_int64_defined typedef __int64 int64_t; typedef unsigned __int64 uint64_t; # define UINT64_C(v) v ## UI64 # define INT64_C(v) v ## I64 # ifndef PRINTF_INT64_MODIFIER # define PRINTF_INT64_MODIFIER "I64" # endif # endif #endif #if !defined (LONG_LONG_MAX) && defined (INT64_C) # define LONG_LONG_MAX INT64_C (9223372036854775807) #endif #ifndef ULONG_LONG_MAX # define ULONG_LONG_MAX UINT64_C (18446744073709551615) #endif #if !defined (INT64_MAX) && defined (INT64_C) # define INT64_MAX INT64_C (9223372036854775807) #endif #if !defined (INT64_MIN) && defined (INT64_C) # define INT64_MIN INT64_C (-9223372036854775808) #endif #if !defined (UINT64_MAX) && defined (INT64_C) # define UINT64_MAX UINT64_C (18446744073709551615) #endif /* * Width of hexadecimal for number field. */ #ifndef PRINTF_INT64_HEX_WIDTH # define PRINTF_INT64_HEX_WIDTH "16" #endif #ifndef PRINTF_INT32_HEX_WIDTH # define PRINTF_INT32_HEX_WIDTH "8" #endif #ifndef PRINTF_INT16_HEX_WIDTH # define PRINTF_INT16_HEX_WIDTH "4" #endif #ifndef PRINTF_INT8_HEX_WIDTH # define PRINTF_INT8_HEX_WIDTH "2" #endif #ifndef PRINTF_INT64_DEC_WIDTH # define PRINTF_INT64_DEC_WIDTH "20" #endif #ifndef PRINTF_INT32_DEC_WIDTH # define PRINTF_INT32_DEC_WIDTH "10" #endif #ifndef PRINTF_INT16_DEC_WIDTH # define PRINTF_INT16_DEC_WIDTH "5" #endif #ifndef PRINTF_INT8_DEC_WIDTH # define PRINTF_INT8_DEC_WIDTH "3" #endif /* * Ok, lets not worry about 128 bit integers for now. Moore's law says * we don't need to worry about that until about 2040 at which point * we'll have bigger things to worry about. */ #ifdef stdint_int64_defined typedef int64_t intmax_t; typedef uint64_t uintmax_t; # define INTMAX_MAX INT64_MAX # define INTMAX_MIN INT64_MIN # define UINTMAX_MAX UINT64_MAX # define UINTMAX_C(v) UINT64_C(v) # define INTMAX_C(v) INT64_C(v) # ifndef PRINTF_INTMAX_MODIFIER # define PRINTF_INTMAX_MODIFIER PRINTF_INT64_MODIFIER # endif # ifndef PRINTF_INTMAX_HEX_WIDTH # define PRINTF_INTMAX_HEX_WIDTH PRINTF_INT64_HEX_WIDTH # endif # ifndef PRINTF_INTMAX_DEC_WIDTH # define PRINTF_INTMAX_DEC_WIDTH PRINTF_INT64_DEC_WIDTH # endif #else typedef int32_t intmax_t; typedef uint32_t uintmax_t; # define INTMAX_MAX INT32_MAX # define UINTMAX_MAX UINT32_MAX # define UINTMAX_C(v) UINT32_C(v) # define INTMAX_C(v) INT32_C(v) # ifndef PRINTF_INTMAX_MODIFIER # define PRINTF_INTMAX_MODIFIER PRINTF_INT32_MODIFIER # endif # ifndef PRINTF_INTMAX_HEX_WIDTH # define PRINTF_INTMAX_HEX_WIDTH PRINTF_INT32_HEX_WIDTH # endif # ifndef PRINTF_INTMAX_DEC_WIDTH # define PRINTF_INTMAX_DEC_WIDTH PRINTF_INT32_DEC_WIDTH # endif #endif /* * Because this file currently only supports platforms which have * precise powers of 2 as bit sizes for the default integers, the * least definitions are all trivial. Its possible that a future * version of this file could have different definitions. */ #ifndef stdint_least_defined typedef int8_t int_least8_t; typedef uint8_t uint_least8_t; typedef int16_t int_least16_t; typedef uint16_t uint_least16_t; typedef int32_t int_least32_t; typedef uint32_t uint_least32_t; # define PRINTF_LEAST32_MODIFIER PRINTF_INT32_MODIFIER # define PRINTF_LEAST16_MODIFIER PRINTF_INT16_MODIFIER # define UINT_LEAST8_MAX UINT8_MAX # define INT_LEAST8_MAX INT8_MAX # define UINT_LEAST16_MAX UINT16_MAX # define INT_LEAST16_MAX INT16_MAX # define UINT_LEAST32_MAX UINT32_MAX # define INT_LEAST32_MAX INT32_MAX # define INT_LEAST8_MIN INT8_MIN # define INT_LEAST16_MIN INT16_MIN # define INT_LEAST32_MIN INT32_MIN # ifdef stdint_int64_defined typedef int64_t int_least64_t; typedef uint64_t uint_least64_t; # define PRINTF_LEAST64_MODIFIER PRINTF_INT64_MODIFIER # define UINT_LEAST64_MAX UINT64_MAX # define INT_LEAST64_MAX INT64_MAX # define INT_LEAST64_MIN INT64_MIN # endif #endif #undef stdint_least_defined /* * The ANSI C committee pretending to know or specify anything about * performance is the epitome of misguided arrogance. The mandate of * this file is to *ONLY* ever support that absolute minimum * definition of the fast integer types, for compatibility purposes. * No extensions, and no attempt to suggest what may or may not be a * faster integer type will ever be made in this file. Developers are * warned to stay away from these types when using this or any other * stdint.h. */ typedef int_least8_t int_fast8_t; typedef uint_least8_t uint_fast8_t; typedef int_least16_t int_fast16_t; typedef uint_least16_t uint_fast16_t; typedef int_least32_t int_fast32_t; typedef uint_least32_t uint_fast32_t; #define UINT_FAST8_MAX UINT_LEAST8_MAX #define INT_FAST8_MAX INT_LEAST8_MAX #define UINT_FAST16_MAX UINT_LEAST16_MAX #define INT_FAST16_MAX INT_LEAST16_MAX #define UINT_FAST32_MAX UINT_LEAST32_MAX #define INT_FAST32_MAX INT_LEAST32_MAX #define INT_FAST8_MIN INT_LEAST8_MIN #define INT_FAST16_MIN INT_LEAST16_MIN #define INT_FAST32_MIN INT_LEAST32_MIN #ifdef stdint_int64_defined typedef int_least64_t int_fast64_t; typedef uint_least64_t uint_fast64_t; # define UINT_FAST64_MAX UINT_LEAST64_MAX # define INT_FAST64_MAX INT_LEAST64_MAX # define INT_FAST64_MIN INT_LEAST64_MIN #endif #undef stdint_int64_defined /* * Whatever piecemeal, per compiler thing we can do about the wchar_t * type limits. */ #if defined(__WATCOMC__) || defined(_MSC_VER) || defined (__GNUC__) # include # ifndef WCHAR_MIN # define WCHAR_MIN 0 # endif # ifndef WCHAR_MAX # define WCHAR_MAX ((wchar_t)-1) # endif #endif /* * Whatever piecemeal, per compiler/platform thing we can do about the * (u)intptr_t types and limits. */ #if defined (_MSC_VER) && defined (_UINTPTR_T_DEFINED) # define STDINT_H_UINTPTR_T_DEFINED #endif #ifndef STDINT_H_UINTPTR_T_DEFINED # if defined (__alpha__) || defined (__ia64__) || defined (__x86_64__) || defined (_WIN64) # define stdint_intptr_bits 64 # elif defined (__WATCOMC__) || defined (__TURBOC__) # if defined(__TINY__) || defined(__SMALL__) || defined(__MEDIUM__) # define stdint_intptr_bits 16 # else # define stdint_intptr_bits 32 # endif # elif defined (__i386__) || defined (_WIN32) || defined (WIN32) # define stdint_intptr_bits 32 # elif defined (__INTEL_COMPILER) /* TODO -- what did Intel do about x86-64? */ # endif # ifdef stdint_intptr_bits # define stdint_intptr_glue3_i(a,b,c) a##b##c # define stdint_intptr_glue3(a,b,c) stdint_intptr_glue3_i(a,b,c) # ifndef PRINTF_INTPTR_MODIFIER # define PRINTF_INTPTR_MODIFIER stdint_intptr_glue3(PRINTF_INT,stdint_intptr_bits,_MODIFIER) # endif # ifndef PTRDIFF_MAX # define PTRDIFF_MAX stdint_intptr_glue3(INT,stdint_intptr_bits,_MAX) # endif # ifndef PTRDIFF_MIN # define PTRDIFF_MIN stdint_intptr_glue3(INT,stdint_intptr_bits,_MIN) # endif # ifndef UINTPTR_MAX # define UINTPTR_MAX stdint_intptr_glue3(UINT,stdint_intptr_bits,_MAX) # endif # ifndef INTPTR_MAX # define INTPTR_MAX stdint_intptr_glue3(INT,stdint_intptr_bits,_MAX) # endif # ifndef INTPTR_MIN # define INTPTR_MIN stdint_intptr_glue3(INT,stdint_intptr_bits,_MIN) # endif # ifndef INTPTR_C # define INTPTR_C(x) stdint_intptr_glue3(INT,stdint_intptr_bits,_C)(x) # endif # ifndef UINTPTR_C # define UINTPTR_C(x) stdint_intptr_glue3(UINT,stdint_intptr_bits,_C)(x) # endif typedef stdint_intptr_glue3(uint,stdint_intptr_bits,_t) uintptr_t; typedef stdint_intptr_glue3( int,stdint_intptr_bits,_t) intptr_t; # else /* TODO -- This following is likely wrong for some platforms, and does nothing for the definition of uintptr_t. */ typedef ptrdiff_t intptr_t; # endif # define STDINT_H_UINTPTR_T_DEFINED #endif /* * Assumes sig_atomic_t is signed and we have a 2s complement machine. */ #ifndef SIG_ATOMIC_MAX # define SIG_ATOMIC_MAX ((((sig_atomic_t) 1) << (sizeof (sig_atomic_t)*CHAR_BIT-1)) - 1) #endif #endif #if defined (__TEST_PSTDINT_FOR_CORRECTNESS) /* * Please compile with the maximum warning settings to make sure macros are not * defined more than once. */ #include #include #include #define glue3_aux(x,y,z) x ## y ## z #define glue3(x,y,z) glue3_aux(x,y,z) #define DECLU(bits) glue3(uint,bits,_t) glue3(u,bits,=) glue3(UINT,bits,_C) (0); #define DECLI(bits) glue3(int,bits,_t) glue3(i,bits,=) glue3(INT,bits,_C) (0); #define DECL(us,bits) glue3(DECL,us,) (bits) #define TESTUMAX(bits) glue3(u,bits,=) glue3(~,u,bits); if (glue3(UINT,bits,_MAX) glue3(!=,u,bits)) printf ("Something wrong with UINT%d_MAX\n", bits) int main () { DECL(I,8) DECL(U,8) DECL(I,16) DECL(U,16) DECL(I,32) DECL(U,32) #ifdef INT64_MAX DECL(I,64) DECL(U,64) #endif intmax_t imax = INTMAX_C(0); uintmax_t umax = UINTMAX_C(0); char str0[256], str1[256]; sprintf (str0, "%d %x\n", 0, ~0); sprintf (str1, "%d %x\n", i8, ~0); if (0 != strcmp (str0, str1)) printf ("Something wrong with i8 : %s\n", str1); sprintf (str1, "%u %x\n", u8, ~0); if (0 != strcmp (str0, str1)) printf ("Something wrong with u8 : %s\n", str1); sprintf (str1, "%d %x\n", i16, ~0); if (0 != strcmp (str0, str1)) printf ("Something wrong with i16 : %s\n", str1); sprintf (str1, "%u %x\n", u16, ~0); if (0 != strcmp (str0, str1)) printf ("Something wrong with u16 : %s\n", str1); sprintf (str1, "%" PRINTF_INT32_MODIFIER "d %x\n", i32, ~0); if (0 != strcmp (str0, str1)) printf ("Something wrong with i32 : %s\n", str1); sprintf (str1, "%" PRINTF_INT32_MODIFIER "u %x\n", u32, ~0); if (0 != strcmp (str0, str1)) printf ("Something wrong with u32 : %s\n", str1); #ifdef INT64_MAX sprintf (str1, "%" PRINTF_INT64_MODIFIER "d %x\n", i64, ~0); if (0 != strcmp (str0, str1)) printf ("Something wrong with i64 : %s\n", str1); #endif sprintf (str1, "%" PRINTF_INTMAX_MODIFIER "d %x\n", imax, ~0); if (0 != strcmp (str0, str1)) printf ("Something wrong with imax : %s\n", str1); sprintf (str1, "%" PRINTF_INTMAX_MODIFIER "u %x\n", umax, ~0); if (0 != strcmp (str0, str1)) printf ("Something wrong with umax : %s\n", str1); TESTUMAX(8); TESTUMAX(16); TESTUMAX(32); #ifdef INT64_MAX TESTUMAX(64); #endif return EXIT_SUCCESS; } #endif BSON-XS-v0.8.2/META.json000644 000766 000024 00000007612 13572251451 014667 0ustar00davidstaff000000 000000 { "abstract" : "XS implementation of MongoDB's BSON serialization", "author" : [ "David Golden " ], "dynamic_config" : 0, "generated_by" : "Dist::Zilla version 6.012, CPAN::Meta::Converter version 2.150010", "license" : [ "apache_2_0" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : 2 }, "name" : "BSON-XS", "no_index" : { "directory" : [ "corpus", "examples", "t", "xt" ], "package" : [ "DB" ] }, "prereqs" : { "configure" : { "requires" : { "Config::AutoConf" : "0.22", "ExtUtils::MakeMaker" : "0", "Path::Tiny" : "0.052", "perl" : "5.008" } }, "develop" : { "requires" : { "BSON" : "0", "BSON::Types" : "0", "Dist::Zilla" : "5", "Dist::Zilla::Plugin::MakeMaker::Awesome" : "0.35", "Dist::Zilla::Plugin::Prereqs" : "0", "Dist::Zilla::Plugin::ReleaseStatus::FromVersion" : "0", "Dist::Zilla::Plugin::RemovePrereqs" : "0", "Dist::Zilla::PluginBundle::DAGOLDEN" : "0.072", "File::Spec" : "0", "File::Temp" : "0", "IO::Handle" : "0", "IPC::Open3" : "0", "Pod::Coverage::TrustPod" : "0", "Pod::Wordlist" : "0", "Software::License::Apache_2_0" : "0", "Test::CPAN::Meta" : "0", "Test::LeakTrace" : "0", "Test::MinimumVersion" : "0", "Test::More" : "0.96", "Test::Perl::Critic" : "0", "Test::Pod" : "1.41", "Test::Pod::Coverage" : "1.08", "Test::Portability::Files" : "0", "Test::Spelling" : "0.12", "Test::Version" : "1", "Tie::IxHash" : "0", "inc::MakeMaker" : "0" } }, "runtime" : { "requires" : { "BSON" : "1.012000", "XSLoader" : "0", "boolean" : "0", "perl" : "5.010001", "strict" : "0", "version" : "0", "warnings" : "0" } }, "test" : { "recommends" : { "CPAN::Meta" : "2.120900" }, "requires" : { "B" : "0", "BSON" : "1.012000", "BSON::OID" : "0", "BSON::Types" : "0", "Carp" : "0", "Data::Dumper" : "0", "Devel::Peek" : "0", "Exporter" : "0", "ExtUtils::MakeMaker" : "0", "File::Spec" : "0", "JSON::MaybeXS" : "0", "JSON::PP" : "2.97001", "MIME::Base64" : "0", "Math::BigInt" : "0", "Path::Tiny" : "0.054", "Scalar::Util" : "0", "Test::Deep" : "0", "Test::Fatal" : "0", "Test::More" : "0.96", "Tie::IxHash" : "0", "base" : "0", "constant" : "0", "lib" : "0", "perl" : "5.010001", "utf8" : "0" } } }, "provides" : { "BSON::XS" : { "file" : "lib/BSON/XS.pm", "version" : "v0.8.2" } }, "release_status" : "stable", "resources" : { "bugtracker" : { "web" : "https://jira.mongodb.org/browse/PERL" }, "homepage" : "https://github.com/mongodb/mongo-perl-bson-xs", "repository" : { "type" : "git", "url" : "https://github.com/mongodb/mongo-perl-bson-xs.git", "web" : "https://github.com/mongodb/mongo-perl-bson-xs" } }, "version" : "v0.8.2", "x_authority" : "cpan:MONGODB", "x_contributors" : [ "Paul \"LeoNerd\" Evans " ], "x_generated_by_perl" : "v5.30.0", "x_serialization_backend" : "Cpanel::JSON::XS version 4.15" } BSON-XS-v0.8.2/dist.ini000644 000766 000024 00000002331 13572251451 014703 0ustar00davidstaff000000 000000 name = BSON-XS author = David Golden license = Apache_2_0 copyright_holder = MongoDB, Inc. [@DAGOLDEN] :version = 0.072 authority = cpan:MONGODB github_issues = 0 Bugtracker.web = https://jira.mongodb.org/browse/PERL UploadToCPAN.pause_cfg_file = .pause-mongodb -remove = MakeMaker Test::ReportPrereqs.include[0] = JSON::PP Test::ReportPrereqs.include[1] = JSON::XS Test::ReportPrereqs.include[2] = CPanel::JSON::XS CheckPrereqsIndexed.skips[0] = ^inc:: Test::MinimumVersion.max_target_perl = 5.010001 [Prereqs] BSON = 1.012000 ; Add pre-configuration requirements to META so that Makefile.PL will run [Prereqs / ConfigureRequires] Config::AutoConf = 0.22 Path::Tiny = 0.052 [ReleaseStatus::FromVersion] testing = second_element_odd [RemovePrereqs] remove = DateTime remove = DateTime::Tiny remove = Mango::BSON::Time remove = Math::Int64 remove = MongoDB remove = MongoDB::BSON::Binary remove = MongoDB::BSON::Regexp remove = MongoDB::BSON::_EncodedDoc remove = MongoDB::Code remove = MongoDB::DBRef remove = MongoDB::OID remove = MongoDB::Timestamp remove = Time::Moment ; authordep Dist::Zilla::Plugin::MakeMaker::Awesome = 0.35 [=inc::MakeMaker] default_jobs = 9 footer_file = inc/MM_pkg_MY.pl BSON-XS-v0.8.2/lib/BSON/000755 000766 000024 00000000000 13572251451 014547 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/lib/BSON/XS.pm000644 000766 000024 00000005223 13572251451 015441 0ustar00davidstaff000000 000000 # # Copyright 2016 MongoDB, Inc. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. use 5.010001; use strict; use warnings; package BSON::XS; # ABSTRACT: XS implementation of MongoDB's BSON serialization use version; our $VERSION = 'v0.8.2'; # cached for efficiency during decoding # XXX eventually move this into XS use boolean; our $_boolean_true = true; our $_boolean_false = false; use XSLoader; XSLoader::load( "BSON::XS", $VERSION ); # For errors sub _printable { my $value = shift; $value =~ s/([^[:print:]])/sprintf("\\x%02x",ord($1))/ge; return $value; } 1; =pod =encoding UTF-8 =head1 NAME BSON::XS - XS implementation of MongoDB's BSON serialization =head1 VERSION version v0.8.2 =head1 END OF LIFE NOTICE Version v0.8.0 is the final feature release of the MongoDB BSON::XS library. The library is now in a 12-month "sunset" period and will receive security patches and critical bug fixes only. The BSON::XS library will be end-of-life and unsupported on August 13, 2020. =head1 DESCRIPTION This module contains an XS implementation for BSON encoding and decoding. There is no public API. Use the L module and it will choose the best implementation for you. =for :stopwords cpan testmatrix url annocpan anno bugtracker rt cpants kwalitee diff irc mailto metadata placeholders metacpan =head1 SUPPORT =head2 Bugs / Feature Requests Please report any bugs or feature requests through the issue tracker at L. You will be notified automatically of any progress on your issue. =head2 Source Code This is open source software. The code repository is available for public review and contribution under the terms of the license. L git clone https://github.com/mongodb/mongo-perl-bson-xs.git =head1 AUTHOR David Golden =head1 CONTRIBUTOR =for stopwords Paul "LeoNerd" Evans Paul "LeoNerd" Evans =head1 COPYRIGHT AND LICENSE This software is Copyright (c) 2019 by MongoDB, Inc. This is free software, licensed under: The Apache License, Version 2.0, January 2004 =cut __END__ # vim: ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/testing/build.pl000755 000766 000024 00000000730 13572251451 016354 0ustar00davidstaff000000 000000 #!/usr/bin/env perl use strict; use warnings; # Get helpers use FindBin qw($Bin); use lib "$Bin/../lib"; use EvergreenHelper; # Bootstrap bootstrap_env(); run_in_dir $ENV{REPO_DIR} => sub { # Install any new, missing dependencies to local library run_local_cpanm(qw/--installdeps ./); # Configure & build configure(); make(); # Archive both built blib and local deps for reuse try_system(qw/tar -czf build.tar.gz Makefile blib local/); }; BSON-XS-v0.8.2/testing/write-config.pl000755 000766 000024 00000001207 13572251451 017652 0ustar00davidstaff000000 000000 #!/usr/bin/env perl use v5.10; use strict; use warnings; use utf8; use open qw/:std :utf8/; # Get helpers use FindBin qw($Bin); use lib "$Bin/../lib"; use EvergreenConfig; sub main { my @tasks = ( pre(qw/dynamicVars cleanUp fetchSource downloadPerl5Lib/), post(qw/cleanUp/), task( build => [qw/whichPerl buildModule uploadBuildArtifacts/] ), task( test => [qw/whichPerl downloadBuildArtifacts testModule/], depends_on => 'build' ), ); print assemble_yaml( timeout(600), buildvariants( \@tasks ), ); return 0; } # execution exit main(); BSON-XS-v0.8.2/testing/test.pl000755 000766 000024 00000000474 13572251451 016241 0ustar00davidstaff000000 000000 #!/usr/bin/env perl use strict; use warnings; # Get helpers use FindBin qw($Bin); use lib "$Bin/../lib"; use EvergreenHelper; # Bootstrap bootstrap_env(); run_in_dir $ENV{REPO_DIR} => sub { # Configure ENV vars for local library updated in compile step bootstrap_locallib('local'); make("test"); }; BSON-XS-v0.8.2/testing/config.yml000644 000766 000024 00000031175 13572251451 016714 0ustar00davidstaff000000 000000 stepback: true command_type: system exec_timeout_secs: 600 timeout: - command: shell.exec params: script: 'ls -la' functions: "buildModule" : command: shell.exec type: test params: script: | ${prepare_shell} $PERL ${repo_directory}/.evergreen/testing/build.pl "cleanUp": command: shell.exec params: script: | ${prepare_shell} rm -rf perl5 rm -rf ${repo_directory} "downloadBuildArtifacts" : command: shell.exec params: script: | ${prepare_shell} cd ${repo_directory} curl https://s3.amazonaws.com/mciuploads/${aws_artifact_prefix}/${repo_directory}/${build_id}/build.tar.gz -o build.tar.gz --fail --show-error --silent --max-time 240 tar -zxmf build.tar.gz "downloadPerl5Lib" : command: shell.exec params: script: | ${prepare_shell} curl https://s3.amazonaws.com/mciuploads/${aws_toolchain_prefix}/${os}/${perlver}/perl5lib.tar.gz -o perl5lib.tar.gz --fail --show-error --silent --max-time 240 tar -zxf perl5lib.tar.gz "dynamicVars": - command: shell.exec params: script: | set -o errexit set -o xtrace cat < expansion.yml prepare_shell: | export PATH="${addpaths}:$PATH" export PERL="${perlpath}" export REPO_DIR="${repo_directory}" set -o errexit set -o xtrace EOT cat expansion.yml - command: expansions.update params: file: expansion.yml "fetchSource" : command: git.get_project params: directory: mongo-perl-bson "testModule" : command: shell.exec type: test params: script: | ${prepare_shell} $PERL ${repo_directory}/.evergreen/testing/test.pl "uploadBuildArtifacts": - command: s3.put params: aws_key: ${aws_key} aws_secret: ${aws_secret} local_file: ${repo_directory}/build.tar.gz remote_file: ${aws_artifact_prefix}/${repo_directory}/${build_id}/build.tar.gz bucket: mciuploads permissions: public-read content_type: application/x-gzip "whichPerl": command: shell.exec type: test params: script: | ${prepare_shell} $PERL -v pre: - func: dynamicVars - func: cleanUp - func: fetchSource - func: downloadPerl5Lib post: - func: cleanUp tasks: - commands: - func: whichPerl - func: buildModule - func: uploadBuildArtifacts name: build - commands: - func: whichPerl - func: downloadBuildArtifacts - func: testModule depends_on: - name: build name: test buildvariants: - display_name: 'Ubuntu 16.04 Perl 10.1' expansions: addpaths: /opt/perl/10.1/bin os: ubuntu1604 perlpath: /opt/perl/10.1/bin/perl perlver: '10.1' name: os_ubuntu1604_perl_10.1 run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 10.1t' expansions: addpaths: /opt/perl/10.1t/bin os: ubuntu1604 perlpath: /opt/perl/10.1t/bin/perl perlver: 10.1t name: os_ubuntu1604_perl_10.1t run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 10.1ld' expansions: addpaths: /opt/perl/10.1ld/bin os: ubuntu1604 perlpath: /opt/perl/10.1ld/bin/perl perlver: 10.1ld name: os_ubuntu1604_perl_10.1ld run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 12.5' expansions: addpaths: /opt/perl/12.5/bin os: ubuntu1604 perlpath: /opt/perl/12.5/bin/perl perlver: '12.5' name: os_ubuntu1604_perl_12.5 run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 12.5t' expansions: addpaths: /opt/perl/12.5t/bin os: ubuntu1604 perlpath: /opt/perl/12.5t/bin/perl perlver: 12.5t name: os_ubuntu1604_perl_12.5t run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 12.5ld' expansions: addpaths: /opt/perl/12.5ld/bin os: ubuntu1604 perlpath: /opt/perl/12.5ld/bin/perl perlver: 12.5ld name: os_ubuntu1604_perl_12.5ld run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 14.4' expansions: addpaths: /opt/perl/14.4/bin os: ubuntu1604 perlpath: /opt/perl/14.4/bin/perl perlver: '14.4' name: os_ubuntu1604_perl_14.4 run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 14.4t' expansions: addpaths: /opt/perl/14.4t/bin os: ubuntu1604 perlpath: /opt/perl/14.4t/bin/perl perlver: 14.4t name: os_ubuntu1604_perl_14.4t run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 14.4ld' expansions: addpaths: /opt/perl/14.4ld/bin os: ubuntu1604 perlpath: /opt/perl/14.4ld/bin/perl perlver: 14.4ld name: os_ubuntu1604_perl_14.4ld run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 16.3' expansions: addpaths: /opt/perl/16.3/bin os: ubuntu1604 perlpath: /opt/perl/16.3/bin/perl perlver: '16.3' name: os_ubuntu1604_perl_16.3 run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 16.3t' expansions: addpaths: /opt/perl/16.3t/bin os: ubuntu1604 perlpath: /opt/perl/16.3t/bin/perl perlver: 16.3t name: os_ubuntu1604_perl_16.3t run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 16.3ld' expansions: addpaths: /opt/perl/16.3ld/bin os: ubuntu1604 perlpath: /opt/perl/16.3ld/bin/perl perlver: 16.3ld name: os_ubuntu1604_perl_16.3ld run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 18.4' expansions: addpaths: /opt/perl/18.4/bin os: ubuntu1604 perlpath: /opt/perl/18.4/bin/perl perlver: '18.4' name: os_ubuntu1604_perl_18.4 run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 18.4t' expansions: addpaths: /opt/perl/18.4t/bin os: ubuntu1604 perlpath: /opt/perl/18.4t/bin/perl perlver: 18.4t name: os_ubuntu1604_perl_18.4t run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 18.4ld' expansions: addpaths: /opt/perl/18.4ld/bin os: ubuntu1604 perlpath: /opt/perl/18.4ld/bin/perl perlver: 18.4ld name: os_ubuntu1604_perl_18.4ld run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 20.3' expansions: addpaths: /opt/perl/20.3/bin os: ubuntu1604 perlpath: /opt/perl/20.3/bin/perl perlver: '20.3' name: os_ubuntu1604_perl_20.3 run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 20.3t' expansions: addpaths: /opt/perl/20.3t/bin os: ubuntu1604 perlpath: /opt/perl/20.3t/bin/perl perlver: 20.3t name: os_ubuntu1604_perl_20.3t run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 20.3ld' expansions: addpaths: /opt/perl/20.3ld/bin os: ubuntu1604 perlpath: /opt/perl/20.3ld/bin/perl perlver: 20.3ld name: os_ubuntu1604_perl_20.3ld run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 22.2' expansions: addpaths: /opt/perl/22.2/bin os: ubuntu1604 perlpath: /opt/perl/22.2/bin/perl perlver: '22.2' name: os_ubuntu1604_perl_22.2 run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 22.2t' expansions: addpaths: /opt/perl/22.2t/bin os: ubuntu1604 perlpath: /opt/perl/22.2t/bin/perl perlver: 22.2t name: os_ubuntu1604_perl_22.2t run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 22.2ld' expansions: addpaths: /opt/perl/22.2ld/bin os: ubuntu1604 perlpath: /opt/perl/22.2ld/bin/perl perlver: 22.2ld name: os_ubuntu1604_perl_22.2ld run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 24.0' expansions: addpaths: /opt/perl/24.0/bin os: ubuntu1604 perlpath: /opt/perl/24.0/bin/perl perlver: '24.0' name: os_ubuntu1604_perl_24.0 run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 24.0t' expansions: addpaths: /opt/perl/24.0t/bin os: ubuntu1604 perlpath: /opt/perl/24.0t/bin/perl perlver: 24.0t name: os_ubuntu1604_perl_24.0t run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Ubuntu 16.04 Perl 24.0ld' expansions: addpaths: /opt/perl/24.0ld/bin os: ubuntu1604 perlpath: /opt/perl/24.0ld/bin/perl perlver: 24.0ld name: os_ubuntu1604_perl_24.0ld run_on: - ubuntu1604-test - ubuntu1604-build tasks: - build - test - display_name: 'Win64 Perl 14.4' expansions: addpaths: /cygdrive/c/perl/14.4/perl/bin:/cygdrive/c/perl/14.4/c/bin os: windows64 perlpath: /cygdrive/c/perl/14.4/perl/bin/perl perlver: '14.4' name: os_windows64_perl_14.4 run_on: - windows-64-vs2015-compile - windows-64-vs2015-test - windows-64-vs2015-large tasks: - build - test - display_name: 'Win64 Perl 16.3' expansions: addpaths: /cygdrive/c/perl/16.3/perl/bin:/cygdrive/c/perl/16.3/c/bin os: windows64 perlpath: /cygdrive/c/perl/16.3/perl/bin/perl perlver: '16.3' name: os_windows64_perl_16.3 run_on: - windows-64-vs2015-compile - windows-64-vs2015-test - windows-64-vs2015-large tasks: - build - test - display_name: 'Win64 Perl 18.4' expansions: addpaths: /cygdrive/c/perl/18.4/perl/bin:/cygdrive/c/perl/18.4/c/bin os: windows64 perlpath: /cygdrive/c/perl/18.4/perl/bin/perl perlver: '18.4' name: os_windows64_perl_18.4 run_on: - windows-64-vs2015-compile - windows-64-vs2015-test - windows-64-vs2015-large tasks: - build - test - display_name: 'Win64 Perl 20.3' expansions: addpaths: /cygdrive/c/perl/20.3/perl/bin:/cygdrive/c/perl/20.3/c/bin os: windows64 perlpath: /cygdrive/c/perl/20.3/perl/bin/perl perlver: '20.3' name: os_windows64_perl_20.3 run_on: - windows-64-vs2015-compile - windows-64-vs2015-test - windows-64-vs2015-large tasks: - build - test - display_name: 'Win64 Perl 22.2' expansions: addpaths: /cygdrive/c/perl/22.2/perl/bin:/cygdrive/c/perl/22.2/c/bin os: windows64 perlpath: /cygdrive/c/perl/22.2/perl/bin/perl perlver: '22.2' name: os_windows64_perl_22.2 run_on: - windows-64-vs2015-compile - windows-64-vs2015-test - windows-64-vs2015-large tasks: - build - test - display_name: 'Win64 Perl 24.0' expansions: addpaths: /cygdrive/c/perl/24.0/perl/bin:/cygdrive/c/perl/24.0/c/bin os: windows64 perlpath: /cygdrive/c/perl/24.0/perl/bin/perl perlver: '24.0' name: os_windows64_perl_24.0 run_on: - windows-64-vs2015-compile - windows-64-vs2015-test - windows-64-vs2015-large tasks: - build - test BSON-XS-v0.8.2/xs/XS.xs000644 000766 000024 00000153230 13572251451 014604 0ustar00davidstaff000000 000000 /* vim: set ts=2 sts=2 sw=2 et tw=75: */ /* * Copyright 2009-2016 MongoDB, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include "bson.h" #include "EXTERN.h" #include "perl.h" #include "XSUB.h" #include "regcomp.h" #include "string.h" #include "limits.h" /* load after other Perl headers */ #include "ppport.h" /* adapted from perl.h and must come after it */ #if !defined(Strtoll) # ifdef __hpux # define Strtoll __strtoll # endif # ifdef WIN32 # define Strtoll _strtoi64 # endif # if !defined(Strtoll) && defined(HAS_STRTOLL) # define Strtoll strtoll # endif # if !defined(Strtoll) && defined(HAS_STRTOQ) # define Strtoll strtoq # endif # if !defined(Strtoll) # error strtoll not available # endif #endif /* whether to add an _id field */ #define PREP 1 #define NO_PREP 0 /* define regex macros for Perl 5.8 */ #ifndef RX_PRECOMP #define RX_PRECOMP(re) ((re)->precomp) #define RX_PRELEN(re) ((re)->prelen) #endif #define SUBTYPE_BINARY_DEPRECATED 2 #define SUBTYPE_BINARY 0 /* struct for circular ref checks */ typedef struct _stackette { void *ptr; struct _stackette *prev; } stackette; #define EMPTY_STACK 0 #define MAX_DEPTH 100 /* convenience functions taken from Text::CSV_XS by H.M. Brand */ #define _is_reftype(f,x) \ (f && ((SvGMAGICAL (f) && mg_get (f)) || 1) && SvROK (f) && SvTYPE (SvRV (f)) == x) #define _is_arrayref(f) _is_reftype (f, SVt_PVAV) #define _is_hashref(f) _is_reftype (f, SVt_PVHV) #define _is_coderef(f) _is_reftype (f, SVt_PVCV) /* shorthand for getting an SV* from a hash and key */ #define _hv_fetchs_sv(h,k) \ (((svp = hv_fetchs(h, k, FALSE)) && *svp) ? *svp : 0) /* perl call helpers * * For convenience, these functions encapsulate the verbose stack * manipulation code necessary to call perl functions from C. * */ static SV * call_method_va(SV *self, const char *method, int num, ...); static SV * call_method_with_pairs_va(SV *self, const char *method, ...); static SV * new_object_from_pairs(const char *klass, ...); static SV * call_method_with_arglist (SV *self, const char *method, va_list args); static SV * call_sv_va (SV *func, int num, ...); static SV * call_pv_va (char *func, int num, ...); static bool call_key_value_iter (SV *func, SV **ret ); #define call_perl_reader(s,m) call_method_va(s,m,0) /* BSON encoding * * Public function perl_mongo_sv_to_bsonis the entry point. It calls one * of the container encoding functions, hv_doc_to_bson, or * ixhash_doc_to_bson. Those iterate their contents, encoding them with * sv_to_bson_elem. sv_to_bson_elem delegates to various append_* * functions for particular types. * * Other functions are utility functions used during encoding. */ static void perl_mongo_sv_to_bson (bson_t * bson, SV *sv, HV *opts); static void hv_to_bson(bson_t * bson, SV *sv, HV *opts, stackette *stack, int depth, bool subdoc); static void ixhash_to_bson(bson_t * bson, SV *sv, HV *opts, stackette *stack, int depth, bool subdoc); static void iter_src_to_bson(bson_t * bson, SV *sv, HV *opts, stackette *stack, int depth, bool subdoc); #define hv_doc_to_bson(b,d,o,s,u) hv_to_bson((b),(d),(o),(s),(u),0) #define hv_elem_to_bson(b,d,o,s,u) hv_to_bson((b),(d),(o),(s),(u),1) #define ixhash_doc_to_bson(b,d,o,s,u) ixhash_to_bson((b),(d),(o),(s),(u),0) #define ixhash_elem_to_bson(b,d,o,s,u) ixhash_to_bson((b),(d),(o),(s),(u),1) #define iter_doc_to_bson(b,d,o,s,u) iter_src_to_bson((b),(d),(o),(s),(u),0) #define iter_elem_to_bson(b,d,o,s,u) iter_src_to_bson((b),(d),(o),(s),(u),1) static void sv_to_bson_elem (bson_t * bson, const char *key, SV *sv, HV *opts, stackette *stack, int depth); const char * maybe_append_first_key(bson_t *bson, HV *opts, stackette *stack, int depth); static void append_binary(bson_t * bson, const char * key, bson_subtype_t subtype, SV * sv); static void append_regex(bson_t * bson, const char *key, REGEXP *re, SV * sv); static void append_decomposed_regex(bson_t *bson, const char *key, const char *pattern, const char *flags); static void append_fit_int(bson_t * bson, const char *key, SV * sv); static void append_utf8(bson_t * bson, const char *key, SV * sv); static void assert_valid_key(const char* str, STRLEN len); static const char * bson_key(const char * str, HV *opts); static void get_regex_flags(char * flags, SV *sv); static int64_t math_bigint_to_int64(SV *sv, const char *key); static SV* int64_as_SV(int64_t value); static stackette * check_circular_ref(void *ptr, stackette *stack); static SV* bson_parent_type(SV *sv); /* BSON decoding * * Public function _decode_bson is the entry point. It calls * bson_doc_to_hashref, which construct a container and fills it using * bson_elem_to_sv. That may call bson_doc_to_hashref or * bson_doc_to_arrayref to decode sub-containers. * * The bson_oid_to_sv function manually constructs a BSON::OID object to * avoid the overhead of calling its constructor. This optimization is * fragile and might need to be reconsidered. * */ static SV * bson_doc_to_hashref(bson_iter_t * iter, HV *opts, int depth, bool top); static SV * bson_doc_to_tiedhash(bson_iter_t * iter, HV *opts, int depth, bool top); static SV * bson_array_to_arrayref(bson_iter_t * iter, HV *opts, int depth); static SV * bson_elem_to_sv(const bson_iter_t * iter, const char *key, HV *opts, int depth); static SV * bson_oid_to_sv(const bson_iter_t * iter); /******************************************************************** * Some C libraries (e.g. MSVCRT) do not have a "timegm" function. * Here is a surrogate implementation. ********************************************************************/ #if defined(WIN32) || defined(sun) static int is_leap_year(unsigned year) { year += 1900; return (year % 4) == 0 && ((year % 100) != 0 || (year % 400) == 0); } static time_t timegm(struct tm *tm) { static const unsigned month_start[2][12] = { { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 }, { 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335 }, }; time_t ret = 0; int i; for (i = 70; i < tm->tm_year; ++i) ret += is_leap_year(i) ? 366 : 365; ret += month_start[is_leap_year(tm->tm_year)][tm->tm_mon]; ret += tm->tm_mday - 1; ret *= 24; ret += tm->tm_hour; ret *= 60; ret += tm->tm_min; ret *= 60; ret += tm->tm_sec; return ret; } #endif /* WIN32 */ /******************************************************************** * perl call helpers ********************************************************************/ /* call_method_va -- calls a method with a variable number * of SV * arguments. The SV* arguments are NOT mortalized. * Must give the number of arguments before the variable list */ static SV * call_method_va (SV *self, const char *method, int num, ...) { dSP; SV *ret; I32 count; va_list args; ENTER; SAVETMPS; PUSHMARK (SP); XPUSHs (self); va_start (args, num); for( ; num > 0; num-- ) { XPUSHs (va_arg( args, SV* )); } va_end(args); PUTBACK; count = call_method (method, G_SCALAR); SPAGAIN; if (count != 1) { croak ("method didn't return a value"); } ret = POPs; SvREFCNT_inc (ret); PUTBACK; FREETMPS; LEAVE; return ret; } /* call_method_va_paris -- calls a method with a variable number * of key/value pairs as paired char* and SV* arguments. The SV* arguments * are NOT mortalized. The final argument must be a NULL key. */ static SV * call_method_with_pairs_va (SV *self, const char *method, ...) { SV *ret; va_list args; va_start (args, method); ret = call_method_with_arglist(self, method, args); va_end(args); return ret; } /* new_object_from_pairs -- calls 'new' with a variable number of * of key/value pairs as paired char* and SV* arguments. The SV* arguments * are NOT mortalized. The final argument must be a NULL key. */ static SV * new_object_from_pairs(const char *klass, ...) { SV *ret; va_list args; va_start (args, klass); ret = call_method_with_arglist(sv_2mortal(newSVpv(klass,0)), "new", args); va_end(args); return ret; } static SV * call_method_with_arglist (SV *self, const char *method, va_list args) { dSP; SV *ret = NULL; char *key; I32 count; ENTER; SAVETMPS; PUSHMARK (SP); XPUSHs (self); while ((key = va_arg (args, char *))) { mXPUSHp (key, strlen (key)); XPUSHs (va_arg (args, SV *)); } PUTBACK; count = call_method (method, G_SCALAR); SPAGAIN; if (count != 1) { croak ("method didn't return a value"); } ret = POPs; SvREFCNT_inc (ret); PUTBACK; FREETMPS; LEAVE; return ret; } static SV * call_sv_va (SV *func, int num, ...) { dSP; SV *ret; I32 count; va_list args; ENTER; SAVETMPS; PUSHMARK (SP); va_start (args, num); for( ; num > 0; num-- ) { XPUSHs (va_arg( args, SV* )); } va_end(args); PUTBACK; count = call_sv(func, G_SCALAR); SPAGAIN; if (count != 1) { croak ("method didn't return a value"); } ret = POPs; SvREFCNT_inc (ret); PUTBACK; FREETMPS; LEAVE; return ret; } /* Call func and return key value pairs. * * ret is address of (SV*)[2] where key and value will be put. * * return value is true if key is defined and false otherwise. */ static bool call_key_value_iter (SV *func, SV **ret ) { dSP; I32 count; bool ok; ENTER; SAVETMPS; PUSHMARK (SP); PUTBACK; count = call_sv(func, G_ARRAY); SPAGAIN; if ( count == 0 ) { ok = false; } else { SvREFCNT_inc (ret[1] = POPs); SvREFCNT_inc (ret[0] = POPs); ok = SvOK(ret[0]) != 0; } PUTBACK; FREETMPS; LEAVE; return ok; } static SV * call_pv_va (char *func, int num, ...) { dSP; SV *ret; I32 count; va_list args; ENTER; SAVETMPS; PUSHMARK (SP); va_start (args, num); for( ; num > 0; num-- ) { XPUSHs (va_arg( args, SV* )); } va_end(args); PUTBACK; count = call_pv(func, G_SCALAR); SPAGAIN; if (count != 1) { croak ("function %s didn't return a value", func); } ret = POPs; SvREFCNT_inc (ret); PUTBACK; FREETMPS; LEAVE; return ret; } /******************************************************************** * BSON encoding ********************************************************************/ void perl_mongo_sv_to_bson (bson_t * bson, SV *sv, HV *opts) { if (!SvROK (sv)) { croak ("not a reference"); } if ( ! sv_isobject(sv) ) { switch ( SvTYPE(SvRV(sv)) ) { case SVt_PVHV: hv_doc_to_bson (bson, sv, opts, EMPTY_STACK, 0); break; default: sv_dump(sv); croak ("Can't encode unhandled variable type"); } } else { SV *obj; char *class; obj = SvRV(sv); class = HvNAME(SvSTASH(obj)); if ( strEQ(class, "Tie::IxHash") ) { ixhash_doc_to_bson(bson, sv, opts, EMPTY_STACK, 0); } else if ( strEQ(class, "BSON::Doc") ) { iter_doc_to_bson(bson, sv, opts, EMPTY_STACK, 0); } else if ( strEQ(class, "BSON::Raw") ) { STRLEN str_len; SV *encoded; const char *bson_str; bson_t *child; encoded = sv_2mortal(call_perl_reader(sv, "bson")); bson_str = SvPV(encoded, str_len); child = bson_new_from_data((uint8_t*) bson_str, str_len); bson_concat(bson, child); bson_destroy(child); } else if ( strEQ(class, "MongoDB::BSON::_EncodedDoc") ) { STRLEN str_len; SV **svp; SV *encoded; const char *bson_str; bson_t *child; encoded = _hv_fetchs_sv((HV *)obj, "bson"); bson_str = SvPV(encoded, str_len); child = bson_new_from_data((uint8_t*) bson_str, str_len); bson_concat(bson, child); bson_destroy(child); } else if ( strEQ(class, "MongoDB::BSON::Raw") ) { SV *str_sv; char *str; STRLEN str_len; bson_t *child; str_sv = SvRV(sv); // check type ok if (!SvPOK(str_sv)) { croak("MongoDB::BSON::Raw must be a blessed string reference"); } str = SvPV(str_sv, str_len); child = bson_new_from_data((uint8_t*) str, str_len); bson_concat(bson, child); bson_destroy(child); } else if (SvTYPE(obj) == SVt_PVHV) { hv_doc_to_bson(bson, sv, opts, EMPTY_STACK, 0); } else { croak ("Can't encode non-container of type '%s'", class); } } } static void hv_to_bson(bson_t * bson, SV *sv, HV *opts, stackette *stack, int depth, bool subdoc) { HE *he; HV *hv; const char *first_key = NULL; depth++; if ( depth > MAX_DEPTH ) { croak("Exceeded max object depth of %d", MAX_DEPTH); } hv = (HV*)SvRV(sv); if (!(stack = check_circular_ref(hv, stack))) { croak("circular reference detected"); } if ( ! subdoc ) { first_key = maybe_append_first_key(bson, opts, stack, depth); } (void)hv_iterinit (hv); while ((he = hv_iternext (hv))) { SV **hval; STRLEN len; const char *key = HePV (he, len); uint32_t utf8 = HeUTF8(he); assert_valid_key(key, len); /* if we've already added the first key, continue */ if (first_key && strcmp(key, first_key) == 0) { continue; } /* * HeVAL doesn't return the correct value for tie(%foo, 'Tie::IxHash') * so we're using hv_fetch */ if ((hval = hv_fetch(hv, key, utf8 ? -len : len, 0)) == 0) { croak("could not find hash value for key %s, len:%lu", key, (long unsigned int)len); } if (!utf8) { key = (const char *) bytes_to_utf8((U8 *)key, &len); } if ( ! is_utf8_string((const U8*)key,len)) { croak( "Invalid UTF-8 detected while encoding BSON" ); } sv_to_bson_elem (bson, key, *hval, opts, stack, depth); if (!utf8) { Safefree(key); } } /* free the hv elem */ if ( ! subdoc ) { Safefree(stack); } depth--; } static void ixhash_to_bson(bson_t * bson, SV *sv, HV *opts, stackette *stack, int depth, bool subdoc) { int i; SV **keys_sv, **values_sv; AV *array, *keys, *values; const char *first_key = NULL; depth++; if ( depth > MAX_DEPTH ) { croak("Exceeded max object depth of %d", MAX_DEPTH); } /* * a Tie::IxHash is of the form: * [ {hash}, [keys], [order], 0 ] */ array = (AV*)SvRV(sv); /* check if we're in an infinite loop */ if (!(stack = check_circular_ref(array, stack))) { croak("circular ref"); } /* keys in order, from position 1 */ keys_sv = av_fetch(array, 1, 0); keys = (AV*)SvRV(*keys_sv); /* values in order, from position 2 */ values_sv = av_fetch(array, 2, 0); values = (AV*)SvRV(*values_sv); if ( ! subdoc ) { first_key = maybe_append_first_key(bson, opts, stack, depth); } for (i=0; i<=av_len(keys); i++) { SV **k, **v; STRLEN len; const char *str; if (!(k = av_fetch(keys, i, 0)) || !(v = av_fetch(values, i, 0))) { croak ("failed to fetch associative array value"); } str = SvPVutf8(*k, len); assert_valid_key(str,len); if (first_key && strcmp(str, first_key) == 0) { continue; } sv_to_bson_elem(bson, str, *v, opts, stack, depth); } /* free the ixhash elem */ if ( ! subdoc ) { Safefree(stack); } depth--; } /* Construct a BSON document from an iterator code ref that returns key * value pairs */ static void iter_src_to_bson(bson_t * bson, SV *sv, HV *opts, stackette *stack, int depth, bool subdoc) { int i; SV *iter; SV * kv[2]; const char *first_key = NULL; depth++; if ( depth > MAX_DEPTH ) { croak("Exceeded max object depth of %d", MAX_DEPTH); } /* check if we're in an infinite loop */ if (!(stack = check_circular_ref(SvRV(sv), stack))) { croak("circular ref: %s", SvPV_nolen(sv)); } if ( ! subdoc ) { first_key = maybe_append_first_key(bson, opts, stack, depth); } iter = sv_2mortal(call_perl_reader(sv, "_iterator")); if ( !SvROK(iter) || SvTYPE(SvRV(iter)) != SVt_PVCV ) { croak("invalid iterator from %s", SvPV_nolen(sv)); } while ( call_key_value_iter( iter, kv ) ) { sv_2mortal(kv[0]); sv_2mortal(kv[1]); STRLEN len; const char *str; str = SvPVutf8(kv[0], len); assert_valid_key(str,len); if (first_key && strcmp(str, first_key) == 0) { continue; } sv_to_bson_elem(bson, str, kv[1], opts, stack, depth); } /* free the stack elem for sv */ if ( ! subdoc ) { Safefree(stack); } depth--; } /* This is for an array reference contained *within* a document */ static void av_to_bson (bson_t * bson, AV *av, HV *opts, stackette *stack, int depth) { I32 i; depth++; if ( depth > MAX_DEPTH ) { croak("Exceeded max object depth of %d", MAX_DEPTH); } if (!(stack = check_circular_ref(av, stack))) { croak("circular ref"); } for (i = 0; i <= av_len (av); i++) { SV **sv; SV *key = sv_2mortal(newSViv (i)); if (!(sv = av_fetch (av, i, 0))) sv_to_bson_elem (bson, SvPV_nolen(key), newSV(0), opts, stack, depth); else sv_to_bson_elem (bson, SvPV_nolen(key), *sv, opts, stack, depth); } /* free the av elem */ Safefree(stack); depth--; } /* verify and transform key, if necessary */ static const char * bson_key(const char * str, HV *opts) { SV **svp; SV *tempsv; STRLEN len; /* first swap op_char if necessary */ if ( (tempsv = _hv_fetchs_sv(opts, "op_char")) && SvOK(tempsv) && SvPV_nolen(tempsv)[0] == str[0] ) { char *out = savepv(str); SAVEFREEPV(out); *out = '$'; str = out; } /* then check for validity */ if ( (tempsv = _hv_fetchs_sv(opts, "invalid_chars")) && SvOK(tempsv) && (len = sv_len(tempsv)) ) { STRLEN i; const char *invalid = SvPV_nolen(tempsv); for (i=0; i=12 REGEXP * re = SvRX(sv); #else REGEXP * re = (REGEXP *) mg_find((SV*)SvRV(sv), PERL_MAGIC_qr)->mg_obj; #endif append_regex(bson, key, re, sv); } else if (strEQ(obj_type, "BSON::Regex") || strEQ(obj_type, "MongoDB::BSON::Regexp") ) { /* Abstract regexp object */ SV *pattern, *flags; pattern = sv_2mortal(call_perl_reader( sv, "pattern" )); flags = sv_2mortal(call_perl_reader( sv, "flags" )); append_decomposed_regex( bson, key, SvPV_nolen( pattern ), SvPV_nolen( flags ) ); } /* 64-bit integers */ else if (strEQ(obj_type, "Math::BigInt")) { bson_append_int64(bson, key, -1, math_bigint_to_int64(sv,key)); } else if (strEQ(obj_type, "BSON::Int64") ) { SV *v = sv_2mortal(call_perl_reader(sv, "value")); if ( SvROK(v) ) { /* delegate to wrapped value type */ return sv_to_bson_elem(bson,in_key,v,opts,stack,depth); } bson_append_int64(bson, key, -1, (int64_t)SvIV(sv)); } else if (strEQ(obj_type, "Math::Int64")) { uint64_t v_int; SV *v_sv = call_pv_va("Math::Int64::int64_to_native",1,sv); Copy(SvPVbyte_nolen(v_sv), &v_int, 1, uint64_t); bson_append_int64(bson, key, -1, v_int); } else if (strEQ(obj_type, "BSON::Int32") ) { bson_append_int32(bson, key, -1, (int32_t)SvIV(sv)); } else if (strEQ(obj_type, "BSON::Double") ) { bson_append_double(bson, key, -1, (double)SvNV(sv)); } else if (strEQ(obj_type, "BSON::Decimal128") ) { bson_decimal128_t dec; SV *dec_sv; char *bid_bytes; dec_sv = sv_2mortal(call_perl_reader( sv, "bytes" )); bid_bytes = SvPV_nolen(dec_sv); /* normalize from little endian back to native byte order */ Copy(bid_bytes, &dec.low, 1, uint64_t); Copy(bid_bytes + 8, &dec.high, 1, uint64_t); dec.low = BSON_UINT64_FROM_LE(dec.low); dec.high = BSON_UINT64_FROM_LE(dec.high); bson_append_decimal128(bson, key, -1, &dec); } else { croak ("For key '%s', can't encode value of type '%s'", key, HvNAME(SvSTASH(SvRV(sv)))); } } else { SV *deref = SvRV(sv); switch (SvTYPE (deref)) { case SVt_PVHV: { /* hash */ bson_t child; bson_append_document_begin(bson, key, -1, &child); /* don't add a _id to inner objs */ hv_elem_to_bson (&child, sv, opts, stack, depth); bson_append_document_end(bson, &child); break; } case SVt_PVAV: { /* array */ bson_t child; bson_append_array_begin(bson, key, -1, &child); av_to_bson (&child, (AV *)SvRV (sv), opts, stack, depth); bson_append_array_end(bson, &child); break; } default: { if ( SvPOK(deref) ) { /* binary */ append_binary(bson, key, BSON_SUBTYPE_BINARY, deref); } else { croak ("For key '%s', can't encode value '%s'", key, SvPV_nolen(sv)); } } } } } else { /* Value is a defined, non-reference scalar */ SV *tempsv; bool prefer_numeric; tempsv = _hv_fetchs_sv(opts, "prefer_numeric"); prefer_numeric = SvTRUE(tempsv); #if PERL_REVISION==5 && PERL_VERSION<=18 /* Before 5.18, get magic would clear public flags. This restores them * from private flags but ONLY if there is no public flag already, as * we have nothing else to go on for serialization. */ if (!(SvFLAGS(sv) & (SVf_IOK|SVf_NOK|SVf_POK))) { SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT; } #endif I32 is_number = looks_like_number(sv); if ( SvNOK(sv) ) { bson_append_double(bson, key, -1, (double)SvNV(sv)); } else if ( SvIOK(sv) ) { append_fit_int(bson, key, sv); } else if ( prefer_numeric && is_number ) { /* copy to avoid modifying flags of the original */ tempsv = sv_2mortal(newSVsv(sv)); if (is_number & IS_NUMBER_NOT_INT) { /* double */ bson_append_double(bson, key, -1, (double)SvNV(tempsv)); } else { append_fit_int(bson, key, tempsv); } } else { append_utf8(bson, key, sv); } } } const char * maybe_append_first_key(bson_t *bson, HV *opts, stackette *stack, int depth) { SV *tempsv; SV **svp; const char *first_key = NULL; if ( (tempsv = _hv_fetchs_sv(opts, "first_key")) && SvOK (tempsv) ) { STRLEN len; first_key = SvPVutf8(tempsv, len); assert_valid_key(first_key, len); if ( (tempsv = _hv_fetchs_sv(opts, "first_value")) ) { sv_to_bson_elem(bson, first_key, tempsv, opts, stack, depth); } else { bson_append_null(bson, first_key, -1); } } return first_key; } static void append_decomposed_regex(bson_t *bson, const char *key, const char *pattern, const char *flags ) { size_t pattern_length = strlen( pattern ); char *buf; Newx(buf, pattern_length + 1, char ); Copy(pattern, buf, pattern_length, char ); buf[ pattern_length ] = '\0'; bson_append_regex(bson, key, -1, buf, flags); Safefree(buf); } static void append_regex(bson_t * bson, const char *key, REGEXP *re, SV * sv) { char flags[] = {0,0,0,0,0,0,0}; /* space for imxslu + \0 */ char *buf; int i, j; get_regex_flags(flags, sv); /* sort flags -- how cool to write a sort algorithm by hand! Since we're * only sorting a tiny array, who cares if it's n-squared? */ for ( i=0; flags[i]; i++ ) { for ( j=i+1; flags[j] ; j++ ) { if ( flags[i] > flags[j] ) { char t = flags[j]; flags[j] = flags[i]; flags[i] = t; } } } Newx(buf, (RX_PRELEN(re) + 1), char ); Copy(RX_PRECOMP(re), buf, RX_PRELEN(re), char ); buf[RX_PRELEN(re)] = '\0'; bson_append_regex(bson, key, -1, buf, flags); Safefree(buf); } static void append_binary(bson_t * bson, const char * key, bson_subtype_t subtype, SV * sv) { STRLEN len; uint8_t * bytes = (uint8_t *) SvPVbyte(sv, len); bson_append_binary(bson, key, -1, subtype, bytes, len); } static void append_fit_int(bson_t * bson, const char *key, SV * sv) { #if defined(MONGO_USE_64_BIT_INT) IV i = SvIV(sv); if ( i >= INT32_MIN && i <= INT32_MAX) { bson_append_int32(bson, key, -1, (int32_t)i); } else { bson_append_int64(bson, key, -1, (int64_t)i); } #else bson_append_int32(bson, key, -1, (int32_t)SvIV(sv)); #endif return; } static void append_utf8(bson_t * bson, const char *key, SV * sv) { STRLEN len; const char *str = SvPVutf8(sv, len); if ( ! is_utf8_string((const U8*)str,len)) { croak( "Invalid UTF-8 detected while encoding BSON" ); } bson_append_utf8(bson, key, -1, str, len); return; } static void assert_valid_key(const char* str, STRLEN len) { if(strlen(str) < len) { SV *clean = call_pv_va("BSON::XS::_printable",1,sv_2mortal(newSVpvn(str,len))); croak("Key '%s' contains null character", SvPV_nolen(clean)); } } static void get_regex_flags(char * flags, SV *sv) { unsigned int i = 0, f = 0; #if PERL_REVISION == 5 && PERL_VERSION < 10 /* pre-5.10 doesn't have the re API */ STRLEN string_length; char *re_string = SvPV( sv, string_length ); /* pre-5.14 regexes are stringified in the format: (?ix-sm:foo) where everything between ? and - are the current flags. The format changed around 5.14, but for everything after 5.10 we use the re API anyway. */ for( i = 2; i < string_length && re_string[i] != '-'; i++ ) { if ( re_string[i] == 'i' || re_string[i] == 'm' || re_string[i] == 'x' || re_string[i] == 'l' || re_string[i] == 'u' || re_string[i] == 's' ) { flags[f++] = re_string[i]; } else if ( re_string[i] == ':' ) { break; } } #else /* 5.10 added an API to extract flags, so we use that */ int ret_count; SV *flags_sv; SV *pat_sv; char *flags_tmp; dSP; ENTER; SAVETMPS; PUSHMARK (SP); XPUSHs (sv); PUTBACK; ret_count = call_pv( "re::regexp_pattern", G_ARRAY ); SPAGAIN; if ( ret_count != 2 ) { croak( "error introspecting regex" ); } /* regexp_pattern returns two items (in list context), the pattern and a list of flags */ flags_sv = POPs; pat_sv = POPs; /* too bad we throw this away */ flags_tmp = SvPVutf8_nolen(flags_sv); for ( i = 0; i < sizeof( flags_tmp ); i++ ) { if ( flags_tmp[i] == 0 ) break; /* MongoDB supports only flags /imxslu */ if ( flags_tmp[i] == 'i' || flags_tmp[i] == 'm' || flags_tmp[i] == 'x' || flags_tmp[i] == 'l' || flags_tmp[i] == 'u' || flags_tmp[i] == 's' ) { flags[f++] = flags_tmp[i]; } else { /* do nothing; just ignore it */ } } PUTBACK; FREETMPS; LEAVE; #endif } /* Converts Math::BigInt to int64_t; sv must be Math::BigInt */ static int64_t math_bigint_to_int64(SV *sv, const char *key) { SV *tempsv; char *str; int64_t big; char *end = NULL; tempsv = sv_2mortal(call_perl_reader(sv, "bstr")); str = SvPV_nolen(tempsv); errno = 0; big = Strtoll(str, &end, 10); /* check for conversion problems */ if ( end && (*end != '\0') ) { if ( errno == ERANGE && ( big == LLONG_MAX || big == LLONG_MIN ) ) { croak( "For key '%s', Math::BigInt '%s' can't fit into a 64-bit integer", key, str ); } else { croak( "For key '%s', couldn't convert Math::BigInt '%s' to 64-bit integer", key, str ); } } return big; } static SV* int64_to_math_bigint(int64_t value) { char buf[22]; SV *class; SV *as_str; SV *bigint; sprintf(buf, "%" PRIi64, value); as_str = sv_2mortal(newSVpv(buf,strlen(buf))); class = sv_2mortal(newSVpvs("Math::BigInt")); bigint = call_method_va(class, "new", 1, as_str); return bigint; } /** * checks if a ptr has been parsed already and, if not, adds it to the stack. If * we do have a circular ref, this function returns 0. */ static stackette* check_circular_ref(void *ptr, stackette *stack) { stackette *ette, *start = stack; while (stack) { if (ptr == stack->ptr) { return 0; } stack = stack->prev; } /* push this onto the circular ref stack */ Newx(ette, 1, stackette); ette->ptr = ptr; /* if stack has not been initialized, stack will be 0 so this will work out */ ette->prev = start; return ette; } /** * Given an object SV, finds the first superclass in reverse mro order that * starts with "BSON::" and returns it as a mortal SV. Otherwise, returns * NULL if no such type is found. */ static SV* bson_parent_type(SV* sv) { SV** handle; AV* mro; int i; if (! SvOBJECT(sv)) { return NULL; } mro = mro_get_linear_isa(SvSTASH(sv)); if (av_len(mro) == -1) { return NULL; } /* iterate backwards */ for ( i=av_len(mro); i >= 0; i-- ) { handle = av_fetch(mro, i, 0); if (handle != NULL) { char* klass = SvPV_nolen(*handle); if (strnEQ(klass, "BSON::", 6)) { return sv_2mortal(newSVpvn(klass,strlen(klass))); } } } return NULL; } /******************************************************************** * BSON decoding ********************************************************************/ static SV * bson_doc_to_hashref(bson_iter_t * iter, HV *opts, int depth, bool top) { SV **svp; SV *wrap; SV *ordered; SV *ret; HV *hv = newHV(); depth++; if ( depth > MAX_DEPTH ) { croak("Exceeded max object depth of %d", MAX_DEPTH); } /* delegate if 'ordered' option is true */ if ( (ordered = _hv_fetchs_sv(opts, "ordered")) && SvTRUE(ordered) ) { return bson_doc_to_tiedhash(iter, opts, depth, top); } int is_dbref = 1; int key_num = 0; while (bson_iter_next(iter)) { const char *name; SV *value; name = bson_iter_key(iter); if ( ! is_utf8_string((const U8*)name,strlen(name))) { croak( "Invalid UTF-8 detected while decoding BSON" ); } key_num++; /* check if this is a DBref. We must see the keys $ref, $id, and optionally $db in that order, with no extra keys */ if ( key_num == 1 && strcmp( name, "$ref" ) ) is_dbref = 0; if ( key_num == 2 && is_dbref == 1 && strcmp( name, "$id" ) ) is_dbref = 0; /* get value and store into hash */ value = bson_elem_to_sv(iter, name, opts, depth); if (!hv_store (hv, name, 0-strlen(name), value, 0)) { croak ("failed storing value in hash"); } } ret = newRV_noinc ((SV *)hv); /* XXX shouldn't need to limit to size 3 */ if ( ! top && key_num >= 2 && is_dbref == 1 && (wrap = _hv_fetchs_sv(opts, "wrap_dbrefs")) && SvTRUE(wrap) ) { SV *class = sv_2mortal(newSVpvs("BSON::DBRef")); SV *dbref = call_method_va(class, "new", 1, sv_2mortal(ret) ); return dbref; } depth--; return ret; } static SV * bson_doc_to_tiedhash(bson_iter_t * iter, HV *opts, int depth, bool top) { SV **svp; SV *wrap; SV *ret; SV *ixhash; SV *tie; SV *key; HV *hv = newHV(); int is_dbref = 1; int key_num = 0; depth++; if ( depth > MAX_DEPTH ) { croak("Exceeded max object depth of %d", MAX_DEPTH); } ixhash = new_object_from_pairs("Tie::IxHash",NULL); while (bson_iter_next(iter)) { const char *name; SV *value; name = bson_iter_key(iter); if ( ! is_utf8_string((const U8*)name,strlen(name))) { croak( "Invalid UTF-8 detected while decoding BSON" ); } key_num++; /* check if this is a DBref. We must see the keys $ref, $id, and optionally $db in that order, with no extra keys */ if ( key_num == 1 && strcmp( name, "$ref" ) ) is_dbref = 0; if ( key_num == 2 && is_dbref == 1 && strcmp( name, "$id" ) ) is_dbref = 0; /* get key and value and store into hash */ key = sv_2mortal( newSVpvn(name, strlen(name)) ); SvUTF8_on(key); value = bson_elem_to_sv(iter, name, opts, depth); call_method_va(ixhash, "STORE", 2, key, value); } /* tie the ixhash to the return hash */ sv_magic((SV*) hv, ixhash, PERL_MAGIC_tied, NULL, 0); ret = newRV_noinc((SV*) hv); /* XXX shouldn't need to limit to size 3 */ if ( !top && key_num >= 2 && is_dbref == 1 && (wrap = _hv_fetchs_sv(opts, "wrap_dbrefs")) && SvTRUE(wrap) ) { SV *class = sv_2mortal(newSVpvs("BSON::DBRef")); SV *dbref = call_method_va(class, "new", 1, ret ); return dbref; } depth--; return ret; } static SV * bson_array_to_arrayref(bson_iter_t * iter, HV *opts, int depth) { AV *ret = newAV (); depth++; if ( depth > MAX_DEPTH ) { croak("Exceeded max object depth of %d", MAX_DEPTH); } while (bson_iter_next(iter)) { SV *sv; const char *name = bson_iter_key(iter); /* get value */ if ((sv = bson_elem_to_sv(iter, name, opts, depth))) { av_push (ret, sv); } } depth--; return newRV_noinc ((SV *)ret); } static SV * bson_elem_to_sv (const bson_iter_t * iter, const char *key, HV *opts, int depth) { SV **svp; SV *value = 0; switch(bson_iter_type(iter)) { case BSON_TYPE_OID: { value = bson_oid_to_sv(iter); break; } case BSON_TYPE_DOUBLE: { SV *tempsv; SV *d = newSVnv(bson_iter_double(iter)); /* Check for Inf and NaN */ if (Perl_isinf(SvNV(d)) || Perl_isnan(SvNV(d)) ) { SvPV_nolen(d); /* force to PVNV for compatibility */ } if ( (tempsv = _hv_fetchs_sv(opts, "wrap_numbers")) && SvTRUE(tempsv) ) { value = new_object_from_pairs("BSON::Double", "value", sv_2mortal(d), NULL); } else { value = d; } break; } case BSON_TYPE_SYMBOL: case BSON_TYPE_UTF8: { SV *wrap; SV *s; const char * str; uint32_t len; if (bson_iter_type(iter) == BSON_TYPE_SYMBOL) { str = bson_iter_symbol(iter, &len); } else { str = bson_iter_utf8(iter, &len); } if ( ! is_utf8_string((const U8*)str,len)) { croak( "Invalid UTF-8 detected while decoding BSON" ); } /* this makes a copy of the buffer */ /* len includes \0 */ s = newSVpvn(str, len); SvUTF8_on(s); if ( (wrap = _hv_fetchs_sv(opts, "wrap_strings")) && SvTRUE(wrap) ) { value = new_object_from_pairs("BSON::String", "value", sv_2mortal(s), NULL); } else { value = s; } break; } case BSON_TYPE_DOCUMENT: { bson_iter_t child; bson_iter_recurse(iter, &child); value = bson_doc_to_hashref(&child, opts, depth, FALSE); break; } case BSON_TYPE_ARRAY: { bson_iter_t child; bson_iter_recurse(iter, &child); value = bson_array_to_arrayref(&child, opts, depth); break; } case BSON_TYPE_BINARY: { const char * buf; uint32_t len; bson_subtype_t type; bson_iter_binary(iter, &type, &len, (const uint8_t **)&buf); if ( BSON_UNLIKELY(type == BSON_SUBTYPE_BINARY_DEPRECATED) ) { /* for the deprecated subtype, bson_iter_binary gives * buffer pointer just past the inner length and adjusted len */ int32_t sublen; Copy(buf-4, &sublen, 1, int32_t); sublen = BSON_UINT32_FROM_LE(sublen); /* adjusted len must match sublen */ if ( sublen != len ) { croak("key '%s' (binary subtype 0x02) is invalid", key); } } value = new_object_from_pairs( "BSON::Bytes", "data", sv_2mortal(newSVpvn(buf, len)), "subtype", sv_2mortal(newSViv(type)), NULL ); break; } case BSON_TYPE_BOOL: { value = bson_iter_bool(iter) ? newSVsv(get_sv("BSON::XS::_boolean_true", GV_ADD)) : newSVsv(get_sv("BSON::XS::_boolean_false", GV_ADD)); break; } case BSON_TYPE_UNDEFINED: case BSON_TYPE_NULL: { value = newSV(0); break; } case BSON_TYPE_INT32: { SV *tempsv; SV *i = newSViv(bson_iter_int32(iter)); if ( (tempsv = _hv_fetchs_sv(opts, "wrap_numbers")) && SvTRUE(tempsv) ) { value = new_object_from_pairs("BSON::Int32", "value", sv_2mortal(i), NULL); } else { value = i; } break; } case BSON_TYPE_INT64: { SV *tempsv; #if defined(MONGO_USE_64_BIT_INT) SV *i = newSViv(bson_iter_int64(iter)); if ( (tempsv = _hv_fetchs_sv(opts, "wrap_numbers")) && SvTRUE(tempsv) ) { value = new_object_from_pairs("BSON::Int64", "value", sv_2mortal(i), NULL); } else { value = i; } #else SV *bigint = int64_to_math_bigint(bson_iter_int64(iter)); if ( (tempsv = _hv_fetchs_sv(opts, "wrap_numbers")) && SvTRUE(tempsv) ) { value = new_object_from_pairs("BSON::Int64", "value", sv_2mortal(bigint), NULL); } else { value = bigint; } #endif break; } case BSON_TYPE_DATE_TIME: { const int64_t msec = bson_iter_date_time(iter); SV *obj; SV *temp; SV *dt_type_sv; #if defined(MONGO_USE_64_BIT_INT) obj = new_object_from_pairs("BSON::Time", "value", sv_2mortal(newSViv(msec)), NULL); #else obj = new_object_from_pairs("BSON::Time", "value", sv_2mortal(int64_to_math_bigint(msec)), NULL); #endif if ( (dt_type_sv = _hv_fetchs_sv(opts, "dt_type")) && SvOK(dt_type_sv) ) { char *dt_type = SvPV_nolen(dt_type_sv); if ( strEQ(dt_type, "BSON::Time") ) { /* already BSON::Time */ value = obj; } else if ( strEQ(dt_type, "Time::Moment") ) { value = call_perl_reader(sv_2mortal(obj),"as_time_moment"); } else if ( strEQ(dt_type, "DateTime") ) { value = call_perl_reader(sv_2mortal(obj),"as_datetime"); } else if ( strEQ(dt_type, "DateTime::Tiny") ) { value = call_perl_reader(sv_2mortal(obj),"as_datetime_tiny"); } else if ( strEQ(dt_type, "Mango::BSON::Time") ) { value = call_perl_reader(sv_2mortal(obj),"as_mango_time"); } else { croak( "unsupported dt_type \"%s\"", dt_type ); } } else { value = obj; } break; } case BSON_TYPE_REGEX: { const char * regex_str; const char * options; regex_str = bson_iter_regex(iter, &options); /* always make a BSON::Regex object instead of a native Perl * regexp to prevent the risk of compilation failure as well as * security risks compiling unknown regular expressions. */ value = new_object_from_pairs( "BSON::Regex", "pattern", sv_2mortal(newSVpv(regex_str,0)), "flags", sv_2mortal(newSVpv(options,0)), NULL ); break; } case BSON_TYPE_CODE: { const char * code; uint32_t len; SV *code_sv; code = bson_iter_code(iter, &len); if ( ! is_utf8_string((const U8*)code,len)) { croak( "Invalid UTF-8 detected while decoding BSON" ); } code_sv = sv_2mortal(newSVpvn(code, len)); SvUTF8_on(code_sv); value = new_object_from_pairs("BSON::Code", "code", code_sv, NULL); break; } case BSON_TYPE_CODEWSCOPE: { const char * code; const uint8_t * scope; uint32_t code_len, scope_len; SV * code_sv; SV * scope_sv; bson_t bson; bson_iter_t child; code = bson_iter_codewscope(iter, &code_len, &scope_len, &scope); if ( ! is_utf8_string((const U8*)code,code_len)) { croak( "Invalid UTF-8 detected while decoding BSON" ); } code_sv = sv_2mortal(newSVpvn(code, code_len)); SvUTF8_on(code_sv); if ( ! ( bson_init_static(&bson, scope, scope_len) && bson_iter_init(&child, &bson) ) ) { croak("error iterating BSON type %d\n", bson_iter_type(iter)); } scope_sv = sv_2mortal(bson_doc_to_hashref(&child, opts, depth, TRUE)); value = new_object_from_pairs("BSON::Code", "code", code_sv, "scope", scope_sv, NULL); break; } case BSON_TYPE_TIMESTAMP: { SV *sec_sv, *inc_sv; uint32_t sec, inc; bson_iter_timestamp(iter, &sec, &inc); sec_sv = sv_2mortal(newSVuv(sec)); inc_sv = sv_2mortal(newSVuv(inc)); value = new_object_from_pairs("BSON::Timestamp", "seconds", sec_sv, "increment", inc_sv, NULL); break; } case BSON_TYPE_MINKEY: { HV *stash = gv_stashpv("BSON::MinKey", GV_ADD); value = sv_bless(newRV_noinc((SV*)newHV()), stash); break; } case BSON_TYPE_MAXKEY: { HV *stash = gv_stashpv("BSON::MaxKey", GV_ADD); value = sv_bless(newRV_noinc((SV*)newHV()), stash); break; } case BSON_TYPE_DECIMAL128: { bson_decimal128_t dec; char bid_bytes[16]; SV *dec_sv; if ( ! bson_iter_decimal128(iter, &dec) ) { croak("could not decode decimal128"); } /* normalize to little endian regardless of native byte order */ dec.low = BSON_UINT64_TO_LE(dec.low); dec.high = BSON_UINT64_TO_LE(dec.high); Copy(&dec.low, bid_bytes, 1, uint64_t); Copy(&dec.high, bid_bytes + 8, 1, uint64_t); dec_sv = sv_2mortal(newSVpvn(bid_bytes, 16)); value = new_object_from_pairs("BSON::Decimal128", "bytes", dec_sv, NULL); break; } case BSON_TYPE_DBPOINTER: { uint32_t len; const char *collection; const bson_oid_t *oid_ptr; SV *coll; SV *oid; bson_iter_dbpointer(iter, &len, &collection, &oid_ptr); if ( ! is_utf8_string((const U8*)collection,len)) { croak( "Invalid UTF-8 detected while decoding BSON" ); } coll = newSVpvn(collection, len); SvUTF8_on(coll); oid = new_object_from_pairs( "BSON::OID", "oid", newSVpvn((const char *) oid_ptr->bytes, 12), NULL ); value = new_object_from_pairs( "BSON::DBRef", "ref", sv_2mortal(coll), "id", sv_2mortal(oid), NULL ); break; } default: { /* Should already have been caught during bson_validate() but in case not: */ croak("unsupported BSON type \\x%02X for key '%s'. Are you using the latest version of BSON::XS?", bson_iter_type(iter), key ); } } return value; } static SV * bson_oid_to_sv (const bson_iter_t * iter) { HV *stash, *id_hv; const bson_oid_t * oid = bson_iter_oid(iter); id_hv = newHV(); (void)hv_stores(id_hv, "oid", newSVpvn((const char *) oid->bytes, 12)); stash = gv_stashpv("BSON::OID", 0); return sv_bless(newRV_noinc((SV *)id_hv), stash); } MODULE = BSON::XS PACKAGE = BSON::XS PROTOTYPES: DISABLE void _decode_bson(msg, options) SV *msg SV *options PREINIT: char * data; bson_t bson; bson_iter_t iter; size_t error_offset; STRLEN length; HV *opts; uint32_t invalid_type; const char *invalid_key; PPCODE: data = SvPV(msg, length); opts = NULL; if ( options ) { if ( SvROK(options) && SvTYPE(SvRV(options)) == SVt_PVHV ) { opts = (HV *) SvRV(options); } else { croak("options must be a reference to a hash"); } } if ( ! bson_init_static(&bson, (uint8_t *) data, length) ) { croak("Error reading BSON document"); } if ( ! bson_validate(&bson, BSON_VALIDATE_NONE, &error_offset, &invalid_key, &invalid_type) ) { croak( "Invalid BSON input" ); } if ( invalid_type != 0 ) { croak("unsupported BSON type \\x%02X for key '%s'. Are you using the latest version of BSON::XS?", invalid_type, invalid_key ); } if ( ! bson_iter_init(&iter, &bson) ) { croak( "Error creating BSON iterator" ); } XPUSHs(sv_2mortal(bson_doc_to_hashref(&iter, opts, 0, TRUE))); void _encode_bson(doc, options) SV *doc SV *options PREINIT: bson_t * bson; HV *opts; PPCODE: opts = NULL; bson = bson_new(); if ( options ) { if ( SvROK(options) && SvTYPE(SvRV(options)) == SVt_PVHV ) { opts = (HV *) SvRV(options); } else { croak("options must be a reference to a hash"); } } perl_mongo_sv_to_bson(bson, doc, opts); XPUSHs(sv_2mortal(newSVpvn((const char *)bson_get_data(bson), bson->len))); bson_destroy(bson); SV * _generate_oid () PREINIT: bson_oid_t boid; CODE: bson_oid_init(&boid, NULL); RETVAL = newSVpvn((const char *) boid.bytes, 12); OUTPUT: RETVAL BSON-XS-v0.8.2/xt/leaktest.t000644 000766 000024 00000010130 13572251451 015667 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; BEGIN { plan skip_all => "Test::LeakTrace not installed" unless eval { require Test::LeakTrace; 1 }; Test::LeakTrace->import(qw/no_leaks_ok/); } use BSON; use BSON::Types ':all'; use Tie::IxHash; #--------------------------------------------------------------------------# # Fixtures #--------------------------------------------------------------------------# # output caching hashes my %encoded; my %data = ( string => "abc", integer => 42, float => 3.14, regex => qr/abc/ixm, hash => { foo => "bar" }, array => [qw/one two three/], ); $data{stringref} = \$data{string}; my %generators = ( bson_bool => sub { bson_bool(1) }, bson_bytes => sub { bson_bytes("abc") }, bson_code => sub { bson_code("abc") }, bson_codescope => sub { bson_code( "abc", { x => 1 } ) }, bson_dbref => sub { bson_dbref( bson_oid(), "test" ) }, bson_decimal128 => sub { bson_decimal128("123e1234") }, bson_doc => sub { bson_doc( x => 1 ) }, bson_double => sub { bson_double(3.14) }, bson_int32 => sub { bson_int32(42) }, bson_int64 => sub { bson_int64(23) }, bson_maxkey => sub { bson_maxkey() }, bson_minkey => sub { bson_minkey() }, bson_oid => sub { bson_oid() }, bson_raw => sub { bson_raw("\x05\x00\x00\x00\x00") }, bson_regex => sub { bson_regex( "abc", "ixmu" ) }, bson_string => sub { bson_string("abc") }, bson_time => sub { bson_time() }, bson_timestamp => sub { bson_timestamp( 123456789, 42 ) }, ); my %encoders = ( default => BSON->new(), numeric => BSON->new( prefer_numeric => 1 ), ordered => BSON->new( ordered => 1 ), ); my %decoders = ( default => BSON->new(), wrapper => BSON->new( wrap_numbers => 1, wrap_strings => 1 ), ); # XXX conditionally add decoders based on availability of dt_type support #--------------------------------------------------------------------------# # warm up #--------------------------------------------------------------------------# # Warm up generators so that Moo constructs all necessary subs, since those # closures often count as "leaks". for my $key ( sort keys %generators ) { $generators{$key}->(); } #--------------------------------------------------------------------------# # tests #--------------------------------------------------------------------------# subtest "Check wrappers for leaks" => sub { # Test for leaks for my $key ( sort keys %generators ) { no_leaks_ok { $data{$key} = $generators{$key}->(); } $key; } }; for my $codec ( sort keys %encoders ) { subtest "Check '$codec' encoding for leaks" => sub { # Test for leaks for my $key ( sort keys %data ) { my $case = "$key|$codec"; # Cache encoded BSON doc from plain hashref case only no_leaks_ok { $encoded{$case} = $encoders{$codec}->encode_one( { a => $data{$key} } ); } "$case (hashref)"; no_leaks_ok { $encoded{$case} = $encoders{$codec}->encode_one( Tie::IxHash->new( a => $data{$key} ) ); } "$case (ixhash)"; no_leaks_ok { $encoded{$case} = $encoders{$codec}->encode_one( bson_doc( a => $data{$key} ) ); } "$case (bsondoc)"; } }; } for my $codec ( sort keys %decoders ) { subtest "Check '$codec' decoding for leaks" => sub { # Test for leaks for my $key ( sort keys %encoded ) { my $case = "$key|$codec"; no_leaks_ok { $decoders{$codec}->decode_one( $encoded{$key} ); } $case; } }; } done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/xt/author/000755 000766 000024 00000000000 13572251451 015175 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/xt/release/000755 000766 000024 00000000000 13572251451 015313 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/xt/release/distmeta.t000644 000766 000024 00000000172 13572251451 017312 0ustar00davidstaff000000 000000 #!perl # This file was automatically generated by Dist::Zilla::Plugin::MetaTests. use Test::CPAN::Meta; meta_yaml_ok(); BSON-XS-v0.8.2/xt/author/critic.t000644 000766 000024 00000000201 13572251451 016630 0ustar00davidstaff000000 000000 #!perl use strict; use warnings; use Test::Perl::Critic (-profile => "perlcritic.rc") x!! -e "perlcritic.rc"; all_critic_ok(); BSON-XS-v0.8.2/xt/author/minimum-version.t000644 000766 000024 00000000155 13572251451 020521 0ustar00davidstaff000000 000000 use strict; use warnings; use Test::More; use Test::MinimumVersion; all_minimum_version_ok( qq{5.010001} ); BSON-XS-v0.8.2/xt/author/test-version.t000644 000766 000024 00000000637 13572251451 020032 0ustar00davidstaff000000 000000 use strict; use warnings; use Test::More; # generated by Dist::Zilla::Plugin::Test::Version 1.09 use Test::Version; my @imports = qw( version_all_ok ); my $params = { is_strict => 0, has_version => 1, multiple => 0, }; push @imports, $params if version->parse( $Test::Version::VERSION ) >= version->parse('1.002'); Test::Version->import(@imports); version_all_ok; done_testing; BSON-XS-v0.8.2/xt/author/00-compile.t000644 000766 000024 00000002654 13572251451 017236 0ustar00davidstaff000000 000000 use 5.006; use strict; use warnings; # this test was generated with Dist::Zilla::Plugin::Test::Compile 2.058 use Test::More; plan tests => 2; my @module_files = ( 'BSON/XS.pm' ); # fake home for cpan-testers use File::Temp; local $ENV{HOME} = File::Temp::tempdir( CLEANUP => 1 ); my @switches = ( -d 'blib' ? '-Mblib' : '-Ilib', ); use File::Spec; use IPC::Open3; use IO::Handle; open my $stdin, '<', File::Spec->devnull or die "can't open devnull: $!"; my @warnings; for my $lib (@module_files) { # see L my $stderr = IO::Handle->new; diag('Running: ', join(', ', map { my $str = $_; $str =~ s/'/\\'/g; q{'} . $str . q{'} } $^X, @switches, '-e', "require q[$lib]")) if $ENV{PERL_COMPILE_TEST_DEBUG}; my $pid = open3($stdin, '>&STDERR', $stderr, $^X, @switches, '-e', "require q[$lib]"); binmode $stderr, ':crlf' if $^O eq 'MSWin32'; my @_warnings = <$stderr>; waitpid($pid, 0); is($?, 0, "$lib loaded ok"); shift @_warnings if @_warnings and $_warnings[0] =~ /^Using .*\bblib/ and not eval { +require blib; blib->VERSION('1.01') }; if (@_warnings) { warn @_warnings; push @warnings, @_warnings; } } is(scalar(@warnings), 0, 'no warnings found') or diag 'got warnings: ', ( Test::More->can('explain') ? Test::More::explain(\@warnings) : join("\n", '', @warnings) ); BSON-XS-v0.8.2/xt/author/pod-syntax.t000644 000766 000024 00000000252 13572251451 017467 0ustar00davidstaff000000 000000 #!perl # This file was automatically generated by Dist::Zilla::Plugin::PodSyntaxTests. use strict; use warnings; use Test::More; use Test::Pod 1.41; all_pod_files_ok(); BSON-XS-v0.8.2/xt/author/portability.t000644 000766 000024 00000000322 13572251451 017721 0ustar00davidstaff000000 000000 use strict; use warnings; use Test::More; eval 'use Test::Portability::Files'; plan skip_all => 'Test::Portability::Files required for testing portability' if $@; options(test_one_dot => 0); run_tests(); BSON-XS-v0.8.2/xt/author/pod-spell.t000644 000766 000024 00000000452 13572251451 017262 0ustar00davidstaff000000 000000 use strict; use warnings; use Test::More; # generated by Dist::Zilla::Plugin::Test::PodSpelling 2.007005 use Test::Spelling 0.12; use Pod::Wordlist; add_stopwords(); all_pod_files_spelling_ok( qw( bin lib ) ); __DATA__ BSON David Evans Golden Inc LeoNerd MongoDB Paul XS david leonerd lib BSON-XS-v0.8.2/xt/author/pod-coverage.t000644 000766 000024 00000000334 13572251451 017735 0ustar00davidstaff000000 000000 #!perl # This file was automatically generated by Dist::Zilla::Plugin::PodCoverageTests. use Test::Pod::Coverage 1.08; use Pod::Coverage::TrustPod; all_pod_coverage_ok({ coverage_class => 'Pod::Coverage::TrustPod' }); BSON-XS-v0.8.2/t/mapping/000755 000766 000024 00000000000 13572251451 015136 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/t/corpus/000755 000766 000024 00000000000 13572251451 015016 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/t/backend.t000644 000766 000024 00000001562 13572251451 015263 0ustar00davidstaff000000 000000 use 5.010001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; eval { require BSON }; is( $@, "", "No error loading BSON.pm" ); ok( $INC{"BSON/XS.pm"}, "Loading BSON.pm loads BSON::XS" ); is( BSON->can("_encode_bson"), BSON::XS->can("_encode_bson"), "correct encoder sub" ); is( BSON->can("_decode_bson"), BSON::XS->can("_decode_bson"), "correct decoder sub" ); my $h = { a => 1 }; is_deeply( BSON::decode( BSON::encode($h) ), $h, "round trip works with BSON::XS codec" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/README000644 000766 000024 00000001136 13572251451 014364 0ustar00davidstaff000000 000000 Tests in the 'common', 'corpus', 'lib', and 'mapping' folders and the top-level 'corpus' directory are copied verbatim from the BSON distribution on CPAN. Because they invoke BSON.pm for encoding and decoding, they will pick up BSON::XS and use it for tests. The t/pvtlib/CleanEnv.pm module in the *BSON* distribution blocks BSON::XS. The t/pvtlib/CleanEnv.pm module in *this* distribution blocks BSON::PP. This way, we can use the same set of tests for both distributions, ensuring backend compatibility. See the devel/sync-bson-tests.pl file to automatically update files from the BSON distribution. BSON-XS-v0.8.2/t/common/000755 000766 000024 00000000000 13572251451 014773 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/t/00-report-prereqs.t000644 000766 000024 00000013476 13572251451 017112 0ustar00davidstaff000000 000000 #!perl use strict; use warnings; # This test was generated by Dist::Zilla::Plugin::Test::ReportPrereqs 0.027 use Test::More tests => 1; use ExtUtils::MakeMaker; use File::Spec; # from $version::LAX my $lax_version_re = qr/(?: undef | (?: (?:[0-9]+) (?: \. | (?:\.[0-9]+) (?:_[0-9]+)? )? | (?:\.[0-9]+) (?:_[0-9]+)? ) | (?: v (?:[0-9]+) (?: (?:\.[0-9]+)+ (?:_[0-9]+)? )? | (?:[0-9]+)? (?:\.[0-9]+){2,} (?:_[0-9]+)? ) )/x; # hide optional CPAN::Meta modules from prereq scanner # and check if they are available my $cpan_meta = "CPAN::Meta"; my $cpan_meta_pre = "CPAN::Meta::Prereqs"; my $HAS_CPAN_META = eval "require $cpan_meta; $cpan_meta->VERSION('2.120900')" && eval "require $cpan_meta_pre"; ## no critic # Verify requirements? my $DO_VERIFY_PREREQS = 1; sub _max { my $max = shift; $max = ( $_ > $max ) ? $_ : $max for @_; return $max; } sub _merge_prereqs { my ($collector, $prereqs) = @_; # CPAN::Meta::Prereqs object if (ref $collector eq $cpan_meta_pre) { return $collector->with_merged_prereqs( CPAN::Meta::Prereqs->new( $prereqs ) ); } # Raw hashrefs for my $phase ( keys %$prereqs ) { for my $type ( keys %{ $prereqs->{$phase} } ) { for my $module ( keys %{ $prereqs->{$phase}{$type} } ) { $collector->{$phase}{$type}{$module} = $prereqs->{$phase}{$type}{$module}; } } } return $collector; } my @include = qw( JSON::PP JSON::XS CPanel::JSON::XS ); my @exclude = qw( ); # Add static prereqs to the included modules list my $static_prereqs = do './t/00-report-prereqs.dd'; # Merge all prereqs (either with ::Prereqs or a hashref) my $full_prereqs = _merge_prereqs( ( $HAS_CPAN_META ? $cpan_meta_pre->new : {} ), $static_prereqs ); # Add dynamic prereqs to the included modules list (if we can) my ($source) = grep { -f } 'MYMETA.json', 'MYMETA.yml'; my $cpan_meta_error; if ( $source && $HAS_CPAN_META && (my $meta = eval { CPAN::Meta->load_file($source) } ) ) { $full_prereqs = _merge_prereqs($full_prereqs, $meta->prereqs); } else { $cpan_meta_error = $@; # capture error from CPAN::Meta->load_file($source) $source = 'static metadata'; } my @full_reports; my @dep_errors; my $req_hash = $HAS_CPAN_META ? $full_prereqs->as_string_hash : $full_prereqs; # Add static includes into a fake section for my $mod (@include) { $req_hash->{other}{modules}{$mod} = 0; } for my $phase ( qw(configure build test runtime develop other) ) { next unless $req_hash->{$phase}; next if ($phase eq 'develop' and not $ENV{AUTHOR_TESTING}); for my $type ( qw(requires recommends suggests conflicts modules) ) { next unless $req_hash->{$phase}{$type}; my $title = ucfirst($phase).' '.ucfirst($type); my @reports = [qw/Module Want Have/]; for my $mod ( sort keys %{ $req_hash->{$phase}{$type} } ) { next if $mod eq 'perl'; next if grep { $_ eq $mod } @exclude; my $file = $mod; $file =~ s{::}{/}g; $file .= ".pm"; my ($prefix) = grep { -e File::Spec->catfile($_, $file) } @INC; my $want = $req_hash->{$phase}{$type}{$mod}; $want = "undef" unless defined $want; $want = "any" if !$want && $want == 0; my $req_string = $want eq 'any' ? 'any version required' : "version '$want' required"; if ($prefix) { my $have = MM->parse_version( File::Spec->catfile($prefix, $file) ); $have = "undef" unless defined $have; push @reports, [$mod, $want, $have]; if ( $DO_VERIFY_PREREQS && $HAS_CPAN_META && $type eq 'requires' ) { if ( $have !~ /\A$lax_version_re\z/ ) { push @dep_errors, "$mod version '$have' cannot be parsed ($req_string)"; } elsif ( ! $full_prereqs->requirements_for( $phase, $type )->accepts_module( $mod => $have ) ) { push @dep_errors, "$mod version '$have' is not in required range '$want'"; } } } else { push @reports, [$mod, $want, "missing"]; if ( $DO_VERIFY_PREREQS && $type eq 'requires' ) { push @dep_errors, "$mod is not installed ($req_string)"; } } } if ( @reports ) { push @full_reports, "=== $title ===\n\n"; my $ml = _max( map { length $_->[0] } @reports ); my $wl = _max( map { length $_->[1] } @reports ); my $hl = _max( map { length $_->[2] } @reports ); if ($type eq 'modules') { splice @reports, 1, 0, ["-" x $ml, "", "-" x $hl]; push @full_reports, map { sprintf(" %*s %*s\n", -$ml, $_->[0], $hl, $_->[2]) } @reports; } else { splice @reports, 1, 0, ["-" x $ml, "-" x $wl, "-" x $hl]; push @full_reports, map { sprintf(" %*s %*s %*s\n", -$ml, $_->[0], $wl, $_->[1], $hl, $_->[2]) } @reports; } push @full_reports, "\n"; } } } if ( @full_reports ) { diag "\nVersions for all modules listed in $source (including optional ones):\n\n", @full_reports; } if ( $cpan_meta_error || @dep_errors ) { diag "\n*** WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING ***\n"; } if ( $cpan_meta_error ) { my ($orig_source) = grep { -f } 'MYMETA.json', 'MYMETA.yml'; diag "\nCPAN::Meta->load_file('$orig_source') failed with: $cpan_meta_error\n"; } if ( @dep_errors ) { diag join("\n", "\nThe following REQUIRED prerequisites were not satisfied:\n", @dep_errors, "\n" ); } pass; # vim: ts=4 sts=4 sw=4 et: BSON-XS-v0.8.2/t/lib/000755 000766 000024 00000000000 13572251451 014251 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/t/pvtlib/000755 000766 000024 00000000000 13572251451 015003 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/t/00-report-prereqs.dd000644 000766 000024 00000010703 13572251451 017224 0ustar00davidstaff000000 000000 do { my $x = { 'configure' => { 'requires' => { 'Config::AutoConf' => '0.22', 'ExtUtils::MakeMaker' => '0', 'Path::Tiny' => '0.052', 'perl' => '5.008' } }, 'develop' => { 'requires' => { 'BSON' => '0', 'BSON::Types' => '0', 'Dist::Zilla' => '5', 'Dist::Zilla::Plugin::MakeMaker::Awesome' => '0.35', 'Dist::Zilla::Plugin::Prereqs' => '0', 'Dist::Zilla::Plugin::ReleaseStatus::FromVersion' => '0', 'Dist::Zilla::Plugin::RemovePrereqs' => '0', 'Dist::Zilla::PluginBundle::DAGOLDEN' => '0.072', 'File::Spec' => '0', 'File::Temp' => '0', 'IO::Handle' => '0', 'IPC::Open3' => '0', 'Pod::Coverage::TrustPod' => '0', 'Pod::Wordlist' => '0', 'Software::License::Apache_2_0' => '0', 'Test::CPAN::Meta' => '0', 'Test::LeakTrace' => '0', 'Test::MinimumVersion' => '0', 'Test::More' => '0.96', 'Test::Perl::Critic' => '0', 'Test::Pod' => '1.41', 'Test::Pod::Coverage' => '1.08', 'Test::Portability::Files' => '0', 'Test::Spelling' => '0.12', 'Test::Version' => '1', 'Tie::IxHash' => '0', 'inc::MakeMaker' => '0' } }, 'runtime' => { 'requires' => { 'BSON' => '1.012000', 'XSLoader' => '0', 'boolean' => '0', 'perl' => '5.010001', 'strict' => '0', 'version' => '0', 'warnings' => '0' } }, 'test' => { 'recommends' => { 'CPAN::Meta' => '2.120900' }, 'requires' => { 'B' => '0', 'BSON' => '1.012000', 'BSON::OID' => '0', 'BSON::Types' => '0', 'Carp' => '0', 'Data::Dumper' => '0', 'Devel::Peek' => '0', 'Exporter' => '0', 'ExtUtils::MakeMaker' => '0', 'File::Spec' => '0', 'JSON::MaybeXS' => '0', 'JSON::PP' => '2.97001', 'MIME::Base64' => '0', 'Math::BigInt' => '0', 'Path::Tiny' => '0.054', 'Scalar::Util' => '0', 'Test::Deep' => '0', 'Test::Fatal' => '0', 'Test::More' => '0.96', 'Tie::IxHash' => '0', 'base' => '0', 'constant' => '0', 'lib' => '0', 'perl' => '5.010001', 'utf8' => '0' } } }; $x; }BSON-XS-v0.8.2/t/regression/000755 000766 000024 00000000000 13572251451 015663 5ustar00davidstaff000000 000000 BSON-XS-v0.8.2/t/regression/boolean_copy.t000644 000766 000024 00000001224 13572251451 020520 0ustar00davidstaff000000 000000 use strict; use warnings; use Test::More; use Test::Fatal; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use BSON; use boolean; my $c = BSON->new; # PERL-575 boolean values were references to each other, so if two were created # identically, then changing one would change the other. my $a = { "okay" => false, "name" => "fred0" }; my $b = { "okay" => false, "name" => "fred1" }; my $a_bin = $c->encode_one( $a ); my $b_bin = $c->encode_one( $b ); my @docs = ( map{ $c->decode_one( $_ ) } ( $a_bin, $b_bin ) ); is( exception { $_->{okay} = $_->{okay}->TO_JSON for @docs }, undef, "replacing one boolean doesn't affect another" ); done_testing; BSON-XS-v0.8.2/t/regression/scalar_ref_value.t000644 000766 000024 00000000644 13572251451 021351 0ustar00davidstaff000000 000000 use strict; use warnings; use Test::More; use Test::Fatal; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use BSON; use boolean; my $c = BSON->new; # PERL-489 Providing a reference to a scalar was giving the memory reference not # the scalar my $value = 42.2; $value = "hello"; is( exception { $c->encode_one( { value => \$value } ) }, undef, "encoding ref to PVNV is not fatal", ); done_testing; BSON-XS-v0.8.2/t/regression/undef_round_trip.t000644 000766 000024 00000001477 13572251451 021427 0ustar00davidstaff000000 000000 use strict; use warnings; use Test::More; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use BSON; use Tie::IxHash; my $c = BSON->new; # PERL-543 deflation to BSON then back (via database?) caused undef to be an empty string subtest 'tied Tie::IxHash' => sub { my %h; tie( %h, 'Tie::IxHash', h => undef ); my $bin = $c->encode_one( \%h ); my $doc = $c->decode_one( $bin ); is $doc->{h}, undef, 'round trip undef'; }; subtest 'OO Tie::IxHash' => sub { my $h = Tie::IxHash->new( h => undef ); my $bin = $c->encode_one( $h ); my $doc = $c->decode_one( $bin ); is $doc->{h}, undef, 'round trip undef'; }; subtest 'standard hash' => sub { my %doc = ( h => undef ); my $bin = $c->encode_one( \%doc ); my $doc = $c->decode_one( $bin ); is $doc->{h}, undef, 'round trip undef'; }; done_testing; BSON-XS-v0.8.2/t/pvtlib/CleanEnv.pm000644 000766 000024 00000000710 13572251451 017032 0ustar00davidstaff000000 000000 use 5.010001; use strict; use warnings; package CleanEnv; # Tiny equivalent of Devel::Hide to disable BSON::PP. This is probably # unnecessary but ensures that there isn't a fallback we don't notice. use lib map { my ( $m, $c ) = ( $_, qq{die "Can't locate $_ (hidden)\n"} ); sub { return unless $_[1] eq $m; open my $fh, "<", \$c; return $fh } } qw{BSON/PP.pm}; # Keep environment from interfering with tests $ENV{PERL_BSON_BACKEND} = ""; 1; BSON-XS-v0.8.2/t/lib/TestUtils.pm000644 000766 000024 00000006233 13572251451 016553 0ustar00davidstaff000000 000000 use 5.010001; use strict; use warnings; use Test::More 0.96; # Hijack the JSON::PP::USE_B constant to enable svtype detection BEGIN { no warnings 'redefine'; require constant; my $orig = constant->can('import'); local *constant::import = sub { if ($_[1] eq 'USE_B') { pop(@_); push(@_, 1) } goto &$orig; }; require JSON::PP; die "TOO LATE" unless JSON::PP::USE_B(); } use B; use Carp qw/croak/; use Config; use JSON::PP (); use base 'Exporter'; our @EXPORT = qw/ sv_type packed_is bytes_are to_extjson to_myjson try_or_fail normalize_json INT64 INT32 FLOAT /; use constant { INT64 => 'q<', INT32 => 'l<', FLOAT => 'd<', }; my $json_codec = JSON::PP ->new ->ascii ->allow_bignum ->allow_blessed ->convert_blessed; sub normalize_json { my $decoded = $json_codec->decode(shift); return $json_codec->encode($decoded); } sub to_extjson { my $data = BSON->perl_to_extjson($_[0], { relaxed => $_[1] }); return $json_codec->encode($data); } sub to_myjson { local $ENV{BSON_EXTJSON} = 0; return $json_codec->encode( shift ); } sub sv_type { my $v = shift; my $b_obj = B::svref_2object( \$v ); my $type = ref($b_obj); $type =~ s/^B:://; return $type; } sub packed_is { croak("Not enough args for packed_is()") unless @_ >= 3; my ( $template, $got, $exp, $label ) = @_; $label = '' unless defined $label; local $Test::Builder::Level = $Test::Builder::Level + 1; my $ok; if ( $template eq INT64 && ! $Config{use64bitint} ) { if ( !ref($got) && !ref($exp) ) { # regular scalar will fit in 32 bits, so downgrade the template $template = INT32; } else { # something is a reference, so must be BigInt or equivalent $ok = ok( $got eq $exp, $label ); diag "Got: $got, Expected: $exp" unless $ok; return $ok; } } $ok = ok( pack( $template, $got ) eq pack( $template, $exp ), $label ); diag "Got: $got, Expected: $exp" unless $ok; return $ok; } sub bytes_are { croak("Not enough args for bytes_are()") unless @_ >= 2; my ( $got, $exp, $label ) = @_; $label = '' unless defined $label; local $Test::Builder::Level = $Test::Builder::Level + 1; my $ok = ok( $got eq $exp, $label ); diag "Got:\n", unpack( "H*", $got ), "\nExpected:\n", unpack( "H*", $exp ) unless $ok; return $ok; } sub try_or_fail { my ($code, $label) = @_; eval { $code->() }; if ( my $err = $@ ) { fail($label); diag "Error:\n$err"; return; } return 1; } # Based on Deep::Hash::Utils nest sub create_nest { my ($depth) = @_; my $orig = my $hr = {}; my @numbers = ( 1 .. $depth ); while (my $key = shift @numbers) { $hr->{$key} = @numbers ? {} : undef; $hr = $hr->{$key}; } return $orig; } 1; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/lib/CorpusTest.pm000644 000766 000024 00000027447 13572251451 016740 0ustar00davidstaff000000 000000 use 5.010001; use strict; use warnings; use Test::More 0.96; use Test::Deep qw/!blessed/; # Hijack the JSON::PP::USE_B constant to enable svtype detection BEGIN { no warnings 'redefine'; require constant; my $orig = constant->can('import'); local *constant::import = sub { if ($_[1] eq 'USE_B') { pop(@_); push(@_, 1) } goto &$orig; }; require JSON::PP; die "TOO LATE" unless JSON::PP::USE_B(); } use JSON::PP 2.97001; use BSON; use BSON::Types ':all'; use Config; use Path::Tiny 0.054; # better basename use Data::Dumper; # from t/lib use TestUtils; use constant { IS_JSON_PP => 1, }; use base 'Exporter'; our @EXPORT = qw/test_corpus_file/; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; # overridden to allow Tie::IxHash hashes to be created by JSON::PP my $orig = JSON::PP->can("object") or die "Unable to find JSON::PP::object to override"; do { no warnings 'redefine'; *JSON::PP::object = sub { tie my %hash, 'Tie::IxHash'; my $value = $orig->(\%hash); return $value; }; }; my $JSON = JSON::PP ->new ->ascii ->allow_bignum ->allow_blessed ->convert_blessed; sub test_corpus_file { my ($file) = @_; local $Test::Builder::Level = $Test::Builder::Level + 1; my $f = path( "corpus", $file ); my $base = $f->basename; my $json = eval { decode_json( $f->slurp ) }; if ( my $err = $@ ) { fail("$base failed to load"); diag($err); return; } subtest 'JSON::PP Tie::IxHash injection' => sub { my $data = $JSON->decode('{"x":23}'); ok defined(tied %$data), 'JSON::PP returns tied objects'; }; _validity_tests($json); _decode_error_tests($json); _parse_error_tests($json); } sub _validity_tests { my ($json) = @_; local $Test::Builder::Level = $Test::Builder::Level + 1; # suppress caching that throws off Test::Deep local $BSON::Types::NoCache = 1; my $bson_type = $json->{bson_type}; my $deprecated = $json->{deprecated}; for my $case ( @{ $json->{valid} } ) { subtest 'case: '.$case->{description} => sub { local $Data::Dumper::Useqq = 1; my $wrap = $bson_type =~ /\A(?:0x00|0x01|0x10|0x12)\z/; my $codec = BSON->new( prefer_numeric => 1, wrap_numbers => $wrap, ordered => 1 ); my $lossy = $case->{lossy}; my $canonical_bson = $case->{canonical_bson}; my $converted_bson = $case->{converted_bson}; my $degenerate_bson = $case->{degenerate_bson}; $canonical_bson = pack('H*', $canonical_bson); $converted_bson = pack('H*', $converted_bson) if defined $converted_bson; $degenerate_bson = pack('H*', $degenerate_bson) if defined $degenerate_bson; my $canonical_json = $case->{canonical_extjson}; my $converted_json = $case->{converted_extjson}; my $degenerate_json = $case->{degenerate_extjson}; my $relaxed_json = $case->{relaxed_extjson}; $canonical_json = _normalize( $canonical_json, '$desc: normalizing canonical extjson', ); $converted_json = _normalize( $converted_json, '$desc: normalizing converted extjson', ); $degenerate_json = _normalize( $degenerate_json, '$desc: normalizing degenerate extjson', ); $relaxed_json = _normalize( $relaxed_json, '$desc: normalizing relaxed extjson', ); ## ## for cB input (canonical BSON) ## bytes_are( _native_to_bson($codec, _bson_to_native($codec, $canonical_bson), ), $deprecated ? $converted_bson : $canonical_bson, 'native_to_bson(bson_to_native(cB)) = cB', ); is( _normalize_numbers( _native_to_canonical_extended_json($codec, _bson_to_native($codec, $canonical_bson), ) ), _normalize_numbers( $deprecated ? $converted_json : $canonical_json, ), 'native_to_canonical_extended_json(bson_to_native(cB)) = cEJ', ); is( _normalize_numbers( _native_to_relaxed_extended_json($codec, _bson_to_native($codec, $canonical_bson), ) ), _normalize_numbers($relaxed_json), 'native_to_relaxed_extended_json(bson_to_native(cB)) = rEJ', ) unless not defined $relaxed_json; ## ## for cEJ input (canonical Extended JSON) ## is( _normalize_numbers( _native_to_canonical_extended_json($codec, _extjson_to_native($codec, $canonical_json), ) ), _normalize_numbers( $deprecated ? $converted_json : $canonical_json, ), 'native_to_canonical_extended_json(json_to_native(cEJ)) = cEJ', ); bytes_are( _native_to_bson($codec, _extjson_to_native($codec, $canonical_json), ), $deprecated ? $converted_bson : $canonical_bson, 'native_to_bson(json_to_native(cEJ)) = cB' ) unless $lossy; ## ## for dB input (degenerate BSON) ## if (defined $degenerate_bson) { bytes_are( _native_to_bson($codec, _bson_to_native($codec, $degenerate_bson), ), $canonical_bson, 'native_to_bson(bson_to_native(dB)) = cB', ) } ## ## for dEJ input (degenerate Extended JSON) ## if (defined $degenerate_json) { is( _normalize_numbers( _native_to_canonical_extended_json($codec, _extjson_to_native($codec, $degenerate_json), ) ), _normalize_numbers( $deprecated ? $converted_json : $canonical_json, ), 'native_to_canonical_extended_json(json_to_native(dEJ)) = cEJ', ); bytes_are( _native_to_bson($codec, _extjson_to_native($codec, $degenerate_json), ), $deprecated ? $converted_bson : $canonical_bson, 'native_to_bson(json_to_native(dEJ)) = cB' ) unless $lossy; } ## ## for rEJ input (relaxed Extended JSON) ## if (defined $relaxed_json) { is( _normalize_numbers( _native_to_relaxed_extended_json($codec, _extjson_to_native($codec, $relaxed_json), ) ), _normalize_numbers($relaxed_json), 'native_to_relaxed_extended_json(json_to_native(rEJ)) = rEJ', ); } }; } return; } sub _normalize { my ($json, $desc) = @_; return unless defined $json; try_or_fail( sub { $json = to_myjson( $JSON->decode( $json ) ); }, $desc ) or next; return $json; } sub _normalize_numbers { my ($value) = @_; return undef unless defined $value; $value =~ s{"0.0"}{"0"}g; $value =~ s{"-0.0"}{"0"}g; $value =~ s{"-0"}{"0"}g; $value =~ s{"1.0"}{"1"}g; $value =~ s{"-1.0"}{"-1"}g; $value =~ s[{"d":-0.0}][{"d":0}]g; $value =~ s[{"d":-0}][{"d":0}]g; $value =~ s[{"d":0.0}][{"d":0}]g; $value =~ s[(-?)1\.2345\d+(?:[eE]\+\d+)?][${1}1234567890...]g; $value =~ s[-1234567890123456768][-1234567890...]g; $value =~ s[1234567890123456768][1234567890...]g; # Power8 specific normalization $value =~ s[-1234567890123456770][-1234567890...]g; $value =~ s[1234567890123456770][1234567890...]g; return $value; } sub _native_to_bson { my ($codec, $native) = @_; my $bson; try_or_fail( sub { $bson = $codec->encode_one($native) }, q{Couldn't convert from native Perl to BSON}, ) or return undef; return $bson; } sub _bson_to_native { my ($codec, $bson) = @_; my $native; try_or_fail( sub { $native = $codec->decode_one($bson) }, q{Couldn't convert from BSON to native Perl}, ) or return undef; return $native; } sub _extjson_to_native { my ($codec, $extjson) = @_; my $native_extjson; try_or_fail( sub { $native_extjson = $JSON->decode($extjson) }, q{Couldn't decode JSON to native ExtJSON}, ) or return undef; my $native; try_or_fail( sub { $native = $codec->extjson_to_perl($native_extjson) }, q{Couldn't convert from native ExtJSON to native Perl}, ) or return undef; return $native; } sub _native_to_relaxed_extended_json { my ($codec, $native) = @_; my $native_extjson; try_or_fail( sub { $native_extjson = $codec->perl_to_extjson($native, {relaxed => 1}) }, q{Couldn't convert from native Perl to native relaxed ExtJSON}, ) or return undef; my $extjson; try_or_fail( sub { $extjson = $JSON->encode($native_extjson) }, q{Couldn't encode native ExtJSON as JSON}, ) or return undef; return $extjson; } sub _native_to_canonical_extended_json { my ($codec, $native) = @_; my $native_extjson; try_or_fail( sub { $native_extjson = $codec->perl_to_extjson($native, {relaxed => 0}) }, q{Couldn't convert from native Perl to native canonical ExtJSON}, ) or return undef; my $extjson; try_or_fail( sub { $extjson = $JSON->encode($native_extjson) }, q{Couldn't encode native ExtJSON as JSON}, ) or return undef; return $extjson; } sub _decode_error_tests { my ($json) = @_; local $Test::Builder::Level = $Test::Builder::Level + 1; return unless $json->{decodeErrors}; for my $case ( @{ $json->{decodeErrors} } ) { my $desc = $case->{description}; my $bson = pack( "H*", $case->{bson} ); eval { BSON::decode($bson) }; ok( length($@), "Decode error: $desc:" ); } } my %PARSER = ( '0x00' => sub { bson_doc(shift) }, '0x13' => sub { bson_decimal128(shift) }, ); sub _parse_error_tests { my ($json) = @_; local $Test::Builder::Level = $Test::Builder::Level + 1; my $parser = $PARSER{$json->{bson_type}}; if ( $json->{parseErrors} && !$parser ) { BAIL_OUT("No parseError parser available for $json->{bson_type}"); } for my $case ( @{ $json->{parseErrors} } ) { eval { $parser->($case->{string}) }; ok( $@, "$case->{description}: parse should throw an error " ) or diag "Input was: $case->{string}"; } } 1; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/lib/TestTie.pm000644 000766 000024 00000000462 13572251451 016172 0ustar00davidstaff000000 000000 package # hide from PAUSE TestTie::Scalar; @ISA = qw(Tie::Scalar); sub TIESCALAR { my $class = shift; my $instance = @_ ? shift : undef; return bless \$instance => $class; } sub FETCH { return ${$_[0]}; } sub STORE { ${$_[0]} = $_[1]; } sub DESTROY { undef ${$_[0]}; } 1; BSON-XS-v0.8.2/t/common/bson_array.t000644 000766 000024 00000001724 13572251451 017323 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use Test::Deep; use BSON; use BSON::Types ':all'; my $c = BSON->new; my $pipeline = [ { '$replaceRoot' => { 'newRoot' => '$t' } }, { '$addFields' => { 'foo' => 1 } } ]; my $b_array = bson_array(@$pipeline); ok(ref $b_array eq 'BSON::Array', 'bson_array'); is_deeply( $c->decode_one( $c->encode_one({ u => $b_array }) ), $c->decode_one( $c->encode_one({ u => $pipeline }) ), 'encode bson array' ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/common/tied.t000644 000766 000024 00000001161 13572251451 016104 0ustar00davidstaff000000 000000 use strict; use warnings; use Test::More; use Test::Fatal; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestTie; use BSON; # PERL-737 encoding of simple tied var ok(my $c = BSON->new, 'got codec object'); my ($number, $str) = (5, 'hello'); my $var; tie $var, 'TestTie::Scalar'; $var = $number; my $varnum_bin = $c->encode_one({ mytied => $var }); ok( $c->decode_one($varnum_bin)->{'mytied'} == $number, 'round trip for tie var' ); $var = $str; my $varstr_bin = $c->encode_one({ mytied => $var }); is( $c->decode_one($varstr_bin)->{'mytied'}, $str, 'round trip for tie var' ); done_testing; BSON-XS-v0.8.2/t/common/cycle.t000644 000766 000024 00000002306 13572251451 016260 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON; use BSON::Types ':all'; my $c = BSON->new; my $q = {}; $q->{'q'} = $q; eval { $c->encode_one($q); }; like( $@, qr/circular ref/, "circular hashref" ); my %test; tie %test, 'Tie::IxHash'; $test{t} = \%test; eval { $c->encode_one( \%test ); }; like( $@, qr/circular ref/, "circular tied hashref" ); my $tie = Tie::IxHash->new; $tie->Push( "t" => $tie ); eval { $c->encode_one($tie); }; like( $@, qr/circular ref/, "circular Tie::IxHash object" ); # Multiple deep cycles my $inner1 = { Z1 => { X => 1 } }; my $inner2 = { Z2 => { Y => 2 } }; $inner1->{inner2} = $inner2; $inner2->{inner1} = $inner1; my $outer = { A => $inner1, B => $inner2 }; eval { $c->encode_one($outer); }; like( $@, qr/circular ref/, "circular deep object" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/common/number_heuristics.t000644 000766 000024 00000004764 13572251451 020725 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use B; use BSON; use BSON::Types ':all'; use Devel::Peek; use Scalar::Util qw/dualvar/; my $pn0 = BSON->new( prefer_numeric => 0 ); my $pn1 = BSON->new( prefer_numeric => 1 ); my $dec = BSON->new( wrap_numbers => 1, wrap_strings => 1 ); sub _flags { my $value = shift; return B::svref_2object( \$value )->FLAGS; } sub w_iv { _flags(shift) & B::SVf_IOK } sub wo_iv { _flags(shift) & ~B::SVf_IOK } sub w_nv { _flags(shift) & B::SVf_NOK } sub wo_nv { _flags(shift) & ~B::SVf_NOK } sub w_pv { _flags(shift) & B::SVf_POK } sub w_pviv { w_pv( $_[0] ) && w_iv( $_[0] ) } sub w_pvnv { w_pv( $_[0] ) && w_nv( $_[0] ) } sub w_pvonly { w_pv( $_[0] ) && !( w_iv( $_[0] ) || w_nv( $_[0] ) ) } sub _dump { my $x = shift; my $dump; open my $fh, ">", \$dump; local *STDERR = $fh; Dump($x); return $dump; } sub _rt { my ( $encoder, $x ) = @_; return $dec->decode_one( $encoder->encode_one($x) ); } # LABEL, INPUT, FLAGS, OUTPUT W/O PREFER_NUMERIC, OUTPUT W/ PREFER_NUMERIC # # Uses 'dualvar()' to construct duals because other forms of NV->PVNV # conversion don't consistently set POK on all Perl versions. my @cases = ( [ 'Pure int', 42, \&w_iv, 'BSON::Int32', 'BSON::Int32' ], [ 'String int', "42", \&w_pvonly, 'BSON::String', 'BSON::Int32' ], [ 'Dual int', dualvar( 42, "42" ), \&w_pviv, 'BSON::Int32', 'BSON::Int32' ], [ 'Pure double', 3.14, \&w_nv, 'BSON::Double', 'BSON::Double' ], [ 'String double', "3.14", \&w_pvonly, 'BSON::String', 'BSON::Double' ], [ 'Dual double', dualvar( 3.14, "3.14" ), \&w_pvnv, 'BSON::Double', 'BSON::Double' ], ); for my $c (@cases) { my ( $label, $x, $type_chk, $y0, $y1 ) = @$c; ok( $type_chk->($x), "$label: SvTYPE(s)" ) or diag _dump($x); my $doc = { x => $x }; for my $enc ( [ "prefer_numeric=0", $pn0, $y0 ], [ "prefer_numeric=1", $pn1, $y1 ] ) { my $rt_x = _rt( $enc->[1], $doc )->{x}; is( ref($rt_x), $enc->[2], "$label: $enc->[0]" ); like( $rt_x->value, qr/\Q$x\E/, "$label: value matches $x" ); } } done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/common/errors.t000644 000766 000024 00000006575 13572251451 016511 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; { my $obj = bless {}, "Some::Random::Class"; eval { encode( { a => $obj } ) }; like( $@, qr/For key 'a', can't encode value of type 'Some::Random::Class'/, "encoding unknown type is fatal" ); } { my $bson = encode( { a => 1.1 } ); # swap the type byte to an unknown one substr($bson,4,1,"\xEE"); eval { decode($bson) }; like( $@, qr/unsupported BSON type \\xEE for key 'a'\. Are you using the latest version/, "decoding unknown type is fatal" ); } { no warnings 'once'; my $glob = *foo; eval { encode( \$glob ) }; like( $@, qr/Can't encode non-container of type 'GLOB'/, "encoding non-container is fatal" ); } { my $with_null= "Hello\0World"; eval { encode( { $with_null => 123 } ) }; like( $@, qr/Key 'Hello\\x00World' contains null character/, "encoding embedded null is fatal" ); } { eval { encode( "Hello world" ) }; like( $@, qr/Can't encode scalars/, "encoding scalar is fatal" ); } { eval { encode( qr/abc/ ) }; like( $@, qr/Can't encode non-container of type '.*'/, "encoding non-container is fatal" ); } { my $str = "123"; my $obj = bless \$str, "Some::Object"; eval { encode( $obj ) }; like( $@, qr/Can't encode non-container of type 'Some::Object'/, "encoding hash-type object is fatal" ); } subtest nesting => sub { my $err; eval { encode( create_nest(100) ) }; $err = $@; is( $err, '', "No error encoding 100 levels of hash" ); eval { encode( create_nest(101) ) }; $err = $@; like( $err, qr/Exceeded max object depth of 100/, "Hit the specified max depth encoding documents at 101 levels of hash" ) or diag($err); eval { encode( { 0 => [ map { create_nest(98) } 1 .. 5 ] } ) }; $err = $@; is( $err, '', "No error at 100 levels of hash+array+hash" ); eval { encode( { 0 => [ map { create_nest(99) } 1 .. 5 ] } ) }; $err = $@; like( $err, qr/Exceeded max object depth of 100/, "Hit the specified max depth encoding documents at 101 levels of hash+array+hash" ) or diag($err); # synthesize 10 and 101 levels of BSON my $bson_100 = encode( create_nest(100) ); my $bson_101 = pack("l [ map { BSON::Raw->new(bson => encode({ b => 1 }, $opt)) } 1 .. 100 ] }, $opt ); }; $err = $@; is( $err, '', "No error encoding 100 Raw docs with same options" ); }; done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/common/options.t000644 000766 000024 00000013524 13572251451 016660 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON; use BSON::Types ':all'; sub _BSON { BSON->new(@_) } subtest "error_callback" => sub { my $bad = "\x05\x00\x00\x00\x01"; my @errs; my $obj = _BSON( error_callback => sub { push @errs, [@_] } ); $obj->decode_one($bad); is( 0+ @errs, 1, "error_callback ran" ); # 'error reading' is from BSON::XS like( $errs[0][0], qr/error reading|not null terminated/i, "error_callback arg 0" ); is( ${ $errs[0][1] }, $bad, "error_callback arg 1" ); is( $errs[0][2], 'decode_one', "error_callback arg 2" ); }; subtest "invalid_char" => sub { my $obj = _BSON( invalid_chars => '.' ); eval { $obj->encode_one( { "example.com" => 1 } ) }; like( $@, qr/key 'example\.com' has invalid character\(s\) '\.'/, "invalid char throws exception" ); $obj = _BSON( invalid_chars => '.$' ); eval { $obj->encode_one( { "example.c\$om" => 1 } ) }; like( $@, qr/key 'example\.c\$om' has invalid character\(s\) '\.\$'/, "multi-invalid chars throws exception" ); }; subtest "max_length" => sub { my $obj = _BSON( max_length => 20 ); my $hash = { "example.com" => "a" x 100 }; my $encoded = _BSON->encode_one($hash); eval { $obj->encode_one($hash) }; like( $@, qr/encode_one.*Document exceeds maximum size 20/, "max_length exceeded during encode_one" ); eval { $obj->decode_one($encoded) }; like( $@, qr/decode_one.*Document exceeds maximum size 20/, "max_length exceeded during decode_one" ); }; subtest "op-char" => sub { my $obj = _BSON( op_char => '-' ); my $hash = { -inc => { x => 1 } }; my $expect = { '$inc' => { x => 1 } }; my $got = $obj->decode_one( $obj->encode_one($hash) ); is_deeply( $got, $expect, "op-char converts to '\$'" ) or diag explain $got; }; subtest "prefer_numeric" => sub { my $hash = { x => "42" }; my $pn0 = _BSON( prefer_numeric => 0 ); my $pn1 = _BSON( prefer_numeric => 1 ); my $dec = _BSON( wrap_numbers => 1, wrap_strings => 1 ); is( ref( $dec->decode_one( $pn1->encode_one($hash) )->{x} ), 'BSON::Int32', 'prefer_numeric => 1' ); is( ref( $dec->decode_one( $pn0->encode_one($hash) )->{x} ), 'BSON::String', 'prefer_numeric => 0' ); }; subtest "first_key" => sub { my @doc = ( x => 42, y => 23, z => { a => 1, b => 2 } ); my $obj = _BSON( ordered => 1 ); my $got = $obj->decode_one( $obj->encode_one( bson_doc(@doc), { first_key => 'y', first_value => 32 } ) ); my ( $k, $v ) = each %$got; is( $k, 'y', "first_key put first" ); is( $v, 32, "first_value overrode existing value" ); ok( !exists $got->{z}{_id}, "first_key doesn't propagate" ); # empty doc with first_key $got = $obj->decode_one( $obj->encode_one( bson_doc(), { first_key => 'y', first_value => 32 } ) ); ( $k, $v ) = each %$got; is( $k, 'y', "first_key put first" ); is( $v, 32, "first_value overrode existing value" ); }; subtest "dt_type" => sub { my $now = time; # undef { my $obj = _BSON( dt_type => undef ); my $bson = $obj->encode_one( { A => bson_time() } ); my $hash = $obj->decode_one($bson); is( ref( $hash->{A} ), 'BSON::Time', "dt_type = undef" ); } # BSON::Time { my $obj = _BSON( dt_type => "BSON::Time" ); my $bson = $obj->encode_one( { A => bson_time() } ); my $hash = $obj->decode_one($bson); is( ref( $hash->{A} ), 'BSON::Time', "dt_type = BSON::Time" ); } # DateTime SKIP: { eval { require DateTime }; skip( "DateTime not installed", 1 ) unless $INC{'DateTime.pm'}; my $obj = _BSON( dt_type => "DateTime" ); my $bson = $obj->encode_one( { A => bson_time() } ); my $hash = $obj->decode_one($bson); is( ref( $hash->{A} ), 'DateTime', "dt_type = DateTime" ); } # DateTime::Tiny SKIP: { eval { require DateTime::Tiny }; skip( "DateTime::Tiny not installed", 1 ) unless $INC{'DateTime/Tiny.pm'}; my $obj = _BSON( dt_type => "DateTime::Tiny" ); my $bson = $obj->encode_one( { A => bson_time() } ); my $hash = $obj->decode_one($bson); is( ref( $hash->{A} ), 'DateTime::Tiny', "dt_type = DateTime::Tiny" ); } # Time::Moment SKIP: { eval { require Time::Moment }; skip( "Time::Moment not installed", 1 ) unless $INC{'Time/Moment.pm'}; my $obj = _BSON( dt_type => "Time::Moment" ); my $bson = $obj->encode_one( { A => bson_time() } ); my $hash = $obj->decode_one($bson); is( ref( $hash->{A} ), 'Time::Moment', "dt_type = Time::Moment" ); } # Mango::BSON::Time SKIP: { eval { require Mango::BSON::Time }; skip( "Mango::BSON::Time not installed", 1 ) unless $INC{'Mango/BSON/Time.pm'}; my $obj = _BSON( dt_type => "Mango::BSON::Time" ); my $bson = $obj->encode_one( { A => bson_time() } ); my $hash = $obj->decode_one($bson); is( ref( $hash->{A} ), 'Mango::BSON::Time', "dt_type = Mango::BSON::Time" ); } # unknown { my $obj = _BSON( dt_type => 'BOGUS' ); my $bson = $obj->encode_one( { A => bson_time() } ); eval { $obj->decode_one($bson) }; like( $@, qr/unsupported dt_type/i, "dt_type = BOGUS" ); } }; done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/common/top-array.t000644 000766 000024 00000001255 13572251451 017101 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON; use BSON::Types ':all'; my $c = BSON->new; my $from_array = $c->encode_one( [ a => 23 ] ); my $from_hash = $c->encode_one( { a => 23 } ); bytes_are( $from_array, $from_hash, "encode_one( [...] )" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/common/create_oid.t000644 000766 000024 00000002412 13572251451 017255 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use BSON; use BSON::OID; subtest 'test timestamp field' => sub { my %test_ts_data = ( 2147483648 => "\x80" . ("\x00" x 11), 4294967295 => ("\xFF" x 4) . ("\x00" x 8) ); while ( my ($time, $test_oid) = each %test_ts_data) { my $oid = BSON::OID->new(oid => $test_oid); ok( $time == $oid->get_time ); } }; sub check_counter { my ($oid, $counter) = @_; my $inc = unpack( 'a3', substr( $oid->{'oid'}, 9, 3 ) ); is($inc, substr( pack('N', $counter), 1, 3 ), 'check the oid has the given counter' ); } subtest 'test counter' => sub { ok(my $oid = BSON->create_oid); isa_ok($oid, 'BSON::OID'); ok($oid->__reset_counter); # Set internal counter to 0XFFFFFE check_counter( BSON->create_oid, 0xFFFFFF ); check_counter( BSON->create_oid, 0x000000 ); }; done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/common/dualvar.t000644 000766 000024 00000001161 13572251451 016615 0ustar00davidstaff000000 000000 use strict; use warnings; use Test::More; use Test::Fatal; use Scalar::Util 'dualvar'; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use BSON; # PERL-737 encoding of dual vars # should look have an NV representation and be encoded as numbers ok(my $c = BSON->new, 'got codec object'); my ($number, $str) = (5, 'hello'); my $dualvar = dualvar($number, $str); ok($dualvar == $number, 'dual var is a number'); is($dualvar, $str, 'dual var is a string'); my $dualvar_bin = $c->encode_one({ dual => $dualvar }); ok( $c->decode_one($dualvar_bin)->{'dual'} == $number, 'round trip for dual var' ); done_testing; BSON-XS-v0.8.2/t/corpus/dbref.t000644 000766 000024 00000000676 13572251451 016276 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/oid.t000644 000766 000024 00000000675 13572251451 015766 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/decimal128-6.t000644 000766 000024 00000000675 13572251451 017207 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/decimal128-2.t000644 000766 000024 00000000675 13572251451 017203 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/symbol.t000644 000766 000024 00000000675 13572251451 016520 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/int64.t000644 000766 000024 00000000675 13572251451 016157 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/decimal128-5.t000644 000766 000024 00000000675 13572251451 017206 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/null.t000644 000766 000024 00000000675 13572251451 016165 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/code.t000644 000766 000024 00000000675 13572251451 016125 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/decimal128-1.t000644 000766 000024 00000000675 13572251451 017202 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/datetime.t000644 000766 000024 00000000675 13572251451 017007 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/regex.t000644 000766 000024 00000000675 13572251451 016325 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/undefined.t000644 000766 000024 00000000675 13572251451 017154 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/decimal128-4.t000644 000766 000024 00000000675 13572251451 017205 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/top.t000644 000766 000024 00000000675 13572251451 016015 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/int32.t000644 000766 000024 00000000675 13572251451 016152 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/boolean.t000644 000766 000024 00000000675 13572251451 016632 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/document.t000644 000766 000024 00000000675 13572251451 017031 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/array.t000644 000766 000024 00000000675 13572251451 016331 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/multi-type.t000644 000766 000024 00000000676 13572251451 017325 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/double.t000644 000766 000024 00000000675 13572251451 016465 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/decimal128-7.t000644 000766 000024 00000000675 13572251451 017210 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/maxkey.t000644 000766 000024 00000000675 13572251451 016511 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/decimal128-3.t000644 000766 000024 00000000675 13572251451 017204 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/dbpointer.t000644 000766 000024 00000000675 13572251451 017201 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/timestamp.t000644 000766 000024 00000000675 13572251451 017216 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/minkey.t000644 000766 000024 00000000675 13572251451 016507 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/string.t000644 000766 000024 00000000675 13572251451 016521 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/code_w_scope.t000644 000766 000024 00000000675 13572251451 017644 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/binary.t000644 000766 000024 00000000675 13572251451 016477 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/corpus/corpus.pl000644 000766 000024 00000000651 13572251451 016670 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use Path::Tiny; use lib 't/lib'; use CleanEnv; use CorpusTest; test_corpus_file( path($0)->basename(".t") . ".json" ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/dbref.t000644 000766 000024 00000004267 13572251451 016416 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; use Tie::IxHash; my ( $bson, $expect, $hash ); # test BSON::DBRef constructor eval { bson_dbref() }; like( $@, qr/arguments to bson_dbref/i, "empty bson_dbref() throws error" ); eval { bson_dbref("12345") }; like( $@, qr/arguments to bson_dbref/i, "bson_dbref(ID) throws error" ); eval { bson_dbref( "12345", "test", more => "stuff" ) }; like( $@, qr/arguments to bson_dbref/i, "bson_dbref(ID,REF,EXTRA) throws error" ); # test mapping my $dbref = bson_dbref( "12345", "foo" ); my $input = { A => $dbref }; # BSON::DBRef-> BSON::DBRef { $expect = $bson = encode($input); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::DBRef', "BSON::DBRef->BSON::DBRef" ); is( $hash->{A}->id, $dbref->id, "DBRef id" ); is( $hash->{A}->ref, $dbref->ref, "DBRef ref" ); } # BSON::DBRef->HASH { $expect = $bson = encode($input); $hash = decode( $bson, wrap_dbrefs => 0 ); is( ref( $hash->{A} ), 'HASH', "BSON::DBRef->HASH" ); is( $hash->{A}{'$id'}, $dbref->id, "\$id" ); is( $hash->{A}{'$ref'}, $dbref->ref, "\$ref" ); } # MongoDB::DBRef -> BSON::Regex SKIP: { $ENV{PERL_MONGO_NO_DEP_WARNINGS} = 1; eval { require MongoDB::DBRef }; skip( "MongoDB::DBRef v1.0.0+ not installed", 4 ) unless $INC{'MongoDB/DBRef.pm'} && eval {MongoDB::DBRef->VERSION("v1.0.0")}; $bson = encode( { A => MongoDB::DBRef->new( id => $dbref->id, 'ref' => $dbref->ref ) } ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::DBRef', "MongoDB::DBRef->BSON::DBRef" ); is( $hash->{A}->id, $dbref->id, "DBRef id" ); is( $hash->{A}->ref, $dbref->ref, "DBRef ref" ); is( $bson, $expect, "BSON correct" ); } done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/time.t000644 000766 000024 00000010426 13572251451 016264 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; my ( $bson, $expect, $hash ); my $now = time; # test constructor ok( bson_time() >= $now, "empty bson_time() is current time (or so)" ); ok( BSON::Time->new >= $now, "empty BSON::Time constructor is curren time (or so)" ); # test overloading is( bson_time($now), $now, "BSON::Time string overload" ); is( 0+ bson_time($now), $now, "BSON::Time string overload" ); # BSON::Time -> BSON::Time $bson = $expect = encode( { A => bson_time($now) } ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::Time', "BSON::Time->BSON::Time" ); is( "$hash->{A}", $now, "value correct" ); # DateTime -> BSON::Time SKIP: { eval { require DateTime }; skip( "DateTime not installed", 1 ) unless $INC{'DateTime.pm'}; $bson = encode( { A => DateTime->from_epoch( epoch => $now ) } ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::Time', "DateTime->BSON::Time" ); is( "$hash->{A}", $now, "value correct" ); is( $bson, $expect, "BSON correct" ); # conversion my $obj = $hash->{A}->as_datetime; isa_ok( $obj, 'DateTime', 'as_datetime' ); is($obj->epoch, $now, "epoch"); } # DateTime::Tiny -> BSON::Time SKIP: { eval { require DateTime::Tiny }; skip( "DateTime::Tiny not installed", 1 ) unless $INC{'DateTime/Tiny.pm'}; my ($s,$m,$h,$D,$M,$Y) = gmtime($now); my $dt = DateTime::Tiny->new( year => $Y + 1900, month => $M + 1, day => $D, hour => $h, minute => $m, second => $s ); $bson = encode( { A => $dt } ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::Time', "DateTime::Tiny->BSON::Time" ); is( "$hash->{A}", $now, "value correct" ); is( $bson, $expect, "BSON correct" ); # conversion my $obj = $hash->{A}->as_datetime_tiny; isa_ok( $obj, 'DateTime::Tiny', 'as_datetime_tiny' ); is($obj->as_string . "Z", $hash->{A}->as_iso8601, "iso8601"); } # Time::Moment -> BSON::Time SKIP: { eval { require Time::Moment }; skip( "Time::Moment not installed", 1 ) unless $INC{'Time/Moment.pm'}; $bson = encode( { A => Time::Moment->from_epoch( $now ) } ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::Time', "Time::Moment->BSON::Time" ); is( "$hash->{A}", $now, "value correct" ); is( $bson, $expect, "BSON correct" ); # conversion my $obj = $hash->{A}->as_time_moment; isa_ok( $obj, 'Time::Moment', 'as_time_moment' ); is($obj->epoch, $now, "epoch"); } # Mango::BSON::Time -> BSON::Time SKIP: { eval { require Mango::BSON::Time }; skip( "Mango::BSON::Time not installed", 1 ) unless $INC{'Mango/BSON/Time.pm'}; $bson = encode( { A => Mango::BSON::Time->new( $now * 1000 ) } ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::Time', "Mango::BSON::Time->BSON::Time" ); is( "$hash->{A}", $now, "value correct" ); is( $bson, $expect, "BSON correct" ); # conversion my $obj = $hash->{A}->as_mango_time; isa_ok( $obj, 'Mango::BSON::Time', 'as_mango_time' ); is( $obj->to_epoch, $now, "to_epoch" ); } # conversion to float my $small_t = BSON::Time->new( value => 2 ); my $float = $small_t->epoch; ok( $float > 0, "epoch handles small values without rounding to zero" ); # to JSON is( to_myjson({a=>bson_time(0)}), q[{"a":"1970-01-01T00:00:00Z"}], 'json: bson_time(0)' ); is( to_myjson({a=>BSON::Time->new(value => "1356351330500")}), q[{"a":"2012-12-24T12:15:30.500Z"}], 'json: bson_time(1356351330.5)' ); # to extended JSON is( to_extjson({a=>bson_time(0)}), q[{"a":{"$date":{"$numberLong":"0"}}}], 'extjson: bson_time(0)' ); is( to_extjson({a=>BSON::Time->new(value => "1356351330500")}), q[{"a":{"$date":{"$numberLong":"1356351330500"}}}], 'extjson: bson_time(1356351330.5)' ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/minmaxkey.t000644 000766 000024 00000003473 13572251451 017334 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; my ( $bson, $expect, $hash ); # test constructor isa_ok( bson_maxkey(), "BSON::MaxKey", "bson_maxkey" ); isa_ok( bson_minkey(), "BSON::MinKey", "bson_minkey" ); isa_ok( BSON::MaxKey->new(), "BSON::MaxKey", "bson_maxkey" ); isa_ok( BSON::MinKey->new(), "BSON::MinKey", "bson_minkey" ); # BSON::MaxKey -> BSON::MaxKey $bson = $expect = encode( bson_doc( A => bson_maxkey(), B => bson_minkey() ) ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::MaxKey', "BSON::MaxKey->BSON::MaxKey" ); is( ref( $hash->{B} ), 'BSON::MinKey', "BSON::MinKey->BSON::MinKey" ); # MongoDB::[Min|Max]Key (deprecated) -> BSON::Regex $bson = encode( bson_doc( A => bless( {}, 'MongoDB::MaxKey' ), B => bless( {}, 'MongoDB::MinKey' ) ) ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'BSON::MaxKey', "BSON::MaxKey->BSON::MaxKey" ); is( ref( $hash->{B} ), 'BSON::MinKey', "BSON::MinKey->BSON::MinKey" ); is( $bson, $expect, "BSON correct" ); eval { to_myjson({a=>bson_maxkey()}) }; like( $@, qr/illegal in JSON/, 'json throws: bson_maxkey()' ); eval { to_myjson({a=>bson_minkey()}) }; like( $@, qr/illegal in JSON/, 'json throws: bson_minkey()' ); # to extended JSON is( to_extjson({a=>bson_minkey()}), q[{"a":{"$minKey":1}}], 'extjson: bson_minkey' ); is( to_extjson({a=>bson_maxkey()}), q[{"a":{"$maxKey":1}}], 'extjson: bson_maxkey' ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/oid.t000644 000766 000024 00000007612 13572251451 016104 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; my ( $bson, $expect, $hash ); my $packed = BSON::OID::_packed_oid(); my $hexoid = unpack( "H*", $packed ); my $all_bits = "\xff" x 8; # test constructors is( length( bson_oid()->oid ), 12, "empty bson_oid() generates new OID" ); is( length( bson_oid()->from_epoch(time)->oid ), 12, "from_epoch(time) generates new OID" ); is( length( bson_oid()->from_epoch(time, 0)->oid ), 12, "from_epoch(time, 0) generates new OID" ); is( length( bson_oid()->from_epoch(time, $all_bits)->oid ), 12, 'from_epoch(time, "\xff"x8) generates new OID' ); is( bson_oid($packed)->oid, $packed, "bson_oid(\$packed) returns packed" ); is( bson_oid($hexoid)->oid, $packed, "bson_oid(\$hexoid) returns packed" ); is( length( BSON::OID->new()->oid ), 12, "empty BSON::OID->new() generates new OID" ); is( length( BSON::OID->from_epoch(time)->oid ), 12, "BSON::OID->from_epoch(time) generates new OID" ); is( BSON::OID->new(oid => $packed)->oid, $packed, "BSON::OID->new(\$packed) returns packed" ); # test overloading is( bson_oid($packed), $hexoid, "BSON::OID string overload" ); # test comparison my ($oid1, $oid2) = (bson_oid(), bson_oid()); is( $oid1 cmp $oid1, 0, "BSON::OID cmp overload (0)" ); is( $oid1 cmp $oid2, -1, "BSON::OID cmp overload (-1)" ); is( $oid2 cmp $oid1, 1, "BSON::OID cmp overload (1)" ); is( $oid1 <=> $oid1, 0, "BSON::OID <=> overload (0)" ); is( $oid1 <=> $oid2, -1, "BSON::OID <=> overload (-1)" ); is( $oid2 <=> $oid1, 1, "BSON::OID <=> overload (1)" ); # BSON::OID -> BSON::OID $bson = $expect = encode( { A => bson_oid($packed) } ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::OID', "BSON::OID->BSON::OID" ); is( "$hash->{A}", $hexoid, "value correct" ); # BSON::OID from_epoch my $epoch = 1467545180; my $packed_zero = pack('N3', $epoch, 0, 0); my $packed_ones = pack('Na8', $epoch, $all_bits); is( BSON::OID->from_epoch($epoch)->get_time, $epoch, "from_epoch(time) time roundtrip ok" ); is( BSON::OID->from_epoch($epoch, 0)->oid, $packed_zero, "from_epoch(time, 0) OID is correct" ); is( BSON::OID->from_epoch($epoch, "0")->oid, $packed_zero, "from_epoch(time, \"0\") OID is correct" ); is( BSON::OID->from_epoch($epoch, "000000")->oid, $packed_zero, "from_epoch(time, \"0000\") OID is correct" ); is( BSON::OID->from_epoch($epoch, $all_bits)->oid, $packed_ones, "from_epoch(time, \"\\xff\"x8) roundtrip ok" ); is( bson_oid->from_epoch($epoch, $all_bits)->oid, $packed_ones, "bson_oid->from_epoch(time, \"\\xff\"x8) roundtrip ok" ); eval { BSON::OID->from_epoch($epoch, "123") }; like( $@, qr/second argument/, "second arg must be zero or eight byts" ); # BSON::ObjectId (deprecated) -> BSON::OID $hash = encode( { A => BSON::ObjectId->new($packed) } ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::OID', "BSON::ObjectId->BSON::OID" ); is( "$hash->{A}", $hexoid, "value correct" ); is( $bson, $expect, "BSON correct" ); # MongoDB::OID (deprecated) -> BSON::OID SKIP: { $ENV{PERL_MONGO_NO_DEP_WARNINGS} = 1; eval { require MongoDB; require MongoDB::OID; }; skip( "MongoDB::OID not installed", 2 ) unless $INC{'MongoDB/OID.pm'}; $bson = encode( { A => MongoDB::OID->new( value => $hexoid ) } ); $hash = decode($bson); is( ref( $hash->{A} ), 'BSON::OID', "MongoDB::OID->BSON::OID" ); is( "$hash->{A}", $hexoid, "value correct" ); is( $bson, $expect, "BSON correct" ); } done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/int64.t000644 000766 000024 00000016102 13572251451 016267 0ustar00davidstaff000000 000000 use 5.0001; use strict; use warnings; use Test::More 0.96; use Math::BigInt; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use JSON::MaybeXS; use Config; use BSON qw/encode decode/; use BSON::Types ':all'; my ($hash, $bson, $expect); my $max_int64 = $Config{use64bitint} ? 9223372036854775807 : Math::BigInt->new("9223372036854775807"); my $min_int64 = $Config{use64bitint} ? -9223372036854775808 : Math::BigInt->new("-9223372036854775808"); my $max_int32_p1 = Math::BigInt->new("2147483648"); my $min_int31_m1 = Math::BigInt->new("-2147483649"); my $bigpos = Math::BigInt->new("9223372036854775808"); my $bigneg = Math::BigInt->new("-9223372036854775809"); # test constructor packed_is( INT64, bson_int64(), 0, "empty bson_int64() is 0" ); packed_is( INT64, BSON::Int64->new, 0, "empty constructor is 0" ); # test constructor errors; these will cap at min/max int64 packed_is( INT64, bson_int64(9223372036854775808), $max_int64, "bson_int64(9223372036854775808)" ); packed_is( INT64, bson_int64(9223372036854775808.01), $max_int64, "bson_int64(9223372036854775808.01)" ); packed_is( INT64, bson_int64(9223372036854775807.99), $max_int64, "bson_int64(9223372036854775807.99)" ); packed_is( INT64, bson_int64(-9223372036854775809), $min_int64, "bson_int64(-9223372036854775809)" ); packed_is( INT64, bson_int64(-9223372036854775809.01), $min_int64, "bson_int64(-9223372036854775809.01)"); packed_is( INT64, bson_int64(-9223372036854775808.99), $min_int64, "bson_int64(-9223372036854775808.99)"); packed_is( INT64, bson_int64($bigpos), $max_int64, "bson_int64(bigpos)" ); packed_is( INT64, bson_int64($bigneg), $min_int64, "bson_int64(bigpos)" ); # test overloading packed_is( INT64, bson_int64($max_int32_p1), $max_int32_p1, "overloading correct" ); subtest 'native (64-bit perls)' => sub { plan skip_all => 'not a 64-bit perl' unless $Config{use64bitint}; # int64 -> int64 $bson = $expect = encode( { A => $max_int32_p1 } ); $hash = decode( $bson ); is( sv_type( $hash->{A} ), 'IV', "int64->int64" ); packed_is( INT64, $hash->{A}, $max_int32_p1, "value correct" ); # BSON::Int64 -> int64 $bson = encode( { A => bson_int64($max_int32_p1) } ); $hash = decode( $bson ); is( sv_type( $hash->{A} ), 'IV', "BSON::Int64->int64" ); packed_is( INT64, $hash->{A}, $max_int32_p1, "value correct" ); bytes_are( $bson, $expect, "BSON correct" ); # BSON::Int64(string) -> int64 $bson = encode( { A => bson_int64("0") } ); $hash = decode( $bson ); is( sv_type( $hash->{A} ), 'IV', "BSON::Int64->int64" ); packed_is( INT64, $hash->{A}, 0, "value correct" ); # Math::BigInt -> int64 $bson = encode( { A => Math::BigInt->new("0") } ); $hash = decode( $bson ); is( sv_type( $hash->{A} ), 'IV', "Math::BigInt->int64" ); packed_is( INT64, $hash->{A}, 0, "value correct" ); # Math::Int64 -> int64 SKIP: { eval { require Math::Int64 }; skip( "Math::Int64 not installed", 2 ) unless $INC{'Math/Int64.pm'}; $bson = encode( { A => Math::Int64::int64("0") } ); $hash = decode( $bson ); is( sv_type( $hash->{A} ), 'IV', "Math::Int64->int64" ); packed_is( INT64, $hash->{A}, 0, "value correct" ); } }; subtest 'Math::BigInt (32-bit perls)' => sub { plan skip_all => 'not a 32-bit perl' if $Config{use64bitint}; # NV -> Math::BigInt $bson = $expect = encode( { A => $max_int32_p1 } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'Math::BigInt', "int64->Math::BigInt" ); packed_is( INT64, $hash->{A}, $max_int32_p1, "value correct" ); # BSON::Int64 -> Math::BigInt $bson = encode( { A => bson_int64($max_int32_p1) } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'Math::BigInt', "BSON::Int64->Math::BigInt" ); packed_is( INT64, $hash->{A}, $max_int32_p1, "value correct" ); bytes_are( $bson, $expect, "BSON correct" ); # BSON::Int64(string) -> Math::BigInt $bson = encode( { A => bson_int64("0") } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'Math::BigInt', "BSON::Int64->Math::BigInt" ); packed_is( INT64, $hash->{A}, 0, "value correct" ); # Math::BigInt -> Math::BigInt $bson = encode( { A => Math::BigInt->new("0") } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'Math::BigInt', "Math::BigInt->Math::BigInt" ); packed_is( INT64, $hash->{A}, 0, "value correct" ); # Math::Int64 -> Math::BigInt SKIP: { eval { require Math::Int64 }; skip( "Math::Int64 not installed", 2 ) unless $INC{'Math/Int64.pm'}; $bson = encode( { A => Math::Int64::int64("0") } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'Math::BigInt', "Math::Int64->Math::BigInt" ); packed_is( INT64, $hash->{A}, 0, "value correct" ); } }; subtest 'wrapped' => sub { # int64 -> BSON::Int64 $bson = $expect = encode( { A => $max_int32_p1 } ); $hash = decode( $bson, wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Int64', "int64->BSON::Int64" ); packed_is( INT64, $hash->{A}, $max_int32_p1, "value correct" ); # BSON::Int64 -> BSON::Int64 $bson = encode( { A => bson_int64($max_int32_p1) } ); $hash = decode( $bson, wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Int64', "int64->BSON::Int64" ); packed_is( INT64, $hash->{A}, $max_int32_p1, "value correct" ); bytes_are( $bson, $expect, "BSON correct" ); # BSON::Int64(string) -> BSON::Int64 $bson = encode( { A => bson_int64("0") } ); $hash = decode( $bson, wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Int64', "int64->BSON::Int64" ); packed_is( INT64, $hash->{A}, 0, "value correct" ); # Math::BigInt -> BSON::Int64 $bson = encode( { A => Math::BigInt->new("0") } ); $hash = decode( $bson, wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Int64', "Math::BigInt->BSON::Int64" ); packed_is( INT64, $hash->{A}, 0, "value correct" ); # Math::Int64 -> BSON::Int64 SKIP: { eval { require Math::Int64 }; skip( "Math::Int64 not installed", 2 ) unless $INC{'Math/Int64.pm'}; $bson = encode( { A => Math::Int64::int64("0") } ); $hash = decode( $bson, wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Int64', "Math::Int64->BSON::Int64" ); packed_is( INT64, $hash->{A}, 0, "value correct" ); } }; if ( $Config{use64bitint} ) { # to JSON SKIP: { skip "JSON::PP has trouble with TO_JSON being false", 1 if ref JSON::MaybeXS->new eq 'JSON::PP'; is( to_myjson({a=>bson_int64(0)}), q[{"a":0}], 'bson_int64(0)' ); } is( to_myjson({a=>bson_int64(42)}), q[{"a":42}], 'bson_int64(42)' ); # to extended JSON is( to_extjson({a=>bson_int64(0)}), q[{"a":{"$numberLong":"0"}}], 'extjson: bson_int64(0)' ); is( to_extjson({a=>bson_int64(42)}), q[{"a":{"$numberLong":"42"}}], 'extjson: bson_int64(0)' ); } done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/code.t000644 000766 000024 00000007573 13572251451 016251 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; use Test::Deep '!blessed'; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; my ($bson, $expect, $hash); my $code = 'alert("Hello World");'; my $scope = { x => 1 }; # test constructor is( bson_code()->code, '', "empty bson_code()" ); is( bson_code()->scope, undef, "empty bson_code()" ); is( bson_code($code)->code, $code, "bson_code(code)->code" ); is( bson_code($code)->scope , undef, "bson_code(code)->scope" ); is( bson_code( $code, $scope )->code, $code, "bson_code(code, scope)->code" ); is( bson_code( $code, $scope )->scope , $scope, "bson_code(code, scope)->scope" ); is( BSON::Code->new()->code, '', "empty BSON::Code->new()" ); is( BSON::Code->new()->scope, undef, "empty BSON::Code->new()" ); is( BSON::Code->new( code => $code )->code, $code, "BSON::Code->new(code)->code" ); is( BSON::Code->new( code => $code )->scope, undef, "BSON::Code->new(code)->scope" ); is( BSON::Code->new( code => $code, scope => $scope )->code, $code, "BSON::Code->new(code, scope)->code" ); is( BSON::Code->new( code => $code, scope => $scope )->scope , $scope, "BSON::Code->new(code, scope)->scope" ); subtest "BSON type CODE" => sub { $bson = $expect = encode( { A => bson_code($code) } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'BSON::Code', "BSON::Code->BSON::Code" ); is( $hash->{A}->code, $code, "code correct" ); cmp_deeply( $hash->{A}->scope, undef, "scope correct" ); # MongoDB::Code (deprecated) -> BSON::Code SKIP: { $ENV{PERL_MONGO_NO_DEP_WARNINGS} = 1; eval { require MongoDB::Code }; skip( "MongoDB::Code not installed", 2 ) unless $INC{'MongoDB/Code.pm'}; $bson = encode( { A => MongoDB::Code->new( code => $code ) } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'BSON::Code', "MongoDB::Code->BSON::Code" ); is( $hash->{A}->code, $code, "code correct" ); cmp_deeply( $hash->{A}->scope, undef, "scope correct" ); is( $bson, $expect, "BSON correct" ); } }; subtest "BSON type CODEWSCOPE" => sub { $bson = $expect = encode( { A => bson_code($code, $scope) } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'BSON::Code', "BSON::Code->BSON::Code" ); is( $hash->{A}->code, $code, "code correct" ); cmp_deeply( $hash->{A}->scope, $scope, "scope correct" ); # CODEWSCOPE: BSON::Code -> BSON::Code # MongoDB::Code (deprecated) -> BSON::Code SKIP: { $ENV{PERL_MONGO_NO_DEP_WARNINGS} = 1; eval { require MongoDB::Code }; skip( "MongoDB::Code not installed", 2 ) unless $INC{'MongoDB/Code.pm'}; $bson = encode( { A => MongoDB::Code->new( code => $code, scope => $scope ) } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'BSON::Code', "MongoDB::Code->BSON::Code" ); is( $hash->{A}->code, $code, "code correct" ); cmp_deeply( $hash->{A}->scope, $scope, "scope correct" ); is( $bson, $expect, "BSON correct" ); } }; # to JSON eval { to_myjson({a=>bson_code()}) }; like( $@, qr/illegal in JSON/, 'json throws: bson_code()' ); # to extended JSON (my $code_json = $code) =~ s{"}{\\"}g; my $scope_json = to_extjson({%$scope}); is( to_extjson({a=>bson_code($code)}), qq[{"a":{"\$code":"$code_json"}}], 'extjson: bson_code()' ); is( to_extjson( { a => bson_code( $code, $scope ) } ), qq[{"a":{"\$code":"$code_json","\$scope":$scope_json}}], 'extjson: bson_code(,)' ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/regex.t000644 000766 000024 00000006421 13572251451 016440 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; my ($bson, $expect, $hash); my $pattern = '\w\d+'; my $flags = 'mix'; my $sorted_flags = 'imx'; my $qr = qr/\w\d+/xim; # test constructor is( bson_regex()->pattern, '', "empty bson_regex()" ); is( bson_regex()->flags, '', "empty bson_regex()" ); is( bson_regex($pattern)->pattern, $pattern, "bson_regex(PATTERN)->pattern" ); is( bson_regex($pattern)->flags , '', "bson_regex(PATTERN)->flags" ); is( bson_regex( $pattern, $flags )->pattern, $pattern, "bson_regex(PATTERN, FLAGS)->pattern" ); is( bson_regex( $pattern, $flags )->flags , $sorted_flags, "bson_regex(PATTERN, FLAGS)->flags" ); is( BSON::Regex->new()->pattern, '', "empty BSON::Regex->new()" ); is( BSON::Regex->new()->flags, '', "empty BSON::Regex->new()" ); is( BSON::Regex->new( pattern => $pattern )->pattern, $pattern, "BSON::Regex->new(PATTERN)->pattern" ); is( BSON::Regex->new( pattern => $pattern )->flags, '', "BSON::Regex->new(PATTERN)->flags" ); is( BSON::Regex->new( pattern => $pattern, flags => $flags )->pattern, $pattern, "BSON::Regex->new(PATTERN, FLAGS)->pattern" ); is( BSON::Regex->new( pattern => $pattern, flags => $flags )->flags , $sorted_flags, "BSON::Regex->new(PATTERN, FLAGS)->flags" ); # BSON::Regex -> BSON::Regex $bson = $expect = encode( { A => bson_regex($pattern, $flags) } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'BSON::Regex', "BSON::Regex->BSON::Regex" ); is( $hash->{A}->pattern, $pattern, "pattern correct" ); is( $hash->{A}->flags, $sorted_flags, "flags correct" ); # qr// -> BSON::Regex $bson = encode( { A => $qr } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'BSON::Regex', "qr//->BSON::Regex" ); is( $hash->{A}->pattern, $pattern, "pattern correct" ); is( $hash->{A}->flags, $sorted_flags, "flags correct" ); is( $bson, $expect, "BSON correct" ); # MongoDB::BSON::Regexp (deprecated) -> BSON::Regex SKIP: { $ENV{PERL_MONGO_NO_DEP_WARNINGS} = 1; eval { require MongoDB::BSON::Regexp }; skip( "MongoDB::BSON::Regexp not installed", 2 ) unless $INC{'MongoDB/BSON/Regexp.pm'}; $bson = encode( { A => MongoDB::BSON::Regexp->new( pattern => $pattern, flags => $flags ) } ); $hash = decode( $bson ); is( ref( $hash->{A} ), 'BSON::Regex', "MongoDB::BSON::Regexp->BSON::Regex" ); is( $hash->{A}->pattern, $pattern, "pattern correct" ); is( $hash->{A}->flags, $sorted_flags, "flags correct" ); is( $bson, $expect, "BSON correct" ); } # to JSON eval { to_myjson({a=>bson_regex()}) }; like( $@, qr/illegal in JSON/, 'json throws: bson_regex()' ); # to extended JSON (my $pattern_json = $pattern) =~ s{\\}{\\\\}g; is( to_extjson( { a => bson_regex( $pattern, $flags ) } ), qq[{"a":{"\$regularExpression":{"pattern":"$pattern_json","options":"$sorted_flags"}}}], 'extjson: bson_regex(,)' ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/hashref.t000644 000766 000024 00000014705 13572251451 016752 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; use Tie::IxHash; my ($hash); # test BSON::Doc constructor is( scalar @{ bson_doc() }, 0, "empty bson_doc() is empty doc" ); is( scalar @{ BSON::Doc->new }, 0, "empty constructor is empty doc" ); eval { bson_doc( a => 1, b => 2, a => 3, c => 4 ) }; like( $@, qr/duplicate keys not allowed/i, "duplicate keys in bson_doc() throw error" ); # test overloading # XXX TBD my @kv = qw/A B/; subtest "Top level document" => sub { # hashref -> hashref $hash = decode( encode( {@kv} ) ); is( ref($hash), 'HASH', "hashref->hashref" ); is_deeply( $hash, {@kv}, "value correct" ); # BSON::Doc -> hashref $hash = decode( encode( bson_doc(@kv) ) ); is( ref($hash), 'HASH', "BSON::Doc->hashref" ); is_deeply( $hash, {@kv}, "value correct" ); # BSON::Raw -> hashref $hash = decode( encode( bson_raw( encode { @kv } ) ) ); is( ref($hash), 'HASH', "BSON::Raw->hashref" ); is_deeply( $hash, {@kv}, "value correct" ); # MongoDB::BSON::Raw -> hashref my $raw = encode( {@kv} ); $hash = decode( encode( bless \$raw, "MongoDB::BSON::Raw" ) ); is( ref($hash), 'HASH', "MongoDB::BSON::Raw->hashref" ); is_deeply( $hash, {@kv}, "value correct" ); # Tie::IxHash tied hashref tie my %ixhash, 'Tie::IxHash', @kv; $hash = decode( encode( \%ixhash ) ); is( ref($hash), 'HASH', "Tie::IxHash(tied)->hashref" ); is_deeply( $hash, {@kv}, "value correct" ); # Tie::IxHash object my $ixdoc = Tie::IxHash->new(@kv); $hash = decode( encode($ixdoc) ); is( ref($hash), 'HASH', "Tie::IxHash(OO)->hashref" ); is_deeply( $hash, {@kv}, "value correct" ); }; subtest "Subdocument" => sub { # hashref -> hashref $hash = decode( encode( { doc => {@kv} } ) ); is( ref( $hash->{doc} ), 'HASH', "hashref->hashref" ); is_deeply( $hash, { doc => {@kv} }, "value correct" ); # BSON::Doc -> hashref $hash = decode( encode( { doc => bson_doc(@kv) } ) ); is( ref( $hash->{doc} ), 'HASH', "BSON::Doc->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); # BSON::Raw -> hashref $hash = decode( encode( { doc => bson_raw( encode( {@kv} ) ) } ) ); is( ref( $hash->{doc} ), 'HASH', "BSON::Raw->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); # MongoDB::BSON::Raw -> hashref my $raw = encode( {@kv} ); $hash = decode( encode( { doc => bless \$raw, "MongoDB::BSON::Raw" } ) ); is( ref( $hash->{doc} ), 'HASH', "MongoDB::BSON::Raw->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); # Tie::IxHash tied hashref tie my %ixhash, 'Tie::IxHash', @kv; $hash = decode( encode( { doc => \%ixhash } ) ); is( ref( $hash->{doc} ), 'HASH', "Tie::IxHash(tied)->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); # Tie::IxHash object my $ixdoc = Tie::IxHash->new(@kv); $hash = decode( encode( { doc => $ixdoc } ) ); is( ref( $hash->{doc} ), 'HASH', "Tie::IxHash(OO)->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); }; subtest "Nested" => sub { # hashref -> hashref $hash = decode( encode( bson_doc( doc => {@kv} ) ) ); is( ref( $hash->{doc} ), 'HASH', "hashref->hashref" ); is_deeply( $hash, { doc => {@kv} }, "value correct" ); # BSON::Doc -> hashref $hash = decode( encode( bson_doc( doc => bson_doc(@kv) ) ) ); is( ref( $hash->{doc} ), 'HASH', "BSON::Doc->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); # BSON::Raw -> hashref $hash = decode( encode( bson_doc( doc => bson_raw( encode( {@kv} ) ) ) ) ); is( ref( $hash->{doc} ), 'HASH', "BSON::Raw->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); # MongoDB::BSON::Raw -> hashref my $raw = encode( {@kv} ); $hash = decode( encode( bson_doc( doc => bless \$raw, "MongoDB::BSON::Raw" ) ) ); is( ref( $hash->{doc} ), 'HASH', "MongoDB::BSON::Raw->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); # Tie::IxHash tied hashref tie my %ixhash, 'Tie::IxHash', @kv; $hash = decode( encode( bson_doc( doc => \%ixhash ) ) ); is( ref( $hash->{doc} ), 'HASH', "Tie::IxHash(tied)->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); # Tie::IxHash object my $ixdoc = Tie::IxHash->new(@kv); $hash = decode( encode( bson_doc( doc => $ixdoc ) ) ); is( ref( $hash->{doc} ), 'HASH', "Tie::IxHash(OO)->hashref" ); is_deeply( $hash->{doc}, {@kv}, "value correct" ); }; subtest "Ordered top level doc" => sub { # hashref -> hashref $hash = decode( encode( {@kv} ), ordered => 1 ); is( ref($hash), 'HASH', "hashref->hashref(ordered)" ); ok( tied(%$hash), "hashref is tied" ); is_deeply( $hash, {@kv}, "value correct" ); # BSON::Doc -> hashref $hash = decode( encode( bson_doc( @kv, C => 'D' ) ), ordered => 1 ); tie my %ixhash, 'Tie::IxHash', @kv, C => 'D'; is( ref($hash), 'HASH', "BSON::Doc->hashref" ); ok( tied(%$hash), "hashref is tied" ); is_deeply( $hash, \%ixhash, "value correct" ); # Unicode keys my $key = "\x{263a}"; $hash = decode( encode( bson_doc( @kv, $key => 'D' ) ), ordered => 1 ); tie my %ixhash2, 'Tie::IxHash', @kv, $key => 'D'; is( ref($hash), 'HASH', "BSON::Doc->hashref" ); ok( tied(%$hash), "hashref is tied" ); is_deeply( $hash, \%ixhash2, "value correct" ); }; subtest "Ordered subdoc" => sub { # hashref -> hashref $hash = decode( encode( { doc => {@kv} } ), ordered => 1 ); is( ref( $hash->{doc} ), 'HASH', "hashref->hashref" ); ok( tied( %{ $hash->{doc} } ), "hashref is tied" ); is_deeply( $hash, { doc => {@kv} }, "value correct" ); # BSON::Doc -> hashref $hash = decode( encode( { doc => bson_doc( @kv, C => 'D' ) } ), ordered => 1 ); tie my %ixhash, 'Tie::IxHash', @kv, C => 'D'; is( ref( $hash->{doc} ), 'HASH', "BSON::Doc->hashref" ); ok( tied( %{ $hash->{doc} } ), "hashref is tied" ); is_deeply( $hash->{doc}, \%ixhash, "value correct" ); }; # TODO: # Hash::Ordered to hashref done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/int32.t000644 000766 000024 00000007007 13572251451 016266 0ustar00davidstaff000000 000000 use 5.0001; use strict; use warnings; use Test::More 0.96; use Math::BigInt; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use JSON::MaybeXS; use BSON qw/encode decode/; use BSON::Types ':all'; my ($hash, $bson, $expect); my $bigpos = Math::BigInt->new("2147483648"); my $bigneg = Math::BigInt->new("-2147483649"); # test constructor packed_is( INT32, bson_int32(), 0, "empty bson_int32() is 0" ); packed_is( INT32, BSON::Int32->new, 0, "empty constructor is 0" ); # test constructor errors; these will wind up doubles on 32-bit platforms eval { bson_int32(2**31) }; like( $@, qr/can't fit/, "bson_int32(2**31) fails" ); eval { bson_int32(-2**31-1) }; like( $@, qr/can't fit/, "bson_int32(-2**31-1) fails" ); # test constructor errors with Math::BigInt eval { bson_int32($bigpos) }; like( $@, qr/can't fit/, "bson_int32(big BigInt) fails" ); eval { bson_int32($bigneg) }; like( $@, qr/can't fit/, "bson_int32(-big BigInt) fails" ); # test overloading packed_is( INT32, bson_int32(314159), 314159, "overloading correct" ); subtest 'native' => sub { # int32 -> int32 $bson = $expect = encode( { A => 314159 } ); $hash = decode( $bson ); is( sv_type( $hash->{A} ), 'IV', "int32->int32" ); packed_is( INT32, $hash->{A}, 314159, "value correct" ); # BSON::Int32 -> int32 $bson = encode( { A => bson_int32(314159) } ); $hash = decode( $bson ); is( sv_type( $hash->{A} ), 'IV', "BSON::Int32->int32" ); packed_is( INT32, $hash->{A}, 314159, "value correct" ); is( $bson, $expect, "BSON correct" ); # BSON::Int32(string) -> int32 $bson = encode( { A => bson_int32("314159") } ); $hash = decode( $bson ); is( sv_type( $hash->{A} ), 'IV', "BSON::Int32->int32" ); packed_is( INT32, $hash->{A}, 314159, "value correct" ); is( $bson, $expect, "BSON correct" ); }; subtest 'wrapped' => sub { # int32 -> BSON::Int32 $bson = $expect = encode( { A => 314159 } ); $hash = decode( $bson, wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Int32', "int32->BSON::Int32" ); packed_is( INT32, $hash->{A}, 314159, "value correct" ); # BSON::Int32 -> BSON::Int32 $bson = encode( { A => bson_int32(314159) } ); $hash = decode( $bson, wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Int32', "int32->BSON::Int32" ); packed_is( INT32, $hash->{A}, 314159, "value correct" ); is( $bson, $expect, "BSON correct" ); # BSON::Int32(string) -> BSON::Int32 $bson = encode( { A => bson_int32("314159") } ); $hash = decode( $bson, wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Int32', "int32->BSON::Int32" ); packed_is( INT32, $hash->{A}, 314159, "value correct" ); is( $bson, $expect, "BSON correct" ); }; # to JSON SKIP: { skip "JSON::PP has trouble with TO_JSON being false", 1 if ref JSON::MaybeXS->new eq 'JSON::PP'; is( to_myjson({a=>bson_int32(0)}), q[{"a":0}], 'bson_int32(0)' ); } is( to_myjson({a=>bson_int32(42)}), q[{"a":42}], 'bson_int32(42)' ); # to extended JSON SKIP: { skip "JSON::PP has trouble with TO_JSON being false", 1 if ref JSON::MaybeXS->new eq 'JSON::PP'; is( to_extjson({a=>bson_int32(0)}), q[{"a":{"$numberInt":"0"}}], 'extjson: bson_int32(0)' ); } is( to_extjson({a=>bson_int32(42)}), q[{"a":{"$numberInt":"42"}}], 'extjson: bson_int32(42)' ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/boolean.t000644 000766 000024 00000003104 13572251451 016740 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; use boolean; my ( $bson, $expect, $hash ); # test constructor isa_ok( bson_bool(), 'boolean', "bson_bool() gives boolean.pm" ); isa_ok( bson_bool(0), 'boolean', "bson_bool(0) gives boolean.pm" ); isa_ok( bson_bool(1), 'boolean', "bson_bool(1) gives boolean.pm" ); # test overloading ok( !bson_bool(), "bson_bool() is false" ); ok( !bson_bool(0), "bson_bool(0) is false" ); ok( bson_bool(1), "bson_bool(1) is true" ); # boolean -> boolean $bson = $expect = encode( { A => true } ); $hash = decode($bson); is( ref( $hash->{A} ), 'boolean', "boolean->boolean" ); ok( $hash->{A}, "value is correct" ); # mock various classes we support my @mocks = qw( BSON::Bool JSON::XS::Boolean JSON::PP::Boolean JSON::Tiny::_Bool Mojo::JSON::_Bool Cpanel::JSON::XS::Boolean Types::Serialiser::Boolean ); for my $c ( @mocks ) { my $bool = bless \(my $b = 1), $c; $bson = encode( { A => $bool } ); $hash = decode($bson); is( ref( $hash->{A} ), 'boolean', "$c->boolean" ); ok( $hash->{A}, "value is correct" ); is($bson, $expect, "BSON is correct" ); } done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/double.t000644 000766 000024 00000007467 13572251451 016613 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types qw/bson_double/; use JSON::MaybeXS; my ($hash); # test constructor packed_is( FLOAT, bson_double(), 0.0, "empty bson_double() is 0.0" ); packed_is( FLOAT, BSON::Double->new, 0.0, "empty constructor is 0.0" ); # test overloading packed_is( FLOAT, bson_double(3.14159), 3.14159, "overloading correct" ); # double -> double $hash = decode( encode( { A => 3.14159 } ) ); is( sv_type( $hash->{A} ), 'NV', "double->double" ); packed_is( FLOAT, $hash->{A}, 3.14159, "value correct" ); # BSON::Double -> double $hash = decode( encode( { A => bson_double(3.14159) } ) ); is( sv_type( $hash->{A} ), 'NV', "BSON::Double->double" ); packed_is( FLOAT, $hash->{A}, 3.14159, "value correct" ); # double -> BSON::Double $hash = decode( encode( { A => 3.14159 } ), wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Double', "double->BSON::Double" ); packed_is( FLOAT, $hash->{A}->value, 3.14159, "value correct" ); # BSON::Double -> BSON::Double $hash = decode( encode( { A => bson_double(3.14159) } ), wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Double', "BSON::Double->BSON::Double" ); packed_is( FLOAT, $hash->{A}->value, 3.14159, "value correct" ); # test special doubles my %special = ( "Inf" => BSON::Double::pInf(), "-Inf" => BSON::Double::nInf(), "NaN" => BSON::Double::NaN(), ); for my $s ( qw/Inf -Inf NaN/ ) { $hash = decode( encode( { A => $special{$s} } ) ); is( sv_type( $hash->{A} ), 'PVNV', "$s as double->double" ); packed_is( FLOAT, $hash->{A}, $special{$s}, "value correct" ); } for my $s ( qw/Inf -Inf NaN/ ) { $hash = decode( encode( { A => $special{$s} } ), wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Double', "$s as double->BSON::Double" ) or diag explain $hash; packed_is( FLOAT, $hash->{A}, $special{$s}, "value correct" ); } # test special BSON::Double for my $s ( qw/Inf -Inf NaN/ ) { $hash = decode( encode( { A => bson_double($special{$s}) } ) ); is( sv_type( $hash->{A} ), 'PVNV', "$s as BSON::Double->BSON::Double" ); packed_is( FLOAT, $hash->{A}, $special{$s}, "value correct" ); } for my $s ( qw/Inf -Inf NaN/ ) { $hash = decode( encode( { A => bson_double($special{$s}) } ), wrap_numbers => 1 ); is( ref( $hash->{A} ), 'BSON::Double', "$s as BSON::Double->BSON::Double" ) or diag explain $hash; packed_is( FLOAT, $hash->{A}, $special{$s}, "value correct" ); } # to JSON # Depending on the JSON parser (and version), .0 might get encoded in various # lossy ways, so we check with a regex for any of the various things we might see like( to_myjson({a=>bson_double(0.0)}), qr/\{"a":(?:0\.0|"0"|0)\}/, 'bson_double(0.0) (XXX lossy!)' ); like( to_myjson({a=>bson_double(42)}), qr/\{"a":(?:42\.0|"42"|42)\}/, 'bson_double(42) (XXX lossy!)' ); is( to_myjson({a=>bson_double(0.1)}), q[{"a":0.1}], 'bson_double(0.1)' ); eval { to_myjson({a=>bson_double(BSON::Double::pInf())}) }; like( $@, qr/illegal in JSON/, 'throws: bson_double(BSON::Double:pInf())' ); # to extended JSON; XXX not implemented yet by mognod; # see https://jira.mongodb.org/browse/SERVER-23204 ##is( to_extjson({a=>bson_double(0.0)}), q[{"a":0}], 'extjson: bson_double(0.0) (XXX lossy!)' ); ##is( to_extjson({a=>bson_double(42)}), q[{"a":42}], 'extjson: bson_double(42) (XXX lossy!)' ); ##is( to_extjson({a=>bson_double(0.1)}), q[{"a":0.1}], 'extjson: bson_double(0.1)' ); ##is( to_extjson({a=>bson_double("Inf"/1.0)}), q[{"a":{"$numberDouble":"Inf"}}], 'extjson: bson_double("Inf"/1.0)' ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/decimal128.t000644 000766 000024 00000003332 13572251451 017155 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use Test::More 0.96; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; use JSON::MaybeXS; my ($hash); # test constructor is( bson_decimal128(), "0", "empty bson_decimal128() is 0" ); eval { BSON::Decimal128->new }; ok( $@, "BSON::Decimal128->new throws" ); # test overloading is( bson_decimal128("3.14159"), "3.14159", "overloading correct" ); # BSON::Decimal128 -> BSON::Decimal128 $hash = decode( encode( { A => bson_decimal128("3.14159") } ) ); is( ref( $hash->{A} ), 'BSON::Decimal128', "BSON::Decimal128->BSON::Decimal128" ); is( $hash->{A}->value, "3.14159", "value correct" ); # test special decimal128s for my $s ( qw/Infinity -Infinity NaN/ ) { $hash = decode( encode( { A => bson_decimal128($s) } ) ); is( $hash->{A}->value, $s, "$s value correct" ); } # to JSON is( to_myjson( { a => bson_decimal128("0.0") } ), q[{"a":"0.0"}], 'bson_decimal128(0.0)' ); is( to_myjson( { a => bson_decimal128("42") } ), q[{"a":"42"}], 'bson_decimal128(42)' ); is( to_myjson( { a => bson_decimal128("0.1") } ), q[{"a":"0.1"}], 'bson_decimal128(0.1)' ); # to extended JSON is( to_extjson( { a => bson_decimal128("0.0") } ), q[{"a":{"$numberDecimal":"0.0"}}], 'bson_decimal128(0.0)' ); # normalizes representation is( to_extjson( { a => bson_decimal128("12345678E678") } ), q[{"a":{"$numberDecimal":"1.2345678E+685"}}], 'bson_decimal128(12345678E+678)' ); done_testing; # # This file is part of BSON-XS # # This software is Copyright (c) 2019 by MongoDB, Inc. # # This is free software, licensed under: # # The Apache License, Version 2.0, January 2004 # # # vim: set ts=4 sts=4 sw=4 et tw=75: BSON-XS-v0.8.2/t/mapping/timestamp.t000644 000766 000024 00000010164 13572251451 017330 0ustar00davidstaff000000 000000 use 5.008001; use strict; use warnings; use utf8; use Test::More 0.96; binmode( Test::More->builder->$_, ":utf8" ) for qw/output failure_output todo_output/; use lib 't/lib'; use lib 't/pvtlib'; use CleanEnv; use TestUtils; use BSON qw/encode decode/; use BSON::Types ':all'; my ($bson, $expect, $hash); my $seconds = time; my $increment = 42; # test constructor ok( bson_timestamp()->seconds >= $seconds, "bson_timestamp()->seconds" ); is( bson_timestamp()->increment, 0, "bson_timestamp()->increment" ); is( bson_timestamp($seconds)->seconds, $seconds, "bson_timestamp(seconds)->seconds" ); is( bson_timestamp($seconds)->increment, 0, "bson_timestamp(seconds)->increment" ); is( bson_timestamp( $seconds, $increment )->seconds, $seconds, "bson_timestamp(seconds, increment)->seconds" ); is( bson_timestamp( $seconds, $increment )->increment, $increment, "bson_timestamp(seconds, increment)->increment" ); ok( BSON::Timestamp->new()->seconds >= $seconds, "BSON::Timestamp->new()->seconds" ); is( BSON::Timestamp->new()->increment, 0, "BSON::Timestamp->new()->increment" ); is( BSON::Timestamp->new( seconds => $seconds )->seconds, $seconds, "BSON::Timestamp->new(seconds)->seconds" ); is( BSON::Timestamp->new( seconds => $seconds )->increment, 0, "BSON::Timestamp->new(seconds)->increment" ); is( BSON::Timestamp->new( seconds => $seconds, increment => $increment )->seconds, $seconds, "BSON::Timestamp->new(seconds, increment)->seconds" ); is( BSON::Timestamp->new( seconds => $seconds, increment => $increment )->increment , $increment, "BSON::Timestamp->new(seconds, increment)->increment" ); # test constructor range errors eval { bson_timestamp(2**32, $increment) }; like( $@, qr/must be uint32/, "bson_timestamp(2**32, 42) fails" ); eval { bson_timestamp(-1, $increment) }; like( $@, qr/must be uint32/, "bson_timestamp(-1, 42) fails" ); eval { bson_timestamp($seconds, 2**32) }; like( $@, qr/must be uint32/, "bson_timestamp(