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
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
|
/* This file contains code for X-CHESS.
Copyright (C) 1986 Free Software Foundation, Inc.
This file is part of X-CHESS.
X-CHESS is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY. No author or distributor
accepts responsibility to anyone for the consequences of using it
or for whether it serves any particular purpose or works at all,
unless he says so in writing. Refer to the X-CHESS General Public
License for full details.
Everyone is granted permission to copy, modify and redistribute
X-CHESS, but only under the conditions described in the
X-CHESS General Public License. A copy of this license is
supposed to have been given to you along with X-CHESS so you
can know your rights and responsibilities. It should be in a
file named COPYING. Among other things, the copyright notice
and this notice must be preserved on all copies. */
/* RCS Info: $Revision: 1.1 $ on $Date: 86/11/01 17:08:40 $
* $Source: /users/faustus/xchess/RCS/std.c,v $
* Copyright (c) 1985 Wayne A. Christopher, U. C. Berkeley CAD Group
*
* Utility routines.
*/
#include "std.h"
#ifndef IBMPC
#include <sys/types.h>
#endif not IBMPC
#ifdef UNIX
#include <signal.h>
#include <pwd.h>
#endif UNIX
#ifdef BSD
#include <sys/time.h>
#include <sys/resource.h>
#endif BSD
extern char **environ;
bool
prefix(p, s)
register char *p, *s;
{
while (*p && (*p == *s))
p++, s++;
if (!*p)
return (true);
else
return (false);
}
/* Create a copy of a string. */
char *
copy(str)
char *str;
{
char *p, *tmalloc();
p = tmalloc(strlen(str) + 1);
strcpy(p, str);
return(p);
}
/* Determine whether sub is a substring of str. */
bool
substring(sub, str)
register char *str, *sub;
{
register char *s;
while(*str) {
if(*str == *sub) {
for(s = sub; *s; s++)
if(*s != *str++)
break;
if(*s == '\0')
return (true);
}
str++;
}
return (false);
}
/* Malloc num bytes and initialize to zero. Fatal error if the space can't
* be malloc'd.
*/
char *
tmalloc(num)
register int num;
{
register char *s;
char *malloc();
s = malloc((unsigned) num);
if (!s) {
fatal("malloc: can't allocate %d bytes", num);
}
bzero(s, num);
return(s);
}
char *
trealloc(ptr, num)
char *ptr;
int num;
{
register char *s;
char *realloc();
s = realloc(ptr, (unsigned) num);
if (!s) {
fatal("realloc: can't allocate %d bytes", num);
}
/* Well, this won't be zeroed... Too bad... */
return(s);
}
/* Append one character to a string. Don't check for overflow. */
void
appendc(s, c)
char *s, c;
{
while (*s)
s++;
*s++ = c;
*s = '\0';
return;
}
int
scannum(str)
char *str;
{
int i = 0;
while(isdigit(*str))
i = i * 10 + *(str++) - '0';
return(i);
}
/* Case insensitive prefix. */
bool
ciprefix(p, s)
register char *p, *s;
{
while (*p) {
if ((isupper(*p) ? tolower(*p) : *p) !=
(isupper(*s) ? tolower(*s) : *s))
return(false);
p++;
s++;
}
return (true);
}
/* Case insensitive strcmp... */
bool
cieq(p, s)
register char *p, *s;
{
while (*p) {
if ((isupper(*p) ? tolower(*p) : *p) !=
(isupper(*s) ? tolower(*s) : *s))
return(false);
p++;
s++;
}
return (!*s);
}
#ifdef BSD
/* Return the date. Return value is static data. */
char *
datestring()
{
register char *tzn;
struct tm *tp;
static char tbuf[40];
char *ap;
struct timeval tv;
struct timezone tz;
char *timezone(), *asctime();
int i;
struct tm *localtime();
(void) gettimeofday(&tv, &tz);
tp = localtime((time_t *) &tv.tv_sec);
ap = asctime(tp);
tzn = timezone(tz.tz_minuteswest, tp->tm_isdst);
sprintf(tbuf, "%.20s", ap);
if (tzn)
strcat(tbuf, tzn);
strcat(tbuf, ap + 19);
i = strlen(tbuf);
tbuf[i - 1] = '\0';
return (tbuf);
}
#else BSD
/* Give it a try... */
char *
datestring()
{
long i;
static char buf[64];
i = time(0);
strcpy(buf, ctime(&i));
buf[strlen(buf) - 1] = '\0'; /* Kill the nl. */
return (buf);
}
#endif
/* How many seconds have elapsed in running time. */
int
seconds()
{
#ifdef BSD
struct rusage ruse;
getrusage(RUSAGE_SELF, &ruse);
return (ruse.ru_utime.tv_sec);
#else BSD
#endif BSD
}
/* A few things that may not exist on non-unix systems. */
#ifndef BSD
#ifndef index
char *
index(s, c)
register char *s;
register char c;
{
while ((*s != c) && (*s != '\0'))
s++;
if (*s == '\0')
return ((char *) 0);
else
return (s);
}
#endif not index
#ifndef rindex
char *
rindex(s, c)
register char *s;
register char c;
{
register char *t;
for (t = s; *t != '\0'; t++);
while ((*t != c) && (t != s))
t--;
if (t == s)
return ((char *) 0);
else
return (t);
}
#endif not rindex
#ifndef bcopy
void
bcopy(from, to, num)
register char *from, *to;
register int num;
{
while (num-- > 0)
*to++ = *from++;
return;
}
#endif not bcopy
#ifndef bzero
void
bzero(ptr, num)
register char *ptr;
register int num;
{
while (num-- > 0)
*ptr++ = '\0';
return;
}
#endif not bzero
/* This might not be around... If not then forget about sorting... */
void qsort() {}
#endif BSD
char *
gettok(s)
char **s;
{
char buf[BSIZE];
int i = 0;
while (isspace(**s))
(*s)++;
if (!**s)
return (NULL);
while (**s && !isspace(**s))
buf[i++] = *(*s)++;
buf[i] = '\0';
while (isspace(**s))
(*s)++;
return (copy(buf));
}
/* Die horribly. */
/* VARARGS1 */
void
fatal(s, args)
char *s;
{
fputs("Internal Error: ", stderr);
_doprnt(s, &args, stderr);
putc('\n', stderr);
kill(getpid(), SIGIOT);
/* NOTREACHED */
}
void
setenv(name, value)
char *name, *value;
{
int i;
char **xx, *s;
s = tmalloc(strlen(name) + 2);
sprintf(s, "%s=", name);
/* Copy the old environment... */
for (i = 0; environ[i]; i++)
if (prefix(s, environ[i]))
break;
if (!environ[i]) {
xx = (char **) tmalloc((i + 2) * sizeof (char *));
for (i = 0; environ[i]; i++)
xx[i] = environ[i];
xx[i + 1] = NULL;
environ = xx;
} else
xx = environ;
xx[i] = tmalloc(strlen(name) + strlen(value) + 2);
sprintf(xx[i], "%s=%s", name, value);
return;
}
char *
getusername()
{
int i = getuid();
struct passwd *pw = getpwuid(i);
return (pw ? pw->pw_name : NULL);
}
char *
gethome()
{
int i = getuid();
struct passwd *pw = getpwuid(i);
return (pw ? pw->pw_dir : "/strange");
}
char *
tildexpand(s)
char *s;
{
struct passwd *pw;
char *n, buf[64];
int i;
if (*s != '~')
return (copy(s));
for (s++, i = 0; *s != '/'; s++, i++)
buf[i] = *s;
buf[i] = '\0';
if (!i)
pw = getpwuid(getuid());
else
pw = getpwnam(buf);
if (!pw)
return (s);
n = tmalloc(strlen(s) + strlen(pw->pw_dir) + 1);
strcpy(n, pw->pw_dir);
strcat(n, s);
return (n);
}
|