1
/* Copyright (C) 2005 MySQL AB
3
This program is free software; you can redistribute it and/or modify
4
it under the terms of the GNU General Public License as published by
5
the Free Software Foundation; version 2 of the License.
7
This program is distributed in the hope that it will be useful,
8
but WITHOUT ANY WARRANTY; without even the implied warranty of
9
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10
GNU General Public License for more details.
12
You should have received a copy of the GNU General Public License
13
along with this program; if not, write to the Free Software
14
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
16
#include <drizzled/server_includes.h>
18
#ifdef HAVE_REPLICATION
20
#include "rpl_tblmap.h"
22
#define MAYBE_TABLE_NAME(T) ((T) ? (T)->s->table_name.str : "<>")
23
#define TABLE_ID_HASH_SIZE 32
24
#define TABLE_ID_CHUNK 256
26
table_mapping::table_mapping()
30
No "free_element" function for entries passed here, as the entries are
31
allocated in a MEM_ROOT (freed as a whole in the destructor), they cannot
33
Note that below we don't test if hash_init() succeeded. This constructor
34
is called at startup only.
36
(void) hash_init(&m_table_ids,&my_charset_bin,TABLE_ID_HASH_SIZE,
37
offsetof(entry,table_id),sizeof(ulong),
39
/* We don't preallocate any block, this is consistent with m_free=0 above */
40
init_alloc_root(&m_mem_root, TABLE_ID_HASH_SIZE*sizeof(entry), 0);
43
table_mapping::~table_mapping()
45
hash_free(&m_table_ids);
46
free_root(&m_mem_root, MYF(0));
49
st_table* table_mapping::get_table(ulong table_id)
51
entry *e= find_entry(table_id);
61
Called when we are out of table id entries. Creates TABLE_ID_CHUNK
62
new entries, chain them and attach them at the head of the list of free
63
(free for use) entries.
65
int table_mapping::expand()
68
If we wanted to use "tmp= new (&m_mem_root) entry[TABLE_ID_CHUNK]",
69
we would have to make "entry" derive from Sql_alloc but then it would not
70
be a POD anymore and we want it to be (see rpl_tblmap.h). So we allocate
73
entry *tmp= (entry *)alloc_root(&m_mem_root, TABLE_ID_CHUNK*sizeof(entry));
75
return ERR_MEMORY_ALLOCATION; // Memory allocation failed
77
/* Find the end of this fresh new array of free entries */
78
entry *e_end= tmp+TABLE_ID_CHUNK-1;
79
for (entry *e= tmp; e < e_end; e++)
86
int table_mapping::set_table(ulong table_id, TABLE* table)
88
entry *e= find_entry(table_id);
91
if (m_free == 0 && expand())
92
return(ERR_MEMORY_ALLOCATION); // Memory allocation failed
97
hash_delete(&m_table_ids,(uchar *)e);
99
e->table_id= table_id;
101
my_hash_insert(&m_table_ids,(uchar *)e);
106
int table_mapping::remove_table(ulong table_id)
108
entry *e= find_entry(table_id);
111
hash_delete(&m_table_ids,(uchar *)e);
112
/* we add this entry to the chain of free (free for use) entries */
117
return 1; // No table to remove
121
Puts all entries into the list of free-for-use entries (does not free any
122
memory), and empties the hash.
124
void table_mapping::clear_tables()
126
for (uint i= 0; i < m_table_ids.records; i++)
128
entry *e= (entry *)hash_element(&m_table_ids, i);
132
my_hash_reset(&m_table_ids);