]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - trek/utility.c
need -lcompat
[bsdgames-darwin.git] / trek / utility.c
1 /*
2 * Copyright (c) 1980 Regents of the University of California.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34 #ifndef lint
35 /*static char sccsid[] = "from: @(#)utility.c 5.4 (Berkeley) 6/1/90";*/
36 static char rcsid[] = "$Id: utility.c,v 1.2 1993/08/01 18:49:54 mycroft Exp $";
37 #endif /* not lint */
38
39 /*
40 ** ASSORTED UTILITY ROUTINES
41 */
42
43 /*
44 ** BLOCK MOVE
45 **
46 ** Moves a block of storage of length `l' bytes from the data
47 ** area pointed to by `a' to the area pointed to by `b'.
48 ** Returns the address of the byte following the `b' field.
49 ** Overflow of `b' is not tested.
50 */
51
52 char *bmove(a, b, l)
53 char *a, *b;
54 int l;
55 {
56 register int n;
57 register char *p, *q;
58
59 p = a;
60 q = b;
61 n = l;
62 while (n--)
63 *q++ = *p++;
64 return (q);
65 }
66
67
68 /*
69 ** STRING EQUALITY TEST
70 ** null-terminated strings `a' and `b' are tested for
71 ** absolute equality.
72 ** returns one if equal, zero otherwise.
73 */
74
75 sequal(a, b)
76 char *a, *b;
77 {
78 register char *p, *q;
79
80 p = a;
81 q = b;
82 while (*p || *q)
83 if (*p++ != *q++)
84 return(0);
85 return(1);
86 }
87
88
89 /*
90 ** STRING CONCATENATE
91 **
92 ** The strings `s1' and `s2' are concatenated and stored into
93 ** `s3'. It is ok for `s1' to equal `s3', but terrible things
94 ** will happen if `s2' equals `s3'. The return value is is a
95 ** pointer to the end of `s3' field.
96 */
97
98 char *concat(s1, s2, s3)
99 char *s1, *s2, *s3;
100 {
101 register char *p;
102 register char *q;
103
104 p = s3;
105 q = s1;
106 while (*q)
107 *p++ = *q++;
108 q = s2;
109 while (*q)
110 *p++ = *q++;
111 *p = 0;
112 return (p);
113 }
114
115
116 /*
117 ** FIND STRING LENGTH
118 **
119 ** The length of string `s' (excluding the null byte which
120 ** terminates the string) is returned.
121 */
122
123 length(s)
124 char *s;
125 {
126 register int l;
127 register char *p;
128
129 l = 0;
130 p = s;
131 while (*p++)
132 l++;
133 return(l);
134 }
135
136
137 /*
138 ** SYSTEM ERROR
139 */
140
141 syserr(p0, p1, p2, p3, p4, p5)
142 {
143 extern int errno;
144
145 printf("\n\07TREK SYSERR: ");
146 printf(p0, p1, p2, p3, p4, p5);
147 printf("\n");
148 if (errno)
149 printf("\tsystem error %d\n", errno);
150 exit(-1);
151 }