2 * Copyright (c) 1995 John Hay. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 * 3. All advertising materials mentioning features or use of this software
13 * must display the following acknowledgement:
14 * This product includes software developed by John Hay.
15 * 4. Neither the name of the author nor the names of any co-contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY John Hay AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL John Hay OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * $FreeBSD: src/usr.sbin/IPXrouted/sap_input.c,v 1.7 1999/08/28 01:15:04 peter Exp $
35 * IPX Routing Table Management Daemon
42 * Process a newly received packet.
45 sap_input(struct sockaddr
*from
, int size
)
49 struct sap_entry
*sap
;
51 struct interface
*ifp
= NULL
;
53 struct sockaddr_ipx
*ipxp
;
55 ifp
= if_ifwithnet(from
);
56 ipxp
= (struct sockaddr_ipx
*)from
;
59 fprintf(ftrace
, "Received bogus packet from %s\n",
60 ipxdp_ntoa(&ipxp
->sipx_addr
));
66 dumpsappacket(ftrace
, "received", from
, (char *)sap_msg
, size
);
68 if (from
->sa_family
>= AF_MAX
)
70 afp
= &afswitch
[from
->sa_family
];
72 size
-= sizeof (u_short
) /* command */;
75 switch (ntohs(sap_msg
->sap_cmd
)) {
79 fprintf(ftrace
, "Received a sap REQ_NEAR packet.\n");
82 sap
= sap_nearestserver(n
->ServType
, ifp
);
85 sap_msg
->sap_cmd
= htons(SAP_RESP_NEAR
);
87 n
->hops
= htons(ntohs(n
->hops
) + 1);
88 if (ntohs(n
->hops
) >= HOPCNT_INFINITY
)
91 newsize
= sizeof(struct sap_info
) + sizeof(struct sap_packet
);
92 (*afp
->af_output
)(sapsock
, 0, from
, newsize
);
94 fprintf(ftrace
, "sap_nearestserver %X %s returned:\n",
97 fprintf(ftrace
, " service %04X %-20.20s "
98 "addr %s.%04X metric %d\n",
99 ntohs(sap
->sap
.ServType
),
101 ipxdp_ntoa(&sap
->sap
.ipx
),
102 ntohs(sap
->sap
.ipx
.x_port
),
103 ntohs(sap
->sap
.hops
));
109 fprintf(ftrace
, "Received a sap REQ packet.\n");
111 sap_supply(from
, 0, ifp
, n
->ServType
, 0);
115 /* XXX We do nothing here, for the moment.
116 * Maybe we should check if the service is in our table?
120 fprintf(ftrace
, "Received a sap RESP_NEAR packet.\n");
126 fprintf(ftrace
, "Received a sap RESP packet.\n");
128 (*afp
->af_canon
)(from
);
130 for (; size
> 0; size
-= sizeof (struct sap_info
), n
++) {
131 if (size
< sizeof (struct netinfo
))
134 * The idea here is that if the hop count is more
135 * than INFINITY it is bogus and should be discarded.
136 * If it is equal to INFINITY it is a message to say
137 * that a service went down. If we don't allready
138 * have it in our tables discard it. Otherwise
139 * update our table and set the timer to EXPIRE_TIME
140 * so that it is removed next time we go through the
143 if (ntohs(n
->hops
) > HOPCNT_INFINITY
)
145 sap
= sap_lookup(n
->ServType
, n
->ServName
);
147 if (ntohs(n
->hops
) == HOPCNT_INFINITY
)
155 * A clone is a different route to the same service
156 * with exactly the same cost (metric).
157 * They must all be recorded because those interfaces
158 * must be handled in the same way as the first route
159 * to that service. ie When using the split horizon
160 * algorithm we must look at these interfaces also.
162 * Update if from gateway and different,
163 * from anywhere and less hops or
164 * getting stale and equivalent.
166 if (((ifp
!= sap
->ifp
) ||
167 !equal(&sap
->source
, from
)) &&
168 (n
->hops
== sap
->sap
.hops
) &&
169 (ntohs(n
->hops
) != HOPCNT_INFINITY
)) {
170 struct sap_entry
*tsap
= sap
->clone
;
173 if ((ifp
== tsap
->ifp
) &&
174 equal(&tsap
->source
, from
)) {
181 sap_add_clone(sap
, n
, from
);
185 if ((ifp
== sap
->ifp
) &&
186 equal(&sap
->source
, from
) &&
187 (ntohs(n
->hops
) == ntohs(sap
->sap
.hops
)))
189 else if (((ifp
== sap
->ifp
) &&
190 equal(&sap
->source
, from
) &&
191 (n
->hops
!= sap
->sap
.hops
)) ||
192 (ntohs(n
->hops
) < ntohs(sap
->sap
.hops
)) ||
193 (sap
->timer
> (EXPIRE_TIME
*2/3) &&
194 ntohs(sap
->sap
.hops
) == ntohs(n
->hops
) &&
195 ntohs(n
->hops
) != HOPCNT_INFINITY
)) {
196 sap_change(sap
, n
, from
);
201 struct sap_entry
*sap
;
205 for (sh
= sap_head
; sh
< &sap_head
[SAPHASHSIZ
]; sh
++)
207 sap
!= (struct sap_entry
*)sh
;
209 sap
->state
&= ~RTS_CHANGED
;