URL https://opencores.org/ocsvn/plasma/plasma/trunk

Subversion Repositories plasma

[/] [plasma/] [trunk/] [kernel/] [libc.c] - Blame information for rev 356

Go to most recent revision | Details | Compare with Previous | View Log


/*--------------------------------------------------------------------
 * TITLE: ANSI C Library
 * AUTHOR: Steve Rhoads (rhoadss@yahoo.com)
 * DATE CREATED: 12/17/05
 * FILENAME: libc.c
 * PROJECT: Plasma CPU core
 * COPYRIGHT: Software placed into the public domain by the author.
 *    Software 'as is' without warranty.  Author liable for nothing.
 * DESCRIPTION:
 *    Subset of the ANSI C library
 *--------------------------------------------------------------------*/
#define NO_ELLIPSIS
#include "rtos.h"
 
 
char *strcpy(char *dst, const char *src)
{
   char *dstSave=dst;
   int c;
   do
   {
      c = *dst++ = *src++;
   } while(c);
   return dstSave;
}
 
 
char *strncpy(char *dst, const char *src, int count)
{
   int c=1;
   char *dstSave=dst;
   while(count-- > 0 && c)
      c = *dst++ = *src++;
   *dst = 0;
   return dstSave;
}
 
 
char *strcat(char *dst, const char *src)
{
   int c;
   char *dstSave=dst;
   while(*dst)
      ++dst;
   do
   {
      c = *dst++ = *src++;
   } while(c);
   return dstSave;
}
 
 
char *strncat(char *dst, const char *src, int count)
{
   int c=1;
   char *dstSave=dst;
   while(*dst && --count > 0)
      ++dst;
   while(--count > 0 && c)
      c = *dst++ = *src++;
   *dst = 0;
   return dstSave;
}
 
 
int strcmp(const char *string1, const char *string2)
{
   int diff, c;
   for(;;)
   {
      diff = *string1++ - (c = *string2++);
      if(diff)
         return diff;
      if(c == 0)
         return 0;
   }
}
 
 
int strncmp(const char *string1, const char *string2, int count)
{
   int diff, c;
   while(count-- > 0)
   {
      diff = *string1++ - (c = *string2++);
      if(diff)
         return diff;
      if(c == 0)
         return 0;
   }
   return 0;
}
 
 
char *strstr(const char *string, const char *find)
{
   int i;
   for(;;)
   {
      for(i = 0; string[i] == find[i] && find[i]; ++i) ;
      if(find[i] == 0)
         return (char*)string;
      if(*string++ == 0)
         return NULL;
   }
}
 
 
int strlen(const char *string)
{
   const char *base=string;
   while(*string++) ;
   return string - base - 1;
}
 
 
void *memcpy(void *dst, const void *src, unsigned long bytes)
{
   if(((uint32)dst | (uint32)src | bytes) & 3)
   {
      uint8 *Dst = (uint8*)dst, *Src = (uint8*)src;
      while((int)bytes-- > 0)
         *Dst++ = *Src++;
   }
   else
   {
      uint32 *Dst32 = (uint32*)dst, *Src32 = (uint32*)src;
      bytes >>= 2;
      while((int)bytes-- > 0)
         *Dst32++ = *Src32++;
   }
   return dst;
}
 
 
void *memmove(void *dst, const void *src, unsigned long bytes)
{
   uint8 *Dst = (uint8*)dst;
   uint8 *Src = (uint8*)src;
   if(Dst < Src)
   {
      while((int)bytes-- > 0)
         *Dst++ = *Src++;
   }
   else
   {
      Dst += bytes;
      Src += bytes;
      while((int)bytes-- > 0)
         *--Dst = *--Src;
   }
   return dst;
}
 
 
int memcmp(const void *cs, const void *ct, unsigned long bytes)
{
   uint8 *Dst = (uint8*)cs;
   uint8 *Src = (uint8*)ct;
   int diff;
   while((int)bytes-- > 0)
   {
      diff = *Dst++ - *Src++;
      if(diff)
         return diff;
   }
   return 0;
}
 
 
void *memset(void *dst, int c, unsigned long bytes)
{
   uint8 *Dst = (uint8*)dst;
   while((int)bytes-- > 0)
      *Dst++ = (uint8)c;
   return dst;
}
 
 
int abs(int n)
{
   return n>=0 ? n : -n;
}
 
 
static uint32 Rand1=0x1f2bcda3, Rand2=0xdeafbeef, Rand3=0xc5134306;
int rand(void)
{
   int shift;
   Rand1 += 0x13423123 + Rand2;
   Rand2 += 0x2312fdea + Rand3;
   Rand3 += 0xf2a12de1;
   shift = Rand3 & 31;
   Rand1 = (Rand1 << (32 - shift)) | (Rand1 >> shift);
   Rand3 ^= Rand1;
   shift = (Rand3 >> 8) & 31;
   Rand2 = (Rand2 << (32 - shift)) | (Rand2 >> shift);
   return Rand1;
}
 
 
void srand(unsigned int seed)
{
   Rand1 = seed;
}
 
 
long strtol(const char *s, char **end, int base)
{
   int i;
   unsigned long ch, value=0, neg=0;
 
   if(s[0] == '-')
   {
      neg = 1;
      ++s;
   }
   if(s[0] == '0' && s[1] == 'x')
   {
      base = 16;
      s += 2;
   }
   for(i = 0; i <= 8; ++i)
   {
      ch = *s++;
      if('0' <= ch && ch <= '9')
         ch -= '0';
      else if('A' <= ch && ch <= 'Z')
         ch = ch - 'A' + 10;
      else if('a' <= ch && ch <= 'z')
         ch = ch - 'a' + 10;
      else
         break;
      value = value * base + ch;
   }
   if(end)
      *end = (char*)s - 1;
   if(neg)
      value = -(int)value;
   return value;
}
 
 
int atoi(const char *s)
{
   return strtol(s, NULL, 10);
}
 
 
char *itoa(int num, char *dst, int base)
{
   int digit, negate=0, place;
   char c, text[20];
 
   if(base == 10 && num < 0)
   {
      num = -num;
      negate = 1;
   }
   text[16] = 0;
   for(place = 15; place >= 0; --place)
   {
      digit = (unsigned int)num % (unsigned int)base;
      if(num == 0 && place < 15 && base == 10 && negate)
      {
         c = '-';
         negate = 0;
      }
      else if(digit < 10)
         c = (char)('0' + digit);
      else
         c = (char)('a' + digit - 10);
      text[place] = c;
      num = (unsigned int)num / (unsigned int)base;
      if(num == 0 && negate == 0)
         break;
   }
   strcpy(dst, text + place);
   return dst;
}
 
 
int sprintf(char *s, const char *format,
            int arg0, int arg1, int arg2, int arg3,
            int arg4, int arg5, int arg6, int arg7)
{
   int argv[8];
   int argc=0, width, length;
   char f, text[20], fill;
 
   argv[0] = arg0; argv[1] = arg1; argv[2] = arg2; argv[3] = arg3;
   argv[4] = arg4; argv[5] = arg5; argv[6] = arg6; argv[7] = arg7;
 
   for(;;)
   {
      f = *format++;
      if(f == 0)
         return argc;
      else if(f == '%')
      {
         width = 0;
         fill = ' ';
         f = *format++;
         while('0' <= f && f <= '9')
         {
            width = width * 10 + f - '0';
            f = *format++;
         }
         if(f == '.')
         {
            fill = '0';
            f = *format++;
         }
         if(f == 0)
            return argc;
 
         if(f == 'd')
         {
            memset(s, fill, width);
            itoa(argv[argc++], text, 10);
            length = (int)strlen(text);
            if(width < length)
               width = length;
            strcpy(s + width - length, text);
         }
         else if(f == 'x' || f == 'f')
         {
            memset(s, '0', width);
            itoa(argv[argc++], text, 16);
            length = (int)strlen(text);
            if(width < length)
               width = length;
            strcpy(s + width - length, text);
         }
         else if(f == 'c')
         {
            *s++ = (char)argv[argc++];
            *s = 0;
         }
         else if(f == 's')
         {
            length = strlen((char*)argv[argc]);
            if(width > length)
            {
               memset(s, ' ', width - length);
               s += width - length;
            }
            strcpy(s, (char*)argv[argc++]);
         }
         s += strlen(s);
      }
      else
      {
         if(f == '\n')
            *s++ = '\r';
         *s++ = f;
         if(f == '\r' && *format == '\n')
            *s++ = *format++;
      }
      *s = 0;
   }
}
 
 
int sscanf(const char *s, const char *format,
           int arg0, int arg1, int arg2, int arg3,
           int arg4, int arg5, int arg6, int arg7)
{
   int argv[8];
   int argc=0;
   char f, *ptr;
 
   argv[0] = arg0; argv[1] = arg1; argv[2] = arg2; argv[3] = arg3;
   argv[4] = arg4; argv[5] = arg5; argv[6] = arg6; argv[7] = arg7;
 
   for(;;)
   {
      if(*s == 0)
         return argc;
      f = *format++;
      if(f == 0)
         return argc;
      else if(f == '%')
      {
         while(isspace(*s))
            ++s;
         f = *format++;
         if(f == 0)
            return argc;
         if(f == 'd')
            *(int*)argv[argc++] = strtol(s, (char**)&s, 10);
         else if(f == 'x')
            *(int*)argv[argc++] = strtol(s, (char**)&s, 16);
         else if(f == 'c')
            *(char*)argv[argc++] = *s++;
         else if(f == 's')
         {
            ptr = (char*)argv[argc++];
            while(!isspace(*s))
               *ptr++ = *s++;
            *ptr = 0;
         }
      }
      else
      {
         while(*s && *s != f)
            ++s;
         if(*s)
            ++s;
      }
   }
}
 
 
#ifdef INCLUDE_DUMP
/*********************** dump ***********************/
void dump(const unsigned char *data, int length)
{
   int i, index=0, value;
   char string[80];
   memset(string, 0, sizeof(string));
   for(i = 0; i < length; ++i)
   {
      if((i & 15) == 0)
      {
         if(strlen(string))
            printf("%s\n", string);
         printf("%4x ", i);
         memset(string, 0, sizeof(string));
         index = 0;
      }
      value = data[i];
      printf("%2x ", value);
      if(isprint(value))
         string[index] = (char)value;
      else
         string[index] = '.';
      ++index;
   }
   for(; index < 16; ++index)
      printf("   ");
   printf("%s\n", string);
}
#endif //INCLUDE_DUMP
 
 
#ifdef INCLUDE_QSORT
/*********************** qsort ***********************/
static void QsortSwap(char *base, long left, long right, long size)
{
   int temp, i;
   char *ptrLeft, *ptrRight;
   ptrLeft = base + left * size;
   ptrRight = base + right * size;
   for(i = 0; i < size; ++i)
   {
      temp = ptrLeft[i];
      ptrLeft[i] = ptrRight[i];
      ptrRight[i] = (char)temp;
   }
}
 
 
//Modified from K&R
static void qsort2(void *base, long left, long right, long size,
      int (*cmp)(const void *,const void *))
{
   int i, last;
   char *base2=(char*)base, *pivot;
   if(left >= right)
      return;
   QsortSwap(base2, left, (left + right)/2, size);
   last = left;
   pivot = &base2[left*size];
   for(i = left + 1; i <= right; ++i)
   {
      if(cmp(&base2[i*size], pivot) < 0)
         QsortSwap(base2, ++last, i, size);
   }
   QsortSwap(base2, left, last, size);
   qsort2(base, left, last-1, size, cmp);
   qsort2(base, last+1, right, size, cmp);
}
 
 
void qsort(void *base,
           long n,
           long size,
           int (*cmp)(const void *,const void *))
{
   qsort2(base, 0, n-1, size, cmp);
}
 
 
void *bsearch(const void *key,
              const void *base,
              long n,
              long size,
              int (*cmp)(const void *,const void *))
{
   long cond, low=0, high=n-1, mid;
   char *base2=(char*)base;
   while(low <= high)
   {
      mid = (low + high)/2;
      cond = cmp(key, &base2[mid*size]);
      if(cond < 0)
         high = mid - 1;
      else if(cond > 0)
         low = mid + 1;
      else
         return &base2[mid * size];
   }
   return NULL;
}
#endif //INCLUDE_QSORT
 
 
#ifdef INCLUDE_TIMELIB
/************************* time.h ***********************/
#define SEC_PER_YEAR (365L*24*60*60)
#define SEC_PER_DAY (24L*60*60)
//typedef unsigned long time_t;  //start at 1/1/80
//struct tm {
//   int tm_sec;      //(0,59)
//   int tm_min;      //(0,59)
//   int tm_hour;     //(0,23)
//   int tm_mday;     //(1,31)
//   int tm_mon;      //(0,11)
//   int tm_year;     //(0,n) from 1900
//   int tm_wday;     //(0,6)     calculated
//   int tm_yday;     //(0,365)   calculated
//   int tm_isdst;    //hour adjusted for day light savings
//};
static const unsigned short DaysUntilMonth[]=
   {0,31,59,90,120,151,181,212,243,273,304,334,365};
static const unsigned short DaysInMonth[]=
   {31,28,31,30,31,30,31,31,30,31,30,31};
static time_t DstTimeIn, DstTimeOut;
 
 
/* Leap year if divisible by 4.  Centenary years should only be
   leap-years if they were divisible by 400. */
static int IsLeapYear(int year)
{
   return(((year % 4 == 0) && (year % 100 != 0)) || (year % 400 == 0));
}
 
time_t mktime(struct tm *tp)
{
   time_t seconds;
   unsigned long days, y, year;
 
   days = tp->tm_mday - 1 + DaysUntilMonth[tp->tm_mon] +
      365 * (tp->tm_year - 80);
   seconds = (unsigned long)tp->tm_sec + 60L * (tp->tm_min +
      60L * (tp->tm_hour + 24L * days));
   if(tp->tm_isdst)
      seconds -= 60 * 60;
   year = 1900 + tp->tm_year - (tp->tm_mon < 2);
   for(y = 1980; y <= year; y += 4)
   {
      if(y % 100 != 0 || y % 400 == 0)
         seconds += SEC_PER_DAY;
   }
   return seconds;
}
 
 
void gmtime_r(const time_t *tp, struct tm *out)
{
   time_t seconds, delta, secondsIn=*tp;
   int isLeapYear;
   unsigned long year, month;
 
   out->tm_isdst = 0;
   if(DstTimeIn <= secondsIn && secondsIn < DstTimeOut)
   {
      secondsIn += 60 * 60;
      out->tm_isdst = 1;
   }
   seconds = secondsIn;
   for(year = 0; ; ++year)
   {
      delta = SEC_PER_YEAR + IsLeapYear(1980 + year) * SEC_PER_DAY;
      if(seconds >= delta)
         seconds -= delta;
      else
         break;
   }
   out->tm_year = year + 80;
   isLeapYear = IsLeapYear(1980 + year);
   for(month = 0; ; ++month)
   {
      delta = SEC_PER_DAY * (DaysInMonth[month] + (isLeapYear && (month == 1)));
      if(seconds >= delta)
         seconds -= delta;
      else
         break;
   }
   out->tm_mon = month;
   out->tm_mday = seconds / SEC_PER_DAY;
   out->tm_yday = DaysUntilMonth[month] + out->tm_mday;
   seconds -= out->tm_mday * SEC_PER_DAY;
   ++out->tm_mday;
   out->tm_hour = seconds / (60 * 60);
   seconds -= out->tm_hour * (60 * 60);
   out->tm_min = seconds / 60;
   seconds -= out->tm_min * 60;
   out->tm_sec = seconds;
   seconds = secondsIn % (SEC_PER_DAY * 7);
   out->tm_wday = (seconds / SEC_PER_DAY + 2) % 7; /* 1/1/80 is a Tue */
   //printf("%4.d/%2.d/%2.d:%2.d:%2.d:%2.d\n", 
   //         out->tm_year+1900, out->tm_mon+1, out->tm_mday,
   //         out->tm_hour, out->tm_min, out->tm_sec);
}
 
 
void gmtimeDst(time_t dstTimeIn, time_t dstTimeOut)
{
   DstTimeIn = dstTimeIn;
   DstTimeOut = dstTimeOut;
}
 
 
//DST from 2am on the second Sunday in March to 2am first Sunday in November
void gmtimeDstSet(time_t *tp, time_t *dstTimeIn, time_t *dstTimeOut)
{
   time_t seconds, timeIn, timeOut;
   struct tm tmDate;
   int year, days;
 
   DstTimeIn = 0;
   DstTimeOut = 0;
   gmtime_r(tp, &tmDate);
   year = tmDate.tm_year;
 
   //March 1, year, 2AM -> second Sunday
   tmDate.tm_year = year;
   tmDate.tm_mon = 2;
   tmDate.tm_mday = 1;
   tmDate.tm_hour = 2;
   tmDate.tm_min = 0;
   tmDate.tm_sec = 0;
   seconds = mktime(&tmDate);
   gmtime_r(&seconds, &tmDate);
   days = 7 - tmDate.tm_wday + 7;
   *dstTimeIn = timeIn = seconds + days * SEC_PER_DAY;
 
   //November 1, year, 2AM -> first Sunday
   tmDate.tm_year = year;
   tmDate.tm_mon = 10;
   tmDate.tm_mday = 1;
   tmDate.tm_hour = 2;
   tmDate.tm_min = 0;
   tmDate.tm_sec = 0;
   seconds = mktime(&tmDate);
   gmtime_r(&seconds, &tmDate);
   days = 7 - tmDate.tm_wday;
   *dstTimeOut = timeOut = seconds + days * SEC_PER_DAY;
 
   DstTimeIn = timeIn;
   DstTimeOut = timeOut;
}
#endif //INCLUDE_TIMELIB
 

Line No.	Rev	Author	Line
1	138	rhoads	`/*--------------------------------------------------------------------`
2			`* TITLE: ANSI C Library`
3			`* AUTHOR: Steve Rhoads (rhoadss@yahoo.com)`
4			`* DATE CREATED: 12/17/05`
5	171	rhoads	`* FILENAME: libc.c`
6	138	rhoads	`* PROJECT: Plasma CPU core`
7			`* COPYRIGHT: Software placed into the public domain by the author.`
8			`* Software 'as is' without warranty. Author liable for nothing.`
9			`* DESCRIPTION:`
10			`* Subset of the ANSI C library`
11			`--------------------------------------------------------------------/`
12			`#define NO_ELLIPSIS`
13			`#include "rtos.h"`
14
15
16			`char strcpy(char dst, const char *src)`
17			`{`
18	258	rhoads	`char *dstSave=dst;`
19	138	rhoads	`int c;`
20			`do`
21			`{`
22			`c = dst++ = src++;`
23			`} while(c);`
24	258	rhoads	`return dstSave;`
25	138	rhoads	`}`
26
27
28			`char strncpy(char dst, const char *src, int count)`
29			`{`
30			`int c=1;`
31	258	rhoads	`char *dstSave=dst;`
32	138	rhoads	`while(count-- > 0 && c)`
33			`c = dst++ = src++;`
34			`*dst = 0;`
35	258	rhoads	`return dstSave;`
36	138	rhoads	`}`
37
38
39			`char strcat(char dst, const char *src)`
40			`{`
41			`int c;`
42	258	rhoads	`char *dstSave=dst;`
43	138	rhoads	`while(*dst)`
44			`++dst;`
45			`do`
46			`{`
47			`c = dst++ = src++;`
48			`} while(c);`
49	258	rhoads	`return dstSave;`
50	138	rhoads	`}`
51
52
53			`char strncat(char dst, const char *src, int count)`
54			`{`
55			`int c=1;`
56	258	rhoads	`char *dstSave=dst;`
57	138	rhoads	`while(*dst && --count > 0)`
58			`++dst;`
59			`while(--count > 0 && c)`
60			`c = dst++ = src++;`
61			`*dst = 0;`
62	258	rhoads	`return dstSave;`
63	138	rhoads	`}`
64
65
66			`int strcmp(const char string1, const char string2)`
67			`{`
68			`int diff, c;`
69			`for(;;)`
70			`{`
71			`diff = string1++ - (c = string2++);`
72			`if(diff)`
73			`return diff;`
74			`if(c == 0)`
75			`return 0;`
76			`}`
77			`}`
78
79
80			`int strncmp(const char string1, const char string2, int count)`
81			`{`
82			`int diff, c;`
83			`while(count-- > 0)`
84			`{`
85			`diff = string1++ - (c = string2++);`
86			`if(diff)`
87			`return diff;`
88			`if(c == 0)`
89			`return 0;`
90			`}`
91			`return 0;`
92			`}`
93
94
95	149	rhoads	`char strstr(const char string, const char *find)`
96	138	rhoads	`{`
97			`int i;`
98			`for(;;)`
99			`{`
100			`for(i = 0; string[i] == find[i] && find[i]; ++i) ;`
101			`if(find[i] == 0)`
102	149	rhoads	`return (char*)string;`
103	138	rhoads	`if(*string++ == 0)`
104			`return NULL;`
105			`}`
106			`}`
107
108
109			`int strlen(const char *string)`
110			`{`
111			`const char *base=string;`
112			`while(*string++) ;`
113			`return string - base - 1;`
114			`}`
115
116
117			`void memcpy(void dst, const void *src, unsigned long bytes)`
118			`{`
119	249	rhoads	`if(((uint32)dst \| (uint32)src \| bytes) & 3)`
120			`{`
121			`uint8 Dst = (uint8)dst, Src = (uint8)src;`
122			`while((int)bytes-- > 0)`
123			`Dst++ = Src++;`
124			`}`
125			`else`
126			`{`
127			`uint32 Dst32 = (uint32)dst, Src32 = (uint32)src;`
128			`bytes >>= 2;`
129			`while((int)bytes-- > 0)`
130			`Dst32++ = Src32++;`
131			`}`
132	138	rhoads	`return dst;`
133			`}`
134
135
136	144	rhoads	`void memmove(void dst, const void *src, unsigned long bytes)`
137			`{`
138			`uint8 Dst = (uint8)dst;`
139			`uint8 Src = (uint8)src;`
140			`if(Dst < Src)`
141			`{`
142			`while((int)bytes-- > 0)`
143			`Dst++ = Src++;`
144			`}`
145			`else`
146			`{`
147			`Dst += bytes;`
148			`Src += bytes;`
149			`while((int)bytes-- > 0)`
150			`--Dst = --Src;`
151			`}`
152			`return dst;`
153			`}`
154
155
156	138	rhoads	`int memcmp(const void cs, const void ct, unsigned long bytes)`
157			`{`
158			`uint8 Dst = (uint8)cs;`
159			`uint8 Src = (uint8)ct;`
160			`int diff;`
161			`while((int)bytes-- > 0)`
162			`{`
163			`diff = Dst++ - Src++;`
164			`if(diff)`
165			`return diff;`
166			`}`
167			`return 0;`
168			`}`
169
170
171			`void memset(void dst, int c, unsigned long bytes)`
172			`{`
173			`uint8 Dst = (uint8)dst;`
174			`while((int)bytes-- > 0)`
175			`*Dst++ = (uint8)c;`
176			`return dst;`
177			`}`
178
179
180			`int abs(int n)`
181			`{`
182			`return n>=0 ? n : -n;`
183			`}`
184
185
186			`static uint32 Rand1=0x1f2bcda3, Rand2=0xdeafbeef, Rand3=0xc5134306;`
187	149	rhoads	`int rand(void)`
188	138	rhoads	`{`
189			`int shift;`
190			`Rand1 += 0x13423123 + Rand2;`
191			`Rand2 += 0x2312fdea + Rand3;`
192			`Rand3 += 0xf2a12de1;`
193			`shift = Rand3 & 31;`
194			`Rand1 = (Rand1 << (32 - shift)) \| (Rand1 >> shift);`
195			`Rand3 ^= Rand1;`
196			`shift = (Rand3 >> 8) & 31;`
197			`Rand2 = (Rand2 << (32 - shift)) \| (Rand2 >> shift);`
198			`return Rand1;`
199			`}`
200
201
202			`void srand(unsigned int seed)`
203			`{`
204			`Rand1 = seed;`
205			`}`
206
207
208	302	rhoads	`long strtol(const char s, char *end, int base)`
209	138	rhoads	`{`
210			`int i;`
211			`unsigned long ch, value=0, neg=0;`
212
213			`if(s[0] == '-')`
214			`{`
215			`neg = 1;`
216			`++s;`
217			`}`
218			`if(s[0] == '0' && s[1] == 'x')`
219			`{`
220			`base = 16;`
221			`s += 2;`
222			`}`
223			`for(i = 0; i <= 8; ++i)`
224			`{`
225			`ch = *s++;`
226			`if('0' <= ch && ch <= '9')`
227			`ch -= '0';`
228			`else if('A' <= ch && ch <= 'Z')`
229			`ch = ch - 'A' + 10;`
230			`else if('a' <= ch && ch <= 'z')`
231			`ch = ch - 'a' + 10;`
232			`else`
233			`break;`
234			`value = value * base + ch;`
235			`}`
236			`if(end)`
237	302	rhoads	`end = (char)s - 1;`
238	138	rhoads	`if(neg)`
239			`value = -(int)value;`
240			`return value;`
241			`}`
242
243
244			`int atoi(const char *s)`
245			`{`
246			`return strtol(s, NULL, 10);`
247			`}`
248
249
250	149	rhoads	`char itoa(int num, char dst, int base)`
251	138	rhoads	`{`
252	149	rhoads	`int digit, negate=0, place;`
253			`char c, text[20];`
254	138	rhoads
255			`if(base == 10 && num < 0)`
256			`{`
257			`num = -num;`
258			`negate = 1;`
259			`}`
260	149	rhoads	`text[16] = 0;`
261			`for(place = 15; place >= 0; --place)`
262	138	rhoads	`{`
263	187	rhoads	`digit = (unsigned int)num % (unsigned int)base;`
264	149	rhoads	`if(num == 0 && place < 15 && base == 10 && negate)`
265	138	rhoads	`{`
266	149	rhoads	`c = '-';`
267	138	rhoads	`negate = 0;`
268			`}`
269			`else if(digit < 10)`
270			`c = (char)('0' + digit);`
271			`else`
272			`c = (char)('a' + digit - 10);`
273	149	rhoads	`text[place] = c;`
274			`num = (unsigned int)num / (unsigned int)base;`
275			`if(num == 0 && negate == 0)`
276			`break;`
277	138	rhoads	`}`
278	149	rhoads	`strcpy(dst, text + place);`
279			`return dst;`
280	138	rhoads	`}`
281
282
283			`int sprintf(char s, const char format,`
284			`int arg0, int arg1, int arg2, int arg3,`
285			`int arg4, int arg5, int arg6, int arg7)`
286			`{`
287			`int argv[8];`
288			`int argc=0, width, length;`
289	187	rhoads	`char f, text[20], fill;`
290	138	rhoads
291			`argv[0] = arg0; argv[1] = arg1; argv[2] = arg2; argv[3] = arg3;`
292			`argv[4] = arg4; argv[5] = arg5; argv[6] = arg6; argv[7] = arg7;`
293
294			`for(;;)`
295			`{`
296			`f = *format++;`
297			`if(f == 0)`
298			`return argc;`
299			`else if(f == '%')`
300			`{`
301			`width = 0;`
302	187	rhoads	`fill = ' ';`
303	138	rhoads	`f = *format++;`
304	187	rhoads	`while('0' <= f && f <= '9')`
305	138	rhoads	`{`
306	187	rhoads	`width = width * 10 + f - '0';`
307	138	rhoads	`f = *format++;`
308			`}`
309	187	rhoads	`if(f == '.')`
310			`{`
311			`fill = '0';`
312			`f = *format++;`
313			`}`
314			`if(f == 0)`
315			`return argc;`
316	138	rhoads
317			`if(f == 'd')`
318	149	rhoads	`{`
319	187	rhoads	`memset(s, fill, width);`
320	149	rhoads	`itoa(argv[argc++], text, 10);`
321			`length = (int)strlen(text);`
322			`if(width < length)`
323			`width = length;`
324			`strcpy(s + width - length, text);`
325			`}`
326	138	rhoads	`else if(f == 'x' \|\| f == 'f')`
327	149	rhoads	`{`
328			`memset(s, '0', width);`
329			`itoa(argv[argc++], text, 16);`
330			`length = (int)strlen(text);`
331			`if(width < length)`
332			`width = length;`
333			`strcpy(s + width - length, text);`
334			`}`
335	138	rhoads	`else if(f == 'c')`
336			`{`
337			`*s++ = (char)argv[argc++];`
338			`*s = 0;`
339			`}`
340			`else if(f == 's')`
341			`{`
342			`length = strlen((char*)argv[argc]);`
343			`if(width > length)`
344			`{`
345			`memset(s, ' ', width - length);`
346			`s += width - length;`
347			`}`
348			`strcpy(s, (char*)argv[argc++]);`
349			`}`
350			`s += strlen(s);`
351			`}`
352	328	rhoads	`else`
353	138	rhoads	`{`
354	328	rhoads	`if(f == '\n')`
355	138	rhoads	`*s++ = '\r';`
356			`*s++ = f;`
357	328	rhoads	`if(f == '\r' && *format == '\n')`
358			`s++ = format++;`
359	138	rhoads	`}`
360			`*s = 0;`
361			`}`
362			`}`
363
364
365			`int sscanf(const char s, const char format,`
366			`int arg0, int arg1, int arg2, int arg3,`
367			`int arg4, int arg5, int arg6, int arg7)`
368			`{`
369			`int argv[8];`
370	187	rhoads	`int argc=0;`
371			`char f, *ptr;`
372	138	rhoads
373			`argv[0] = arg0; argv[1] = arg1; argv[2] = arg2; argv[3] = arg3;`
374			`argv[4] = arg4; argv[5] = arg5; argv[6] = arg6; argv[7] = arg7;`
375
376			`for(;;)`
377			`{`
378			`if(*s == 0)`
379			`return argc;`
380			`f = *format++;`
381			`if(f == 0)`
382			`return argc;`
383			`else if(f == '%')`
384			`{`
385			`while(isspace(*s))`
386			`++s;`
387			`f = *format++;`
388			`if(f == 0)`
389			`return argc;`
390			`if(f == 'd')`
391	302	rhoads	`(int)argv[argc++] = strtol(s, (char**)&s, 10);`
392	138	rhoads	`else if(f == 'x')`
393	302	rhoads	`(int)argv[argc++] = strtol(s, (char**)&s, 16);`
394	138	rhoads	`else if(f == 'c')`
395			`(char)argv[argc++] = *s++;`
396			`else if(f == 's')`
397			`{`
398	207	rhoads	`ptr = (char*)argv[argc++];`
399	187	rhoads	`while(!isspace(*s))`
400			`ptr++ = s++;`
401			`*ptr = 0;`
402	138	rhoads	`}`
403			`}`
404			`else`
405			`{`
406			`while(s && s != f)`
407			`++s;`
408			`if(*s)`
409			`++s;`
410			`}`
411			`}`
412			`}`
413
414	149	rhoads
415	171	rhoads	`#ifdef INCLUDE_DUMP`
416			`/********************* dump *********************/`
417	149	rhoads	`void dump(const unsigned char *data, int length)`
418			`{`
419			`int i, index=0, value;`
420			`char string[80];`
421			`memset(string, 0, sizeof(string));`
422			`for(i = 0; i < length; ++i)`
423			`{`
424			`if((i & 15) == 0)`
425			`{`
426			`if(strlen(string))`
427			`printf("%s\n", string);`
428			`printf("%4x ", i);`
429			`memset(string, 0, sizeof(string));`
430			`index = 0;`
431			`}`
432			`value = data[i];`
433			`printf("%2x ", value);`
434			`if(isprint(value))`
435			`string[index] = (char)value;`
436			`else`
437			`string[index] = '.';`
438			`++index;`
439			`}`
440			`for(; index < 16; ++index)`
441			`printf(" ");`
442			`printf("%s\n", string);`
443			`}`
444	171	rhoads	`#endif //INCLUDE_DUMP`
445	149	rhoads
446
447	171	rhoads	`#ifdef INCLUDE_QSORT`
448			`/********************* qsort *********************/`
449			`static void QsortSwap(char *base, long left, long right, long size)`
450			`{`
451	249	rhoads	`int temp, i;`
452			`char ptrLeft, ptrRight;`
453			`ptrLeft = base + left * size;`
454			`ptrRight = base + right * size;`
455			`for(i = 0; i < size; ++i)`
456			`{`
457			`temp = ptrLeft[i];`
458			`ptrLeft[i] = ptrRight[i];`
459			`ptrRight[i] = (char)temp;`
460			`}`
461	171	rhoads	`}`
462	149	rhoads
463	171	rhoads
464			`//Modified from K&R`
465			`static void qsort2(void *base, long left, long right, long size,`
466			`int (cmp)(const void ,const void *))`
467			`{`
468			`int i, last;`
469	187	rhoads	`char base2=(char)base, *pivot;`
470	171	rhoads	`if(left >= right)`
471			`return;`
472			`QsortSwap(base2, left, (left + right)/2, size);`
473			`last = left;`
474	187	rhoads	`pivot = &base2[left*size];`
475	171	rhoads	`for(i = left + 1; i <= right; ++i)`
476			`{`
477	187	rhoads	`if(cmp(&base2[i*size], pivot) < 0)`
478	171	rhoads	`QsortSwap(base2, ++last, i, size);`
479			`}`
480			`QsortSwap(base2, left, last, size);`
481			`qsort2(base, left, last-1, size, cmp);`
482			`qsort2(base, last+1, right, size, cmp);`
483			`}`
484
485
486			`void qsort(void *base,`
487			`long n,`
488			`long size,`
489			`int (cmp)(const void ,const void *))`
490			`{`
491			`qsort2(base, 0, n-1, size, cmp);`
492			`}`
493
494
495			`void bsearch(const void key,`
496			`const void *base,`
497			`long n,`
498			`long size,`
499			`int (cmp)(const void ,const void *))`
500			`{`

Browse

Tools

Subversion Repositories plasma

[/] [plasma/] [trunk/] [kernel/] [libc.c] - Blame information for rev 356