mirror of
https://github.com/0intro/libtask
synced 2024-11-24 22:59:43 +03:00
56 lines
797 B
C
56 lines
797 B
C
/* Copyright (c) 2005 Russ Cox, MIT; see COPYRIGHT */
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
#include <task.h>
|
|
|
|
int quiet;
|
|
int goal;
|
|
int buffer;
|
|
|
|
void
|
|
primetask(void *arg)
|
|
{
|
|
Channel *c, *nc;
|
|
int p, i;
|
|
c = arg;
|
|
|
|
p = chanrecvul(c);
|
|
if(p > goal)
|
|
taskexitall(0);
|
|
if(!quiet)
|
|
printf("%d\n", p);
|
|
nc = chancreate(sizeof(unsigned long), buffer);
|
|
taskcreate(primetask, nc, 32768);
|
|
for(;;){
|
|
i = chanrecvul(c);
|
|
if(i%p)
|
|
chansendul(nc, i);
|
|
}
|
|
}
|
|
|
|
void
|
|
taskmain(int argc, char **argv)
|
|
{
|
|
int i;
|
|
Channel *c;
|
|
|
|
if(argc>1)
|
|
goal = atoi(argv[1]);
|
|
else
|
|
goal = 100;
|
|
printf("goal=%d\n", goal);
|
|
|
|
c = chancreate(sizeof(unsigned long), buffer);
|
|
taskcreate(primetask, c, 32768);
|
|
for(i=2;; i++)
|
|
chansendul(c, i);
|
|
}
|
|
|
|
void*
|
|
emalloc(unsigned long n)
|
|
{
|
|
return calloc(n ,1);
|
|
}
|