minix/kernel/debug.c

171 lines
4.8 KiB
C
Raw Normal View History

/* This file implements kernel debugging functionality that is not included
* in the standard kernel. Available functionality includes timing of lock
* functions and sanity checking of the scheduling queues.
2005-04-21 16:53:53 +02:00
*/
#include "kernel.h"
#include "proc.h"
#include "debug.h"
#include <limits.h>
#if DEBUG_TIME_LOCKS /* only include code if enabled */
/* Data structures to store lock() timing data. */
struct lock_timingdata timingdata[TIMING_CATEGORIES];
static unsigned long starttimes[TIMING_CATEGORIES][2];
#define HIGHCOUNT 0
#define LOWCOUNT 1
void timer_start(int cat, char *name)
{
static int init = 0;
unsigned long h, l;
int i;
2005-09-11 18:44:06 +02:00
if (cat < 0 || cat >= TIMING_CATEGORIES) return;
for(i = 0; i < sizeof(timingdata[0].names) && *name; i++)
timingdata[cat].names[i] = *name++;
timingdata[cat].names[sizeof(timingdata[0].names)-1] = '\0';
2005-09-11 18:44:06 +02:00
if (starttimes[cat][HIGHCOUNT]) { return; }
2005-09-11 18:44:06 +02:00
if (!init) {
int t, f;
init = 1;
for(t = 0; t < TIMING_CATEGORIES; t++) {
timingdata[t].lock_timings_range[0] = 0;
timingdata[t].resets = timingdata[t].misses =
timingdata[t].measurements = 0;
}
}
read_tsc(&starttimes[cat][HIGHCOUNT], &starttimes[cat][LOWCOUNT]);
}
void timer_end(int cat)
{
unsigned long h, l, d = 0, binsize;
int bin;
read_tsc(&h, &l);
2005-09-11 18:44:06 +02:00
if (cat < 0 || cat >= TIMING_CATEGORIES) return;
if (!starttimes[cat][HIGHCOUNT]) {
timingdata[cat].misses++;
return;
}
2005-09-11 18:44:06 +02:00
if (starttimes[cat][HIGHCOUNT] == h) {
d = (l - starttimes[cat][1]);
2005-09-11 18:44:06 +02:00
} else if (starttimes[cat][HIGHCOUNT] == h-1 &&
starttimes[cat][LOWCOUNT] > l) {
d = ((ULONG_MAX - starttimes[cat][LOWCOUNT]) + l);
} else {
timingdata[cat].misses++;
return;
}
starttimes[cat][HIGHCOUNT] = 0;
2005-09-11 18:44:06 +02:00
if (!timingdata[cat].lock_timings_range[0] ||
d < timingdata[cat].lock_timings_range[0] ||
d > timingdata[cat].lock_timings_range[1]) {
int t;
2005-09-11 18:44:06 +02:00
if (!timingdata[cat].lock_timings_range[0] ||
d < timingdata[cat].lock_timings_range[0])
timingdata[cat].lock_timings_range[0] = d;
2005-09-11 18:44:06 +02:00
if (!timingdata[cat].lock_timings_range[1] ||
d > timingdata[cat].lock_timings_range[1])
timingdata[cat].lock_timings_range[1] = d;
for(t = 0; t < TIMING_POINTS; t++)
timingdata[cat].lock_timings[t] = 0;
timingdata[cat].binsize =
(timingdata[cat].lock_timings_range[1] -
timingdata[cat].lock_timings_range[0])/(TIMING_POINTS+1);
2005-09-11 18:44:06 +02:00
if (timingdata[cat].binsize < 1)
timingdata[cat].binsize = 1;
timingdata[cat].resets++;
}
bin = (d-timingdata[cat].lock_timings_range[0]) /
timingdata[cat].binsize;
2005-09-11 18:44:06 +02:00
if (bin < 0 || bin >= TIMING_POINTS) {
int t;
/* this indicates a bug, but isn't really serious */
for(t = 0; t < TIMING_POINTS; t++)
timingdata[cat].lock_timings[t] = 0;
timingdata[cat].misses++;
} else {
timingdata[cat].lock_timings[bin]++;
timingdata[cat].measurements++;
}
return;
}
#endif /* DEBUG_TIME_LOCKS */
2005-04-21 16:53:53 +02:00
#if DEBUG_SCHED_CHECK /* only include code if enabled */
2005-04-21 16:53:53 +02:00
#define MAX_LOOP (NR_PROCS + NR_TASKS)
PUBLIC void
check_runqueues(char *when)
{
int q, l = 0;
register struct proc *xp;
for (xp = BEG_PROC_ADDR; xp < END_PROC_ADDR; ++xp) {
xp->p_found = 0;
if (l++ > MAX_LOOP) { panic("check error", NO_NUM); }
}
for (q=l=0; q < NR_SCHED_QUEUES; q++) {
2005-09-11 18:44:06 +02:00
if (rdy_head[q] && !rdy_tail[q]) {
kprintf("head but no tail in %d: %s", q, when);
panic("scheduling error", NO_NUM);
}
2005-09-11 18:44:06 +02:00
if (!rdy_head[q] && rdy_tail[q]) {
kprintf("tail but no head in %d: %s", q, when);
panic("scheduling error", NO_NUM);
}
2005-09-11 18:44:06 +02:00
if (rdy_tail[q] && rdy_tail[q]->p_nextready != NIL_PROC) {
kprintf("tail and tail->next not null in %d: %s", q, when);
panic("scheduling error", NO_NUM);
}
for(xp = rdy_head[q]; xp != NIL_PROC; xp = xp->p_nextready) {
if (!xp->p_ready) {
kprintf("scheduling error: unready on runq %d proc %d: %s\n",
q, xp->p_nr, when);
panic("found unready process on run queue", NO_NUM);
}
2005-09-11 18:44:06 +02:00
if (xp->p_priority != q) {
kprintf("scheduling error: wrong priority q %d proc %d: %s\n",
q, xp->p_nr, when);
panic("wrong priority", NO_NUM);
}
2005-09-11 18:44:06 +02:00
if (xp->p_found) {
kprintf("scheduling error: double sched q %d proc %d: %s\n",
q, xp->p_nr, when);
panic("proc more than once on scheduling queue", NO_NUM);
}
xp->p_found = 1;
2005-09-11 18:44:06 +02:00
if (xp->p_nextready == NIL_PROC && rdy_tail[q] != xp) {
kprintf("sched err: last element not tail q %d proc %d: %s\n",
q, xp->p_nr, when);
panic("scheduling error", NO_NUM);
}
if (l++ > MAX_LOOP) panic("loop in schedule queue?", NO_NUM);
}
}
l = 0;
for (xp = BEG_PROC_ADDR; xp < END_PROC_ADDR; ++xp) {
2005-09-11 18:44:06 +02:00
if (! isemptyp(xp) && xp->p_ready && ! xp->p_found) {
kprintf("sched error: ready proc %d not on queue: %s\n",
xp->p_nr, when);
panic("ready proc not on scheduling queue", NO_NUM);
if (l++ > MAX_LOOP) { panic("loop in proc.t?", NO_NUM); }
}
}
}
#endif /* DEBUG_SCHED_CHECK */