1 .\" $NetBSD: 3.t,v 1.2 1998/01/09 06:55:42 perry Exp $
3 .\" Copyright (c) 1983, 1986, 1993
4 .\" The Regents of the University of California. All rights reserved.
6 .\" Redistribution and use in source and binary forms, with or without
7 .\" modification, are permitted provided that the following conditions
9 .\" 1. Redistributions of source code must retain the above copyright
10 .\" notice, this list of conditions and the following disclaimer.
11 .\" 2. Redistributions in binary form must reproduce the above copyright
12 .\" notice, this list of conditions and the following disclaimer in the
13 .\" documentation and/or other materials provided with the distribution.
14 .\" 3. Neither the name of the University nor the names of its contributors
15 .\" may be used to endorse or promote products derived from this software
16 .\" without specific prior written permission.
18 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 .\" @(#)3.t 8.1 (Berkeley) 6/8/93
39 The networking system was designed with the goal of supporting
40 multiple \fIprotocol families\fP and addressing styles. This required
41 information to be ``hidden'' in common data structures which
42 could be manipulated by all the pieces of the system, but which
43 required interpretation only by the protocols which ``controlled''
44 it. The system described here attempts to minimize
45 the use of shared data structures to those kept by a suite of
46 protocols (a \fIprotocol family\fP), and those used for rendezvous
47 between ``synchronous'' and ``asynchronous'' portions of the
48 system (e.g. queues of data packets are filled at interrupt
49 time and emptied based on user requests).
51 A major goal of the system was to provide a framework within
52 which new protocols and hardware could be easily be supported.
53 To this end, a great deal of effort has been extended to
54 create utility routines which hide many of the more
55 complex and/or hardware dependent chores of networking.
56 Later sections describe the utility routines and the underlying
57 data structures they manipulate.