Linux web0273.sh.tyo1 4.18.0-553.141.2.lve.el7h.x86_64 #1 SMP Wed Jul 8 17:20:31 UTC 2026 x86_64
Apache
: 127.0.0.1 | : 216.73.216.251
Cant Read [ /etc/named.conf ]
8.3.31
r2745769
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
bin /
[ HOME SHELL ]
Name
Size
Permission
Action
GET
14.71
KB
-rwxr-xr-x
[
40.52
KB
-rwxr-xr-x
a2p
105.32
KB
-rwxr-xr-x
aclocal
35.87
KB
-rwxr-xr-x
aclocal-1.13
35.87
KB
-rwxr-xr-x
addr2line
28.42
KB
-rwxr-xr-x
agentxtrap
19.16
KB
-rwxr-xr-x
animate
7.04
KB
-rwxr-xr-x
ar
61.21
KB
-rwxr-xr-x
arch
32.3
KB
-rwxr-xr-x
as
377.37
KB
-rwxr-xr-x
aspell
163.35
KB
-rwxr-xr-x
at
1.01
KB
-rwxr-xr-x
atq
1.01
KB
-rwxr-xr-x
atrm
1.02
KB
-rwxr-xr-x
autoconf
14.42
KB
-rwxr-xr-x
autoheader
8.33
KB
-rwxr-xr-x
autom4te
31.43
KB
-rwxr-xr-x
automake
246.44
KB
-rwxr-xr-x
automake-1.13
246.44
KB
-rwxr-xr-x
autoreconf
20.57
KB
-rwxr-xr-x
autoscan
16.72
KB
-rwxr-xr-x
autoupdate
33.08
KB
-rwxr-xr-x
awk
418.54
KB
-rwxr-xr-x
base64
36.48
KB
-rwxr-xr-x
basename
28.35
KB
-rwxr-xr-x
bash
941.93
KB
-rwxr-xr-x
bashbug-64
6.8
KB
-rwxr-xr-x
batch
137
B
-rwxr-xr-x
bison
393.34
KB
-rwxr-xr-x
bunzip2
31.89
KB
-rwxr-xr-x
byacc
84.48
KB
-rwxr-xr-x
bzcat
31.89
KB
-rwxr-xr-x
bzcmp
2.08
KB
-rwxr-xr-x
bzdiff
2.08
KB
-rwxr-xr-x
bzgrep
1.64
KB
-rwxr-xr-x
bzip2
31.89
KB
-rwxr-xr-x
bzip2recover
15.24
KB
-rwxr-xr-x
bzless
1.23
KB
-rwxr-xr-x
bzmore
1.23
KB
-rwxr-xr-x
c++
754.58
KB
-rwxr-xr-x
c++filt
27.91
KB
-rwxr-xr-x
c2ph
35.75
KB
-rwxr-xr-x
c89
224
B
-rwxr-xr-x
c99
215
B
-rwxr-xr-x
cagefs_enter.proxied
1.03
KB
-rwxr-xr-x
cal
36.8
KB
-rwxr-xr-x
captoinfo
64.26
KB
-rwxr-xr-x
cat
52.81
KB
-rwxr-xr-x
catchsegv
3.26
KB
-rwxr-xr-x
cc
750.58
KB
-rwxr-xr-x
chcon
61.46
KB
-rwxr-xr-x
chgrp
61.32
KB
-rwxr-xr-x
chmod
57.22
KB
-rwxr-xr-x
chown
61.36
KB
-rwxr-xr-x
chrt
32.17
KB
-rwxr-xr-x
cksum
32.38
KB
-rwxr-xr-x
cldetect
10.35
KB
-rwxr-xr-x
clear
7.02
KB
-rwxr-xr-x
clusterdb
53.2
KB
-rwxr-xr-x
cmp
44.21
KB
-rwxr-xr-x
col
23.88
KB
-rwxr-xr-x
colcrt
11.29
KB
-rwxr-xr-x
colrm
23.77
KB
-rwxr-xr-x
column
27.99
KB
-rwxr-xr-x
combinediff
48.7
KB
-rwxr-xr-x
comm
36.55
KB
-rwxr-xr-x
compare
11.09
KB
-rwxr-xr-x
composite
7.04
KB
-rwxr-xr-x
conjure
7.04
KB
-rwxr-xr-x
convert
7.04
KB
-rwxr-xr-x
cp
151.54
KB
-rwxr-xr-x
cpan
4.97
KB
-rwxr-xr-x
cpp
754.58
KB
-rwxr-xr-x
createdb
53.27
KB
-rwxr-xr-x
createlang
57.09
KB
-rwxr-xr-x
createuser
57.63
KB
-rwxr-xr-x
crontab
1.49
KB
-rwxr-xr-x
crontab.cagefs
49.13
KB
-rwxr-xr-x
csplit
48.82
KB
-rwxr-xr-x
ctags
237.98
KB
-rwxr-xr-x
curl
152.99
KB
-rwxr-xr-x
cut
40.61
KB
-rwxr-xr-x
cwebp
43.29
KB
-rwxr-xr-x
date
60.74
KB
-rwxr-xr-x
dbiprof
6.15
KB
-rwxr-xr-x
dbiproxy
5.35
KB
-rwxr-xr-x
dd
73.14
KB
-rwxr-xr-x
dehtmldiff
1.32
KB
-rwxr-xr-x
delv
39.98
KB
-rwxr-xr-x
df
102.55
KB
-rwxr-xr-x
diff
195.53
KB
-rwxr-xr-x
diff3
60.74
KB
-rwxr-xr-x
dig
146.97
KB
-rwxr-xr-x
dir
114.85
KB
-rwxr-xr-x
dircolors
40.44
KB
-rwxr-xr-x
dirname
28.31
KB
-rwxr-xr-x
display
7.04
KB
-rwxr-xr-x
dltest
11.05
KB
-rwxr-xr-x
dropdb
53.08
KB
-rwxr-xr-x
droplang
57.09
KB
-rwxr-xr-x
dropuser
53.05
KB
-rwxr-xr-x
du
110.34
KB
-rwxr-xr-x
dvipdf
1
KB
-rwxr-xr-x
dwebp
19.05
KB
-rwxr-xr-x
echo
32.31
KB
-rwxr-xr-x
ed
48.68
KB
-rwxr-xr-x
editdiff
2
KB
-rwxr-xr-x
egrep
290
B
-rwxr-xr-x
enc2xs
38.24
KB
-rwxr-xr-x
enchant
15.29
KB
-rwxr-xr-x
enchant-lsmod
11.13
KB
-rwxr-xr-x
env
28.33
KB
-rwxr-xr-x
eps2eps
639
B
-rwxr-xr-x
eqn
144.41
KB
-rwxr-xr-x
espdiff
1.53
KB
-rwxr-xr-x
ex
906.3
KB
-rwxr-xr-x
expand
32.48
KB
-rwxr-xr-x
expr
36.53
KB
-rwxr-xr-x
f95
754.58
KB
-rwxr-xr-x
factor
93.29
KB
-rwxr-xr-x
false
28.26
KB
-rwxr-xr-x
fc-cache
132
B
-rwxr-xr-x
fc-cache-64
15.45
KB
-rwxr-xr-x
fc-cat
15.4
KB
-rwxr-xr-x
fc-conflist
11.2
KB
-rwxr-xr-x
fc-list
11.26
KB
-rwxr-xr-x
fc-match
11.32
KB
-rwxr-xr-x
fc-pattern
11.26
KB
-rwxr-xr-x
fc-query
11.22
KB
-rwxr-xr-x
fc-scan
11.27
KB
-rwxr-xr-x
fc-validate
11.27
KB
-rwxr-xr-x
fgrep
290
B
-rwxr-xr-x
file
19.3
KB
-rwxr-xr-x
filterdiff
45.2
KB
-rwxr-xr-x
find
194.63
KB
-rwxr-xr-x
find2perl
23.06
KB
-rwxr-xr-x
fixcvsdiff
1.83
KB
-rwxr-xr-x
flex
318.07
KB
-rwxr-xr-x
flex++
318.07
KB
-rwxr-xr-x
flipdiff
48.7
KB
-rwxr-xr-x
flock
23.88
KB
-rwxr-xr-x
fmt
36.48
KB
-rwxr-xr-x
fold
36.46
KB
-rwxr-xr-x
free
19.33
KB
-rwxr-xr-x
funzip
31.38
KB
-rwxr-xr-x
g++
754.58
KB
-rwxr-xr-x
gawk
418.54
KB
-rwxr-xr-x
gcc
750.58
KB
-rwxr-xr-x
gcc-ar
26.45
KB
-rwxr-xr-x
gcc-nm
26.45
KB
-rwxr-xr-x
gcc-ranlib
26.45
KB
-rwxr-xr-x
gcov
311.45
KB
-rwxr-xr-x
gencat
22.11
KB
-rwxr-xr-x
geoiplookup
15.28
KB
-rwxr-xr-x
geoiplookup6
11.16
KB
-rwxr-xr-x
geqn
144.41
KB
-rwxr-xr-x
getconf
22.03
KB
-rwxr-xr-x
getent
26.39
KB
-rwxr-xr-x
getopt
15.38
KB
-rwxr-xr-x
gfortran
754.58
KB
-rwxr-xr-x
ghostscript
10.97
KB
-rwxr-xr-x
gif2webp
19.05
KB
-rwxr-xr-x
git
1.46
MB
-rwxr-xr-x
git-receive-pack
1.46
MB
-rwxr-xr-x
git-shell
717.95
KB
-rwxr-xr-x
git-upload-archive
1.46
MB
-rwxr-xr-x
git-upload-pack
791.44
KB
-rwxr-xr-x
gm
6.97
KB
-rwxr-xr-x
gmake
178.47
KB
-rwxr-xr-x
gneqn
271
B
-rwxr-xr-x
gnroff
3.31
KB
-rwxr-xr-x
gpg
732.4
KB
-rwxr-xr-x
gpg-agent
289.74
KB
-rwxr-xr-x
gpg-error
23.18
KB
-rwxr-xr-x
gpg-zip
3.23
KB
-rwxr-xr-x
gpg2
732.4
KB
-rwxr-xr-x
gpgsplit
48.88
KB
-rwxr-xr-x
gpgv
345.38
KB
-rwxr-xr-x
gpgv2
345.38
KB
-rwxr-xr-x
gpic
180.41
KB
-rwxr-xr-x
gprof
98.41
KB
-rwxr-xr-x
grep
155.3
KB
-rwxr-xr-x
grepdiff
45.2
KB
-rwxr-xr-x
groff
81.63
KB
-rwxr-xr-x
grops
140.85
KB
-rwxr-xr-x
grotty
98.59
KB
-rwxr-xr-x
groups
32.41
KB
-rwxr-xr-x
gs
10.97
KB
-rwxr-xr-x
gsbj
350
B
-rwxr-xr-x
gsdj
352
B
-rwxr-xr-x
gsdj500
352
B
-rwxr-xr-x
gslj
353
B
-rwxr-xr-x
gslp
350
B
-rwxr-xr-x
gsnd
277
B
-rwxr-xr-x
gsoelim
32.59
KB
-rwxr-xr-x
gtar
338.02
KB
-rwxr-xr-x
gtbl
115.96
KB
-rwxr-xr-x
gtroff
512.96
KB
-rwxr-xr-x
gunzip
2.2
KB
-rwxr-xr-x
gzexe
5.79
KB
-rwxr-xr-x
gzip
98.44
KB
-rwxr-xr-x
h2ph
27.65
KB
-rwxr-xr-x
h2xs
59.15
KB
-rwxr-xr-x
head
40.5
KB
-rwxr-xr-x
hexdump
32.02
KB
-rwxr-xr-x
host
127.02
KB
-rwxr-xr-x
hostid
28.3
KB
-rwxr-xr-x
hostname
15.41
KB
-rwxr-xr-x
hunspell
53.11
KB
-rwxr-xr-x
iconv
58.14
KB
-rwxr-xr-x
id
36.52
KB
-rwxr-xr-x
identify
7.06
KB
-rwxr-xr-x
idn
32.45
KB
-rwxr-xr-x
ifnames
4.03
KB
-rwxr-xr-x
igawk
3.11
KB
-rwxr-xr-x
import
7.04
KB
-rwxr-xr-x
infocmp
56.07
KB
-rwxr-xr-x
infotocap
64.26
KB
-rwxr-xr-x
install
139.64
KB
-rwxr-xr-x
instmodsh
4.15
KB
-rwxr-xr-x
interdiff
48.7
KB
-rwxr-xr-x
ionice
23.87
KB
-rwxr-xr-x
ipcrm
27.85
KB
-rwxr-xr-x
ipcs
48.36
KB
-rwxr-xr-x
isosize
23.83
KB
-rwxr-xr-x
ispell
988
B
-rwxr-xr-x
isql
31.69
KB
-rwxr-xr-x
iusql
23.61
KB
-rwxr-xr-x
join
48.75
KB
-rwxr-xr-x
kill
32.82
KB
-rwxr-xr-x
ld
982.58
KB
-rwxr-xr-x
ld.bfd
982.58
KB
-rwxr-xr-x
ldd
5.18
KB
-rwxr-xr-x
less
154.53
KB
-rwxr-xr-x
lessecho
11.11
KB
-rwxr-xr-x
lesskey
16.66
KB
-rwxr-xr-x
lesspipe.sh
2.24
KB
-rwxr-xr-x
lex
318.07
KB
-rwxr-xr-x
libnetcfg
15.36
KB
-rwxr-xr-x
libtool
314.04
KB
-rwxr-xr-x
libtoolize
76.8
KB
-rwxr-xr-x
link
28.3
KB
-rwxr-xr-x
ln
57.22
KB
-rwxr-xr-x
locale
37.11
KB
-rwxr-xr-x
localedef
318.31
KB
-rwxr-xr-x
logger
28.63
KB
-rwxr-xr-x
login
36.38
KB
-rwxr-xr-x
logname
28.31
KB
-rwxr-xr-x
look
11.27
KB
-rwxr-xr-x
lprsetup.sh
5.34
KB
-rwxr-xr-x
ls
114.85
KB
-rwxr-xr-x
lsdiff
45.2
KB
-rwxr-xr-x
lspgpot
1.06
KB
-rwxr-xr-x
lzma
73.61
KB
-rwxr-xr-x
m4
151.17
KB
-rwxr-xr-x
make
178.47
KB
-rwxr-xr-x
mcookie
15.44
KB
-rwxr-xr-x
md5sum
40.53
KB
-rwxr-xr-x
mdig
44.2
KB
-rwxr-xr-x
mesg
10.98
KB
-rwxr-xr-x
mkdir
77.9
KB
-rwxr-xr-x
mkfifo
61.58
KB
-rwxr-xr-x
mknod
65.61
KB
-rwxr-xr-x
mktemp
40.66
KB
-rwxr-xr-x
mogrify
7.04
KB
-rwxr-xr-x
montage
7.04
KB
-rwxr-xr-x
more
40.15
KB
-rwxr-xr-x
mv
127.3
KB
-rwxr-xr-x
my_print_defaults
6
MB
-rwxr-xr-x
mysql
7.15
MB
-rwxr-xr-x
mysql_config
5.11
KB
-rwxr-xr-x
mysqladmin
6.82
MB
-rwxr-xr-x
mysqlbinlog
7.12
MB
-rwxr-xr-x
mysqlcheck
6.84
MB
-rwxr-xr-x
mysqldump
6.9
MB
-rwxr-xr-x
mysqlimport
6.81
MB
-rwxr-xr-x
mysqlshow
6.81
MB
-rwxr-xr-x
namei
27.95
KB
-rwxr-xr-x
neqn
271
B
-rwxr-xr-x
net-snmp-create-v3-user
2.98
KB
-rwxr-xr-x
nice
32.32
KB
-rwxr-xr-x
nkf
266.84
KB
-rwxr-xr-x
nl
40.59
KB
-rwxr-xr-x
nm
41.4
KB
-rwxr-xr-x
nohup
32.42
KB
-rwxr-xr-x
nproc
32.37
KB
-rwxr-xr-x
nroff
3.31
KB
-rwxr-xr-x
nslookup
130.94
KB
-rwxr-xr-x
nsupdate
65.2
KB
-rwxr-xr-x
numfmt
64.71
KB
-rwxr-xr-x
objcopy
227.33
KB
-rwxr-xr-x
objdump
357.69
KB
-rwxr-xr-x
od
64.81
KB
-rwxr-xr-x
odbc_config
11.04
KB
-rwxr-xr-x
odbcinst
27.69
KB
-rwxr-xr-x
openssl
542.27
KB
-rwxr-xr-x
pango-list
11.1
KB
-rwxr-xr-x
pango-querymodules-64
28.26
KB
-rwxr-xr-x
pango-view
49.47
KB
-rwxr-xr-x
passwd
1.02
KB
-rwxr-xr-x
paste
32.34
KB
-rwxr-xr-x
patch
147
KB
-rwxr-xr-x
pathchk
32.31
KB
-rwxr-xr-x
pdf2dsc
698
B
-rwxr-xr-x
pdf2ps
909
B
-rwxr-xr-x
perl
11.14
KB
-rwxr-xr-x
perl.clean
462
B
-rwxr-xr-x
perl.prov
6.03
KB
-rwxr-xr-x
perl.prov.files
1014
B
-rwxr-xr-x
perl.req
10.56
KB
-rwxr-xr-x
perl.req.files
1.17
KB
-rwxr-xr-x
perl5.16.3
11.14
KB
-rwxr-xr-x
perl5i
11.2
KB
-rwxr-xr-x
perlbug
43.61
KB
-rwxr-xr-x
perlcritic
41.53
KB
-rwxr-xr-x
perldepgentest
4.03
KB
-rwxr-xr-x
perldl
39.58
KB
-rwxr-xr-x
perldoc
203
B
-rwxr-xr-x
perlindex
19.3
KB
-rwxr-xr-x
perlivp
10.52
KB
-rwxr-xr-x
perlsh
11.9
KB
-rwxr-xr-x
perlthanks
43.61
KB
-rwxr-xr-x
perltidy
114.19
KB
-rwxr-xr-x
perlver
10.28
KB
-rwxr-xr-x
pf2afm
498
B
-rwxr-xr-x
pfbtopfa
516
B
-rwxr-xr-x
pg_dump
305.75
KB
-rwxr-xr-x
pg_dumpall
73.89
KB
-rwxr-xr-x
pg_restore
126.79
KB
-rwxr-xr-x
pgawk
418.63
KB
-rwxr-xr-x
pgrep
27.67
KB
-rwxr-xr-x
php
6.09
MB
-rwxr-xr-x
php-cgi
6.09
MB
-rwxr-xr-x
php-config
4.42
KB
-rwxr-xr-x
phpize
4.65
KB
-rwxr-xr-x
pic
180.41
KB
-rwxr-xr-x
piconv
7.99
KB
-rwxr-xr-x
pinentry
2.54
KB
-rwxr-xr-x
pinentry-curses
49.19
KB
-rwxr-xr-x
ping
1.02
KB
-rwxr-xr-x
pinky
36.58
KB
-rwxr-xr-x
pkg-config
44.38
KB
-rwxr-xr-x
pkill
27.67
KB
-rwxr-xr-x
pl2pm
4.42
KB
-rwxr-xr-x
pmap
27.61
KB
-rwxr-xr-x
pod2html
4
KB
-rwxr-xr-x
pod2latex
10.1
KB
-rwxr-xr-x
pod2man
13.26
KB
-rwxr-xr-x
pod2text
10.75
KB
-rwxr-xr-x
pod2usage
3.67
KB
-rwxr-xr-x
podchecker
3.7
KB
-rwxr-xr-x
podselect
2.55
KB
-rwxr-xr-x
post-grohtml
187.55
KB
-rwxr-xr-x
pphs
404
B
-rwxr-xr-x
pr
65.11
KB
-rwxr-xr-x
pre-grohtml
86.24
KB
-rwxr-xr-x
precat
5.52
KB
-rwxr-xr-x
preunzip
5.52
KB
-rwxr-xr-x
prezip
5.52
KB
-rwxr-xr-x
prezip-bin
11.05
KB
-rwxr-xr-x
printafm
395
B
-rwxr-xr-x
printenv
28.29
KB
-rwxr-xr-x
printf
48.61
KB
-rwxr-xr-x
prove
13.13
KB
-rwxr-xr-x
ps
97.77
KB
-rwxr-xr-x
ps2ascii
631
B
-rwxr-xr-x
ps2epsi
2.69
KB
-rwxr-xr-x
ps2pdf
272
B
-rwxr-xr-x
ps2pdf12
215
B
-rwxr-xr-x
ps2pdf13
215
B
-rwxr-xr-x
ps2pdf14
215
B
-rwxr-xr-x
ps2pdfwr
1.07
KB
-rwxr-xr-x
ps2ps
647
B
-rwxr-xr-x
ps2ps2
669
B
-rwxr-xr-x
psed
52.08
KB
-rwxr-xr-x
psql
438.74
KB
-rwxr-xr-x
pstruct
35.75
KB
-rwxr-xr-x
ptx
65.09
KB
-rwxr-xr-x
pwd
32.45
KB
-rwxr-xr-x
pwdx
11.27
KB
-rwxr-xr-x
pydoc
78
B
-rwxr-xr-x
python
6.98
KB
-rwxr-xr-x
python2
6.98
KB
-rwxr-xr-x
python2.7
6.98
KB
-rwxr-xr-x
ranlib
61.22
KB
-rwxr-xr-x
raw
15.27
KB
-rwxr-xr-x
readelf
505.77
KB
-rwxr-xr-x
readlink
40.82
KB
-rwxr-xr-x
realpath
61.23
KB
-rwxr-xr-x
recode
39.87
KB
-rwxr-xr-x
recountdiff
3.36
KB
-rwxr-xr-x
red
89
B
-rwxr-xr-x
rediff
36.04
KB
-rwxr-xr-x
reindexdb
57.27
KB
-rwxr-xr-x
rename
11.26
KB
-rwxr-xr-x
renice
11.2
KB
-rwxr-xr-x
replace
3.48
MB
-rwxr-xr-x
reset
19.6
KB
-rwxr-xr-x
rev
11.26
KB
-rwxr-xr-x
rm
61.4
KB
-rwxr-xr-x
rmdir
44.46
KB
-rwxr-xr-x
rpcgen
90.45
KB
-rwxr-xr-x
rsync
484.2
KB
-rwxr-xr-x
run-with-aspell
85
B
-rwxr-xr-x
runcon
32.47
KB
-rwxr-xr-x
rvi
906.3
KB
-rwxr-xr-x
rview
906.3
KB
-rwxr-xr-x
rvim
2.23
MB
-rwxr-xr-x
s2p
52.08
KB
-rwxr-xr-x
scl
19.5
KB
-rwxr-xr-x
scl_enabled
258
B
-rwxr-xr-x
scl_source
1.83
KB
-rwxr-xr-x
scp
89.24
KB
-rwxr-xr-x
script
19.61
KB
-rwxr-xr-x
sdiff
48.48
KB
-rwxr-xr-x
sed
74.29
KB
-rwxr-xr-x
selectorctl
7.63
KB
-rwxr-xr-x
seq
48.47
KB
-rwxr-xr-x
setsid
11.23
KB
-rwxr-xr-x
setterm
27.48
KB
-rwxr-xr-x
sftp
142.02
KB
-rwxr-xr-x
sh
941.93
KB
-rwxr-xr-x
sha1sum
36.57
KB
-rwxr-xr-x
sha224sum
40.63
KB
-rwxr-xr-x
sha256sum
40.63
KB
-rwxr-xr-x
sha384sum
40.65
KB
-rwxr-xr-x
sha512sum
40.65
KB
-rwxr-xr-x
shred
52.94
KB
-rwxr-xr-x
shuf
49.13
KB
-rwxr-xr-x
size
32.36
KB
-rwxr-xr-x
skill
23.62
KB
-rwxr-xr-x
slabtop
19.52
KB
-rwxr-xr-x
sleep
32.35
KB
-rwxr-xr-x
slogin
756.41
KB
-rwxr-xr-x
snice
23.62
KB
-rwxr-xr-x
snmpconf
25.52
KB
-rwxr-xr-x
soelim
32.59
KB
-rwxr-xr-x
sort
114.95
KB
-rwxr-xr-x
spell
122
B
-rwxr-xr-x
splain
18.03
KB
-rwxr-xr-x
split
69.47
KB
-rwxr-xr-x
splitdiff
3.11
KB
-rwxr-xr-x
sprof
22.1
KB
-rwxr-xr-x
sqlite3
54.95
KB
-rwxr-xr-x
ssh
756.41
KB
-rwxr-xr-x
ssh-add
352.46
KB
-rwxr-xr-x
ssh-agent
373.26
KB
---x--x--x
ssh-copy-id
10.22
KB
-rwxr-xr-x
ssh-keygen
409.38
KB
-rwxr-xr-x
ssh-keyscan
430.69
KB
-rwxr-xr-x
stat
77.19
KB
-rwxr-xr-x
stdbuf
64.88
KB
-rwxr-xr-x
strace
1009.21
KB
-rwxr-xr-x
stream
7.04
KB
-rwxr-xr-x
strings
28.43
KB
-rwxr-xr-x
strip
227.32
KB
-rwxr-xr-x
stty
68.61
KB
-rwxr-xr-x
sum
36.55
KB
-rwxr-xr-x
svn
232.45
KB
-rwxr-xr-x
sync
28.33
KB
-rwxr-xr-x
tabs
15.31
KB
-rwxr-xr-x
tac
32.48
KB
-rwxr-xr-x
tail
65.26
KB
-rwxr-xr-x
tailf
23.88
KB
-rwxr-xr-x
tar
338.02
KB
-rwxr-xr-x
taskset
32.22
KB
-rwxr-xr-x
tbl
115.96
KB
-rwxr-xr-x
tclsh
7
KB
-rwxr-xr-x
tclsh8.5
7
KB
-rwxr-xr-x
tee
32.38
KB
-rwxr-xr-x
test
36.46
KB
-rwxr-xr-x
tic
64.26
KB
-rwxr-xr-x
time
15.55
KB
-rwxr-xr-x
timeout
53.31
KB
-rwxr-xr-x
tload
15.38
KB
-rwxr-xr-x
tmpwatch
27.87
KB
-rwxr-xr-x
toe
15.43
KB
-rwxr-xr-x
top
104.38
KB
-rwxr-xr-x
touch
61.02
KB
-rwxr-xr-x
tput
15.41
KB
-rwxr-xr-x
tr
44.61
KB
-rwxr-xr-x
traceroute
61.86
KB
-rwxr-xr-x
troff
512.96
KB
-rwxr-xr-x
true
28.26
KB
-rwxr-xr-x
truncate
52.67
KB
-rwxr-xr-x
tset
19.6
KB
-rwxr-xr-x
tsort
36.47
KB
-rwxr-xr-x
tty
28.29
KB
-rwxr-xr-x
tzselect
7.17
KB
-rwxr-xr-x
ul
19.47
KB
-rwxr-xr-x
uname
32.3
KB
-rwxr-xr-x
unexpand
32.45
KB
-rwxr-xr-x
uniq
44.71
KB
-rwxr-xr-x
unix-lpr.sh
4.07
KB
-rwxr-xr-x
unlink
28.3
KB
-rwxr-xr-x
unwrapdiff
5.8
KB
-rwxr-xr-x
unzip
181.16
KB
-rwxr-xr-x
unzipsfx
88.64
KB
-rwxr-xr-x
uptime
11.22
KB
-rwxr-xr-x
users
32.42
KB
-rwxr-xr-x
utmpdump
15.45
KB
-rwxr-xr-x
uudecode
103.99
KB
-rwxr-xr-x
uuencode
103.98
KB
-rwxr-xr-x
vacuumdb
57.35
KB
-rwxr-xr-x
vdir
114.85
KB
-rwxr-xr-x
vi
906.3
KB
-rwxr-xr-x
view
906.3
KB
-rwxr-xr-x
vim
2.23
MB
-rwxr-xr-x
vimdiff
2.23
MB
-rwxr-xr-x
vimtutor
2.04
KB
-rwxr-xr-x
vmstat
31.48
KB
-rwxr-xr-x
watch
24.14
KB
-rwxr-xr-x
wc
40.67
KB
-rwxr-xr-x
webpmux
27.14
KB
-rwxr-xr-x
wget
408.96
KB
-rwxr-xr-x
whereis
20.2
KB
-rwxr-xr-x
which
23.77
KB
-rwxr-xr-x
who
48.7
KB
-rwxr-xr-x
whoami
28.3
KB
-rwxr-xr-x
word-list-compress
11.03
KB
-rwxr-xr-x
x86_64-redhat-linux-c++
754.58
KB
-rwxr-xr-x
x86_64-redhat-linux-g++
754.58
KB
-rwxr-xr-x
x86_64-redhat-linux-gcc
750.58
KB
-rwxr-xr-x
xargs
60.91
KB
-rwxr-xr-x
xmlcatalog
15.3
KB
-rwxr-xr-x
xmllint
61.94
KB
-rwxr-xr-x
xmlwf
24
KB
-rwxr-xr-x
xsltproc
23.5
KB
-rwxr-xr-x
xsubpp
4.45
KB
-rwxr-xr-x
xxd
14.42
KB
-rwxr-xr-x
xz
73.61
KB
-rwxr-xr-x
yacc
84.48
KB
-rwxr-xr-x
yes
28.3
KB
-rwxr-xr-x
zcat
1.9
KB
-rwxr-xr-x
zcmp
1.72
KB
-rwxr-xr-x
zdiff
5.63
KB
-rwxr-xr-x
zegrep
123
B
-rwxr-xr-x
zfgrep
123
B
-rwxr-xr-x
zforce
2.09
KB
-rwxr-xr-x
zgrep
5.99
KB
-rwxr-xr-x
zip
210.78
KB
-rwxr-xr-x
zipcloak
98.1
KB
-rwxr-xr-x
zipgrep
2.88
KB
-rwxr-xr-x
zipinfo
181.16
KB
-rwxr-xr-x
zipnote
93.73
KB
-rwxr-xr-x
zipsplit
97.75
KB
-rwxr-xr-x
zless
1.99
KB
-rwxr-xr-x
zmore
2.79
KB
-rwxr-xr-x
znew
5.22
KB
-rwxr-xr-x
zsh
723.13
KB
-rwxr-xr-x
zsoelim
32.59
KB
-rwxr-xr-x
Delete
Unzip
Zip
${this.title}
Close
Code Editor : enc2xs
#!/usr/bin/perl eval 'exec /usr/bin/perl -S $0 ${1+"$@"}' if 0; # not running under some shell BEGIN { # @INC poking no longer needed w/ new MakeMaker and Makefile.PL's # with $ENV{PERL_CORE} set # In case we need it in future... require Config; import Config; } use strict; use warnings; use Getopt::Std; use Config; my @orig_ARGV = @ARGV; our $VERSION = do { my @r = (q$Revision: 2.7 $ =~ /\d+/g); sprintf "%d."."%02d" x $#r, @r }; # These may get re-ordered. # RAW is a do_now as inserted by &enter # AGG is an aggreagated do_now, as built up by &process use constant { RAW_NEXT => 0, RAW_IN_LEN => 1, RAW_OUT_BYTES => 2, RAW_FALLBACK => 3, AGG_MIN_IN => 0, AGG_MAX_IN => 1, AGG_OUT_BYTES => 2, AGG_NEXT => 3, AGG_IN_LEN => 4, AGG_OUT_LEN => 5, AGG_FALLBACK => 6, }; # (See the algorithm in encengine.c - we're building structures for it) # There are two sorts of structures. # "do_now" (an array, two variants of what needs storing) is whatever we need # to do now we've read an input byte. # It's housed in a "do_next" (which is how we got to it), and in turn points # to a "do_next" which contains all the "do_now"s for the next input byte. # There will be a "do_next" which is the start state. # For a single byte encoding it's the only "do_next" - each "do_now" points # back to it, and each "do_now" will cause bytes. There is no state. # For a multi-byte encoding where all characters in the input are the same # length, then there will be a tree of "do_now"->"do_next"->"do_now" # branching out from the start state, one step for each input byte. # The leaf "do_now"s will all be at the same distance from the start state, # only the leaf "do_now"s cause output bytes, and they in turn point back to # the start state. # For an encoding where there are varaible length input byte sequences, you # will encounter a leaf "do_now" sooner for the shorter input sequences, but # as before the leaves will point back to the start state. # The system will cope with escape encodings (imagine them as a mostly # self-contained tree for each escape state, and cross links between trees # at the state-switching characters) but so far no input format defines these. # The system will also cope with having output "leaves" in the middle of # the bifurcating branches, not just at the extremities, but again no # input format does this yet. # There are two variants of the "do_now" structure. The first, smaller variant # is generated by &enter as the input file is read. There is one structure # for each input byte. Say we are mapping a single byte encoding to a # single byte encoding, with "ABCD" going "abcd". There will be # 4 "do_now"s, {"A" => [...,"a",...], "B" => [...,"b",...], "C"=>..., "D"=>...} # &process then walks the tree, building aggregate "do_now" structres for # adjacent bytes where possible. The aggregate is for a contiguous range of # bytes which each produce the same length of output, each move to the # same next state, and each have the same fallback flag. # So our 4 RAW "do_now"s above become replaced by a single structure # containing: # ["A", "D", "abcd", 1, ...] # ie, for an input byte $_ in "A".."D", output 1 byte, found as # substr ("abcd", (ord $_ - ord "A") * 1, 1) # which maps very nicely into pointer arithmetic in C for encengine.c sub encode_U { # UTF-8 encode long hand - only covers part of perl's range ## my $uv = shift; # chr() works in native space so convert value from table # into that space before using chr(). my $ch = chr(utf8::unicode_to_native($_[0])); # Now get core perl to encode that the way it likes. utf8::encode($ch); return $ch; } sub encode_S { # encode single byte ## my ($ch,$page) = @_; return chr($ch); return chr $_[0]; } sub encode_D { # encode double byte MS byte first ## my ($ch,$page) = @_; return chr($page).chr($ch); return chr ($_[1]) . chr $_[0]; } sub encode_M { # encode Multi-byte - single for 0..255 otherwise double ## my ($ch,$page) = @_; ## return &encode_D if $page; ## return &encode_S; return chr ($_[1]) . chr $_[0] if $_[1]; return chr $_[0]; } my %encode_types = (U => \&encode_U, S => \&encode_S, D => \&encode_D, M => \&encode_M, ); # Win32 does not expand globs on command line eval "\@ARGV = map(glob(\$_),\@ARGV)" if ($^O eq 'MSWin32'); my %opt; # I think these are: # -Q to disable the duplicate codepoint test # -S make mapping errors fatal # -q to remove comments written to output files # -O to enable the (brute force) substring optimiser # -o <output> to specify the output file name (else it's the first arg) # -f <inlist> to give a file with a list of input files (else use the args) # -n <name> to name the encoding (else use the basename of the input file. getopts('CM:SQqOo:f:n:',\%opt); $opt{M} and make_makefile_pl($opt{M}, @ARGV); $opt{C} and make_configlocal_pm($opt{C}, @ARGV); # This really should go first, else the die here causes empty (non-erroneous) # output files to be written. my @encfiles; if (exists $opt{'f'}) { # -F is followed by name of file containing list of filenames my $flist = $opt{'f'}; open(FLIST,$flist) || die "Cannot open $flist:$!"; chomp(@encfiles = <FLIST>); close(FLIST); } else { @encfiles = @ARGV; } my $cname = (exists $opt{'o'}) ? $opt{'o'} : shift(@ARGV); chmod(0666,$cname) if -f $cname && !-w $cname; open(C,">$cname") || die "Cannot open $cname:$!"; my $dname = $cname; my $hname = $cname; my ($doC,$doEnc,$doUcm,$doPet); if ($cname =~ /\.(c|xs)$/i) # VMS may have upcased filenames with DECC$ARGV_PARSE_STYLE defined { $doC = 1; $dname =~ s/(\.[^\.]*)?$/.exh/; chmod(0666,$dname) if -f $cname && !-w $dname; open(D,">$dname") || die "Cannot open $dname:$!"; $hname =~ s/(\.[^\.]*)?$/.h/; chmod(0666,$hname) if -f $cname && !-w $hname; open(H,">$hname") || die "Cannot open $hname:$!"; foreach my $fh (\*C,\*D,\*H) { print $fh <<"END" unless $opt{'q'}; /* !!!!!!! DO NOT EDIT THIS FILE !!!!!!! This file was autogenerated by: $^X $0 @orig_ARGV enc2xs VERSION $VERSION */ END } if ($cname =~ /(\w+)\.xs$/) { print C "#include <EXTERN.h>\n"; print C "#include <perl.h>\n"; print C "#include <XSUB.h>\n"; print C "#define U8 U8\n"; } print C "#include \"encode.h\"\n\n"; } elsif ($cname =~ /\.enc$/) { $doEnc = 1; } elsif ($cname =~ /\.ucm$/) { $doUcm = 1; } elsif ($cname =~ /\.pet$/) { $doPet = 1; } my %encoding; my %strings; my $string_acc; my %strings_in_acc; my $saved = 0; my $subsave = 0; my $strings = 0; sub cmp_name { if ($a =~ /^.*-(\d+)/) { my $an = $1; if ($b =~ /^.*-(\d+)/) { my $r = $an <=> $1; return $r if $r; } } return $a cmp $b; } foreach my $enc (sort cmp_name @encfiles) { my ($name,$sfx) = $enc =~ /^.*?([\w-]+)\.(enc|ucm)$/; $name = $opt{'n'} if exists $opt{'n'}; if (open(E,$enc)) { if ($sfx eq 'enc') { compile_enc(\*E,lc($name)); } else { compile_ucm(\*E,lc($name)); } } else { warn "Cannot open $enc for $name:$!"; } } if ($doC) { print STDERR "Writing compiled form\n"; foreach my $name (sort cmp_name keys %encoding) { my ($e2u,$u2e,$erep,$min_el,$max_el) = @{$encoding{$name}}; process($name.'_utf8',$e2u); addstrings(\*C,$e2u); process('utf8_'.$name,$u2e); addstrings(\*C,$u2e); } outbigstring(\*C,"enctable"); foreach my $name (sort cmp_name keys %encoding) { my ($e2u,$u2e,$erep,$min_el,$max_el) = @{$encoding{$name}}; outtable(\*C,$e2u, "enctable"); outtable(\*C,$u2e, "enctable"); # push(@{$encoding{$name}},outstring(\*C,$e2u->{Cname}.'_def',$erep)); } my $cpp = ($Config{d_cplusplus} || '') eq 'define'; my $exta = $cpp ? 'extern "C" ' : "static"; my $extb = $cpp ? 'extern "C" ' : ""; foreach my $enc (sort cmp_name keys %encoding) { # my ($e2u,$u2e,$rep,$min_el,$max_el,$rsym) = @{$encoding{$enc}}; my ($e2u,$u2e,$rep,$min_el,$max_el) = @{$encoding{$enc}}; #my @info = ($e2u->{Cname},$u2e->{Cname},$rsym,length($rep),$min_el,$max_el); my $replen = 0; $replen++ while($rep =~ /\G\\x[0-9A-Fa-f]/g); my $sym = "${enc}_encoding"; $sym =~ s/\W+/_/g; my @info = ($e2u->{Cname},$u2e->{Cname},"${sym}_rep_character",$replen, $min_el,$max_el); print C "${exta} const U8 ${sym}_rep_character[] = \"$rep\";\n"; print C "${exta} const char ${sym}_enc_name[] = \"$enc\";\n\n"; print C "${extb} const encode_t $sym = \n"; # This is to make null encoding work -- dankogai for (my $i = (scalar @info) - 1; $i >= 0; --$i){ $info[$i] ||= 1; } # end of null tweak -- dankogai print C " {",join(',',@info,"{${sym}_enc_name,(const char *)0}"),"};\n\n"; } foreach my $enc (sort cmp_name keys %encoding) { my $sym = "${enc}_encoding"; $sym =~ s/\W+/_/g; print H "extern encode_t $sym;\n"; print D " Encode_XSEncoding(aTHX_ &$sym);\n"; } if ($cname =~ /(\w+)\.xs$/) { my $mod = $1; print C <<'END'; static void Encode_XSEncoding(pTHX_ encode_t *enc) { dSP; HV *stash = gv_stashpv("Encode::XS", TRUE); SV *sv = sv_bless(newRV_noinc(newSViv(PTR2IV(enc))),stash); int i = 0; PUSHMARK(sp); XPUSHs(sv); while (enc->name[i]) { const char *name = enc->name[i++]; XPUSHs(sv_2mortal(newSVpvn(name,strlen(name)))); } PUTBACK; call_pv("Encode::define_encoding",G_DISCARD); SvREFCNT_dec(sv); } END print C "\nMODULE = Encode::$mod\tPACKAGE = Encode::$mod\n\n"; print C "BOOT:\n{\n"; print C "#include \"$dname\"\n"; print C "}\n"; } # Close in void context is bad, m'kay close(D) or warn "Error closing '$dname': $!"; close(H) or warn "Error closing '$hname': $!"; my $perc_saved = $saved/($strings + $saved) * 100; my $perc_subsaved = $subsave/($strings + $subsave) * 100; printf STDERR "%d bytes in string tables\n",$strings; printf STDERR "%d bytes (%.3g%%) saved spotting duplicates\n", $saved, $perc_saved if $saved; printf STDERR "%d bytes (%.3g%%) saved using substrings\n", $subsave, $perc_subsaved if $subsave; } elsif ($doEnc) { foreach my $name (sort cmp_name keys %encoding) { my ($e2u,$u2e,$erep,$min_el,$max_el) = @{$encoding{$name}}; output_enc(\*C,$name,$e2u); } } elsif ($doUcm) { foreach my $name (sort cmp_name keys %encoding) { my ($e2u,$u2e,$erep,$min_el,$max_el) = @{$encoding{$name}}; output_ucm(\*C,$name,$u2e,$erep,$min_el,$max_el); } } # writing half meg files and then not checking to see if you just filled the # disk is bad, m'kay close(C) or die "Error closing '$cname': $!"; # End of the main program. sub compile_ucm { my ($fh,$name) = @_; my $e2u = {}; my $u2e = {}; my $cs; my %attr; while (<$fh>) { s/#.*$//; last if /^\s*CHARMAP\s*$/i; if (/^\s*<(\w+)>\s+"?([^"]*)"?\s*$/i) # " # Grrr { $attr{$1} = $2; } } if (!defined($cs = $attr{'code_set_name'})) { warn "No <code_set_name> in $name\n"; } else { $name = $cs unless exists $opt{'n'}; } my $erep; my $urep; my $max_el; my $min_el; if (exists $attr{'subchar'}) { #my @byte; #$attr{'subchar'} =~ /^\s*/cg; #push(@byte,$1) while $attr{'subchar'} =~ /\G\\x([0-9a-f]+)/icg; #$erep = join('',map(chr(hex($_)),@byte)); $erep = $attr{'subchar'}; $erep =~ s/^\s+//; $erep =~ s/\s+$//; } print "Reading $name ($cs)\n"; my $nfb = 0; my $hfb = 0; while (<$fh>) { s/#.*$//; last if /^\s*END\s+CHARMAP\s*$/i; next if /^\s*$/; my (@uni, @byte) = (); my ($uni, $byte, $fb) = m/^(\S+)\s+(\S+)\s+(\S+)\s+/o or die "Bad line: $_"; while ($uni =~ m/\G<([U0-9a-fA-F\+]+)>/g){ push @uni, map { substr($_, 1) } split(/\+/, $1); } while ($byte =~ m/\G\\x([0-9a-fA-F]+)/g){ push @byte, $1; } if (@uni) { my $uch = join('', map { encode_U(hex($_)) } @uni ); my $ech = join('',map(chr(hex($_)),@byte)); my $el = length($ech); $max_el = $el if (!defined($max_el) || $el > $max_el); $min_el = $el if (!defined($min_el) || $el < $min_el); if (length($fb)) { $fb = substr($fb,1); $hfb++; } else { $nfb++; $fb = '0'; } # $fb is fallback flag # 0 - round trip safe # 1 - fallback for unicode -> enc # 2 - skip sub-char mapping # 3 - fallback enc -> unicode enter($u2e,$uch,$ech,$u2e,$fb+0) if ($fb =~ /[01]/); enter($e2u,$ech,$uch,$e2u,$fb+0) if ($fb =~ /[03]/); } else { warn $_; } } if ($nfb && $hfb) { die "$nfb entries without fallback, $hfb entries with\n"; } $encoding{$name} = [$e2u,$u2e,$erep,$min_el,$max_el]; } sub compile_enc { my ($fh,$name) = @_; my $e2u = {}; my $u2e = {}; my $type; while ($type = <$fh>) { last if $type !~ /^\s*#/; } chomp($type); return if $type eq 'E'; # Do the hash lookup once, rather than once per function call. 4% speedup. my $type_func = $encode_types{$type}; my ($def,$sym,$pages) = split(/\s+/,scalar(<$fh>)); warn "$type encoded $name\n"; my $rep = ''; # Save a defined test by setting these to defined values. my $min_el = ~0; # A very big integer my $max_el = 0; # Anything must be longer than 0 { my $v = hex($def); $rep = &$type_func($v & 0xFF, ($v >> 8) & 0xffe); } my $errors; my $seen; # use -Q to silence the seen test. Makefile.PL uses this by default. $seen = {} unless $opt{Q}; do { my $line = <$fh>; chomp($line); my $page = hex($line); my $ch = 0; my $i = 16; do { # So why is it 1% faster to leave the my here? my $line = <$fh>; $line =~ s/\r\n$/\n/; die "$.:${line}Line should be exactly 65 characters long including newline (".length($line).")" unless length ($line) == 65; # Split line into groups of 4 hex digits, convert groups to ints # This takes 65.35 # map {hex $_} $line =~ /(....)/g # This takes 63.75 (2.5% less time) # unpack "n*", pack "H*", $line # There's an implicit loop in map. Loops are bad, m'kay. Ops are bad, m'kay # Doing it as while ($line =~ /(....)/g) took 74.63 foreach my $val (unpack "n*", pack "H*", $line) { next if $val == 0xFFFD; my $ech = &$type_func($ch,$page); if ($val || (!$ch && !$page)) { my $el = length($ech); $max_el = $el if $el > $max_el; $min_el = $el if $el < $min_el; my $uch = encode_U($val); if ($seen) { # We're doing the test. # We don't need to read this quickly, so storing it as a scalar, # rather than 3 (anon array, plus the 2 scalars it holds) saves # RAM and may make us faster on low RAM systems. [see __END__] if (exists $seen->{$uch}) { warn sprintf("U%04X is %02X%02X and %04X\n", $val,$page,$ch,$seen->{$uch}); $errors++; } else { $seen->{$uch} = $page << 8 | $ch; } } # Passing 2 extra args each time is 3.6% slower! # Even with having to add $fallback ||= 0 later enter_fb0($e2u,$ech,$uch); enter_fb0($u2e,$uch,$ech); } else { # No character at this position # enter($e2u,$ech,undef,$e2u); } $ch++; } } while --$i; } while --$pages; die "\$min_el=$min_el, \$max_el=$max_el - seems we read no lines" if $min_el > $max_el; die "$errors mapping conflicts\n" if ($errors && $opt{'S'}); $encoding{$name} = [$e2u,$u2e,$rep,$min_el,$max_el]; } # my ($a,$s,$d,$t,$fb) = @_; sub enter { my ($current,$inbytes,$outbytes,$next,$fallback) = @_; # state we shift to after this (multibyte) input character defaults to same # as current state. $next ||= $current; # Making sure it is defined seems to be faster than {no warnings;} in # &process, or passing it in as 0 explicity. # XXX $fallback ||= 0; # Start at the beginning and work forwards through the string to zero. # effectively we are removing 1 character from the front each time # but we don't actually edit the string. [this alone seems to be 14% speedup] # Hence -$pos is the length of the remaining string. my $pos = -length $inbytes; while (1) { my $byte = substr $inbytes, $pos, 1; # RAW_NEXT => 0, # RAW_IN_LEN => 1, # RAW_OUT_BYTES => 2, # RAW_FALLBACK => 3, # to unicode an array would seem to be better, because the pages are dense. # from unicode can be very sparse, favouring a hash. # hash using the bytes (all length 1) as keys rather than ord value, # as it's easier to sort these in &process. # It's faster to always add $fallback even if it's undef, rather than # choosing between 3 and 4 element array. (hence why we set it defined # above) my $do_now = $current->{Raw}{$byte} ||= [{},-$pos,'',$fallback]; # When $pos was -1 we were at the last input character. unless (++$pos) { $do_now->[RAW_OUT_BYTES] = $outbytes; $do_now->[RAW_NEXT] = $next; return; } # Tail recursion. The intermdiate state may not have a name yet. $current = $do_now->[RAW_NEXT]; } } # This is purely for optimistation. It's just &enter hard coded for $fallback # of 0, using only a 3 entry array ref to save memory for every entry. sub enter_fb0 { my ($current,$inbytes,$outbytes,$next) = @_; $next ||= $current; my $pos = -length $inbytes; while (1) { my $byte = substr $inbytes, $pos, 1; my $do_now = $current->{Raw}{$byte} ||= [{},-$pos,'']; unless (++$pos) { $do_now->[RAW_OUT_BYTES] = $outbytes; $do_now->[RAW_NEXT] = $next; return; } $current = $do_now->[RAW_NEXT]; } } sub process { my ($name,$a) = @_; $name =~ s/\W+/_/g; $a->{Cname} = $name; my $raw = $a->{Raw}; my ($l, $agg_max_in, $agg_next, $agg_in_len, $agg_out_len, $agg_fallback); my @ent; $agg_max_in = 0; foreach my $key (sort keys %$raw) { # RAW_NEXT => 0, # RAW_IN_LEN => 1, # RAW_OUT_BYTES => 2, # RAW_FALLBACK => 3, my ($next, $in_len, $out_bytes, $fallback) = @{$raw->{$key}}; # Now we are converting from raw to aggregate, switch from 1 byte strings # to numbers my $b = ord $key; $fallback ||= 0; if ($l && # If this == fails, we're going to reset $agg_max_in below anyway. $b == ++$agg_max_in && # References in numeric context give the pointer as an int. $agg_next == $next && $agg_in_len == $in_len && $agg_out_len == length $out_bytes && $agg_fallback == $fallback # && length($l->[AGG_OUT_BYTES]) < 16 ) { # my $i = ord($b)-ord($l->[AGG_MIN_IN]); # we can aggregate this byte onto the end. $l->[AGG_MAX_IN] = $b; $l->[AGG_OUT_BYTES] .= $out_bytes; } else { # AGG_MIN_IN => 0, # AGG_MAX_IN => 1, # AGG_OUT_BYTES => 2, # AGG_NEXT => 3, # AGG_IN_LEN => 4, # AGG_OUT_LEN => 5, # AGG_FALLBACK => 6, # Reset the last thing we saw, plus set 5 lexicals to save some derefs. # (only gains .6% on euc-jp -- is it worth it?) push @ent, $l = [$b, $agg_max_in = $b, $out_bytes, $agg_next = $next, $agg_in_len = $in_len, $agg_out_len = length $out_bytes, $agg_fallback = $fallback]; } if (exists $next->{Cname}) { $next->{'Forward'} = 1 if $next != $a; } else { process(sprintf("%s_%02x",$name,$b),$next); } } # encengine.c rules say that last entry must be for 255 if ($agg_max_in < 255) { push @ent, [1+$agg_max_in, 255,undef,$a,0,0]; } $a->{'Entries'} = \@ent; } sub addstrings { my ($fh,$a) = @_; my $name = $a->{'Cname'}; # String tables foreach my $b (@{$a->{'Entries'}}) { next unless $b->[AGG_OUT_LEN]; $strings{$b->[AGG_OUT_BYTES]} = undef; } if ($a->{'Forward'}) { my $cpp = ($Config{d_cplusplus} || '') eq 'define'; my $var = $^O eq 'MacOS' || $cpp ? 'extern' : 'static'; my $const = $cpp ? '' : 'const'; print $fh "$var $const encpage_t $name\[",scalar(@{$a->{'Entries'}}),"];\n"; } $a->{'DoneStrings'} = 1; foreach my $b (@{$a->{'Entries'}}) { my ($s,$e,$out,$t,$end,$l) = @$b; addstrings($fh,$t) unless $t->{'DoneStrings'}; } } sub outbigstring { my ($fh,$name) = @_; $string_acc = ''; # Make the big string in the string accumulator. Longest first, on the hope # that this makes it more likely that we find the short strings later on. # Not sure if it helps sorting strings of the same length lexcically. foreach my $s (sort {length $b <=> length $a || $a cmp $b} keys %strings) { my $index = index $string_acc, $s; if ($index >= 0) { $saved += length($s); $strings_in_acc{$s} = $index; } else { OPTIMISER: { if ($opt{'O'}) { my $sublength = length $s; while (--$sublength > 0) { # progressively lop characters off the end, to see if the start of # the new string overlaps the end of the accumulator. if (substr ($string_acc, -$sublength) eq substr ($s, 0, $sublength)) { $subsave += $sublength; $strings_in_acc{$s} = length ($string_acc) - $sublength; # append the last bit on the end. $string_acc .= substr ($s, $sublength); last OPTIMISER; } # or if the end of the new string overlaps the start of the # accumulator next unless substr ($string_acc, 0, $sublength) eq substr ($s, -$sublength); # well, the last $sublength characters of the accumulator match. # so as we're prepending to the accumulator, need to shift all our # existing offsets forwards $_ += $sublength foreach values %strings_in_acc; $subsave += $sublength; $strings_in_acc{$s} = 0; # append the first bit on the start. $string_acc = substr ($s, 0, -$sublength) . $string_acc; last OPTIMISER; } } # Optimiser (if it ran) found nothing, so just going have to tack the # whole thing on the end. $strings_in_acc{$s} = length $string_acc; $string_acc .= $s; }; } } $strings = length $string_acc; my $cpp = ($Config{d_cplusplus} || '') eq 'define'; my $var = $cpp ? '' : 'static'; my $definition = "\n$var const U8 $name\[$strings] = { " . join(',',unpack "C*",$string_acc); # We have a single long line. Split it at convenient commas. print $fh $1, "\n" while $definition =~ /\G(.{74,77},)/gcs; print $fh substr ($definition, pos $definition), " };\n"; } sub findstring { my ($name,$s) = @_; my $offset = $strings_in_acc{$s}; die "Can't find string " . join (',',unpack "C*",$s) . " in accumulator" unless defined $offset; "$name + $offset"; } sub outtable { my ($fh,$a,$bigname) = @_; my $name = $a->{'Cname'}; $a->{'Done'} = 1; foreach my $b (@{$a->{'Entries'}}) { my ($s,$e,$out,$t,$end,$l) = @$b; outtable($fh,$t,$bigname) unless $t->{'Done'}; } my $cpp = ($Config{d_cplusplus} || '') eq 'define'; my $var = $cpp ? '' : 'static'; my $const = $cpp ? '' : 'const'; print $fh "\n$var $const encpage_t $name\[", scalar(@{$a->{'Entries'}}), "] = {\n"; foreach my $b (@{$a->{'Entries'}}) { my ($sc,$ec,$out,$t,$end,$l,$fb) = @$b; # $end |= 0x80 if $fb; # what the heck was on your mind, Nick? -- Dan print $fh "{"; if ($l) { printf $fh findstring($bigname,$out); } else { print $fh "0"; } print $fh ",",$t->{Cname}; printf $fh ",0x%02x,0x%02x,$l,$end},\n",$sc,$ec; } print $fh "};\n"; } sub output_enc { my ($fh,$name,$a) = @_; die "Changed - fix me for new structure"; foreach my $b (sort keys %$a) { my ($s,$e,$out,$t,$end,$l,$fb) = @{$a->{$b}}; } } sub decode_U { my $s = shift; } my @uname; sub char_names { my $s = do "unicore/Name.pl"; die "char_names: unicore/Name.pl: $!\n" unless defined $s; pos($s) = 0; while ($s =~ /\G([0-9a-f]+)\t([0-9a-f]*)\t(.*?)\s*\n/igc) { my $name = $3; my $s = hex($1); last if $s >= 0x10000; my $e = length($2) ? hex($2) : $s; for (my $i = $s; $i <= $e; $i++) { $uname[$i] = $name; # print sprintf("U%04X $name\n",$i); } } } sub output_ucm_page { my ($cmap,$a,$t,$pre) = @_; # warn sprintf("Page %x\n",$pre); my $raw = $t->{Raw}; foreach my $key (sort keys %$raw) { # RAW_NEXT => 0, # RAW_IN_LEN => 1, # RAW_OUT_BYTES => 2, # RAW_FALLBACK => 3, my ($next, $in_len, $out_bytes, $fallback) = @{$raw->{$key}}; my $u = ord $key; $fallback ||= 0; if ($next != $a && $next != $t) { output_ucm_page($cmap,$a,$next,(($pre|($u &0x3F)) << 6)&0xFFFF); } elsif (length $out_bytes) { if ($pre) { $u = $pre|($u &0x3f); } my $s = sprintf "<U%04X> ",$u; #foreach my $c (split(//,$out_bytes)) { # $s .= sprintf "\\x%02X",ord($c); #} # 9.5% faster changing that loop to this: $s .= sprintf +("\\x%02X" x length $out_bytes), unpack "C*", $out_bytes; $s .= sprintf " |%d # %s\n",($fallback ? 1 : 0),$uname[$u]; push(@$cmap,$s); } else { warn join(',',$u, @{$raw->{$key}},$a,$t); } } } sub output_ucm { my ($fh,$name,$h,$rep,$min_el,$max_el) = @_; print $fh "# $0 @orig_ARGV\n" unless $opt{'q'}; print $fh "<code_set_name> \"$name\"\n"; char_names(); if (defined $min_el) { print $fh "<mb_cur_min> $min_el\n"; } if (defined $max_el) { print $fh "<mb_cur_max> $max_el\n"; } if (defined $rep) { print $fh "<subchar> "; foreach my $c (split(//,$rep)) { printf $fh "\\x%02X",ord($c); } print $fh "\n"; } my @cmap; output_ucm_page(\@cmap,$h,$h,0); print $fh "#\nCHARMAP\n"; foreach my $line (sort { substr($a,8) cmp substr($b,8) } @cmap) { print $fh $line; } print $fh "END CHARMAP\n"; } use vars qw( $_Enc2xs $_Version $_Inc $_E2X $_Name $_TableFiles $_Now ); sub find_e2x{ eval { require File::Find; }; my (@inc, %e2x_dir); for my $inc (@INC){ push @inc, $inc unless $inc eq '.'; #skip current dir } File::Find::find( sub { my ($dev,$ino,$mode,$nlink,$uid,$gid,$rdev,$size, $atime,$mtime,$ctime,$blksize,$blocks) = lstat($_) or return; -f _ or return; if (/^.*\.e2x$/o){ no warnings 'once'; $e2x_dir{$File::Find::dir} ||= $mtime; } return; }, @inc); warn join("\n", keys %e2x_dir), "\n"; for my $d (sort {$e2x_dir{$a} <=> $e2x_dir{$b}} keys %e2x_dir){ $_E2X = $d; # warn "$_E2X => ", scalar localtime($e2x_dir{$d}); return $_E2X; } } sub make_makefile_pl { eval { require Encode; }; $@ and die "You need to install Encode to use enc2xs -M\nerror: $@\n"; # our used for variable expanstion $_Enc2xs = $0; $_Version = $VERSION; $_E2X = find_e2x(); $_Name = shift; $_TableFiles = join(",", map {qq('$_')} @_); $_Now = scalar localtime(); eval { require File::Spec; }; _print_expand(File::Spec->catfile($_E2X,"Makefile_PL.e2x"),"Makefile.PL"); _print_expand(File::Spec->catfile($_E2X,"_PM.e2x"), "$_Name.pm"); _print_expand(File::Spec->catfile($_E2X,"_T.e2x"), "t/$_Name.t"); _print_expand(File::Spec->catfile($_E2X,"README.e2x"), "README"); _print_expand(File::Spec->catfile($_E2X,"Changes.e2x"), "Changes"); exit; } use vars qw( $_ModLines $_LocalVer ); sub make_configlocal_pm { eval { require Encode; }; $@ and die "Unable to require Encode: $@\n"; eval { require File::Spec; }; # our used for variable expanstion my %in_core = map { $_ => 1 } ( 'ascii', 'iso-8859-1', 'utf8', 'ascii-ctrl', 'null', 'utf-8-strict' ); my %LocalMod = (); # check @enc; use File::Find (); my $wanted = sub{ -f $_ or return; $File::Find::name =~ /\A\./ and return; $File::Find::name =~ /\.pm\z/ or return; $File::Find::name =~ m/\bEncode\b/ or return; my $mod = $File::Find::name; $mod =~ s/.*\bEncode\b/Encode/o; $mod =~ s/\.pm\z//o; $mod =~ s,/,::,og; warn qq{ require $mod;\n}; eval qq{ require $mod; }; $@ and die "Can't require $mod: $@\n"; for my $enc ( Encode->encodings() ) { no warnings; $in_core{$enc} and next; $Encode::Config::ExtModule{$enc} and next; $LocalMod{$enc} ||= $mod; } }; File::Find::find({wanted => $wanted}, @INC); $_ModLines = ""; for my $enc ( sort keys %LocalMod ) { $_ModLines .= qq(\$Encode::ExtModule{'$enc'} = "$LocalMod{$enc}";\n); } warn $_ModLines; $_LocalVer = _mkversion(); $_E2X = find_e2x(); $_Inc = $INC{"Encode.pm"}; $_Inc =~ s/\.pm$//o; _print_expand( File::Spec->catfile( $_E2X, "ConfigLocal_PM.e2x" ), File::Spec->catfile( $_Inc, "ConfigLocal.pm" ), 1 ); exit; } sub _mkversion{ # v-string is now depreciated; use time() instead; #my ($ss,$mm,$hh,$dd,$mo,$yyyy) = localtime(); #$yyyy += 1900, $mo +=1; #return sprintf("v%04d.%04d.%04d", $yyyy, $mo*100+$dd, $hh*100+$mm); return time(); } sub _print_expand{ eval { require File::Basename; }; $@ and die "File::Basename needed. Are you on miniperl?;\nerror: $@\n"; File::Basename->import(); my ($src, $dst, $clobber) = @_; if (!$clobber and -e $dst){ warn "$dst exists. skipping\n"; return; } warn "Generating $dst...\n"; open my $in, $src or die "$src : $!"; if ((my $d = dirname($dst)) ne '.'){ -d $d or mkdir $d, 0755 or die "mkdir $d : $!"; } open my $out, ">$dst" or die "$!"; my $asis = 0; while (<$in>){ if (/^#### END_OF_HEADER/){ $asis = 1; next; } s/(\$_[A-Z][A-Za-z0-9]+)_/$1/gee unless $asis; print $out $_; } } __END__ =head1 NAME enc2xs -- Perl Encode Module Generator =head1 SYNOPSIS enc2xs -[options] enc2xs -M ModName mapfiles... enc2xs -C =head1 DESCRIPTION F<enc2xs> builds a Perl extension for use by Encode from either Unicode Character Mapping files (.ucm) or Tcl Encoding Files (.enc). Besides being used internally during the build process of the Encode module, you can use F<enc2xs> to add your own encoding to perl. No knowledge of XS is necessary. =head1 Quick Guide If you want to know as little about Perl as possible but need to add a new encoding, just read this chapter and forget the rest. =over 4 =item 0. Have a .ucm file ready. You can get it from somewhere or you can write your own from scratch or you can grab one from the Encode distribution and customize it. For the UCM format, see the next Chapter. In the example below, I'll call my theoretical encoding myascii, defined in I<my.ucm>. C<$> is a shell prompt. $ ls -F my.ucm =item 1. Issue a command as follows; $ enc2xs -M My my.ucm generating Makefile.PL generating My.pm generating README generating Changes Now take a look at your current directory. It should look like this. $ ls -F Makefile.PL My.pm my.ucm t/ The following files were created. Makefile.PL - MakeMaker script My.pm - Encode submodule t/My.t - test file =over 4 =item 1.1. If you want *.ucm installed together with the modules, do as follows; $ mkdir Encode $ mv *.ucm Encode $ enc2xs -M My Encode/*ucm =back =item 2. Edit the files generated. You don't have to if you have no time AND no intention to give it to someone else. But it is a good idea to edit the pod and to add more tests. =item 3. Now issue a command all Perl Mongers love: $ perl Makefile.PL Writing Makefile for Encode::My =item 4. Now all you have to do is make. $ make cp My.pm blib/lib/Encode/My.pm /usr/local/bin/perl /usr/local/bin/enc2xs -Q -O \ -o encode_t.c -f encode_t.fnm Reading myascii (myascii) Writing compiled form 128 bytes in string tables 384 bytes (75%) saved spotting duplicates 1 bytes (0.775%) saved using substrings .... chmod 644 blib/arch/auto/Encode/My/My.bs $ The time it takes varies depending on how fast your machine is and how large your encoding is. Unless you are working on something big like euc-tw, it won't take too long. =item 5. You can "make install" already but you should test first. $ make test PERL_DL_NONLAZY=1 /usr/local/bin/perl -Iblib/arch -Iblib/lib \ -e 'use Test::Harness qw(&runtests $verbose); \ $verbose=0; runtests @ARGV;' t/*.t t/My....ok All tests successful. Files=1, Tests=2, 0 wallclock secs ( 0.09 cusr + 0.01 csys = 0.09 CPU) =item 6. If you are content with the test result, just "make install" =item 7. If you want to add your encoding to Encode's demand-loading list (so you don't have to "use Encode::YourEncoding"), run enc2xs -C to update Encode::ConfigLocal, a module that controls local settings. After that, "use Encode;" is enough to load your encodings on demand. =back =head1 The Unicode Character Map Encode uses the Unicode Character Map (UCM) format for source character mappings. This format is used by IBM's ICU package and was adopted by Nick Ing-Simmons for use with the Encode module. Since UCM is more flexible than Tcl's Encoding Map and far more user-friendly, this is the recommended format for Encode now. A UCM file looks like this. # # Comments # <code_set_name> "US-ascii" # Required <code_set_alias> "ascii" # Optional <mb_cur_min> 1 # Required; usually 1 <mb_cur_max> 1 # Max. # of bytes/char <subchar> \x3F # Substitution char # CHARMAP <U0000> \x00 |0 # <control> <U0001> \x01 |0 # <control> <U0002> \x02 |0 # <control> .... <U007C> \x7C |0 # VERTICAL LINE <U007D> \x7D |0 # RIGHT CURLY BRACKET <U007E> \x7E |0 # TILDE <U007F> \x7F |0 # <control> END CHARMAP =over 4 =item * Anything that follows C<#> is treated as a comment. =item * The header section continues until a line containing the word CHARMAP. This section has a form of I<E<lt>keywordE<gt> value>, one pair per line. Strings used as values must be quoted. Barewords are treated as numbers. I<\xXX> represents a byte. Most of the keywords are self-explanatory. I<subchar> means substitution character, not subcharacter. When you decode a Unicode sequence to this encoding but no matching character is found, the byte sequence defined here will be used. For most cases, the value here is \x3F; in ASCII, this is a question mark. =item * CHARMAP starts the character map section. Each line has a form as follows: <UXXXX> \xXX.. |0 # comment ^ ^ ^ | | +- Fallback flag | +-------- Encoded byte sequence +-------------- Unicode Character ID in hex The format is roughly the same as a header section except for the fallback flag: | followed by 0..3. The meaning of the possible values is as follows: =over 4 =item |0 Round trip safe. A character decoded to Unicode encodes back to the same byte sequence. Most characters have this flag. =item |1 Fallback for unicode -> encoding. When seen, enc2xs adds this character for the encode map only. =item |2 Skip sub-char mapping should there be no code point. =item |3 Fallback for encoding -> unicode. When seen, enc2xs adds this character for the decode map only. =back =item * And finally, END OF CHARMAP ends the section. =back When you are manually creating a UCM file, you should copy ascii.ucm or an existing encoding which is close to yours, rather than write your own from scratch. When you do so, make sure you leave at least B<U0000> to B<U0020> as is, unless your environment is EBCDIC. B<CAVEAT>: not all features in UCM are implemented. For example, icu:state is not used. Because of that, you need to write a perl module if you want to support algorithmical encodings, notably the ISO-2022 series. Such modules include L<Encode::JP::2022_JP>, L<Encode::KR::2022_KR>, and L<Encode::TW::HZ>. =head2 Coping with duplicate mappings When you create a map, you SHOULD make your mappings round-trip safe. That is, C<encode('your-encoding', decode('your-encoding', $data)) eq $data> stands for all characters that are marked as C<|0>. Here is how to make sure: =over 4 =item * Sort your map in Unicode order. =item * When you have a duplicate entry, mark either one with '|1' or '|3'. =item * And make sure the '|1' or '|3' entry FOLLOWS the '|0' entry. =back Here is an example from big5-eten. <U2550> \xF9\xF9 |0 <U2550> \xA2\xA4 |3 Internally Encoding -> Unicode and Unicode -> Encoding Map looks like this; E to U U to E -------------------------------------- \xF9\xF9 => U2550 U2550 => \xF9\xF9 \xA2\xA4 => U2550 So it is round-trip safe for \xF9\xF9. But if the line above is upside down, here is what happens. E to U U to E -------------------------------------- \xA2\xA4 => U2550 U2550 => \xF9\xF9 (\xF9\xF9 => U2550 is now overwritten!) The Encode package comes with F<ucmlint>, a crude but sufficient utility to check the integrity of a UCM file. Check under the Encode/bin directory for this. When in doubt, you can use F<ucmsort>, yet another utility under Encode/bin directory. =head1 Bookmarks =over 4 =item * ICU Home Page L<http://www.icu-project.org/> =item * ICU Character Mapping Tables L<http://site.icu-project.org/charts/charset> =item * ICU:Conversion Data L<http://www.icu-project.org/userguide/conversion-data.html> =back =head1 SEE ALSO L<Encode>, L<perlmod>, L<perlpod> =cut # -Q to disable the duplicate codepoint test # -S make mapping errors fatal # -q to remove comments written to output files # -O to enable the (brute force) substring optimiser # -o <output> to specify the output file name (else it's the first arg) # -f <inlist> to give a file with a list of input files (else use the args) # -n <name> to name the encoding (else use the basename of the input file. With %seen holding array refs: 865.66 real 28.80 user 8.79 sys 7904 maximum resident set size 1356 average shared memory size 18566 average unshared data size 229 average unshared stack size 46080 page reclaims 33373 page faults With %seen holding simple scalars: 342.16 real 27.11 user 3.54 sys 8388 maximum resident set size 1394 average shared memory size 14969 average unshared data size 236 average unshared stack size 28159 page reclaims 9839 page faults Yes, 5 minutes is faster than 15. Above is for CP936 in CN. Only difference is how %seen is storing things its seen. So it is pathalogically bad on a 16M RAM machine, but it's going to help even on modern machines. Swapping is bad, m'kay :-)
Close
