le_doublyLinkedList.h

    1 /**
    2  * @page c_doublyLinkedList Doubly Linked List API
    3  *
    4  * @subpage le_doublyLinkedList.h "API Reference"
    5  *
    6  * <HR>
    7  *
    8  * A doubly linked list is a data structure consisting of a group of nodes linked together linearly.
    9  * Each node consists of data elements with links to the next node and previous nodes.  The main
   10  * advantage of linked lists (over simple arrays) is the nodes can be inserted and removed
   11  * anywhere in the list without reallocating the entire array. Linked list nodes don't
   12  * need to be stored contiguously in memory, but nodes then you can't access by
   13  * index, you have to be access by traversing the list.
   14  *
   15  * @section dls_createList Creating and Initializing Lists
   16  *
   17  * To create and initialize a linked list the user must create a le_dls_List_t typed list and assign
   18  * LE_DLS_LIST_INIT to it.  The assignment of LE_DLS_LIST_INIT can be done either when the list is
   19  * declared or after its declared.  The list <b>must</b> be initialized before it can be
   20  * used.
   21  *
   22  * @code
   23  * // Create and initialized the list in the declaration.
   24  * le_dls_List_t MyList = LE_DLS_LIST_INIT;
   25  * @endcode
   26  *
   27  * Or
   28  *
   29  * @code
   30  * // Create list.
   31  * le_dls_List_t MyList;
   32  *
   33  * // Initialize the list.
   34  * MyList = LE_DLS_LIST_INIT;
   35  * @endcode
   36  *
   37  * <b> Elements of le_dls_List_t MUST NOT be accessed directly by the user. </b>
   38  *
   39  *
   40  * @section dls_createNode Creating and Accessing Nodes
   41  *
   42  * Nodes can contain any data in any format and is defined and created by the user.  The only
   43  * requirement for nodes is that it must contain a @c le_dls_Link_t link member. The link member must
   44  * be initialized by assigning LE_DLS_LINK_INIT to it before it can be used.  Nodes can then be
   45  * added to the list by passing their links to the add functions (le_dls_Stack(), le_dls_Queue(),
   46  * etc.).  For example:
   47  *
   48  * @code
   49  * // The node may be defined like this.
   50  * typedef struct
   51  * {
   52  *      dataType someUserData;
   53  *      ...
   54  *      le_dls_Link_t myLink;
   55  *
   56  * }
   57  * MyNodeClass_t;
   58  *
   59  * // Create and initialize the list.
   60  * le_dls_List_t MyList = LE_DLS_LIST_INIT;
   61  *
   62  * void foo (void)
   63  * {
   64  *     // Create the node.  Get the memory from a memory pool previously created.
   65  *     MyNodeClass_t* myNodePtr = le_mem_ForceAlloc(MyNodePool);
   66  *
   67  *     // Initialize the node's link.
   68  *     myNodePtr->myLink = LE_DLS_LINK_INIT;
   69  *
   70  *     // Add the node to the head of the list by passing in the node's link.
   71  *     le_dls_Stack(&MyList, &(myNodePtr->myLink));
   72  * }
   73  * @endcode
   74  *
   75  * The links in the nodes are actually added to the list and not the nodes themselves. This
   76  * allows a node to be included on multiple lists through links
   77  * added to different lists. It also allows linking different type nodes in a list.
   78  *
   79  * To obtain the node itself, use the @c CONTAINER_OF macro defined in
   80  * le_basics.h.  Here's a code sample using CONTAINER_OF to obtain the node:
   81  *
   82  * @code
   83  * // Assuming mylist has been created and initialized and is not empty.
   84  * le_dls_Link_t* linkPtr = le_dls_Peek(&MyList);
   85  *
   86  * // Now we have the link but still need the node to access user data.
   87  * // We use CONTAINER_OF to get a pointer to the node given the node's link.
   88  * if (linkPtr != NULL)
   89  * {
   90  *     MyNodeClass_t* myNodePtr = CONTAINER_OF(linkPtr, MyNodeClass_t, myLink);
   91  * }
   92  * @endcode
   93  *
   94  * The user is responsible for creating and freeing memory for all nodes; the linked list module
   95  * only manages the links in the nodes.  The node must be removed from all lists before its
   96  * memory can be freed.
   97  *
   98  * <b>The elements of @c le_dls_Link_t MUST NOT be accessed directly by the user.</b>
   99  *
  100  *
  101  * @section dls_add Adding Links to a List
  102  *
  103  * To add nodes to a list, pass the node's link to one of these functions:
  104  *
  105  * - @c le_dls_Stack() - Adds the link to the head of the list.
  106  * - @c le_dls_Queue() - Adds the link to the tail of the list.
  107  * - @c le_dls_AddAfter() - Adds the link to a list after another specified link.
  108  * - @c le_dls_AddBefore() - Adds the link to a list before another specified link.
  109  *
  110  *
  111  * @section dls_remove Removing Links from a List
  112  *
  113  * To remove nodes from a list, use one of these functions:
  114  *
  115  * - @c le_dls_Pop() - Removes and returns the link at the head of the list.
  116  * - @c le_dls_PopTail() - Removes and returns the link at the tail of the list.
  117  * - @c le_dls_Remove() - Remove a specified link from the list.
  118  *
  119  *
  120  * @section dls_peek Accessing Links in a List
  121  *
  122  * To access a link in a list without removing the link, use one of these functions:
  123  *
  124  * - @c le_dls_Peek() - Returns the link at the head of the list without removing it.
  125  * - @c le_dls_PeekTail() - Returns the link at the tail of the list without removing it.
  126  * - @c le_dls_PeekNext() - Returns the link next to a specified link without removing it.
  127  * - @c le_dls_PeekPrev() - Returns the link previous to a specified link without removing it.
  128  *
  129  *
  130  * @section dls_swap Swapping Links
  131  *
  132  * To swap two links, use:
  133  *
  134  * - @c le_dls_Swap() - Swaps the position of two links in a list.
  135  *
  136  * @section dls_sort Sorting Lists
  137  *
  138  * To sort a list use:
  139  *
  140  * @c le_dls_Sort() - Sorts a list
  141  *
  142  * @section dls_query Querying List Status
  143  *
  144  * These functions can be used to query a list's current status:
  145  *
  146  * - @c le_dls_IsEmpty() - Checks if a given list is empty.
  147  * - @c le_dls_IsInList() - Checks if a specified link is in the list.
  148  * - @c le_dls_IsHead() - Checks if a specified link is at the head of the list.
  149  * - @c le_dls_IsTail() - Checks if a specified link is at the tail of the list.
  150  * - @c le_dls_NumLinks() - Checks the number of links currently in the list.
  151  * - @c le_dls_IsListCorrupted() - Checks if the list is corrupted.
  152  *
  153  *
  154  * @section dls_fifo Queues and Stacks
  155  *
  156  * This implementation of linked lists can be used for either queues or stacks.
  157  *
  158  * To use the list as a queue, restrict additions to the list to @c le_dls_Queue() and removals
  159  * from the list to @c le_dls_Pop().
  160  *
  161  * To use the list as a stack,  restrict additions to the list to @c le_dls_Stack() and removals
  162  * from the list to @c le_dls_Pop().
  163  *
  164  *
  165  * @section dls_synch Thread Safety and Re-Entrancy
  166  *
  167  * All linked list function calls are re-entrant and thread safe themselves, but if the nodes and/or
  168  * list object are shared by multiple threads, explicit steps must be taken to maintain mutual
  169  * exclusion of access. If you're accessing the same list from multiple threads, you @e must use a
  170  * @ref c_mutex "mutex" or some other form of thread synchronization to ensure only one thread
  171  * accesses the list at a time.
  172  *
  173  * <HR>
  174  *
  175  * Copyright (C) Sierra Wireless Inc.
  176  */
  177 
  178 
  179 /** @file le_doublyLinkedList.h
  180  *
  181  * Legato @ref c_doublyLinkedList include file.
  182  *
  183  * Copyright (C) Sierra Wireless Inc.
  184  */
  185 
  186 #ifndef LEGATO_DOUBLY_LINKED_LIST_INCLUDE_GUARD
  187 #define LEGATO_DOUBLY_LINKED_LIST_INCLUDE_GUARD
  188 
  189 
  190 //--------------------------------------------------------------------------------------------------
  191 /**
  192  * This link object must be included in each user node.  The node's link object is used to add the
  193  * node to a list.  A node may have multiple link objects which would allow the node to be part of
  194  * multiple lists simultaneously.  This link object must be initialized by assigning
  195  * LE_DLS_LINK_INIT to it.
  196  *
  197  * @warning The structure's content MUST NOT be accessed directly.
  198  */
  199 //--------------------------------------------------------------------------------------------------
  200 typedef struct le_dls_Link
  201 {
  202     struct le_dls_Link* nextPtr;       ///< Next link pointer.
  203     struct le_dls_Link* prevPtr;       ///< Previous link pointer.
  204 }
  205 le_dls_Link_t;
  206 
  207 
  208 //--------------------------------------------------------------------------------------------------
  209 /**
  210  * This is the list object.  User must create this list object and initialize it by assigning
  211  * LE_DLS_LIST_INIT to it.
  212  *
  213  * @warning User MUST NOT access the contents of this structure directly.
  214  */
  215 //--------------------------------------------------------------------------------------------------
  216 typedef struct
  217 {
  218     le_dls_Link_t* headLinkPtr;        ///< Link to list head.
  219 }
  220 le_dls_List_t;
  221 
  222 
  223 //--------------------------------------------------------------------------------------------------
  224 /**
  225  * This is a comparator function for sorting a list.
  226  *
  227  * This must return true if @c a goes before @c b in the list.
  228  */
  229 //--------------------------------------------------------------------------------------------------
  230 typedef bool (*le_dls_LessThanFunc_t)(le_dls_Link_t* a, le_dls_Link_t* b);
  231 
  232 
  233 //--------------------------------------------------------------------------------------------------
  234 /**
  235  * When a list is created it must be initialized by assigning this macro to the list before the list
  236  * can be used.
  237  */
  238 //--------------------------------------------------------------------------------------------------
  239 #define LE_DLS_LIST_INIT (le_dls_List_t){NULL}
  240 
  241 
  242 //--------------------------------------------------------------------------------------------------
  243 /**
  244  * When a link is created it must be initialized by assigning this macro to the link before it can
  245  * be used.
  246  */
  247 //--------------------------------------------------------------------------------------------------
  248 #define LE_DLS_LINK_INIT (le_dls_Link_t){NULL, NULL}
  249 
  250 
  251 //--------------------------------------------------------------------------------------------------
  252 /**
  253  * Adds a link at the head of the list.
  254  */
  255 //--------------------------------------------------------------------------------------------------
  256 void le_dls_Stack
  257 (
  258     le_dls_List_t* listPtr,            ///< [IN] List to add to.
  259     le_dls_Link_t* newLinkPtr          ///< [IN] New link to add.
  260 );
  261 
  262 
  263 //--------------------------------------------------------------------------------------------------
  264 /**
  265  * Adds a link to the tail of the list.
  266  */
  267 //--------------------------------------------------------------------------------------------------
  268 void le_dls_Queue
  269 (
  270     le_dls_List_t* listPtr,            ///< [IN] List to add to.
  271     le_dls_Link_t* newLinkPtr          ///< [IN] New link to add.
  272 );
  273 
  274 
  275 //--------------------------------------------------------------------------------------------------
  276 /**
  277  * Adds a link after currentLinkPtr.  User must ensure that currentLinkPtr is in the list
  278  * otherwise the behaviour of this function is undefined.
  279  */
  280 //--------------------------------------------------------------------------------------------------
  281 void le_dls_AddAfter
  282 (
  283     le_dls_List_t* listPtr,            ///< [IN] List to add to.
  284     le_dls_Link_t* currentLinkPtr,     ///< [IN] New link will be inserted after this link.
  285     le_dls_Link_t* newLinkPtr          ///< [IN] New link to add.
  286 );
  287 
  288 
  289 //--------------------------------------------------------------------------------------------------
  290 /**
  291  * Adds a link after currentLinkPtr.  User must ensure that currentLinkPtr is in the list
  292  * otherwise the behaviour of this function is undefined.
  293  */
  294 //--------------------------------------------------------------------------------------------------
  295 void le_dls_AddBefore
  296 (
  297     le_dls_List_t* listPtr,            ///< [IN] List to add to.
  298     le_dls_Link_t* currentLinkPtr,     ///< [IN] New link will be inserted before this link.
  299     le_dls_Link_t* newLinkPtr          ///< [IN] New link to add.
  300 );
  301 
  302 
  303 //--------------------------------------------------------------------------------------------------
  304 /**
  305  * Removes and returns the link at the head of the list.
  306  *
  307  * @return
  308  *      Removed link.
  309  *      NULL if the link is not available because the list is empty.
  310  */
  311 //--------------------------------------------------------------------------------------------------
  312 le_dls_Link_t* le_dls_Pop
  313 (
  314     le_dls_List_t* listPtr             ///< [IN] List to remove from.
  315 );
  316 
  317 
  318 //--------------------------------------------------------------------------------------------------
  319 /**
  320  * Removes and returns the link at the tail of the list.
  321  *
  322  * @return
  323  *      The removed link.
  324  *      NULL if the link is not available because the list is empty.
  325  */
  326 //--------------------------------------------------------------------------------------------------
  327 le_dls_Link_t* le_dls_PopTail
  328 (
  329     le_dls_List_t* listPtr             ///< [IN] List to remove from.
  330 );
  331 
  332 
  333 //--------------------------------------------------------------------------------------------------
  334 /**
  335  * Removes the specified link from the list.  Ensure the link is in the list
  336  * otherwise the behaviour of this function is undefined.
  337  */
  338 //--------------------------------------------------------------------------------------------------
  339 void le_dls_Remove
  340 (
  341     le_dls_List_t* listPtr,             ///< [IN] List to remove from.
  342     le_dls_Link_t* linkToRemovePtr      ///< [IN] Link to remove.
  343 );
  344 
  345 
  346 //--------------------------------------------------------------------------------------------------
  347 /**
  348  * Returns the link at the head of the list without removing it from the list.
  349  *
  350  * @return
  351  *      Pointer to the head link if successful.
  352  *      NULL if the list is empty.
  353  */
  354 //--------------------------------------------------------------------------------------------------
  355 le_dls_Link_t* le_dls_Peek
  356 (
  357     const le_dls_List_t* listPtr            ///< [IN] The list.
  358 );
  359 
  360 
  361 //--------------------------------------------------------------------------------------------------
  362 /**
  363  * Returns the link at the tail of the list without removing it from the list.
  364  *
  365  * @return
  366  *      A pointer to the tail link if successful.
  367  *      NULL if the list is empty.
  368  */
  369 //--------------------------------------------------------------------------------------------------
  370 le_dls_Link_t* le_dls_PeekTail
  371 (
  372     const le_dls_List_t* listPtr            ///< [IN] The list.
  373 );
  374 
  375 
  376 //--------------------------------------------------------------------------------------------------
  377 /**
  378  * Checks if a list is empty.
  379  *
  380  * @return
  381  *      true if empty, false if not empty.
  382  */
  383 //--------------------------------------------------------------------------------------------------
  384 LE_DECLARE_INLINE bool le_dls_IsEmpty
  385 (
  386     const le_dls_List_t* listPtr            ///< [IN] The list.
  387 )
  388 //--------------------------------------------------------------------------------------------------
  389 {
  390     return (le_dls_Peek(listPtr) == NULL);
  391 }
  392 
  393 
  394 //--------------------------------------------------------------------------------------------------
  395 /**
  396  * Returns the link next to currentLinkPtr (i.e., the link beside currentLinkPtr that is closer to the
  397  * tail) without removing it from the list.  User must ensure that currentLinkPtr is in the list
  398  * otherwise the behaviour of this function is undefined.
  399  *
  400  * @return
  401  *      Pointer to the next link if successful.
  402  *      NULL if there is no link next to the currentLinkPtr (currentLinkPtr is at the tail of the
  403  *      list).
  404  */
  405 //--------------------------------------------------------------------------------------------------
  406 le_dls_Link_t* le_dls_PeekNext
  407 (
  408     const le_dls_List_t* listPtr,           ///< [IN] List containing currentLinkPtr.
  409     const le_dls_Link_t* currentLinkPtr     ///< [IN] Get the link that is relative to this link.
  410 );
  411 
  412 
  413 //--------------------------------------------------------------------------------------------------
  414 /**
  415  * Returns the link previous to currentLinkPtr without removing it from the list.  User must
  416  * ensure that currentLinkPtr is in the list otherwise the behaviour of this function is undefined.
  417  *
  418  * @return
  419  *      Pointer to the previous link if successful.
  420  *      NULL if there is no link previous to the currentLinkPtr (currentLinkPtr is at the head of
  421  *      the list).
  422  */
  423 //--------------------------------------------------------------------------------------------------
  424 le_dls_Link_t* le_dls_PeekPrev
  425 (
  426     const le_dls_List_t* listPtr,          ///< [IN] List containing currentLinkPtr.
  427     const le_dls_Link_t* currentLinkPtr    ///< [IN] Get the link that is relative to this link.
  428 );
  429 
  430 
  431 //--------------------------------------------------------------------------------------------------
  432 /**
  433  * Swaps the position of two links in the list. User must ensure that both links are in the
  434  * list otherwise the behaviour of this function is undefined.
  435  */
  436 //--------------------------------------------------------------------------------------------------
  437 void le_dls_Swap
  438 (
  439     le_dls_List_t* listPtr,         ///< [IN] List containing the links to swap.
  440     le_dls_Link_t* linkPtr,         ///< [IN] One of the two link pointers to swap.
  441     le_dls_Link_t* otherLinkPtr     ///< [IN] Other link pointer to swap.
  442 );
  443 
  444 
  445 //--------------------------------------------------------------------------------------------------
  446 /**
  447  * Sort a list in ascending order.
  448  */
  449 //--------------------------------------------------------------------------------------------------
  450 void le_dls_Sort
  451 (
  452     le_dls_List_t* listPtr,                 ///< [IN] List to sort
  453     le_dls_LessThanFunc_t comparatorPtr     ///< [IN] Comparator function for sorting
  454 );
  455 
  456 
  457 //--------------------------------------------------------------------------------------------------
  458 /**
  459  * Checks if a link is in the list.
  460  *
  461  * @return
  462  *      true if the link is in the list.
  463  *      false if the link is not in the list.
  464  */
  465 //--------------------------------------------------------------------------------------------------
  466 bool le_dls_IsInList
  467 (
  468     const le_dls_List_t* listPtr,    ///< [IN] List to check.
  469     const le_dls_Link_t* linkPtr     ///< [IN] Check if this link is in the list.
  470 );
  471 
  472 
  473 //--------------------------------------------------------------------------------------------------
  474 /**
  475  * Checks if a link is at the head of the list (next to be popped).
  476  *
  477  * @return
  478  *    - true if the link is at the head of the list.
  479  *    - false if not.
  480  */
  481 //--------------------------------------------------------------------------------------------------
  482 LE_DECLARE_INLINE bool le_dls_IsHead
  483 (
  484     const le_dls_List_t* listPtr,    ///< [IN] List to check.
  485     const le_dls_Link_t* linkPtr     ///< [IN] Check if this link is at the head of the list.
  486 )
  487 {
  488     return (le_dls_Peek(listPtr) == linkPtr);
  489 }
  490 
  491 
  492 //--------------------------------------------------------------------------------------------------
  493 /**
  494  * Checks if a link is at the tail of the list (last to be popped).
  495  *
  496  * @return
  497  *    - true if the link is at the tail of the list.
  498  *    - false if not.
  499  */
  500 //--------------------------------------------------------------------------------------------------
  501 LE_DECLARE_INLINE bool le_dls_IsTail
  502 (
  503     const le_dls_List_t* listPtr,    ///< [IN] List to check.
  504     const le_dls_Link_t* linkPtr     ///< [IN] Check if this link is at the tail of the list.
  505 )
  506 {
  507     return (le_dls_PeekTail(listPtr) == linkPtr);
  508 }
  509 
  510 
  511 //--------------------------------------------------------------------------------------------------
  512 /**
  513  * Returns the number of links in a list.
  514  *
  515  * @return
  516  *      Number of links.
  517  */
  518 //--------------------------------------------------------------------------------------------------
  519 size_t le_dls_NumLinks
  520 (
  521     const le_dls_List_t* listPtr       ///< [IN] List to count.
  522 );
  523 
  524 
  525 //--------------------------------------------------------------------------------------------------
  526 /**
  527  * Checks if the list is corrupted.
  528  *
  529  * @return
  530  *      true if the list is corrupted.
  531  *      false if the list is not corrupted.
  532  */
  533 //--------------------------------------------------------------------------------------------------
  534 bool le_dls_IsListCorrupted
  535 (
  536     const le_dls_List_t* listPtr    ///< [IN] List to check.
  537 );
  538 
  539 //--------------------------------------------------------------------------------------------------
  540 /**
  541  * Simple iteration through a doubly linked list
  542  */
  543 //--------------------------------------------------------------------------------------------------
  544 #define LE_DLS_FOREACH(listPtr, iteratorPtr, type, member)              \
  545     for ((iteratorPtr) = CONTAINER_OF(le_dls_Peek(listPtr), type, member); \
  546          &((iteratorPtr)->member);                                      \
  547          (iteratorPtr) = CONTAINER_OF(le_dls_PeekNext((listPtr),&((iteratorPtr)->member)), \
  548                                       type, member))
  549 
  550 
  551 #endif  // LEGATO_DOUBLY_LINKED_LIST_INCLUDE_GUARD
  552 
le_dls_PeekPrev
le_dls_Link_t * le_dls_PeekPrev(const le_dls_List_t *listPtr, const le_dls_Link_t *currentLinkPtr)
le_dls_PeekTail
le_dls_Link_t * le_dls_PeekTail(const le_dls_List_t *listPtr)
le_dls_IsEmpty
LE_DECLARE_INLINE bool le_dls_IsEmpty(const le_dls_List_t *listPtr)
Definition: le_doublyLinkedList.h:385
le_dls_AddBefore
void le_dls_AddBefore(le_dls_List_t *listPtr, le_dls_Link_t *currentLinkPtr, le_dls_Link_t *newLinkPtr)
le_dls_Queue
void le_dls_Queue(le_dls_List_t *listPtr, le_dls_Link_t *newLinkPtr)
le_dls_LessThanFunc_t
bool(* le_dls_LessThanFunc_t)(le_dls_Link_t *a, le_dls_Link_t *b)
Definition: le_doublyLinkedList.h:230
le_dls_IsListCorrupted
bool le_dls_IsListCorrupted(const le_dls_List_t *listPtr)
le_dls_List_t::headLinkPtr
le_dls_Link_t * headLinkPtr
Link to list head. 
Definition: le_doublyLinkedList.h:218
le_dls_AddAfter
void le_dls_AddAfter(le_dls_List_t *listPtr, le_dls_Link_t *currentLinkPtr, le_dls_Link_t *newLinkPtr)
le_dls_Remove
void le_dls_Remove(le_dls_List_t *listPtr, le_dls_Link_t *linkToRemovePtr)
le_dls_PeekNext
le_dls_Link_t * le_dls_PeekNext(const le_dls_List_t *listPtr, const le_dls_Link_t *currentLinkPtr)
le_dls_Pop
le_dls_Link_t * le_dls_Pop(le_dls_List_t *listPtr)
le_dls_Stack
void le_dls_Stack(le_dls_List_t *listPtr, le_dls_Link_t *newLinkPtr)
le_dls_NumLinks
size_t le_dls_NumLinks(const le_dls_List_t *listPtr)
le_dls_Link_t::nextPtr
struct le_dls_Link * nextPtr
Next link pointer. 
Definition: le_doublyLinkedList.h:202
le_dls_Swap
void le_dls_Swap(le_dls_List_t *listPtr, le_dls_Link_t *linkPtr, le_dls_Link_t *otherLinkPtr)
le_dls_PopTail
le_dls_Link_t * le_dls_PopTail(le_dls_List_t *listPtr)
le_dls_Link_t
Definition: le_doublyLinkedList.h:200
le_dls_IsHead
LE_DECLARE_INLINE bool le_dls_IsHead(const le_dls_List_t *listPtr, const le_dls_Link_t *linkPtr)
Definition: le_doublyLinkedList.h:483
le_dls_List_t
Definition: le_doublyLinkedList.h:216
le_dls_Link_t::prevPtr
struct le_dls_Link * prevPtr
Previous link pointer. 
Definition: le_doublyLinkedList.h:203
le_dls_Sort
void le_dls_Sort(le_dls_List_t *listPtr, le_dls_LessThanFunc_t comparatorPtr)
LE_DECLARE_INLINE
#define LE_DECLARE_INLINE
Definition: le_basics.h:274
le_dls_Peek
le_dls_Link_t * le_dls_Peek(const le_dls_List_t *listPtr)
le_dls_IsInList
bool le_dls_IsInList(const le_dls_List_t *listPtr, const le_dls_Link_t *linkPtr)
le_dls_IsTail
LE_DECLARE_INLINE bool le_dls_IsTail(const le_dls_List_t *listPtr, const le_dls_Link_t *linkPtr)
Definition: le_doublyLinkedList.h:502