#include <stdio.h>#include <stdlib.h>Go to the source code of this file.
| Data Structures | |
| struct | listNode_s | 
| struct | list_s | 
| Defines | |
| #define | DATA void* | 
| #define | QUEUE_TEMPLATE(name, node_type, search_type, search_var_name) | 
| Typedefs | |
| typedef struct listNode_s | listNode_t | 
| typedef listNode_t * | listNode_p | 
| typedef struct list_s | list_t | 
| typedef list_t * | list_p | 
| Functions | |
| list_p | ListInitialize (void) | 
| void | ListTerminate (list_p list) | 
| int | ListGetSize (list_p list) | 
| int | ListAdd (list_p list, DATA data) | 
| int | ListInsert (list_p list, DATA data, const int index) | 
| DATA | ListGetHead (list_p list) | 
| DATA | ListPop (list_p list) | 
| DATA | ListSearch (list_p list, const int index) | 
| DATA | ListDelete (list_p list, const int index) | 
| #define DATA void* | 
Definition at line 30 of file list.h.
Referenced by barrier_queue_Add(), ListDelete(), ListPop(), and syncListAddNode().
| #define QUEUE_TEMPLATE | ( | name, | |||
| node_type, | |||||
| search_type, | |||||
| search_var_name | ) | 
| typedef listNode_t* listNode_p | 
| typedef struct listNode_s listNode_t | 
Definition at line 161 of file list.c.
References list_s::listhead, listNode_s::next, listNode_s::node_data, and list_s::size.
Referenced by barrier_queue_Add(), df_Add(), df_AddRequest(), and syncListAddNode().
Definition at line 216 of file list.c.
References DATA, list_s::listhead, listNode_s::next, listNode_s::node_data, and list_s::size.
Referenced by barrier_queue_Delete(), syncListDelete(), and syncListRemove().
| DATA ListGetHead | ( | list_p | list | ) | 
| list_p ListInitialize | ( | void | ) | 
Definition at line 33 of file list.c.
References list_s::listhead, and list_s::size.
Referenced by barrier_queue_New(), df_Initialize(), df_request_list_New(), and syncListInit().
| DATA ListPop | ( | list_p | list | ) | 
Definition at line 89 of file list.c.
References DATA, list_s::listhead, listNode_s::next, listNode_s::node_data, and list_s::size.
Referenced by barrier_queue_Pop(), df_Destroy(), df_request_list_Destroy(), and df_request_list_Pop().
Definition at line 124 of file list.c.
References list_s::listhead, listNode_s::next, listNode_s::node_data, and list_s::size.
Referenced by ams_ManageAgentList(), ams_Print(), AP_QUEUE_SEARCH_TEMPLATE(), AP_QUEUE_STD_DEFN_TEMPLATE(), barrier_queue_Delete(), MC_RetrieveAgent(), MC_WaitRetrieveAgent(), message_queue_SendOutgoing(), syncListDelete(), and syncListRemove().
| void ListTerminate | ( | list_p | list | ) | 
Definition at line 49 of file list.c.
References list_s::listhead, and list_s::size.
Referenced by barrier_queue_Destroy(), df_Destroy(), and df_request_list_Destroy().
 1.5.5
 1.5.5