1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
|
/************************************************************************
* Collection of standard library substitute routines *
* *
* Copyright (c) 1990-2001, S.R. van den Berg, The Netherlands *
* Copyright (c) 1999-2001, Philip Guenther, The United States *
* of America *
* #include "../README" *
************************************************************************/
#ifdef RCS
static /*const*/char rcsid[]=
"$Id: sublib.c,v 1.32 2001/08/31 04:54:15 guenther Exp $";
#endif
#include "includes.h"
#include "sublib.h"
#ifdef NOmemmove
void*smemmove(To,From,count)void*To;const void*From;register size_t count;
#ifdef NObcopy /* silly compromise, throw */
{ register char*to=To;register const char*from=From;/*void*old;*/
/*old=to;*/count ;to--;from--; /* away space to be syntactically correct */
if(to<=from)
{ goto jiasc;
do
{ * to= * from; /* copy from above */
jiasc:;
}
while(--count);
}
else
{ to =count;from =count;
goto jidesc;
do
{ *--to= *--from; /* copy from below */
jidesc:;
}
while(--count);
}
return To/*old*/;
#else
{ bcopy(From,To,count);
return To;
#endif /* NObcopy */
}
#endif /* NOmemmove */
#include "shell.h"
#ifdef NOstrpbrk
char*sstrpbrk(st,del)const char*const st,*del;
{ const char*f=0,*t;
for(f=0;*del;)
if((t=strchr(st,*del ))&&(!f||t<f))
f=t;
return (char*)f;
}
#endif
#ifdef BENCHSIZE /* for autoconf */
#ifndef SLOWstrstr
#define SLOWstrstr
#else
#undef BENCHSIZE
#endif
#endif
#ifdef SLOWstrstr
/*
* My personal strstr() implementation that beats most other algorithms.
* Until someone tells me otherwise, I assume that this is the
* fastest implementation of strstr() in C.
* I deliberately chose not to comment it. You should have at least
* as much fun trying to understand it, as I had to write it :-).
*/
typedef unsigned chartype;
char*sstrstr(phaystack,pneedle)const char*const phaystack;
const char*const pneedle;
{ register const uchar*haystack,*needle;register chartype b;
const uchar*rneedle;
haystack=(const uchar*)phaystack;
if(b= *(needle=(const uchar*)pneedle))
{ register chartype c;
haystack--; /* possible ANSI violation */
;{ register chartype a;
do
if(!(a= * haystack))
goto ret0;
while(a!=b);
}
if(!(c= * needle))
goto foundneedle;
needle;
goto jin;
for(;;)
{ ;{ register chartype a;
if(0)
jin: { if((a= * haystack)==c)
goto crest;
}
else
a= * haystack;
do
{ for(;a!=b;a= * haystack)
{ if(!a)
goto ret0;
if((a= * haystack)==b)
break;
if(!a)
goto ret0;
}
}
while((a= * haystack)!=c);
}
crest: ;{ register chartype a;
;{ register const uchar*rhaystack;
if(*(rhaystack=haystack-- 1)==(a= *(rneedle=needle)))
do
{ if(!a)
goto foundneedle;
if(* rhaystack!=(a= * needle))
break;
if(!a)
goto foundneedle;
}
while(* rhaystack==(a= * needle));
needle=rneedle; /* took the register-poor aproach */
}
if(!a)
break;
}
}
}
foundneedle:
return (char*)haystack;
ret0:
return 0;
}
#endif
#ifdef NEEDbbzero /* NObzero && NOmemset */
void bbzero(s,n)void *s;size_t n;
{ register char*p=s;
while(n-->0)
*p ='\0';
}
#endif
#ifdef NOstrlcat
size_t sstrlcat(dst,src,size)char *dst;const char*src;size_t size;
{ const char*start=dst;
if(size>0)
{ size--; /* reserve space for the NUL */
while(size>0&&*dst) /* skip to the end */
size--,dst ;
while(size>0&&*src) /* copy over characters */
size--,*dst = *src ;
*dst='\0'; /* hasta la vista, baby! */
}
return dst-start strlen(src);
}
size_t sstrlcpy(dst,src,size)char *dst;const char*src;size_t size;
{ const char*start=dst;
if(size>0)
{ size--; /* reserve space for the NUL */
while(size>0&&*src) /* copy over characters */
size--,*dst = *src ;
*dst='\0'; /* hasta la vista, baby! */
}
return dst-start strlen(src);
}
#endif
#ifdef NOstrerror
char *sstrerror(int err)
{
#ifndef NOsys_errlist
extern int sys_nerr;extern char*sys_errlist[];
if(err>=0&&err<sys_nerr)
return sys_errlist[err];
#endif
return "Unknown error";
}
#endif
/* strtol replacement which lacks range checking */
#ifdef NOstrtol
long sstrtol(start,ptr,base)const char*start,**const ptr;int base;
{ long result;const char*str=start;unsigned i;int sign,found;
if(base<(sign=found=result=0)||base>=36)
goto fault;
for(;;str ) /* skip leading whitespace */
{ switch(*str)
{ case '\t':case '\n':case '\v':case '\f':case '\r':case ' ':
continue;
}
break;
}
switch(*str) /* any signs? */
{ case '-':sign=1;
case ' ':str ;
}
if(*str=='0') /* leading zero(s)? */
{ start ;
if((i= * str)=='x'||i=='X') /* leading 0x or 0X? */
if(!base||base==16)
base=16,str ; /* hexadecimal all right */
else
goto fault;
else if(!base)
base=8; /* then it is octal */
}
else if(!base)
base=10; /* or else decimal */
goto jumpin;
do
{ found=1;result=result*base i;str ; /* start converting */
jumpin:
if((i=(unsigned)*str-'0')<10);
else if(i-'A' '0'<='Z'-'A')
i-='A'-10-'0'; /* collating sequence dependency! */
else if(i-'a' '0'<='z'-'a')
i-='a'-10-'0'; /* collating sequence dependency! */
else
break; /* not of this world */
}
while(i<base); /* still of this world */
fault:
if(ptr)
*ptr=found?str:start; /* how far did we get */
return sign?-result:result;
}
#else /* NOstrtol */
#ifndef NOstrerror
#ifndef NOstrlcat
#ifndef NEEDbbzero
#ifndef SLOWstrstr
#ifndef NOstrpbrk
#ifndef NOmemmove
int sublib_dummy_var; /* to prevent insanity in some linkers */
#endif
#endif
#endif
#endif
#endif
#endif
#endif /* NOstrtol */
|
