xref: /illumos-gate/usr/src/boot/libsa/close.c (revision 9b9d39d2a32ff806d2431dbcc50968ef1e6d46b2)
1 /*	$NetBSD: close.c,v 1.7 1997/01/22 00:38:09 cgd Exp $	*/
2 
3 /*
4  * Copyright (c) 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * This code is derived from software contributed to Berkeley by
8  * The Mach Operating System project at Carnegie-Mellon University.
9  *
10  * Redistribution and use in source and binary forms, with or without
11  * modification, are permitted provided that the following conditions
12  * are met:
13  * 1. Redistributions of source code must retain the above copyright
14  *    notice, this list of conditions and the following disclaimer.
15  * 2. Redistributions in binary form must reproduce the above copyright
16  *    notice, this list of conditions and the following disclaimer in the
17  *    documentation and/or other materials provided with the distribution.
18  * 3. Neither the name of the University nor the names of its contributors
19  *    may be used to endorse or promote products derived from this software
20  *    without specific prior written permission.
21  *
22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32  * SUCH DAMAGE.
33  *
34  *	@(#)close.c	8.1 (Berkeley) 6/11/93
35  *
36  *
37  * Copyright (c) 1989, 1990, 1991 Carnegie Mellon University
38  * All Rights Reserved.
39  *
40  * Author: Alessandro Forin
41  *
42  * Permission to use, copy, modify and distribute this software and its
43  * documentation is hereby granted, provided that both the copyright
44  * notice and this permission notice appear in all copies of the
45  * software, derivative works or modified versions, and any portions
46  * thereof, and that both notices appear in supporting documentation.
47  *
48  * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
49  * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
50  * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
51  *
52  * Carnegie Mellon requests users of this software to return to
53  *
54  *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
55  *  School of Computer Science
56  *  Carnegie Mellon University
57  *  Pittsburgh PA 15213-3890
58  *
59  * any improvements or extensions that they make and grant Carnegie the
60  * rights to redistribute these changes.
61  */
62 
63 #include <sys/cdefs.h>
64 
65 #include "stand.h"
66 
67 int
68 close(int fd)
69 {
70 	struct open_file *f, *last;
71 	int err1 = 0, err2 = 0;
72 
73 	f = fd2open_file(fd);
74 	if (f == NULL) {
75 		errno = EBADF;
76 		return (-1);
77 	}
78 	free(f->f_rabuf);
79 	f->f_rabuf = NULL;
80 
81 	if (f->f_flags != 0) {
82 		if (!(f->f_flags & F_RAW) && f->f_ops)
83 			err1 = (f->f_ops->fo_close)(f);
84 		if (!(f->f_flags & F_NODEV) && f->f_dev)
85 			err2 = (f->f_dev->dv_close)(f);
86 		if (f->f_devdata != NULL)
87 			devclose(f);
88 		f->f_flags = 0;
89 	} else {
90 		/* Attempt to close already closed file. */
91 		err1 = EBADF;
92 	}
93 
94 	/* free unused entries from tail. */
95 	TAILQ_FOREACH_REVERSE_SAFE(last, &files, file_list, f_link, f) {
96 		if (last->f_flags != 0)
97 			break;
98 		TAILQ_REMOVE(&files, last, f_link);
99 		free(last);
100 	}
101 
102 	if (err1) {
103 		errno = err1;
104 		return (-1);
105 	}
106 	if (err2) {
107 		errno = err2;
108 		return (-1);
109 	}
110 	return (0);
111 }
112