release/src/router/mysql/strings/longlong2str.c

   1 /* Copyright (c) 2000, 2001, 2004, 2007 MySQL AB
   2    Use is subject to license terms.
   3
   4    This program is free software; you can redistribute it and/or modify
   5    it under the terms of the GNU General Public License as published by
   6    the Free Software Foundation; version 2 of the License.
   7
   8    This program is distributed in the hope that it will be useful,
   9    but WITHOUT ANY WARRANTY; without even the implied warranty of
  10    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  11    GNU General Public License for more details.
  12
  13    You should have received a copy of the GNU General Public License
  14    along with this program; if not, write to the Free Software
  15    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301  USA
  16 */
  17
  18 /*
  19   Defines: longlong2str();
  20
  21   longlong2str(dst, radix, val)
  22   converts the (longlong) integer "val" to character form and moves it to
  23   the destination string "dst" followed by a terminating NUL.  The
  24   result is normally a pointer to this NUL character, but if the radix
  25   is dud the result will be NullS and nothing will be changed.
  26
  27   If radix is -2..-36, val is taken to be SIGNED.
  28   If radix is  2.. 36, val is taken to be UNSIGNED.
  29   That is, val is signed if and only if radix is.  You will normally
  30   use radix -10 only through itoa and ltoa, for radix 2, 8, or 16
  31   unsigned is what you generally want.
  32
  33   _dig_vec is public just in case someone has a use for it.
  34   The definitions of itoa and ltoa are actually macros in m_string.h,
  35   but this is where the code is.
  36
  37   Note: The standard itoa() returns a pointer to the argument, when int2str
  38         returns the pointer to the end-null.
  39         itoa assumes that 10 -base numbers are allways signed and other arn't.
  40 */
  41
  42 #include <my_global.h>
  43 #include "m_string.h"
  44
  45 #if defined(HAVE_LONG_LONG) && !defined(longlong2str) && !defined(HAVE_LONGLONG2STR)
  46
  47 /*
  48   This assumes that longlong multiplication is faster than longlong division.
  49 */
  50
  51 char *longlong2str(longlong val,char *dst,int radix)
  52 {
  53   char buffer[65];
  54   register char *p;
  55   long long_val;
  56   ulonglong uval= (ulonglong) val;
  57
  58   if (radix < 0)
  59   {
  60     if (radix < -36 || radix > -2) return (char*) 0;
  61     if (val < 0) {
  62       *dst++ = '-';
  63       /* Avoid integer overflow in (-val) for LONGLONG_MIN (BUG#31799). */
  64       uval = (ulonglong)0 - uval;
  65     }
  66     radix = -radix;
  67   }
  68   else
  69   {
  70     if (radix > 36 || radix < 2) return (char*) 0;
  71   }
  72   if (uval == 0)
  73   {
  74     *dst++='0';
  75     *dst='\0';
  76     return dst;
  77   }
  78   p = &buffer[sizeof(buffer)-1];
  79   *p = '\0';
  80
  81   while (uval > (ulonglong) LONG_MAX)
  82   {
  83     ulonglong quo= uval/(uint) radix;
  84     uint rem= (uint) (uval- quo* (uint) radix);
  85     *--p = _dig_vec_upper[rem];
  86     uval= quo;
  87   }
  88   long_val= (long) uval;
  89   while (long_val != 0)
  90   {
  91     long quo= long_val/radix;
  92     *--p = _dig_vec_upper[(uchar) (long_val - quo*radix)];
  93     long_val= quo;
  94   }
  95   while ((*dst++ = *p++) != 0) ;
  96   return dst-1;
  97 }
  98
  99 #endif
 100
 101 #ifndef longlong10_to_str
 102 char *longlong10_to_str(longlong val,char *dst,int radix)
 103 {
 104   char buffer[65];
 105   register char *p;
 106   long long_val;
 107   ulonglong uval= (ulonglong) val;
 108
 109   if (radix < 0)
 110   {
 111     if (val < 0)
 112     {
 113       *dst++ = '-';
 114       /* Avoid integer overflow in (-val) for LONGLONG_MIN (BUG#31799). */
 115       uval = (ulonglong)0 - uval;
 116     }
 117   }
 118
 119   if (uval == 0)
 120   {
 121     *dst++='0';
 122     *dst='\0';
 123     return dst;
 124   }
 125   p = &buffer[sizeof(buffer)-1];
 126   *p = '\0';
 127
 128   while (uval > (ulonglong) LONG_MAX)
 129   {
 130     ulonglong quo= uval/(uint) 10;
 131     uint rem= (uint) (uval- quo* (uint) 10);
 132     *--p = _dig_vec_upper[rem];
 133     uval= quo;
 134   }
 135   long_val= (long) uval;
 136   while (long_val != 0)
 137   {
 138     long quo= long_val/10;
 139     *--p = _dig_vec_upper[(uchar) (long_val - quo*10)];
 140     long_val= quo;
 141   }
 142   while ((*dst++ = *p++) != 0) ;
 143   return dst-1;
 144 }
 145 #endif