|
|
researchv10 Norman
#ident "@(#)myfopen.c 1.3 'attmail mail(1) command'"
#ident "@(#)mailx:myfopen.c 1.1"
/* Copyright (c) 1988 AT&T */
/* All Rights Reserved */
/* THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF AT&T */
/* The copyright notice above does not evidence any */
/* actual or intended publication of such source code. */
#ident "@(#)mailx:myfopen.c 1.0"
#include "rcv.h"
#undef fopen
#undef fclose
/*
* mailx -- a modified version of a University of California at Berkeley
* mail program
*
* Local version of fopen() and fclose(). These maintain a list of
* file pointers which can be run down when we need to close
* all files, such as before executing external commands.
*/
static NODE *append();
static NODE *del1();
static NODE *getnode();
static NODE *search();
static NODE *
getnode(fp)
FILE *fp;
{
NODE *new;
if ((new = (NODE *)malloc(sizeof(NODE))) == (NODE *)NULL) {
(void) fputs("Cannot allocate node space\n", stderr);
exit(3);
}
new->fp = fp;
new->next = (NODE *)NULL;
return(new);
}
static NODE *
search(fp)
FILE *fp;
{
register NODE *tmp;
for (tmp = fplist; tmp != (NODE *)NULL; tmp = tmp->next)
if (tmp->fp == fp)
break;
return( tmp != (NODE *)NULL ? tmp : NOFP);
}
static NODE *
append(fp)
FILE *fp;
{
register NODE *new;
if ((new = getnode(fp)) == (NODE *)NULL)
return(NOFP);
if (fplist == NOFP) {
fplist = new;
} else {
new->next = curptr->next;
curptr->next = new;
}
return(new);
}
static NODE *
del1(oldcur)
NODE *oldcur;
{
register NODE *cur, *prev;
for (prev = cur = fplist; cur != (NODE *)NULL; cur = cur->next) {
if (cur == oldcur) {
if (cur == fplist) {
cur = fplist = cur->next;
} else {
prev->next = cur->next;
cur = prev->next ? prev->next : prev;
}
free(oldcur);
break;
}
prev = cur;
}
return(cur);
}
FILE *
my_fopen(file, mode)
char *file, *mode;
{
FILE *fp;
if ((fp = fopen(file, mode)) == (FILE *)NULL) {
fplist = NOFP;
return(fp);
} else {
curptr = append(fp);
}
return(fp);
}
int
my_fclose(iop)
register FILE *iop;
{
register NODE *cur;
int ret = fclose(iop);
if (fplist != NOFP) {
cur = search(iop);
cur = del1(cur);
}
return ret;
}
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.