#include "univ.i"
#include "dict0types.h"
#include "data0type.h"
#include "mem0mem.h"
#include "row0types.h"
#include "rem0types.h"
#include "btr0types.h"
#include "lock0types.h"
#include "que0types.h"
#include "sync0rw.h"
#include "ut0mem.h"
#include "ut0lst.h"
#include "ut0rnd.h"
#include "ut0byte.h"
#include "hash0hash.h"
#include "trx0types.h"
#include "fts0fts.h"
#include "dict0mem.ic"

Include dependency graph for dict0mem.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	dict_col_t
struct	dict_field_t
struct	zip_pad_info_t
struct	dict_index_t
struct	dict_foreign_t
struct	dict_table_t

Macros
#define	DICT_TF2_FLAG_SET(table, flag) (table->flags2 \|= (flag))
#define	DICT_TF2_FLAG_IS_SET(table, flag) (table->flags2 & (flag))
#define	DICT_TF2_FLAG_UNSET(table, flag) (table->flags2 &= ~(flag))
#define	DICT_FK_MAX_RECURSIVE_LOAD 20
#define	FK_MAX_CASCADE_DEL 255
#define	DICT_ANTELOPE_MAX_INDEX_COL_LEN REC_ANTELOPE_MAX_INDEX_COL_LEN
	DICT_ANTELOPE_MAX_INDEX_COL_LEN is measured in bytes and is the maximum indexed column length (or indexed prefix length) in ROW_FORMAT=REDUNDANT and ROW_FORMAT=COMPACT. Also, in any format, any fixed-length field that is longer than this will be encoded as a variable-length field.
#define	DICT_MAX_FIELD_LEN_BY_FORMAT(table)
#define	DICT_MAX_FIELD_LEN_BY_FORMAT_FLAG(flags)
#define	DICT_MAX_FIXED_COL_LEN DICT_ANTELOPE_MAX_INDEX_COL_LEN
#define	ZIP_PAD_ROUND_LEN (128)
#define	ZIP_PAD_SUCCESSFUL_ROUND_LIMIT (5)
#define	ZIP_PAD_INCR (128)
#define	MAX_KEY_LENGTH_BITS 12

#define	DICT_CLUSTERED 1
#define	DICT_UNIQUE 2
#define	DICT_UNIVERSAL 4
#define	DICT_IBUF 8
#define	DICT_CORRUPT 16
#define	DICT_FTS
#define	DICT_IT_BITS 6

#define	DICT_TF_REDUNDANT 0
#define	DICT_TF_COMPACT 1
#define	DICT_N_COLS_COMPACT 0x80000000UL
#define	DICT_TF_WIDTH_COMPACT 1
#define	DICT_TF_WIDTH_ZIP_SSIZE 4
#define	DICT_TF_WIDTH_ATOMIC_BLOBS 1
#define	DICT_TF_WIDTH_DATA_DIR 1
#define	DICT_TF_BITS
#define	DICT_TF_BIT_MASK (~(~0 << DICT_TF_BITS))
#define	DICT_TF_POS_COMPACT 0
#define	DICT_TF_POS_ZIP_SSIZE
#define	DICT_TF_POS_ATOMIC_BLOBS
#define	DICT_TF_POS_DATA_DIR
#define	DICT_TF_POS_UNUSED
#define	DICT_TF_MASK_COMPACT
#define	DICT_TF_MASK_ZIP_SSIZE
#define	DICT_TF_MASK_ATOMIC_BLOBS
#define	DICT_TF_MASK_DATA_DIR
#define	DICT_TF_GET_COMPACT(flags)
#define	DICT_TF_GET_ZIP_SSIZE(flags)
#define	DICT_TF_HAS_ATOMIC_BLOBS(flags)
#define	DICT_TF_HAS_DATA_DIR(flags)
#define	DICT_TF_GET_UNUSED(flags) (flags >> DICT_TF_POS_UNUSED)

#define	DICT_TF2_BITS 6
	Table Flags set number 2.
#define	DICT_TF2_BIT_MASK ~(~0 << DICT_TF2_BITS)
#define	DICT_TF2_TEMPORARY 1
#define	DICT_TF2_FTS_HAS_DOC_ID 2
#define	DICT_TF2_FTS 4
#define	DICT_TF2_FTS_ADD_DOC_ID 8
#define	DICT_TF2_USE_TABLESPACE 16
#define	DICT_TF2_DISCARDED 32

#define	DICT_FOREIGN_ON_DELETE_CASCADE 1
#define	DICT_FOREIGN_ON_DELETE_SET_NULL 2
#define	DICT_FOREIGN_ON_UPDATE_CASCADE 4
#define	DICT_FOREIGN_ON_UPDATE_SET_NULL 8
#define	DICT_FOREIGN_ON_DELETE_NO_ACTION 16
#define	DICT_FOREIGN_ON_UPDATE_NO_ACTION 32

#define	DICT_STATS_PERSISTENT_ON (1 << 1)
#define	DICT_STATS_PERSISTENT_OFF (1 << 2)
#define	DICT_STATS_AUTO_RECALC_ON (1 << 1)
#define	DICT_STATS_AUTO_RECALC_OFF (1 << 2)
#define	BG_STAT_NONE 0
#define	BG_STAT_IN_PROGRESS (1 << 0)
#define	BG_STAT_SHOULD_QUIT (1 << 1)

Enumerations
enum	online_index_status { ONLINE_INDEX_COMPLETE = 0, ONLINE_INDEX_CREATION, ONLINE_INDEX_ABORTED, ONLINE_INDEX_ABORTED_DROPPED }

Functions
UNIV_INTERN dict_table_t *	dict_mem_table_create (const char *name, ulint space, ulint n_cols, ulint flags, ulint flags2)
UNIV_INTERN void	dict_mem_table_free (dict_table_t *table)
UNIV_INTERN void	dict_mem_table_add_col (dict_table_t table, mem_heap_t heap, const char *name, ulint mtype, ulint prtype, ulint len) __attribute__((nonnull(1)))
UNIV_INTERN void	dict_mem_table_col_rename (dict_table_t table, unsigned nth_col, const char from, const char *to) __attribute__((nonnull))
UNIV_INTERN void	dict_mem_fill_column_struct (dict_col_t *column, ulint col_pos, ulint mtype, ulint prtype, ulint col_len)
UNIV_INLINE void	dict_mem_fill_index_struct (dict_index_t index, mem_heap_t heap, const char table_name, const char index_name, ulint space, ulint type, ulint n_fields)
UNIV_INTERN dict_index_t *	dict_mem_index_create (const char table_name, const char index_name, ulint space, ulint type, ulint n_fields)
UNIV_INTERN void	dict_mem_index_add_field (dict_index_t index, const char name, ulint prefix_len)
UNIV_INTERN void	dict_mem_index_free (dict_index_t *index)
UNIV_INTERN dict_foreign_t *	dict_mem_foreign_create (void)
UNIV_INTERN void	dict_mem_foreign_table_name_lookup_set (dict_foreign_t *foreign, ibool do_alloc)
UNIV_INTERN void	dict_mem_referenced_table_name_lookup_set (dict_foreign_t *foreign, ibool do_alloc)
UNIV_INTERN	__attribute__ ((nonnull, warn_unused_result)) char dict_mem_create_temporary_tablename(mem_heap_t heap

Variables
UNIV_INTERN const char *	dbtab
UNIV_INTERN const char table_id_t	id
ulong	zip_failure_threshold_pct
ulong	zip_pad_max

Detailed Description

Data dictionary memory object creation

Created 1/8/1996 Heikki Tuuri

Definition in file dict0mem.h.

Macro Definition Documentation

#define BG_STAT_IN_PROGRESS (1 << 0)

BG_STAT_IN_PROGRESS is set in stats_bg_flag when the background stats code is working on this table. The DROP TABLE code waits for this to be cleared before proceeding.

Definition at line 905 of file dict0mem.h.

#define BG_STAT_SHOULD_QUIT (1 << 1)

BG_STAT_SHOULD_QUIT is set in stats_bg_flag when DROP TABLE starts waiting on BG_STAT_IN_PROGRESS to be cleared, the background stats thread will detect this and will eventually quit sooner

Definition at line 911 of file dict0mem.h.

#define DICT_ANTELOPE_MAX_INDEX_COL_LEN REC_ANTELOPE_MAX_INDEX_COL_LEN

DICT_ANTELOPE_MAX_INDEX_COL_LEN is measured in bytes and is the maximum indexed column length (or indexed prefix length) in ROW_FORMAT=REDUNDANT and ROW_FORMAT=COMPACT. Also, in any format, any fixed-length field that is longer than this will be encoded as a variable-length field.

It is set to 3*256, so that one can create a column prefix index on 256 characters of a TEXT or VARCHAR column also in the UTF-8 charset. In that charset, a character may take at most 3 bytes. This constant MUST NOT BE CHANGED, or the compatibility of InnoDB data files would be at risk!

Definition at line 446 of file dict0mem.h.

#define DICT_CLUSTERED 1

Type flags of an index: OR'ing of the flags is allowed to define a

combination of types clustered index

Definition at line 56 of file dict0mem.h.

#define DICT_CORRUPT 16

bit to store the corrupted flag in SYS_INDEXES.TYPE

Definition at line 61 of file dict0mem.h.

#define DICT_FK_MAX_RECURSIVE_LOAD 20

Tables could be chained together with Foreign key constraint. When

first load the parent table, we would load all of its descedents. This could result in rescursive calls and out of stack error eventually. DICT_FK_MAX_RECURSIVE_LOAD defines the maximum number of recursive loads, when exceeded, the child table will not be loaded. It will be loaded when the foreign constraint check needs to be run.

Definition at line 228 of file dict0mem.h.

#define DICT_FOREIGN_ON_DELETE_CASCADE 1

The flags for ON_UPDATE and ON_DELETE can be ORed; the default is that

a foreign key constraint is enforced, therefore RESTRICT just means no flag ON DELETE CASCADE

Definition at line 711 of file dict0mem.h.

#define DICT_FOREIGN_ON_DELETE_NO_ACTION 16

ON DELETE NO ACTION

Definition at line 715 of file dict0mem.h.

#define DICT_FOREIGN_ON_DELETE_SET_NULL 2

ON UPDATE SET NULL

Definition at line 712 of file dict0mem.h.

#define DICT_FOREIGN_ON_UPDATE_CASCADE 4

ON DELETE CASCADE

Definition at line 713 of file dict0mem.h.

#define DICT_FOREIGN_ON_UPDATE_NO_ACTION 32

ON UPDATE NO ACTION

Definition at line 716 of file dict0mem.h.

#define DICT_FOREIGN_ON_UPDATE_SET_NULL 8

ON UPDATE SET NULL

Definition at line 714 of file dict0mem.h.

#define DICT_FTS

Value:

32 /* FTS index; can't be combined with the

other flags */

Definition at line 63 of file dict0mem.h.

#define DICT_IBUF 8

insert buffer tree

Definition at line 60 of file dict0mem.h.

#define DICT_IT_BITS 6

number of bits used for SYS_INDEXES.TYPE

Definition at line 65 of file dict0mem.h.

#define DICT_MAX_FIELD_LEN_BY_FORMAT ( table )

Value:

((dict_table_get_format(table) < UNIV_FORMAT_B)         \
                        ? (REC_ANTELOPE_MAX_INDEX_COL_LEN - 1)          \
                        : REC_VERSION_56_MAX_INDEX_COL_LEN)

Find out maximum indexed column length by its table format.

For ROW_FORMAT=REDUNDANT and ROW_FORMAT=COMPACT, the maximum field length is REC_ANTELOPE_MAX_INDEX_COL_LEN - 1 (767). For Barracuda row formats COMPRESSED and DYNAMIC, the length could be REC_VERSION_56_MAX_INDEX_COL_LEN (3072) bytes

Definition at line 453 of file dict0mem.h.

#define DICT_MAX_FIELD_LEN_BY_FORMAT_FLAG ( flags )

Value:

((DICT_TF_HAS_ATOMIC_BLOBS(flags) < UNIV_FORMAT_B)      \
                        ? (REC_ANTELOPE_MAX_INDEX_COL_LEN - 1)          \
                        : REC_VERSION_56_MAX_INDEX_COL_LEN)

Definition at line 458 of file dict0mem.h.

#define DICT_MAX_FIXED_COL_LEN DICT_ANTELOPE_MAX_INDEX_COL_LEN

Defines the maximum fixed length column size

Definition at line 464 of file dict0mem.h.

#define DICT_N_COLS_COMPACT 0x80000000UL

This bitmask is used in SYS_TABLES.N_COLS to set and test whether

the Compact page format is used, i.e ROW_FORMAT != REDUNDANT

Definition at line 104 of file dict0mem.h.

#define DICT_TF2_BITS 6

Table Flags set number 2.

These flags will be stored in SYS_TABLES.MIX_LEN. All unused flags will be written as 0. The column may contain garbage for tables created with old versions of InnoDB that only implemented ROW_FORMAT=REDUNDANT. InnoDB engines do not check these flags for unknown bits in order to protect backward incompatibility. Total number of bits in table->flags2.

Definition at line 193 of file dict0mem.h.

#define DICT_TF2_DISCARDED 32

Set when we discard/detach the tablespace

Definition at line 210 of file dict0mem.h.

#define DICT_TF2_FTS 4

The table has an FTS index

Definition at line 201 of file dict0mem.h.

#define DICT_TF2_FTS_ADD_DOC_ID 8

Need to add Doc ID column for FTS index build.

This is a transient bit for index build

Definition at line 204 of file dict0mem.h.

#define DICT_TF2_FTS_HAS_DOC_ID 2

The table has an internal defined DOC ID column

Definition at line 199 of file dict0mem.h.

#define DICT_TF2_TEMPORARY 1

TEMPORARY; TRUE for tables from CREATE TEMPORARY TABLE.

Definition at line 197 of file dict0mem.h.

#define DICT_TF2_USE_TABLESPACE 16

This bit is used during table creation to indicate that it will

use its own tablespace instead of the system tablespace.

Definition at line 207 of file dict0mem.h.

#define DICT_TF_BIT_MASK (~(~0 << DICT_TF_BITS))

A mask of all the known/used bits in table flags

Definition at line 129 of file dict0mem.h.

#define DICT_TF_BITS

Value:

(DICT_TF_WIDTH_COMPACT          \
                        + DICT_TF_WIDTH_ZIP_SSIZE       \
                        + DICT_TF_WIDTH_ATOMIC_BLOBS    \
                        + DICT_TF_WIDTH_DATA_DIR)

Width of all the currently known table flags

Definition at line 123 of file dict0mem.h.

#define DICT_TF_COMPACT 1

dict_table_t::flags bit 0 is equal to 1 if the row format = Compact Compact row format.

Definition at line 100 of file dict0mem.h.

#define DICT_TF_GET_COMPACT ( flags )

Value:

((flags & DICT_TF_MASK_COMPACT) \

>> DICT_TF_POS_COMPACT)

Return the value of the COMPACT field

Definition at line 164 of file dict0mem.h.

#define DICT_TF_GET_UNUSED ( flags ) (flags >> DICT_TF_POS_UNUSED)

Return the contents of the UNUSED bits

Definition at line 180 of file dict0mem.h.

#define DICT_TF_GET_ZIP_SSIZE ( flags )

Value:

((flags & DICT_TF_MASK_ZIP_SSIZE) \

>> DICT_TF_POS_ZIP_SSIZE)

Return the value of the ZIP_SSIZE field

Definition at line 168 of file dict0mem.h.

#define DICT_TF_HAS_ATOMIC_BLOBS ( flags )

Value:

((flags & DICT_TF_MASK_ATOMIC_BLOBS) \

>> DICT_TF_POS_ATOMIC_BLOBS)

Return the value of the ATOMIC_BLOBS field

Definition at line 172 of file dict0mem.h.

#define DICT_TF_HAS_DATA_DIR ( flags )

Value:

((flags & DICT_TF_MASK_DATA_DIR) \

>> DICT_TF_POS_DATA_DIR)

Return the value of the ATOMIC_BLOBS field

Definition at line 176 of file dict0mem.h.

#define DICT_TF_MASK_ATOMIC_BLOBS

Value:

((~(~0 << DICT_TF_WIDTH_ATOMIC_BLOBS)) \

<< DICT_TF_POS_ATOMIC_BLOBS)

Bit mask of the ATOMIC_BLOBS field

Definition at line 155 of file dict0mem.h.

#define DICT_TF_MASK_COMPACT

Value:

((~(~0 << DICT_TF_WIDTH_COMPACT)) \

<< DICT_TF_POS_COMPACT)

Bit mask of the COMPACT field

Definition at line 147 of file dict0mem.h.

#define DICT_TF_MASK_DATA_DIR

Value:

((~(~0 << DICT_TF_WIDTH_DATA_DIR)) \

<< DICT_TF_POS_DATA_DIR)

Bit mask of the DATA_DIR field

Definition at line 159 of file dict0mem.h.

#define DICT_TF_MASK_ZIP_SSIZE

Value:

((~(~0 << DICT_TF_WIDTH_ZIP_SSIZE)) \

<< DICT_TF_POS_ZIP_SSIZE)

Bit mask of the ZIP_SSIZE field

Definition at line 151 of file dict0mem.h.

#define DICT_TF_POS_ATOMIC_BLOBS

Value:

(DICT_TF_POS_ZIP_SSIZE \

+ DICT_TF_WIDTH_ZIP_SSIZE)

Zero relative shift position of the ATOMIC_BLOBS field

Definition at line 137 of file dict0mem.h.

#define DICT_TF_POS_COMPACT 0

Zero relative shift position of the COMPACT field

Definition at line 132 of file dict0mem.h.

#define DICT_TF_POS_DATA_DIR

Value:

(DICT_TF_POS_ATOMIC_BLOBS \

+ DICT_TF_WIDTH_ATOMIC_BLOBS)

Zero relative shift position of the DATA_DIR field

Definition at line 140 of file dict0mem.h.

#define DICT_TF_POS_UNUSED

Value:

(DICT_TF_POS_DATA_DIR \

+ DICT_TF_WIDTH_DATA_DIR)

Zero relative shift position of the start of the UNUSED bits

Definition at line 143 of file dict0mem.h.

#define DICT_TF_POS_ZIP_SSIZE

Value:

(DICT_TF_POS_COMPACT \

+ DICT_TF_WIDTH_COMPACT)

Zero relative shift position of the ZIP_SSIZE field

Definition at line 134 of file dict0mem.h.

#define DICT_TF_REDUNDANT 0

dict_table_t::flags bit 0 is equal to 0 if the row format = Redundant Redundant row format.

Definition at line 98 of file dict0mem.h.

#define DICT_TF_WIDTH_ATOMIC_BLOBS 1

Width of the ATOMIC_BLOBS flag.  The Antelope file formats broke up

BLOB and TEXT fields, storing the first 768 bytes in the clustered index. Brracuda row formats store the whole blob or text field off-page atomically. Secondary indexes are created from this external data using row_ext_t to cache the BLOB prefixes.

Definition at line 115 of file dict0mem.h.

#define DICT_TF_WIDTH_COMPACT 1

Width of the COMPACT flag

Definition at line 107 of file dict0mem.h.

#define DICT_TF_WIDTH_DATA_DIR 1

If a table is created with the MYSQL option DATA DIRECTORY and

innodb-file-per-table, an older engine will not be able to find that table. This flag prevents older engines from attempting to open the table and allows InnoDB to update_create_info() accordingly.

Definition at line 120 of file dict0mem.h.

#define DICT_TF_WIDTH_ZIP_SSIZE 4

Width of the ZIP_SSIZE flag

Definition at line 109 of file dict0mem.h.

#define DICT_UNIQUE 2

unique index

Definition at line 57 of file dict0mem.h.

#define DICT_UNIVERSAL 4

index which can contain records from any other index

Definition at line 58 of file dict0mem.h.

#define FK_MAX_CASCADE_DEL 255

Similarly, when tables are chained together with foreign key constraints

with on cascading delete/update clause, delete from parent table could result in recursive cascading calls. This defines the maximum number of such cascading deletes/updates allowed. When exceeded, the delete from parent table will fail, and user has to drop excessive foreign constraint before proceeds.

Definition at line 236 of file dict0mem.h.

#define ZIP_PAD_INCR (128)

Amount by which padding is increased.

Definition at line 511 of file dict0mem.h.

#define ZIP_PAD_ROUND_LEN (128)

PADDING HEURISTIC BASED ON LINEAR INCREASE OF PADDING TO AVOID COMPRESSION FAILURES (Note: this is relevant only for compressed indexes) GOAL: Avoid compression failures by maintaining information about the compressibility of data. If data is not very compressible then leave some extra space 'padding' in the uncompressed page making it more likely that compression of less than fully packed uncompressed page will succeed.

This padding heuristic works by increasing the pad linearly until the desired failure rate is reached. A "round" is a fixed number of compression operations. After each round, the compression failure rate for that round is computed. If the failure rate is too high, then padding is incremented by a fixed value, otherwise it's left intact. If the compression failure is lower than the desired rate for a fixed number of consecutive rounds, then the padding is decreased by a fixed value. This is done to prevent overshooting the padding value, and to accommodate the possible change in data compressibility. Number of zip ops in one round.

Definition at line 505 of file dict0mem.h.

#define ZIP_PAD_SUCCESSFUL_ROUND_LIMIT (5)

Number of successful rounds after which the padding is decreased

Definition at line 508 of file dict0mem.h.

Enumeration Type Documentation

enum online_index_status

The status of online index creation

Enumerator:

ONLINE_INDEX_COMPLETE	the index is complete and ready for access
ONLINE_INDEX_CREATION	the index is being created, online (allowing concurrent modifications)
ONLINE_INDEX_ABORTED	secondary index creation was aborted and the index should be dropped as soon as index->table->n_ref_count reaches 0, or online table rebuild was aborted and the clustered index of the original table should soon be restored to ONLINE_INDEX_COMPLETE
ONLINE_INDEX_ABORTED_DROPPED	the online index creation was aborted, the index was dropped from the data dictionary and the tablespace, and it should be dropped from the data dictionary cache as soon as index->table->n_ref_count reaches 0.

Definition at line 646 of file dict0mem.h.

Function Documentation

UNIV_INTERN __attribute__ ( (nonnull, warn_unused_result) )

Create a temporary tablename.

Returns: temporary tablename suitable for InnoDB use

UNIV_INTERN void dict_mem_fill_column_struct	(	dict_col_t *	column,
		ulint	col_pos,
		ulint	mtype,
		ulint	prtype,
		ulint	col_len
	)

This function populates a dict_col_t memory structure with supplied information. in: column length

Parameters

column	out: column struct to be filled
col_pos	in: column position
mtype	in: main data type
prtype	in: precise type

Here is the caller graph for this function:

UNIV_INLINE void dict_mem_fill_index_struct	(	dict_index_t *	index,
		mem_heap_t *	heap,
		const char *	table_name,
		const char *	index_name,
		ulint	space,
		ulint	type,
		ulint	n_fields
	)

This function poplulates a dict_index_t index memory structure with supplied information. in: number of fields

Parameters

index	out: index to be filled
heap	in: memory heap
table_name	in: table name
index_name	in: index name
space	in: space where the index tree is placed, ignored if the index is of the clustered type
type	in: DICT_UNIQUE, DICT_CLUSTERED, ... ORed

Here is the caller graph for this function:

UNIV_INTERN dict_foreign_t* dict_mem_foreign_create ( void )

Creates and initializes a foreign constraint memory object.

Returns: own: foreign constraint struct

UNIV_INTERN void dict_mem_foreign_table_name_lookup_set	(	dict_foreign_t *	foreign,
		ibool	do_alloc
	)

Sets the foreign_table_name_lookup pointer based on the value of lower_case_table_names. If that is 0 or 1, foreign_table_name_lookup will point to foreign_table_name. If 2, then another string is allocated from the heap and set to lower case. in: is an alloc needed

Parameters

foreign in/out: foreign struct

Here is the caller graph for this function:

UNIV_INTERN void dict_mem_index_add_field	(	dict_index_t *	index,
		const char *	name,
		ulint	prefix_len
	)

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. in: 0 or the column prefix length in a MySQL index like INDEX (textcol(25))

Parameters

index	in: index
name	in: column name

Here is the caller graph for this function:

UNIV_INTERN dict_index_t* dict_mem_index_create	(	const char *	table_name,
		const char *	index_name,
		ulint	space,
		ulint	type,
		ulint	n_fields
	)

Creates an index memory object.

Returns: own: index object in: number of fields

Parameters

table_name	in: table name
index_name	in: index name
space	in: space where the index tree is placed, ignored if the index is of the clustered type
type	in: DICT_UNIQUE, DICT_CLUSTERED, ... ORed

Here is the caller graph for this function:

UNIV_INTERN void dict_mem_index_free ( dict_index_t * index )

Frees an index memory object. in: index

Here is the caller graph for this function:

UNIV_INTERN void dict_mem_referenced_table_name_lookup_set	(	dict_foreign_t *	foreign,
		ibool	do_alloc
	)

Sets the referenced_table_name_lookup pointer based on the value of lower_case_table_names. If that is 0 or 1, referenced_table_name_lookup will point to referenced_table_name. If 2, then another string is allocated from the heap and set to lower case. in: is an alloc needed

Parameters

foreign in/out: foreign struct

Here is the caller graph for this function:

UNIV_INTERN void dict_mem_table_add_col	(	dict_table_t *	table,
		mem_heap_t *	heap,
		const char *	name,
		ulint	mtype,
		ulint	prtype,
		ulint	len
	)

Adds a column definition to a table.

Parameters

table	in: table
heap	in: temporary memory heap, or NULL
name	in: column name, or NULL
mtype	in: main datatype
prtype	in: precise type
len	in: precision

Definition at line 206 of file dict0mem.cc.

Here is the call graph for this function:

Here is the caller graph for this function:

UNIV_INTERN void dict_mem_table_col_rename	(	dict_table_t *	table,
		unsigned	nth_col,
		const char *	from,
		const char *	to
	)

Renames a column of a table in the data dictionary cache.

Parameters

table	in/out: table
nth_col	in: column index
from	in: old column name
to	in: new column name

UNIV_INTERN dict_table_t* dict_mem_table_create	(	const char *	name,
		ulint	space,
		ulint	n_cols,
		ulint	flags,
		ulint	flags2
	)

Creates a table memory object.

Returns: own: table object in: table flags2

Creates a table memory object.

Returns: own: table object

Parameters

name	in: table name
space	in: space where the clustered index of the table is placed
n_cols	in: number of columns
flags	in: table flags
flags2	in: table flags2

Definition at line 61 of file dict0mem.cc.

Here is the call graph for this function:

Here is the caller graph for this function:

UNIV_INTERN void dict_mem_table_free ( dict_table_t * table )

Free a table memory object. in: table

Free a table memory object.

Parameters

table in: table

Definition at line 130 of file dict0mem.cc.

Here is the call graph for this function:

Here is the caller graph for this function:

Variable Documentation

UNIV_INTERN const char* dbtab

< in: memory heap in: database/table name

Definition at line 387 of file dict0mem.h.

UNIV_INTERN const char table_id_t id

in: InnoDB table id

Definition at line 387 of file dict0mem.h.

ulong zip_failure_threshold_pct

Percentage of compression failures that are allowed in a single

round

Definition at line 94 of file dict0dict.cc.

ulong zip_pad_max

Maximum percentage of a page that can be allowed as a pad to avoid

compression failures

Definition at line 98 of file dict0dict.cc.

Classes

Macros

Enumerations

Functions

Variables

Detailed Description

Macro Definition Documentation

Enumeration Type Documentation

Function Documentation

Variable Documentation