mirror of
https://github.com/MariaDB/server.git
synced 2025-01-16 12:02:42 +01:00
7911c50718
into ua141d10.elisa.omakaista.fi:/home/my/bk/mysql-5.0-tmp heap/_check.c: Auto merged heap/hp_create.c: Auto merged include/config-netware.h: Auto merged include/my_base.h: Auto merged include/my_handler.h: Auto merged include/myisam.h: Auto merged innobase/include/Makefile.am: Auto merged myisam/mi_check.c: Auto merged myisam/mi_delete.c: Auto merged myisam/mi_rnext_same.c: Auto merged myisam/mi_search.c: Auto merged myisam/mi_write.c: Auto merged myisam/myisamdef.h: Auto merged myisam/sort.c: Auto merged mysql-test/mysql-test-run.sh: Auto merged mysql-test/r/date_formats.result: Auto merged mysql-test/r/update.result: Auto merged mysql-test/t/date_formats.test: Auto merged mysql-test/t/select.test: Auto merged mysql-test/t/update.test: Auto merged mysys/my_getopt.c: Auto merged mysys/my_handler.c: Auto merged scripts/make_binary_distribution.sh: Auto merged sql/ha_myisam.cc: Auto merged sql/item_timefunc.cc: Auto merged sql/records.cc: Auto merged sql/sql_load.cc: Auto merged sql/sql_select.cc: Auto merged sql/structs.h: Auto merged strings/conf_to_src.c: Auto merged strings/ctype-win1250ch.c: Auto merged Makefile.am: Merged from 4.1 myisam/myisamchk.c: Merged from 4.1 mysql-test/mysql-test-run.pl: Merged from 4.1 mysql-test/r/insert_select.result: Merged from 4.1 mysql-test/r/myisam.result: Merged from 4.1 mysql-test/r/select.result: Merged from 4.1 mysql-test/t/insert_select.test: Merged from 4.1 mysql-test/t/myisam.test: Merged from 4.1 netware/mysql_test_run.c: Merged from 4.1 sql/item.cc: Merged from 4.1 sql/mysqld.cc: Merged from 4.1 sql/sql_update.cc: Merged from 4.1 tests/mysql_client_test.c: Merged from 4.1
311 lines
8.8 KiB
C
311 lines
8.8 KiB
C
/* Copyright (C) 2000 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 */
|
|
|
|
#include <my_global.h>
|
|
#include <m_string.h>
|
|
#include <m_ctype.h>
|
|
#include <fcntl.h>
|
|
#include <my_xml.h>
|
|
|
|
#define ROW_LEN 16
|
|
#define ROW16_LEN 8
|
|
#define MAX_BUF 16*1024
|
|
|
|
static CHARSET_INFO all_charsets[256];
|
|
|
|
|
|
void
|
|
print_array(FILE *f, const char *set, const char *name, uchar *a, int n)
|
|
{
|
|
int i;
|
|
|
|
fprintf(f,"uchar %s_%s[] = {\n", name, set);
|
|
|
|
for (i=0 ;i<n ; i++)
|
|
{
|
|
fprintf(f,"0x%02X",a[i]);
|
|
fprintf(f, (i+1<n) ? "," :"" );
|
|
fprintf(f, ((i+1) % ROW_LEN == n % ROW_LEN) ? "\n" : "" );
|
|
}
|
|
fprintf(f,"};\n\n");
|
|
}
|
|
|
|
|
|
void
|
|
print_array16(FILE *f, const char *set, const char *name, uint16 *a, int n)
|
|
{
|
|
int i;
|
|
|
|
fprintf(f,"uint16 %s_%s[] = {\n", name, set);
|
|
|
|
for (i=0 ;i<n ; i++)
|
|
{
|
|
fprintf(f,"0x%04X",a[i]);
|
|
fprintf(f, (i+1<n) ? "," :"" );
|
|
fprintf(f, ((i+1) % ROW16_LEN == n % ROW16_LEN) ? "\n" : "" );
|
|
}
|
|
fprintf(f,"};\n\n");
|
|
}
|
|
|
|
|
|
static int get_charset_number(const char *charset_name)
|
|
{
|
|
CHARSET_INFO *cs;
|
|
for (cs= all_charsets; cs < all_charsets+255; ++cs)
|
|
{
|
|
if ( cs->name && !strcmp(cs->name, charset_name))
|
|
return cs->number;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
char *mdup(const char *src, uint len)
|
|
{
|
|
char *dst=(char*)malloc(len);
|
|
if (!dst)
|
|
exit(1);
|
|
memcpy(dst,src,len);
|
|
return dst;
|
|
}
|
|
|
|
static void simple_cs_copy_data(CHARSET_INFO *to, CHARSET_INFO *from)
|
|
{
|
|
to->number= from->number ? from->number : to->number;
|
|
to->state|= from->state;
|
|
|
|
if (from->csname)
|
|
to->csname= strdup(from->csname);
|
|
|
|
if (from->name)
|
|
to->name= strdup(from->name);
|
|
|
|
if (from->ctype)
|
|
to->ctype= (uchar*) mdup((char*) from->ctype, MY_CS_CTYPE_TABLE_SIZE);
|
|
if (from->to_lower)
|
|
to->to_lower= (uchar*) mdup((char*) from->to_lower, MY_CS_TO_LOWER_TABLE_SIZE);
|
|
if (from->to_upper)
|
|
to->to_upper= (uchar*) mdup((char*) from->to_upper, MY_CS_TO_UPPER_TABLE_SIZE);
|
|
if (from->sort_order)
|
|
{
|
|
to->sort_order= (uchar*) mdup((char*) from->sort_order, MY_CS_SORT_ORDER_TABLE_SIZE);
|
|
/*
|
|
set_max_sort_char(to);
|
|
*/
|
|
}
|
|
if (from->tab_to_uni)
|
|
{
|
|
uint sz= MY_CS_TO_UNI_TABLE_SIZE*sizeof(uint16);
|
|
to->tab_to_uni= (uint16*) mdup((char*)from->tab_to_uni, sz);
|
|
/*
|
|
create_fromuni(to);
|
|
*/
|
|
}
|
|
}
|
|
|
|
static my_bool simple_cs_is_full(CHARSET_INFO *cs)
|
|
{
|
|
return ((cs->csname && cs->tab_to_uni && cs->ctype && cs->to_upper &&
|
|
cs->to_lower) &&
|
|
(cs->number && cs->name &&
|
|
(cs->sort_order || (cs->state & MY_CS_BINSORT))));
|
|
}
|
|
|
|
static int add_collation(CHARSET_INFO *cs)
|
|
{
|
|
if (cs->name && (cs->number || (cs->number=get_charset_number(cs->name))))
|
|
{
|
|
if (!(all_charsets[cs->number].state & MY_CS_COMPILED))
|
|
{
|
|
simple_cs_copy_data(&all_charsets[cs->number],cs);
|
|
|
|
}
|
|
|
|
cs->number= 0;
|
|
cs->name= NULL;
|
|
cs->state= 0;
|
|
cs->sort_order= NULL;
|
|
cs->state= 0;
|
|
}
|
|
return MY_XML_OK;
|
|
}
|
|
|
|
|
|
static int my_read_charset_file(const char *filename)
|
|
{
|
|
char buf[MAX_BUF];
|
|
int fd;
|
|
uint len;
|
|
|
|
if ((fd=open(filename,O_RDONLY)) < 0)
|
|
{
|
|
fprintf(stderr,"Can't open '%s'\n",filename);
|
|
return 1;
|
|
}
|
|
|
|
len=read(fd,buf,MAX_BUF);
|
|
close(fd);
|
|
|
|
if (my_parse_charset_xml(buf,len,add_collation))
|
|
{
|
|
#if 0
|
|
printf("ERROR at line %d pos %d '%s'\n",
|
|
my_xml_error_lineno(&p)+1,
|
|
my_xml_error_pos(&p),
|
|
my_xml_error_string(&p));
|
|
#endif
|
|
}
|
|
|
|
return FALSE;
|
|
}
|
|
|
|
static int
|
|
is_case_sensitive(CHARSET_INFO *cs)
|
|
{
|
|
return (cs->sort_order &&
|
|
cs->sort_order['A'] < cs->sort_order['a'] &&
|
|
cs->sort_order['a'] < cs->sort_order['B']) ? 1 : 0;
|
|
}
|
|
|
|
void dispcset(FILE *f,CHARSET_INFO *cs)
|
|
{
|
|
fprintf(f,"{\n");
|
|
fprintf(f," %d,%d,%d,\n",cs->number,0,0);
|
|
fprintf(f," MY_CS_COMPILED%s%s%s,\n",
|
|
cs->state & MY_CS_BINSORT ? "|MY_CS_BINSORT" : "",
|
|
cs->state & MY_CS_PRIMARY ? "|MY_CS_PRIMARY" : "",
|
|
is_case_sensitive(cs) ? "|MY_CS_CSSORT" : "");
|
|
|
|
if (cs->name)
|
|
{
|
|
fprintf(f," \"%s\", /* cset name */\n",cs->csname);
|
|
fprintf(f," \"%s\", /* coll name */\n",cs->name);
|
|
fprintf(f," \"\", /* comment */\n");
|
|
fprintf(f," NULL, /* tailoring */\n");
|
|
fprintf(f," ctype_%s, /* ctype */\n",cs->name);
|
|
fprintf(f," to_lower_%s, /* lower */\n",cs->name);
|
|
fprintf(f," to_upper_%s, /* upper */\n",cs->name);
|
|
if (cs->sort_order)
|
|
fprintf(f," sort_order_%s, /* sort_order */\n",cs->name);
|
|
else
|
|
fprintf(f," NULL, /* sort_order */\n");
|
|
fprintf(f," NULL, /* contractions */\n");
|
|
fprintf(f," NULL, /* sort_order_big*/\n");
|
|
fprintf(f," to_uni_%s, /* to_uni */\n",cs->name);
|
|
}
|
|
else
|
|
{
|
|
fprintf(f," NULL, /* cset name */\n");
|
|
fprintf(f," NULL, /* coll name */\n");
|
|
fprintf(f," NULL, /* comment */\n");
|
|
fprintf(f," NULL, /* tailoging */\n");
|
|
fprintf(f," NULL, /* ctype */\n");
|
|
fprintf(f," NULL, /* lower */\n");
|
|
fprintf(f," NULL, /* upper */\n");
|
|
fprintf(f," NULL, /* sort order */\n");
|
|
fprintf(f," NULL, /* contractions */\n");
|
|
fprintf(f," NULL, /* sort_order_big*/\n");
|
|
fprintf(f," NULL, /* to_uni */\n");
|
|
}
|
|
|
|
fprintf(f," NULL, /* from_uni */\n");
|
|
fprintf(f," NULL, /* state map */\n");
|
|
fprintf(f," NULL, /* ident map */\n");
|
|
fprintf(f," 1, /* strxfrm_multiply*/\n");
|
|
fprintf(f," 1, /* mbminlen */\n");
|
|
fprintf(f," 1, /* mbmaxlen */\n");
|
|
fprintf(f," 0, /* min_sort_char */\n");
|
|
fprintf(f," 255, /* max_sort_char */\n");
|
|
fprintf(f," 0, /* escape_with_backslash_is_dangerous */\n");
|
|
|
|
fprintf(f," &my_charset_8bit_handler,\n");
|
|
if (cs->state & MY_CS_BINSORT)
|
|
fprintf(f," &my_collation_8bit_bin_handler,\n");
|
|
else
|
|
fprintf(f," &my_collation_8bit_simple_ci_handler,\n");
|
|
fprintf(f,"}\n");
|
|
}
|
|
|
|
|
|
int
|
|
main(int argc, char **argv __attribute__((unused)))
|
|
{
|
|
CHARSET_INFO ncs;
|
|
CHARSET_INFO *cs;
|
|
char filename[256];
|
|
FILE *f= stdout;
|
|
|
|
if (argc < 2)
|
|
{
|
|
fprintf(stderr, "usage: %s source-dir\n", argv[0]);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
bzero((void*)&ncs,sizeof(ncs));
|
|
bzero((void*)&all_charsets,sizeof(all_charsets));
|
|
|
|
sprintf(filename,"%s/%s",argv[1],"Index.xml");
|
|
my_read_charset_file(filename);
|
|
|
|
for (cs=all_charsets; cs < all_charsets+256; cs++)
|
|
{
|
|
if (cs->number && !(cs->state & MY_CS_COMPILED))
|
|
{
|
|
if ( (!simple_cs_is_full(cs)) && (cs->csname))
|
|
{
|
|
sprintf(filename,"%s/%s.xml",argv[1],cs->csname);
|
|
my_read_charset_file(filename);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
fprintf(f,"#include <my_global.h>\n");
|
|
fprintf(f,"#include <m_ctype.h>\n\n");
|
|
|
|
|
|
for (cs=all_charsets; cs < all_charsets+256; cs++)
|
|
{
|
|
if (simple_cs_is_full(cs))
|
|
{
|
|
fprintf(f,"#ifdef HAVE_CHARSET_%s\n",cs->csname);
|
|
print_array(f, cs->name, "ctype", cs->ctype, MY_CS_CTYPE_TABLE_SIZE);
|
|
print_array(f, cs->name, "to_lower", cs->to_lower, MY_CS_TO_LOWER_TABLE_SIZE);
|
|
print_array(f, cs->name, "to_upper", cs->to_upper, MY_CS_TO_UPPER_TABLE_SIZE);
|
|
if (cs->sort_order)
|
|
print_array(f, cs->name, "sort_order", cs->sort_order, MY_CS_SORT_ORDER_TABLE_SIZE);
|
|
print_array16(f, cs->name, "to_uni", cs->tab_to_uni, MY_CS_TO_UNI_TABLE_SIZE);
|
|
fprintf(f,"#endif\n");
|
|
fprintf(f,"\n");
|
|
}
|
|
}
|
|
|
|
fprintf(f,"CHARSET_INFO compiled_charsets[] = {\n");
|
|
for (cs=all_charsets; cs < all_charsets+256; cs++)
|
|
{
|
|
if (simple_cs_is_full(cs))
|
|
{
|
|
fprintf(f,"#ifdef HAVE_CHARSET_%s\n",cs->csname);
|
|
dispcset(f,cs);
|
|
fprintf(f,",\n");
|
|
fprintf(f,"#endif\n");
|
|
}
|
|
}
|
|
|
|
dispcset(f,&ncs);
|
|
fprintf(f,"};\n");
|
|
|
|
return 0;
|
|
}
|