forked from samba-team/samba
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlpq_parse.c
1164 lines (990 loc) · 29.2 KB
/
lpq_parse.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Unix SMB/CIFS implementation.
lpq parsing routines
Copyright (C) Andrew Tridgell 2000
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "includes.h"
#include "printing.h"
#include "lib/util/string_wrappers.h"
static const char *Months[13] = { "Jan", "Feb", "Mar", "Apr", "May", "Jun",
"Jul", "Aug", "Sep", "Oct", "Nov", "Dec", "Err"};
/*******************************************************************
Process time fields
********************************************************************/
static time_t EntryTime(char *tok[], int ptr, int count, int minimum)
{
time_t jobtime,jobtime1;
jobtime = time(NULL); /* default case: take current time */
if (count >= minimum) {
struct tm *t;
int i, day, hour, min, sec;
for (i=0; i<13; i++) {
if (!strncmp(tok[ptr], Months[i],3)) {
break; /* Find month */
}
}
if (i<12) {
fstring c;
t = localtime(&jobtime);
if (!t) {
return (time_t)-1;
}
day = atoi(tok[ptr+1]);
fstrcpy(c,tok[ptr+2]);
*(c+2)=0;
hour = atoi(c);
*(c+5)=0;
min = atoi(c+3);
if(*(c+6) != 0) {
sec = atoi(c+6);
} else {
sec=0;
}
if ((t->tm_mon < i)|| ((t->tm_mon == i)&&
((t->tm_mday < day)||
((t->tm_mday == day)&&
(t->tm_hour*60+t->tm_min < hour*60+min))))) {
t->tm_year--; /* last year's print job */
}
t->tm_mon = i;
t->tm_mday = day;
t->tm_hour = hour;
t->tm_min = min;
t->tm_sec = sec;
jobtime1 = mktime(t);
if (jobtime1 != (time_t)-1) {
jobtime = jobtime1;
}
}
}
return jobtime;
}
/****************************************************************************
parse a lpq line
here is an example of lpq output under bsd
Warning: no daemon present
Rank Owner Job Files Total Size
1st tridge 148 README 8096 bytes
here is an example of lpq output under osf/1
Warning: no daemon present
Rank Pri Owner Job Files Total Size
1st 0 tridge 148 README 8096 bytes
<[email protected]> June 30, 1998.
Modified to handle file names with spaces, like the parse_lpq_lprng code
further below.
****************************************************************************/
static bool parse_lpq_bsd(char *line,print_queue_struct *buf,bool first)
{
#ifdef OSF1
#define RANKTOK 0
#define PRIOTOK 1
#define USERTOK 2
#define JOBTOK 3
#define FILETOK 4
#define TOTALTOK (count - 2)
#define NTOK 6
#define MAXTOK 128
#else /* OSF1 */
#define RANKTOK 0
#define USERTOK 1
#define JOBTOK 2
#define FILETOK 3
#define TOTALTOK (count - 2)
#define NTOK 5
#define MAXTOK 128
#endif /* OSF1 */
char *tok[MAXTOK];
int count = 0;
TALLOC_CTX *ctx = talloc_tos();
char *line2 = NULL;
char *saveptr;
line2 = talloc_strdup(ctx, line);
if (!line2) {
return false;
}
#ifdef OSF1
{
size_t length;
length = strlen(line2);
if (line2[length-3] == ':') {
return False;
}
}
#endif /* OSF1 */
/* FIXME: Use next_token_talloc rather than strtok! */
tok[0] = strtok_r(line2," \t", &saveptr);
count++;
while ((count < MAXTOK)
&& ((tok[count] = strtok_r(NULL, " \t", &saveptr)) != NULL)) {
count++;
}
/* we must get at least NTOK tokens */
if (count < NTOK) {
return False;
}
/* the Job and Total columns must be integer */
if (!isdigit((int)*tok[JOBTOK]) || !isdigit((int)*tok[TOTALTOK])) {
return False;
}
buf->sysjob = atoi(tok[JOBTOK]);
buf->size = atoi(tok[TOTALTOK]);
buf->status = strequal(tok[RANKTOK],"active")?LPQ_PRINTING:LPQ_QUEUED;
buf->time = time(NULL);
fstrcpy(buf->fs_user,tok[USERTOK]);
fstrcpy(buf->fs_file,tok[FILETOK]);
if ((FILETOK + 1) != TOTALTOK) {
int i;
for (i = (FILETOK + 1); i < TOTALTOK; i++) {
/* FIXME: Using fstrcat rather than other means is a bit
* inefficient; this might be a problem for enormous queues with
* many fields. */
fstrcat(buf->fs_file, " ");
fstrcat(buf->fs_file, tok[i]);
}
/* Ensure null termination. */
buf->fs_file[sizeof(buf->fs_file)-1] = '\0';
}
#ifdef PRIOTOK
buf->priority = atoi(tok[PRIOTOK]);
#else
buf->priority = 1;
#endif
return True;
}
/*
LPRng_time modifies the current date by inserting the hour and minute from
the lpq output. The lpq time looks like "23:15:07"
<[email protected]> June 30, 1998.
Modified to work with the re-written parse_lpq_lprng routine.
<[email protected]> Dec 17,1999
Modified to work with lprng 3.16
With lprng 3.16 The lpq time looks like
"23:15:07"
"23:15:07.100"
"1999-12-16-23:15:07"
"1999-12-16-23:15:07.100"
*/
static time_t LPRng_time(char *time_string)
{
time_t jobtime;
struct tm *t;
jobtime = time(NULL); /* default case: take current time */
t = localtime(&jobtime);
if (!t) {
return (time_t)-1;
}
if ( atoi(time_string) < 24 ){
if (strlen(time_string) < 7) {
return (time_t)-1;
}
t->tm_hour = atoi(time_string);
t->tm_min = atoi(time_string+3);
t->tm_sec = atoi(time_string+6);
} else {
if (strlen(time_string) < 18) {
return (time_t)-1;
}
t->tm_year = atoi(time_string)-1900;
t->tm_mon = atoi(time_string+5)-1;
t->tm_mday = atoi(time_string+8);
t->tm_hour = atoi(time_string+11);
t->tm_min = atoi(time_string+14);
t->tm_sec = atoi(time_string+17);
}
jobtime = mktime(t);
return jobtime;
}
/****************************************************************************
parse a lprng lpq line
<[email protected]> June 30, 1998.
Re-wrote this to handle file names with spaces, multiple file names on one
lpq line, etc;
****************************************************************************/
static bool parse_lpq_lprng(char *line,print_queue_struct *buf,bool first)
{
#define LPRNG_RANKTOK 0
#define LPRNG_USERTOK 1
#define LPRNG_PRIOTOK 2
#define LPRNG_JOBTOK 3
#define LPRNG_FILETOK 4
#define LPRNG_TOTALTOK (num_tok - 2)
#define LPRNG_TIMETOK (num_tok - 1)
#define LPRNG_NTOK 7
#define LPRNG_MAXTOK 128 /* PFMA just to keep us from running away. */
char *tokarr[LPRNG_MAXTOK];
const char *cptr;
char *ptr;
int num_tok = 0;
TALLOC_CTX *frame = talloc_stackframe();
cptr = line;
while((num_tok < LPRNG_MAXTOK) && next_token_talloc(frame, &cptr,
&tokarr[num_tok], " \t")) {
num_tok++;
}
/* We must get at least LPRNG_NTOK tokens. */
if (num_tok < LPRNG_NTOK) {
TALLOC_FREE(frame);
return False;
}
if (!isdigit((int)*tokarr[LPRNG_JOBTOK]) || !isdigit((int)*tokarr[LPRNG_TOTALTOK])) {
TALLOC_FREE(frame);
return False;
}
buf->sysjob = atoi(tokarr[LPRNG_JOBTOK]);
buf->size = atoi(tokarr[LPRNG_TOTALTOK]);
if (strequal(tokarr[LPRNG_RANKTOK],"active")) {
buf->status = LPQ_PRINTING;
} else if (strequal(tokarr[LPRNG_RANKTOK],"done")) {
buf->status = LPQ_PRINTED;
} else if (isdigit((int)*tokarr[LPRNG_RANKTOK])) {
buf->status = LPQ_QUEUED;
} else {
buf->status = LPQ_PAUSED;
}
buf->priority = *tokarr[LPRNG_PRIOTOK] -'A';
buf->time = LPRng_time(tokarr[LPRNG_TIMETOK]);
fstrcpy(buf->fs_user,tokarr[LPRNG_USERTOK]);
/* The '@hostname' prevents windows from displaying the printing icon
* for the current user on the taskbar. Plop in a null.
*/
if ((ptr = strchr_m(buf->fs_user,'@')) != NULL) {
*ptr = '\0';
}
fstrcpy(buf->fs_file,tokarr[LPRNG_FILETOK]);
if ((LPRNG_FILETOK + 1) != LPRNG_TOTALTOK) {
int i;
for (i = (LPRNG_FILETOK + 1); i < LPRNG_TOTALTOK; i++) {
/* FIXME: Using fstrcat rather than other means is a bit
* inefficient; this might be a problem for enormous queues with
* many fields. */
fstrcat(buf->fs_file, " ");
fstrcat(buf->fs_file, tokarr[i]);
}
/* Ensure null termination. */
buf->fs_file[sizeof(buf->fs_file)-1] = '\0';
}
TALLOC_FREE(frame);
return True;
}
/*******************************************************************
parse lpq on an aix system
Queue Dev Status Job Files User PP % Blks Cp Rnk
------- ----- --------- --- ------------------ ---------- ---- -- ----- --- ---
lazer lazer READY
lazer lazer RUNNING 537 6297doc.A kvintus@IE 0 10 2445 1 1
QUEUED 538 C.ps root@IEDVB 124 1 2
QUEUED 539 E.ps root@IEDVB 28 1 3
QUEUED 540 L.ps root@IEDVB 172 1 4
QUEUED 541 P.ps root@IEDVB 22 1 5
********************************************************************/
static bool parse_lpq_aix(char *line,print_queue_struct *buf,bool first)
{
char *tok[11];
int count=0;
const char *cline = line;
TALLOC_CTX *frame = talloc_stackframe();
/* handle the case of "(standard input)" as a filename */
string_sub(line,"standard input","STDIN",0);
all_string_sub(line,"(","\"",0);
all_string_sub(line,")","\"",0);
for (count=0; count<10 &&
next_token_talloc(frame,&cline,&tok[count],NULL); count++) {
;
}
/* we must get 6 tokens */
if (count < 10) {
if ((count == 7) && ((strcmp(tok[0],"QUEUED") == 0) || (strcmp(tok[0],"HELD") == 0))) {
/* the 2nd and 5th columns must be integer */
if (!isdigit((int)*tok[1]) || !isdigit((int)*tok[4])) {
TALLOC_FREE(frame);
return False;
}
buf->size = atoi(tok[4]) * 1024;
/* if the fname contains a space then use STDIN */
if (strchr_m(tok[2],' ')) {
tok[2] = talloc_strdup(frame,"STDIN");
if (!tok[2]) {
TALLOC_FREE(frame);
return false;
}
}
/* only take the last part of the filename */
{
char *p = strrchr_m(tok[2],'/');
if (p) {
tok[2] = p+1;
}
}
buf->sysjob = atoi(tok[1]);
buf->status = strequal(tok[0],"HELD")?LPQ_PAUSED:LPQ_QUEUED;
buf->priority = 0;
buf->time = time(NULL);
fstrcpy(buf->fs_user,tok[3]);
fstrcpy(buf->fs_file,tok[2]);
} else {
DEBUG(6,("parse_lpq_aix count=%d\n", count));
TALLOC_FREE(frame);
return False;
}
} else {
/* the 4th and 9th columns must be integer */
if (!isdigit((int)*tok[3]) || !isdigit((int)*tok[8])) {
TALLOC_FREE(frame);
return False;
}
buf->size = atoi(tok[8]) * 1024;
/* if the fname contains a space then use STDIN */
if (strchr_m(tok[4],' ')) {
tok[4] = talloc_strdup(frame,"STDIN");
if (!tok[4]) {
TALLOC_FREE(frame);
return false;
}
}
/* only take the last part of the filename */
{
char *p = strrchr_m(tok[4],'/');
if (p) {
tok[4] = p+1;
}
}
buf->sysjob = atoi(tok[3]);
buf->status = strequal(tok[2],"RUNNING")?LPQ_PRINTING:LPQ_QUEUED;
buf->priority = 0;
buf->time = time(NULL);
fstrcpy(buf->fs_user,tok[5]);
fstrcpy(buf->fs_file,tok[4]);
}
TALLOC_FREE(frame);
return True;
}
/****************************************************************************
parse a lpq line
here is an example of lpq output under hpux; note there's no space after -o !
$> lpstat -oljplus
ljplus-2153 user priority 0 Jan 19 08:14 on ljplus
util.c 125697 bytes
server.c 110712 bytes
ljplus-2154 user priority 0 Jan 19 08:14 from client
(standard input) 7551 bytes
****************************************************************************/
static bool parse_lpq_hpux(char *line, print_queue_struct *buf, bool first)
{
/* must read two lines to process, therefore keep some values static */
static bool header_line_ok=False, base_prio_reset=False;
static char *jobuser;
static int jobid;
static int jobprio;
static time_t jobtime;
static int jobstat=LPQ_QUEUED;
/* to store minimum priority to print, lpstat command should be invoked
with -p option first, to work */
static int base_prio;
int count;
char htab = '\011';
const char *cline = line;
char *tok[12];
TALLOC_CTX *frame = talloc_stackframe();
/* If a line begins with a horizontal TAB, it is a subline type */
if (line[0] == htab) { /* subline */
/* check if it contains the base priority */
if (!strncmp(line,"\tfence priority : ",18)) {
base_prio=atoi(&line[18]);
DEBUG(4, ("fence priority set at %d\n", base_prio));
}
if (!header_line_ok) {
TALLOC_FREE(frame);
return False; /* incorrect header line */
}
/* handle the case of "(standard input)" as a filename */
string_sub(line,"standard input","STDIN",0);
all_string_sub(line,"(","\"",0);
all_string_sub(line,")","\"",0);
for (count=0; count<2 &&
next_token_talloc(frame, &cline, &tok[count],NULL);
count++) {
;
}
/* we must get 2 tokens */
if (count < 2) {
TALLOC_FREE(frame);
return False;
}
/* the 2nd column must be integer */
if (!isdigit((int)*tok[1])) {
TALLOC_FREE(frame);
return False;
}
/* if the fname contains a space then use STDIN */
if (strchr_m(tok[0],' ')) {
tok[0] = talloc_strdup(frame, "STDIN");
if (!tok[0]) {
TALLOC_FREE(frame);
return false;
}
}
buf->size = atoi(tok[1]);
fstrcpy(buf->fs_file,tok[0]);
/* fill things from header line */
buf->time = jobtime;
buf->sysjob = jobid;
buf->status = jobstat;
buf->priority = jobprio;
if (jobuser) {
fstrcpy(buf->fs_user,jobuser);
} else {
buf->fs_user[0] = '\0';
}
TALLOC_FREE(frame);
return True;
} else { /* header line */
header_line_ok=False; /* reset it */
if (first) {
if (!base_prio_reset) {
base_prio=0; /* reset it */
base_prio_reset=True;
}
} else if (base_prio) {
base_prio_reset=False;
}
/* handle the dash in the job id */
string_sub(line,"-"," ",0);
for (count=0; count<12 &&
next_token_talloc(frame, &cline, &tok[count],NULL);
count++) {
;
}
/* we must get 8 tokens */
if (count < 8) {
TALLOC_FREE(frame);
return False;
}
/* first token must be printer name (cannot check ?) */
/* the 2nd, 5th & 7th column must be integer */
if (!isdigit((int)*tok[1]) || !isdigit((int)*tok[4]) || !isdigit((int)*tok[6])) {
TALLOC_FREE(frame);
return False;
}
jobid = atoi(tok[1]);
SAFE_FREE(jobuser);
jobuser = SMB_STRDUP(tok[2]);
jobprio = atoi(tok[4]);
/* process time */
jobtime=EntryTime(tok, 5, count, 8);
if (jobprio < base_prio) {
jobstat = LPQ_PAUSED;
DEBUG (4, ("job %d is paused: prio %d < %d; jobstat=%d\n",
jobid, jobprio, base_prio, jobstat));
} else {
jobstat = LPQ_QUEUED;
if ((count >8) && (((strequal(tok[8],"on")) ||
((strequal(tok[8],"from")) &&
((count > 10)&&(strequal(tok[10],"on"))))))) {
jobstat = LPQ_PRINTING;
}
}
header_line_ok=True; /* information is correct */
TALLOC_FREE(frame);
return False; /* need subline info to include into queuelist */
}
}
/****************************************************************************
parse a lpstat line
here is an example of "lpstat -o dcslw" output under sysv
dcslw-896 tridge 4712 Dec 20 10:30:30 on dcslw
dcslw-897 tridge 4712 Dec 20 10:30:30 being held
****************************************************************************/
static bool parse_lpq_sysv(char *line,print_queue_struct *buf,bool first)
{
char *tok[9];
int count=0;
char *p;
const char *cline = line;
TALLOC_CTX *frame = NULL;
/*
* Handle the dash in the job id, but make sure that we skip over
* the printer name in case we have a dash in that.
* Patch from [email protected].
*/
/*
* Move to the first space.
*/
for (p = line ; !isspace(*p) && *p; p++) {
;
}
/*
* Back up until the last '-' character or
* start of line.
*/
for (; (p >= line) && (*p != '-'); p--) {
;
}
if((p >= line) && (*p == '-')) {
*p = ' ';
}
frame = talloc_stackframe();
for (count=0; count<9 &&
next_token_talloc(frame, &cline, &tok[count],NULL);
count++) {
;
}
/* we must get 7 tokens */
if (count < 7) {
TALLOC_FREE(frame);
return False;
}
/* the 2nd and 4th, 6th columns must be integer */
if (!isdigit((int)*tok[1]) || !isdigit((int)*tok[3])) {
TALLOC_FREE(frame);
return False;
}
if (!isdigit((int)*tok[5])) {
TALLOC_FREE(frame);
return False;
}
/* if the user contains a ! then trim the first part of it */
if ((p=strchr_m(tok[2],'!'))) {
tok[2] = p+1;
}
buf->sysjob = atoi(tok[1]);
buf->size = atoi(tok[3]);
if (count > 7 && strequal(tok[7],"on")) {
buf->status = LPQ_PRINTING;
} else if (count > 8 && strequal(tok[7],"being") && strequal(tok[8],"held")) {
buf->status = LPQ_PAUSED;
} else {
buf->status = LPQ_QUEUED;
}
buf->priority = 0;
buf->time = EntryTime(tok, 4, count, 7);
fstrcpy(buf->fs_user,tok[2]);
fstrcpy(buf->fs_file,tok[2]);
TALLOC_FREE(frame);
return True;
}
/****************************************************************************
parse a lpq line
here is an example of lpq output under qnx
Spooler: /qnx/spooler, on node 1
Printer: txt (ready)
0000: root [job #1 ] active 1146 bytes /etc/profile
0001: root [job #2 ] ready 2378 bytes /etc/install
0002: root [job #3 ] ready 1146 bytes -- standard input --
****************************************************************************/
static bool parse_lpq_qnx(char *line,print_queue_struct *buf,bool first)
{
char *tok[7];
int count=0;
const char *cline = line;
TALLOC_CTX *frame = NULL;
DEBUG(4,("antes [%s]\n", line));
/* handle the case of "-- standard input --" as a filename */
string_sub(line,"standard input","STDIN",0);
DEBUG(4,("despues [%s]\n", line));
all_string_sub(line,"-- ","\"",0);
all_string_sub(line," --","\"",0);
DEBUG(4,("despues 1 [%s]\n", line));
string_sub(line,"[job #","",0);
string_sub(line,"]","",0);
DEBUG(4,("despues 2 [%s]\n", line));
frame = talloc_stackframe();
for (count=0; count<7 &&
next_token_talloc(frame,&cline,&tok[count],NULL);
count++) {
;
}
/* we must get 7 tokens */
if (count < 7) {
TALLOC_FREE(frame);
return False;
}
/* the 3rd and 5th columns must be integer */
if (!isdigit((int)*tok[2]) || !isdigit((int)*tok[4])) {
TALLOC_FREE(frame);
return False;
}
/* only take the last part of the filename */
{
char *p = strrchr_m(tok[6],'/');
if (p) {
tok[6] = p+1;
}
}
buf->sysjob = atoi(tok[2]);
buf->size = atoi(tok[4]);
buf->status = strequal(tok[3],"active")?LPQ_PRINTING:LPQ_QUEUED;
buf->priority = 0;
buf->time = time(NULL);
fstrcpy(buf->fs_user,tok[1]);
fstrcpy(buf->fs_file,tok[6]);
TALLOC_FREE(frame);
return True;
}
/****************************************************************************
parse a lpq line for the plp printing system
Bertrand Wallrich <[email protected]>
redone by tridge. Here is a sample queue:
Local Printer 'lp2' (fjall):
Printing (started at Jun 15 13:33:58, attempt 1).
Rank Owner Pr Opt Job Host Files Size Date
active tridge X - 6 fjall /etc/hosts 739 Jun 15 13:33
3rd tridge X - 7 fjall /etc/hosts 739 Jun 15 13:33
****************************************************************************/
static bool parse_lpq_plp(char *line,print_queue_struct *buf,bool first)
{
char *tok[11];
int count=0;
const char *cline = line;
TALLOC_CTX *frame = talloc_stackframe();
/* handle the case of "(standard input)" as a filename */
string_sub(line,"stdin","STDIN",0);
all_string_sub(line,"(","\"",0);
all_string_sub(line,")","\"",0);
for (count=0; count<11 &&
next_token_talloc(frame,&cline,&tok[count],NULL);
count++) {
;
}
/* we must get 11 tokens */
if (count < 11) {
TALLOC_FREE(frame);
return False;
}
/* the first must be "active" or begin with an integer */
if (strcmp(tok[0],"active") && !isdigit((int)tok[0][0])) {
TALLOC_FREE(frame);
return False;
}
/* the 5th and 8th must be integer */
if (!isdigit((int)*tok[4]) || !isdigit((int)*tok[7])) {
TALLOC_FREE(frame);
return False;
}
/* if the fname contains a space then use STDIN */
if (strchr_m(tok[6],' ')) {
tok[6] = talloc_strdup(frame, "STDIN");
if (!tok[6]) {
TALLOC_FREE(frame);
return false;
}
}
/* only take the last part of the filename */
{
fstring tmp;
char *p = strrchr_m(tok[6],'/');
if (p) {
size_t len = strlen(tok[6])+1;
fstrcpy(tmp,p+1);
strlcpy(tok[6],tmp, len);
}
}
buf->sysjob = atoi(tok[4]);
buf->size = atoi(tok[7]);
if (strchr_m(tok[7],'K')) {
buf->size *= 1024;
}
if (strchr_m(tok[7],'M')) {
buf->size *= 1024*1024;
}
buf->status = strequal(tok[0],"active")?LPQ_PRINTING:LPQ_QUEUED;
buf->priority = 0;
buf->time = time(NULL);
fstrcpy(buf->fs_user,tok[1]);
fstrcpy(buf->fs_file,tok[6]);
TALLOC_FREE(frame);
return True;
}
/*******************************************************************
parse lpq on an NT system
Windows 2000 LPD Server
Printer \\10.0.0.2\NP17PCL (Paused)
Owner Status Jobname Job-Id Size Pages Priority
----------------------------------------------------------------------------
root (9.99. Printing /usr/lib/rhs/rhs-pr 3 625 0 1
root (9.99. Paused /usr/lib/rhs/rhs-pr 4 625 0 1
jmcd Waiting Re: Samba Open Sour 26 32476 1 1
********************************************************************/
static bool parse_lpq_nt(char *line,print_queue_struct *buf,bool first)
{
#define LPRNT_OWNSIZ 11
#define LPRNT_STATSIZ 9
#define LPRNT_JOBSIZ 19
#define LPRNT_IDSIZ 6
#define LPRNT_SIZSIZ 9
typedef struct {
char owner[LPRNT_OWNSIZ];
char space1;
char status[LPRNT_STATSIZ];
char space2;
char jobname[LPRNT_JOBSIZ];
char space3;
char jobid[LPRNT_IDSIZ];
char space4;
char size[LPRNT_SIZSIZ];
char terminator;
} nt_lpq_line;
char parse_line_char[sizeof(nt_lpq_line)];
nt_lpq_line *parse_line = (nt_lpq_line *)parse_line_char;
#define LPRNT_PRINTING "Printing"
#define LPRNT_WAITING "Waiting"
#define LPRNT_PAUSED "Paused"
memset(parse_line_char, '\0', sizeof(parse_line_char));
strncpy(parse_line_char, line, sizeof(parse_line_char) -1);
if (strlen(parse_line_char) != sizeof(parse_line_char) - 1) {
return False;
}
/* Just want the first word in the owner field - the username */
if (strchr_m(parse_line->owner, ' ')) {
*(strchr_m(parse_line->owner, ' ')) = '\0';
} else {
parse_line->space1 = '\0';
}
/* Make sure we have an owner */
if (!strlen(parse_line->owner)) {
return False;
}
/* Make sure the status is valid */
parse_line->space2 = '\0';
trim_char(parse_line->status, '\0', ' ');
if (!strequal(parse_line->status, LPRNT_PRINTING) &&
!strequal(parse_line->status, LPRNT_PAUSED) &&
!strequal(parse_line->status, LPRNT_WAITING)) {
return False;
}
parse_line->space3 = '\0';
trim_char(parse_line->jobname, '\0', ' ');
buf->sysjob = atoi(parse_line->jobid);
buf->priority = 0;
buf->size = atoi(parse_line->size);
buf->time = time(NULL);
fstrcpy(buf->fs_user, parse_line->owner);
fstrcpy(buf->fs_file, parse_line->jobname);
if (strequal(parse_line->status, LPRNT_PRINTING)) {
buf->status = LPQ_PRINTING;
} else if (strequal(parse_line->status, LPRNT_PAUSED)) {
buf->status = LPQ_PAUSED;
} else {
buf->status = LPQ_QUEUED;
}
return True;
}
/*******************************************************************
parse lpq on an OS2 system
JobID File Name Rank Size Status Comment
----- --------------- ------ -------- ------------ ------------
3 Control 1 68 Queued root@psflinu
4 /etc/motd 2 11666 Queued root@psflinu
********************************************************************/
static bool parse_lpq_os2(char *line,print_queue_struct *buf,bool first)
{
#define LPROS2_IDSIZ 5
#define LPROS2_JOBSIZ 15
#define LPROS2_SIZSIZ 8
#define LPROS2_STATSIZ 12
#define LPROS2_OWNSIZ 12
typedef struct {
char jobid[LPROS2_IDSIZ];
char space1[2];
char jobname[LPROS2_JOBSIZ];
char space2[14];
char size[LPROS2_SIZSIZ];
char space3[4];
char status[LPROS2_STATSIZ];
char space4[4];
char owner[LPROS2_OWNSIZ];
char terminator;
} os2_lpq_line;
char parse_line_char[sizeof(os2_lpq_line)];
os2_lpq_line *parse_line = (os2_lpq_line *)parse_line_char;
#define LPROS2_PRINTING "Printing"
#define LPROS2_WAITING "Queued"
#define LPROS2_PAUSED "Paused"
memset(parse_line_char, '\0', sizeof(parse_line_char));
strncpy(parse_line_char, line, sizeof(parse_line_char) -1);
if (strlen(parse_line_char) != sizeof(parse_line_char) - 1) {
return False;
}
/* Get the jobid */
buf->sysjob = atoi(parse_line->jobid);
/* Get the job name */
parse_line->space2[0] = '\0';
trim_char(parse_line->jobname, '\0', ' ');
fstrcpy(buf->fs_file, parse_line->jobname);
buf->priority = 0;
buf->size = atoi(parse_line->size);
buf->time = time(NULL);
/* Make sure we have an owner */
if (!strlen(parse_line->owner)) {
return False;
}
/* Make sure we have a valid status */
parse_line->space4[0] = '\0';
trim_char(parse_line->status, '\0', ' ');
if (!strequal(parse_line->status, LPROS2_PRINTING) &&
!strequal(parse_line->status, LPROS2_PAUSED) &&
!strequal(parse_line->status, LPROS2_WAITING)) {
return False;
}
fstrcpy(buf->fs_user, parse_line->owner);
if (strequal(parse_line->status, LPROS2_PRINTING)) {
buf->status = LPQ_PRINTING;
} else if (strequal(parse_line->status, LPROS2_PAUSED)) {
buf->status = LPQ_PAUSED;
} else {
buf->status = LPQ_QUEUED;
}