Commit eadb2c2d authored by unknown's avatar unknown
Browse files

Merge romeo.(none):/home/bkroot/mysql-5.1-new-rpl

into  romeo.(none):/home/bk/b19033-mysql-5.1-new-rpl


sql/log.cc:
  Auto merged
sql/log_event.cc:
  Auto merged
sql/log_event.h:
  Auto merged
sql/rpl_utility.h:
  Auto merged
sql/slave.h:
  Auto merged
sql/sql_insert.cc:
  Auto merged
parents 2d9e8747 8a8bb772
Loading
Loading
Loading
Loading
+4 −13
Original line number Diff line number Diff line
@@ -31,15 +31,6 @@

#include <mysql/plugin.h>

/*
  Define placement versions of operator new and operator delete since
  we cannot be sure that the <new> include exists.
 */
inline void *operator new(size_t, void *ptr) { return ptr; }
inline void *operator new[](size_t, void *ptr) { return ptr; }
inline void  operator delete(void*, void*) { /* Do nothing */ }
inline void  operator delete[](void*, void*) { /* Do nothing */ }

/* max size of the log message */
#define MAX_LOG_BUFFER_SIZE 1024
#define MAX_USER_HOST_SIZE 512
@@ -147,8 +138,8 @@ class binlog_trx_data {
   */
  void truncate(my_off_t pos)
  {
    DBUG_PRINT("info", ("truncating to position %lu", pos));
    DBUG_PRINT("info", ("before_stmt_pos=%lu", pos));
    DBUG_PRINT("info", ("truncating to position %ld", pos));
    DBUG_PRINT("info", ("before_stmt_pos=%lu", (void*) pos));
    delete pending();
    set_pending(0);
    reinit_io_cache(&trans_log, WRITE_CACHE, pos, 0, 0);
@@ -3480,9 +3471,9 @@ int THD::binlog_flush_transaction_cache()
{
  DBUG_ENTER("binlog_flush_transaction_cache");
  binlog_trx_data *trx_data= (binlog_trx_data*) ha_data[binlog_hton->slot];
  DBUG_PRINT("enter", ("trx_data=0x%lu", trx_data));
  DBUG_PRINT("enter", ("trx_data=0x%lu", (void*) trx_data));
  if (trx_data)
    DBUG_PRINT("enter", ("trx_data->before_stmt_pos=%u",
    DBUG_PRINT("enter", ("trx_data->before_stmt_pos=%d",
                         trx_data->before_stmt_pos));

  /*
+61 −17
Original line number Diff line number Diff line
@@ -5760,15 +5760,45 @@ int Rows_log_event::exec_event(st_relay_log_info *rli)
        DBUG_RETURN(error);
      }
    }

    /*
      When the open and locking succeeded, we add all the tables to
      the table map and remove them from tables to lock.
      When the open and locking succeeded, we check all tables to
      ensure that they still have the correct type.

      We can use a down cast here since we know that every table added
      to the tables_to_lock is a RPL_TABLE_LIST.
    */

    {
      RPL_TABLE_LIST *ptr= static_cast<RPL_TABLE_LIST*>(rli->tables_to_lock);
      for ( ; ptr ; ptr= static_cast<RPL_TABLE_LIST*>(ptr->next_global))
      {
        if (ptr->m_tabledef.compatible_with(rli, ptr->table))
        {
          mysql_unlock_tables(thd, thd->lock);
          thd->lock= 0;
          thd->query_error= 1;
          rli->clear_tables_to_lock();
          DBUG_RETURN(ERR_BAD_TABLE_DEF);
        }
      }
    }

    /*
      ... and then we add all the tables to the table map and remove
      them from tables to lock.

      We also invalidate the query cache for all the tables, since
      they will now be changed.

      TODO [/Matz]: Maybe the query cache should not be invalidated
      here? It might be that a table is not changed, even though it
      was locked for the statement.  We do know that each
      Rows_log_event contain at least one row, so after processing one
      Rows_log_event, we can invalidate the query cache for the
      associated table.
     */
    TABLE_LIST *ptr;
    for (ptr= rli->tables_to_lock ; ptr ; ptr= ptr->next_global)
    for (TABLE_LIST *ptr= rli->tables_to_lock ; ptr ; ptr= ptr->next_global)
    {
      rli->m_table_map.set_table(ptr->table_id, ptr->table);
    }
@@ -6221,11 +6251,11 @@ int Table_map_log_event::exec_event(st_relay_log_info *rli)
  thd->query_id= next_query_id();
  pthread_mutex_unlock(&LOCK_thread_count);

  TABLE_LIST *table_list;
  RPL_TABLE_LIST *table_list;
  char *db_mem, *tname_mem;
  void *const memory=
    my_multi_malloc(MYF(MY_WME),
                    &table_list, sizeof(TABLE_LIST),
                    &table_list, sizeof(RPL_TABLE_LIST),
                    &db_mem, NAME_LEN + 1,
                    &tname_mem, NAME_LEN + 1,
                    NULL);
@@ -6271,11 +6301,27 @@ int Table_map_log_event::exec_event(st_relay_log_info *rli)
    }

    /*
      Open the table if it is not already open and add the table to table map.
      Note that for any table that should not be replicated, a filter is needed.
      Open the table if it is not already open and add the table to
      table map.  Note that for any table that should not be
      replicated, a filter is needed.

      The creation of a new TABLE_LIST is used to up-cast the
      table_list consisting of RPL_TABLE_LIST items. This will work
      since the only case where the argument to open_tables() is
      changed, is when thd->lex->query_tables == table_list, i.e.,
      when the statement requires prelocking. Since this is not
      executed when a statement is executed, this case will not occur.
      As a precaution, an assertion is added to ensure that the bad
      case is not a fact.

      Either way, the memory in the list is *never* released
      internally in the open_tables() function, hence we take a copy
      of the pointer to make sure that it's not lost.
    */
    uint count;
    if ((error= open_tables(thd, &table_list, &count, 0)))
    DBUG_ASSERT(thd->lex->query_tables != table_list);
    TABLE_LIST *tmp_table_list= table_list;
    if ((error= open_tables(thd, &tmp_table_list, &count, 0)))
    {
      if (thd->query_error || thd->is_fatal_error)
      {
@@ -6302,14 +6348,12 @@ int Table_map_log_event::exec_event(st_relay_log_info *rli)
    */
    DBUG_ASSERT(m_table->in_use);

    table_def const def(m_coltype, m_colcnt);
    if (def.compatible_with(rli, m_table))
    {
      thd->query_error= 1;
      error= ERR_BAD_TABLE_DEF;
      goto err;
      /* purecov: end */
    }
    /*
      Use placement new to construct the table_def instance in the
      memory allocated for it inside table_list.
    */
    const table_def *const def=
      new (&table_list->m_tabledef) table_def(m_coltype, m_colcnt);

    /*
      We record in the slave's information that the table should be
+23 −8
Original line number Diff line number Diff line
@@ -1727,14 +1727,17 @@ class Table_map_log_event : public Log_event
    TYPE_CODE = TABLE_MAP_EVENT
  };

  /**
     Enumeration of the errors that can be returned.
   */
  enum enum_error
  {
    ERR_OPEN_FAILURE = -1,                 /* Failure to open table */
    ERR_OK = 0,                                  /* No error */
    ERR_TABLE_LIMIT_EXCEEDED = 1,        /* No more room for tables */
    ERR_OUT_OF_MEM = 2,                         /* Out of memory */
    ERR_BAD_TABLE_DEF = 3,       /* Table definition does not match */
    ERR_RBR_TO_SBR = 4    /* daisy-chanining RBR to SBR not allowed */
    ERR_OPEN_FAILURE = -1,               /**< Failure to open table */
    ERR_OK = 0,                                 /**< No error */
    ERR_TABLE_LIMIT_EXCEEDED = 1,      /**< No more room for tables */
    ERR_OUT_OF_MEM = 2,                         /**< Out of memory */
    ERR_BAD_TABLE_DEF = 3,     /**< Table definition does not match */
    ERR_RBR_TO_SBR = 4  /**< daisy-chanining RBR to SBR not allowed */
  };

  enum enum_flag
@@ -1814,7 +1817,7 @@ class Table_map_log_event : public Log_event

 Row level log event class.

 Common base class for all row-level log events.
 Common base class for all row-containing log events.

 RESPONSIBILITIES

@@ -1828,6 +1831,19 @@ class Table_map_log_event : public Log_event
class Rows_log_event : public Log_event
{
public:
  /**
     Enumeration of the errors that can be returned.
   */
  enum enum_error
  {
    ERR_OPEN_FAILURE = -1,               /**< Failure to open table */
    ERR_OK = 0,                                 /**< No error */
    ERR_TABLE_LIMIT_EXCEEDED = 1,      /**< No more room for tables */
    ERR_OUT_OF_MEM = 2,                         /**< Out of memory */
    ERR_BAD_TABLE_DEF = 3,     /**< Table definition does not match */
    ERR_RBR_TO_SBR = 4  /**< daisy-chanining RBR to SBR not allowed */
  };

  /*
    These definitions allow you to combine the flags into an
    appropriate flag set using the normal bitwise operators.  The
@@ -1835,7 +1851,6 @@ class Rows_log_event : public Log_event
    accepted by the compiler, which is then used to set the real set
    of flags.
  */

  enum enum_flag
  {
    /* Last event of a statement */
+57 −48
Original line number Diff line number Diff line
@@ -23,97 +23,96 @@
#include "mysql_priv.h"

uint32
field_length_from_packed(enum_field_types const field_type, 
                         byte const *const data);
field_length_from_packed(enum_field_types field_type, byte const *data);

/*
/**
  A table definition from the master.

  RESPONSIBILITIES

  The responsibilities of this class is:
  - Extract and decode table definition data from the table map event
  - Check if table definition in table map is compatible with table
    definition on slave

  DESCRIPTION

  Currently, the only field type data available is an array of the
  type operators that are present in the table map event.

  TODO

    Add type operands to this structure to allow detection of
  @todo Add type operands to this structure to allow detection of
     difference between, e.g., BIT(5) and BIT(10).
 */

class table_def
{
public:
  /*
  /**
    Convenience declaration of the type of the field type data in a
    table map event.
  */
  typedef unsigned char field_type;

  /*
  /**
    Constructor.

    SYNOPSIS
      table_def()
      types Array of types
      size  Number of elements in array 'types'
    @param types Array of types
    @param size  Number of elements in array 'types'
   */
  table_def(field_type *types, my_size_t size)
    : m_type(types), m_size(size)
    : m_type(new unsigned char [size]), m_size(size)
  {
    if (m_type)
      memcpy(m_type, types, size);
    else
      m_size= 0;
  }

  /*
    Return the number of fields there is type data for.
  ~table_def() {
    if (m_type)
      delete [] m_type;
#ifndef DBUG_OFF
    m_type= 0;
    m_size= 0;
#endif
  }

    SYNOPSIS
      size()
  /**
    Return the number of fields there is type data for.

    RETURN VALUE
      The number of fields that there is type data for.
    @return The number of fields that there is type data for.
   */
  my_size_t size() const { return m_size; }


  /*
    Return a representation of the type data for one field.

    SYNOPSIS
      type()
      i   Field index to return data for
    @param index Field index to return data for

    RETURN VALUE

      Will return a representation of the type data for field
      'i'. Currently, only the type identifier is returned.
    @return Will return a representation of the type data for field
    <code>index</code>. Currently, only the type identifier is
    returned.
   */
  field_type type(my_ptrdiff_t i) const { return m_type[i]; }
  field_type type(my_ptrdiff_t index) const
  {
    DBUG_ASSERT(0 <= index);
    DBUG_ASSERT(static_cast<my_size_t>(index) < m_size);
    return m_type[index];
  }

  /*
  /**
    Decide if the table definition is compatible with a table.

    SYNOPSIS
      compatible_with()
      rli   Pointer to relay log info
      table Pointer to table to compare with.

    DESCRIPTION

    Compare the definition with a table to see if it is compatible
      with it.  A table definition is compatible with a table if:
    with it.

    A table definition is compatible with a table if:
      - the columns types of the table definition is a (not
        necessarily proper) prefix of the column type of the table, or

      - the other way around

    RETURN VALUE
      1  if the table definition is not compatible with 'table'
      0  if the table definition is compatible with 'table'
    @param rli   Pointer to relay log info
    @param table Pointer to table to compare with.

    @retval 1  if the table definition is not compatible with @c table
    @retval 0  if the table definition is compatible with @c table
  */
  int compatible_with(RELAY_LOG_INFO *rli, TABLE *table) const;

@@ -122,4 +121,14 @@ class table_def
  field_type *m_type;                     // Array of type descriptors
};

/**
   Extend the normal table list with a few new fields needed by the
   slave thread, but nowhere else.
 */
struct RPL_TABLE_LIST
  : public st_table_list
{
  table_def m_tabledef;
};

#endif /* RPL_UTILITY_H */
+9 −0
Original line number Diff line number Diff line
@@ -213,6 +213,15 @@ extern I_List<THD> threads;
#define SLAVE_IO  1
#define SLAVE_SQL 2

/*
  Define placement versions of operator new and operator delete since
  we cannot be sure that the <new> include exists.
 */
inline void *operator new(size_t, void *ptr) { return ptr; }
inline void *operator new[](size_t, void *ptr) { return ptr; }
inline void  operator delete(void*, void*) { /* Do nothing */ }
inline void  operator delete[](void*, void*) { /* Do nothing */ }

#endif

Loading