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)
?? char_buffer.h(3.09 KB)
?? charset_collations.h(6.41 KB)
?? client_settings.h(1.87 KB)
?? compat56.h(2.23 KB)
?? config.h(14.21 KB)
?? contributors.h(4.76 KB)
?? create_options.h(4.09 KB)
?? create_tmp_table.h(2.74 KB)
?? cset_narrowing.h(3.88 KB)
?? custom_conf.h(1.06 KB)
?? data
?? datadict.h(1.66 KB)
?? ddl_log.h(12.51 KB)
?? debug.h(1.26 KB)
?? debug_sync.h(2 KB)
?? deprecation.h(2.74 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.6 KB)
?? field.h(217.81 KB)
?? field_comp.h(1.15 KB)
?? filesort.h(7.13 KB)
?? filesort_utils.h(10.53 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)
?? gtid_index.h(19.54 KB)
?? ha_handler_stats.h(2.28 KB)
?? ha_partition.h(63.36 KB)
?? ha_sequence.h(6.1 KB)
?? handle_connections_win.h(884 B)
?? handler.h(206.19 KB)
?? hash.h(4.35 KB)
?? hash_filo.h(5.55 KB)
?? heap.h(9.26 KB)
?? hostname.h(5.29 KB)
?? ilist.h(6.98 KB)
?? init.h(852 B)
?? innodb_priv.h(1.29 KB)
?? item.h(276.43 KB)
?? item_cmpfunc.h(132.01 KB)
?? item_create.h(11.24 KB)
?? item_func.h(134.64 KB)
?? item_geofunc.h(38.16 KB)
?? item_jsonfunc.h(27.86 KB)
?? item_row.h(5.1 KB)
?? item_strfunc.h(75.33 KB)
?? item_subselect.h(57.63 KB)
?? item_sum.h(70.69 KB)
?? item_timefunc.h(63.85 KB)
?? item_vers.h(4.26 KB)
?? item_windowfunc.h(33.56 KB)
?? item_xmlfunc.h(4.52 KB)
?? json_schema.h(25.1 KB)
?? json_schema_helper.h(1.13 KB)
?? json_table.h(9.44 KB)
?? key.h(2.08 KB)
?? keycaches.h(1.94 KB)
?? lex.h(29.54 KB)
?? lex_charset.h(25.92 KB)
?? lex_hash.h(141.94 KB)
?? lex_ident.h(5.15 KB)
?? lex_string.h(4.77 KB)
?? lex_symbol.h(1.29 KB)
?? lex_token.h(42.01 KB)
?? lf.h(6.31 KB)
?? lock.h(2.2 KB)
?? log.h(51.28 KB)
?? log_cache.h(7.57 KB)
?? log_event.h(172.56 KB)
?? log_event_data_type.h(1.85 KB)
?? log_slow.h(2.38 KB)
?? maria.h(5.73 KB)
?? mariadb.h(1.25 KB)
?? mdl.h(37.65 KB)
?? mem_root_array.h(6.94 KB)
?? message.h(1.17 KB)
?? multi_range_read.h(22.65 KB)
?? my_apc.h(4.64 KB)
?? my_atomic.h(7.11 KB)
?? my_atomic_wrapper.h(2.98 KB)
?? my_base.h(27.28 KB)
?? my_bit.h(6.05 KB)
?? my_bitmap.h(5.37 KB)
?? my_check_opt.h(2.56 KB)
?? my_compare.h(10.87 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(18.14 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(9.88 KB)
?? my_rnd.h(1014 B)
?? my_service_manager.h(2.07 KB)
?? my_stack_alloc.h(6.34 KB)
?? my_stacktrace.h(3.14 KB)
?? my_time.h(10.17 KB)
?? my_tracker.h(1.37 KB)
?? my_tree.h(3.9 KB)
?? my_uctype.h(67.9 KB)
?? my_user.h(1.1 KB)
?? my_virtual_mem.h(1.1 KB)
?? myisam.h(17.18 KB)
?? myisamchk.h(4.62 KB)
?? myisammrg.h(4.78 KB)
?? myisampack.h(14.58 KB)
?? mysqld.h(41.11 KB)
?? mysqld_default_groups.h(204 B)
?? mysqld_suffix.h(1.17 KB)
?? mysys_err.h(2.99 KB)
?? opt_histogram_json.h(4.71 KB)
?? opt_range.h(64.78 KB)
?? opt_rewrite_date_cmp.h(3.84 KB)
?? opt_subselect.h(14.78 KB)
?? opt_trace.h(8.29 KB)
?? opt_trace_context.h(3.21 KB)
?? optimizer_costs.h(5.89 KB)
?? optimizer_defaults.h(7.37 KB)
?? parse_file.h(4.28 KB)
?? partition_element.h(5.3 KB)
?? partition_info.h(19.4 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(28.44 KB)
?? probes_mysql.h(973 B)
?? probes_mysql_dtrace.h(32.23 KB)
?? probes_mysql_nodtrace.h(5.94 KB)
?? procedure.h(6.63 KB)
?? protocol.h(12.27 KB)
?? providers
?? proxy_protocol.h(548 B)
?? queues.h(3.4 KB)
?? records.h(3.07 KB)
?? repl_failsafe.h(1.55 KB)
?? replication.h(15.2 KB)
?? rijndael.h(1.67 KB)
?? rowid_filter.h(16.03 KB)
?? rpl_constants.h(3.28 KB)
?? rpl_filter.h(4.66 KB)
?? rpl_gtid.h(29.95 KB)
?? rpl_injector.h(9.4 KB)
?? rpl_mi.h(16.29 KB)
?? rpl_parallel.h(17.8 KB)
?? rpl_record.h(1.49 KB)
?? rpl_reporting.h(3.63 KB)
?? rpl_rli.h(35.02 KB)
?? rpl_tblmap.h(3.1 KB)
?? rpl_utility.h(10.93 KB)
?? scheduler.h(3.12 KB)
?? scope.h(4.29 KB)
?? select_handler.h(3.34 KB)
?? semisync.h(2.23 KB)
?? semisync_master.h(25.16 KB)
?? semisync_master_ack_receiver.h(8.5 KB)
?? semisync_slave.h(3.65 KB)
?? service_versions.h(2.23 KB)
?? session_tracker.h(13.75 KB)
?? set_var.h(16.39 KB)
?? simple_tokenizer.h(1.97 KB)
?? slave.h(11.99 KB)
?? socketpair.h(842 B)
?? source_revision.h(67 B)
?? sp.h(23.11 KB)
?? sp_cache.h(1.99 KB)
?? sp_head.h(38.61 KB)
?? sp_instr.h(40.41 KB)
?? sp_pcontext.h(24.71 KB)
?? sp_rcontext.h(14.08 KB)
?? span.h(3.84 KB)
?? spatial.h(21.78 KB)
?? sql_acl.h(13.75 KB)
?? sql_admin.h(2.85 KB)
?? sql_alloc.h(1.69 KB)
?? sql_alter.h(15.08 KB)
?? sql_analyse.h(10.86 KB)
?? sql_analyze_stmt.h(12.4 KB)
?? sql_array.h(6.97 KB)
?? sql_audit.h(13.83 KB)
?? sql_base.h(25.87 KB)
?? sql_basic_types.h(9.3 KB)
?? sql_binlog.h(895 B)
?? sql_bitmap.h(7.88 KB)
?? sql_bootstrap.h(1.77 KB)
?? sql_cache.h(21.34 KB)
?? sql_callback.h(1.51 KB)
?? sql_class.h(270.56 KB)
?? sql_cmd.h(15.11 KB)
?? sql_connect.h(3.96 KB)
?? sql_const.h(10.07 KB)
?? sql_crypt.h(1.4 KB)
?? sql_cte.h(16.15 KB)
?? sql_cursor.h(4.14 KB)
?? sql_db.h(2.28 KB)
?? sql_debug.h(5.51 KB)
?? sql_delete.h(3.52 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(39.39 KB)
?? sql_explain.h(30.39 KB)
?? sql_expression_cache.h(4.26 KB)
?? sql_get_diagnostics.h(7.7 KB)
?? sql_handler.h(2.84 KB)
?? sql_help.h(995 B)
?? sql_hset.h(3.32 KB)
?? sql_i_s.h(8.29 KB)
?? sql_insert.h(5.05 KB)
?? sql_join_cache.h(47.52 KB)
?? sql_lex.h(174.22 KB)
?? sql_lifo_buffer.h(9.45 KB)
?? sql_limit.h(3.11 KB)
?? sql_list.h(21.87 KB)
?? sql_load.h(1.25 KB)
?? sql_locale.h(3.16 KB)
?? sql_manager.h(960 B)
?? sql_mode.h(6.58 KB)
?? sql_parse.h(8.31 KB)
?? sql_partition.h(12.38 KB)
?? sql_partition_admin.h(5.8 KB)
?? sql_plist.h(7.53 KB)
?? sql_plugin.h(7.4 KB)
?? sql_plugin_compat.h(2.18 KB)
?? sql_prepare.h(11.4 KB)
?? sql_priv.h(15.08 KB)
?? sql_profile.h(7.63 KB)
?? sql_reload.h(1.01 KB)
?? sql_rename.h(982 B)
?? sql_repl.h(2.99 KB)
?? sql_schema.h(3.23 KB)
?? sql_select.h(91 KB)
?? sql_sequence.h(5.06 KB)
?? sql_servers.h(1.74 KB)
?? sql_show.h(9.73 KB)
?? sql_signal.h(3.28 KB)
?? sql_sort.h(21.96 KB)
?? sql_statistics.h(16.41 KB)
?? sql_string.h(37.92 KB)
?? sql_table.h(9.52 KB)
?? sql_test.h(1.55 KB)
?? sql_time.h(7.24 KB)
?? sql_trigger.h(11.88 KB)
?? sql_truncate.h(2.03 KB)
?? sql_tvc.h(2.36 KB)
?? sql_type.h(291.25 KB)
?? sql_type_fixedbin.h(63.94 KB)
?? sql_type_fixedbin_storage.h(5.34 KB)
?? sql_type_geom.h(18.59 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_type_timeofday.h(2.26 KB)
?? sql_udf.h(4.74 KB)
?? sql_union.h(1.04 KB)
?? sql_update.h(3.55 KB)
?? sql_used.h(1.02 KB)
?? sql_view.h(2.41 KB)
?? sql_window.h(6.65 KB)
?? ssl_compat.h(3.3 KB)
?? strfunc.h(2.22 KB)
?? structs.h(30.55 KB)
?? sys_vars_shared.h(2.67 KB)
?? t_ctype.h(5.51 KB)
?? table.h(118.11 KB)
?? table_cache.h(4.13 KB)
?? thr_lock.h(7.06 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.65 KB)
?? uniques.h(4.13 KB)
?? unireg.h(7.76 KB)
?? vers_string.h(2.39 KB)
?? violite.h(9.85 KB)
?? waiting_threads.h(4.43 KB)
?? welcome_copyright_notice.h(1.42 KB)
?? winservice.h(5.88 KB)
?? wqueue.h(1.53 KB)
?? wsrep.h(3.23 KB)
?? wsrep_allowlist_service.h(1.01 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_event_service.h(1.32 KB)
?? wsrep_high_priority_service.h(4.8 KB)
?? wsrep_mutex.h(1.21 KB)
?? wsrep_mysqld.h(20.93 KB)
?? wsrep_mysqld_c.h(1.2 KB)
?? wsrep_on.h(1.68 KB)
?? wsrep_plugin.h(1.35 KB)
?? wsrep_priv.h(1.6 KB)
?? wsrep_schema.h(5.48 KB)
?? wsrep_server_service.h(3.55 KB)
?? wsrep_server_state.h(3.06 KB)
?? wsrep_sst.h(3.86 KB)
?? wsrep_status.h(1.93 KB)
?? wsrep_storage_service.h(1.77 KB)
?? wsrep_thd.h(10.9 KB)
?? wsrep_trans_observer.h(17.75 KB)
?? wsrep_types.h(1.08 KB)
?? wsrep_utils.h(9.58 KB)
?? wsrep_var.h(4.25 KB)
?? wsrep_xid.h(1.51 KB)
?? xa.h(1.86 KB)

Editing: filesort.h

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 */

#ifndef FILESORT_INCLUDED
#define FILESORT_INCLUDED

#include "my_base.h"                            /* ha_rows */
#include "sql_alloc.h"
#include "filesort_utils.h"

class SQL_SELECT;
class THD;
struct TABLE;
class Filesort_tracker;
struct SORT_FIELD;
struct SORT_FIELD_ATTR;
typedef struct st_order ORDER;
class JOIN;
class Addon_fields;
class Sort_keys;

/**
  Sorting related info.
  To be extended by another WL to include complete filesort implementation.
*/
class Filesort: public Sql_alloc
{
public:
  /** List of expressions to order the table by */
  ORDER *order;
  /** Number of records to return */
  ha_rows limit;
  /** ORDER BY list with some precalculated info for filesort */
  SORT_FIELD *sortorder;
  /* Used with ROWNUM. Contains the number of rows filesort has found so far */
  ha_rows *accepted_rows;
  /** select to use for getting records */
  SQL_SELECT *select;

/** TRUE <=> free select on destruction */
  bool own_select;
  /** TRUE means we are using Priority Queue for order by with limit. */
  bool using_pq;
  /* 
    TRUE means sort operation must produce table rowids. 
    FALSE means that it also has an option of producing {sort_key, addon_fields}
          pairs.

Usually initialized with value of join_tab->keep_current_rowid to allow for
    a call to table->file->position() using these table rowids.
  */
  bool sort_positions;
  /*
    TRUE means all the fields of table of whose bitmap read_set is set
         need to be read while reading records in the sort buffer.
    FALSE otherwise
  */
  bool set_all_read_bits;

Filesort_tracker *tracker;
  Sort_keys *sort_keys;

/* Unpack temp table columns to base table columns*/
  void (*unpack)(TABLE *);

Filesort(ORDER *order_arg, ha_rows limit_arg, bool sort_positions_arg,
           SQL_SELECT *select_arg):
    order(order_arg),
    limit(limit_arg),
    sortorder(NULL),
    accepted_rows(0),
    select(select_arg),
    own_select(false), 
    using_pq(false),
    sort_positions(sort_positions_arg),
    set_all_read_bits(false),
    sort_keys(NULL),
    unpack(NULL)
  {
    DBUG_ASSERT(order);
  };

~Filesort() { cleanup(); }
  /* Prepare ORDER BY list for sorting. */
  Sort_keys* make_sortorder(THD *thd, JOIN *join, table_map first_table_bit);

private:
  void cleanup();
};

class SORT_INFO
{
  /// Buffer for sorting keys.
  Filesort_buffer filesort_buffer;

public:
  SORT_INFO()
    :addon_fields(NULL), record_pointers(0),
     sort_keys(NULL),
     sorted_result_in_fsbuf(FALSE)
  {
    buffpek.str= 0;
    my_b_clear(&io_cache);
  }

~SORT_INFO();

void free_data()
  {
    close_cached_file(&io_cache);
    free_addon_buff();
    my_free(record_pointers);
    my_free(buffpek.str);
    my_free(addon_fields);
    free_sort_buffer();
  }

void reset()
  {
    free_data();
    record_pointers= 0;
    buffpek.str= 0;
    addon_fields= 0;
    sorted_result_in_fsbuf= false;
  }

void free_addon_buff();

IO_CACHE  io_cache;           /* If sorted through filesort */
  LEX_STRING buffpek;           /* Buffer for buffpek structures */
  Addon_fields *addon_fields;   /* Addon field descriptors */
  uchar     *record_pointers;    /* If sorted in memory */
  Sort_keys *sort_keys;         /* Sort key descriptors*/

/**
    If the entire result of filesort fits in memory, we skip the merge phase.
    We may leave the result in filesort_buffer
    (indicated by sorted_result_in_fsbuf), or we may strip away
    the sort keys, and copy the sorted result into a new buffer.
    @see save_index()
   */
  bool      sorted_result_in_fsbuf;

/*
    How many rows in final result.
    Also how many rows in record_pointers, if used
  */
  ha_rows   return_rows;
  ha_rows   m_examined_rows;    /* How many rows read. Already in thd */
  ha_rows   found_rows;         /* How many rows was accepted */

/** Sort filesort_buffer */
  void sort_buffer(Sort_param *param, uint count)
  { filesort_buffer.sort_buffer(param, count); }

uchar **get_sort_keys()
  { return filesort_buffer.get_sort_keys(); }

uchar *get_sorted_record(uint ix)
  { return filesort_buffer.get_sorted_record(ix); }

uchar *alloc_sort_buffer(uint num_records, uint record_length)
  { return filesort_buffer.alloc_sort_buffer(num_records, record_length); }

void free_sort_buffer()
  { filesort_buffer.free_sort_buffer(); }

bool isfull() const
  { return filesort_buffer.isfull(); }
  void init_record_pointers()
  { filesort_buffer.init_record_pointers(); }
  void init_next_record_pointer()
  { filesort_buffer.init_next_record_pointer(); }
  uchar *get_next_record_pointer()
  { return filesort_buffer.get_next_record_pointer(); }
  void adjust_next_record_pointer(uint val)
  { filesort_buffer.adjust_next_record_pointer(val); }

Bounds_checked_array<uchar> get_raw_buf()
  { return filesort_buffer.get_raw_buf(); }

size_t sort_buffer_size() const
  { return filesort_buffer.sort_buffer_size(); }

bool is_allocated() const
  { return filesort_buffer.is_allocated(); }
  void set_sort_length(uint val)
  { filesort_buffer.set_sort_length(val); }
  uint get_sort_length() const
  { return filesort_buffer.get_sort_length(); }

bool has_filesort_result_in_memory() const
  {
    return record_pointers || sorted_result_in_fsbuf;
  }

/// Are we using "addon fields"?
  bool using_addon_fields() const
  {
    return addon_fields != NULL;
  }

/// Are we using "packed addon fields"?
  bool using_packed_addons();

/**
    Copies (unpacks) values appended to sorted fields from a buffer back to
    their regular positions specified by the Field::ptr pointers.
    @param buff            Buffer which to unpack the value from
  */
  template<bool Packed_addon_fields>
  inline void unpack_addon_fields(uchar *buff);

bool using_packed_sortkeys();

friend SORT_INFO *filesort(THD *thd, TABLE *table, Filesort *filesort,
                             Filesort_tracker* tracker, JOIN *join,
                             table_map first_table_bit);
};

SORT_INFO *filesort(THD *thd, TABLE *table, Filesort *filesort,
                    Filesort_tracker* tracker, JOIN *join=NULL,
                    table_map first_table_bit=0);

bool filesort_use_addons(TABLE *table, uint sortlength,
                         uint *length, uint *fields, uint *null_fields,
                         uint *m_packable_length);

void change_double_for_sort(double nr,uchar *to);
void store_length(uchar *to, uint length, uint pack_length);
void
reverse_key(uchar *to, const SORT_FIELD_ATTR *sort_field);

#endif /* FILESORT_INCLUDED */

X7ROOT File Manager

Editing: filesort.h

Upload File

Create Folder