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
|
/*
* Copyright (c) 1983 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.
*/
/*
* From: @(#)announce.c 5.9 (Berkeley) 2/26/91
*/
char ann_rcsid[] =
"$Id: announce.c,v 1.4 1996/12/29 17:13:53 dholland Exp $";
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/time.h>
#include <sys/wait.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <errno.h>
#include <syslog.h>
#include <unistd.h>
#include <stdio.h>
#include <string.h>
#include <paths.h>
#include "mytalkd.h"
#include "proto.h"
static int announce_proc(CTL_MSG *request, const char *remote_machine);
static void print_mesg(FILE *tf, CTL_MSG *request, const char *remote_machine);
extern char hostname[];
/*
* Announce an invitation to talk.
*
* Because the tty driver insists on attaching a terminal-less
* process to any terminal that it writes on, we must fork a child
* to protect ourselves
*/
int
announce(CTL_MSG *request, const char *remote_machine)
{
int pid, val, status;
if ((pid = fork())!=0) {
/* we are the parent, so wait for the child */
if (pid == -1) /* the fork failed */
return FAILED;
do {
val = wait(&status);
if (val == -1) {
if (errno == EINTR)
continue;
/* shouldn't happen */
syslog(LOG_WARNING, "announce: wait: %m");
return (FAILED);
}
} while (val != pid);
if ((status&0377) > 0) /* we were killed by some signal */
return FAILED;
/* Get the second byte, this is the exit/return code */
return ((status >> 8) & 0377);
}
/* we are the child, go and do it */
_exit(announce_proc(request, remote_machine));
}
/*
* See if the user is accepting messages. If so, announce that
* a talk is requested.
*/
static int
announce_proc(CTL_MSG *request, const char *remote_machine)
{
/* int pid, status; */
char full_tty[32];
FILE *tf;
struct stat stbuf;
snprintf(full_tty, sizeof(full_tty), "%s/%s", _PATH_DEV,
request->r_tty);
if (access(full_tty, 0) != 0)
return FAILED;
if ((tf = fopen(full_tty, "w")) == NULL)
return PERMISSION_DENIED;
/*
* On first tty open, the server will have
* it's pgrp set, so disconnect us from the
* tty before we catch a signal.
*/
ioctl(fileno(tf), TIOCNOTTY, NULL);
if (fstat(fileno(tf), &stbuf) < 0)
return (PERMISSION_DENIED);
if ((stbuf.st_mode&020) == 0)
return (PERMISSION_DENIED);
print_mesg(tf, request, remote_machine);
fclose(tf);
return SUCCESS;
}
/*
* Reject control codes and other crap.
* FUTURE: don't clear high ascii if the tty is in 8-bit mode
* Note that we don't need to let through tabs or newlines here.
*/
static int safechar(int ch) {
if (ch>127 || ch<32) ch = '?';
return ch;
}
#define max(a,b) ( (a) > (b) ? (a) : (b) )
#define N_LINES 5
#define N_CHARS 120
/*
* Build a block of characters containing the message.
* It is sent blank filled and in a single block to
* try to keep the message in one piece if the recipient
* in in vi at the time
*/
static void
print_mesg(FILE *tf, CTL_MSG *request, const char *remote_machine)
{
struct timeval clocc;
struct timezone zone;
struct tm *localclock;
char line_buf[N_LINES][N_CHARS];
int sizes[N_LINES];
char big_buf[N_LINES*N_CHARS];
char *bptr, *lptr;
int i, j, max_size;
time_t footime;
i = 0;
max_size = 0;
gettimeofday(&clocc, &zone);
footime = clocc.tv_sec;
localclock = localtime(&footime);
snprintf(line_buf[i], N_CHARS, " ");
sizes[i] = strlen(line_buf[i]);
max_size = max(max_size, sizes[i]);
i++;
snprintf(line_buf[i], N_CHARS,
"Message from Talk_Daemon@%s at %d:%02d ...",
hostname, localclock->tm_hour, localclock->tm_min);
sizes[i] = strlen(line_buf[i]);
max_size = max(max_size, sizes[i]);
i++;
snprintf(line_buf[i], N_CHARS, "talk: connection requested by %s@%s.",
request->l_name, remote_machine);
sizes[i] = strlen(line_buf[i]);
max_size = max(max_size, sizes[i]);
i++;
snprintf(line_buf[i], N_CHARS, "talk: respond with: talk %s@%s",
request->l_name, remote_machine);
sizes[i] = strlen(line_buf[i]);
max_size = max(max_size, sizes[i]);
i++;
snprintf(line_buf[i], N_CHARS, " ");
sizes[i] = strlen(line_buf[i]);
max_size = max(max_size, sizes[i]);
i++;
bptr = big_buf;
*bptr++ = ''; /* send something to wake them up */
*bptr++ = '\r'; /* add a \r in case of raw mode */
*bptr++ = '\n';
for (i = 0; i < N_LINES; i++) {
/* copy the line into the big buffer */
lptr = line_buf[i];
while (*lptr != '\0')
*(bptr++) = safechar(*(lptr++));
/* pad out the rest of the lines with blanks */
for (j = sizes[i]; j < max_size + 2; j++)
*(bptr++) = ' ';
*(bptr++) = '\r'; /* add a \r in case of raw mode */
*(bptr++) = '\n';
}
*bptr = 0;
fprintf(tf, big_buf);
fflush(tf);
ioctl(fileno(tf), TIOCNOTTY, NULL);
}
|