FreeBSD/Linux Kernel Cross Reference
sys/net/intrq.c
1 /*-
2 * Copyright (c) 2000 Brian Somers <brian@Awfulhak.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 *
26 * $FreeBSD$
27 */
28
29 #include <sys/param.h>
30 #include <sys/mbuf.h>
31 #include <sys/socket.h>
32 #include <sys/systm.h>
33 #include <sys/time.h>
34
35 #include <net/if.h>
36 #include <net/if_var.h>
37 #include <net/netisr.h>
38 #include <net/intrq.h>
39
40 #ifdef __i386__
41 #include <netatm/kern_include.h> /* XXX overkill, fixme! */
42 #endif
43
44 /*
45 * If the appropriate intrq_present variable is zero, don't use
46 * the queue (as it'll never get processed).
47 * When defined, each of the network stacks declares their own
48 * *intrq_present variable to be non-zero.
49 */
50 const int atintrq1_present;
51 const int atintrq2_present;
52 #ifdef NETISR_ATM
53 const int atmintrq_present;
54 #endif
55 const int ipintrq_present;
56 const int ip6intrq_present;
57 const int ipxintrq_present;
58 const int natmintrq_present;
59 const int nsintrq_present;
60
61 struct ifqueue atintrq1;
62 struct ifqueue atintrq2;
63 #ifdef NETISR_ATM
64 struct ifqueue atm_intrq;
65 #endif
66 struct ifqueue ipintrq;
67 struct ifqueue ip6intrq;
68 struct ifqueue ipxintrq;
69 struct ifqueue natmintrq;
70 struct ifqueue nsintrq;
71
72
73 static const struct {
74 sa_family_t family;
75 struct ifqueue *q;
76 int const *present;
77 int isr;
78 } queue[] = {
79 #ifdef NETISR_ATM
80 { AF_ATM, &atm_intrq, &atmintrq_present, NETISR_ATM },
81 #endif
82 { AF_INET, &ipintrq, &ipintrq_present, NETISR_IP },
83 { AF_INET6, &ip6intrq, &ip6intrq_present, NETISR_IPV6 },
84 { AF_IPX, &ipxintrq, &ipxintrq_present, NETISR_IPX },
85 { AF_NATM, &natmintrq, &natmintrq_present, NETISR_NATM },
86 { AF_APPLETALK, &atintrq2, &atintrq2_present, NETISR_ATALK },
87 { AF_NS, &nsintrq, &nsintrq_present, NETISR_NS }
88 };
89
90 int
91 family_enqueue(family, m)
92 sa_family_t family;
93 struct mbuf *m;
94 {
95 int entry, s;
96
97 for (entry = 0; entry < sizeof queue / sizeof queue[0]; entry++)
98 if (queue[entry].family == family) {
99 if (queue[entry].present) {
100 s = splimp();
101 if (IF_QFULL(queue[entry].q)) {
102 IF_DROP(queue[entry].q);
103 splx(s);
104 m_freem(m);
105 return ENOBUFS;
106 }
107 IF_ENQUEUE(queue[entry].q, m);
108 splx(s);
109 schednetisr(queue[entry].isr);
110 return 0;
111 } else
112 break;
113 }
114
115 m_freem(m);
116 return EAFNOSUPPORT;
117 }
Cache object: 09c287f44f68c760a445ded33e79a28d
|