49
|
1 |
/*
|
|
2 |
Task Spooler - a task queue system for the unix user
|
|
3 |
Copyright (C) 2007 LluĂs Batlle i Rossell
|
|
4 |
|
|
5 |
Please find the license in the provided COPYING file.
|
|
6 |
*/
|
3
|
7 |
#include <stdio.h>
|
|
8 |
#include "msg.h"
|
|
9 |
#include "main.h"
|
|
10 |
|
|
11 |
void msgdump(const struct msg *m)
|
|
12 |
{
|
5
|
13 |
return;
|
|
14 |
|
3
|
15 |
printf("msgdump:\n");
|
|
16 |
switch(m->type)
|
|
17 |
{
|
31
|
18 |
case KILL_SERVER:
|
|
19 |
printf(" KILL SERVER\n");
|
3
|
20 |
break;
|
|
21 |
case NEWJOB:
|
|
22 |
printf(" NEWJOB\n");
|
32
|
23 |
printf(" Commandsize: %i\n", m->u.newjob.command_size);
|
3
|
24 |
break;
|
|
25 |
case NEWJOB_OK:
|
|
26 |
printf(" NEWJOB_OK\n");
|
4
|
27 |
printf(" JobID: '%i'\n", m->u.jobid);
|
3
|
28 |
break;
|
|
29 |
case RUNJOB:
|
|
30 |
printf(" RUNJOB\n");
|
|
31 |
break;
|
32
|
32 |
case RUNJOB_OK:
|
|
33 |
printf(" RUNJOB_OK\n");
|
35
|
34 |
printf(" Outputsize: %i\n", m->u.output.ofilename_size);
|
|
35 |
printf(" pid: %i\n", m->u.output.pid);
|
32
|
36 |
break;
|
3
|
37 |
case ENDJOB:
|
|
38 |
printf(" ENDJOB\n");
|
|
39 |
break;
|
|
40 |
case LIST:
|
|
41 |
printf(" LIST\n");
|
|
42 |
break;
|
5
|
43 |
case LIST_LINE:
|
|
44 |
printf(" LIST_LINE\n");
|
32
|
45 |
printf(" Linesize: %i\n", m->u.line_size);
|
|
46 |
break;
|
|
47 |
case ASK_OUTPUT:
|
|
48 |
printf(" ASK_OUTPUT\n");
|
|
49 |
printf(" Jobid: %i\n", m->u.jobid);
|
|
50 |
break;
|
|
51 |
case ANSWER_OUTPUT:
|
|
52 |
printf(" ANSWER_OUTPUT\n");
|
|
53 |
printf(" Outputsize: %i\n", m->u.output.ofilename_size);
|
35
|
54 |
printf(" PID: %i\n", m->u.output.pid);
|
5
|
55 |
break;
|
44
|
56 |
default:
|
|
57 |
printf(" Unknown message\n");
|
3
|
58 |
}
|
|
59 |
}
|