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
|
/* $XConsortium: Berklib.c,v 1.24 94/04/17 20:23:08 dpw Exp kaleb $ */
/*
Copyright (c) 1987 X Consortium
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of the X Consortium shall
not be used in advertising or otherwise to promote the sale, use or
other dealings in this Software without prior written authorization
from the X Consortium.
*/
/*
* These are routines found in BSD but not on all other systems. The core
* MIT distribution does not use them except for ffs in the server, unless
* the system is seriously deficient. You should enable only the ones that
* you need for your system. Use Xfuncs.h in clients to avoid using the
* slow versions of bcopy, bcmp, and bzero provided here.
*/
#include <sys/types.h>
#ifdef hpux
#define WANT_RANDOM
#define WANT_QUE
#endif
#ifdef macII
/* silly bcopy in A/UX does not handle overlaps */
#define WANT_BFUNCS
#define WANT_MEMMOVE
#define NO_BZERO
#define WANT_RANDOM
#endif
#ifdef SVR4
#define WANT_BFUNCS
#define WANT_FFS
#define WANT_RANDOM
#endif
#ifdef hcx
#define WANT_FFS
#endif
#ifdef SYSV
#ifdef i386
#define WANT_FFS
#define WANT_MEMMOVE
#endif
#endif
#ifdef _SEQUENT_
#define WANT_GTOD
#define WANT_FFS
#endif /* _SEQUENT_ */
/* you should use Xfuncs.h in code instead of relying on Berklib */
#ifdef WANT_BFUNCS
#include <X11/Xosdefs.h>
#if (__STDC__ && !defined(X_NOT_STDC_ENV)) || defined(SVR4) || defined(hpux)
#include <string.h>
void bcopy (b1, b2, length)
register char *b1, *b2;
register int length;
{
memmove(b2, b1, (size_t)length);
}
int bcmp (b1, b2, length)
register char *b1, *b2;
register int length;
{
return memcmp(b1, b2, (size_t)length);
}
void bzero (b, length)
register char *b;
register int length;
{
memset(b, 0, (size_t)length);
}
#else
void bcopy (b1, b2, length)
register char *b1, *b2;
register int length;
{
if (b1 < b2) {
b2 += length;
b1 += length;
while (length--)
*--b2 = *--b1;
} else {
while (length--)
*b2++ = *b1++;
}
}
#if defined(SYSV)
#include <memory.h>
int bcmp (b1, b2, length)
register char *b1, *b2;
register int length;
{
return memcmp(b1, b2, length);
}
#ifndef NO_BZERO
bzero (b, length)
register char *b;
register int length;
{
memset(b, 0, length);
}
#endif
#else
int bcmp (b1, b2, length)
register char *b1, *b2;
register int length;
{
while (length--) {
if (*b1++ != *b2++) return 1;
}
return 0;
}
void bzero (b, length)
register char *b;
register int length;
{
while (length--)
*b++ = '\0';
}
#endif
#endif
#endif /* WANT_BFUNCS */
#ifdef WANT_MEMMOVE
char *memmove (b1, b2, length)
register char *b1, *b2;
register int length;
{
char *sb1 = b1;
if (b2 < b1) {
b1 += length;
b2 += length;
while (length--)
*--b1 = *--b2;
} else {
while (length--)
*b1++ = *b2++;
}
return sb1;
}
#endif
#ifdef WANT_FFS
int
ffs(mask)
unsigned int mask;
{
register i;
if ( ! mask ) return 0;
i = 1;
while (! (mask & 1)) {
i++;
mask = mask >> 1;
}
return i;
}
#endif
#ifdef WANT_RANDOM
#if defined(SYSV) || defined(SVR4) || defined(hpux)
long lrand48();
long random()
{
return (lrand48());
}
void srandom(seed)
int seed;
{
srand48(seed);
}
#else
long random()
{
return (rand());
}
void srandom(seed)
int seed;
{
srand(seed);
}
#endif
#endif /* WANT_RANDOM */
/*
* insque, remque - insert/remove element from a queue
*
* DESCRIPTION
* Insque and remque manipulate queues built from doubly linked
* lists. Each element in the queue must in the form of
* ``struct qelem''. Insque inserts elem in a queue immedi-
* ately after pred; remque removes an entry elem from a queue.
*
* SEE ALSO
* ``VAX Architecture Handbook'', pp. 228-235.
*/
#ifdef WANT_QUE
struct qelem {
struct qelem *q_forw;
struct qelem *q_back;
char *q_data;
};
insque(elem, pred)
register struct qelem *elem, *pred;
{
register struct qelem *q;
/* Insert locking code here */
if ( elem->q_forw = q = (pred ? pred->q_forw : pred) )
q->q_back = elem;
if ( elem->q_back = pred )
pred->q_forw = elem;
/* Insert unlocking code here */
}
remque(elem)
register struct qelem *elem;
{
register struct qelem *q;
if ( ! elem ) return;
/* Insert locking code here */
if ( q = elem->q_back ) q->q_forw = elem->q_forw;
if ( q = elem->q_forw ) q->q_back = elem->q_back;
/* insert unlocking code here */
}
#endif /* WANT_QUE */
/*
* gettimeofday emulation
* Caution -- emulation is incomplete
* - has only second, not microsecond, resolution.
* - does not return timezone info.
*/
#ifdef WANT_GTOD
#ifdef _SEQUENT_
#include <X11/Xos.h>
#endif /* _SEQUENT_ */
int gettimeofday (tvp, tzp)
struct timeval *tvp;
struct timezone *tzp;
{
#ifdef _SEQUENT_
/*
* Sequent has microsecond resolution. Need to link with -lseq
*/
get_process_stats (tvp, -1, NULL, NULL);
#ifndef SVR4
if (tzp)
{
tzset ();
tzp->tz_minuteswest = timezone / 60;
tzp->tz_dsttime = daylight;
}
#endif /* SVR4 */
return (0);
#else /* _SEQUENT_ */
time (&tvp->tv_sec);
tvp->tv_usec = 0L;
#ifndef SVR4
if (tzp) {
fprintf( stderr,
"Warning: gettimeofday() emulation does not return timezone\n"
);
}
#endif /* SVR4 */
#endif /* _SEQUENT_ */
}
#endif /* WANT_GTOD */
|