Lines Matching refs:function

43 function can be used to direct a certain flow to a target based on
78 key, as this is dictated by the hash function.
126 hash functions is searched until the correct hash function that maps the
133 that key with the correct hash function.
141 Intuitively, finding a hash function that maps each of a large number
148 a hash function that produces the correct outputs for each key in the group.
192 is retrieved the key is hashed using this hash function and the result
211 given maximum number of flows, a function is called to insert a flow key
212 with a specific target value, and another function is used to retrieve
218 The function ``rte_efd_create()`` is used to create and return a pointer
234 The EFD function to insert a key or update a key to a new value is
235 ``rte_efd_update()``. This function will update an existing key to
242 failed to find a suitable perfect hash or the group was full). The function
248    This function is not multi-thread safe and should only be called
254 To lookup a certain key in an EFD table, the function ``rte_efd_lookup()``
260 function calls per key, it is always recommended to use a bulk lookup
261 function (simultaneous lookup of multiple keys) instead of a single key
262 lookup function. ``rte_efd_lookup_bulk()`` is the bulk lookup function,
268    This function is multi-thread safe, but there should not be other threads
274 To delete a certain key in an EFD table, the function
275 ``rte_efd_delete()`` can be used. The function returns zero upon success
283    This function is not multi-thread safe and should only be called
307    key is added, the hash function is updated that will satisfy the
322 Given a flow key, a hash function (in our implementation CRC hash) is
333 algorithm to find the perfect hash function. Assuming that the target
344 For a given keyX, a hash function ``(h(keyX, seed1) + index * h(keyX, seed2))``
347 The insert function will brute force search for all possible values for the
357 is okay if the hash function of both keys point to the same bit in the
382 the hash function ``h(key, seed1) + index *h(key, seed2)`` is used which will
391 assuming that a group id is simply a result of hash function. However,