Linux premium71.web-hosting.com 4.18.0-513.11.1.lve.el8.x86_64 #1 SMP Thu Jan 18 16:21:02 UTC 2024 x86_64
LiteSpeed
Server IP : 198.187.29.8 & Your IP : 3.128.78.139
Domains :
Cant Read [ /etc/named.conf ]
User : cleahvkv
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
mysql /
server /
private /
Delete
Unzip
Name
Size
Permission
Date
Action
atomic
[ DIR ]
drwxr-xr-x
2025-02-25 11:37
aligned.h
1.11
KB
-rw-r--r--
2025-02-08 16:02
aria_backup.h
1.51
KB
-rw-r--r--
2025-02-08 16:02
assume_aligned.h
2.29
KB
-rw-r--r--
2025-02-08 16:02
authors.h
9.9
KB
-rw-r--r--
2025-02-08 16:02
backup.h
1.66
KB
-rw-r--r--
2025-02-08 16:02
bounded_queue.h
5.95
KB
-rw-r--r--
2025-02-08 16:02
client_settings.h
1.89
KB
-rw-r--r--
2025-02-08 16:02
compat56.h
2.23
KB
-rw-r--r--
2025-02-08 16:02
config.h
14.23
KB
-rw-r--r--
2025-02-08 16:02
contributors.h
4.76
KB
-rw-r--r--
2025-02-08 16:02
create_options.h
4.42
KB
-rw-r--r--
2025-02-08 16:02
create_tmp_table.h
2.74
KB
-rw-r--r--
2025-02-08 16:02
cset_narrowing.h
3.88
KB
-rw-r--r--
2025-02-08 16:02
custom_conf.h
1.06
KB
-rw-r--r--
2025-02-08 16:02
datadict.h
1.66
KB
-rw-r--r--
2025-02-08 16:02
ddl_log.h
12.39
KB
-rw-r--r--
2025-02-08 16:02
debug.h
1.21
KB
-rw-r--r--
2025-02-08 16:02
debug_sync.h
2
KB
-rw-r--r--
2025-02-08 16:02
derived_handler.h
2.32
KB
-rw-r--r--
2025-02-08 16:02
derror.h
980
B
-rw-r--r--
2025-02-08 16:02
des_key_file.h
1.21
KB
-rw-r--r--
2025-02-08 16:02
discover.h
1.53
KB
-rw-r--r--
2025-02-08 16:02
dur_prop.h
1.06
KB
-rw-r--r--
2025-02-08 16:02
embedded_priv.h
1.69
KB
-rw-r--r--
2025-02-08 16:02
event_data_objects.h
4.09
KB
-rw-r--r--
2025-02-08 16:02
event_db_repository.h
3.56
KB
-rw-r--r--
2025-02-08 16:02
event_parse_data.h
2.83
KB
-rw-r--r--
2025-02-08 16:02
event_queue.h
3.36
KB
-rw-r--r--
2025-02-08 16:02
event_scheduler.h
3.21
KB
-rw-r--r--
2025-02-08 16:02
events.h
4.59
KB
-rw-r--r--
2025-02-08 16:02
field.h
215.25
KB
-rw-r--r--
2025-02-08 16:02
field_comp.h
1.15
KB
-rw-r--r--
2025-02-08 16:02
filesort.h
7.11
KB
-rw-r--r--
2025-02-08 16:02
filesort_utils.h
8
KB
-rw-r--r--
2025-02-08 16:02
ft_global.h
3.04
KB
-rw-r--r--
2025-02-08 16:02
gcalc_slicescan.h
16.87
KB
-rw-r--r--
2025-02-08 16:02
gcalc_tools.h
11.62
KB
-rw-r--r--
2025-02-08 16:02
grant.h
2.69
KB
-rw-r--r--
2025-02-08 16:02
group_by_handler.h
3.45
KB
-rw-r--r--
2025-02-08 16:02
gstream.h
2.38
KB
-rw-r--r--
2025-02-08 16:02
ha_handler_stats.h
2.28
KB
-rw-r--r--
2025-02-08 16:02
ha_partition.h
62.9
KB
-rw-r--r--
2025-02-08 16:02
ha_sequence.h
5.95
KB
-rw-r--r--
2025-02-08 16:02
handle_connections_win.h
884
B
-rw-r--r--
2025-02-08 16:02
handler.h
196.46
KB
-rw-r--r--
2025-02-08 16:02
hash.h
4.34
KB
-rw-r--r--
2025-02-08 16:02
hash_filo.h
5.55
KB
-rw-r--r--
2025-02-08 16:02
heap.h
9.26
KB
-rw-r--r--
2025-02-08 16:02
hostname.h
5.29
KB
-rw-r--r--
2025-02-08 16:02
ilist.h
6.88
KB
-rw-r--r--
2025-02-08 16:02
init.h
852
B
-rw-r--r--
2025-02-08 16:02
innodb_priv.h
1.29
KB
-rw-r--r--
2025-02-08 16:02
item.h
271.94
KB
-rw-r--r--
2025-02-08 16:02
item_cmpfunc.h
131.86
KB
-rw-r--r--
2025-02-08 16:02
item_create.h
11.23
KB
-rw-r--r--
2025-02-08 16:02
item_func.h
133.04
KB
-rw-r--r--
2025-02-08 16:02
item_geofunc.h
37.99
KB
-rw-r--r--
2025-02-08 16:02
item_jsonfunc.h
21.99
KB
-rw-r--r--
2025-02-08 16:02
item_row.h
5.1
KB
-rw-r--r--
2025-02-08 16:02
item_strfunc.h
70.55
KB
-rw-r--r--
2025-02-08 16:02
item_subselect.h
57.71
KB
-rw-r--r--
2025-02-08 16:02
item_sum.h
70.59
KB
-rw-r--r--
2025-02-08 16:02
item_timefunc.h
63.1
KB
-rw-r--r--
2025-02-08 16:02
item_vers.h
4.23
KB
-rw-r--r--
2025-02-08 16:02
item_windowfunc.h
33.51
KB
-rw-r--r--
2025-02-08 16:02
item_xmlfunc.h
4.5
KB
-rw-r--r--
2025-02-08 16:02
json_table.h
9.28
KB
-rw-r--r--
2025-02-08 16:02
key.h
2.08
KB
-rw-r--r--
2025-02-08 16:02
keycaches.h
1.95
KB
-rw-r--r--
2025-02-08 16:02
lex.h
29.13
KB
-rw-r--r--
2025-02-08 16:02
lex_string.h
3.97
KB
-rw-r--r--
2025-02-08 16:02
lex_symbol.h
1.29
KB
-rw-r--r--
2025-02-08 16:02
lf.h
6.31
KB
-rw-r--r--
2025-02-08 16:02
lock.h
2.15
KB
-rw-r--r--
2025-02-08 16:02
log.h
45
KB
-rw-r--r--
2025-02-08 16:02
log_event.h
182.04
KB
-rw-r--r--
2025-02-08 16:02
log_event_data_type.h
1.85
KB
-rw-r--r--
2025-02-08 16:02
log_event_old.h
19.37
KB
-rw-r--r--
2025-02-08 16:02
log_slow.h
2.38
KB
-rw-r--r--
2025-02-08 16:02
maria.h
5.73
KB
-rw-r--r--
2025-02-08 16:02
mariadb.h
1.25
KB
-rw-r--r--
2025-02-08 16:02
mdl.h
37.57
KB
-rw-r--r--
2025-02-08 16:02
mem_root_array.h
6.94
KB
-rw-r--r--
2025-02-08 16:02
message.h
1.17
KB
-rw-r--r--
2025-02-08 16:02
multi_range_read.h
22.64
KB
-rw-r--r--
2025-02-08 16:02
my_alarm.h
2.37
KB
-rw-r--r--
2025-02-08 16:02
my_apc.h
4.64
KB
-rw-r--r--
2025-02-08 16:02
my_atomic.h
7.11
KB
-rw-r--r--
2025-02-08 16:02
my_atomic_wrapper.h
2.98
KB
-rw-r--r--
2025-02-08 16:02
my_base.h
26.57
KB
-rw-r--r--
2025-02-08 16:02
my_bit.h
6.05
KB
-rw-r--r--
2025-02-08 16:02
my_bitmap.h
5.74
KB
-rw-r--r--
2025-02-08 16:02
my_check_opt.h
2.56
KB
-rw-r--r--
2025-02-08 16:02
my_compare.h
10.93
KB
-rw-r--r--
2025-02-08 16:02
my_counter.h
1.68
KB
-rw-r--r--
2025-02-08 16:02
my_cpu.h
4.41
KB
-rw-r--r--
2025-02-08 16:02
my_crypt.h
904
B
-rw-r--r--
2025-02-08 16:02
my_decimal.h
14.15
KB
-rw-r--r--
2025-02-08 16:02
my_default.h
1.84
KB
-rw-r--r--
2025-02-08 16:02
my_handler_errors.h
4.77
KB
-rw-r--r--
2025-02-08 16:02
my_json_writer.h
17.95
KB
-rw-r--r--
2025-02-08 16:02
my_libwrap.h
1.16
KB
-rw-r--r--
2025-02-08 16:02
my_md5.h
1.45
KB
-rw-r--r--
2025-02-08 16:02
my_minidump.h
848
B
-rw-r--r--
2025-02-08 16:02
my_nosys.h
1.4
KB
-rw-r--r--
2025-02-08 16:02
my_rdtsc.h
8.23
KB
-rw-r--r--
2025-02-08 16:02
my_rnd.h
1.04
KB
-rw-r--r--
2025-02-08 16:02
my_service_manager.h
2
KB
-rw-r--r--
2025-02-08 16:02
my_stack_alloc.h
6.2
KB
-rw-r--r--
2025-02-08 16:02
my_stacktrace.h
3.14
KB
-rw-r--r--
2025-02-08 16:02
my_time.h
10.22
KB
-rw-r--r--
2025-02-08 16:02
my_tree.h
3.9
KB
-rw-r--r--
2025-02-08 16:02
my_uctype.h
67.9
KB
-rw-r--r--
2025-02-08 16:02
my_user.h
1.1
KB
-rw-r--r--
2025-02-08 16:02
myisam.h
17.1
KB
-rw-r--r--
2025-02-08 16:02
myisamchk.h
4.61
KB
-rw-r--r--
2025-02-08 16:02
myisammrg.h
4.78
KB
-rw-r--r--
2025-02-08 16:02
myisampack.h
14.58
KB
-rw-r--r--
2025-02-08 16:02
mysqld.h
39.51
KB
-rw-r--r--
2025-02-08 16:02
mysqld_default_groups.h
204
B
-rw-r--r--
2025-02-08 16:02
mysqld_suffix.h
1.17
KB
-rw-r--r--
2025-02-08 16:02
mysys_err.h
2.95
KB
-rw-r--r--
2025-02-08 16:02
opt_range.h
58.19
KB
-rw-r--r--
2025-02-08 16:02
opt_subselect.h
14.21
KB
-rw-r--r--
2025-02-08 16:02
opt_trace.h
8.29
KB
-rw-r--r--
2025-02-08 16:02
opt_trace_context.h
3.21
KB
-rw-r--r--
2025-02-08 16:02
parse_file.h
4.28
KB
-rw-r--r--
2025-02-08 16:02
partition_element.h
5.09
KB
-rw-r--r--
2025-02-08 16:02
partition_info.h
18.85
KB
-rw-r--r--
2025-02-08 16:02
password.h
1.14
KB
-rw-r--r--
2025-02-08 16:02
pfs_file_provider.h
3.08
KB
-rw-r--r--
2025-02-08 16:02
pfs_idle_provider.h
1.35
KB
-rw-r--r--
2025-02-08 16:02
pfs_memory_provider.h
1.59
KB
-rw-r--r--
2025-02-08 16:02
pfs_metadata_provider.h
1.85
KB
-rw-r--r--
2025-02-08 16:02
pfs_socket_provider.h
2.21
KB
-rw-r--r--
2025-02-08 16:02
pfs_stage_provider.h
1.52
KB
-rw-r--r--
2025-02-08 16:02
pfs_statement_provider.h
4.25
KB
-rw-r--r--
2025-02-08 16:02
pfs_table_provider.h
2.56
KB
-rw-r--r--
2025-02-08 16:02
pfs_thread_provider.h
5.43
KB
-rw-r--r--
2025-02-08 16:02
pfs_transaction_provider.h
2.78
KB
-rw-r--r--
2025-02-08 16:02
privilege.h
27.97
KB
-rw-r--r--
2025-02-08 16:02
probes_mysql.h
973
B
-rw-r--r--
2025-02-08 16:02
probes_mysql_dtrace.h
32.23
KB
-rw-r--r--
2025-02-08 16:02
probes_mysql_nodtrace.h
4.89
KB
-rw-r--r--
2025-02-08 16:02
procedure.h
6.63
KB
-rw-r--r--
2025-02-08 16:02
protocol.h
12.2
KB
-rw-r--r--
2025-02-08 16:02
proxy_protocol.h
548
B
-rw-r--r--
2025-02-08 16:02
queues.h
3.4
KB
-rw-r--r--
2025-02-08 16:02
records.h
3.07
KB
-rw-r--r--
2025-02-08 16:02
repl_failsafe.h
1.55
KB
-rw-r--r--
2025-02-08 16:02
replication.h
15.73
KB
-rw-r--r--
2025-02-08 16:02
rijndael.h
1.67
KB
-rw-r--r--
2025-02-08 16:02
rowid_filter.h
15.11
KB
-rw-r--r--
2025-02-08 16:02
rpl_constants.h
3.28
KB
-rw-r--r--
2025-02-08 16:02
rpl_filter.h
4.43
KB
-rw-r--r--
2025-02-08 16:02
rpl_gtid.h
13.36
KB
-rw-r--r--
2025-02-08 16:02
rpl_injector.h
9.43
KB
-rw-r--r--
2025-02-08 16:02
rpl_mi.h
14.64
KB
-rw-r--r--
2025-02-08 16:02
rpl_parallel.h
17.05
KB
-rw-r--r--
2025-02-08 16:02
rpl_record.h
1.55
KB
-rw-r--r--
2025-02-08 16:02
rpl_record_old.h
1.37
KB
-rw-r--r--
2025-02-08 16:02
rpl_reporting.h
3.63
KB
-rw-r--r--
2025-02-08 16:02
rpl_rli.h
31.98
KB
-rw-r--r--
2025-02-08 16:02
rpl_tblmap.h
3.1
KB
-rw-r--r--
2025-02-08 16:02
rpl_utility.h
9.4
KB
-rw-r--r--
2025-02-08 16:02
scheduler.h
3.12
KB
-rw-r--r--
2025-02-08 16:02
scope.h
4.29
KB
-rw-r--r--
2025-02-08 16:02
select_handler.h
2.18
KB
-rw-r--r--
2025-02-08 16:02
semisync.h
2.23
KB
-rw-r--r--
2025-02-08 16:02
semisync_master.h
24.96
KB
-rw-r--r--
2025-02-08 16:02
semisync_master_ack_receiver.h
8.5
KB
-rw-r--r--
2025-02-08 16:02
semisync_slave.h
3.65
KB
-rw-r--r--
2025-02-08 16:02
service_versions.h
2
KB
-rw-r--r--
2025-02-08 16:02
session_tracker.h
13.94
KB
-rw-r--r--
2025-02-08 16:02
set_var.h
16.16
KB
-rw-r--r--
2025-02-08 16:02
slave.h
11.99
KB
-rw-r--r--
2025-02-08 16:02
socketpair.h
842
B
-rw-r--r--
2025-02-08 16:02
source_revision.h
67
B
-rw-r--r--
2025-02-08 16:02
sp.h
22.06
KB
-rw-r--r--
2025-02-08 16:02
sp_cache.h
2
KB
-rw-r--r--
2025-02-08 16:02
sp_head.h
63
KB
-rw-r--r--
2025-02-08 16:02
sp_pcontext.h
24.31
KB
-rw-r--r--
2025-02-08 16:02
sp_rcontext.h
14
KB
-rw-r--r--
2025-02-08 16:02
span.h
3.84
KB
-rw-r--r--
2025-02-08 16:02
spatial.h
21.78
KB
-rw-r--r--
2025-02-08 16:02
sql_acl.h
13.8
KB
-rw-r--r--
2025-02-08 16:02
sql_admin.h
2.85
KB
-rw-r--r--
2025-02-08 16:02
sql_alloc.h
1.69
KB
-rw-r--r--
2025-02-08 16:02
sql_alter.h
14.92
KB
-rw-r--r--
2025-02-08 16:02
sql_analyse.h
10.86
KB
-rw-r--r--
2025-02-08 16:02
sql_analyze_stmt.h
12.38
KB
-rw-r--r--
2025-02-08 16:02
sql_array.h
6.71
KB
-rw-r--r--
2025-02-08 16:02
sql_audit.h
13.62
KB
-rw-r--r--
2025-02-08 16:02
sql_base.h
25.17
KB
-rw-r--r--
2025-02-08 16:02
sql_basic_types.h
9.3
KB
-rw-r--r--
2025-02-08 16:02
sql_binlog.h
895
B
-rw-r--r--
2025-02-08 16:02
sql_bitmap.h
7.66
KB
-rw-r--r--
2025-02-08 16:02
sql_bootstrap.h
1.77
KB
-rw-r--r--
2025-02-08 16:02
sql_cache.h
21.17
KB
-rw-r--r--
2025-02-08 16:02
sql_callback.h
1.51
KB
-rw-r--r--
2025-02-08 16:02
sql_class.h
261.08
KB
-rw-r--r--
2025-02-08 16:02
sql_cmd.h
9.13
KB
-rw-r--r--
2025-02-08 16:02
sql_connect.h
3.99
KB
-rw-r--r--
2025-02-08 16:02
sql_const.h
10.96
KB
-rw-r--r--
2025-02-08 16:02
sql_crypt.h
1.4
KB
-rw-r--r--
2025-02-08 16:02
sql_cte.h
16.15
KB
-rw-r--r--
2025-02-08 16:02
sql_cursor.h
2.26
KB
-rw-r--r--
2025-02-08 16:02
sql_db.h
2.38
KB
-rw-r--r--
2025-02-08 16:02
sql_debug.h
5.51
KB
-rw-r--r--
2025-02-08 16:02
sql_delete.h
1.31
KB
-rw-r--r--
2025-02-08 16:02
sql_derived.h
1.26
KB
-rw-r--r--
2025-02-08 16:02
sql_digest.h
3.73
KB
-rw-r--r--
2025-02-08 16:02
sql_digest_stream.h
1.53
KB
-rw-r--r--
2025-02-08 16:02
sql_do.h
954
B
-rw-r--r--
2025-02-08 16:02
sql_error.h
38.66
KB
-rw-r--r--
2025-02-08 16:02
sql_explain.h
28.34
KB
-rw-r--r--
2025-02-08 16:02
sql_expression_cache.h
4.26
KB
-rw-r--r--
2025-02-08 16:02
sql_get_diagnostics.h
7.68
KB
-rw-r--r--
2025-02-08 16:02
sql_handler.h
2.84
KB
-rw-r--r--
2025-02-08 16:02
sql_help.h
995
B
-rw-r--r--
2025-02-08 16:02
sql_hset.h
3.32
KB
-rw-r--r--
2025-02-08 16:02
sql_i_s.h
8.04
KB
-rw-r--r--
2025-02-08 16:02
sql_insert.h
2.56
KB
-rw-r--r--
2025-02-08 16:02
sql_join_cache.h
47.53
KB
-rw-r--r--
2025-02-08 16:02
sql_lex.h
168.36
KB
-rw-r--r--
2025-02-08 16:02
sql_lifo_buffer.h
9.45
KB
-rw-r--r--
2025-02-08 16:02
sql_limit.h
3.11
KB
-rw-r--r--
2025-02-08 16:02
sql_list.h
21.93
KB
-rw-r--r--
2025-02-08 16:02
sql_load.h
1.25
KB
-rw-r--r--
2025-02-08 16:02
sql_locale.h
2.64
KB
-rw-r--r--
2025-02-08 16:02
sql_manager.h
960
B
-rw-r--r--
2025-02-08 16:02
sql_mode.h
6.58
KB
-rw-r--r--
2025-02-08 16:02
sql_parse.h
8.43
KB
-rw-r--r--
2025-02-08 16:02
sql_partition.h
11.79
KB
-rw-r--r--
2025-02-08 16:02
sql_partition_admin.h
5.8
KB
-rw-r--r--
2025-02-08 16:02
sql_plist.h
7.55
KB
-rw-r--r--
2025-02-08 16:02
sql_plugin.h
7.37
KB
-rw-r--r--
2025-02-08 16:02
sql_plugin_compat.h
2.18
KB
-rw-r--r--
2025-02-08 16:02
sql_prepare.h
11.14
KB
-rw-r--r--
2025-02-08 16:02
sql_priv.h
18.16
KB
-rw-r--r--
2025-02-08 16:02
sql_profile.h
7.63
KB
-rw-r--r--
2025-02-08 16:02
sql_reload.h
1.01
KB
-rw-r--r--
2025-02-08 16:02
sql_rename.h
982
B
-rw-r--r--
2025-02-08 16:02
sql_repl.h
2.97
KB
-rw-r--r--
2025-02-08 16:02
sql_schema.h
3.23
KB
-rw-r--r--
2025-02-08 16:02
sql_select.h
86.81
KB
-rw-r--r--
2025-02-08 16:02
sql_sequence.h
5.06
KB
-rw-r--r--
2025-02-08 16:02
sql_servers.h
1.74
KB
-rw-r--r--
2025-02-08 16:02
sql_show.h
9.39
KB
-rw-r--r--
2025-02-08 16:02
sql_signal.h
3.28
KB
-rw-r--r--
2025-02-08 16:02
sql_sort.h
21.45
KB
-rw-r--r--
2025-02-08 16:02
sql_statistics.h
12.16
KB
-rw-r--r--
2025-02-08 16:02
sql_string.h
38.75
KB
-rw-r--r--
2025-02-08 16:02
sql_table.h
9.39
KB
-rw-r--r--
2025-02-08 16:02
sql_tablespace.h
956
B
-rw-r--r--
2025-02-08 16:02
sql_test.h
1.55
KB
-rw-r--r--
2025-02-08 16:02
sql_time.h
8.18
KB
-rw-r--r--
2025-02-08 16:02
sql_trigger.h
12.04
KB
-rw-r--r--
2025-02-08 16:02
sql_truncate.h
2.03
KB
-rw-r--r--
2025-02-08 16:02
sql_tvc.h
2.36
KB
-rw-r--r--
2025-02-08 16:02
sql_type.h
288.51
KB
-rw-r--r--
2025-02-08 16:02
sql_type_fixedbin.h
62.81
KB
-rw-r--r--
2025-02-08 16:02
sql_type_fixedbin_storage.h
5.34
KB
-rw-r--r--
2025-02-08 16:02
sql_type_geom.h
18.64
KB
-rw-r--r--
2025-02-08 16:02
sql_type_int.h
9.77
KB
-rw-r--r--
2025-02-08 16:02
sql_type_json.h
6.01
KB
-rw-r--r--
2025-02-08 16:02
sql_type_real.h
1.23
KB
-rw-r--r--
2025-02-08 16:02
sql_type_string.h
1.59
KB
-rw-r--r--
2025-02-08 16:02
sql_udf.h
4.74
KB
-rw-r--r--
2025-02-08 16:02
sql_union.h
1.04
KB
-rw-r--r--
2025-02-08 16:02
sql_update.h
1.88
KB
-rw-r--r--
2025-02-08 16:02
sql_view.h
2.41
KB
-rw-r--r--
2025-02-08 16:02
sql_window.h
6.65
KB
-rw-r--r--
2025-02-08 16:02
ssl_compat.h
3.07
KB
-rw-r--r--
2025-02-08 16:02
strfunc.h
2.22
KB
-rw-r--r--
2025-02-08 16:02
structs.h
25.75
KB
-rw-r--r--
2025-02-08 16:02
sys_vars_shared.h
2.67
KB
-rw-r--r--
2025-02-08 16:02
t_ctype.h
5.51
KB
-rw-r--r--
2025-02-08 16:02
table.h
112.96
KB
-rw-r--r--
2025-02-08 16:02
table_cache.h
4.13
KB
-rw-r--r--
2025-02-08 16:02
thr_alarm.h
2.86
KB
-rw-r--r--
2025-02-08 16:02
thr_lock.h
7.18
KB
-rw-r--r--
2025-02-08 16:02
thr_malloc.h
1.17
KB
-rw-r--r--
2025-02-08 16:02
thr_timer.h
1.53
KB
-rw-r--r--
2025-02-08 16:02
thread_cache.h
5.77
KB
-rw-r--r--
2025-02-08 16:02
threadpool.h
4.7
KB
-rw-r--r--
2025-02-08 16:02
threadpool_generic.h
3.88
KB
-rw-r--r--
2025-02-08 16:02
threadpool_winsockets.h
2.24
KB
-rw-r--r--
2025-02-08 16:02
transaction.h
1.43
KB
-rw-r--r--
2025-02-08 16:02
tzfile.h
4.9
KB
-rw-r--r--
2025-02-08 16:02
tztime.h
3.32
KB
-rw-r--r--
2025-02-08 16:02
uniques.h
4.12
KB
-rw-r--r--
2025-02-08 16:02
unireg.h
7.54
KB
-rw-r--r--
2025-02-08 16:02
vers_string.h
2.47
KB
-rw-r--r--
2025-02-08 16:02
violite.h
9.85
KB
-rw-r--r--
2025-02-08 16:02
waiting_threads.h
4.43
KB
-rw-r--r--
2025-02-08 16:02
welcome_copyright_notice.h
1.19
KB
-rw-r--r--
2025-02-08 16:02
win_tzname_data.h
6.35
KB
-rw-r--r--
2025-02-08 16:02
winservice.h
1.17
KB
-rw-r--r--
2025-02-08 16:02
wqueue.h
1.53
KB
-rw-r--r--
2025-02-08 16:02
wsrep.h
3.23
KB
-rw-r--r--
2025-02-08 16:02
wsrep_applier.h
2.64
KB
-rw-r--r--
2025-02-08 16:02
wsrep_binlog.h
3.36
KB
-rw-r--r--
2025-02-08 16:02
wsrep_client_service.h
2.5
KB
-rw-r--r--
2025-02-08 16:02
wsrep_client_state.h
1.53
KB
-rw-r--r--
2025-02-08 16:02
wsrep_condition_variable.h
1.45
KB
-rw-r--r--
2025-02-08 16:02
wsrep_high_priority_service.h
4.8
KB
-rw-r--r--
2025-02-08 16:02
wsrep_mutex.h
1.19
KB
-rw-r--r--
2025-02-08 16:02
wsrep_mysqld.h
20.69
KB
-rw-r--r--
2025-02-08 16:02
wsrep_mysqld_c.h
1.2
KB
-rw-r--r--
2025-02-08 16:02
wsrep_on.h
1.68
KB
-rw-r--r--
2025-02-08 16:02
wsrep_priv.h
1.6
KB
-rw-r--r--
2025-02-08 16:02
wsrep_schema.h
4.83
KB
-rw-r--r--
2025-02-08 16:02
wsrep_server_service.h
3.55
KB
-rw-r--r--
2025-02-08 16:02
wsrep_server_state.h
2.23
KB
-rw-r--r--
2025-02-08 16:02
wsrep_sst.h
3.86
KB
-rw-r--r--
2025-02-08 16:02
wsrep_storage_service.h
1.77
KB
-rw-r--r--
2025-02-08 16:02
wsrep_thd.h
10.38
KB
-rw-r--r--
2025-02-08 16:02
wsrep_trans_observer.h
17.81
KB
-rw-r--r--
2025-02-08 16:02
wsrep_types.h
997
B
-rw-r--r--
2025-02-08 16:02
wsrep_utils.h
9.07
KB
-rw-r--r--
2025-02-08 16:02
wsrep_var.h
4.38
KB
-rw-r--r--
2025-02-08 16:02
wsrep_xid.h
1.42
KB
-rw-r--r--
2025-02-08 16:02
xa.h
1.8
KB
-rw-r--r--
2025-02-08 16:02
Save
Rename
/* Copyright (c) 2010, 2019, MariaDB This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; version 2 of the License. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1335 USA */ /* Semi-join subquery optimization code definitions */ #ifdef USE_PRAGMA_INTERFACE #pragma interface /* gcc class implementation */ #endif int check_and_do_in_subquery_rewrites(JOIN *join); bool convert_join_subqueries_to_semijoins(JOIN *join); int pull_out_semijoin_tables(JOIN *join); bool optimize_semijoin_nests(JOIN *join, table_map all_table_map); bool setup_degenerate_jtbm_semi_joins(JOIN *join, List<TABLE_LIST> *join_list, List<Item> &eq_list); bool setup_jtbm_semi_joins(JOIN *join, List<TABLE_LIST> *join_list, List<Item> &eq_list); void cleanup_empty_jtbm_semi_joins(JOIN *join, List<TABLE_LIST> *join_list); // used by Loose_scan_opt ulonglong get_bound_sj_equalities(TABLE_LIST *sj_nest, table_map remaining_tables); /* This is a class for considering possible loose index scan optimizations. It's usage pattern is as follows: best_access_path() { Loose_scan_opt opt; opt.init() for each index we can do ref access with { opt.next_ref_key(); for each keyuse opt.add_keyuse(); opt.check_ref_access(); } if (some criteria for range scans) opt.check_range_access(); opt.get_best_option(); } */ class Loose_scan_opt { /* All methods must check this before doing anything else */ bool try_loosescan; /* If we consider (oe1, .. oeN) IN (SELECT ie1, .. ieN) then ieK=oeK is called sj-equality. If oeK depends only on preceding tables then such equality is called 'bound'. */ ulonglong bound_sj_equalities; /* Accumulated properties of ref access we're now considering: */ ulonglong handled_sj_equalities; key_part_map loose_scan_keyparts; uint max_loose_keypart; bool part1_conds_met; /* Use of quick select is a special case. Some of its properties: */ uint quick_uses_applicable_index; uint quick_max_loose_keypart; /* Best loose scan method so far */ uint best_loose_scan_key; double best_loose_scan_cost; double best_loose_scan_records; KEYUSE *best_loose_scan_start_key; uint best_max_loose_keypart; table_map best_ref_depend_map; public: Loose_scan_opt(): try_loosescan(false), bound_sj_equalities(0), quick_uses_applicable_index(0), quick_max_loose_keypart(0), best_loose_scan_key(0), best_loose_scan_cost(0), best_loose_scan_records(0), best_loose_scan_start_key(NULL), best_max_loose_keypart(0), best_ref_depend_map(0) { } void init(JOIN *join, JOIN_TAB *s, table_map remaining_tables) { /* Discover the bound equalities. We need to do this if 1. The next table is an SJ-inner table, and 2. It is the first table from that semijoin, and 3. We're not within a semi-join range (i.e. all semi-joins either have all or none of their tables in join_table_map), except s->emb_sj_nest (which we've just entered, see #2). 4. All non-IN-equality correlation references from this sj-nest are bound 5. But some of the IN-equalities aren't (so this can't be handled by FirstMatch strategy) */ best_loose_scan_cost= DBL_MAX; if (!join->emb_sjm_nest && s->emb_sj_nest && // (1) s->emb_sj_nest->sj_in_exprs < 64 && ((remaining_tables & s->emb_sj_nest->sj_inner_tables) == // (2) s->emb_sj_nest->sj_inner_tables) && // (2) join->cur_sj_inner_tables == 0 && // (3) !(remaining_tables & s->emb_sj_nest->nested_join->sj_corr_tables) && // (4) remaining_tables & s->emb_sj_nest->nested_join->sj_depends_on &&// (5) optimizer_flag(join->thd, OPTIMIZER_SWITCH_LOOSE_SCAN)) { /* This table is an LooseScan scan candidate */ bound_sj_equalities= get_bound_sj_equalities(s->emb_sj_nest, remaining_tables); try_loosescan= TRUE; DBUG_PRINT("info", ("Will try LooseScan scan, bound_map=%llx", (longlong)bound_sj_equalities)); } } void next_ref_key() { handled_sj_equalities=0; loose_scan_keyparts= 0; max_loose_keypart= 0; part1_conds_met= FALSE; } void add_keyuse(table_map remaining_tables, KEYUSE *keyuse) { if (try_loosescan && keyuse->sj_pred_no != UINT_MAX && (keyuse->table->file->index_flags(keyuse->key, 0, 1 ) & HA_READ_ORDER)) { if (!(remaining_tables & keyuse->used_tables)) { /* This allows to use equality propagation to infer that some sj-equalities are bound. */ bound_sj_equalities |= 1ULL << keyuse->sj_pred_no; } else { handled_sj_equalities |= 1ULL << keyuse->sj_pred_no; loose_scan_keyparts |= ((key_part_map)1) << keyuse->keypart; set_if_bigger(max_loose_keypart, keyuse->keypart); } } } bool have_a_case() { return MY_TEST(handled_sj_equalities); } void check_ref_access_part1(JOIN_TAB *s, uint key, KEYUSE *start_key, table_map found_part) { /* Check if we can use LooseScan semi-join strategy. We can if 1. This is the right table at right location 2. All IN-equalities are either - "bound", ie. the outer_expr part refers to the preceding tables - "handled", ie. covered by the index we're considering 3. Index order allows to enumerate subquery's duplicate groups in order. This happens when the index definition matches this pattern: (handled_col|bound_col)* (other_col|bound_col) */ if (try_loosescan && // (1) (handled_sj_equalities | bound_sj_equalities) == // (2) PREV_BITS(ulonglong, s->emb_sj_nest->sj_in_exprs) && // (2) (PREV_BITS(key_part_map, max_loose_keypart+1) & // (3) (found_part | loose_scan_keyparts)) == // (3) PREV_BITS(key_part_map, max_loose_keypart+1) && // (3) !key_uses_partial_cols(s->table->s, key)) { if (s->quick && s->quick->index == key && s->quick->get_type() == QUICK_SELECT_I::QS_TYPE_RANGE) { quick_uses_applicable_index= TRUE; quick_max_loose_keypart= max_loose_keypart; } DBUG_PRINT("info", ("Can use LooseScan scan")); if (found_part & 1) { /* Can use LooseScan on ref access if the first key part is bound */ part1_conds_met= TRUE; } /* Check if this is a special case where there are no usable bound IN-equalities, i.e. we have outer_expr IN (SELECT innertbl.key FROM ...) and outer_expr cannot be evaluated yet, so it's actually full index scan and not a ref access. We can do full index scan if it uses index-only. */ if (!(found_part & 1 ) && /* no usable ref access for 1st key part */ s->table->covering_keys.is_set(key)) { part1_conds_met= TRUE; DBUG_PRINT("info", ("Can use full index scan for LooseScan")); /* Calculate the cost of complete loose index scan. */ double records= rows2double(s->table->file->stats.records); /* The cost is entire index scan cost (divided by 2) */ double read_time= s->table->file->keyread_time(key, 1, (ha_rows) records); /* Now find out how many different keys we will get (for now we ignore the fact that we have "keypart_i=const" restriction for some key components, that may make us think think that loose scan will produce more distinct records than it actually will) */ ulong rpc; if ((rpc= s->table->key_info[key].rec_per_key[max_loose_keypart])) records= records / rpc; // TODO: previous version also did /2 if (read_time < best_loose_scan_cost) { best_loose_scan_key= key; best_loose_scan_cost= read_time; best_loose_scan_records= records; best_max_loose_keypart= max_loose_keypart; best_loose_scan_start_key= start_key; best_ref_depend_map= 0; } } } } void check_ref_access_part2(uint key, KEYUSE *start_key, double records, double read_time, table_map ref_depend_map_arg) { if (part1_conds_met && read_time < best_loose_scan_cost) { /* TODO use rec-per-key-based fanout calculations */ best_loose_scan_key= key; best_loose_scan_cost= read_time; best_loose_scan_records= records; best_max_loose_keypart= max_loose_keypart; best_loose_scan_start_key= start_key; best_ref_depend_map= ref_depend_map_arg; } } void check_range_access(JOIN *join, uint idx, QUICK_SELECT_I *quick) { /* TODO: this the right part restriction: */ if (quick_uses_applicable_index && idx == join->const_tables && quick->read_time < best_loose_scan_cost) { best_loose_scan_key= quick->index; best_loose_scan_cost= quick->read_time; /* this is ok because idx == join->const_tables */ best_loose_scan_records= rows2double(quick->records); best_max_loose_keypart= quick_max_loose_keypart; best_loose_scan_start_key= NULL; best_ref_depend_map= 0; } } void save_to_position(JOIN_TAB *tab, POSITION *pos) { pos->read_time= best_loose_scan_cost; if (best_loose_scan_cost != DBL_MAX) { pos->records_read= best_loose_scan_records; pos->key= best_loose_scan_start_key; pos->cond_selectivity= 1.0; pos->loosescan_picker.loosescan_key= best_loose_scan_key; pos->loosescan_picker.loosescan_parts= best_max_loose_keypart + 1; pos->use_join_buffer= FALSE; pos->table= tab; pos->range_rowid_filter_info= tab->range_rowid_filter_info; pos->ref_depend_map= best_ref_depend_map; DBUG_PRINT("info", ("Produced a LooseScan plan, key %s, %s", tab->table->key_info[best_loose_scan_key].name.str, best_loose_scan_start_key? "(ref access)": "(range/index access)")); } } }; void optimize_semi_joins(JOIN *join, table_map remaining_tables, uint idx, double *current_record_count, double *current_read_time, POSITION *loose_scan_pos); void update_sj_state(JOIN *join, const JOIN_TAB *new_tab, uint idx, table_map remaining_tables); void restore_prev_sj_state(const table_map remaining_tables, const JOIN_TAB *tab, uint idx); void fix_semijoin_strategies_for_picked_join_order(JOIN *join); bool setup_sj_materialization_part1(JOIN_TAB *sjm_tab); bool setup_sj_materialization_part2(JOIN_TAB *sjm_tab); uint get_number_of_tables_at_top_level(JOIN *join); /* Temporary table used by semi-join DuplicateElimination strategy This consists of the temptable itself and data needed to put records into it. The table's DDL is as follows: CREATE TABLE tmptable (col VARCHAR(n) BINARY, PRIMARY KEY(col)); where the primary key can be replaced with unique constraint if n exceeds the limit (as it is always done for query execution-time temptables). The record value is a concatenation of rowids of tables from the join we're executing. If a join table is on the inner side of the outer join, we assume that its rowid can be NULL and provide means to store this rowid in the tuple. */ class SJ_TMP_TABLE : public Sql_alloc { public: /* Array of pointers to tables whose rowids compose the temporary table record. */ class TAB { public: JOIN_TAB *join_tab; uint rowid_offset; ushort null_byte; uchar null_bit; }; TAB *tabs; TAB *tabs_end; /* is_degenerate==TRUE means this is a special case where the temptable record has zero length (and presence of a unique key means that the temptable can have either 0 or 1 records). In this case we don't create the physical temptable but instead record its state in SJ_TMP_TABLE::have_degenerate_row. */ bool is_degenerate; /* When is_degenerate==TRUE: the contents of the table (whether it has the record or not). */ bool have_degenerate_row; /* table record parameters */ uint null_bits; uint null_bytes; uint rowid_len; /* The temporary table itself (NULL means not created yet) */ TABLE *tmp_table; /* These are the members we got from temptable creation code. We'll need them if we'll need to convert table from HEAP to MyISAM/Maria. */ TMP_ENGINE_COLUMNDEF *start_recinfo; TMP_ENGINE_COLUMNDEF *recinfo; SJ_TMP_TABLE *next_flush_table; int sj_weedout_delete_rows(); int sj_weedout_check_row(THD *thd); bool create_sj_weedout_tmp_table(THD *thd); }; int setup_semijoin_loosescan(JOIN *join); int setup_semijoin_dups_elimination(JOIN *join, ulonglong options, uint no_jbuf_after); void destroy_sj_tmp_tables(JOIN *join); int clear_sj_tmp_tables(JOIN *join); int rewrite_to_index_subquery_engine(JOIN *join); void get_delayed_table_estimates(TABLE *table, ha_rows *out_rows, double *scan_time, double *startup_cost); enum_nested_loop_state join_tab_execution_startup(JOIN_TAB *tab);