foreman.h

fastDNAml is an attempt to solve the same problem as DNAML, but to do so faster and using less memo

/* foreman.c  */

#define MAX_WORK_QUEUE_SIZE  1000
#define MAX_READY_QUEUE_SIZE 1000

typedef struct { 
    int next;
    int length;
    int id[MAX_READY_QUEUE_SIZE];
} ready_queue; 

typedef struct {
    char   *work;
    int     size;
    int     tid;
    double  time;
} work;

typedef struct { 
    int   next;
    int   end;
    work  wk[MAX_WORK_QUEUE_SIZE];
} work_queue; 

void    init_ready_queue(ready_queue *);
void    init_work_queue(work_queue *);
void    put_ready_queue(ready_queue *, int);
void    put_work_queue(work_queue *, char *, int);
boolean get_ready_queue(ready_queue *, int *);
boolean get_work_queue(work_queue *, char **, int *, int);
void    remove_work_queue(work_queue *, int);
FILE    *fopen_pid (char *, char *, char *);
void    put_blacklist(int tid);
int     on_blacklist(int tid);
void    remove_blacklist(int tid);