1.. SPDX-License-Identifier: BSD-3-Clause 2 Copyright(c) 2010-2014 Intel Corporation. 3 4.. _Environment_Abstraction_Layer: 5 6Environment Abstraction Layer 7============================= 8 9The Environment Abstraction Layer (EAL) is responsible for gaining access to low-level resources such as hardware and memory space. 10It provides a generic interface that hides the environment specifics from the applications and libraries. 11It is the responsibility of the initialization routine to decide how to allocate these resources 12(that is, memory space, PCI devices, timers, consoles, and so on). 13 14Typical services expected from the EAL are: 15 16* DPDK Loading and Launching: 17 The DPDK and its application are linked as a single application and must be loaded by some means. 18 19* Core Affinity/Assignment Procedures: 20 The EAL provides mechanisms for assigning execution units to specific cores as well as creating execution instances. 21 22* System Memory Reservation: 23 The EAL facilitates the reservation of different memory zones, for example, physical memory areas for device interactions. 24 25* PCI Address Abstraction: The EAL provides an interface to access PCI address space. 26 27* Trace and Debug Functions: Logs, dump_stack, panic and so on. 28 29* Utility Functions: Spinlocks and atomic counters that are not provided in libc. 30 31* CPU Feature Identification: Determine at runtime if a particular feature, for example, Intel® AVX is supported. 32 Determine if the current CPU supports the feature set that the binary was compiled for. 33 34* Interrupt Handling: Interfaces to register/unregister callbacks to specific interrupt sources. 35 36* Alarm Functions: Interfaces to set/remove callbacks to be run at a specific time. 37 38EAL in a Linux-userland Execution Environment 39--------------------------------------------- 40 41In a Linux user space environment, the DPDK application runs as a user-space application using the pthread library. 42PCI information about devices and address space is discovered through the /sys kernel interface and through kernel modules such as uio_pci_generic, or igb_uio. 43Refer to the UIO: User-space drivers documentation in the Linux kernel. This memory is mmap'd in the application. 44 45The EAL performs physical memory allocation using mmap() in hugetlbfs (using huge page sizes to increase performance). 46This memory is exposed to DPDK service layers such as the :ref:`Mempool Library <Mempool_Library>`. 47 48At this point, the DPDK services layer will be initialized, then through pthread setaffinity calls, 49each execution unit will be assigned to a specific logical core to run as a user-level thread. 50 51The time reference is provided by the CPU Time-Stamp Counter (TSC) or by the HPET kernel API through a mmap() call. 52 53Initialization and Core Launching 54~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 55 56Part of the initialization is done by the start function of glibc. 57A check is also performed at initialization time to ensure that the micro architecture type chosen in the config file is supported by the CPU. 58Then, the main() function is called. The core initialization and launch is done in rte_eal_init() (see the API documentation). 59It consist of calls to the pthread library (more specifically, pthread_self(), pthread_create(), and pthread_setaffinity_np()). 60 61.. _figure_linuxapp_launch: 62 63.. figure:: img/linuxapp_launch.* 64 65 EAL Initialization in a Linux Application Environment 66 67 68.. note:: 69 70 Initialization of objects, such as memory zones, rings, memory pools, lpm tables and hash tables, 71 should be done as part of the overall application initialization on the master lcore. 72 The creation and initialization functions for these objects are not multi-thread safe. 73 However, once initialized, the objects themselves can safely be used in multiple threads simultaneously. 74 75Shutdown and Cleanup 76~~~~~~~~~~~~~~~~~~~~ 77 78During the initialization of EAL resources such as hugepage backed memory can be 79allocated by core components. The memory allocated during ``rte_eal_init()`` 80can be released by calling the ``rte_eal_cleanup()`` function. Refer to the 81API documentation for details. 82 83Multi-process Support 84~~~~~~~~~~~~~~~~~~~~~ 85 86The Linuxapp EAL allows a multi-process as well as a multi-threaded (pthread) deployment model. 87See chapter 88:ref:`Multi-process Support <Multi-process_Support>` for more details. 89 90Memory Mapping Discovery and Memory Reservation 91~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 92 93The allocation of large contiguous physical memory is done using the hugetlbfs kernel filesystem. 94The EAL provides an API to reserve named memory zones in this contiguous memory. 95The physical address of the reserved memory for that memory zone is also returned to the user by the memory zone reservation API. 96 97There are two modes in which DPDK memory subsystem can operate: dynamic mode, 98and legacy mode. Both modes are explained below. 99 100.. note:: 101 102 Memory reservations done using the APIs provided by rte_malloc are also backed by pages from the hugetlbfs filesystem. 103 104+ Dynamic memory mode 105 106Currently, this mode is only supported on Linux. 107 108In this mode, usage of hugepages by DPDK application will grow and shrink based 109on application's requests. Any memory allocation through ``rte_malloc()``, 110``rte_memzone_reserve()`` or other methods, can potentially result in more 111hugepages being reserved from the system. Similarly, any memory deallocation can 112potentially result in hugepages being released back to the system. 113 114Memory allocated in this mode is not guaranteed to be IOVA-contiguous. If large 115chunks of IOVA-contiguous are required (with "large" defined as "more than one 116page"), it is recommended to either use VFIO driver for all physical devices (so 117that IOVA and VA addresses can be the same, thereby bypassing physical addresses 118entirely), or use legacy memory mode. 119 120For chunks of memory which must be IOVA-contiguous, it is recommended to use 121``rte_memzone_reserve()`` function with ``RTE_MEMZONE_IOVA_CONTIG`` flag 122specified. This way, memory allocator will ensure that, whatever memory mode is 123in use, either reserved memory will satisfy the requirements, or the allocation 124will fail. 125 126There is no need to preallocate any memory at startup using ``-m`` or 127``--socket-mem`` command-line parameters, however it is still possible to do so, 128in which case preallocate memory will be "pinned" (i.e. will never be released 129by the application back to the system). It will be possible to allocate more 130hugepages, and deallocate those, but any preallocated pages will not be freed. 131If neither ``-m`` nor ``--socket-mem`` were specified, no memory will be 132preallocated, and all memory will be allocated at runtime, as needed. 133 134Another available option to use in dynamic memory mode is 135``--single-file-segments`` command-line option. This option will put pages in 136single files (per memseg list), as opposed to creating a file per page. This is 137normally not needed, but can be useful for use cases like userspace vhost, where 138there is limited number of page file descriptors that can be passed to VirtIO. 139 140If the application (or DPDK-internal code, such as device drivers) wishes to 141receive notifications about newly allocated memory, it is possible to register 142for memory event callbacks via ``rte_mem_event_callback_register()`` function. 143This will call a callback function any time DPDK's memory map has changed. 144 145If the application (or DPDK-internal code, such as device drivers) wishes to be 146notified about memory allocations above specified threshold (and have a chance 147to deny them), allocation validator callbacks are also available via 148``rte_mem_alloc_validator_callback_register()`` function. 149 150.. note:: 151 152 In multiprocess scenario, all related processes (i.e. primary process, and 153 secondary processes running with the same prefix) must be in the same memory 154 modes. That is, if primary process is run in dynamic memory mode, all of its 155 secondary processes must be run in the same mode. The same is applicable to 156 ``--single-file-segments`` command-line option - both primary and secondary 157 processes must shared this mode. 158 159+ Legacy memory mode 160 161This mode is enabled by specifying ``--legacy-mem`` command-line switch to the 162EAL. This switch will have no effect on FreeBSD as FreeBSD only supports 163legacy mode anyway. 164 165This mode mimics historical behavior of EAL. That is, EAL will reserve all 166memory at startup, sort all memory into large IOVA-contiguous chunks, and will 167not allow acquiring or releasing hugepages from the system at runtime. 168 169If neither ``-m`` nor ``--socket-mem`` were specified, the entire available 170hugepage memory will be preallocated. 171 172+ 32-bit support 173 174Additional restrictions are present when running in 32-bit mode. In dynamic 175memory mode, by default maximum of 2 gigabytes of VA space will be preallocated, 176and all of it will be on master lcore NUMA node unless ``--socket-mem`` flag is 177used. 178 179In legacy mode, VA space will only be preallocated for segments that were 180requested (plus padding, to keep IOVA-contiguousness). 181 182+ Maximum amount of memory 183 184All possible virtual memory space that can ever be used for hugepage mapping in 185a DPDK process is preallocated at startup, thereby placing an upper limit on how 186much memory a DPDK application can have. DPDK memory is stored in segment lists, 187each segment is strictly one physical page. It is possible to change the amount 188of virtual memory being preallocated at startup by editing the following config 189variables: 190 191* ``CONFIG_RTE_MAX_MEMSEG_LISTS`` controls how many segment lists can DPDK have 192* ``CONFIG_RTE_MAX_MEM_MB_PER_LIST`` controls how much megabytes of memory each 193 segment list can address 194* ``CONFIG_RTE_MAX_MEMSEG_PER_LIST`` controls how many segments each segment can 195 have 196* ``CONFIG_RTE_MAX_MEMSEG_PER_TYPE`` controls how many segments each memory type 197 can have (where "type" is defined as "page size + NUMA node" combination) 198* ``CONFIG_RTE_MAX_MEM_MB_PER_TYPE`` controls how much megabytes of memory each 199 memory type can address 200* ``CONFIG_RTE_MAX_MEM_MB`` places a global maximum on the amount of memory 201 DPDK can reserve 202 203Normally, these options do not need to be changed. 204 205.. note:: 206 207 Preallocated virtual memory is not to be confused with preallocated hugepage 208 memory! All DPDK processes preallocate virtual memory at startup. Hugepages 209 can later be mapped into that preallocated VA space (if dynamic memory mode 210 is enabled), and can optionally be mapped into it at startup. 211 212PCI Access 213~~~~~~~~~~ 214 215The EAL uses the /sys/bus/pci utilities provided by the kernel to scan the content on the PCI bus. 216To access PCI memory, a kernel module called uio_pci_generic provides a /dev/uioX device file 217and resource files in /sys 218that can be mmap'd to obtain access to PCI address space from the application. 219The DPDK-specific igb_uio module can also be used for this. Both drivers use the uio kernel feature (userland driver). 220 221Per-lcore and Shared Variables 222~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 223 224.. note:: 225 226 lcore refers to a logical execution unit of the processor, sometimes called a hardware *thread*. 227 228Shared variables are the default behavior. 229Per-lcore variables are implemented using *Thread Local Storage* (TLS) to provide per-thread local storage. 230 231Logs 232~~~~ 233 234A logging API is provided by EAL. 235By default, in a Linux application, logs are sent to syslog and also to the console. 236However, the log function can be overridden by the user to use a different logging mechanism. 237 238Trace and Debug Functions 239^^^^^^^^^^^^^^^^^^^^^^^^^ 240 241There are some debug functions to dump the stack in glibc. 242The rte_panic() function can voluntarily provoke a SIG_ABORT, 243which can trigger the generation of a core file, readable by gdb. 244 245CPU Feature Identification 246~~~~~~~~~~~~~~~~~~~~~~~~~~ 247 248The EAL can query the CPU at runtime (using the rte_cpu_get_features() function) to determine which CPU features are available. 249 250User Space Interrupt Event 251~~~~~~~~~~~~~~~~~~~~~~~~~~ 252 253+ User Space Interrupt and Alarm Handling in Host Thread 254 255The EAL creates a host thread to poll the UIO device file descriptors to detect the interrupts. 256Callbacks can be registered or unregistered by the EAL functions for a specific interrupt event 257and are called in the host thread asynchronously. 258The EAL also allows timed callbacks to be used in the same way as for NIC interrupts. 259 260.. note:: 261 262 In DPDK PMD, the only interrupts handled by the dedicated host thread are those for link status change 263 (link up and link down notification) and for sudden device removal. 264 265 266+ RX Interrupt Event 267 268The receive and transmit routines provided by each PMD don't limit themselves to execute in polling thread mode. 269To ease the idle polling with tiny throughput, it's useful to pause the polling and wait until the wake-up event happens. 270The RX interrupt is the first choice to be such kind of wake-up event, but probably won't be the only one. 271 272EAL provides the event APIs for this event-driven thread mode. 273Taking linuxapp as an example, the implementation relies on epoll. Each thread can monitor an epoll instance 274in which all the wake-up events' file descriptors are added. The event file descriptors are created and mapped to 275the interrupt vectors according to the UIO/VFIO spec. 276From bsdapp's perspective, kqueue is the alternative way, but not implemented yet. 277 278EAL initializes the mapping between event file descriptors and interrupt vectors, while each device initializes the mapping 279between interrupt vectors and queues. In this way, EAL actually is unaware of the interrupt cause on the specific vector. 280The eth_dev driver takes responsibility to program the latter mapping. 281 282.. note:: 283 284 Per queue RX interrupt event is only allowed in VFIO which supports multiple MSI-X vector. In UIO, the RX interrupt 285 together with other interrupt causes shares the same vector. In this case, when RX interrupt and LSC(link status change) 286 interrupt are both enabled(intr_conf.lsc == 1 && intr_conf.rxq == 1), only the former is capable. 287 288The RX interrupt are controlled/enabled/disabled by ethdev APIs - 'rte_eth_dev_rx_intr_*'. They return failure if the PMD 289hasn't support them yet. The intr_conf.rxq flag is used to turn on the capability of RX interrupt per device. 290 291+ Device Removal Event 292 293This event is triggered by a device being removed at a bus level. Its 294underlying resources may have been made unavailable (i.e. PCI mappings 295unmapped). The PMD must make sure that on such occurrence, the application can 296still safely use its callbacks. 297 298This event can be subscribed to in the same way one would subscribe to a link 299status change event. The execution context is thus the same, i.e. it is the 300dedicated interrupt host thread. 301 302Considering this, it is likely that an application would want to close a 303device having emitted a Device Removal Event. In such case, calling 304``rte_eth_dev_close()`` can trigger it to unregister its own Device Removal Event 305callback. Care must be taken not to close the device from the interrupt handler 306context. It is necessary to reschedule such closing operation. 307 308Blacklisting 309~~~~~~~~~~~~ 310 311The EAL PCI device blacklist functionality can be used to mark certain NIC ports as blacklisted, 312so they are ignored by the DPDK. 313The ports to be blacklisted are identified using the PCIe* description (Domain:Bus:Device.Function). 314 315Misc Functions 316~~~~~~~~~~~~~~ 317 318Locks and atomic operations are per-architecture (i686 and x86_64). 319 320Memory Segments and Memory Zones (memzone) 321------------------------------------------ 322 323The mapping of physical memory is provided by this feature in the EAL. 324As physical memory can have gaps, the memory is described in a table of descriptors, 325and each descriptor (called rte_memseg ) describes a physical page. 326 327On top of this, the memzone allocator's role is to reserve contiguous portions of physical memory. 328These zones are identified by a unique name when the memory is reserved. 329 330The rte_memzone descriptors are also located in the configuration structure. 331This structure is accessed using rte_eal_get_configuration(). 332The lookup (by name) of a memory zone returns a descriptor containing the physical address of the memory zone. 333 334Memory zones can be reserved with specific start address alignment by supplying the align parameter 335(by default, they are aligned to cache line size). 336The alignment value should be a power of two and not less than the cache line size (64 bytes). 337Memory zones can also be reserved from either 2 MB or 1 GB hugepages, provided that both are available on the system. 338 339Both memsegs and memzones are stored using ``rte_fbarray`` structures. Please 340refer to *DPDK API Reference* for more information. 341 342 343Multiple pthread 344---------------- 345 346DPDK usually pins one pthread per core to avoid the overhead of task switching. 347This allows for significant performance gains, but lacks flexibility and is not always efficient. 348 349Power management helps to improve the CPU efficiency by limiting the CPU runtime frequency. 350However, alternately it is possible to utilize the idle cycles available to take advantage of 351the full capability of the CPU. 352 353By taking advantage of cgroup, the CPU utilization quota can be simply assigned. 354This gives another way to improve the CPU efficiency, however, there is a prerequisite; 355DPDK must handle the context switching between multiple pthreads per core. 356 357For further flexibility, it is useful to set pthread affinity not only to a CPU but to a CPU set. 358 359EAL pthread and lcore Affinity 360~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 361 362The term "lcore" refers to an EAL thread, which is really a Linux/FreeBSD pthread. 363"EAL pthreads" are created and managed by EAL and execute the tasks issued by *remote_launch*. 364In each EAL pthread, there is a TLS (Thread Local Storage) called *_lcore_id* for unique identification. 365As EAL pthreads usually bind 1:1 to the physical CPU, the *_lcore_id* is typically equal to the CPU ID. 366 367When using multiple pthreads, however, the binding is no longer always 1:1 between an EAL pthread and a specified physical CPU. 368The EAL pthread may have affinity to a CPU set, and as such the *_lcore_id* will not be the same as the CPU ID. 369For this reason, there is an EAL long option '--lcores' defined to assign the CPU affinity of lcores. 370For a specified lcore ID or ID group, the option allows setting the CPU set for that EAL pthread. 371 372The format pattern: 373 --lcores='<lcore_set>[@cpu_set][,<lcore_set>[@cpu_set],...]' 374 375'lcore_set' and 'cpu_set' can be a single number, range or a group. 376 377A number is a "digit([0-9]+)"; a range is "<number>-<number>"; a group is "(<number|range>[,<number|range>,...])". 378 379If a '\@cpu_set' value is not supplied, the value of 'cpu_set' will default to the value of 'lcore_set'. 380 381 :: 382 383 For example, "--lcores='1,2@(5-7),(3-5)@(0,2),(0,6),7-8'" which means start 9 EAL thread; 384 lcore 0 runs on cpuset 0x41 (cpu 0,6); 385 lcore 1 runs on cpuset 0x2 (cpu 1); 386 lcore 2 runs on cpuset 0xe0 (cpu 5,6,7); 387 lcore 3,4,5 runs on cpuset 0x5 (cpu 0,2); 388 lcore 6 runs on cpuset 0x41 (cpu 0,6); 389 lcore 7 runs on cpuset 0x80 (cpu 7); 390 lcore 8 runs on cpuset 0x100 (cpu 8). 391 392Using this option, for each given lcore ID, the associated CPUs can be assigned. 393It's also compatible with the pattern of corelist('-l') option. 394 395non-EAL pthread support 396~~~~~~~~~~~~~~~~~~~~~~~ 397 398It is possible to use the DPDK execution context with any user pthread (aka. Non-EAL pthreads). 399In a non-EAL pthread, the *_lcore_id* is always LCORE_ID_ANY which identifies that it is not an EAL thread with a valid, unique, *_lcore_id*. 400Some libraries will use an alternative unique ID (e.g. TID), some will not be impacted at all, and some will work but with limitations (e.g. timer and mempool libraries). 401 402All these impacts are mentioned in :ref:`known_issue_label` section. 403 404Public Thread API 405~~~~~~~~~~~~~~~~~ 406 407There are two public APIs ``rte_thread_set_affinity()`` and ``rte_thread_get_affinity()`` introduced for threads. 408When they're used in any pthread context, the Thread Local Storage(TLS) will be set/get. 409 410Those TLS include *_cpuset* and *_socket_id*: 411 412* *_cpuset* stores the CPUs bitmap to which the pthread is affinitized. 413 414* *_socket_id* stores the NUMA node of the CPU set. If the CPUs in CPU set belong to different NUMA node, the *_socket_id* will be set to SOCKET_ID_ANY. 415 416 417.. _known_issue_label: 418 419Known Issues 420~~~~~~~~~~~~ 421 422+ rte_mempool 423 424 The rte_mempool uses a per-lcore cache inside the mempool. 425 For non-EAL pthreads, ``rte_lcore_id()`` will not return a valid number. 426 So for now, when rte_mempool is used with non-EAL pthreads, the put/get operations will bypass the default mempool cache and there is a performance penalty because of this bypass. 427 Only user-owned external caches can be used in a non-EAL context in conjunction with ``rte_mempool_generic_put()`` and ``rte_mempool_generic_get()`` that accept an explicit cache parameter. 428 429+ rte_ring 430 431 rte_ring supports multi-producer enqueue and multi-consumer dequeue. 432 However, it is non-preemptive, this has a knock on effect of making rte_mempool non-preemptable. 433 434 .. note:: 435 436 The "non-preemptive" constraint means: 437 438 - a pthread doing multi-producers enqueues on a given ring must not 439 be preempted by another pthread doing a multi-producer enqueue on 440 the same ring. 441 - a pthread doing multi-consumers dequeues on a given ring must not 442 be preempted by another pthread doing a multi-consumer dequeue on 443 the same ring. 444 445 Bypassing this constraint may cause the 2nd pthread to spin until the 1st one is scheduled again. 446 Moreover, if the 1st pthread is preempted by a context that has an higher priority, it may even cause a dead lock. 447 448 This does not mean it cannot be used, simply, there is a need to narrow down the situation when it is used by multi-pthread on the same core. 449 450 1. It CAN be used for any single-producer or single-consumer situation. 451 452 2. It MAY be used by multi-producer/consumer pthread whose scheduling policy are all SCHED_OTHER(cfs). User SHOULD be aware of the performance penalty before using it. 453 454 3. It MUST not be used by multi-producer/consumer pthreads, whose scheduling policies are SCHED_FIFO or SCHED_RR. 455 456+ rte_timer 457 458 Running ``rte_timer_manage()`` on a non-EAL pthread is not allowed. However, resetting/stopping the timer from a non-EAL pthread is allowed. 459 460+ rte_log 461 462 In non-EAL pthreads, there is no per thread loglevel and logtype, global loglevels are used. 463 464+ misc 465 466 The debug statistics of rte_ring, rte_mempool and rte_timer are not supported in a non-EAL pthread. 467 468cgroup control 469~~~~~~~~~~~~~~ 470 471The following is a simple example of cgroup control usage, there are two pthreads(t0 and t1) doing packet I/O on the same core ($CPU). 472We expect only 50% of CPU spend on packet IO. 473 474 .. code-block:: console 475 476 mkdir /sys/fs/cgroup/cpu/pkt_io 477 mkdir /sys/fs/cgroup/cpuset/pkt_io 478 479 echo $cpu > /sys/fs/cgroup/cpuset/cpuset.cpus 480 481 echo $t0 > /sys/fs/cgroup/cpu/pkt_io/tasks 482 echo $t0 > /sys/fs/cgroup/cpuset/pkt_io/tasks 483 484 echo $t1 > /sys/fs/cgroup/cpu/pkt_io/tasks 485 echo $t1 > /sys/fs/cgroup/cpuset/pkt_io/tasks 486 487 cd /sys/fs/cgroup/cpu/pkt_io 488 echo 100000 > pkt_io/cpu.cfs_period_us 489 echo 50000 > pkt_io/cpu.cfs_quota_us 490 491 492Malloc 493------ 494 495The EAL provides a malloc API to allocate any-sized memory. 496 497The objective of this API is to provide malloc-like functions to allow 498allocation from hugepage memory and to facilitate application porting. 499The *DPDK API Reference* manual describes the available functions. 500 501Typically, these kinds of allocations should not be done in data plane 502processing because they are slower than pool-based allocation and make 503use of locks within the allocation and free paths. 504However, they can be used in configuration code. 505 506Refer to the rte_malloc() function description in the *DPDK API Reference* 507manual for more information. 508 509Cookies 510~~~~~~~ 511 512When CONFIG_RTE_MALLOC_DEBUG is enabled, the allocated memory contains 513overwrite protection fields to help identify buffer overflows. 514 515Alignment and NUMA Constraints 516~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 517 518The rte_malloc() takes an align argument that can be used to request a memory 519area that is aligned on a multiple of this value (which must be a power of two). 520 521On systems with NUMA support, a call to the rte_malloc() function will return 522memory that has been allocated on the NUMA socket of the core which made the call. 523A set of APIs is also provided, to allow memory to be explicitly allocated on a 524NUMA socket directly, or by allocated on the NUMA socket where another core is 525located, in the case where the memory is to be used by a logical core other than 526on the one doing the memory allocation. 527 528Use Cases 529~~~~~~~~~ 530 531This API is meant to be used by an application that requires malloc-like 532functions at initialization time. 533 534For allocating/freeing data at runtime, in the fast-path of an application, 535the memory pool library should be used instead. 536 537Internal Implementation 538~~~~~~~~~~~~~~~~~~~~~~~ 539 540Data Structures 541^^^^^^^^^^^^^^^ 542 543There are two data structure types used internally in the malloc library: 544 545* struct malloc_heap - used to track free space on a per-socket basis 546 547* struct malloc_elem - the basic element of allocation and free-space 548 tracking inside the library. 549 550Structure: malloc_heap 551"""""""""""""""""""""" 552 553The malloc_heap structure is used to manage free space on a per-socket basis. 554Internally, there is one heap structure per NUMA node, which allows us to 555allocate memory to a thread based on the NUMA node on which this thread runs. 556While this does not guarantee that the memory will be used on that NUMA node, 557it is no worse than a scheme where the memory is always allocated on a fixed 558or random node. 559 560The key fields of the heap structure and their function are described below 561(see also diagram above): 562 563* lock - the lock field is needed to synchronize access to the heap. 564 Given that the free space in the heap is tracked using a linked list, 565 we need a lock to prevent two threads manipulating the list at the same time. 566 567* free_head - this points to the first element in the list of free nodes for 568 this malloc heap. 569 570* first - this points to the first element in the heap. 571 572* last - this points to the last element in the heap. 573 574.. _figure_malloc_heap: 575 576.. figure:: img/malloc_heap.* 577 578 Example of a malloc heap and malloc elements within the malloc library 579 580 581.. _malloc_elem: 582 583Structure: malloc_elem 584"""""""""""""""""""""" 585 586The malloc_elem structure is used as a generic header structure for various 587blocks of memory. 588It is used in two different ways - all shown in the diagram above: 589 590#. As a header on a block of free or allocated memory - normal case 591 592#. As a padding header inside a block of memory 593 594The most important fields in the structure and how they are used are described below. 595 596Malloc heap is a doubly-linked list, where each element keeps track of its 597previous and next elements. Due to the fact that hugepage memory can come and 598go, neighbouring malloc elements may not necessarily be adjacent in memory. 599Also, since a malloc element may span multiple pages, its contents may not 600necessarily be IOVA-contiguous either - each malloc element is only guaranteed 601to be virtually contiguous. 602 603.. note:: 604 605 If the usage of a particular field in one of the above three usages is not 606 described, the field can be assumed to have an undefined value in that 607 situation, for example, for padding headers only the "state" and "pad" 608 fields have valid values. 609 610* heap - this pointer is a reference back to the heap structure from which 611 this block was allocated. 612 It is used for normal memory blocks when they are being freed, to add the 613 newly-freed block to the heap's free-list. 614 615* prev - this pointer points to previous header element/block in memory. When 616 freeing a block, this pointer is used to reference the previous block to 617 check if that block is also free. If so, and the two blocks are immediately 618 adjacent to each other, then the two free blocks are merged to form a single 619 larger block. 620 621* next - this pointer points to next header element/block in memory. When 622 freeing a block, this pointer is used to reference the next block to check 623 if that block is also free. If so, and the two blocks are immediately 624 adjacent to each other, then the two free blocks are merged to form a single 625 larger block. 626 627* free_list - this is a structure pointing to previous and next elements in 628 this heap's free list. 629 It is only used in normal memory blocks; on ``malloc()`` to find a suitable 630 free block to allocate and on ``free()`` to add the newly freed element to 631 the free-list. 632 633* state - This field can have one of three values: ``FREE``, ``BUSY`` or 634 ``PAD``. 635 The former two are to indicate the allocation state of a normal memory block 636 and the latter is to indicate that the element structure is a dummy structure 637 at the end of the start-of-block padding, i.e. where the start of the data 638 within a block is not at the start of the block itself, due to alignment 639 constraints. 640 In that case, the pad header is used to locate the actual malloc element 641 header for the block. 642 643* pad - this holds the length of the padding present at the start of the block. 644 In the case of a normal block header, it is added to the address of the end 645 of the header to give the address of the start of the data area, i.e. the 646 value passed back to the application on a malloc. 647 Within a dummy header inside the padding, this same value is stored, and is 648 subtracted from the address of the dummy header to yield the address of the 649 actual block header. 650 651* size - the size of the data block, including the header itself. 652 653Memory Allocation 654^^^^^^^^^^^^^^^^^ 655 656On EAL initialization, all preallocated memory segments are setup as part of the 657malloc heap. This setup involves placing an :ref:`element header<malloc_elem>` 658with ``FREE`` at the start of each virtually contiguous segment of memory. 659The ``FREE`` element is then added to the ``free_list`` for the malloc heap. 660 661This setup also happens whenever memory is allocated at runtime (if supported), 662in which case newly allocated pages are also added to the heap, merging with any 663adjacent free segments if there are any. 664 665When an application makes a call to a malloc-like function, the malloc function 666will first index the ``lcore_config`` structure for the calling thread, and 667determine the NUMA node of that thread. 668The NUMA node is used to index the array of ``malloc_heap`` structures which is 669passed as a parameter to the ``heap_alloc()`` function, along with the 670requested size, type, alignment and boundary parameters. 671 672The ``heap_alloc()`` function will scan the free_list of the heap, and attempt 673to find a free block suitable for storing data of the requested size, with the 674requested alignment and boundary constraints. 675 676When a suitable free element has been identified, the pointer to be returned 677to the user is calculated. 678The cache-line of memory immediately preceding this pointer is filled with a 679struct malloc_elem header. 680Because of alignment and boundary constraints, there could be free space at 681the start and/or end of the element, resulting in the following behavior: 682 683#. Check for trailing space. 684 If the trailing space is big enough, i.e. > 128 bytes, then the free element 685 is split. 686 If it is not, then we just ignore it (wasted space). 687 688#. Check for space at the start of the element. 689 If the space at the start is small, i.e. <=128 bytes, then a pad header is 690 used, and the remaining space is wasted. 691 If, however, the remaining space is greater, then the free element is split. 692 693The advantage of allocating the memory from the end of the existing element is 694that no adjustment of the free list needs to take place - the existing element 695on the free list just has its size value adjusted, and the next/previous elements 696have their "prev"/"next" pointers redirected to the newly created element. 697 698In case when there is not enough memory in the heap to satisfy allocation 699request, EAL will attempt to allocate more memory from the system (if supported) 700and, following successful allocation, will retry reserving the memory again. In 701a multiprocessing scenario, all primary and secondary processes will synchronize 702their memory maps to ensure that any valid pointer to DPDK memory is guaranteed 703to be valid at all times in all currently running processes. 704 705Failure to synchronize memory maps in one of the processes will cause allocation 706to fail, even though some of the processes may have allocated the memory 707successfully. The memory is not added to the malloc heap unless primary process 708has ensured that all other processes have mapped this memory successfully. 709 710Any successful allocation event will trigger a callback, for which user 711applications and other DPDK subsystems can register. Additionally, validation 712callbacks will be triggered before allocation if the newly allocated memory will 713exceed threshold set by the user, giving a chance to allow or deny allocation. 714 715.. note:: 716 717 Any allocation of new pages has to go through primary process. If the 718 primary process is not active, no memory will be allocated even if it was 719 theoretically possible to do so. This is because primary's process map acts 720 as an authority on what should or should not be mapped, while each secondary 721 process has its own, local memory map. Secondary processes do not update the 722 shared memory map, they only copy its contents to their local memory map. 723 724Freeing Memory 725^^^^^^^^^^^^^^ 726 727To free an area of memory, the pointer to the start of the data area is passed 728to the free function. 729The size of the ``malloc_elem`` structure is subtracted from this pointer to get 730the element header for the block. 731If this header is of type ``PAD`` then the pad length is further subtracted from 732the pointer to get the proper element header for the entire block. 733 734From this element header, we get pointers to the heap from which the block was 735allocated and to where it must be freed, as well as the pointer to the previous 736and next elements. These next and previous elements are then checked to see if 737they are also ``FREE`` and are immediately adjacent to the current one, and if 738so, they are merged with the current element. This means that we can never have 739two ``FREE`` memory blocks adjacent to one another, as they are always merged 740into a single block. 741 742If deallocating pages at runtime is supported, and the free element encloses 743one or more pages, those pages can be deallocated and be removed from the heap. 744If DPDK was started with command-line parameters for preallocating memory 745(``-m`` or ``--socket-mem``), then those pages that were allocated at startup 746will not be deallocated. 747 748Any successful deallocation event will trigger a callback, for which user 749applications and other DPDK subsystems can register. 750