1*0Sstevel@tonic-gate /*
2*0Sstevel@tonic-gate * CDDL HEADER START
3*0Sstevel@tonic-gate *
4*0Sstevel@tonic-gate * The contents of this file are subject to the terms of the
5*0Sstevel@tonic-gate * Common Development and Distribution License, Version 1.0 only
6*0Sstevel@tonic-gate * (the "License"). You may not use this file except in compliance
7*0Sstevel@tonic-gate * with the License.
8*0Sstevel@tonic-gate *
9*0Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*0Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing.
11*0Sstevel@tonic-gate * See the License for the specific language governing permissions
12*0Sstevel@tonic-gate * and limitations under the License.
13*0Sstevel@tonic-gate *
14*0Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each
15*0Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*0Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the
17*0Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying
18*0Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner]
19*0Sstevel@tonic-gate *
20*0Sstevel@tonic-gate * CDDL HEADER END
21*0Sstevel@tonic-gate */
22*0Sstevel@tonic-gate /*
23*0Sstevel@tonic-gate * Copyright 1994 Sun Microsystems, Inc. All rights reserved.
24*0Sstevel@tonic-gate * Use is subject to license terms.
25*0Sstevel@tonic-gate */
26*0Sstevel@tonic-gate
27*0Sstevel@tonic-gate /* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
28*0Sstevel@tonic-gate /* All Rights Reserved */
29*0Sstevel@tonic-gate
30*0Sstevel@tonic-gate
31*0Sstevel@tonic-gate /*
32*0Sstevel@tonic-gate * University Copyright- Copyright (c) 1982, 1986, 1988
33*0Sstevel@tonic-gate * The Regents of the University of California
34*0Sstevel@tonic-gate * All Rights Reserved
35*0Sstevel@tonic-gate *
36*0Sstevel@tonic-gate * University Acknowledgment- Portions of this document are derived from
37*0Sstevel@tonic-gate * software developed by the University of California, Berkeley, and its
38*0Sstevel@tonic-gate * contributors.
39*0Sstevel@tonic-gate */
40*0Sstevel@tonic-gate
41*0Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI"
42*0Sstevel@tonic-gate
43*0Sstevel@tonic-gate #include "rcv.h"
44*0Sstevel@tonic-gate
45*0Sstevel@tonic-gate #undef fopen
46*0Sstevel@tonic-gate #undef fclose
47*0Sstevel@tonic-gate
48*0Sstevel@tonic-gate /*
49*0Sstevel@tonic-gate * mailx -- a modified version of a University of California at Berkeley
50*0Sstevel@tonic-gate * mail program
51*0Sstevel@tonic-gate *
52*0Sstevel@tonic-gate * Local version of fopen() and fclose(). These maintain a list of
53*0Sstevel@tonic-gate * file pointers which can be run down when we need to close
54*0Sstevel@tonic-gate * all files, such as before executing external commands.
55*0Sstevel@tonic-gate */
56*0Sstevel@tonic-gate
57*0Sstevel@tonic-gate static NODE *append();
58*0Sstevel@tonic-gate static NODE *del1();
59*0Sstevel@tonic-gate static NODE *getnode();
60*0Sstevel@tonic-gate static NODE *search();
61*0Sstevel@tonic-gate
62*0Sstevel@tonic-gate static NODE *
getnode(FILE * fp)63*0Sstevel@tonic-gate getnode(FILE *fp)
64*0Sstevel@tonic-gate {
65*0Sstevel@tonic-gate NODE *newnode;
66*0Sstevel@tonic-gate
67*0Sstevel@tonic-gate if ((newnode = (NODE *)malloc(sizeof(NODE))) == (NODE *)NULL) {
68*0Sstevel@tonic-gate (void) fputs("Cannot allocate node space\n", stderr);
69*0Sstevel@tonic-gate exit(3);
70*0Sstevel@tonic-gate }
71*0Sstevel@tonic-gate newnode->fp = fp;
72*0Sstevel@tonic-gate newnode->next = (NODE *)NULL;
73*0Sstevel@tonic-gate return(newnode);
74*0Sstevel@tonic-gate }
75*0Sstevel@tonic-gate
76*0Sstevel@tonic-gate static NODE *
search(FILE * fp)77*0Sstevel@tonic-gate search(FILE *fp)
78*0Sstevel@tonic-gate {
79*0Sstevel@tonic-gate register NODE *tmp;
80*0Sstevel@tonic-gate
81*0Sstevel@tonic-gate for (tmp = fplist; tmp != (NODE *)NULL; tmp = tmp->next)
82*0Sstevel@tonic-gate if (tmp->fp == fp)
83*0Sstevel@tonic-gate break;
84*0Sstevel@tonic-gate return( tmp != (NODE *)NULL ? tmp : NOFP);
85*0Sstevel@tonic-gate }
86*0Sstevel@tonic-gate
87*0Sstevel@tonic-gate static NODE *
append(FILE * fp)88*0Sstevel@tonic-gate append(FILE *fp)
89*0Sstevel@tonic-gate {
90*0Sstevel@tonic-gate register NODE *newnode;
91*0Sstevel@tonic-gate
92*0Sstevel@tonic-gate if ((newnode = getnode(fp)) == (NODE *)NULL)
93*0Sstevel@tonic-gate return(NOFP);
94*0Sstevel@tonic-gate if (fplist == NOFP) {
95*0Sstevel@tonic-gate fplist = newnode;
96*0Sstevel@tonic-gate } else {
97*0Sstevel@tonic-gate newnode->next = curptr->next;
98*0Sstevel@tonic-gate curptr->next = newnode;
99*0Sstevel@tonic-gate }
100*0Sstevel@tonic-gate return(newnode);
101*0Sstevel@tonic-gate }
102*0Sstevel@tonic-gate
103*0Sstevel@tonic-gate static NODE *
del1(NODE * oldcur)104*0Sstevel@tonic-gate del1(NODE *oldcur)
105*0Sstevel@tonic-gate {
106*0Sstevel@tonic-gate register NODE *cur, *prev;
107*0Sstevel@tonic-gate
108*0Sstevel@tonic-gate for (prev = cur = fplist; cur != (NODE *)NULL; cur = cur->next) {
109*0Sstevel@tonic-gate if (cur == oldcur) {
110*0Sstevel@tonic-gate if (cur == fplist) {
111*0Sstevel@tonic-gate cur = fplist = cur->next;
112*0Sstevel@tonic-gate } else {
113*0Sstevel@tonic-gate prev->next = cur->next;
114*0Sstevel@tonic-gate cur = prev->next ? prev->next : prev;
115*0Sstevel@tonic-gate }
116*0Sstevel@tonic-gate if (curptr == oldcur)
117*0Sstevel@tonic-gate curptr = prev;
118*0Sstevel@tonic-gate free(oldcur);
119*0Sstevel@tonic-gate break;
120*0Sstevel@tonic-gate }
121*0Sstevel@tonic-gate prev = cur;
122*0Sstevel@tonic-gate }
123*0Sstevel@tonic-gate return(cur);
124*0Sstevel@tonic-gate }
125*0Sstevel@tonic-gate
126*0Sstevel@tonic-gate FILE *
my_fopen(char * file,char * mode)127*0Sstevel@tonic-gate my_fopen(char *file, char *mode)
128*0Sstevel@tonic-gate {
129*0Sstevel@tonic-gate FILE *fp;
130*0Sstevel@tonic-gate
131*0Sstevel@tonic-gate if ((fp = fopen(file, mode)) == (FILE *)NULL) {
132*0Sstevel@tonic-gate fplist = NOFP;
133*0Sstevel@tonic-gate return(fp);
134*0Sstevel@tonic-gate } else {
135*0Sstevel@tonic-gate curptr = append(fp);
136*0Sstevel@tonic-gate }
137*0Sstevel@tonic-gate return(fp);
138*0Sstevel@tonic-gate }
139*0Sstevel@tonic-gate
140*0Sstevel@tonic-gate int
my_fclose(register FILE * iop)141*0Sstevel@tonic-gate my_fclose(register FILE *iop)
142*0Sstevel@tonic-gate {
143*0Sstevel@tonic-gate register NODE *cur;
144*0Sstevel@tonic-gate
145*0Sstevel@tonic-gate int ret = fclose(iop);
146*0Sstevel@tonic-gate if (fplist != NOFP) {
147*0Sstevel@tonic-gate cur = search(iop);
148*0Sstevel@tonic-gate cur = del1(cur);
149*0Sstevel@tonic-gate }
150*0Sstevel@tonic-gate return ret;
151*0Sstevel@tonic-gate }
152