1/*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1988, 1992 The University of Utah and the Center
5 *	for Software Science (CSS).
6 * Copyright (c) 1992, 1993
7 *	The Regents of the University of California.  All rights reserved.
8 *
9 * This code is derived from software contributed to Berkeley by
10 * the Center for Software Science of the University of Utah Computer
11 * Science Department.  CSS requests users of this software to return
12 * to css-dist@cs.utah.edu any improvements that they make and grant
13 * CSS redistribution rights.
14 *
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
17 * are met:
18 * 1. Redistributions of source code must retain the above copyright
19 *    notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 *    notice, this list of conditions and the following disclaimer in the
22 *    documentation and/or other materials provided with the distribution.
23 * 3. Neither the name of the University nor the names of its contributors
24 *    may be used to endorse or promote products derived from this software
25 *    without specific prior written permission.
26 *
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * SUCH DAMAGE.
38 *
39 * From: Utah Hdr: rmp.h 3.1 92/07/06
40 * Author: Jeff Forys, University of Utah CSS
41 */
42
43/*
44 *  Define MIN/MAX sizes of RMP (ethernet) packet.
45 *  For ease of computation, the 4 octet CRC field is not included.
46 *
47 *  MCLBYTES is for bpfwrite(); it is adamant about using a cluster.
48 */
49
50#define	RMP_MAX_PACKET	MIN(1514,MCLBYTES)
51#define	RMP_MIN_PACKET	60
52
53/*
54 *  Define RMP/Ethernet Multicast address (9:0:9:0:0:4) and its length.
55 */
56#define	RMP_ADDR	{ 0x9, 0x0, 0x9, 0x0, 0x0, 0x4 }
57#define	RMP_ADDRLEN	6
58
59/*
60 *  Define IEEE802.2 (Logical Link Control) information.
61 */
62#define	IEEE_DSAP_HP	0xF8	/* Destination Service Access Point */
63#define	IEEE_SSAP_HP	0xF8	/* Source Service Access Point */
64#define	IEEE_CNTL_HP	0x0300	/* Type 1 / I format control information */
65
66#define	HPEXT_DXSAP	0x608	/* HP Destination Service Access Point */
67#define	HPEXT_SXSAP	0x609	/* HP Source Service Access Point */
68
69/*
70 *  802.3-style "Ethernet" header.
71 */
72
73struct hp_hdr {
74	u_int8_t	daddr[RMP_ADDRLEN];
75	u_int8_t	saddr[RMP_ADDRLEN];
76	u_int16_t	len;
77};
78
79/*
80 * HP uses 802.2 LLC with their own local extensions.  This struct makes
81 * sense out of this data (encapsulated in the above 802.3 packet).
82 */
83
84struct hp_llc {
85	u_int8_t	dsap;		/* 802.2 DSAP */
86	u_int8_t	ssap;		/* 802.2 SSAP */
87	u_int16_t	cntrl;		/* 802.2 control field */
88	u_int16_t	filler;		/* HP filler (must be zero) */
89	u_int16_t	dxsap;		/* HP extended DSAP */
90	u_int16_t	sxsap;		/* HP extended SSAP */
91};
92