|
WS63 SDK 文档 7021f4f@fbb_ws63
ws63 和 ws63e 解决方案的 SDK 文档
|

结构体 | |
| struct | LOS_DL_LIST |
宏定义 | |
| #define | LOS_DL_LIST_FIRST(object) ((object)->pstNext) |
| Point to the next node of the current node. | |
| #define | LOS_DL_LIST_LAST(object) ((object)->pstPrev) |
| Point to the previous node of the current node. | |
| #define | LOS_OFF_SET_OF(type, member) ((UINTPTR)&((type *)0)->member) |
| Obtain the offset of a structure member relative to the structure start address. | |
| #define | LOS_DL_LIST_ENTRY(item, type, member) ((type *)(VOID *)((CHAR *)(item) - LOS_OFF_SET_OF(type, member))) |
| Obtain the pointer to a structure that contains a doubly linked list. | |
| #define | LOS_DL_LIST_FOR_EACH_ENTRY(item, list, type, member) |
| Traverse a doubly linked list which is included in a given type structure. | |
| #define | LOS_DL_LIST_FOR_EACH_ENTRY_SAFE(item, next, list, type, member) |
| Traverse a doubly linked list which is included in a given type structure. And it is safe against removal of list entry. | |
| #define | LOS_DL_LIST_FOR_EACH_ENTRY_HOOK(item, list, type, member, hook) |
| Iterate over a doubly linked list of given type, and call hook for any extra procedures every time. | |
| #define | LOS_DL_LIST_FOR_EACH(item, list) |
| Traverse a doubly linked list. | |
| #define | LOS_DL_LIST_FOR_EACH_SAFE(item, next, list) |
| Traverse a doubly linked list safe against removal of list entry. | |
| #define | LOS_DL_LIST_HEAD(list) LOS_DL_LIST list = { &(list), &(list) } |
| Initialize a double linked list. | |
类型定义 | |
| typedef struct LOS_DL_LIST | LOS_DL_LIST |
| #define LOS_DL_LIST_ENTRY | ( | item, | |
| type, | |||
| member | |||
| ) | ((type *)(VOID *)((CHAR *)(item) - LOS_OFF_SET_OF(type, member))) |
Obtain the pointer to a structure that contains a doubly linked list.
| item | [IN] Type LOS_DL_LIST * The node of the doubly linked list. |
| type | [IN] Structure name. |
| member | [IN] The doubly linked list name in the structure. |
| The | pointer to the structure that contains the doubly linked list. And the doubly linked list has the node of the first parameter item. |
| #define LOS_DL_LIST_FIRST | ( | object | ) | ((object)->pstNext) |
Point to the next node of the current node.
| object | [IN] Type LOS_DL_LIST * The node in the doubly linked list. |
| None. |
| #define LOS_DL_LIST_FOR_EACH | ( | item, | |
| list | |||
| ) |
Traverse a doubly linked list.
| item | [IN/OUT] Type LOS_DL_LIST * The pointer to the next node in the doubly linked list. |
| list | [IN] Type LOS_DL_LIST * The pointer to the node of the doubly linked list to be traversed. |
| None. |
| #define LOS_DL_LIST_FOR_EACH_ENTRY | ( | item, | |
| list, | |||
| type, | |||
| member | |||
| ) |
Traverse a doubly linked list which is included in a given type structure.
| item | [IN/OUT] The pointer to the structure that contains the doubly linked list. |
| list | [IN] Type LOS_DL_LIST * The start node of the doubly linked list to be traversed. |
| type | [IN] Structure name. |
| member | [IN] The doubly linked list name in the structure. |
| None. |
| #define LOS_DL_LIST_FOR_EACH_ENTRY_HOOK | ( | item, | |
| list, | |||
| type, | |||
| member, | |||
| hook | |||
| ) |
Iterate over a doubly linked list of given type, and call hook for any extra procedures every time.
| item | [IN/OUT] Pointer to the structure that contains the doubly linked list that is to be traversed. |
| list | [IN] Pointer to the doubly linked list to be traversed. |
| type | [IN] Structure name. |
| member | [IN] Member name of the doubly linked list in the structure. |
| hook | [IN] Hook for extra procedures which will be called every time when dev is fetched. |
| None. |
| #define LOS_DL_LIST_FOR_EACH_ENTRY_SAFE | ( | item, | |
| next, | |||
| list, | |||
| type, | |||
| member | |||
| ) |
Traverse a doubly linked list which is included in a given type structure. And it is safe against removal of list entry.
| item | [IN/OUT] The pointer to the structure that contains the doubly linked list. |
| next | [IN/OUT] The pointer to the structure that contains the next node of the doubly linked list. |
| list | [IN] Type LOS_DL_LIST * The start node of the doubly linked list to be traversed. |
| type | [IN] Structure name. |
| member | [IN] The doubly linked list name in the structure. |
| None. |
| #define LOS_DL_LIST_FOR_EACH_SAFE | ( | item, | |
| next, | |||
| list | |||
| ) |
Traverse a doubly linked list safe against removal of list entry.
| item | [IN/OUT] Type LOS_DL_LIST * The pointer to the next node in the doubly linked list. |
| next | [IN/OUT] Type LOS_DL_LIST * The pointer to the next node of the the node specified by first parameter item. |
| list | [IN] Type LOS_DL_LIST * The pointer to the node of the doubly linked list to be traversed. |
| None. |
| #define LOS_DL_LIST_HEAD | ( | list | ) | LOS_DL_LIST list = { &(list), &(list) } |
Initialize a double linked list.
| list | [IN] Type LOS_DL_LIST A node to be initialized to a doubly linked list. |
| None. |
| #define LOS_DL_LIST_LAST | ( | object | ) | ((object)->pstPrev) |
Point to the previous node of the current node.
| object | [IN] Type LOS_DL_LIST * The node in the doubly linked list. |
| None. |
Obtain the offset of a structure member relative to the structure start address.
| type | [IN] Structure name. |
| member | [IN] The structure member name which needs to measure the offset. |
| UINTPTR | Offset of the member relative to the structure start address. |
| typedef struct LOS_DL_LIST LOS_DL_LIST |
Structure of a node in a doubly linked list.