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
|
/* $OpenBSD: cmd2.c,v 1.22 2015/10/16 17:56:07 mmcc Exp $ */
/* $NetBSD: cmd2.c,v 1.7 1997/05/17 19:55:10 pk Exp $ */
/*
* Copyright (c) 1980, 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. 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.
*/
#include "rcv.h"
#include <sys/wait.h>
#include "extern.h"
/*
* Mail -- a mail program
*
* More user commands.
*/
static int igcomp(const void *, const void *);
/*
* If any arguments were given, go to the next applicable argument
* following dot, otherwise, go to the next applicable message.
* If given as first command with no arguments, print first message.
*/
int
next(void *v)
{
struct message *mp;
int *msgvec = v;
int *ip, *ip2, list[2], mdot;
if (*msgvec != 0) {
/*
* If some messages were supplied, find the
* first applicable one following dot using
* wrap around.
*/
mdot = dot - &message[0] + 1;
/*
* Find the first message in the supplied
* message list which follows dot.
*/
for (ip = msgvec; *ip != 0; ip++)
if (*ip > mdot)
break;
if (*ip == 0)
ip = msgvec;
ip2 = ip;
do {
mp = &message[*ip2 - 1];
if ((mp->m_flag & MDELETED) == 0) {
dot = mp;
goto hitit;
}
if (*ip2 != 0)
ip2++;
if (*ip2 == 0)
ip2 = msgvec;
} while (ip2 != ip);
puts("No messages applicable");
return(1);
}
/*
* If this is the first command, select message 1.
* Note that this must exist for us to get here at all.
*/
if (!sawcom)
goto hitit;
/*
* Just find the next good message after dot, no
* wraparound.
*/
for (mp = dot+1; mp < &message[msgCount]; mp++)
if ((mp->m_flag & (MDELETED|MSAVED)) == 0)
break;
if (mp >= &message[msgCount]) {
puts("At EOF");
return(0);
}
dot = mp;
hitit:
/*
* Print dot.
*/
list[0] = dot - &message[0] + 1;
list[1] = 0;
return(type(list));
}
/*
* Save a message in a file. Mark the message as saved
* so we can discard when the user quits.
*/
int
save(void *v)
{
char *str = v;
return(save1(str, 1, "save", saveignore));
}
/*
* Copy a message to a file without affected its saved-ness
*/
int
copycmd(void *v)
{
char *str = v;
return(save1(str, 0, "copy", saveignore));
}
/*
* Save/copy the indicated messages at the end of the passed file name.
* If mark is true, mark the message "saved."
*/
int
save1(char *str, int mark, char *cmd, struct ignoretab *ignore)
{
struct message *mp;
char *file, *disp;
int f, *msgvec, *ip;
FILE *obuf;
msgvec = (int *)salloc((msgCount + 2) * sizeof(*msgvec));
if ((file = snarf(str, &f)) == NULL)
return(1);
if (!f) {
*msgvec = first(0, MMNORM);
if (*msgvec == 0) {
printf("No messages to %s.\n", cmd);
return(1);
}
msgvec[1] = 0;
}
if (f && getmsglist(str, msgvec, 0) < 0)
return(1);
if ((file = expand(file)) == NULL)
return(1);
printf("\"%s\" ", file);
fflush(stdout);
if (access(file, F_OK) >= 0)
disp = "[Appended]";
else
disp = "[New file]";
if ((obuf = Fopen(file, "a")) == NULL) {
warn("fopen");
return(1);
}
for (ip = msgvec; *ip && ip-msgvec < msgCount; ip++) {
mp = &message[*ip - 1];
touch(mp);
if (sendmessage(mp, obuf, ignore, NULL) < 0) {
warn("%s", file);
(void)Fclose(obuf);
return(1);
}
if (mark)
mp->m_flag |= MSAVED;
}
fflush(obuf);
if (ferror(obuf))
warn("%s", file);
(void)Fclose(obuf);
printf("%s\n", disp);
return(0);
}
/*
* Write the indicated messages at the end of the passed
* file name, minus header and trailing blank line.
*/
int
swrite(void *v)
{
char *str = v;
return(save1(str, 1, "write", ignoreall));
}
/*
* Snarf the file from the end of the command line and
* return a pointer to it. If there is no file attached,
* just return NULL. Put a null in front of the file
* name so that the message list processing won't see it,
* unless the file name is the only thing on the line, in
* which case, return 0 in the reference flag variable.
*/
char *
snarf(char *linebuf, int *flag)
{
char *cp;
*flag = 1;
cp = strlen(linebuf) + linebuf - 1;
/*
* Strip away trailing blanks.
*/
while (cp > linebuf && isspace((unsigned char)*cp))
cp--;
*++cp = 0;
/*
* Now search for the beginning of the file name.
*/
while (cp > linebuf && !isspace((unsigned char)*cp))
cp--;
if (*cp == '\0') {
puts("No file specified.");
return(NULL);
}
if (isspace((unsigned char)*cp))
*cp++ = 0;
else
*flag = 0;
return(cp);
}
/*
* Delete messages.
*/
int
deletecmd(void *v)
{
int *msgvec = v;
delm(msgvec);
return(0);
}
/*
* Delete messages, then type the new dot.
*/
int
deltype(void *v)
{
int *msgvec = v;
int list[2];
int lastdot;
lastdot = dot - &message[0] + 1;
if (delm(msgvec) >= 0) {
list[0] = dot - &message[0] + 1;
if (list[0] > lastdot) {
touch(dot);
list[1] = 0;
return(type(list));
}
puts("At EOF");
} else
puts("No more messages");
return(0);
}
/*
* Delete the indicated messages.
* Set dot to some nice place afterwards.
* Internal interface.
*/
int
delm(int *msgvec)
{
struct message *mp;
int *ip, last;
last = 0;
for (ip = msgvec; *ip != 0; ip++) {
mp = &message[*ip - 1];
touch(mp);
mp->m_flag |= MDELETED|MTOUCH;
mp->m_flag &= ~(MPRESERVE|MSAVED|MBOX);
last = *ip;
}
if (last != 0) {
dot = &message[last-1];
last = first(0, MDELETED);
if (last != 0) {
dot = &message[last-1];
return(0);
}
else {
dot = &message[0];
return(-1);
}
}
/*
* Following can't happen
*/
return(-1);
}
/*
* Undelete the indicated messages.
*/
int
undeletecmd(void *v)
{
int *msgvec = v;
int *ip;
struct message *mp;
for (ip = msgvec; *ip && ip-msgvec < msgCount; ip++) {
mp = &message[*ip - 1];
touch(mp);
dot = mp;
mp->m_flag &= ~MDELETED;
}
return(0);
}
/*
* Add the given header fields to the retained list.
* If no arguments, print the current list of retained fields.
*/
int
retfield(void *v)
{
char **list = v;
return(ignore1(list, ignore + 1, "retained"));
}
/*
* Add the given header fields to the ignored list.
* If no arguments, print the current list of ignored fields.
*/
int
igfield(void *v)
{
char **list = v;
return(ignore1(list, ignore, "ignored"));
}
int
saveretfield(void *v)
{
char **list = v;
return(ignore1(list, saveignore + 1, "retained"));
}
int
saveigfield(void *v)
{
char **list = v;
return(ignore1(list, saveignore, "ignored"));
}
int
ignore1(char **list, struct ignoretab *tab, char *which)
{
char field[LINESIZE];
char **ap;
struct ignore *igp;
int h;
if (*list == NULL)
return(igshow(tab, which));
for (ap = list; *ap != 0; ap++) {
istrlcpy(field, *ap, sizeof(field));
if (member(field, tab))
continue;
h = hash(field);
igp = calloc(1, sizeof(struct ignore));
if (igp == NULL)
err(1, "calloc");
igp->i_field = strdup(field);
if (igp->i_field == NULL)
err(1, "strdup");
igp->i_link = tab->i_head[h];
tab->i_head[h] = igp;
tab->i_count++;
}
return(0);
}
/*
* Print out all currently retained fields.
*/
int
igshow(struct ignoretab *tab, char *which)
{
int h;
struct ignore *igp;
char **ap, **ring;
if (tab->i_count == 0) {
printf("No fields currently being %s.\n", which);
return(0);
}
ring = (char **)salloc((tab->i_count + 1) * sizeof(char *));
ap = ring;
for (h = 0; h < HSHSIZE; h++)
for (igp = tab->i_head[h]; igp != 0; igp = igp->i_link)
*ap++ = igp->i_field;
*ap = 0;
qsort(ring, tab->i_count, sizeof(char *), igcomp);
for (ap = ring; *ap != 0; ap++)
puts(*ap);
return(0);
}
/*
* Compare two names for sorting ignored field list.
*/
static int
igcomp(const void *l, const void *r)
{
return(strcmp(*(char **)l, *(char **)r));
}
|