Class-XSAccessor-1.19/0000755000175000017500000000000012243573262013214 5ustar tseetseeClass-XSAccessor-1.19/cxsa_main.h0000644000175000017500000000425712157632025015334 0ustar tseetsee#ifndef cxsa_main_h_ #define cxsa_main_h_ #include "EXTERN.h" #include "perl.h" #include "ppport.h" #include "cxsa_hash_table.h" typedef struct autoxs_hashkey_str autoxs_hashkey; struct autoxs_hashkey_str { U32 hash; char* key; I32 len; /* not STRLEN for perl internal UTF hacks and hv_common_keylen -- man, these things can take you by surprise */ autoxs_hashkey * next; /* Alas, this is the node of a linked list */ /* It may be tempting to add more data here for further parameterization * of the accessor methods. That's simple at first sight (just add another * bit of data here, say a void* for user data, whatever). But when you * think about it some more, you'll see that this has various nasty * consequences in the context of re-using the hashkey entries. * - Hashkey structs are shared and there's a reverse look-up using the * hash-key-string itself for that purpose. * - Sharing the hashkey structs is important for threads: Otherwise, we * have to implement full cloning on thread creation. Oh my. * - If we didn't share hashkey structs, we'd have to deallocate them when * an accessor method is no longer used. That means detecting when that * happens. Note that there is not reference counting mechanism we can * use to make this easy. So the sharing/reuse of hashkey structs was a * way to avoid this real or perceived memory leak on re-generation of * accessors for the same object slot. */ }; autoxs_hashkey * get_hashkey(pTHX_ const char* key, const I32 len); I32 get_internal_array_index(I32 object_ary_idx); /* Macro to encapsulate fetching of a hashkey struct pointer for the actual * XSUBs */ #define CXAH_GET_HASHKEY ((autoxs_hashkey *) XSANY.any_ptr) /************************* * thread-shared memory ************************/ extern autoxs_hashkey * CXSAccessor_last_hashkey; extern autoxs_hashkey * CXSAccessor_hashkeys; extern HashTable* CXSAccessor_reverse_hashkeys; extern U32 CXSAccessor_no_arrayindices; extern U32 CXSAccessor_free_arrayindices_no; extern I32* CXSAccessor_arrayindices; extern U32 CXSAccessor_reverse_arrayindices_length; extern I32* CXSAccessor_reverse_arrayindices; #endif Class-XSAccessor-1.19/cxsa_hash_table.c0000644000175000017500000001265211667426554016510 0ustar tseetsee/* * chocolateboy 2009-02-25 * * This is a customised version of the pointer table implementation in sv.c * * tsee 2009-11-03 * * - Taken from chocolateboy's B-Hooks-OP-Annotation. * - Added string-to-PTRV conversion using MurmurHash2. * - Converted to storing I32s (Class::XSAccessor indexes of the key name storage) * instead of OP structures (pointers). * - Plenty of renaming and prefixing with CXSA_. */ #include "cxsa_hash_table.h" #include "MurmurHashNeutral2.h" #define CXSA_string_hash(str, len) CXSA_MurmurHashNeutral2(str, len, 12345678) HashTable* CXSA_HashTable_new(UV size, NV threshold) { HashTable* table; if ((size < 2) || (size & (size - 1))) { croak("invalid hash table size: expected a power of 2 (>= 2), got %u", (unsigned)size); } if (!((threshold > 0) && (threshold < 1))) { croak("invalid threshold: expected 0.0 < threshold < 1.0, got %f", threshold); } table = (HashTable*)cxa_zmalloc(sizeof(HashTable)); table->size = size; table->threshold = threshold; table->items = 0; table->array = (HashTableEntry**)cxa_zmalloc(size * sizeof(HashTableEntry*)); return table; } HashTableEntry* CXSA_HashTable_find(HashTable* table, const char* key, STRLEN len) { HashTableEntry* entry; UV index = CXSA_string_hash(key, len) & (table->size - 1); for (entry = table->array[index]; entry; entry = entry->next) { if (strcmp(entry->key, key) == 0) break; } return entry; } /* currently unused */ /* void * CXSA_HashTable_delete(HashTable* table, const char* key, STRLEN len) { HashTableEntry *entry, *prev = NULL; UV index = CXSA_string_hash(key, len) & (table->size - 1); void * retval = NULL; for (entry = table->array[index]; entry; prev = entry, entry = entry->next) { if (strcmp(entry->key, key) == 0) { if (prev) { prev->next = entry->next; } else { table->array[index] = entry->next; } --(table->items); retval = entry->value; Safefree(entry->key); Safefree(entry); break; } } return retval; } */ void * CXSA_HashTable_fetch(HashTable* table, const char* key, STRLEN len) { HashTableEntry const * const entry = CXSA_HashTable_find(table, key, len); return entry ? entry->value : NULL; } void * CXSA_HashTable_store(HashTable* table, const char* key, STRLEN len, void * value) { void * retval = NULL; HashTableEntry* entry = CXSA_HashTable_find(table, key, len); if (entry) { retval = entry->value; entry->value = value; } else { const UV index = CXSA_string_hash(key, len) & (table->size - 1); entry = (HashTableEntry*)cxa_malloc(sizeof(HashTableEntry)); entry->key = (char*)cxa_malloc( (len+1) ); cxa_memcpy((void*)entry->key, (void*)key, len+1); /*Copy(key, entry->key, len+1, char);*/ entry->len = len; entry->value = value; entry->next = table->array[index]; table->array[index] = entry; ++(table->items); if (((NV)table->items / (NV)table->size) > table->threshold) CXSA_HashTable_grow(table); } return retval; } /* double the size of the array */ void CXSA_HashTable_grow(HashTable* table) { HashTableEntry** array = table->array; const UV oldsize = table->size; UV newsize = oldsize * 2; UV i; array = (HashTableEntry**)cxa_realloc((void*)array, sizeof(HashTableEntry*)*newsize); cxa_memzero(&array[oldsize], (newsize-oldsize)*sizeof(HashTableEntry*)); /*Renew(array, newsize, HashTableEntry*); Zero(&array[oldsize], newsize - oldsize, HashTableEntry*); */ table->size = newsize; table->array = array; for (i = 0; i < oldsize; ++i, ++array) { HashTableEntry **current_entry_ptr, **entry_ptr, *entry; if (!*array) continue; current_entry_ptr = array + oldsize; for (entry_ptr = array, entry = *array; entry; entry = *entry_ptr) { UV index = CXSA_string_hash(entry->key, entry->len) & (newsize - 1); if (index != i) { *entry_ptr = entry->next; entry->next = *current_entry_ptr; *current_entry_ptr = entry; continue; } else { entry_ptr = &entry->next; } } } } void CXSA_HashTable_clear(HashTable *table, bool do_release_values) { if (table && table->items) { HashTableEntry** const array = table->array; UV riter = table->size - 1; do { HashTableEntry* entry = array[riter]; while (entry) { HashTableEntry* const temp = entry; entry = entry->next; if (temp->key) cxa_free((void*)temp->key); if (do_release_values) { cxa_free((void*)temp->value); } cxa_free(temp); } /* chocolateboy 2008-01-08 * * make sure we clear the array entry, so that subsequent probes fail */ array[riter] = NULL; } while (riter--); table->items = 0; } } void CXSA_HashTable_free(HashTable* table, bool do_release_values) { if (table) { CXSA_HashTable_clear(table, do_release_values); cxa_free(table->array); cxa_free(table); } } Class-XSAccessor-1.19/META.yml0000664000175000017500000000114112243573262014464 0ustar tseetsee--- abstract: 'Generate fast XS accessors without runtime compilation' author: - 'Steffen Mueller ' build_requires: Test::More: 0 configure_requires: ExtUtils::MakeMaker: 0 dynamic_config: 1 generated_by: 'ExtUtils::MakeMaker version 6.64, CPAN::Meta::Converter version 2.120921' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Class-XSAccessor no_index: directory: - t - inc requires: Time::HiRes: 0 XSLoader: 0 perl: 5.008 resources: repository: git://github.com/tsee/Class-XSAccessor.git version: 1.19 Class-XSAccessor-1.19/lib/0000755000175000017500000000000012243573262013762 5ustar tseetseeClass-XSAccessor-1.19/lib/Class/0000755000175000017500000000000012243573262015027 5ustar tseetseeClass-XSAccessor-1.19/lib/Class/XSAccessor.pm0000644000175000017500000002433512243573202017403 0ustar tseetseepackage Class::XSAccessor; use 5.008; use strict; use warnings; use Carp qw/croak/; use Class::XSAccessor::Heavy; use XSLoader; our $VERSION = '1.19'; XSLoader::load('Class::XSAccessor', $VERSION); sub _make_hash { my $ref = shift; if (ref ($ref)) { if (ref($ref) eq 'ARRAY') { $ref = { map { $_ => $_ } @$ref } } } else { $ref = { $ref, $ref }; } return $ref; } sub import { my $own_class = shift; my ($caller_pkg) = caller(); # Support both { getters => ... } and plain getters => ... my %opts = ref($_[0]) eq 'HASH' ? %{$_[0]} : @_; $caller_pkg = $opts{class} if defined $opts{class}; # TODO: Refactor. Move more duplicated code to ::Heavy my $read_subs = _make_hash($opts{getters} || {}); my $set_subs = _make_hash($opts{setters} || {}); my $acc_subs = _make_hash($opts{accessors} || {}); my $lvacc_subs = _make_hash($opts{lvalue_accessors} || {}); my $pred_subs = _make_hash($opts{predicates} || {}); my $ex_pred_subs = _make_hash($opts{exists_predicates} || {}); my $def_pred_subs = _make_hash($opts{defined_predicates} || {}); my $test_subs = _make_hash($opts{__tests__} || {}); my $construct_subs = $opts{constructors} || [defined($opts{constructor}) ? $opts{constructor} : ()]; my $true_subs = $opts{true} || []; my $false_subs = $opts{false} || []; foreach my $subtype ( ["getter", $read_subs], ["setter", $set_subs], ["accessor", $acc_subs], ["lvalue_accessor", $lvacc_subs], ["test", $test_subs], ["ex_predicate", $ex_pred_subs], ["def_predicate", $def_pred_subs], ["def_predicate", $pred_subs] ) { my $subs = $subtype->[1]; foreach my $subname (keys %$subs) { my $hashkey = $subs->{$subname}; _generate_method($caller_pkg, $subname, $hashkey, \%opts, $subtype->[0]); } } foreach my $subtype ( ["constructor", $construct_subs], ["true", $true_subs], ["false", $false_subs] ) { foreach my $subname (@{$subtype->[1]}) { _generate_method($caller_pkg, $subname, "", \%opts, $subtype->[0]); } } } sub _generate_method { my ($caller_pkg, $subname, $hashkey, $opts, $type) = @_; croak("Cannot use undef as a hash key for generating an XS $type accessor. (Sub: $subname)") if not defined $hashkey; $subname = "${caller_pkg}::$subname" if $subname !~ /::/; Class::XSAccessor::Heavy::check_sub_existence($subname) if not $opts->{replace}; no warnings 'redefine'; # don't warn about an explicitly requested redefine if ($type eq 'getter') { newxs_getter($subname, $hashkey); } elsif ($type eq 'lvalue_accessor') { newxs_lvalue_accessor($subname, $hashkey); } elsif ($type eq 'setter') { newxs_setter($subname, $hashkey, $opts->{chained}||0); } elsif ($type eq 'def_predicate') { newxs_defined_predicate($subname, $hashkey); } elsif ($type eq 'ex_predicate') { newxs_exists_predicate($subname, $hashkey); } elsif ($type eq 'constructor') { newxs_constructor($subname); } elsif ($type eq 'true') { newxs_boolean($subname, 1); } elsif ($type eq 'false') { newxs_boolean($subname, 0); } elsif ($type eq 'test') { newxs_test($subname, $hashkey); } else { newxs_accessor($subname, $hashkey, $opts->{chained}||0); } } 1; __END__ =head1 NAME Class::XSAccessor - Generate fast XS accessors without runtime compilation =head1 SYNOPSIS package MyClass; use Class::XSAccessor replace => 1, # Replace existing methods (if any) constructor => 'new', getters => { get_foo => 'foo', # 'foo' is the hash key to access get_bar => 'bar', }, setters => { set_foo => 'foo', set_bar => 'bar', }, accessors => { foo => 'foo', bar => 'bar', }, # "predicates" is an alias for "defined_predicates" defined_predicates => { defined_foo => 'foo', defined_bar => 'bar', }, exists_predicates => { has_foo => 'foo', has_bar => 'bar', }, lvalue_accessors => { # see below baz => 'baz', # ... }, true => [ 'is_token', 'is_whitespace' ], false => [ 'significant' ]; # The imported methods are implemented in fast XS. # normal class code here. As of version 1.05, some alternative syntax forms are available: package MyClass; # Options can be passed as a HASH reference, if preferred, # which can also help Perl::Tidy to format the statement correctly. use Class::XSAccessor { # If the name => key values are always identical, # the following shorthand can be used. accessors => [ 'foo', 'bar' ], }; =head1 DESCRIPTION Class::XSAccessor implements fast read, write and read/write accessors in XS. Additionally, it can provide predicates such as C for testing whether the attribute C exists in the object (which is different from "is defined within the object"). It only works with objects that are implemented as ordinary hashes. L implements the same interface for objects that use arrays for their internal representation. Since version 0.10, the module can also generate simple constructors (implemented in XS). Simply supply the C 'constructor_name'> option or the C ['new', 'create', 'spawn']> option. These constructors do the equivalent of the following Perl code: sub new { my $class = shift; return bless { @_ }, ref($class)||$class; } That means they can be called on objects and classes but will not clone objects entirely. Parameters to C are added to the object. The XS accessor methods are between 3 and 4 times faster than typical pure-Perl accessors in some simple benchmarking. The lower factor applies to the potentially slightly obscure C{foo} = $_[1]}>, so if you usually write clear code, a factor of 3.5 speed-up is a good estimate. If in doubt, do your own benchmarking! The method names may be fully qualified. The example in the synopsis could have been written as C instead of C. This way, methods can be installed in classes other than the current class. See also: the C option below. By default, the setters return the new value that was set, and the accessors (mutators) do the same. This behaviour can be changed with the C option - see below. The predicates return a boolean. Since version 1.01, C can generate extremely simple methods which just return true or false (and always do so). If that seems like a really superfluous thing to you, then consider a large class hierarchy with interfaces such as L. These methods are provided by the C and C options - see the synopsis. C check whether a given object attribute is defined. C is an alias for C for compatibility with older versions of C. C checks whether the given attribute exists in the object using C. =head1 OPTIONS In addition to specifying the types and names of accessors, additional options can be supplied which modify behaviour. The options are specified as key/value pairs in the same manner as the accessor declaration. For example: use Class::XSAccessor getters => { get_foo => 'foo', }, replace => 1; The list of available options is: =head2 replace Set this to a true value to prevent C from complaining about replacing existing subroutines. =head2 chained Set this to a true value to change the return value of setters and mutators (when called with an argument). If C is enabled, the setters and accessors/mutators will return the object. Mutators called without an argument still return the value of the associated attribute. As with the other options, C affects all methods generated in the same C statement. =head2 class By default, the accessors are generated in the calling class. The the C option allows the target class to be specified. =head1 LVALUES Support for lvalue accessors via the keyword C was added in version 1.08. At this point, B. Furthermore, their performance hasn't been benchmarked yet. The following example demonstrates an lvalue accessor: package Address; use Class::XSAccessor constructor => 'new', lvalue_accessors => { zip_code => 'zip' }; package main; my $address = Address->new(zip => 2); print $address->zip_code, "\n"; # prints 2 $address->zip_code = 76135; # <--- This is it! print $address->zip_code, "\n"; # prints 76135 =head1 CAVEATS Probably won't work for objects based on I hashes. But that's a strange thing to do anyway. Scary code exploiting strange XS features. If you think writing an accessor in XS should be a laughably simple exercise, then please contemplate how you could instantiate a new XS accessor for a new hash key that's only known at run-time. Note that compiling C code at run-time a la L is a no go. Threading. With version 1.00, a memory leak has been B. Previously, a small amount of memory would leak if C-based classes were loaded in a subthread without having been loaded in the "main" thread. If the subthread then terminated, a hash key and an int per associated method used to be lost. Note that this mattered only if classes were B loaded in a sort of throw-away thread. In the new implementation, as of 1.00, the memory will still not be released, in the same situation, but it will be recycled when the same class, or a similar class, is loaded again in B thread. =head1 SEE ALSO =over =item * L =item * L =back =head1 AUTHOR Steffen Mueller Esmueller@cpan.orgE chocolateboy Echocolate@cpan.orgE =head1 COPYRIGHT AND LICENSE Copyright (C) 2008, 2009, 2010, 2011, 2012, 2013 by Steffen Mueller This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.8 or, at your option, any later version of Perl 5 you may have available. =cut Class-XSAccessor-1.19/lib/Class/XSAccessor/0000755000175000017500000000000012243573262017044 5ustar tseetseeClass-XSAccessor-1.19/lib/Class/XSAccessor/Array.pm0000644000175000017500000002134312243573214020460 0ustar tseetseepackage Class::XSAccessor::Array; use 5.008; use strict; use warnings; use Carp qw/croak/; use Class::XSAccessor; use Class::XSAccessor::Heavy; our $VERSION = '1.19'; sub import { my $own_class = shift; my ($caller_pkg) = caller(); # Support both { getters => ... } and plain getters => ... my %opts = ref($_[0]) eq 'HASH' ? %{$_[0]} : @_; $caller_pkg = $opts{class} if defined $opts{class}; my $read_subs = $opts{getters} || {}; my $set_subs = $opts{setters} || {}; my $acc_subs = $opts{accessors} || {}; my $lvacc_subs = $opts{lvalue_accessors} || {}; my $pred_subs = $opts{predicates} || {}; my $construct_subs = $opts{constructors} || [defined($opts{constructor}) ? $opts{constructor} : ()]; my $true_subs = $opts{true} || []; my $false_subs = $opts{false} || []; foreach my $subtype ( ["getter", $read_subs], ["setter", $set_subs], ["accessor", $acc_subs], ["lvalue_accessor", $lvacc_subs], ["pred_subs", $pred_subs] ) { my $subs = $subtype->[1]; foreach my $subname (keys %$subs) { my $array_index = $subs->{$subname}; _generate_method($caller_pkg, $subname, $array_index, \%opts, $subtype->[0]); } } foreach my $subtype ( ["constructor", $construct_subs], ["true", $true_subs], ["false", $false_subs] ) { foreach my $subname (@{$subtype->[1]}) { _generate_method($caller_pkg, $subname, "", \%opts, $subtype->[0]); } } } sub _generate_method { my ($caller_pkg, $subname, $array_index, $opts, $type) = @_; croak("Cannot use undef as a array index for generating an XS $type accessor. (Sub: $subname)") if not defined $array_index; $subname = "${caller_pkg}::$subname" if $subname !~ /::/; Class::XSAccessor::Heavy::check_sub_existence($subname) if not $opts->{replace}; no warnings 'redefine'; # don't warn about an explicitly requested redefine if ($type eq 'getter') { newxs_getter($subname, $array_index); } if ($type eq 'lvalue_accessor') { newxs_lvalue_accessor($subname, $array_index); } elsif ($type eq 'setter') { newxs_setter($subname, $array_index, $opts->{chained}||0); } elsif ($type eq 'predicate') { newxs_predicate($subname, $array_index); } elsif ($type eq 'constructor') { newxs_constructor($subname); } elsif ($type eq 'true') { Class::XSAccessor::newxs_boolean($subname, 1); } elsif ($type eq 'false') { Class::XSAccessor::newxs_boolean($subname, 0); } else { newxs_accessor($subname, $array_index, $opts->{chained}||0); } } 1; __END__ =head1 NAME Class::XSAccessor::Array - Generate fast XS accessors without runtime compilation =head1 SYNOPSIS package MyClassUsingArraysAsInternalStorage; use Class::XSAccessor::Array constructor => 'new', getters => { get_foo => 0, # 0 is the array index to access get_bar => 1, }, setters => { set_foo => 0, set_bar => 1, }, accessors => { # a mutator buz => 2, }, predicates => { # test for definedness has_buz => 2, }, lvalue_accessors => { # see below baz => 3, }, true => [ 'is_token', 'is_whitespace' ], false => [ 'significant' ]; # The imported methods are implemented in fast XS. # normal class code here. As of version 1.05, some alternative syntax forms are available: package MyClass; # Options can be passed as a HASH reference if you prefer it, # which can also help PerlTidy to flow the statement correctly. use Class::XSAccessor { getters => { get_foo => 0, get_bar => 1, }, }; =head1 DESCRIPTION The module implements fast XS accessors both for getting at and setting an object attribute. Additionally, the module supports mutators and simple predicates (C like tests for definedness of an attributes). The module works only with objects that are implemented as B. Using it on hash-based objects is bound to make your life miserable. Refer to L for an implementation that works with hash-based objects. A simple benchmark showed a significant performance advantage over writing accessors in Perl. Since version 0.10, the module can also generate simple constructors (implemented in XS) for you. Simply supply the C 'constructor_name'> option or the C ['new', 'create', 'spawn']> option. These constructors do the equivalent of the following Perl code: sub new { my $class = shift; return bless [], ref($class)||$class; } That means they can be called on objects and classes but will not clone objects entirely. Note that any parameters to new() will be discarded! If there is a better idiom for array-based objects, let me know. While generally more obscure than hash-based objects, objects using blessed arrays as internal representation are a bit faster as its somewhat faster to access arrays than hashes. Accordingly, this module is slightly faster (~10-15%) than L, which works on hash-based objects. The method names may be fully qualified. In the example of the synopsis, you could have written C instead of C. This way, you can install methods in classes other than the current class. See also: The C option below. Since version 1.01, you can generate extremely simple methods which just return true or false (and always do so). If that seems like a really superfluous thing to you, then think of a large class hierarchy with interfaces such as PPI. This is implemented as the C and C options, see synopsis. =head1 OPTIONS In addition to specifying the types and names of accessors, you can add options which modify behaviour. The options are specified as key/value pairs just as the accessor declaration. Example: use Class::XSAccessor::Array getters => { get_foo => 0, }, replace => 1; The list of available options is: =head2 replace Set this to a true value to prevent C from complaining about replacing existing subroutines. =head2 chained Set this to a true value to change the return value of setters and mutators (when called with an argument). If C is enabled, the setters and accessors/mutators will return the object. Mutators called without an argument still return the value of the associated attribute. As with the other options, C affects all methods generated in the same C statement. =head2 class By default, the accessors are generated in the calling class. Using the C option, you can explicitly specify where the methods are to be generated. =head1 LVALUES Support for lvalue accessors via the keyword C was added in version 1.08. At this point, B. Furthermore, their performance hasn't been benchmarked yet. The following example demonstrates an lvalue accessor: package Address; use Class::XSAccessor constructor => 'new', lvalue_accessors => { zip_code => 0 }; package main; my $address = Address->new(2); print $address->zip_code, "\n"; # prints 2 $address->zip_code = 76135; # <--- This is it! print $address->zip_code, "\n"; # prints 76135 =head1 CAVEATS Probably wouldn't work if your objects are I. But that's a strange thing to do anyway. Scary code exploiting strange XS features. If you think writing an accessor in XS should be a laughably simple exercise, then please contemplate how you could instantiate a new XS accessor for a new hash key or array index that's only known at run-time. Note that compiling C code at run-time a la Inline::C is a no go. Threading. With version 1.00, a memory leak has been B that would leak a small amount of memory if you loaded C-based classes in a subthread that hadn't been loaded in the "main" thread before. If the subthread then terminated, a hash key and an int per associated method used to be lost. Note that this mattered only if classes were B loaded in a sort of throw-away thread. In the new implementation as of 1.00, the memory will not be released again either in the above situation. But it will be recycled when the same class or a similar class is loaded again in B thread. =head1 SEE ALSO L L =head1 AUTHOR Steffen Mueller Esmueller@cpan.orgE chocolateboy Echocolate@cpan.orgE =head1 COPYRIGHT AND LICENSE Copyright (C) 2008, 2009, 2010, 2011, 2012, 2013 by Steffen Mueller This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.8 or, at your option, any later version of Perl 5 you may have available. =cut Class-XSAccessor-1.19/lib/Class/XSAccessor/Heavy.pm0000644000175000017500000000307112243573226020457 0ustar tseetseepackage # hide from PAUSE Class::XSAccessor::Heavy; use 5.008; use strict; use warnings; use Carp; our $VERSION = '1.19'; our @CARP_NOT = qw( Class::XSAccessor Class::XSAccessor::Array ); # TODO Move more duplicated code from XSA and XSA::Array here sub check_sub_existence { my $subname = shift; my $sub_package = $subname; $sub_package =~ s/([^:]+)$// or die; my $bare_subname = $1; my $sym; { no strict 'refs'; $sym = \%{"$sub_package"}; } no warnings; local *s = $sym->{$bare_subname}; my $coderef = *s{CODE}; if ($coderef) { $sub_package =~ s/::$//; Carp::croak("Cannot replace existing subroutine '$bare_subname' in package '$sub_package' with an XS implementation. If you wish to force a replacement, add the 'replace => 1' parameter to the arguments of 'use ".(caller())[0]."'."); } } 1; __END__ =head1 NAME Class::XSAccessor::Heavy - Guts you don't care about =head1 SYNOPSIS use Class::XSAccessor! =head1 DESCRIPTION Common guts for Class::XSAccessor and Class::XSAccessor::Array. No user-serviceable parts inside! =head1 SEE ALSO L L =head1 AUTHOR Steffen Mueller, Esmueller@cpan.orgE chocolateboy, Echocolate@cpan.orgE =head1 COPYRIGHT AND LICENSE Copyright (C) 2008, 2009, 2010, 2011, 2012, 2013 by Steffen Mueller This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.8 or, at your option, any later version of Perl 5 you may have available. =cut Class-XSAccessor-1.19/MANIFEST0000644000175000017500000000212412243573262014344 0ustar tseetseeauthor_scripts/benchmark.pl author_scripts/constructor_benchmark.pl author_scripts/refcount_constructor.pl Changes cxsa_hash_table.c cxsa_hash_table.h cxsa_locking.c cxsa_locking.h cxsa_main.c cxsa_main.h cxsa_memory.c cxsa_memory.h lib/Class/XSAccessor.pm lib/Class/XSAccessor/Array.pm lib/Class/XSAccessor/Heavy.pm Makefile.PL MANIFEST This list of files MurmurHashNeutral2.h ppport.h README t/01hash_basic.t t/02hash_accessor.t t/03hash_predicate.t t/04hash_chained.t t/05hash_replace.t t/06hash_constructor.t t/07hash_boolean.t t/08hash_entersub.t t/09hash_use_hash.t t/10hash_lvalue.t t/31array_basic.t t/32array_accessor.t t/33array_predicate.t t/34array_chained.t t/35array_replace.t t/36array_constructor.t t/37array_boolean.t t/38array_use_hash.t t/39array_lvalue.t t/40hash_bad_call.t t/41array_bad_call.t t/50reentrant_goto_sigsegv.t t/70bad_arguments.t t/80threadbomb.t XS/Array.xs XS/Hash.xs XS/HashCACompat.xs XSAccessor.xs META.yml Module YAML meta-data (added by MakeMaker) META.json Module JSON meta-data (added by MakeMaker) Class-XSAccessor-1.19/t/0000755000175000017500000000000012243573262013457 5ustar tseetseeClass-XSAccessor-1.19/t/10hash_lvalue.t0000644000175000017500000000146711515060264016302 0ustar tseetseeuse strict; use warnings; use Test::More tests => 11; BEGIN { use_ok('Class::XSAccessor') }; package Foo; use Class::XSAccessor lvalue_accessors => { "bar" => "bar2" }; package main; BEGIN {pass();} ok( Foo->can('bar') ); my $foo = bless {bar2 => 'b'} => 'Foo'; my $x = $foo->bar(); ok($x eq 'b'); $foo->bar = "buz"; ok($x eq 'b'); ok($foo->bar() eq 'buz'); { # SCOPE my $baz = bless {} => 'Foo'; eval { $baz->bar = 12; }; ok(!$@, 'assignment to !exists hash element is okay'); is($baz->bar, 12); } { # SCOPE my $baz = bless {} => 'Foo'; my $baz2 = bless {} => 'Foo'; eval { $baz->bar = $baz2; }; ok(!$@, 'assignment to !exists hash element is okay'); eval { $baz->bar->bar = 12; }; ok(!$@, 'assignment to !exists hash element is okay'); is($baz->bar->bar, 12); } Class-XSAccessor-1.19/t/02hash_accessor.t0000644000175000017500000000402612045474207016614 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor accessors => { bar => "b\0ar" }, getters => { get_foo => 'foo' }, setters => { set_foo => 'foo' }; use Class::XSAccessor accessors => 'single'; use Class::XSAccessor accessors => [qw/mult iple/]; sub new { my $class = shift; bless { "b\0ar" => 'baz' }, $class; } package main; use Test::More tests => 31; my $obj = Class::XSAccessor::Test->new(); ok ($obj->can('bar')); is ($obj->set_foo('bar'), 'bar'); is ($obj->get_foo(), 'bar'); is ($obj->bar(), 'baz'); is ($obj->bar('quux'), 'quux'); is ($obj->bar(), 'quux'); ok ($obj->can($_)) for qw/single mult iple/; is ($obj->single("elgnis"), "elgnis"); is ($obj->mult("tlum"), "tlum"); is ($obj->iple("elpi"), "elpi"); is ($obj->single(), "elgnis"); is ($obj->mult(), "tlum"); is ($obj->iple(), "elpi"); package Class::XSAccessor::Test2; sub new { my $class = shift; bless { bar => 'baz' }, $class; } package main; use Class::XSAccessor class => 'Class::XSAccessor::Test2', accessors => { bar => 'bar' }, getters => { get_foo => 'foo' }, setters => { set_foo => 'foo' }; my $obj2 = Class::XSAccessor::Test2->new(); ok ($obj2->can('bar')); is ($obj2->set_foo('bar'), 'bar'); is ($obj2->get_foo(), 'bar'); is ($obj2->bar(), 'baz'); is ($obj2->bar('quux'), 'quux'); is ($obj2->bar(), 'quux'); # test shorthand accessor mixed with getters/setters # for that same key package Class::XSAccessor::Test3; use Class::XSAccessor accessors => [ 'foo', 'bar' ], getters => { get_foo => 'foo', get_bar => 'bar', }, setters => { set_foo => 'foo', set_bar => 'bar', }; sub new { my $class = shift; bless {}, $class; } package main; my $obj3 = Class::XSAccessor::Test3->new; is($obj3->set_foo(3), 3); is($obj3->get_foo, 3); is($obj3->foo, 3); is($obj3->foo(4), 4); is($obj3->foo, 4); is($obj3->get_foo, 4); is($obj3->bar(33), 33); is($obj3->get_bar, 33); is($obj3->set_bar(44), 44); is($obj3->bar, 44); Class-XSAccessor-1.19/t/70bad_arguments.t0000644000175000017500000000246611630134572016632 0ustar tseetseeuse strict; use warnings; use Test::More tests => 3 + 6; BEGIN { use_ok('Class::XSAccessor') }; BEGIN { use_ok('Class::XSAccessor::Array') }; package FooHash; use Class::XSAccessor getters => { get_foo => 'foo', }; package FooArray; use Class::XSAccessor::Array getters => { get_foo => 0, }; package main; BEGIN {pass();} my ($foo, $bar); my @tests = ( { name => 'Hash as Hash object', expect => 'pass', obj => bless({} => 'FooHash'), }, { name => 'Array as Hash object', expect => 'fail', obj => bless([] => 'FooHash'), }, { name => 'Scalar as Hash object', expect => 'fail', obj => bless(\$foo => 'FooHash'), }, { name => 'Hash as Array object', expect => 'fail', obj => bless({} => 'FooArray'), }, { name => 'Array as Array object', expect => 'pass', obj => bless([] => 'FooArray'), }, { name => 'Scalar as Array object', expect => 'fail', obj => bless(\$bar => 'FooArray'), }, ); foreach my $test (sort {$a->{name} cmp $b->{name}} @tests) { my ($expect, $name, $obj) = @{$test}{qw(expect name obj)}; my $okay = eval { $obj->get_foo; 1; }; my $err = $@ || ''; chomp $err; ok( ($expect eq 'pass' && $okay) || ($expect eq 'fail' && !$okay), "$name (errmsg: $err)" ); } Class-XSAccessor-1.19/t/50reentrant_goto_sigsegv.t0000644000175000017500000000303111463251712020563 0ustar tseetsee# segfault bug in perls < 5.8.9 (a perl bug) # patches welcome # see http://github.com/tsee/Class-XSAccessor/commit/8fe9c128027cc49c8e2d89c442c77285598b12d3 use strict; use warnings; use Class::XSAccessor; use Test::More tests => 14; my $shim_calls; sub install_accessor_with_shim { my ($class, $name, $field) = @_; $field = $name if not defined $field; Class::XSAccessor->import ({ class => $class, getters => { $name => $field }, replace => 1, }); my $xs_cref = $class->can ($name); no strict 'refs'; no warnings 'redefine'; *{"${class}::${name}"} = sub { $shim_calls++; goto $xs_cref; }; } TODO: { todo_skip 'bug in perls < 5.8.9', 14, $] < 5.008009; for my $name (qw/bar baz/) { for my $pass (1..2) { $shim_calls = 0; install_accessor_with_shim ('Foo', $name); my $obj = bless ({ $name => 'a'}, 'Foo'); is ($shim_calls, 0, "Reset number of calls ($name pass $pass)" ); is ($obj->$name, 'a', "Accessor read works ($name pass $pass)" ); is ($shim_calls, 1, "Shim called ($name pass $pass)" ); eval { $obj->$name ('ack!') }; ok ($@ =~ /Usage\: $name\(self\)/, "Exception from R/O accessor thrown ($name pass $pass)" ); is ($shim_calls, 2, "Shim called anyway ($name pass $pass)" ); eval { $obj->$name ('ick!') }; ok ($@ =~ /Usage\: $name\(self\)/, "Exception from R/O accessor thrown once again ($name pass $pass)" ); is ($shim_calls, 3, "Shim called again ($name pass $pass)" ); } } } Class-XSAccessor-1.19/t/05hash_replace.t0000644000175000017500000000125711437463533016437 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor getters => { get_foo => 'foo' }; sub new { my $class = shift; bless { foo => 'baz' }, $class; } package main; use Test::More tests => 4; my $obj = Class::XSAccessor::Test->new(); ok($obj->can('get_foo')); is($obj->get_foo(), 'baz'); package Class::XSAccessor::Test; eval <<'HERE'; use Class::XSAccessor getters => { get_foo => 'foo' }; HERE package main; ok($@, 'refuses to replace by default'); package Class::XSAccessor::Test; eval <<'HERE'; use Class::XSAccessor replace => 1, getters => { get_foo => 'foo' }; HERE package main; ok(!$@, 'replacing allowed'); Class-XSAccessor-1.19/t/40hash_bad_call.t0000644000175000017500000000302412016511770016525 0ustar tseetseeuse strict; use warnings; use Test::More tests => 19; BEGIN { use_ok('Class::XSAccessor') }; package Hash; use Class::XSAccessor { accessors => [ qw(foo bar) ], constructor => 'new' }; package main; my $hash = Hash->new(); isa_ok $hash, 'Hash'; can_ok $hash, 'foo', 'bar'; $hash->foo('FOO'); $hash->bar('BAR'); is $hash->foo, 'FOO'; is $hash->bar, 'BAR'; my $ok; my $err; $ok = eval { Hash->foo; 1 }; $err = $@ || 'Zombie error'; ok(!$ok); like $err, qr{Class::XSAccessor: invalid instance method invocant: no hash ref supplied }; $ok = eval { Hash->bar; 1 }; $err = $@ || 'Zombie error'; ok(!$ok); like $err, qr{Class::XSAccessor: invalid instance method invocant: no hash ref supplied }; $ok = eval { Hash::foo() }; $err = $@ || 'Zombie error'; ok(!$ok); # package name introduced in 5.10.1 SKIP: { skip "Old perl behaves funny. You should upgrade.", 1 if $] < 5.010001; like $err, qr{Usage: (Hash::)?foo\(self, \.\.\.\) }; } $ok = eval { Hash::bar(); 1 }; $err = $@ || 'Zombie error'; ok(!$ok); SKIP: { skip "Old perl behaves funny. You should upgrade.", 1 if $] < 5.010001; like $err, qr{Usage: (Hash::)?bar\(self, \.\.\.\) }; } $ok = eval { Hash::foo( [] ); 1 }; $err = $@ || 'Zombie error'; ok(!$ok); like $err, qr{Class::XSAccessor: invalid instance method invocant: no hash ref supplied }; $ok = eval { Hash::bar( '' ); 1 }; $err = $@ || 'Zombie error'; ok(!$ok); like $err, qr{Class::XSAccessor: invalid instance method invocant: no hash ref supplied }; is Hash::foo($hash), 'FOO'; is Hash::bar($hash), 'BAR'; Class-XSAccessor-1.19/t/35array_replace.t0000644000175000017500000000126111437463533016630 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor::Array getters => { get_foo => 0 }; sub new { my $class = shift; bless [ 'baz' ], $class; } package main; use Test::More tests => 4; my $obj = Class::XSAccessor::Test->new(); ok($obj->can('get_foo')); is($obj->get_foo(), 'baz'); package Class::XSAccessor::Test; eval <<'HERE'; use Class::XSAccessor::Array getters => { get_foo => 0 }; HERE package main; ok($@, 'refuses to replace by default'); package Class::XSAccessor::Test; eval <<'HERE'; use Class::XSAccessor::Array replace => 1, getters => { get_foo => 0 }; HERE package main; ok(!$@, 'replacing allowed'); Class-XSAccessor-1.19/t/03hash_predicate.t0000644000175000017500000000333712157631271016757 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor accessors => { bar => 'bar' }, getters => { get_foo => 'foo', get_zero => 'zero' }, setters => { set_foo => 'foo' }, predicates => { has_foo => 'foo', has_bar => 'bar', has_zero => 'zero' }, defined_predicates => { has_foo2 => 'foo', has_bar2 => 'bar', has_zero2 => 'zero' }, exists_predicates => { has_baz => 'baz', has_buz => 'buz' }; use Class::XSAccessor predicates => 'single'; use Class::XSAccessor predicates => [qw/mult iple/]; sub new { my $class = shift; bless { bar => 'baz', zero => 0, buz => undef }, $class; } package main; use Test::More tests => 29; my $obj = Class::XSAccessor::Test->new(); ok($obj->can('has_foo')); ok($obj->can('has_bar')); ok(!$obj->has_foo()); ok(!$obj->has_foo2()); ok(!$obj->has_baz()); ok($obj->has_buz()); ok($obj->has_bar()); is($obj->set_foo('bar'), 'bar'); is($obj->bar('quux'), 'quux'); ok($obj->has_foo()); ok($obj->has_bar()); ok($obj->has_foo2()); ok($obj->has_bar2()); is($obj->set_foo(undef), undef); is($obj->bar(undef), undef); $obj->{foo2} = undef; ok(!$obj->has_foo()); # undef is "doesn't have" for defined_predicates ok(!$obj->has_foo2()); # undef is "doesn't have" for defined_predicates delete $obj->{foo}; delete $obj->{foo2}; ok(!$obj->has_foo()); ok(!$obj->has_foo2()); $obj->{baz} = undef; ok($obj->has_baz(), "exists_predicates on undef elem is true"); delete $obj->{baz}; ok(!$obj->has_baz(), "exists_predicates on non-existant elem is false"); is($obj->get_zero, 0); ok($obj->has_zero); ok(!$obj->single); ok(!$obj->mult); ok(!$obj->iple); $obj->{$_} = 1 for qw/single mult/; ok($obj->single); ok($obj->mult); ok(!$obj->iple); Class-XSAccessor-1.19/t/31array_basic.t0000644000175000017500000000304711437463533016276 0ustar tseetseeuse strict; use warnings; use Test::More tests => 26; BEGIN { use_ok('Class::XSAccessor::Array') }; package Foo; use Class::XSAccessor::Array getters => { get_foo => 0, get_bar => 1, }; package main; BEGIN {pass();} package Foo; use Class::XSAccessor::Array replace => 1, getters => { get_foo => 0, get_bar => 1, }; package main; BEGIN {pass();} ok( Foo->can('get_foo') ); ok( Foo->can('get_bar') ); my $foo = bless ['a','b'] => 'Foo'; ok($foo->get_foo() eq 'a'); ok($foo->get_bar() eq 'b'); package Foo; use Class::XSAccessor::Array setters=> { set_foo => 0, set_bar => 1, }; package main; BEGIN{pass()} ok( Foo->can('set_foo') ); ok( Foo->can('set_bar') ); $foo->set_foo('1'); pass(); $foo->set_bar('2'); pass(); ok($foo->get_foo() eq '1'); ok($foo->get_bar() eq '2'); # Make sure scalars are copied and not stored by reference (RT 38573) my $x = 1; $foo->set_foo($x); $x++; is( $foo->get_foo(), 1, 'scalar copied properly' ); # test that multiple methods can point to the same attr. package Foo; use Class::XSAccessor::Array getters => { get_FOO => 0, get_BAR => 10000, }, setters => { set_FOO => 0, }; package main; BEGIN{pass()} ok( Foo->can('get_foo') ); ok( Foo->can('get_bar') ); my $FOO = bless ['a', 'c'] => 'Foo'; $FOO->[10000] = 'wow'; ok( Foo->can('get_FOO') ); ok( Foo->can('set_FOO') ); ok($FOO->get_FOO() eq 'a'); ok($FOO->get_foo() eq 'a'); $FOO->set_FOO('b'); ok($FOO->get_FOO() eq 'b'); ok($FOO->get_foo() eq 'b'); ok($FOO->get_bar() eq 'c'); ok($FOO->get_BAR() eq 'wow'); Class-XSAccessor-1.19/t/09hash_use_hash.t0000644000175000017500000000422611437463533016626 0ustar tseetsee#!/usr/bin/perl # This is a copy of 01hash_basic.t, but using use module { ... } use strict; use warnings; use Test::More tests => 35; BEGIN { use_ok('Class::XSAccessor') }; package Foo; use Class::XSAccessor { getters => { get_foo => 'foo', get_bar => 'bar', }, }; package main; BEGIN {pass();} package Foo; use Class::XSAccessor { replace => 1, getters => { get_foo => 'foo', get_bar => 'bar', }, }; package main; BEGIN {pass();} ok( Foo->can('get_foo') ); ok( Foo->can('get_bar') ); my $foo = bless {foo => 'a', bar => 'b'} => 'Foo'; ok($foo->get_foo() eq 'a'); ok($foo->get_bar() eq 'b'); package Foo; use Class::XSAccessor { setters => { set_foo => 'foo', set_bar => 'bar', }, }; package main; BEGIN{pass()} ok( Foo->can('set_foo') ); ok( Foo->can('set_bar') ); $foo->set_foo('1'); pass(); $foo->set_bar('2'); pass(); ok($foo->get_foo() eq '1'); ok($foo->get_bar() eq '2'); # Make sure scalars are copied and not stored by reference (RT 38573) my $x = 1; $foo->set_foo($x); $x++; is( $foo->get_foo(), 1, 'scalar copied properly' ); # test that multiple methods can point to the same attr. package Foo; use Class::XSAccessor { getters => { get_FOO => 'foo', }, setters => { set_FOO => 'foo', }, }; # test shorthand syntax package Foo; use Class::XSAccessor { getters => 'barfle', setters => {set_barfle => 'barfle'}, }; use Class::XSAccessor { getters => [qw/a b/], setters => 'c', }; package main; BEGIN{pass()} ok( Foo->can('get_foo') ); ok( Foo->can('get_bar') ); my $FOO = bless { foo => 'a', bar => 'c', barfle => 'works', a => 'a1', b => 'b1', c => 'c1', } => 'Foo'; ok( $FOO->can('get_FOO') ); ok( $FOO->can('set_FOO') ); ok($FOO->get_FOO() eq 'a'); ok($FOO->get_foo() eq 'a'); $FOO->set_FOO('b'); ok($FOO->get_FOO() eq 'b'); ok($FOO->get_foo() eq 'b'); # tests for shorthand foreach my $name (qw(barfle a b c)) { ok($FOO->can($name)); } is($FOO->a(), 'a1'); is($FOO->b(), 'b1'); $FOO->c("1c"); is($FOO->{c}, '1c'); $FOO->{a} = '1a'; $FOO->{b} = '1b'; is($FOO->a(), '1a'); is($FOO->b(), '1b'); is($FOO->barfle(), 'works'); $FOO->set_barfle("elfrab"); is($FOO->barfle(), "elfrab"); Class-XSAccessor-1.19/t/36array_constructor.t0000644000175000017500000000267111442131657017604 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor::Array constructor => 'new', accessors => { bar => 0, blubber => 2 }, getters => { get_foo => 1 }, setters => { set_foo => 1 }; our $DESTROYED = 0; sub DESTROY { $DESTROYED = 1 } package main; use Test::More tests => 21; ok (Class::XSAccessor::Test->can('new')); my $obj = Class::XSAccessor::Test->new( bar => 'baz' ); ok ($obj->can('bar')); is ($obj->set_foo('bar'), 'bar'); is ($obj->get_foo(), 'bar'); ok (!defined($obj->bar())); is ($obj->bar('quux'), 'quux'); is ($obj->bar(), 'quux'); my $obj2 = $obj->new(bar => 'baz', 'blubber' => 'blabber'); ok ($obj2->can('bar')); is ($obj2->set_foo('bar'), 'bar'); is ($obj2->get_foo(), 'bar'); ok (!defined($obj2->bar())); is ($obj2->bar('quux'), 'quux'); is ($obj2->bar(), 'quux'); ok (!defined($obj2->blubber())); # make sure the object refcount is valid (i.e. it's not reaped at the end of an inner scope if it's # referenced in an outer scope) { my $obj3; { is($Class::XSAccessor::Test::DESTROYED, 0); $obj3 = do { Class::XSAccessor::Test->new(bar => 'baz', 'blubber' => 'blabber') }; is($Class::XSAccessor::Test::DESTROYED, 0); } is($Class::XSAccessor::Test::DESTROYED, 0); ok($obj3, 'object not reaped in outer scope'); isa_ok($obj3, 'Class::XSAccessor::Test'); can_ok($obj3, qw(bar blubber get_foo set_foo)); } is($Class::XSAccessor::Test::DESTROYED, 1); Class-XSAccessor-1.19/t/39array_lvalue.t0000644000175000017500000000056712127502530016505 0ustar tseetseeuse strict; use warnings; use Test::More tests => 6; BEGIN { use_ok('Class::XSAccessor::Array') }; package Foo; use Class::XSAccessor::Array lvalue_accessors => { "bar" => 0, }; package main; BEGIN {pass();} ok( Foo->can('bar') ); my $foo = bless ['b'] => 'Foo'; my $x = $foo->bar(); ok($x eq 'b'); $foo->bar = "buz"; ok($x eq 'b'); ok($foo->bar() eq 'buz'); Class-XSAccessor-1.19/t/33array_predicate.t0000644000175000017500000000127211437463533017155 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor::Array accessors => { bar => 0 }, getters => { get_foo => 1 }, setters => { set_foo => 1 }, predicates => { has_foo => 1, has_bar => 0 }; sub new { my $class = shift; bless [ 'baz' ], $class; } package main; use Test::More tests => 12; my $obj = Class::XSAccessor::Test->new(); ok($obj->can('has_foo')); ok($obj->can('has_bar')); ok(!$obj->has_foo()); ok($obj->has_bar()); is($obj->set_foo('bar'), 'bar'); is($obj->bar('quux'), 'quux'); ok($obj->has_foo()); ok($obj->has_bar()); is($obj->set_foo(undef), undef); is($obj->bar(undef), undef); ok(!$obj->has_foo()); ok(!$obj->has_bar()); Class-XSAccessor-1.19/t/80threadbomb.t0000644000175000017500000000657511667421156016143 0ustar tseetseeuse strict; use warnings; BEGIN { use Config; if (! $Config{'useithreads'}) { print("1..0 # SKIP Perl not compiled with 'useithreads'\n"); exit(0); } } # The purpose of this test is to check the thread-safety of the module. # Since this kind of stuff is highly non-deterministic, it's hard to construct # tests that are. The test consists of running several threads in parallel, # which all try the two main aspects of the module in a tight loop: # - creating methods # - calling those methods # The former is the type of operation that writes to thread-shared memory # and requires locking. The latter should not pose any threat to thread-safety # apart from the OP-tree-inlining optimization. # Given a certain number of operations per thread, we randomly choose a fraction # of method creations and method calls to make sure that there's some overlap of # both types of operations among all test threads. # The 'common' method below is special cased to ensure that there's some method # overwriting going on that likely affects multiple threads trying to modify or # read-access the thread-global memory at the same time in the # most-likely-colliding manner. The writing-to-shared-memory situation is very # likely to cause this to crash if the locking isn't working since the memory # is re-allocated with a geometric-growth algorithm. # PS: I suspect the whole locking thing is broken on cygwin and thus this test # consistently fails there. srand(0); $| = 1; # show tests ASAP our $NumThreads = 5; our $NumOperations = 10000; our $CreationFractionHard = 0.2; our $CreationFractionFuzzy = 0.3; our $CommonMethodFraction = 0.15; our $AUTHOR_TESTING = $ENV{AUTHOR_TESTING}; if ($AUTHOR_TESTING) { $NumThreads = 30; $NumOperations = 10000000; $CreationFractionHard = 0.001; $CreationFractionFuzzy = 0.001; } # Not using Test::More simply because it's too much hassle to # hack around issues with running in parallel. print "1.." . ($NumThreads*3 + 1) . "\n"; use threads; use Class::XSAccessor; use Time::HiRes qw(sleep); my @chars = ('a'..'z', 'A'..'Z'); my @t; foreach (1..$NumThreads) { push @t, threads->new(\&_thread_main, $_); } $_->join for @t; print "ok - all reaped\n"; # DONE sub _thread_main { my $no = shift; our $obj = bless({} => 'Foo'); my $ngen = int( $NumOperations*$CreationFractionHard + $NumOperations*$CreationFractionFuzzy * rand() ); my $ninvoke = $NumOperations - $ngen; # This makes sense only if we plan to do a lot of work in the threads # => AUTHOR_TESTING sleep(rand()) if $AUTHOR_TESTING; print "ok - starting method generation, thread $no\n"; my %fields; foreach (1 .. $ngen) { my $fieldname = (rand > $CommonMethodFraction ? join('', map {$chars[rand(@chars)]} 1..5) : 'common'); $fields{$fieldname} = undef; Class::XSAccessor->import( replace => 1, class => 'Foo', getters => {$fieldname=> $fieldname} ); print "# thread $no: Generated method $_ of $ngen\n" if $AUTHOR_TESTING and not $_ % 10000; } print "ok - done with method generation, thread $no\n"; my @methods = keys %fields; foreach (1..$ninvoke) { if (rand() > $CommonMethodFraction) { my $name = $methods[rand @methods]; $obj->$name; } else { $obj->common; } print "# thread $no: Ran method $_ of $ninvoke\n" if $AUTHOR_TESTING and not $_ % 100000; } print "ok - done, thread $no\n"; } Class-XSAccessor-1.19/t/04hash_chained.t0000644000175000017500000000101211437463533016403 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor chained => 1, accessors => { bar => 'bar' }, getters => { get_foo => 'foo' }, setters => { set_foo => 'foo' }; sub new { my $class = shift; bless { bar => 'baz' }, $class; } package main; use Test::More tests => 6; my $obj = Class::XSAccessor::Test->new(); ok($obj->can('bar')); is($obj->set_foo('bar'), $obj); is($obj->get_foo(), 'bar'); is($obj->bar(), 'baz'); is($obj->bar('quux'), $obj); is($obj->bar(), 'quux'); Class-XSAccessor-1.19/t/41array_bad_call.t0000644000175000017500000000215311437463533016734 0ustar tseetseeuse strict; use warnings; use Test::More tests => 13; BEGIN { use_ok('Class::XSAccessor') }; package Array; use Class::XSAccessor::Array { accessors => { foo => 0, bar => 1 }, constructor => 'new' }; package main; my $array = Array->new(); isa_ok $array, 'Array'; can_ok $array, 'foo', 'bar'; $array->foo('FOO'); $array->bar('BAR'); is $array->foo, 'FOO'; is $array->bar, 'BAR'; eval { Array->foo }; like $@, qr{Class::XSAccessor: invalid instance method invocant: no array ref supplied }; eval { Array->bar }; like $@, qr{Class::XSAccessor: invalid instance method invocant: no array ref supplied }; eval { Array::foo() }; # package name introduced in 5.10.1 like $@, qr{Usage: (Array::)?foo\(self, \.\.\.\) }; eval { Array::bar() }; like $@, qr{Usage: (Array::)?bar\(self, \.\.\.\) }; eval { Array::foo( {} ) }; like $@, qr{Class::XSAccessor: invalid instance method invocant: no array ref supplied }; eval { Array::bar( '' ) }; like $@, qr{Class::XSAccessor: invalid instance method invocant: no array ref supplied }; is Array::foo($array), 'FOO'; is Array::bar($array), 'BAR'; Class-XSAccessor-1.19/t/01hash_basic.t0000644000175000017500000000462012045474207016072 0ustar tseetseeuse strict; use warnings; use Test::More tests => 39; BEGIN { use_ok('Class::XSAccessor') }; package Foo; use Class::XSAccessor getters => { get_foo => 'foo', get_bar => 'bar', }; # test run-time generation, too Class::XSAccessor->import( getters => { get_c => 'c', } ); package main; BEGIN {pass();} package Foo; use Class::XSAccessor replace => 1, getters => { get_foo => 'foo', get_bar => "bar\0baz", }; package main; BEGIN {pass();} ok( Foo->can('get_foo') ); ok( Foo->can('get_bar') ); my $foo = bless {foo => 'a', "bar\0baz" => 'b', c => 'd'} => 'Foo'; ok($foo->get_foo() eq 'a'); ok($foo->get_bar() eq 'b'); can_ok($foo, 'get_c'); is($foo->get_c(), 'd'); package Foo; use Class::XSAccessor setters => { set_foo => 'foo', set_bar => "bar\0baz", }; package main; BEGIN{pass()} ok( Foo->can('set_foo') ); ok( Foo->can('set_bar') ); $foo->set_foo('1'); pass(); $foo->set_bar('2'); pass(); ok($foo->get_foo() eq '1'); ok($foo->get_bar() eq '2'); # Make sure scalars are copied and not stored by reference (RT 38573) my $x = 1; $foo->set_foo($x); $x++; is( $foo->get_foo(), 1, 'scalar copied properly' ); # test that multiple methods can point to the same attr. package Foo; use Class::XSAccessor getters => { get_FOO => 'foo', }, setters => { set_FOO => 'foo', }; # test shorthand syntax package Foo; use Class::XSAccessor getters => 'barfle', setters => {set_barfle => 'barfle'}; use Class::XSAccessor getters => [qw/a b/], setters => 'c'; package main; BEGIN{pass()} ok( Foo->can('get_foo') ); ok( Foo->can('get_bar') ); my $FOO = bless { foo => 'a', bar => 'c', barfle => 'works', a => 'a1', b => 'b1', c => 'c1', } => 'Foo'; ok( $FOO->can('get_FOO') ); ok( $FOO->can('set_FOO') ); ok($FOO->get_FOO() eq 'a'); ok($FOO->get_foo() eq 'a'); $FOO->set_FOO('b'); ok($FOO->get_FOO() eq 'b'); ok($FOO->get_foo() eq 'b'); # tests for shorthand foreach my $name (qw(barfle a b c)) { ok($FOO->can($name)); } is($FOO->a(), 'a1'); is($FOO->b(), 'b1'); $FOO->c("1c"); is($FOO->{c}, '1c'); $FOO->{a} = '1a'; $FOO->{b} = '1b'; is($FOO->a(), '1a'); is($FOO->b(), '1b'); is($FOO->barfle(), 'works'); $FOO->set_barfle("elfrab"); is($FOO->barfle(), "elfrab"); # test fully qualified name in other class Class::XSAccessor->import( getters => { "Foo::also_get_c" => 'c' }, ); can_ok($FOO, 'also_get_c'); is($FOO->also_get_c(), $FOO->{c}); Class-XSAccessor-1.19/t/34array_chained.t0000644000175000017500000000077611437463533016621 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor::Array chained => 1, accessors => { bar => 0 }, getters => { get_foo => 1 }, setters => { set_foo => 1 }; sub new { my $class = shift; bless [ 'baz' ], $class; } package main; use Test::More tests => 6; my $obj = Class::XSAccessor::Test->new(); ok($obj->can('bar')); is($obj->set_foo('bar'), $obj); is($obj->get_foo(), 'bar'); is($obj->bar(), 'baz'); is($obj->bar('quux'), $obj); is($obj->bar(), 'quux'); Class-XSAccessor-1.19/t/06hash_constructor.t0000644000175000017500000000307411442131657017404 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor constructor => 'new', accessors => { bar => 'bar', blubber => 'blubber' }, getters => { get_foo => 'foo' }, setters => { set_foo => 'foo' }; our $DESTROYED = 0; sub DESTROY { $DESTROYED = 1 } package main; use Test::More tests => 23; ok (Class::XSAccessor::Test->can('new')); my $obj = Class::XSAccessor::Test->new(bar => 'baz', 'blubber' => 'blabber'); ok ($obj->can('bar')); is ($obj->set_foo('bar'), 'bar'); is ($obj->get_foo(), 'bar'); is ($obj->bar(), 'baz'); is ($obj->bar('quux'), 'quux'); is ($obj->bar(), 'quux'); is ($obj->blubber(), 'blabber'); my $obj2 = $obj->new(bar => 'baz', 'blubber' => 'blabber'); ok ($obj2->can('bar')); is ($obj2->set_foo('bar'), 'bar'); is ($obj2->get_foo(), 'bar'); is ($obj2->bar(), 'baz'); is ($obj2->bar('quux'), 'quux'); is ($obj2->bar(), 'quux'); is ($obj2->blubber(), 'blabber'); eval 'Class::XSAccessor::Test->new("uneven_no_of_args")'; ok ($@); # make sure the object refcount is valid (i.e. it's not reaped at the end of an inner scope if it's # referenced in an outer scope) { my $obj3; { is($Class::XSAccessor::Test::DESTROYED, 0); $obj3 = do { Class::XSAccessor::Test->new(bar => 'baz', 'blubber' => 'blabber') }; is($Class::XSAccessor::Test::DESTROYED, 0); } is($Class::XSAccessor::Test::DESTROYED, 0); ok($obj3, 'object not reaped in outer scope'); isa_ok($obj3, 'Class::XSAccessor::Test'); can_ok($obj3, qw(bar blubber get_foo set_foo)); } is($Class::XSAccessor::Test::DESTROYED, 1); Class-XSAccessor-1.19/t/32array_accessor.t0000644000175000017500000000175211437463533017021 0ustar tseetseeuse strict; use warnings; package Class::XSAccessor::Test; use Class::XSAccessor::Array accessors => { bar => 0 }, getters => { get_foo => 1 }, setters => { set_foo => 1 }; sub new { my $class = shift; bless [ 'baz' ], $class; } package main; use Test::More tests => 12; my $obj = Class::XSAccessor::Test->new(); ok ($obj->can('bar')); is ($obj->set_foo('bar'), 'bar'); is ($obj->get_foo(), 'bar'); is ($obj->bar(), 'baz'); is ($obj->bar('quux'), 'quux'); is ($obj->bar(), 'quux'); package Class::XSAccessor::Test2; sub new { my $class = shift; bless [ 'baz' ], $class; } package main; use Class::XSAccessor::Array class => 'Class::XSAccessor::Test2', accessors => { bar => 0 }, getters => { get_foo => 1 }, setters => { set_foo => 1 }; my $obj2 = Class::XSAccessor::Test2->new(); ok ($obj2->can('bar')); is ($obj2->set_foo('bar'), 'bar'); is ($obj2->get_foo(), 'bar'); is ($obj2->bar(), 'baz'); is ($obj2->bar('quux'), 'quux'); is ($obj2->bar(), 'quux'); Class-XSAccessor-1.19/t/08hash_entersub.t0000644000175000017500000001200012234742565016643 0ustar tseetsee#!/usr/bin/env perl use strict; use warnings; use constant { EMPTY => [], OPTIMIZING => [ 'accessor: inside test', 'accessor: op_spare: 0', 'accessor: optimizing entersub', ], OPTIMIZED => [ 'entersub: inside optimized entersub', 'accessor: inside test', 'accessor: op_spare: 0', 'accessor: entersub has been optimized' ], # XXX not used: not sure we want to trigger this internal error DISABLING_NOT_DEFINED => [ 'entersub: inside optimized entersub', 'entersub: disabling optimization: SV is null' ], DISABLING_NOT_CV => [ 'entersub: inside optimized entersub', 'entersub: disabling optimization: SV is not a CV' ], DISABLING_NOT_SAME_ACCESSOR => [ 'entersub: inside optimized entersub', 'entersub: disabling optimization: SV is not test' ], DISABLED => [ 'accessor: inside test', 'accessor: op_spare: 1', 'accessor: entersub optimization has been disabled' ], }; use Class::XSAccessor { __tests__ => [ qw(foo bar) ], getters => [ 'quux' ], }; BEGIN { unless (Class::XSAccessor::__entersub_optimized__()) { print "1..0 # Skip entersub optimization not enabled", $/; exit; } } use Data::Dumper; use Test::More tests => 68; our @MESSAGES = (); sub is_debug ($) { my $want = shift; # report errors with the caller's line number local $Test::Builder::Level = $Test::Builder::Level + 1; my $got = [ splice @MESSAGES ]; unless (is_deeply($got, $want)) { local ($Data::Dumper::Terse, $Data::Dumper::Indent) = (1, 1); print STDERR $/, 'unmatched messages: ', Dumper($got), $/; } } local $SIG{__WARN__} = sub { my $warning = join '', @_; if ($warning =~ m{^cxah: (.+?) at \Q$0\E}) { push @MESSAGES, $1; } else { warn @_; # from perldoc -f warn: "__WARN__ hooks are not called from inside one" } }; sub baz { my $self = shift; @_ ? $self->{baz} = shift : $self->{baz}; } # XXX debugging note: change if/else branches to separate # statements to debug/troubleshoot, otherwise the error will appear # to come from the first line of the if/else statement i.e. change: # # 1: if ($_ == 1) { # 2: is_debug ... # 3: } else { # 4: is_debug ... # error # 5: } # # # error at line 1 # # to: # # 1: if ($_ == 1) { # 2: is_debug ... # 3: } # 4: # 5: if ($_ == 2) { # 6: is_debug ... # error # 7: } # # # error at line 5 my $SELF = bless { foo => 'Foo', bar => 'Bar', baz => 'Baz', quux => 'Quux' }; # standard: verify that the accessors work as expected for (1 .. 3) { is $SELF->foo, 'Foo'; is_debug ($_ == 1 ? OPTIMIZING : OPTIMIZED); is $SELF->bar, 'Bar'; is_debug ($_ == 1 ? OPTIMIZING : OPTIMIZED); is $SELF->baz, 'Baz'; is_debug EMPTY; } # changing the CV at a call site is OK (i.e. doesn't disable # the entersub optimization) if both CVs are the same type of # Class::XSAccessor accessor: foo (test) -> bar (test) for (1 .. 4) { my $name = [ qw(foo bar foo bar) ]->[$_ - 1]; is $SELF->$name, ucfirst($name); if ($_ == 1) { is_debug OPTIMIZING; } else { is_debug OPTIMIZED; } } # disable the entersub optimization (method 1): # change it to a different type of Class::XSAccessor accessor: # foo (test) -> quux (getter) for (1 .. 4) { my $name = [ qw(foo quux foo quux) ]->[$_ - 1]; is $SELF->$name, ucfirst($name); if ($_ == 1) { is_debug OPTIMIZING; } elsif ($_ == 2) { is_debug DISABLING_NOT_SAME_ACCESSOR; } elsif ($_ == 3) { is_debug DISABLED; } else { is_debug EMPTY; } } # disable the entersub optimization (method 2): # change it to a non-Class::XSAccessor CV: foo (test) -> baz for (1 .. 4) { my $name = [ qw(foo baz foo baz) ]->[$_ - 1]; is $SELF->$name, ucfirst($name); if ($_ == 1) { is_debug OPTIMIZING; } elsif ($_ == 2) { is_debug DISABLING_NOT_SAME_ACCESSOR; } elsif ($_ == 3) { is_debug DISABLED; } else { is_debug EMPTY; } } # if the SV passed to entersub is not a CV, disable the optimisation. # note: the invalid type is detected in the optimised entersub, # *not* in the accessor. for (1 .. 4) { # when entersub is called in this way, the SV is a GV # rather than a CV is foo($SELF), 'Foo'; if ($_ == 1) { # in the accessor (test) is_debug OPTIMIZING; } elsif ($_ == 2) { # the optimized entersub backs itself out # because the SV is a GV rather than a CV is_debug [ @{DISABLING_NOT_CV()}, @{DISABLED()} ]; } else { # in the accessor (test) is_debug DISABLED; } } # confirm we haven't pessimized other call sites for (1 .. 3) { is $SELF->foo, 'Foo'; is_debug ($_ == 1 ? OPTIMIZING : OPTIMIZED); is $SELF->bar, 'Bar'; is_debug ($_ == 1 ? OPTIMIZING : OPTIMIZED); is $SELF->baz, 'Baz'; is_debug EMPTY; } Class-XSAccessor-1.19/t/38array_use_hash.t0000644000175000017500000000320311437463533017015 0ustar tseetseeuse strict; use warnings; # This is a copy of 31array_basic.t with use Class::XSAccessor { ... } use Test::More tests => 26; BEGIN { use_ok('Class::XSAccessor::Array') }; package Foo; use Class::XSAccessor::Array { getters => { get_foo => 0, get_bar => 1, }, }; package main; BEGIN {pass();} package Foo; use Class::XSAccessor::Array { replace => 1, getters => { get_foo => 0, get_bar => 1, }, }; package main; BEGIN {pass();} ok( Foo->can('get_foo') ); ok( Foo->can('get_bar') ); my $foo = bless ['a','b'] => 'Foo'; ok($foo->get_foo() eq 'a'); ok($foo->get_bar() eq 'b'); package Foo; use Class::XSAccessor::Array { setters=> { set_foo => 0, set_bar => 1, }, }; package main; BEGIN{pass()} ok( Foo->can('set_foo') ); ok( Foo->can('set_bar') ); $foo->set_foo('1'); pass(); $foo->set_bar('2'); pass(); ok($foo->get_foo() eq '1'); ok($foo->get_bar() eq '2'); # Make sure scalars are copied and not stored by reference (RT 38573) my $x = 1; $foo->set_foo($x); $x++; is( $foo->get_foo(), 1, 'scalar copied properly' ); # test that multiple methods can point to the same attr. package Foo; use Class::XSAccessor::Array { getters => { get_FOO => 0, get_BAR => 10000, }, setters => { set_FOO => 0, }, }; package main; BEGIN{pass()} ok( Foo->can('get_foo') ); ok( Foo->can('get_bar') ); my $FOO = bless ['a', 'c'] => 'Foo'; $FOO->[10000] = 'wow'; ok( Foo->can('get_FOO') ); ok( Foo->can('set_FOO') ); ok($FOO->get_FOO() eq 'a'); ok($FOO->get_foo() eq 'a'); $FOO->set_FOO('b'); ok($FOO->get_FOO() eq 'b'); ok($FOO->get_foo() eq 'b'); ok($FOO->get_bar() eq 'c'); ok($FOO->get_BAR() eq 'wow'); Class-XSAccessor-1.19/t/37array_boolean.t0000644000175000017500000000053611437463533016642 0ustar tseetseeuse strict; use warnings; package Foo; use Class::XSAccessor::Array constructor => 'new', true => [qw(t r u e)], false => [qw(f a l s)]; package main; use Test::More tests => 10; ok (Foo->can('new')); my $obj = Foo->new(); can_ok($obj, qw(t r u e f a l s)); ok($obj->$_) for qw(t r u e); ok(not $obj->$_) for qw(f a l s); Class-XSAccessor-1.19/t/07hash_boolean.t0000644000175000017500000000052711437463533016444 0ustar tseetseeuse strict; use warnings; package Foo; use Class::XSAccessor constructor => 'new', true => [qw(t r u e)], false => [qw(f a l s)]; package main; use Test::More tests => 10; ok (Foo->can('new')); my $obj = Foo->new(); can_ok($obj, qw(t r u e f a l s)); ok($obj->$_) for qw(t r u e); ok(not $obj->$_) for qw(f a l s); Class-XSAccessor-1.19/META.json0000664000175000017500000000206712243573262014644 0ustar tseetsee{ "abstract" : "Generate fast XS accessors without runtime compilation", "author" : [ "Steffen Mueller " ], "dynamic_config" : 1, "generated_by" : "ExtUtils::MakeMaker version 6.64, CPAN::Meta::Converter version 2.120921", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "Class-XSAccessor", "no_index" : { "directory" : [ "t", "inc" ] }, "prereqs" : { "build" : { "requires" : { "Test::More" : "0" } }, "configure" : { "requires" : { "ExtUtils::MakeMaker" : "0" } }, "runtime" : { "requires" : { "Time::HiRes" : "0", "XSLoader" : "0", "perl" : "5.008" } } }, "release_status" : "stable", "resources" : { "repository" : { "url" : "git://github.com/tsee/Class-XSAccessor.git" } }, "version" : "1.19" } Class-XSAccessor-1.19/cxsa_locking.c0000644000175000017500000000046211671325442016025 0ustar tseetsee#include "cxsa_locking.h" #include "cxsa_memory.h" #ifdef USE_ITHREADS cxsa_global_lock CXSAccessor_lock; void _init_cxsa_lock(cxsa_global_lock* theLock) { cxa_memzero((void*)theLock, sizeof(cxsa_global_lock)); MUTEX_INIT(&theLock->mutex); COND_INIT(&theLock->cond); theLock->locks = 0; } #endif Class-XSAccessor-1.19/author_scripts/0000755000175000017500000000000012243573262016265 5ustar tseetseeClass-XSAccessor-1.19/author_scripts/refcount_constructor.pl0000644000175000017500000000123011442131657023106 0ustar tseetsee#!/usr/bin/env perl # confirm the refcounts/flags are correct for # objects returned by the XS constructor use Modern::Perl; use Devel::Peek; use blib; use Class::XSAccessor { constructor => 'hash_cxa', }; use Class::XSAccessor::Array { constructor => 'array_cxa', }; sub hash_normal { my $class = shift; bless { @_ }, ref($class) || $class; } sub array_normal { my $class = shift; bless [], ref($class) || $class; } { Dump(__PACKAGE__->hash_cxa(foo => 'bar')); warn $/; Dump(__PACKAGE__->hash_normal(foo => 'bar')); warn $/; Dump(__PACKAGE__->array_cxa()); warn $/; Dump(__PACKAGE__->array_normal()); } Class-XSAccessor-1.19/author_scripts/constructor_benchmark.pl0000644000175000017500000000537111442131657023225 0ustar tseetsee#!/usr/bin/env perl use strict; use warnings; printf STDOUT 'perl: %s, Class::XSAccessor: %s%s', $], Class::XSAccessor->VERSION, $/; package WithClassXSAccessor; use blib; use Class::XSAccessor { constructor => 'new', }; package WithStdClass; sub new { my $c = shift; bless {@_}, ref($c) || $c } package main; use Benchmark qw(cmpthese timethese :hireswallclock); my $count = shift || -4; print "Constructor benchmark:", $/; cmpthese(timethese($count, { class_xs_accessor => sub { my $obj; $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); }, std_class => sub { my $obj; $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); }, class_xs_accessor_args => sub { my $obj; $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); $obj = WithClassXSAccessor->new(foo => 'bar', baz => 'quux'); }, std_class_args => sub { my $obj; $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); $obj = WithStdClass->new(foo => 'bar', baz => 'quux'); }, })); Class-XSAccessor-1.19/author_scripts/benchmark.pl0000644000175000017500000001616012127503205020547 0ustar tseetsee#!/usr/bin/env perl use strict; use warnings; printf STDOUT 'perl: %s, Class::XSAccessor: %s%s', $], Class::XSAccessor->VERSION, $/; package WithClassXSAccessor; use blib; use Class::XSAccessor constructor => 'new', accessors => { myattr => 'myattr' }, getters => { get_myattr => 'myattr' }, setters => { set_myattr => 'myattr' }, lvalue_accessors => { lv_myattr => 'myattr' }, ; package WithStdClass; sub new { my $c = shift; bless {@_}, ref($c) || $c } sub myattr { my $self = shift; if (@_) { return $self->{myattr} = shift; } else { return $self->{myattr}; } } package WithStdClassFast; sub new { my $c = shift; bless {@_}, ref($c) || $c } sub myattr { (@_ > 1) ? $_[0]->{myattr} = $_[1] : $_[0]->{myattr} } package main; use Benchmark qw(cmpthese timethese :hireswallclock); # use Benchmark qw(cmpthese timethese); my $class_xs_accessor = WithClassXSAccessor->new; my $std_class = WithStdClass->new; my $std_class_fast = WithStdClassFast->new; my $direct_hash = {}; my $count = shift || -2; $direct_hash->{myattr} = 42; $class_xs_accessor->myattr(42); $std_class->myattr(42); $std_class_fast->myattr(42); =for comment direct_hash => sub { $direct_hash->{myattr} = $direct_hash->{myattr}; $direct_hash->{myattr} = $direct_hash->{myattr}; $direct_hash->{myattr} = $direct_hash->{myattr}; $direct_hash->{myattr} = $direct_hash->{myattr}; $direct_hash->{myattr} = $direct_hash->{myattr}; $direct_hash->{myattr} = $direct_hash->{myattr}; $direct_hash->{myattr} = $direct_hash->{myattr}; $direct_hash->{myattr} = $direct_hash->{myattr}; $direct_hash->{myattr} = $direct_hash->{myattr}; $direct_hash->{myattr} = $direct_hash->{myattr}; die unless ($direct_hash->{myattr} == 42); }, =cut cmpthese(timethese($count, { class_xs_accessor_getset => sub { $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); $class_xs_accessor->set_myattr($class_xs_accessor->get_myattr); die unless ($class_xs_accessor->myattr == 42); }, class_xs_accessor => sub { $class_xs_accessor->myattr($class_xs_accessor->myattr); $class_xs_accessor->myattr($class_xs_accessor->myattr); $class_xs_accessor->myattr($class_xs_accessor->myattr); $class_xs_accessor->myattr($class_xs_accessor->myattr); $class_xs_accessor->myattr($class_xs_accessor->myattr); $class_xs_accessor->myattr($class_xs_accessor->myattr); $class_xs_accessor->myattr($class_xs_accessor->myattr); $class_xs_accessor->myattr($class_xs_accessor->myattr); $class_xs_accessor->myattr($class_xs_accessor->myattr); $class_xs_accessor->myattr($class_xs_accessor->myattr); die unless ($class_xs_accessor->myattr == 42); }, std_class => sub { $std_class->myattr($std_class->myattr); $std_class->myattr($std_class->myattr); $std_class->myattr($std_class->myattr); $std_class->myattr($std_class->myattr); $std_class->myattr($std_class->myattr); $std_class->myattr($std_class->myattr); $std_class->myattr($std_class->myattr); $std_class->myattr($std_class->myattr); $std_class->myattr($std_class->myattr); $std_class->myattr($std_class->myattr); die unless ($std_class->myattr == 42); }, std_class_fast => sub { $std_class_fast->myattr($std_class_fast->myattr); $std_class_fast->myattr($std_class_fast->myattr); $std_class_fast->myattr($std_class_fast->myattr); $std_class_fast->myattr($std_class_fast->myattr); $std_class_fast->myattr($std_class_fast->myattr); $std_class_fast->myattr($std_class_fast->myattr); $std_class_fast->myattr($std_class_fast->myattr); $std_class_fast->myattr($std_class_fast->myattr); $std_class_fast->myattr($std_class_fast->myattr); $std_class_fast->myattr($std_class_fast->myattr); die unless ($std_class_fast->myattr == 42); }, class_xs_accessor_lvalue => sub { $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->myattr; die unless ($class_xs_accessor->myattr == 42); }, class_xs_accessor_lvalue_double => sub { $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; $class_xs_accessor->lv_myattr = $class_xs_accessor->lv_myattr; die unless ($class_xs_accessor->myattr == 42); }, })); print "Constructor benchmark:\n"; cmpthese(timethese($count, { class_xs_accessor => sub { my $obj; $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); $obj = WithClassXSAccessor->new(); }, std_class => sub { my $obj; $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); $obj = WithStdClass->new(); }, })); Class-XSAccessor-1.19/XS/0000755000175000017500000000000012243573262013546 5ustar tseetseeClass-XSAccessor-1.19/XS/Hash.xs0000644000175000017500000002261612234742565015020 0ustar tseetsee#include "ppport.h" ## we want hv_fetch but with the U32 hash argument of hv_fetch_ent, so do it ourselves... #ifdef hv_common_key_len # define CXSA_HASH_FETCH(hv, key, len, hash) \ hv_common_key_len((hv), (key), (len), HV_FETCH_JUST_SV, NULL, (hash)) # define CXSA_HASH_FETCH_LVALUE(hv, key, len, hash) \ hv_common_key_len((hv), (key), (len), (HV_FETCH_JUST_SV|HV_FETCH_LVALUE), NULL, (hash)) # define CXSA_HASH_EXISTS(hv, key, len, hash) \ hv_common_key_len((hv), (key), (len), HV_FETCH_ISEXISTS, NULL, (hash)) #else # define CXSA_HASH_FETCH(hv, key, len, hash) hv_fetch((hv), (key), (len), 0) # define CXSA_HASH_FETCH_LVALUE(hv, key, len, hash) hv_fetch((hv), (key), (len), 1) # define CXSA_HASH_EXISTS(hv, key, len, hash) hv_exists((hv), (key), (len)) #endif #ifndef croak_xs_usage #define croak_xs_usage(cv,msg) croak(aTHX_ "Usage: %s(%s)", GvNAME(CvGV(cv)), msg) #endif MODULE = Class::XSAccessor PACKAGE = Class::XSAccessor PROTOTYPES: DISABLE void getter(self) SV* self; INIT: /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; SV** svp; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(getter); if ((svp = CXSA_HASH_FETCH((HV *)SvRV(self), readfrom->key, readfrom->len, readfrom->hash))) PUSHs(*svp); else XSRETURN_UNDEF; void lvalue_accessor(self) SV* self; INIT: /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; SV** svp; SV* sv; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(lvalue_accessor); if ((svp = CXSA_HASH_FETCH_LVALUE((HV *)SvRV(self), readfrom->key, readfrom->len, readfrom->hash))) { sv = *svp; sv_upgrade(sv, SVt_PVLV); sv_magic(sv, 0, PERL_MAGIC_ext, Nullch, 0); SvSMAGICAL_on(sv); LvTYPE(sv) = '~'; SvREFCNT_inc(sv); LvTARG(sv) = SvREFCNT_inc(sv); SvMAGIC(sv)->mg_virtual = &cxsa_lvalue_acc_magic_vtable; ST(0) = sv; XSRETURN(1); } else XSRETURN_UNDEF; void setter(self, newvalue) SV* self; SV* newvalue; INIT: /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(setter); if (NULL == hv_store((HV*)SvRV(self), readfrom->key, readfrom->len, newSVsv(newvalue), readfrom->hash)) croak("Failed to write new value to hash."); PUSHs(newvalue); void chained_setter(self, newvalue) SV* self; SV* newvalue; INIT: /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(chained_setter); if (NULL == hv_store((HV*)SvRV(self), readfrom->key, readfrom->len, newSVsv(newvalue), readfrom->hash)) croak("Failed to write new value to hash."); PUSHs(self); void accessor(self, ...) SV* self; INIT: /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; SV** svp; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(accessor); if (items > 1) { SV* newvalue = ST(1); if (NULL == hv_store((HV*)SvRV(self), readfrom->key, readfrom->len, newSVsv(newvalue), readfrom->hash)) croak("Failed to write new value to hash."); PUSHs(newvalue); } else { if ((svp = CXSA_HASH_FETCH((HV *)SvRV(self), readfrom->key, readfrom->len, readfrom->hash))) PUSHs(*svp); else XSRETURN_UNDEF; } void chained_accessor(self, ...) SV* self; INIT: /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; SV** svp; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(chained_accessor); if (items > 1) { SV* newvalue = ST(1); if (NULL == hv_store((HV*)SvRV(self), readfrom->key, readfrom->len, newSVsv(newvalue), readfrom->hash)) croak("Failed to write new value to hash."); PUSHs(self); } else { if ((svp = CXSA_HASH_FETCH((HV *)SvRV(self), readfrom->key, readfrom->len, readfrom->hash))) PUSHs(*svp); else XSRETURN_UNDEF; } void exists_predicate(self) SV* self; INIT: /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(exists_predicate); if ( CXSA_HASH_EXISTS((HV *)SvRV(self), readfrom->key, readfrom->len, readfrom->hash) != NULL ) XSRETURN_YES; else XSRETURN_NO; void defined_predicate(self) SV* self; INIT: /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; SV** svp; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(defined_predicate); if ( ((svp = CXSA_HASH_FETCH((HV *)SvRV(self), readfrom->key, readfrom->len, readfrom->hash))) && SvOK(*svp) ) XSRETURN_YES; else XSRETURN_NO; void constructor(class, ...) SV* class; PREINIT: int iStack; HV* hash; SV* obj; const char* classname; PPCODE: CXAH_OPTIMIZE_ENTERSUB(constructor); classname = SvROK(class) ? sv_reftype(SvRV(class), 1) : SvPV_nolen_const(class); hash = newHV(); obj = sv_bless(newRV_noinc((SV *)hash), gv_stashpv(classname, 1)); if (items > 1) { /* if @_ - 1 (for $class) is even: most compilers probably convert items % 2 into this, but just in case */ if (items & 1) { for (iStack = 1; iStack < items; iStack += 2) { /* we could check for the hv_store_ent return value, but perl doesn't in this situation (see pp_anonhash) */ (void)hv_store_ent(hash, ST(iStack), newSVsv(ST(iStack+1)), 0); } } else { croak("Uneven number of arguments to constructor."); } } PUSHs(sv_2mortal(obj)); void constant_false(self) SV *self; PPCODE: PERL_UNUSED_VAR(self); CXAH_OPTIMIZE_ENTERSUB(constant_false); { XSRETURN_NO; } void constant_true(self) SV* self; PPCODE: PERL_UNUSED_VAR(self); CXAH_OPTIMIZE_ENTERSUB(constant_true); { XSRETURN_YES; } void test(self, ...) SV* self; INIT: /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; SV** svp; PPCODE: CXA_CHECK_HASH(self); warn("cxah: accessor: inside test"); CXAH_OPTIMIZE_ENTERSUB_TEST(test); if (items > 1) { SV* newvalue = ST(1); if (NULL == hv_store((HV*)SvRV(self), readfrom->key, readfrom->len, newSVsv(newvalue), readfrom->hash)) croak("Failed to write new value to hash."); PUSHs(newvalue); } else { if ((svp = CXSA_HASH_FETCH((HV *)SvRV(self), readfrom->key, readfrom->len, readfrom->hash))) PUSHs(*svp); else XSRETURN_UNDEF; } void newxs_getter(namesv, keysv) SV *namesv; SV *keysv; ALIAS: Class::XSAccessor::newxs_lvalue_accessor = 1 Class::XSAccessor::newxs_predicate = 2 Class::XSAccessor::newxs_defined_predicate = 3 Class::XSAccessor::newxs_exists_predicate = 4 PREINIT: char *name; char *key; STRLEN namelen, keylen; PPCODE: name = SvPV(namesv, namelen); key = SvPV(keysv, keylen); switch (ix) { case 0: /* newxs_getter */ INSTALL_NEW_CV_HASH_OBJ(name, CXAH(getter), key, keylen); break; case 1: { /* newxs_lvalue_accessor */ CV* cv; INSTALL_NEW_CV_HASH_OBJ(name, CXAH(lvalue_accessor), key, keylen); /* Make the CV lvalue-able. "cv" was set by the previous macro */ CvLVALUE_on(cv); } break; case 2: case 3: INSTALL_NEW_CV_HASH_OBJ(name, CXAH(defined_predicate), key, keylen); break; case 4: INSTALL_NEW_CV_HASH_OBJ(name, CXAH(exists_predicate), key, keylen); break; default: croak("Invalid alias of newxs_getter called"); break; } void newxs_setter(namesv, keysv, chained) SV *namesv; SV *keysv; bool chained; ALIAS: Class::XSAccessor::newxs_accessor = 1 PREINIT: char *name; char *key; STRLEN namelen, keylen; PPCODE: name = SvPV(namesv, namelen); key = SvPV(keysv, keylen); if (ix == 0) { /* newxs_setter */ if (chained) INSTALL_NEW_CV_HASH_OBJ(name, CXAH(chained_setter), key, keylen); else INSTALL_NEW_CV_HASH_OBJ(name, CXAH(setter), key, keylen); } else { /* newxs_accessor */ if (chained) INSTALL_NEW_CV_HASH_OBJ(name, CXAH(chained_accessor), key, keylen); else INSTALL_NEW_CV_HASH_OBJ(name, CXAH(accessor), key, keylen); } void newxs_constructor(namesv) SV *namesv; PREINIT: char *name; STRLEN namelen; PPCODE: name = SvPV(namesv, namelen); INSTALL_NEW_CV(name, CXAH(constructor)); void newxs_boolean(namesv, truth) SV *namesv; bool truth; PREINIT: char *name; STRLEN namelen; PPCODE: name = SvPV(namesv, namelen); if (truth) INSTALL_NEW_CV(name, CXAH(constant_true)); else INSTALL_NEW_CV(name, CXAH(constant_false)); void newxs_test(namesv, keysv) SV *namesv; SV *keysv; PREINIT: char *name; char *key; STRLEN namelen, keylen; PPCODE: name = SvPV(namesv, namelen); key = SvPV(keysv, keylen); INSTALL_NEW_CV_HASH_OBJ(name, CXAH(test), key, keylen); Class-XSAccessor-1.19/XS/Array.xs0000644000175000017500000001527412234742565015215 0ustar tseetsee#define NEED_sv_2pv_flags_GLOBAL #include "ppport.h" MODULE = Class::XSAccessor PACKAGE = Class::XSAccessor::Array PROTOTYPES: DISABLE void getter(self) SV* self; ALIAS: INIT: /* Get the array index from the global storage */ /* ix is the magic integer variable that is set by the perl guts for us. * We uses it to identify the currently running alias of the accessor. Gollum! */ const I32 index = CXSAccessor_arrayindices[ix]; SV** svp; PPCODE: CXA_CHECK_ARRAY(self); CXAA_OPTIMIZE_ENTERSUB(getter); if ((svp = av_fetch((AV *)SvRV(self), index, 1))) PUSHs(svp[0]); else XSRETURN_UNDEF; void lvalue_accessor(self) SV* self; ALIAS: INIT: /* Get the array index from the global storage */ /* ix is the magic integer variable that is set by the perl guts for us. * We uses it to identify the currently running alias of the accessor. Gollum! */ const I32 index = CXSAccessor_arrayindices[ix]; SV** svp; SV* sv; PPCODE: CXA_CHECK_ARRAY(self); CXAA_OPTIMIZE_ENTERSUB(lvalue_accessor); if ((svp = av_fetch((AV *)SvRV(self), index, 1))) { sv = *svp; sv_upgrade(sv, SVt_PVLV); sv_magic(sv, 0, PERL_MAGIC_ext, Nullch, 0); SvSMAGICAL_on(sv); LvTYPE(sv) = '~'; SvREFCNT_inc(sv); LvTARG(sv) = SvREFCNT_inc(sv); SvMAGIC(sv)->mg_virtual = &cxsa_lvalue_acc_magic_vtable; ST(0) = sv; XSRETURN(1); } else XSRETURN_UNDEF; void setter(self, newvalue) SV* self; SV* newvalue; ALIAS: INIT: /* Get the array index from the global storage */ /* ix is the magic integer variable that is set by the perl guts for us. * We uses it to identify the currently running alias of the accessor. Gollum! */ const I32 index = CXSAccessor_arrayindices[ix]; PPCODE: CXA_CHECK_ARRAY(self); CXAA_OPTIMIZE_ENTERSUB(setter); if (NULL == av_store((AV*)SvRV(self), index, newSVsv(newvalue))) croak("Failed to write new value to array."); PUSHs(newvalue); void chained_setter(self, newvalue) SV* self; SV* newvalue; ALIAS: INIT: /* Get the array index from the global storage */ /* ix is the magic integer variable that is set by the perl guts for us. * We uses it to identify the currently running alias of the accessor. Gollum! */ const I32 index = CXSAccessor_arrayindices[ix]; PPCODE: CXA_CHECK_ARRAY(self); CXAA_OPTIMIZE_ENTERSUB(chained_setter); if (NULL == av_store((AV*)SvRV(self), index, newSVsv(newvalue))) croak("Failed to write new value to array."); PUSHs(self); void accessor(self, ...) SV* self; ALIAS: INIT: /* Get the array index from the global storage */ /* ix is the magic integer variable that is set by the perl guts for us. * We uses it to identify the currently running alias of the accessor. Gollum! */ const I32 index = CXSAccessor_arrayindices[ix]; SV** svp; PPCODE: CXA_CHECK_ARRAY(self); CXAA_OPTIMIZE_ENTERSUB(accessor); if (items > 1) { SV* newvalue = ST(1); if (NULL == av_store((AV*)SvRV(self), index, newSVsv(newvalue))) croak("Failed to write new value to array."); PUSHs(newvalue); } else { if ((svp = av_fetch((AV *)SvRV(self), index, 1))) PUSHs(svp[0]); else XSRETURN_UNDEF; } void chained_accessor(self, ...) SV* self; ALIAS: INIT: /* Get the array index from the global storage */ /* ix is the magic integer variable that is set by the perl guts for us. * We uses it to identify the currently running alias of the accessor. Gollum! */ const I32 index = CXSAccessor_arrayindices[ix]; SV** svp; PPCODE: CXA_CHECK_ARRAY(self); CXAA_OPTIMIZE_ENTERSUB(chained_accessor); if (items > 1) { SV* newvalue = ST(1); if (NULL == av_store((AV*)SvRV(self), index, newSVsv(newvalue))) croak("Failed to write new value to array."); PUSHs(self); } else { if ((svp = av_fetch((AV *)SvRV(self), index, 1))) PUSHs(svp[0]); else XSRETURN_UNDEF; } void predicate(self) SV* self; ALIAS: INIT: /* Get the array index from the global storage */ /* ix is the magic integer variable that is set by the perl guts for us. * We uses it to identify the currently running alias of the accessor. Gollum! */ const I32 index = CXSAccessor_arrayindices[ix]; SV** svp; PPCODE: CXA_CHECK_ARRAY(self); CXAA_OPTIMIZE_ENTERSUB(predicate); if ( (svp = av_fetch((AV *)SvRV(self), index, 1)) && SvOK(svp[0]) ) XSRETURN_YES; else XSRETURN_NO; void constructor(class, ...) SV* class; PREINIT: AV* array; SV* obj; const char* classname; PPCODE: CXAA_OPTIMIZE_ENTERSUB(constructor); classname = SvROK(class) ? sv_reftype(SvRV(class), 1) : SvPV_nolen_const(class); array = newAV(); obj = sv_bless( newRV_noinc((SV*)array), gv_stashpv(classname, 1) ); /* we ignore arguments. See Class::XSAccessor's XS code for * how we'd use them in case of bless {@_} => $class. */ PUSHs(sv_2mortal(obj)); void newxs_getter(namesv, index) SV *namesv; U32 index; ALIAS: Class::XSAccessor::Array::newxs_lvalue_accessor = 1 Class::XSAccessor::Array::newxs_predicate = 2 PREINIT: char *name; STRLEN namelen; PPCODE: name = SvPV(namesv, namelen); switch (ix) { case 0: /* newxs_getter */ INSTALL_NEW_CV_ARRAY_OBJ(name, CXAA(getter), index); break; case 1: /* newxs_lvalue_accessor */ { CV* cv; INSTALL_NEW_CV_ARRAY_OBJ(name, CXAA(lvalue_accessor), index); /* Make the CV lvalue-able. "cv" was set by the previous macro */ CvLVALUE_on(cv); break; } case 2: /* newxs_predicate */ INSTALL_NEW_CV_ARRAY_OBJ(name, CXAA(predicate), index); break; default: croak("Invalid alias of newxs_getter called"); break; } void newxs_setter(namesv, index, chained) SV *namesv; U32 index; bool chained; ALIAS: Class::XSAccessor::Array::newxs_accessor = 1 PREINIT: char *name; STRLEN namelen; PPCODE: name = SvPV(namesv, namelen); if (ix == 0) { /* newxs_setter */ if (chained) INSTALL_NEW_CV_ARRAY_OBJ(name, CXAA(chained_setter), index); else INSTALL_NEW_CV_ARRAY_OBJ(name, CXAA(setter), index); } else { /* newxs_accessor */ if (chained) INSTALL_NEW_CV_ARRAY_OBJ(name, CXAA(chained_accessor), index); else INSTALL_NEW_CV_ARRAY_OBJ(name, CXAA(accessor), index); } void newxs_constructor(namesv) SV *namesv; PREINIT: char *name; STRLEN namelen; PPCODE: name = SvPV(namesv, namelen); INSTALL_NEW_CV(name, CXAA(constructor)); Class-XSAccessor-1.19/XS/HashCACompat.xs0000644000175000017500000001441012157631360016353 0ustar tseetsee#include "ppport.h" ## we want hv_fetch but with the U32 hash argument of hv_fetch_ent, so do it ourselves... #ifdef hv_common_key_len #define CXSA_HASH_FETCH(hv, key, len, hash) hv_common_key_len((hv), (key), (len), HV_FETCH_JUST_SV, NULL, (hash)) #else #define CXSA_HASH_FETCH(hv, key, len, hash) hv_fetch(hv, key, len, 0) #endif #ifndef croak_xs_usage #define croak_xs_usage(cv,msg) croak(aTHX_ "Usage: %s(%s)", GvNAME(CvGV(cv)), msg) #endif MODULE = Class::XSAccessor PACKAGE = Class::XSAccessor PROTOTYPES: DISABLE void array_setter_init(self, ...) SV* self; INIT: /* NOTE: This method is for Class::Accessor compatibility only. It's not * part of the normal API! */ SV* newvalue = NULL; /* squelch may-be-used-uninitialized warning that doesn't apply */ SV ** hashAssignRes; /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(array_setter); if (items == 2) { newvalue = newSVsv(ST(1)); } else if (items > 2) { I32 i; AV* tmp = newAV(); av_extend(tmp, items-1); for (i = 1; i < items; ++i) { newvalue = newSVsv(ST(i)); if (!av_store(tmp, i-1, newvalue)) { SvREFCNT_dec(newvalue); croak("Failure to store value in array"); } } newvalue = newRV_noinc((SV*) tmp); } else { croak_xs_usage(cv, "self, newvalue(s)"); } if ((hashAssignRes = hv_store((HV*)SvRV(self), readfrom->key, readfrom->len, newvalue, readfrom->hash))) { PUSHs(*hashAssignRes); } else { SvREFCNT_dec(newvalue); croak("Failed to write new value to hash."); } void array_setter(self, ...) SV* self; INIT: /* NOTE: This method is for Class::Accessor compatibility only. It's not * part of the normal API! */ SV* newvalue = NULL; /* squelch may-be-used-uninitialized warning that doesn't apply */ SV ** hashAssignRes; /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; PPCODE: CXA_CHECK_HASH(self); if (items == 2) { newvalue = newSVsv(ST(1)); } else if (items > 2) { I32 i; AV* tmp = newAV(); av_extend(tmp, items-1); for (i = 1; i < items; ++i) { newvalue = newSVsv(ST(i)); if (!av_store(tmp, i-1, newvalue)) { SvREFCNT_dec(newvalue); croak("Failure to store value in array"); } } newvalue = newRV_noinc((SV*) tmp); } else { croak_xs_usage(cv, "self, newvalue(s)"); } if ((hashAssignRes = hv_store((HV*)SvRV(self), readfrom->key, readfrom->len, newvalue, readfrom->hash))) { PUSHs(*hashAssignRes); } else { SvREFCNT_dec(newvalue); croak("Failed to write new value to hash."); } void array_accessor_init(self, ...) SV* self; INIT: /* NOTE: This method is for Class::Accessor compatibility only. It's not * part of the normal API! */ SV ** hashAssignRes; /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; PPCODE: CXA_CHECK_HASH(self); CXAH_OPTIMIZE_ENTERSUB(array_accessor); if (items == 1) { SV** svp; if ((svp = CXSA_HASH_FETCH((HV *)SvRV(self), readfrom->key, readfrom->len, readfrom->hash))) PUSHs(*svp); else XSRETURN_UNDEF; } else { /* writing branch */ SV* newvalue; if (items == 2) { newvalue = newSVsv(ST(1)); } else { /* items > 2 */ I32 i; AV* tmp = newAV(); av_extend(tmp, items-1); for (i = 1; i < items; ++i) { newvalue = newSVsv(ST(i)); if (!av_store(tmp, i-1, newvalue)) { SvREFCNT_dec(newvalue); croak("Failure to store value in array"); } } newvalue = newRV_noinc((SV*) tmp); } if ((hashAssignRes = hv_store((HV*)SvRV(self), readfrom->key, readfrom->len, newvalue, readfrom->hash))) { PUSHs(*hashAssignRes); } else { SvREFCNT_dec(newvalue); croak("Failed to write new value to hash."); } } /* end writing branch */ void array_accessor(self, ...) SV* self; INIT: /* NOTE: This method is for Class::Accessor compatibility only. It's not * part of the normal API! */ SV ** hashAssignRes; /* Get the const hash key struct from the global storage */ const autoxs_hashkey * readfrom = CXAH_GET_HASHKEY; PPCODE: CXA_CHECK_HASH(self); if (items == 1) { SV** svp; if ((svp = CXSA_HASH_FETCH((HV *)SvRV(self), readfrom->key, readfrom->len, readfrom->hash))) PUSHs(*svp); else XSRETURN_UNDEF; } else { /* writing branch */ SV* newvalue; if (items == 2) { newvalue = newSVsv(ST(1)); } else { /* items > 2 */ I32 i; AV* tmp = newAV(); av_extend(tmp, items-1); for (i = 1; i < items; ++i) { newvalue = newSVsv(ST(i)); if (!av_store(tmp, i-1, newvalue)) { SvREFCNT_dec(newvalue); croak("Failure to store value in array"); } } newvalue = newRV_noinc((SV*) tmp); } if ((hashAssignRes = hv_store((HV*)SvRV(self), readfrom->key, readfrom->len, newvalue, readfrom->hash))) { PUSHs(*hashAssignRes); } else { SvREFCNT_dec(newvalue); croak("Failed to write new value to hash."); } } /* end writing branch */ void _newxs_compat_setter(namesv, keysv) SV *namesv; SV *keysv; PREINIT: char *name; char *key; STRLEN namelen, keylen; PPCODE: name = SvPV(namesv, namelen); key = SvPV(keysv, keylen); /* WARNING: If this is called in your code, you're doing it WRONG! */ INSTALL_NEW_CV_HASH_OBJ(name, CXAH(array_setter_init), key, keylen); void _newxs_compat_accessor(namesv, keysv) SV *namesv; SV *keysv; PREINIT: char *name; char *key; STRLEN namelen, keylen; PPCODE: name = SvPV(namesv, namelen); key = SvPV(keysv, keylen); /* WARNING: If this is called in your code, you're doing it WRONG! */ INSTALL_NEW_CV_HASH_OBJ(name, CXAH(array_accessor_init), key, keylen); Class-XSAccessor-1.19/cxsa_main.c0000644000175000017500000000655611667426554015350 0ustar tseetsee#include "cxsa_main.h" #include "cxsa_locking.h" /************************* * initialization section ************************/ autoxs_hashkey * CXSAccessor_last_hashkey = NULL; autoxs_hashkey * CXSAccessor_hashkeys = NULL; HashTable* CXSAccessor_reverse_hashkeys = NULL; /* TODO the array index storage is still thought to not be 100% * thread-safe during re-allocation and concurrent access by an * implementation XSUB. Requires the same linked-list dance as the * hash case. */ U32 CXSAccessor_no_arrayindices = 0; U32 CXSAccessor_free_arrayindices_no = 0; I32* CXSAccessor_arrayindices = NULL; U32 CXSAccessor_reverse_arrayindices_length = 0; I32* CXSAccessor_reverse_arrayindices = NULL; /************************* * implementation section *************************/ /* implement hash containers */ STATIC autoxs_hashkey * _new_hashkey() { autoxs_hashkey * retval; retval = (autoxs_hashkey *) cxa_malloc( sizeof(autoxs_hashkey) ); retval->next = NULL; if (CXSAccessor_last_hashkey != NULL) { /* apend to list */ CXSAccessor_last_hashkey->next = retval; } else { /* init */ CXSAccessor_hashkeys = retval; } CXSAccessor_last_hashkey = retval; return retval; } autoxs_hashkey * get_hashkey(pTHX_ const char* key, const I32 len) { autoxs_hashkey * hashkey; CXSA_ACQUIRE_GLOBAL_LOCK(CXSAccessor_lock); /* init */ if (CXSAccessor_reverse_hashkeys == NULL) CXSAccessor_reverse_hashkeys = CXSA_HashTable_new(16, 0.9); hashkey = (autoxs_hashkey *) CXSA_HashTable_fetch(CXSAccessor_reverse_hashkeys, key, (STRLEN)len); if (hashkey == NULL) { /* does not exist */ hashkey = _new_hashkey(); /* store the new hash key in the reverse lookup table */ CXSA_HashTable_store(CXSAccessor_reverse_hashkeys, key, len, hashkey); } CXSA_RELEASE_GLOBAL_LOCK(CXSAccessor_lock); return hashkey; } /* implement array containers */ STATIC void _resize_array(I32** array, U32* len, U32 newlen) { *array = (I32*)cxa_realloc((void*)(*array), newlen*sizeof(I32)); *len = newlen; } STATIC void _resize_array_init(I32** array, U32* len, U32 newlen, I32 init) { U32 i; *array = (I32*)cxa_realloc((void*)(*array), newlen*sizeof(I32)); for (i = *len; i < newlen; ++i) (*array)[i] = init; *len = newlen; } /* this is private, call get_internal_array_index instead */ I32 _new_internal_arrayindex() { if (CXSAccessor_no_arrayindices == CXSAccessor_free_arrayindices_no) { U32 extend = 2 + CXSAccessor_no_arrayindices * 2; /*printf("extending array index storage by %u\n", extend);*/ _resize_array(&CXSAccessor_arrayindices, &CXSAccessor_no_arrayindices, extend); } return CXSAccessor_free_arrayindices_no++; } I32 get_internal_array_index(I32 object_ary_idx) { I32 new_index; CXSA_ACQUIRE_GLOBAL_LOCK(CXSAccessor_lock); if (CXSAccessor_reverse_arrayindices_length <= (U32)object_ary_idx) _resize_array_init( &CXSAccessor_reverse_arrayindices, &CXSAccessor_reverse_arrayindices_length, object_ary_idx+1, -1 ); /* -1 == "undef" */ if (CXSAccessor_reverse_arrayindices[object_ary_idx] > -1) { CXSA_RELEASE_GLOBAL_LOCK(CXSAccessor_lock); return CXSAccessor_reverse_arrayindices[object_ary_idx]; } new_index = _new_internal_arrayindex(); CXSAccessor_reverse_arrayindices[object_ary_idx] = new_index; CXSA_RELEASE_GLOBAL_LOCK(CXSAccessor_lock); return new_index; } Class-XSAccessor-1.19/cxsa_memory.h0000644000175000017500000000175511667403706015727 0ustar tseetsee#ifndef _cxsa_memory_h_ #define _cxsa_memory_h_ #include "EXTERN.h" /* for the STRLEN typedef, for better or for worse */ #include "perl.h" void* _cxa_realloc(void *ptr, STRLEN size); void* _cxa_malloc(STRLEN size); void* _cxa_zmalloc(STRLEN size); void _cxa_free(void *ptr); void* _cxa_memcpy(void *dest, void *src, STRLEN size); void* _cxa_memzero(void *ptr, STRLEN size); /* these macros are really what you should be calling: */ #define cxa_free(ptr) _cxa_free(ptr) #define cxa_realloc(ptr, size) _cxa_realloc(ptr, size) #define cxa_malloc(size) _cxa_malloc(size) #define cxa_zmalloc(size) _cxa_zmalloc(size) #define cxa_memcpy(dest, src, size) _cxa_memcpy(dest, src, size) #define cxa_memzero(ptr, size) _cxa_memzero(ptr, size) /* TODO: A function call on every memory operation seems expensive. * Right now, it's not so bad and benchmarks show no harm done. * The hit should really only matter during global destruction and * BEGIN{} when accessors are set up. */ #endif Class-XSAccessor-1.19/cxsa_memory.c0000644000175000017500000000070611667403706015715 0ustar tseetsee #include "cxsa_memory.h" void* _cxa_realloc(void *ptr, STRLEN size) { return realloc(ptr, size); } void* _cxa_malloc(STRLEN size) { return malloc(size); } void* _cxa_zmalloc(STRLEN size) { return calloc(1, size); } void _cxa_free(void *ptr) { free(ptr); } void* _cxa_memcpy(void *dest, void *src, STRLEN size) { return memcpy(dest, src, size); } void* _cxa_memzero(void *ptr, STRLEN size) { return memset(ptr, 0, size); } Class-XSAccessor-1.19/MurmurHashNeutral2.h0000644000175000017500000000205511437463533017102 0ustar tseetsee/*----------------------------------------------------------------------------- * MurmurHashNeutral2, by Austin Appleby * * Same as MurmurHash2, but endian- and alignment-neutral. * Half the speed though, alas. */ /* Code released into the public domain. */ /* C-ification and adaption to perl.h by Steffen Mueller 2009-11-03 */ #include "perl.h" #ifndef _MurmurHashNeutral2_h_ #define _MurmurHashNeutral2_h_ U32 CXSA_MurmurHashNeutral2(const void* key, STRLEN len, U32 _seed) { const unsigned int m = 0x5bd1e995; const int r = 24; unsigned int h = _seed ^ len; const unsigned char* data = (const unsigned char*)key; while(len >= 4) { unsigned int k; k = data[0]; k |= data[1] << 8; k |= data[2] << 16; k |= data[3] << 24; k *= m; k ^= k >> r; k *= m; h *= m; h ^= k; data += 4; len -= 4; } switch(len) { case 3: h ^= data[2] << 16; case 2: h ^= data[1] << 8; case 1: h ^= data[0]; h *= m; }; h ^= h >> 13; h *= m; h ^= h >> 15; return (U32)h; } #endif Class-XSAccessor-1.19/cxsa_locking.h0000644000175000017500000000230511667403706016035 0ustar tseetsee#ifndef cxsa_locking_h_ #define cxsa_locking_h_ #include "EXTERN.h" #include "perl.h" #include "ppport.h" /* If we're not using threads, provide no-op macros */ #ifndef USE_ITHREADS # define CXSA_RELEASE_GLOBAL_LOCK(theLock) # define CXSA_ACQUIRE_GLOBAL_LOCK(theLock) #endif #ifdef USE_ITHREADS typedef struct { perl_mutex mutex; perl_cond cond; unsigned int locks; } cxsa_global_lock; extern cxsa_global_lock CXSAccessor_lock; void _init_cxsa_lock(cxsa_global_lock* theLock); #define CXSA_ACQUIRE_GLOBAL_LOCK(theLock) \ STMT_START { \ MUTEX_LOCK(&theLock.mutex); \ while (theLock.locks != 0) { \ COND_WAIT(&theLock.cond, &theLock.mutex); \ } \ theLock.locks = 1; \ MUTEX_UNLOCK(&theLock.mutex); \ } STMT_END #define CXSA_RELEASE_GLOBAL_LOCK(theLock) \ STMT_START { \ MUTEX_LOCK(&theLock.mutex); \ theLock.locks = 0; \ COND_SIGNAL(&theLock.cond); \ MUTEX_UNLOCK(&theLock.mutex); \ } STMT_END #endif /* USE_ITHREADS */ #endif Class-XSAccessor-1.19/ppport.h0000644000175000017500000054004412045037666014723 0ustar tseetsee#if 0 <<'SKIP'; #endif /* ---------------------------------------------------------------------- ppport.h -- Perl/Pollution/Portability Version 3.20 Automatically created by Devel::PPPort running under perl 5.012004. 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.20 =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.11.5. =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 automagially 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 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 load_module() NEED_load_module NEED_load_module_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 vload_module() NEED_vload_module NEED_vload_module_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 file a bug report using the CPAN Request Tracker at 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-2010, 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.20; 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.014000| BhkENABLE||5.014000| BhkENTRY_set||5.014000| BhkENTRY||| BhkFLAGS||| CALL_BLOCK_HOOKS||| CLASS|||n CPERLscope|5.005000||p CX_CURPAD_SAVE||| CX_CURPAD_SV||| 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||p Copy||| CvPADLIST||| CvSTASH||| CvWEAKOUTSIDE||| DEFSV_set|5.010001||p DEFSV|5.004050||p 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||| GvSVn|5.009003||p GvSV||| Gv_AMupdate||5.011000| HEf_SVKEY||5.004000| HeHASH||5.004000| HeKEY||5.004000| HeKLEN||5.004000| HePV||5.004000| HeSVKEY_force||5.004000| HeSVKEY_set||5.004000| HeSVKEY||5.004000| HeUTF8||5.010001| HeVAL||5.004000| HvENAME||5.013007| HvNAMELEN_get|5.009003||p 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.014000| MY_CXT_CLONE|5.009002||p MY_CXT_INIT|5.007003||p MY_CXT|5.007003||p MoveD|5.009002||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| ORIGMARK||| 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_DUP||| 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_BCDVERSION|5.014000||p PERL_GCC_BRACE_GROUPS_FORBIDDEN|5.008001||p PERL_HASH|5.004000||p PERL_INT_MAX|5.004000||p PERL_INT_MIN|5.004000||p PERL_LONG_MAX|5.004000||p PERL_LONG_MIN|5.004000||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.014000||p PERL_MAGIC_isaelem|5.007002||p PERL_MAGIC_isa|5.007002||p PERL_MAGIC_mutex|5.014000||p PERL_MAGIC_nkeys|5.007002||p PERL_MAGIC_overload_elem|5.007002||p PERL_MAGIC_overload_table|5.007002||p PERL_MAGIC_overload|5.007002||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.004000||p PERL_QUAD_MIN|5.004000||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.004000||p PERL_SHORT_MIN|5.004000||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.014000| PERL_UCHAR_MAX|5.004000||p PERL_UCHAR_MIN|5.004000||p PERL_UINT_MAX|5.004000||p PERL_UINT_MIN|5.004000||p PERL_ULONG_MAX|5.004000||p PERL_ULONG_MIN|5.004000||p PERL_UNUSED_ARG|5.009003||p PERL_UNUSED_CONTEXT|5.009004||p PERL_UNUSED_DECL|5.007002||p PERL_UNUSED_VAR|5.007002||p PERL_UQUAD_MAX|5.004000||p PERL_UQUAD_MIN|5.004000||p PERL_USE_GCC_BRACE_GROUPS|5.009004||p PERL_USHORT_MAX|5.004000||p PERL_USHORT_MIN|5.004000||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.014000||p PL_bufptr|5.014000||p PL_compiling|5.004050||p PL_copline|5.014000||p PL_curcop|5.004050||p 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.014000||p PL_expect|5.014000||p PL_hexdigit|5.005000||p PL_hints|5.005000||p PL_in_my_stash|5.014000||p PL_in_my|5.014000||p PL_keyword_plugin||5.011002| PL_last_in_gv|||n PL_laststatval|5.005000||p PL_lex_state|5.014000||p PL_lex_stuff|5.014000||p PL_linestr|5.014000||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|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.014000||p PL_rsfp|5.014000||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.014000||p POP_MULTICALL||5.014000| POPi|||n POPl|||n POPn|||n POPpbytex||5.007001|n POPpx||5.005030|n POPp|||n POPs|||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.014000| PUSHi||| PUSHmortal|5.009002||p PUSHn||| PUSHp||| PUSHs||| PUSHu|5.004000||p PUTBACK||| 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_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| Perl_signbit||5.009005|n PoisonFree|5.009004||p PoisonNew|5.009004||p PoisonWith|5.009004||p Poison|5.008000||p 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 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_IV||| SVt_NV||| SVt_PVAV||| SVt_PVCV||| SVt_PVHV||| SVt_PVMG||| SVt_PV||| Safefree||| Slab_Alloc||| Slab_Free||| 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| 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||| 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| SvRX||5.009005| 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||| 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 UTF8_MAXBYTES|5.009002||p 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.014000||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 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.013004| XS_VERSION_BOOTCHECK||| XS_VERSION||| XSprePUSH|5.006000||p XS||| XopDISABLE||5.014000| XopENABLE||5.014000| XopENTRY_set||5.014000| XopENTRY||5.014000| XopFLAGS||5.013007| ZeroD|5.009002||p Zero||| _aMY_CXT|5.007003||p _append_range_to_invlist||| _new_invlist||| _pMY_CXT|5.007003||p _swash_inversion_hash||| _swash_to_invlist||| aMY_CXT_|5.007003||p aMY_CXT|5.007003||p aTHXR_|5.014000||p aTHXR|5.014000||p aTHX_|5.006000||p aTHX|5.006000||p add_alternate||| add_cp_to_invlist||| add_data|||n add_range_to_invlist||| add_utf16_textfilter||| addmad||| allocmy||| amagic_call||| amagic_cmp_locale||| amagic_cmp||| amagic_deref_call||5.013007| amagic_i_ncmp||| amagic_ncmp||| anonymise_cv_maybe||| any_dup||| ao||| append_madprops||| apply_attrs_my||| apply_attrs_string||5.006001| apply_attrs||| apply||| assert_uft8_cache_coherent||| atfork_lock||5.007003|n atfork_unlock||5.007003|n av_arylen_p||5.009003| av_clear||| av_create_and_push||5.009005| av_create_and_unshift_one||5.009005| av_delete||5.006000| av_exists||5.006000| 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_undef||| av_unshift||| ax|||n bad_type||| bind_match||| block_end||| block_gimme||5.004000| block_start||| blockhook_register||5.013003| boolSV|5.004000||p boot_core_PerlIO||| boot_core_UNIVERSAL||| boot_core_mro||| bytes_cmp_utf8||5.013007| bytes_from_utf8||5.007001| bytes_to_uni|||n bytes_to_utf8||5.006001| 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| calloc||5.007002|n cando||| cast_i32||5.006000| cast_iv||5.006000| cast_ulong||5.006000| cast_uv||5.006000| check_type_and_open||| check_uni||| check_utf8_print||| checkcomma||| checkposixcc||| ckWARN|5.006000||p 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| cl_and|||n cl_anything|||n cl_init|||n cl_is_anything|||n cl_or|||n clear_placeholders||| clone_params_del|||n clone_params_new|||n closest_cop||| convert||| 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.014000| cophh_store_pvn||5.013007| cophh_store_pvs||5.013007| cophh_store_pv||5.013007| cophh_store_sv||5.013007| cr_textfilter||| create_eval_scope||| croak_no_modify||5.013003| croak_nocontext|||vn croak_sv||5.013001| croak_xs_usage||5.010001| croak|||v csighandler||5.009003|n curmad||| curse||| custom_op_desc||5.007003| custom_op_name||5.007003| custom_op_register||5.013007| custom_op_xop||5.013007| cv_ckproto_len||| cv_clone||| cv_const_sv||5.004000| cv_dump||| cv_get_call_checker||5.013006| cv_set_call_checker||5.013006| cv_undef||| 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.014000||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 del_sv||| delete_eval_scope||| delimcpy||5.004000|n deprecate_commaless_var_list||| despatch_signals||5.007001| destroy_matcher||| die_nocontext|||vn die_sv||5.013001| 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_oddball||| do_op_dump||5.006000| do_op_xmldump||| do_open9||5.006000| do_openn||5.007001| do_open||5.004000| do_pmop_dump||5.006000| do_pmop_xmldump||| 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||| dofile||| dofindlabel||| doform||| doing_taint||5.008001|n dooneliner||| doopen_pm||| doparseform||| dopoptoeval||| dopoptogiven||| dopoptolabel||| dopoptoloop||| dopoptosub_at||| dopoptowhen||| doref||5.009003| dounwind||| dowantarray||| dump_all_perl||| dump_all||5.006000| dump_eval||5.006000| dump_exec_pos||| dump_fds||| 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||| emulate_cop_io||| 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||| fetch_cop_label||5.011000| filter_add||| filter_del||| filter_gets||| filter_read||| find_and_forget_pmops||| find_array_subscript||| find_beginning||| find_byclass||| find_hash_subscript||| find_in_my_stash||| find_runcv||5.008001| find_rundefsvoffset||5.009002| find_rundefsv||5.013002| find_script||| find_uninit_var||| first_symbol|||n foldEQ_latin1||5.013008|n foldEQ_locale||5.013002|n foldEQ_utf8_flags||5.013010| foldEQ_utf8||5.013002| foldEQ||5.013002|n fold_constants||| forbid_setid||| 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_global_struct||| free_tied_hv_pool||| free_tmps||| gen_constant_list||| get_aux_mg||| get_av|5.006000||p get_context||5.006000|n get_cvn_flags|5.009005||p 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_re_arg||| get_sv|5.006000||p get_vtbl||5.005030| getcwd_sv||5.007002| getenv_len||| glob_2number||| glob_assign_glob||| glob_assign_ref||| gp_dup||| gp_free||| gp_ref||| grok_bin|5.007003||p grok_bslash_c||| grok_bslash_o||| grok_hex|5.007003||p 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_check||| gv_const_sv||5.009003| gv_dump||5.006000| gv_efullname3||5.004000| gv_efullname4||5.006001| gv_efullname||| gv_ename||| gv_fetchfile_flags||5.009005| gv_fetchfile||| gv_fetchmeth_autoload||5.007003| gv_fetchmethod_autoload||5.004000| gv_fetchmethod_flags||5.011000| gv_fetchmethod||| gv_fetchmeth||| gv_fetchpvn_flags|5.009002||p gv_fetchpvs|5.009004||p gv_fetchpv||| gv_fetchsv|5.009002||p gv_fullname3||5.004000| gv_fullname4||5.006001| gv_fullname||| gv_get_super_pkg||| gv_handler||5.007001| gv_init_sv||| gv_init||| gv_magicalize_isa||| gv_magicalize_overload||| gv_name_set||5.009004| gv_stashpvn|5.004000||p gv_stashpvs|5.009003||p gv_stashpv||| gv_stashsv||| gv_try_downgrade||| he_dup||| hek_dup||| hfreeentries||| hsplit||| hv_assert||| hv_auxinit|||n hv_backreferences_p||| 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_common||| hv_delete_ent||5.004000| hv_delete||| hv_eiter_p||5.009003| hv_eiter_set||5.009003| hv_ename_add||| hv_ename_delete||| hv_exists_ent||5.004000| hv_exists||| hv_fetch_ent||5.004000| hv_fetchs|5.009003||p hv_fetch||| hv_fill||5.013002| hv_free_ent||5.004000| hv_iterinit||| hv_iterkeysv||5.004000| hv_iterkey||| hv_iternext_flags||5.008000| hv_iternextsv||| hv_iternext||| hv_iterval||| hv_kill_backrefs||| hv_ksplit||5.004000| hv_magic_check|||n hv_magic||| hv_name_set||5.009003| hv_notallowed||| hv_placeholders_get||5.009003| hv_placeholders_p||5.009003| hv_placeholders_set||5.009003| hv_riter_p||5.009003| hv_riter_set||5.009003| hv_scalar||5.009001| hv_store_ent||5.004000| hv_store_flags||5.008000| 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_dbargs||| init_debugger||| init_global_struct||| init_i18nl10n||5.006000| init_i18nl14n||5.006000| init_ids||| init_interp||| init_main_stash||| init_perllib||| init_postdump_symbols||| init_predump_symbols||| init_stacks||5.005000| init_tm||5.007002| instr|||n intro_my||| intuit_method||| intuit_more||| invert||| invlist_array||| invlist_destroy||| invlist_extend||| invlist_intersection||| invlist_len||| invlist_max||| invlist_set_array||| invlist_set_len||| invlist_set_max||| invlist_trim||| invlist_union||| invoke_exception_hook||| io_close||| isALNUMC|5.006000||p isALPHA||| isASCII|5.006000||p isBLANK|5.006001||p isCNTRL|5.006000||p isDIGIT||| isGRAPH|5.006000||p isGV_with_GP|5.009004||p isLOWER||| isOCTAL||5.013005| isPRINT|5.004000||p isPSXSPC|5.006001||p isPUNCT|5.006000||p isSPACE||| isUPPER||| isWORDCHAR||5.013006| isXDIGIT|5.006000||p is_an_int||| is_ascii_string||5.011000|n is_gv_magical_sv||| is_handle_constructor|||n is_inplace_av||| is_list_assignment||| is_lvalue_sub||5.007001| is_uni_alnum_lc||5.006000| is_uni_alnum||5.006000| is_uni_alpha_lc||5.006000| is_uni_alpha||5.006000| is_uni_ascii_lc||5.006000| is_uni_ascii||5.006000| is_uni_cntrl_lc||5.006000| is_uni_cntrl||5.006000| is_uni_digit_lc||5.006000| is_uni_digit||5.006000| is_uni_graph_lc||5.006000| is_uni_graph||5.006000| is_uni_idfirst_lc||5.006000| is_uni_idfirst||5.006000| is_uni_lower_lc||5.006000| is_uni_lower||5.006000| is_uni_print_lc||5.006000| is_uni_print||5.006000| is_uni_punct_lc||5.006000| is_uni_punct||5.006000| is_uni_space_lc||5.006000| is_uni_space||5.006000| is_uni_upper_lc||5.006000| is_uni_upper||5.006000| is_uni_xdigit_lc||5.006000| is_uni_xdigit||5.006000| is_utf8_X_LVT||| is_utf8_X_LV_LVT_V||| is_utf8_X_LV||| is_utf8_X_L||| is_utf8_X_T||| is_utf8_X_V||| is_utf8_X_begin||| is_utf8_X_extend||| is_utf8_X_non_hangul||| is_utf8_X_prepend||| is_utf8_alnum||5.006000| is_utf8_alpha||5.006000| is_utf8_ascii||5.006000| is_utf8_char_slow|||n is_utf8_char||5.006000|n is_utf8_cntrl||5.006000| is_utf8_common||| is_utf8_digit||5.006000| is_utf8_graph||5.006000| is_utf8_idcont||5.008000| is_utf8_idfirst||5.006000| is_utf8_lower||5.006000| is_utf8_mark||5.006000| is_utf8_perl_space||5.011001| is_utf8_perl_word||5.011001| is_utf8_posix_digit||5.011001| is_utf8_print||5.006000| is_utf8_punct||5.006000| is_utf8_space||5.006000| is_utf8_string_loclen||5.009003|n is_utf8_string_loc||5.008001|n is_utf8_string||5.006001|n is_utf8_upper||5.006000| is_utf8_xdigit||5.006000| is_utf8_xidcont||5.013010| is_utf8_xidfirst||5.013010| isa_lookup||| items|||n ix|||n jmaybe||| join_exact||| keyword_plugin_standard||| keyword||| leave_scope||| lex_bufutf8||5.011002| lex_discard_to||5.011002| lex_grow_linestr||5.011002| lex_next_chunk||5.011002| lex_peek_unichar||5.011002| lex_read_space||5.011002| lex_read_to||5.011002| lex_read_unichar||5.011002| lex_start||5.009005| lex_stuff_pvn||5.011002| lex_stuff_pvs||5.013005| lex_stuff_pv||5.013006| lex_stuff_sv||5.011002| lex_unstuff||5.011002| 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 mad_free||| madlex||| madparse||| magic_clear_all_env||| magic_clearenv||| magic_clearhints||| magic_clearhint||| magic_clearisa||| magic_clearpack||| magic_clearsig||| magic_dump||5.006000| magic_existspack||| magic_freearylen_p||| magic_freeovrld||| magic_getarylen||| magic_getdefelem||| magic_getnkeys||| magic_getpack||| magic_getpos||| magic_getsig||| magic_getsubstr||| magic_gettaint||| magic_getuvar||| magic_getvec||| magic_get||| magic_killbackrefs||| magic_len||| 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_setamagic||| magic_setarylen||| magic_setcollxfrm||| magic_setdbline||| magic_setdefelem||| magic_setenv||| magic_sethint||| magic_setisa||| 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_failtable||| make_trie||| malloc_good_size|||n malloced_size|||n malloc||5.007002|n markstack_grow||| matcher_matches_sv||| measure_struct||| memEQs|5.009005||p memEQ|5.004000||p memNEs|5.009005||p memNE|5.004000||p mem_collxfrm||| mem_log_common|||n mess_alloc||| mess_nocontext|||vn mess_sv||5.013001| mess||5.006000|v method_common||| mfree||5.007002|n mg_clear||| mg_copy||| mg_dup||| mg_findext||5.013008| mg_find||| mg_free_type||5.013006| mg_free||| mg_get||| mg_length||5.005000| mg_localize||| mg_magical||| mg_set||| mg_size||5.005000| mini_mktime||5.007002| missingterm||| mode_from_discipline||| modkids||| mod||| more_bodies||| more_sv||| moreswitches||| 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 munge_qwlist_to_paren_list||| my_atof2||5.007002| my_atof||5.006000| my_attrs||| my_bcopy|||n my_betoh16|||n my_betoh32|||n my_betoh64|||n my_betohi|||n my_betohl|||n my_betohs|||n my_bzero|||n my_chsize||| my_clearenv||| my_cxt_index||| my_cxt_init||| my_dirfd||5.009005| my_exit_jump||| my_exit||| my_failure_exit||5.004000| my_fflush_all||5.006000| my_fork||5.007003|n my_htobe16|||n my_htobe32|||n my_htobe64|||n my_htobei|||n my_htobel|||n my_htobes|||n my_htole16|||n my_htole32|||n my_htole64|||n my_htolei|||n my_htolel|||n my_htoles|||n my_htonl||| my_kid||| my_letoh16|||n my_letoh32|||n my_letoh64|||n my_letohi|||n my_letohl|||n my_letohs|||n my_lstat_flags||| my_lstat||5.014000| my_memcmp||5.004000|n my_memset|||n my_ntohl||| my_pclose||5.004000| my_popen_list||5.007001| my_popen||5.004000| my_setenv||| my_snprintf|5.009004||pvn my_socketpair||5.007003|n my_sprintf|5.009003||pvn my_stat_flags||| my_stat||5.014000| my_strftime||5.007002| my_strlcat|5.009004||pn my_strlcpy|5.009004||pn my_swabn|||n my_swap||| my_unexec||| my_vsnprintf||5.009004|n need_utf8|||n newANONATTRSUB||5.006000| newANONHASH||| newANONLIST||| newANONSUB||| newASSIGNOP||| newATTRSUB||5.006000| newAVREF||| newAV||| newBINOP||| newCONDOP||| newCONSTSUB|5.004050||p newCVREF||| newDEFSVOP||| newFORM||| newFOROP||5.013007| newGIVENOP||5.009003| newGIVWHENOP||| newGP||| newGVOP||| newGVREF||| newGVgen||| newHVREF||| newHVhv||5.005000| newHV||| newIO||| newLISTOP||| newLOGOP||| newLOOPEX||| newLOOPOP||| newMADPROP||| newMADsv||| newMYSUB||| newNULLLIST||| newOP||| newPADOP||| newPMOP||| newPROG||| newPVOP||| newRANGE||| newRV_inc|5.004000||p newRV_noinc|5.004000||p newRV||| newSLICEOP||| newSTATEOP||| newSUB||| newSVOP||| newSVREF||| newSV_type|5.009005||p newSVhek||5.009003| newSViv||| newSVnv||| 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||| newTOKEN||| newUNOP||| newWHENOP||5.009003| newWHILEOP||5.013007| newXS_flags||5.009004| newXSproto||5.006000| newXS||5.006000| new_collate||5.006000| new_constant||| new_ctype||5.006000| new_he||| new_logop||| new_numeric||5.006000| new_stackinfo||5.005000| new_version||5.009000| new_warnings_bitfield||| next_symbol||| nextargv||| nextchar||| ninstr|||n no_bareword_allowed||| no_fh_allowed||| no_op||| not_a_number||| nothreadhook||5.008000| nuke_stacks||| num_overflow|||n oopsAV||| oopsHV||| op_append_elem||5.013006| op_append_list||5.013006| op_clear||| op_const_sv||| op_contextualize||5.013006| op_dump||5.006000| op_free||| op_getmad_weak||| op_getmad||| op_linklist||5.013006| op_lvalue||5.013007| op_null||5.007002| op_prepend_elem||5.013006| op_refcnt_dec||| op_refcnt_inc||| op_refcnt_lock||5.009002| op_refcnt_unlock||5.009002| op_scope||5.013007| op_xmldump||| open_script||| opt_scalarhv||| 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||| pad_add_name_sv||| pad_add_name||| pad_alloc||| pad_block_start||| pad_check_dup||| pad_compname_type||| pad_findlex||| pad_findmy||5.011002| pad_fixup_inner_anons||| pad_free||| pad_leavemy||| pad_new||| pad_peg|||n pad_push||| pad_reset||| pad_setsv||| pad_sv||| pad_swipe||| pad_tidy||| padlist_dup||| parse_arithexpr||5.013008| parse_barestmt||5.013007| parse_block||5.013007| parse_body||| parse_fullexpr||5.013008| parse_fullstmt||5.013005| parse_label||5.013007| parse_listexpr||5.013008| parse_stmtseq||5.013006| parse_termexpr||5.013008| parse_unicode_opts||| parser_dup||| parser_free||| path_is_absolute|||n peep||| pending_Slabs_to_ro||| 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| pmop_xmldump||| pmruntime||| pmtrans||| pop_scope||| populate_isa|||v pregcomp||5.009005| pregexec||| pregfree2||5.011000| pregfree||| prepend_madprops||| prescan_version||5.011004| printbuf||| printf_nocontext|||vn process_special_blocks||| ptr_table_clear||5.009005| 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_byte||| pv_display|5.006000||p pv_escape|5.009004||p pv_pretty|5.009004||p pv_uni_display||5.007003| qerror||| qsortsvu||| re_compile||5.009005| re_croak2||| re_dup_guts||| re_intuit_start||5.009005| re_intuit_string||5.006000| readpipe_override||| realloc||5.007002|n reentrant_free||| reentrant_init||| reentrant_retry|||vn reentrant_size||| 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.014000| reg_check_named_buff_matched||| 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_namedseq||| reg_node||| reg_numbered_buff_fetch||| reg_numbered_buff_length||| reg_numbered_buff_store||| reg_qr_package||| reg_recode||| reg_scan_name||| reg_skipcomment||| reg_temp_copy||| reganode||| regatom||| regbranch||| regclass_swash||5.009004| regclass||| regcppop||| regcppush||| regcurly||| regdump_extflags||| regdump||5.005000| regdupe_internal||| regexec_flags||5.005000| regfree_internal||5.009005| reghop3|||n reghop4|||n reghopmaybe3|||n reginclass||| reginitcolors||5.006000| reginsert||| regmatch||| regnext||5.005000| regpiece||| regpposixcc||| regprop||| regrepeat||| regtail_study||| regtail||| regtry||| reguni||| regwhite|||n reg||| repeatcpy|||n report_evil_fh||| 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||| 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_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||| screaminstr||5.005000| search_const||| seed||5.008001| sequence_num||| sequence_tail||| sequence||| set_context||5.006000|n set_numeric_local||5.006000| set_numeric_radix||5.006000| set_numeric_standard||5.006000| set_regclass_bit_fold||| set_regclass_bit||| setdefout||| share_hek_flags||| share_hek||5.004000| si_dup||| sighandler|||n simplify_sort||| skipspace0||| skipspace1||| skipspace2||| skipspace||| softref2xv||| sortcv_stacked||| sortcv_xsub||| sortcv||| sortsv_flags||5.009003| sortsv||5.007003| space_join_names_mortal||| ss_dup||| stack_grow||| start_force||| start_glob||| start_subparse||5.004000| stashpv_hvname_match||5.014000| stdize_locale||| store_cop_label||| 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_2num||| 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||| sv_bless||| 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_catxmlpvn||| sv_catxmlpv||| sv_catxmlsv||| 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_compile_2op_is_broken||| sv_compile_2op||5.008001| sv_copypv||5.007003| sv_dec_nomg||5.013002| sv_dec||| sv_del_backref||| sv_derived_from||5.004000| sv_destroyable||5.010000| 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_free2||| sv_free_arenas||| sv_free||| sv_gets||5.004000| 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_kill_backrefs||| sv_len_utf8||5.006000| sv_len||| sv_magic_portable|5.014000|5.004000|p sv_magicext||5.007003| sv_magic||| sv_mortalcopy||| sv_ncmp||| sv_newmortal||| sv_newref||| sv_nolocking||5.007003| sv_nosharing||5.007003| sv_nounlocking||| sv_nv||5.005000| sv_peek||5.005000| 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_release_COW||| sv_replace||| sv_report_used||| sv_reset||| sv_rvweaken||5.006000| 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.013006| sv_setref_pv||| sv_setref_uv||5.007001| sv_setsv_cow||| 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| 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_decode||5.006000| sv_utf8_downgrade||5.006000| 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||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 sv_xmlpeek||| svtype||| swallow_bom||| swash_fetch||5.007002| swash_get||| swash_init||5.006000| 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||5.006000| toLOWER||| toUPPER||| to_byte_substr||| to_uni_fold||5.007003| to_uni_lower_lc||5.006000| to_uni_lower||5.007003| to_uni_title_lc||5.006000| to_uni_title||5.007003| to_uni_upper_lc||5.006000| to_uni_upper||5.007003| to_utf8_case||5.007003| to_utf8_fold||5.007003| to_utf8_lower||5.007003| to_utf8_substr||| to_utf8_title||5.007003| to_utf8_upper||5.007003| token_free||| token_getmad||| tokenize_use||| tokeq||| tokereport||| too_few_arguments||| too_many_arguments||| 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.004000| 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| utf8_length||5.007001| utf8_mg_len_cache_update||| utf8_mg_pos_cache_update||| utf8_to_bytes||5.006001| utf8_to_uvchr||5.007001| utf8_to_uvuni||5.007001| utf8n_to_uvchr||| utf8n_to_uvuni||5.007001| utilize||| uvchr_to_utf8_flags||5.007003| uvchr_to_utf8||| 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| 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|||vn warn_sv||5.013001| warner_nocontext|||vn warner|5.006000|5.004000|pv warn|||v watch||| whichsig||| with_queued_errors||| write_no_mem||| write_to_stderr||| xmldump_all_perl||| xmldump_all||| xmldump_attr||| xmldump_eval||| xmldump_form||| xmldump_indent|||v xmldump_packsubs_perl||| xmldump_packsubs||| xmldump_sub_perl||| xmldump_sub||| xmldump_vindent||| xs_apiversion_bootcheck||| xs_version_bootcheck||| 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 _dpppDEC2BCD(dec) ((((dec)/100)<<8)|((((dec)%100)/10)<<4)|((dec)%10)) #define PERL_BCDVERSION ((_dpppDEC2BCD(PERL_REVISION)<<24)|(_dpppDEC2BCD(PERL_VERSION)<<12)|_dpppDEC2BCD(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 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 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_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 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 isALNUMC # define isALNUMC(c) (isALPHA(c) || isDIGIT(c)) #endif #ifndef isASCII # define isASCII(c) ((U8) (c) <= 127) #endif #ifndef isCNTRL # define isCNTRL(c) ((U8) (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 #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 * doint. 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 #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) #if defined(NEED_eval_pv) || defined(NEED_eval_pv_GLOBAL) 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 && SvTRUE(GvSV(errgv))) croak(SvPVx(GvSV(errgv), na)); 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 #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) #if defined(NEED_vload_module) || defined(NEED_vload_module_GLOBAL) 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); #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 #ifdef load_module # undef load_module #endif #define load_module DPPP_(my_load_module) #define Perl_load_module DPPP_(my_load_module) #if defined(NEED_load_module) || defined(NEED_load_module_GLOBAL) 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 #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) #if defined(NEED_newRV_noinc) || defined(NEED_newRV_noinc_GLOBAL) 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 #ifdef newCONSTSUB # undef newCONSTSUB #endif #define newCONSTSUB(a,b,c) DPPP_(my_newCONSTSUB)(aTHX_ a,b,c) #define Perl_newCONSTSUB DPPP_(my_newCONSTSUB) #if defined(NEED_newCONSTSUB) || defined(NEED_newCONSTSUB_GLOBAL) /* 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" # else # if IVSIZE == INTSIZE # define IVdf "d" # define UVuf "u" # define UVof "o" # define UVxf "x" # define UVXf "X" # endif # 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 #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) #if defined(NEED_newSV_type) || defined(NEED_newSV_type_GLOBAL) 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 #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) #if defined(NEED_newSVpvn_flags) || defined(NEED_newSVpvn_flags_GLOBAL) 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 #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) #if defined(NEED_sv_2pvbyte) || defined(NEED_sv_2pvbyte_GLOBAL) 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 #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) #if defined(NEED_sv_2pv_flags) || defined(NEED_sv_2pv_flags_GLOBAL) 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 #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) #if defined(NEED_sv_pvn_force_flags) || defined(NEED_sv_pvn_force_flags_GLOBAL) 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 DPPP_SVPV_NOLEN_LP_ARG &PL_na #else # define DPPP_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, DPPP_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, DPPP_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, DPPP_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, DPPP_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_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 #ifdef vnewSVpvf # undef vnewSVpvf #endif #define vnewSVpvf(a,b) DPPP_(my_vnewSVpvf)(aTHX_ a,b) #define Perl_vnewSVpvf DPPP_(my_vnewSVpvf) #if defined(NEED_vnewSVpvf) || defined(NEED_vnewSVpvf_GLOBAL) 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 #define Perl_sv_catpvf_mg DPPP_(my_sv_catpvf_mg) #if defined(NEED_sv_catpvf_mg) || defined(NEED_sv_catpvf_mg_GLOBAL) 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 #define sv_catpvf_mg_nocontext DPPP_(my_sv_catpvf_mg_nocontext) #define Perl_sv_catpvf_mg_nocontext DPPP_(my_sv_catpvf_mg_nocontext) #if defined(NEED_sv_catpvf_mg_nocontext) || defined(NEED_sv_catpvf_mg_nocontext_GLOBAL) 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 #define Perl_sv_setpvf_mg DPPP_(my_sv_setpvf_mg) #if defined(NEED_sv_setpvf_mg) || defined(NEED_sv_setpvf_mg_GLOBAL) 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 #define sv_setpvf_mg_nocontext DPPP_(my_sv_setpvf_mg_nocontext) #define Perl_sv_setpvf_mg_nocontext DPPP_(my_sv_setpvf_mg_nocontext) #if defined(NEED_sv_setpvf_mg_nocontext) || defined(NEED_sv_setpvf_mg_nocontext_GLOBAL) 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 #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) #if defined(NEED_newSVpvn_share) || defined(NEED_newSVpvn_share_GLOBAL) 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 GvSVn # define GvSVn(gv) GvSV(gv) #endif #ifndef isGV_with_GP # define isGV_with_GP(gv) isGV(gv) #endif #ifndef gv_fetchpvn_flags # define gv_fetchpvn_flags(name, len, flags, svt) gv_fetchpv(name, flags, svt) #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 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 #define Perl_warner DPPP_(my_warner) #if defined(NEED_warner) || defined(NEED_warner_GLOBAL) 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 #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 /* 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 #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 */ #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 #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) #if defined(NEED_grok_numeric_radix) || defined(NEED_grok_numeric_radix_GLOBAL) 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 #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) #if defined(NEED_grok_number) || defined(NEED_grok_number_GLOBAL) 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 #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) #if defined(NEED_grok_bin) || defined(NEED_grok_bin_GLOBAL) 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 #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) #if defined(NEED_grok_hex) || defined(NEED_grok_hex_GLOBAL) 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 #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) #if defined(NEED_grok_oct) || defined(NEED_grok_oct_GLOBAL) 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 #define my_snprintf DPPP_(my_my_snprintf) #define Perl_my_snprintf DPPP_(my_my_snprintf) #if defined(NEED_my_snprintf) || defined(NEED_my_snprintf_GLOBAL) 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 #define my_sprintf DPPP_(my_my_sprintf) #define Perl_my_sprintf DPPP_(my_my_sprintf) #if defined(NEED_my_sprintf) || defined(NEED_my_sprintf_GLOBAL) 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 #define my_strlcat DPPP_(my_my_strlcat) #define Perl_my_strlcat DPPP_(my_my_strlcat) #if defined(NEED_my_strlcat) || defined(NEED_my_strlcat_GLOBAL) 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 #define my_strlcpy DPPP_(my_my_strlcpy) #define Perl_my_strlcpy DPPP_(my_my_strlcpy) #if defined(NEED_my_strlcpy) || defined(NEED_my_strlcpy_GLOBAL) 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 #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) #if defined(NEED_pv_escape) || defined(NEED_pv_escape_GLOBAL) 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 #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) #if defined(NEED_pv_pretty) || defined(NEED_pv_pretty_GLOBAL) 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 #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) #if defined(NEED_pv_display) || defined(NEED_pv_display_GLOBAL) 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 */ Class-XSAccessor-1.19/Makefile.PL0000644000175000017500000000453212243573005015165 0ustar tseetseeuse 5.008; use strict; use warnings; use ExtUtils::MakeMaker; use Config; our $OPTIMIZE; if ($Config{gccversion}) { $OPTIMIZE = '-O3 -Wall -W'; } elsif ($Config{osname} eq 'MSWin32') { $OPTIMIZE = '-O2 -W4'; } else { $OPTIMIZE = $Config{optimize}; } if ($ENV{DEBUG}) { $OPTIMIZE .= ' -g'; } # See lib/ExtUtils/MakeMaker.pm for details of how to influence # the contents of the Makefile that is written. WriteMakefile1( MIN_PERL_VERSION => '5.008', META_MERGE => { resources => { repository => 'git://github.com/tsee/Class-XSAccessor.git' }, }, BUILD_REQUIRES => { 'Test::More' => 0, }, NAME => 'Class::XSAccessor', VERSION_FROM => 'lib/Class/XSAccessor.pm', # finds $VERSION PREREQ_PM => { 'XSLoader' => 0, 'Time::HiRes' => '0', }, # e.g., Module::Name => 1.1 LICENSE => 'perl', ABSTRACT_FROM => 'lib/Class/XSAccessor.pm', AUTHOR => 'Steffen Mueller ', LIBS => [''], # e.g., '-lm' DEFINE => '', # e.g., '-DHAVE_SOMETHING' INC => '-I.', # e.g., '-I. -I/usr/include/other' OPTIMIZE => $OPTIMIZE, # Un-comment this if you add C files to link with later: OBJECT => '$(O_FILES)', # link all the C files too ); sub WriteMakefile1 { #Written by Alexandr Ciornii, version 0.20. Added by eumm-upgrade. my %params=@_; my $eumm_version=$ExtUtils::MakeMaker::VERSION; $eumm_version=eval $eumm_version; die "EXTRA_META is deprecated" if exists $params{EXTRA_META}; die "License not specified" if not exists $params{LICENSE}; if ($params{BUILD_REQUIRES} and $eumm_version < 6.5503) { #EUMM 6.5502 has problems with BUILD_REQUIRES $params{PREREQ_PM}={ %{$params{PREREQ_PM} || {}} , %{$params{BUILD_REQUIRES}} }; delete $params{BUILD_REQUIRES}; } delete $params{CONFIGURE_REQUIRES} if $eumm_version < 6.52; delete $params{MIN_PERL_VERSION} if $eumm_version < 6.48; delete $params{META_MERGE} if $eumm_version < 6.46; delete $params{META_ADD} if $eumm_version < 6.46; delete $params{LICENSE} if $eumm_version < 6.31; delete $params{AUTHOR} if $] < 5.005; delete $params{ABSTRACT_FROM} if $] < 5.005; delete $params{BINARY_LOCATION} if $] < 5.005; WriteMakefile(%params); } Class-XSAccessor-1.19/cxsa_hash_table.h0000644000175000017500000000170611667426357016514 0ustar tseetsee#ifndef cxsa_hash_table_h_ #define cxsa_hash_table_h_ #include "cxsa_memory.h" #include "EXTERN.h" #include "ppport.h" #include "perl.h" typedef struct HashTableEntry { struct HashTableEntry* next; const char* key; STRLEN len; void * value; } HashTableEntry; typedef struct { struct HashTableEntry** array; UV size; UV items; NV threshold; } HashTable; /* void * CXSA_HashTable_delete(HashTable* table, const char* key, STRLEN len); */ void * CXSA_HashTable_fetch(HashTable* table, const char* key, STRLEN len); void * CXSA_HashTable_store(HashTable* table, const char* key, STRLEN len, void * value); HashTableEntry* CXSA_HashTable_find(HashTable* table, const char* key, STRLEN len); HashTable* CXSA_HashTable_new(UV size, NV threshold); void CXSA_HashTable_clear(HashTable* table, bool do_release_values); void CXSA_HashTable_free(HashTable* table, bool do_release_values); void CXSA_HashTable_grow(HashTable* table); #endif Class-XSAccessor-1.19/Changes0000644000175000017500000001714012243573166014515 0ustar tseetseeRevision history for Perl extension Class-XSAccessor. 1.19 Fri Nov 22 07:15 2013 - Remove the OP tree munging optimization since it wasn't in the end really speeding things up. (chocolateboy) - Require Time::HiRes explicitly because CentOS cripples the base perl install. 1.18 Mon Jun 17 18:07 2013 - Revert fixes for implicitly-lvalue getters for now since that actually breaks user code. It seems it's not just because the users are naughty, so more investigation required. 1.17 Mon Jun 17 07:09 2013 - For Hashes: Implement predicates that check definedness and existance explicitly. The traditional "predicates" check definedness. It's conceivable to also want a bool-check type predicate. File a ticket if you need that. - Fix bug regarding getters being implicitly lvalue by returning the internal SV*. Instead, we now use TARG. 1.16 Mon Nov 5 13:47 2012 - Drop erroneous MYMETA files from distribution. 1.15 Sun Nov 4 15:30 2012 - Support for hash keys with NUL (\0) characters. Previously, these were truncated. 1.14 Sun Aug 26 23:23 2012 - Skip some failing tests on old debugging perls. Guys, please upgrade your perl! 1.13 Mon Dec 12 08:21 2011 - Promotes 1.12_03 to a stable release. 1.12_03 Fri Dec 9 18:29 2011 - Fix for unthreaded perls (broken in 1.12_02). 1.12_02 Wed Dec 7 08:20 2011 - Removes the cached read-only and read-write accessors for the time being. (These were only available from another development releasse. - Much more brutal thread-safety testing. - Fixed thread-safety problem with the global hashkey storage. - Lots of refactoring in the C code. - Instead of storing an index in the CV, we store a pointer to the hashkey struct. 1.12_01 Tue Nov 29 18:40 2011 - Implements cached read-only and read-write accessors. Details on what that means are in the documentation. 1.12 Fri Sep 4 19:00 2011 - Reclaim compatibility with the most recent versions of ExtUtils::ParseXS. - Explicit tests for wrong-type invocants. 1.11 Fri Dec 3 18:00 2010 - Fix assignment to lvalue accessors that point at an uninitialized hash element. 1.10 Wed Dec 1 20:44 2010 - Fix RT #63458 and potentially #50454 We don't occasionally crash during END any more. Instead, we rely on the OS to reap a bit of memory after perl was shut down anyway. - Tiny refactoring for smaller object size. 1.09 Sun Oct 31 12:45 2010 - Fix #62531: Predicates return value, not bool (SJOHNSTON) - TODO test for perl-crashing bug (in perl) that can happen on (arcane) XSUB aliasing on perls < 5.8.9 (Peter Rabbitson) We're open for work-around patches. 1.08 Fri Sep 17 20:30 2010 - Promote latest development release to a stable release. 1.07_04 Sun Sep 12 10:30 2010 - Since WIN32 doesn't have the PERL_CORE optimization, it gets the PERL_NO_GET_CONTEXT optimization back. - Add threading test that would previously crash on win32 and perls compiled with track-mempool. - Use the system's malloc/etc for the shared memory, not perl's. 1.07_03 Thu Sep 9 20:30 2010 - Minor constructor optimization/cleanup. - Various built-time warning fixes. - PERL_CORE optimization now disabled on WIN32. - Class::Accessor::Fast compatibility code added (not for public consumption!) - Clear requirement of Perl 5.8 everywhere. - Fix minor (constant as in O(1)) memory leak. 1.07_02 Mon Aug 23 20:30 2010 - Various warning fixes and small cleanups over previous dev. version. 1.07_01 Wed Aug 18 20:30 2010 - Experimental support for lvalue accessors: $obj->foo = 12 1.07 Sun Aug 15 14:41 2010 - Include two new test files for the fix in 1.06. - Define PERL_CORE, but *only* while including XSUB.h to get a significant speed-up (see XSAccessor.xs for an explanation). Idea from chocolateboy. Complaints from rightfully annoyed perl5-porters (in particular but not limited to Nicholas) go to Steffen. 1.06 Sat Aug 14 20:21 2010 - Add sanity checks to make sure we don't segfault on invalid invocants (chocolateboy) 1.05 Sun Nov 15 12:54 2009 - Minor developer doc tweaks. - Minor XS refactoring 1.04_05 Mon Nov 9 20:10 2009 - Fixes for perls < 5.10: => No entersub optimization => Do no use precalculated hashes - Updated entersub optimization - Remove brain-damaged double-hashing - Minor portability fixlets 1.04_04 Thu Nov 5 18:00 2009 - Fixes for non-threaded perls (no need for locks, perl_mutex not even defined). 1.04_03 Tue Nov 3 22:32 2009 ** This release features some very radical changes. Test well. ** - Replace use of perl hashes in the global hash key name storage with a full-blown, separate implementation of a hash table (Steffen, chocolateboy) - Similarly, throw out the SV's for simple C strings. - Add a global lock for all modifications to global data structures: - The above three items fix RT #50454 (serious threading issues). - Add support for alternate use Class::XSAccessor { ... } syntax (Adam K) 1.04_02 Mon Sep 7 11:35 2009 ** This release features some very radical changes. Test well. ** - Significant optimization by replacing the relevant entersub ops with stripped down versions (chocolateboy) 1.04_01 Mon Sep 7 11:35 2009 ** This release features some very radical changes. Test well. ** - More aggressive OPTIMIZE flags if possible (chocolateboy) - Added shorthand syntax for getters, setters, accessors, and predicates where the attribute has the same name as the method (chocolateboy) - Remove dependency on AutoXS::Header. - Merge Class::XSAccessor::Array into this distribution. - Refactored the XS to remove duplicate code. - Refactored the perl code in XSAccessor.pm and Array.pm to remove duplicate code (=> Heavy.pm). - Upgrade Devel::PPPort/ppport.h (chocolateboy) 1.04 Thu Jun 11 16:40 2009 - Fix a bunch of warnings thanks to a heads up from Marcela Maslanova. 1.03 Sun May 31 18:45 2009 - Upgrade to AutoXS::Header 1.01: Make it C89! 1.02 Sun May 17 11:18 2009 - Require new AutoXS header version in order to fix prototyping issue. 1.01 Sat May 16 16:11 2009 - XS boolean constants for PPI 1.00 Sat May 16 13:48 2009 - Implement new caching algorithm: Only recreate the int => hash key association for new hash keys. 0.14 Tue Dec 9 21:06 2008 - Fix Makefile issue on Windows using nmake (Petar Shangov) 0.13 Thu Dec 4 15:06 2008 - Add predicate tests - Fix some compiler warnings (Tom Heady) 0.12 Tue Dec 2 14:07 2008 - Compilation fix for Solaris cc. (Probably going half-way only.) 0.11 Sat Nov 29 21:37 2008 - Forgot to add more tests in previous release. 0.10 Sat Nov 29 21:17 2008 - Add generation of constructors. 0.09 Sat Nov 29 17:28 2008 - Add the class option to set the target class. 0.08 Fri Nov 21 12:17 2008 - Reduce code duplication. - Fix for compilation issues on Solaris with Sun's cc. 0.07 Thu Aug 29 14:14 2008 - Documented the "replace" option. - Added the "chained" option to generate chainable setters and mutators. 0.06 Thu Aug 28 13:39 2008 - Copy input scalars on setter/mutator calls (RT #38573) 0.05 Sat Jun 21 18:06 2008 - Add read/write accessors. (chocolateboy) - By default, return the new value from setters. (chocolateboy) - Add predicates, i.e. "has_foo". 0.04 Mon May 3 19:12 2008 - Win32 support. 0.03 Mon May 3 19:12 2008 - Refer to Class::XSAccessor::Array for array based objects. 0.02 Mon Apr 3 17:12 2008 - Mention in the docs that fully qualified method names are supported. 0.01 Mon Apr 3 17:09 2008 - original version as uploaded to CPAN. Class-XSAccessor-1.19/README0000644000175000017500000001516612016512112014066 0ustar tseetseeNAME Class::XSAccessor - Generate fast XS accessors without runtime compilation SYNOPSIS package MyClass; use Class::XSAccessor replace => 1, # Replace existing methods (if any) constructor => 'new', getters => { get_foo => 'foo', # 'foo' is the hash key to access get_bar => 'bar', }, setters => { set_foo => 'foo', set_bar => 'bar', }, accessors => { foo => 'foo', bar => 'bar', }, predicates => { has_foo => 'foo', has_bar => 'bar', }, lvalue_accessors => { # see below baz => 'baz', # ... }, true => [ 'is_token', 'is_whitespace' ], false => [ 'significant' ]; # The imported methods are implemented in fast XS. # normal class code here. As of version 1.05, some alternative syntax forms are available: package MyClass; # Options can be passed as a HASH reference, if preferred, # which can also help Perl::Tidy to format the statement correctly. use Class::XSAccessor { # If the name => key values are always identical, # the following shorthand can be used. accessors => [ 'foo', 'bar' ], }; DESCRIPTION Class::XSAccessor implements fast read, write and read/write accessors in XS. Additionally, it can provide predicates such as "has_foo()" for testing whether the attribute "foo" is defined in the object. It only works with objects that are implemented as ordinary hashes. Class::XSAccessor::Array implements the same interface for objects that use arrays for their internal representation. Since version 0.10, the module can also generate simple constructors (implemented in XS). Simply supply the "constructor => 'constructor_name'" option or the "constructors => ['new', 'create', 'spawn']" option. These constructors do the equivalent of the following Perl code: sub new { my $class = shift; return bless { @_ }, ref($class)||$class; } That means they can be called on objects and classes but will not clone objects entirely. Parameters to "new()" are added to the object. The XS accessor methods are between 3 and 4 times faster than typical pure-Perl accessors in some simple benchmarking. The lower factor applies to the potentially slightly obscure "sub set_foo_pp {$_[0]->{foo} = $_[1]}", so if you usually write clear code, a factor of 3.5 speed-up is a good estimate. If in doubt, do your own benchmarking! The method names may be fully qualified. The example in the synopsis could have been written as "MyClass::get_foo" instead of "get_foo". This way, methods can be installed in classes other than the current class. See also: the "class" option below. By default, the setters return the new value that was set, and the accessors (mutators) do the same. This behaviour can be changed with the "chained" option - see below. The predicates return a boolean. Since version 1.01, "Class::XSAccessor" can generate extremely simple methods which just return true or false (and always do so). If that seems like a really superfluous thing to you, then consider a large class hierarchy with interfaces such as PPI. These methods are provided by the "true" and "false" options - see the synopsis. OPTIONS In addition to specifying the types and names of accessors, additional options can be supplied which modify behaviour. The options are specified as key/value pairs in the same manner as the accessor declaration. For example: use Class::XSAccessor getters => { get_foo => 'foo', }, replace => 1; The list of available options is: replace Set this to a true value to prevent "Class::XSAccessor" from complaining about replacing existing subroutines. chained Set this to a true value to change the return value of setters and mutators (when called with an argument). If "chained" is enabled, the setters and accessors/mutators will return the object. Mutators called without an argument still return the value of the associated attribute. As with the other options, "chained" affects all methods generated in the same "use Class::XSAccessor ..." statement. class By default, the accessors are generated in the calling class. The the "class" option allows the target class to be specified. LVALUES Support for lvalue accessors via the keyword "lvalue_accessors" was added in version 1.08. At this point, THEY ARE CONSIDERED HIGHLY EXPERIMENTAL. Furthermore, their performance hasn't been benchmarked yet. The following example demonstrates an lvalue accessor: package Address; use Class::XSAccessor constructor => 'new', lvalue_accessors => { zip_code => 'zip' }; package main; my $address = Address->new(zip => 2); print $address->zip_code, "\n"; # prints 2 $address->zip_code = 76135; # <--- This is it! print $address->zip_code, "\n"; # prints 76135 CAVEATS Probably won't work for objects based on *tied* hashes. But that's a strange thing to do anyway. Scary code exploiting strange XS features. If you think writing an accessor in XS should be a laughably simple exercise, then please contemplate how you could instantiate a new XS accessor for a new hash key that's only known at run-time. Note that compiling C code at run-time a la Inline::C is a no go. Threading. With version 1.00, a memory leak has been fixed. Previously, a small amount of memory would leak if "Class::XSAccessor"-based classes were loaded in a subthread without having been loaded in the "main" thread. If the subthread then terminated, a hash key and an int per associated method used to be lost. Note that this mattered only if classes were only loaded in a sort of throw-away thread. In the new implementation, as of 1.00, the memory will still not be released, in the same situation, but it will be recycled when the same class, or a similar class, is loaded again in any thread. SEE ALSO * Class::XSAccessor::Array * AutoXS AUTHOR Steffen Mueller chocolateboy COPYRIGHT AND LICENSE Copyright (C) 2008, 2009, 2010, 2011, 2012 by Steffen Mueller This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.8 or, at your option, any later version of Perl 5 you may have available. Class-XSAccessor-1.19/XSAccessor.xs0000644000175000017500000006046512234742565015624 0ustar tseetsee#ifdef WIN32 /* Win32 doesn't get PERL_CORE, so use the next best thing */ #define PERL_NO_GET_CONTEXT #endif /* For versions of ExtUtils::ParseXS > 3.04_02, we need to * explicitly enforce exporting of XSUBs since we want to * refer to them using XS(). This isn't strictly necessary, * but it's by far the simplest way to be backwards-compatible. */ #define PERL_EUPXS_ALWAYS_EXPORT #include "EXTERN.h" #include "perl.h" /* want this eeaarly, before perl spits in the soup with XSUB.h */ #include "cxsa_memory.h" /* * Quoting chocolateboy from his Method::Lexical module at 2009-02-08: * * for binary compatibility (see perlapi.h), XS modules perform a function call to * access each and every interpreter variable. So, for instance, an innocuous-looking * reference to PL_op becomes: * * (*Perl_Iop_ptr(my_perl)) * * This (obviously) impacts performance. Internally, PL_op is accessed as: * * my_perl->Iop * * (in threaded/multiplicity builds (see intrpvar.h)), which is significantly faster. * * defining PERL_CORE gets us the fast version, at the expense of a future maintenance release * possibly breaking things: https://groups.google.com/group/perl.perl5.porters/browse_thread/thread/9ec0da3f02b3b5a * * Rather than globally defining PERL_CORE, which pokes its fingers into various headers, exposing * internals we'd rather not see, just define it for XSUB.h, which includes * perlapi.h, which imposes the speed limit. */ #ifdef WIN32 /* thanks to Andy Grundman for pointing out problems with this on ActivePerl >= 5.10 */ #include "XSUB.h" #else /* not WIN32 */ #define PERL_CORE #include "XSUB.h" #undef PERL_CORE #endif #include "ppport.h" #include "cxsa_main.h" #include "cxsa_locking.h" #define CXAA(name) XS_Class__XSAccessor__Array_ ## name #define CXAH(name) XS_Class__XSAccessor_ ## name #define CXA_CHECK_HASH(self) \ if (!(SvROK(self) && SvTYPE(SvRV(self)) == SVt_PVHV)) { \ croak("Class::XSAccessor: invalid instance method invocant: no hash ref supplied"); \ } #define CXA_CHECK_ARRAY(self) \ if (!(SvROK(self) && SvTYPE(SvRV(self)) == SVt_PVAV)) { \ croak("Class::XSAccessor: invalid instance method invocant: no array ref supplied"); \ } /* * chocolateboy: 2009-09-06 - 2009-11-14: * * entersub OPs that call our accessors are optimized (i.e. replaced with optimized versions) * in versions of perl >= 5.10.0. This section describes the implementation. * * TL;DR: the first time one of our fast (XS) accessors is called, we reach up into the * calling OP (OP_ENTERSUB) and change its implementation (PL_op->op_ppaddr) to an optimized * version that takes advantage of the fact that our accessors are straightforward hash/array lookups. * In order for this to work safely, we need to be able to disable/prevent this optimization * in some circumstances. This is done by setting a "don't optimize me" flag on the entersub OP. * Prior to 5.10.0, there were no spare bits available on entersub OPs we could use for this, but * perls >= 5.10.0 have a new OP member called op_spare that gives us 3 whole bits to play with! * * First, some preliminaries: a method call is performed as a subroutine call at the OP * level. There's some additional work to look up the method CV and push the invocant * on the stack, but the current OP inside a method call is the subroutine call OP, OP_ENTERSUB. * * Two distinct invocations of the same method will have two entersub OPs and will receive * the same CV on the stack: * * $foo->bar(...); # OP 1: CV 1 * $foo->bar(...); # OP 2: CV 1 * * There are also situations in which the same entersub OP calls more than one CV: * * $foo->$_() for ('foo', 'bar'); # OP 1: CV 1, CV 2 * * Inside each Class::XSAccessor XSUB, we can access the current entersub OP (PL_op). * The default entersub implementation (pp_entersub in pp_hot.c) has a lot of boilerplate for * dealing with all the different ways in which subroutines can be called. It sets up * and tears down a new scope; it deals with the fact that the code ref can be passed * in as a GV or CV; and it has numerous conditional statements to deal with the various * different types of CV. * * For our XSUB accessors, we don't need most of that. We don't need to open a new scope; * the subroutine is almost always a CV (that's what OP_METHOD and OP_METHOD_NAMED usually return); * and we don't need to deal with all the non-XSUB cases. This allows us to replace the * OP's implementation (op_ppaddr) with a version optimized for our simple XSUBs. (This * is inspired by B::XSUB::Dumber: nothingmuch++) * * We do this inside the accessor i.e. at runtime. We can also back out the optimization * if a call site proves to be dynamic e.g. if a method is redefined or the method is * called with multiple different CVs (see below). * * In practice, this is rarely the case. the vast majority of method calls in perl, * and in most dynamic languages (cf. Google's v8), behave like method calls in static * languages. for instance, 97% of the call sites exercised by perl 5.10.0's test suite are * monomorphic. * * We only replace the op_ppaddr pointer of entersub OPs that use the default pp_entersub. * this ensures we don't interfere with any modules that assign a new op_ppaddr e.g. * Data::Alias, Faster. it also ensures we don't tread on our own toes and repeatedly * re-assign the same optimized entersub. * * There's one optimized entersub for each type of Class::XSAccessor accessor. To save typing, * they're generated by C preprocessor macros i.e. poor man's generic programming. * * If, for some reason, the entersub should not be optimized, a flag is set on the * entersub OP. This flag is detected inside the accessor. If the flag is set, * the accessor will never try to optimize the entersub OP. * * There are a number of situations in which optimization is disabled. * * 1) if the entersub is not perl's default entersub i.e. if another module has * provided its own entersub implementation, then we don't replace it. * * 2) if the call site is dynamic. the optimized entersub is optimized for a particular * type of Class::XSAccessor accessor (e.g. getter, setter, predicate &c.). if * an optimized entersub finds itself invoking a function other than the * specific XSUB it's tailored for, then the entersub optimization is disabled. * This also applies if a method is redefined so that an optimized * entersub is passed a different type of CV than the one it's optimized for. * * 1) is detected inside the accessor. 2) is detected inside the optimized entersub. * In the second case, we reinstate the previous entersub, which by 1) was perl's pp_entersub. * * Note: Class::XSAccessor XSUBs continue to optimize "new" call sites, regardless of what may * have happened to a "previous" OP or what may happen to a "subsequent" OP. Take the following * example: * * 1: package Example; * 2: * 3: use Class::XSAccessor { getters => 'foo' }; * 4: * 5: for (1 .. 10) { * 6: $self->foo(); * 7: $self->$_ for ('foo', 'bar'); * 8: $self->foo(); * 9: } * * Here, line 6 is optimized as normal. Line 7 is optimized on the first call, when $_ is "foo", * but the optimization is disabled on the second call, when $_ is "bar", because &Example::bar * is not a Class::XSAccessor getter. All subsequent calls on line 7, use perl's default entersub. * Line 8 is optimized as normal. i.e. the disabled optimization on line 7 doesn't affect subsequent * optimizations. On line 7, only the entersub OP is "pessimized". &Example::foo continues to "look for" * "new" entersub OPs to optimize. Indeed, any calls to &Example::foo will get the optimization treatment, * even call sites outside the Example package/file. * * The following CXAA_OPTIMIZE_ENTERSUB* (Array) and CXAH_OPTIMIZE_ENTERSUB* (Hash) macros are * called from within our accessors to install the optimized entersub (if possible). * The CXAA_GENERATE_ENTERSUB* and CXAH_GENERATE_ENTERSUB* macros further down * generate optimized entersubs for the accessors defined in XS/Array.xs and XS/Hash.xs. */ #if (PERL_BCDVERSION >= 0x5010000) #define CXA_ENABLE_ENTERSUB_OPTIMIZATION #endif #ifdef CXA_ENABLE_ENTERSUB_OPTIMIZATION #define CXA_OPTIMIZATION_OK(op) ((op->op_spare & 1) != 1) #define CXA_DISABLE_OPTIMIZATION(op) (op->op_spare |= 1) /* see t/08hash_entersub.t */ #define CXAH_OPTIMIZE_ENTERSUB_TEST(name) \ STMT_START { \ /* print op_spare so that we get failing tests if perl starts using it */ \ warn("cxah: accessor: op_spare: %u", PL_op->op_spare); \ \ if (PL_op->op_ppaddr == CXA_DEFAULT_ENTERSUB) { \ if (CXA_OPTIMIZATION_OK(PL_op)) { \ warn("cxah: accessor: optimizing entersub"); \ PL_op->op_ppaddr = cxah_entersub_ ## name; \ } else { \ warn("cxah: accessor: entersub optimization has been disabled"); \ } \ } else if (PL_op->op_ppaddr == cxah_entersub_ ## name) { \ warn("cxah: accessor: entersub has been optimized"); \ } \ } STMT_END #define CXAH_OPTIMIZE_ENTERSUB(name) \ STMT_START { \ if ((PL_op->op_ppaddr == CXA_DEFAULT_ENTERSUB) && CXA_OPTIMIZATION_OK(PL_op)) { \ PL_op->op_ppaddr = cxah_entersub_ ## name; \ } \ } STMT_END #define CXAA_OPTIMIZE_ENTERSUB(name) \ STMT_START { \ if ((PL_op->op_ppaddr == CXA_DEFAULT_ENTERSUB) && CXA_OPTIMIZATION_OK(PL_op)) { \ PL_op->op_ppaddr = cxaa_entersub_ ## name; \ } \ } STMT_END #else /* if CXA_ENABLE_ENTERSUB_OPTIMIZATION is not defined... */ #define CXAA_GENERATE_ENTERSUB(name) #define CXAA_OPTIMIZE_ENTERSUB(name) #define CXAH_GENERATE_ENTERSUB(name) #define CXAH_OPTIMIZE_ENTERSUB(name) #define CXAH_GENERATE_ENTERSUB_TEST(name) #define CXAH_OPTIMIZE_ENTERSUB_TEST(name) #endif /* end #ifdef CXA_ENABLE_ENTERSUB_OPTIMIZATION */ /* * VMS mangles XSUB names so that they're less than 32 characters, and * ExtUtils::ParseXS provides no way to XS-ify XSUB names that appear * anywhere else but in the XSUB definition. * * The mangling is deterministic, so we can translate from every other * platform => VMS here * * This will probably never get used. */ /* FIXME: redo this to include new names */ #ifdef VMS #define Class__XSAccessor_lvalue_accessor Class_XSAcc_lvacc #define Class__XSAccessor_array_setter Cs_XSAcesor_ary_set #define Class__XSAccessor_array_accessor Cs_XSAcesor_ary_accessor #define Class__XSAccessor_chained_setter Clas_XSAcesor_chained_seter #define Class__XSAccessor_chained_accessor Clas_XSAcesor_chained_acesor #define Class__XSAccessor_exists_predicate Clas_XSAcesor_eprdicate #define Class__XSAccessor_defined_predicate Clas_XSAcesor_dprdicate #define Class__XSAccessor_constructor Class_XSAccessor_constructor #define Class__XSAccessor_constant_false Clas_XSAcesor_constant_false #define Class__XSAccessor_constant_true Clas_XSAcesor_constant_true #define Class__XSAccessor__Array_getter Clas_XSAcesor_Aray_geter #define Class__XSAccessor__Array_lvalue_accessor Class_XSAcc_Ay_lvacc #define Class__XSAccessor__Array_setter Clas_XSAcesor_Aray_seter #define Class__XSAccessor__Array_chained_setter Cs_XSAs_Ay_cid_seter #define Class__XSAccessor__Array_accessor Clas_XSAcesor_Aray_acesor #define Class__XSAccessor__Array_chained_accessor Cs_XSAs_Ay_cid_acesor #define Class__XSAccessor__Array_predicate Clas_XSAcesor_Aray_predicate #define Class__XSAccessor__Array_constructor Cs_XSAs_Ay_constructor #endif #ifdef CXA_ENABLE_ENTERSUB_OPTIMIZATION #define CXAH_GENERATE_ENTERSUB_TEST(name) \ OP * cxah_entersub_ ## name(pTHX) { \ dVAR; dSP; dTOPss; \ warn("cxah: entersub: inside optimized entersub"); \ \ if (sv \ && (SvTYPE(sv) == SVt_PVCV) \ && (CvXSUB((CV *)sv) == CXAH(name)) \ ) { \ (void)POPs; \ PUTBACK; \ (void)CXAH(name)(aTHX_ (CV *)sv); \ return NORMAL; \ } else { /* not static: disable optimization */ \ if (!sv) { \ warn("cxah: entersub: disabling optimization: SV is null"); \ } else if (SvTYPE(sv) != SVt_PVCV) { \ warn("cxah: entersub: disabling optimization: SV is not a CV"); \ } else { \ warn("cxah: entersub: disabling optimization: SV is not " # name); \ } \ CXA_DISABLE_OPTIMIZATION(PL_op); /* make sure it's not reinstated */ \ PL_op->op_ppaddr = CXA_DEFAULT_ENTERSUB; \ return CXA_DEFAULT_ENTERSUB(aTHX); \ } \ } #define CXAH_GENERATE_ENTERSUB(name) \ OP * cxah_entersub_ ## name(pTHX) { \ dVAR; dSP; dTOPss; \ \ if (sv \ && (SvTYPE(sv) == SVt_PVCV) \ && (CvXSUB((CV *)sv) == CXAH(name)) \ ) { \ (void)POPs; \ PUTBACK; \ (void)CXAH(name)(aTHX_ (CV *)sv); \ return NORMAL; \ } else { /* not static: disable optimization */ \ CXA_DISABLE_OPTIMIZATION(PL_op); /* make sure it's not reinstated */ \ PL_op->op_ppaddr = CXA_DEFAULT_ENTERSUB; \ return CXA_DEFAULT_ENTERSUB(aTHX); \ } \ } #define CXAA_GENERATE_ENTERSUB(name) \ OP * cxaa_entersub_ ## name(pTHX) { \ dVAR; dSP; dTOPss; \ \ if (sv \ && (SvTYPE(sv) == SVt_PVCV) \ && (CvXSUB((CV *)sv) == CXAA(name)) \ ) { \ (void)POPs; \ PUTBACK; \ (void)CXAA(name)(aTHX_ (CV *)sv); \ return NORMAL; \ } else { /* not static: disable optimization */ \ CXA_DISABLE_OPTIMIZATION(PL_op); /* make sure it's not reinstated */ \ PL_op->op_ppaddr = CXA_DEFAULT_ENTERSUB; \ return CXA_DEFAULT_ENTERSUB(aTHX); \ } \ } #endif /* CXA_ENABLE_ENTERSUB_OPTIMIZATION */ /* Install a new XSUB under 'name' and automatically set the file name */ #define INSTALL_NEW_CV(name, xsub) \ STMT_START { \ if (newXS(name, xsub, (char*)__FILE__) == NULL) \ croak("ARG! Something went really wrong while installing a new XSUB!"); \ } STMT_END /* Install a new XSUB under 'name' and set the function index attribute * Requires a previous declaration of a CV* cv! * TODO: Once the array case has been migrated to storing pointers instead * of indexes, this macro can probably go away. **/ #define INSTALL_NEW_CV_WITH_INDEX(name, xsub, function_index) \ STMT_START { \ cv = newXS(name, xsub, (char*)__FILE__); \ if (cv == NULL) \ croak("ARG! Something went really wrong while installing a new XSUB!"); \ XSANY.any_i32 = function_index; \ } STMT_END /* Install a new XSUB under 'name' and set the function index attribute * Requires a previous declaration of a CV* cv! **/ #define INSTALL_NEW_CV_WITH_PTR(name, xsub, user_pointer) \ STMT_START { \ cv = newXS(name, xsub, (char*)__FILE__); \ if (cv == NULL) \ croak("ARG! Something went really wrong while installing a new XSUB!"); \ XSANY.any_ptr = (void *)user_pointer; \ } STMT_END /* Install a new XSUB under 'name' and set the function index attribute * for array-based objects. Requires a previous declaration of a CV* cv! **/ #define INSTALL_NEW_CV_ARRAY_OBJ(name, xsub, obj_array_index) \ STMT_START { \ const U32 function_index = get_internal_array_index((I32)obj_array_index); \ INSTALL_NEW_CV_WITH_INDEX(name, xsub, function_index); \ CXSAccessor_arrayindices[function_index] = obj_array_index; \ } STMT_END /* Install a new XSUB under 'name' and set the function index attribute * for hash-based objects. Requires a previous declaration of a CV* cv! **/ #define INSTALL_NEW_CV_HASH_OBJ(name, xsub, obj_hash_key, obj_hash_key_len) \ STMT_START { \ autoxs_hashkey *hk_ptr = get_hashkey(aTHX_ obj_hash_key, obj_hash_key_len);\ INSTALL_NEW_CV_WITH_PTR(name, xsub, hk_ptr); \ hk_ptr->key = (char*)cxa_malloc(obj_hash_key_len+1); \ cxa_memcpy(hk_ptr->key, obj_hash_key, obj_hash_key_len); \ hk_ptr->key[obj_hash_key_len] = 0; \ hk_ptr->len = obj_hash_key_len; \ PERL_HASH(hk_ptr->hash, obj_hash_key, obj_hash_key_len); \ } STMT_END #ifdef CXA_ENABLE_ENTERSUB_OPTIMIZATION static Perl_ppaddr_t CXA_DEFAULT_ENTERSUB = NULL; /* predeclare the XSUBs so we can refer to them in the optimized entersubs */ XS(CXAH(getter)); CXAH_GENERATE_ENTERSUB(getter); XS(CXAH(lvalue_accessor)); CXAH_GENERATE_ENTERSUB(lvalue_accessor); XS(CXAH(setter)); CXAH_GENERATE_ENTERSUB(setter); /* for the Class::Accessor compatibility layer only! */ XS(CXAH(array_setter)); CXAH_GENERATE_ENTERSUB(array_setter); XS(CXAH(chained_setter)); CXAH_GENERATE_ENTERSUB(chained_setter); XS(CXAH(accessor)); CXAH_GENERATE_ENTERSUB(accessor); /* for the Class::Accessor compatibility layer only! */ XS(CXAH(array_accessor)); CXAH_GENERATE_ENTERSUB(array_accessor); XS(CXAH(chained_accessor)); CXAH_GENERATE_ENTERSUB(chained_accessor); XS(CXAH(defined_predicate)); CXAH_GENERATE_ENTERSUB(defined_predicate); XS(CXAH(exists_predicate)); CXAH_GENERATE_ENTERSUB(exists_predicate); XS(CXAH(constructor)); CXAH_GENERATE_ENTERSUB(constructor); XS(CXAH(constant_false)); CXAH_GENERATE_ENTERSUB(constant_false); XS(CXAH(constant_true)); CXAH_GENERATE_ENTERSUB(constant_true); XS(CXAH(test)); CXAH_GENERATE_ENTERSUB_TEST(test); XS(CXAA(getter)); CXAA_GENERATE_ENTERSUB(getter); XS(CXAA(lvalue_accessor)); CXAA_GENERATE_ENTERSUB(lvalue_accessor); XS(CXAA(setter)); CXAA_GENERATE_ENTERSUB(setter); XS(CXAA(chained_setter)); CXAA_GENERATE_ENTERSUB(chained_setter); XS(CXAA(accessor)); CXAA_GENERATE_ENTERSUB(accessor); XS(CXAA(chained_accessor)); CXAA_GENERATE_ENTERSUB(chained_accessor); XS(CXAA(predicate)); CXAA_GENERATE_ENTERSUB(predicate); XS(CXAA(constructor)); CXAA_GENERATE_ENTERSUB(constructor); #endif /* CXA_ENABLE_ENTERSUB_OPTIMIZATION */ /* magic vtable and setter function for lvalue accessors */ STATIC int setter_for_lvalues(pTHX_ SV *sv, MAGIC* mg); STATIC int setter_for_lvalues(pTHX_ SV *sv, MAGIC* mg) { PERL_UNUSED_VAR(mg); sv_setsv(LvTARG(sv), sv); return TRUE; } STATIC MGVTBL cxsa_lvalue_acc_magic_vtable = { 0 /* get */ ,setter_for_lvalues /* set */ ,0 /* len */ ,0 /* clear */ ,0 /* free */ #if (PERL_BCDVERSION >= 0x5008000) ,0 /* copy */ ,0 /* dup */ #if (PERL_BCDVERSION >= 0x5008009) ,0 /* local */ #endif /* perl >= 5.8.0 */ #endif /* perl >= 5.8.9 */ }; MODULE = Class::XSAccessor PACKAGE = Class::XSAccessor PROTOTYPES: DISABLE BOOT: #ifdef CXA_ENABLE_ENTERSUB_OPTIMIZATION CXA_DEFAULT_ENTERSUB = PL_ppaddr[OP_ENTERSUB]; #endif #ifdef USE_ITHREADS _init_cxsa_lock(&CXSAccessor_lock); /* cf. CXSAccessor.h */ #endif /* USE_ITHREADS */ /* * testing the hashtable implementation... */ /* { HashTable* tb = CXSA_HashTable_new(16, 0.9); CXSA_HashTable_store(tb, "test", 4, 12); CXSA_HashTable_store(tb, "test5", 5, 199); warn("12==%u\n", CXSA_HashTable_fetch(tb, "test", 4)); warn("199==%u\n", CXSA_HashTable_fetch(tb, "test5", 5)); warn("0==%u\n", CXSA_HashTable_fetch(tb, "test123", 7)); } */ void END() PROTOTYPE: CODE: if (CXSAccessor_reverse_hashkeys) { /* This can run before Perl is done, so accessors might still be called, * so we can't free our memory here. Solution? Special global destruction * phase *AFTER* all Perl END() subs were run? */ /*CXSA_HashTable_free(CXSAccessor_reverse_hashkeys, true);*/ } void __entersub_optimized__() PROTOTYPE: CODE: #ifdef CXA_ENABLE_ENTERSUB_OPTIMIZATION XSRETURN(1); #else XSRETURN(0); #endif INCLUDE: XS/Hash.xs INCLUDE: XS/HashCACompat.xs INCLUDE: XS/Array.xs