1 /*- 2 * Copyright (c) 2001-2007, Cisco Systems, Inc. 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 are met: 6 * 7 * a) Redistributions of source code must retain the above copyright notice, 8 * this list of conditions and the following disclaimer. 9 * 10 * b) Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in 12 * the documentation and/or other materials provided with the distribution. 13 * 14 * c) Neither the name of Cisco Systems, Inc. nor the names of its 15 * contributors may be used to endorse or promote products derived 16 * from this software without specific prior written permission. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 20 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF 28 * THE POSSIBILITY OF SUCH DAMAGE. 29 */ 30 31 /* $KAME: sctp_var.h,v 1.24 2005/03/06 16:04:19 itojun Exp $ */ 32 33 #include <sys/cdefs.h> 34 __FBSDID("$FreeBSD$"); 35 36 #ifndef _NETINET_SCTP_VAR_H_ 37 #define _NETINET_SCTP_VAR_H_ 38 39 #include <netinet/sctp_uio.h> 40 41 #if defined(_KERNEL) 42 43 extern struct pr_usrreqs sctp_usrreqs; 44 45 46 #define sctp_feature_on(inp, feature) (inp->sctp_features |= feature) 47 #define sctp_feature_off(inp, feature) (inp->sctp_features &= ~feature) 48 #define sctp_is_feature_on(inp, feature) (inp->sctp_features & feature) 49 #define sctp_is_feature_off(inp, feature) ((inp->sctp_features & feature) == 0) 50 51 #define sctp_sbspace(asoc, sb) ((long) (((sb)->sb_hiwat > (asoc)->sb_cc) ? ((sb)->sb_hiwat - (asoc)->sb_cc) : 0)) 52 53 #define sctp_sbspace_failedmsgs(sb) ((long) (((sb)->sb_hiwat > (sb)->sb_cc) ? ((sb)->sb_hiwat - (sb)->sb_cc) : 0)) 54 55 #define sctp_sbspace_sub(a,b) ((a > b) ? (a - b) : 0) 56 57 /* 58 * I tried to cache the readq entries at one point. But the reality 59 * is that it did not add any performance since this meant we had to 60 * lock the STCB on read. And at that point once you have to do an 61 * extra lock, it really does not matter if the lock is in the ZONE 62 * stuff or in our code. Note that this same problem would occur with 63 * an mbuf cache as well so it is not really worth doing, at least 64 * right now :-D 65 */ 66 67 #define sctp_free_a_readq(_stcb, _readq) { \ 68 SCTP_ZONE_FREE(sctppcbinfo.ipi_zone_readq, (_readq)); \ 69 SCTP_DECR_READQ_COUNT(); \ 70 } 71 72 #define sctp_alloc_a_readq(_stcb, _readq) { \ 73 (_readq) = SCTP_ZONE_GET(sctppcbinfo.ipi_zone_readq, struct sctp_queued_to_read); \ 74 if ((_readq)) { \ 75 SCTP_INCR_READQ_COUNT(); \ 76 } \ 77 } 78 79 #define sctp_free_a_strmoq(_stcb, _strmoq) { \ 80 if (((_stcb)->asoc.free_strmoq_cnt > sctp_asoc_free_resc_limit) || \ 81 (sctppcbinfo.ipi_free_strmoq > sctp_system_free_resc_limit)) { \ 82 SCTP_ZONE_FREE(sctppcbinfo.ipi_zone_strmoq, (_strmoq)); \ 83 SCTP_DECR_STRMOQ_COUNT(); \ 84 } else { \ 85 TAILQ_INSERT_TAIL(&(_stcb)->asoc.free_strmoq, (_strmoq), next); \ 86 (_stcb)->asoc.free_strmoq_cnt++; \ 87 atomic_add_int(&sctppcbinfo.ipi_free_strmoq, 1); \ 88 } \ 89 } 90 91 #define sctp_alloc_a_strmoq(_stcb, _strmoq) { \ 92 if (TAILQ_EMPTY(&(_stcb)->asoc.free_strmoq)) { \ 93 (_strmoq) = SCTP_ZONE_GET(sctppcbinfo.ipi_zone_strmoq, struct sctp_stream_queue_pending); \ 94 if ((_strmoq)) { \ 95 SCTP_INCR_STRMOQ_COUNT(); \ 96 } \ 97 } else { \ 98 (_strmoq) = TAILQ_FIRST(&(_stcb)->asoc.free_strmoq); \ 99 TAILQ_REMOVE(&(_stcb)->asoc.free_strmoq, (_strmoq), next); \ 100 atomic_subtract_int(&sctppcbinfo.ipi_free_strmoq, 1); \ 101 (_stcb)->asoc.free_strmoq_cnt--; \ 102 } \ 103 } 104 105 106 #define sctp_free_a_chunk(_stcb, _chk) { \ 107 if (((_stcb)->asoc.free_chunk_cnt > sctp_asoc_free_resc_limit) || \ 108 (sctppcbinfo.ipi_free_chunks > sctp_system_free_resc_limit)) { \ 109 SCTP_ZONE_FREE(sctppcbinfo.ipi_zone_chunk, (_chk)); \ 110 SCTP_DECR_CHK_COUNT(); \ 111 } else { \ 112 TAILQ_INSERT_TAIL(&(_stcb)->asoc.free_chunks, (_chk), sctp_next); \ 113 (_stcb)->asoc.free_chunk_cnt++; \ 114 atomic_add_int(&sctppcbinfo.ipi_free_chunks, 1); \ 115 } \ 116 } 117 118 #define sctp_alloc_a_chunk(_stcb, _chk) { \ 119 if (TAILQ_EMPTY(&(_stcb)->asoc.free_chunks)) { \ 120 (_chk) = SCTP_ZONE_GET(sctppcbinfo.ipi_zone_chunk, struct sctp_tmit_chunk); \ 121 if ((_chk)) { \ 122 SCTP_INCR_CHK_COUNT(); \ 123 } \ 124 } else { \ 125 (_chk) = TAILQ_FIRST(&(_stcb)->asoc.free_chunks); \ 126 TAILQ_REMOVE(&(_stcb)->asoc.free_chunks, (_chk), sctp_next); \ 127 atomic_subtract_int(&sctppcbinfo.ipi_free_chunks, 1); \ 128 (_stcb)->asoc.free_chunk_cnt--; \ 129 } \ 130 } 131 132 133 134 #define sctp_free_remote_addr(__net) { \ 135 if ((__net)) { \ 136 if (atomic_fetchadd_int(&(__net)->ref_count, -1) == 1) { \ 137 SCTP_OS_TIMER_STOP(&(__net)->rxt_timer.timer); \ 138 SCTP_OS_TIMER_STOP(&(__net)->pmtu_timer.timer); \ 139 SCTP_OS_TIMER_STOP(&(__net)->fr_timer.timer); \ 140 if ((__net)->ro.ro_rt) { \ 141 RTFREE((__net)->ro.ro_rt); \ 142 (__net)->ro.ro_rt = NULL; \ 143 } \ 144 if ((__net)->src_addr_selected) { \ 145 sctp_free_ifa((__net)->ro._s_addr); \ 146 (__net)->ro._s_addr = NULL; \ 147 } \ 148 (__net)->src_addr_selected = 0; \ 149 (__net)->dest_state = SCTP_ADDR_NOT_REACHABLE; \ 150 SCTP_ZONE_FREE(sctppcbinfo.ipi_zone_net, (__net)); \ 151 SCTP_DECR_RADDR_COUNT(); \ 152 } \ 153 } \ 154 } 155 156 #define sctp_sbfree(ctl, stcb, sb, m) { \ 157 uint32_t val; \ 158 val = atomic_fetchadd_int(&(sb)->sb_cc,-(SCTP_BUF_LEN((m)))); \ 159 if (val < SCTP_BUF_LEN((m))) { \ 160 panic("sb_cc goes negative"); \ 161 } \ 162 val = atomic_fetchadd_int(&(sb)->sb_mbcnt,-(MSIZE)); \ 163 if (val < MSIZE) { \ 164 panic("sb_mbcnt goes negative"); \ 165 } \ 166 if (SCTP_BUF_IS_EXTENDED(m)) { \ 167 val = atomic_fetchadd_int(&(sb)->sb_mbcnt,-(SCTP_BUF_EXTEND_SIZE(m))); \ 168 if (val < SCTP_BUF_EXTEND_SIZE(m)) { \ 169 panic("sb_mbcnt goes negative2"); \ 170 } \ 171 } \ 172 if (((ctl)->do_not_ref_stcb == 0) && stcb) {\ 173 val = atomic_fetchadd_int(&(stcb)->asoc.sb_cc,-(SCTP_BUF_LEN((m)))); \ 174 if (val < SCTP_BUF_LEN((m))) {\ 175 panic("stcb->sb_cc goes negative"); \ 176 } \ 177 val = atomic_fetchadd_int(&(stcb)->asoc.sb_mbcnt,-(MSIZE)); \ 178 if (val < MSIZE) { \ 179 panic("asoc->mbcnt goes negative"); \ 180 } \ 181 if (SCTP_BUF_IS_EXTENDED(m)) { \ 182 val = atomic_fetchadd_int(&(stcb)->asoc.sb_mbcnt,-(SCTP_BUF_EXTEND_SIZE(m))); \ 183 if (val < SCTP_BUF_EXTEND_SIZE(m)) { \ 184 panic("assoc stcb->mbcnt would go negative"); \ 185 } \ 186 } \ 187 } \ 188 if (SCTP_BUF_TYPE(m) != MT_DATA && SCTP_BUF_TYPE(m) != MT_HEADER && \ 189 SCTP_BUF_TYPE(m) != MT_OOBDATA) \ 190 atomic_subtract_int(&(sb)->sb_ctl,SCTP_BUF_LEN((m))); \ 191 } 192 193 194 #define sctp_sballoc(stcb, sb, m) { \ 195 atomic_add_int(&(sb)->sb_cc,SCTP_BUF_LEN((m))); \ 196 atomic_add_int(&(sb)->sb_mbcnt, MSIZE); \ 197 if (SCTP_BUF_IS_EXTENDED(m)) \ 198 atomic_add_int(&(sb)->sb_mbcnt,SCTP_BUF_EXTEND_SIZE(m)); \ 199 if (stcb) { \ 200 atomic_add_int(&(stcb)->asoc.sb_cc,SCTP_BUF_LEN((m))); \ 201 atomic_add_int(&(stcb)->asoc.sb_mbcnt, MSIZE); \ 202 if (SCTP_BUF_IS_EXTENDED(m)) \ 203 atomic_add_int(&(stcb)->asoc.sb_mbcnt,SCTP_BUF_EXTEND_SIZE(m)); \ 204 } \ 205 if (SCTP_BUF_TYPE(m) != MT_DATA && SCTP_BUF_TYPE(m) != MT_HEADER && \ 206 SCTP_BUF_TYPE(m) != MT_OOBDATA) \ 207 atomic_add_int(&(sb)->sb_ctl,SCTP_BUF_LEN((m))); \ 208 } 209 210 211 #define sctp_ucount_incr(val) { \ 212 val++; \ 213 } 214 215 #define sctp_ucount_decr(val) { \ 216 if (val > 0) { \ 217 val--; \ 218 } else { \ 219 val = 0; \ 220 } \ 221 } 222 223 #define sctp_mbuf_crush(data) do { \ 224 struct mbuf *_m; \ 225 _m = (data); \ 226 while(_m && (SCTP_BUF_LEN(_m) == 0)) { \ 227 (data) = SCTP_BUF_NEXT(_m); \ 228 SCTP_BUF_NEXT(_m) = NULL; \ 229 sctp_m_free(_m); \ 230 _m = (data); \ 231 } \ 232 } while (0) 233 234 235 struct sctp_nets; 236 struct sctp_inpcb; 237 struct sctp_tcb; 238 struct sctphdr; 239 240 void sctp_ctlinput __P((int, struct sockaddr *, void *)); 241 int sctp_ctloutput __P((struct socket *, struct sockopt *)); 242 void sctp_input __P((struct mbuf *, int)); 243 void sctp_drain __P((void)); 244 void sctp_init __P((void)); 245 246 247 void sctp_pcbinfo_cleanup(void); 248 249 int sctp_shutdown __P((struct socket *)); 250 void sctp_notify 251 __P((struct sctp_inpcb *, int, struct sctphdr *, 252 struct sockaddr *, struct sctp_tcb *, 253 struct sctp_nets *)); 254 255 int sctp_bindx(struct socket *, int, struct sockaddr_storage *, 256 int, int, struct proc *); 257 258 /* can't use sctp_assoc_t here */ 259 int sctp_peeloff(struct socket *, struct socket *, int, caddr_t, int *); 260 261 sctp_assoc_t sctp_getassocid(struct sockaddr *); 262 263 264 int sctp_ingetaddr(struct socket *, 265 struct sockaddr ** 266 ); 267 268 int sctp_peeraddr(struct socket *, 269 struct sockaddr ** 270 ); 271 272 int sctp_listen(struct socket *, int, struct thread *); 273 274 int sctp_accept(struct socket *, struct sockaddr **); 275 276 #endif /* _KERNEL */ 277 278 #endif /* !_NETINET_SCTP_VAR_H_ */ 279