Linux s17.hosterpk.com 6.12.0-124.55.3.el10_1.x86_64 #1 SMP PREEMPT_DYNAMIC Thu May 7 16:54:02 EDT 2026 x86_64
LiteSpeed
Server IP : 192.169.89.90 & Your IP : 216.73.216.41
Domains :
Cant Read [ /etc/named.conf ]
User : hamzalar
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
2026-03-12 15:15
ImageMagick-7
[ DIR ]
drwxr-xr-x
2026-05-29 12:43
X11
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
arpa
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
asm
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
asm-generic
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
bind9
[ DIR ]
drwxr-xr-x
2026-03-27 00:00
bits
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
blkid
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
brotli
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
bsock
[ DIR ]
drwxr-xr-x
2026-03-12 16:08
c++
[ DIR ]
drwxr-xr-x
2026-02-26 00:00
cairo
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
cxl
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
drm
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
e2p
[ DIR ]
drwxr-xr-x
2026-05-27 07:02
et
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
event2
[ DIR ]
drwxr-xr-x
2026-03-12 15:14
ext2fs
[ DIR ]
drwxr-xr-x
2026-05-27 07:02
finclude
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
fontconfig
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
freetype2
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
fstrm
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
fwctl
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
gdbm
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
gio-unix-2.0
[ DIR ]
drwxr-xr-x
2026-04-23 00:00
glib-2.0
[ DIR ]
drwxr-xr-x
2026-05-27 07:02
gnu
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
google
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
graphite2
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
gssapi
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
gssrpc
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
harfbuzz
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
internal
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
json-c
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
kadm5
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
krb5
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
libexslt
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
libltdl
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
libmount
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
libpng16
[ DIR ]
drwxr-xr-x
2026-05-27 07:02
libxml2
[ DIR ]
drwxr-xr-x
2026-01-26 00:00
libxslt
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
linux
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
lve
[ DIR ]
drwxr-xr-x
2026-05-11 17:56
lzma
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
misc
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
mtd
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
mysql
[ DIR ]
drwxr-xr-x
2026-03-12 16:11
ncurses
[ DIR ]
drwxr-xr-x
2026-05-11 17:56
ncursesw
[ DIR ]
drwxr-xr-x
2026-05-11 17:56
net
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
netash
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
netatalk
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
netax25
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
neteconet
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
netinet
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
netipx
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
netiucv
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
netpacket
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
netrom
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
netrose
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
nfs
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
openssl
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
pcp
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
perf
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
pixman-1
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
protobuf-c
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
protocols
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
python3.12
[ DIR ]
drwxr-xr-x
2026-05-27 07:02
rdma
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
regulator
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
rpc
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
scsi
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
security
[ DIR ]
drwxr-xr-x
2026-05-27 07:02
selinux
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
sepol
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
sound
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
sys
[ DIR ]
drwxr-xr-x
2026-05-28 07:04
sysprof-6
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
unicode
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
video
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
webp
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
xcb
[ DIR ]
drwxr-xr-x
2026-03-12 15:15
xen
[ DIR ]
drwxr-xr-x
2026-05-27 07:00
FlexLexer.h
6.73
KB
-rw-r--r--
2024-10-29 00:00
a.out.h
4.25
KB
-rw-r--r--
2026-05-26 00:00
aio.h
7.57
KB
-rw-r--r--
2026-05-26 00:00
aliases.h
1.98
KB
-rw-r--r--
2026-05-26 00:00
alloca.h
1.17
KB
-rw-r--r--
2026-05-26 00:00
ar.h
1.69
KB
-rw-r--r--
2026-05-26 00:00
argp.h
24.95
KB
-rw-r--r--
2026-05-26 00:00
argz.h
5.91
KB
-rw-r--r--
2026-05-26 00:00
assert.h
4.89
KB
-rw-r--r--
2026-05-26 00:00
autosprintf.h
2.36
KB
-rw-r--r--
2024-10-29 00:00
byteswap.h
1.42
KB
-rw-r--r--
2026-05-26 00:00
bzlib.h
6.09
KB
-rw-r--r--
2019-07-13 17:50
com_err.h
2.07
KB
-rw-r--r--
2024-05-21 02:52
complex.h
7.95
KB
-rw-r--r--
2026-05-26 00:00
cpio.h
2.21
KB
-rw-r--r--
2026-05-26 00:00
cpuidle.h
931
B
-rw-r--r--
2026-05-19 00:00
crypt.h
10.87
KB
-rw-r--r--
2024-10-29 00:00
ctype.h
10.71
KB
-rw-r--r--
2026-05-26 00:00
curses.h
98.88
KB
-rw-r--r--
2026-03-24 00:00
cursesapp.h
7.06
KB
-rw-r--r--
2026-03-24 00:00
cursesf.h
27.55
KB
-rw-r--r--
2026-03-24 00:00
cursesm.h
19.49
KB
-rw-r--r--
2026-03-24 00:00
cursesp.h
8.6
KB
-rw-r--r--
2026-03-24 00:00
cursesw.h
49.21
KB
-rw-r--r--
2026-03-24 00:00
cursslk.h
7.15
KB
-rw-r--r--
2026-03-24 00:00
dbm.h
1.37
KB
-rw-r--r--
2022-01-02 08:34
dirent.h
12.32
KB
-rw-r--r--
2026-05-26 00:00
dlfcn.h
8.59
KB
-rw-r--r--
2026-05-26 00:00
elf.h
190.33
KB
-rw-r--r--
2026-05-26 00:00
endian.h
2.25
KB
-rw-r--r--
2026-05-26 00:00
envz.h
2.8
KB
-rw-r--r--
2026-05-26 00:00
err.h
2.33
KB
-rw-r--r--
2026-05-26 00:00
errno.h
1.64
KB
-rw-r--r--
2026-05-26 00:00
error.h
2.37
KB
-rw-r--r--
2026-05-26 00:00
eti.h
2.9
KB
-rw-r--r--
2026-03-24 00:00
etip.h
9.89
KB
-rw-r--r--
2026-03-24 00:00
evdns.h
1.97
KB
-rw-r--r--
2019-01-26 09:53
event.h
2.68
KB
-rw-r--r--
2019-01-26 09:53
evhttp.h
1.99
KB
-rw-r--r--
2019-01-26 09:53
evrpc.h
1.97
KB
-rw-r--r--
2019-01-26 09:53
evutil.h
1.74
KB
-rw-r--r--
2019-01-26 09:53
execinfo.h
1.49
KB
-rw-r--r--
2026-05-26 00:00
expat.h
43.68
KB
-rw-r--r--
2025-09-24 19:20
expat_config.h
4.07
KB
-rw-r--r--
2025-12-02 00:00
expat_external.h
6.03
KB
-rw-r--r--
2025-09-24 15:05
fcntl.h
11.18
KB
-rw-r--r--
2026-05-26 00:00
features-time64.h
1.5
KB
-rw-r--r--
2026-05-26 00:00
features.h
18.16
KB
-rw-r--r--
2026-05-26 00:00
fenv.h
5.65
KB
-rw-r--r--
2026-05-26 00:00
ffi-x86_64.h
13.95
KB
-rw-r--r--
2025-04-04 00:00
ffi.h
556
B
-rw-r--r--
2025-04-04 00:00
ffitarget-x86_64.h
4.81
KB
-rw-r--r--
2025-04-04 00:00
ffitarget.h
616
B
-rw-r--r--
2025-04-04 00:00
fmtmsg.h
3.16
KB
-rw-r--r--
2026-05-26 00:00
fnmatch.h
2.24
KB
-rw-r--r--
2026-05-26 00:00
form.h
18.46
KB
-rw-r--r--
2026-03-24 00:00
fpu_control.h
3.47
KB
-rw-r--r--
2026-05-26 00:00
fstab.h
3.04
KB
-rw-r--r--
2026-05-26 00:00
fstrm.h
12.71
KB
-rw-r--r--
2019-03-11 20:58
fts.h
9.37
KB
-rw-r--r--
2026-05-26 00:00
ftw.h
6.22
KB
-rw-r--r--
2026-05-26 00:00
gconv.h
4.11
KB
-rw-r--r--
2026-05-26 00:00
gd.h
58.9
KB
-rw-r--r--
2025-03-27 00:00
gd_color_map.h
478
B
-rw-r--r--
2021-09-11 04:41
gd_errors.h
1.47
KB
-rw-r--r--
2021-09-11 04:41
gd_io.h
2.86
KB
-rw-r--r--
2021-09-11 04:43
gd_io_stream.h
3.52
KB
-rw-r--r--
2021-09-11 04:43
gdbm.h
11.9
KB
-rw-r--r--
2025-03-27 00:00
gdcache.h
2.92
KB
-rw-r--r--
2021-09-11 04:41
gdfontg.h
553
B
-rw-r--r--
2021-09-11 04:41
gdfontl.h
551
B
-rw-r--r--
2021-09-11 04:41
gdfontmb.h
519
B
-rw-r--r--
2021-09-11 04:41
gdfonts.h
515
B
-rw-r--r--
2021-09-11 04:41
gdfontt.h
546
B
-rw-r--r--
2021-09-11 04:41
gdfx.h
496
B
-rw-r--r--
2021-09-11 04:41
gdpp.h
50.76
KB
-rw-r--r--
2021-09-11 04:43
getopt.h
1.43
KB
-rw-r--r--
2026-05-26 00:00
gettext-po.h
15.18
KB
-rw-r--r--
2024-10-29 00:00
glob.h
7.14
KB
-rw-r--r--
2026-05-26 00:00
gnu-versions.h
2.29
KB
-rw-r--r--
2026-05-26 00:00
gnumake.h
2.84
KB
-rw-r--r--
2023-01-01 22:05
gpg-error.h
74.12
KB
-rw-r--r--
2024-10-29 00:00
gpgrt.h
74.12
KB
-rw-r--r--
2024-10-29 00:00
grp.h
6.69
KB
-rw-r--r--
2026-05-26 00:00
gshadow.h
4.58
KB
-rw-r--r--
2026-05-26 00:00
gssapi.h
181
B
-rw-r--r--
2024-06-26 20:00
iconv.h
1.87
KB
-rw-r--r--
2026-05-26 00:00
idn-free.h
2.56
KB
-rw-r--r--
2024-01-13 10:58
idn-int.h
20
B
-rw-r--r--
2024-07-18 00:00
idna.h
3.89
KB
-rw-r--r--
2024-01-13 10:58
ieee754.h
4.8
KB
-rw-r--r--
2026-05-26 00:00
ifaddrs.h
2.77
KB
-rw-r--r--
2026-05-26 00:00
inttypes.h
11.04
KB
-rw-r--r--
2026-05-26 00:00
jconfig.h
2.02
KB
-rw-r--r--
2024-10-29 00:00
jerror.h
15.78
KB
-rw-r--r--
2024-01-23 22:35
jmorecfg.h
14.05
KB
-rw-r--r--
2024-01-23 22:35
jpegint.h
26.4
KB
-rw-r--r--
2024-01-23 22:35
jpeglib.h
53.66
KB
-rw-r--r--
2024-01-23 22:35
kdb.h
62.83
KB
-rw-r--r--
2026-04-29 00:00
keyutils.h
11.52
KB
-rw-r--r--
2024-10-29 00:00
krad.h
8.72
KB
-rw-r--r--
2024-06-26 20:00
krb5.h
402
B
-rw-r--r--
2024-06-26 20:00
langinfo.h
17.43
KB
-rw-r--r--
2026-05-26 00:00
lastlog.h
126
B
-rw-r--r--
2026-05-26 00:00
libaio.h
8.75
KB
-rw-r--r--
2024-12-11 00:00
libgen.h
1.35
KB
-rw-r--r--
2026-05-26 00:00
libintl.h
4.47
KB
-rw-r--r--
2026-05-26 00:00
limits.h
5.57
KB
-rw-r--r--
2026-05-26 00:00
link.h
7.62
KB
-rw-r--r--
2026-05-26 00:00
lmdb.h
72.28
KB
-rw-r--r--
2024-01-29 18:20
locale.h
7.5
KB
-rw-r--r--
2026-05-26 00:00
ltdl.h
5.59
KB
-rw-r--r--
2022-03-17 02:43
lzma.h
9.56
KB
-rw-r--r--
2024-05-29 15:16
malloc.h
5.84
KB
-rw-r--r--
2026-05-26 00:00
math.h
49.75
KB
-rw-r--r--
2026-05-26 00:00
maxminddb.h
7.67
KB
-rw-r--r--
2024-01-10 00:18
maxminddb_config-64.h
504
B
-rw-r--r--
2024-10-29 00:00
maxminddb_config.h
178
B
-rw-r--r--
2024-10-29 00:00
mcheck.h
2.38
KB
-rw-r--r--
2026-05-26 00:00
memory.h
956
B
-rw-r--r--
2026-05-26 00:00
menu.h
11.6
KB
-rw-r--r--
2026-03-24 00:00
mntent.h
3.28
KB
-rw-r--r--
2026-05-26 00:00
monetary.h
1.92
KB
-rw-r--r--
2026-05-26 00:00
mqueue.h
4.5
KB
-rw-r--r--
2026-05-26 00:00
ncurses.h
98.88
KB
-rw-r--r--
2026-03-24 00:00
ncurses_dll.h
4.08
KB
-rw-r--r--
2026-03-24 00:00
ndbm.h
2.39
KB
-rw-r--r--
2022-01-02 08:34
netdb.h
27.8
KB
-rw-r--r--
2026-05-26 00:00
nl_types.h
1.71
KB
-rw-r--r--
2026-05-26 00:00
nss.h
14.07
KB
-rw-r--r--
2026-05-26 00:00
obstack.h
20.81
KB
-rw-r--r--
2026-05-26 00:00
panel.h
4.41
KB
-rw-r--r--
2026-03-24 00:00
paths.h
2.91
KB
-rw-r--r--
2026-05-26 00:00
pcre2.h
47.29
KB
-rw-r--r--
2024-10-29 00:00
pcre2posix.h
7.18
KB
-rw-r--r--
2023-10-20 08:34
png.h
139.49
KB
-rw-r--r--
2023-06-21 19:06
pngconf.h
22.27
KB
-rw-r--r--
2023-06-21 19:06
pnglibconf.h
7.43
KB
-rw-r--r--
2026-03-03 00:00
poll.h
22
B
-rw-r--r--
2026-05-26 00:00
powercap.h
1.62
KB
-rw-r--r--
2026-05-19 00:00
pr29.h
2.19
KB
-rw-r--r--
2024-01-13 10:58
printf.h
6.71
KB
-rw-r--r--
2026-05-26 00:00
proc_service.h
3.4
KB
-rw-r--r--
2026-05-26 00:00
profile.h
11.87
KB
-rw-r--r--
2026-04-29 00:00
pthread.h
47.43
KB
-rw-r--r--
2026-05-26 00:00
pty.h
1.53
KB
-rw-r--r--
2026-05-26 00:00
punycode.h
9.3
KB
-rw-r--r--
2024-01-13 10:58
pwd.h
6.17
KB
-rw-r--r--
2026-05-26 00:00
re_comp.h
963
B
-rw-r--r--
2026-05-26 00:00
regex.h
25.3
KB
-rw-r--r--
2026-05-26 00:00
regexp.h
1.35
KB
-rw-r--r--
2026-05-26 00:00
resolv.h
12.1
KB
-rw-r--r--
2026-05-26 00:00
sched.h
4.92
KB
-rw-r--r--
2026-05-26 00:00
search.h
5.32
KB
-rw-r--r--
2026-05-26 00:00
semaphore.h
3.39
KB
-rw-r--r--
2026-05-26 00:00
setjmp.h
3.12
KB
-rw-r--r--
2026-05-26 00:00
sgtty.h
1.31
KB
-rw-r--r--
2026-05-26 00:00
shadow.h
5.5
KB
-rw-r--r--
2026-05-26 00:00
signal.h
12.74
KB
-rw-r--r--
2026-05-26 00:00
spawn.h
8.19
KB
-rw-r--r--
2026-05-26 00:00
stab.h
264
B
-rw-r--r--
2026-05-26 00:00
stdbit.h
26.27
KB
-rw-r--r--
2026-05-26 00:00
stdc-predef.h
2.4
KB
-rw-r--r--
2026-05-26 00:00
stdint.h
7.96
KB
-rw-r--r--
2026-05-26 00:00
stdio.h
33.84
KB
-rw-r--r--
2026-05-26 00:00
stdio_ext.h
2.73
KB
-rw-r--r--
2026-05-26 00:00
stdlib.h
40.07
KB
-rw-r--r--
2026-05-26 00:00
string.h
19.5
KB
-rw-r--r--
2026-05-26 00:00
stringprep.h
9.53
KB
-rw-r--r--
2024-01-13 10:58
strings.h
4.64
KB
-rw-r--r--
2026-05-26 00:00
syscall.h
25
B
-rw-r--r--
2026-05-26 00:00
sysexits.h
5.11
KB
-rw-r--r--
2026-05-26 00:00
syslog.h
24
B
-rw-r--r--
2026-05-26 00:00
tar.h
3.66
KB
-rw-r--r--
2026-05-26 00:00
term.h
40.85
KB
-rw-r--r--
2026-03-24 00:00
term_entry.h
8.45
KB
-rw-r--r--
2026-03-24 00:00
termcap.h
3.39
KB
-rw-r--r--
2026-03-24 00:00
termio.h
214
B
-rw-r--r--
2026-05-26 00:00
termios.h
3.51
KB
-rw-r--r--
2026-05-26 00:00
tgmath.h
46.51
KB
-rw-r--r--
2026-05-26 00:00
thread_db.h
15.65
KB
-rw-r--r--
2026-05-26 00:00
threads.h
7.63
KB
-rw-r--r--
2026-05-26 00:00
tiff.h
58.46
KB
-rw-r--r--
2023-07-18 14:59
tiffconf.h
3.88
KB
-rw-r--r--
2026-05-11 00:00
tiffio.h
27.82
KB
-rw-r--r--
2023-09-05 10:01
tiffio.hxx
1.49
KB
-rw-r--r--
2023-05-22 13:49
tiffvers.h
1.38
KB
-rw-r--r--
2026-05-11 00:00
time.h
14.83
KB
-rw-r--r--
2026-05-26 00:00
tld.h
4.85
KB
-rw-r--r--
2024-01-13 10:58
ttyent.h
2.44
KB
-rw-r--r--
2026-05-26 00:00
uchar.h
3.04
KB
-rw-r--r--
2026-05-26 00:00
ucontext.h
1.99
KB
-rw-r--r--
2026-05-26 00:00
ulimit.h
1.55
KB
-rw-r--r--
2026-05-26 00:00
unctrl.h
3.1
KB
-rw-r--r--
2026-03-24 00:00
unistd.h
44
KB
-rw-r--r--
2026-05-26 00:00
utime.h
1.87
KB
-rw-r--r--
2026-05-26 00:00
utmp.h
3.15
KB
-rw-r--r--
2026-05-26 00:00
utmpx.h
4
KB
-rw-r--r--
2026-05-26 00:00
values.h
1.91
KB
-rw-r--r--
2026-05-26 00:00
verto-module.h
6.48
KB
-rw-r--r--
2024-10-29 00:00
verto.h
18.98
KB
-rw-r--r--
2024-10-29 00:00
wait.h
22
B
-rw-r--r--
2026-05-26 00:00
wchar.h
38.19
KB
-rw-r--r--
2026-05-26 00:00
wctype.h
5.42
KB
-rw-r--r--
2026-05-26 00:00
wordexp.h
2.44
KB
-rw-r--r--
2026-05-26 00:00
zconf.h
5.46
KB
-rw-r--r--
2025-01-13 00:00
zdict.h
25.81
KB
-rw-r--r--
2023-04-04 20:13
zlib.h
92.54
KB
-rw-r--r--
2025-01-13 00:00
zlib_name_mangling.h
230
B
-rw-r--r--
2025-01-13 00:00
zstd.h
167.36
KB
-rw-r--r--
2023-04-04 20:13
zstd_errors.h
4.43
KB
-rw-r--r--
2023-04-04 20: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