c44d09811b
rte_fbarray is a simple indexed array stored in shared memory via mapping files into memory. Rationale for its existence is the following: since we are going to map memory page-by-page, there could be quite a lot of memory segments to keep track of (for smaller page sizes, page count can easily reach thousands). We can't really make page lists truly dynamic and infinitely expandable, because that involves reallocating memory (which is a big no-no in multiprocess). What we can do instead is have a maximum capacity as something really, really large, and decide at allocation time how big the array is going to be. We map the entire file into memory, which makes it possible to use fbarray as shared memory, provided the structure itself is allocated in shared memory. Per-fbarray locking is also used to avoid index data races (but not contents data races - that is up to user application to synchronize). In addition, in understanding that we will frequently need to scan this array for free space and iterating over array linearly can become slow, rte_fbarray provides facilities to index array's usage. The following use cases are covered: - find next free/used slot (useful either for adding new elements to fbarray, or walking the list) - find starting index for next N free/used slots (useful for when we want to allocate chunk of VA-contiguous memory composed of several pages) - find how many contiguous free/used slots there are, starting from specified index (useful for when we want to figure out how many pages we have until next hole in allocated memory, to speed up some bulk operations where we would otherwise have to walk the array and add pages one by one) This is accomplished by storing a usage mask in-memory, right after the data section of the array, and using some bit-level magic to figure out the info we need. Signed-off-by: Anatoly Burakov <anatoly.burakov@intel.com> Tested-by: Santosh Shukla <santosh.shukla@caviumnetworks.com> Tested-by: Hemant Agrawal <hemant.agrawal@nxp.com> Tested-by: Gowrishankar Muthukrishnan <gowrishankar.m@linux.vnet.ibm.com>
36 lines
1.4 KiB
Makefile
36 lines
1.4 KiB
Makefile
# SPDX-License-Identifier: BSD-3-Clause
|
|
# Copyright(c) 2010-2014 Intel Corporation
|
|
|
|
include $(RTE_SDK)/mk/rte.vars.mk
|
|
|
|
INC := rte_branch_prediction.h rte_common.h
|
|
INC += rte_debug.h rte_eal.h rte_eal_interrupts.h
|
|
INC += rte_errno.h rte_launch.h rte_lcore.h
|
|
INC += rte_log.h rte_memory.h rte_memzone.h
|
|
INC += rte_per_lcore.h rte_random.h
|
|
INC += rte_tailq.h rte_interrupts.h rte_alarm.h
|
|
INC += rte_string_fns.h rte_version.h
|
|
INC += rte_eal_memconfig.h rte_malloc_heap.h
|
|
INC += rte_hexdump.h rte_devargs.h rte_bus.h rte_dev.h
|
|
INC += rte_pci_dev_feature_defs.h rte_pci_dev_features.h
|
|
INC += rte_malloc.h rte_keepalive.h rte_time.h
|
|
INC += rte_service.h rte_service_component.h
|
|
INC += rte_bitmap.h rte_vfio.h rte_hypervisor.h rte_test.h
|
|
INC += rte_reciprocal.h rte_fbarray.h
|
|
|
|
GENERIC_INC := rte_atomic.h rte_byteorder.h rte_cycles.h rte_prefetch.h
|
|
GENERIC_INC += rte_spinlock.h rte_memcpy.h rte_cpuflags.h rte_rwlock.h
|
|
GENERIC_INC += rte_vect.h rte_pause.h rte_io.h
|
|
|
|
# defined in mk/arch/$(RTE_ARCH)/rte.vars.mk
|
|
ARCH_DIR ?= $(RTE_ARCH)
|
|
ARCH_INC := $(sort $(notdir $(wildcard $(RTE_SDK)/lib/librte_eal/common/include/arch/$(ARCH_DIR)/*.h)))
|
|
|
|
SYMLINK-$(CONFIG_RTE_LIBRTE_EAL)-include := $(addprefix include/,$(INC))
|
|
SYMLINK-$(CONFIG_RTE_LIBRTE_EAL)-include += \
|
|
$(addprefix include/arch/$(ARCH_DIR)/,$(ARCH_INC))
|
|
SYMLINK-$(CONFIG_RTE_LIBRTE_EAL)-include/generic := \
|
|
$(addprefix include/generic/,$(GENERIC_INC))
|
|
|
|
include $(RTE_SDK)/mk/rte.install.mk
|