version 1.20, 1995/06/04 05:58:26 |
version 1.27, 1996/01/16 04:17:37 |
|
|
#ifndef IPSENDREDIRECTS |
#ifndef IPSENDREDIRECTS |
#define IPSENDREDIRECTS 1 |
#define IPSENDREDIRECTS 1 |
#endif |
#endif |
|
#ifndef IPFORWSRCRT |
|
#define IPFORWSRCRT 1 /* allow source-routed packets */ |
|
#endif |
|
/* |
|
* Note: DIRECTED_BROADCAST is handled this way so that previous |
|
* configuration using this option will Just Work. |
|
*/ |
|
#ifndef IPDIRECTEDBCAST |
|
#ifdef DIRECTED_BROADCAST |
|
#define IPDIRECTEDBCAST 1 |
|
#else |
|
#define IPDIRECTEDBCAST 0 |
|
#endif /* DIRECTED_BROADCAST */ |
|
#endif /* IPDIRECTEDBCAST */ |
int ipforwarding = IPFORWARDING; |
int ipforwarding = IPFORWARDING; |
int ipsendredirects = IPSENDREDIRECTS; |
int ipsendredirects = IPSENDREDIRECTS; |
int ip_defttl = IPDEFTTL; |
int ip_defttl = IPDEFTTL; |
|
int ip_forwsrcrt = IPFORWSRCRT; |
|
int ip_directedbcast = IPDIRECTEDBCAST; |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
int ipprintfs = 0; |
int ipprintfs = 0; |
#endif |
#endif |
Line 78 extern struct domain inetdomain; |
|
Line 94 extern struct domain inetdomain; |
|
extern struct protosw inetsw[]; |
extern struct protosw inetsw[]; |
u_char ip_protox[IPPROTO_MAX]; |
u_char ip_protox[IPPROTO_MAX]; |
int ipqmaxlen = IFQ_MAXLEN; |
int ipqmaxlen = IFQ_MAXLEN; |
struct in_ifaddr *in_ifaddr; /* first inet address */ |
struct in_ifaddrhead in_ifaddr; |
struct ifqueue ipintrq; |
struct ifqueue ipintrq; |
|
|
/* |
/* |
Line 96 static struct ip_srcrt { |
|
Line 112 static struct ip_srcrt { |
|
struct in_addr route[MAX_IPOPTLEN/sizeof(struct in_addr)]; |
struct in_addr route[MAX_IPOPTLEN/sizeof(struct in_addr)]; |
} ip_srcrt; |
} ip_srcrt; |
|
|
#ifdef GATEWAY |
|
extern int if_index; |
|
u_int32_t *ip_ifmatrix; |
|
#endif |
|
|
|
static void save_rte __P((u_char *, struct in_addr)); |
static void save_rte __P((u_char *, struct in_addr)); |
/* |
/* |
* IP initialization: fill in IP protocol switch table. |
* IP initialization: fill in IP protocol switch table. |
|
|
if (pr->pr_domain->dom_family == PF_INET && |
if (pr->pr_domain->dom_family == PF_INET && |
pr->pr_protocol && pr->pr_protocol != IPPROTO_RAW) |
pr->pr_protocol && pr->pr_protocol != IPPROTO_RAW) |
ip_protox[pr->pr_protocol] = pr - inetsw; |
ip_protox[pr->pr_protocol] = pr - inetsw; |
ipq.next = ipq.prev = &ipq; |
LIST_INIT(&ipq); |
ip_id = time.tv_sec & 0xffff; |
ip_id = time.tv_sec & 0xffff; |
ipintrq.ifq_maxlen = ipqmaxlen; |
ipintrq.ifq_maxlen = ipqmaxlen; |
#ifdef GATEWAY |
TAILQ_INIT(&in_ifaddr); |
i = (if_index + 1) * (if_index + 1) * sizeof (u_int32_t); |
|
ip_ifmatrix = (u_int32_t *) malloc(i, M_RTABLE, M_WAITOK); |
|
bzero((char *)ip_ifmatrix, i); |
|
#endif |
|
} |
} |
|
|
struct sockaddr_in ipaddr = { sizeof(ipaddr), AF_INET }; |
struct sockaddr_in ipaddr = { sizeof(ipaddr), AF_INET }; |
|
|
register struct mbuf *m; |
register struct mbuf *m; |
register struct ipq *fp; |
register struct ipq *fp; |
register struct in_ifaddr *ia; |
register struct in_ifaddr *ia; |
int hlen, s; |
struct ipqent *ipqe; |
|
int hlen, mff, s; |
|
|
next: |
next: |
/* |
/* |
|
|
* If no IP addresses have been set yet but the interfaces |
* If no IP addresses have been set yet but the interfaces |
* are receiving, can't do anything with incoming packets yet. |
* are receiving, can't do anything with incoming packets yet. |
*/ |
*/ |
if (in_ifaddr == NULL) |
if (in_ifaddr.tqh_first == 0) |
goto bad; |
goto bad; |
ipstat.ips_total++; |
ipstat.ips_total++; |
if (m->m_len < sizeof (struct ip) && |
if (m->m_len < sizeof (struct ip) && |
|
|
/* |
/* |
* Check our list of addresses, to see if the packet is for us. |
* Check our list of addresses, to see if the packet is for us. |
*/ |
*/ |
for (ia = in_ifaddr; ia; ia = ia->ia_next) { |
for (ia = in_ifaddr.tqh_first; ia; ia = ia->ia_list.tqe_next) { |
if (ip->ip_dst.s_addr == ia->ia_addr.sin_addr.s_addr) |
if (ip->ip_dst.s_addr == ia->ia_addr.sin_addr.s_addr) |
goto ours; |
goto ours; |
if ( |
if (((ip_directedbcast == 0) || (ip_directedbcast && |
#ifdef DIRECTED_BROADCAST |
ia->ia_ifp == m->m_pkthdr.rcvif)) && |
ia->ia_ifp == m->m_pkthdr.rcvif && |
|
#endif |
|
(ia->ia_ifp->if_flags & IFF_BROADCAST)) { |
(ia->ia_ifp->if_flags & IFF_BROADCAST)) { |
if (ip->ip_dst.s_addr == ia->ia_broadaddr.sin_addr.s_addr || |
if (ip->ip_dst.s_addr == ia->ia_broadaddr.sin_addr.s_addr || |
ip->ip_dst.s_addr == ia->ia_netbroadcast.s_addr || |
ip->ip_dst.s_addr == ia->ia_netbroadcast.s_addr || |
|
|
* Look for queue of fragments |
* Look for queue of fragments |
* of this datagram. |
* of this datagram. |
*/ |
*/ |
for (fp = ipq.next; fp != &ipq; fp = fp->next) |
for (fp = ipq.lh_first; fp != NULL; fp = fp->ipq_q.le_next) |
if (ip->ip_id == fp->ipq_id && |
if (ip->ip_id == fp->ipq_id && |
ip->ip_src.s_addr == fp->ipq_src.s_addr && |
ip->ip_src.s_addr == fp->ipq_src.s_addr && |
ip->ip_dst.s_addr == fp->ipq_dst.s_addr && |
ip->ip_dst.s_addr == fp->ipq_dst.s_addr && |
|
|
|
|
/* |
/* |
* Adjust ip_len to not reflect header, |
* Adjust ip_len to not reflect header, |
* set ip_mff if more fragments are expected, |
* set ipqe_mff if more fragments are expected, |
* convert offset of this to bytes. |
* convert offset of this to bytes. |
*/ |
*/ |
ip->ip_len -= hlen; |
ip->ip_len -= hlen; |
((struct ipasfrag *)ip)->ipf_mff &= ~1; |
mff = (ip->ip_off & IP_MF) != 0; |
if (ip->ip_off & IP_MF) { |
if (mff) { |
/* |
/* |
* Make sure that fragments have a data length |
* Make sure that fragments have a data length |
* that's a non-zero multiple of 8 bytes. |
* that's a non-zero multiple of 8 bytes. |
|
|
ipstat.ips_badfrags++; |
ipstat.ips_badfrags++; |
goto bad; |
goto bad; |
} |
} |
((struct ipasfrag *)ip)->ipf_mff |= 1; |
|
} |
} |
ip->ip_off <<= 3; |
ip->ip_off <<= 3; |
|
|
|
|
* or if this is not the first fragment, |
* or if this is not the first fragment, |
* attempt reassembly; if it succeeds, proceed. |
* attempt reassembly; if it succeeds, proceed. |
*/ |
*/ |
if (((struct ipasfrag *)ip)->ipf_mff & 1 || ip->ip_off) { |
if (mff || ip->ip_off) { |
ipstat.ips_fragments++; |
ipstat.ips_fragments++; |
ip = ip_reass((struct ipasfrag *)ip, fp); |
MALLOC(ipqe, struct ipqent *, sizeof (struct ipqent), |
|
M_IPQ, M_NOWAIT); |
|
if (ipqe == NULL) { |
|
ipstat.ips_rcvmemdrop++; |
|
goto bad; |
|
} |
|
ipqe->ipqe_mff = mff; |
|
ipqe->ipqe_ip = ip; |
|
ip = ip_reass(ipqe, fp); |
if (ip == 0) |
if (ip == 0) |
goto next; |
goto next; |
ipstat.ips_reassembled++; |
ipstat.ips_reassembled++; |
|
|
* is given as fp; otherwise have to make a chain. |
* is given as fp; otherwise have to make a chain. |
*/ |
*/ |
struct ip * |
struct ip * |
ip_reass(ip, fp) |
ip_reass(ipqe, fp) |
register struct ipasfrag *ip; |
register struct ipqent *ipqe; |
register struct ipq *fp; |
register struct ipq *fp; |
{ |
{ |
register struct mbuf *m = dtom(ip); |
register struct mbuf *m = dtom(ipqe->ipqe_ip); |
register struct ipasfrag *q; |
register struct ipqent *nq, *p, *q; |
|
struct ip *ip; |
struct mbuf *t; |
struct mbuf *t; |
int hlen = ip->ip_hl << 2; |
int hlen = ipqe->ipqe_ip->ip_hl << 2; |
int i, next; |
int i, next; |
|
|
/* |
/* |
Line 436 ip_reass(ip, fp) |
|
Line 450 ip_reass(ip, fp) |
|
if ((t = m_get(M_DONTWAIT, MT_FTABLE)) == NULL) |
if ((t = m_get(M_DONTWAIT, MT_FTABLE)) == NULL) |
goto dropfrag; |
goto dropfrag; |
fp = mtod(t, struct ipq *); |
fp = mtod(t, struct ipq *); |
insque(fp, &ipq); |
LIST_INSERT_HEAD(&ipq, fp, ipq_q); |
fp->ipq_ttl = IPFRAGTTL; |
fp->ipq_ttl = IPFRAGTTL; |
fp->ipq_p = ip->ip_p; |
fp->ipq_p = ipqe->ipqe_ip->ip_p; |
fp->ipq_id = ip->ip_id; |
fp->ipq_id = ipqe->ipqe_ip->ip_id; |
fp->ipq_next = fp->ipq_prev = (struct ipasfrag *)fp; |
LIST_INIT(&fp->ipq_fragq); |
fp->ipq_src = ((struct ip *)ip)->ip_src; |
fp->ipq_src = ipqe->ipqe_ip->ip_src; |
fp->ipq_dst = ((struct ip *)ip)->ip_dst; |
fp->ipq_dst = ipqe->ipqe_ip->ip_dst; |
q = (struct ipasfrag *)fp; |
p = NULL; |
goto insert; |
goto insert; |
} |
} |
|
|
/* |
/* |
* Find a segment which begins after this one does. |
* Find a segment which begins after this one does. |
*/ |
*/ |
for (q = fp->ipq_next; q != (struct ipasfrag *)fp; q = q->ipf_next) |
for (p = NULL, q = fp->ipq_fragq.lh_first; q != NULL; |
if (q->ip_off > ip->ip_off) |
p = q, q = q->ipqe_q.le_next) |
|
if (q->ipqe_ip->ip_off > ipqe->ipqe_ip->ip_off) |
break; |
break; |
|
|
/* |
/* |
Line 459 ip_reass(ip, fp) |
|
Line 474 ip_reass(ip, fp) |
|
* our data already. If so, drop the data from the incoming |
* our data already. If so, drop the data from the incoming |
* segment. If it provides all of our data, drop us. |
* segment. If it provides all of our data, drop us. |
*/ |
*/ |
if (q->ipf_prev != (struct ipasfrag *)fp) { |
if (p != NULL) { |
i = q->ipf_prev->ip_off + q->ipf_prev->ip_len - ip->ip_off; |
i = p->ipqe_ip->ip_off + p->ipqe_ip->ip_len - |
|
ipqe->ipqe_ip->ip_off; |
if (i > 0) { |
if (i > 0) { |
if (i >= ip->ip_len) |
if (i >= ipqe->ipqe_ip->ip_len) |
goto dropfrag; |
goto dropfrag; |
m_adj(dtom(ip), i); |
m_adj(dtom(ipqe->ipqe_ip), i); |
ip->ip_off += i; |
ipqe->ipqe_ip->ip_off += i; |
ip->ip_len -= i; |
ipqe->ipqe_ip->ip_len -= i; |
} |
} |
} |
} |
|
|
Line 474 ip_reass(ip, fp) |
|
Line 490 ip_reass(ip, fp) |
|
* While we overlap succeeding segments trim them or, |
* While we overlap succeeding segments trim them or, |
* if they are completely covered, dequeue them. |
* if they are completely covered, dequeue them. |
*/ |
*/ |
while (q != (struct ipasfrag *)fp && ip->ip_off + ip->ip_len > q->ip_off) { |
for (; q != NULL && ipqe->ipqe_ip->ip_off + ipqe->ipqe_ip->ip_len > |
i = (ip->ip_off + ip->ip_len) - q->ip_off; |
q->ipqe_ip->ip_off; q = nq) { |
if (i < q->ip_len) { |
i = (ipqe->ipqe_ip->ip_off + ipqe->ipqe_ip->ip_len) - |
q->ip_len -= i; |
q->ipqe_ip->ip_off; |
q->ip_off += i; |
if (i < q->ipqe_ip->ip_len) { |
m_adj(dtom(q), i); |
q->ipqe_ip->ip_len -= i; |
|
q->ipqe_ip->ip_off += i; |
|
m_adj(dtom(q->ipqe_ip), i); |
break; |
break; |
} |
} |
q = q->ipf_next; |
nq = q->ipqe_q.le_next; |
m_freem(dtom(q->ipf_prev)); |
m_freem(dtom(q->ipqe_ip)); |
ip_deq(q->ipf_prev); |
LIST_REMOVE(q, ipqe_q); |
|
FREE(q, M_IPQ); |
} |
} |
|
|
insert: |
insert: |
|
|
* Stick new segment in its place; |
* Stick new segment in its place; |
* check for complete reassembly. |
* check for complete reassembly. |
*/ |
*/ |
ip_enq(ip, q->ipf_prev); |
if (p == NULL) { |
|
LIST_INSERT_HEAD(&fp->ipq_fragq, ipqe, ipqe_q); |
|
} else { |
|
LIST_INSERT_AFTER(p, ipqe, ipqe_q); |
|
} |
next = 0; |
next = 0; |
for (q = fp->ipq_next; q != (struct ipasfrag *)fp; q = q->ipf_next) { |
for (p = NULL, q = fp->ipq_fragq.lh_first; q != NULL; |
if (q->ip_off != next) |
p = q, q = q->ipqe_q.le_next) { |
|
if (q->ipqe_ip->ip_off != next) |
return (0); |
return (0); |
next += q->ip_len; |
next += q->ipqe_ip->ip_len; |
} |
} |
if (q->ipf_prev->ipf_mff & 1) |
if (p->ipqe_mff) |
return (0); |
return (0); |
|
|
/* |
/* |
* Reassembly is complete; concatenate fragments. |
* Reassembly is complete; concatenate fragments. |
*/ |
*/ |
q = fp->ipq_next; |
q = fp->ipq_fragq.lh_first; |
m = dtom(q); |
ip = q->ipqe_ip; |
|
m = dtom(q->ipqe_ip); |
t = m->m_next; |
t = m->m_next; |
m->m_next = 0; |
m->m_next = 0; |
m_cat(m, t); |
m_cat(m, t); |
q = q->ipf_next; |
nq = q->ipqe_q.le_next; |
while (q != (struct ipasfrag *)fp) { |
FREE(q, M_IPQ); |
t = dtom(q); |
for (q = nq; q != NULL; q = nq) { |
q = q->ipf_next; |
t = dtom(q->ipqe_ip); |
|
nq = q->ipqe_q.le_next; |
|
FREE(q, M_IPQ); |
m_cat(m, t); |
m_cat(m, t); |
} |
} |
|
|
|
|
* dequeue and discard fragment reassembly header. |
* dequeue and discard fragment reassembly header. |
* Make header visible. |
* Make header visible. |
*/ |
*/ |
ip = fp->ipq_next; |
|
ip->ip_len = next; |
ip->ip_len = next; |
ip->ipf_mff &= ~1; |
ip->ip_src = fp->ipq_src; |
((struct ip *)ip)->ip_src = fp->ipq_src; |
ip->ip_dst = fp->ipq_dst; |
((struct ip *)ip)->ip_dst = fp->ipq_dst; |
LIST_REMOVE(fp, ipq_q); |
remque(fp); |
|
(void) m_free(dtom(fp)); |
(void) m_free(dtom(fp)); |
m = dtom(ip); |
|
m->m_len += (ip->ip_hl << 2); |
m->m_len += (ip->ip_hl << 2); |
m->m_data -= (ip->ip_hl << 2); |
m->m_data -= (ip->ip_hl << 2); |
/* some debugging cruft by sklower, below, will go away soon */ |
/* some debugging cruft by sklower, below, will go away soon */ |
|
|
plen += m->m_len; |
plen += m->m_len; |
t->m_pkthdr.len = plen; |
t->m_pkthdr.len = plen; |
} |
} |
return ((struct ip *)ip); |
return (ip); |
|
|
dropfrag: |
dropfrag: |
ipstat.ips_fragdropped++; |
ipstat.ips_fragdropped++; |
m_freem(m); |
m_freem(m); |
|
FREE(ipqe, M_IPQ); |
return (0); |
return (0); |
} |
} |
|
|
|
|
ip_freef(fp) |
ip_freef(fp) |
struct ipq *fp; |
struct ipq *fp; |
{ |
{ |
register struct ipasfrag *q, *p; |
register struct ipqent *q, *p; |
|
|
for (q = fp->ipq_next; q != (struct ipasfrag *)fp; q = p) { |
for (q = fp->ipq_fragq.lh_first; q != NULL; q = p) { |
p = q->ipf_next; |
p = q->ipqe_q.le_next; |
ip_deq(q); |
m_freem(dtom(q->ipqe_ip)); |
m_freem(dtom(q)); |
LIST_REMOVE(q, ipqe_q); |
|
FREE(q, M_IPQ); |
} |
} |
remque(fp); |
LIST_REMOVE(fp, ipq_q); |
(void) m_free(dtom(fp)); |
(void) m_free(dtom(fp)); |
} |
} |
|
|
/* |
/* |
* Put an ip fragment on a reassembly chain. |
|
* Like insque, but pointers in middle of structure. |
|
*/ |
|
void |
|
ip_enq(p, prev) |
|
register struct ipasfrag *p, *prev; |
|
{ |
|
|
|
p->ipf_prev = prev; |
|
p->ipf_next = prev->ipf_next; |
|
prev->ipf_next->ipf_prev = p; |
|
prev->ipf_next = p; |
|
} |
|
|
|
/* |
|
* To ip_enq as remque is to insque. |
|
*/ |
|
void |
|
ip_deq(p) |
|
register struct ipasfrag *p; |
|
{ |
|
|
|
p->ipf_prev->ipf_next = p->ipf_next; |
|
p->ipf_next->ipf_prev = p->ipf_prev; |
|
} |
|
|
|
/* |
|
* IP timer processing; |
* IP timer processing; |
* if a timer expires on a reassembly |
* if a timer expires on a reassembly |
* queue, discard it. |
* queue, discard it. |
|
|
void |
void |
ip_slowtimo() |
ip_slowtimo() |
{ |
{ |
register struct ipq *fp; |
register struct ipq *fp, *nfp; |
int s = splnet(); |
int s = splsoftnet(); |
|
|
fp = ipq.next; |
for (fp = ipq.lh_first; fp != NULL; fp = nfp) { |
if (fp == 0) { |
nfp = fp->ipq_q.le_next; |
splx(s); |
if (--fp->ipq_ttl == 0) { |
return; |
|
} |
|
while (fp != &ipq) { |
|
--fp->ipq_ttl; |
|
fp = fp->next; |
|
if (fp->prev->ipq_ttl == 0) { |
|
ipstat.ips_fragtimeout++; |
ipstat.ips_fragtimeout++; |
ip_freef(fp->prev); |
ip_freef(fp); |
} |
} |
} |
} |
splx(s); |
splx(s); |
|
|
ip_drain() |
ip_drain() |
{ |
{ |
|
|
while (ipq.next != &ipq) { |
while (ipq.lh_first != NULL) { |
ipstat.ips_fragdropped++; |
ipstat.ips_fragdropped++; |
ip_freef(ipq.next); |
ip_freef(ipq.lh_first); |
} |
} |
} |
} |
|
|
|
|
} |
} |
} |
} |
if (forward) { |
if (forward) { |
|
if (ip_forwsrcrt == 0) { |
|
type = ICMP_UNREACH; |
|
code = ICMP_UNREACH_SRCFAIL; |
|
goto bad; |
|
} |
ip_forward(m, 1); |
ip_forward(m, 1); |
return (1); |
return (1); |
} |
} |
Line 975 ip_stripoptions(m, mopt) |
|
Line 973 ip_stripoptions(m, mopt) |
|
ip->ip_hl = sizeof(struct ip) >> 2; |
ip->ip_hl = sizeof(struct ip) >> 2; |
} |
} |
|
|
u_char inetctlerrmap[PRC_NCMDS] = { |
int inetctlerrmap[PRC_NCMDS] = { |
0, 0, 0, 0, |
0, 0, 0, 0, |
0, EMSGSIZE, EHOSTDOWN, EHOSTUNREACH, |
0, EMSGSIZE, EHOSTDOWN, EHOSTUNREACH, |
EHOSTUNREACH, EHOSTUNREACH, ECONNREFUSED, ECONNREFUSED, |
EHOSTUNREACH, EHOSTUNREACH, ECONNREFUSED, ECONNREFUSED, |
Line 1054 ip_forward(m, srcrt) |
|
Line 1052 ip_forward(m, srcrt) |
|
*/ |
*/ |
mcopy = m_copy(m, 0, imin((int)ip->ip_len, 64)); |
mcopy = m_copy(m, 0, imin((int)ip->ip_len, 64)); |
|
|
#ifdef GATEWAY |
|
ip_ifmatrix[rt->rt_ifp->if_index + |
|
if_index * m->m_pkthdr.rcvif->if_index]++; |
|
#endif |
|
/* |
/* |
* If forwarding packet using same interface that it came in on, |
* If forwarding packet using same interface that it came in on, |
* perhaps should send a redirect to sender to shortcut a hop. |
* perhaps should send a redirect to sender to shortcut a hop. |
Line 1087 ip_forward(m, srcrt) |
|
Line 1081 ip_forward(m, srcrt) |
|
} |
} |
} |
} |
|
|
error = ip_output(m, (struct mbuf *)0, &ipforward_rt, IP_FORWARDING |
error = ip_output(m, (struct mbuf *)0, &ipforward_rt, |
#ifdef DIRECTED_BROADCAST |
(IP_FORWARDING | (ip_directedbcast ? IP_ALLOWBROADCAST : 0)), 0); |
| IP_ALLOWBROADCAST |
|
#endif |
|
, 0); |
|
if (error) |
if (error) |
ipstat.ips_cantforward++; |
ipstat.ips_cantforward++; |
else { |
else { |
Line 1148 ip_sysctl(name, namelen, oldp, oldlenp, |
|
Line 1139 ip_sysctl(name, namelen, oldp, oldlenp, |
|
void *newp; |
void *newp; |
size_t newlen; |
size_t newlen; |
{ |
{ |
|
int temp; |
|
|
/* All sysctl names at this level are terminal. */ |
/* All sysctl names at this level are terminal. */ |
if (namelen != 1) |
if (namelen != 1) |
return (ENOTDIR); |
return (ENOTDIR); |
Line 1164 ip_sysctl(name, namelen, oldp, oldlenp, |
|
Line 1157 ip_sysctl(name, namelen, oldp, oldlenp, |
|
case IPCTL_DEFMTU: |
case IPCTL_DEFMTU: |
return (sysctl_int(oldp, oldlenp, newp, newlen, &ip_mtu)); |
return (sysctl_int(oldp, oldlenp, newp, newlen, &ip_mtu)); |
#endif |
#endif |
|
case IPCTL_FORWSRCRT: |
|
/* |
|
* Don't allow this to change in a secure environment. |
|
*/ |
|
if (securelevel > 0) |
|
return (EPERM); |
|
return (sysctl_int(oldp, oldlenp, newp, newlen, |
|
&ip_forwsrcrt)); |
|
case IPCTL_DIRECTEDBCAST: |
|
return (sysctl_int(oldp, oldlenp, newp, newlen, |
|
&ip_directedbcast)); |
default: |
default: |
return (EOPNOTSUPP); |
return (EOPNOTSUPP); |
} |
} |