mirror of
https://github.com/MariaDB/server.git
synced 2025-01-16 12:02:42 +01:00
77c6382312
Rewriting GRANT/REVOKE grammar to use more bison stack and use Sql_cmd_ style 1. Removing a few members from LEX: - uint grant, grant_to_col, which_columns - List<LEX_COLUMN> columns - bool all_privileges 2. Adding classes Grand_object_name, Lex_grant_object_name 3. Adding classes Grand_privilege, Lex_grand_privilege 4. Adding struct Lex_column_list_privilege_st, class Lex_column_list_privilege 5. Rewriting the GRANT/REVOKE grammar to use new classes and pass them through bison stack (rather than directly access LEX members) 6. Adding classes Sql_cmd_grant* and Sql_cmd_revoke*, changing GRANT/REVOKE to use LEX::m_sql_cmd. 7. Adding the "sp_handler" grammar rule and removing some duplicate grammar for GRANT/REVOKE for different kinds of SP objects. 8. Adding a new rule comma_separated_ident_list, reusing it in: - with_column_list - colum_list_privilege
111 lines
2.7 KiB
C++
111 lines
2.7 KiB
C++
/*
|
|
Copyright (c) 2018, MariaDB Corporation.
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; version 2 of the License.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
|
|
|
|
|
|
#ifndef LEX_STRING_INCLUDED
|
|
#define LEX_STRING_INCLUDED
|
|
|
|
|
|
typedef struct st_mysql_const_lex_string LEX_CSTRING;
|
|
|
|
|
|
class Lex_cstring : public LEX_CSTRING
|
|
{
|
|
public:
|
|
Lex_cstring()
|
|
{
|
|
str= NULL;
|
|
length= 0;
|
|
}
|
|
Lex_cstring(const LEX_CSTRING &str)
|
|
{
|
|
LEX_CSTRING::operator=(str);
|
|
}
|
|
Lex_cstring(const char *_str, size_t _len)
|
|
{
|
|
str= _str;
|
|
length= _len;
|
|
}
|
|
Lex_cstring(const char *start, const char *end)
|
|
{
|
|
DBUG_ASSERT(start <= end);
|
|
str= start;
|
|
length= end - start;
|
|
}
|
|
void set(const char *_str, size_t _len)
|
|
{
|
|
str= _str;
|
|
length= _len;
|
|
}
|
|
};
|
|
|
|
|
|
class Lex_cstring_strlen: public Lex_cstring
|
|
{
|
|
public:
|
|
Lex_cstring_strlen(const char *from)
|
|
:Lex_cstring(from, from ? strlen(from) : 0)
|
|
{ }
|
|
};
|
|
|
|
|
|
/* Functions to compare if two lex strings are equal */
|
|
|
|
static inline bool lex_string_cmp(CHARSET_INFO *charset, const LEX_CSTRING *a,
|
|
const LEX_CSTRING *b)
|
|
{
|
|
return my_strcasecmp(charset, a->str, b->str);
|
|
}
|
|
|
|
/*
|
|
Compare to LEX_CSTRING's and return 0 if equal
|
|
*/
|
|
|
|
static inline bool cmp(const LEX_CSTRING *a, const LEX_CSTRING *b)
|
|
{
|
|
return (a->length != b->length ||
|
|
memcmp(a->str, b->str, a->length));
|
|
}
|
|
static inline bool cmp(const LEX_CSTRING a, const LEX_CSTRING b)
|
|
{
|
|
return a.length != b.length || memcmp(a.str, b.str, a.length);
|
|
}
|
|
|
|
/*
|
|
Compare if two LEX_CSTRING are equal. Assumption is that
|
|
character set is ASCII (like for plugin names)
|
|
*/
|
|
|
|
static inline bool lex_string_eq(const LEX_CSTRING *a, const LEX_CSTRING *b)
|
|
{
|
|
if (a->length != b->length)
|
|
return 0; /* Different */
|
|
return strcasecmp(a->str, b->str) == 0;
|
|
}
|
|
|
|
/*
|
|
To be used when calling lex_string_eq with STRING_WITH_LEN() as second
|
|
argument
|
|
*/
|
|
|
|
static inline bool lex_string_eq(const LEX_CSTRING *a, const char *b, size_t b_length)
|
|
{
|
|
if (a->length != b_length)
|
|
return 0; /* Different */
|
|
return strcasecmp(a->str, b) == 0;
|
|
}
|
|
|
|
#endif /* LEX_STRING_INCLUDED */
|