Gecko [ www.leshallesdegournay.geraud-market.com ]

Name	Size	Permission	Date
atomic	[ DIR ]	drwxr-xr-x	2022-05-23 22:35
authors.h	9.35 KB	-rw-r--r--	2022-05-18 13:19
bounded_queue.h	6.61 KB	-rw-r--r--	2022-05-18 13:19
client_settings.h	1.89 KB	-rw-r--r--	2022-05-18 13:19
compat56.h	1.95 KB	-rw-r--r--	2022-05-18 13:19
config.h	14.49 KB	-rw-r--r--	2022-05-18 14:40
contributors.h	2.92 KB	-rw-r--r--	2022-05-18 13:19
create_options.h	4.21 KB	-rw-r--r--	2022-05-18 13:19
custom_conf.h	1.06 KB	-rw-r--r--	2022-05-18 13:19
datadict.h	1.48 KB	-rw-r--r--	2022-05-18 13:19
debug_sync.h	1.73 KB	-rw-r--r--	2022-05-18 13:19
derror.h	1.02 KB	-rw-r--r--	2022-05-18 13:19
des_key_file.h	1.21 KB	-rw-r--r--	2022-05-18 13:19
discover.h	1.57 KB	-rw-r--r--	2022-05-18 13:19
dur_prop.h	1.06 KB	-rw-r--r--	2022-05-18 13:19
embedded_priv.h	1.47 KB	-rw-r--r--	2022-05-18 13:19
event_data_objects.h	3.84 KB	-rw-r--r--	2022-05-18 13:19
event_db_repository.h	3.41 KB	-rw-r--r--	2022-05-18 13:19
event_parse_data.h	2.87 KB	-rw-r--r--	2022-05-18 13:19
event_queue.h	3.29 KB	-rw-r--r--	2022-05-18 13:19
event_scheduler.h	3.21 KB	-rw-r--r--	2022-05-18 13:19
events.h	4.43 KB	-rw-r--r--	2022-05-18 13:19
field.h	147.53 KB	-rw-r--r--	2022-05-18 13:19
filesort.h	4.61 KB	-rw-r--r--	2022-05-18 13:19
filesort_utils.h	4 KB	-rw-r--r--	2022-05-18 13:19
ft_global.h	3.04 KB	-rw-r--r--	2022-05-18 13:19
gcalc_slicescan.h	16.86 KB	-rw-r--r--	2022-05-18 13:19
gcalc_tools.h	11.38 KB	-rw-r--r--	2022-05-18 13:19
group_by_handler.h	3.08 KB	-rw-r--r--	2022-05-18 13:19
gstream.h	2.44 KB	-rw-r--r--	2022-05-18 13:19
ha_partition.h	50.87 KB	-rw-r--r--	2022-05-18 13:19
handler.h	155.48 KB	-rw-r--r--	2022-05-18 13:19
hash.h	4.39 KB	-rw-r--r--	2022-05-18 13:19
hash_filo.h	5.4 KB	-rw-r--r--	2022-05-18 13:19
heap.h	9.23 KB	-rw-r--r--	2022-05-18 13:19
hostname.h	5.35 KB	-rw-r--r--	2022-05-18 13:19
ilist.h	6.27 KB	-rw-r--r--	2022-05-18 13:19
init.h	955 B	-rw-r--r--	2022-05-18 13:19
innodb_priv.h	1.39 KB	-rw-r--r--	2022-05-18 13:19
item.h	203.54 KB	-rw-r--r--	2022-05-18 13:19
item_cmpfunc.h	91.97 KB	-rw-r--r--	2022-05-18 13:19
item_create.h	6.76 KB	-rw-r--r--	2022-05-18 13:19
item_func.h	80.86 KB	-rw-r--r--	2022-05-18 13:19
item_geofunc.h	23.31 KB	-rw-r--r--	2022-05-18 13:19
item_inetfunc.h	7.61 KB	-rw-r--r--	2022-05-18 13:19
item_jsonfunc.h	13.04 KB	-rw-r--r--	2022-05-18 13:19
item_row.h	4.33 KB	-rw-r--r--	2022-05-18 13:19
item_strfunc.h	46.53 KB	-rw-r--r--	2022-05-18 13:19
item_subselect.h	51.04 KB	-rw-r--r--	2022-05-18 13:19
item_sum.h	56.22 KB	-rw-r--r--	2022-05-18 13:19
item_timefunc.h	41 KB	-rw-r--r--	2022-05-18 13:19
item_windowfunc.h	22.36 KB	-rw-r--r--	2022-05-18 13:19
item_xmlfunc.h	3.42 KB	-rw-r--r--	2022-05-18 13:19
key.h	2.05 KB	-rw-r--r--	2022-05-18 13:19
keycaches.h	1.94 KB	-rw-r--r--	2022-05-18 13:19
lex.h	26.32 KB	-rw-r--r--	2022-05-18 13:19
lex_hash.h	126.06 KB	-rw-r--r--	2022-05-18 14:44
lex_symbol.h	1.29 KB	-rw-r--r--	2022-05-18 13:19
lex_token.h	37.96 KB	-rw-r--r--	2022-05-18 14:44
lf.h	6.24 KB	-rw-r--r--	2022-05-18 13:19
lock.h	2.11 KB	-rw-r--r--	2022-05-18 13:19
log.h	41.65 KB	-rw-r--r--	2022-05-18 13:19
log_event.h	158.17 KB	-rw-r--r--	2022-05-18 13:19
log_event_old.h	19.2 KB	-rw-r--r--	2022-05-18 13:19
log_slow.h	1.55 KB	-rw-r--r--	2022-05-18 13:19
maria.h	17.28 KB	-rw-r--r--	2022-05-18 13:19
mdl.h	33.03 KB	-rw-r--r--	2022-05-18 13:19
mem_root_array.h	6.77 KB	-rw-r--r--	2022-05-18 13:19
message.h	2.06 KB	-rw-r--r--	2022-05-18 13:19
multi_range_read.h	22.17 KB	-rw-r--r--	2022-05-18 13:19
my_alarm.h	2.24 KB	-rw-r--r--	2022-05-18 13:19
my_apc.h	4.61 KB	-rw-r--r--	2022-05-18 13:19
my_atomic.h	16.66 KB	-rw-r--r--	2022-05-18 13:19
my_base.h	25.05 KB	-rw-r--r--	2022-05-18 13:19
my_bit.h	3.15 KB	-rw-r--r--	2022-05-18 13:19
my_bitmap.h	5.98 KB	-rw-r--r--	2022-05-18 13:19
my_check_opt.h	2.56 KB	-rw-r--r--	2022-05-18 13:19
my_compare.h	5.36 KB	-rw-r--r--	2022-05-18 13:19
my_context.h	6.59 KB	-rw-r--r--	2022-05-18 13:19
my_cpu.h	1.45 KB	-rw-r--r--	2022-05-18 13:19
my_crypt.h	904 B	-rw-r--r--	2022-05-18 13:19
my_decimal.h	12.52 KB	-rw-r--r--	2022-05-18 13:19
my_default.h	2.47 KB	-rw-r--r--	2022-05-18 13:19
my_handler_errors.h	4.52 KB	-rw-r--r--	2022-05-18 13:19
my_json_writer.h	4.88 KB	-rw-r--r--	2022-05-18 13:19
my_libwrap.h	1.16 KB	-rw-r--r--	2022-05-18 13:19
my_md5.h	1.45 KB	-rw-r--r--	2022-05-18 13:19
my_nosys.h	1.4 KB	-rw-r--r--	2022-05-18 13:19
my_rdtsc.h	3.87 KB	-rw-r--r--	2022-05-18 13:19
my_rnd.h	1.04 KB	-rw-r--r--	2022-05-18 13:19
my_service_manager.h	1.47 KB	-rw-r--r--	2022-05-18 13:19
my_stacktrace.h	2.97 KB	-rw-r--r--	2022-05-18 13:19
my_time.h	8.75 KB	-rw-r--r--	2022-05-18 13:19
my_tree.h	3.89 KB	-rw-r--r--	2022-05-18 13:19
my_uctype.h	67.9 KB	-rw-r--r--	2022-05-18 13:19
my_user.h	1.12 KB	-rw-r--r--	2022-05-18 13:19
myisam.h	16.84 KB	-rw-r--r--	2022-05-18 13:19
myisamchk.h	4.7 KB	-rw-r--r--	2022-05-18 13:19
myisammrg.h	4.63 KB	-rw-r--r--	2022-05-18 13:19
myisampack.h	14.58 KB	-rw-r--r--	2022-05-18 13:19
mysql_async.h	1.77 KB	-rw-r--r--	2022-05-18 13:19
mysqld.h	31.32 KB	-rw-r--r--	2022-05-18 13:19
mysqld_default_groups.h	169 B	-rw-r--r--	2022-05-18 13:19
mysqld_suffix.h	1.17 KB	-rw-r--r--	2022-05-18 13:19
mysys_err.h	2.81 KB	-rw-r--r--	2022-05-18 13:19
nt_servc.h	3 KB	-rw-r--r--	2022-05-18 13:19
opt_range.h	53.25 KB	-rw-r--r--	2022-05-18 13:19
opt_subselect.h	13.76 KB	-rw-r--r--	2022-05-18 13:19
parse_file.h	4.12 KB	-rw-r--r--	2022-05-18 13:19
partition_element.h	4.52 KB	-rw-r--r--	2022-05-18 13:19
partition_info.h	14.25 KB	-rw-r--r--	2022-05-18 13:19
password.h	1.17 KB	-rw-r--r--	2022-05-18 13:19
pcre.h	30.97 KB	-rw-r--r--	2022-05-18 14:40
probes_mysql.h	973 B	-rw-r--r--	2022-05-18 13:19
probes_mysql_dtrace.h	32.23 KB	-rw-r--r--	2022-05-18 14:43
probes_mysql_nodtrace.h	4.89 KB	-rw-r--r--	2022-05-18 14:43
procedure.h	5.83 KB	-rw-r--r--	2022-05-18 13:19
protocol.h	9.72 KB	-rw-r--r--	2022-05-18 13:19
queues.h	3.51 KB	-rw-r--r--	2022-05-18 13:19
records.h	2.99 KB	-rw-r--r--	2022-05-18 13:19
repl_failsafe.h	1.69 KB	-rw-r--r--	2022-05-18 13:19
replication.h	15.96 KB	-rw-r--r--	2022-05-18 13:19
rijndael.h	1.67 KB	-rw-r--r--	2022-05-18 13:19
rpl_constants.h	3.28 KB	-rw-r--r--	2022-05-18 13:19
rpl_filter.h	4.41 KB	-rw-r--r--	2022-05-18 13:19
rpl_gtid.h	10.47 KB	-rw-r--r--	2022-05-18 13:19
rpl_handler.h	5.53 KB	-rw-r--r--	2022-05-18 13:19
rpl_injector.h	9.42 KB	-rw-r--r--	2022-05-18 13:19
rpl_mi.h	12.36 KB	-rw-r--r--	2022-05-18 13:19
rpl_parallel.h	13.3 KB	-rw-r--r--	2022-05-18 13:19
rpl_record.h	1.61 KB	-rw-r--r--	2022-05-18 13:19
rpl_record_old.h	1.37 KB	-rw-r--r--	2022-05-18 13:19
rpl_reporting.h	2.96 KB	-rw-r--r--	2022-05-18 13:19
rpl_rli.h	31.89 KB	-rw-r--r--	2022-05-18 13:19
rpl_tblmap.h	3.1 KB	-rw-r--r--	2022-05-18 13:19
rpl_utility.h	9.32 KB	-rw-r--r--	2022-05-18 13:19
scheduler.h	3.43 KB	-rw-r--r--	2022-05-18 13:19
service_versions.h	1.82 KB	-rw-r--r--	2022-05-18 13:19
session_tracker.h	8.8 KB	-rw-r--r--	2022-05-18 13:19
set_var.h	14.52 KB	-rw-r--r--	2022-05-18 13:19
slave.h	11.14 KB	-rw-r--r--	2022-05-18 13:19
sp.h	7.13 KB	-rw-r--r--	2022-05-18 13:19
sp_cache.h	2.02 KB	-rw-r--r--	2022-05-18 13:19
sp_head.h	36.17 KB	-rw-r--r--	2022-05-18 13:19
sp_pcontext.h	16.61 KB	-rw-r--r--	2022-05-18 13:19
sp_rcontext.h	15.43 KB	-rw-r--r--	2022-05-18 13:19
span.h	3.83 KB	-rw-r--r--	2022-05-18 13:19
spatial.h	20.68 KB	-rw-r--r--	2022-05-18 13:19
sql_acl.h	17.23 KB	-rw-r--r--	2022-05-18 13:19
sql_admin.h	2.69 KB	-rw-r--r--	2022-05-18 13:19
sql_alter.h	12 KB	-rw-r--r--	2022-05-18 13:19
sql_analyse.h	10.91 KB	-rw-r--r--	2022-05-18 13:19
sql_analyze_stmt.h	7.61 KB	-rw-r--r--	2022-05-18 13:19
sql_array.h	5.92 KB	-rw-r--r--	2022-05-18 13:19
sql_audit.h	14.57 KB	-rw-r--r--	2022-05-18 13:19
sql_base.h	24.9 KB	-rw-r--r--	2022-05-18 13:19
sql_basic_types.h	951 B	-rw-r--r--	2022-05-18 13:19
sql_binlog.h	895 B	-rw-r--r--	2022-05-18 13:19
sql_bitmap.h	7.2 KB	-rw-r--r--	2022-05-18 13:19
sql_bootstrap.h	1.63 KB	-rw-r--r--	2022-05-18 13:19
sql_cache.h	20.88 KB	-rw-r--r--	2022-05-18 13:19
sql_callback.h	1.51 KB	-rw-r--r--	2022-05-18 13:19
sql_class.h	195.45 KB	-rw-r--r--	2022-05-18 13:19
sql_cmd.h	7.26 KB	-rw-r--r--	2022-05-18 13:19
sql_connect.h	3.56 KB	-rw-r--r--	2022-05-18 13:19
sql_const.h	10.43 KB	-rw-r--r--	2022-05-18 13:19
sql_crypt.h	1.39 KB	-rw-r--r--	2022-05-18 13:19
sql_cte.h	14.64 KB	-rw-r--r--	2022-05-18 13:19
sql_cursor.h	2.02 KB	-rw-r--r--	2022-05-18 13:19
sql_db.h	2.01 KB	-rw-r--r--	2022-05-18 13:19
sql_delete.h	1.32 KB	-rw-r--r--	2022-05-18 13:19
sql_derived.h	1.51 KB	-rw-r--r--	2022-05-18 13:19
sql_digest.h	3.72 KB	-rw-r--r--	2022-05-18 13:19
sql_digest_stream.h	1.53 KB	-rw-r--r--	2022-05-18 13:19
sql_do.h	954 B	-rw-r--r--	2022-05-18 13:19
sql_error.h	29.86 KB	-rw-r--r--	2022-05-18 13:19
sql_explain.h	24.63 KB	-rw-r--r--	2022-05-18 13:19
sql_expression_cache.h	4.21 KB	-rw-r--r--	2022-05-18 13:19
sql_get_diagnostics.h	7.66 KB	-rw-r--r--	2022-05-18 13:19
sql_handler.h	2.68 KB	-rw-r--r--	2022-05-18 13:19
sql_help.h	920 B	-rw-r--r--	2022-05-18 13:19
sql_hset.h	3.2 KB	-rw-r--r--	2022-05-18 13:19
sql_insert.h	2.06 KB	-rw-r--r--	2022-05-18 13:19
sql_join_cache.h	46.6 KB	-rw-r--r--	2022-05-18 13:19
sql_lex.h	103.48 KB	-rw-r--r--	2022-05-18 13:19
sql_lifo_buffer.h	9.23 KB	-rw-r--r--	2022-05-18 13:19
sql_list.h	21.37 KB	-rw-r--r--	2022-05-18 13:19
sql_load.h	1.24 KB	-rw-r--r--	2022-05-18 13:19
sql_locale.h	2.67 KB	-rw-r--r--	2022-05-18 13:19
sql_manager.h	960 B	-rw-r--r--	2022-05-18 13:19
sql_mode.h	6.57 KB	-rw-r--r--	2022-05-18 13:19
sql_parse.h	8.02 KB	-rw-r--r--	2022-05-18 13:19
sql_partition.h	11.43 KB	-rw-r--r--	2022-05-18 13:19
sql_partition_admin.h	5.68 KB	-rw-r--r--	2022-05-18 13:19
sql_plist.h	7.58 KB	-rw-r--r--	2022-05-18 13:19
sql_plugin.h	7.48 KB	-rw-r--r--	2022-05-18 13:19
sql_plugin_compat.h	2.18 KB	-rw-r--r--	2022-05-18 13:19
sql_prepare.h	11.3 KB	-rw-r--r--	2022-05-18 13:19
sql_priv.h	15.99 KB	-rw-r--r--	2022-05-18 13:19
sql_profile.h	7.39 KB	-rw-r--r--	2022-05-18 13:19
sql_reload.h	1.01 KB	-rw-r--r--	2022-05-18 13:19
sql_rename.h	941 B	-rw-r--r--	2022-05-18 13:19
sql_repl.h	3.24 KB	-rw-r--r--	2022-05-18 13:19
sql_select.h	77.03 KB	-rw-r--r--	2022-05-18 13:19
sql_servers.h	1.78 KB	-rw-r--r--	2022-05-18 13:19
sql_show.h	8.84 KB	-rw-r--r--	2022-05-18 13:19
sql_signal.h	4.05 KB	-rw-r--r--	2022-05-18 13:19
sql_sort.h	4.1 KB	-rw-r--r--	2022-05-18 13:19
sql_statistics.h	11.56 KB	-rw-r--r--	2022-05-18 13:19
sql_string.h	21.94 KB	-rw-r--r--	2022-05-18 13:19
sql_table.h	11.06 KB	-rw-r--r--	2022-05-18 13:19
sql_tablespace.h	956 B	-rw-r--r--	2022-05-18 13:19
sql_test.h	1.45 KB	-rw-r--r--	2022-05-18 13:19
sql_time.h	10.28 KB	-rw-r--r--	2022-05-18 13:19
sql_trigger.h	10.58 KB	-rw-r--r--	2022-05-18 13:19
sql_truncate.h	2.01 KB	-rw-r--r--	2022-05-18 13:19
sql_type.h	19.73 KB	-rw-r--r--	2022-05-18 13:19
sql_type_int.h	2.85 KB	-rw-r--r--	2022-05-18 13:19
sql_udf.h	4.04 KB	-rw-r--r--	2022-05-18 13:19
sql_union.h	1.1 KB	-rw-r--r--	2022-05-18 13:19
sql_update.h	1.92 KB	-rw-r--r--	2022-05-18 13:19
sql_view.h	2.26 KB	-rw-r--r--	2022-05-18 13:19
sql_window.h	5.89 KB	-rw-r--r--	2022-05-18 13:19
sql_yacc.h	35.19 KB	-rw-r--r--	2022-05-18 13:19
ssl_compat.h	2.97 KB	-rw-r--r--	2022-05-18 13:19
strfunc.h	2.21 KB	-rw-r--r--	2022-05-18 13:19
structs.h	20.36 KB	-rw-r--r--	2022-05-18 13:19
sys_vars_shared.h	2.6 KB	-rw-r--r--	2022-05-18 13:19
t_ctype.h	5.51 KB	-rw-r--r--	2022-05-18 13:19
table.h	95.89 KB	-rw-r--r--	2022-05-18 13:19
table_cache.h	4.24 KB	-rw-r--r--	2022-05-18 13:19
thr_alarm.h	2.87 KB	-rw-r--r--	2022-05-18 13:19
thr_lock.h	6.66 KB	-rw-r--r--	2022-05-18 13:19
thr_malloc.h	1.22 KB	-rw-r--r--	2022-05-18 13:19
thr_timer.h	1.43 KB	-rw-r--r--	2022-05-18 13:19
thread_pool_priv.h	4.48 KB	-rw-r--r--	2022-05-18 13:19
threadpool.h	4.32 KB	-rw-r--r--	2022-05-18 13:19
transaction.h	1.57 KB	-rw-r--r--	2022-05-18 13:19
tzfile.h	4.9 KB	-rw-r--r--	2022-05-18 13:19
tztime.h	3.28 KB	-rw-r--r--	2022-05-18 13:19
uniques.h	4.05 KB	-rw-r--r--	2022-05-18 13:19
unireg.h	7.22 KB	-rw-r--r--	2022-05-18 13:19
violite.h	9.83 KB	-rw-r--r--	2022-05-18 13:19
waiting_threads.h	4.45 KB	-rw-r--r--	2022-05-18 13:19
welcome_copyright_notice.h	1.19 KB	-rw-r--r--	2022-05-18 13:19
win_tzname_data.h	6.31 KB	-rw-r--r--	2022-05-18 13:19
winservice.h	1.17 KB	-rw-r--r--	2022-05-18 13:19
wqueue.h	1.55 KB	-rw-r--r--	2022-05-18 13:19
wsrep.h	3.01 KB	-rw-r--r--	2022-05-18 13:19
wsrep_applier.h	1.67 KB	-rw-r--r--	2022-05-18 13:19
wsrep_binlog.h	2.06 KB	-rw-r--r--	2022-05-18 13:19
wsrep_mysqld.h	13.88 KB	-rw-r--r--	2022-05-18 13:19
wsrep_mysqld_c.h	1.2 KB	-rw-r--r--	2022-05-18 13:19
wsrep_priv.h	2.07 KB	-rw-r--r--	2022-05-18 13:19
wsrep_sst.h	3.08 KB	-rw-r--r--	2022-05-18 13:19
wsrep_thd.h	2.05 KB	-rw-r--r--	2022-05-18 13:19
wsrep_utils.h	9.02 KB	-rw-r--r--	2022-05-18 13:19
wsrep_var.h	3.72 KB	-rw-r--r--	2022-05-18 13:19
wsrep_xid.h	1.38 KB	-rw-r--r--	2022-05-18 13:19

Rename

#ifndef STRUCTS_INCLUDED
#define STRUCTS_INCLUDED

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 St, Fifth Floor, Boston, MA 02110-1335  USA */

/* The old structures from unireg */

#include "sql_plugin.h"                         /* plugin_ref */
#include "sql_const.h"                          /* MAX_REFLENGTH */
#include "my_time.h"                   /* enum_mysql_timestamp_type */
#include "thr_lock.h"                  /* thr_lock_type */
#include "my_base.h"                   /* ha_rows, ha_key_alg */
#include <mysql_com.h>                  /* USERNAME_LENGTH */

struct TABLE;
class Field;
class Index_statistics;

class THD;

typedef struct st_date_time_format {
  uchar positions[8];
  char  time_separator;			/* Separator between hour and minute */
  uint flag;				/* For future */
  LEX_STRING format;
} DATE_TIME_FORMAT;

typedef struct st_keyfile_info {	/* used with ha_info() */
  uchar ref[MAX_REFLENGTH];		/* Pointer to current row */
  uchar dupp_ref[MAX_REFLENGTH];	/* Pointer to dupp row */
  uint ref_length;			/* Length of ref (1-8) */
  uint block_size;			/* index block size */
  File filenr;				/* (uniq) filenr for table */
  ha_rows records;			/* Records i datafilen */
  ha_rows deleted;			/* Deleted records */
  ulonglong data_file_length;		/* Length off data file */
  ulonglong max_data_file_length;	/* Length off data file */
  ulonglong index_file_length;
  ulonglong max_index_file_length;
  ulonglong delete_length;		/* Free bytes */
  ulonglong auto_increment_value;
  int errkey,sortkey;			/* Last errorkey and sorted by */
  time_t create_time;			/* When table was created */
  time_t check_time;
  time_t update_time;
  ulong mean_rec_length;		/* physical reclength */
} KEYFILE_INFO;

typedef struct st_key_part_info {	/* Info about a key part */
  Field *field;                         /* the Field object for the indexed
                                           prefix of the original table Field.
                                           NOT necessarily the original Field */
  uint  offset;                         /* Offset in record (from 0) */
  uint  null_offset;                    /* Offset to null_bit in record */
  /* Length of key part in bytes, excluding NULL flag and length bytes */
  uint length;
  /* 
    Number of bytes required to store the keypart value. This may be
    different from the "length" field as it also counts
     - possible NULL-flag byte (see HA_KEY_NULL_LENGTH)
     - possible HA_KEY_BLOB_LENGTH bytes needed to store actual value length.
  */
  uint store_length;
  uint16 key_type;
  uint16 fieldnr;                       /* Fieldnr begins counting from 1 */
  uint16 key_part_flag;                 /* 0 or HA_REVERSE_SORT */
  uint8 type;
  uint8 null_bit;			/* Position to null_bit */
} KEY_PART_INFO ;

class engine_option_value;
struct ha_index_option_struct;

typedef struct st_key {
  uint	key_length;			/* total length of user defined key parts  */
  ulong flags;                          /* dupp key and pack flags */
  uint	user_defined_key_parts;	   /* How many key_parts */
  uint	usable_key_parts; /* Should normally be = user_defined_key_parts */
  uint ext_key_parts;              /* Number of key parts in extended key */
  ulong ext_key_flags;             /* Flags for extended key              */
  /*
    Parts of primary key that are in the extension of this index.

Example: if this structure describes idx1, which is defined as 
      INDEX idx1 (pk2, col2)
    and pk is defined as:
      PRIMARY KEY (pk1, pk2)
    then 
      pk1 is in the extension idx1, ext_key_part_map.is_set(0) == true
      pk2 is explicitly present in idx1, it is not in the extension, so
      ext_key_part_map.is_set(1) == false
  */
  key_part_map ext_key_part_map;
  uint  block_size;
  uint  name_length;
  enum  ha_key_alg algorithm;
  /* 
    The flag is on if statistical data for the index prefixes
    has to be taken from the system statistical tables.
  */
  bool is_statistics_from_stat_tables;
  /*
    Note that parser is used when the table is opened for use, and
    parser_name is used when the table is being created.
  */
  union
  {
    plugin_ref parser;                  /* Fulltext [pre]parser */
    LEX_STRING *parser_name;            /* Fulltext [pre]parser name */
  };
  KEY_PART_INFO *key_part;
  char	*name;				/* Name of key */
  /* Unique name for cache;  db + \0 + table_name + \0 + key_name + \0 */
  uchar *cache_name;
  /*
    Array of AVG(#records with the same field value) for 1st ... Nth key part.
    0 means 'not known'.
    For temporary heap tables this member is NULL.
  */
  ulong *rec_per_key;

/*
    This structure is used for statistical data on the index
    that has been read from the statistical table index_stat
  */ 
  Index_statistics *read_stats;
  /*
    This structure is used for statistical data on the index that
    is collected by the function collect_statistics_for_table
  */
  Index_statistics *collected_stats;
 
  union {
    int  bdb_return_if_eq;
  } handler;
  TABLE *table;
  LEX_STRING comment;
  /** reference to the list of options or NULL */
  engine_option_value *option_list;
  ha_index_option_struct *option_struct;                  /* structure with parsed options */

double actual_rec_per_key(uint i);

} KEY;

struct st_join_table;

typedef struct st_reginfo {		/* Extra info about reg */
  struct st_join_table *join_tab;	/* Used by SELECT() */
  enum thr_lock_type lock_type;		/* How database is used */
  bool not_exists_optimize;
  /*
    TRUE <=> range optimizer found that there is no rows satisfying
    table conditions.
  */
  bool impossible_range;
} REGINFO;

/*
  Originally MySQL used MYSQL_TIME structure inside server only, but since
  4.1 it's exported to user in the new client API. Define aliases for
  new names to keep existing code simple.
*/

typedef enum enum_mysql_timestamp_type timestamp_type;

typedef struct {
  ulong year,month,day,hour;
  ulonglong minute,second,second_part;
  bool neg;
} INTERVAL;

typedef struct st_known_date_time_format {
  const char *format_name;
  const char *date_format;
  const char *datetime_format;
  const char *time_format;
} KNOWN_DATE_TIME_FORMAT;

extern const char *show_comp_option_name[];

typedef int *(*update_var)(THD *, struct st_mysql_show_var *);

typedef struct	st_lex_user {
  LEX_STRING user, host, plugin, auth;
  LEX_STRING pwtext, pwhash;
  bool is_role() const { return user.str[0] && !host.str[0]; }
  void set_lex_string(LEX_STRING *l, char *buf)
  {
    if (is_role())
      *l= user;
    else
      l->length= strxmov(l->str= buf, user.str, "@", host.str, NullS) - buf;
  }
  void reset_auth()
  {
    pwtext.length= pwhash.length= plugin.length= auth.length= 0;
    pwtext.str= pwhash.str= 0;
    plugin.str= auth.str= const_cast<char*>("");
  }
} LEX_USER;

/*
  This structure specifies the maximum amount of resources which
  can be consumed by each account. Zero value of a member means
  there is no limit.
*/
typedef struct user_resources {
  /* Maximum number of queries/statements per hour. */
  uint questions;
  /*
     Maximum number of updating statements per hour (which statements are
     updating is defined by sql_command_flags array).
  */
  uint updates;
  /* Maximum number of connections established per hour. */
  uint conn_per_hour;
  /*
    Maximum number of concurrent connections. If -1 then no new
    connections allowed
  */
  int user_conn;
  /* Max query timeout */
  double max_statement_time;

/*
     Values of this enum and specified_limits member are used by the
     parser to store which user limits were specified in GRANT statement.
  */
  enum {QUERIES_PER_HOUR= 1, UPDATES_PER_HOUR= 2, CONNECTIONS_PER_HOUR= 4,
        USER_CONNECTIONS= 8, MAX_STATEMENT_TIME= 16};
  uint specified_limits;
} USER_RESOURCES;

/*
  This structure is used for counting resources consumed and for checking
  them against specified user limits.
*/
typedef struct  user_conn {
  /*
     Pointer to user+host key (pair separated by '\0') defining the entity
     for which resources are counted (By default it is user account thus
     priv_user/priv_host pair is used. If --old-style-user-limits option
     is enabled, resources are counted for each user+host separately).
  */
  char *user;
  /* Pointer to host part of the key. */
  char *host;
  /**
     The moment of time when per hour counters were reset last time
     (i.e. start of "hour" for conn_per_hour, updates, questions counters).
  */
  ulonglong reset_utime;
  /* Total length of the key. */
  uint len;
  /* Current amount of concurrent connections for this account. */
  int connections;
  /*
     Current number of connections per hour, number of updating statements
     per hour and total number of statements per hour for this account.
  */
  uint conn_per_hour, updates, questions;
  /* Maximum amount of resources which account is allowed to consume. */
  USER_RESOURCES user_resources;
} USER_CONN;

typedef struct st_user_stats
{
  char user[MY_MAX(USERNAME_LENGTH, LIST_PROCESS_HOST_LEN) + 1];
  // Account name the user is mapped to when this is a user from mapped_user.
  // Otherwise, the same value as user.
  char priv_user[MY_MAX(USERNAME_LENGTH, LIST_PROCESS_HOST_LEN) + 1];
  uint user_name_length;
  uint total_connections;
  uint total_ssl_connections;
  uint concurrent_connections;
  time_t connected_time;  // in seconds
  ha_rows rows_read, rows_sent;
  ha_rows rows_updated, rows_deleted, rows_inserted;
  ulonglong bytes_received;
  ulonglong bytes_sent;
  ulonglong binlog_bytes_written;
  ulonglong select_commands, update_commands, other_commands;
  ulonglong commit_trans, rollback_trans;
  ulonglong denied_connections, lost_connections, max_statement_time_exceeded;
  ulonglong access_denied_errors;
  ulonglong empty_queries;
  double busy_time;       // in seconds
  double cpu_time;        // in seconds
} USER_STATS;

typedef struct st_table_stats
{
  char table[NAME_LEN * 2 + 2];  // [db] + '\0' + [table] + '\0'
  uint table_name_length;
  ulonglong rows_read, rows_changed;
  ulonglong rows_changed_x_indexes;
  /* Stores enum db_type, but forward declarations cannot be done */
  int engine_type;
} TABLE_STATS;

typedef struct st_index_stats
{
  // [db] + '\0' + [table] + '\0' + [index] + '\0'
  char index[NAME_LEN * 3 + 3];
  uint index_name_length;                       /* Length of 'index' */
  ulonglong rows_read;
} INDEX_STATS;

/* Bits in form->update */
#define REG_MAKE_DUPP		1U	/* Make a copy of record when read */
#define REG_NEW_RECORD		2U	/* Write a new record if not found */
#define REG_UPDATE		4U	/* Uppdate record */
#define REG_DELETE		8U	/* Delete found record */
#define REG_PROG		16U	/* User is updating database */
#define REG_CLEAR_AFTER_WRITE	32U
#define REG_MAY_BE_UPDATED	64U
#define REG_AUTO_UPDATE		64U	/* Used in D-forms for scroll-tables */
#define REG_OVERWRITE		128U
#define REG_SKIP_DUP		256U

/* Bits in form->status */
#define STATUS_NO_RECORD	(1U+2U)	/* Record isn't usable */
#define STATUS_GARBAGE		1U
#define STATUS_NOT_FOUND	2U	/* No record in database when needed */
#define STATUS_NO_PARENT	4U	/* Parent record wasn't found */
#define STATUS_NOT_READ		8U	/* Record isn't read */
#define STATUS_UPDATED		16U	/* Record is updated by formula */
#define STATUS_NULL_ROW		32U	/* table->null_row is set */
#define STATUS_DELETED		64U

/*
  Such interval is "discrete": it is the set of
  { auto_inc_interval_min + k * increment,
    0 <= k <= (auto_inc_interval_values-1) }
  Where "increment" is maintained separately by the user of this class (and is
  currently only thd->variables.auto_increment_increment).
  It mustn't derive from Sql_alloc, because SET INSERT_ID needs to
  allocate memory which must stay allocated for use by the next statement.
*/
class Discrete_interval {
private:
  ulonglong interval_min;
  ulonglong interval_values;
  ulonglong  interval_max;    // excluded bound. Redundant.
public:
  Discrete_interval *next;    // used when linked into Discrete_intervals_list
  void replace(ulonglong start, ulonglong val, ulonglong incr)
  {
    interval_min=    start;
    interval_values= val;
    interval_max=    (val == ULONGLONG_MAX) ? val : start + val * incr;
  }
  Discrete_interval(ulonglong start, ulonglong val, ulonglong incr) :
    next(NULL) { replace(start, val, incr); };
  Discrete_interval() : next(NULL) { replace(0, 0, 0); };
  ulonglong minimum() const { return interval_min;    };
  ulonglong values()  const { return interval_values; };
  ulonglong maximum() const { return interval_max;    };
  /*
    If appending [3,5] to [1,2], we merge both in [1,5] (they should have the
    same increment for that, user of the class has to ensure that). That is
    just a space optimization. Returns 0 if merge succeeded.
  */
  bool merge_if_contiguous(ulonglong start, ulonglong val, ulonglong incr)
  {
    if (interval_max == start)
    {
      if (val == ULONGLONG_MAX)
      {
        interval_values=   interval_max= val;
      }
      else
      {
        interval_values+=  val;
        interval_max=      start + val * incr;
      }
      return 0;
    }
    return 1;
  };
};

/* List of Discrete_interval objects */
class Discrete_intervals_list {
private:
  Discrete_interval        *head;
  Discrete_interval        *tail;
  /*
    When many intervals are provided at the beginning of the execution of a
    statement (in a replication slave or SET INSERT_ID), "current" points to
    the interval being consumed by the thread now (so "current" goes from
    "head" to "tail" then to NULL).
  */
  Discrete_interval        *current;
  uint                  elements; // number of elements
  void set_members(Discrete_interval *h, Discrete_interval *t,
                   Discrete_interval *c, uint el)
  {  
    head= h;
    tail= t;
    current= c;
    elements= el;
  }
  void operator=(Discrete_intervals_list &);  /* prevent use of these */
  Discrete_intervals_list(const Discrete_intervals_list &);

public:
  Discrete_intervals_list() : head(NULL), current(NULL), elements(0) {};
  void empty_no_free()
  {
    set_members(NULL, NULL, NULL, 0);
  }
  void empty()
  {
    for (Discrete_interval *i= head; i;)
    {
      Discrete_interval *next= i->next;
      delete i;
      i= next;
    }
    empty_no_free();
  }
  void copy_shallow(const Discrete_intervals_list * dli)
  {
    head= dli->get_head();
    tail= dli->get_tail();
    current= dli->get_current();
    elements= dli->nb_elements();
  }
  void swap (Discrete_intervals_list * dli)
  {
    Discrete_interval *h, *t, *c;
    uint el;
    h= dli->get_head();
    t= dli->get_tail();
    c= dli->get_current();
    el= dli->nb_elements();
    dli->copy_shallow(this);
    set_members(h, t, c, el);
  }
  const Discrete_interval* get_next()
  {
    Discrete_interval *tmp= current;
    if (current != NULL)
      current= current->next;
    return tmp;
  }
  ~Discrete_intervals_list() { empty(); };
  bool append(ulonglong start, ulonglong val, ulonglong incr);
  bool append(Discrete_interval *interval);
  ulonglong minimum()     const { return (head ? head->minimum() : 0); };
  ulonglong maximum()     const { return (head ? tail->maximum() : 0); };
  uint      nb_elements() const { return elements; }
  Discrete_interval* get_head() const { return head; };
  Discrete_interval* get_tail() const { return tail; };
  Discrete_interval* get_current() const { return current; };
};

/*
  DDL options:
  - CREATE IF NOT EXISTS
  - DROP IF EXISTS
  - CREATE LIKE
  - REPLACE
*/
struct DDL_options_st
{
public:
  enum Options
  {
    OPT_NONE= 0,
    OPT_IF_NOT_EXISTS= 2,              // CREATE TABLE IF NOT EXISTS
    OPT_LIKE= 4,                       // CREATE TABLE LIKE
    OPT_OR_REPLACE= 16,                // CREATE OR REPLACE TABLE
    OPT_OR_REPLACE_SLAVE_GENERATED= 32,// REPLACE was added on slave, it was
                                       // not in the original query on master.
    OPT_IF_EXISTS= 64
  };

private:
  Options m_options;

public:
  Options create_like_options() const
  {
    return (DDL_options_st::Options)
           (((uint) m_options) & (OPT_IF_NOT_EXISTS | OPT_OR_REPLACE));
  }
  void init() { m_options= OPT_NONE; }
  void init(Options options) { m_options= options; }
  void set(Options other)
  {
    m_options= other;
  }
  void set(const DDL_options_st other)
  {
    m_options= other.m_options;
  }
  bool if_not_exists() const { return m_options & OPT_IF_NOT_EXISTS; }
  bool or_replace() const { return m_options & OPT_OR_REPLACE; }
  bool or_replace_slave_generated() const
  { return m_options & OPT_OR_REPLACE_SLAVE_GENERATED; }
  bool like() const { return m_options & OPT_LIKE; }
  bool if_exists() const { return m_options & OPT_IF_EXISTS; }
  void add(const DDL_options_st::Options other)
  {
    m_options= (Options) ((uint) m_options | (uint) other);
  }
  void add(const DDL_options_st &other)
  {
    add(other.m_options);
  }
  DDL_options_st operator|(const DDL_options_st &other)
  {
    add(other.m_options);
    return *this;
  }
  DDL_options_st operator|=(DDL_options_st::Options other)
  {
    add(other);
    return *this;
  }
};

class DDL_options: public DDL_options_st
{
public:
  DDL_options() { init(); }
  DDL_options(Options options) { init(options); }
  DDL_options(const DDL_options_st &options)
  { DDL_options_st::operator=(options); }
};

struct Lex_length_and_dec_st
{
private:
  const char *m_length;
  const char *m_dec;
public:
  void set(const char *length, const char *dec)
  {
    m_length= length;
    m_dec= dec;
  }
  const char *length() const { return m_length; }
  const char *dec() const { return m_dec; }
};

struct Lex_field_type_st: public Lex_length_and_dec_st
{
private:
  enum_field_types m_type;
  void set(enum_field_types type, const char *length, const char *dec)
  {
    m_type= type;
    Lex_length_and_dec_st::set(length, dec);
  }
public:
  void set(enum_field_types type, Lex_length_and_dec_st length_and_dec)
  {
    m_type= type;
    Lex_length_and_dec_st::operator=(length_and_dec);
  }
  void set(enum_field_types type, const char *length)
  {
    set(type, length, 0);
  }
  void set(enum_field_types type)
  {
    set(type, 0, 0);
  }
  enum_field_types field_type() const { return m_type; }
};

struct Lex_dyncol_type_st: public Lex_length_and_dec_st
{
private:
  int m_type; // enum_dynamic_column_type is not visible here, so use int
public:
  void set(int type, const char *length, const char *dec)
  {
    m_type= type;
    Lex_length_and_dec_st::set(length, dec);
  }
  void set(int type, Lex_length_and_dec_st length_and_dec)
  {
    m_type= type;
    Lex_length_and_dec_st::operator=(length_and_dec);
  }
  void set(int type, const char *length)
  {
    set(type, length, 0);
  }
  void set(int type)
  {
    set(type, 0, 0);
  }
  int dyncol_type() const { return m_type; }
};

class Load_data_param
{
protected:
  CHARSET_INFO *m_charset;   // Character set of the file
  ulonglong m_fixed_length;  // Sum of target field lengths for fixed format
  bool m_is_fixed_length;
  bool m_use_blobs;
public:
  Load_data_param(CHARSET_INFO *cs, bool is_fixed_length):
    m_charset(cs),
    m_fixed_length(0),
    m_is_fixed_length(is_fixed_length),
    m_use_blobs(false)
  { }
  bool add_outvar_field(THD *thd, const Field *field);
  bool add_outvar_user_var(THD *thd);
  CHARSET_INFO *charset() const { return m_charset; }
  bool is_fixed_length() const { return m_is_fixed_length; }
  bool use_blobs() const { return m_use_blobs; }
};

class Load_data_outvar
{
public:
  virtual ~Load_data_outvar() {}
  virtual bool load_data_set_null(THD *thd, const Load_data_param *param)= 0;
  virtual bool load_data_set_value(THD *thd, const char *pos, uint length,
                                   const Load_data_param *param)= 0;
  virtual bool load_data_set_no_data(THD *thd, const Load_data_param *param)= 0;
  virtual void load_data_print_for_log_event(THD *thd, class String *to) const= 0;
  virtual bool load_data_add_outvar(THD *thd, Load_data_param *param) const= 0;
  virtual uint load_data_fixed_length() const= 0;
};

#endif /* STRUCTS_INCLUDED */