diff options
author | Karl Williamson <public@khwilliamson.com> | 2013-07-06 12:26:43 -0600 |
---|---|---|
committer | Karl Williamson <public@khwilliamson.com> | 2013-07-16 13:58:06 -0600 |
commit | a0316a6cd4a14261beb22d95530d5763e8b6756b (patch) | |
tree | 26f2d40eaca022f4185e709ea341944aa3d9fef5 /regen/mk_invlists.pl | |
parent | d212d2222867b5b63a5f6d8c3243d0d45a26988c (diff) | |
download | perl-a0316a6cd4a14261beb22d95530d5763e8b6756b.tar.gz |
Reinstate + fix "Revert "regcomp.c: Add a constant 0 element before inversion lists" "
This reverts commit de353015643cf10b437d714d3483c1209e079916 which
reverted 533c4e2f08b42d977e5004e823d4849f7473d2d0, thus reinstating it,
plus this commit adds a fix to get it to pass under Address Sanitizer.
The root cause of the problem is that there are two measures of the
length of an inversion list. One is SvCUR(), and the other is
invlist_len(). The original commit caused these to get off-by-one in
some cases. The ultimate solution is to only store one value, and
return the other one based off that. Rather than redo the whole branch,
I've taken an easier way out, which is to add a dummy element at the end
of some inversion lists, so that they aren't off-by-one. Then the other
patches from the original branch will be applied. Each will be
tested with Address Sanitizer. Then the work to fix the underlying
problem will be done.
The original commit's message was:
This commit is the first step to separating the header from the body of
inversion lists. Doing so will allow the compiled-in inversion lists to
be fully read-only.
To invert an inversion list, one simply unshifts a 0 to the front of it
if one is not there, and shifts off the 0 if it does have one.
The current data structure reserves an element at the beginning of each
inversion list that is either 0 or 1. If 0, it means the inversion list
begins there; if 1, it means the inversion list starts at the next
element. Inverting involves flipping this bit.
This commit changes the structure so that there is an additional element
just after the element that flips. This new element is always 0, and
the flipping element now says whether the inversion list begins at the
constant 0 element, or the one after that.
Doing this allows the flipping element to be separated in later commits
from the body of the inversion list, which will always begin with the
constant 0 element. That means that the body of the inversion list can
be const.
Diffstat (limited to 'regen/mk_invlists.pl')
-rw-r--r-- | regen/mk_invlists.pl | 32 |
1 files changed, 14 insertions, 18 deletions
diff --git a/regen/mk_invlists.pl b/regen/mk_invlists.pl index 67b6e417fc..8e131d6f58 100644 --- a/regen/mk_invlists.pl +++ b/regen/mk_invlists.pl @@ -15,7 +15,7 @@ require 'regen/regen_lib.pl'; # in the headers is used to minimize the possibility of things getting # out-of-sync, or the wrong data structure being passed. Currently that # random number is: -my $VERSION_DATA_STRUCTURE_TYPE = 290655244; +my $VERSION_DATA_STRUCTURE_TYPE = 1039476070; my $out_fh = open_new('charclass_invlists.h', '>', {style => '*', by => $0, @@ -36,27 +36,23 @@ sub output_invlist ($$) { # Output the inversion list $invlist using the name $name for it. # It is output in the exact internal form for inversion lists. - my $zero_or_one; # Is the last element of the header 0, or 1 ? - - # If the first element is 0, it goes in the header, instead of the body - if ($invlist->[0] == 0) { - shift @$invlist; - - $zero_or_one = 0; - - # Add a dummy 0 at the end so that the length is constant. inversion - # lists are always stored with enough room so that if they change from - # beginning with 0, they don't have to grow. - push @$invlist, 0; - } - else { + # Is the last element of the header 0, or 1 ? + my $zero_or_one = 0; + my $count = @$invlist; + if ($invlist->[0] != 0) { + unshift @$invlist, 0; $zero_or_one = 1; } + else { # Temporary until we disentangle the header from the body. In the + # meantime, Adding this 0 at the end of lists that begin with 0 + # will keep the code from reading beyond the end of the array. + push @$invlist, 0; + } print $out_fh "\n#ifndef PERL_IN_XSUB_RE\n" unless exists $include_in_ext_re{$name}; print $out_fh "\nstatic UV ${name}_invlist[] = {\n"; - print $out_fh "\t", scalar @$invlist, ",\t/* Number of elements */\n"; + print $out_fh "\t$count,\t/* Number of elements */\n"; # This should be UV_MAX, but I (khw) am not confident that the suffixes # for specifying the constant are portable, e.g. 'ull' on a 32 bit @@ -65,8 +61,8 @@ sub output_invlist ($$) { print $out_fh "\t0,\t/* Cache of previous search index result */\n"; print $out_fh "\t$VERSION_DATA_STRUCTURE_TYPE, /* Version and data structure type */\n"; print $out_fh "\t", $zero_or_one, - ",\t/* 0 if this is the first element of the list proper;", - "\n\t\t 1 if the next element is the first */\n"; + ",\t/* 0 if the list starts at 0;", + "\n\t\t 1 if it starts at the element beyond 0 */\n"; # The main body are the UVs passed in to this routine. Do the final # element separately |