bf21e6b4e0
- Get rid of a lot of the static variables which were shared by many routines and programs in the suite. - Create an abstract interface to the printcap database, so that other retrieval and iteration mechanisms could be developed (e.g., YP, Hesiod, or automatic retrieval from a trusted server). - Give each capability a human-readable name in addition to the historic two-character one. - Otherwise generally clean up a lot of dark corners. Many still remain. - When submitting jobs, use the official login name record (from getlogin()) if there is one, rather than reverse-mapping the uid. More to come...
400 lines
9.7 KiB
C
400 lines
9.7 KiB
C
/*
|
|
* Copyright (c) 1983, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)rmjob.c 8.2 (Berkeley) 4/28/95";
|
|
#endif
|
|
static const char rcsid[] =
|
|
"$Id: rmjob.c,v 1.10 1997/10/14 16:00:37 joerg Exp $";
|
|
#endif /* not lint */
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/uio.h>
|
|
|
|
#include <ctype.h>
|
|
#include <dirent.h>
|
|
#include <errno.h>
|
|
#include <signal.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#define psignal foil_gcc_psignal
|
|
#define sys_siglist foil_gcc_siglist
|
|
#include <unistd.h>
|
|
#undef psignal
|
|
#undef sys_siglist
|
|
|
|
#include "lp.h"
|
|
#include "lp.local.h"
|
|
#include "pathnames.h"
|
|
|
|
/*
|
|
* rmjob - remove the specified jobs from the queue.
|
|
*/
|
|
|
|
/*
|
|
* Stuff for handling lprm specifications
|
|
*/
|
|
static char root[] = "root";
|
|
static int all = 0; /* eliminate all files (root only) */
|
|
static int cur_daemon; /* daemon's pid */
|
|
static char current[40]; /* active control file name */
|
|
|
|
extern uid_t uid, euid; /* real and effective user id's */
|
|
|
|
static void alarmhandler __P((int));
|
|
static void do_unlink __P((char *));
|
|
|
|
void
|
|
rmjob(printer)
|
|
const char *printer;
|
|
{
|
|
register int i, nitems;
|
|
int assasinated = 0;
|
|
struct dirent **files;
|
|
char *cp;
|
|
struct printer myprinter, *pp = &myprinter;
|
|
|
|
init_printer(pp);
|
|
if ((i = getprintcap(printer, pp)) < 0)
|
|
fatal(pp, "getprintcap: %s", pcaperr(i));
|
|
if ((cp = checkremote(pp))) {
|
|
printf("Warning: %s\n", cp);
|
|
free(cp);
|
|
}
|
|
|
|
/*
|
|
* If the format was `lprm -' and the user isn't the super-user,
|
|
* then fake things to look like he said `lprm user'.
|
|
*/
|
|
if (users < 0) {
|
|
if (getuid() == 0)
|
|
all = 1; /* all files in local queue */
|
|
else {
|
|
user[0] = person;
|
|
users = 1;
|
|
}
|
|
}
|
|
if (!strcmp(person, "-all")) {
|
|
if (from == host)
|
|
fatal(pp, "The login name \"-all\" is reserved");
|
|
all = 1; /* all those from 'from' */
|
|
person = root;
|
|
}
|
|
|
|
seteuid(euid);
|
|
if (chdir(pp->spool_dir) < 0)
|
|
fatal(pp, "cannot chdir to spool directory");
|
|
if ((nitems = scandir(".", &files, iscf, NULL)) < 0)
|
|
fatal(pp, "cannot access spool directory");
|
|
seteuid(uid);
|
|
|
|
if (nitems) {
|
|
/*
|
|
* Check for an active printer daemon (in which case we
|
|
* kill it if it is reading our file) then remove stuff
|
|
* (after which we have to restart the daemon).
|
|
*/
|
|
if (lockchk(pp, pp->lock_file) && chk(current)) {
|
|
seteuid(euid);
|
|
assasinated = kill(cur_daemon, SIGINT) == 0;
|
|
seteuid(uid);
|
|
if (!assasinated)
|
|
fatal(pp, "cannot kill printer daemon");
|
|
}
|
|
/*
|
|
* process the files
|
|
*/
|
|
for (i = 0; i < nitems; i++)
|
|
process(pp, files[i]->d_name);
|
|
}
|
|
rmremote(pp);
|
|
/*
|
|
* Restart the printer daemon if it was killed
|
|
*/
|
|
if (assasinated && !startdaemon(pp))
|
|
fatal(pp, "cannot restart printer daemon\n");
|
|
exit(0);
|
|
}
|
|
|
|
/*
|
|
* Process a lock file: collect the pid of the active
|
|
* daemon and the file name of the active spool entry.
|
|
* Return boolean indicating existence of a lock file.
|
|
*/
|
|
int
|
|
lockchk(pp, s)
|
|
struct printer *pp;
|
|
char *s;
|
|
{
|
|
register FILE *fp;
|
|
register int i, n;
|
|
|
|
seteuid(euid);
|
|
if ((fp = fopen(s, "r")) == NULL) {
|
|
if (errno == EACCES)
|
|
fatal(pp, "%s: %s", s, strerror(errno));
|
|
else
|
|
return(0);
|
|
}
|
|
seteuid(uid);
|
|
if (!getline(fp)) {
|
|
(void) fclose(fp);
|
|
return(0); /* no daemon present */
|
|
}
|
|
cur_daemon = atoi(line);
|
|
if (kill(cur_daemon, 0) < 0 && errno != EPERM) {
|
|
(void) fclose(fp);
|
|
return(0); /* no daemon present */
|
|
}
|
|
for (i = 1; (n = fread(current, sizeof(char), sizeof(current), fp)) <= 0; i++) {
|
|
if (i > 5) {
|
|
n = 1;
|
|
break;
|
|
}
|
|
sleep(i);
|
|
}
|
|
current[n-1] = '\0';
|
|
(void) fclose(fp);
|
|
return(1);
|
|
}
|
|
|
|
/*
|
|
* Process a control file.
|
|
*/
|
|
void
|
|
process(pp, file)
|
|
const struct printer *pp;
|
|
char *file;
|
|
{
|
|
FILE *cfp;
|
|
|
|
if (!chk(file))
|
|
return;
|
|
seteuid(euid);
|
|
if ((cfp = fopen(file, "r")) == NULL)
|
|
fatal(pp, "cannot open %s", file);
|
|
seteuid(uid);
|
|
while (getline(cfp)) {
|
|
switch (line[0]) {
|
|
case 'U': /* unlink associated files */
|
|
if (strchr(line+1, '/') || strncmp(line+1, "df", 2))
|
|
break;
|
|
if (from != host)
|
|
printf("%s: ", host);
|
|
do_unlink(line+1);
|
|
}
|
|
}
|
|
(void) fclose(cfp);
|
|
do_unlink(file);
|
|
}
|
|
|
|
static void
|
|
do_unlink(file)
|
|
char *file;
|
|
{
|
|
int ret;
|
|
|
|
if (from != host)
|
|
printf("%s: ", host);
|
|
seteuid(euid);
|
|
ret = unlink(file);
|
|
seteuid(uid);
|
|
printf(ret ? "cannot dequeue %s\n" : "%s dequeued\n", file);
|
|
}
|
|
|
|
/*
|
|
* Do the dirty work in checking
|
|
*/
|
|
int
|
|
chk(file)
|
|
char *file;
|
|
{
|
|
register int *r, n;
|
|
register char **u, *cp;
|
|
FILE *cfp;
|
|
|
|
/*
|
|
* Check for valid cf file name (mostly checking current).
|
|
*/
|
|
if (strlen(file) < 7 || file[0] != 'c' || file[1] != 'f')
|
|
return(0);
|
|
|
|
if (all && (from == host || !strcmp(from, file+6)))
|
|
return(1);
|
|
|
|
/*
|
|
* get the owner's name from the control file.
|
|
*/
|
|
seteuid(euid);
|
|
if ((cfp = fopen(file, "r")) == NULL)
|
|
return(0);
|
|
seteuid(uid);
|
|
while (getline(cfp)) {
|
|
if (line[0] == 'P')
|
|
break;
|
|
}
|
|
(void) fclose(cfp);
|
|
if (line[0] != 'P')
|
|
return(0);
|
|
|
|
if (users == 0 && requests == 0)
|
|
return(!strcmp(file, current) && isowner(line+1, file));
|
|
/*
|
|
* Check the request list
|
|
*/
|
|
for (n = 0, cp = file+3; isdigit(*cp); )
|
|
n = n * 10 + (*cp++ - '0');
|
|
for (r = requ; r < &requ[requests]; r++)
|
|
if (*r == n && isowner(line+1, file))
|
|
return(1);
|
|
/*
|
|
* Check to see if it's in the user list
|
|
*/
|
|
for (u = user; u < &user[users]; u++)
|
|
if (!strcmp(*u, line+1) && isowner(line+1, file))
|
|
return(1);
|
|
return(0);
|
|
}
|
|
|
|
/*
|
|
* If root is removing a file on the local machine, allow it.
|
|
* If root is removing a file from a remote machine, only allow
|
|
* files sent from the remote machine to be removed.
|
|
* Normal users can only remove the file from where it was sent.
|
|
*/
|
|
int
|
|
isowner(owner, file)
|
|
char *owner, *file;
|
|
{
|
|
if (!strcmp(person, root) && (from == host || !strcmp(from, file+6)))
|
|
return(1);
|
|
if (!strcmp(person, owner) && !strcmp(from, file+6))
|
|
return(1);
|
|
if (from != host)
|
|
printf("%s: ", host);
|
|
printf("%s: Permission denied\n", file);
|
|
return(0);
|
|
}
|
|
|
|
/*
|
|
* Check to see if we are sending files to a remote machine. If we are,
|
|
* then try removing files on the remote machine.
|
|
*/
|
|
void
|
|
rmremote(pp)
|
|
const struct printer *pp;
|
|
{
|
|
int i, rem, niov, totlen;
|
|
char buf[BUFSIZ];
|
|
void (*savealrm)(int);
|
|
struct iovec *iov;
|
|
|
|
if (!pp->remote)
|
|
return; /* not sending to a remote machine */
|
|
|
|
/*
|
|
* Flush stdout so the user can see what has been deleted
|
|
* while we wait (possibly) for the connection.
|
|
*/
|
|
fflush(stdout);
|
|
|
|
/*
|
|
* Counting:
|
|
* 4 == "\5" + remote_queue + " " + person
|
|
* 2 * users == " " + user[i] for each user
|
|
* requests == asprintf results for each request
|
|
* 1 == "\n"
|
|
* Although laborious, doing it this way makes it possible for
|
|
* us to process requests of indeterminate length without
|
|
* applying an arbitrary limit. Arbitrary Limits Are Bad (tm).
|
|
*/
|
|
niov = 4 + 2 * users + requests + 1;
|
|
iov = malloc(niov * sizeof *iov);
|
|
if (iov == 0)
|
|
fatal(pp, "out of memory");
|
|
iov[0].iov_base = "\5";
|
|
iov[1].iov_base = pp->remote_queue;
|
|
iov[2].iov_base = " ";
|
|
iov[3].iov_base = all ? "-all" : person;
|
|
for (i = 0; i < users; i++) {
|
|
iov[4 + 2 * i].iov_base = " ";
|
|
iov[4 + 2 * i + 1].iov_base = user[i];
|
|
}
|
|
for (i = 0; i < requests; i++) {
|
|
asprintf(&iov[4 + 2 * users + i].iov_base, " %d", requ[i]);
|
|
if (iov[4 + 2 * users + i].iov_base == 0)
|
|
fatal(pp, "out of memory");
|
|
}
|
|
iov[4 + 2 * users + requests].iov_base = "\n";
|
|
for (totlen = i = 0; i < niov; i++)
|
|
totlen += (iov[i].iov_len = strlen(iov[i].iov_base));
|
|
|
|
savealrm = signal(SIGALRM, alarmhandler);
|
|
alarm(pp->conn_timeout);
|
|
rem = getport(pp, pp->remote_host, 0);
|
|
(void)signal(SIGALRM, savealrm);
|
|
if (rem < 0) {
|
|
if (from != host)
|
|
printf("%s: ", host);
|
|
printf("connection to %s is down\n", pp->remote_host);
|
|
} else {
|
|
if (writev(rem, iov, niov) != totlen)
|
|
fatal(pp, "Lost connection");
|
|
while ((i = read(rem, buf, sizeof(buf))) > 0)
|
|
(void) fwrite(buf, 1, i, stdout);
|
|
(void) close(rem);
|
|
}
|
|
for (i = 0; i < requests; i++)
|
|
free(iov[4 + 2 * users + i].iov_base);
|
|
free(iov);
|
|
}
|
|
|
|
/*
|
|
* Return 1 if the filename begins with 'cf'
|
|
*/
|
|
int
|
|
iscf(d)
|
|
struct dirent *d;
|
|
{
|
|
return(d->d_name[0] == 'c' && d->d_name[1] == 'f');
|
|
}
|
|
|
|
void
|
|
alarmhandler(signo)
|
|
int signo;
|
|
{
|
|
/* ignored */
|
|
}
|