UNPL
UNPL
Description
Unique name per line
Usage example (Cross-references)
Usage examples (Cross-references)
- In
Foreach.h:18:
///
#define MapForeachPairPtr(m, key_ptr, value_ptr) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \- In
Foreach.h:19:
#define MapForeachPairPtr(m, key_ptr, value_ptr) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \- In
Foreach.h:20:
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:21:
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) *key_ptr = MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
- In
Foreach.h:22:
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) *key_ptr = MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
- In
Foreach.h:23:
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) *key_ptr = MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false) \
- In
Foreach.h:24:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) *key_ptr = MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
- In
Foreach.h:25:
for (MAP_KEY_TYPE(UNPL(pm)) *key_ptr = MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
value_ptr; \
- In
Foreach.h:26:
UNPL(_once); \
UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
value_ptr; \
value_ptr = NULL)- In
Foreach.h:36:
///
#define MapForeachPair(m, key_var, value_var) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \- In
Foreach.h:37:
#define MapForeachPair(m, key_var, value_var) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \- In
Foreach.h:38:
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:39:
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
- In
Foreach.h:40:
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
- In
Foreach.h:41:
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false) \
- In
Foreach.h:42:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
- In
Foreach.h:43:
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
- In
Foreach.h:44:
UNPL(_once); \
UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:45:
UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:46:
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:54:
///
#define MapForeachKey(m, key_var) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \- In
Foreach.h:55:
#define MapForeachKey(m, key_var) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \- In
Foreach.h:56:
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
(map_find_index( \
- In
Foreach.h:57:
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
(map_find_index( \
GENERIC_MAP(UNPL(pm)), \
- In
Foreach.h:59:
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
(map_find_index( \
GENERIC_MAP(UNPL(pm)), \
MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), \
sizeof(MAP_ENTRY_TYPE(UNPL(pm))), \
- In
Foreach.h:60:
(map_find_index( \
GENERIC_MAP(UNPL(pm)), \
MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), \
sizeof(MAP_ENTRY_TYPE(UNPL(pm))), \
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), key), \
- In
Foreach.h:61:
GENERIC_MAP(UNPL(pm)), \
MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), \
sizeof(MAP_ENTRY_TYPE(UNPL(pm))), \
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), key), \
sizeof(MAP_KEY_TYPE(UNPL(pm))), \
- In
Foreach.h:62:
MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), \
sizeof(MAP_ENTRY_TYPE(UNPL(pm))), \
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), key), \
sizeof(MAP_KEY_TYPE(UNPL(pm))), \
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), hash) \
- In
Foreach.h:63:
sizeof(MAP_ENTRY_TYPE(UNPL(pm))), \
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), key), \
sizeof(MAP_KEY_TYPE(UNPL(pm))), \
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), hash) \
) == UNPL(slot))) \
- In
Foreach.h:64:
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), key), \
sizeof(MAP_KEY_TYPE(UNPL(pm))), \
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), hash) \
) == UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:65:
sizeof(MAP_KEY_TYPE(UNPL(pm))), \
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), hash) \
) == UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
- In
Foreach.h:66:
offsetof(MAP_ENTRY_TYPE(UNPL(pm)), hash) \
) == UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
- In
Foreach.h:67:
) == UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:68:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:69:
for (MAP_KEY_TYPE(UNPL(pm)) key_var = *MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:77:
///
#define MapForeachValue(m, value_var) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \- In
Foreach.h:78:
#define MapForeachValue(m, value_var) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \- In
Foreach.h:79:
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:80:
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
- In
Foreach.h:81:
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
- In
Foreach.h:82:
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:83:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:84:
for (MAP_VALUE_TYPE(UNPL(pm)) value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:92:
///
#define MapForeachValuePtr(m, value_ptr) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \- In
Foreach.h:93:
#define MapForeachValuePtr(m, value_ptr) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \- In
Foreach.h:94:
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:95:
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
- In
Foreach.h:96:
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
- In
Foreach.h:97:
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot))) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:98:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:99:
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:107:
///
#define MapForeachValueForKey(m, lookup_key, value_var) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \- In
Foreach.h:108:
#define MapForeachValueForKey(m, lookup_key, value_var) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \- In
Foreach.h:109:
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
- In
Foreach.h:110:
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
- In
Foreach.h:111:
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
(UNPL(pm)->key_compare(MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), &UNPL(find_key)) == \
- In
Foreach.h:112:
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
(UNPL(pm)->key_compare(MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), &UNPL(find_key)) == \
0)) \
- In
Foreach.h:113:
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
(UNPL(pm)->key_compare(MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), &UNPL(find_key)) == \
0)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:115:
(UNPL(pm)->key_compare(MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), &UNPL(find_key)) == \
0)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) \
value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
- In
Foreach.h:116:
0)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) \
value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
- In
Foreach.h:117:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) \
value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:118:
for (MAP_VALUE_TYPE(UNPL(pm)) \
value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:119:
value_var = *MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:127:
///
#define MapForeachValuePtrForKey(m, lookup_key, value_ptr) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \- In
Foreach.h:128:
#define MapForeachValuePtrForKey(m, lookup_key, value_ptr) \
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \- In
Foreach.h:129:
for (TYPE_OF(m) UNPL(pm) = (m); UNPL(pm); UNPL(pm) = NULL) \
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
- In
Foreach.h:130:
if ((ValidateMap(UNPL(pm)), 1) && UNPL(pm)->length > 0) \
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
- In
Foreach.h:131:
for (bool UNPL(_key_once) = true; UNPL(_key_once); UNPL(_key_once) = false) \
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
(UNPL(pm)->key_compare(MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), &UNPL(find_key)) == \
- In
Foreach.h:132:
for (MAP_KEY_TYPE(UNPL(pm)) UNPL(find_key) = (lookup_key); UNPL(_key_once); UNPL(_key_once) = false) \
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
(UNPL(pm)->key_compare(MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), &UNPL(find_key)) == \
0)) \
- In
Foreach.h:133:
for (size UNPL(slot) = 0; UNPL(slot) < UNPL(pm)->capacity; UNPL(slot)++) \
if (MISRA_PRIV_MapSlotOccupied(UNPL(pm), UNPL(slot)) && \
(UNPL(pm)->key_compare(MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), &UNPL(find_key)) == \
0)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:135:
(UNPL(pm)->key_compare(MISRA_PRIV_MapKeyPtrAt(UNPL(pm), UNPL(slot)), &UNPL(find_key)) == \
0)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = \
MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
- In
Foreach.h:136:
0)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = \
MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
- In
Foreach.h:137:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = \
MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:138:
for (MAP_VALUE_TYPE(UNPL(pm)) *value_ptr = \
MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:139:
MISRA_PRIV_MapValuePtrAt(UNPL(pm), UNPL(slot)); \
UNPL(_once); \
UNPL(_once) = false)
#endif // MISRA_STD_CONTAINER_MAP_FOREACH_H
- In
Ops.h:29:
ValidateMap(lhs); \
ValidateMap(rhs); \
TYPE_OF(*(lhs)) UNPL(tmp) = *(lhs); \
*(lhs) = *(rhs); \
*(rhs) = UNPL(tmp); \
- In
Ops.h:31:
TYPE_OF(*(lhs)) UNPL(tmp) = *(lhs); \
*(lhs) = *(rhs); \
*(rhs) = UNPL(tmp); \
} while (0)- In
Foreach.h:23:
///
#define VecForeachIdx(v, var, idx) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \- In
Foreach.h:24:
#define VecForeachIdx(v, var, idx) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \
for (VEC_DATATYPE(UNPL(pv)) var = {0}; idx < UNPL(pv)->length && (var = VecAt(UNPL(pv), idx), 1); idx++)- In
Foreach.h:25:
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \
for (VEC_DATATYPE(UNPL(pv)) var = {0}; idx < UNPL(pv)->length && (var = VecAt(UNPL(pv), idx), 1); idx++)- In
Foreach.h:26:
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \
for (VEC_DATATYPE(UNPL(pv)) var = {0}; idx < UNPL(pv)->length && (var = VecAt(UNPL(pv), idx), 1); idx++)
///
- In
Foreach.h:41:
///
#define VecForeachReverseIdx(v, var, idx) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \- In
Foreach.h:42:
#define VecForeachReverseIdx(v, var, idx) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \- In
Foreach.h:43:
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \
for (VEC_DATATYPE(UNPL(pv)) var = VecAt(UNPL(pv), idx); UNPL(run_once); UNPL(run_once) = 0)- In
Foreach.h:44:
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \
for (VEC_DATATYPE(UNPL(pv)) var = VecAt(UNPL(pv), idx); UNPL(run_once); UNPL(run_once) = 0)- In
Foreach.h:45:
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \
for (VEC_DATATYPE(UNPL(pv)) var = VecAt(UNPL(pv), idx); UNPL(run_once); UNPL(run_once) = 0)
///
- In
Foreach.h:60:
///
#define VecForeachPtrIdx(v, var, idx) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \- In
Foreach.h:61:
#define VecForeachPtrIdx(v, var, idx) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \
for (VEC_DATATYPE(UNPL(pv)) *var = NULL; idx < UNPL(pv)->length && (var = VecPtrAt(UNPL(pv), idx), 1); \- In
Foreach.h:62:
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \
for (VEC_DATATYPE(UNPL(pv)) *var = NULL; idx < UNPL(pv)->length && (var = VecPtrAt(UNPL(pv), idx), 1); \
idx++)- In
Foreach.h:63:
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \
for (VEC_DATATYPE(UNPL(pv)) *var = NULL; idx < UNPL(pv)->length && (var = VecPtrAt(UNPL(pv), idx), 1); \
idx++)- In
Foreach.h:79:
///
#define VecForeachPtrReverseIdx(v, var, idx) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \- In
Foreach.h:80:
#define VecForeachPtrReverseIdx(v, var, idx) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \- In
Foreach.h:81:
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \
for (VEC_DATATYPE(UNPL(pv)) *var = VecPtrAt(UNPL(pv), idx); UNPL(run_once); UNPL(run_once) = 0)- In
Foreach.h:82:
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \
for (VEC_DATATYPE(UNPL(pv)) *var = VecPtrAt(UNPL(pv), idx); UNPL(run_once); UNPL(run_once) = 0)- In
Foreach.h:83:
for (u64 idx = UNPL(pv)->length; idx-- > 0 && idx < UNPL(pv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \
for (VEC_DATATYPE(UNPL(pv)) *var = VecPtrAt(UNPL(pv), idx); UNPL(run_once); UNPL(run_once) = 0)
///
- In
Foreach.h:97:
/// TAGS: Foreach, Vec, Iteration, Loop
///
#define VecForeach(v, var) VecForeachIdx((v), (var), UNPL(iter))
///
- In
Foreach.h:111:
/// TAGS: Foreach, Vec, Iteration, Loop, Reverse
///
#define VecForeachReverse(v, var) VecForeachReverseIdx((v), (var), UNPL(iter))
///
- In
Foreach.h:127:
/// TAGS: Foreach, Vec, Iteration, Loop, Pointer
///
#define VecForeachPtr(v, var) VecForeachPtrIdx((v), (var), UNPL(iter))
///
- In
Foreach.h:160:
///
#define VecForeachInRangeIdx(v, var, idx, start, end) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \- In
Foreach.h:161:
#define VecForeachInRangeIdx(v, var, idx, start, end) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \- In
Foreach.h:162:
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
- In
Foreach.h:163:
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
for (VEC_DATATYPE(UNPL(pv)) var = VecAt(UNPL(pv), idx); UNPL(d); UNPL(d) = 0)- In
Foreach.h:164:
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
for (VEC_DATATYPE(UNPL(pv)) var = VecAt(UNPL(pv), idx); UNPL(d); UNPL(d) = 0)- In
Foreach.h:165:
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
for (VEC_DATATYPE(UNPL(pv)) var = VecAt(UNPL(pv), idx); UNPL(d); UNPL(d) = 0)
///
- In
Foreach.h:196:
///
#define VecForeachPtrInRangeIdx(v, var, idx, start, end) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \- In
Foreach.h:197:
#define VecForeachPtrInRangeIdx(v, var, idx, start, end) \
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
idx >= UNPL(s) && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \- In
Foreach.h:198:
for (TYPE_OF(v) UNPL(pv) = (v); UNPL(pv); UNPL(pv) = NULL) \
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
idx >= UNPL(s) && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
- In
Foreach.h:199:
if ((ValidateVec(UNPL(pv)), 1) && UNPL(pv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
idx >= UNPL(s) && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
for (VEC_DATATYPE(UNPL(pv)) *var = VecPtrAt(UNPL(pv), idx); UNPL(d); UNPL(d) = 0)- In
Foreach.h:200:
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
idx >= UNPL(s) && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
for (VEC_DATATYPE(UNPL(pv)) *var = VecPtrAt(UNPL(pv), idx); UNPL(d); UNPL(d) = 0)- In
Foreach.h:201:
idx >= UNPL(s) && idx < UNPL(e) && idx < UNPL(pv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
for (VEC_DATATYPE(UNPL(pv)) *var = VecPtrAt(UNPL(pv), idx); UNPL(d); UNPL(d) = 0)
///
- In
Foreach.h:27:
///
#define ListForeach(l, var) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->head)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \- In
Foreach.h:28:
#define ListForeach(l, var) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->head)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \- In
Foreach.h:29:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->head)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
- In
Foreach.h:30:
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->head)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
- In
Foreach.h:31:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:32:
UNPL(node) = ListNodeNext(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
- In
Foreach.h:33:
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
- In
Foreach.h:34:
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:35:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:36:
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:54:
///
#define ListForeachPtr(l, var) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->head)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \- In
Foreach.h:55:
#define ListForeachPtr(l, var) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->head)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \- In
Foreach.h:56:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->head)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
- In
Foreach.h:57:
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->head)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
- In
Foreach.h:58:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:59:
UNPL(node) = ListNodeNext(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
- In
Foreach.h:60:
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
- In
Foreach.h:61:
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:62:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:63:
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:81:
///
#define ListForeachReverse(l, var) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->tail)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \- In
Foreach.h:82:
#define ListForeachReverse(l, var) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->tail)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \- In
Foreach.h:83:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->tail)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
- In
Foreach.h:84:
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->tail)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
- In
Foreach.h:85:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:86:
UNPL(node) = ListNodePrev(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
- In
Foreach.h:87:
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
- In
Foreach.h:88:
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:89:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:90:
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:108:
///
#define ListForeachPtrReverse(l, var) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->tail)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \- In
Foreach.h:109:
#define ListForeachPtrReverse(l, var) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->tail)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \- In
Foreach.h:110:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->tail)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
- In
Foreach.h:111:
if ((ValidateList(UNPL(pl)), 1) && (UNPL(pl)->tail)) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
- In
Foreach.h:112:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:113:
UNPL(node) = ListNodePrev(UNPL(node))) \
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
- In
Foreach.h:114:
if (((void *)UNPL(node)->next != (void *)UNPL(node)) && \
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
- In
Foreach.h:115:
((void *)UNPL(node)->prev != (void *)UNPL(node)) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:116:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:117:
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:138:
///
#define ListForeachInRange(l, var, start, end) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \- In
Foreach.h:139:
#define ListForeachInRange(l, var, start, end) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \- In
Foreach.h:140:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
- In
Foreach.h:141:
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
- In
Foreach.h:142:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:143:
UNPL(node) = ListNodeNext(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
- In
Foreach.h:144:
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
- In
Foreach.h:145:
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:146:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:147:
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:165:
///
#define ListForeachPtrInRange(l, var, start, end) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \- In
Foreach.h:166:
#define ListForeachPtrInRange(l, var, start, end) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \- In
Foreach.h:167:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
- In
Foreach.h:168:
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
- In
Foreach.h:169:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodeNext(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:170:
UNPL(node) = ListNodeNext(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
- In
Foreach.h:171:
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodeNext(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
- In
Foreach.h:172:
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:173:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:174:
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:194:
///
#define ListForeachReverseInRange(l, var, start, end) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \- In
Foreach.h:195:
#define ListForeachReverseInRange(l, var, start, end) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \- In
Foreach.h:196:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
- In
Foreach.h:197:
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
- In
Foreach.h:198:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:199:
UNPL(node) = ListNodePrev(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
- In
Foreach.h:200:
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
- In
Foreach.h:201:
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:202:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:203:
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:224:
///
#define ListForeachPtrReverseInRange(l, var, start, end) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \- In
Foreach.h:225:
#define ListForeachPtrReverseInRange(l, var, start, end) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \- In
Foreach.h:226:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
- In
Foreach.h:227:
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
- In
Foreach.h:228:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeEnd(UNPL(pl)); UNPL(node); \
UNPL(node) = ListNodePrev(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:229:
UNPL(node) = ListNodePrev(UNPL(node))) \
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
- In
Foreach.h:230:
for (u64 UNPL(i) = 0; UNPL(node) && UNPL(i) < (end); UNPL(node) = ListNodePrev(UNPL(node)), ++UNPL(i)) \
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
- In
Foreach.h:231:
if (UNPL(i) >= (start) && (UNPL(node)->data)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:232:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:233:
for (LIST_DATA_TYPE(UNPL(pl)) *var = (LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(node)->data); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:256:
///
#define ListForeachIdx(l, var, idx) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \- In
Foreach.h:257:
#define ListForeachIdx(l, var, idx) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \- In
Foreach.h:258:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \
UNPL(node) && \
- In
Foreach.h:259:
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \
UNPL(node) && \
(UNPL(next) = \
- In
Foreach.h:260:
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \
UNPL(node) && \
(UNPL(next) = \
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
- In
Foreach.h:261:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \
UNPL(node) && \
(UNPL(next) = \
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
- In
Foreach.h:262:
UNPL(node) && \
(UNPL(next) = \
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
- In
Foreach.h:263:
(UNPL(next) = \
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
- In
Foreach.h:264:
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)UNPL(pidx) \
- In
Foreach.h:265:
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)UNPL(pidx) \
) : \
- In
Foreach.h:266:
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)UNPL(pidx) \
) : \
(GenericListNode *)UNPL(pl)->head)) && \
- In
Foreach.h:268:
(i64)(idx) - (i64)UNPL(pidx) \
) : \
(GenericListNode *)UNPL(pl)->head)) && \
UNPL(next) && UNPL(next)->data; \
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
- In
Foreach.h:269:
) : \
(GenericListNode *)UNPL(pl)->head)) && \
UNPL(next) && UNPL(next)->data; \
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:270:
(GenericListNode *)UNPL(pl)->head)) && \
UNPL(next) && UNPL(next)->data; \
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
- In
Foreach.h:271:
UNPL(next) && UNPL(next)->data; \
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
UNPL(_once); \
- In
Foreach.h:272:
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:273:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
UNPL(_once); \
UNPL(_once) = false)- In
Foreach.h:274:
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
UNPL(_once); \
UNPL(_once) = false)
///
- In
Foreach.h:297:
///
#define ListForeachPtrIdx(l, var, idx) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \- In
Foreach.h:298:
#define ListForeachPtrIdx(l, var, idx) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \- In
Foreach.h:299:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \
UNPL(node) && \
- In
Foreach.h:300:
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->head) \
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \
UNPL(node) && \
(UNPL(next) = \
- In
Foreach.h:301:
for (u64 idx = 0, UNPL(pidx) = 0; idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \
UNPL(node) && \
(UNPL(next) = \
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
- In
Foreach.h:302:
for (GenericListNode * UNPL(node) = (GenericListNode *)ListNodeBegin(UNPL(pl)), *UNPL(next) = NULL; \
UNPL(node) && \
(UNPL(next) = \
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
- In
Foreach.h:303:
UNPL(node) && \
(UNPL(next) = \
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
- In
Foreach.h:304:
(UNPL(next) = \
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
- In
Foreach.h:305:
(UNPL(pidx) ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)UNPL(pidx) \
- In
Foreach.h:306:
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)UNPL(pidx) \
) : \
- In
Foreach.h:307:
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)UNPL(pidx) \
) : \
(GenericListNode *)UNPL(pl)->head)) && \
- In
Foreach.h:309:
(i64)(idx) - (i64)UNPL(pidx) \
) : \
(GenericListNode *)UNPL(pl)->head)) && \
UNPL(next) && UNPL(next)->data; \
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
- In
Foreach.h:310:
) : \
(GenericListNode *)UNPL(pl)->head)) && \
UNPL(next) && UNPL(next)->data; \
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:311:
(GenericListNode *)UNPL(pl)->head)) && \
UNPL(next) && UNPL(next)->data; \
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = UNPL(next)->data; UNPL(_once); UNPL(_once) = false)- In
Foreach.h:312:
UNPL(next) && UNPL(next)->data; \
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = UNPL(next)->data; UNPL(_once); UNPL(_once) = false)- In
Foreach.h:313:
UNPL(pidx) = ++idx, UNPL(node) = UNPL(next)) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = UNPL(next)->data; UNPL(_once); UNPL(_once) = false)
///
- In
Foreach.h:334:
///
#define ListForeachReverseIdx(l, var, idx) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail && UNPL(pl)->length > 0) \
for (u64 idx = UNPL(pl)->length - 1, \- In
Foreach.h:335:
#define ListForeachReverseIdx(l, var, idx) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail && UNPL(pl)->length > 0) \
for (u64 idx = UNPL(pl)->length - 1, \
UNPL(pidx) = UNPL(pl)->length - 1, \- In
Foreach.h:336:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail && UNPL(pl)->length > 0) \
for (u64 idx = UNPL(pl)->length - 1, \
UNPL(pidx) = UNPL(pl)->length - 1, \
UNPL(first) = 1, \
- In
Foreach.h:337:
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail && UNPL(pl)->length > 0) \
for (u64 idx = UNPL(pl)->length - 1, \
UNPL(pidx) = UNPL(pl)->length - 1, \
UNPL(first) = 1, \
UNPL(user_idx) = 0; \
- In
Foreach.h:338:
for (u64 idx = UNPL(pl)->length - 1, \
UNPL(pidx) = UNPL(pl)->length - 1, \
UNPL(first) = 1, \
UNPL(user_idx) = 0; \
idx < UNPL(pl)->length;) \
- In
Foreach.h:339:
UNPL(pidx) = UNPL(pl)->length - 1, \
UNPL(first) = 1, \
UNPL(user_idx) = 0; \
idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
- In
Foreach.h:340:
UNPL(first) = 1, \
UNPL(user_idx) = 0; \
idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
*UNPL(next) = NULL; \
- In
Foreach.h:341:
UNPL(user_idx) = 0; \
idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
*UNPL(next) = NULL; \
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
- In
Foreach.h:342:
idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
*UNPL(next) = NULL; \
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
(UNPL(next) = \
- In
Foreach.h:343:
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
*UNPL(next) = NULL; \
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
(UNPL(next) = \
(UNPL(pidx) != idx ? (GenericListNode *)get_node_random_access( \
- In
Foreach.h:344:
*UNPL(next) = NULL; \
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
(UNPL(next) = \
(UNPL(pidx) != idx ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
- In
Foreach.h:345:
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
(UNPL(next) = \
(UNPL(pidx) != idx ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
- In
Foreach.h:346:
(UNPL(next) = \
(UNPL(pidx) != idx ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
- In
Foreach.h:347:
(UNPL(pidx) != idx ? (GenericListNode *)get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)UNPL(pidx) \
- In
Foreach.h:348:
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)UNPL(pidx) \
) : \
- In
Foreach.h:349:
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)UNPL(pidx) \
) : \
UNPL(node))) && \
- In
Foreach.h:351:
(i64)(idx) - (i64)UNPL(pidx) \
) : \
UNPL(node))) && \
UNPL(next) && UNPL(next)->data; \
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
- In
Foreach.h:352:
) : \
UNPL(node))) && \
UNPL(next) && UNPL(next)->data; \
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:353:
UNPL(node))) && \
UNPL(next) && UNPL(next)->data; \
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
- In
Foreach.h:354:
UNPL(next) && UNPL(next)->data; \
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
UNPL(_once); \
- In
Foreach.h:355:
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
UNPL(_once); \
UNPL(_once) = false) \
- In
Foreach.h:356:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
UNPL(_once); \
UNPL(_once) = false) \
for (bool UNPL(_update) = true; UNPL(_update); \
- In
Foreach.h:357:
for (LIST_DATA_TYPE(UNPL(pl)) var = *((LIST_DATA_TYPE(UNPL(pl)) *)(UNPL(next)->data)); \
UNPL(_once); \
UNPL(_once) = false) \
for (bool UNPL(_update) = true; UNPL(_update); \
UNPL(_update) = false, \
- In
Foreach.h:358:
UNPL(_once); \
UNPL(_once) = false) \
for (bool UNPL(_update) = true; UNPL(_update); \
UNPL(_update) = false, \
UNPL(user_idx) = idx, \
- In
Foreach.h:359:
UNPL(_once) = false) \
for (bool UNPL(_update) = true; UNPL(_update); \
UNPL(_update) = false, \
UNPL(user_idx) = idx, \
idx = \
- In
Foreach.h:360:
for (bool UNPL(_update) = true; UNPL(_update); \
UNPL(_update) = false, \
UNPL(user_idx) = idx, \
idx = \
(UNPL(user_idx) != UNPL(pidx) ? UNPL(user_idx) : \
- In
Foreach.h:362:
UNPL(user_idx) = idx, \
idx = \
(UNPL(user_idx) != UNPL(pidx) ? UNPL(user_idx) : \
(idx > 0 ? idx - 1 : UNPL(pl)->length)))- In
Foreach.h:363:
idx = \
(UNPL(user_idx) != UNPL(pidx) ? UNPL(user_idx) : \
(idx > 0 ? idx - 1 : UNPL(pl)->length)))
///
- In
Foreach.h:384:
///
#define ListForeachPtrReverseIdx(l, var, idx) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail && UNPL(pl)->length > 0) \
for (u64 idx = UNPL(pl)->length - 1, \- In
Foreach.h:385:
#define ListForeachPtrReverseIdx(l, var, idx) \
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail && UNPL(pl)->length > 0) \
for (u64 idx = UNPL(pl)->length - 1, \
UNPL(pidx) = UNPL(pl)->length - 1, \- In
Foreach.h:386:
for (TYPE_OF(l) UNPL(pl) = (l); UNPL(pl); UNPL(pl) = NULL) \
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail && UNPL(pl)->length > 0) \
for (u64 idx = UNPL(pl)->length - 1, \
UNPL(pidx) = UNPL(pl)->length - 1, \
UNPL(first) = 1, \
- In
Foreach.h:387:
if ((ValidateList(UNPL(pl)), 1) && UNPL(pl)->tail && UNPL(pl)->length > 0) \
for (u64 idx = UNPL(pl)->length - 1, \
UNPL(pidx) = UNPL(pl)->length - 1, \
UNPL(first) = 1, \
UNPL(user_idx) = 0; \
- In
Foreach.h:388:
for (u64 idx = UNPL(pl)->length - 1, \
UNPL(pidx) = UNPL(pl)->length - 1, \
UNPL(first) = 1, \
UNPL(user_idx) = 0; \
idx < UNPL(pl)->length;) \
- In
Foreach.h:389:
UNPL(pidx) = UNPL(pl)->length - 1, \
UNPL(first) = 1, \
UNPL(user_idx) = 0; \
idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
- In
Foreach.h:390:
UNPL(first) = 1, \
UNPL(user_idx) = 0; \
idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
*UNPL(next) = NULL; \
- In
Foreach.h:391:
UNPL(user_idx) = 0; \
idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
*UNPL(next) = NULL; \
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
- In
Foreach.h:392:
idx < UNPL(pl)->length;) \
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
*UNPL(next) = NULL; \
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
(UNPL(next) = \
- In
Foreach.h:393:
for (GenericListNode * UNPL(node) = (UNPL(first) ? (GenericListNode *)UNPL(pl)->tail : NULL), \
*UNPL(next) = NULL; \
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
(UNPL(next) = \
(UNPL(pidx) != idx ? get_node_random_access( \
- In
Foreach.h:394:
*UNPL(next) = NULL; \
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
(UNPL(next) = \
(UNPL(pidx) != idx ? get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
- In
Foreach.h:395:
UNPL(node) && idx < UNPL(pl)->length && (UNPL(first) = 0) && \
(UNPL(next) = \
(UNPL(pidx) != idx ? get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
- In
Foreach.h:396:
(UNPL(next) = \
(UNPL(pidx) != idx ? get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
- In
Foreach.h:397:
(UNPL(pidx) != idx ? get_node_random_access( \
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)(UNPL(pidx)) \
- In
Foreach.h:398:
GENERIC_LIST(UNPL(pl)), \
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)(UNPL(pidx)) \
) : \
- In
Foreach.h:399:
GENERIC_LIST_NODE(UNPL(node)), \
UNPL(pidx), \
(i64)(idx) - (i64)(UNPL(pidx)) \
) : \
UNPL(node))) && \
- In
Foreach.h:401:
(i64)(idx) - (i64)(UNPL(pidx)) \
) : \
UNPL(node))) && \
UNPL(next) && UNPL(next)->data; \
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
- In
Foreach.h:402:
) : \
UNPL(node))) && \
UNPL(next) && UNPL(next)->data; \
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:403:
UNPL(node))) && \
UNPL(next) && UNPL(next)->data; \
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = UNPL(next)->data; UNPL(_once); UNPL(_once) = false) \
- In
Foreach.h:404:
UNPL(next) && UNPL(next)->data; \
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = UNPL(next)->data; UNPL(_once); UNPL(_once) = false) \
for (bool UNPL(_update) = true; UNPL(_update); \
- In
Foreach.h:405:
UNPL(node) = UNPL(next), UNPL(pidx) = idx) \
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = UNPL(next)->data; UNPL(_once); UNPL(_once) = false) \
for (bool UNPL(_update) = true; UNPL(_update); \
UNPL(_update) = false, \
- In
Foreach.h:406:
for (bool UNPL(_once) = true; UNPL(_once); UNPL(_once) = false) \
for (LIST_DATA_TYPE(UNPL(pl)) *var = UNPL(next)->data; UNPL(_once); UNPL(_once) = false) \
for (bool UNPL(_update) = true; UNPL(_update); \
UNPL(_update) = false, \
UNPL(user_idx) = idx, \
- In
Foreach.h:407:
for (LIST_DATA_TYPE(UNPL(pl)) *var = UNPL(next)->data; UNPL(_once); UNPL(_once) = false) \
for (bool UNPL(_update) = true; UNPL(_update); \
UNPL(_update) = false, \
UNPL(user_idx) = idx, \
idx = \
- In
Foreach.h:408:
for (bool UNPL(_update) = true; UNPL(_update); \
UNPL(_update) = false, \
UNPL(user_idx) = idx, \
idx = \
(UNPL(user_idx) != UNPL(pidx) ? UNPL(user_idx) : \
- In
Foreach.h:410:
UNPL(user_idx) = idx, \
idx = \
(UNPL(user_idx) != UNPL(pidx) ? UNPL(user_idx) : \
(idx > 0 ? idx - 1 : UNPL(pl)->length)))- In
Foreach.h:411:
idx = \
(UNPL(user_idx) != UNPL(pidx) ? UNPL(user_idx) : \
(idx > 0 ? idx - 1 : UNPL(pl)->length)))
#endif // MISRA_STD_CONTAINER_LIST_FOREACH_H
- In
Insert.h:46:
do { \
ValidateList(l); \
LIST_DATA_TYPE(l) * UNPL(_ptrval) = &(lval); \
LIST_DATA_TYPE(l) UNPL(_tmpval) = *UNPL(_ptrval); \
insert_into_list(GENERIC_LIST(l), UNPL(_ptrval), sizeof(LIST_DATA_TYPE(l)), (idx)); \
- In
Insert.h:47:
ValidateList(l); \
LIST_DATA_TYPE(l) * UNPL(_ptrval) = &(lval); \
LIST_DATA_TYPE(l) UNPL(_tmpval) = *UNPL(_ptrval); \
insert_into_list(GENERIC_LIST(l), UNPL(_ptrval), sizeof(LIST_DATA_TYPE(l)), (idx)); \
if (!(l)->copy_init) { \
- In
Insert.h:48:
LIST_DATA_TYPE(l) * UNPL(_ptrval) = &(lval); \
LIST_DATA_TYPE(l) UNPL(_tmpval) = *UNPL(_ptrval); \
insert_into_list(GENERIC_LIST(l), UNPL(_ptrval), sizeof(LIST_DATA_TYPE(l)), (idx)); \
if (!(l)->copy_init) { \
memset(UNPL(_ptrval), 0, sizeof(LIST_DATA_TYPE(l))); \
- In
Insert.h:50:
insert_into_list(GENERIC_LIST(l), UNPL(_ptrval), sizeof(LIST_DATA_TYPE(l)), (idx)); \
if (!(l)->copy_init) { \
memset(UNPL(_ptrval), 0, sizeof(LIST_DATA_TYPE(l))); \
} \
} while (0)- In
Insert.h:82:
do { \
ValidateList(l); \
LIST_DATA_TYPE(l) UNPL(_rval) = (rval); \
insert_into_list(GENERIC_LIST(l), (char *)&UNPL(_rval), sizeof(LIST_DATA_TYPE(l)), (idx)); \
} while (0)- In
Insert.h:83:
ValidateList(l); \
LIST_DATA_TYPE(l) UNPL(_rval) = (rval); \
insert_into_list(GENERIC_LIST(l), (char *)&UNPL(_rval), sizeof(LIST_DATA_TYPE(l)), (idx)); \
} while (0)- In
Insert.h:190:
do { \
ValidateList(l); \
LIST_DATA_TYPE(l) * UNPL(_ptrval) = (arr); \
const LIST_DATA_TYPE(l) UNPL(_tmpval) = *UNPL(_ptrval); \
(void)UNPL(_tmpval); \
- In
Insert.h:191:
ValidateList(l); \
LIST_DATA_TYPE(l) * UNPL(_ptrval) = (arr); \
const LIST_DATA_TYPE(l) UNPL(_tmpval) = *UNPL(_ptrval); \
(void)UNPL(_tmpval); \
push_arr_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), UNPL(_ptrval), (count)); \
- In
Insert.h:192:
LIST_DATA_TYPE(l) * UNPL(_ptrval) = (arr); \
const LIST_DATA_TYPE(l) UNPL(_tmpval) = *UNPL(_ptrval); \
(void)UNPL(_tmpval); \
push_arr_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), UNPL(_ptrval), (count)); \
if (!(l)->copy_init) { \
- In
Insert.h:193:
const LIST_DATA_TYPE(l) UNPL(_tmpval) = *UNPL(_ptrval); \
(void)UNPL(_tmpval); \
push_arr_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), UNPL(_ptrval), (count)); \
if (!(l)->copy_init) { \
memset(UNPL(_ptrval), 0, sizeof(LIST_DATA_TYPE(l))); \
- In
Insert.h:195:
push_arr_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), UNPL(_ptrval), (count)); \
if (!(l)->copy_init) { \
memset(UNPL(_ptrval), 0, sizeof(LIST_DATA_TYPE(l))); \
} \
} while (0)- In
Insert.h:215:
ValidateList(l2); \
{ \
LIST_DATA_TYPE(l) UNPL(_tmp1) = {0}; \
LIST_DATA_TYPE(l2) UNPL(_tmp2) = {0}; \
UNPL(_tmp1) = UNPL(_tmp2); \
- In
Insert.h:216:
{ \
LIST_DATA_TYPE(l) UNPL(_tmp1) = {0}; \
LIST_DATA_TYPE(l2) UNPL(_tmp2) = {0}; \
UNPL(_tmp1) = UNPL(_tmp2); \
(void)UNPL(_tmp1); \
- In
Insert.h:217:
LIST_DATA_TYPE(l) UNPL(_tmp1) = {0}; \
LIST_DATA_TYPE(l2) UNPL(_tmp2) = {0}; \
UNPL(_tmp1) = UNPL(_tmp2); \
(void)UNPL(_tmp1); \
(void)UNPL(_tmp2); \
- In
Insert.h:218:
LIST_DATA_TYPE(l2) UNPL(_tmp2) = {0}; \
UNPL(_tmp1) = UNPL(_tmp2); \
(void)UNPL(_tmp1); \
(void)UNPL(_tmp2); \
} \
- In
Insert.h:219:
UNPL(_tmp1) = UNPL(_tmp2); \
(void)UNPL(_tmp1); \
(void)UNPL(_tmp2); \
} \
merge_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), GENERIC_LIST(l2)); \
- In
Insert.h:246:
ValidateList(l2); \
{ \
LIST_DATA_TYPE(l) UNPL(_tmp1) = {0}; \
LIST_DATA_TYPE(l2) UNPL(_tmp2) = {0}; \
UNPL(_tmp1) = UNPL(_tmp2); \
- In
Insert.h:247:
{ \
LIST_DATA_TYPE(l) UNPL(_tmp1) = {0}; \
LIST_DATA_TYPE(l2) UNPL(_tmp2) = {0}; \
UNPL(_tmp1) = UNPL(_tmp2); \
(void)UNPL(_tmp1); \
- In
Insert.h:248:
LIST_DATA_TYPE(l) UNPL(_tmp1) = {0}; \
LIST_DATA_TYPE(l2) UNPL(_tmp2) = {0}; \
UNPL(_tmp1) = UNPL(_tmp2); \
(void)UNPL(_tmp1); \
(void)UNPL(_tmp2); \
- In
Insert.h:249:
LIST_DATA_TYPE(l2) UNPL(_tmp2) = {0}; \
UNPL(_tmp1) = UNPL(_tmp2); \
(void)UNPL(_tmp1); \
(void)UNPL(_tmp2); \
} \
- In
Insert.h:250:
UNPL(_tmp1) = UNPL(_tmp2); \
(void)UNPL(_tmp1); \
(void)UNPL(_tmp2); \
} \
merge_list(GENERIC_LIST(l), sizeof(LIST_DATA_TYPE(l)), GENERIC_LIST(l2)); \
- In
Foreach.h:24:
///
#define BitVecForeachIdx(bv, var, idx) \
for (TYPE_OF(bv) UNPL(pbv) = (bv); UNPL(pbv); UNPL(pbv) = NULL) \
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \- In
Foreach.h:25:
#define BitVecForeachIdx(bv, var, idx) \
for (TYPE_OF(bv) UNPL(pbv) = (bv); UNPL(pbv); UNPL(pbv) = NULL) \
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \
for (bool var = 0; idx < UNPL(pbv)->length && (var = BitVecGet(UNPL(pbv), idx), 1); idx++)- In
Foreach.h:26:
for (TYPE_OF(bv) UNPL(pbv) = (bv); UNPL(pbv); UNPL(pbv) = NULL) \
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \
for (bool var = 0; idx < UNPL(pbv)->length && (var = BitVecGet(UNPL(pbv), idx), 1); idx++)- In
Foreach.h:27:
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 idx = 0, UNPL(d) = 1; UNPL(d); UNPL(d)--) \
for (bool var = 0; idx < UNPL(pbv)->length && (var = BitVecGet(UNPL(pbv), idx), 1); idx++)
///
- In
Foreach.h:40:
///
#define BitVecForeachReverseIdx(bv, var, idx) \
for (TYPE_OF(bv) UNPL(pbv) = (bv); UNPL(pbv); UNPL(pbv) = NULL) \
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 idx = UNPL(pbv)->length; idx-- > 0 && idx < UNPL(pbv)->length;) \- In
Foreach.h:41:
#define BitVecForeachReverseIdx(bv, var, idx) \
for (TYPE_OF(bv) UNPL(pbv) = (bv); UNPL(pbv); UNPL(pbv) = NULL) \
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 idx = UNPL(pbv)->length; idx-- > 0 && idx < UNPL(pbv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \- In
Foreach.h:42:
for (TYPE_OF(bv) UNPL(pbv) = (bv); UNPL(pbv); UNPL(pbv) = NULL) \
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 idx = UNPL(pbv)->length; idx-- > 0 && idx < UNPL(pbv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \
for (bool var = BitVecGet(UNPL(pbv), idx); UNPL(run_once); UNPL(run_once) = 0)- In
Foreach.h:43:
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 idx = UNPL(pbv)->length; idx-- > 0 && idx < UNPL(pbv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \
for (bool var = BitVecGet(UNPL(pbv), idx); UNPL(run_once); UNPL(run_once) = 0)- In
Foreach.h:44:
for (u64 idx = UNPL(pbv)->length; idx-- > 0 && idx < UNPL(pbv)->length;) \
for (u8 UNPL(run_once) = 1; UNPL(run_once); UNPL(run_once) = 0) \
for (bool var = BitVecGet(UNPL(pbv), idx); UNPL(run_once); UNPL(run_once) = 0)
///
- In
Foreach.h:55:
/// current bit during iteration. The type of `var` will be `bool`.
///
#define BitVecForeach(bv, var) BitVecForeachIdx((bv), (var), UNPL(iter))
///
- In
Foreach.h:66:
/// current bit during iteration. The type of `var` will be `bool`.
///
#define BitVecForeachReverse(bv, var) BitVecForeachReverseIdx((bv), (var), UNPL(iter))
///
- In
Foreach.h:81:
///
#define BitVecForeachInRangeIdx(bv, var, idx, start, end) \
for (TYPE_OF(bv) UNPL(pbv) = (bv); UNPL(pbv); UNPL(pbv) = NULL) \
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \- In
Foreach.h:82:
#define BitVecForeachInRangeIdx(bv, var, idx, start, end) \
for (TYPE_OF(bv) UNPL(pbv) = (bv); UNPL(pbv); UNPL(pbv) = NULL) \
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pbv)->length && UNPL(s) <= UNPL(e); \- In
Foreach.h:83:
for (TYPE_OF(bv) UNPL(pbv) = (bv); UNPL(pbv); UNPL(pbv) = NULL) \
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pbv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
- In
Foreach.h:84:
if ((ValidateBitVec(UNPL(pbv)), 1) && UNPL(pbv)->length > 0) \
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pbv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
for (bool var = BitVecGet(UNPL(pbv), idx); UNPL(d); UNPL(d) = 0)- In
Foreach.h:85:
for (u64 UNPL(s) = (start), UNPL(e) = (end), idx = UNPL(s), UNPL(d) = 1; \
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pbv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
for (bool var = BitVecGet(UNPL(pbv), idx); UNPL(d); UNPL(d) = 0)- In
Foreach.h:86:
UNPL(s) <= idx && idx < UNPL(e) && idx < UNPL(pbv)->length && UNPL(s) <= UNPL(e); \
++idx, UNPL(d) = 1) \
for (bool var = BitVecGet(UNPL(pbv), idx); UNPL(d); UNPL(d) = 0)
- In
Foreach.h:99:
/// end[in] : Ending index (exclusive).
///
#define BitVecForeachInRange(bv, var, start, end) BitVecForeachInRangeIdx((bv), (var), UNPL(iter), (start), (end))
#endif // MISRA_STD_CONTAINER_BITVEC_FOREACH_H
Last updated on