void VertexArray::print( FILE *f ) { #ifdef RC_LOG_TO_FILE #define prnt0(a) fprintf(f, a) #define prnt1(a, b) fprintf(f, a, b) #else /* RC_LOG_TO_FILE */ #define prnt0(a) printf(a) #define prnt1(a, b) printf(a, b) #endif /* RC_LOG_TO_FILE */ prnt1(" [ N ELEMS ][ %u ]\n", n_elements); prnt1(" [ STRIDE ][ %u ]\n", stride); prnt1(" [ N ATTR. ][ %u ]\n", n_attribs); }
void ResourceList::printContents( char *list_name ) { u32 i; FILE *f = NULL; #ifdef RC_LOG_TO_FILE #define prnt0(a) fprintf(f, a) #define prnt1(a, b) fprintf(f, a, b) f = fopen("reslist.txt", "a"); if (!f) { return; } #else /* RC_LOG_TO_FILE */ #define prnt0(a) printf(a) #define prnt1(a, b) printf(a, b) #endif /* RC_LOG_TO_FILE */ prnt1("\n\n\n\n - - = = %s list contents = = - - \n", list_name); prnt1(" [ N ENTRIES ][ %u ]\n", n_entries); prnt1(" [ HASH SIZE ][ %u ]\n", length); for (i = 0; i < length; i++) { Resource *ptr = list[i]; while (ptr) { prnt1(" -- %s --\n", ptr->identifier); prnt1(" [ N REFS ][ %u ]\n", ptr->n_refs); prnt1(" [ PURGE ][ %u ]\n", ptr->purgeLevel); prnt1(" [ HASH ][ %0x ]\n", ptr->hash); ptr->print(f); prnt0("\n"); ptr = ptr->next; } } #ifdef RC_LOG_TO_FILE fclose(f); #endif /* RC_LOG_TO_FILE */ reslist_time++; }