3 # fiddle with @INC iff I am a part of perl dist
4 if ($^X =~ m/\bminiperl$/o){
5 warn "Fixing \@INC for perl core.\n";
6 unshift @INC, qw(../../lib ../../../lib ../../../../lib);
7 $ENV{PATH} .= ';../..;../../..;../../../..' if $^O eq 'MSWin32';
12 my @orig_ARGV = @ARGV;
13 our $VERSION = do { my @r = (q$Revision: 1.1 $ =~ /\d+/g); sprintf "%d."."%02d" x $#r, @r };
16 # These may get re-ordered.
17 # RAW is a do_now as inserted by &enter
18 # AGG is an aggreagated do_now, as built up by &process
33 # (See the algorithm in encengine.c - we're building structures for it)
35 # There are two sorts of structures.
36 # "do_now" (an array, two variants of what needs storing) is whatever we need
37 # to do now we've read an input byte.
38 # It's housed in a "do_next" (which is how we got to it), and in turn points
39 # to a "do_next" which contains all the "do_now"s for the next input byte.
41 # There will be a "do_next" which is the start state.
42 # For a single byte encoding it's the only "do_next" - each "do_now" points
43 # back to it, and each "do_now" will cause bytes. There is no state.
45 # For a multi-byte encoding where all characters in the input are the same
46 # length, then there will be a tree of "do_now"->"do_next"->"do_now"
47 # branching out from the start state, one step for each input byte.
48 # The leaf "do_now"s will all be at the same distance from the start state,
49 # only the leaf "do_now"s cause output bytes, and they in turn point back to
52 # For an encoding where there are varaible length input byte sequences, you
53 # will encounter a leaf "do_now" sooner for the shorter input sequences, but
54 # as before the leaves will point back to the start state.
56 # The system will cope with escape encodings (imagine them as a mostly
57 # self-contained tree for each escape state, and cross links between trees
58 # at the state-switching characters) but so far no input format defines these.
60 # The system will also cope with having output "leaves" in the middle of
61 # the bifurcating branches, not just at the extremities, but again no
62 # input format does this yet.
64 # There are two variants of the "do_now" structure. The first, smaller variant
65 # is generated by &enter as the input file is read. There is one structure
66 # for each input byte. Say we are mapping a single byte encoding to a
67 # single byte encoding, with "ABCD" going "abcd". There will be
68 # 4 "do_now"s, {"A" => [...,"a",...], "B" => [...,"b",...], "C"=>..., "D"=>...}
70 # &process then walks the tree, building aggregate "do_now" structres for
71 # adjacent bytes where possible. The aggregate is for a contiguous range of
72 # bytes which each produce the same length of output, each move to the
73 # same next state, and each have the same fallback flag.
74 # So our 4 RAW "do_now"s above become replaced by a single structure
76 # ["A", "D", "abcd", 1, ...]
77 # ie, for an input byte $_ in "A".."D", output 1 byte, found as
78 # substr ("abcd", (ord $_ - ord "A") * 1, 1)
79 # which maps very nicely into pointer arithmetic in C for encengine.c
83 # UTF-8 encode long hand - only covers part of perl's range
85 # chr() works in native space so convert value from table
86 # into that space before using chr().
87 my $ch = chr(utf8::unicode_to_native($_[0]));
88 # Now get core perl to encode that the way it likes.
96 ## my ($ch,$page) = @_; return chr($ch);
102 # encode double byte MS byte first
103 ## my ($ch,$page) = @_; return chr($page).chr($ch);
104 return chr ($_[1]) . chr $_[0];
109 # encode Multi-byte - single for 0..255 otherwise double
110 ## my ($ch,$page) = @_;
111 ## return &encode_D if $page;
113 return chr ($_[1]) . chr $_[0] if $_[1];
117 my %encode_types = (U => \&encode_U,
123 # Win32 does not expand globs on command line
124 eval "\@ARGV = map(glob(\$_),\@ARGV)" if ($^O eq 'MSWin32');
128 # -Q to disable the duplicate codepoint test
129 # -S make mapping errors fatal
130 # -q to remove comments written to output files
131 # -O to enable the (brute force) substring optimiser
132 # -o <output> to specify the output file name (else it's the first arg)
133 # -f <inlist> to give a file with a list of input files (else use the args)
134 # -n <name> to name the encoding (else use the basename of the input file.
135 getopts('M:SQqOo:f:n:',\%opt);
137 $opt{M} and make_makefile_pl($opt{M}, @ARGV);
139 # This really should go first, else the die here causes empty (non-erroneous)
140 # output files to be written.
142 if (exists $opt{'f'}) {
143 # -F is followed by name of file containing list of filenames
144 my $flist = $opt{'f'};
145 open(FLIST,$flist) || die "Cannot open $flist:$!";
146 chomp(@encfiles = <FLIST>);
152 my $cname = (exists $opt{'o'}) ? $opt{'o'} : shift(@ARGV);
153 chmod(0666,$cname) if -f $cname && !-w $cname;
154 open(C,">$cname") || die "Cannot open $cname:$!";
159 my ($doC,$doEnc,$doUcm,$doPet);
161 if ($cname =~ /\.(c|xs)$/)
164 $dname =~ s/(\.[^\.]*)?$/_def.h/;
165 chmod(0666,$dname) if -f $cname && !-w $dname;
166 open(D,">$dname") || die "Cannot open $dname:$!";
167 $hname =~ s/(\.[^\.]*)?$/.h/;
168 chmod(0666,$hname) if -f $cname && !-w $hname;
169 open(H,">$hname") || die "Cannot open $hname:$!";
171 foreach my $fh (\*C,\*D,\*H)
173 print $fh <<"END" unless $opt{'q'};
175 !!!!!!! DO NOT EDIT THIS FILE !!!!!!!
176 This file was autogenerated by:
182 if ($cname =~ /(\w+)\.xs$/)
184 print C "#include <EXTERN.h>\n";
185 print C "#include <perl.h>\n";
186 print C "#include <XSUB.h>\n";
187 print C "#define U8 U8\n";
189 print C "#include \"encode.h\"\n";
192 elsif ($cname =~ /\.enc$/)
196 elsif ($cname =~ /\.ucm$/)
200 elsif ($cname =~ /\.pet$/)
213 if ($a =~ /^.*-(\d+)/)
216 if ($b =~ /^.*-(\d+)/)
226 foreach my $enc (sort cmp_name @encfiles)
228 my ($name,$sfx) = $enc =~ /^.*?([\w-]+)\.(enc|ucm)$/;
229 $name = $opt{'n'} if exists $opt{'n'};
234 compile_enc(\*E,lc($name));
238 compile_ucm(\*E,lc($name));
243 warn "Cannot open $enc for $name:$!";
249 print STDERR "Writing compiled form\n";
250 foreach my $name (sort cmp_name keys %encoding)
252 my ($e2u,$u2e,$erep,$min_el,$max_el) = @{$encoding{$name}};
253 output(\*C,$name.'_utf8',$e2u);
254 output(\*C,'utf8_'.$name,$u2e);
255 push(@{$encoding{$name}},outstring(\*C,$e2u->{Cname}.'_def',$erep));
257 foreach my $enc (sort cmp_name keys %encoding)
259 my ($e2u,$u2e,$rep,$min_el,$max_el,$rsym) = @{$encoding{$enc}};
260 my @info = ($e2u->{Cname},$u2e->{Cname},$rsym,length($rep),$min_el,$max_el);
261 my $sym = "${enc}_encoding";
263 print C "encode_t $sym = \n";
264 print C " {",join(',',@info,"{\"$enc\",(const char *)0}"),"};\n\n";
267 foreach my $enc (sort cmp_name keys %encoding)
269 my $sym = "${enc}_encoding";
271 print H "extern encode_t $sym;\n";
272 print D " Encode_XSEncoding(aTHX_ &$sym);\n";
275 if ($cname =~ /(\w+)\.xs$/)
281 Encode_XSEncoding(pTHX_ encode_t *enc)
284 HV *stash = gv_stashpv("Encode::XS", TRUE);
285 SV *sv = sv_bless(newRV_noinc(newSViv(PTR2IV(enc))),stash);
291 const char *name = enc->name[i++];
292 XPUSHs(sv_2mortal(newSVpvn(name,strlen(name))));
295 call_pv("Encode::define_encoding",G_DISCARD);
301 print C "\nMODULE = Encode::$mod\tPACKAGE = Encode::$mod\n\n";
302 print C "BOOT:\n{\n";
303 print C "#include \"$dname\"\n";
306 # Close in void context is bad, m'kay
307 close(D) or warn "Error closing '$dname': $!";
308 close(H) or warn "Error closing '$hname': $!";
310 my $perc_saved = $strings/($strings + $saved) * 100;
311 my $perc_subsaved = $strings/($strings + $subsave) * 100;
312 printf STDERR "%d bytes in string tables\n",$strings;
313 printf STDERR "%d bytes (%.3g%%) saved spotting duplicates\n",
314 $saved, $perc_saved if $saved;
315 printf STDERR "%d bytes (%.3g%%) saved using substrings\n",
316 $subsave, $perc_subsaved if $subsave;
320 foreach my $name (sort cmp_name keys %encoding)
322 my ($e2u,$u2e,$erep,$min_el,$max_el) = @{$encoding{$name}};
323 output_enc(\*C,$name,$e2u);
328 foreach my $name (sort cmp_name keys %encoding)
330 my ($e2u,$u2e,$erep,$min_el,$max_el) = @{$encoding{$name}};
331 output_ucm(\*C,$name,$u2e,$erep,$min_el,$max_el);
335 # writing half meg files and then not checking to see if you just filled the
337 close(C) or die "Error closing '$cname': $!";
339 # End of the main program.
351 last if /^\s*CHARMAP\s*$/i;
352 if (/^\s*<(\w+)>\s+"?([^"]*)"?\s*$/i) # " # Grrr
357 if (!defined($cs = $attr{'code_set_name'}))
359 warn "No <code_set_name> in $name\n";
363 $name = $cs unless exists $opt{'n'};
369 if (exists $attr{'subchar'})
372 $attr{'subchar'} =~ /^\s*/cg;
373 push(@byte,$1) while $attr{'subchar'} =~ /\G\\x([0-9a-f]+)/icg;
374 $erep = join('',map(chr(hex($_)),@byte));
376 print "Reading $name ($cs)\n";
382 last if /^\s*END\s+CHARMAP\s*$/i;
386 $u = $1 if (/^<U([0-9a-f]+)>\s+/igc);
387 push(@byte,$1) while /\G\\x([0-9a-f]+)/igc;
388 $fb = $1 if /\G\s*(\|[0-3])/gc;
389 # warn "$_: $u @byte | $fb\n";
390 die "Bad line:$_" unless /\G\s*(#.*)?$/gc;
393 my $uch = encode_U(hex($u));
394 my $ech = join('',map(chr(hex($_)),@byte));
395 my $el = length($ech);
396 $max_el = $el if (!defined($max_el) || $el > $max_el);
397 $min_el = $el if (!defined($min_el) || $el < $min_el);
408 # $fb is fallback flag
409 # 0 - round trip safe
410 # 1 - fallback for unicode -> enc
411 # 2 - skip sub-char mapping
412 # 3 - fallback enc -> unicode
413 enter($u2e,$uch,$ech,$u2e,$fb+0) if ($fb =~ /[01]/);
414 enter($e2u,$ech,$uch,$e2u,$fb+0) if ($fb =~ /[03]/);
423 die "$nfb entries without fallback, $hfb entries with\n";
425 $encoding{$name} = [$e2u,$u2e,$erep,$min_el,$max_el];
437 while ($type = <$fh>)
439 last if $type !~ /^\s*#/;
442 return if $type eq 'E';
443 # Do the hash lookup once, rather than once per function call. 4% speedup.
444 my $type_func = $encode_types{$type};
445 my ($def,$sym,$pages) = split(/\s+/,scalar(<$fh>));
446 warn "$type encoded $name\n";
448 # Save a defined test by setting these to defined values.
449 my $min_el = ~0; # A very big integer
450 my $max_el = 0; # Anything must be longer than 0
453 $rep = &$type_func($v & 0xFF, ($v >> 8) & 0xffe);
457 # use -Q to silence the seen test. Makefile.PL uses this by default.
458 $seen = {} unless $opt{Q};
463 my $page = hex($line);
468 # So why is it 1% faster to leave the my here?
470 $line =~ s/\r\n$/\n/;
471 die "$.:${line}Line should be exactly 65 characters long including
472 newline (".length($line).")" unless length ($line) == 65;
473 # Split line into groups of 4 hex digits, convert groups to ints
475 # map {hex $_} $line =~ /(....)/g
476 # This takes 63.75 (2.5% less time)
477 # unpack "n*", pack "H*", $line
478 # There's an implicit loop in map. Loops are bad, m'kay. Ops are bad, m'kay
479 # Doing it as while ($line =~ /(....)/g) took 74.63
480 foreach my $val (unpack "n*", pack "H*", $line)
482 next if $val == 0xFFFD;
483 my $ech = &$type_func($ch,$page);
484 if ($val || (!$ch && !$page))
486 my $el = length($ech);
487 $max_el = $el if $el > $max_el;
488 $min_el = $el if $el < $min_el;
489 my $uch = encode_U($val);
491 # We're doing the test.
492 # We don't need to read this quickly, so storing it as a scalar,
493 # rather than 3 (anon array, plus the 2 scalars it holds) saves
494 # RAM and may make us faster on low RAM systems. [see __END__]
495 if (exists $seen->{$uch})
497 warn sprintf("U%04X is %02X%02X and %04X\n",
498 $val,$page,$ch,$seen->{$uch});
503 $seen->{$uch} = $page << 8 | $ch;
506 # Passing 2 extra args each time is 3.6% slower!
507 # Even with having to add $fallback ||= 0 later
508 enter_fb0($e2u,$ech,$uch);
509 enter_fb0($u2e,$uch,$ech);
513 # No character at this position
514 # enter($e2u,$ech,undef,$e2u);
520 die "\$min_el=$min_el, \$max_el=$max_el - seems we read no lines"
521 if $min_el > $max_el;
522 die "$errors mapping conflicts\n" if ($errors && $opt{'S'});
523 $encoding{$name} = [$e2u,$u2e,$rep,$min_el,$max_el];
526 # my ($a,$s,$d,$t,$fb) = @_;
528 my ($current,$inbytes,$outbytes,$next,$fallback) = @_;
529 # state we shift to after this (multibyte) input character defaults to same
532 # Making sure it is defined seems to be faster than {no warnings;} in
533 # &process, or passing it in as 0 explicity.
534 # XXX $fallback ||= 0;
536 # Start at the beginning and work forwards through the string to zero.
537 # effectively we are removing 1 character from the front each time
538 # but we don't actually edit the string. [this alone seems to be 14% speedup]
539 # Hence -$pos is the length of the remaining string.
540 my $pos = -length $inbytes;
542 my $byte = substr $inbytes, $pos, 1;
545 # RAW_OUT_BYTES => 2,
547 # to unicode an array would seem to be better, because the pages are dense.
548 # from unicode can be very sparse, favouring a hash.
549 # hash using the bytes (all length 1) as keys rather than ord value,
550 # as it's easier to sort these in &process.
552 # It's faster to always add $fallback even if it's undef, rather than
553 # choosing between 3 and 4 element array. (hence why we set it defined
555 my $do_now = $current->{Raw}{$byte} ||= [{},-$pos,'',$fallback];
556 # When $pos was -1 we were at the last input character.
558 $do_now->[RAW_OUT_BYTES] = $outbytes;
559 $do_now->[RAW_NEXT] = $next;
562 # Tail recursion. The intermdiate state may not have a name yet.
563 $current = $do_now->[RAW_NEXT];
567 # This is purely for optimistation. It's just &enter hard coded for $fallback
568 # of 0, using only a 3 entry array ref to save memory for every entry.
570 my ($current,$inbytes,$outbytes,$next) = @_;
573 my $pos = -length $inbytes;
575 my $byte = substr $inbytes, $pos, 1;
576 my $do_now = $current->{Raw}{$byte} ||= [{},-$pos,''];
578 $do_now->[RAW_OUT_BYTES] = $outbytes;
579 $do_now->[RAW_NEXT] = $next;
582 $current = $do_now->[RAW_NEXT];
589 my ($fh,$name,$s) = @_;
590 my $sym = $strings{$s};
593 $saved += length($s);
598 foreach my $o (keys %strings)
600 next unless (my $i = index($o,$s)) >= 0;
602 # gcc things that 0x0e+0x10 (anything with e+) starts to look like
603 # a hexadecimal floating point constant. Silly gcc. Only p
604 # introduces a floating point constant. Put the space in to stop it
606 $sym .= sprintf(" +0x%02x",$i) if ($i);
607 $subsave += length($s);
608 return $strings{$s} = $sym;
611 $strings{$s} = $sym = $name;
612 $strings += length($s);
613 my $definition = sprintf "static const U8 %s[%d] = { ",$name,length($s);
614 # Maybe we should assert that these are all <256.
615 $definition .= join(',',unpack "C*",$s);
616 # We have a single long line. Split it at convenient commas.
617 $definition =~ s/(.{74,77},)/$1\n/g;
618 print $fh "$definition };\n\n";
629 my ($l, $agg_max_in, $agg_next, $agg_in_len, $agg_out_len, $agg_fallback);
632 foreach my $key (sort keys %$raw) {
635 # RAW_OUT_BYTES => 2,
637 my ($next, $in_len, $out_bytes, $fallback) = @{$raw->{$key}};
638 # Now we are converting from raw to aggregate, switch from 1 byte strings
643 # If this == fails, we're going to reset $agg_max_in below anyway.
644 $b == ++$agg_max_in &&
645 # References in numeric context give the pointer as an int.
646 $agg_next == $next &&
647 $agg_in_len == $in_len &&
648 $agg_out_len == length $out_bytes &&
649 $agg_fallback == $fallback
650 # && length($l->[AGG_OUT_BYTES]) < 16
652 # my $i = ord($b)-ord($l->[AGG_MIN_IN]);
653 # we can aggregate this byte onto the end.
654 $l->[AGG_MAX_IN] = $b;
655 $l->[AGG_OUT_BYTES] .= $out_bytes;
659 # AGG_OUT_BYTES => 2,
664 # Reset the last thing we saw, plus set 5 lexicals to save some derefs.
665 # (only gains .6% on euc-jp -- is it worth it?)
666 push @ent, $l = [$b, $agg_max_in = $b, $out_bytes, $agg_next = $next,
667 $agg_in_len = $in_len, $agg_out_len = length $out_bytes,
668 $agg_fallback = $fallback];
670 if (exists $next->{Cname}) {
671 $next->{'Forward'} = 1 if $next != $a;
673 process(sprintf("%s_%02x",$name,$b),$next);
676 # encengine.c rules say that last entry must be for 255
677 if ($agg_max_in < 255) {
678 push @ent, [1+$agg_max_in, 255,undef,$a,0,0];
680 $a->{'Entries'} = \@ent;
686 my $name = $a->{'Cname'};
688 foreach my $b (@{$a->{'Entries'}})
690 next unless $b->[AGG_OUT_LEN];
691 my $s = $b->[AGG_MIN_IN];
692 my $e = $b->[AGG_MAX_IN];
693 outstring($fh,sprintf("%s__%02x_%02x",$name,$s,$e),$b->[AGG_OUT_BYTES]);
697 print $fh "\nstatic encpage_t $name\[",scalar(@{$a->{'Entries'}}),"];\n";
700 foreach my $b (@{$a->{'Entries'}})
702 my ($s,$e,$out,$t,$end,$l) = @$b;
703 outtable($fh,$t) unless $t->{'Done'};
705 print $fh "\nstatic encpage_t $name\[",scalar(@{$a->{'Entries'}}),"] = {\n";
706 foreach my $b (@{$a->{'Entries'}})
708 my ($sc,$ec,$out,$t,$end,$l,$fb) = @$b;
713 printf $fh outstring($fh,'',$out);
719 print $fh ",",$t->{Cname};
720 printf $fh ",0x%02x,0x%02x,$l,$end},\n",$sc,$ec;
727 my ($fh,$name,$a) = @_;
735 my ($fh,$name,$a) = @_;
736 die "Changed - fix me for new structure";
737 foreach my $b (sort keys %$a)
739 my ($s,$e,$out,$t,$end,$l,$fb) = @{$a->{$b}};
751 my $s = do "unicore/Name.pl";
752 die "char_names: unicore/Name.pl: $!\n" unless defined $s;
754 while ($s =~ /\G([0-9a-f]+)\t([0-9a-f]*)\t(.*?)\s*\n/igc)
758 last if $s >= 0x10000;
759 my $e = length($2) ? hex($2) : $s;
760 for (my $i = $s; $i <= $e; $i++)
763 # print sprintf("U%04X $name\n",$i);
770 my ($cmap,$a,$t,$pre) = @_;
771 # warn sprintf("Page %x\n",$pre);
773 foreach my $key (sort keys %$raw) {
776 # RAW_OUT_BYTES => 2,
778 my ($next, $in_len, $out_bytes, $fallback) = @{$raw->{$key}};
782 if ($next != $a && $next != $t) {
783 output_ucm_page($cmap,$a,$next,(($pre|($u &0x3F)) << 6)&0xFFFF);
784 } elsif (length $out_bytes) {
786 $u = $pre|($u &0x3f);
788 my $s = sprintf "<U%04X> ",$u;
789 #foreach my $c (split(//,$out_bytes)) {
790 # $s .= sprintf "\\x%02X",ord($c);
792 # 9.5% faster changing that loop to this:
793 $s .= sprintf +("\\x%02X" x length $out_bytes), unpack "C*", $out_bytes;
794 $s .= sprintf " |%d # %s\n",($fallback ? 1 : 0),$uname[$u];
797 warn join(',',$u, @{$raw->{$key}},$a,$t);
804 my ($fh,$name,$h,$rep,$min_el,$max_el) = @_;
805 print $fh "# $0 @orig_ARGV\n" unless $opt{'q'};
806 print $fh "<code_set_name> \"$name\"\n";
810 print $fh "<mb_cur_min> $min_el\n";
814 print $fh "<mb_cur_max> $max_el\n";
818 print $fh "<subchar> ";
819 foreach my $c (split(//,$rep))
821 printf $fh "\\x%02X",ord($c);
826 output_ucm_page(\@cmap,$h,$h,0);
827 print $fh "#\nCHARMAP\n";
828 foreach my $line (sort { substr($a,8) cmp substr($b,8) } @cmap)
832 print $fh "END CHARMAP\n";
837 eval { require Encode; };
838 $@ and die "You need to install Encode to use enc2xs -M\nerror: $@\n";
839 eval { require File::Basename; };
840 $@ and die "File::Basename needed. Are you on miniperl?;\nerror: $@\n";
841 File::Basename->import();
842 my $inc = dirname($INC{"Encode/Internal.pm"});
844 my $table_files = join(",", map {qq('$_')} @_);
845 my $now = scalar localtime();
846 open my $fh, ">Makefile.PL" or die "$!";
847 print $fh <<"END_OF_HEADER";
849 # This file is auto-generated by:
855 use ExtUtils::MakeMaker;
857 # Please edit the following to the taste!
860 encode_t => [ $table_files ],
863 # And leave the rest!
869 print $fh <<'END_OF_MAKEFILE_PL';
870 NAME => 'Encode::'.$name,
871 VERSION_FROM => "$name.pm",
872 OBJECT => '$(O_FILES)',
874 COMPRESS => 'gzip -9f',
876 DIST_DEFAULT => 'all tardist',
879 # OS 390 winges about line numbers > 64K ???
880 XSOPT => '-nolinenumbers',
889 my $x = $self->{'OBJ_EXT'};
890 # Add the table O_FILES
891 foreach my $e (keys %tables)
896 $self->{'O_FILES'} = [sort keys %o];
897 my @files = ("$name.xs");
898 $self->{'C'} = ["$name.c"];
899 # $self->{'H'} = [$self->catfile($self->updir,'encode.h')];
901 foreach my $table (keys %tables) {
902 push (@{$self->{'C'}},"$table.c");
903 # Do NOT add $table.h etc. to H_FILES unless we own up as to how they
905 foreach my $ext (qw($(OBJ_EXT) .c .h _def.h .fnm)) {
906 push (@files,$table.$ext);
909 $self->{'XS'} = { "$name.xs" => "$name.c" };
910 $self->{'clean'}{'FILES'} .= join(' ',@files);
911 open(XS,">$name.xs") || die "Cannot open $name.xs:$!";
919 foreach my $table (keys %tables) {
920 print XS qq[#include "${table}.h"\n];
925 Encode_XSEncoding(pTHX_ encode_t *enc)
928 HV *stash = gv_stashpv("Encode::XS", TRUE);
929 SV *sv = sv_bless(newRV_noinc(newSViv(PTR2IV(enc))),stash);
935 const char *name = enc->name[i++];
936 XPUSHs(sv_2mortal(newSVpvn(name,strlen(name))));
939 call_pv("Encode::define_encoding",G_DISCARD);
943 MODULE = Encode::$name PACKAGE = Encode::$name
948 foreach my $table (keys %tables) {
949 print XS qq[#include "${table}_def.h"\n];
953 return "# Built $name.xs\n\n";
959 my $dir = "."; # $self->catdir('Encode');
960 my $str = "# $name\$(OBJ_EXT) depends on .h and _def.h files not .c files - but all written by enc2xs\n";
961 $str .= "$name.c : $name.xs ";
962 foreach my $table (keys %tables)
967 $str .= "$name\$(OBJ_EXT) : $name.c\n\n";
969 foreach my $table (keys %tables)
972 my $lengthsofar = length($str);
973 my $continuator = '';
974 $str .= "$table.c : Makefile.PL";
975 foreach my $file (@{$tables{$table}})
977 $str .= $continuator.' '.$self->catfile($dir,$file);
978 if ( length($str)-$lengthsofar > 128*$numlines )
980 $continuator .= " \\\n\t";
986 $str .= $^O eq 'VMS' # In VMS quote to preserve case
987 ? qq{\n\t\$(PERL) $enc2xs -"Q" -"O" -o \$\@ -f $table.fnm\n\n}
988 : qq{\n\t\$(PERL) $enc2xs -Q -O -o \$\@ -f $table.fnm\n\n};
989 open (FILELIST, ">$table.fnm")
990 || die "Could not open $table.fnm: $!";
991 foreach my $file (@{$tables{$table}})
993 print FILELIST $self->catfile($dir,$file) . "\n";
1001 (my $pm =<<"END_OF_PM") =~ s/^# //gm;
1002 # package Encode::$name;
1003 # our \$VERSION = "0.01";
1007 # XSLoader::load('Encode::$name', \$VERSION);
1014 # Encode::$name - New Encoding
1018 # You got to fill this in!
1026 open $fh, ">$name.pm" or die "$name.pm:$!";
1029 -d 't' or mkdir 't', 0755 or die "mkdir t:$!";
1030 open $fh, ">t/$name.t" or die "t/$name.t:$!";
1031 print $fh <<"END_OF_TEST";
1033 # Adjust the number here!
1034 use Test::More tests => 2;
1037 use_ok('Encode::$name');
1038 # Add more test here!
1048 enc2xs -- Perl Encode Module Generator
1052 enc2xs -M ModName mapfiles...
1057 F<enc2xs> builds a Perl extension for use by Encode from either
1058 Unicode Character Mapping files (.ucm) or Tcl Encoding Files
1059 (.enc) Besides internally used during the build process of Encode
1060 module, you can use F<enc2xs> to add your own encoding to perl. No
1061 knowledge on XS is necessary.
1065 If what you want to know as little about Perl possible but needs to
1066 add a new encoding, just read this chapter and forget the rest.
1072 Have a .ucm file ready. You can get it from somewhere or you can
1073 write your own from scratch or you can grab one from Encode
1074 distribution and customize. For UCM format, see the next Chapter.
1075 In the example below, I'll call my theoretical encoding myascii,
1076 defined inI<my.ucm>. C<$> is a shell prompt.
1083 Issue a command as follows;
1085 $ enc2xs -M My my.ucm
1087 Now take a look at your current directory. It should look like this.
1090 Makefile.PL My.pm my.ucm t/
1092 The following files are created.
1094 Makefle.PL - MakeMaker script
1095 My.pm - Encode Submodule
1100 If you want *.ucm installed together with the modules, do as follows;
1104 $ enc2xs -M My Encode/*ucm
1108 Edit the files generated. You don't have to if you have no time AND no
1109 intention to give it to someone else. But it is a good idea to edit
1110 pod and add more tests.
1114 Now issue a command all Perl Mongers love;
1116 $ perl5.7.3 Makefile.PL
1117 Writing Makefile for Encode::My
1121 Now all you have to do is make.
1124 cp My.pm blib/lib/Encode/My.pm
1125 /usr/local/bin/perl /usr/local/bin/enc2xs -Q -O \
1126 -o encode_t.c -f encode_t.fnm
1127 Reading myascii (myascii)
1128 Writing compiled form
1129 128 bytes in string tables
1130 384 bytes (25%) saved spotting duplicates
1131 1 bytes (99.2%) saved using substrings
1133 chmod 644 blib/arch/auto/Encode/My/My.bs
1136 The time it takes varies how fast your machine is and how large your
1137 encoding is. Unless you are working on something big like euc-tw, it
1138 won't take too long.
1142 You can "make install" already but you should test first.
1145 PERL_DL_NONLAZY=1 /usr/local/bin/perl -Iblib/arch -Iblib/lib \
1146 -e 'use Test::Harness qw(&runtests $verbose); \
1147 $verbose=0; runtests @ARGV;' t/*.t
1149 All tests successful.
1150 Files=1, Tests=2, 0 wallclock secs
1151 ( 0.09 cusr + 0.01 csys = 0.09 CPU)
1155 If you are content with the test result, just "make install"
1159 =head1 The Unicode Character Map
1161 Encode uses The Unicode Character Map (UCM) for source character
1162 mappings. This format is used by ICU package of IBM and adopted by
1163 Nick Ing-Simmons. Since UCM is more flexible than Tcl's Encoding Map
1164 and far more user-friendly, This is the recommended formet for
1167 UCM file looks like this.
1172 <code_set_name> "US-ascii" # Required
1173 <code_set_alias> "ascii" # Optional
1174 <mb_cur_min> 1 # Required; usually 1
1175 <mb_cur_max> 1 # Max. # of bytes/char
1176 <subchar> \x3F # Substitution char
1179 <U0000> \x00 |0 # <control>
1180 <U0001> \x01 |0 # <control>
1181 <U0002> \x02 |0 # <control>
1183 <U007C> \x7C |0 # VERTICAL LINE
1184 <U007D> \x7D |0 # RIGHT CURLY BRACKET
1185 <U007E> \x7E |0 # TILDE
1186 <U007F> \x7F |0 # <control>
1193 Anything that follows C<#> is treated as comments.
1197 The header section continues until CHARMAP. This section Has a form of
1198 I<E<lt>keywordE<gt> value>, one at a line. For a value, strings must
1199 be quoted. Barewords are treated as numbers. I<\xXX> represents a
1202 Most of the keywords are self-explanatory. I<subchar> means
1203 substitution character, not subcharacter. When you decode a Unicode
1204 sequence to this encoding but no matching character is found, the byte
1205 sequence defined here will be used. For most cases, the value here is
1206 \x3F, in ASCII this is a question mark.
1210 CHARMAP starts the character map section. Each line has a form as
1213 <UXXXX> \xXX.. |0 # comment
1215 | | +- Fallback flag
1216 | +-------- Encoded byte sequence
1217 +-------------- Unicode Character ID in hex
1219 The format is roughly the same as a header section except for fallback
1220 flag. It is | followed by 0..3. And their meaning as follows
1226 Round trip safe. A character decoded to Unicode encodes back to the
1227 same byte sequence. most character belong to this.
1231 Fallback for unicode -> encoding. When seen, enc2xs adds this
1232 character for encode map only
1236 Skip sub-char mapping should there be no code point.
1240 Fallback for encoding -> unicode. When seen, enc2xs adds this
1241 character for decode map only
1247 And finally, END OF CHARMAP ends the section.
1251 Needless to say, if you are manually creating a UCM file, you should
1252 copy ascii.ucm or existing encoding which is close to yours than write
1253 your own from scratch.
1255 When you do so, make sure you leave at least B<U0000> to B<U0020> as
1256 is, unless your environment is on EBCDIC.
1258 B<CAVEAT>: not all features in UCM are implemented. For example,
1259 icu:state is not used. Because of that, you need to write a perl
1260 module if you want to support algorithmical encodings, notablly
1261 ISO-2022 series. Such modules include L<Encode::JP::2022_JP>,
1262 L<Encode::KR::2022_KR>, and L<Encode::TW::HZ>.
1267 L<http://oss.software.ibm.com/icu/>
1269 ICU Character Mapping Tables
1270 L<http://oss.software.ibm.com/icu/charset/>
1273 L<http://oss.software.ibm.com/icu/userguide/conversion-data.html>
1283 # -Q to disable the duplicate codepoint test
1284 # -S make mapping errors fatal
1285 # -q to remove comments written to output files
1286 # -O to enable the (brute force) substring optimiser
1287 # -o <output> to specify the output file name (else it's the first arg)
1288 # -f <inlist> to give a file with a list of input files (else use the args)
1289 # -n <name> to name the encoding (else use the basename of the input file.
1291 With %seen holding array refs:
1293 865.66 real 28.80 user 8.79 sys
1294 7904 maximum resident set size
1295 1356 average shared memory size
1296 18566 average unshared data size
1297 229 average unshared stack size
1301 With %seen holding simple scalars:
1303 342.16 real 27.11 user 3.54 sys
1304 8388 maximum resident set size
1305 1394 average shared memory size
1306 14969 average unshared data size
1307 236 average unshared stack size
1311 Yes, 5 minutes is faster than 15. Above is for CP936 in CN. Only difference is
1312 how %seen is storing things its seen. So it is pathalogically bad on a 16M
1313 RAM machine, but it's going to help even on modern machines.
1314 Swapping is bad, m'kay :-)