/*- * SPDX-License-Identifier: BSD-3-Clause * * Copyright (c) 2001-2007, by Cisco Systems, Inc. All rights reserved. * Copyright (c) 2008-2012, by Randall Stewart. All rights reserved. * Copyright (c) 2008-2012, by Michael Tuexen. All rights reserved. * Copyright (c) 2008-2012, by Brad Penoff. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * a) Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * * b) Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in * the documentation and/or other materials provided with the distribution. * * c) Neither the name of Cisco Systems, Inc. nor the names of its * contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF * THE POSSIBILITY OF SUCH DAMAGE.
*/
#define SCTP_INCR_EP_COUNT() \ do { \
sctppcbinfo.ipi_count_ep++; \
} while (0)
#define SCTP_DECR_EP_COUNT() \ do { \
sctppcbinfo.ipi_count_ep--; \
} while (0)
#define SCTP_INCR_ASOC_COUNT() \ do { \
sctppcbinfo.ipi_count_asoc++; \
} while (0)
#define SCTP_DECR_ASOC_COUNT() \ do { \
sctppcbinfo.ipi_count_asoc--; \
} while (0)
#define SCTP_INCR_LADDR_COUNT() \ do { \
sctppcbinfo.ipi_count_laddr++; \
} while (0)
#define SCTP_DECR_LADDR_COUNT() \ do { \
sctppcbinfo.ipi_count_laddr--; \
} while (0)
#define SCTP_INCR_RADDR_COUNT() \ do { \
sctppcbinfo.ipi_count_raddr++; \
} while (0)
#define SCTP_DECR_RADDR_COUNT() \ do { \
sctppcbinfo.ipi_count_raddr--; \
} while (0)
#define SCTP_INCR_CHK_COUNT() \ do { \
sctppcbinfo.ipi_count_chunk++; \
} while (0)
#define SCTP_DECR_CHK_COUNT() \ do { \
sctppcbinfo.ipi_count_chunk--; \
} while (0)
#define SCTP_INCR_READQ_COUNT() \ do { \
sctppcbinfo.ipi_count_readq++; \
} while (0)
#define SCTP_DECR_READQ_COUNT() \ do { \
sctppcbinfo.ipi_count_readq--; \
} while (0)
#define SCTP_INCR_STRMOQ_COUNT() \ do { \
sctppcbinfo.ipi_count_strmoq++; \
} while (0)
#define SCTP_DECR_STRMOQ_COUNT() \ do { \
sctppcbinfo.ipi_count_strmoq--; \
} while (0)
/* these were in sctp_lock_empty.h but aren't in sctp_lock_bsd.h ... */ #if 0 #define SCTP_IPI_ADDR_LOCK() #define SCTP_IPI_ADDR_UNLOCK() #endif
/* These were in sctp_lock_empty.h because they were commented out within * within user_include/user_socketvar.h . If they are NOT commented out * in user_socketvar.h (because that seems the more natural place for them * to live), then change this "if" to 0. Keep the "if" as 1 if these ARE * indeed commented out in user_socketvar.h . * * This modularity is kept so this file can easily be chosen as an alternative * to SCTP_PROCESS_LEVEL_LOCKS. If one defines SCTP_PROCESS_LEVEL_LOCKS in * user_include/opt_sctp.h, then the file sctp_process_lock.h (which we didn't * implement) is used, and that declares these locks already (so using * SCTP_PROCESS_LEVEL_LOCKS *requires* that these defintions be commented out * in user_socketvar.h).
*/ #if 1 #define SOCK_LOCK(_so) #define SOCK_UNLOCK(_so) #define SOCKBUF_LOCK(_so_buf) #define SOCKBUF_UNLOCK(_so_buf) #define SOCKBUF_LOCK_ASSERT(_so_buf) #endif
#endif
Messung V0.5
¤ Dauer der Verarbeitung: 0.11 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.