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: sql_bitmap.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 */

/*
  Implementation of a bitmap type.
  The idea with this is to be able to handle any constant number of bits but
  also be able to use 32 or 64 bits bitmaps very efficiently
*/

#ifndef SQL_BITMAP_INCLUDED
#define SQL_BITMAP_INCLUDED

#include <my_sys.h>
#include <my_bitmap.h>
#include <my_bit.h>

/* An iterator to quickly walk over bits in ulonglong bitmap. */
class Table_map_iterator
{
  ulonglong bmp;
public:
  Table_map_iterator(ulonglong t): bmp(t){}
  uint next_bit()
  {
    if (!bmp)
      return BITMAP_END;
    uint bit= my_find_first_bit(bmp);
    bmp &= ~(1ULL << bit);
    return bit;
  }
  int operator++(int) { return next_bit(); }
  enum { BITMAP_END= 64 };
};

template <uint width> class Bitmap
{
/*
  Workaround GCC optimizer bug (generating SSE instuctions on unaligned data)
*/
#if defined (__GNUC__) && defined(__x86_64__) && (__GNUC__ < 6) && !defined(__clang__)
#define NEED_GCC_NO_SSE_WORKAROUND
#endif

#ifdef NEED_GCC_NO_SSE_WORKAROUND
#pragma GCC push_options
#pragma GCC target ("no-sse")
#endif

private:
  static const int BITS_PER_ELEMENT= sizeof(ulonglong) * 8;
  static const int ARRAY_ELEMENTS= (width + BITS_PER_ELEMENT - 1) / BITS_PER_ELEMENT;
  static const ulonglong ALL_BITS_SET= ULLONG_MAX;

ulonglong buffer[ARRAY_ELEMENTS];

uint bit_index(uint n) const
  {
    DBUG_ASSERT(n < width);
    return ARRAY_ELEMENTS == 1 ? 0 : n / BITS_PER_ELEMENT;
  }
  ulonglong bit_mask(uint n) const
  {
    DBUG_ASSERT(n < width);
    return ARRAY_ELEMENTS == 1 ? 1ULL << n : 1ULL << (n % BITS_PER_ELEMENT);
  }
  ulonglong last_element_mask(int n) const
  {
    DBUG_ASSERT(n % BITS_PER_ELEMENT != 0);
    return bit_mask(n) - 1;
  }

public:
  /*
   The default constructor does nothing.
   The caller is supposed to either zero the memory
   or to call set_all()/clear_all()/set_prefix()
   to initialize bitmap.
  */
  Bitmap() = default;

explicit Bitmap(uint prefix)
  {
    set_prefix(prefix);
  }
  void init(uint prefix)
  {
    set_prefix(prefix);
  }
  uint length() const
  {
    return width;
  }
  void set_bit(uint n)
  {
    buffer[bit_index(n)] |= bit_mask(n);
  }
  void clear_bit(uint n)
  {
    buffer[bit_index(n)] &= ~bit_mask(n);
  }
  bool is_set(uint n) const
  {
    return buffer[bit_index(n)] & bit_mask(n);
  }
  void set_prefix(uint prefix_size)
  {
    set_if_smaller(prefix_size, width);

size_t idx= prefix_size / BITS_PER_ELEMENT;

for (size_t i= 0; i < idx; i++)
      buffer[i]= ALL_BITS_SET;

if (prefix_size % BITS_PER_ELEMENT)
      buffer[idx++]= last_element_mask(prefix_size);

for (size_t i= idx; i < ARRAY_ELEMENTS; i++)
      buffer[i]= 0;
  }
  bool is_prefix(uint prefix_size) const
  {
    DBUG_ASSERT(prefix_size <= width);

size_t idx= prefix_size / BITS_PER_ELEMENT;

for (size_t i= 0; i < idx; i++)
      if (buffer[i] != ALL_BITS_SET)
        return false;

if (prefix_size % BITS_PER_ELEMENT)
      if (buffer[idx++] != last_element_mask(prefix_size))
        return false;

for (size_t i= idx; i < ARRAY_ELEMENTS; i++)
      if (buffer[i] != 0)
        return false;

return true;
  }
  void set_all()
  {
    if (width % BITS_PER_ELEMENT)
      set_prefix(width);
    else if (ARRAY_ELEMENTS > 1)
      memset(buffer, 0xff, sizeof(buffer));
    else
      buffer[0] = ALL_BITS_SET;
  }
  void clear_all()
  {
    if (ARRAY_ELEMENTS > 1)
      memset(buffer, 0, sizeof(buffer));
    else
      buffer[0]= 0;
  }
  void intersect(const Bitmap& map2)
  {
    for (size_t i= 0; i < ARRAY_ELEMENTS; i++)
      buffer[i] &= map2.buffer[i];
  }

private:
  /*
     Intersect with a bitmap represented as longlong.
     In addition, pad the rest of the bitmap with 0 or 1 bits
     depending on pad_with_ones parameter.
  */
  void intersect_and_pad(ulonglong map2buff, bool pad_with_ones)
  {
    buffer[0] &= map2buff;

for (size_t i= 1; i < ARRAY_ELEMENTS; i++)
      buffer[i]= pad_with_ones ? ALL_BITS_SET : 0;

if (ARRAY_ELEMENTS > 1 && (width % BITS_PER_ELEMENT) && pad_with_ones)
      buffer[ARRAY_ELEMENTS - 1]= last_element_mask(width);
  }

public:
  void intersect(ulonglong map2buff)
  {
    intersect_and_pad(map2buff, 0);
  }
  /* Use highest bit for all bits above first element. */
  void intersect_extended(ulonglong map2buff)
  {
    intersect_and_pad(map2buff, (map2buff & (1ULL << 63)));
  }
  void subtract(const Bitmap& map2)
  {
    for (size_t i= 0; i < ARRAY_ELEMENTS; i++)
      buffer[i] &= ~(map2.buffer[i]);
  }
  void merge(const Bitmap& map2)
  {
    for (size_t i= 0; i < ARRAY_ELEMENTS; i++)
      buffer[i] |= map2.buffer[i];
  }
  bool is_clear_all() const
  {
    for (size_t i= 0; i < ARRAY_ELEMENTS; i++)
      if (buffer[i])
        return false;
    return true;
  }
  bool is_subset(const Bitmap& map2) const
  {
    for (size_t i= 0; i < ARRAY_ELEMENTS; i++)
      if (buffer[i] & ~(map2.buffer[i]))
        return false;
    return true;
  }
  bool is_overlapping(const Bitmap& map2) const
  {
    for (size_t i= 0; i < ARRAY_ELEMENTS; i++)
      if (buffer[i] & map2.buffer[i])
        return true;
    return false;
  }
  bool operator==(const Bitmap& map2) const
  {
    if (ARRAY_ELEMENTS > 1)
      return !memcmp(buffer,map2.buffer,sizeof(buffer));
    return buffer[0] == map2.buffer[0];
  }
  bool operator!=(const Bitmap& map2) const
  {
    return !(*this == map2);
  }
  /*
    Print hexadecimal representation of bitmap.
    Truncate trailing zeros.
  */
  char *print(char *buf) const
  {
    size_t last; /*index of the last non-zero element, or 0. */

for (last= ARRAY_ELEMENTS - 1; last && !buffer[last]; last--){}

const int HEX_DIGITS_PER_ELEMENT= BITS_PER_ELEMENT / 4;
    for (size_t i= 0; i < last; i++)
    {
      ulonglong num = buffer[i];
      uint shift = BITS_PER_ELEMENT - 4;
      size_t pos= i * HEX_DIGITS_PER_ELEMENT;
      for (size_t j= 0; j < HEX_DIGITS_PER_ELEMENT; j++)
      {
        buf[pos + j]= _dig_vec_upper[(num >> shift) & 0xf];
        shift += 4;
      }
    }
    longlong2str(buffer[last], buf, 16);
    return buf;
  }
  ulonglong to_ulonglong() const
  {
    return buffer[0];
  }
  uint bits_set() const
  {
    uint res= 0;
    for (size_t i= 0; i < ARRAY_ELEMENTS; i++)
      if (buffer[i])
        res+= my_count_bits(buffer[i]);
    return res;
  }
  uint find_first_bit() const
  {
    for (size_t i= 0; i < ARRAY_ELEMENTS; i++)
      if (buffer[i])
        return (uint)i*BITS_PER_ELEMENT + my_find_first_bit(buffer[i]);
    return width;
  }
  class Iterator
  {
    const Bitmap& map;
    uint offset;
    Table_map_iterator tmi;
  public:
    Iterator(const Bitmap<width>& map2) : map(map2), offset(0), tmi(map2.buffer[0]) {}
    int operator++(int)
    {
      for (;;)
      {
        int nextbit= tmi++;

if (nextbit != Table_map_iterator::BITMAP_END)
          return offset + nextbit;

if (offset + BITS_PER_ELEMENT >= map.length())
          return BITMAP_END;

offset += BITS_PER_ELEMENT;
        tmi= Table_map_iterator(map.buffer[offset / BITS_PER_ELEMENT]);
      }
    }
    enum { BITMAP_END = width };
  };

#ifdef NEED_GCC_NO_SSE_WORKAROUND
#pragma GCC pop_options
#undef NEED_GCC_NO_SSE_WORKAROUND
#endif
};

typedef Bitmap<MAX_INDEXES> key_map; /* Used for finding keys */

#endif /* SQL_BITMAP_INCLUDED */

X7ROOT File Manager

Editing: sql_bitmap.h

Upload File

Create Folder