Navigation
- Accueil
- Présentation :
- FAQ
- Bugs et errata
- Contributions de lecteurs
- Téléchargements
- LXR (référencement des sources)
- Mailing-list
- Liens et Projets reliés
Site hébergé par :
Site hébergé par :
|
[ source navigation ] [ diff markup ] [ identifier search ] [ general search ] |
|||
|
||||
001 /* Copyright (C) 2004 David Decotigny (with I 001 /* Copyright (C) 2004 David Decotigny (with INSA Rennes for vsnprintf) 002 Copyright (C) 2003 The KOS Team 002 Copyright (C) 2003 The KOS Team 003 Copyright (C) 1999 Free Software Foundatio 003 Copyright (C) 1999 Free Software Foundation 004 004 005 This program is free software; you can redi 005 This program is free software; you can redistribute it and/or 006 modify it under the terms of the GNU Genera 006 modify it under the terms of the GNU General Public License 007 as published by the Free Software Foundatio 007 as published by the Free Software Foundation; either version 2 008 of the License, or (at your option) any lat 008 of the License, or (at your option) any later version. 009 009 010 This program is distributed in the hope tha 010 This program is distributed in the hope that it will be useful, 011 but WITHOUT ANY WARRANTY; without even the 011 but WITHOUT ANY WARRANTY; without even the implied warranty of 012 MERCHANTABILITY or FITNESS FOR A PARTICULAR 012 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 013 GNU General Public License for more details 013 GNU General Public License for more details. 014 014 015 You should have received a copy of the GNU 015 You should have received a copy of the GNU General Public License 016 along with this program; if not, write to t 016 along with this program; if not, write to the Free Software 017 Foundation, Inc., 59 Temple Place - Suite 3 017 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, 018 USA. 018 USA. 019 */ 019 */ 020 #include "klibc.h" 020 #include "klibc.h" 021 021 022 /* For an optimized version, see BSD sources ; 022 /* For an optimized version, see BSD sources ;) */ 023 void *memcpy(void *dst0, const void *src0, reg 023 void *memcpy(void *dst0, const void *src0, register unsigned int size) 024 { 024 { 025 char *dst; 025 char *dst; 026 const char *src; 026 const char *src; 027 for (dst = (char*)dst0, src = (const char*)s 027 for (dst = (char*)dst0, src = (const char*)src0 ; 028 size > 0 ; 028 size > 0 ; 029 dst++, src++, size--) 029 dst++, src++, size--) 030 *dst = *src; 030 *dst = *src; 031 return dst0; 031 return dst0; 032 } 032 } 033 033 034 /* ditto */ 034 /* ditto */ 035 void *memset(void *dst0, register int c, regis 035 void *memset(void *dst0, register int c, register unsigned int length) 036 { 036 { 037 char *dst; 037 char *dst; 038 for (dst = (char*) dst0 ; 038 for (dst = (char*) dst0 ; 039 length > 0 ; 039 length > 0 ; 040 dst++, length --) 040 dst++, length --) 041 *dst = (char)c; 041 *dst = (char)c; 042 return dst0; 042 return dst0; 043 } 043 } 044 044 045 int memcmp(const void *s1, const void *s2, sos 045 int memcmp(const void *s1, const void *s2, sos_size_t len) 046 { 046 { 047 const unsigned char *c1, *c2; 047 const unsigned char *c1, *c2; 048 unsigned int i; 048 unsigned int i; 049 049 050 for (i = 0, c1 = s1, c2 = s2; i < len; i++, 050 for (i = 0, c1 = s1, c2 = s2; i < len; i++, c1++, c2++) 051 { 051 { 052 if(*c1 != *c2) 052 if(*c1 != *c2) 053 return *c1 - *c2; 053 return *c1 - *c2; 054 } 054 } 055 055 056 return 0; 056 return 0; 057 } 057 } 058 058 059 059 060 unsigned int strlen(register const char *str) 060 unsigned int strlen(register const char *str) 061 { 061 { 062 unsigned int retval = 0; 062 unsigned int retval = 0; 063 063 064 while (*str++) 064 while (*str++) 065 retval++; 065 retval++; 066 066 067 return retval; 067 return retval; 068 } 068 } 069 069 070 070 071 unsigned int strnlen(const char * s, sos_size_ 071 unsigned int strnlen(const char * s, sos_size_t count) 072 { 072 { 073 const char *sc; 073 const char *sc; 074 074 075 for (sc = s; count-- && *sc != '\0'; ++sc) 075 for (sc = s; count-- && *sc != '\0'; ++sc) 076 /* nothing */continue; 076 /* nothing */continue; 077 077 078 return sc - s; 078 return sc - s; 079 } 079 } 080 080 081 081 082 char *strzcpy(register char *dst, register con 082 char *strzcpy(register char *dst, register const char *src, register int len) 083 { 083 { 084 int i; 084 int i; 085 085 086 if (len <= 0) 086 if (len <= 0) 087 return dst; 087 return dst; 088 088 089 for (i = 0; i < len; i++) 089 for (i = 0; i < len; i++) 090 { 090 { 091 dst[i] = src[i]; 091 dst[i] = src[i]; 092 if(src[i] == '\0') 092 if(src[i] == '\0') 093 return dst; 093 return dst; 094 } 094 } 095 095 096 dst[len-1] = '\0'; 096 dst[len-1] = '\0'; 097 return dst; 097 return dst; 098 } 098 } 099 099 100 100 101 char *strzcat (char *dest, const char *src, so 101 char *strzcat (char *dest, const char *src, sos_size_t n) 102 { 102 { 103 char *res = dest; 103 char *res = dest; 104 104 105 for ( ; *dest ; dest++); 105 for ( ; *dest ; dest++); 106 106 107 for ( ; *src ; src++, dest++) { 107 for ( ; *src ; src++, dest++) { 108 *dest = *src; 108 *dest = *src; 109 n--; 109 n--; 110 if (n <= 0) 110 if (n <= 0) 111 break; 111 break; 112 } 112 } 113 113 114 *dest = '\0'; 114 *dest = '\0'; 115 return res; 115 return res; 116 } 116 } 117 117 118 int strcmp(register const char *s1, register c 118 int strcmp(register const char *s1, register const char *s2) 119 { 119 { 120 while (*s1 == *s2++) 120 while (*s1 == *s2++) 121 if (*s1++ == 0) 121 if (*s1++ == 0) 122 return (0); 122 return (0); 123 123 124 return (*(const unsigned char *)s1 - *(const 124 return (*(const unsigned char *)s1 - *(const unsigned char *)(s2 - 1)); 125 } 125 } 126 126 127 127 128 int strncmp(register const char *s1, register 128 int strncmp(register const char *s1, register const char *s2, register int len) 129 { 129 { 130 char c1 = '\0', c2 = '\0'; 130 char c1 = '\0', c2 = '\0'; 131 131 132 while (len > 0) 132 while (len > 0) 133 { 133 { 134 c1 = (unsigned char) *s1++; 134 c1 = (unsigned char) *s1++; 135 c2 = (unsigned char) *s2++; 135 c2 = (unsigned char) *s2++; 136 if (c1 == '\0' || c1 != c2) 136 if (c1 == '\0' || c1 != c2) 137 return c1 - c2; 137 return c1 - c2; 138 len--; 138 len--; 139 } 139 } 140 140 141 return c1 - c2; 141 return c1 - c2; 142 } 142 } 143 143 144 144 145 static unsigned long int _random_seed = 931867 << 146 << 147 /** << 148 * The following code is borrowed from Glenn R << 149 * http://remus.rutgers.edu/~rhoads/Code/code. << 150 * License to be defined... << 151 */ << 152 unsigned long int random (void) << 153 { << 154 /* The following parameters are recommended se << 155 uncomment the one you want. */ << 156 << 157 /* For RAND_MAX == 4294967291 */ << 158 static unsigned int a = 1588635695, q = 2, << 159 /* static unsigned int a = 1223106847, m = 429 << 160 /* static unsigned int a = 279470273, m = 4294 << 161 << 162 /* For RAND_MAX == 2147483647 */ << 163 /* static unsigned int a = 1583458089, m = 214 << 164 /* static unsigned int a = 784588716, m = 2147 << 165 /* static unsigned int a = 16807, m = 21474836 << 166 /* static unsigned int a = 950706376, m = 2147 << 167 << 168 _random_seed = a*(_random_seed % q) - r*(_r << 169 return _random_seed; << 170 } << 171 << 172 << 173 void srandom (unsigned long int seed) << 174 { << 175 _random_seed = seed; << 176 } << 177 << 178 << 179 /* I (d2) borrowed and rewrote this for Nachos 145 /* I (d2) borrowed and rewrote this for Nachos/INSA Rennes. Thanks to 180 them for having kindly allowed me to do so. 146 them for having kindly allowed me to do so. */ 181 int vsnprintf(char *buff, sos_size_t len, cons 147 int vsnprintf(char *buff, sos_size_t len, const char * format, va_list ap) 182 { 148 { 183 sos_size_t i, result; 149 sos_size_t i, result; 184 150 185 if (!buff || !format || (len < 0)) 151 if (!buff || !format || (len < 0)) 186 return -1; 152 return -1; 187 153 188 #define PUTCHAR(thechar) \ 154 #define PUTCHAR(thechar) \ 189 do { \ 155 do { \ 190 if (result < len-1) \ 156 if (result < len-1) \ 191 *buff++ = (thechar); \ 157 *buff++ = (thechar); \ 192 result++; \ 158 result++; \ 193 } while (0) 159 } while (0) 194 160 195 result = 0; 161 result = 0; 196 for(i=0 ; format[i] != '\0' ; i++){ 162 for(i=0 ; format[i] != '\0' ; i++){ 197 switch (format[i]) 163 switch (format[i]) 198 { 164 { 199 case '%': 165 case '%': 200 i++; 166 i++; 201 switch(format[i]) 167 switch(format[i]) 202 { 168 { 203 case '%': 169 case '%': 204 { 170 { 205 PUTCHAR('%'); 171 PUTCHAR('%'); 206 break; 172 break; 207 } 173 } 208 case 'i':; 174 case 'i':; 209 case 'd': 175 case 'd': 210 { 176 { 211 int integer = va_arg(ap,int); 177 int integer = va_arg(ap,int); 212 int cpt2 = 0; 178 int cpt2 = 0; 213 char buff_int[16]; 179 char buff_int[16]; 214 180 215 if (integer<0) 181 if (integer<0) 216 PUTCHAR('-'); 182 PUTCHAR('-'); 217 /* Ne fait pas integer = -intege 183 /* Ne fait pas integer = -integer ici parce que INT_MIN 218 n'a pas d'equivalent positif 184 n'a pas d'equivalent positif (int = [-2^31, 2^31-1]) */ 219 185 220 do { 186 do { 221 int m10 = integer%10; 187 int m10 = integer%10; 222 m10 = (m10 < 0)? -m10:m10; 188 m10 = (m10 < 0)? -m10:m10; 223 buff_int[cpt2++]=(char)('0'+ m 189 buff_int[cpt2++]=(char)('0'+ m10); 224 integer=integer/10; 190 integer=integer/10; 225 } while(integer!=0); 191 } while(integer!=0); 226 192 227 for(cpt2 = cpt2 - 1 ; cpt2 >= 0 193 for(cpt2 = cpt2 - 1 ; cpt2 >= 0 ; cpt2--) 228 PUTCHAR(buff_int[cpt2]); 194 PUTCHAR(buff_int[cpt2]); 229 195 230 break; 196 break; 231 } 197 } 232 198 233 case 'c': 199 case 'c': 234 { 200 { 235 int value = va_arg(ap,int); 201 int value = va_arg(ap,int); 236 PUTCHAR((char)value); 202 PUTCHAR((char)value); 237 break; 203 break; 238 } 204 } 239 205 240 case 's': 206 case 's': 241 { 207 { 242 char *string = va_arg(ap,char *) 208 char *string = va_arg(ap,char *); 243 if (! string) 209 if (! string) 244 string = "(null)"; 210 string = "(null)"; 245 for( ; *string != '\0' ; string+ 211 for( ; *string != '\0' ; string++) 246 PUTCHAR(*string); 212 PUTCHAR(*string); 247 break; 213 break; 248 } 214 } 249 215 250 case 'p': << 251 PUTCHAR('0'); << 252 PUTCHAR('x'); << 253 case 'x': 216 case 'x': 254 { 217 { 255 unsigned int hexa = va_arg(ap,in 218 unsigned int hexa = va_arg(ap,int); 256 unsigned int nb; 219 unsigned int nb; 257 int i, had_nonzero = 0; 220 int i, had_nonzero = 0; 258 for(i=0 ; i < 8 ; i++) 221 for(i=0 ; i < 8 ; i++) 259 { 222 { 260 nb = (unsigned int)(hexa << 223 nb = (unsigned int)(hexa << (i*4)); 261 nb = (nb >> 28) & 0xf; 224 nb = (nb >> 28) & 0xf; 262 // Skip the leading zeros 225 // Skip the leading zeros 263 if (nb == 0) 226 if (nb == 0) 264 { 227 { 265 if (had_nonzero) 228 if (had_nonzero) 266 PUTCHAR('0'); 229 PUTCHAR('0'); 267 } 230 } 268 else 231 else 269 { 232 { 270 had_nonzero = 1; 233 had_nonzero = 1; 271 if (nb < 10) 234 if (nb < 10) 272 PUTCHAR('0'+nb); 235 PUTCHAR('0'+nb); 273 else 236 else 274 PUTCHAR('a'+(nb-10)); 237 PUTCHAR('a'+(nb-10)); 275 } 238 } 276 } 239 } 277 if (! had_nonzero) 240 if (! had_nonzero) 278 PUTCHAR('0'); 241 PUTCHAR('0'); 279 break; 242 break; 280 } 243 } 281 break; 244 break; 282 245 283 default: 246 default: 284 PUTCHAR('%'); 247 PUTCHAR('%'); 285 PUTCHAR(format[i]); 248 PUTCHAR(format[i]); 286 } 249 } 287 break; 250 break; 288 251 289 default: 252 default: 290 PUTCHAR(format[i]); 253 PUTCHAR(format[i]); 291 } 254 } 292 } 255 } 293 256 294 *buff = '\0'; 257 *buff = '\0'; 295 return result; 258 return result; 296 } 259 } 297 260 298 261 299 int snprintf(char * buff, sos_size_t len, cons 262 int snprintf(char * buff, sos_size_t len, const char *format, ...) 300 { 263 { 301 va_list ap; 264 va_list ap; 302 265 303 va_start(ap, format); 266 va_start(ap, format); 304 len = vsnprintf(buff, len, format, ap); 267 len = vsnprintf(buff, len, format, ap); 305 va_end(ap); 268 va_end(ap); 306 269 307 return len; 270 return len; 308 } 271 }
| [ source navigation ] | [ diff markup ] | [ identifier search ] | [ general search ] |