xv6-65oo2/usertests.c
rtm 46bbd72f3e no more recursive locks
wakeup1() assumes you hold proc_table_lock
sleep(chan, lock) provides atomic sleep-and-release to wait for condition
ugly code in swtch/scheduler to implement new sleep
fix lots of bugs in pipes, wait, and exit
fix bugs if timer interrupt goes off in schedule()
console locks per line, not per byte
2006-07-15 12:03:57 +00:00

128 lines
1.9 KiB
C

char buf[2048];
// simple fork and pipe read/write
void
pipe1()
{
int fds[2], pid;
int seq = 0, i, n, cc, total;
pipe(fds);
pid = fork();
if(pid == 0){
close(fds[0]);
for(n = 0; n < 5; n++){
for(i = 0; i < 1033; i++)
buf[i] = seq++;
if(write(fds[1], buf, 1033) != 1033){
panic("pipe1 oops 1\n");
exit(1);
}
}
exit(0);
} else {
close(fds[1]);
total = 0;
cc = 1;
while(1){
n = read(fds[0], buf, cc);
if(n < 1)
break;
for(i = 0; i < n; i++){
if((buf[i] & 0xff) != (seq++ & 0xff)){
panic("pipe1 oops 2\n");
return;
}
}
total += n;
cc = cc * 2;
if(cc > sizeof(buf))
cc = sizeof(buf);
}
if(total != 5 * 1033)
panic("pipe1 oops 3\n");
close(fds[0]);
wait();
}
puts("pipe1 ok\n");
}
// meant to be run w/ at most two CPUs
void
preempt()
{
int pid1, pid2, pid3;
int pfds[2];
pid1 = fork();
if(pid1 == 0)
while(1)
;
pid2 = fork();
if(pid2 == 0)
while(1)
;
pipe(pfds);
pid3 = fork();
if(pid3 == 0){
close(pfds[0]);
if(write(pfds[1], "x", 1) != 1)
panic("preempt write error");
close(pfds[1]);
while(1)
;
}
close(pfds[1]);
if(read(pfds[0], buf, sizeof(buf)) != 1){
panic("preempt read error");
return;
}
close(pfds[0]);
kill(pid1);
kill(pid2);
kill(pid3);
wait();
wait();
wait();
puts("preempt ok\n");
}
// try to find any races between exit and wait
void
exitwait()
{
int i, pid;
for(i = 0; i < 100; i++){
pid = fork();
if(pid < 0){
panic("fork failed\n");
return;
}
if(pid){
if(wait() != pid){
panic("wait wrong pid\n");
return;
}
} else {
exit(0);
}
}
puts("exitwait ok\n");
}
main()
{
puts("usertests starting\n");
pipe1();
preempt();
exitwait();
panic("usertests finished successfuly");
}