← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to drizzled/rpl_tblmap.cc

  • Committer: Monty Taylor
  • Date: 2008-09-15 17:24:04 UTC
  • Revision ID: monty@inaugust.com-20080915172404-ygh6hiyu0q7qpa9x
Removed strndup calls.

Show diffs side-by-side

added added

removed removed

Lines of Context:
drizzled/rpl_tblmap.cc
15
15
 
16
16
#include <drizzled/server_includes.h>
17
17
 
 
18
#ifdef HAVE_REPLICATION
 
19
 
18
20
#include "rpl_tblmap.h"
19
21
 
20
22
#define MAYBE_TABLE_NAME(T) ((T) ? (T)->s->table_name.str : "<>")
92
94
    m_free= m_free->next;
93
95
  }
94
96
  else
95
 
    hash_delete(&m_table_ids,(unsigned char *)e);
 
97
    hash_delete(&m_table_ids,(uchar *)e);
96
98
 
97
99
  e->table_id= table_id;
98
100
  e->table= table;
99
 
  my_hash_insert(&m_table_ids,(unsigned char *)e);
 
101
  my_hash_insert(&m_table_ids,(uchar *)e);
100
102
 
101
103
  return(0);            // All OK
102
104
}
106
108
  entry *e= find_entry(table_id);
107
109
  if (e)
108
110
  {
109
 
    hash_delete(&m_table_ids,(unsigned char *)e);
 
111
    hash_delete(&m_table_ids,(uchar *)e);
110
112
    /* we add this entry to the chain of free (free for use) entries */
111
113
    e->next= m_free;
112
114
    m_free= e;
121
123
*/
122
124
void table_mapping::clear_tables()
123
125
{
124
 
  for (uint32_t i= 0; i < m_table_ids.records; i++)
 
126
  for (uint i= 0; i < m_table_ids.records; i++)
125
127
  {
126
128
    entry *e= (entry *)hash_element(&m_table_ids, i);
127
129
    e->next= m_free;
130
132
  my_hash_reset(&m_table_ids);
131
133
  return;
132
134
}
 
135
 
 
136
#endif