Programmer’s Guide

Figures

Fig. 2.1 Core Components Architecture

Fig. 3.1 EAL Initialization in a Linux Application Environment

Fig. 3.2 Example of a malloc heap and malloc elements within the malloc library

Fig. 5.1 Ring Structure

Fig. 5.2 Enqueue first step

Fig. 5.3 Enqueue second step

Fig. 5.4 Enqueue last step

Fig. 5.5 Dequeue last step

Fig. 5.6 Dequeue second step

Fig. 5.7 Dequeue last step

Fig. 5.8 Multiple producer enqueue first step

Fig. 5.9 Multiple producer enqueue second step

Fig. 5.10 Multiple producer enqueue third step

Fig. 5.11 Multiple producer enqueue fourth step

Fig. 5.12 Multiple producer enqueue last step

Fig. 5.13 Modulo 32-bit indexes - Example 1

Fig. 5.14 Modulo 32-bit indexes - Example 2

Fig. 6.1 Two Channels and Quad-ranked DIMM Example

Fig. 6.2 Three Channels and Two Dual-ranked DIMM Example

Fig. 6.3 A mempool in Memory with its Associated Ring

Fig. 7.1 An mbuf with One Segment

Fig. 7.2 An mbuf with Three Segments

Fig. 25.1 Memory Sharing in the DPDK Multi-process Sample Application

Fig. 26.2 Components of a DPDK KNI Application

Fig. 26.3 Packet Flow via mbufs in the DPDK KNI

Fig. 29.1 Complex Packet Processing Pipeline with QoS Support

Fig. 29.2 Hierarchical Scheduler Block Internal Diagram

Fig. 29.3 Scheduling Hierarchy per Port

Fig. 29.4 Internal Data Structures per Port

Fig. 29.5 Prefetch Pipeline for the Hierarchical Scheduler Enqueue Operation

Fig. 29.6 Pipe Prefetch State Machine for the Hierarchical Scheduler Dequeue Operation

Fig. 29.7 High-level Block Diagram of the DPDK Dropper

Fig. 29.8 Flow Through the Dropper

Fig. 29.9 Example Data Flow Through Dropper

Fig. 29.10 Packet Drop Probability for a Given RED Configuration

Fig. 29.11 Initial Drop Probability (pb), Actual Drop probability (pa) Computed Using a Factor 1 (Blue Curve) and a Factor 2 (Red Curve)

Fig. 32.1 Example of Packet Processing Pipeline where Input Ports 0 and 1 are Connected with Output Ports 0, 1 and 2 through Tables 0 and 1

Fig. 32.2 Sequence of Steps for Hash Table Operations in a Packet Processing Context

Fig. 32.3 Data Structures for Configurable Key Size Hash Tables

Fig. 32.4 Bucket Search Pipeline for Key Lookup Operation (Configurable Key Size Hash Tables)

Fig. 32.5 Data Structures for 8-byte Key Hash Tables

Fig. 32.6 Data Structures for 16-byte Key Hash Tables

Fig. 32.7 Bucket Search Pipeline for Key Lookup Operation (Single Key Size Hash Tables)

Fig. 15.4 Load Balancing Using Front End Node

Fig. 15.5 Consistent Hashing

Fig. 15.6 Table Based Flow Distribution

Fig. 15.7 Searching for Perfect Hash Function

Fig. 15.8 Divide and Conquer for Millions of Keys

Fig. 15.9 EFD as a Flow-Level Load Balancer

Fig. 15.10 Group Assignment

Fig. 15.11 Perfect Hash Search - Assigned Keys & Target Value

Fig. 15.12 Perfect Hash Search - Satisfy Target Values

Fig. 15.13 Finding Hash Index for Conflict Free lookup_table

Fig. 15.14 EFD Lookup Operation

Fig. 16.1 Example Usages of Membership Library

Fig. 16.2 Bloom Filter False Positive Probability

Fig. 16.3 Detecting Routing Loops Using BF

Fig. 16.4 Vector Bloom Filter (vBF) Overview

Fig. 16.5 vBF for Flow Scheduling to Worker Thread

Fig. 16.6 Using HTSS for Attack Signature Matching

Fig. 16.7 Using HTSS with False Negatives for Wild Card Classification

Tables

Table 29.1 Packet Processing Pipeline Implementing QoS

Table 29.2 Infrastructure Blocks Used by the Packet Processing Pipeline

Table 29.3 Port Scheduling Hierarchy

Table 29.4 Scheduler Internal Data Structures per Port

Table 29.5 Ethernet Frame Overhead Fields

Table 29.6 Token Bucket Generic Operations

Table 29.7 Token Bucket Generic Parameters

Table 29.8 Token Bucket Persistent Data Structure

Table 29.9 Token Bucket Operations

Table 29.10 Subport/Pipe Traffic Class Upper Limit Enforcement Persistent Data Structure

Table 29.11 Subport/Pipe Traffic Class Upper Limit Enforcement Operations

Table 29.12 Weighted Round Robin (WRR)

Table 29.13 Subport Traffic Class Oversubscription

Table 29.14 Watermark Propagation from Subport Level to Member Pipes at the Beginning of Each Traffic Class Upper Limit Enforcement Period

Table 29.15 Watermark Calculation

Table 29.16 RED Configuration Parameters

Table 29.17 Relative Performance of Alternative Approaches

Table 29.18 RED Configuration Corresponding to RED Configuration File

Table 32.1 Port Types

Table 32.2 20 Port Abstract Interface

Table 32.3 Table Types

Table 32.5 Configuration Parameters Common for All Hash Table Types

Table 32.6 Configuration Parameters Specific to Extendable Bucket Hash Table

Table 32.7 Configuration Parameters Specific to Pre-computed Key Signature Hash Table

Table 32.8 Main Large Data Structures (Arrays) used for Configurable Key Size Hash Tables

Table 32.9 Field Description for Bucket Array Entry (Configurable Key Size Hash Tables)

Table 32.10 Description of the Bucket Search Pipeline Stages (Configurable Key Size Hash Tables)

Table 32.11 Lookup Tables for Match, Match_Many and Match_Pos

Table 32.12 Collapsed Lookup Tables for Match, Match_Many and Match_Pos

Table 32.13 Main Large Data Structures (Arrays) used for 8-byte and 16-byte Key Size Hash Tables

Table 32.14 Field Description for Bucket Array Entry (8-byte and 16-byte Key Hash Tables)

Table 32.15 Description of the Bucket Search Pipeline Stages (8-byte and 16-byte Key Hash Tables)

Table 32.16 Next Hop Actions (Reserved)

Table 32.17 User Action Examples

Table 14.1 Entry distribution measured with an example table with 1024 random entries using jhash algorithm

Table 14.2 Entry distribution measured with an example table with 1 million random entries using jhash algorithm