mirror of
https://github.com/MariaDB/server.git
synced 2025-01-31 11:01:52 +01:00
74cc73d461
Changes that requires code changes in other code of other storage engines.
(Note that all changes are very straightforward and one should find all issues
by compiling a --debug build and fixing all compiler errors and all
asserts in field.cc while running the test suite),
- New optional handler function introduced: reset()
This is called after every DML statement to make it easy for a handler to
statement specific cleanups.
(The only case it's not called is if force the file to be closed)
- handler::extra(HA_EXTRA_RESET) is removed. Code that was there before
should be moved to handler::reset()
- table->read_set contains a bitmap over all columns that are needed
in the query. read_row() and similar functions only needs to read these
columns
- table->write_set contains a bitmap over all columns that will be updated
in the query. write_row() and update_row() only needs to update these
columns.
The above bitmaps should now be up to date in all context
(including ALTER TABLE, filesort()).
The handler is informed of any changes to the bitmap after
fix_fields() by calling the virtual function
handler::column_bitmaps_signal(). If the handler does caching of
these bitmaps (instead of using table->read_set, table->write_set),
it should redo the caching in this code. as the signal() may be sent
several times, it's probably best to set a variable in the signal
and redo the caching on read_row() / write_row() if the variable was
set.
- Removed the read_set and write_set bitmap objects from the handler class
- Removed all column bit handling functions from the handler class.
(Now one instead uses the normal bitmap functions in my_bitmap.c instead
of handler dedicated bitmap functions)
- field->query_id is removed. One should instead instead check
table->read_set and table->write_set if a field is used in the query.
- handler::extra(HA_EXTRA_RETRIVE_ALL_COLS) and
handler::extra(HA_EXTRA_RETRIEVE_PRIMARY_KEY) are removed. One should now
instead use table->read_set to check for which columns to retrieve.
- If a handler needs to call Field->val() or Field->store() on columns
that are not used in the query, one should install a temporary
all-columns-used map while doing so. For this, we provide the following
functions:
my_bitmap_map *old_map= dbug_tmp_use_all_columns(table, table->read_set);
field->val();
dbug_tmp_restore_column_map(table->read_set, old_map);
and similar for the write map:
my_bitmap_map *old_map= dbug_tmp_use_all_columns(table, table->write_set);
field->val();
dbug_tmp_restore_column_map(table->write_set, old_map);
If this is not done, you will sooner or later hit a DBUG_ASSERT
in the field store() / val() functions.
(For not DBUG binaries, the dbug_tmp_restore_column_map() and
dbug_tmp_restore_column_map() are inline dummy functions and should
be optimized away be the compiler).
- If one needs to temporary set the column map for all binaries (and not
just to avoid the DBUG_ASSERT() in the Field::store() / Field::val()
methods) one should use the functions tmp_use_all_columns() and
tmp_restore_column_map() instead of the above dbug_ variants.
- All 'status' fields in the handler base class (like records,
data_file_length etc) are now stored in a 'stats' struct. This makes
it easier to know what status variables are provided by the base
handler. This requires some trivial variable names in the extra()
function.
- New virtual function handler::records(). This is called to optimize
COUNT(*) if (handler::table_flags() & HA_HAS_RECORDS()) is true.
(stats.records is not supposed to be an exact value. It's only has to
be 'reasonable enough' for the optimizer to be able to choose a good
optimization path).
- Non virtual handler::init() function added for caching of virtual
constants from engine.
- Removed has_transactions() virtual method. Now one should instead return
HA_NO_TRANSACTIONS in table_flags() if the table handler DOES NOT support
transactions.
- The 'xxxx_create_handler()' function now has a MEM_ROOT_root argument
that is to be used with 'new handler_name()' to allocate the handler
in the right area. The xxxx_create_handler() function is also
responsible for any initialization of the object before returning.
For example, one should change:
static handler *myisam_create_handler(TABLE_SHARE *table)
{
return new ha_myisam(table);
}
->
static handler *myisam_create_handler(TABLE_SHARE *table, MEM_ROOT *mem_root)
{
return new (mem_root) ha_myisam(table);
}
- New optional virtual function: use_hidden_primary_key().
This is called in case of an update/delete when
(table_flags() and HA_PRIMARY_KEY_REQUIRED_FOR_DELETE) is defined
but we don't have a primary key. This allows the handler to take precisions
in remembering any hidden primary key to able to update/delete any
found row. The default handler marks all columns to be read.
- handler::table_flags() now returns a ulonglong (to allow for more flags).
- New/changed table_flags()
- HA_HAS_RECORDS Set if ::records() is supported
- HA_NO_TRANSACTIONS Set if engine doesn't support transactions
- HA_PRIMARY_KEY_REQUIRED_FOR_DELETE
Set if we should mark all primary key columns for
read when reading rows as part of a DELETE
statement. If there is no primary key,
all columns are marked for read.
- HA_PARTIAL_COLUMN_READ Set if engine will not read all columns in some
cases (based on table->read_set)
- HA_PRIMARY_KEY_ALLOW_RANDOM_ACCESS
Renamed to HA_PRIMARY_KEY_REQUIRED_FOR_POSITION.
- HA_DUPP_POS Renamed to HA_DUPLICATE_POS
- HA_REQUIRES_KEY_COLUMNS_FOR_DELETE
Set this if we should mark ALL key columns for
read when when reading rows as part of a DELETE
statement. In case of an update we will mark
all keys for read for which key part changed
value.
- HA_STATS_RECORDS_IS_EXACT
Set this if stats.records is exact.
(This saves us some extra records() calls
when optimizing COUNT(*))
- Removed table_flags()
- HA_NOT_EXACT_COUNT Now one should instead use HA_HAS_RECORDS if
handler::records() gives an exact count() and
HA_STATS_RECORDS_IS_EXACT if stats.records is exact.
- HA_READ_RND_SAME Removed (no one supported this one)
- Removed not needed functions ha_retrieve_all_cols() and ha_retrieve_all_pk()
- Renamed handler::dupp_pos to handler::dup_pos
- Removed not used variable handler::sortkey
Upper level handler changes:
- ha_reset() now does some overall checks and calls ::reset()
- ha_table_flags() added. This is a cached version of table_flags(). The
cache is updated on engine creation time and updated on open.
MySQL level changes (not obvious from the above):
- DBUG_ASSERT() added to check that column usage matches what is set
in the column usage bit maps. (This found a LOT of bugs in current
column marking code).
- In 5.1 before, all used columns was marked in read_set and only updated
columns was marked in write_set. Now we only mark columns for which we
need a value in read_set.
- Column bitmaps are created in open_binary_frm() and open_table_from_share().
(Before this was in table.cc)
- handler::table_flags() calls are replaced with handler::ha_table_flags()
- For calling field->val() you must have the corresponding bit set in
table->read_set. For calling field->store() you must have the
corresponding bit set in table->write_set. (There are asserts in
all store()/val() functions to catch wrong usage)
- thd->set_query_id is renamed to thd->mark_used_columns and instead
of setting this to an integer value, this has now the values:
MARK_COLUMNS_NONE, MARK_COLUMNS_READ, MARK_COLUMNS_WRITE
Changed also all variables named 'set_query_id' to mark_used_columns.
- In filesort() we now inform the handler of exactly which columns are needed
doing the sort and choosing the rows.
- The TABLE_SHARE object has a 'all_set' column bitmap one can use
when one needs a column bitmap with all columns set.
(This is used for table->use_all_columns() and other places)
- The TABLE object has 3 column bitmaps:
- def_read_set Default bitmap for columns to be read
- def_write_set Default bitmap for columns to be written
- tmp_set Can be used as a temporary bitmap when needed.
The table object has also two pointer to bitmaps read_set and write_set
that the handler should use to find out which columns are used in which way.
- count() optimization now calls handler::records() instead of using
handler->stats.records (if (table_flags() & HA_HAS_RECORDS) is true).
- Added extra argument to Item::walk() to indicate if we should also
traverse sub queries.
- Added TABLE parameter to cp_buffer_from_ref()
- Don't close tables created with CREATE ... SELECT but keep them in
the table cache. (Faster usage of newly created tables).
New interfaces:
- table->clear_column_bitmaps() to initialize the bitmaps for tables
at start of new statements.
- table->column_bitmaps_set() to set up new column bitmaps and signal
the handler about this.
- table->column_bitmaps_set_no_signal() for some few cases where we need
to setup new column bitmaps but don't signal the handler (as the handler
has already been signaled about these before). Used for the momement
only in opt_range.cc when doing ROR scans.
- table->use_all_columns() to install a bitmap where all columns are marked
as use in the read and the write set.
- table->default_column_bitmaps() to install the normal read and write
column bitmaps, but not signaling the handler about this.
This is mainly used when creating TABLE instances.
- table->mark_columns_needed_for_delete(),
table->mark_columns_needed_for_delete() and
table->mark_columns_needed_for_insert() to allow us to put additional
columns in column usage maps if handler so requires.
(The handler indicates what it neads in handler->table_flags())
- table->prepare_for_position() to allow us to tell handler that it
needs to read primary key parts to be able to store them in
future table->position() calls.
(This replaces the table->file->ha_retrieve_all_pk function)
- table->mark_auto_increment_column() to tell handler are going to update
columns part of any auto_increment key.
- table->mark_columns_used_by_index() to mark all columns that is part of
an index. It will also send extra(HA_EXTRA_KEYREAD) to handler to allow
it to quickly know that it only needs to read colums that are part
of the key. (The handler can also use the column map for detecting this,
but simpler/faster handler can just monitor the extra() call).
- table->mark_columns_used_by_index_no_reset() to in addition to other columns,
also mark all columns that is used by the given key.
- table->restore_column_maps_after_mark_index() to restore to default
column maps after a call to table->mark_columns_used_by_index().
- New item function register_field_in_read_map(), for marking used columns
in table->read_map. Used by filesort() to mark all used columns
- Maintain in TABLE->merge_keys set of all keys that are used in query.
(Simplices some optimization loops)
- Maintain Field->part_of_key_not_clustered which is like Field->part_of_key
but the field in the clustered key is not assumed to be part of all index.
(used in opt_range.cc for faster loops)
- dbug_tmp_use_all_columns(), dbug_tmp_restore_column_map()
tmp_use_all_columns() and tmp_restore_column_map() functions to temporally
mark all columns as usable. The 'dbug_' version is primarily intended
inside a handler when it wants to just call Field:store() & Field::val()
functions, but don't need the column maps set for any other usage.
(ie:: bitmap_is_set() is never called)
- We can't use compare_records() to skip updates for handlers that returns
a partial column set and the read_set doesn't cover all columns in the
write set. The reason for this is that if we have a column marked only for
write we can't in the MySQL level know if the value changed or not.
The reason this worked before was that MySQL marked all to be written
columns as also to be read. The new 'optimal' bitmaps exposed this 'hidden
bug'.
- open_table_from_share() does not anymore setup temporary MEM_ROOT
object as a thread specific variable for the handler. Instead we
send the to-be-used MEMROOT to get_new_handler().
(Simpler, faster code)
Bugs fixed:
- Column marking was not done correctly in a lot of cases.
(ALTER TABLE, when using triggers, auto_increment fields etc)
(Could potentially result in wrong values inserted in table handlers
relying on that the old column maps or field->set_query_id was correct)
Especially when it comes to triggers, there may be cases where the
old code would cause lost/wrong values for NDB and/or InnoDB tables.
- Split thd->options flag OPTION_STATUS_NO_TRANS_UPDATE to two flags:
OPTION_STATUS_NO_TRANS_UPDATE and OPTION_KEEP_LOG.
This allowed me to remove some wrong warnings about:
"Some non-transactional changed tables couldn't be rolled back"
- Fixed handling of INSERT .. SELECT and CREATE ... SELECT that wrongly reset
(thd->options & OPTION_STATUS_NO_TRANS_UPDATE) which caused us to loose
some warnings about
"Some non-transactional changed tables couldn't be rolled back")
- Fixed use of uninitialized memory in ha_ndbcluster.cc::delete_table()
which could cause delete_table to report random failures.
- Fixed core dumps for some tests when running with --debug
- Added missing FN_LIBCHAR in mysql_rm_tmp_tables()
(This has probably caused us to not properly remove temporary files after
crash)
- slow_logs was not properly initialized, which could maybe cause
extra/lost entries in slow log.
- If we get an duplicate row on insert, change column map to read and
write all columns while retrying the operation. This is required by
the definition of REPLACE and also ensures that fields that are only
part of UPDATE are properly handled. This fixed a bug in NDB and
REPLACE where REPLACE wrongly copied some column values from the replaced
row.
- For table handler that doesn't support NULL in keys, we would give an error
when creating a primary key with NULL fields, even after the fields has been
automaticly converted to NOT NULL.
- Creating a primary key on a SPATIAL key, would fail if field was not
declared as NOT NULL.
Cleanups:
- Removed not used condition argument to setup_tables
- Removed not needed item function reset_query_id_processor().
- Field->add_index is removed. Now this is instead maintained in
(field->flags & FIELD_IN_ADD_INDEX)
- Field->fieldnr is removed (use field->field_index instead)
- New argument to filesort() to indicate that it should return a set of
row pointers (not used columns). This allowed me to remove some references
to sql_command in filesort and should also enable us to return column
results in some cases where we couldn't before.
- Changed column bitmap handling in opt_range.cc to be aligned with TABLE
bitmap, which allowed me to use bitmap functions instead of looping over
all fields to create some needed bitmaps. (Faster and smaller code)
- Broke up found too long lines
- Moved some variable declaration at start of function for better code
readability.
- Removed some not used arguments from functions.
(setup_fields(), mysql_prepare_insert_check_table())
- setup_fields() now takes an enum instead of an int for marking columns
usage.
- For internal temporary tables, use handler::write_row(),
handler::delete_row() and handler::update_row() instead of
handler::ha_xxxx() for faster execution.
- Changed some constants to enum's and define's.
- Using separate column read and write sets allows for easier checking
of timestamp field was set by statement.
- Remove calls to free_io_cache() as this is now done automaticly in ha_reset()
- Don't build table->normalized_path as this is now identical to table->path
(after bar's fixes to convert filenames)
- Fixed some missed DBUG_PRINT(.."%lx") to use "0x%lx" to make it easier to
do comparision with the 'convert-dbug-for-diff' tool.
Things left to do in 5.1:
- We wrongly log failed CREATE TABLE ... SELECT in some cases when using
row based logging (as shown by testcase binlog_row_mix_innodb_myisam.result)
Mats has promised to look into this.
- Test that my fix for CREATE TABLE ... SELECT is indeed correct.
(I added several test cases for this, but in this case it's better that
someone else also tests this throughly).
Lars has promosed to do this.
1619 lines
49 KiB
C++
1619 lines
49 KiB
C++
/* Copyright (C) 2004 MySQL AB
|
|
|
|
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; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
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
|
|
*/
|
|
|
|
#define MYSQL_LEX 1
|
|
#include "mysql_priv.h"
|
|
#include "sql_select.h"
|
|
#include "parse_file.h"
|
|
#include "sp.h"
|
|
#include "sp_head.h"
|
|
#include "sp_cache.h"
|
|
|
|
#define MD5_BUFF_LENGTH 33
|
|
|
|
const LEX_STRING view_type= { (char*) STRING_WITH_LEN("VIEW") };
|
|
|
|
static int mysql_register_view(THD *thd, TABLE_LIST *view,
|
|
enum_view_create_mode mode);
|
|
|
|
const char *updatable_views_with_limit_names[]= { "NO", "YES", NullS };
|
|
TYPELIB updatable_views_with_limit_typelib=
|
|
{
|
|
array_elements(updatable_views_with_limit_names)-1, "",
|
|
updatable_views_with_limit_names,
|
|
0
|
|
};
|
|
|
|
|
|
/*
|
|
Make a unique name for an anonymous view column
|
|
SYNOPSIS
|
|
target reference to the item for which a new name has to be made
|
|
item_list list of items within which we should check uniqueness of
|
|
the created name
|
|
last_element the last element of the list above
|
|
|
|
NOTE
|
|
Unique names are generated by adding 'My_exp_' to the old name of the
|
|
column. In case the name that was created this way already exists, we
|
|
add a numeric postfix to its end (i.e. "1") and increase the number
|
|
until the name becomes unique. If the generated name is longer than
|
|
NAME_LEN, it is truncated.
|
|
*/
|
|
|
|
static void make_unique_view_field_name(Item *target,
|
|
List<Item> &item_list,
|
|
Item *last_element)
|
|
{
|
|
char *name= (target->orig_name ?
|
|
target->orig_name :
|
|
target->name);
|
|
uint name_len, attempt;
|
|
char buff[NAME_LEN+1];
|
|
List_iterator_fast<Item> itc(item_list);
|
|
|
|
for (attempt= 0;; attempt++)
|
|
{
|
|
Item *check;
|
|
bool ok= TRUE;
|
|
|
|
if (attempt)
|
|
name_len= my_snprintf(buff, NAME_LEN, "My_exp_%d_%s", attempt, name);
|
|
else
|
|
name_len= my_snprintf(buff, NAME_LEN, "My_exp_%s", name);
|
|
|
|
do
|
|
{
|
|
check= itc++;
|
|
if (check != target &&
|
|
my_strcasecmp(system_charset_info, buff, check->name) == 0)
|
|
{
|
|
ok= FALSE;
|
|
break;
|
|
}
|
|
} while (check != last_element);
|
|
if (ok)
|
|
break;
|
|
itc.rewind();
|
|
}
|
|
|
|
target->orig_name= target->name;
|
|
target->set_name(buff, name_len, system_charset_info);
|
|
}
|
|
|
|
|
|
/*
|
|
Check if items with same names are present in list and possibly
|
|
generate unique names for them.
|
|
|
|
SYNOPSIS
|
|
item_list list of Items which should be checked for duplicates
|
|
gen_unique_view_name flag: generate unique name or return with error when
|
|
duplicate names are found.
|
|
|
|
DESCRIPTION
|
|
This function is used on view creation and preparation of derived tables.
|
|
It checks item_list for items with duplicate names. If it founds two
|
|
items with same name and conversion to unique names isn't allowed, or
|
|
names for both items are set by user - function fails.
|
|
Otherwise it generates unique name for one item with autogenerated name
|
|
using make_unique_view_field_name()
|
|
|
|
RETURN VALUE
|
|
FALSE no duplicate names found, or they are converted to unique ones
|
|
TRUE duplicate names are found and they can't be converted or conversion
|
|
isn't allowed
|
|
*/
|
|
|
|
bool check_duplicate_names(List<Item> &item_list, bool gen_unique_view_name)
|
|
{
|
|
Item *item;
|
|
List_iterator_fast<Item> it(item_list);
|
|
List_iterator_fast<Item> itc(item_list);
|
|
DBUG_ENTER("check_duplicate_names");
|
|
|
|
while ((item= it++))
|
|
{
|
|
Item *check;
|
|
/* treat underlying fields like set by user names */
|
|
if (item->real_item()->type() == Item::FIELD_ITEM)
|
|
item->is_autogenerated_name= FALSE;
|
|
itc.rewind();
|
|
while ((check= itc++) && check != item)
|
|
{
|
|
if (my_strcasecmp(system_charset_info, item->name, check->name) == 0)
|
|
{
|
|
if (!gen_unique_view_name)
|
|
goto err;
|
|
if (item->is_autogenerated_name)
|
|
make_unique_view_field_name(item, item_list, item);
|
|
else if (check->is_autogenerated_name)
|
|
make_unique_view_field_name(check, item_list, item);
|
|
else
|
|
goto err;
|
|
}
|
|
}
|
|
}
|
|
DBUG_RETURN(FALSE);
|
|
|
|
err:
|
|
my_error(ER_DUP_FIELDNAME, MYF(0), item->name);
|
|
DBUG_RETURN(TRUE);
|
|
}
|
|
|
|
|
|
/*
|
|
Creating/altering VIEW procedure
|
|
|
|
SYNOPSIS
|
|
mysql_create_view()
|
|
thd - thread handler
|
|
mode - VIEW_CREATE_NEW, VIEW_ALTER, VIEW_CREATE_OR_REPLACE
|
|
|
|
RETURN VALUE
|
|
FALSE OK
|
|
TRUE Error
|
|
*/
|
|
|
|
bool mysql_create_view(THD *thd,
|
|
enum_view_create_mode mode)
|
|
{
|
|
LEX *lex= thd->lex;
|
|
bool link_to_local;
|
|
/* first table in list is target VIEW name => cut off it */
|
|
TABLE_LIST *view= lex->unlink_first_table(&link_to_local);
|
|
TABLE_LIST *tables= lex->query_tables;
|
|
TABLE_LIST *tbl;
|
|
SELECT_LEX *select_lex= &lex->select_lex;
|
|
#ifndef NO_EMBEDDED_ACCESS_CHECKS
|
|
SELECT_LEX *sl;
|
|
#endif
|
|
SELECT_LEX_UNIT *unit= &lex->unit;
|
|
bool res= FALSE;
|
|
DBUG_ENTER("mysql_create_view");
|
|
|
|
if (lex->proc_list.first ||
|
|
lex->result)
|
|
{
|
|
my_error(ER_VIEW_SELECT_CLAUSE, MYF(0), (lex->result ?
|
|
"INTO" :
|
|
"PROCEDURE"));
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
if (lex->derived_tables ||
|
|
lex->variables_used || lex->param_list.elements)
|
|
{
|
|
int err= (lex->derived_tables ?
|
|
ER_VIEW_SELECT_DERIVED :
|
|
ER_VIEW_SELECT_VARIABLE);
|
|
my_message(err, ER(err), MYF(0));
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
|
|
if (mode != VIEW_CREATE_NEW)
|
|
sp_cache_invalidate();
|
|
|
|
if (!lex->definer)
|
|
{
|
|
/*
|
|
DEFINER-clause is missing; we have to create default definer in
|
|
persistent arena to be PS/SP friendly.
|
|
*/
|
|
|
|
Query_arena original_arena;
|
|
Query_arena *ps_arena = thd->activate_stmt_arena_if_needed(&original_arena);
|
|
|
|
if (!(lex->definer= create_default_definer(thd)))
|
|
res= TRUE;
|
|
|
|
if (ps_arena)
|
|
thd->restore_active_arena(ps_arena, &original_arena);
|
|
|
|
if (res)
|
|
goto err;
|
|
}
|
|
|
|
#ifndef NO_EMBEDDED_ACCESS_CHECKS
|
|
/*
|
|
check definer of view:
|
|
- same as current user
|
|
- current user has SUPER_ACL
|
|
*/
|
|
if (strcmp(lex->definer->user.str,
|
|
thd->security_ctx->priv_user) != 0 ||
|
|
my_strcasecmp(system_charset_info,
|
|
lex->definer->host.str,
|
|
thd->security_ctx->priv_host) != 0)
|
|
{
|
|
if (!(thd->security_ctx->master_access & SUPER_ACL))
|
|
{
|
|
my_error(ER_SPECIFIC_ACCESS_DENIED_ERROR, MYF(0), "SUPER");
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
else
|
|
{
|
|
if (!is_acl_user(lex->definer->host.str,
|
|
lex->definer->user.str))
|
|
{
|
|
push_warning_printf(thd, MYSQL_ERROR::WARN_LEVEL_NOTE,
|
|
ER_NO_SUCH_USER,
|
|
ER(ER_NO_SUCH_USER),
|
|
lex->definer->user.str,
|
|
lex->definer->host.str);
|
|
}
|
|
}
|
|
}
|
|
/*
|
|
Privilege check for view creation:
|
|
- user has CREATE VIEW privilege on view table
|
|
- user has DROP privilege in case of ALTER VIEW or CREATE OR REPLACE
|
|
VIEW
|
|
- user has some (SELECT/UPDATE/INSERT/DELETE) privileges on columns of
|
|
underlying tables used on top of SELECT list (because it can be
|
|
(theoretically) updated, so it is enough to have UPDATE privilege on
|
|
them, for example)
|
|
- user has SELECT privilege on columns used in expressions of VIEW select
|
|
- for columns of underly tables used on top of SELECT list also will be
|
|
checked that we have not more privileges on correspondent column of view
|
|
table (i.e. user will not get some privileges by view creation)
|
|
*/
|
|
if ((check_access(thd, CREATE_VIEW_ACL, view->db, &view->grant.privilege,
|
|
0, 0, is_schema_db(view->db)) ||
|
|
grant_option && check_grant(thd, CREATE_VIEW_ACL, view, 0, 1, 0)) ||
|
|
(mode != VIEW_CREATE_NEW &&
|
|
(check_access(thd, DROP_ACL, view->db, &view->grant.privilege,
|
|
0, 0, is_schema_db(view->db)) ||
|
|
grant_option && check_grant(thd, DROP_ACL, view, 0, 1, 0))))
|
|
{
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
for (sl= select_lex; sl; sl= sl->next_select())
|
|
{
|
|
for (tbl= sl->get_table_list(); tbl; tbl= tbl->next_local)
|
|
{
|
|
/*
|
|
Ensure that we have some privileges on this table, more strict check
|
|
will be done on column level after preparation,
|
|
*/
|
|
if (check_some_access(thd, VIEW_ANY_ACL, tbl))
|
|
{
|
|
my_error(ER_TABLEACCESS_DENIED_ERROR, MYF(0),
|
|
"ANY", thd->security_ctx->priv_user,
|
|
thd->security_ctx->priv_host, tbl->table_name);
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
/*
|
|
Mark this table as a table which will be checked after the prepare
|
|
phase
|
|
*/
|
|
tbl->table_in_first_from_clause= 1;
|
|
|
|
/*
|
|
We need to check only SELECT_ACL for all normal fields, fields for
|
|
which we need "any" (SELECT/UPDATE/INSERT/DELETE) privilege will be
|
|
checked later
|
|
*/
|
|
tbl->grant.want_privilege= SELECT_ACL;
|
|
/*
|
|
Make sure that all rights are loaded to the TABLE::grant field.
|
|
|
|
tbl->table_name will be correct name of table because VIEWs are
|
|
not opened yet.
|
|
*/
|
|
fill_effective_table_privileges(thd, &tbl->grant, tbl->db,
|
|
tbl->table_name);
|
|
}
|
|
}
|
|
|
|
if (&lex->select_lex != lex->all_selects_list)
|
|
{
|
|
/* check tables of subqueries */
|
|
for (tbl= tables; tbl; tbl= tbl->next_global)
|
|
{
|
|
if (!tbl->table_in_first_from_clause)
|
|
{
|
|
if (check_access(thd, SELECT_ACL, tbl->db,
|
|
&tbl->grant.privilege, 0, 0, test(tbl->schema_table)) ||
|
|
grant_option && check_grant(thd, SELECT_ACL, tbl, 0, 1, 0))
|
|
{
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
/*
|
|
Mark fields for special privilege check ("any" privilege)
|
|
*/
|
|
for (sl= select_lex; sl; sl= sl->next_select())
|
|
{
|
|
List_iterator_fast<Item> it(sl->item_list);
|
|
Item *item;
|
|
while ((item= it++))
|
|
{
|
|
Item_field *field;
|
|
if ((field= item->filed_for_view_update()))
|
|
field->any_privileges= 1;
|
|
}
|
|
}
|
|
#endif
|
|
|
|
if (open_and_lock_tables(thd, tables))
|
|
{
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
|
|
/*
|
|
check that tables are not temporary and this VIEW do not used in query
|
|
(it is possible with ALTERing VIEW).
|
|
open_and_lock_tables can change the value of tables,
|
|
e.g. it may happen if before the function call tables was equal to 0.
|
|
*/
|
|
for (tbl= lex->query_tables; tbl; tbl= tbl->next_global)
|
|
{
|
|
/* is this table view and the same view which we creates now? */
|
|
if (tbl->view &&
|
|
strcmp(tbl->view_db.str, view->db) == 0 &&
|
|
strcmp(tbl->view_name.str, view->table_name) == 0)
|
|
{
|
|
my_error(ER_NO_SUCH_TABLE, MYF(0), tbl->view_db.str, tbl->view_name.str);
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
|
|
/*
|
|
tbl->table can be NULL when tbl is a placeholder for a view
|
|
that is indirectly referenced via a stored function from the
|
|
view being created. We don't check these indirectly
|
|
referenced views in CREATE VIEW so they don't have table
|
|
object.
|
|
*/
|
|
if (tbl->table)
|
|
{
|
|
/* is this table temporary and is not view? */
|
|
if (tbl->table->s->tmp_table != NO_TMP_TABLE && !tbl->view &&
|
|
!tbl->schema_table)
|
|
{
|
|
my_error(ER_VIEW_SELECT_TMPTABLE, MYF(0), tbl->alias);
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
/*
|
|
Copy the privileges of the underlying VIEWs which were filled by
|
|
fill_effective_table_privileges
|
|
(they were not copied at derived tables processing)
|
|
*/
|
|
tbl->table->grant.privilege= tbl->grant.privilege;
|
|
}
|
|
}
|
|
|
|
/* prepare select to resolve all fields */
|
|
lex->view_prepare_mode= 1;
|
|
if (unit->prepare(thd, 0, 0))
|
|
{
|
|
/*
|
|
some errors from prepare are reported to user, if is not then
|
|
it will be checked after err: label
|
|
*/
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
|
|
/* view list (list of view fields names) */
|
|
if (lex->view_list.elements)
|
|
{
|
|
List_iterator_fast<Item> it(select_lex->item_list);
|
|
List_iterator_fast<LEX_STRING> nm(lex->view_list);
|
|
Item *item;
|
|
LEX_STRING *name;
|
|
|
|
if (lex->view_list.elements != select_lex->item_list.elements)
|
|
{
|
|
my_message(ER_VIEW_WRONG_LIST, ER(ER_VIEW_WRONG_LIST), MYF(0));
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
while ((item= it++, name= nm++))
|
|
{
|
|
item->set_name(name->str, name->length, system_charset_info);
|
|
item->is_autogenerated_name= FALSE;
|
|
}
|
|
}
|
|
|
|
if (check_duplicate_names(select_lex->item_list, 1))
|
|
{
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
|
|
#ifndef NO_EMBEDDED_ACCESS_CHECKS
|
|
/*
|
|
Compare/check grants on view with grants of underlying tables
|
|
*/
|
|
for (sl= select_lex; sl; sl= sl->next_select())
|
|
{
|
|
char *db= view->db ? view->db : thd->db;
|
|
List_iterator_fast<Item> it(sl->item_list);
|
|
Item *item;
|
|
fill_effective_table_privileges(thd, &view->grant, db,
|
|
view->table_name);
|
|
while ((item= it++))
|
|
{
|
|
Item_field *fld;
|
|
uint priv= (get_column_grant(thd, &view->grant, db,
|
|
view->table_name, item->name) &
|
|
VIEW_ANY_ACL);
|
|
if ((fld= item->filed_for_view_update()))
|
|
{
|
|
/*
|
|
Do we have more privileges on view field then underlying table field?
|
|
*/
|
|
if (!fld->field->table->s->tmp_table && (~fld->have_privileges & priv))
|
|
{
|
|
/* VIEW column has more privileges */
|
|
my_error(ER_COLUMNACCESS_DENIED_ERROR, MYF(0),
|
|
"create view", thd->security_ctx->priv_user,
|
|
thd->security_ctx->priv_host, item->name,
|
|
view->table_name);
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
#endif
|
|
|
|
if (wait_if_global_read_lock(thd, 0, 0))
|
|
{
|
|
res= TRUE;
|
|
goto err;
|
|
}
|
|
VOID(pthread_mutex_lock(&LOCK_open));
|
|
res= mysql_register_view(thd, view, mode);
|
|
VOID(pthread_mutex_unlock(&LOCK_open));
|
|
if (view->revision != 1)
|
|
query_cache_invalidate3(thd, view, 0);
|
|
start_waiting_global_read_lock(thd);
|
|
if (res)
|
|
goto err;
|
|
|
|
send_ok(thd);
|
|
lex->link_first_table_back(view, link_to_local);
|
|
DBUG_RETURN(0);
|
|
|
|
err:
|
|
thd->proc_info= "end";
|
|
lex->link_first_table_back(view, link_to_local);
|
|
unit->cleanup();
|
|
DBUG_RETURN(res || thd->net.report_error);
|
|
}
|
|
|
|
|
|
/* index of revision number in following table */
|
|
static const int revision_number_position= 8;
|
|
/* index of last required parameter for making view */
|
|
static const int required_view_parameters= 10;
|
|
/* number of backups */
|
|
static const int num_view_backups= 3;
|
|
|
|
/*
|
|
table of VIEW .frm field descriptors
|
|
|
|
Note that one should NOT change the order for this, as it's used by
|
|
parse()
|
|
*/
|
|
static File_option view_parameters[]=
|
|
{{{(char*) STRING_WITH_LEN("query")},
|
|
offsetof(TABLE_LIST, query),
|
|
FILE_OPTIONS_ESTRING},
|
|
{{(char*) STRING_WITH_LEN("md5")},
|
|
offsetof(TABLE_LIST, md5),
|
|
FILE_OPTIONS_STRING},
|
|
{{(char*) STRING_WITH_LEN("updatable")},
|
|
offsetof(TABLE_LIST, updatable_view),
|
|
FILE_OPTIONS_ULONGLONG},
|
|
{{(char*) STRING_WITH_LEN("algorithm")},
|
|
offsetof(TABLE_LIST, algorithm),
|
|
FILE_OPTIONS_ULONGLONG},
|
|
{{(char*) STRING_WITH_LEN("definer_user")},
|
|
offsetof(TABLE_LIST, definer.user),
|
|
FILE_OPTIONS_STRING},
|
|
{{(char*) STRING_WITH_LEN("definer_host")},
|
|
offsetof(TABLE_LIST, definer.host),
|
|
FILE_OPTIONS_STRING},
|
|
{{(char*) STRING_WITH_LEN("suid")},
|
|
offsetof(TABLE_LIST, view_suid),
|
|
FILE_OPTIONS_ULONGLONG},
|
|
{{(char*) STRING_WITH_LEN("with_check_option")},
|
|
offsetof(TABLE_LIST, with_check),
|
|
FILE_OPTIONS_ULONGLONG},
|
|
{{(char*) STRING_WITH_LEN("revision")},
|
|
offsetof(TABLE_LIST, revision),
|
|
FILE_OPTIONS_REV},
|
|
{{(char*) STRING_WITH_LEN("timestamp")},
|
|
offsetof(TABLE_LIST, timestamp),
|
|
FILE_OPTIONS_TIMESTAMP},
|
|
{{(char*)STRING_WITH_LEN("create-version")},
|
|
offsetof(TABLE_LIST, file_version),
|
|
FILE_OPTIONS_ULONGLONG},
|
|
{{(char*) STRING_WITH_LEN("source")},
|
|
offsetof(TABLE_LIST, source),
|
|
FILE_OPTIONS_ESTRING},
|
|
{{NullS, 0}, 0,
|
|
FILE_OPTIONS_STRING}
|
|
};
|
|
|
|
static LEX_STRING view_file_type[]= {{(char*) STRING_WITH_LEN("VIEW") }};
|
|
|
|
|
|
/*
|
|
Register VIEW (write .frm & process .frm's history backups)
|
|
|
|
SYNOPSIS
|
|
mysql_register_view()
|
|
thd - thread handler
|
|
view - view description
|
|
mode - VIEW_CREATE_NEW, VIEW_ALTER, VIEW_CREATE_OR_REPLACE
|
|
|
|
RETURN
|
|
0 OK
|
|
-1 Error
|
|
1 Error and error message given
|
|
*/
|
|
|
|
static int mysql_register_view(THD *thd, TABLE_LIST *view,
|
|
enum_view_create_mode mode)
|
|
{
|
|
LEX *lex= thd->lex;
|
|
char buff[4096];
|
|
String str(buff,(uint32) sizeof(buff), system_charset_info);
|
|
char md5[MD5_BUFF_LENGTH];
|
|
bool can_be_merged;
|
|
char dir_buff[FN_REFLEN], file_buff[FN_REFLEN], path_buff[FN_REFLEN];
|
|
LEX_STRING dir, file, path;
|
|
DBUG_ENTER("mysql_register_view");
|
|
|
|
/* print query */
|
|
str.length(0);
|
|
{
|
|
ulong sql_mode= thd->variables.sql_mode & MODE_ANSI_QUOTES;
|
|
thd->variables.sql_mode&= ~MODE_ANSI_QUOTES;
|
|
lex->unit.print(&str);
|
|
thd->variables.sql_mode|= sql_mode;
|
|
}
|
|
str.append('\0');
|
|
DBUG_PRINT("info", ("View: %s", str.ptr()));
|
|
|
|
/* print file name */
|
|
dir.length= build_table_filename(dir_buff, sizeof(dir_buff),
|
|
view->db, "", "");
|
|
dir.str= dir_buff;
|
|
|
|
path.length= build_table_filename(path_buff, sizeof(path_buff),
|
|
view->db, view->table_name, reg_ext);
|
|
path.str= path_buff;
|
|
|
|
file.str= path.str + dir.length;
|
|
file.length= path.length - dir.length;
|
|
|
|
/* init timestamp */
|
|
if (!view->timestamp.str)
|
|
view->timestamp.str= view->timestamp_buffer;
|
|
|
|
/* check old .frm */
|
|
{
|
|
char path_buff[FN_REFLEN];
|
|
LEX_STRING path;
|
|
File_parser *parser;
|
|
|
|
path.str= path_buff;
|
|
fn_format(path_buff, file.str, dir.str, 0, MY_UNPACK_FILENAME);
|
|
path.length= strlen(path_buff);
|
|
|
|
if (!access(path.str, F_OK))
|
|
{
|
|
if (mode == VIEW_CREATE_NEW)
|
|
{
|
|
my_error(ER_TABLE_EXISTS_ERROR, MYF(0), view->alias);
|
|
DBUG_RETURN(-1);
|
|
}
|
|
|
|
if (!(parser= sql_parse_prepare(&path, thd->mem_root, 0)))
|
|
DBUG_RETURN(1);
|
|
|
|
if (!parser->ok() || !is_equal(&view_type, parser->type()))
|
|
{
|
|
my_error(ER_WRONG_OBJECT, MYF(0),
|
|
(view->db ? view->db : thd->db), view->table_name, "VIEW");
|
|
DBUG_RETURN(-1);
|
|
}
|
|
|
|
/*
|
|
read revision number
|
|
|
|
TODO: read dependence list, too, to process cascade/restrict
|
|
TODO: special cascade/restrict procedure for alter?
|
|
*/
|
|
if (parser->parse((gptr)view, thd->mem_root,
|
|
view_parameters + revision_number_position, 1,
|
|
&file_parser_dummy_hook))
|
|
{
|
|
DBUG_RETURN(thd->net.report_error? -1 : 0);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (mode == VIEW_ALTER)
|
|
{
|
|
my_error(ER_NO_SUCH_TABLE, MYF(0), view->db, view->alias);
|
|
DBUG_RETURN(-1);
|
|
}
|
|
}
|
|
}
|
|
/* fill structure */
|
|
view->query.str= (char*)str.ptr();
|
|
view->query.length= str.length()-1; // we do not need last \0
|
|
view->source.str= thd->query + thd->lex->create_view_select_start;
|
|
view->source.length= (thd->query_length -
|
|
thd->lex->create_view_select_start);
|
|
view->file_version= 1;
|
|
view->calc_md5(md5);
|
|
view->md5.str= md5;
|
|
view->md5.length= 32;
|
|
can_be_merged= lex->can_be_merged();
|
|
if (lex->create_view_algorithm == VIEW_ALGORITHM_MERGE &&
|
|
!lex->can_be_merged())
|
|
{
|
|
push_warning(thd, MYSQL_ERROR::WARN_LEVEL_WARN, ER_WARN_VIEW_MERGE,
|
|
ER(ER_WARN_VIEW_MERGE));
|
|
lex->create_view_algorithm= VIEW_ALGORITHM_UNDEFINED;
|
|
}
|
|
view->algorithm= lex->create_view_algorithm;
|
|
view->definer.user= lex->definer->user;
|
|
view->definer.host= lex->definer->host;
|
|
view->view_suid= lex->create_view_suid;
|
|
view->with_check= lex->create_view_check;
|
|
if ((view->updatable_view= (can_be_merged &&
|
|
view->algorithm != VIEW_ALGORITHM_TMPTABLE)))
|
|
{
|
|
/* TODO: change here when we will support UNIONs */
|
|
for (TABLE_LIST *tbl= (TABLE_LIST *)lex->select_lex.table_list.first;
|
|
tbl;
|
|
tbl= tbl->next_local)
|
|
{
|
|
if ((tbl->view && !tbl->updatable_view) || tbl->schema_table)
|
|
{
|
|
view->updatable_view= 0;
|
|
break;
|
|
}
|
|
for (TABLE_LIST *up= tbl; up; up= up->embedding)
|
|
{
|
|
if (up->outer_join)
|
|
{
|
|
view->updatable_view= 0;
|
|
goto loop_out;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
loop_out:
|
|
/*
|
|
Check that table of main select do not used in subqueries.
|
|
|
|
This test can catch only very simple cases of such non-updateable views,
|
|
all other will be detected before updating commands execution.
|
|
(it is more optimisation then real check)
|
|
|
|
NOTE: this skip cases of using table via VIEWs, joined VIEWs, VIEWs with
|
|
UNION
|
|
*/
|
|
if (view->updatable_view &&
|
|
!lex->select_lex.next_select() &&
|
|
!((TABLE_LIST*)lex->select_lex.table_list.first)->next_local &&
|
|
find_table_in_global_list(lex->query_tables->next_global,
|
|
lex->query_tables->db,
|
|
lex->query_tables->table_name))
|
|
{
|
|
view->updatable_view= 0;
|
|
}
|
|
|
|
if (view->with_check != VIEW_CHECK_NONE &&
|
|
!view->updatable_view)
|
|
{
|
|
my_error(ER_VIEW_NONUPD_CHECK, MYF(0), view->db, view->table_name);
|
|
DBUG_RETURN(-1);
|
|
}
|
|
|
|
if (sql_create_definition_file(&dir, &file, view_file_type,
|
|
(gptr)view, view_parameters, num_view_backups))
|
|
{
|
|
DBUG_RETURN(thd->net.report_error? -1 : 1);
|
|
}
|
|
DBUG_RETURN(0);
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
read VIEW .frm and create structures
|
|
|
|
SYNOPSIS
|
|
mysql_make_view()
|
|
thd Thread handler
|
|
parser parser object
|
|
table TABLE_LIST structure for filling
|
|
|
|
RETURN
|
|
0 ok
|
|
1 error
|
|
*/
|
|
|
|
bool mysql_make_view(THD *thd, File_parser *parser, TABLE_LIST *table)
|
|
{
|
|
SELECT_LEX *end, *view_select;
|
|
LEX *old_lex, *lex;
|
|
Query_arena *arena, backup;
|
|
TABLE_LIST *top_view= table->top_table();
|
|
int res;
|
|
bool result;
|
|
DBUG_ENTER("mysql_make_view");
|
|
DBUG_PRINT("info", ("table: 0x%lx (%s)", (ulong) table, table->table_name));
|
|
|
|
if (table->view)
|
|
{
|
|
/*
|
|
It's an execution of a PS/SP and the view has already been unfolded
|
|
into a list of used tables. Now we only need to update the information
|
|
about granted privileges in the view tables with the actual data
|
|
stored in MySQL privilege system. We don't need to restore the
|
|
required privileges (by calling register_want_access) because they has
|
|
not changed since PREPARE or the previous execution: the only case
|
|
when this information is changed is execution of UPDATE on a view, but
|
|
the original want_access is restored in its end.
|
|
*/
|
|
if (!table->prelocking_placeholder && table->prepare_security(thd))
|
|
{
|
|
DBUG_RETURN(1);
|
|
}
|
|
DBUG_PRINT("info",
|
|
("VIEW %s.%s is already processed on previous PS/SP execution",
|
|
table->view_db.str, table->view_name.str));
|
|
DBUG_RETURN(0);
|
|
}
|
|
|
|
/* check loop via view definition */
|
|
for (TABLE_LIST *precedent= table->referencing_view;
|
|
precedent;
|
|
precedent= precedent->referencing_view)
|
|
{
|
|
if (precedent->view_name.length == table->table_name_length &&
|
|
precedent->view_db.length == table->db_length &&
|
|
my_strcasecmp(system_charset_info,
|
|
precedent->view_name.str, table->table_name) == 0 &&
|
|
my_strcasecmp(system_charset_info,
|
|
precedent->view_db.str, table->db) == 0)
|
|
{
|
|
my_error(ER_VIEW_RECURSIVE, MYF(0),
|
|
top_view->view_db.str, top_view->view_name.str);
|
|
DBUG_RETURN(TRUE);
|
|
}
|
|
}
|
|
|
|
/*
|
|
For now we assume that tables will not be changed during PS life (it
|
|
will be TRUE as far as we make new table cache).
|
|
*/
|
|
old_lex= thd->lex;
|
|
arena= thd->stmt_arena;
|
|
if (arena->is_conventional())
|
|
arena= 0;
|
|
else
|
|
thd->set_n_backup_active_arena(arena, &backup);
|
|
|
|
/* init timestamp */
|
|
if (!table->timestamp.str)
|
|
table->timestamp.str= table->timestamp_buffer;
|
|
/* prepare default values for old format */
|
|
table->view_suid= TRUE;
|
|
table->definer.user.str= table->definer.host.str= 0;
|
|
table->definer.user.length= table->definer.host.length= 0;
|
|
|
|
/*
|
|
TODO: when VIEWs will be stored in cache, table mem_root should
|
|
be used here
|
|
*/
|
|
if (parser->parse((gptr)table, thd->mem_root, view_parameters,
|
|
required_view_parameters, &file_parser_dummy_hook))
|
|
goto err;
|
|
|
|
/*
|
|
check old format view .frm
|
|
*/
|
|
if (!table->definer.user.str)
|
|
{
|
|
DBUG_ASSERT(!table->definer.host.str &&
|
|
!table->definer.user.length &&
|
|
!table->definer.host.length);
|
|
push_warning_printf(thd, MYSQL_ERROR::WARN_LEVEL_WARN,
|
|
ER_VIEW_FRM_NO_USER, ER(ER_VIEW_FRM_NO_USER),
|
|
table->db, table->table_name);
|
|
get_default_definer(thd, &table->definer);
|
|
}
|
|
|
|
/*
|
|
Save VIEW parameters, which will be wiped out by derived table
|
|
processing
|
|
*/
|
|
table->view_db.str= table->db;
|
|
table->view_db.length= table->db_length;
|
|
table->view_name.str= table->table_name;
|
|
table->view_name.length= table->table_name_length;
|
|
|
|
/*TODO: md5 test here and warning if it is differ */
|
|
|
|
/*
|
|
TODO: TABLE mem root should be used here when VIEW will be stored in
|
|
TABLE cache
|
|
|
|
now Lex placed in statement memory
|
|
*/
|
|
table->view= lex= thd->lex= (LEX*) new(thd->mem_root) st_lex_local;
|
|
lex_start(thd, (uchar*)table->query.str, table->query.length);
|
|
view_select= &lex->select_lex;
|
|
view_select->select_number= ++thd->select_number;
|
|
{
|
|
ulong save_mode= thd->variables.sql_mode;
|
|
/* switch off modes which can prevent normal parsing of VIEW
|
|
- MODE_REAL_AS_FLOAT affect only CREATE TABLE parsing
|
|
+ MODE_PIPES_AS_CONCAT affect expression parsing
|
|
+ MODE_ANSI_QUOTES affect expression parsing
|
|
+ MODE_IGNORE_SPACE affect expression parsing
|
|
- MODE_NOT_USED not used :)
|
|
* MODE_ONLY_FULL_GROUP_BY affect execution
|
|
* MODE_NO_UNSIGNED_SUBTRACTION affect execution
|
|
- MODE_NO_DIR_IN_CREATE affect table creation only
|
|
- MODE_POSTGRESQL compounded from other modes
|
|
- MODE_ORACLE compounded from other modes
|
|
- MODE_MSSQL compounded from other modes
|
|
- MODE_DB2 compounded from other modes
|
|
- MODE_MAXDB affect only CREATE TABLE parsing
|
|
- MODE_NO_KEY_OPTIONS affect only SHOW
|
|
- MODE_NO_TABLE_OPTIONS affect only SHOW
|
|
- MODE_NO_FIELD_OPTIONS affect only SHOW
|
|
- MODE_MYSQL323 affect only SHOW
|
|
- MODE_MYSQL40 affect only SHOW
|
|
- MODE_ANSI compounded from other modes
|
|
(+ transaction mode)
|
|
? MODE_NO_AUTO_VALUE_ON_ZERO affect UPDATEs
|
|
+ MODE_NO_BACKSLASH_ESCAPES affect expression parsing
|
|
*/
|
|
thd->variables.sql_mode&= ~(MODE_PIPES_AS_CONCAT | MODE_ANSI_QUOTES |
|
|
MODE_IGNORE_SPACE | MODE_NO_BACKSLASH_ESCAPES);
|
|
CHARSET_INFO *save_cs= thd->variables.character_set_client;
|
|
thd->variables.character_set_client= system_charset_info;
|
|
res= MYSQLparse((void *)thd);
|
|
thd->variables.character_set_client= save_cs;
|
|
thd->variables.sql_mode= save_mode;
|
|
}
|
|
if (!res && !thd->is_fatal_error)
|
|
{
|
|
TABLE_LIST *view_tables= lex->query_tables;
|
|
TABLE_LIST *view_tables_tail= 0;
|
|
TABLE_LIST *tbl;
|
|
|
|
/*
|
|
Check rights to run commands (EXPLAIN SELECT & SHOW CREATE) which show
|
|
underlying tables.
|
|
Skip this step if we are opening view for prelocking only.
|
|
*/
|
|
if (!table->prelocking_placeholder &&
|
|
(old_lex->sql_command == SQLCOM_SELECT && old_lex->describe))
|
|
{
|
|
if (check_table_access(thd, SELECT_ACL, view_tables, 1) &&
|
|
check_table_access(thd, SHOW_VIEW_ACL, table, 1))
|
|
{
|
|
my_message(ER_VIEW_NO_EXPLAIN, ER(ER_VIEW_NO_EXPLAIN), MYF(0));
|
|
goto err;
|
|
}
|
|
}
|
|
else if (!table->prelocking_placeholder &&
|
|
old_lex->sql_command == SQLCOM_SHOW_CREATE)
|
|
{
|
|
if (check_table_access(thd, SHOW_VIEW_ACL, table, 0))
|
|
goto err;
|
|
}
|
|
|
|
if (!(table->view_tables=
|
|
(List<TABLE_LIST>*) new(thd->mem_root) List<TABLE_LIST>))
|
|
goto err;
|
|
/*
|
|
mark to avoid temporary table using and put view reference and find
|
|
last view table
|
|
*/
|
|
for (tbl= view_tables;
|
|
tbl;
|
|
tbl= (view_tables_tail= tbl)->next_global)
|
|
{
|
|
tbl->skip_temporary= 1;
|
|
tbl->belong_to_view= top_view;
|
|
tbl->referencing_view= table;
|
|
tbl->prelocking_placeholder= table->prelocking_placeholder;
|
|
/*
|
|
First we fill want_privilege with SELECT_ACL (this is needed for the
|
|
tables which belongs to view subqueries and temporary table views,
|
|
then for the merged view underlying tables we will set wanted
|
|
privileges of top_view
|
|
*/
|
|
tbl->grant.want_privilege= SELECT_ACL;
|
|
/*
|
|
After unfolding the view we lose the list of tables referenced in it
|
|
(we will have only a list of underlying tables in case of MERGE
|
|
algorithm, which does not include the tables referenced from
|
|
subqueries used in view definition).
|
|
Let's build a list of all tables referenced in the view.
|
|
*/
|
|
table->view_tables->push_back(tbl);
|
|
}
|
|
|
|
/*
|
|
Put tables of VIEW after VIEW TABLE_LIST
|
|
|
|
NOTE: It is important for UPDATE/INSERT/DELETE checks to have this
|
|
tables just after VIEW instead of tail of list, to be able check that
|
|
table is unique. Also we store old next table for the same purpose.
|
|
*/
|
|
if (view_tables)
|
|
{
|
|
if (table->next_global)
|
|
{
|
|
view_tables_tail->next_global= table->next_global;
|
|
table->next_global->prev_global= &view_tables_tail->next_global;
|
|
}
|
|
else
|
|
{
|
|
old_lex->query_tables_last= &view_tables_tail->next_global;
|
|
}
|
|
view_tables->prev_global= &table->next_global;
|
|
table->next_global= view_tables;
|
|
}
|
|
|
|
/*
|
|
If we are opening this view as part of implicit LOCK TABLES, then
|
|
this view serves as simple placeholder and we should not continue
|
|
further processing.
|
|
*/
|
|
if (table->prelocking_placeholder)
|
|
goto ok2;
|
|
|
|
old_lex->derived_tables|= (DERIVED_VIEW | lex->derived_tables);
|
|
|
|
/* move SQL_NO_CACHE & Co to whole query */
|
|
old_lex->safe_to_cache_query= (old_lex->safe_to_cache_query &&
|
|
lex->safe_to_cache_query);
|
|
/* move SQL_CACHE to whole query */
|
|
if (view_select->options & OPTION_TO_QUERY_CACHE)
|
|
old_lex->select_lex.options|= OPTION_TO_QUERY_CACHE;
|
|
|
|
if (table->view_suid)
|
|
{
|
|
/*
|
|
Prepare a security context to check underlying objects of the view
|
|
*/
|
|
Security_context *save_security_ctx= thd->security_ctx;
|
|
if (!(table->view_sctx= (Security_context *)
|
|
thd->stmt_arena->alloc(sizeof(Security_context))))
|
|
goto err;
|
|
/* Assign the context to the tables referenced in the view */
|
|
for (tbl= view_tables; tbl; tbl= tbl->next_global)
|
|
tbl->security_ctx= table->view_sctx;
|
|
/* assign security context to SELECT name resolution contexts of view */
|
|
for(SELECT_LEX *sl= lex->all_selects_list;
|
|
sl;
|
|
sl= sl->next_select_in_list())
|
|
sl->context.security_ctx= table->view_sctx;
|
|
}
|
|
|
|
/*
|
|
Setup an error processor to hide error messages issued by stored
|
|
routines referenced in the view
|
|
*/
|
|
for (SELECT_LEX *sl= lex->all_selects_list;
|
|
sl;
|
|
sl= sl->next_select_in_list())
|
|
{
|
|
sl->context.error_processor= &view_error_processor;
|
|
sl->context.error_processor_data= (void *)table;
|
|
}
|
|
|
|
/*
|
|
check MERGE algorithm ability
|
|
- algorithm is not explicit TEMPORARY TABLE
|
|
- VIEW SELECT allow merging
|
|
- VIEW used in subquery or command support MERGE algorithm
|
|
*/
|
|
if (table->algorithm != VIEW_ALGORITHM_TMPTABLE &&
|
|
lex->can_be_merged() &&
|
|
(table->select_lex->master_unit() != &old_lex->unit ||
|
|
old_lex->can_use_merged()) &&
|
|
!old_lex->can_not_use_merged())
|
|
{
|
|
List_iterator_fast<TABLE_LIST> ti(view_select->top_join_list);
|
|
/*
|
|
Currently 'view_main_select_tables' differs from 'view_tables'
|
|
only then view has CONVERT_TZ() function in its select list.
|
|
This may change in future, for example if we enable merging
|
|
of views with subqueries in select list.
|
|
*/
|
|
TABLE_LIST *view_main_select_tables=
|
|
(TABLE_LIST*)lex->select_lex.table_list.first;
|
|
/* lex should contain at least one table */
|
|
DBUG_ASSERT(view_main_select_tables != 0);
|
|
|
|
table->effective_algorithm= VIEW_ALGORITHM_MERGE;
|
|
DBUG_PRINT("info", ("algorithm: MERGE"));
|
|
table->updatable= (table->updatable_view != 0);
|
|
table->effective_with_check=
|
|
old_lex->get_effective_with_check(table);
|
|
table->merge_underlying_list= view_main_select_tables;
|
|
/*
|
|
Let us set proper lock type for tables of the view's main select
|
|
since we may want to perform update or insert on view. This won't
|
|
work for view containing union. But this is ok since we don't
|
|
allow insert and update on such views anyway.
|
|
|
|
Also we fill correct wanted privileges.
|
|
*/
|
|
for (tbl= table->merge_underlying_list; tbl; tbl= tbl->next_local)
|
|
{
|
|
tbl->lock_type= table->lock_type;
|
|
tbl->grant.want_privilege= top_view->grant.orig_want_privilege;
|
|
}
|
|
|
|
/* prepare view context */
|
|
lex->select_lex.context.resolve_in_table_list_only(view_main_select_tables);
|
|
lex->select_lex.context.outer_context= 0;
|
|
lex->select_lex.context.select_lex= table->select_lex;
|
|
lex->select_lex.select_n_having_items+=
|
|
table->select_lex->select_n_having_items;
|
|
|
|
/*
|
|
Tables of the main select of the view should be marked as belonging
|
|
to the same select as original view (again we can use LEX::select_lex
|
|
for this purprose because we don't support MERGE algorithm for views
|
|
with unions).
|
|
*/
|
|
for (tbl= lex->select_lex.get_table_list(); tbl; tbl= tbl->next_local)
|
|
tbl->select_lex= table->select_lex;
|
|
|
|
{
|
|
if (view_main_select_tables->next_local)
|
|
{
|
|
table->multitable_view= TRUE;
|
|
if (table->belong_to_view)
|
|
table->belong_to_view->multitable_view= TRUE;
|
|
}
|
|
/* make nested join structure for view tables */
|
|
NESTED_JOIN *nested_join;
|
|
if (!(nested_join= table->nested_join=
|
|
(NESTED_JOIN *) thd->calloc(sizeof(NESTED_JOIN))))
|
|
goto err;
|
|
nested_join->join_list= view_select->top_join_list;
|
|
|
|
/* re-nest tables of VIEW */
|
|
ti.rewind();
|
|
while ((tbl= ti++))
|
|
{
|
|
tbl->join_list= &nested_join->join_list;
|
|
tbl->embedding= table;
|
|
}
|
|
}
|
|
|
|
/* Store WHERE clause for post-processing in setup_underlying */
|
|
table->where= view_select->where;
|
|
/*
|
|
Add subqueries units to SELECT into which we merging current view.
|
|
unit(->next)* chain starts with subqueries that are used by this
|
|
view and continues with subqueries that are used by other views.
|
|
We must not add any subquery twice (otherwise we'll form a loop),
|
|
to do this we remember in end_unit the first subquery that has
|
|
been already added.
|
|
|
|
NOTE: we do not support UNION here, so we take only one select
|
|
*/
|
|
SELECT_LEX_NODE *end_unit= table->select_lex->slave;
|
|
SELECT_LEX_UNIT *next_unit;
|
|
for (SELECT_LEX_UNIT *unit= lex->select_lex.first_inner_unit();
|
|
unit;
|
|
unit= next_unit)
|
|
{
|
|
if (unit == end_unit)
|
|
break;
|
|
SELECT_LEX_NODE *save_slave= unit->slave;
|
|
next_unit= unit->next_unit();
|
|
unit->include_down(table->select_lex);
|
|
unit->slave= save_slave; // fix include_down initialisation
|
|
}
|
|
|
|
/*
|
|
This SELECT_LEX will be linked in global SELECT_LEX list
|
|
to make it processed by mysql_handle_derived(),
|
|
but it will not be included to SELECT_LEX tree, because it
|
|
will not be executed
|
|
*/
|
|
goto ok;
|
|
}
|
|
|
|
table->effective_algorithm= VIEW_ALGORITHM_TMPTABLE;
|
|
DBUG_PRINT("info", ("algorithm: TEMPORARY TABLE"));
|
|
view_select->linkage= DERIVED_TABLE_TYPE;
|
|
table->updatable= 0;
|
|
table->effective_with_check= VIEW_CHECK_NONE;
|
|
old_lex->subqueries= TRUE;
|
|
|
|
/* SELECT tree link */
|
|
lex->unit.include_down(table->select_lex);
|
|
lex->unit.slave= view_select; // fix include_down initialisation
|
|
|
|
table->derived= &lex->unit;
|
|
}
|
|
else
|
|
goto err;
|
|
|
|
ok:
|
|
/* global SELECT list linking */
|
|
end= view_select; // primary SELECT_LEX is always last
|
|
end->link_next= old_lex->all_selects_list;
|
|
old_lex->all_selects_list->link_prev= &end->link_next;
|
|
old_lex->all_selects_list= lex->all_selects_list;
|
|
lex->all_selects_list->link_prev=
|
|
(st_select_lex_node**)&old_lex->all_selects_list;
|
|
|
|
ok2:
|
|
if (!old_lex->time_zone_tables_used && thd->lex->time_zone_tables_used)
|
|
old_lex->time_zone_tables_used= thd->lex->time_zone_tables_used;
|
|
result= !table->prelocking_placeholder && table->prepare_security(thd);
|
|
|
|
lex_end(thd->lex);
|
|
end:
|
|
if (arena)
|
|
thd->restore_active_arena(arena, &backup);
|
|
thd->lex= old_lex;
|
|
DBUG_RETURN(result);
|
|
|
|
err:
|
|
DBUG_ASSERT(thd->lex == table->view);
|
|
lex_end(thd->lex);
|
|
delete table->view;
|
|
table->view= 0; // now it is not VIEW placeholder
|
|
result= 1;
|
|
goto end;
|
|
}
|
|
|
|
|
|
/*
|
|
drop view
|
|
|
|
SYNOPSIS
|
|
mysql_drop_view()
|
|
thd - thread handler
|
|
views - views to delete
|
|
drop_mode - cascade/check
|
|
|
|
RETURN VALUE
|
|
FALSE OK
|
|
TRUE Error
|
|
*/
|
|
|
|
bool mysql_drop_view(THD *thd, TABLE_LIST *views, enum_drop_mode drop_mode)
|
|
{
|
|
char path[FN_REFLEN];
|
|
TABLE_LIST *view;
|
|
enum legacy_db_type not_used;
|
|
DBUG_ENTER("mysql_drop_view");
|
|
|
|
for (view= views; view; view= view->next_local)
|
|
{
|
|
TABLE_SHARE *share;
|
|
bool type= 0;
|
|
build_table_filename(path, sizeof(path),
|
|
view->db, view->table_name, reg_ext);
|
|
VOID(pthread_mutex_lock(&LOCK_open));
|
|
if (access(path, F_OK) ||
|
|
(type= (mysql_frm_type(thd, path, ¬_used) != FRMTYPE_VIEW)))
|
|
{
|
|
char name[FN_REFLEN];
|
|
my_snprintf(name, sizeof(name), "%s.%s", view->db, view->table_name);
|
|
if (thd->lex->drop_if_exists)
|
|
{
|
|
push_warning_printf(thd, MYSQL_ERROR::WARN_LEVEL_NOTE,
|
|
ER_BAD_TABLE_ERROR, ER(ER_BAD_TABLE_ERROR),
|
|
name);
|
|
VOID(pthread_mutex_unlock(&LOCK_open));
|
|
continue;
|
|
}
|
|
if (type)
|
|
my_error(ER_WRONG_OBJECT, MYF(0), view->db, view->table_name, "VIEW");
|
|
else
|
|
my_error(ER_BAD_TABLE_ERROR, MYF(0), name);
|
|
goto err;
|
|
}
|
|
if (my_delete(path, MYF(MY_WME)))
|
|
goto err;
|
|
|
|
/*
|
|
For a view, there is only one table_share object which should never
|
|
be used outside of LOCK_open
|
|
*/
|
|
if ((share= get_cached_table_share(view->db, view->table_name)))
|
|
{
|
|
DBUG_ASSERT(share->ref_count == 0);
|
|
pthread_mutex_lock(&share->mutex);
|
|
share->ref_count++;
|
|
share->version= 0;
|
|
pthread_mutex_unlock(&share->mutex);
|
|
release_table_share(share, RELEASE_WAIT_FOR_DROP);
|
|
}
|
|
query_cache_invalidate3(thd, view, 0);
|
|
sp_cache_invalidate();
|
|
VOID(pthread_mutex_unlock(&LOCK_open));
|
|
}
|
|
send_ok(thd);
|
|
DBUG_RETURN(FALSE);
|
|
|
|
err:
|
|
VOID(pthread_mutex_unlock(&LOCK_open));
|
|
DBUG_RETURN(TRUE);
|
|
|
|
}
|
|
|
|
|
|
/*
|
|
Check type of .frm if we are not going to parse it
|
|
|
|
SYNOPSIS
|
|
mysql_frm_type()
|
|
path path to file
|
|
|
|
RETURN
|
|
FRMTYPE_ERROR error
|
|
FRMTYPE_TABLE table
|
|
FRMTYPE_VIEW view
|
|
*/
|
|
|
|
frm_type_enum mysql_frm_type(THD *thd, char *path, enum legacy_db_type *dbt)
|
|
{
|
|
File file;
|
|
uchar header[10]; //"TYPE=VIEW\n" it is 10 characters
|
|
int error;
|
|
DBUG_ENTER("mysql_frm_type");
|
|
|
|
*dbt= DB_TYPE_UNKNOWN;
|
|
|
|
if ((file= my_open(path, O_RDONLY | O_SHARE, MYF(0))) < 0)
|
|
DBUG_RETURN(FRMTYPE_ERROR);
|
|
error= my_read(file, (byte*) header, sizeof(header), MYF(MY_WME | MY_NABP));
|
|
my_close(file, MYF(MY_WME));
|
|
|
|
if (error)
|
|
DBUG_RETURN(FRMTYPE_ERROR);
|
|
if (!strncmp((char*) header, "TYPE=VIEW\n", sizeof(header)))
|
|
DBUG_RETURN(FRMTYPE_VIEW);
|
|
|
|
/*
|
|
This is just a check for DB_TYPE. We'll return default unknown type
|
|
if the following test is true (arg #3). This should not have effect
|
|
on return value from this function (default FRMTYPE_TABLE)
|
|
*/
|
|
if (header[0] != (uchar) 254 || header[1] != 1 ||
|
|
(header[2] != FRM_VER && header[2] != FRM_VER+1 &&
|
|
(header[2] < FRM_VER+3 || header[2] > FRM_VER+4)))
|
|
DBUG_RETURN(FRMTYPE_TABLE);
|
|
|
|
*dbt= (enum legacy_db_type) (uint) *(header + 3);
|
|
DBUG_RETURN(FRMTYPE_TABLE); // Is probably a .frm table
|
|
}
|
|
|
|
|
|
/*
|
|
check of key (primary or unique) presence in updatable view
|
|
|
|
SYNOPSIS
|
|
check_key_in_view()
|
|
thd thread handler
|
|
view view for check with opened table
|
|
|
|
DESCRIPTION
|
|
If it is VIEW and query have LIMIT clause then check that underlying
|
|
table of view contain one of following:
|
|
1) primary key of underlying table
|
|
2) unique key underlying table with fields for which NULL value is
|
|
impossible
|
|
3) all fields of underlying table
|
|
|
|
RETURN
|
|
FALSE OK
|
|
TRUE view do not contain key or all fields
|
|
*/
|
|
|
|
bool check_key_in_view(THD *thd, TABLE_LIST *view)
|
|
{
|
|
TABLE *table;
|
|
Field_translator *trans, *end_of_trans;
|
|
KEY *key_info, *key_info_end;
|
|
uint i;
|
|
DBUG_ENTER("check_key_in_view");
|
|
|
|
/*
|
|
we do not support updatable UNIONs in VIEW, so we can check just limit of
|
|
LEX::select_lex
|
|
*/
|
|
if ((!view->view && !view->belong_to_view) ||
|
|
thd->lex->sql_command == SQLCOM_INSERT ||
|
|
thd->lex->select_lex.select_limit == 0)
|
|
DBUG_RETURN(FALSE); /* it is normal table or query without LIMIT */
|
|
table= view->table;
|
|
view= view->top_table();
|
|
trans= view->field_translation;
|
|
key_info_end= (key_info= table->key_info)+ table->s->keys;
|
|
|
|
end_of_trans= view->field_translation_end;
|
|
DBUG_ASSERT(table != 0 && view->field_translation != 0);
|
|
|
|
{
|
|
/*
|
|
We should be sure that all fields are ready to get keys from them, but
|
|
this operation should not have influence on Field::query_id, to avoid
|
|
marking as used fields which are not used
|
|
*/
|
|
enum_mark_columns save_mark_used_columns= thd->mark_used_columns;
|
|
thd->mark_used_columns= MARK_COLUMNS_NONE;
|
|
DBUG_PRINT("info", ("thd->mark_used_columns: %d", thd->mark_used_columns));
|
|
for (Field_translator *fld= trans; fld < end_of_trans; fld++)
|
|
{
|
|
if (!fld->item->fixed && fld->item->fix_fields(thd, &fld->item))
|
|
{
|
|
thd->mark_used_columns= save_mark_used_columns;
|
|
return TRUE;
|
|
}
|
|
}
|
|
thd->mark_used_columns= save_mark_used_columns;
|
|
DBUG_PRINT("info", ("thd->mark_used_columns: %d", thd->mark_used_columns));
|
|
}
|
|
/* Loop over all keys to see if a unique-not-null key is used */
|
|
for (;key_info != key_info_end ; key_info++)
|
|
{
|
|
if ((key_info->flags & (HA_NOSAME | HA_NULL_PART_KEY)) == HA_NOSAME)
|
|
{
|
|
KEY_PART_INFO *key_part= key_info->key_part;
|
|
KEY_PART_INFO *key_part_end= key_part + key_info->key_parts;
|
|
|
|
/* check that all key parts are used */
|
|
for (;;)
|
|
{
|
|
Field_translator *k;
|
|
for (k= trans; k < end_of_trans; k++)
|
|
{
|
|
Item_field *field;
|
|
if ((field= k->item->filed_for_view_update()) &&
|
|
field->field == key_part->field)
|
|
break;
|
|
}
|
|
if (k == end_of_trans)
|
|
break; // Key is not possible
|
|
if (++key_part == key_part_end)
|
|
DBUG_RETURN(FALSE); // Found usable key
|
|
}
|
|
}
|
|
}
|
|
|
|
DBUG_PRINT("info", ("checking if all fields of table are used"));
|
|
/* check all fields presence */
|
|
{
|
|
Field **field_ptr;
|
|
Field_translator *fld;
|
|
for (field_ptr= table->field; *field_ptr; field_ptr++)
|
|
{
|
|
for (fld= trans; fld < end_of_trans; fld++)
|
|
{
|
|
Item_field *field;
|
|
if ((field= fld->item->filed_for_view_update()) &&
|
|
field->field == *field_ptr)
|
|
break;
|
|
}
|
|
if (fld == end_of_trans) // If field didn't exists
|
|
{
|
|
/*
|
|
Keys or all fields of underlying tables are not found => we have
|
|
to check variable updatable_views_with_limit to decide should we
|
|
issue an error or just a warning
|
|
*/
|
|
if (thd->variables.updatable_views_with_limit)
|
|
{
|
|
/* update allowed, but issue warning */
|
|
push_warning(thd, MYSQL_ERROR::WARN_LEVEL_NOTE,
|
|
ER_WARN_VIEW_WITHOUT_KEY, ER(ER_WARN_VIEW_WITHOUT_KEY));
|
|
DBUG_RETURN(FALSE);
|
|
}
|
|
/* prohibit update */
|
|
DBUG_RETURN(TRUE);
|
|
}
|
|
}
|
|
}
|
|
DBUG_RETURN(FALSE);
|
|
}
|
|
|
|
|
|
/*
|
|
insert fields from VIEW (MERGE algorithm) into given list
|
|
|
|
SYNOPSIS
|
|
insert_view_fields()
|
|
thd thread handler
|
|
list list for insertion
|
|
view view for processing
|
|
|
|
RETURN
|
|
FALSE OK
|
|
TRUE error (is not sent to cliet)
|
|
*/
|
|
|
|
bool insert_view_fields(THD *thd, List<Item> *list, TABLE_LIST *view)
|
|
{
|
|
Field_translator *trans_end;
|
|
Field_translator *trans;
|
|
DBUG_ENTER("insert_view_fields");
|
|
|
|
if (!(trans= view->field_translation))
|
|
DBUG_RETURN(FALSE);
|
|
trans_end= view->field_translation_end;
|
|
|
|
for (Field_translator *entry= trans; entry < trans_end; entry++)
|
|
{
|
|
Item_field *fld;
|
|
if ((fld= entry->item->filed_for_view_update()))
|
|
list->push_back(fld);
|
|
else
|
|
{
|
|
my_error(ER_NON_UPDATABLE_TABLE, MYF(0), view->alias, "INSERT");
|
|
DBUG_RETURN(TRUE);
|
|
}
|
|
}
|
|
DBUG_RETURN(FALSE);
|
|
}
|
|
|
|
/*
|
|
checking view md5 check suum
|
|
|
|
SINOPSYS
|
|
view_checksum()
|
|
thd threar handler
|
|
view view for check
|
|
|
|
RETUIRN
|
|
HA_ADMIN_OK OK
|
|
HA_ADMIN_NOT_IMPLEMENTED it is not VIEW
|
|
HA_ADMIN_WRONG_CHECKSUM check sum is wrong
|
|
*/
|
|
|
|
int view_checksum(THD *thd, TABLE_LIST *view)
|
|
{
|
|
char md5[MD5_BUFF_LENGTH];
|
|
if (!view->view || view->md5.length != 32)
|
|
return HA_ADMIN_NOT_IMPLEMENTED;
|
|
view->calc_md5(md5);
|
|
return (strncmp(md5, view->md5.str, 32) ?
|
|
HA_ADMIN_WRONG_CHECKSUM :
|
|
HA_ADMIN_OK);
|
|
}
|
|
|
|
/*
|
|
rename view
|
|
|
|
Synopsis:
|
|
renames a view
|
|
|
|
Parameters:
|
|
thd thread handler
|
|
new_name new name of view
|
|
view view
|
|
|
|
Return values:
|
|
FALSE Ok
|
|
TRUE Error
|
|
*/
|
|
bool
|
|
mysql_rename_view(THD *thd,
|
|
const char *new_name,
|
|
TABLE_LIST *view)
|
|
{
|
|
LEX_STRING pathstr, file;
|
|
File_parser *parser;
|
|
char view_path[FN_REFLEN];
|
|
bool error= TRUE;
|
|
DBUG_ENTER("mysql_rename_view");
|
|
|
|
strxnmov(view_path, FN_REFLEN-1, mysql_data_home, "/", view->db, "/",
|
|
view->table_name, reg_ext, NullS);
|
|
(void) unpack_filename(view_path, view_path);
|
|
|
|
pathstr.str= (char *)view_path;
|
|
pathstr.length= strlen(view_path);
|
|
|
|
if ((parser= sql_parse_prepare(&pathstr, thd->mem_root, 1)) &&
|
|
is_equal(&view_type, parser->type()))
|
|
{
|
|
TABLE_LIST view_def;
|
|
char dir_buff[FN_REFLEN], file_buff[FN_REFLEN];
|
|
|
|
/*
|
|
To be PS-friendly we should either to restore state of
|
|
TABLE_LIST object pointed by 'view' after using it for
|
|
view definition parsing or use temporary 'view_def'
|
|
object for it.
|
|
*/
|
|
bzero(&view_def, sizeof(view_def));
|
|
view_def.timestamp.str= view_def.timestamp_buffer;
|
|
view_def.view_suid= TRUE;
|
|
|
|
/* get view definition and source */
|
|
if (parser->parse((gptr)&view_def, thd->mem_root, view_parameters,
|
|
array_elements(view_parameters)-1,
|
|
&file_parser_dummy_hook))
|
|
goto err;
|
|
|
|
/* rename view and it's backups */
|
|
if (rename_in_schema_file(view->db, view->table_name, new_name,
|
|
view_def.revision - 1, num_view_backups))
|
|
goto err;
|
|
|
|
strxnmov(dir_buff, FN_REFLEN-1, mysql_data_home, "/", view->db, "/",
|
|
NullS);
|
|
(void) unpack_filename(dir_buff, dir_buff);
|
|
|
|
pathstr.str= (char*)dir_buff;
|
|
pathstr.length= strlen(dir_buff);
|
|
|
|
file.str= file_buff;
|
|
file.length= (strxnmov(file_buff, FN_REFLEN, new_name, reg_ext, NullS)
|
|
- file_buff);
|
|
|
|
if (sql_create_definition_file(&pathstr, &file, view_file_type,
|
|
(gptr)&view_def, view_parameters,
|
|
num_view_backups))
|
|
{
|
|
/* restore renamed view in case of error */
|
|
rename_in_schema_file(view->db, new_name, view->table_name,
|
|
view_def.revision - 1, num_view_backups);
|
|
goto err;
|
|
}
|
|
} else
|
|
DBUG_RETURN(1);
|
|
|
|
/* remove cache entries */
|
|
query_cache_invalidate3(thd, view, 0);
|
|
sp_cache_invalidate();
|
|
error= FALSE;
|
|
|
|
err:
|
|
DBUG_RETURN(error);
|
|
}
|