|
|
@ -56,18 +56,19 @@ void stackmon_dump(void) |
|
|
|
uint32_t words = ((stack->len-free)>>2)+1; |
|
|
|
uint32_t words = ((stack->len-free)>>2)+1; |
|
|
|
if (words>stack->len>>2) words=stack->len>>2; |
|
|
|
if (words>stack->len>>2) words=stack->len>>2; |
|
|
|
|
|
|
|
|
|
|
|
PRINTF(" Used: \033[33m%"PRIu32" / %"PRIu32" bytes\033[m (\033[33m%"PRIu32" / %"PRIu32" words\033[m) ~ \033[33m%"PRIu32" %%\033[m\r\n", |
|
|
|
PRINTF(" Used: \033[33m%"PRIu32" / %"PRIu32" bytes\033[m (\033[33m%"PRIu32" / %"PRIu32" words\033[m)", |
|
|
|
(stack->len-free), |
|
|
|
(stack->len-free), |
|
|
|
stack->len, |
|
|
|
stack->len, |
|
|
|
words, |
|
|
|
words, |
|
|
|
stack->len>>2, |
|
|
|
stack->len>>2 |
|
|
|
(stack->len-free)*100/stack->len |
|
|
|
|
|
|
|
); |
|
|
|
); |
|
|
|
|
|
|
|
PRINTF(" ~ \033[33m%"PRIu32" %%\033[m\r\n", |
|
|
|
|
|
|
|
(stack->len-free)*100/stack->len); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
PUTS("\033[36m>> MSG+JOB QUEUE\033[m\r\n"); |
|
|
|
PUTS("\033[36m>> MSG+JOB QUEUE\033[m\r\n"); |
|
|
|
PRINTF(" Used slots: \033[33m%"PRIu32"\033[m\r\n", |
|
|
|
PRINTF(" Used slots: \033[33m%"PRIu32" / %d\033[m\r\n", |
|
|
|
msgQueHighWaterMark); |
|
|
|
msgQueHighWaterMark, RX_QUE_CAPACITY); |
|
|
|
|
|
|
|
|
|
|
|
PRINTF("\033[1m---------------------------\033[m\r\n\r\n"); |
|
|
|
PRINTF("\033[1m---------------------------\033[m\r\n\r\n"); |
|
|
|
} |
|
|
|
} |
|
|
|