Linux tr1.turkishost.com 5.14.0-570.52.1.el9_6.x86_64 #1 SMP PREEMPT_DYNAMIC Wed Oct 15 06:39:08 EDT 2025 x86_64
LiteSpeed
Server IP : 194.146.50.96 & Your IP : 216.73.216.218
Domains :
Cant Read [ /etc/named.conf ]
User : lakemima
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
Delete
Unzip
Name
Size
Permission
Date
Action
GL
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
ImageMagick-6
[ DIR ]
drwxr-xr-x
2025-07-11 10:43
X11
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
arpa
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
asm
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
asm-generic
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
bind9
[ DIR ]
drwxr-xr-x
2026-04-15 08:39
bits
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
blkid
[ DIR ]
drwxr-xr-x
2026-02-06 03:05
brotli
[ DIR ]
drwxr-xr-x
2026-02-06 03:06
bsock
[ DIR ]
drwxr-xr-x
2025-07-11 14:19
c++
[ DIR ]
drwxr-xr-x
2025-09-15 18:41
drm
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
e2p
[ DIR ]
drwxr-xr-x
2025-12-05 18:20
et
[ DIR ]
drwxr-xr-x
2025-12-05 18:19
event2
[ DIR ]
drwxr-xr-x
2025-07-11 00:01
ext2fs
[ DIR ]
drwxr-xr-x
2025-12-05 18:20
finclude
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
fontconfig
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
freetype2
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
fstrm
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
fwctl
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
gdbm
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
gio-unix-2.0
[ DIR ]
drwxr-xr-x
2026-01-23 10:38
glib-2.0
[ DIR ]
drwxr-xr-x
2026-01-25 02:38
gnu
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
google
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
graphite2
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
gssapi
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
gssrpc
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
harfbuzz
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
json-c
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
kadm5
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
krb5
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
libexslt
[ DIR ]
drwxr-xr-x
2026-04-02 02:38
libhashkit
[ DIR ]
drwxr-xr-x
2025-07-11 10:52
libhashkit-1.0
[ DIR ]
drwxr-xr-x
2025-07-11 10:52
libltdl
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
libmemcached
[ DIR ]
drwxr-xr-x
2025-07-11 10:52
libmemcached-1.0
[ DIR ]
drwxr-xr-x
2025-07-11 10:52
libmemcachedprotocol-0.0
[ DIR ]
drwxr-xr-x
2025-07-11 10:52
libmemcachedutil-1.0
[ DIR ]
drwxr-xr-x
2025-07-11 10:52
libmount
[ DIR ]
drwxr-xr-x
2026-02-06 03:06
libpng16
[ DIR ]
drwxr-xr-x
2026-03-03 02:38
libxml2
[ DIR ]
drwxr-xr-x
2025-12-01 06:41
libxslt
[ DIR ]
drwxr-xr-x
2026-04-02 02:38
linux
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
lve
[ DIR ]
drwxr-xr-x
2025-12-05 03:00
lzma
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
misc
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
mtd
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
mysql
[ DIR ]
drwxr-xr-x
2026-02-06 03:06
ncurses
[ DIR ]
drwxr-xr-x
2025-12-05 18:20
ncursesw
[ DIR ]
drwxr-xr-x
2025-12-05 18:20
net
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
netash
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
netatalk
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
netax25
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
neteconet
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
netinet
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
netipx
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
netiucv
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
netpacket
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
netrom
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
netrose
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
nfs
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
openssl
[ DIR ]
drwxr-xr-x
2026-01-29 02:38
pcp
[ DIR ]
drwxr-xr-x
2025-12-05 18:19
protobuf-c
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
protocols
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
python3.9
[ DIR ]
drwxr-xr-x
2026-04-11 02:38
rdma
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
rpc
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
sasl
[ DIR ]
drwxr-xr-x
2025-12-05 18:19
scsi
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
security
[ DIR ]
drwxr-xr-x
2025-09-04 02:38
selinux
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
sepol
[ DIR ]
drwxr-xr-x
2025-12-05 18:20
sound
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
sys
[ DIR ]
drwxr-xr-x
2026-02-20 02:39
sysprof-4
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
unicode
[ DIR ]
drwxr-xr-x
2025-07-31 02:38
video
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
webp
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
xcb
[ DIR ]
drwxr-xr-x
2025-07-11 00:04
xen
[ DIR ]
drwxr-xr-x
2026-04-23 02:38
FlexLexer.h
6.73
KB
-rw-r--r--
2022-01-30 11:23
a.out.h
4.25
KB
-rw-r--r--
2026-02-17 14:01
aio.h
7.56
KB
-rw-r--r--
2026-02-17 14:01
aliases.h
1.98
KB
-rw-r--r--
2026-02-17 14:02
alloca.h
1.17
KB
-rw-r--r--
2026-02-17 14:01
ar.h
1.69
KB
-rw-r--r--
2026-02-17 14:01
argp.h
24.95
KB
-rw-r--r--
2026-02-17 14:02
argz.h
5.91
KB
-rw-r--r--
2026-02-17 14:01
assert.h
4.46
KB
-rw-r--r--
2026-02-17 14:01
autosprintf.h
2.36
KB
-rw-r--r--
2023-09-27 09:51
byteswap.h
1.42
KB
-rw-r--r--
2026-02-17 14:01
bzlib.h
6.09
KB
-rw-r--r--
2019-07-13 20:50
com_err.h
2.07
KB
-rw-r--r--
2021-12-30 08:54
complex.h
7.95
KB
-rw-r--r--
2026-02-17 14:01
cpio.h
2.21
KB
-rw-r--r--
2026-02-17 14:01
cpuidle.h
931
B
-rw-r--r--
2026-04-22 00:03
crypt.h
10.9
KB
-rw-r--r--
2022-02-10 07:05
ctype.h
10.71
KB
-rw-r--r--
2026-02-17 14:01
curses.h
96.82
KB
-rw-r--r--
2025-09-21 12:23
cursesapp.h
7.06
KB
-rw-r--r--
2025-09-21 12:23
cursesf.h
27.37
KB
-rw-r--r--
2025-09-21 12:23
cursesm.h
19.44
KB
-rw-r--r--
2025-09-21 12:23
cursesp.h
8.55
KB
-rw-r--r--
2025-09-21 12:23
cursesw.h
49.13
KB
-rw-r--r--
2025-09-21 12:23
cursslk.h
7.15
KB
-rw-r--r--
2025-09-21 12:23
dbm.h
1.37
KB
-rw-r--r--
2022-01-02 11:34
dirent.h
12.32
KB
-rw-r--r--
2026-02-17 14:01
dlfcn.h
8.38
KB
-rw-r--r--
2026-02-17 14:01
elf.h
178.26
KB
-rw-r--r--
2026-02-17 14:02
endian.h
2.25
KB
-rw-r--r--
2026-02-17 14:01
entities.h
4.81
KB
-rw-r--r--
2021-01-12 03:09
envz.h
2.8
KB
-rw-r--r--
2026-02-17 14:01
err.h
2.29
KB
-rw-r--r--
2026-02-17 14:01
errno.h
1.64
KB
-rw-r--r--
2026-02-17 14:01
error.h
2.36
KB
-rw-r--r--
2026-02-17 14:01
eti.h
2.9
KB
-rw-r--r--
2025-09-21 12:23
etip.h
9.61
KB
-rw-r--r--
2025-09-21 12:23
evdns.h
1.97
KB
-rw-r--r--
2019-01-26 12:53
event.h
2.68
KB
-rw-r--r--
2019-01-26 12:53
evhttp.h
1.99
KB
-rw-r--r--
2019-01-26 12:53
evrpc.h
1.97
KB
-rw-r--r--
2019-01-26 12:53
evutil.h
1.74
KB
-rw-r--r--
2019-01-26 12:53
execinfo.h
1.49
KB
-rw-r--r--
2026-02-17 14:02
expat.h
43.24
KB
-rw-r--r--
2025-11-26 19:13
expat_config.h
3.82
KB
-rw-r--r--
2025-11-26 19:14
expat_external.h
5.89
KB
-rw-r--r--
2022-10-25 18:08
fcntl.h
11.17
KB
-rw-r--r--
2026-02-17 14:01
features-time64.h
1.37
KB
-rw-r--r--
2026-02-17 14:01
features.h
17.69
KB
-rw-r--r--
2026-02-17 14:01
fenv.h
5.65
KB
-rw-r--r--
2026-02-17 14:01
ffi-x86_64.h
13.88
KB
-rw-r--r--
2023-09-25 22:54
ffi.h
556
B
-rw-r--r--
2023-09-25 22:54
ffitarget-x86_64.h
4.63
KB
-rw-r--r--
2023-09-25 22:54
ffitarget.h
616
B
-rw-r--r--
2023-09-25 22:54
fmtmsg.h
3.16
KB
-rw-r--r--
2026-02-17 14:01
fnmatch.h
2.24
KB
-rw-r--r--
2026-02-17 14:01
form.h
18.46
KB
-rw-r--r--
2025-09-21 12:23
fpu_control.h
3.5
KB
-rw-r--r--
2026-02-17 14:01
fstab.h
3.04
KB
-rw-r--r--
2026-02-17 14:01
fstrm.h
12.71
KB
-rw-r--r--
2019-03-11 23:58
fts.h
9.35
KB
-rw-r--r--
2026-02-17 14:01
ftw.h
6.19
KB
-rw-r--r--
2026-02-17 14:01
gconv.h
4.11
KB
-rw-r--r--
2026-02-17 14:01
gd.h
58.25
KB
-rw-r--r--
2021-03-06 21:21
gd_color_map.h
478
B
-rw-r--r--
2021-01-12 03:09
gd_errors.h
1.47
KB
-rw-r--r--
2021-01-12 03:09
gd_io.h
2.93
KB
-rw-r--r--
2021-03-03 10:15
gdbm.h
11.9
KB
-rw-r--r--
2024-10-03 00:50
gdcache.h
2.92
KB
-rw-r--r--
2021-03-03 10:15
gdfontg.h
553
B
-rw-r--r--
2021-01-12 03:09
gdfontl.h
551
B
-rw-r--r--
2021-01-12 03:09
gdfontmb.h
519
B
-rw-r--r--
2021-01-12 03:09
gdfonts.h
515
B
-rw-r--r--
2021-01-12 03:09
gdfontt.h
546
B
-rw-r--r--
2021-01-12 03:09
gdfx.h
496
B
-rw-r--r--
2021-02-21 20:23
gdpp.h
50.73
KB
-rw-r--r--
2021-03-03 10:15
gelf.h
11.14
KB
-rw-r--r--
2025-04-25 23:16
getopt.h
1.43
KB
-rw-r--r--
2026-02-17 14:01
gettext-po.h
15.18
KB
-rw-r--r--
2023-09-27 09:52
glob.h
7.13
KB
-rw-r--r--
2026-02-17 14:01
gnu-versions.h
2.29
KB
-rw-r--r--
2026-02-17 14:01
gnumake.h
2.84
KB
-rw-r--r--
2020-01-03 10:11
gpg-error.h
71.92
KB
-rw-r--r--
2022-02-10 02:24
gpgrt.h
71.92
KB
-rw-r--r--
2022-02-10 02:24
grp.h
6.53
KB
-rw-r--r--
2026-02-17 14:01
gshadow.h
4.42
KB
-rw-r--r--
2026-02-17 14:02
gssapi.h
181
B
-rw-r--r--
2023-07-10 23:58
iconv.h
1.81
KB
-rw-r--r--
2026-02-17 14:01
idn-free.h
2.56
KB
-rw-r--r--
2021-07-22 16:31
idn-int.h
20
B
-rw-r--r--
2022-02-14 18:33
idna.h
3.89
KB
-rw-r--r--
2021-07-22 16:31
ieee754.h
4.8
KB
-rw-r--r--
2026-02-17 14:01
ifaddrs.h
2.77
KB
-rw-r--r--
2026-02-17 14:02
inttypes.h
8.14
KB
-rw-r--r--
2026-02-17 14:01
jconfig-64.h
1.98
KB
-rw-r--r--
2024-04-01 22:06
jconfig.h
246
B
-rw-r--r--
2024-04-01 22:06
jerror.h
15.35
KB
-rw-r--r--
2020-11-25 06:56
jmorecfg.h
13.98
KB
-rw-r--r--
2020-11-25 06:56
jpegint.h
15.25
KB
-rw-r--r--
2020-11-25 06:56
jpeglib.h
49.1
KB
-rw-r--r--
2020-11-25 06:56
kdb.h
62.83
KB
-rw-r--r--
2026-04-21 19:53
keyutils.h
11.52
KB
-rw-r--r--
2023-04-05 22:15
krad.h
8.72
KB
-rw-r--r--
2023-07-10 23:58
krb5.h
402
B
-rw-r--r--
2023-07-10 23:58
langinfo.h
17.43
KB
-rw-r--r--
2026-02-17 14:01
lastlog.h
126
B
-rw-r--r--
2026-02-17 14:02
libaio.h
8.75
KB
-rw-r--r--
2022-02-09 22:07
libelf.h
20.31
KB
-rw-r--r--
2025-04-25 23:16
libgen.h
1.35
KB
-rw-r--r--
2026-02-17 14:01
libintl.h
4.47
KB
-rw-r--r--
2026-02-17 14:01
limits.h
5.57
KB
-rw-r--r--
2026-02-17 14:01
link.h
7.62
KB
-rw-r--r--
2026-02-17 14:02
lmdb.h
72.28
KB
-rw-r--r--
2021-03-16 19:41
locale.h
7.5
KB
-rw-r--r--
2026-02-17 14:01
ltdl.h
5.58
KB
-rw-r--r--
2024-10-01 20:49
lzma.h
9.63
KB
-rw-r--r--
2020-03-17 17:28
malloc.h
5.77
KB
-rw-r--r--
2026-02-17 14:01
math.h
47.63
KB
-rw-r--r--
2026-02-17 14:01
maxminddb.h
8.34
KB
-rw-r--r--
2021-02-18 20:04
maxminddb_config-64.h
504
B
-rw-r--r--
2024-10-01 19:54
maxminddb_config.h
178
B
-rw-r--r--
2024-10-01 19:54
mcheck.h
2.38
KB
-rw-r--r--
2026-02-17 14:01
memory.h
956
B
-rw-r--r--
2026-02-17 14:01
menu.h
11.6
KB
-rw-r--r--
2025-09-21 12:23
mntent.h
3.28
KB
-rw-r--r--
2026-02-17 14:01
monetary.h
1.92
KB
-rw-r--r--
2026-02-17 14:01
mqueue.h
4.5
KB
-rw-r--r--
2026-02-17 14:01
nc_tparm.h
4.67
KB
-rw-r--r--
2025-09-21 12:23
ncurses.h
96.82
KB
-rw-r--r--
2025-09-21 12:23
ncurses_dll.h
3.95
KB
-rw-r--r--
2025-09-21 12:23
ndbm.h
2.39
KB
-rw-r--r--
2022-01-02 11:34
netdb.h
27.79
KB
-rw-r--r--
2026-02-17 14:02
nl_types.h
1.71
KB
-rw-r--r--
2026-02-17 14:01
nlist.h
1.56
KB
-rw-r--r--
2025-04-25 23:16
nss.h
14.07
KB
-rw-r--r--
2026-02-17 14:02
obstack.h
20.81
KB
-rw-r--r--
2026-02-17 14:01
panel.h
4.41
KB
-rw-r--r--
2025-09-21 12:23
paths.h
2.91
KB
-rw-r--r--
2026-02-17 14:01
pcre.h
30.97
KB
-rw-r--r--
2024-10-03 00:53
pcre2.h
46.15
KB
-rw-r--r--
2024-10-03 00:57
pcre2posix.h
6.52
KB
-rw-r--r--
2021-08-20 19:51
pcre_scanner.h
6.45
KB
-rw-r--r--
2014-01-31 16:32
pcre_stringpiece.h
6.16
KB
-rw-r--r--
2024-10-03 00:53
pcrecpp.h
25.91
KB
-rw-r--r--
2014-01-31 16:32
pcrecpparg.h
6.62
KB
-rw-r--r--
2024-10-03 00:53
pcreposix.h
5.74
KB
-rw-r--r--
2024-10-03 00:53
png.h
139.51
KB
-rw-r--r--
2019-04-14 21:10
pngconf.h
22.31
KB
-rw-r--r--
2019-04-14 21:10
pnglibconf.h
7.43
KB
-rw-r--r--
2026-02-26 18:08
poll.h
22
B
-rw-r--r--
2026-02-17 14:01
powercap.h
1.62
KB
-rw-r--r--
2026-04-22 00:03
pr29.h
2.19
KB
-rw-r--r--
2021-07-22 16:31
printf.h
6.71
KB
-rw-r--r--
2026-02-17 14:01
proc_service.h
3.4
KB
-rw-r--r--
2026-02-17 14:02
profile.h
11.87
KB
-rw-r--r--
2026-04-21 19:53
pthread.h
47.39
KB
-rw-r--r--
2026-02-17 14:01
pty.h
1.53
KB
-rw-r--r--
2026-02-17 14:02
punycode.h
9.3
KB
-rw-r--r--
2021-07-22 16:31
pwd.h
6.17
KB
-rw-r--r--
2026-02-17 14:01
re_comp.h
963
B
-rw-r--r--
2026-02-17 14:01
regex.h
25.3
KB
-rw-r--r--
2026-02-17 14:01
regexp.h
1.41
KB
-rw-r--r--
2026-02-17 14:01
resolv.h
12.1
KB
-rw-r--r--
2026-02-17 14:02
sched.h
4.92
KB
-rw-r--r--
2026-02-17 14:01
search.h
5.32
KB
-rw-r--r--
2026-02-17 14:01
semaphore.h
3.38
KB
-rw-r--r--
2026-02-17 14:01
setjmp.h
3.12
KB
-rw-r--r--
2026-02-17 14:01
sgtty.h
1.31
KB
-rw-r--r--
2026-02-17 14:01
shadow.h
5.34
KB
-rw-r--r--
2026-02-17 14:02
signal.h
12.73
KB
-rw-r--r--
2026-02-17 14:01
spawn.h
8.1
KB
-rw-r--r--
2026-02-17 14:01
stab.h
264
B
-rw-r--r--
2026-02-17 14:01
stdc-predef.h
2.24
KB
-rw-r--r--
2026-02-17 14:01
stdint.h
8.28
KB
-rw-r--r--
2026-02-17 14:01
stdio.h
30.67
KB
-rw-r--r--
2026-02-17 14:01
stdio_ext.h
2.73
KB
-rw-r--r--
2026-02-17 14:01
stdlib.h
35.46
KB
-rw-r--r--
2026-02-17 14:01
string.h
19
KB
-rw-r--r--
2026-02-17 14:01
stringprep.h
9.53
KB
-rw-r--r--
2021-07-22 16:44
strings.h
4.64
KB
-rw-r--r--
2026-02-17 14:01
syscall.h
25
B
-rw-r--r--
2026-02-17 14:01
sysexits.h
5.11
KB
-rw-r--r--
2026-02-17 14:01
syslog.h
24
B
-rw-r--r--
2026-02-17 14:01
tar.h
3.7
KB
-rw-r--r--
2026-02-17 14:01
term.h
40.95
KB
-rw-r--r--
2025-09-21 12:23
term_entry.h
8.9
KB
-rw-r--r--
2025-09-21 12:23
termcap.h
3.39
KB
-rw-r--r--
2025-09-21 12:23
termio.h
214
B
-rw-r--r--
2026-02-17 14:01
termios.h
3.51
KB
-rw-r--r--
2026-02-17 14:01
tgmath.h
39.24
KB
-rw-r--r--
2026-02-17 14:01
thread_db.h
15.65
KB
-rw-r--r--
2026-02-17 14:02
threads.h
7.51
KB
-rw-r--r--
2026-02-17 14:01
tic.h
14.48
KB
-rw-r--r--
2025-09-21 12:23
tiff.h
46.33
KB
-rw-r--r--
2022-04-22 19:51
tiffconf-64.h
3.19
KB
-rw-r--r--
2025-11-12 06:46
tiffconf.h
250
B
-rw-r--r--
2025-11-12 06:46
tiffio.h
24.13
KB
-rw-r--r--
2022-05-20 18:32
tiffio.hxx
1.62
KB
-rw-r--r--
2022-02-19 18:33
tiffvers.h
410
B
-rw-r--r--
2022-05-20 19:12
time.h
14.5
KB
-rw-r--r--
2026-02-17 14:01
tld.h
4.85
KB
-rw-r--r--
2021-07-22 16:31
ttyent.h
2.44
KB
-rw-r--r--
2026-02-17 14:01
uchar.h
1.96
KB
-rw-r--r--
2026-02-17 14:01
ucontext.h
1.99
KB
-rw-r--r--
2026-02-17 14:01
ulimit.h
1.55
KB
-rw-r--r--
2026-02-17 14:01
unctrl.h
3.1
KB
-rw-r--r--
2025-09-21 12:23
unistd.h
43.45
KB
-rw-r--r--
2026-02-17 14:01
utime.h
1.86
KB
-rw-r--r--
2026-02-17 14:01
utmp.h
3.15
KB
-rw-r--r--
2026-02-17 14:02
utmpx.h
4
KB
-rw-r--r--
2026-02-17 14:02
values.h
1.91
KB
-rw-r--r--
2026-02-17 14:01
verto-module.h
6.48
KB
-rw-r--r--
2022-02-10 07:33
verto.h
18.98
KB
-rw-r--r--
2022-02-10 07:33
wait.h
22
B
-rw-r--r--
2026-02-17 14:01
wchar.h
31.39
KB
-rw-r--r--
2026-02-17 14:01
wctype.h
5.42
KB
-rw-r--r--
2026-02-17 14:01
wordexp.h
2.44
KB
-rw-r--r--
2026-02-17 14:01
zconf.h
15.88
KB
-rw-r--r--
2023-09-26 12:22
zdict.h
25.81
KB
-rw-r--r--
2023-04-04 23:13
zlib.h
94
KB
-rw-r--r--
2023-09-26 12:22
zstd.h
167.36
KB
-rw-r--r--
2023-04-04 23:13
zstd_errors.h
4.43
KB
-rw-r--r--
2023-04-04 23:13
Save
Rename
/* * Copyright (c) Meta Platforms, Inc. and affiliates. * All rights reserved. * * This source code is licensed under both the BSD-style license (found in the * LICENSE file in the root directory of this source tree) and the GPLv2 (found * in the COPYING file in the root directory of this source tree). * You may select, at your option, one of the above-listed licenses. */ #if defined (__cplusplus) extern "C" { #endif #ifndef ZSTD_ZDICT_H #define ZSTD_ZDICT_H /*====== Dependencies ======*/ #include <stddef.h> /* size_t */ /* ===== ZDICTLIB_API : control library symbols visibility ===== */ #ifndef ZDICTLIB_VISIBLE /* Backwards compatibility with old macro name */ # ifdef ZDICTLIB_VISIBILITY # define ZDICTLIB_VISIBLE ZDICTLIB_VISIBILITY # elif defined(__GNUC__) && (__GNUC__ >= 4) && !defined(__MINGW32__) # define ZDICTLIB_VISIBLE __attribute__ ((visibility ("default"))) # else # define ZDICTLIB_VISIBLE # endif #endif #ifndef ZDICTLIB_HIDDEN # if defined(__GNUC__) && (__GNUC__ >= 4) && !defined(__MINGW32__) # define ZDICTLIB_HIDDEN __attribute__ ((visibility ("hidden"))) # else # define ZDICTLIB_HIDDEN # endif #endif #if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1) # define ZDICTLIB_API __declspec(dllexport) ZDICTLIB_VISIBLE #elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1) # define ZDICTLIB_API __declspec(dllimport) ZDICTLIB_VISIBLE /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/ #else # define ZDICTLIB_API ZDICTLIB_VISIBLE #endif /******************************************************************************* * Zstd dictionary builder * * FAQ * === * Why should I use a dictionary? * ------------------------------ * * Zstd can use dictionaries to improve compression ratio of small data. * Traditionally small files don't compress well because there is very little * repetition in a single sample, since it is small. But, if you are compressing * many similar files, like a bunch of JSON records that share the same * structure, you can train a dictionary on ahead of time on some samples of * these files. Then, zstd can use the dictionary to find repetitions that are * present across samples. This can vastly improve compression ratio. * * When is a dictionary useful? * ---------------------------- * * Dictionaries are useful when compressing many small files that are similar. * The larger a file is, the less benefit a dictionary will have. Generally, * we don't expect dictionary compression to be effective past 100KB. And the * smaller a file is, the more we would expect the dictionary to help. * * How do I use a dictionary? * -------------------------- * * Simply pass the dictionary to the zstd compressor with * `ZSTD_CCtx_loadDictionary()`. The same dictionary must then be passed to * the decompressor, using `ZSTD_DCtx_loadDictionary()`. There are other * more advanced functions that allow selecting some options, see zstd.h for * complete documentation. * * What is a zstd dictionary? * -------------------------- * * A zstd dictionary has two pieces: Its header, and its content. The header * contains a magic number, the dictionary ID, and entropy tables. These * entropy tables allow zstd to save on header costs in the compressed file, * which really matters for small data. The content is just bytes, which are * repeated content that is common across many samples. * * What is a raw content dictionary? * --------------------------------- * * A raw content dictionary is just bytes. It doesn't have a zstd dictionary * header, a dictionary ID, or entropy tables. Any buffer is a valid raw * content dictionary. * * How do I train a dictionary? * ---------------------------- * * Gather samples from your use case. These samples should be similar to each * other. If you have several use cases, you could try to train one dictionary * per use case. * * Pass those samples to `ZDICT_trainFromBuffer()` and that will train your * dictionary. There are a few advanced versions of this function, but this * is a great starting point. If you want to further tune your dictionary * you could try `ZDICT_optimizeTrainFromBuffer_cover()`. If that is too slow * you can try `ZDICT_optimizeTrainFromBuffer_fastCover()`. * * If the dictionary training function fails, that is likely because you * either passed too few samples, or a dictionary would not be effective * for your data. Look at the messages that the dictionary trainer printed, * if it doesn't say too few samples, then a dictionary would not be effective. * * How large should my dictionary be? * ---------------------------------- * * A reasonable dictionary size, the `dictBufferCapacity`, is about 100KB. * The zstd CLI defaults to a 110KB dictionary. You likely don't need a * dictionary larger than that. But, most use cases can get away with a * smaller dictionary. The advanced dictionary builders can automatically * shrink the dictionary for you, and select the smallest size that doesn't * hurt compression ratio too much. See the `shrinkDict` parameter. * A smaller dictionary can save memory, and potentially speed up * compression. * * How many samples should I provide to the dictionary builder? * ------------------------------------------------------------ * * We generally recommend passing ~100x the size of the dictionary * in samples. A few thousand should suffice. Having too few samples * can hurt the dictionaries effectiveness. Having more samples will * only improve the dictionaries effectiveness. But having too many * samples can slow down the dictionary builder. * * How do I determine if a dictionary will be effective? * ----------------------------------------------------- * * Simply train a dictionary and try it out. You can use zstd's built in * benchmarking tool to test the dictionary effectiveness. * * # Benchmark levels 1-3 without a dictionary * zstd -b1e3 -r /path/to/my/files * # Benchmark levels 1-3 with a dictionary * zstd -b1e3 -r /path/to/my/files -D /path/to/my/dictionary * * When should I retrain a dictionary? * ----------------------------------- * * You should retrain a dictionary when its effectiveness drops. Dictionary * effectiveness drops as the data you are compressing changes. Generally, we do * expect dictionaries to "decay" over time, as your data changes, but the rate * at which they decay depends on your use case. Internally, we regularly * retrain dictionaries, and if the new dictionary performs significantly * better than the old dictionary, we will ship the new dictionary. * * I have a raw content dictionary, how do I turn it into a zstd dictionary? * ------------------------------------------------------------------------- * * If you have a raw content dictionary, e.g. by manually constructing it, or * using a third-party dictionary builder, you can turn it into a zstd * dictionary by using `ZDICT_finalizeDictionary()`. You'll also have to * provide some samples of the data. It will add the zstd header to the * raw content, which contains a dictionary ID and entropy tables, which * will improve compression ratio, and allow zstd to write the dictionary ID * into the frame, if you so choose. * * Do I have to use zstd's dictionary builder? * ------------------------------------------- * * No! You can construct dictionary content however you please, it is just * bytes. It will always be valid as a raw content dictionary. If you want * a zstd dictionary, which can improve compression ratio, use * `ZDICT_finalizeDictionary()`. * * What is the attack surface of a zstd dictionary? * ------------------------------------------------ * * Zstd is heavily fuzz tested, including loading fuzzed dictionaries, so * zstd should never crash, or access out-of-bounds memory no matter what * the dictionary is. However, if an attacker can control the dictionary * during decompression, they can cause zstd to generate arbitrary bytes, * just like if they controlled the compressed data. * ******************************************************************************/ /*! ZDICT_trainFromBuffer(): * Train a dictionary from an array of samples. * Redirect towards ZDICT_optimizeTrainFromBuffer_fastCover() single-threaded, with d=8, steps=4, * f=20, and accel=1. * Samples must be stored concatenated in a single flat buffer `samplesBuffer`, * supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order. * The resulting dictionary will be saved into `dictBuffer`. * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`) * or an error code, which can be tested with ZDICT_isError(). * Note: Dictionary training will fail if there are not enough samples to construct a * dictionary, or if most of the samples are too small (< 8 bytes being the lower limit). * If dictionary training fails, you should use zstd without a dictionary, as the dictionary * would've been ineffective anyways. If you believe your samples would benefit from a dictionary * please open an issue with details, and we can look into it. * Note: ZDICT_trainFromBuffer()'s memory usage is about 6 MB. * Tips: In general, a reasonable dictionary has a size of ~ 100 KB. * It's possible to select smaller or larger size, just by specifying `dictBufferCapacity`. * In general, it's recommended to provide a few thousands samples, though this can vary a lot. * It's recommended that total size of all samples be about ~x100 times the target size of dictionary. */ ZDICTLIB_API size_t ZDICT_trainFromBuffer(void* dictBuffer, size_t dictBufferCapacity, const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples); typedef struct { int compressionLevel; /**< optimize for a specific zstd compression level; 0 means default */ unsigned notificationLevel; /**< Write log to stderr; 0 = none (default); 1 = errors; 2 = progression; 3 = details; 4 = debug; */ unsigned dictID; /**< force dictID value; 0 means auto mode (32-bits random value) * NOTE: The zstd format reserves some dictionary IDs for future use. * You may use them in private settings, but be warned that they * may be used by zstd in a public dictionary registry in the future. * These dictionary IDs are: * - low range : <= 32767 * - high range : >= (2^31) */ } ZDICT_params_t; /*! ZDICT_finalizeDictionary(): * Given a custom content as a basis for dictionary, and a set of samples, * finalize dictionary by adding headers and statistics according to the zstd * dictionary format. * * Samples must be stored concatenated in a flat buffer `samplesBuffer`, * supplied with an array of sizes `samplesSizes`, providing the size of each * sample in order. The samples are used to construct the statistics, so they * should be representative of what you will compress with this dictionary. * * The compression level can be set in `parameters`. You should pass the * compression level you expect to use in production. The statistics for each * compression level differ, so tuning the dictionary for the compression level * can help quite a bit. * * You can set an explicit dictionary ID in `parameters`, or allow us to pick * a random dictionary ID for you, but we can't guarantee no collisions. * * The dstDictBuffer and the dictContent may overlap, and the content will be * appended to the end of the header. If the header + the content doesn't fit in * maxDictSize the beginning of the content is truncated to make room, since it * is presumed that the most profitable content is at the end of the dictionary, * since that is the cheapest to reference. * * `maxDictSize` must be >= max(dictContentSize, ZSTD_DICTSIZE_MIN). * * @return: size of dictionary stored into `dstDictBuffer` (<= `maxDictSize`), * or an error code, which can be tested by ZDICT_isError(). * Note: ZDICT_finalizeDictionary() will push notifications into stderr if * instructed to, using notificationLevel>0. * NOTE: This function currently may fail in several edge cases including: * * Not enough samples * * Samples are uncompressible * * Samples are all exactly the same */ ZDICTLIB_API size_t ZDICT_finalizeDictionary(void* dstDictBuffer, size_t maxDictSize, const void* dictContent, size_t dictContentSize, const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples, ZDICT_params_t parameters); /*====== Helper functions ======*/ ZDICTLIB_API unsigned ZDICT_getDictID(const void* dictBuffer, size_t dictSize); /**< extracts dictID; @return zero if error (not a valid dictionary) */ ZDICTLIB_API size_t ZDICT_getDictHeaderSize(const void* dictBuffer, size_t dictSize); /* returns dict header size; returns a ZSTD error code on failure */ ZDICTLIB_API unsigned ZDICT_isError(size_t errorCode); ZDICTLIB_API const char* ZDICT_getErrorName(size_t errorCode); #endif /* ZSTD_ZDICT_H */ #if defined(ZDICT_STATIC_LINKING_ONLY) && !defined(ZSTD_ZDICT_H_STATIC) #define ZSTD_ZDICT_H_STATIC /* This can be overridden externally to hide static symbols. */ #ifndef ZDICTLIB_STATIC_API # if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1) # define ZDICTLIB_STATIC_API __declspec(dllexport) ZDICTLIB_VISIBLE # elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1) # define ZDICTLIB_STATIC_API __declspec(dllimport) ZDICTLIB_VISIBLE # else # define ZDICTLIB_STATIC_API ZDICTLIB_VISIBLE # endif #endif /* ==================================================================================== * The definitions in this section are considered experimental. * They should never be used with a dynamic library, as they may change in the future. * They are provided for advanced usages. * Use them only in association with static linking. * ==================================================================================== */ #define ZDICT_DICTSIZE_MIN 256 /* Deprecated: Remove in v1.6.0 */ #define ZDICT_CONTENTSIZE_MIN 128 /*! ZDICT_cover_params_t: * k and d are the only required parameters. * For others, value 0 means default. */ typedef struct { unsigned k; /* Segment size : constraint: 0 < k : Reasonable range [16, 2048+] */ unsigned d; /* dmer size : constraint: 0 < d <= k : Reasonable range [6, 16] */ unsigned steps; /* Number of steps : Only used for optimization : 0 means default (40) : Higher means more parameters checked */ unsigned nbThreads; /* Number of threads : constraint: 0 < nbThreads : 1 means single-threaded : Only used for optimization : Ignored if ZSTD_MULTITHREAD is not defined */ double splitPoint; /* Percentage of samples used for training: Only used for optimization : the first nbSamples * splitPoint samples will be used to training, the last nbSamples * (1 - splitPoint) samples will be used for testing, 0 means default (1.0), 1.0 when all samples are used for both training and testing */ unsigned shrinkDict; /* Train dictionaries to shrink in size starting from the minimum size and selects the smallest dictionary that is shrinkDictMaxRegression% worse than the largest dictionary. 0 means no shrinking and 1 means shrinking */ unsigned shrinkDictMaxRegression; /* Sets shrinkDictMaxRegression so that a smaller dictionary can be at worse shrinkDictMaxRegression% worse than the max dict size dictionary. */ ZDICT_params_t zParams; } ZDICT_cover_params_t; typedef struct { unsigned k; /* Segment size : constraint: 0 < k : Reasonable range [16, 2048+] */ unsigned d; /* dmer size : constraint: 0 < d <= k : Reasonable range [6, 16] */ unsigned f; /* log of size of frequency array : constraint: 0 < f <= 31 : 1 means default(20)*/ unsigned steps; /* Number of steps : Only used for optimization : 0 means default (40) : Higher means more parameters checked */ unsigned nbThreads; /* Number of threads : constraint: 0 < nbThreads : 1 means single-threaded : Only used for optimization : Ignored if ZSTD_MULTITHREAD is not defined */ double splitPoint; /* Percentage of samples used for training: Only used for optimization : the first nbSamples * splitPoint samples will be used to training, the last nbSamples * (1 - splitPoint) samples will be used for testing, 0 means default (0.75), 1.0 when all samples are used for both training and testing */ unsigned accel; /* Acceleration level: constraint: 0 < accel <= 10, higher means faster and less accurate, 0 means default(1) */ unsigned shrinkDict; /* Train dictionaries to shrink in size starting from the minimum size and selects the smallest dictionary that is shrinkDictMaxRegression% worse than the largest dictionary. 0 means no shrinking and 1 means shrinking */ unsigned shrinkDictMaxRegression; /* Sets shrinkDictMaxRegression so that a smaller dictionary can be at worse shrinkDictMaxRegression% worse than the max dict size dictionary. */ ZDICT_params_t zParams; } ZDICT_fastCover_params_t; /*! ZDICT_trainFromBuffer_cover(): * Train a dictionary from an array of samples using the COVER algorithm. * Samples must be stored concatenated in a single flat buffer `samplesBuffer`, * supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order. * The resulting dictionary will be saved into `dictBuffer`. * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`) * or an error code, which can be tested with ZDICT_isError(). * See ZDICT_trainFromBuffer() for details on failure modes. * Note: ZDICT_trainFromBuffer_cover() requires about 9 bytes of memory for each input byte. * Tips: In general, a reasonable dictionary has a size of ~ 100 KB. * It's possible to select smaller or larger size, just by specifying `dictBufferCapacity`. * In general, it's recommended to provide a few thousands samples, though this can vary a lot. * It's recommended that total size of all samples be about ~x100 times the target size of dictionary. */ ZDICTLIB_STATIC_API size_t ZDICT_trainFromBuffer_cover( void *dictBuffer, size_t dictBufferCapacity, const void *samplesBuffer, const size_t *samplesSizes, unsigned nbSamples, ZDICT_cover_params_t parameters); /*! ZDICT_optimizeTrainFromBuffer_cover(): * The same requirements as above hold for all the parameters except `parameters`. * This function tries many parameter combinations and picks the best parameters. * `*parameters` is filled with the best parameters found, * dictionary constructed with those parameters is stored in `dictBuffer`. * * All of the parameters d, k, steps are optional. * If d is non-zero then we don't check multiple values of d, otherwise we check d = {6, 8}. * if steps is zero it defaults to its default value. * If k is non-zero then we don't check multiple values of k, otherwise we check steps values in [50, 2000]. * * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`) * or an error code, which can be tested with ZDICT_isError(). * On success `*parameters` contains the parameters selected. * See ZDICT_trainFromBuffer() for details on failure modes. * Note: ZDICT_optimizeTrainFromBuffer_cover() requires about 8 bytes of memory for each input byte and additionally another 5 bytes of memory for each byte of memory for each thread. */ ZDICTLIB_STATIC_API size_t ZDICT_optimizeTrainFromBuffer_cover( void* dictBuffer, size_t dictBufferCapacity, const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples, ZDICT_cover_params_t* parameters); /*! ZDICT_trainFromBuffer_fastCover(): * Train a dictionary from an array of samples using a modified version of COVER algorithm. * Samples must be stored concatenated in a single flat buffer `samplesBuffer`, * supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order. * d and k are required. * All other parameters are optional, will use default values if not provided * The resulting dictionary will be saved into `dictBuffer`. * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`) * or an error code, which can be tested with ZDICT_isError(). * See ZDICT_trainFromBuffer() for details on failure modes. * Note: ZDICT_trainFromBuffer_fastCover() requires 6 * 2^f bytes of memory. * Tips: In general, a reasonable dictionary has a size of ~ 100 KB. * It's possible to select smaller or larger size, just by specifying `dictBufferCapacity`. * In general, it's recommended to provide a few thousands samples, though this can vary a lot. * It's recommended that total size of all samples be about ~x100 times the target size of dictionary. */ ZDICTLIB_STATIC_API size_t ZDICT_trainFromBuffer_fastCover(void *dictBuffer, size_t dictBufferCapacity, const void *samplesBuffer, const size_t *samplesSizes, unsigned nbSamples, ZDICT_fastCover_params_t parameters); /*! ZDICT_optimizeTrainFromBuffer_fastCover(): * The same requirements as above hold for all the parameters except `parameters`. * This function tries many parameter combinations (specifically, k and d combinations) * and picks the best parameters. `*parameters` is filled with the best parameters found, * dictionary constructed with those parameters is stored in `dictBuffer`. * All of the parameters d, k, steps, f, and accel are optional. * If d is non-zero then we don't check multiple values of d, otherwise we check d = {6, 8}. * if steps is zero it defaults to its default value. * If k is non-zero then we don't check multiple values of k, otherwise we check steps values in [50, 2000]. * If f is zero, default value of 20 is used. * If accel is zero, default value of 1 is used. * * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`) * or an error code, which can be tested with ZDICT_isError(). * On success `*parameters` contains the parameters selected. * See ZDICT_trainFromBuffer() for details on failure modes. * Note: ZDICT_optimizeTrainFromBuffer_fastCover() requires about 6 * 2^f bytes of memory for each thread. */ ZDICTLIB_STATIC_API size_t ZDICT_optimizeTrainFromBuffer_fastCover(void* dictBuffer, size_t dictBufferCapacity, const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples, ZDICT_fastCover_params_t* parameters); typedef struct { unsigned selectivityLevel; /* 0 means default; larger => select more => larger dictionary */ ZDICT_params_t zParams; } ZDICT_legacy_params_t; /*! ZDICT_trainFromBuffer_legacy(): * Train a dictionary from an array of samples. * Samples must be stored concatenated in a single flat buffer `samplesBuffer`, * supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order. * The resulting dictionary will be saved into `dictBuffer`. * `parameters` is optional and can be provided with values set to 0 to mean "default". * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`) * or an error code, which can be tested with ZDICT_isError(). * See ZDICT_trainFromBuffer() for details on failure modes. * Tips: In general, a reasonable dictionary has a size of ~ 100 KB. * It's possible to select smaller or larger size, just by specifying `dictBufferCapacity`. * In general, it's recommended to provide a few thousands samples, though this can vary a lot. * It's recommended that total size of all samples be about ~x100 times the target size of dictionary. * Note: ZDICT_trainFromBuffer_legacy() will send notifications into stderr if instructed to, using notificationLevel>0. */ ZDICTLIB_STATIC_API size_t ZDICT_trainFromBuffer_legacy( void* dictBuffer, size_t dictBufferCapacity, const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples, ZDICT_legacy_params_t parameters); /* Deprecation warnings */ /* It is generally possible to disable deprecation warnings from compiler, for example with -Wno-deprecated-declarations for gcc or _CRT_SECURE_NO_WARNINGS in Visual. Otherwise, it's also possible to manually define ZDICT_DISABLE_DEPRECATE_WARNINGS */ #ifdef ZDICT_DISABLE_DEPRECATE_WARNINGS # define ZDICT_DEPRECATED(message) /* disable deprecation warnings */ #else # define ZDICT_GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__) # if defined (__cplusplus) && (__cplusplus >= 201402) /* C++14 or greater */ # define ZDICT_DEPRECATED(message) [[deprecated(message)]] # elif defined(__clang__) || (ZDICT_GCC_VERSION >= 405) # define ZDICT_DEPRECATED(message) __attribute__((deprecated(message))) # elif (ZDICT_GCC_VERSION >= 301) # define ZDICT_DEPRECATED(message) __attribute__((deprecated)) # elif defined(_MSC_VER) # define ZDICT_DEPRECATED(message) __declspec(deprecated(message)) # else # pragma message("WARNING: You need to implement ZDICT_DEPRECATED for this compiler") # define ZDICT_DEPRECATED(message) # endif #endif /* ZDICT_DISABLE_DEPRECATE_WARNINGS */ ZDICT_DEPRECATED("use ZDICT_finalizeDictionary() instead") ZDICTLIB_STATIC_API size_t ZDICT_addEntropyTablesFromBuffer(void* dictBuffer, size_t dictContentSize, size_t dictBufferCapacity, const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples); #endif /* ZSTD_ZDICT_H_STATIC */ #if defined (__cplusplus) } #endif