diff options
Diffstat (limited to 'mysql/strings/ctype-simple.c')
| -rw-r--r-- | mysql/strings/ctype-simple.c | 1941 |
1 files changed, 0 insertions, 1941 deletions
diff --git a/mysql/strings/ctype-simple.c b/mysql/strings/ctype-simple.c deleted file mode 100644 index 953eb75..0000000 --- a/mysql/strings/ctype-simple.c +++ /dev/null @@ -1,1941 +0,0 @@ -/* Copyright (c) 2002, 2016, Oracle and/or its affiliates. All rights reserved. - - 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 */ - -#include <my_global.h> -#include "m_string.h" -#include "m_ctype.h" -#include "my_sys.h" /* Needed for MY_ERRNO_ERANGE */ -#include <errno.h> - -#include "stdarg.h" - -/* - Returns the number of bytes required for strnxfrm(). -*/ - -size_t my_strnxfrmlen_simple(const CHARSET_INFO *cs, size_t len) -{ - return len * (cs->strxfrm_multiply ? cs->strxfrm_multiply : 1); -} - - -/* - Converts a string into its sort key. - - SYNOPSIS - my_strnxfrm_xxx() - - IMPLEMENTATION - - The my_strxfrm_xxx() function transforms a string pointed to by - 'src' with length 'srclen' according to the charset+collation - pair 'cs' and copies the result key into 'dest'. - - Comparing two strings using memcmp() after my_strnxfrm_xxx() - is equal to comparing two original strings with my_strnncollsp_xxx(). - - Not more than 'dstlen' bytes are written into 'dst'. - To garantee that the whole string is transformed, 'dstlen' must be - at least srclen*cs->strnxfrm_multiply bytes long. Otherwise, - consequent memcmp() may return a non-accurate result. - - If the source string is too short to fill whole 'dstlen' bytes, - then the 'dest' string is padded up to 'dstlen', ensuring that: - - "a" == "a " - "a\0" < "a" - "a\0" < "a " - - my_strnxfrm_simple() is implemented for 8bit charsets and - simple collations with one-to-one string->key transformation. - - See also implementations for various charsets/collations in - other ctype-xxx.c files. - - RETURN - - Target len 'dstlen'. - -*/ - - -size_t -my_strnxfrm_simple(const CHARSET_INFO *cs, - uchar *dst, size_t dstlen, uint nweights, - const uchar *src, size_t srclen, uint flags) -{ - const uchar *map= cs->sort_order; - uchar *d0= dst; - const uchar *end; - const uchar *remainder; - size_t frmlen; - if ((frmlen= MY_MIN(dstlen, nweights)) > srclen) - frmlen= srclen; - end= src + frmlen; - - // Do the first few bytes. - remainder= src + (frmlen % 8); - for (; src < remainder;) - *dst++= map[*src++]; - - // Unroll loop for rest of string. - for (; src < end;) - { - *dst++= map[*src++]; - *dst++= map[*src++]; - *dst++= map[*src++]; - *dst++= map[*src++]; - *dst++= map[*src++]; - *dst++= map[*src++]; - *dst++= map[*src++]; - *dst++= map[*src++]; - } - return my_strxfrm_pad_desc_and_reverse(cs, d0, dst, d0 + dstlen, - (uint)(nweights - frmlen), flags, 0); -} - - -int my_strnncoll_simple(const CHARSET_INFO * cs, const uchar *s, size_t slen, - const uchar *t, size_t tlen, - my_bool t_is_prefix) -{ - size_t len = ( slen > tlen ) ? tlen : slen; - const uchar *map= cs->sort_order; - if (t_is_prefix && slen > tlen) - slen=tlen; - while (len--) - { - if (map[*s++] != map[*t++]) - return ((int) map[s[-1]] - (int) map[t[-1]]); - } - /* - We can't use (slen - tlen) here as the result may be outside of the - precision of a signed int - */ - return slen > tlen ? 1 : slen < tlen ? -1 : 0 ; -} - - -/* - Compare strings, discarding end space - - SYNOPSIS - my_strnncollsp_simple() - cs character set handler - a First string to compare - a_length Length of 'a' - b Second string to compare - b_length Length of 'b' - diff_if_only_endspace_difference - Set to 1 if the strings should be regarded as different - if they only difference in end space - - IMPLEMENTATION - If one string is shorter as the other, then we space extend the other - so that the strings have equal length. - - This will ensure that the following things hold: - - "a" == "a " - "a\0" < "a" - "a\0" < "a " - - RETURN - < 0 a < b - = 0 a == b - > 0 a > b -*/ - -int my_strnncollsp_simple(const CHARSET_INFO *cs, const uchar *a, - size_t a_length, const uchar *b, size_t b_length, - my_bool diff_if_only_endspace_difference) -{ - const uchar *map= cs->sort_order, *end; - size_t length; - int res; - -#ifndef VARCHAR_WITH_DIFF_ENDSPACE_ARE_DIFFERENT_FOR_UNIQUE - diff_if_only_endspace_difference= 0; -#endif - - end= a + (length= MY_MIN(a_length, b_length)); - while (a < end) - { - if (map[*a++] != map[*b++]) - return ((int) map[a[-1]] - (int) map[b[-1]]); - } - res= 0; - if (a_length != b_length) - { - int swap= 1; - if (diff_if_only_endspace_difference) - res= 1; /* Assume 'a' is bigger */ - /* - Check the next not space character of the longer key. If it's < ' ', - then it's smaller than the other key. - */ - if (a_length < b_length) - { - /* put shorter key in s */ - a_length= b_length; - a= b; - swap= -1; /* swap sign of result */ - res= -res; - } - for (end= a + a_length-length; a < end ; a++) - { - if (map[*a] != map[' ']) - return (map[*a] < map[' ']) ? -swap : swap; - } - } - return res; -} - - -size_t my_caseup_str_8bit(const CHARSET_INFO *cs,char *str) -{ - const uchar *map= cs->to_upper; - char *str_orig= str; - while ((*str= (char) map[(uchar) *str]) != 0) - str++; - return (size_t) (str - str_orig); -} - - -size_t my_casedn_str_8bit(const CHARSET_INFO *cs,char *str) -{ - const uchar *map= cs->to_lower; - char *str_orig= str; - while ((*str= (char) map[(uchar) *str]) != 0) - str++; - return (size_t) (str - str_orig); -} - - -size_t my_caseup_8bit(const CHARSET_INFO *cs, char *src, size_t srclen, - char *dst MY_ATTRIBUTE((unused)), - size_t dstlen MY_ATTRIBUTE((unused))) -{ - char *end= src + srclen; - const uchar *map= cs->to_upper; - DBUG_ASSERT(src == dst && srclen == dstlen); - for ( ; src != end ; src++) - *src= (char) map[(uchar) *src]; - return srclen; -} - - -size_t my_casedn_8bit(const CHARSET_INFO *cs, char *src, size_t srclen, - char *dst MY_ATTRIBUTE((unused)), - size_t dstlen MY_ATTRIBUTE((unused))) -{ - char *end= src + srclen; - const uchar *map=cs->to_lower; - DBUG_ASSERT(src == dst && srclen == dstlen); - for ( ; src != end ; src++) - *src= (char) map[(uchar) *src]; - return srclen; -} - -int my_strcasecmp_8bit(const CHARSET_INFO *cs,const char *s, const char *t) -{ - const uchar *map=cs->to_upper; - while (map[(uchar) *s] == map[(uchar) *t++]) - if (!*s++) return 0; - return ((int) map[(uchar) s[0]] - (int) map[(uchar) t[-1]]); -} - - -int my_mb_wc_8bit(const CHARSET_INFO *cs,my_wc_t *wc, - const uchar *str, - const uchar *end MY_ATTRIBUTE((unused))) -{ - if (str >= end) - return MY_CS_TOOSMALL; - - *wc=cs->tab_to_uni[*str]; - return (!wc[0] && str[0]) ? -1 : 1; -} - -int my_wc_mb_8bit(const CHARSET_INFO *cs,my_wc_t wc, - uchar *str, - uchar *end) -{ - const MY_UNI_IDX *idx; - - if (str >= end) - return MY_CS_TOOSMALL; - - for (idx=cs->tab_from_uni; idx->tab ; idx++) - { - if (idx->from <= wc && idx->to >= wc) - { - str[0]= idx->tab[wc - idx->from]; - return (!str[0] && wc) ? MY_CS_ILUNI : 1; - } - } - return MY_CS_ILUNI; -} - - -/* - We can't use vsprintf here as it's not guaranteed to return - the length on all operating systems. - This function is also not called in a safe environment, so the - end buffer must be checked. -*/ - -size_t my_snprintf_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - char* to, size_t n MY_ATTRIBUTE((unused)), - const char* fmt, ...) -{ - va_list args; - size_t result; - va_start(args,fmt); - result= my_vsnprintf(to, n, fmt, args); - va_end(args); - return result; -} - - -void my_hash_sort_simple(const CHARSET_INFO *cs, - const uchar *key, size_t len, - ulong *nr1, ulong *nr2) -{ - const uchar *sort_order=cs->sort_order; - const uchar *end; - ulong tmp1; - ulong tmp2; - - /* - Remove end space. We have to do this to be able to compare - 'A ' and 'A' as identical - */ - end= skip_trailing_space(key, len); - - tmp1= *nr1; - tmp2= *nr2; - - for (; key < (uchar*) end ; key++) - { - tmp1^=(ulong) ((((uint) tmp1 & 63) + tmp2) * - ((uint) sort_order[(uint) *key])) + (tmp1 << 8); - tmp2+=3; - } - - *nr1= tmp1; - *nr2= tmp2; -} - - -long my_strntol_8bit(const CHARSET_INFO *cs, - const char *nptr, size_t l, int base, - char **endptr, int *err) -{ - int negative; - uint32 cutoff; - uint cutlim; - uint32 i; - const char *s; - uchar c; - const char *save, *e; - int overflow; - - *err= 0; /* Initialize error indicator */ - - s = nptr; - e = nptr+l; - - for ( ; s<e && my_isspace(cs, *s) ; s++); - - if (s == e) - { - goto noconv; - } - - /* Check for a sign. */ - if (*s == '-') - { - negative = 1; - ++s; - } - else if (*s == '+') - { - negative = 0; - ++s; - } - else - negative = 0; - - save = s; - cutoff = ((uint32)~0L) / (uint32) base; - cutlim = (uint) (((uint32)~0L) % (uint32) base); - - overflow = 0; - i = 0; - for (c = *s; s != e; c = *++s) - { - if (c>='0' && c<='9') - c -= '0'; - else if (c>='A' && c<='Z') - c = c - 'A' + 10; - else if (c>='a' && c<='z') - c = c - 'a' + 10; - else - break; - if (c >= base) - break; - if (i > cutoff || (i == cutoff && c > cutlim)) - overflow = 1; - else - { - i *= (uint32) base; - i += c; - } - } - - if (s == save) - goto noconv; - - if (endptr != NULL) - *endptr = (char *) s; - - if (negative) - { - if (i > (uint32) INT_MIN32) - overflow = 1; - } - else if (i > INT_MAX32) - overflow = 1; - - if (overflow) - { - err[0]= ERANGE; - return negative ? INT_MIN32 : INT_MAX32; - } - - return (negative ? -((long) i) : (long) i); - -noconv: - err[0]= EDOM; - if (endptr != NULL) - *endptr = (char *) nptr; - return 0L; -} - - -ulong my_strntoul_8bit(const CHARSET_INFO *cs, - const char *nptr, size_t l, int base, - char **endptr, int *err) -{ - int negative; - uint32 cutoff; - uint cutlim; - uint32 i; - const char *s; - uchar c; - const char *save, *e; - int overflow; - - *err= 0; /* Initialize error indicator */ - - s = nptr; - e = nptr+l; - - for( ; s<e && my_isspace(cs, *s); s++); - - if (s==e) - { - goto noconv; - } - - if (*s == '-') - { - negative = 1; - ++s; - } - else if (*s == '+') - { - negative = 0; - ++s; - } - else - negative = 0; - - save = s; - cutoff = ((uint32)~0L) / (uint32) base; - cutlim = (uint) (((uint32)~0L) % (uint32) base); - overflow = 0; - i = 0; - - for (c = *s; s != e; c = *++s) - { - if (c>='0' && c<='9') - c -= '0'; - else if (c>='A' && c<='Z') - c = c - 'A' + 10; - else if (c>='a' && c<='z') - c = c - 'a' + 10; - else - break; - if (c >= base) - break; - if (i > cutoff || (i == cutoff && c > cutlim)) - overflow = 1; - else - { - i *= (uint32) base; - i += c; - } - } - - if (s == save) - goto noconv; - - if (endptr != NULL) - *endptr = (char *) s; - - if (overflow) - { - err[0]= ERANGE; - return (~(uint32) 0); - } - - return (negative ? -((long) i) : (long) i); - -noconv: - err[0]= EDOM; - if (endptr != NULL) - *endptr = (char *) nptr; - return 0L; -} - - -longlong my_strntoll_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const char *nptr, size_t l, int base, - char **endptr,int *err) -{ - int negative; - ulonglong cutoff; - uint cutlim; - ulonglong i; - const char *s, *e; - const char *save; - int overflow; - - *err= 0; /* Initialize error indicator */ - - s = nptr; - e = nptr+l; - - for(; s<e && my_isspace(cs,*s); s++); - - if (s == e) - { - goto noconv; - } - - if (*s == '-') - { - negative = 1; - ++s; - } - else if (*s == '+') - { - negative = 0; - ++s; - } - else - negative = 0; - - save = s; - - cutoff = (~(ulonglong) 0) / (unsigned long int) base; - cutlim = (uint) ((~(ulonglong) 0) % (unsigned long int) base); - - overflow = 0; - i = 0; - for ( ; s != e; s++) - { - uchar c= *s; - if (c>='0' && c<='9') - c -= '0'; - else if (c>='A' && c<='Z') - c = c - 'A' + 10; - else if (c>='a' && c<='z') - c = c - 'a' + 10; - else - break; - if (c >= base) - break; - if (i > cutoff || (i == cutoff && c > cutlim)) - overflow = 1; - else - { - i *= (ulonglong) base; - i += c; - } - } - - if (s == save) - goto noconv; - - if (endptr != NULL) - *endptr = (char *) s; - - if (negative) - { - if (i > (ulonglong) LLONG_MIN) - overflow = 1; - } - else if (i > (ulonglong) LLONG_MAX) - overflow = 1; - - if (overflow) - { - err[0]= ERANGE; - return negative ? LLONG_MIN : LLONG_MAX; - } - - return (negative ? -((longlong) i) : (longlong) i); - -noconv: - err[0]= EDOM; - if (endptr != NULL) - *endptr = (char *) nptr; - return 0L; -} - - -ulonglong my_strntoull_8bit(const CHARSET_INFO *cs, - const char *nptr, size_t l, int base, - char **endptr, int *err) -{ - int negative; - ulonglong cutoff; - uint cutlim; - ulonglong i; - const char *s, *e; - const char *save; - int overflow; - - *err= 0; /* Initialize error indicator */ - - s = nptr; - e = nptr+l; - - for(; s<e && my_isspace(cs,*s); s++); - - if (s == e) - { - goto noconv; - } - - if (*s == '-') - { - negative = 1; - ++s; - } - else if (*s == '+') - { - negative = 0; - ++s; - } - else - negative = 0; - - save = s; - - cutoff = (~(ulonglong) 0) / (unsigned long int) base; - cutlim = (uint) ((~(ulonglong) 0) % (unsigned long int) base); - - overflow = 0; - i = 0; - for ( ; s != e; s++) - { - uchar c= *s; - - if (c>='0' && c<='9') - c -= '0'; - else if (c>='A' && c<='Z') - c = c - 'A' + 10; - else if (c>='a' && c<='z') - c = c - 'a' + 10; - else - break; - if (c >= base) - break; - if (i > cutoff || (i == cutoff && c > cutlim)) - overflow = 1; - else - { - i *= (ulonglong) base; - i += c; - } - } - - if (s == save) - goto noconv; - - if (endptr != NULL) - *endptr = (char *) s; - - if (overflow) - { - err[0]= ERANGE; - return (~(ulonglong) 0); - } - - return (negative ? -((longlong) i) : (longlong) i); - -noconv: - err[0]= EDOM; - if (endptr != NULL) - *endptr = (char *) nptr; - return 0L; -} - - -/* - Read double from string - - SYNOPSIS: - my_strntod_8bit() - cs Character set information - str String to convert to double - length Optional length for string. - end result pointer to end of converted string - err Error number if failed conversion - - NOTES: - If length is not INT_MAX32 or str[length] != 0 then the given str must - be writeable - If length == INT_MAX32 the str must be \0 terminated. - - It's implemented this way to save a buffer allocation and a memory copy. - - RETURN - Value of number in string -*/ - - -double my_strntod_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - char *str, size_t length, - char **end, int *err) -{ - if (length == INT_MAX32) - length= 65535; /* Should be big enough */ - *end= str + length; - return my_strtod(str, end, err); -} - - -/* - This is a fast version optimized for the case of radix 10 / -10 - - Assume len >= 1 -*/ - -size_t my_long10_to_str_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - char *dst, size_t len, int radix, long int val) -{ - char buffer[66]; - char *p, *e; - long int new_val; - uint sign=0; - unsigned long int uval = (unsigned long int) val; - - e = p = &buffer[sizeof(buffer)-1]; - *p= 0; - - if (radix < 0) - { - if (val < 0) - { - /* Avoid integer overflow in (-val) for LLONG_MIN (BUG#31799). */ - uval= (unsigned long int)0 - uval; - *dst++= '-'; - len--; - sign= 1; - } - } - - new_val = (long) (uval / 10); - *--p = '0'+ (char) (uval - (unsigned long) new_val * 10); - val = new_val; - - while (val != 0) - { - new_val=val/10; - *--p = '0' + (char) (val-new_val*10); - val= new_val; - } - - len= MY_MIN(len, (size_t) (e-p)); - memcpy(dst, p, len); - return len+sign; -} - - -size_t my_longlong10_to_str_8bit(const CHARSET_INFO *cs - MY_ATTRIBUTE((unused)), - char *dst, size_t len, int radix, - longlong val) -{ - char buffer[65]; - char *p, *e; - long long_val; - uint sign= 0; - ulonglong uval = (ulonglong)val; - - if (radix < 0) - { - if (val < 0) - { - /* Avoid integer overflow in (-val) for LLONG_MIN (BUG#31799). */ - uval = (ulonglong)0 - uval; - *dst++= '-'; - len--; - sign= 1; - } - } - - e = p = &buffer[sizeof(buffer)-1]; - *p= 0; - - if (uval == 0) - { - *--p= '0'; - len= 1; - goto cnv; - } - - while (uval > (ulonglong) LONG_MAX) - { - ulonglong quo= uval/(uint) 10; - uint rem= (uint) (uval- quo* (uint) 10); - *--p = '0' + rem; - uval= quo; - } - - long_val= (long) uval; - while (long_val != 0) - { - long quo= long_val/10; - *--p = (char) ('0' + (long_val - quo*10)); - long_val= quo; - } - - len= MY_MIN(len, (size_t) (e-p)); -cnv: - memcpy(dst, p, len); - return len+sign; -} - - -/* -** Compare string against string with wildcard -** 0 if matched -** -1 if not matched with wildcard -** 1 if matched with wildcard -*/ - -#define likeconv(s,A) (uchar) (s)->sort_order[(uchar) (A)] -#define INC_PTR(cs,A,B) (A)++ - -static -int my_wildcmp_8bit_impl(const CHARSET_INFO *cs, - const char *str,const char *str_end, - const char *wildstr,const char *wildend, - int escape, int w_one, int w_many, int recurse_level) -{ - int result= -1; /* Not found, using wildcards */ - - if (my_string_stack_guard && my_string_stack_guard(recurse_level)) - return 1; - while (wildstr != wildend) - { - while (*wildstr != w_many && *wildstr != w_one) - { - if (*wildstr == escape && wildstr+1 != wildend) - wildstr++; - - if (str == str_end || likeconv(cs,*wildstr++) != likeconv(cs,*str++)) - return(1); /* No match */ - if (wildstr == wildend) - return(str != str_end); /* Match if both are at end */ - result=1; /* Found an anchor char */ - } - if (*wildstr == w_one) - { - do - { - if (str == str_end) /* Skip one char if possible */ - return(result); - INC_PTR(cs,str,str_end); - } while (++wildstr < wildend && *wildstr == w_one); - if (wildstr == wildend) - break; - } - if (*wildstr == w_many) - { /* Found w_many */ - uchar cmp; - - wildstr++; - /* Remove any '%' and '_' from the wild search string */ - for (; wildstr != wildend ; wildstr++) - { - if (*wildstr == w_many) - continue; - if (*wildstr == w_one) - { - if (str == str_end) - return(-1); - INC_PTR(cs,str,str_end); - continue; - } - break; /* Not a wild character */ - } - if (wildstr == wildend) - return(0); /* Ok if w_many is last */ - if (str == str_end) - return(-1); - - if ((cmp= *wildstr) == escape && wildstr+1 != wildend) - cmp= *++wildstr; - - INC_PTR(cs,wildstr,wildend); /* This is compared trough cmp */ - cmp=likeconv(cs,cmp); - do - { - while (str != str_end && (uchar) likeconv(cs,*str) != cmp) - str++; - if (str++ == str_end) return(-1); - { - int tmp=my_wildcmp_8bit_impl(cs,str,str_end, - wildstr,wildend,escape,w_one, - w_many, recurse_level + 1); - if (tmp <= 0) - return(tmp); - } - } while (str != str_end && wildstr[0] != w_many); - return(-1); - } - } - return(str != str_end ? 1 : 0); -} - -int my_wildcmp_8bit(const CHARSET_INFO *cs, - const char *str,const char *str_end, - const char *wildstr,const char *wildend, - int escape, int w_one, int w_many) -{ - return my_wildcmp_8bit_impl(cs, str, str_end, - wildstr, wildend, - escape, w_one, w_many, 1); -} - - -/* -** Calculate min_str and max_str that ranges a LIKE string. -** Arguments: -** ptr Pointer to LIKE string. -** ptr_length Length of LIKE string. -** escape Escape character in LIKE. (Normally '\'). -** All escape characters should be removed from min_str and max_str -** res_length Length of min_str and max_str. -** min_str Smallest case sensitive string that ranges LIKE. -** Should be space padded to res_length. -** max_str Largest case sensitive string that ranges LIKE. -** Normally padded with the biggest character sort value. -** -** The function should return 0 if ok and 1 if the LIKE string can't be -** optimized ! -*/ - -my_bool my_like_range_simple(const CHARSET_INFO *cs, - const char *ptr, size_t ptr_length, - pbool escape, pbool w_one, pbool w_many, - size_t res_length, - char *min_str,char *max_str, - size_t *min_length, size_t *max_length) -{ - const char *end= ptr + ptr_length; - char *min_org=min_str; - char *min_end=min_str+res_length; - size_t charlen= res_length / cs->mbmaxlen; - - for (; ptr != end && min_str != min_end && charlen > 0 ; ptr++, charlen--) - { - if (*ptr == escape && ptr+1 != end) - { - ptr++; /* Skip escape */ - *min_str++= *max_str++ = *ptr; - continue; - } - if (*ptr == w_one) /* '_' in SQL */ - { - *min_str++='\0'; /* This should be min char */ - *max_str++= (char) cs->max_sort_char; - continue; - } - if (*ptr == w_many) /* '%' in SQL */ - { - /* Calculate length of keys */ - *min_length= ((cs->state & MY_CS_BINSORT) ? - (size_t) (min_str - min_org) : - res_length); - *max_length= res_length; - do - { - *min_str++= 0; - *max_str++= (char) cs->max_sort_char; - } while (min_str != min_end); - return 0; - } - *min_str++= *max_str++ = *ptr; - } - - *min_length= *max_length = (size_t) (min_str - min_org); - while (min_str != min_end) - *min_str++= *max_str++ = ' '; /* Because if key compression */ - return 0; -} - - -size_t my_scan_8bit(const CHARSET_INFO *cs, const char *str, const char *end, - int sq) -{ - const char *str0= str; - switch (sq) - { - case MY_SEQ_INTTAIL: - if (*str == '.') - { - for(str++ ; str != end && *str == '0' ; str++); - return (size_t) (str - str0); - } - return 0; - - case MY_SEQ_SPACES: - for ( ; str < end ; str++) - { - if (!my_isspace(cs,*str)) - break; - } - return (size_t) (str - str0); - default: - return 0; - } -} - - -void my_fill_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - char *s, size_t l, int fill) -{ - memset(s, fill, l); -} - - -size_t my_numchars_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const char *b, const char *e) -{ - return (size_t) (e - b); -} - - -size_t my_numcells_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const char *b, const char *e) -{ - return (size_t) (e - b); -} - - -size_t my_charpos_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const char *b MY_ATTRIBUTE((unused)), - const char *e MY_ATTRIBUTE((unused)), - size_t pos) -{ - return pos; -} - - -size_t my_well_formed_len_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const char *start, const char *end, - size_t nchars, int *error) -{ - size_t nbytes= (size_t) (end-start); - *error= 0; - return MY_MIN(nbytes, nchars); -} - - -size_t my_lengthsp_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const char *ptr, size_t length) -{ - const char *end; - end= (const char *) skip_trailing_space((const uchar *)ptr, length); - return (size_t) (end-ptr); -} - - -uint my_instr_simple(const CHARSET_INFO *cs, - const char *b, size_t b_length, - const char *s, size_t s_length, - my_match_t *match, uint nmatch) -{ - const uchar *str, *search, *end, *search_end; - - if (s_length <= b_length) - { - if (!s_length) - { - if (nmatch) - { - match->beg= 0; - match->end= 0; - match->mb_len= 0; - } - return 1; /* Empty string is always found */ - } - - str= (const uchar*) b; - search= (const uchar*) s; - end= (const uchar*) b+b_length-s_length+1; - search_end= (const uchar*) s + s_length; - -skip: - while (str != end) - { - if (cs->sort_order[*str++] == cs->sort_order[*search]) - { - const uchar *i,*j; - - i= str; - j= search+1; - - while (j != search_end) - if (cs->sort_order[*i++] != cs->sort_order[*j++]) - goto skip; - - if (nmatch > 0) - { - match[0].beg= 0; - match[0].end= (uint) (str- (const uchar*)b-1); - match[0].mb_len= match[0].end; - - if (nmatch > 1) - { - match[1].beg= match[0].end; - match[1].end= match[0].end + (uint)s_length; - match[1].mb_len= match[1].end-match[1].beg; - } - } - return 2; - } - } - } - return 0; -} - -size_t my_well_formed_len_ascii(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const char *start, const char *end, - size_t nchars, int *error) -{ - /** - @todo: Currently return warning on invalid character. - Return error in future release. - */ - const char* oldstart = start; - *error= 0; - while (start < end) - { - if ((*start & 0x80) != 0) - { - *error = 1; - break; - } - start++; - } - return MY_MIN((size_t)(end - oldstart), nchars); -} - -typedef struct -{ - int nchars; - MY_UNI_IDX uidx; -} uni_idx; - -#define PLANE_SIZE 0x100 -#define PLANE_NUM 0x100 -#define PLANE_NUMBER(x) (((x)>>8) % PLANE_NUM) - -static int pcmp(const void * f, const void * s) -{ - const uni_idx *F= (const uni_idx*) f; - const uni_idx *S= (const uni_idx*) s; - int res; - - if (!(res=((S->nchars)-(F->nchars)))) - res=((F->uidx.from)-(S->uidx.to)); - return res; -} - -static my_bool -create_fromuni(CHARSET_INFO *cs, - MY_CHARSET_LOADER *loader) -{ - uni_idx idx[PLANE_NUM]; - int i,n; - MY_UNI_IDX *tab_from_uni; - - /* - Check that Unicode map is loaded. - It can be not loaded when the collation is - listed in Index.xml but not specified - in the character set specific XML file. - */ - if (!cs->tab_to_uni) - return TRUE; - - /* Clear plane statistics */ - memset(idx, 0, sizeof(idx)); - - /* Count number of characters in each plane */ - for (i=0; i< 0x100; i++) - { - uint16 wc=cs->tab_to_uni[i]; - int pl= PLANE_NUMBER(wc); - - if (wc || !i) - { - if (!idx[pl].nchars) - { - idx[pl].uidx.from=wc; - idx[pl].uidx.to=wc; - }else - { - idx[pl].uidx.from=wc<idx[pl].uidx.from?wc:idx[pl].uidx.from; - idx[pl].uidx.to=wc>idx[pl].uidx.to?wc:idx[pl].uidx.to; - } - idx[pl].nchars++; - } - } - - /* Sort planes in descending order */ - qsort(&idx,PLANE_NUM,sizeof(uni_idx),&pcmp); - - for (i=0; i < PLANE_NUM; i++) - { - int ch,numchars; - uchar *tab; - - /* Skip empty plane */ - if (!idx[i].nchars) - break; - - numchars=idx[i].uidx.to-idx[i].uidx.from+1; - if (!(idx[i].uidx.tab= tab= (uchar *) - (loader->once_alloc) - (numchars * sizeof(*idx[i].uidx.tab)))) - return TRUE; - - memset(tab, 0, numchars*sizeof(*idx[i].uidx.tab)); - - for (ch=1; ch < PLANE_SIZE; ch++) - { - uint16 wc=cs->tab_to_uni[ch]; - if (wc >= idx[i].uidx.from && wc <= idx[i].uidx.to && wc) - { - int ofs= wc - idx[i].uidx.from; - /* - Character sets like armscii8 may have two code points for - one character. When converting from UNICODE back to - armscii8, select the lowest one, which is in the ASCII - range. - */ - if (tab[ofs] == '\0') - tab[ofs]= ch; - } - } - } - - /* Allocate and fill reverse table for each plane */ - n=i; - if (!(cs->tab_from_uni= tab_from_uni= (MY_UNI_IDX *) - (loader->once_alloc) - (sizeof(MY_UNI_IDX) * (n + 1)))) - return TRUE; - - for (i=0; i< n; i++) - tab_from_uni[i]= idx[i].uidx; - - /* Set end-of-list marker */ - memset(&tab_from_uni[i], 0, sizeof(MY_UNI_IDX)); - return FALSE; -} - -static my_bool -my_cset_init_8bit(CHARSET_INFO *cs, MY_CHARSET_LOADER *loader) -{ - cs->caseup_multiply= 1; - cs->casedn_multiply= 1; - cs->pad_char= ' '; - return create_fromuni(cs, loader); -} - -static void set_max_sort_char(CHARSET_INFO *cs) -{ - uchar max_char; - uint i; - - if (!cs->sort_order) - return; - - max_char=cs->sort_order[(uchar) cs->max_sort_char]; - for (i= 0; i < 256; i++) - { - if ((uchar) cs->sort_order[i] > max_char) - { - max_char=(uchar) cs->sort_order[i]; - cs->max_sort_char= i; - } - } -} - -static my_bool -my_coll_init_simple(CHARSET_INFO *cs, - MY_CHARSET_LOADER *loader MY_ATTRIBUTE((unused))) -{ - set_max_sort_char(cs); - return FALSE; -} - - -longlong my_strtoll10_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const char *nptr, char **endptr, int *error) -{ - return my_strtoll10(nptr, endptr, error); -} - - -int my_mb_ctype_8bit(const CHARSET_INFO *cs, int *ctype, - const uchar *s, const uchar *e) -{ - if (s >= e) - { - *ctype= 0; - return MY_CS_TOOSMALL; - } - *ctype= cs->ctype[*s + 1]; - return 1; -} - - -#define CUTOFF (ULLONG_MAX / 10) -#define CUTLIM (ULLONG_MAX % 10) -#define DIGITS_IN_ULONGLONG 20 - -static ulonglong d10[DIGITS_IN_ULONGLONG]= -{ - 1, - 10, - 100, - 1000, - 10000, - 100000, - 1000000, - 10000000, - 100000000, - 1000000000, - 10000000000ULL, - 100000000000ULL, - 1000000000000ULL, - 10000000000000ULL, - 100000000000000ULL, - 1000000000000000ULL, - 10000000000000000ULL, - 100000000000000000ULL, - 1000000000000000000ULL, - 10000000000000000000ULL -}; - - -/* - - Convert a string to unsigned long long integer value - with rounding. - - SYNOPSYS - my_strntoull10_8bit() - cs in pointer to character set - str in pointer to the string to be converted - length in string length - unsigned_flag in whether the number is unsigned - endptr out pointer to the stop character - error out returned error code - - DESCRIPTION - This function takes the decimal representation of integer number - from string str and converts it to an signed or unsigned - long long integer value. - Space characters and tab are ignored. - A sign character might precede the digit characters. - The number may have any number of pre-zero digits. - The number may have decimal point and exponent. - Rounding is always done in "away from zero" style: - 0.5 -> 1 - -0.5 -> -1 - - The function stops reading the string str after "length" bytes - or at the first character that is not a part of correct number syntax: - - <signed numeric literal> ::= - [ <sign> ] <exact numeric literal> [ E [ <sign> ] <unsigned integer> ] - - <exact numeric literal> ::= - <unsigned integer> [ <period> [ <unsigned integer> ] ] - | <period> <unsigned integer> - <unsigned integer> ::= <digit>... - - RETURN VALUES - Value of string as a signed/unsigned longlong integer - - endptr cannot be NULL. The function will store the end pointer - to the stop character here. - - The error parameter contains information how things went: - 0 ok - ERANGE If the the value of the converted number is out of range - In this case the return value is: - - ULLONG_MAX if unsigned_flag and the number was too big - - 0 if unsigned_flag and the number was negative - - LLONG_MAX if no unsigned_flag and the number is too big - - LLONG_MIN if no unsigned_flag and the number it too big negative - - EDOM If the string didn't contain any digits. - In this case the return value is 0. -*/ - -ulonglong -my_strntoull10rnd_8bit(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const char *str, size_t length, int unsigned_flag, - char **endptr, int *error) -{ - const char *dot, *end9, *beg, *end= str + length; - ulonglong ull; - ulong ul; - uchar ch; - int shift= 0, digits= 0, negative, addon; - - /* Skip leading spaces and tabs */ - for ( ; str < end && (*str == ' ' || *str == '\t') ; str++); - - if (str >= end) - goto ret_edom; - - if ((negative= (*str == '-')) || *str=='+') /* optional sign */ - { - if (++str == end) - goto ret_edom; - } - - beg= str; - end9= (str + 9) > end ? end : (str + 9); - /* Accumulate small number into ulong, for performance purposes */ - for (ul= 0 ; str < end9 && (ch= (uchar) (*str - '0')) < 10; str++) - { - ul= ul * 10 + ch; - } - - if (str >= end) /* Small number without dots and expanents */ - { - *endptr= (char*) str; - if (negative) - { - if (unsigned_flag) - { - *error= ul ? MY_ERRNO_ERANGE : 0; - return 0; - } - else - { - *error= 0; - return (ulonglong) (longlong) -(long) ul; - } - } - else - { - *error=0; - return (ulonglong) ul; - } - } - - digits= (int)(str - beg); - - /* Continue to accumulate into ulonglong */ - for (dot= NULL, ull= ul; str < end; str++) - { - if ((ch= (uchar) (*str - '0')) < 10) - { - if (ull < CUTOFF || (ull == CUTOFF && ch <= CUTLIM)) - { - ull= ull * 10 + ch; - digits++; - continue; - } - /* - Adding the next digit would overflow. - Remember the next digit in "addon", for rounding. - Scan all digits with an optional single dot. - */ - if (ull == CUTOFF) - { - ull= ULLONG_MAX; - addon= 1; - str++; - } - else - addon= (*str >= '5'); - if (!dot) - { - for ( ; str < end && (ch= (uchar) (*str - '0')) < 10; shift++, str++); - if (str < end && *str == '.') - { - str++; - for ( ; str < end && (ch= (uchar) (*str - '0')) < 10; str++); - } - } - else - { - shift= (int)(dot - str); - for ( ; str < end && (ch= (uchar) (*str - '0')) < 10; str++); - } - goto exp; - } - - if (*str == '.') - { - if (dot) - { - /* The second dot character */ - addon= 0; - goto exp; - } - else - { - dot= str + 1; - } - continue; - } - - /* Unknown character, exit the loop */ - break; - } - shift= dot ? (int)(dot - str) : 0; /* Right shift */ - addon= 0; - -exp: /* [ E [ <sign> ] <unsigned integer> ] */ - - if (!digits) - { - str= beg; - goto ret_edom; - } - - if (str < end && (*str == 'e' || *str == 'E')) - { - str++; - if (str < end) - { - int negative_exp, exponent; - if ((negative_exp= (*str == '-')) || *str=='+') - { - if (++str == end) - goto ret_sign; - } - for (exponent= 0 ; - str < end && (ch= (uchar) (*str - '0')) < 10; - str++) - { - exponent= exponent * 10 + ch; - } - shift+= negative_exp ? -exponent : exponent; - } - } - - if (shift == 0) /* No shift, check addon digit */ - { - if (addon) - { - if (ull == ULLONG_MAX) - goto ret_too_big; - ull++; - } - goto ret_sign; - } - - if (shift < 0) /* Right shift */ - { - ulonglong d, r; - - if (-shift >= DIGITS_IN_ULONGLONG) - goto ret_zero; /* Exponent is a big negative number, return 0 */ - - d= d10[-shift]; - r= (ull % d) * 2; - ull /= d; - if (r >= d) - ull++; - goto ret_sign; - } - - if (shift > DIGITS_IN_ULONGLONG) /* Huge left shift */ - { - if (!ull) - goto ret_sign; - goto ret_too_big; - } - - for ( ; shift > 0; shift--, ull*= 10) /* Left shift */ - { - if (ull > CUTOFF) - goto ret_too_big; /* Overflow, number too big */ - } - -ret_sign: - *endptr= (char*) str; - - if (!unsigned_flag) - { - if (negative) - { - if (ull > (ulonglong) LLONG_MIN) - { - *error= MY_ERRNO_ERANGE; - return (ulonglong) LLONG_MIN; - } - *error= 0; - return (ulonglong) -(longlong) ull; - } - else - { - if (ull > (ulonglong) LLONG_MAX) - { - *error= MY_ERRNO_ERANGE; - return (ulonglong) LLONG_MAX; - } - *error= 0; - return ull; - } - } - - /* Unsigned number */ - if (negative && ull) - { - *error= MY_ERRNO_ERANGE; - return 0; - } - *error= 0; - return ull; - -ret_zero: - *endptr= (char*) str; - *error= 0; - return 0; - -ret_edom: - *endptr= (char*) str; - *error= MY_ERRNO_EDOM; - return 0; - -ret_too_big: - *endptr= (char*) str; - *error= MY_ERRNO_ERANGE; - return unsigned_flag ? - ULLONG_MAX : - negative ? (ulonglong) LLONG_MIN : (ulonglong) LLONG_MAX; -} - - -/* - Check if a constant can be propagated - - SYNOPSIS: - my_propagate_simple() - cs Character set information - str String to convert to double - length Optional length for string. - - NOTES: - Takes the string in the given charset and check - if it can be safely propagated in the optimizer. - - create table t1 ( - s char(5) character set latin1 collate latin1_german2_ci); - insert into t1 values (0xf6); -- o-umlaut - select * from t1 where length(s)=1 and s='oe'; - - The above query should return one row. - We cannot convert this query into: - select * from t1 where length('oe')=1 and s='oe'; - - Currently we don't check the constant itself, - and decide not to propagate a constant - just if the collation itself allows tricky things - like expansions and contractions. In the future - we can write a more sophisticated functions to - check the constants. For example, 'oa' can always - be safety propagated in German2 because unlike - 'oe' it does not have any special meaning. - - RETURN - 1 if constant can be safely propagated - 0 if it is not safe to propagate the constant -*/ - - - -my_bool my_propagate_simple(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const uchar *str MY_ATTRIBUTE((unused)), - size_t length MY_ATTRIBUTE((unused))) -{ - return 1; -} - - -my_bool my_propagate_complex(const CHARSET_INFO *cs MY_ATTRIBUTE((unused)), - const uchar *str MY_ATTRIBUTE((unused)), - size_t length MY_ATTRIBUTE((unused))) -{ - return 0; -} - - -/* - Normalize strxfrm flags - - SYNOPSIS: - my_strxfrm_flag_normalize() - flags - non-normalized flags - nlevels - number of levels - - NOTES: - If levels are omitted, then 1-maximum is assumed. - If any level number is greater than the maximum, - it is treated as the maximum. - - RETURN - normalized flags -*/ - -uint my_strxfrm_flag_normalize(uint flags, uint maximum) -{ - DBUG_ASSERT(maximum >= 1 && maximum <= MY_STRXFRM_NLEVELS); - - /* If levels are omitted, then 1-maximum is assumed*/ - if (!(flags & MY_STRXFRM_LEVEL_ALL)) - { - static uint def_level_flags[]= {0, 0x01, 0x03, 0x07, 0x0F, 0x1F, 0x3F }; - uint flag_pad= flags & - (MY_STRXFRM_PAD_WITH_SPACE | MY_STRXFRM_PAD_TO_MAXLEN); - flags= def_level_flags[maximum] | flag_pad; - } - else - { - uint i; - uint flag_lev= flags & MY_STRXFRM_LEVEL_ALL; - uint flag_dsc= (flags >> MY_STRXFRM_DESC_SHIFT) & MY_STRXFRM_LEVEL_ALL; - uint flag_rev= (flags >> MY_STRXFRM_REVERSE_SHIFT) & MY_STRXFRM_LEVEL_ALL; - uint flag_pad= flags & - (MY_STRXFRM_PAD_WITH_SPACE | MY_STRXFRM_PAD_TO_MAXLEN); - - /* - If any level number is greater than the maximum, - it is treated as the maximum. - */ - for (maximum--, flags= 0, i= 0; i < MY_STRXFRM_NLEVELS; i++) - { - uint src_bit= 1 << i; - if (flag_lev & src_bit) - { - uint dst_bit= 1 << MY_MIN(i, maximum); - flags|= dst_bit; - flags|= (flag_dsc & dst_bit) << MY_STRXFRM_DESC_SHIFT; - flags|= (flag_rev & dst_bit) << MY_STRXFRM_REVERSE_SHIFT; - } - } - flags|= flag_pad; - } - - return flags; -} - - -/* - Apply DESC and REVERSE collation rules. - - SYNOPSIS: - my_strxfrm_desc_and_reverse() - str - pointer to string - strend - end of string - flags - flags - level - which level, starting from 0. - - NOTES: - Apply DESC or REVERSE or both flags. - - If DESC flag is given, then the weights - come out NOTed or negated for that level. - - If REVERSE flags is given, then the weights come out in - reverse order for that level, that is, starting with - the last character and ending with the first character. - - If nether DESC nor REVERSE flags are give, - the string is not changed. - -*/ -void -my_strxfrm_desc_and_reverse(uchar *str, uchar *strend, - uint flags, uint level) -{ - if (flags & (MY_STRXFRM_DESC_LEVEL1 << level)) - { - if (flags & (MY_STRXFRM_REVERSE_LEVEL1 << level)) - { - for (strend--; str <= strend;) - { - uchar tmp= *str; - *str++= ~*strend; - *strend--= ~tmp; - } - } - else - { - for (; str < strend; str++) - *str= ~*str; - } - } - else if (flags & (MY_STRXFRM_REVERSE_LEVEL1 << level)) - { - for (strend--; str < strend;) - { - uchar tmp= *str; - *str++= *strend; - *strend--= tmp; - } - } -} - - -size_t -my_strxfrm_pad_desc_and_reverse(const CHARSET_INFO *cs, - uchar *str, uchar *frmend, uchar *strend, - uint nweights, uint flags, uint level) -{ - if (nweights && frmend < strend && (flags & MY_STRXFRM_PAD_WITH_SPACE)) - { - uint fill_length= MY_MIN((uint) (strend - frmend), nweights * cs->mbminlen); - cs->cset->fill(cs, (char*) frmend, fill_length, cs->pad_char); - frmend+= fill_length; - } - my_strxfrm_desc_and_reverse(str, frmend, flags, level); - if ((flags & MY_STRXFRM_PAD_TO_MAXLEN) && frmend < strend) - { - size_t fill_length= strend - frmend; - cs->cset->fill(cs, (char*) frmend, fill_length, cs->pad_char); - frmend= strend; - } - return frmend - str; -} - - -MY_CHARSET_HANDLER my_charset_8bit_handler= -{ - my_cset_init_8bit, - NULL, /* ismbchar */ - my_mbcharlen_8bit, /* mbcharlen */ - my_numchars_8bit, - my_charpos_8bit, - my_well_formed_len_8bit, - my_lengthsp_8bit, - my_numcells_8bit, - my_mb_wc_8bit, - my_wc_mb_8bit, - my_mb_ctype_8bit, - my_caseup_str_8bit, - my_casedn_str_8bit, - my_caseup_8bit, - my_casedn_8bit, - my_snprintf_8bit, - my_long10_to_str_8bit, - my_longlong10_to_str_8bit, - my_fill_8bit, - my_strntol_8bit, - my_strntoul_8bit, - my_strntoll_8bit, - my_strntoull_8bit, - my_strntod_8bit, - my_strtoll10_8bit, - my_strntoull10rnd_8bit, - my_scan_8bit -}; - -MY_CHARSET_HANDLER my_charset_ascii_handler= -{ - my_cset_init_8bit, - NULL, /* ismbchar */ - my_mbcharlen_8bit, /* mbcharlen */ - my_numchars_8bit, - my_charpos_8bit, - my_well_formed_len_ascii, - my_lengthsp_8bit, - my_numcells_8bit, - my_mb_wc_8bit, - my_wc_mb_8bit, - my_mb_ctype_8bit, - my_caseup_str_8bit, - my_casedn_str_8bit, - my_caseup_8bit, - my_casedn_8bit, - my_snprintf_8bit, - my_long10_to_str_8bit, - my_longlong10_to_str_8bit, - my_fill_8bit, - my_strntol_8bit, - my_strntoul_8bit, - my_strntoll_8bit, - my_strntoull_8bit, - my_strntod_8bit, - my_strtoll10_8bit, - my_strntoull10rnd_8bit, - my_scan_8bit -}; - -MY_COLLATION_HANDLER my_collation_8bit_simple_ci_handler = -{ - my_coll_init_simple, /* init */ - my_strnncoll_simple, - my_strnncollsp_simple, - my_strnxfrm_simple, - my_strnxfrmlen_simple, - my_like_range_simple, - my_wildcmp_8bit, - my_strcasecmp_8bit, - my_instr_simple, - my_hash_sort_simple, - my_propagate_simple -}; |