2012-02-16 10:48:16 +01:00
|
|
|
/* Copyright (c) 2006, 2011, Oracle and/or its affiliates. All rights reserved.
|
2006-01-12 19:51:02 +01:00
|
|
|
|
|
|
|
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
|
2006-12-27 02:23:51 +01:00
|
|
|
the Free Software Foundation; version 2 of the License.
|
2006-01-12 19:51:02 +01:00
|
|
|
|
|
|
|
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
|
2006-12-31 02:29:11 +01:00
|
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
|
2006-01-12 19:51:02 +01:00
|
|
|
|
2010-03-31 16:05:33 +02:00
|
|
|
#include "sql_priv.h"
|
|
|
|
#include "unireg.h" // REQUIRED by later includes
|
2006-01-12 19:51:02 +01:00
|
|
|
#include "rpl_injector.h"
|
2009-12-03 19:37:38 +01:00
|
|
|
#include "transaction.h"
|
2010-03-31 16:05:33 +02:00
|
|
|
#include "sql_parse.h" // begin_trans, end_trans, COMMIT
|
|
|
|
#include "sql_base.h" // close_thread_tables
|
|
|
|
#include "log_event.h" // Incident_log_event
|
2006-01-12 19:51:02 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
injector::transaction - member definitions
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* inline since it's called below */
|
|
|
|
inline
|
2006-05-05 08:45:58 +02:00
|
|
|
injector::transaction::transaction(MYSQL_BIN_LOG *log, THD *thd)
|
2006-02-24 16:19:55 +01:00
|
|
|
: m_state(START_STATE), m_thd(thd)
|
2006-01-12 19:51:02 +01:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
Default initialization of m_start_pos (which initializes it to garbage).
|
|
|
|
We need to fill it in using the code below.
|
|
|
|
*/
|
|
|
|
LOG_INFO log_info;
|
|
|
|
log->get_current_log(&log_info);
|
|
|
|
/* !!! binlog_pos does not follow RAII !!! */
|
|
|
|
m_start_pos.m_file_name= my_strdup(log_info.log_file_name, MYF(0));
|
|
|
|
m_start_pos.m_file_pos= log_info.pos;
|
|
|
|
|
2009-12-03 19:37:38 +01:00
|
|
|
trans_begin(m_thd);
|
2006-01-12 19:51:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
injector::transaction::~transaction()
|
|
|
|
{
|
2006-03-11 06:58:48 +01:00
|
|
|
if (!good())
|
|
|
|
return;
|
|
|
|
|
2006-01-12 19:51:02 +01:00
|
|
|
/* Needed since my_free expects a 'char*' (instead of 'void*'). */
|
|
|
|
char* const the_memory= const_cast<char*>(m_start_pos.m_file_name);
|
|
|
|
|
|
|
|
/*
|
|
|
|
We set the first character to null just to give all the copies of the
|
|
|
|
start position a (minimal) chance of seening that the memory is lost.
|
|
|
|
All assuming the my_free does not step over the memory, of course.
|
|
|
|
*/
|
|
|
|
*the_memory= '\0';
|
|
|
|
|
Bug#34043: Server loops excessively in _checkchunk() when safemalloc is enabled
Essentially, the problem is that safemalloc is excruciatingly
slow as it checks all allocated blocks for overrun at each
memory management primitive, yielding a almost exponential
slowdown for the memory management functions (malloc, realloc,
free). The overrun check basically consists of verifying some
bytes of a block for certain magic keys, which catches some
simple forms of overrun. Another minor problem is violation
of aliasing rules and that its own internal list of blocks
is prone to corruption.
Another issue with safemalloc is rather the maintenance cost
as the tool has a significant impact on the server code.
Given the magnitude of memory debuggers available nowadays,
especially those that are provided with the platform malloc
implementation, maintenance of a in-house and largely obsolete
memory debugger becomes a burden that is not worth the effort
due to its slowness and lack of support for detecting more
common forms of heap corruption.
Since there are third-party tools that can provide the same
functionality at a lower or comparable performance cost, the
solution is to simply remove safemalloc. Third-party tools
can provide the same functionality at a lower or comparable
performance cost.
The removal of safemalloc also allows a simplification of the
malloc wrappers, removing quite a bit of kludge: redefinition
of my_malloc, my_free and the removal of the unused second
argument of my_free. Since free() always check whether the
supplied pointer is null, redudant checks are also removed.
Also, this patch adds unit testing for my_malloc and moves
my_realloc implementation into the same file as the other
memory allocation primitives.
2010-07-08 23:20:08 +02:00
|
|
|
my_free(the_memory);
|
2006-01-12 19:51:02 +01:00
|
|
|
}
|
|
|
|
|
2010-02-04 21:15:47 +01:00
|
|
|
/**
|
|
|
|
@retval 0 transaction committed
|
|
|
|
@retval 1 transaction rolled back
|
|
|
|
*/
|
2006-01-12 19:51:02 +01:00
|
|
|
int injector::transaction::commit()
|
|
|
|
{
|
|
|
|
DBUG_ENTER("injector::transaction::commit()");
|
2010-02-04 21:15:47 +01:00
|
|
|
int error= m_thd->binlog_flush_pending_rows_event(true);
|
2008-02-19 12:43:01 +01:00
|
|
|
/*
|
|
|
|
Cluster replication does not preserve statement or
|
|
|
|
transaction boundaries of the master. Instead, a new
|
|
|
|
transaction on replication slave is started when a new GCI
|
|
|
|
(global checkpoint identifier) is issued, and is committed
|
|
|
|
when the last event of the check point has been received and
|
|
|
|
processed. This ensures consistency of each cluster in
|
|
|
|
cluster replication, and there is no requirement for stronger
|
|
|
|
consistency: MySQL replication is asynchronous with other
|
|
|
|
engines as well.
|
|
|
|
|
|
|
|
A practical consequence of that is that row level replication
|
|
|
|
stream passed through the injector thread never contains
|
|
|
|
COMMIT events.
|
|
|
|
Here we should preserve the server invariant that there is no
|
|
|
|
outstanding statement transaction when the normal transaction
|
|
|
|
is committed by committing the statement transaction
|
|
|
|
explicitly.
|
|
|
|
*/
|
2009-12-03 19:37:38 +01:00
|
|
|
trans_commit_stmt(m_thd);
|
Backport of revno ## 2617.31.1, 2617.31.3, 2617.31.4, 2617.31.5,
2617.31.12, 2617.31.15, 2617.31.15, 2617.31.16, 2617.43.1
- initial changeset that introduced the fix for
Bug#989 and follow up fixes for all test suite failures
introduced in the initial changeset.
------------------------------------------------------------
revno: 2617.31.1
committer: Davi Arnaut <Davi.Arnaut@Sun.COM>
branch nick: 4284-6.0
timestamp: Fri 2009-03-06 19:17:00 -0300
message:
Bug#989: If DROP TABLE while there's an active transaction, wrong binlog order
WL#4284: Transactional DDL locking
Currently the MySQL server does not keep metadata locks on
schema objects for the duration of a transaction, thus failing
to guarantee the integrity of the schema objects being used
during the transaction and to protect then from concurrent
DDL operations. This also poses a problem for replication as
a DDL operation might be replicated even thought there are
active transactions using the object being modified.
The solution is to defer the release of metadata locks until
a active transaction is either committed or rolled back. This
prevents other statements from modifying the table for the
entire duration of the transaction. This provides commitment
ordering for guaranteeing serializability across multiple
transactions.
- Incompatible change:
If MySQL's metadata locking system encounters a lock conflict,
the usual schema is to use the try and back-off technique to
avoid deadlocks -- this schema consists in releasing all locks
and trying to acquire them all in one go.
But in a transactional context this algorithm can't be utilized
as its not possible to release locks acquired during the course
of the transaction without breaking the transaction commitments.
To avoid deadlocks in this case, the ER_LOCK_DEADLOCK will be
returned if a lock conflict is encountered during a transaction.
Let's consider an example:
A transaction has two statements that modify table t1, then table
t2, and then commits. The first statement of the transaction will
acquire a shared metadata lock on table t1, and it will be kept
utill COMMIT to ensure serializability.
At the moment when the second statement attempts to acquire a
shared metadata lock on t2, a concurrent ALTER or DROP statement
might have locked t2 exclusively. The prescription of the current
locking protocol is that the acquirer of the shared lock backs off
-- gives up all his current locks and retries. This implies that
the entire multi-statement transaction has to be rolled back.
- Incompatible change:
FLUSH commands such as FLUSH PRIVILEGES and FLUSH TABLES WITH READ
LOCK won't cause locked tables to be implicitly unlocked anymore.
2009-12-05 00:02:48 +01:00
|
|
|
if (!trans_commit(m_thd))
|
|
|
|
{
|
|
|
|
close_thread_tables(m_thd);
|
A prerequisite patch for the fix for Bug#46224
"HANDLER statements within a transaction might lead to deadlocks".
Introduce a notion of a sentinel to MDL_context. A sentinel
is a ticket that separates all tickets in the context into two
groups: before and after it. Currently we can have (and need) only
one designated sentinel -- it separates all locks taken by LOCK
TABLE or HANDLER statement, which must survive COMMIT and ROLLBACK
and all other locks, which must be released at COMMIT or ROLLBACK.
The tricky part is maintaining the sentinel up to date when
someone release its corresponding ticket. This can happen, e.g.
if someone issues DROP TABLE under LOCK TABLES (generally,
see all calls to release_all_locks_for_name()).
MDL_context::release_ticket() is modified to take care of it.
******
A fix and a test case for Bug#46224 "HANDLER statements within a
transaction might lead to deadlocks".
An attempt to mix HANDLER SQL statements, which are transaction-
agnostic, an open multi-statement transaction,
and DDL against the involved tables (in a concurrent connection)
could lead to a deadlock. The deadlock would occur when
HANDLER OPEN or HANDLER READ would have to wait on a conflicting
metadata lock. If the connection that issued HANDLER statement
also had other metadata locks (say, acquired in scope of a
transaction), a classical deadlock situation of mutual wait
could occur.
Incompatible change: entering LOCK TABLES mode automatically
closes all open HANDLERs in the current connection.
Incompatible change: previously an attempt to wait on a lock
in a connection that has an open HANDLER statement could wait
indefinitely/deadlock. After this patch, an error ER_LOCK_DEADLOCK
is produced.
The idea of the fix is to merge thd->handler_mdl_context
with the main mdl_context of the connection, used for transactional
locks. This makes deadlock detection possible, since all waits
with locks are "visible" and available to analysis in a single
MDL context of the connection.
Since HANDLER locks and transactional locks have a different life
cycle -- HANDLERs are explicitly open and closed, and so
are HANDLER locks, explicitly acquired and released, whereas
transactional locks "accumulate" till the end of a transaction
and are released only with COMMIT, ROLLBACK and ROLLBACK TO SAVEPOINT,
a concept of "sentinel" was introduced to MDL_context.
All locks, HANDLER and others, reside in the same linked list.
However, a selected element of the list separates locks with
different life cycle. HANDLER locks always reside at the
end of the list, after the sentinel. Transactional locks are
prepended to the beginning of the list, before the sentinel.
Thus, ROLLBACK, COMMIT or ROLLBACK TO SAVEPOINT, only
release those locks that reside before the sentinel. HANDLER locks
must be released explicitly as part of HANDLER CLOSE statement,
or an implicit close.
The same approach with sentinel
is also employed for LOCK TABLES locks. Since HANDLER and LOCK TABLES
statement has never worked together, the implementation is
made simple and only maintains one sentinel, which is used either
for HANDLER locks, or for LOCK TABLES locks.
2009-12-22 17:09:15 +01:00
|
|
|
m_thd->mdl_context.release_transactional_locks();
|
Backport of revno ## 2617.31.1, 2617.31.3, 2617.31.4, 2617.31.5,
2617.31.12, 2617.31.15, 2617.31.15, 2617.31.16, 2617.43.1
- initial changeset that introduced the fix for
Bug#989 and follow up fixes for all test suite failures
introduced in the initial changeset.
------------------------------------------------------------
revno: 2617.31.1
committer: Davi Arnaut <Davi.Arnaut@Sun.COM>
branch nick: 4284-6.0
timestamp: Fri 2009-03-06 19:17:00 -0300
message:
Bug#989: If DROP TABLE while there's an active transaction, wrong binlog order
WL#4284: Transactional DDL locking
Currently the MySQL server does not keep metadata locks on
schema objects for the duration of a transaction, thus failing
to guarantee the integrity of the schema objects being used
during the transaction and to protect then from concurrent
DDL operations. This also poses a problem for replication as
a DDL operation might be replicated even thought there are
active transactions using the object being modified.
The solution is to defer the release of metadata locks until
a active transaction is either committed or rolled back. This
prevents other statements from modifying the table for the
entire duration of the transaction. This provides commitment
ordering for guaranteeing serializability across multiple
transactions.
- Incompatible change:
If MySQL's metadata locking system encounters a lock conflict,
the usual schema is to use the try and back-off technique to
avoid deadlocks -- this schema consists in releasing all locks
and trying to acquire them all in one go.
But in a transactional context this algorithm can't be utilized
as its not possible to release locks acquired during the course
of the transaction without breaking the transaction commitments.
To avoid deadlocks in this case, the ER_LOCK_DEADLOCK will be
returned if a lock conflict is encountered during a transaction.
Let's consider an example:
A transaction has two statements that modify table t1, then table
t2, and then commits. The first statement of the transaction will
acquire a shared metadata lock on table t1, and it will be kept
utill COMMIT to ensure serializability.
At the moment when the second statement attempts to acquire a
shared metadata lock on t2, a concurrent ALTER or DROP statement
might have locked t2 exclusively. The prescription of the current
locking protocol is that the acquirer of the shared lock backs off
-- gives up all his current locks and retries. This implies that
the entire multi-statement transaction has to be rolled back.
- Incompatible change:
FLUSH commands such as FLUSH PRIVILEGES and FLUSH TABLES WITH READ
LOCK won't cause locked tables to be implicitly unlocked anymore.
2009-12-05 00:02:48 +01:00
|
|
|
}
|
2010-02-04 21:15:47 +01:00
|
|
|
DBUG_RETURN(error);
|
2006-01-12 19:51:02 +01:00
|
|
|
}
|
|
|
|
|
Backport of revno ## 2617.31.1, 2617.31.3, 2617.31.4, 2617.31.5,
2617.31.12, 2617.31.15, 2617.31.15, 2617.31.16, 2617.43.1
- initial changeset that introduced the fix for
Bug#989 and follow up fixes for all test suite failures
introduced in the initial changeset.
------------------------------------------------------------
revno: 2617.31.1
committer: Davi Arnaut <Davi.Arnaut@Sun.COM>
branch nick: 4284-6.0
timestamp: Fri 2009-03-06 19:17:00 -0300
message:
Bug#989: If DROP TABLE while there's an active transaction, wrong binlog order
WL#4284: Transactional DDL locking
Currently the MySQL server does not keep metadata locks on
schema objects for the duration of a transaction, thus failing
to guarantee the integrity of the schema objects being used
during the transaction and to protect then from concurrent
DDL operations. This also poses a problem for replication as
a DDL operation might be replicated even thought there are
active transactions using the object being modified.
The solution is to defer the release of metadata locks until
a active transaction is either committed or rolled back. This
prevents other statements from modifying the table for the
entire duration of the transaction. This provides commitment
ordering for guaranteeing serializability across multiple
transactions.
- Incompatible change:
If MySQL's metadata locking system encounters a lock conflict,
the usual schema is to use the try and back-off technique to
avoid deadlocks -- this schema consists in releasing all locks
and trying to acquire them all in one go.
But in a transactional context this algorithm can't be utilized
as its not possible to release locks acquired during the course
of the transaction without breaking the transaction commitments.
To avoid deadlocks in this case, the ER_LOCK_DEADLOCK will be
returned if a lock conflict is encountered during a transaction.
Let's consider an example:
A transaction has two statements that modify table t1, then table
t2, and then commits. The first statement of the transaction will
acquire a shared metadata lock on table t1, and it will be kept
utill COMMIT to ensure serializability.
At the moment when the second statement attempts to acquire a
shared metadata lock on t2, a concurrent ALTER or DROP statement
might have locked t2 exclusively. The prescription of the current
locking protocol is that the acquirer of the shared lock backs off
-- gives up all his current locks and retries. This implies that
the entire multi-statement transaction has to be rolled back.
- Incompatible change:
FLUSH commands such as FLUSH PRIVILEGES and FLUSH TABLES WITH READ
LOCK won't cause locked tables to be implicitly unlocked anymore.
2009-12-05 00:02:48 +01:00
|
|
|
|
2006-02-24 16:19:55 +01:00
|
|
|
int injector::transaction::use_table(server_id_type sid, table tbl)
|
|
|
|
{
|
|
|
|
DBUG_ENTER("injector::transaction::use_table");
|
|
|
|
|
|
|
|
int error;
|
|
|
|
|
|
|
|
if ((error= check_state(TABLE_STATE)))
|
|
|
|
DBUG_RETURN(error);
|
|
|
|
|
2007-04-12 16:13:49 +02:00
|
|
|
server_id_type save_id= m_thd->server_id;
|
2006-02-24 16:19:55 +01:00
|
|
|
m_thd->set_server_id(sid);
|
|
|
|
error= m_thd->binlog_write_table_map(tbl.get_table(),
|
|
|
|
tbl.is_transactional());
|
2007-04-12 16:13:49 +02:00
|
|
|
m_thd->set_server_id(save_id);
|
2006-02-24 16:19:55 +01:00
|
|
|
DBUG_RETURN(error);
|
|
|
|
}
|
|
|
|
|
2006-01-12 19:51:02 +01:00
|
|
|
|
|
|
|
int injector::transaction::write_row (server_id_type sid, table tbl,
|
|
|
|
MY_BITMAP const* cols, size_t colcnt,
|
|
|
|
record_type record)
|
|
|
|
{
|
|
|
|
DBUG_ENTER("injector::transaction::write_row(...)");
|
2010-02-06 11:28:06 +01:00
|
|
|
|
2010-01-28 22:51:40 +01:00
|
|
|
int error= check_state(ROW_STATE);
|
|
|
|
if (error)
|
2006-02-24 16:19:55 +01:00
|
|
|
DBUG_RETURN(error);
|
|
|
|
|
2007-04-12 16:13:49 +02:00
|
|
|
server_id_type save_id= m_thd->server_id;
|
2006-01-12 19:51:02 +01:00
|
|
|
m_thd->set_server_id(sid);
|
2010-02-04 21:15:47 +01:00
|
|
|
error= m_thd->binlog_write_row(tbl.get_table(), tbl.is_transactional(),
|
|
|
|
cols, colcnt, record);
|
2007-04-12 16:13:49 +02:00
|
|
|
m_thd->set_server_id(save_id);
|
2010-02-04 21:15:47 +01:00
|
|
|
DBUG_RETURN(error);
|
2006-01-12 19:51:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int injector::transaction::delete_row(server_id_type sid, table tbl,
|
|
|
|
MY_BITMAP const* cols, size_t colcnt,
|
|
|
|
record_type record)
|
|
|
|
{
|
|
|
|
DBUG_ENTER("injector::transaction::delete_row(...)");
|
2006-02-24 16:19:55 +01:00
|
|
|
|
2010-01-28 22:51:40 +01:00
|
|
|
int error= check_state(ROW_STATE);
|
|
|
|
if (error)
|
2006-02-24 16:19:55 +01:00
|
|
|
DBUG_RETURN(error);
|
|
|
|
|
2007-04-12 16:13:49 +02:00
|
|
|
server_id_type save_id= m_thd->server_id;
|
2006-01-12 19:51:02 +01:00
|
|
|
m_thd->set_server_id(sid);
|
2010-02-04 21:15:47 +01:00
|
|
|
error= m_thd->binlog_delete_row(tbl.get_table(), tbl.is_transactional(),
|
|
|
|
cols, colcnt, record);
|
2007-04-12 16:13:49 +02:00
|
|
|
m_thd->set_server_id(save_id);
|
2010-02-04 21:15:47 +01:00
|
|
|
DBUG_RETURN(error);
|
2006-01-12 19:51:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int injector::transaction::update_row(server_id_type sid, table tbl,
|
|
|
|
MY_BITMAP const* cols, size_t colcnt,
|
|
|
|
record_type before, record_type after)
|
|
|
|
{
|
|
|
|
DBUG_ENTER("injector::transaction::update_row(...)");
|
2006-02-24 16:19:55 +01:00
|
|
|
|
2010-01-28 22:51:40 +01:00
|
|
|
int error= check_state(ROW_STATE);
|
|
|
|
if (error)
|
2006-02-24 16:19:55 +01:00
|
|
|
DBUG_RETURN(error);
|
|
|
|
|
2007-04-12 16:13:49 +02:00
|
|
|
server_id_type save_id= m_thd->server_id;
|
2006-01-12 19:51:02 +01:00
|
|
|
m_thd->set_server_id(sid);
|
2010-02-04 21:15:47 +01:00
|
|
|
error= m_thd->binlog_update_row(tbl.get_table(), tbl.is_transactional(),
|
|
|
|
cols, colcnt, before, after);
|
2007-04-12 16:13:49 +02:00
|
|
|
m_thd->set_server_id(save_id);
|
2010-02-04 21:15:47 +01:00
|
|
|
DBUG_RETURN(error);
|
2006-01-12 19:51:02 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
injector::transaction::binlog_pos injector::transaction::start_pos() const
|
|
|
|
{
|
|
|
|
return m_start_pos;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
injector - member definitions
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* This constructor is called below */
|
|
|
|
inline injector::injector()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
static injector *s_injector= 0;
|
|
|
|
injector *injector::instance()
|
|
|
|
{
|
|
|
|
if (s_injector == 0)
|
|
|
|
s_injector= new injector;
|
|
|
|
/* "There can be only one [instance]" */
|
|
|
|
return s_injector;
|
|
|
|
}
|
|
|
|
|
2006-06-19 14:31:22 +02:00
|
|
|
void injector::free_instance()
|
|
|
|
{
|
|
|
|
injector *inj = s_injector;
|
|
|
|
|
|
|
|
if (inj != 0)
|
|
|
|
{
|
|
|
|
s_injector= 0;
|
|
|
|
delete inj;
|
|
|
|
}
|
|
|
|
}
|
2006-01-12 19:51:02 +01:00
|
|
|
|
|
|
|
|
|
|
|
injector::transaction injector::new_trans(THD *thd)
|
|
|
|
{
|
|
|
|
DBUG_ENTER("injector::new_trans(THD*)");
|
|
|
|
/*
|
|
|
|
Currently, there is no alternative to using 'mysql_bin_log' since that
|
|
|
|
is hardcoded into the way the handler is using the binary log.
|
|
|
|
*/
|
|
|
|
DBUG_RETURN(transaction(&mysql_bin_log, thd));
|
|
|
|
}
|
|
|
|
|
|
|
|
void injector::new_trans(THD *thd, injector::transaction *ptr)
|
|
|
|
{
|
|
|
|
DBUG_ENTER("injector::new_trans(THD *, transaction *)");
|
|
|
|
/*
|
|
|
|
Currently, there is no alternative to using 'mysql_bin_log' since that
|
|
|
|
is hardcoded into the way the handler is using the binary log.
|
|
|
|
*/
|
|
|
|
transaction trans(&mysql_bin_log, thd);
|
|
|
|
ptr->swap(trans);
|
|
|
|
|
|
|
|
DBUG_VOID_RETURN;
|
|
|
|
}
|
2007-03-29 20:31:09 +02:00
|
|
|
|
|
|
|
int injector::record_incident(THD *thd, Incident incident)
|
|
|
|
{
|
|
|
|
Incident_log_event ev(thd, incident);
|
|
|
|
if (int error= mysql_bin_log.write(&ev))
|
|
|
|
return error;
|
2011-10-27 16:14:41 +02:00
|
|
|
return mysql_bin_log.rotate_and_purge(true);
|
2007-03-29 20:31:09 +02:00
|
|
|
}
|
|
|
|
|
2007-04-03 14:31:46 +02:00
|
|
|
int injector::record_incident(THD *thd, Incident incident, LEX_STRING const message)
|
2007-03-29 20:31:09 +02:00
|
|
|
{
|
|
|
|
Incident_log_event ev(thd, incident, message);
|
|
|
|
if (int error= mysql_bin_log.write(&ev))
|
|
|
|
return error;
|
2011-10-27 16:14:41 +02:00
|
|
|
return mysql_bin_log.rotate_and_purge(true);
|
2007-03-29 20:31:09 +02:00
|
|
|
}
|