1/*
2 * Copyright (c) 1995 John Hay.  All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
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.
18 *
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
29 * SUCH DAMAGE.
30 *
31 * $FreeBSD$
32 */
33#ifndef _SAP_H_
34#define _SAP_H_
35
36#define SAP_REQ			1
37#define SAP_RESP		2
38#define SAP_REQ_NEAR		3
39#define SAP_RESP_NEAR		4
40
41#define SAPCMD_MAX		5
42#ifdef SAPCMDS
43char *sapcmds[SAPCMD_MAX] =
44	{ "#0", "REQUEST", "RESPONSE", "REQ NEAREST", "RESP NEAREST"};
45#endif
46
47#define MAXSAPENTRIES		7
48#define SAP_WILDCARD		0xFFFF
49#define SERVNAMELEN		48
50typedef struct sap_info {
51	u_short ServType;
52	char    ServName[SERVNAMELEN];
53	struct ipx_addr ipx;
54	u_short hops;
55	}sap_info;
56
57typedef struct sap_packet {
58	u_short sap_cmd;
59	sap_info sap[0]; /* Variable length. */
60	}sap_packet;
61
62typedef struct sap_entry {
63	struct sap_entry *forw;
64	struct sap_entry *back;
65	struct sap_entry *clone;
66	struct interface *ifp;
67	struct sap_info   sap;
68	struct sockaddr   source;
69	int hash;
70	int state;
71	int timer;
72	}sap_entry;
73
74#define SAPHASHSIZ		256		/* Should be a power of 2 */
75#define SAPHASHMASK		(SAPHASHSIZ-1)
76typedef struct sap_hash {
77	struct sap_entry *forw;
78	struct sap_entry *back;
79	}sap_hash;
80
81extern sap_hash sap_head[SAPHASHSIZ];
82
83extern struct   sap_packet *sap_msg;
84
85void sapinit(void);
86void sap_input(struct sockaddr *from, int size);
87void sapsndmsg(struct sockaddr *dst, int flags, struct interface *ifp,
88		int changesonly);
89void sap_supply_toall(int changesonly);
90void sap_supply(struct sockaddr *dst,
91                int flags,
92		struct interface *ifp,
93		int ServType,
94		int changesonly);
95
96struct sap_entry *sap_lookup(u_short ServType, char *ServName);
97struct sap_entry *sap_nearestserver(ushort ServType, struct interface *ifp);
98void sap_add(struct sap_info *si, struct sockaddr *from);
99void sap_change(struct sap_entry *sap,
100                struct sap_info *si,
101		struct sockaddr *from);
102void sap_add_clone(struct sap_entry *sap,
103                   struct sap_info *clone,
104		   struct sockaddr *from);
105void sap_delete(struct sap_entry *sap);
106
107#endif /*_SAP_H_*/
108
109