test mbuf attach

[dpdk.git] / lib / librte_ip_frag / rte_ip_frag_common.c

diff --git a/lib/librte_ip_frag/rte_ip_frag_common.c b/lib/librte_ip_frag/rte_ip_frag_common.c
index e4d16d0..6b29e9d 100644 (file)
--- a/lib/librte_ip_frag/rte_ip_frag_common.c
+++ b/lib/librte_ip_frag/rte_ip_frag_common.c
@@ -1,34 +1,5 @@
-/*-
- *   BSD LICENSE
- *
- *   Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
- *   All rights reserved.
- *
- *   Redistribution and use in source and binary forms, with or without
- *   modification, are permitted provided that the following conditions
- *   are met:
- *
- *     * Redistributions of source code must retain the above copyright
- *       notice, this list of conditions and the following disclaimer.
- *     * 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.
- *     * Neither the name of Intel Corporation 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.
+/* SPDX-License-Identifier: BSD-3-Clause
+ * Copyright(c) 2010-2014 Intel Corporation
  */
 
 #include <stddef.h>
@@ -83,16 +54,16 @@ rte_ip_frag_table_create(uint32_t bucket_num, uint32_t bucket_entries,
                        nb_entries > UINT32_MAX || nb_entries == 0 ||
                        nb_entries < max_entries) {
                RTE_LOG(ERR, USER1, "%s: invalid input parameter\n", __func__);
-               return (NULL);
+               return NULL;
        }
 
        sz = sizeof (*tbl) + nb_entries * sizeof (tbl->pkt[0]);
-       if ((tbl = rte_zmalloc_socket(__func__, sz, CACHE_LINE_SIZE,
+       if ((tbl = rte_zmalloc_socket(__func__, sz, RTE_CACHE_LINE_SIZE,
                        socket_id)) == NULL) {
                RTE_LOG(ERR, USER1,
                        "%s: allocation of %zu bytes at socket %d failed do\n",
                        __func__, sz, socket_id);
-               return (NULL);
+               return NULL;
        }
 
        RTE_LOG(INFO, USER1, "%s: allocated of %zu bytes at socket %d\n",
@@ -106,7 +77,20 @@ rte_ip_frag_table_create(uint32_t bucket_num, uint32_t bucket_entries,
        tbl->entry_mask = (tbl->nb_entries - 1) & ~(tbl->bucket_entries  - 1);
 
        TAILQ_INIT(&(tbl->lru));
-       return (tbl);
+       return tbl;
+}
+
+/* delete fragmentation table */
+void
+rte_ip_frag_table_destroy(struct rte_ip_frag_tbl *tbl)
+{
+       struct ip_frag_pkt *fp;
+
+       TAILQ_FOREACH(fp, &tbl->lru, lru) {
+               ip_frag_free_immediate(fp);
+       }
+
+       rte_free(tbl);
 }
 
 /* dump frag table statistics to file */
@@ -137,3 +121,24 @@ rte_ip_frag_table_statistics_dump(FILE *f, const struct rte_ip_frag_tbl *tbl)
                fail_nospace,
                fail_total - fail_nospace);
 }
+
+/* Delete expired fragments */
+void
+rte_frag_table_del_expired_entries(struct rte_ip_frag_tbl *tbl,
+       struct rte_ip_frag_death_row *dr, uint64_t tms)
+{
+       uint64_t max_cycles;
+       struct ip_frag_pkt *fp;
+
+       max_cycles = tbl->max_cycles;
+
+       TAILQ_FOREACH(fp, &tbl->lru, lru)
+               if (max_cycles + fp->start < tms) {
+                       /* check that death row has enough space */
+                       if (IP_FRAG_DEATH_ROW_MBUF_LEN - dr->cnt >= fp->last_idx)
+                               ip_frag_tbl_del(tbl, dr, fp);
+                       else
+                               return;
+               } else
+                       return;
+}