summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarko Mäkelä <marko.makela@mariadb.com>2019-07-23 14:51:48 +0300
committerMarko Mäkelä <marko.makela@mariadb.com>2019-07-23 15:23:27 +0300
commite6c1e588f05bd022262e68eb10f3634558e3f42c (patch)
tree233e08428db4080e325faa88a2f31b708f903593
parenta5e268a2931c39c7b3cc2ff2e6e3fe6b5e85a383 (diff)
downloadmariadb-git-e6c1e588f05bd022262e68eb10f3634558e3f42c.tar.gz
gen_lex_hash: Omit deprecated register keywords
This is follow-up to d36c107a6b7f9e9bc9425072f2ac13afd2334069
-rw-r--r--sql/gen_lex_hash.cc28
1 files changed, 14 insertions, 14 deletions
diff --git a/sql/gen_lex_hash.cc b/sql/gen_lex_hash.cc
index d488900fb85..76c747cebb8 100644
--- a/sql/gen_lex_hash.cc
+++ b/sql/gen_lex_hash.cc
@@ -403,8 +403,8 @@ int main(int argc,char **argv)
static SYMBOL *get_hash_symbol(const char *s,\n\
unsigned int len,bool function)\n\
{\n\
- register uchar *hash_map;\n\
- register const char *cur_str= s;\n\
+ uchar *hash_map;\n\
+ const char *cur_str= s;\n\
\n\
if (len == 0) {\n\
DBUG_PRINT(\"warning\", (\"get_hash_symbol() received a request for a zero-length symbol, which is probably a mistake.\"));\
@@ -416,25 +416,25 @@ static SYMBOL *get_hash_symbol(const char *s,\n\
if (function){\n\
if (len>sql_functions_max_len) return 0;\n\
hash_map= sql_functions_map;\n\
- register uint32 cur_struct= uint4korr(hash_map+((len-1)*4));\n\
+ uint32 cur_struct= uint4korr(hash_map+((len-1)*4));\n\
\n\
for (;;){\n\
- register uchar first_char= (uchar)cur_struct;\n\
+ uchar first_char= (uchar)cur_struct;\n\
\n\
if (first_char == 0)\n\
{\n\
- register int16 ires= (int16)(cur_struct>>16);\n\
+ int16 ires= (int16)(cur_struct>>16);\n\
if (ires==array_elements(symbols)) return 0;\n\
- register SYMBOL *res;\n\
+ SYMBOL *res;\n\
if (ires>=0) \n\
res= symbols+ires;\n\
else\n\
res= sql_functions-ires-1;\n\
- register uint count= (uint) (cur_str - s);\n\
+ uint count= (uint) (cur_str - s);\n\
return lex_casecmp(cur_str,res->name+count,len-count) ? 0 : res;\n\
}\n\
\n\
- register uchar cur_char= (uchar)to_upper_lex[(uchar)*cur_str];\n\
+ uchar cur_char= (uchar)to_upper_lex[(uchar)*cur_str];\n\
if (cur_char<first_char) return 0;\n\
cur_struct>>=8;\n\
if (cur_char>(uchar)cur_struct) return 0;\n\
@@ -450,20 +450,20 @@ static SYMBOL *get_hash_symbol(const char *s,\n\
}else{\n\
if (len>symbols_max_len) return 0;\n\
hash_map= symbols_map;\n\
- register uint32 cur_struct= uint4korr(hash_map+((len-1)*4));\n\
+ uint32 cur_struct= uint4korr(hash_map+((len-1)*4));\n\
\n\
for (;;){\n\
- register uchar first_char= (uchar)cur_struct;\n\
+ uchar first_char= (uchar)cur_struct;\n\
\n\
if (first_char==0){\n\
- register int16 ires= (int16)(cur_struct>>16);\n\
+ int16 ires= (int16)(cur_struct>>16);\n\
if (ires==array_elements(symbols)) return 0;\n\
- register SYMBOL *res= symbols+ires;\n\
- register uint count= (uint) (cur_str - s);\n\
+ SYMBOL *res= symbols+ires;\n\
+ uint count= (uint) (cur_str - s);\n\
return lex_casecmp(cur_str,res->name+count,len-count)!=0 ? 0 : res;\n\
}\n\
\n\
- register uchar cur_char= (uchar)to_upper_lex[(uchar)*cur_str];\n\
+ uchar cur_char= (uchar)to_upper_lex[(uchar)*cur_str];\n\
if (cur_char<first_char) return 0;\n\
cur_struct>>=8;\n\
if (cur_char>(uchar)cur_struct) return 0;\n\