2005-10-27 09:29:40 +02:00
|
|
|
/**********************************************************************
|
|
|
|
Data dictionary memory object creation
|
|
|
|
|
|
|
|
(c) 1996 Innobase Oy
|
|
|
|
|
|
|
|
Created 1/8/1996 Heikki Tuuri
|
|
|
|
***********************************************************************/
|
|
|
|
|
|
|
|
#include "dict0mem.h"
|
|
|
|
|
|
|
|
#ifdef UNIV_NONINL
|
|
|
|
#include "dict0mem.ic"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "rem0rec.h"
|
|
|
|
#include "data0type.h"
|
|
|
|
#include "mach0data.h"
|
|
|
|
#include "dict0dict.h"
|
|
|
|
#include "que0que.h"
|
|
|
|
#include "pars0pars.h"
|
|
|
|
#include "lock0lock.h"
|
|
|
|
|
|
|
|
#define DICT_HEAP_SIZE 100 /* initial memory heap size when
|
|
|
|
creating a table or index object */
|
|
|
|
|
|
|
|
/**************************************************************************
|
|
|
|
Creates a table memory object. */
|
|
|
|
|
|
|
|
dict_table_t*
|
|
|
|
dict_mem_table_create(
|
|
|
|
/*==================*/
|
|
|
|
/* out, own: table object */
|
|
|
|
const char* name, /* in: table name */
|
|
|
|
ulint space, /* in: space where the clustered index of
|
|
|
|
the table is placed; this parameter is
|
|
|
|
ignored if the table is made a member of
|
|
|
|
a cluster */
|
|
|
|
ulint n_cols, /* in: number of columns */
|
2006-02-27 10:33:26 +01:00
|
|
|
ulint flags) /* in: table flags */
|
2005-10-27 09:29:40 +02:00
|
|
|
{
|
|
|
|
dict_table_t* table;
|
|
|
|
mem_heap_t* heap;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
ut_ad(name);
|
|
|
|
|
|
|
|
heap = mem_heap_create(DICT_HEAP_SIZE);
|
|
|
|
|
|
|
|
table = mem_heap_alloc(heap, sizeof(dict_table_t));
|
|
|
|
|
|
|
|
table->heap = heap;
|
|
|
|
|
2006-02-27 10:33:26 +01:00
|
|
|
table->flags = flags;
|
2005-10-27 09:29:40 +02:00
|
|
|
table->name = mem_heap_strdup(heap, name);
|
|
|
|
table->dir_path_of_temp_table = NULL;
|
|
|
|
table->space = space;
|
|
|
|
table->ibd_file_missing = FALSE;
|
|
|
|
table->tablespace_discarded = FALSE;
|
|
|
|
table->n_def = 0;
|
|
|
|
table->n_cols = n_cols + DATA_N_SYS_COLS;
|
|
|
|
|
|
|
|
table->n_mysql_handles_opened = 0;
|
|
|
|
table->n_foreign_key_checks_running = 0;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
table->cached = FALSE;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
table->cols = mem_heap_alloc(heap, (n_cols + DATA_N_SYS_COLS)
|
2006-08-29 11:30:31 +02:00
|
|
|
* sizeof(dict_col_t));
|
2005-10-27 09:29:40 +02:00
|
|
|
UT_LIST_INIT(table->indexes);
|
|
|
|
|
|
|
|
table->auto_inc_lock = mem_heap_alloc(heap, lock_get_size());
|
|
|
|
|
|
|
|
table->query_cache_inv_trx_id = ut_dulint_zero;
|
|
|
|
|
|
|
|
UT_LIST_INIT(table->locks);
|
|
|
|
UT_LIST_INIT(table->foreign_list);
|
|
|
|
UT_LIST_INIT(table->referenced_list);
|
|
|
|
|
|
|
|
table->does_not_fit_in_memory = FALSE;
|
|
|
|
|
|
|
|
table->stat_initialized = FALSE;
|
|
|
|
|
|
|
|
table->stat_modified_counter = 0;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2006-06-13 22:23:26 +02:00
|
|
|
table->max_row_size = 0;
|
|
|
|
|
2006-05-08 08:18:59 +02:00
|
|
|
mutex_create(&table->autoinc_mutex, SYNC_DICT_AUTOINC_MUTEX);
|
2005-10-27 09:29:40 +02:00
|
|
|
|
|
|
|
table->autoinc_inited = FALSE;
|
|
|
|
|
|
|
|
table->magic_n = DICT_TABLE_MAGIC_N;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
return(table);
|
|
|
|
}
|
|
|
|
|
2006-04-12 11:32:17 +02:00
|
|
|
/********************************************************************
|
|
|
|
Free a table memory object. */
|
2005-10-27 09:29:40 +02:00
|
|
|
|
|
|
|
void
|
2006-04-12 11:32:17 +02:00
|
|
|
dict_mem_table_free(
|
|
|
|
/*================*/
|
|
|
|
dict_table_t* table) /* in: table */
|
2005-10-27 09:29:40 +02:00
|
|
|
{
|
2006-04-12 11:32:17 +02:00
|
|
|
ut_ad(table);
|
|
|
|
ut_ad(table->magic_n == DICT_TABLE_MAGIC_N);
|
|
|
|
|
|
|
|
mutex_free(&(table->autoinc_mutex));
|
|
|
|
mem_heap_free(table->heap);
|
2005-10-27 09:29:40 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**************************************************************************
|
|
|
|
Adds a column definition to a table. */
|
|
|
|
|
|
|
|
void
|
|
|
|
dict_mem_table_add_col(
|
|
|
|
/*===================*/
|
|
|
|
dict_table_t* table, /* in: table */
|
|
|
|
const char* name, /* in: column name */
|
|
|
|
ulint mtype, /* in: main datatype */
|
|
|
|
ulint prtype, /* in: precise type */
|
|
|
|
ulint len, /* in: length */
|
|
|
|
ulint prec) /* in: precision */
|
|
|
|
{
|
|
|
|
dict_col_t* col;
|
|
|
|
dtype_t* type;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
ut_ad(table && name);
|
|
|
|
ut_ad(table->magic_n == DICT_TABLE_MAGIC_N);
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
table->n_def++;
|
|
|
|
|
2006-02-23 20:25:29 +01:00
|
|
|
col = dict_table_get_nth_col(table, table->n_def - 1);
|
2005-10-27 09:29:40 +02:00
|
|
|
|
|
|
|
col->ind = table->n_def - 1;
|
|
|
|
col->name = mem_heap_strdup(table->heap, name);
|
|
|
|
col->table = table;
|
|
|
|
col->ord_part = 0;
|
2006-08-31 13:00:02 +02:00
|
|
|
col->min_prefix = 0;
|
2005-10-27 09:29:40 +02:00
|
|
|
|
|
|
|
col->clust_pos = ULINT_UNDEFINED;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
type = dict_col_get_type(col);
|
|
|
|
|
|
|
|
dtype_set(type, mtype, prtype, len, prec);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**************************************************************************
|
|
|
|
Creates an index memory object. */
|
|
|
|
|
|
|
|
dict_index_t*
|
|
|
|
dict_mem_index_create(
|
|
|
|
/*==================*/
|
|
|
|
/* out, own: index object */
|
|
|
|
const char* table_name, /* in: table name */
|
|
|
|
const char* index_name, /* in: index name */
|
|
|
|
ulint space, /* in: space where the index tree is
|
|
|
|
placed, ignored if the index is of
|
|
|
|
the clustered type */
|
|
|
|
ulint type, /* in: DICT_UNIQUE,
|
|
|
|
DICT_CLUSTERED, ... ORed */
|
|
|
|
ulint n_fields) /* in: number of fields */
|
|
|
|
{
|
|
|
|
dict_index_t* index;
|
|
|
|
mem_heap_t* heap;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
ut_ad(table_name && index_name);
|
|
|
|
|
|
|
|
heap = mem_heap_create(DICT_HEAP_SIZE);
|
|
|
|
index = mem_heap_alloc(heap, sizeof(dict_index_t));
|
|
|
|
|
|
|
|
index->heap = heap;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
index->type = type;
|
|
|
|
index->space = space;
|
|
|
|
index->name = mem_heap_strdup(heap, index_name);
|
|
|
|
index->table_name = table_name;
|
|
|
|
index->table = NULL;
|
|
|
|
index->n_def = index->n_nullable = 0;
|
|
|
|
index->n_fields = n_fields;
|
|
|
|
index->fields = mem_heap_alloc(heap, 1 + n_fields
|
2006-08-29 11:30:31 +02:00
|
|
|
* sizeof(dict_field_t));
|
|
|
|
/* The '1 +' above prevents allocation
|
|
|
|
of an empty mem block */
|
2005-10-27 09:29:40 +02:00
|
|
|
index->stat_n_diff_key_vals = NULL;
|
|
|
|
|
|
|
|
index->cached = FALSE;
|
|
|
|
index->magic_n = DICT_INDEX_MAGIC_N;
|
|
|
|
|
|
|
|
return(index);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**************************************************************************
|
|
|
|
Creates and initializes a foreign constraint memory object. */
|
|
|
|
|
|
|
|
dict_foreign_t*
|
|
|
|
dict_mem_foreign_create(void)
|
|
|
|
/*=========================*/
|
|
|
|
/* out, own: foreign constraint struct */
|
|
|
|
{
|
|
|
|
dict_foreign_t* foreign;
|
|
|
|
mem_heap_t* heap;
|
|
|
|
|
|
|
|
heap = mem_heap_create(100);
|
|
|
|
|
|
|
|
foreign = mem_heap_alloc(heap, sizeof(dict_foreign_t));
|
|
|
|
|
|
|
|
foreign->heap = heap;
|
|
|
|
|
|
|
|
foreign->id = NULL;
|
|
|
|
|
|
|
|
foreign->type = 0;
|
|
|
|
foreign->foreign_table_name = NULL;
|
|
|
|
foreign->foreign_table = NULL;
|
|
|
|
foreign->foreign_col_names = NULL;
|
|
|
|
|
|
|
|
foreign->referenced_table_name = NULL;
|
|
|
|
foreign->referenced_table = NULL;
|
|
|
|
foreign->referenced_col_names = NULL;
|
|
|
|
|
|
|
|
foreign->n_fields = 0;
|
|
|
|
|
|
|
|
foreign->foreign_index = NULL;
|
|
|
|
foreign->referenced_index = NULL;
|
|
|
|
|
|
|
|
return(foreign);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**************************************************************************
|
|
|
|
Adds a field definition to an index. NOTE: does not take a copy
|
|
|
|
of the column name if the field is a column. The memory occupied
|
|
|
|
by the column name may be released only after publishing the index. */
|
|
|
|
|
|
|
|
void
|
|
|
|
dict_mem_index_add_field(
|
|
|
|
/*=====================*/
|
|
|
|
dict_index_t* index, /* in: index */
|
|
|
|
const char* name, /* in: column name */
|
|
|
|
ulint prefix_len) /* in: 0 or the column prefix length
|
|
|
|
in a MySQL index like
|
|
|
|
INDEX (textcol(25)) */
|
|
|
|
{
|
|
|
|
dict_field_t* field;
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
ut_ad(index && name);
|
|
|
|
ut_ad(index->magic_n == DICT_INDEX_MAGIC_N);
|
2006-02-23 20:25:29 +01:00
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
index->n_def++;
|
|
|
|
|
2006-02-23 20:25:29 +01:00
|
|
|
field = dict_index_get_nth_field(index, index->n_def - 1);
|
2005-10-27 09:29:40 +02:00
|
|
|
|
|
|
|
field->name = name;
|
|
|
|
field->prefix_len = prefix_len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**************************************************************************
|
|
|
|
Frees an index memory object. */
|
|
|
|
|
|
|
|
void
|
|
|
|
dict_mem_index_free(
|
|
|
|
/*================*/
|
|
|
|
dict_index_t* index) /* in: index */
|
|
|
|
{
|
2006-04-12 11:32:17 +02:00
|
|
|
ut_ad(index);
|
|
|
|
ut_ad(index->magic_n == DICT_INDEX_MAGIC_N);
|
|
|
|
|
2005-10-27 09:29:40 +02:00
|
|
|
mem_heap_free(index->heap);
|
|
|
|
}
|