ethdev: support PF index in representor

[dpdk.git] / doc / guides / prog_guide / graph_lib.rst

diff --git a/doc/guides/prog_guide/graph_lib.rst b/doc/guides/prog_guide/graph_lib.rst
index 669d77c..fcff9c4 100644 (file)
--- a/doc/guides/prog_guide/graph_lib.rst
+++ b/doc/guides/prog_guide/graph_lib.rst
@@ -45,13 +45,11 @@ Performance tuning parameters
 -----------------------------
 
 - Test with various burst size values (256, 128, 64, 32) using
 -----------------------------
 
 - Test with various burst size values (256, 128, 64, 32) using

-  CONFIG_RTE_GRAPH_BURST_SIZE config option.
+  RTE_GRAPH_BURST_SIZE config option.

   The testing shows, on x86 and arm64 servers, The sweet spot is 256 burst
   size. While on arm64 embedded SoCs, it is either 64 or 128.
   The testing shows, on x86 and arm64 servers, The sweet spot is 256 burst
   size. While on arm64 embedded SoCs, it is either 64 or 128.

-- Disable node statistics (using ``CONFIG_RTE_LIBRTE_GRAPH_STATS`` config option)
+- Disable node statistics (using ``RTE_LIBRTE_GRAPH_STATS`` config option)

   if not needed.
   if not needed.

-- Use arm64 optimized memory copy for arm64 architecture by
-  selecting ``CONFIG_RTE_ARCH_ARM64_MEMCPY``.

 
 Programming model
 -----------------
 
 Programming model
 -----------------


@@ -63,7 +61,7 @@ Anatomy of Node:
 
 .. figure:: img/anatomy_of_a_node.*
 
 
 .. figure:: img/anatomy_of_a_node.*
 

-The :numref:`figure_anatomy_of_a_node` diagram depicts the anatomy of a node.
+   Anatomy of a node

 
 The node is the basic building block of the graph framework.
 
 
 The node is the basic building block of the graph framework.
 


@@ -140,8 +138,7 @@ Link the Nodes to create the graph topology
 
 .. figure:: img/link_the_nodes.*
 
 
 .. figure:: img/link_the_nodes.*
 

-The :numref:`figure_link_the_nodes` diagram shows a graph topology after
-linking the N nodes.
+   Topology after linking the nodes

 
 Once nodes are available to the program, Application or node public API
 functions can links them together to create a complex packet processing graph.
 
 Once nodes are available to the program, Application or node public API
 functions can links them together to create a complex packet processing graph.


@@ -324,8 +321,9 @@ Graph object memory layout
 
 .. figure:: img/graph_mem_layout.*
 
 
 .. figure:: img/graph_mem_layout.*
 

-The :numref:`figure_graph_mem_layout` diagram shows ``rte_graph`` object memory
-layout. Understanding the memory layout helps to debug the graph library and
+   Memory layout
+
+Understanding the memory layout helps to debug the graph library and

 improve the performance if needed.
 
 Graph object consists of a header, circular buffer to store the pending
 improve the performance if needed.
 
 Graph object consists of a header, circular buffer to store the pending


@@ -394,4 +392,3 @@ null
 ~~~~
 This node ignores the set of objects passed to it and reports that all are
 processed.
 ~~~~
 This node ignores the set of objects passed to it and reports that all are
 processed.

-