2 * Copyright (c) 1988, 1992 The University of Utah and the Center
3 * for Software Science (CSS).
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. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 * from: @(#)utils.c 8.1 (Berkeley) 6/4/93
43 * From: Utah Hdr: utils.c 3.1 92/07/06
44 * Author: Jeff Forys, University of Utah CSS
49 static const char sccsid[] = "@(#)utils.c 8.1 (Berkeley) 6/4/93";
51 static const char rcsid[] =
52 "$FreeBSD: src/libexec/rbootd/utils.c,v 1.5 1999/08/28 00:09:46 peter Exp $";
55 #include <sys/param.h>
69 ** DispPkt -- Display the contents of an RMPCONN packet.
72 ** rconn - packet to be displayed.
73 ** direct - direction packet is going (DIR_*).
82 DispPkt(rconn, direct)
86 static char BootFmt[] = "\t\tRetCode:%u SeqNo:%lx SessID:%x Vers:%u";
87 static char ReadFmt[] = "\t\tRetCode:%u Offset:%lx SessID:%x\n";
90 struct rmp_packet *rmp;
95 * Since we will be working with RmpConns as well as DbgFp, we
96 * must block signals that can affect either.
98 omask = sigblock(sigmask(SIGHUP)|sigmask(SIGUSR1)|sigmask(SIGUSR2));
100 if (DbgFp == NULL) { /* sanity */
101 (void) sigsetmask(omask);
105 /* display direction packet is going using '>>>' or '<<<' */
106 fputs((direct==DIR_RCVD)?"<<< ":(direct==DIR_SENT)?">>> ":"", DbgFp);
108 /* display packet timestamp */
109 tmp = localtime((time_t *)&rconn->tstamp.tv_sec);
110 fprintf(DbgFp, "%02d:%02d:%02d.%06ld ", tmp->tm_hour, tmp->tm_min,
111 tmp->tm_sec, rconn->tstamp.tv_usec);
113 /* display src or dst addr and information about network interface */
114 fprintf(DbgFp, "Addr: %s Intf: %s\n", EnetStr(rconn), IntfName);
118 /* display IEEE 802.2 Logical Link Control header */
119 (void) fprintf(DbgFp, "\t802.2 LLC: DSAP:%x SSAP:%x CTRL:%x\n",
120 rmp->hp_llc.dsap, rmp->hp_llc.ssap, ntohs(rmp->hp_llc.cntrl));
122 /* display HP extensions to 802.2 Logical Link Control header */
123 (void) fprintf(DbgFp, "\tHP Ext: DXSAP:%x SXSAP:%x\n",
124 ntohs(rmp->hp_llc.dxsap), ntohs(rmp->hp_llc.sxsap));
127 * Display information about RMP packet using type field to
128 * determine what kind of packet this is.
130 switch(rmp->r_type) {
131 case RMP_BOOT_REQ: /* boot request */
132 (void) fprintf(DbgFp, "\tBoot Request:");
133 GETWORD(rmp->r_brq.rmp_seqno, t);
134 if (ntohs(rmp->r_brq.rmp_session) == RMP_PROBESID) {
135 if (WORDZE(rmp->r_brq.rmp_seqno))
136 fputs(" (Send Server ID)", DbgFp);
138 fprintf(DbgFp," (Send Filename #%u)",t);
140 (void) fputc('\n', DbgFp);
141 (void) fprintf(DbgFp, BootFmt, rmp->r_brq.rmp_retcode,
142 t, ntohs(rmp->r_brq.rmp_session),
143 ntohs(rmp->r_brq.rmp_version));
144 (void) fprintf(DbgFp, "\n\t\tMachine Type: ");
145 for (i = 0; i < RMP_MACHLEN; i++)
146 (void) fputc(rmp->r_brq.rmp_machtype[i], DbgFp);
147 DspFlnm(rmp->r_brq.rmp_flnmsize, &rmp->r_brq.rmp_flnm);
149 case RMP_BOOT_REPL: /* boot reply */
150 fprintf(DbgFp, "\tBoot Reply:\n");
151 GETWORD(rmp->r_brpl.rmp_seqno, t);
152 (void) fprintf(DbgFp, BootFmt, rmp->r_brpl.rmp_retcode,
153 t, ntohs(rmp->r_brpl.rmp_session),
154 ntohs(rmp->r_brpl.rmp_version));
155 DspFlnm(rmp->r_brpl.rmp_flnmsize,&rmp->r_brpl.rmp_flnm);
157 case RMP_READ_REQ: /* read request */
158 (void) fprintf(DbgFp, "\tRead Request:\n");
159 GETWORD(rmp->r_rrq.rmp_offset, t);
160 (void) fprintf(DbgFp, ReadFmt, rmp->r_rrq.rmp_retcode,
161 t, ntohs(rmp->r_rrq.rmp_session));
162 (void) fprintf(DbgFp, "\t\tNoOfBytes: %u\n",
163 ntohs(rmp->r_rrq.rmp_size));
165 case RMP_READ_REPL: /* read reply */
166 (void) fprintf(DbgFp, "\tRead Reply:\n");
167 GETWORD(rmp->r_rrpl.rmp_offset, t);
168 (void) fprintf(DbgFp, ReadFmt, rmp->r_rrpl.rmp_retcode,
169 t, ntohs(rmp->r_rrpl.rmp_session));
170 (void) fprintf(DbgFp, "\t\tNoOfBytesSent: %d\n",
171 rconn->rmplen - RMPREADSIZE(0));
173 case RMP_BOOT_DONE: /* boot complete */
174 (void) fprintf(DbgFp, "\tBoot Complete:\n");
175 (void) fprintf(DbgFp, "\t\tRetCode:%u SessID:%x\n",
176 rmp->r_done.rmp_retcode,
177 ntohs(rmp->r_done.rmp_session));
180 (void) fprintf(DbgFp, "\tUnknown Type:(%d)\n",
183 (void) fputc('\n', DbgFp);
184 (void) fflush(DbgFp);
186 (void) sigsetmask(omask); /* reset old signal mask */
191 ** GetEtherAddr -- convert an RMP (Ethernet) address into a string.
193 ** An RMP BOOT packet has been received. Look at the type field
194 ** and process Boot Requests, Read Requests, and Boot Complete
195 ** packets. Any other type will be dropped with a warning msg.
198 ** addr - array of RMP_ADDRLEN bytes.
201 ** Pointer to static string representation of `addr'.
207 ** - The return value points to a static buffer; it must
208 ** be copied if it's to be saved.
214 static char Hex[] = "0123456789abcdef";
215 static char etherstr[RMP_ADDRLEN*3];
220 * For each byte in `addr', convert it to "<hexchar><hexchar>:".
221 * The last byte does not get a trailing `:' appended.
226 *cp++ = Hex[*addr >> 4 & 0xf];
227 *cp++ = Hex[*addr++ & 0xf];
228 if (++i == RMP_ADDRLEN)
239 ** DispFlnm -- Print a string of bytes to DbgFp (often, a file name).
242 ** size - number of bytes to print.
243 ** flnm - address of first byte.
249 ** - Characters are sent to `DbgFp'.
258 (void) fprintf(DbgFp, "\n\t\tFile Name (%u): <", size);
259 for (i = 0; i < size; i++)
260 (void) fputc(*flnm++, DbgFp);
261 (void) fputs(">\n", DbgFp);
266 ** NewClient -- allocate memory for a new CLIENT.
269 ** addr - RMP (Ethernet) address of new client.
272 ** Ptr to new CLIENT or NULL if we ran out of memory.
275 ** - Memory will be malloc'd for the new CLIENT.
276 ** - If malloc() fails, a log message will be generated.
284 if ((ctmp = (CLIENT *) malloc(sizeof(CLIENT))) == NULL) {
285 syslog(LOG_ERR, "NewClient: out of memory (%s)",
290 memset(ctmp, 0, sizeof(CLIENT));
291 memmove(&ctmp->addr[0], addr, RMP_ADDRLEN);
296 ** FreeClient -- free linked list of Clients.
305 ** - All malloc'd memory associated with the linked list of
306 ** CLIENTS will be free'd; `Clients' will be set to NULL.
309 ** - This routine must be called with SIGHUP blocked.
316 while (Clients != NULL) {
318 Clients = Clients->next;
324 ** NewStr -- allocate memory for a character array.
327 ** str - null terminated character array.
330 ** Ptr to new character array or NULL if we ran out of memory.
333 ** - Memory will be malloc'd for the new character array.
334 ** - If malloc() fails, a log message will be generated.
342 if ((stmp = (char *)malloc((unsigned) (strlen(str)+1))) == NULL) {
343 syslog(LOG_ERR, "NewStr: out of memory (%s)", str);
347 (void) strcpy(stmp, str);
352 ** To save time, NewConn and FreeConn maintain a cache of one RMPCONN
353 ** in `LastFree' (defined below).
356 static RMPCONN *LastFree = NULL;
359 ** NewConn -- allocate memory for a new RMPCONN connection.
362 ** rconn - initialization template for new connection.
365 ** Ptr to new RMPCONN or NULL if we ran out of memory.
368 ** - Memory may be malloc'd for the new RMPCONN (if not cached).
369 ** - If malloc() fails, a log message will be generated.
377 if (LastFree == NULL) { /* nothing cached; make a new one */
378 if ((rtmp = (RMPCONN *) malloc(sizeof(RMPCONN))) == NULL) {
379 syslog(LOG_ERR, "NewConn: out of memory (%s)",
383 } else { /* use the cached RMPCONN */
389 * Copy template into `rtmp', init file descriptor to `-1' and
390 * set ptr to next elem NULL.
392 memmove((char *)rtmp, (char *)rconn, sizeof(RMPCONN));
400 ** FreeConn -- Free memory associated with an RMPCONN connection.
403 ** rtmp - ptr to RMPCONN to be free'd.
409 ** - Memory associated with `rtmp' may be free'd (or cached).
410 ** - File desc associated with `rtmp->bootfd' will be closed.
417 * If the file descriptor is in use, close the file.
419 if (rtmp->bootfd >= 0) {
420 (void) close(rtmp->bootfd);
424 if (LastFree == NULL) /* cache for next time */
426 else /* already one cached; free this one */
431 ** FreeConns -- free linked list of RMPCONN connections.
440 ** - All malloc'd memory associated with the linked list of
441 ** connections will be free'd; `RmpConns' will be set to NULL.
442 ** - If LastFree is != NULL, it too will be free'd & NULL'd.
445 ** - This routine must be called with SIGHUP blocked.
452 while (RmpConns != NULL) {
454 RmpConns = RmpConns->next;
458 if (LastFree != NULL) {
459 free((char *)LastFree);
465 ** AddConn -- Add a connection to the linked list of connections.
468 ** rconn - connection to be added.
474 ** - RmpConn will point to new connection.
477 ** - This routine must be called with SIGHUP blocked.
483 if (RmpConns != NULL)
484 rconn->next = RmpConns;
489 ** FindConn -- Find a connection in the linked list of connections.
491 ** We use the RMP (Ethernet) address as the basis for determining
492 ** if this is the same connection. According to the Remote Maint
493 ** Protocol, we can only have one connection with any machine.
496 ** rconn - connection to be found.
499 ** Matching connection from linked list or NULL if not found.
505 ** - This routine must be called with SIGHUP blocked.
513 for (rtmp = RmpConns; rtmp != NULL; rtmp = rtmp->next)
514 if (bcmp((char *)&rconn->rmp.hp_hdr.saddr[0],
515 (char *)&rtmp->rmp.hp_hdr.saddr[0], RMP_ADDRLEN) == 0)
522 ** RemoveConn -- Remove a connection from the linked list of connections.
525 ** rconn - connection to be removed.
531 ** - If found, an RMPCONN will cease to exist and it will
532 ** be removed from the linked list.
535 ** - This routine must be called with SIGHUP blocked.
541 RMPCONN *thisrconn, *lastrconn;
543 if (RmpConns == rconn) { /* easy case */
544 RmpConns = RmpConns->next;
546 } else { /* must traverse linked list */
547 lastrconn = RmpConns; /* set back ptr */
548 thisrconn = lastrconn->next; /* set current ptr */
549 while (thisrconn != NULL) {
550 if (rconn == thisrconn) { /* found it */
551 lastrconn->next = thisrconn->next;
555 lastrconn = thisrconn;
556 thisrconn = thisrconn->next;