4 * Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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
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.
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.
34 #ifndef __INCLUDE_RTE_TABLE_H__
35 #define __INCLUDE_RTE_TABLE_H__
45 * This tool is part of the Intel DPDK Packet Framework tool suite and provides
46 * a standard interface to implement different types of lookup tables for data
49 * Virtually any search algorithm that can uniquely associate data to a lookup
50 * key can be fitted under this lookup table abstraction. For the flow table
51 * use-case, the lookup key is an n-tuple of packet fields that uniquely
52 * identifies a traffic flow, while data represents actions and action
53 * meta-data associated with the same traffic flow.
65 * Parameters for lookup table creation. The underlying data structure is
66 * different for each lookup table type.
68 * CPU socket ID (e.g. for memory allocation purpose)
70 * Data size of each lookup table entry (measured in bytes)
72 * Handle to lookup table instance
74 typedef void* (*rte_table_op_create)(void *params, int socket_id,
81 * Handle to lookup table instance
83 * 0 on success, error code otherwise
85 typedef int (*rte_table_op_free)(void *table);
88 * Lookup table entry add
91 * Handle to lookup table instance
95 * Data to be associated with the current key. This parameter has to point to
96 * a valid memory buffer where the first entry_size bytes (table create
97 * parameter) are populated with the data.
99 * After successful invocation, *key_found is set to a value different than 0
100 * if the current key is already present in the table and to 0 if not. This
101 * pointer has to be set to a valid memory location before the table entry add
102 * function is called.
104 * After successful invocation, *entry_ptr stores the handle to the table
105 * entry containing the data associated with the current key. This handle can
106 * be used to perform further read-write accesses to this entry. This handle
107 * is valid until the key is deleted from the table or the same key is
108 * re-added to the table, typically to associate it with different data. This
109 * pointer has to be set to a valid memory location before the function is
112 * 0 on success, error code otherwise
114 typedef int (*rte_table_op_entry_add)(
122 * Lookup table entry delete
125 * Handle to lookup table instance
129 * After successful invocation, *key_found is set to a value different than 0
130 * if the current key was present in the table before the delete operation
131 * was performed and to 0 if not. This pointer has to be set to a valid
132 * memory location before the table entry delete function is called.
134 * After successful invocation, if the key is found in the table (*key found
135 * is different than 0 after function call is completed) and entry points to
136 * a valid buffer (entry is set to a value different than NULL before the
137 * function is called), then the first entry_size bytes (table create
138 * parameter) in *entry store a copy of table entry that contained the data
139 * associated with the current key before the key was deleted.
141 * 0 on success, error code otherwise
143 typedef int (*rte_table_op_entry_delete)(
150 * Lookup table lookup
153 * Handle to lookup table instance
155 * Burst of input packets specified as array of up to 64 pointers to struct
158 * 64-bit bitmask specifying which packets in the input burst are valid. When
159 * pkts_mask bit n is set, then element n of pkts array is pointing to a
160 * valid packet. Otherwise, element n of pkts array does not point to a valid
161 * packet, therefore it will not be accessed.
162 * @param lookup_hit_mask
163 * Once the table lookup operation is completed, this 64-bit bitmask
164 * specifies which of the valid packets in the input burst resulted in lookup
165 * hit. For each valid input packet (pkts_mask bit n is set), the following
166 * are true on lookup hit: lookup_hit_mask bit n is set, element n of entries
167 * array is valid and it points to the lookup table entry that was hit. For
168 * each valid input packet (pkts_mask bit n is set), the following are true
169 * on lookup miss: lookup_hit_mask bit n is not set and element n of entries
170 * array is not valid.
172 * Once the table lookup operation is completed, this array provides the
173 * lookup table entries that were hit, as described above. It is required
174 * that this array is always pre-allocated by the caller of this function
175 * with exactly 64 elements. The implementation is allowed to speculatively
176 * modify the elements of this array, so elements marked as invalid in
177 * lookup_hit_mask once the table lookup operation is completed might have
178 * been modified by this function.
180 * 0 on success, error code otherwise
182 typedef int (*rte_table_op_lookup)(
184 struct rte_mbuf **pkts,
186 uint64_t *lookup_hit_mask,
189 /** Lookup table interface defining the lookup table operation */
190 struct rte_table_ops {
191 rte_table_op_create f_create; /**< Create */
192 rte_table_op_free f_free; /**< Free */
193 rte_table_op_entry_add f_add; /**< Entry add */
194 rte_table_op_entry_delete f_delete; /**< Entry delete */
195 rte_table_op_lookup f_lookup; /**< Lookup */