1 /* $NetBSD: utils.c,v 1.15 2004/07/06 13:05:25 mycroft Exp $ */
4 * Copyright (c) 1992, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * the Center for Software Science of the University of Utah Computer
9 * Science Department. CSS requests users of this software to return
10 * to css-dist@cs.utah.edu any improvements that they make and grant
11 * CSS redistribution rights.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * from: @(#)utils.c 8.1 (Berkeley) 6/4/93
39 * From: Utah Hdr: utils.c 3.1 92/07/06
40 * Author: Jeff Forys, University of Utah CSS
44 * Copyright (c) 1988, 1992 The University of Utah and the Center
45 * for Software Science (CSS).
47 * This code is derived from software contributed to Berkeley by
48 * the Center for Software Science of the University of Utah Computer
49 * Science Department. CSS requests users of this software to return
50 * to css-dist@cs.utah.edu any improvements that they make and grant
51 * CSS redistribution rights.
53 * Redistribution and use in source and binary forms, with or without
54 * modification, are permitted provided that the following conditions
56 * 1. Redistributions of source code must retain the above copyright
57 * notice, this list of conditions and the following disclaimer.
58 * 2. Redistributions in binary form must reproduce the above copyright
59 * notice, this list of conditions and the following disclaimer in the
60 * documentation and/or other materials provided with the distribution.
61 * 3. All advertising materials mentioning features or use of this software
62 * must display the following acknowledgement:
63 * This product includes software developed by the University of
64 * California, Berkeley and its contributors.
65 * 4. Neither the name of the University nor the names of its contributors
66 * may be used to endorse or promote products derived from this software
67 * without specific prior written permission.
69 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
70 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
71 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
72 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
73 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
74 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
75 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
76 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
77 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
78 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
81 * from: @(#)utils.c 8.1 (Berkeley) 6/4/93
83 * From: Utah Hdr: utils.c 3.1 92/07/06
84 * Author: Jeff Forys, University of Utah CSS
87 #include <sys/cdefs.h>
90 static char sccsid
[] = "@(#)utils.c 8.1 (Berkeley) 6/4/93";
92 __RCSID("$NetBSD: utils.c,v 1.15 2004/07/06 13:05:25 mycroft Exp $");
96 #include <sys/param.h>
110 ** DispPkt -- Display the contents of an RMPCONN packet.
113 ** rconn - packet to be displayed.
114 ** direct - direction packet is going (DIR_*).
123 DispPkt(rconn
, direct
)
127 static const char BootFmt
[] = "\t\tRetCode:%u SeqNo:%lx SessID:%x Vers:%u";
128 static const char ReadFmt
[] = "\t\tRetCode:%u Offset:%lx SessID:%x\n";
131 struct rmp_packet
*rmp
;
136 * Since we will be working with RmpConns as well as DbgFp, we
137 * must block signals that can affect either.
139 omask
= sigblock(sigmask(SIGHUP
)|sigmask(SIGUSR1
)|sigmask(SIGUSR2
));
141 if (DbgFp
== NULL
) { /* sanity */
142 (void) sigsetmask(omask
);
146 /* display direction packet is going using '>>>' or '<<<' */
147 fputs((direct
==DIR_RCVD
)?"<<< ":(direct
==DIR_SENT
)?">>> ":"", DbgFp
);
149 /* display packet timestamp */
150 tmp
= localtime((time_t *)&rconn
->tstamp
.tv_sec
);
151 fprintf(DbgFp
, "%02d:%02d:%02d.%06ld ", tmp
->tm_hour
, tmp
->tm_min
,
152 tmp
->tm_sec
, (long int)rconn
->tstamp
.tv_usec
);
154 /* display src or dst addr and information about network interface */
155 fprintf(DbgFp
, "Addr: %s Intf: %s\n", EnetStr(rconn
), IntfName
);
159 /* display IEEE 802.2 Logical Link Control header */
160 (void) fprintf(DbgFp
, "\t802.2 LLC: DSAP:%x SSAP:%x CTRL:%x\n",
161 rmp
->hp_llc
.dsap
, rmp
->hp_llc
.ssap
, ntohs(rmp
->hp_llc
.cntrl
));
163 /* display HP extensions to 802.2 Logical Link Control header */
164 (void) fprintf(DbgFp
, "\tHP Ext: DXSAP:%x SXSAP:%x\n",
165 ntohs(rmp
->hp_llc
.dxsap
), ntohs(rmp
->hp_llc
.sxsap
));
168 * Display information about RMP packet using type field to
169 * determine what kind of packet this is.
171 switch(rmp
->r_type
) {
172 case RMP_BOOT_REQ
: /* boot request */
173 (void) fprintf(DbgFp
, "\tBoot Request:");
174 GETWORD(rmp
->r_brq
.rmp_seqno
, t
);
175 if (ntohs(rmp
->r_brq
.rmp_session
) == RMP_PROBESID
) {
176 if (WORDZE(rmp
->r_brq
.rmp_seqno
))
177 fputs(" (Send Server ID)", DbgFp
);
179 fprintf(DbgFp
," (Send Filename #%u)",t
);
181 (void) fputc('\n', DbgFp
);
182 (void) fprintf(DbgFp
, BootFmt
, rmp
->r_brq
.rmp_retcode
,
183 (unsigned long)t
, ntohs(rmp
->r_brq
.rmp_session
),
184 ntohs(rmp
->r_brq
.rmp_version
));
185 (void) fprintf(DbgFp
, "\n\t\tMachine Type: ");
186 for (i
= 0; i
< RMP_MACHLEN
; i
++)
187 (void) fputc(rmp
->r_brq
.rmp_machtype
[i
], DbgFp
);
188 DspFlnm(rmp
->r_brq
.rmp_flnmsize
, &rmp
->r_brq
.rmp_flnm
);
190 case RMP_BOOT_REPL
: /* boot reply */
191 fprintf(DbgFp
, "\tBoot Reply:\n");
192 GETWORD(rmp
->r_brpl
.rmp_seqno
, t
);
193 (void) fprintf(DbgFp
, BootFmt
, rmp
->r_brpl
.rmp_retcode
,
194 (unsigned long)t
, ntohs(rmp
->r_brpl
.rmp_session
),
195 ntohs(rmp
->r_brpl
.rmp_version
));
196 DspFlnm(rmp
->r_brpl
.rmp_flnmsize
,&rmp
->r_brpl
.rmp_flnm
);
198 case RMP_READ_REQ
: /* read request */
199 (void) fprintf(DbgFp
, "\tRead Request:\n");
200 GETWORD(rmp
->r_rrq
.rmp_offset
, t
);
201 (void) fprintf(DbgFp
, ReadFmt
, rmp
->r_rrq
.rmp_retcode
,
202 (unsigned long)t
, ntohs(rmp
->r_rrq
.rmp_session
));
203 (void) fprintf(DbgFp
, "\t\tNoOfBytes: %u\n",
204 ntohs(rmp
->r_rrq
.rmp_size
));
206 case RMP_READ_REPL
: /* read reply */
207 (void) fprintf(DbgFp
, "\tRead Reply:\n");
208 GETWORD(rmp
->r_rrpl
.rmp_offset
, t
);
209 (void) fprintf(DbgFp
, ReadFmt
, rmp
->r_rrpl
.rmp_retcode
,
210 (unsigned long)t
, ntohs(rmp
->r_rrpl
.rmp_session
));
211 (void) fprintf(DbgFp
, "\t\tNoOfBytesSent: %ld\n",
212 (long)(rconn
->rmplen
- RMPREADSIZE(0)));
214 case RMP_BOOT_DONE
: /* boot complete */
215 (void) fprintf(DbgFp
, "\tBoot Complete:\n");
216 (void) fprintf(DbgFp
, "\t\tRetCode:%u SessID:%x\n",
217 rmp
->r_done
.rmp_retcode
,
218 ntohs(rmp
->r_done
.rmp_session
));
221 (void) fprintf(DbgFp
, "\tUnknown Type:(%d)\n",
224 (void) fputc('\n', DbgFp
);
225 (void) fflush(DbgFp
);
227 (void) sigsetmask(omask
); /* reset old signal mask */
232 ** GetEtherAddr -- convert an RMP (Ethernet) address into a string.
234 ** An RMP BOOT packet has been received. Look at the type field
235 ** and process Boot Requests, Read Requests, and Boot Complete
236 ** packets. Any other type will be dropped with a warning msg.
239 ** addr - array of RMP_ADDRLEN bytes.
242 ** Pointer to static string representation of `addr'.
248 ** - The return value points to a static buffer; it must
249 ** be copied if it's to be saved.
255 static char Hex
[] = "0123456789abcdef";
256 static char etherstr
[RMP_ADDRLEN
*3];
261 * For each byte in `addr', convert it to "<hexchar><hexchar>:".
262 * The last byte does not get a trailing `:' appended.
267 *cp
++ = Hex
[*addr
>> 4 & 0xf];
268 *cp
++ = Hex
[*addr
++ & 0xf];
269 if (++i
== RMP_ADDRLEN
)
280 ** DispFlnm -- Print a string of bytes to DbgFp (often, a file name).
283 ** size - number of bytes to print.
284 ** flnm - address of first byte.
290 ** - Characters are sent to `DbgFp'.
299 (void) fprintf(DbgFp
, "\n\t\tFile Name (%u): <", size
);
300 for (i
= 0; i
< size
; i
++)
301 (void) fputc(*flnm
++, DbgFp
);
302 (void) fputs(">\n", DbgFp
);
307 ** NewClient -- allocate memory for a new CLIENT.
310 ** addr - RMP (Ethernet) address of new client.
313 ** Ptr to new CLIENT or NULL if we ran out of memory.
316 ** - Memory will be malloc'd for the new CLIENT.
317 ** - If malloc() fails, a log message will be generated.
325 if ((ctmp
= (CLIENT
*) malloc(sizeof(CLIENT
))) == NULL
) {
326 syslog(LOG_ERR
, "NewClient: out of memory (%s)",
331 memset(ctmp
, 0, sizeof(CLIENT
));
332 memmove(&ctmp
->addr
[0], addr
, RMP_ADDRLEN
);
337 ** FreeClients -- free linked list of Clients.
346 ** - All malloc'd memory associated with the linked list of
347 ** CLIENTS will be free'd; `Clients' will be set to NULL.
350 ** - This routine must be called with SIGHUP blocked.
357 while (Clients
!= NULL
) {
359 Clients
= Clients
->next
;
365 ** NewStr -- allocate memory for a character array.
368 ** str - null terminated character array.
371 ** Ptr to new character array or NULL if we ran out of memory.
374 ** - Memory will be malloc'd for the new character array.
375 ** - If malloc() fails, a log message will be generated.
383 if ((stmp
= strdup(str
)) == NULL
) {
384 syslog(LOG_ERR
, "NewStr: out of memory (%s)", str
);
392 ** To save time, NewConn and FreeConn maintain a cache of one RMPCONN
393 ** in `LastFree' (defined below).
396 static RMPCONN
*LastFree
= NULL
;
399 ** NewConn -- allocate memory for a new RMPCONN connection.
402 ** rconn - initialization template for new connection.
405 ** Ptr to new RMPCONN or NULL if we ran out of memory.
408 ** - Memory may be malloc'd for the new RMPCONN (if not cached).
409 ** - If malloc() fails, a log message will be generated.
417 if (LastFree
== NULL
) { /* nothing cached; make a new one */
418 if ((rtmp
= (RMPCONN
*) malloc(sizeof(RMPCONN
))) == NULL
) {
419 syslog(LOG_ERR
, "NewConn: out of memory (%s)",
423 } else { /* use the cached RMPCONN */
429 * Copy template into `rtmp', init file descriptor to `-1' and
430 * set ptr to next elem NULL.
432 memmove((char *)rtmp
, (char *)rconn
, sizeof(RMPCONN
));
440 ** FreeConn -- Free memory associated with an RMPCONN connection.
443 ** rtmp - ptr to RMPCONN to be free'd.
449 ** - Memory associated with `rtmp' may be free'd (or cached).
450 ** - File desc associated with `rtmp->bootfd' will be closed.
457 * If the file descriptor is in use, close the file.
459 if (rtmp
->bootfd
>= 0) {
460 (void) close(rtmp
->bootfd
);
464 if (LastFree
== NULL
) /* cache for next time */
466 else /* already one cached; free this one */
471 ** FreeConns -- free linked list of RMPCONN connections.
480 ** - All malloc'd memory associated with the linked list of
481 ** connections will be free'd; `RmpConns' will be set to NULL.
482 ** - If LastFree is != NULL, it too will be free'd & NULL'd.
485 ** - This routine must be called with SIGHUP blocked.
492 while (RmpConns
!= NULL
) {
494 RmpConns
= RmpConns
->next
;
498 if (LastFree
!= NULL
) {
499 free((char *)LastFree
);
505 ** AddConn -- Add a connection to the linked list of connections.
508 ** rconn - connection to be added.
514 ** - RmpConn will point to new connection.
517 ** - This routine must be called with SIGHUP blocked.
523 if (RmpConns
!= NULL
)
524 rconn
->next
= RmpConns
;
529 ** FindConn -- Find a connection in the linked list of connections.
531 ** We use the RMP (Ethernet) address as the basis for determining
532 ** if this is the same connection. According to the Remote Maint
533 ** Protocol, we can only have one connection with any machine.
536 ** rconn - connection to be found.
539 ** Matching connection from linked list or NULL if not found.
545 ** - This routine must be called with SIGHUP blocked.
553 for (rtmp
= RmpConns
; rtmp
!= NULL
; rtmp
= rtmp
->next
)
554 if (memcmp((char *)&rconn
->rmp
.hp_hdr
.saddr
[0],
555 (char *)&rtmp
->rmp
.hp_hdr
.saddr
[0], RMP_ADDRLEN
) == 0)
562 ** RemoveConn -- Remove a connection from the linked list of connections.
565 ** rconn - connection to be removed.
571 ** - If found, an RMPCONN will cease to exist and it will
572 ** be removed from the linked list.
575 ** - This routine must be called with SIGHUP blocked.
581 RMPCONN
*thisrconn
, *lastrconn
;
583 if (RmpConns
== rconn
) { /* easy case */
584 RmpConns
= RmpConns
->next
;
586 } else { /* must traverse linked list */
587 lastrconn
= RmpConns
; /* set back ptr */
588 thisrconn
= lastrconn
->next
; /* set current ptr */
589 while (thisrconn
!= NULL
) {
590 if (rconn
== thisrconn
) { /* found it */
591 lastrconn
->next
= thisrconn
->next
;
595 lastrconn
= thisrconn
;
596 thisrconn
= thisrconn
->next
;