examples/ip_pipeline/pipeline/pipeline_actions_common.h

   1 /*-
   2  *   BSD LICENSE
   3  *
   4  *   Copyright(c) 2010-2015 Intel Corporation. All rights reserved.
   5  *   All rights reserved.
   6  *
   7  *   Redistribution and use in source and binary forms, with or without
   8  *   modification, are permitted provided that the following conditions
   9  *   are met:
  10  *
  11  *     * Redistributions of source code must retain the above copyright
  12  *       notice, this list of conditions and the following disclaimer.
  13  *     * Redistributions in binary form must reproduce the above copyright
  14  *       notice, this list of conditions and the following disclaimer in
  15  *       the documentation and/or other materials provided with the
  16  *       distribution.
  17  *     * Neither the name of Intel Corporation nor the names of its
  18  *       contributors may be used to endorse or promote products derived
  19  *       from this software without specific prior written permission.
  20  *
  21  *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  22  *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  23  *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  24  *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  25  *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  26  *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  27  *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  28  *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  29  *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  30  *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  31  *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  32  */
  33 #ifndef __INCLUDE_PIPELINE_ACTIONS_COMMON_H__
  34 #define __INCLUDE_PIPELINE_ACTIONS_COMMON_H__
  35
  36 #define PIPELINE_PORT_IN_AH(f_ah, f_pkt_work, f_pkt4_work)              \
  37 static int                                                              \
  38 f_ah(                                                                   \
  39         struct rte_mbuf **pkts,                                         \
  40         uint32_t n_pkts,                                                \
  41         uint64_t *pkts_mask,                                            \
  42         void *arg)                                                      \
  43 {                                                                       \
  44         uint32_t i;                                                     \
  45                                                                         \
  46         for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4)                   \
  47                 f_pkt4_work(&pkts[i], arg);                             \
  48                                                                         \
  49         for ( ; i < n_pkts; i++)                                        \
  50                 f_pkt_work(pkts[i], arg);                               \
  51                                                                         \
  52         *pkts_mask = (~0LLU) >> (64 - n_pkts);                          \
  53                                                                         \
  54         return 0;                                                       \
  55 }
  56
  57 #define PIPELINE_TABLE_AH_HIT(f_ah, f_pkt_work, f_pkt4_work)            \
  58 static int                                                              \
  59 f_ah(                                                                   \
  60         struct rte_mbuf **pkts,                                         \
  61         uint64_t *pkts_mask,                                            \
  62         struct rte_pipeline_table_entry **entries,                      \
  63         void *arg)                                                      \
  64 {                                                                       \
  65         uint64_t pkts_in_mask = *pkts_mask;                             \
  66                                                                         \
  67         if ((pkts_in_mask & (pkts_in_mask + 1)) == 0) {                 \
  68                 uint64_t n_pkts = __builtin_popcountll(pkts_in_mask);   \
  69                 uint32_t i;                                             \
  70                                                                         \
  71                 for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4)           \
  72                         f_pkt4_work(&pkts[i], &entries[i], arg);        \
  73                                                                         \
  74                 for ( ; i < n_pkts; i++)                                \
  75                         f_pkt_work(pkts[i], entries[i], arg);           \
  76         } else                                                          \
  77                 for ( ; pkts_in_mask; ) {                               \
  78                         uint32_t pos = __builtin_ctzll(pkts_in_mask);   \
  79                         uint64_t pkt_mask = 1LLU << pos;                \
  80                                                                         \
  81                         pkts_in_mask &= ~pkt_mask;                      \
  82                         f_pkt_work(pkts[pos], entries[pos], arg);       \
  83                 }                                                       \
  84                                                                         \
  85         return 0;                                                       \
  86 }
  87
  88 #define PIPELINE_TABLE_AH_MISS(f_ah, f_pkt_work, f_pkt4_work)           \
  89 static int                                                              \
  90 f_ah(                                                                   \
  91         struct rte_mbuf **pkts,                                         \
  92         uint64_t *pkts_mask,                                            \
  93         struct rte_pipeline_table_entry *entry,                         \
  94         void *arg)                                                      \
  95 {                                                                       \
  96         uint64_t pkts_in_mask = *pkts_mask;                             \
  97                                                                         \
  98         if ((pkts_in_mask & (pkts_in_mask + 1)) == 0) {                 \
  99                 uint64_t n_pkts = __builtin_popcountll(pkts_in_mask);   \
 100                 uint32_t i;                                             \
 101                                                                         \
 102                 for (i = 0; i < (n_pkts & (~0x3LLU)); i += 4)           \
 103                         f_pkt4_work(&pkts[i], entry, arg);              \
 104                                                                         \
 105                 for ( ; i < n_pkts; i++)                                \
 106                         f_pkt_work(pkts[i], entry, arg);                \
 107         } else                                                          \
 108                 for ( ; pkts_in_mask; ) {                               \
 109                         uint32_t pos = __builtin_ctzll(pkts_in_mask);   \
 110                         uint64_t pkt_mask = 1LLU << pos;                \
 111                                                                         \
 112                         pkts_in_mask &= ~pkt_mask;                      \
 113                         f_pkt_work(pkts[pos], entry, arg);              \
 114                 }                                                       \
 115                                                                         \
 116         return 0;                                                       \
 117 }
 118
 119 #endif