void LibLinkedList_Dump(LinkedListInfo *info) { printf("==================================== %s() start\n", __func__); DUMPD(info->count); DUMPP(info->head); DUMPP(info->tail); LinkedListNode *currNode = info->head; for (u32 i = 0; i < info->count; i++) { printf("Node(%d):\n", i+1); printf("[ %p ]\n", currNode); DUMPP(currNode->prev); DUMPP(currNode->next); currNode = currNode->next; } BASIC_ASSERT(currNode == NULL); printf("==================================== %s() end\n", __func__); }
static bool check_dump(void) { DCHECK; DUMPC('a'); DUMPP(&check_dump); DUMPS(__FUNCTION__); DUMPD((uint64_t)(-1)); DUMPZ((uint64_t)(-1)); DUMP8((uint64_t)(-1)); DUMP16((uint64_t)(-1)); DUMP32((uint64_t)(-1)); DUMP64((uint64_t)(-1)); return true; }