~drizzle-trunk/drizzle/development

/*****************************************************************************

Copyright (c) 1996, 2009, Innobase Oy. All Rights Reserved.

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 the Free Software

Foundation; version 2 of the License.

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 Foundation, Inc., 59 Temple

Place, Suite 330, Boston, MA 02111-1307 USA

*****************************************************************************/

/******************************************************************//**

@file dict/dict0mem.c

Data dictionary memory object creation

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"

#ifndef UNIV_HOTBACKUP

# include "lock0lock.h"

#endif /* !UNIV_HOTBACKUP */

#define	DICT_HEAP_SIZE		100	/*!< initial memory heap size when

					creating a table or index object */

/**********************************************************************//**

Creates a table memory object.

@return	own: table object */

UNIV_INTERN

dict_table_t*

dict_mem_table_create(

/*==================*/

	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 */

	ulint		flags)	/*!< in: table flags */

{

	dict_table_t*	table;

	mem_heap_t*	heap;

	ut_ad(name);

	ut_a(!(flags & (~0 << DICT_TF_BITS)));

	heap = mem_heap_create(DICT_HEAP_SIZE);

	table = mem_heap_zalloc(heap, sizeof(dict_table_t));

	table->heap = heap;

	table->flags = (unsigned int) flags;

	table->name = mem_heap_strdup(heap, name);

	table->space = (unsigned int) space;

	table->n_cols = (unsigned int) (n_cols + DATA_N_SYS_COLS);

	table->cols = mem_heap_alloc(heap, (n_cols + DATA_N_SYS_COLS)

				     * sizeof(dict_col_t));

#ifndef UNIV_HOTBACKUP

	table->autoinc_lock = mem_heap_alloc(heap, lock_get_size());

	mutex_create(&table->autoinc_mutex, SYNC_DICT_AUTOINC_MUTEX);

	table->autoinc = 0;

	/* The number of transactions that are either waiting on the

	AUTOINC lock or have been granted the lock. */

	table->n_waiting_or_granted_auto_inc_locks = 0;

#endif /* !UNIV_HOTBACKUP */

	ut_d(table->magic_n = DICT_TABLE_MAGIC_N);

	return(table);

}

/****************************************************************//**

Free a table memory object. */

UNIV_INTERN

void

dict_mem_table_free(

/*================*/

	dict_table_t*	table)		/*!< in: table */

{

	ut_ad(table);

	ut_ad(table->magic_n == DICT_TABLE_MAGIC_N);

	ut_d(table->cached = FALSE);

#ifndef UNIV_HOTBACKUP

	mutex_free(&(table->autoinc_mutex));

#endif /* UNIV_HOTBACKUP */

	mem_heap_free(table->heap);

}

/****************************************************************//**

Append 'name' to 'col_names'.  @see dict_table_t::col_names

@return	new column names array */

static

const char*

dict_add_col_name(

/*==============*/

	const char*	col_names,	/*!< in: existing column names, or

					NULL */

	ulint		cols,		/*!< in: number of existing columns */

	const char*	name,		/*!< in: new column name */

	mem_heap_t*	heap)		/*!< in: heap */

{

	ulint	old_len;

	ulint	new_len;

	ulint	total_len;

	char*	res;

	ut_ad(!cols == !col_names);

	/* Find out length of existing array. */

	if (col_names) {

		const char*	s = col_names;

		ulint		i;

		for (i = 0; i < cols; i++) {

			s += strlen(s) + 1;

		}

		old_len = s - col_names;

	} else {

		old_len = 0;

	}

	new_len = strlen(name) + 1;

	total_len = old_len + new_len;

	res = mem_heap_alloc(heap, total_len);

	if (old_len > 0) {

		memcpy(res, col_names, old_len);

	}

	memcpy(res + old_len, name, new_len);

	return(res);

}

/**********************************************************************//**

Adds a column definition to a table. */

UNIV_INTERN

void

dict_mem_table_add_col(

/*===================*/

	dict_table_t*	table,	/*!< in: table */

	mem_heap_t*	heap,	/*!< in: temporary memory heap, or NULL */

	const char*	name,	/*!< in: column name, or NULL */

	ulint		mtype,	/*!< in: main datatype */

	ulint		prtype,	/*!< in: precise type */

	ulint		len)	/*!< in: precision */

{

	dict_col_t*	col;

#ifndef UNIV_HOTBACKUP

	ulint		mbminlen;

	ulint		mbmaxlen;

#endif /* !UNIV_HOTBACKUP */

	ulint		i;

	ut_ad(table);

	ut_ad(table->magic_n == DICT_TABLE_MAGIC_N);

	ut_ad(!heap == !name);

	i = table->n_def++;

	if (name) {

		if (UNIV_UNLIKELY(table->n_def == table->n_cols)) {

			heap = table->heap;

		}

		if (UNIV_LIKELY(i) && UNIV_UNLIKELY(!table->col_names)) {

			/* All preceding column names are empty. */

			char* s = mem_heap_zalloc(heap, table->n_def);

			table->col_names = s;

		}

		table->col_names = dict_add_col_name(table->col_names,

						     i, name, heap);

	}

	col = dict_table_get_nth_col(table, i);

	col->ind = (unsigned int) i;

	col->ord_part = 0;

	col->mtype = (unsigned int) mtype;

	col->prtype = (unsigned int) prtype;

	col->len = (unsigned int) len;

#ifndef UNIV_HOTBACKUP

	dtype_get_mblen(mtype, prtype, &mbminlen, &mbmaxlen);

	col->mbminlen = (unsigned int) mbminlen;

	col->mbmaxlen = (unsigned int) mbmaxlen;

#endif /* !UNIV_HOTBACKUP */

}

/**********************************************************************//**

Creates an index memory object.

@return	own: index object */

UNIV_INTERN

dict_index_t*

dict_mem_index_create(

/*==================*/

	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;

	ut_ad(table_name && index_name);

	heap = mem_heap_create(DICT_HEAP_SIZE);

	index = mem_heap_zalloc(heap, sizeof(dict_index_t));

	index->heap = heap;

	index->type = type;

#ifndef UNIV_HOTBACKUP

	index->space = (unsigned int) space;

#endif /* !UNIV_HOTBACKUP */

	index->name = mem_heap_strdup(heap, index_name);

	index->table_name = table_name;

	index->n_fields = (unsigned int) n_fields;

	index->fields = mem_heap_alloc(heap, 1 + n_fields

				       * sizeof(dict_field_t));

	/* The '1 +' above prevents allocation

	of an empty mem block */

#ifdef UNIV_DEBUG

	index->magic_n = DICT_INDEX_MAGIC_N;

#endif /* UNIV_DEBUG */

	return(index);

}

/**********************************************************************//**

Creates and initializes a foreign constraint memory object.

@return	own: foreign constraint struct */

UNIV_INTERN

dict_foreign_t*

dict_mem_foreign_create(void)

/*=========================*/

{

	dict_foreign_t*	foreign;

	mem_heap_t*	heap;

	heap = mem_heap_create(100);

	foreign = mem_heap_zalloc(heap, sizeof(dict_foreign_t));

	foreign->heap = heap;

	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. */

UNIV_INTERN

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;

	ut_ad(index);

	ut_ad(index->magic_n == DICT_INDEX_MAGIC_N);

	index->n_def++;

	field = dict_index_get_nth_field(index, index->n_def - 1);

	field->name = name;

	field->prefix_len = (unsigned int) prefix_len;

}

/**********************************************************************//**

Frees an index memory object. */

UNIV_INTERN

void

dict_mem_index_free(

/*================*/

	dict_index_t*	index)	/*!< in: index */

{

	ut_ad(index);

	ut_ad(index->magic_n == DICT_INDEX_MAGIC_N);

	mem_heap_free(index->heap);

}