提交 3eb536c5 创建 作者: Frans Kaashoek's avatar Frans Kaashoek

remove print statements

上级 5c9fbe15
......@@ -26,8 +26,6 @@ cv_sleep(struct condvar *cv, struct spinlock *lk)
// Must acquire cv_lock to avoid sleep/wakeup race
acquire(&cv->lock);
cprintf("cv_sleep: 0x%x %s\n", cv, cv->lock.name);
release(lk);
if (cv->waiters != 0)
......@@ -53,7 +51,6 @@ cv_sleep(struct condvar *cv, struct spinlock *lk)
cv->waiters = 0;
// Reacquire original lock.
cprintf("acquire %s\n", lk->name);
acquire(lk);
release(&cv->lock);
......@@ -64,7 +61,6 @@ cv_wakeup(struct condvar *cv)
{
acquire(&cv->lock);
if (cv->waiters != 0) {
cprintf("wakeup 0x%x %d\n", cv, cv->waiters->pid);
addrun(cv->waiters);
}
release(&cv->lock);
......
......@@ -20,8 +20,6 @@ exec(char *path, char **argv)
struct proghdr ph;
pde_t *pgdir, *oldpgdir;
cprintf("%d: exec %s\n", cpunum(), path);
if((ip = namei(path)) == 0)
return -1;
ilock(ip);
......
#define NPROC 64 // maximum number of processes
#define KSTACKSIZE 4096 // size of per-process kernel stack
#define NCPU 2 // maximum number of CPUs
#define NCPU 8 // maximum number of CPUs
#define NOFILE 16 // open files per process
#define NFILE 100 // open files per system
#define NBUF 10 // size of disk block cache
......
......@@ -29,7 +29,7 @@ pinit(void)
for (i = 0; i < NPROC; i++) {
initlock(&ptables[c].proc[i].lock, ptables[c].proc[i].name);
initcondvar(&ptables[c].proc[i].cv, ptables[c].proc[i].name); // XXX cv_init
initcondvar(&ptables[c].proc[i].cv, ptables[c].proc[i].name);
}
runqs[c].name[0] = (char) (c + '0');
......@@ -89,7 +89,6 @@ static void
addrun1(struct runq *rq, struct proc *p)
{
struct proc *q;
cprintf("%d: add to run %d\n", cpu->id, p->pid);
SLIST_FOREACH(q, &rq->runq, run_next) {
if (q == p) {
cprintf("allready on q\n");
......@@ -105,7 +104,7 @@ void
addrun(struct proc *p)
{
acquire(&runq->lock);
cprintf("%d: addrun %d\n", cpunum(), p->pid);
// cprintf("%d: addrun %d\n", cpunum(), p->pid);
addrun1(runq, p);
release(&runq->lock);
}
......@@ -126,7 +125,7 @@ void
delrun(struct proc *p)
{
acquire(&runq->lock);
cprintf("%d: delrun %d\n", cpunum(), p->pid);
// cprintf("%d: delrun %d\n", cpunum(), p->pid);
delrun1(runq, p);
release(&runq->lock);
}
......@@ -188,8 +187,6 @@ fork(void)
int i, pid;
struct proc *np;
cprintf("%d: fork\n", cpunum());
// Allocate process.
if((np = allocproc()) == 0)
return -1;
......@@ -245,8 +242,6 @@ exit(void)
iput(proc->cwd);
proc->cwd = 0;
cprintf("%d: exit %s(%d)\n", cpunum(), proc->name, proc->pid);
// Pass abandoned children to init.
wakeupinit = 0;
SLIST_FOREACH_SAFE(p, &proc->childq, child_next, np) {
......@@ -283,8 +278,6 @@ wait(void)
struct proc *p, *np;
int havekids, pid;
cprintf("wait %d\n", proc->pid);
for(;;){
// Scan children for ZOMBIEs
havekids = 0;
......@@ -384,7 +377,7 @@ scheduler(void)
proc = p;
switchuvm(p);
p->state = RUNNING;
cprintf("%d: running %d\n", cpu->id, p->pid);
// cprintf("%d: running %d\n", cpu->id, p->pid);
swtch(&cpu->scheduler, proc->context);
switchkvm();
......
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论