File Manager

X7ROOT File Manager

Current Path: /usr/include/mysql/server/private

usr / include / mysql / server / private /

ðŸ“ ..
ðŸ“„ aligned.h(1.11 KB)
ðŸ“„ aria_backup.h(1.51 KB)
ðŸ“„ assume_aligned.h(2.29 KB)
ðŸ“ atomic
ðŸ“„ authors.h(9.9 KB)
ðŸ“„ backup.h(1.66 KB)
ðŸ“„ bounded_queue.h(5.95 KB)
ðŸ“„ client_settings.h(1.89 KB)
ðŸ“„ compat56.h(2.23 KB)
ðŸ“„ config.h(14.23 KB)
ðŸ“„ contributors.h(4.76 KB)
ðŸ“„ create_options.h(4.42 KB)
ðŸ“„ create_tmp_table.h(2.74 KB)
ðŸ“„ cset_narrowing.h(3.88 KB)
ðŸ“„ custom_conf.h(1.06 KB)
ðŸ“„ datadict.h(1.66 KB)
ðŸ“„ ddl_log.h(12.39 KB)
ðŸ“„ debug.h(1.21 KB)
ðŸ“„ debug_sync.h(2 KB)
ðŸ“„ derived_handler.h(2.32 KB)
ðŸ“„ derror.h(980 B)
ðŸ“„ des_key_file.h(1.21 KB)
ðŸ“„ discover.h(1.53 KB)
ðŸ“„ dur_prop.h(1.06 KB)
ðŸ“„ embedded_priv.h(1.69 KB)
ðŸ“„ event_data_objects.h(4.09 KB)
ðŸ“„ event_db_repository.h(3.56 KB)
ðŸ“„ event_parse_data.h(2.83 KB)
ðŸ“„ event_queue.h(3.36 KB)
ðŸ“„ event_scheduler.h(3.21 KB)
ðŸ“„ events.h(4.59 KB)
ðŸ“„ field.h(215.25 KB)
ðŸ“„ field_comp.h(1.15 KB)
ðŸ“„ filesort.h(7.11 KB)
ðŸ“„ filesort_utils.h(8 KB)
ðŸ“„ ft_global.h(3.04 KB)
ðŸ“„ gcalc_slicescan.h(16.87 KB)
ðŸ“„ gcalc_tools.h(11.62 KB)
ðŸ“„ grant.h(2.69 KB)
ðŸ“„ group_by_handler.h(3.45 KB)
ðŸ“„ gstream.h(2.38 KB)
ðŸ“„ ha_handler_stats.h(2.28 KB)
ðŸ“„ ha_partition.h(62.9 KB)
ðŸ“„ ha_sequence.h(6.1 KB)
ðŸ“„ handle_connections_win.h(884 B)
ðŸ“„ handler.h(196.46 KB)
ðŸ“„ hash.h(4.34 KB)
ðŸ“„ hash_filo.h(5.55 KB)
ðŸ“„ heap.h(9.26 KB)
ðŸ“„ hostname.h(5.29 KB)
ðŸ“„ ilist.h(6.88 KB)
ðŸ“„ init.h(852 B)
ðŸ“„ innodb_priv.h(1.29 KB)
ðŸ“„ item.h(272.64 KB)
ðŸ“„ item_cmpfunc.h(131.86 KB)
ðŸ“„ item_create.h(11.23 KB)
ðŸ“„ item_func.h(133.45 KB)
ðŸ“„ item_geofunc.h(37.99 KB)
ðŸ“„ item_jsonfunc.h(21.99 KB)
ðŸ“„ item_row.h(5.1 KB)
ðŸ“„ item_strfunc.h(70.55 KB)
ðŸ“„ item_subselect.h(57.77 KB)
ðŸ“„ item_sum.h(70.59 KB)
ðŸ“„ item_timefunc.h(63.1 KB)
ðŸ“„ item_vers.h(4.23 KB)
ðŸ“„ item_windowfunc.h(33.51 KB)
ðŸ“„ item_xmlfunc.h(4.5 KB)
ðŸ“„ json_table.h(9.28 KB)
ðŸ“„ key.h(2.08 KB)
ðŸ“„ keycaches.h(1.95 KB)
ðŸ“„ lex.h(29.13 KB)
ðŸ“„ lex_string.h(3.97 KB)
ðŸ“„ lex_symbol.h(1.29 KB)
ðŸ“„ lf.h(6.31 KB)
ðŸ“„ lock.h(2.15 KB)
ðŸ“„ log.h(45 KB)
ðŸ“„ log_event.h(182.04 KB)
ðŸ“„ log_event_data_type.h(1.85 KB)
ðŸ“„ log_event_old.h(19.37 KB)
ðŸ“„ log_slow.h(2.38 KB)
ðŸ“„ maria.h(5.73 KB)
ðŸ“„ mariadb.h(1.25 KB)
ðŸ“„ mdl.h(37.57 KB)
ðŸ“„ mem_root_array.h(6.94 KB)
ðŸ“„ message.h(1.17 KB)
ðŸ“„ multi_range_read.h(22.64 KB)
ðŸ“„ my_alarm.h(2.37 KB)
ðŸ“„ my_apc.h(4.64 KB)
ðŸ“„ my_atomic.h(7.11 KB)
ðŸ“„ my_atomic_wrapper.h(2.98 KB)
ðŸ“„ my_base.h(26.57 KB)
ðŸ“„ my_bit.h(6.05 KB)
ðŸ“„ my_bitmap.h(5.74 KB)
ðŸ“„ my_check_opt.h(2.56 KB)
ðŸ“„ my_compare.h(10.93 KB)
ðŸ“„ my_counter.h(1.68 KB)
ðŸ“„ my_cpu.h(4.74 KB)
ðŸ“„ my_crypt.h(904 B)
ðŸ“„ my_decimal.h(14.15 KB)
ðŸ“„ my_default.h(1.84 KB)
ðŸ“„ my_handler_errors.h(4.77 KB)
ðŸ“„ my_json_writer.h(17.95 KB)
ðŸ“„ my_libwrap.h(1.16 KB)
ðŸ“„ my_md5.h(1.45 KB)
ðŸ“„ my_minidump.h(848 B)
ðŸ“„ my_nosys.h(1.4 KB)
ðŸ“„ my_rdtsc.h(8.23 KB)
ðŸ“„ my_rnd.h(1.04 KB)
ðŸ“„ my_service_manager.h(2 KB)
ðŸ“„ my_stack_alloc.h(6.34 KB)
ðŸ“„ my_stacktrace.h(3.14 KB)
ðŸ“„ my_time.h(10.22 KB)
ðŸ“„ my_tree.h(3.9 KB)
ðŸ“„ my_uctype.h(67.9 KB)
ðŸ“„ my_user.h(1.1 KB)
ðŸ“„ myisam.h(17.1 KB)
ðŸ“„ myisamchk.h(4.61 KB)
ðŸ“„ myisammrg.h(4.78 KB)
ðŸ“„ myisampack.h(14.58 KB)
ðŸ“„ mysqld.h(39.55 KB)
ðŸ“„ mysqld_default_groups.h(204 B)
ðŸ“„ mysqld_suffix.h(1.17 KB)
ðŸ“„ mysys_err.h(2.95 KB)
ðŸ“„ opt_range.h(58.19 KB)
ðŸ“„ opt_subselect.h(14.21 KB)
ðŸ“„ opt_trace.h(8.29 KB)
ðŸ“„ opt_trace_context.h(3.21 KB)
ðŸ“„ parse_file.h(4.28 KB)
ðŸ“„ partition_element.h(5.09 KB)
ðŸ“„ partition_info.h(18.85 KB)
ðŸ“„ password.h(1.14 KB)
ðŸ“„ pfs_file_provider.h(3.08 KB)
ðŸ“„ pfs_idle_provider.h(1.35 KB)
ðŸ“„ pfs_memory_provider.h(1.59 KB)
ðŸ“„ pfs_metadata_provider.h(1.85 KB)
ðŸ“„ pfs_socket_provider.h(2.21 KB)
ðŸ“„ pfs_stage_provider.h(1.52 KB)
ðŸ“„ pfs_statement_provider.h(4.25 KB)
ðŸ“„ pfs_table_provider.h(2.56 KB)
ðŸ“„ pfs_thread_provider.h(5.43 KB)
ðŸ“„ pfs_transaction_provider.h(2.78 KB)
ðŸ“„ privilege.h(27.97 KB)
ðŸ“„ probes_mysql.h(973 B)
ðŸ“„ probes_mysql_dtrace.h(32.23 KB)
ðŸ“„ probes_mysql_nodtrace.h(4.89 KB)
ðŸ“„ procedure.h(6.63 KB)
ðŸ“„ protocol.h(12.2 KB)
ðŸ“„ proxy_protocol.h(548 B)
ðŸ“„ queues.h(3.4 KB)
ðŸ“„ records.h(3.07 KB)
ðŸ“„ repl_failsafe.h(1.55 KB)
ðŸ“„ replication.h(15.73 KB)
ðŸ“„ rijndael.h(1.67 KB)
ðŸ“„ rowid_filter.h(15.11 KB)
ðŸ“„ rpl_constants.h(3.28 KB)
ðŸ“„ rpl_filter.h(4.43 KB)
ðŸ“„ rpl_gtid.h(13.36 KB)
ðŸ“„ rpl_injector.h(9.4 KB)
ðŸ“„ rpl_mi.h(14.64 KB)
ðŸ“„ rpl_parallel.h(17.05 KB)
ðŸ“„ rpl_record.h(1.55 KB)
ðŸ“„ rpl_record_old.h(1.37 KB)
ðŸ“„ rpl_reporting.h(3.63 KB)
ðŸ“„ rpl_rli.h(31.98 KB)
ðŸ“„ rpl_tblmap.h(3.1 KB)
ðŸ“„ rpl_utility.h(9.4 KB)
ðŸ“„ scheduler.h(3.12 KB)
ðŸ“„ scope.h(4.29 KB)
ðŸ“„ select_handler.h(2.18 KB)
ðŸ“„ semisync.h(2.23 KB)
ðŸ“„ semisync_master.h(24.96 KB)
ðŸ“„ semisync_master_ack_receiver.h(8.5 KB)
ðŸ“„ semisync_slave.h(3.65 KB)
ðŸ“„ service_versions.h(2 KB)
ðŸ“„ session_tracker.h(13.94 KB)
ðŸ“„ set_var.h(16.16 KB)
ðŸ“„ slave.h(11.99 KB)
ðŸ“„ socketpair.h(842 B)
ðŸ“„ source_revision.h(67 B)
ðŸ“„ sp.h(22.06 KB)
ðŸ“„ sp_cache.h(2 KB)
ðŸ“„ sp_head.h(63 KB)
ðŸ“„ sp_pcontext.h(24.31 KB)
ðŸ“„ sp_rcontext.h(14 KB)
ðŸ“„ span.h(3.84 KB)
ðŸ“„ spatial.h(21.78 KB)
ðŸ“„ sql_acl.h(13.8 KB)
ðŸ“„ sql_admin.h(2.85 KB)
ðŸ“„ sql_alloc.h(1.69 KB)
ðŸ“„ sql_alter.h(14.92 KB)
ðŸ“„ sql_analyse.h(10.86 KB)
ðŸ“„ sql_analyze_stmt.h(12.38 KB)
ðŸ“„ sql_array.h(6.71 KB)
ðŸ“„ sql_audit.h(13.62 KB)
ðŸ“„ sql_base.h(25.27 KB)
ðŸ“„ sql_basic_types.h(9.3 KB)
ðŸ“„ sql_binlog.h(895 B)
ðŸ“„ sql_bitmap.h(7.66 KB)
ðŸ“„ sql_bootstrap.h(1.77 KB)
ðŸ“„ sql_cache.h(21.17 KB)
ðŸ“„ sql_callback.h(1.51 KB)
ðŸ“„ sql_class.h(261.11 KB)
ðŸ“„ sql_cmd.h(9.2 KB)
ðŸ“„ sql_connect.h(3.99 KB)
ðŸ“„ sql_const.h(10.96 KB)
ðŸ“„ sql_crypt.h(1.4 KB)
ðŸ“„ sql_cte.h(16.15 KB)
ðŸ“„ sql_cursor.h(2.26 KB)
ðŸ“„ sql_db.h(2.38 KB)
ðŸ“„ sql_debug.h(5.51 KB)
ðŸ“„ sql_delete.h(1.31 KB)
ðŸ“„ sql_derived.h(1.26 KB)
ðŸ“„ sql_digest.h(3.73 KB)
ðŸ“„ sql_digest_stream.h(1.53 KB)
ðŸ“„ sql_do.h(954 B)
ðŸ“„ sql_error.h(38.66 KB)
ðŸ“„ sql_explain.h(28.34 KB)
ðŸ“„ sql_expression_cache.h(4.26 KB)
ðŸ“„ sql_get_diagnostics.h(7.68 KB)
ðŸ“„ sql_handler.h(2.84 KB)
ðŸ“„ sql_help.h(995 B)
ðŸ“„ sql_hset.h(3.32 KB)
ðŸ“„ sql_i_s.h(8.04 KB)
ðŸ“„ sql_insert.h(2.59 KB)
ðŸ“„ sql_join_cache.h(47.53 KB)
ðŸ“„ sql_lex.h(168.5 KB)
ðŸ“„ sql_lifo_buffer.h(9.45 KB)
ðŸ“„ sql_limit.h(3.11 KB)
ðŸ“„ sql_list.h(21.93 KB)
ðŸ“„ sql_load.h(1.25 KB)
ðŸ“„ sql_locale.h(2.64 KB)
ðŸ“„ sql_manager.h(960 B)
ðŸ“„ sql_mode.h(6.58 KB)
ðŸ“„ sql_parse.h(8.43 KB)
ðŸ“„ sql_partition.h(11.79 KB)
ðŸ“„ sql_partition_admin.h(5.8 KB)
ðŸ“„ sql_plist.h(7.55 KB)
ðŸ“„ sql_plugin.h(7.37 KB)
ðŸ“„ sql_plugin_compat.h(2.18 KB)
ðŸ“„ sql_prepare.h(11.14 KB)
ðŸ“„ sql_priv.h(18.16 KB)
ðŸ“„ sql_profile.h(7.63 KB)
ðŸ“„ sql_reload.h(1.01 KB)
ðŸ“„ sql_rename.h(982 B)
ðŸ“„ sql_repl.h(2.97 KB)
ðŸ“„ sql_schema.h(3.23 KB)
ðŸ“„ sql_select.h(86.81 KB)
ðŸ“„ sql_sequence.h(5.06 KB)
ðŸ“„ sql_servers.h(1.74 KB)
ðŸ“„ sql_show.h(9.39 KB)
ðŸ“„ sql_signal.h(3.28 KB)
ðŸ“„ sql_sort.h(21.45 KB)
ðŸ“„ sql_statistics.h(12.16 KB)
ðŸ“„ sql_string.h(38.84 KB)
ðŸ“„ sql_table.h(9.39 KB)
ðŸ“„ sql_tablespace.h(956 B)
ðŸ“„ sql_test.h(1.55 KB)
ðŸ“„ sql_time.h(8.18 KB)
ðŸ“„ sql_trigger.h(12.04 KB)
ðŸ“„ sql_truncate.h(2.03 KB)
ðŸ“„ sql_tvc.h(2.36 KB)
ðŸ“„ sql_type.h(288.51 KB)
ðŸ“„ sql_type_fixedbin.h(62.81 KB)
ðŸ“„ sql_type_fixedbin_storage.h(5.34 KB)
ðŸ“„ sql_type_geom.h(18.64 KB)
ðŸ“„ sql_type_int.h(9.77 KB)
ðŸ“„ sql_type_json.h(6.01 KB)
ðŸ“„ sql_type_real.h(1.23 KB)
ðŸ“„ sql_type_string.h(1.59 KB)
ðŸ“„ sql_udf.h(4.74 KB)
ðŸ“„ sql_union.h(1.04 KB)
ðŸ“„ sql_update.h(1.88 KB)
ðŸ“„ sql_view.h(2.41 KB)
ðŸ“„ sql_window.h(6.65 KB)
ðŸ“„ ssl_compat.h(3.07 KB)
ðŸ“„ strfunc.h(2.22 KB)
ðŸ“„ structs.h(25.76 KB)
ðŸ“„ sys_vars_shared.h(2.67 KB)
ðŸ“„ t_ctype.h(5.51 KB)
ðŸ“„ table.h(113.03 KB)
ðŸ“„ table_cache.h(4.13 KB)
ðŸ“„ thr_alarm.h(2.86 KB)
ðŸ“„ thr_lock.h(7.18 KB)
ðŸ“„ thr_malloc.h(1.17 KB)
ðŸ“„ thr_timer.h(1.53 KB)
ðŸ“„ thread_cache.h(5.77 KB)
ðŸ“„ threadpool.h(4.7 KB)
ðŸ“„ threadpool_generic.h(3.88 KB)
ðŸ“„ threadpool_winsockets.h(2.24 KB)
ðŸ“„ transaction.h(1.43 KB)
ðŸ“„ tzfile.h(4.9 KB)
ðŸ“„ tztime.h(3.32 KB)
ðŸ“„ uniques.h(4.12 KB)
ðŸ“„ unireg.h(7.54 KB)
ðŸ“„ vers_string.h(2.47 KB)
ðŸ“„ violite.h(9.85 KB)
ðŸ“„ waiting_threads.h(4.43 KB)
ðŸ“„ welcome_copyright_notice.h(1.19 KB)
ðŸ“„ win_tzname_data.h(6.35 KB)
ðŸ“„ winservice.h(1.17 KB)
ðŸ“„ wqueue.h(1.53 KB)
ðŸ“„ wsrep.h(3.23 KB)
ðŸ“„ wsrep_applier.h(2.64 KB)
ðŸ“„ wsrep_binlog.h(3.36 KB)
ðŸ“„ wsrep_client_service.h(2.5 KB)
ðŸ“„ wsrep_client_state.h(1.53 KB)
ðŸ“„ wsrep_condition_variable.h(1.45 KB)
ðŸ“„ wsrep_high_priority_service.h(4.8 KB)
ðŸ“„ wsrep_mutex.h(1.19 KB)
ðŸ“„ wsrep_mysqld.h(20.64 KB)
ðŸ“„ wsrep_mysqld_c.h(1.2 KB)
ðŸ“„ wsrep_on.h(1.68 KB)
ðŸ“„ wsrep_priv.h(1.6 KB)
ðŸ“„ wsrep_schema.h(4.83 KB)
ðŸ“„ wsrep_server_service.h(3.55 KB)
ðŸ“„ wsrep_server_state.h(2.23 KB)
ðŸ“„ wsrep_sst.h(3.86 KB)
ðŸ“„ wsrep_storage_service.h(1.77 KB)
ðŸ“„ wsrep_thd.h(10.9 KB)
ðŸ“„ wsrep_trans_observer.h(17.69 KB)
ðŸ“„ wsrep_types.h(997 B)
ðŸ“„ wsrep_utils.h(9.07 KB)
ðŸ“„ wsrep_var.h(4.5 KB)
ðŸ“„ wsrep_xid.h(1.51 KB)
ðŸ“„ xa.h(1.8 KB)

Editing: sql_partition.h

#ifndef SQL_PARTITION_INCLUDED
#define SQL_PARTITION_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 */

#ifdef USE_PRAGMA_INTERFACE
#pragma interface				/* gcc class implementation */
#endif

#include "sql_list.h"                           /* List */
#include "table.h"                              /* TABLE_LIST */

class Alter_info;
class Alter_table_ctx;
class Field;
class String;
class handler;
class partition_info;
struct TABLE;
struct TABLE_LIST;
typedef struct st_bitmap MY_BITMAP;
typedef struct st_key KEY;
typedef struct st_key_range key_range;

/* Flags for partition handlers */
#define HA_CAN_PARTITION       (1 << 0) /* Partition support */
#define HA_CAN_UPDATE_PARTITION_KEY (1 << 1)
#define HA_CAN_PARTITION_UNIQUE (1 << 2)
#define HA_USE_AUTO_PARTITION (1 << 3)
#define HA_ONLY_VERS_PARTITION (1 << 4)

#define NORMAL_PART_NAME 0
#define TEMP_PART_NAME 1
#define RENAMED_PART_NAME 2

typedef struct st_lock_param_type
{
  TABLE_LIST *table_list;
  ulonglong copied;
  ulonglong deleted;
  THD *thd;
  HA_CREATE_INFO *create_info;
  Alter_info *alter_info;
  TABLE *table;
  KEY *key_info_buffer;
  LEX_CUSTRING org_tabledef_version;
  uchar *pack_frm_data;
  uint key_count;
  uint db_options;
  size_t pack_frm_len;
  partition_info *part_info;
} ALTER_PARTITION_PARAM_TYPE;

typedef struct {
  longlong list_value;
  uint32 partition_id;
} LIST_PART_ENTRY;

typedef struct {
  uint32 start_part;
  uint32 end_part;
} part_id_range;

class String_list;
struct st_partition_iter;
#define NOT_A_PARTITION_ID UINT_MAX32

bool is_partition_in_list(char *part_name, List<char> list_part_names);
char *are_partitions_in_table(partition_info *new_part_info,
                              partition_info *old_part_info);
bool check_reorganise_list(partition_info *new_part_info,
                           partition_info *old_part_info,
                           List<char> list_part_names);
handler *get_ha_partition(partition_info *part_info);
int get_part_for_buf(const uchar *buf, const uchar *rec0,
                     partition_info *part_info, uint32 *part_id);
void prune_partition_set(const TABLE *table, part_id_range *part_spec);
bool check_partition_info(partition_info *part_info,handlerton **eng_type,
                          TABLE *table, handler *file, HA_CREATE_INFO *info);
void set_linear_hash_mask(partition_info *part_info, uint num_parts);
bool fix_partition_func(THD *thd, TABLE *table, bool create_table_ind);
void get_partition_set(const TABLE *table, uchar *buf, const uint index,
                       const key_range *key_spec,
                       part_id_range *part_spec);
uint get_partition_field_store_length(Field *field);
void get_full_part_id_from_key(const TABLE *table, uchar *buf,
                               KEY *key_info,
                               const key_range *key_spec,
                               part_id_range *part_spec);
bool mysql_unpack_partition(THD *thd, char *part_buf,
                            uint part_info_len,
                            TABLE *table, bool is_create_table_ind,
                            handlerton *default_db_type,
                            bool *work_part_info_used);
void make_used_partitions_str(MEM_ROOT *mem_root,
                              partition_info *part_info, String *parts_str,
                              String_list &used_partitions_list);
uint32 get_list_array_idx_for_endpoint(partition_info *part_info,
                                       bool left_endpoint,
                                       bool include_endpoint);
uint32 get_partition_id_range_for_endpoint(partition_info *part_info,
                                           bool left_endpoint,
                                           bool include_endpoint);
bool check_part_func_fields(Field **ptr, bool ok_with_charsets);
bool field_is_partition_charset(Field *field);
Item* convert_charset_partition_constant(Item *item, CHARSET_INFO *cs);
/**
  Append all fields in read_set to string

@param[in,out] str   String to append to.
  @param[in]     row   Row to append.
  @param[in]     table Table containing read_set and fields for the row.
*/
void append_row_to_str(String &str, const uchar *row, TABLE *table);
void truncate_partition_filename(char *path);

/*
  A "Get next" function for partition iterator.

SYNOPSIS
    partition_iter_func()
      part_iter  Partition iterator, you call only "iter.get_next(&iter)"

DESCRIPTION
    Depending on whether partitions or sub-partitions are iterated, the
    function returns next subpartition id/partition number. The sequence of
    returned numbers is not ordered and may contain duplicates.

When the end of sequence is reached, NOT_A_PARTITION_ID is returned, and 
    the iterator resets itself (so next get_next() call will start to 
    enumerate the set all over again).

RETURN 
    NOT_A_PARTITION_ID if there are no more partitions.
    [sub]partition_id  of the next partition
*/

typedef uint32 (*partition_iter_func)(st_partition_iter* part_iter);

/*
  Partition set iterator. Used to enumerate a set of [sub]partitions
  obtained in partition interval analysis (see get_partitions_in_range_iter).

For the user, the only meaningful field is get_next, which may be used as
  follows:
             part_iterator.get_next(&part_iterator);
  
  Initialization is done by any of the following calls:
    - get_partitions_in_range_iter-type function call
    - init_single_partition_iterator()
    - init_all_partitions_iterator()
  Cleanup is not needed.
*/

typedef struct st_partition_iter
{
  partition_iter_func get_next;
  /* 
    Valid for "Interval mapping" in LIST partitioning: if true, let the
    iterator also produce id of the partition that contains NULL value.
  */
  bool ret_null_part, ret_null_part_orig;
  /*
    We should return DEFAULT partition.
  */
  bool ret_default_part, ret_default_part_orig;
  struct st_part_num_range
  {
    uint32 start;
    uint32 cur;
    uint32 end;
  };

struct st_field_value_range
  {
    longlong start;
    longlong cur;
    longlong end;
  };

union
  {
    struct st_part_num_range     part_nums;
    struct st_field_value_range  field_vals;
  };
  partition_info *part_info;
} PARTITION_ITERATOR;

/*
  Get an iterator for set of partitions that match given field-space interval

SYNOPSIS
    get_partitions_in_range_iter()
      part_info            Partitioning info
      is_subpart
      store_length_array   Length of fields packed in opt_range_key format
      min_val              Left edge,  field value in opt_range_key format
      max_val              Right edge, field value in opt_range_key format
      min_len              Length of minimum value
      max_len              Length of maximum value
      flags                Some combination of NEAR_MIN, NEAR_MAX, NO_MIN_RANGE,
                           NO_MAX_RANGE
      part_iter            Iterator structure to be initialized

DESCRIPTION
    Functions with this signature are used to perform "Partitioning Interval
    Analysis". This analysis is applicable for any type of [sub]partitioning 
    by some function of a single fieldX. The idea is as follows:
    Given an interval "const1 <=? fieldX <=? const2", find a set of partitions
    that may contain records with value of fieldX within the given interval.

The min_val, max_val and flags parameters specify the interval.
    The set of partitions is returned by initializing an iterator in *part_iter

NOTES
    There are currently three functions of this type:
     - get_part_iter_for_interval_via_walking
     - get_part_iter_for_interval_cols_via_map
     - get_part_iter_for_interval_via_mapping

RETURN 
    0 - No matching partitions, iterator not initialized
    1 - Some partitions would match, iterator intialized for traversing them
   -1 - All partitions would match, iterator not initialized
*/

typedef int (*get_partitions_in_range_iter)(partition_info *part_info,
                                            bool is_subpart,
                                            uint32 *store_length_array,
                                            uchar *min_val, uchar *max_val,
                                            uint min_len, uint max_len,
                                            uint flags,
                                            PARTITION_ITERATOR *part_iter);

#include "partition_info.h"

#ifdef WITH_PARTITION_STORAGE_ENGINE
uint fast_alter_partition_table(THD *thd, TABLE *table,
                                Alter_info *alter_info,
                                HA_CREATE_INFO *create_info,
                                TABLE_LIST *table_list);
bool set_part_state(Alter_info *alter_info, partition_info *tab_part_info,
                    enum partition_state part_state);
uint prep_alter_part_table(THD *thd, TABLE *table, Alter_info *alter_info,
                           HA_CREATE_INFO *create_info,
                           bool *partition_changed,
                           bool *fast_alter_table);
char *generate_partition_syntax(THD *thd, partition_info *part_info,
                                uint *buf_length,
                                bool show_partition_options,
                                HA_CREATE_INFO *create_info,
                                Alter_info *alter_info);
char *generate_partition_syntax_for_frm(THD *thd, partition_info *part_info,
                                        uint *buf_length,
                                        HA_CREATE_INFO *create_info,
                                        Alter_info *alter_info);
bool verify_data_with_partition(TABLE *table, TABLE *part_table,
                                uint32 part_id);
bool compare_partition_options(HA_CREATE_INFO *table_create_info,
                               partition_element *part_elem);
bool partition_key_modified(TABLE *table, const MY_BITMAP *fields);
#else
#define partition_key_modified(X,Y) 0
#endif

int __attribute__((warn_unused_result))
  create_partition_name(char *out, size_t outlen, const char *in1, const char
                        *in2, uint name_variant, bool translate);
int __attribute__((warn_unused_result))
  create_subpartition_name(char *out, size_t outlen, const char *in1, const
                           char *in2, const char *in3, uint name_variant);

void set_key_field_ptr(KEY *key_info, const uchar *new_buf,
                       const uchar *old_buf);

/** Set up table for creating a partition.
Copy info from partition to the table share so the created partition
has the correct info.
  @param thd               THD object
  @param share             Table share to be updated.
  @param info              Create info to be updated.
  @param part_elem         partition_element containing the info.

@return    status
    @retval  TRUE  Error
    @retval  FALSE Success

@details
    Set up
    1) Comment on partition
    2) MAX_ROWS, MIN_ROWS on partition
    3) Index file name on partition
    4) Data file name on partition
*/
bool set_up_table_before_create(THD *thd,
                                TABLE_SHARE *share,
                                const char *partition_name_with_path,
                                HA_CREATE_INFO *info,
                                partition_element *part_elem);

#endif /* SQL_PARTITION_INCLUDED */

X7ROOT File Manager

Editing: sql_partition.h

Upload File

Create Folder