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 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311
|
/* Copyright (c) 2015, 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 */
#include "sql/default_values.h"
#include <assert.h>
#include <string.h>
#include <sys/types.h>
#include <algorithm>
#include "my_alloc.h"
#include "my_base.h"
#include "my_compare.h"
#include "my_macros.h"
#include "my_pointer_arithmetic.h"
#include "my_sys.h"
#include "mysql_com.h"
#include "mysqld_error.h"
#include "sql/create_field.h"
#include "sql/dd/properties.h" // dd::Properties
#include "sql/dd/string_type.h"
#include "sql/dd/types/column.h" // dd::Column
#include "sql/dd/types/table.h" // dd::Table
#include "sql/dd_table_share.h" // dd_get_old_field_type
#include "sql/field.h" // calc_pack_length
#include "sql/gis/srid.h"
#include "sql/handler.h" // handler
#include "sql/item.h" // Item
#include "sql/my_decimal.h" // DECIMAL_MAX_SCALE
#include "sql/sql_class.h" // THD
#include "sql/sql_list.h" // List
#include "sql/table.h"
/**
Calculate the length of the in-memory representation of the column from
its dd::Column object.
This function calculates the amount of memory necessary to store values
of the submitted column. The function is used when preparing the default
values for the columns of a table, and for determining the size of an
empty record for the table which the column is a part of.
@param col_obj The column object for which we calculate the
in-memory length.
@return In-memory length of values of the submitted column.
*/
static size_t column_pack_length(const dd::Column &col_obj) {
// Arrays always use JSON as storage
dd::enum_column_types col_type =
col_obj.is_array() ? dd::enum_column_types::JSON : col_obj.type();
bool treat_bit_as_char = false;
if (col_obj.type() == dd::enum_column_types::BIT) {
if (col_obj.options().get("treat_bit_as_char", &treat_bit_as_char))
assert(false); /* purecov: deadcode */
}
return calc_pack_length(col_type, col_obj.char_length(),
col_obj.elements_count(), treat_bit_as_char,
col_obj.numeric_scale(), col_obj.is_unsigned());
}
/**
Find the required length of an empty record.
This function iterates over the columns of the table, finds the required
number of null bits and leftover bits, and adds up the total length of an
empty record. Various length related fields in the table share parameter
are assigned.
@param table A single table, with column data members.
@param min_length The minimum length of a record.
@param [out] share Table share with various length fields assigned.
@retval true Failure.
@retval false Success.
*/
static bool find_record_length(const dd::Table &table, size_t min_length,
TABLE_SHARE *share) {
// Get the table property 'pack_record' and initialize out parameters.
bool pack_record;
if (table.options().get("pack_record", &pack_record)) return true;
assert(share);
share->fields = 0;
share->null_fields = 0;
share->reclength = 0;
ulong leftover_bits = pack_record ? 0 : 1;
// Loop over columns, count nullable and bit fields and find record length.
for (const dd::Column *col_obj : table.columns()) {
// Skip hidden columns
if (col_obj->is_se_hidden()) continue;
// Check if the field may be NULL.
if (col_obj->is_nullable()) share->null_fields++;
// Check if this is a BIT field with leftover bits in the preamble, and
// adjust record length accordingly.
if (col_obj->type() == dd::enum_column_types::BIT) {
bool treat_bit_as_char;
if (col_obj->options().get("treat_bit_as_char", &treat_bit_as_char))
return true;
if (!treat_bit_as_char && (col_obj->char_length() & 7))
leftover_bits += col_obj->char_length() & 7;
}
// Increment record length.
share->reclength += column_pack_length(*col_obj);
share->fields++;
}
// Find preamble length and add it to the total record length.
share->null_bytes = (share->null_fields + leftover_bits + 7) / 8;
share->last_null_bit_pos = (share->null_fields + leftover_bits) & 7;
share->reclength += share->null_bytes;
// Hack to avoid bugs with small static rows in MySQL.
share->reclength = std::max<size_t>(min_length, share->reclength);
share->stored_rec_length = share->reclength;
return false;
}
/**
Set the unused bits in the preamble of a default value buffer.
This function will set the unused bits, after the preamble bits and
up to the first byte border, to 1. It will also set the 'pack record'
bit (the first bit in the preamble).
The number of null bits here is assumed to include the number of bit field
bits that do not fit into a whole byte (i.e., number of bits modulo 8) for
storage engines that store bits like this in the preamble.
@param pack_record If the HA_OPTION_PACK_RECORD is set.
@param preamble_bits Number of null bits and leftover bits.
@param [in,out] default_values The default value buffer.
*/
static void set_pack_record_and_unused_preamble_bits(bool pack_record,
ulong preamble_bits,
uchar *default_values) {
assert(default_values);
// Set first bit if the HA_OPTION_PACK_RECORD is not set.
if (!pack_record) *default_values |= 1;
// We need to set the unused bits to 1. If the number of bits is a multiple
// of 8 there are no unused bits.
if (preamble_bits & 7)
*(default_values + preamble_bits / 8) |=
~(((uchar)1 << (preamble_bits & 7)) - 1);
}
size_t max_pack_length(const List<Create_field> &create_fields) {
size_t max_pack_length = 0;
// Iterate over the create fields and find the largest one.
for (const Create_field &field : create_fields) {
max_pack_length = std::max(field.pack_length(), max_pack_length);
}
return max_pack_length;
}
bool prepare_default_value(THD *thd, uchar *buf, TABLE *table,
const Create_field &field, dd::Column *col_obj) {
// Create a fake field with a real data buffer in which to store the value.
Field *regfield = make_field(field, table->s, buf + 1, buf, 0 /* null_bit */);
bool retval = true;
if (!regfield) goto err;
regfield->init(table);
// Set if the field may be NULL.
if (!(field.flags & NOT_NULL_FLAG)) regfield->set_null();
if (field.constant_default) {
// Pointless to store the value of a function as it may not be constant.
assert(field.constant_default->type() != Item::FUNC_ITEM);
type_conversion_status res =
field.constant_default->save_in_field(regfield, true);
if (res != TYPE_OK && res != TYPE_NOTE_TIME_TRUNCATED &&
res != TYPE_NOTE_TRUNCATED) {
// Clear current error and report ER_INVALID_DEFAULT.
if (thd->is_error()) thd->clear_error();
my_error(ER_INVALID_DEFAULT, MYF(0), regfield->field_name);
goto err;
}
if (res != TYPE_OK && thd->is_error()) {
// Conversion errors may be reported as errors or warnings depending on
// user-configurable settings.
goto err;
}
assert(!thd->is_error());
} else if (regfield->real_type() == MYSQL_TYPE_ENUM &&
(field.flags & NOT_NULL_FLAG)) {
regfield->set_notnull();
regfield->store((longlong)1, true);
} else
regfield->reset();
// Save whether column has only type's implicit default value.
// Note that in this case that we still store this default value
// in DD to preserve backward compatibility.
col_obj->set_has_no_default((field.flags & NO_DEFAULT_VALUE_FLAG));
// Save NULL flag, default value and leftover bits.
col_obj->set_default_value_null(regfield->is_null());
if (!col_obj->is_default_value_null()) {
dd::String_type default_value;
default_value.assign(reinterpret_cast<char *>(buf + 1),
field.pack_length());
// Append leftover bits as the last byte of the default value.
if (field.sql_type == MYSQL_TYPE_BIT && !field.treat_bit_as_char &&
(field.max_display_width_in_codepoints() & 7)) {
// Downcast and get bits.
Field_bit *bitfield = dynamic_cast<Field_bit *>(regfield);
// In get_rec_bits(), bitfield->bit_ptr[1] is accessed, so we must be
// sure that the buffer is at least two bytes long. This is ensured
// at the point where the buffer is allocated.
uchar default_preamble_bits =
get_rec_bits(bitfield->bit_ptr, bitfield->bit_ofs, bitfield->bit_len);
default_value.append(reinterpret_cast<char *>(&default_preamble_bits), 1);
}
col_obj->set_default_value(default_value);
}
retval = false;
err:
// Destroy the field, despite being MEM_ROOT allocated, to avoid memory
// leak for fields that allocate extra memory (e.g Field_blob::value).
destroy(regfield);
return retval;
}
bool prepare_default_value_buffer_and_table_share(THD *thd,
const dd::Table &table,
TABLE_SHARE *share) {
assert(share);
// Get the handler temporarily, needed to get minimal record length as
// well as extra record length.
handler *file = nullptr;
handlerton *engine = share->db_type();
if (!(file = get_new_handler(nullptr,
table.partition_type() != dd::Table::PT_NONE,
thd->mem_root, engine))) {
my_error(ER_OUTOFMEMORY, MYF(ME_FATALERROR),
static_cast<int>(sizeof(handler)));
return true;
}
// Get the minimal and extra record buffer lengths from the handler.
size_t extra_length = file->extra_rec_buf_length();
size_t min_length =
static_cast<size_t>(file->min_record_length(share->db_create_options));
destroy(file);
// Get the number of columns, record length etc.
if (find_record_length(table, min_length, share)) return true;
// Adjust buffer size and allocate the default value buffer.
share->rec_buff_length = ALIGN_SIZE(share->reclength + 1 + extra_length);
if (share->reclength) {
share->default_values = reinterpret_cast<uchar *>(
share->mem_root.Alloc(share->rec_buff_length));
if (!share->default_values) return true;
// Initialize the default value buffer. The default values for the
// columns are assigned when each individual column is initialized,
// in 'Table_share_utils::fill_column_from_dd()'.
memset(share->default_values, 0, share->reclength);
// Find the number of used bits in the preamble.
ulong preamble_bits = share->last_null_bit_pos;
if (share->null_bytes) preamble_bits += (share->null_bytes - 1) * 8;
set_pack_record_and_unused_preamble_bits(
(share->db_create_options & HA_OPTION_PACK_RECORD), preamble_bits,
share->default_values);
}
return false;
}
|