11 sub croak { require Carp; Carp::croak(@_) }
14 # Given a lowercase property or property-value name, return its
15 # standardized version that is expected for look-up in the 'loose' hashes
16 # in Heavy.pl (hence, this depends on what mktables does). This squeezes
17 # out blanks, underscores and dashes. The complication stems from the
18 # grandfathered-in 'L_', which retains a single trailing underscore.
20 my $loose = $_[0] =~ s/[-\s_]//rg;
22 return $loose if $loose !~ / ^ (?: is )? l $/x;
23 return 'l_' if $_[0] =~ / l .* _ /x; # If original had a trailing '_'
28 ## "SWASH" == "SWATCH HASH". A "swatch" is a swatch of the Unicode landscape.
29 ## It's a data structure that encodes a set of Unicode characters.
33 # If a floating point number is within this distance from the value of a
34 # fraction, it is considered to be that fraction, even if many more digits
35 # are specified that don't exactly match.
36 my $min_floating_slop;
38 # To guard against this program calling something that in turn ends up
39 # calling this program with the same inputs, and hence infinitely
40 # recursing, we keep a stack of the properties that are currently in
41 # progress, pushed upon entry, popped upon return.
45 my ($class, $type, $list, $minbits, $none) = @_;
48 $class = "" unless defined $class;
49 print STDERR __LINE__, ": class=$class, type=$type, list=",
50 (defined $list) ? $list : ':undef:',
51 ", minbits=$minbits, none=$none\n" if DEBUG;
54 ## Get the list of codepoints for the type.
55 ## Called from swash_init (see utf8.c) or SWASHNEW itself.
57 ## Callers of swash_init:
58 ## op.c:pmtrans -- for tr/// and y///
59 ## regexec.c:regclass_swash -- for /[]/, \p, and \P
60 ## utf8.c:is_utf8_common -- for common Unicode properties
61 ## utf8.c:to_utf8_case -- for lc, uc, ucfirst, etc. and //i
63 ## Given a $type, our goal is to fill $list with the set of codepoint
64 ## ranges. If $type is false, $list passed is used.
67 ## For binary properties, $minbits must be 1.
68 ## For character mappings (case and transliteration), $minbits must
69 ## be a number except 1.
71 ## $list (or that filled according to $type):
72 ## Refer to perlunicode.pod, "User-Defined Character Properties."
74 ## For binary properties, only characters with the property value
75 ## of True should be listed. The 3rd column, if any, will be ignored
77 ## $none is undocumented, so I'm (khw) trying to do some documentation
78 ## of it now. It appears to be if there is a mapping in an input file
79 ## that maps to 'XXXX', then that is replaced by $none+1, expressed in
80 ## hexadecimal. It is used somehow in tr///.
82 ## To make the parsing of $type clear, this code takes the a rather
83 ## unorthodox approach of last'ing out of the block once we have the
84 ## info we need. Were this to be a subroutine, the 'last' would just
87 # If a problem is found $type is returned;
88 # Upon success, a new (or cached) blessed object is returned with
89 # keys TYPE, BITS, EXTRAS, LIST, and NONE with values having the
90 # same meanings as the input parameters.
91 # SPECIALS contains a reference to any special-treatment hash in the
92 # INVERT_IT is non-zero if the result should be inverted before use
93 my $file; ## file to load data from, and also part of the %Cache key.
96 # Change this to get a different set of Unicode tables
97 my $unicore_dir = 'unicore';
103 # Verify that this isn't a recursive call for this property.
104 # Can't use croak, as it may try to recurse here itself.
105 my $class_type = $class . "::$type";
106 if (grep { $_ eq $class_type } @recursed) {
107 CORE::die "panic: Infinite recursion in SWASHNEW for '$type'\n";
109 push @recursed, $class_type;
114 # regcomp.c surrounds the property name with '__" and '_i' if this
115 # is to be caseless matching.
116 my $caseless = $type =~ s/^__(.*)_i$/$1/;
118 print STDERR __LINE__, ": type=$type, caseless=$caseless\n" if DEBUG;
123 ## It could be a user-defined property. Look in current
124 ## package if no package given
127 my $caller1 = $type =~ s/(.+)::// ? $1 : caller(1);
129 if (defined $caller1 && $type =~ /^I[ns]\w+$/) {
130 my $prop = "${caller1}::$type";
131 if (exists &{$prop}) {
132 # stolen from Scalar::Util::PP::tainted()
135 local($@, $SIG{__DIE__}, $SIG{__WARN__});
138 eval { kill 0 * $prop };
139 $tainted = 1 if $@ =~ /^Insecure/;
141 die "Insecure user-defined property \\p{$prop}\n"
144 $list = &{$prop}($caseless);
149 # During Perl's compilation, this routine may be called before
150 # the tables are constructed. If so, we have a chicken/egg
151 # problem. If we die, the tables never get constructed, so
152 # keep going, but return an empty table so only what the code
153 # has compiled in internally (currently ASCII/Latin1 range
154 # matching) will work.
156 # Poor man's constant, to avoid a run-time check.
158 = \! defined &DynaLoader::boot_DynaLoader;
161 eval "require '$unicore_dir/Heavy.pl'";
165 require "$unicore_dir/Heavy.pl";
167 BEGIN { delete $utf8::{miniperl} }
169 # All property names are matched caselessly
170 my $property_and_table = CORE::lc $type;
171 print STDERR __LINE__, ": $property_and_table\n" if DEBUG;
173 # See if is of the compound form 'property=value', where the
174 # value indicates the table we should use.
175 my ($property, $table, @remainder) =
176 split /\s*[:=]\s*/, $property_and_table, -1;
178 pop @recursed if @recursed;
183 if (! defined $table) {
185 # Here, is the single form. The property becomes empty, and
186 # the whole value is the table.
188 $prefix = $property = "";
190 print STDERR __LINE__, ": $property\n" if DEBUG;
192 # Here it is the compound property=table form. The property
193 # name is always loosely matched, and always can have an
194 # optional 'is' prefix (which isn't true in the single
196 $property = _loose_name($property) =~ s/^is//r;
198 # And convert to canonical form. Quit if not valid.
199 $property = $utf8::loose_property_name_of{$property};
200 if (! defined $property) {
201 pop @recursed if @recursed;
205 $prefix = "$property=";
207 # If the rhs looks like it is a number...
208 print STDERR __LINE__, ": table=$table\n" if DEBUG;
209 if ($table =~ qr{ ^ [ \s 0-9 _ + / . -]+ $ }x) {
210 print STDERR __LINE__, ": table=$table\n" if DEBUG;
212 # Don't allow leading nor trailing slashes
213 if ($table =~ / ^ \/ | \/ $ /x) {
214 pop @recursed if @recursed;
218 # Split on slash, in case it is a rational, like \p{1/5}
219 my @parts = split qr{ \s* / \s* }x, $table, -1;
220 print __LINE__, ": $type\n" if @parts > 2 && DEBUG;
222 # Can have maximum of one slash
224 pop @recursed if @recursed;
228 foreach my $part (@parts) {
229 print __LINE__, ": part=$part\n" if DEBUG;
231 $part =~ s/^\+\s*//; # Remove leading plus
232 $part =~ s/^-\s*/-/; # Remove blanks after unary
235 # Remove underscores between digits.
236 $part =~ s/( ?<= [0-9] ) _ (?= [0-9] ) //xg;
238 # No leading zeros (but don't make a single '0'
239 # into a null string)
240 $part =~ s/ ^ ( -? ) 0+ /$1/x;
241 $part .= '0' if $part eq '-' || $part eq "";
243 # No trailing zeros after a decimal point
244 $part =~ s/ ( \. .*? ) 0+ $ /$1/x;
246 # Begin with a 0 if a leading decimal point
247 $part =~ s/ ^ ( -? ) \. /${1}0./x;
249 # Ensure not a trailing decimal point: turn into an
251 $part =~ s/ \. $ //x;
253 print STDERR __LINE__, ": part=$part\n" if DEBUG;
254 #return $type if $part eq "";
256 # Result better look like a number. (This test is
257 # needed because, for example could have a plus in
259 if ($part !~ / ^ -? [0-9]+ ( \. [0-9]+)? $ /x) {
260 pop @recursed if @recursed;
268 # If denominator is negative, get rid of it, and ...
269 if ($parts[1] =~ s/^-//) {
271 # If numerator is also negative, convert the
272 # whole thing to positive, or move the minus to
274 if ($parts[0] !~ s/^-//) {
275 $parts[0] = '-' . $parts[0];
278 $table = join '/', @parts;
280 elsif ($property ne 'nv' || $parts[0] !~ /\./) {
282 # Here is not numeric value, or doesn't have a
283 # decimal point. No further manipulation is
284 # necessary. (Note the hard-coded property name.
285 # This could fail if other properties eventually
286 # had fractions as well; perhaps the cjk ones
287 # could evolve to do that. This hard-coding could
288 # be fixed by mktables generating a list of
289 # properties that could have fractions.)
293 # Here is a floating point numeric_value. Try to
294 # convert to rational. First see if is in the list
296 if (exists $utf8::nv_floating_to_rational{$parts[0]}) {
297 $table = $utf8::nv_floating_to_rational{$parts[0]};
300 # Here not in the list. See if is close
301 # enough to something in the list. First
302 # determine what 'close enough' means. It has
303 # to be as tight as what mktables says is the
304 # maximum slop, and as tight as how many
305 # digits we were passed. That is, if the user
306 # said .667, .6667, .66667, etc. we match as
307 # many digits as they passed until get to
308 # where it doesn't matter any more due to the
309 # machine's precision. If they said .6666668,
311 (my $fraction = $parts[0]) =~ s/^.*\.//;
312 my $epsilon = 10 ** - (length($fraction));
313 if ($epsilon > $utf8::max_floating_slop) {
314 $epsilon = $utf8::max_floating_slop;
317 # But it can't be tighter than the minimum
318 # precision for this machine. If haven't
319 # already calculated that minimum, do so now.
320 if (! defined $min_floating_slop) {
322 # Keep going down an order of magnitude
323 # until find that adding this quantity to
324 # 1 remains 1; but put an upper limit on
325 # this so in case this algorithm doesn't
326 # work properly on some platform, that we
327 # won't loop forever.
329 $min_floating_slop = 1;
330 while (1+ $min_floating_slop != 1
333 my $next = $min_floating_slop / 10;
334 last if $next == 0; # If underflows,
336 $min_floating_slop = $next;
337 print STDERR __LINE__, ": min_float_slop=$min_floating_slop\n" if DEBUG;
340 # Back off a couple orders of magnitude,
342 $min_floating_slop *= 100;
345 if ($epsilon < $min_floating_slop) {
346 $epsilon = $min_floating_slop;
348 print STDERR __LINE__, ": fraction=.$fraction; epsilon=$epsilon\n" if DEBUG;
352 # And for each possible rational in the table,
353 # see if it is within epsilon of the input.
355 (keys %utf8::nv_floating_to_rational)
357 print STDERR __LINE__, ": epsilon=$epsilon, official=$official, diff=", abs($parts[0] - $official), "\n" if DEBUG;
358 if (abs($parts[0] - $official) < $epsilon) {
360 $utf8::nv_floating_to_rational{$official};
365 # Quit if didn't find one.
366 if (! defined $table) {
367 pop @recursed if @recursed;
372 print STDERR __LINE__, ": $property=$table\n" if DEBUG;
376 # Combine lhs (if any) and rhs to get something that matches
377 # the syntax of the lookups.
378 $property_and_table = "$prefix$table";
379 print STDERR __LINE__, ": $property_and_table\n" if DEBUG;
381 # First try stricter matching.
382 $file = $utf8::stricter_to_file_of{$property_and_table};
384 # If didn't find it, try again with looser matching by editing
385 # out the applicable characters on the rhs and looking up
387 if (! defined $file) {
388 $table = _loose_name($table);
389 $property_and_table = "$prefix$table";
390 print STDERR __LINE__, ": $property_and_table\n" if DEBUG;
391 $file = $utf8::loose_to_file_of{$property_and_table};
394 # Add the constant and go fetch it in.
397 # A beginning ! means to invert
398 $invert_it = $file =~ s/^!//;
400 if ($utf8::why_deprecated{$file}) {
401 warnings::warnif('deprecated', "Use of '$type' in \\p{} or \\P{} is deprecated because: $utf8::why_deprecated{$file};");
405 && exists $utf8::caseless_equivalent{$property_and_table})
407 $file = $utf8::caseless_equivalent{$property_and_table};
409 $file= "$unicore_dir/lib/$file.pl";
412 print STDERR __LINE__, ": didn't find $property_and_table\n" if DEBUG;
415 ## Last attempt -- see if it's a standard "To" name
416 ## (e.g. "ToLower") ToTitle is used by ucfirst().
417 ## The user-level way to access ToDigit() and ToFold()
418 ## is to use Unicode::UCD.
420 if ($type =~ /^To(Digit|Fold|Lower|Title|Upper)$/) {
422 # Fail if wanting a binary property, as these aren't.
424 pop @recursed if @recursed;
427 $file = "$unicore_dir/To/$1.pl";
428 ## would like to test to see if $file actually exists....
433 ## If we reach this line, it's because we couldn't figure
434 ## out what to do with $type. Ouch.
437 pop @recursed if @recursed;
442 print STDERR __LINE__, ": found it (file='$file')\n" if DEBUG;
445 ## If we reach here, it was due to a 'last GETFILE' above
446 ## (exception: user-defined properties and mappings), so we
447 ## have a filename, so now we load it if we haven't already.
448 ## If we have, return the cached results. The cache key is the
449 ## class and file to load.
451 my $found = $Cache{$class, $file};
452 if ($found and ref($found) eq $class) {
453 print STDERR __LINE__, ": Returning cached '$file' for \\p{$type}; invert_it=$invert_it\n" if DEBUG;
454 pop @recursed if @recursed;
455 $found->{'INVERT_IT'} = $invert_it;
461 $list = do $file; die $@ if $@;
464 $ListSorted = 1; ## we know that these lists are sorted
471 my $taint = substr($list,0,0); # maintain taint
472 my @tmp = split(/^/m, $list);
475 $extras = join '', $taint, grep /^[^0-9a-fA-F]/, @tmp;
476 $list = join '', $taint,
478 sort { $a->[0] <=> $b->[0] }
479 map { /^([0-9a-fA-F]+)/; [ CORE::hex($1), $_ ] }
480 grep { /^([0-9a-fA-F]+)/ and not $seen{$1}++ } @tmp; # XXX doesn't do ranges right
484 my $hextra = sprintf "%04x", $none + 1;
485 $list =~ s/\tXXXX$/\t$hextra/mg;
488 if ($minbits != 1 && $minbits < 32) { # not binary property
490 while ($list =~ /^([0-9a-fA-F]+)(?:[\t]([0-9a-fA-F]+)?)(?:[ \t]([0-9a-fA-F]+))?/mg) {
491 my $min = CORE::hex $1;
492 my $max = defined $2 ? CORE::hex $2 : $min;
493 my $val = defined $3 ? CORE::hex $3 : 0;
494 $val += $max - $min if defined $3;
495 $top = $val if $val > $top;
499 $top > 0xff ? 16 : 8;
500 $bits = $topbits if $bits < $topbits;
505 for my $x ($extras) {
506 my $taint = substr($x,0,0); # maintain taint
508 while ($x =~ /^([^0-9a-fA-F\n])(.*)/mg) {
509 my $char = "$1$taint";
510 my $name = "$2$taint";
511 print STDERR __LINE__, ": char [$char] => name [$name]\n"
513 if ($char =~ /[-+!&]/) {
514 my ($c,$t) = split(/::/, $name, 2); # bogus use of ::, really
517 $subobj = utf8->SWASHNEW($t, "", $minbits, 0);
519 elsif (exists &$name) {
520 $subobj = utf8->SWASHNEW($name, "", $minbits, 0);
522 elsif ($c =~ /^([0-9a-fA-F]+)/) {
523 $subobj = utf8->SWASHNEW("", $c, $minbits, 0);
526 pop @recursed if @recursed && $type;
529 push @extras, $name => $subobj;
530 $bits = $subobj->{BITS} if $bits < $subobj->{BITS};
537 print STDERR __LINE__, ": CLASS = $class, TYPE => $type, BITS => $bits, NONE => $none, INVERT_IT => $invert_it";
538 print STDERR "\nLIST =>\n$list" if defined $list;
539 print STDERR "\nEXTRAS =>\n$extras" if defined $extras;
553 $Cache{$class, $file} = $SWASH;
555 && exists $utf8::SwashInfo{$type}
556 && exists $utf8::SwashInfo{$type}{'specials_name'})
558 my $specials_name = $utf8::SwashInfo{$type}{'specials_name'};
560 print STDERR "\nspecials_name => $SWASH->{'SPECIALS'}\n" if DEBUG;
561 $SWASH->{'SPECIALS'} = \%$specials_name;
563 $SWASH->{'INVERT_IT'} = $invert_it;
566 pop @recursed if @recursed && $type;
572 # Now SWASHGET is recasted into a C function S_swash_get (see utf8.c).