doc: refactor figure numbers into references

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

diff --git a/doc/guides/prog_guide/malloc_lib.rst b/doc/guides/prog_guide/malloc_lib.rst
index 15489ff..6418fab 100644 (file)
--- a/doc/guides/prog_guide/malloc_lib.rst
+++ b/doc/guides/prog_guide/malloc_lib.rst
@@ -37,14 +37,14 @@ The librte_malloc library provides an API to allocate any-sized memory.
 
 The objective of this library is to provide malloc-like functions to allow allocation from hugepage memory
 and to facilitate application porting.
-The *Intel® DPDK API Reference* manual describes the available functions.
+The *DPDK API Reference* manual describes the available functions.
 
 Typically, these kinds of allocations should not be done in data plane processing
 because they are slower than pool-based allocation and make use of locks within the allocation
 and free paths.
 However, they can be used in configuration code.
 
-Refer to the rte_malloc() function description in the *Intel® DPDK API Reference* manual for more information.
+Refer to the rte_malloc() function description in the *DPDK API Reference* manual for more information.
 
 Cookies
 -------
@@ -117,13 +117,12 @@ The key fields of the heap structure and their function are described below (see
     since these are never touched except when they are to be freed again -
     at which point the pointer to the block is an input to the free() function.
 
-.. _pg_figure_3:
+.. _figure_malloc_heap:
 
-**Figure 3. Example of a malloc heap and malloc elements within the malloc library**
+.. figure:: img/malloc_heap.*
 
-.. image4_png has been renamed
+   Example of a malloc heap and malloc elements within the malloc library
 
-|malloc_heap|
 
 Structure: malloc_elem
 ^^^^^^^^^^^^^^^^^^^^^^
@@ -203,7 +202,7 @@ Once the new memzone has been set up, the scan of the free-list for the heap is
 and on this occasion should find the newly created,
 suitable element as the size of memory reserved in the memzone is set to be
 at least the size of the requested data block plus the alignment -
-subject to a minimum size specified in the Intel DPDK compile-time configuration.
+subject to a minimum size specified in the DPDK compile-time configuration.
 
 When a suitable, free element has been identified, the pointer to be returned to the user is calculated,
 with the space to be provided to the user being at the end of the free block.
@@ -232,5 +231,3 @@ These next and previous elements are then checked to see if they too are free,
 and if so, they are merged with the current elements.
 This means that we can never have two free memory blocks adjacent to one another,
 they are always merged into a single block.
-
-.. |malloc_heap| image:: img/malloc_heap.png