Subversion Repositories HelenOS-historic

Rev

Rev 1472 | Rev 1530 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2005 Martin Decky
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  13.  *   documentation and/or other materials provided with the distribution.
  14.  * - The name of the author may not be used to endorse or promote products
  15.  *   derived from this software without specific prior written permission.
  16.  *
  17.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. #include <string.h>
  30. #include <unistd.h>
  31. #include <ctype.h>
  32. #include <limits.h>
  33.  
  34.  
  35. /* Dummy implementation of mem/ functions */
  36.  
  37. void * memset(void *s, int c, size_t n)
  38. {
  39.     char *os = s;
  40.     while (n--)
  41.         *(os++) = c;
  42.     return s;
  43. }
  44.  
  45. void * memcpy(void *dst, const void *src, size_t n)
  46. {
  47.     int i, j;
  48.  
  49.     for (i = 0; i < n/sizeof(unsigned long); i++)
  50.         ((unsigned long *) dst)[i] = ((unsigned long *) src)[i];
  51.        
  52.     for (j = 0; j < n%sizeof(unsigned long); j++)
  53.         ((unsigned char *)(((unsigned long *) dst) + i))[j] = ((unsigned char *)(((unsigned long *) src) + i))[j];
  54.        
  55.     return (char *)src;
  56. }
  57.  
  58. void * memmove(void *dst, const void *src, size_t n)
  59. {
  60.     int i, j;
  61.    
  62.     if (src > dst)
  63.         return memcpy(dst, src, n);
  64.  
  65.     for (j = (n%sizeof(unsigned long))-1; j >= 0; j--)
  66.         ((unsigned char *)(((unsigned long *) dst) + i))[j] = ((unsigned char *)(((unsigned long *) src) + i))[j];
  67.  
  68.     for (i = n/sizeof(unsigned long)-1; i >=0 ; i--)
  69.         ((unsigned long *) dst)[i] = ((unsigned long *) src)[i];
  70.        
  71.     return (char *)src;
  72. }
  73.  
  74.  
  75. /** Count the number of characters in the string, not including terminating 0.
  76.  * @param str string
  77.  * @return number of characters in string.
  78.  */
  79. size_t strlen(const char *str)
  80. {
  81.     size_t counter = 0;
  82.  
  83.     while (str[counter] != 0) {
  84.         counter++;
  85.     }
  86.  
  87.     return counter;
  88. }
  89.  
  90. int strcmp(const char *a,const char *b)
  91. {
  92.     int c=0;
  93.    
  94.     while(a[c]&&b[c]&&(!(a[c]-b[c]))) c++;
  95.    
  96.     return a[c]-b[c];
  97.    
  98. }
  99.  
  100.  
  101.  
  102. /** Return pointer to the first occurence of character c in string
  103.  * @param str scanned string
  104.  * @param c searched character (taken as one byte)
  105.  * @return pointer to the matched character or NULL if it is not found in given string.
  106.  */
  107. char *strchr(const char *str, int c)
  108. {
  109.     while (*str != '\0') {
  110.         if (*str == (char)c)
  111.             return (char *)str;
  112.         str++;
  113.     }
  114.  
  115.     return NULL;
  116. }
  117.  
  118. /** Return pointer to the last occurence of character c in string
  119.  * @param str scanned string
  120.  * @param c searched character (taken as one byte)
  121.  * @return pointer to the matched character or NULL if it is not found in given string.
  122.  */
  123. char *strrchr(const char *str, int c)
  124. {
  125.     char *retval = NULL;
  126.  
  127.     while (*str != '\0') {
  128.         if (*str == (char)c)
  129.             retval = (char *)str;
  130.         str++;
  131.     }
  132.  
  133.     return (char *)retval;
  134. }
  135.  
  136. /** Convert string to a number.
  137.  * Core of strtol and strtoul functions.
  138.  * @param nptr pointer to string
  139.  * @param endptr if not NULL, function stores here pointer to the first invalid character
  140.  * @param base zero or number between 2 and 36 inclusive
  141.  * @param sgn its set to 1 if minus found
  142.  * @return result of conversion.
  143.  */
  144. static unsigned long _strtoul(const char *nptr, char **endptr, int base, char *sgn)
  145. {
  146.     unsigned char c;
  147.     unsigned long result = 0;
  148.     unsigned long a, b;
  149.     const char *str = nptr;
  150.     const char *tmpptr;
  151.    
  152.     while (isspace(*str))
  153.         str++;
  154.    
  155.     if (*str == '-') {
  156.         *sgn = 1;
  157.         ++str;
  158.     } else if (*str == '+')
  159.         ++str;
  160.    
  161.     if (base) {
  162.         if ((base == 1) || (base > 36)) {
  163.             /* FIXME: set errno to EINVAL */
  164.             return 0;
  165.         }
  166.         if ((base == 16) && (*str == '0') && ((str[1] == 'x') || (str[1] == 'X'))) {
  167.             str += 2;
  168.         }
  169.     } else {
  170.         base = 10;
  171.        
  172.         if (*str == '0') {
  173.             base = 8;
  174.             if ((str[1] == 'X') || (str[1] == 'x'))  {
  175.                 base = 16;
  176.                 str += 2;
  177.             }
  178.         }
  179.     }
  180.    
  181.     tmpptr = str;
  182.  
  183.     while (*str) {
  184.         c = *str;
  185.         c = ( c >= 'a'? c-'a'+10:(c >= 'A'?c-'A'+10:(c <= '9'?c-'0':0xff)));
  186.         if (c > base) {
  187.             break;
  188.         }
  189.        
  190.         a = (result & 0xff) * base + c;
  191.         b = (result >> 8) * base + (a >> 8);
  192.        
  193.         if (b > (ULONG_MAX >> 8)) {
  194.             /* overflow */
  195.             /* FIXME: errno = ERANGE*/
  196.             return ULONG_MAX;
  197.         }
  198.    
  199.         result = (b << 8) + (a & 0xff);
  200.         ++str;
  201.     }
  202.    
  203.     if (str == tmpptr) {
  204.         /* no number was found => first invalid character is the first character of the string */
  205.         /* FIXME: set errno to EINVAL */
  206.         str = nptr;
  207.         result = 0;
  208.     }
  209.    
  210.     if (endptr)
  211.         *endptr = (char *)str;
  212.  
  213.     if (nptr == str) {
  214.         /*FIXME: errno = EINVAL*/
  215.         return 0;
  216.     }
  217.  
  218.     return result;
  219. }
  220.  
  221. /** Convert initial part of string to long int according to given base.
  222.  * The number may begin with an arbitrary number of whitespaces followed by optional sign (`+' or `-').
  223.  * If the base is 0 or 16, the prefix `0x' may be inserted and the number will be taken as hexadecimal one.
  224.  * If the base is 0 and the number begin with a zero, number will be taken as octal one (as with base 8).
  225.  * Otherwise the base 0 is taken as decimal.
  226.  * @param nptr pointer to string
  227.  * @param endptr if not NULL, function stores here pointer to the first invalid character
  228.  * @param base zero or number between 2 and 36 inclusive
  229.  * @return result of conversion.
  230.  */
  231. long int strtol(const char *nptr, char **endptr, int base)
  232. {
  233.     char sgn = 0;
  234.     unsigned long number = 0;
  235.    
  236.     number = _strtoul(nptr, endptr, base, &sgn);
  237.  
  238.     if (number > LONG_MAX) {
  239.         if ((sgn) && (number == (unsigned long)(LONG_MAX) + 1)) {
  240.             /* FIXME: set 0 to errno */
  241.             return number;     
  242.         }
  243.         /* FIXME: set ERANGE to errno */
  244.         return (sgn?LONG_MIN:LONG_MAX);
  245.     }
  246.    
  247.     return (sgn?-number:number);
  248. }
  249.  
  250.  
  251. /** Convert initial part of string to unsigned long according to given base.
  252.  * The number may begin with an arbitrary number of whitespaces followed by optional sign (`+' or `-').
  253.  * If the base is 0 or 16, the prefix `0x' may be inserted and the number will be taken as hexadecimal one.
  254.  * If the base is 0 and the number begin with a zero, number will be taken as octal one (as with base 8).
  255.  * Otherwise the base 0 is taken as decimal.
  256.  * @param nptr pointer to string
  257.  * @param endptr if not NULL, function stores here pointer to the first invalid character
  258.  * @param base zero or number between 2 and 36 inclusive
  259.  * @return result of conversion.
  260.  */
  261. unsigned long strtoul(const char *nptr, char **endptr, int base)
  262. {
  263.     char sgn = 0;
  264.     unsigned long number = 0;
  265.    
  266.     number = _strtoul(nptr, endptr, base, &sgn);
  267.  
  268.     return (sgn?-number:number);
  269. }
  270.  
  271. char *strcpy(char *dest, const char *src)
  272. {
  273.     while (*(dest++) = *(src++))
  274.         ;
  275. }
  276.  
  277. char *strncpy(char *dest, const char *src, size_t n)
  278. {
  279.     while (*(dest++) = *(src++) && --n)
  280.         ;
  281. }
  282.