1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
/*****************************************************************************
Copyright (c) 1996, 2025, Oracle and/or its affiliates.
This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License, version 2.0, as published by the
Free Software Foundation.
This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.
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, version 2.0,
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.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*****************************************************************************/
/** @file include/dict0mem.ic
Data dictionary memory object creation
Created 1/8/1996 Heikki Tuuri
***********************************************************************/
#include "data0type.h"
#include "dict0mem.h"
#include "fil0fil.h"
/** This function poplulates a dict_index_t index memory structure with
supplied information. */
static inline void dict_mem_fill_index_struct(
dict_index_t *index, /*!< out: index to be filled */
mem_heap_t *heap, /*!< in: memory heap */
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 */
{
if (heap) {
index->heap = heap;
index->name = mem_heap_strdup(heap, index_name);
index->fields = (dict_field_t *)mem_heap_alloc(
heap, 1 + n_fields * sizeof(dict_field_t));
} else {
index->name = index_name;
index->heap = nullptr;
index->fields = nullptr;
}
/* Assign a ulint to a 4-bit-mapped field.
Only the low-order 4 bits are assigned. */
index->type = type;
#ifndef UNIV_HOTBACKUP
index->space = (unsigned int)space;
index->page = FIL_NULL;
index->merge_threshold = DICT_INDEX_MERGE_THRESHOLD_DEFAULT;
#endif /* !UNIV_HOTBACKUP */
index->table_name = table_name;
index->n_fields = (unsigned int)n_fields;
index->n_total_fields = (unsigned int)n_fields;
/* The '1 +' above prevents allocation
of an empty mem block */
index->allow_duplicates = false;
index->nulls_equal = false;
index->disable_ahi = false;
index->last_ins_cur = nullptr;
index->last_sel_cur = nullptr;
#ifndef UNIV_HOTBACKUP
new (&index->rec_cache) rec_cache_t();
#endif /* UNIV_HOTBACKUP */
#ifdef UNIV_DEBUG
index->magic_n = DICT_INDEX_MAGIC_N;
#endif /* UNIV_DEBUG */
}
/** Returns the number of fields before first instant ADD COLUMN. It includes
dropped fields also (if any) */
inline uint32_t dict_index_t::get_instant_fields() const {
ut_ad(has_instant_cols());
size_t n_inst_cols_v1 = table->get_n_instant_added_col_v1();
size_t n_drop_cols = table->get_n_instant_drop_cols();
size_t n_add_cols = table->get_n_instant_add_cols();
size_t n_instant_fields =
n_fields + n_drop_cols - n_add_cols - n_inst_cols_v1;
return n_instant_fields;
}
|
