Programmer’s Guide

• 1. Introduction
  • 1.1. Documentation Roadmap
  • 1.2. Related Publications
• 2. Overview
  • 2.1. Development Environment
  • 2.2. Environment Abstraction Layer
  • 2.3. Core Components
    • 2.3.1. Ring Manager (librte_ring)
    • 2.3.2. Memory Pool Manager (librte_mempool)
    • 2.3.3. Network Packet Buffer Management (librte_mbuf)
    • 2.3.4. Timer Manager (librte_timer)
  • 2.4. Ethernet* Poll Mode Driver Architecture
  • 2.5. Packet Forwarding Algorithm Support
  • 2.6. librte_net
• 3. Environment Abstraction Layer
  • 3.1. EAL in a Linux-userland Execution Environment
    • 3.1.1. Initialization and Core Launching
    • 3.1.2. Shutdown and Cleanup
    • 3.1.3. Multi-process Support
    • 3.1.4. Memory Mapping Discovery and Memory Reservation
    • 3.1.5. Support for Externally Allocated Memory
    • 3.1.6. Per-lcore and Shared Variables
    • 3.1.7. Logs
    • 3.1.8. CPU Feature Identification
    • 3.1.9. User Space Interrupt Event
    • 3.1.10. Block list
    • 3.1.11. Misc Functions
    • 3.1.12. IOVA Mode Detection
    • 3.1.13. IOVA Mode Configuration
    • 3.1.14. Max SIMD bitwidth
  • 3.2. Memory Segments and Memory Zones (memzone)
  • 3.3. Multiple pthread
    • 3.3.1. EAL pthread and lcore Affinity
    • 3.3.2. non-EAL pthread support
    • 3.3.3. Public Thread API
    • 3.3.4. Control Thread API
    • 3.3.5. Known Issues
    • 3.3.6. cgroup control
  • 3.4. Malloc
    • 3.4.1. Alignment and NUMA Constraints
    • 3.4.2. Use Cases
    • 3.4.3. Internal Implementation
• 4. Service Cores
  • 4.1. Service Core Initialization
  • 4.2. Enabling Services on Cores
  • 4.3. Service Core Statistics
• 5. Trace Library
  • 5.1. Overview
  • 5.2. DPDK tracing library features
  • 5.3. How to add a tracepoint?
    • 5.3.1. Create the tracepoint header file
    • 5.3.2. Register the tracepoint
  • 5.4. Fast path tracepoint
  • 5.5. Event record mode
  • 5.6. Trace file location
  • 5.7. View and analyze the recorded events
    • 5.7.1. Use the babeltrace command-line tool
    • 5.7.2. Use the tracecompass GUI tool
  • 5.8. Quick start
  • 5.9. Implementation details
    • 5.9.1. Trace metadata creation
    • 5.9.2. Trace memory
    • 5.9.3. Trace memory layout
• 6. RCU Library
  • 6.1. What is Quiescent State
  • 6.2. Factors affecting the RCU mechanism
  • 6.3. RCU in DPDK
  • 6.4. How to use this library
  • 6.5. Resource reclamation framework for DPDK
• 7. Ring Library
  • 7.1. References for Ring Implementation in FreeBSD*
  • 7.2. Lockless Ring Buffer in Linux*
  • 7.3. Additional Features
    • 7.3.1. Name
  • 7.4. Use Cases
  • 7.5. Anatomy of a Ring Buffer
    • 7.5.1. Single Producer Enqueue
    • 7.5.2. Single Consumer Dequeue
    • 7.5.3. Multiple Producers Enqueue
    • 7.5.4. Modulo 32-bit Indexes
  • 7.6. Producer/consumer synchronization modes
    • 7.6.1. MP/MC (default one)
    • 7.6.2. SP/SC
    • 7.6.3. MP_RTS/MC_RTS
    • 7.6.4. MP_HTS/MC_HTS
  • 7.7. Ring Peek API
  • 7.8. Ring Peek Zero Copy API
  • 7.9. References
• 8. Stack Library
  • 8.1. Implementation
    • 8.1.1. Lock-based Stack
    • 8.1.2. Lock-free Stack
• 9. Mempool Library
  • 9.1. Cookies
  • 9.2. Stats
  • 9.3. Memory Alignment Constraints on x86 architecture
  • 9.4. Local Cache
  • 9.5. Mempool Handlers
  • 9.6. Use Cases
• 10. Mbuf Library
  • 10.1. Design of Packet Buffers
  • 10.2. Buffers Stored in Memory Pools
  • 10.3. Constructors
  • 10.4. Allocating and Freeing mbufs
  • 10.5. Manipulating mbufs
  • 10.6. Meta Information
    • 10.6.1. Dynamic fields and flags
  • 10.7. Direct and Indirect Buffers
  • 10.8. Debug
  • 10.9. Use Cases
• 11. Poll Mode Driver
  • 11.1. Requirements and Assumptions
  • 11.2. Design Principles
  • 11.3. Logical Cores, Memory and NIC Queues Relationships
  • 11.4. Device Identification, Ownership and Configuration
    • 11.4.1. Device Identification
    • 11.4.2. Port Ownership
    • 11.4.3. Device Configuration
    • 11.4.4. On-the-Fly Configuration
    • 11.4.5. Configuration of Transmit Queues
    • 11.4.6. Free Tx mbuf on Demand
    • 11.4.7. Hardware Offload
  • 11.5. Poll Mode Driver API
    • 11.5.1. Generalities
    • 11.5.2. Generic Packet Representation
    • 11.5.3. Ethernet Device API
    • 11.5.4. Ethernet Device Standard Device Arguments
    • 11.5.5. Extended Statistics API
    • 11.5.6. NIC Reset API
• 12. Generic flow API (rte_flow)
  • 12.1. Overview
  • 12.2. Flow rule
    • 12.2.1. Description
    • 12.2.2. Attributes
    • 12.2.3. Pattern item
    • 12.2.4. Matching pattern
    • 12.2.5. Meta item types
    • 12.2.6. Data matching item types
    • 12.2.7. Actions
    • 12.2.8. Action types
    • 12.2.9. Negative types
  • 12.3. Rules management
    • 12.3.1. Validation
    • 12.3.2. Creation
    • 12.3.3. Destruction
    • 12.3.4. Flush
    • 12.3.5. Query
  • 12.4. Flow isolated mode
  • 12.5. Verbose error reporting
  • 12.6. Helpers
    • 12.6.1. Error initializer
    • 12.6.2. Object conversion
    • 12.6.3. Tunneled traffic offload
  • 12.7. Caveats
  • 12.8. PMD interface
  • 12.9. Device compatibility
    • 12.9.1. Global bit-masks
    • 12.9.2. Unsupported layer types
    • 12.9.3. ANY pattern item
    • 12.9.4. Unsupported actions
    • 12.9.5. Flow rules priority
• 13. Switch Representation within DPDK Applications
  • 13.1. Introduction
  • 13.2. Sub Function
  • 13.3. Port Representors
  • 13.4. Basic SR-IOV
  • 13.5. Controlled SR-IOV
    • 13.5.1. Initialization
    • 13.5.2. VF Representors
    • 13.5.3. Traffic Steering
  • 13.6. Flow API (rte_flow)
    • 13.6.1. Extensions
    • 13.6.2. Traffic Direction
    • 13.6.3. Transferring Traffic
    • 13.6.4. Pattern Items And Actions
    • 13.6.5. Actions Order and Repetition
  • 13.7. Switching Examples
    • 13.7.1. Associating VF 1 with Physical Port 0
    • 13.7.2. Sharing Broadcasts
    • 13.7.3. Encapsulating VF 2 Traffic in VXLAN
• 14. Traffic Metering and Policing API
  • 14.1. Overview
  • 14.2. Configuration steps
  • 14.3. Run-time processing
• 15. Traffic Management API
  • 15.1. Overview
  • 15.2. Capability API
  • 15.3. Scheduling Algorithms
  • 15.4. Traffic Shaping
  • 15.5. Congestion Management
  • 15.6. Packet Marking
  • 15.7. Steps to Setup the Hierarchy
    • 15.7.1. Initial Hierarchy Specification
    • 15.7.2. Hierarchy Commit
    • 15.7.3. Run-Time Hierarchy Updates
• 16. Wireless Baseband Device Library
  • 16.1. Design Principles
  • 16.2. Device Management
    • 16.2.1. Device Creation
    • 16.2.2. Device Identification
    • 16.2.3. Device Configuration
    • 16.2.4. Queues Configuration
    • 16.2.5. Device & Queues Management
    • 16.2.6. Logical Cores, Memory and Queues Relationships
  • 16.3. Device Operation Capabilities
    • 16.3.1. Capabilities Discovery
  • 16.4. Operation Processing
    • 16.4.1. Enqueue / Dequeue Burst APIs
    • 16.4.2. Operation Representation
    • 16.4.3. Operation Management and Allocation
    • 16.4.4. BBDEV Inbound/Outbound Memory
    • 16.4.5. BBDEV Turbo Encode Operation
    • 16.4.6. BBDEV Turbo Decode Operation
    • 16.4.7. BBDEV LDPC Encode Operation
    • 16.4.8. BBDEV LDPC Decode Operation
  • 16.5. Sample code
    • 16.5.1. BBDEV Device API
• 17. Cryptography Device Library
  • 17.1. Design Principles
  • 17.2. Device Management
    • 17.2.1. Device Creation
    • 17.2.2. Device Identification
    • 17.2.3. Device Configuration
    • 17.2.4. Configuration of Queue Pairs
    • 17.2.5. Logical Cores, Memory and Queues Pair Relationships
  • 17.3. Device Features and Capabilities
    • 17.3.1. Device Features
    • 17.3.2. Device Operation Capabilities
    • 17.3.3. Capabilities Discovery
  • 17.4. Operation Processing
    • 17.4.1. Private data
    • 17.4.2. User callback APIs
    • 17.4.3. Enqueue / Dequeue Burst APIs
    • 17.4.4. Operation Representation
    • 17.4.5. Operation Management and Allocation
  • 17.5. Symmetric Cryptography Support
    • 17.5.1. Session and Session Management
    • 17.5.2. Transforms and Transform Chaining
    • 17.5.3. Symmetric Operations
  • 17.6. Synchronous mode
    • 17.6.1. Cryptodev Raw Data-path APIs
  • 17.7. Sample code
  • 17.8. Asymmetric Cryptography
    • 17.8.1. Session and Session Management
    • 17.8.2. Asymmetric Sessionless Support
    • 17.8.3. Transforms and Transform Chaining
    • 17.8.4. Asymmetric Operations
  • 17.9. Asymmetric crypto Sample code
    • 17.9.1. Asymmetric Crypto Device API
• 18. Compression Device Library
  • 18.1. Device Management
    • 18.1.1. Device Creation
    • 18.1.2. Device Identification
    • 18.1.3. Device Configuration
    • 18.1.4. Configuration of Queue Pairs
    • 18.1.5. Logical Cores, Memory and Queues Pair Relationships
  • 18.2. Device Features and Capabilities
    • 18.2.1. Capabilities
    • 18.2.2. Capabilities Discovery
  • 18.3. Compression Operation
    • 18.3.1. Operation Representation
    • 18.3.2. Operation Management and Allocation
    • 18.3.3. Passing source data as mbuf-chain
    • 18.3.4. Operation Status
    • 18.3.5. Operation status after enqueue / dequeue
    • 18.3.6. Produced, Consumed And Operation Status
  • 18.4. Transforms
  • 18.5. Compression API Hash support
  • 18.6. Compression API Stateless operation
    • 18.6.1. priv_xform in Stateless operation
    • 18.6.2. Stateless and OUT_OF_SPACE
    • 18.6.3. Hash in Stateless
    • 18.6.4. Checksum in Stateless
  • 18.7. Compression API Stateful operation
    • 18.7.1. Stream in Stateful operation
    • 18.7.2. Stateful and OUT_OF_SPACE
    • 18.7.3. Hash in Stateful
    • 18.7.4. Checksum in Stateful
  • 18.8. Burst in compression API
    • 18.8.1. Enqueue / Dequeue Burst APIs
  • 18.9. Sample code
    • 18.9.1. Compression Device API
• 19. RegEx Device Library
  • 19.1. Design Principles
  • 19.2. Device Management
    • 19.2.1. Device Creation
    • 19.2.2. Device Identification
    • 19.2.3. Device Configuration
    • 19.2.4. Configuration of Rules Database
    • 19.2.5. Configuration of Queue Pairs
    • 19.2.6. Logical Cores, Memory and Queues Pair Relationships
  • 19.3. Device Features and Capabilities
    • 19.3.1. Enqueue / Dequeue Burst APIs
• 20. Security Library
  • 20.1. Design Principles
    • 20.1.1. Inline Crypto
    • 20.1.2. Inline protocol offload
    • 20.1.3. Lookaside protocol offload
    • 20.1.4. PDCP Flow Diagram
    • 20.1.5. DOCSIS Protocol
  • 20.2. Device Features and Capabilities
    • 20.2.1. Device Capabilities For Security Operations
    • 20.2.2. Capabilities Discovery
    • 20.2.3. Security Session Create/Free
    • 20.2.4. Security session configuration
    • 20.2.5. Security API
    • 20.2.6. Flow based Security Session
• 21. Rawdevice Library
  • 21.1. Introduction
  • 21.2. Design
    • 21.2.1. Device Identification
• 22. Link Bonding Poll Mode Driver Library
  • 22.1. Link Bonding Modes Overview
  • 22.2. Implementation Details
    • 22.2.1. Link Status Change Interrupts / Polling
    • 22.2.2. Requirements / Limitations
    • 22.2.3. Configuration
  • 22.3. Using Link Bonding Devices
    • 22.3.1. Using the Poll Mode Driver from an Application
    • 22.3.2. Using Link Bonding Devices from the EAL Command Line
• 23. Timer Library
  • 23.1. Implementation Details
  • 23.2. Use Cases
  • 23.3. References
• 24. Hash Library
  • 24.1. Hash API Overview
  • 24.2. Multi-process support
  • 24.3. Multi-thread support
  • 24.4. Extendable Bucket Functionality support
  • 24.5. Implementation Details (non Extendable Bucket Case)
  • 24.6. Implementation Details (with Extendable Bucket)
  • 24.7. Entry distribution in hash table
  • 24.8. Use Case: Flow Classification
  • 24.9. References
• 25. Toeplitz Hash Library
  • 25.1. Toeplitz hash function API
  • 25.2. Predictable RSS
    • 25.2.1. Thash context
    • 25.2.2. Thash helper
    • 25.2.3. Calculation of the complementary bits to adjust the subtuple
    • 25.2.4. Adjust tuple API
  • 25.3. Use case example
• 26. Elastic Flow Distributor Library
  • 26.1. Introduction
  • 26.2. Flow Based Distribution
    • 26.2.1. Computation Based Schemes
    • 26.2.2. Flow-Table Based Schemes
    • 26.2.3. EFD Based Scheme
  • 26.3. Example of EFD Library Usage
  • 26.4. Library API Overview
    • 26.4.1. EFD Table Create
    • 26.4.2. EFD Insert and Update
    • 26.4.3. EFD Lookup
    • 26.4.4. EFD Delete
  • 26.5. Library Internals
    • 26.5.1. Insert Function Internals
    • 26.5.2. Lookup Function Internals
    • 26.5.3. Group Rebalancing Function Internals
  • 26.6. References
• 27. Membership Library
  • 27.1. Introduction
  • 27.2. Vector of Bloom Filters
  • 27.3. Hash-Table based Set-Summaries
    • 27.3.1. Set-Summaries with False Negative Probability
  • 27.4. Library API Overview
    • 27.4.1. Set-summary Create
    • 27.4.2. Set-summary Element Insertion
    • 27.4.3. Set-summary Element Lookup
    • 27.4.4. Set-summary Element Delete
  • 27.5. References
• 28. LPM Library
  • 28.1. LPM API Overview
  • 28.2. Implementation Details
    • 28.2.1. Addition
    • 28.2.2. Deletion
    • 28.2.3. Lookup
    • 28.2.4. Limitations in the Number of Rules
    • 28.2.5. Use Case: IPv4 Forwarding
    • 28.2.6. References
• 29. LPM6 Library
  • 29.1. LPM6 API Overview
    • 29.1.1. Implementation Details
    • 29.1.2. Addition
    • 29.1.3. Lookup
    • 29.1.4. Limitations in the Number of Rules
  • 29.2. Use Case: IPv6 Forwarding
• 30. Flow Classification Library
  • 30.1. Overview
    • 30.1.1. Classifier creation
    • 30.1.2. Adding a table to the Classifier
    • 30.1.3. Flow Parsing
    • 30.1.4. Adding Flow Rules
    • 30.1.5. Deleting Flow Rules
    • 30.1.6. Packet Matching
• 31. Packet Distributor Library
  • 31.1. Distributor Core Operation
  • 31.2. Worker Operation
• 32. Reorder Library
  • 32.1. Operation
  • 32.2. Implementation Details
  • 32.3. Use Case: Packet Distributor
• 33. IP Fragmentation and Reassembly Library
  • 33.1. Packet fragmentation
  • 33.2. Packet reassembly
    • 33.2.1. IP Fragment Table
    • 33.2.2. Packet Reassembly
    • 33.2.3. Debug logging and Statistics Collection
• 34. Generic Receive Offload Library
  • 34.1. Overview
  • 34.2. Two Sets of API
    • 34.2.1. Lightweight Mode API
    • 34.2.2. Heavyweight Mode API
  • 34.3. Reassembly Algorithm
    • 34.3.1. Challenges
    • 34.3.2. Key-based Reassembly Algorithm
  • 34.4. TCP/IPv4 GRO
  • 34.5. VxLAN GRO
  • 34.6. GRO Library Limitations
• 35. Generic Segmentation Offload Library
  • 35.1. Overview
  • 35.2. Limitations
  • 35.3. Packet Segmentation
    • 35.3.1. GSO Output Segment Format
  • 35.4. Supported GSO Packet Types
    • 35.4.1. TCP/IPv4 GSO
    • 35.4.2. UDP/IPv4 GSO
    • 35.4.3. VXLAN IPv4 GSO
    • 35.4.4. GRE TCP/IPv4 GSO
  • 35.5. How to Segment a Packet
• 36. The librte_pdump Library
  • 36.1. Operation
  • 36.2. Implementation Details
  • 36.3. Use Case: Packet Capturing
• 37. Multi-process Support
  • 37.1. Memory Sharing
  • 37.2. Deployment Models
    • 37.2.1. Symmetric/Peer Processes
    • 37.2.2. Asymmetric/Non-Peer Processes
    • 37.2.3. Running Multiple Independent DPDK Applications
    • 37.2.4. Running Multiple Independent Groups of DPDK Applications
  • 37.3. Multi-process Limitations
  • 37.4. Communication between multiple processes
    • 37.4.1. Registering for incoming messages
    • 37.4.2. Sending messages
    • 37.4.3. Sending requests
    • 37.4.4. Receiving and responding to messages
    • 37.4.5. Misc considerations
• 38. Kernel NIC Interface
  • 38.1. The DPDK KNI Kernel Module
    • 38.1.1. Loopback Mode
    • 38.1.2. Kernel Thread Mode
    • 38.1.3. Default Carrier State
  • 38.2. KNI Creation and Deletion
  • 38.3. DPDK mbuf Flow
  • 38.4. Use Case: Ingress
  • 38.5. Use Case: Egress
  • 38.6. IOVA = VA: Support
  • 38.7. Ethtool
• 39. Thread Safety of DPDK Functions
  • 39.1. Fast-Path APIs
  • 39.2. Performance Insensitive API
  • 39.3. Library Initialization
  • 39.4. Interrupt Thread
• 40. Event Device Library
  • 40.1. Event struct
    • 40.1.1. Event Metadata
    • 40.1.2. Event Payload
    • 40.1.3. Event Vector
    • 40.1.4. Queues
    • 40.1.5. Ports
  • 40.2. API Walk-through
    • 40.2.1. Init and Config
    • 40.2.2. Setting up Queues
    • 40.2.3. Setting up Ports
    • 40.2.4. Linking Queues and Ports
    • 40.2.5. Starting the EventDev
    • 40.2.6. Ingress of New Events
    • 40.2.7. Forwarding of Events
    • 40.2.8. Egress of Events
  • 40.3. Summary
• 41. Event Ethernet Rx Adapter Library
  • 41.1. API Walk-through
    • 41.1.1. Creating an Adapter Instance
    • 41.1.2. Adding Rx Queues to the Adapter Instance
    • 41.1.3. Querying Adapter Capabilities
    • 41.1.4. Configuring the Service Function
    • 41.1.5. Starting the Adapter Instance
    • 41.1.6. Getting Adapter Statistics
    • 41.1.7. Interrupt Based Rx Queues
    • 41.1.8. Rx Callback for SW Rx Adapter
    • 41.1.9. Rx event vectorization
    • 41.1.10. Rx event vectorization for SW Rx adapter
• 42. Event Ethernet Tx Adapter Library
  • 42.1. API Walk-through
    • 42.1.1. Creating an Adapter Instance
    • 42.1.2. Adding Tx Queues to the Adapter Instance
    • 42.1.3. Querying Adapter Capabilities
    • 42.1.4. Linking a Queue to the Adapter’s Event Port
    • 42.1.5. Configuring the Service Function
    • 42.1.6. Starting the Adapter Instance
    • 42.1.7. Enqueuing Packets to the Adapter
    • 42.1.8. Getting Adapter Statistics
    • 42.1.9. Tx event vectorization
• 43. Event Timer Adapter Library
  • 43.1. Event Timer struct
    • 43.1.1. Timer Expiry Event
    • 43.1.2. Timeout Ticks
    • 43.1.3. State
    • 43.1.4. User Metadata
  • 43.2. API Overview
    • 43.2.1. Create and Configure an Adapter Instance
    • 43.2.2. Retrieve Event Timer Adapter Contextual Information
    • 43.2.3. Configuring the Service Component
    • 43.2.4. Starting the Adapter Instance
    • 43.2.5. Arming Event Timers
    • 43.2.6. Canceling Event Timers
  • 43.3. Processing Timer Expiry Events
  • 43.4. Summary
• 44. Event Crypto Adapter Library
  • 44.1. Adapter Mode
    • 44.1.1. RTE_EVENT_CRYPTO_ADAPTER_OP_NEW mode
    • 44.1.2. RTE_EVENT_CRYPTO_ADAPTER_OP_FORWARD mode
  • 44.2. API Overview
    • 44.2.1. Create an adapter instance
    • 44.2.2. Querying adapter capabilities
    • 44.2.3. Adding queue pair to the adapter instance
    • 44.2.4. Configure the service function
    • 44.2.5. Set event request/response information
    • 44.2.6. Start the adapter instance
    • 44.2.7. Get adapter statistics
• 45. Quality of Service (QoS) Framework
  • 45.1. Packet Pipeline with QoS Support
  • 45.2. Hierarchical Scheduler
    • 45.2.1. Overview
    • 45.2.2. Scheduling Hierarchy
    • 45.2.3. Application Programming Interface (API)
    • 45.2.4. Implementation
    • 45.2.5. Worst Case Scenarios for Performance
  • 45.3. Dropper
    • 45.3.1. Configuration
    • 45.3.2. Enqueue Operation
    • 45.3.3. Queue Empty Operation
    • 45.3.4. Source Files Location
    • 45.3.5. Integration with the DPDK QoS Scheduler
    • 45.3.6. Integration with the DPDK QoS Scheduler Sample Application
    • 45.3.7. Application Programming Interface (API)
  • 45.4. Traffic Metering
    • 45.4.1. Functional Overview
    • 45.4.2. Implementation Overview
• 46. Power Management
  • 46.1. CPU Frequency Scaling
  • 46.2. Core-load Throttling through C-States
  • 46.3. Per-core Turbo Boost
  • 46.4. Use of Power Library in a Hyper-Threaded Environment
  • 46.5. API Overview of the Power Library
  • 46.6. User Cases
  • 46.7. Empty Poll API
    • 46.7.1. Abstract
    • 46.7.2. Proposed Solution
    • 46.7.3. API Overview for Empty Poll Power Management
  • 46.8. User Cases
  • 46.9. Ethernet PMD Power Management API
    • 46.9.1. Abstract
    • 46.9.2. API Overview for Ethernet PMD Power Management
  • 46.10. References
• 47. Packet Classification and Access Control
  • 47.1. Overview
    • 47.1.1. Rule definition
    • 47.1.2. RT memory size limit
    • 47.1.3. Classification methods
  • 47.2. Application Programming Interface (API) Usage
    • 47.2.1. Classify with Multiple Categories
• 48. Packet Framework
  • 48.1. Design Objectives
  • 48.2. Overview
  • 48.3. Port Library Design
    • 48.3.1. Port Types
    • 48.3.2. Port Interface
  • 48.4. Table Library Design
    • 48.4.1. Table Types
    • 48.4.2. Table Interface
    • 48.4.3. Hash Table Design
  • 48.5. Pipeline Library Design
    • 48.5.1. Connectivity of Ports and Tables
    • 48.5.2. Port Actions
    • 48.5.3. Table Actions
  • 48.6. Multicore Scaling
    • 48.6.1. Shared Data Structures
  • 48.7. Interfacing with Accelerators
  • 48.8. The Software Switch (SWX) Pipeline
• 49. Vhost Library
  • 49.1. Vhost API Overview
  • 49.2. Vhost-user Implementations
  • 49.3. Guest memory requirement
  • 49.4. Vhost supported vSwitch reference
  • 49.5. Vhost data path acceleration (vDPA)
• 50. Metrics Library
  • 50.1. Initializing the library
  • 50.2. Registering metrics
  • 50.3. Updating metric values
  • 50.4. Querying metrics
  • 50.5. Deinitialising the library
  • 50.6. Bit-rate statistics library
    • 50.6.1. Initialization
    • 50.6.2. Controlling the sampling rate
  • 50.7. Latency statistics library
    • 50.7.1. Initialization
    • 50.7.2. Triggering statistic updates
    • 50.7.3. Library shutdown
    • 50.7.4. Timestamp and latency calculation
• 51. Telemetry Library
  • 51.1. Creating Callback Functions
    • 51.1.1. Function Type
    • 51.1.2. Formatting Data
  • 51.2. Registering Commands
  • 51.3. Using Commands
• 52. Berkeley Packet Filter Library
  • 52.1. Packet data load instructions
  • 52.2. Not currently supported eBPF features
• 53. IPsec Packet Processing Library
  • 53.1. SA level API
    • 53.1.1. RTE_SECURITY_ACTION_TYPE_NONE
    • 53.1.2. RTE_SECURITY_ACTION_TYPE_CPU_CRYPTO
    • 53.1.3. RTE_SECURITY_ACTION_TYPE_INLINE_CRYPTO
    • 53.1.4. RTE_SECURITY_ACTION_TYPE_INLINE_PROTOCOL
    • 53.1.5. RTE_SECURITY_ACTION_TYPE_LOOKASIDE_PROTOCOL
  • 53.2. SA database API
    • 53.2.1. Create/destroy
    • 53.2.2. Add/delete rules
    • 53.2.3. Lookup
  • 53.3. Supported features
  • 53.4. Limitations
• 54. Graph Library and Inbuilt Nodes
  • 54.1. Features
  • 54.2. Advantages of Graph architecture
  • 54.3. Performance tuning parameters
  • 54.4. Programming model
    • 54.4.1. Anatomy of Node:
    • 54.4.2. Node creation and registration
    • 54.4.3. Link the Nodes to create the graph topology
    • 54.4.4. Create the graph object
    • 54.4.5. Multicore graph processing
    • 54.4.6. In fast path
    • 54.4.7. Context update when graph walk in action
    • 54.4.8. Get the node statistics using graph cluster
    • 54.4.9. Node writing guidelines
    • 54.4.10. Static nodes
    • 54.4.11. Intermediate nodes
  • 54.5. Graph object memory layout
  • 54.6. Inbuilt Nodes
    • 54.6.1. ethdev_rx
    • 54.6.2. ethdev_tx
    • 54.6.3. pkt_drop
    • 54.6.4. ip4_lookup
    • 54.6.5. ip4_rewrite
    • 54.6.6. null
• 55. Source Organization
  • 55.1. Libraries
  • 55.2. Drivers
  • 55.3. Applications
• 56. Installing DPDK Using the meson build system
  • 56.1. Summary
  • 56.2. Getting the Tools
  • 56.3. Configuring the Build
  • 56.4. Performing the Build
  • 56.5. Installing the Compiled Files
  • 56.6. Cross Compiling DPDK
  • 56.7. Using the DPDK within an Application
• 57. Running DPDK Unit Tests with Meson
  • 57.1. Grouping of test cases
  • 57.2. Dealing with skipped test cases
• 58. Building Your Own Application
  • 58.1. Compiling a Sample Application in the Development Kit Directory
  • 58.2. Build Your Own Application Outside the Development Kit
  • 58.3. Customizing Makefiles
    • 58.3.1. Application Makefile
• 59. Performance Optimization Guidelines
  • 59.1. Introduction
• 60. Writing Efficient Code
  • 60.1. Memory
    • 60.1.1. Memory Copy: Do not Use libc in the Data Plane
    • 60.1.2. Memory Allocation
    • 60.1.3. Concurrent Access to the Same Memory Area
    • 60.1.4. NUMA
    • 60.1.5. Distribution Across Memory Channels
    • 60.1.6. Locking memory pages
  • 60.2. Communication Between lcores
  • 60.3. PMD Driver
    • 60.3.1. Lower Packet Latency
  • 60.4. Locks and Atomic Operations
    • 60.4.1. Locks
    • 60.4.2. Atomic Operations: Use C11 Atomic Builtins
  • 60.5. Coding Considerations
    • 60.5.1. Inline Functions
    • 60.5.2. Branch Prediction
  • 60.6. Setting the Target CPU Type
• 61. Link Time Optimization
• 62. Profile Your Application
  • 62.1. Profiling on x86
    • 62.1.1. Profiling with VTune
  • 62.2. Profiling on ARM64
    • 62.2.1. Using Linux perf
    • 62.2.2. Low-resolution generic counter
    • 62.2.3. High-resolution cycle counter
• 63. Glossary