2012-09-04 12:54:00 +00:00
|
|
|
# BSD LICENSE
|
2014-06-03 23:42:50 +00:00
|
|
|
#
|
hash: replace with cuckoo hash implementation
This patch replaces the existing hash library with another approach,
using the Cuckoo Hash method to resolve collisions (open addressing),
which pushes items from a full bucket when a new entry tries
to be added in it, storing the evicted entry in an alternative location,
using a secondary hash function.
This gives the user the ability to store more entries when a bucket
is full, in comparison with the previous implementation.
Therefore, the unit test has been updated, as some scenarios have changed
(such as the previous removed restriction).
Also note that the API has not been changed, although new fields
have been added in the rte_hash structure (structure is internal now).
The main change when creating a new table is that the number of entries
per bucket is fixed now, so its parameter is ignored now
(still there to maintain the same parameters structure).
The hash unit test has been updated to reflect these changes.
As a last note, the maximum burst size in lookup_burst function
hash been increased to 64, to improve performance.
Signed-off-by: Pablo de Lara <pablo.de.lara.guarch@intel.com>
Acked-by: Bruce Richardson <bruce.richardson@intel.com>
2015-07-11 00:18:50 +00:00
|
|
|
# Copyright(c) 2010-2015 Intel Corporation. All rights reserved.
|
2012-09-04 12:54:00 +00:00
|
|
|
# All rights reserved.
|
2014-06-03 23:42:50 +00:00
|
|
|
#
|
2013-09-18 10:00:00 +00:00
|
|
|
# Redistribution and use in source and binary forms, with or without
|
|
|
|
|
# modification, are permitted provided that the following conditions
|
2012-09-04 12:54:00 +00:00
|
|
|
# are met:
|
2014-06-03 23:42:50 +00:00
|
|
|
#
|
2013-09-18 10:00:00 +00:00
|
|
|
# * Redistributions of source code must retain the above copyright
|
2012-09-04 12:54:00 +00:00
|
|
|
# notice, this list of conditions and the following disclaimer.
|
2013-09-18 10:00:00 +00:00
|
|
|
# * 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
|
2012-09-04 12:54:00 +00:00
|
|
|
# distribution.
|
2013-09-18 10:00:00 +00:00
|
|
|
# * Neither the name of Intel Corporation nor the names of its
|
|
|
|
|
# contributors may be used to endorse or promote products derived
|
2012-09-04 12:54:00 +00:00
|
|
|
# from this software without specific prior written permission.
|
2014-06-03 23:42:50 +00:00
|
|
|
#
|
2013-09-18 10:00:00 +00:00
|
|
|
# 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
|
2012-09-04 12:54:00 +00:00
|
|
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
|
|
include $(RTE_SDK)/mk/rte.vars.mk
|
|
|
|
|
|
|
|
|
|
# library name
|
|
|
|
|
LIB = librte_hash.a
|
|
|
|
|
|
|
|
|
|
CFLAGS += -O3
|
|
|
|
|
CFLAGS += $(WERROR_FLAGS) -I$(SRCDIR)
|
|
|
|
|
|
2015-02-02 17:40:20 +00:00
|
|
|
EXPORT_MAP := rte_hash_version.map
|
|
|
|
|
|
2015-09-04 09:05:40 +00:00
|
|
|
LIBABIVER := 2
|
2015-02-02 17:40:21 +00:00
|
|
|
|
2012-09-04 12:54:00 +00:00
|
|
|
# all source are stored in SRCS-y
|
hash: replace with cuckoo hash implementation
This patch replaces the existing hash library with another approach,
using the Cuckoo Hash method to resolve collisions (open addressing),
which pushes items from a full bucket when a new entry tries
to be added in it, storing the evicted entry in an alternative location,
using a secondary hash function.
This gives the user the ability to store more entries when a bucket
is full, in comparison with the previous implementation.
Therefore, the unit test has been updated, as some scenarios have changed
(such as the previous removed restriction).
Also note that the API has not been changed, although new fields
have been added in the rte_hash structure (structure is internal now).
The main change when creating a new table is that the number of entries
per bucket is fixed now, so its parameter is ignored now
(still there to maintain the same parameters structure).
The hash unit test has been updated to reflect these changes.
As a last note, the maximum burst size in lookup_burst function
hash been increased to 64, to improve performance.
Signed-off-by: Pablo de Lara <pablo.de.lara.guarch@intel.com>
Acked-by: Bruce Richardson <bruce.richardson@intel.com>
2015-07-11 00:18:50 +00:00
|
|
|
SRCS-$(CONFIG_RTE_LIBRTE_HASH) := rte_cuckoo_hash.c
|
2012-09-04 12:54:00 +00:00
|
|
|
SRCS-$(CONFIG_RTE_LIBRTE_HASH) += rte_fbk_hash.c
|
|
|
|
|
|
|
|
|
|
# install this header file
|
|
|
|
|
SYMLINK-$(CONFIG_RTE_LIBRTE_HASH)-include := rte_hash.h
|
|
|
|
|
SYMLINK-$(CONFIG_RTE_LIBRTE_HASH)-include += rte_hash_crc.h
|
2015-11-23 18:45:36 +00:00
|
|
|
ifeq ($(CONFIG_RTE_ARCH_ARM64),y)
|
|
|
|
|
SYMLINK-$(CONFIG_RTE_LIBRTE_HASH)-include += rte_crc_arm64.h
|
|
|
|
|
endif
|
2012-09-04 12:54:00 +00:00
|
|
|
SYMLINK-$(CONFIG_RTE_LIBRTE_HASH)-include += rte_jhash.h
|
2015-06-30 23:40:20 +00:00
|
|
|
SYMLINK-$(CONFIG_RTE_LIBRTE_HASH)-include += rte_thash.h
|
2012-09-04 12:54:00 +00:00
|
|
|
SYMLINK-$(CONFIG_RTE_LIBRTE_HASH)-include += rte_fbk_hash.h
|
|
|
|
|
|
hash: replace with cuckoo hash implementation
This patch replaces the existing hash library with another approach,
using the Cuckoo Hash method to resolve collisions (open addressing),
which pushes items from a full bucket when a new entry tries
to be added in it, storing the evicted entry in an alternative location,
using a secondary hash function.
This gives the user the ability to store more entries when a bucket
is full, in comparison with the previous implementation.
Therefore, the unit test has been updated, as some scenarios have changed
(such as the previous removed restriction).
Also note that the API has not been changed, although new fields
have been added in the rte_hash structure (structure is internal now).
The main change when creating a new table is that the number of entries
per bucket is fixed now, so its parameter is ignored now
(still there to maintain the same parameters structure).
The hash unit test has been updated to reflect these changes.
As a last note, the maximum burst size in lookup_burst function
hash been increased to 64, to improve performance.
Signed-off-by: Pablo de Lara <pablo.de.lara.guarch@intel.com>
Acked-by: Bruce Richardson <bruce.richardson@intel.com>
2015-07-11 00:18:50 +00:00
|
|
|
# this lib needs eal and ring
|
2015-07-15 16:32:20 +00:00
|
|
|
DEPDIRS-$(CONFIG_RTE_LIBRTE_HASH) += lib/librte_eal lib/librte_ring
|
2012-09-04 12:54:00 +00:00
|
|
|
|
|
|
|
|
include $(RTE_SDK)/mk/rte.lib.mk
|
