displayq.c revision 1.17.4.2 1 1.17.4.2 he /* $NetBSD: displayq.c,v 1.17.4.2 2001/09/30 13:32:14 he Exp $ */
2 1.7 jtc
3 1.1 cgd /*
4 1.4 cgd * Copyright (c) 1983, 1993
5 1.4 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.12 mrg #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.10 mikel #if 0
39 1.11 mrg static char sccsid[] = "@(#)displayq.c 8.4 (Berkeley) 4/28/95";
40 1.10 mikel #else
41 1.17.4.2 he __RCSID("$NetBSD: displayq.c,v 1.17.4.2 2001/09/30 13:32:14 he Exp $");
42 1.10 mikel #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.4 cgd #include <sys/param.h>
46 1.4 cgd #include <sys/stat.h>
47 1.11 mrg #include <sys/file.h>
48 1.1 cgd
49 1.4 cgd #include <signal.h>
50 1.4 cgd #include <fcntl.h>
51 1.4 cgd #include <dirent.h>
52 1.4 cgd #include <unistd.h>
53 1.4 cgd #include <stdio.h>
54 1.4 cgd #include <stdlib.h>
55 1.4 cgd #include <string.h>
56 1.4 cgd #include <ctype.h>
57 1.1 cgd #include "lp.h"
58 1.4 cgd #include "lp.local.h"
59 1.1 cgd #include "pathnames.h"
60 1.1 cgd
61 1.4 cgd /*
62 1.4 cgd * Routines to display the state of the queue.
63 1.4 cgd */
64 1.1 cgd #define JOBCOL 40 /* column for job # in -l format */
65 1.1 cgd #define OWNCOL 7 /* start of Owner column in normal */
66 1.1 cgd #define SIZCOL 62 /* start of Size column in normal */
67 1.1 cgd
68 1.1 cgd /*
69 1.1 cgd * Stuff for handling job specifications
70 1.1 cgd */
71 1.1 cgd extern int requ[]; /* job number of spool entries */
72 1.1 cgd extern int requests; /* # of spool requests */
73 1.4 cgd extern char *user[]; /* users to process */
74 1.4 cgd extern int users; /* # of users in user array */
75 1.1 cgd
76 1.5 hpeyerl extern uid_t uid, euid;
77 1.5 hpeyerl
78 1.4 cgd static int col; /* column on screen */
79 1.17.4.2 he static char current[MAXPATHLEN]; /* current file being printed */
80 1.17.4.2 he static char file[MAXPATHLEN]; /* print file name */
81 1.4 cgd static int first; /* first file in ``files'' column? */
82 1.4 cgd static int garbage; /* # of garbage cf files */
83 1.4 cgd static int lflag; /* long output option */
84 1.4 cgd static int rank; /* order to be printed (-1=none, 0=active) */
85 1.4 cgd static long totsize; /* total print job size in bytes */
86 1.1 cgd
87 1.17.4.1 tv static const char head0[] = "Rank Owner Job Files";
88 1.17.4.1 tv static const char head1[] = "Total Size\n";
89 1.1 cgd
90 1.17 mrg static void alarmer __P((int));
91 1.17 mrg
92 1.17 mrg int wait_time = 300; /* time out after 5 minutes by default */
93 1.17 mrg
94 1.1 cgd /*
95 1.1 cgd * Display the current state of the queue. Format = 1 if long format.
96 1.1 cgd */
97 1.4 cgd void
98 1.1 cgd displayq(format)
99 1.1 cgd int format;
100 1.1 cgd {
101 1.12 mrg struct queue *q;
102 1.12 mrg int i, nitems, fd, ret;
103 1.17.4.2 he char *cp, *ecp;
104 1.1 cgd struct queue **queue;
105 1.1 cgd struct stat statb;
106 1.1 cgd FILE *fp;
107 1.1 cgd
108 1.1 cgd lflag = format;
109 1.1 cgd totsize = 0;
110 1.1 cgd rank = -1;
111 1.4 cgd if ((i = cgetent(&bp, printcapdb, printer)) == -2)
112 1.4 cgd fatal("can't open printer description file");
113 1.4 cgd else if (i == -1)
114 1.1 cgd fatal("unknown printer");
115 1.4 cgd else if (i == -3)
116 1.4 cgd fatal("potential reference loop detected in printcap file");
117 1.4 cgd if (cgetstr(bp, "lp", &LP) < 0)
118 1.1 cgd LP = _PATH_DEFDEVLP;
119 1.4 cgd if (cgetstr(bp, "rp", &RP) < 0)
120 1.1 cgd RP = DEFLP;
121 1.4 cgd if (cgetstr(bp, "sd", &SD) < 0)
122 1.1 cgd SD = _PATH_DEFSPOOL;
123 1.4 cgd if (cgetstr(bp,"lo", &LO) < 0)
124 1.1 cgd LO = DEFLOCK;
125 1.4 cgd if (cgetstr(bp, "st", &ST) < 0)
126 1.1 cgd ST = DEFSTAT;
127 1.4 cgd cgetstr(bp, "rm", &RM);
128 1.10 mikel if ((cp = checkremote()) != NULL)
129 1.1 cgd printf("Warning: %s\n", cp);
130 1.1 cgd
131 1.1 cgd /*
132 1.1 cgd * Print out local queue
133 1.1 cgd * Find all the control files in the spooling directory
134 1.1 cgd */
135 1.5 hpeyerl seteuid(euid);
136 1.1 cgd if (chdir(SD) < 0)
137 1.1 cgd fatal("cannot chdir to spooling directory");
138 1.5 hpeyerl seteuid(uid);
139 1.1 cgd if ((nitems = getq(&queue)) < 0)
140 1.1 cgd fatal("cannot examine spooling area\n");
141 1.5 hpeyerl seteuid(euid);
142 1.5 hpeyerl ret = stat(LO, &statb);
143 1.5 hpeyerl seteuid(uid);
144 1.5 hpeyerl if (ret >= 0) {
145 1.1 cgd if (statb.st_mode & 0100) {
146 1.11 mrg if (remote)
147 1.1 cgd printf("%s: ", host);
148 1.1 cgd printf("Warning: %s is down: ", printer);
149 1.5 hpeyerl seteuid(euid);
150 1.1 cgd fd = open(ST, O_RDONLY);
151 1.5 hpeyerl seteuid(uid);
152 1.1 cgd if (fd >= 0) {
153 1.8 mrg (void)flock(fd, LOCK_SH);
154 1.1 cgd while ((i = read(fd, line, sizeof(line))) > 0)
155 1.16 mrg (void)fwrite(line, 1, (size_t)i, stdout);
156 1.8 mrg (void)close(fd); /* unlocks as well */
157 1.1 cgd } else
158 1.1 cgd putchar('\n');
159 1.1 cgd }
160 1.1 cgd if (statb.st_mode & 010) {
161 1.11 mrg if (remote)
162 1.1 cgd printf("%s: ", host);
163 1.1 cgd printf("Warning: %s queue is turned off\n", printer);
164 1.1 cgd }
165 1.1 cgd }
166 1.1 cgd
167 1.1 cgd if (nitems) {
168 1.5 hpeyerl seteuid(euid);
169 1.1 cgd fp = fopen(LO, "r");
170 1.5 hpeyerl seteuid(uid);
171 1.1 cgd if (fp == NULL)
172 1.12 mrg nodaemon();
173 1.1 cgd else {
174 1.1 cgd /* get daemon pid */
175 1.1 cgd cp = current;
176 1.17.4.2 he ecp = cp + sizeof(current) - 1;
177 1.17.4.2 he while ((i = getc(fp)) != EOF && i != '\n') {
178 1.17.4.2 he if (cp < ecp)
179 1.17.4.2 he *cp++ = i;
180 1.17.4.2 he }
181 1.1 cgd *cp = '\0';
182 1.1 cgd i = atoi(current);
183 1.5 hpeyerl if (i <= 0) {
184 1.6 pk ret = -1;
185 1.6 pk } else {
186 1.5 hpeyerl seteuid(euid);
187 1.5 hpeyerl ret = kill(i, 0);
188 1.5 hpeyerl seteuid(uid);
189 1.5 hpeyerl }
190 1.5 hpeyerl if (ret < 0) {
191 1.12 mrg nodaemon();
192 1.6 pk } else {
193 1.1 cgd /* read current file name */
194 1.1 cgd cp = current;
195 1.17.4.2 he ecp = cp + sizeof(current) - 1;
196 1.17.4.2 he while ((i = getc(fp)) != EOF && i != '\n') {
197 1.17.4.2 he if (cp < ecp)
198 1.17.4.2 he *cp++ = i;
199 1.17.4.2 he }
200 1.1 cgd *cp = '\0';
201 1.1 cgd /*
202 1.1 cgd * Print the status file.
203 1.1 cgd */
204 1.11 mrg if (remote)
205 1.1 cgd printf("%s: ", host);
206 1.5 hpeyerl seteuid(euid);
207 1.1 cgd fd = open(ST, O_RDONLY);
208 1.5 hpeyerl seteuid(uid);
209 1.1 cgd if (fd >= 0) {
210 1.8 mrg (void)flock(fd, LOCK_SH);
211 1.1 cgd while ((i = read(fd, line, sizeof(line))) > 0)
212 1.16 mrg (void)fwrite(line, 1, (size_t)i, stdout);
213 1.8 mrg (void)close(fd); /* unlocks as well */
214 1.1 cgd } else
215 1.1 cgd putchar('\n');
216 1.1 cgd }
217 1.8 mrg (void)fclose(fp);
218 1.1 cgd }
219 1.1 cgd /*
220 1.1 cgd * Now, examine the control files and print out the jobs to
221 1.1 cgd * be done for each user.
222 1.1 cgd */
223 1.1 cgd if (!lflag)
224 1.1 cgd header();
225 1.1 cgd for (i = 0; i < nitems; i++) {
226 1.1 cgd q = queue[i];
227 1.1 cgd inform(q->q_name);
228 1.1 cgd free(q);
229 1.1 cgd }
230 1.1 cgd free(queue);
231 1.1 cgd }
232 1.11 mrg if (!remote) {
233 1.1 cgd if (nitems == 0)
234 1.1 cgd puts("no entries");
235 1.1 cgd return;
236 1.1 cgd }
237 1.1 cgd
238 1.1 cgd /*
239 1.1 cgd * Print foreign queue
240 1.1 cgd * Note that a file in transit may show up in either queue.
241 1.1 cgd */
242 1.1 cgd if (nitems)
243 1.1 cgd putchar('\n');
244 1.8 mrg (void)snprintf(line, sizeof(line), "%c%s", format + '\3', RP);
245 1.1 cgd cp = line;
246 1.12 mrg for (i = 0; i < requests && cp-line+10 < sizeof(line) - 1; i++) {
247 1.1 cgd cp += strlen(cp);
248 1.16 mrg (void)snprintf(cp, (size_t)(line - cp), " %d", requ[i]);
249 1.1 cgd }
250 1.12 mrg for (i = 0; i < users && cp - line + 1 + strlen(user[i]) <
251 1.12 mrg sizeof(line) - 1; i++) {
252 1.1 cgd cp += strlen(cp);
253 1.8 mrg if (cp - line > sizeof(line) - 1)
254 1.8 mrg break;
255 1.1 cgd *cp++ = ' ';
256 1.15 frueauf if (strlen(user[i]) < (sizeof(line) - (cp - line) - 1))
257 1.15 frueauf (void)strcpy(cp, user[i]);
258 1.14 frueauf else
259 1.15 frueauf (void)strncpy(cp, user[i],
260 1.15 frueauf (sizeof(line) - (cp - line) - 1));
261 1.1 cgd }
262 1.8 mrg (void)strncat(line, "\n", sizeof(line) - strlen(line) - 1);
263 1.11 mrg fd = getport(RM, 0);
264 1.1 cgd if (fd < 0) {
265 1.1 cgd if (from != host)
266 1.1 cgd printf("%s: ", host);
267 1.8 mrg (void)printf("connection to %s is down\n", RM);
268 1.1 cgd }
269 1.1 cgd else {
270 1.17 mrg struct sigaction osa, nsa;
271 1.17 mrg
272 1.1 cgd i = strlen(line);
273 1.16 mrg if (write(fd, line, (size_t)i) != i)
274 1.1 cgd fatal("Lost connection");
275 1.17 mrg nsa.sa_handler = alarmer;
276 1.17 mrg sigemptyset(&nsa.sa_mask);
277 1.17 mrg sigaddset(&nsa.sa_mask, SIGALRM);
278 1.17 mrg nsa.sa_flags = 0;
279 1.17 mrg (void)sigaction(SIGALRM, &nsa, &osa);
280 1.17 mrg alarm(wait_time);
281 1.17 mrg while ((i = read(fd, line, sizeof(line))) > 0) {
282 1.16 mrg (void)fwrite(line, 1, (size_t)i, stdout);
283 1.17 mrg alarm(wait_time);
284 1.17 mrg }
285 1.17 mrg alarm(0);
286 1.17 mrg (void)sigaction(SIGALRM, &osa, NULL);
287 1.8 mrg (void)close(fd);
288 1.1 cgd }
289 1.17 mrg }
290 1.17 mrg
291 1.17 mrg static void
292 1.17 mrg alarmer(s)
293 1.17 mrg int s;
294 1.17 mrg {
295 1.17 mrg /* nothing */
296 1.1 cgd }
297 1.1 cgd
298 1.1 cgd /*
299 1.1 cgd * Print a warning message if there is no daemon present.
300 1.1 cgd */
301 1.4 cgd void
302 1.12 mrg nodaemon()
303 1.1 cgd {
304 1.11 mrg if (remote)
305 1.1 cgd printf("\n%s: ", host);
306 1.1 cgd puts("Warning: no daemon present");
307 1.1 cgd current[0] = '\0';
308 1.1 cgd }
309 1.1 cgd
310 1.1 cgd /*
311 1.1 cgd * Print the header for the short listing format
312 1.1 cgd */
313 1.4 cgd void
314 1.1 cgd header()
315 1.1 cgd {
316 1.1 cgd printf(head0);
317 1.1 cgd col = strlen(head0)+1;
318 1.1 cgd blankfill(SIZCOL);
319 1.1 cgd printf(head1);
320 1.1 cgd }
321 1.1 cgd
322 1.4 cgd void
323 1.1 cgd inform(cf)
324 1.1 cgd char *cf;
325 1.1 cgd {
326 1.12 mrg int j;
327 1.1 cgd FILE *cfp;
328 1.1 cgd
329 1.1 cgd /*
330 1.1 cgd * There's a chance the control file has gone away
331 1.1 cgd * in the meantime; if this is the case just keep going
332 1.1 cgd */
333 1.5 hpeyerl seteuid(euid);
334 1.1 cgd if ((cfp = fopen(cf, "r")) == NULL)
335 1.1 cgd return;
336 1.5 hpeyerl seteuid(uid);
337 1.1 cgd
338 1.1 cgd if (rank < 0)
339 1.1 cgd rank = 0;
340 1.11 mrg if (remote || garbage || strcmp(cf, current))
341 1.1 cgd rank++;
342 1.1 cgd j = 0;
343 1.1 cgd while (getline(cfp)) {
344 1.1 cgd switch (line[0]) {
345 1.1 cgd case 'P': /* Was this file specified in the user's list? */
346 1.1 cgd if (!inlist(line+1, cf)) {
347 1.1 cgd fclose(cfp);
348 1.1 cgd return;
349 1.1 cgd }
350 1.1 cgd if (lflag) {
351 1.1 cgd printf("\n%s: ", line+1);
352 1.1 cgd col = strlen(line+1) + 2;
353 1.1 cgd prank(rank);
354 1.1 cgd blankfill(JOBCOL);
355 1.1 cgd printf(" [job %s]\n", cf+3);
356 1.1 cgd } else {
357 1.1 cgd col = 0;
358 1.1 cgd prank(rank);
359 1.1 cgd blankfill(OWNCOL);
360 1.1 cgd printf("%-10s %-3d ", line+1, atoi(cf+3));
361 1.1 cgd col += 16;
362 1.1 cgd first = 1;
363 1.1 cgd }
364 1.1 cgd continue;
365 1.1 cgd default: /* some format specifer and file name? */
366 1.1 cgd if (line[0] < 'a' || line[0] > 'z')
367 1.1 cgd continue;
368 1.12 mrg if (j == 0 || strcmp(file, line+1) != 0) {
369 1.8 mrg (void)strncpy(file, line+1, sizeof(file) - 1);
370 1.12 mrg file[sizeof(file) - 1] = '\0';
371 1.12 mrg }
372 1.1 cgd j++;
373 1.1 cgd continue;
374 1.1 cgd case 'N':
375 1.1 cgd show(line+1, file, j);
376 1.1 cgd file[0] = '\0';
377 1.1 cgd j = 0;
378 1.1 cgd }
379 1.1 cgd }
380 1.1 cgd fclose(cfp);
381 1.1 cgd if (!lflag) {
382 1.1 cgd blankfill(SIZCOL);
383 1.1 cgd printf("%ld bytes\n", totsize);
384 1.1 cgd totsize = 0;
385 1.1 cgd }
386 1.1 cgd }
387 1.1 cgd
388 1.4 cgd int
389 1.1 cgd inlist(name, file)
390 1.1 cgd char *name, *file;
391 1.1 cgd {
392 1.12 mrg int *r, n;
393 1.12 mrg char **u, *cp;
394 1.1 cgd
395 1.1 cgd if (users == 0 && requests == 0)
396 1.1 cgd return(1);
397 1.1 cgd /*
398 1.1 cgd * Check to see if it's in the user list
399 1.1 cgd */
400 1.1 cgd for (u = user; u < &user[users]; u++)
401 1.1 cgd if (!strcmp(*u, name))
402 1.1 cgd return(1);
403 1.1 cgd /*
404 1.1 cgd * Check the request list
405 1.1 cgd */
406 1.1 cgd for (n = 0, cp = file+3; isdigit(*cp); )
407 1.1 cgd n = n * 10 + (*cp++ - '0');
408 1.1 cgd for (r = requ; r < &requ[requests]; r++)
409 1.1 cgd if (*r == n && !strcmp(cp, from))
410 1.1 cgd return(1);
411 1.1 cgd return(0);
412 1.1 cgd }
413 1.1 cgd
414 1.4 cgd void
415 1.1 cgd show(nfile, file, copies)
416 1.12 mrg char *nfile, *file;
417 1.4 cgd int copies;
418 1.1 cgd {
419 1.1 cgd if (strcmp(nfile, " ") == 0)
420 1.1 cgd nfile = "(standard input)";
421 1.1 cgd if (lflag)
422 1.1 cgd ldump(nfile, file, copies);
423 1.1 cgd else
424 1.1 cgd dump(nfile, file, copies);
425 1.1 cgd }
426 1.1 cgd
427 1.1 cgd /*
428 1.1 cgd * Fill the line with blanks to the specified column
429 1.1 cgd */
430 1.4 cgd void
431 1.1 cgd blankfill(n)
432 1.12 mrg int n;
433 1.1 cgd {
434 1.1 cgd while (col++ < n)
435 1.1 cgd putchar(' ');
436 1.1 cgd }
437 1.1 cgd
438 1.1 cgd /*
439 1.1 cgd * Give the abbreviated dump of the file names
440 1.1 cgd */
441 1.4 cgd void
442 1.1 cgd dump(nfile, file, copies)
443 1.1 cgd char *nfile, *file;
444 1.4 cgd int copies;
445 1.1 cgd {
446 1.12 mrg short n, fill;
447 1.1 cgd struct stat lbuf;
448 1.1 cgd
449 1.1 cgd /*
450 1.1 cgd * Print as many files as will fit
451 1.1 cgd * (leaving room for the total size)
452 1.1 cgd */
453 1.1 cgd fill = first ? 0 : 2; /* fill space for ``, '' */
454 1.1 cgd if (((n = strlen(nfile)) + col + fill) >= SIZCOL-4) {
455 1.1 cgd if (col < SIZCOL) {
456 1.1 cgd printf(" ..."), col += 4;
457 1.1 cgd blankfill(SIZCOL);
458 1.1 cgd }
459 1.1 cgd } else {
460 1.1 cgd if (first)
461 1.1 cgd first = 0;
462 1.1 cgd else
463 1.1 cgd printf(", ");
464 1.1 cgd printf("%s", nfile);
465 1.1 cgd col += n+fill;
466 1.1 cgd }
467 1.5 hpeyerl seteuid(euid);
468 1.1 cgd if (*file && !stat(file, &lbuf))
469 1.16 mrg totsize += copies * (long)lbuf.st_size;
470 1.5 hpeyerl seteuid(uid);
471 1.1 cgd }
472 1.1 cgd
473 1.1 cgd /*
474 1.1 cgd * Print the long info about the file
475 1.1 cgd */
476 1.4 cgd void
477 1.1 cgd ldump(nfile, file, copies)
478 1.1 cgd char *nfile, *file;
479 1.4 cgd int copies;
480 1.1 cgd {
481 1.1 cgd struct stat lbuf;
482 1.1 cgd
483 1.1 cgd putchar('\t');
484 1.1 cgd if (copies > 1)
485 1.1 cgd printf("%-2d copies of %-19s", copies, nfile);
486 1.1 cgd else
487 1.1 cgd printf("%-32s", nfile);
488 1.1 cgd if (*file && !stat(file, &lbuf))
489 1.13 mrg printf(" %qd bytes", (long long)lbuf.st_size);
490 1.1 cgd else
491 1.1 cgd printf(" ??? bytes");
492 1.1 cgd putchar('\n');
493 1.1 cgd }
494 1.1 cgd
495 1.1 cgd /*
496 1.1 cgd * Print the job's rank in the queue,
497 1.1 cgd * update col for screen management
498 1.1 cgd */
499 1.4 cgd void
500 1.1 cgd prank(n)
501 1.4 cgd int n;
502 1.1 cgd {
503 1.4 cgd char rline[100];
504 1.1 cgd static char *r[] = {
505 1.1 cgd "th", "st", "nd", "rd", "th", "th", "th", "th", "th", "th"
506 1.1 cgd };
507 1.1 cgd
508 1.1 cgd if (n == 0) {
509 1.1 cgd printf("active");
510 1.1 cgd col += 6;
511 1.1 cgd return;
512 1.1 cgd }
513 1.1 cgd if ((n/10)%10 == 1)
514 1.4 cgd (void)snprintf(rline, sizeof(rline), "%dth", n);
515 1.1 cgd else
516 1.4 cgd (void)snprintf(rline, sizeof(rline), "%d%s", n, r[n%10]);
517 1.4 cgd col += strlen(rline);
518 1.4 cgd printf("%s", rline);
519 1.1 cgd }
520