8a16b7a18f
Mainly focus on files that use BSD 3-Clause license. The Software Package Data Exchange (SPDX) group provides a specification to make it easier for automated tools to detect and summarize well known opensource licenses. We are gradually adopting the specification, noting that the tags are considered only advisory and do not, in any way, superceed or replace the license texts. Special thanks to Wind River for providing access to "The Duke of Highlander" tool: an older (2014) run over FreeBSD tree was useful as a starting point.
366 lines
9.5 KiB
C
366 lines
9.5 KiB
C
/*-
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
*
|
|
* Copyright (c) 1989, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Tony Nardo of the Johns Hopkins University/Applied Physics Lab.
|
|
*
|
|
* 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. 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.
|
|
*/
|
|
|
|
#if 0
|
|
#ifndef lint
|
|
static char sccsid[] = "@(#)lprint.c 8.3 (Berkeley) 4/28/95";
|
|
#endif
|
|
#endif
|
|
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include <sys/types.h>
|
|
#include <sys/socket.h>
|
|
#include <sys/stat.h>
|
|
#include <sys/time.h>
|
|
#include <ctype.h>
|
|
#include <db.h>
|
|
#include <err.h>
|
|
#include <fcntl.h>
|
|
#include <langinfo.h>
|
|
#include <paths.h>
|
|
#include <pwd.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
#include <utmpx.h>
|
|
#include "finger.h"
|
|
#include "pathnames.h"
|
|
|
|
#define LINE_LEN 80
|
|
#define TAB_LEN 8 /* 8 spaces between tabs */
|
|
|
|
static int demi_print(char *, int);
|
|
static void lprint(PERSON *);
|
|
static void vputc(unsigned char);
|
|
|
|
void
|
|
lflag_print(void)
|
|
{
|
|
PERSON *pn;
|
|
int sflag, r;
|
|
PERSON *tmp;
|
|
DBT data, key;
|
|
|
|
for (sflag = R_FIRST;; sflag = R_NEXT) {
|
|
r = (*db->seq)(db, &key, &data, sflag);
|
|
if (r == -1)
|
|
err(1, "db seq");
|
|
if (r == 1)
|
|
break;
|
|
memmove(&tmp, data.data, sizeof tmp);
|
|
pn = tmp;
|
|
if (sflag != R_FIRST)
|
|
putchar('\n');
|
|
lprint(pn);
|
|
if (!pplan) {
|
|
(void)show_text(pn->dir,
|
|
_PATH_FORWARD, "Mail forwarded to");
|
|
(void)show_text(pn->dir, _PATH_PROJECT, "Project");
|
|
if (!show_text(pn->dir, _PATH_PLAN, "Plan"))
|
|
(void)printf("No Plan.\n");
|
|
(void)show_text(pn->dir,
|
|
_PATH_PUBKEY, "Public key");
|
|
}
|
|
}
|
|
}
|
|
|
|
static void
|
|
lprint(PERSON *pn)
|
|
{
|
|
struct tm *delta;
|
|
WHERE *w;
|
|
int cpr, len, maxlen;
|
|
struct tm *tp;
|
|
int oddfield;
|
|
char t[80];
|
|
|
|
if (d_first < 0)
|
|
d_first = (*nl_langinfo(D_MD_ORDER) == 'd');
|
|
/*
|
|
* long format --
|
|
* login name
|
|
* real name
|
|
* home directory
|
|
* shell
|
|
* office, office phone, home phone if available
|
|
* mail status
|
|
*/
|
|
(void)printf("Login: %-15s\t\t\tName: %s\nDirectory: %-25s",
|
|
pn->name, pn->realname, pn->dir);
|
|
(void)printf("\tShell: %-s\n", *pn->shell ? pn->shell : _PATH_BSHELL);
|
|
|
|
if (gflag)
|
|
goto no_gecos;
|
|
/*
|
|
* try and print office, office phone, and home phone on one line;
|
|
* if that fails, do line filling so it looks nice.
|
|
*/
|
|
#define OFFICE_TAG "Office"
|
|
#define OFFICE_PHONE_TAG "Office Phone"
|
|
oddfield = 0;
|
|
if (pn->office && pn->officephone &&
|
|
strlen(pn->office) + strlen(pn->officephone) +
|
|
sizeof(OFFICE_TAG) + 2 <= 5 * TAB_LEN) {
|
|
(void)snprintf(tbuf, sizeof(tbuf), "%s: %s, %s",
|
|
OFFICE_TAG, pn->office, prphone(pn->officephone));
|
|
oddfield = demi_print(tbuf, oddfield);
|
|
} else {
|
|
if (pn->office) {
|
|
(void)snprintf(tbuf, sizeof(tbuf), "%s: %s",
|
|
OFFICE_TAG, pn->office);
|
|
oddfield = demi_print(tbuf, oddfield);
|
|
}
|
|
if (pn->officephone) {
|
|
(void)snprintf(tbuf, sizeof(tbuf), "%s: %s",
|
|
OFFICE_PHONE_TAG, prphone(pn->officephone));
|
|
oddfield = demi_print(tbuf, oddfield);
|
|
}
|
|
}
|
|
if (pn->homephone) {
|
|
(void)snprintf(tbuf, sizeof(tbuf), "%s: %s", "Home Phone",
|
|
prphone(pn->homephone));
|
|
oddfield = demi_print(tbuf, oddfield);
|
|
}
|
|
if (oddfield)
|
|
putchar('\n');
|
|
|
|
no_gecos:
|
|
/*
|
|
* long format con't:
|
|
* if logged in
|
|
* terminal
|
|
* idle time
|
|
* if messages allowed
|
|
* where logged in from
|
|
* if not logged in
|
|
* when last logged in
|
|
*/
|
|
/* find out longest device name for this user for formatting */
|
|
for (w = pn->whead, maxlen = -1; w != NULL; w = w->next)
|
|
if ((len = strlen(w->tty)) > maxlen)
|
|
maxlen = len;
|
|
/* find rest of entries for user */
|
|
for (w = pn->whead; w != NULL; w = w->next) {
|
|
if (w->info == LOGGEDIN) {
|
|
tp = localtime(&w->loginat);
|
|
strftime(t, sizeof(t),
|
|
d_first ? "%a %e %b %R (%Z)" : "%a %b %e %R (%Z)",
|
|
tp);
|
|
cpr = printf("On since %s on %s", t, w->tty);
|
|
/*
|
|
* idle time is tough; if have one, print a comma,
|
|
* then spaces to pad out the device name, then the
|
|
* idle time. Follow with a comma if a remote login.
|
|
*/
|
|
delta = gmtime(&w->idletime);
|
|
if (w->idletime != -1 && (delta->tm_yday ||
|
|
delta->tm_hour || delta->tm_min)) {
|
|
cpr += printf("%-*s idle ",
|
|
maxlen - (int)strlen(w->tty) + 1, ",");
|
|
if (delta->tm_yday > 0) {
|
|
cpr += printf("%d day%s ",
|
|
delta->tm_yday,
|
|
delta->tm_yday == 1 ? "" : "s");
|
|
}
|
|
cpr += printf("%d:%02d",
|
|
delta->tm_hour, delta->tm_min);
|
|
if (*w->host) {
|
|
putchar(',');
|
|
++cpr;
|
|
}
|
|
}
|
|
if (!w->writable)
|
|
cpr += printf(" (messages off)");
|
|
} else if (w->loginat == 0) {
|
|
cpr = printf("Never logged in.");
|
|
} else {
|
|
tp = localtime(&w->loginat);
|
|
if (now - w->loginat > 86400 * 365 / 2) {
|
|
strftime(t, sizeof(t),
|
|
d_first ? "%a %e %b %R %Y (%Z)" :
|
|
"%a %b %e %R %Y (%Z)",
|
|
tp);
|
|
} else {
|
|
strftime(t, sizeof(t),
|
|
d_first ? "%a %e %b %R (%Z)" :
|
|
"%a %b %e %R (%Z)",
|
|
tp);
|
|
}
|
|
cpr = printf("Last login %s on %s", t, w->tty);
|
|
}
|
|
if (*w->host) {
|
|
if (LINE_LEN < (cpr + 6 + strlen(w->host)))
|
|
(void)printf("\n ");
|
|
(void)printf(" from %s", w->host);
|
|
}
|
|
putchar('\n');
|
|
}
|
|
if (pn->mailrecv == -1)
|
|
printf("No Mail.\n");
|
|
else if (pn->mailrecv > pn->mailread) {
|
|
tp = localtime(&pn->mailrecv);
|
|
strftime(t, sizeof(t),
|
|
d_first ? "%a %e %b %R %Y (%Z)" :
|
|
"%a %b %e %R %Y (%Z)",
|
|
tp);
|
|
printf("New mail received %s\n", t);
|
|
tp = localtime(&pn->mailread);
|
|
strftime(t, sizeof(t),
|
|
d_first ? "%a %e %b %R %Y (%Z)" :
|
|
"%a %b %e %R %Y (%Z)",
|
|
tp);
|
|
printf(" Unread since %s\n", t);
|
|
} else {
|
|
tp = localtime(&pn->mailread);
|
|
strftime(t, sizeof(t),
|
|
d_first ? "%a %e %b %R %Y (%Z)" :
|
|
"%a %b %e %R %Y (%Z)",
|
|
tp);
|
|
printf("Mail last read %s\n", t);
|
|
}
|
|
}
|
|
|
|
static int
|
|
demi_print(char *str, int oddfield)
|
|
{
|
|
static int lenlast;
|
|
int lenthis, maxlen;
|
|
|
|
lenthis = strlen(str);
|
|
if (oddfield) {
|
|
/*
|
|
* We left off on an odd number of fields. If we haven't
|
|
* crossed the midpoint of the screen, and we have room for
|
|
* the next field, print it on the same line; otherwise,
|
|
* print it on a new line.
|
|
*
|
|
* Note: we insist on having the right hand fields start
|
|
* no less than 5 tabs out.
|
|
*/
|
|
maxlen = 5 * TAB_LEN;
|
|
if (maxlen < lenlast)
|
|
maxlen = lenlast;
|
|
if (((((maxlen / TAB_LEN) + 1) * TAB_LEN) +
|
|
lenthis) <= LINE_LEN) {
|
|
while(lenlast < (4 * TAB_LEN)) {
|
|
putchar('\t');
|
|
lenlast += TAB_LEN;
|
|
}
|
|
(void)printf("\t%s\n", str); /* force one tab */
|
|
} else {
|
|
(void)printf("\n%s", str); /* go to next line */
|
|
oddfield = !oddfield; /* this'll be undone below */
|
|
}
|
|
} else
|
|
(void)printf("%s", str);
|
|
oddfield = !oddfield; /* toggle odd/even marker */
|
|
lenlast = lenthis;
|
|
return(oddfield);
|
|
}
|
|
|
|
int
|
|
show_text(const char *directory, const char *file_name, const char *header)
|
|
{
|
|
struct stat sb;
|
|
FILE *fp;
|
|
int ch, cnt;
|
|
char *p, lastc;
|
|
int fd, nr;
|
|
|
|
lastc = '\0';
|
|
|
|
(void)snprintf(tbuf, sizeof(tbuf), "%s/%s", directory, file_name);
|
|
if ((fd = open(tbuf, O_RDONLY)) < 0 || fstat(fd, &sb) ||
|
|
sb.st_size == 0)
|
|
return(0);
|
|
|
|
/* If short enough, and no newlines, show it on a single line.*/
|
|
if (sb.st_size <= (off_t)(LINE_LEN - strlen(header) - 5)) {
|
|
nr = read(fd, tbuf, sizeof(tbuf));
|
|
if (nr <= 0) {
|
|
(void)close(fd);
|
|
return(0);
|
|
}
|
|
for (p = tbuf, cnt = nr; cnt--; ++p)
|
|
if (*p == '\n')
|
|
break;
|
|
if (cnt <= 1) {
|
|
if (*header != '\0')
|
|
(void)printf("%s: ", header);
|
|
for (p = tbuf, cnt = nr; cnt--; ++p)
|
|
if (*p != '\r')
|
|
vputc(lastc = *p);
|
|
if (lastc != '\n')
|
|
(void)putchar('\n');
|
|
(void)close(fd);
|
|
return(1);
|
|
}
|
|
else
|
|
(void)lseek(fd, 0L, SEEK_SET);
|
|
}
|
|
if ((fp = fdopen(fd, "r")) == NULL)
|
|
return(0);
|
|
if (*header != '\0')
|
|
(void)printf("%s:\n", header);
|
|
while ((ch = getc(fp)) != EOF)
|
|
if (ch != '\r')
|
|
vputc(lastc = ch);
|
|
if (lastc != '\n')
|
|
(void)putchar('\n');
|
|
(void)fclose(fp);
|
|
return(1);
|
|
}
|
|
|
|
static void
|
|
vputc(unsigned char ch)
|
|
{
|
|
int meta;
|
|
|
|
if (!isprint(ch) && !isascii(ch)) {
|
|
(void)putchar('M');
|
|
(void)putchar('-');
|
|
ch = toascii(ch);
|
|
meta = 1;
|
|
} else
|
|
meta = 0;
|
|
if (isprint(ch) || (!meta && (ch == ' ' || ch == '\t' || ch == '\n')))
|
|
(void)putchar(ch);
|
|
else {
|
|
(void)putchar('^');
|
|
(void)putchar(ch == '\177' ? '?' : ch | 0100);
|
|
}
|
|
}
|