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
|
/*
* Copyright (c) 2023-2024 Ian Marco Moffett and the Osmora Team.
* 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 Hyra 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 COPYRIGHT HOLDERS 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 COPYRIGHT OWNER 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 <sys/atomic.h>
#include <sys/errno.h>
#include <sys/proc.h>
#include <sys/limits.h>
#include <sys/namei.h>
#include <sys/filedesc.h>
#include <sys/systm.h>
#include <vm/dynalloc.h>
#include <string.h>
/*
* Allocate a file descriptor.
*
* @fd_out: Pointer to allocated file descriptor output.
*
* This routine will create a new file descriptor
* table entry.
*
* Returns 0 on success.
*/
int
fd_alloc(struct filedesc **fd_out)
{
struct filedesc *fd;
struct proc *td = this_td();
/* Find free fd table entry */
for (size_t i = 3; i < PROC_MAX_FILEDES; ++i) {
if (td->fds[i] != NULL) {
/* In use */
continue;
}
fd = dynalloc(sizeof(struct filedesc));
memset(fd, 0, sizeof(struct filedesc));
if (fd == NULL) {
return -ENOMEM;
}
fd->refcnt = 1;
fd->fdno = i;
td->fds[i] = fd;
if (fd_out != NULL)
*fd_out = fd;
return 0;
}
return -EMFILE;
}
/*
* Fetch a file descriptor from a file descriptor
* number.
*
* @fdno: File descriptor to fetch
*/
struct filedesc *
fd_get(unsigned int fdno)
{
struct proc *td = this_td();
if (fdno > PROC_MAX_FILEDES) {
return NULL;
}
return td->fds[fdno];
}
/*
* Close a file descriptor with a file
* descriptor number.
*
* @fd: File descriptor number to close.
*/
int
fd_close(unsigned int fd)
{
struct filedesc *filedes;
struct proc *td;
if ((filedes = fd_get(fd)) == NULL) {
return -EBADF;
}
/* Return if other threads still hold a ref */
if (atomic_dec_int(&filedes->refcnt) > 0) {
return 0;
}
td = this_td();
/*
* Each file descriptor structure references a vnode,
* we want to reclaim it or at the very least drop
* one of its references. After we've cleaned up within
* the file descriptor, we can clear it from the fd table
* and free up the memory for it.
*/
vfs_release_vnode(filedes->vp);
td->fds[fd] = NULL;
dynfree(filedes);
return 0;
}
/*
* Read bytes from a file using a file
* descriptor number.
*
* @fd: File descriptor number.
* @buf: Buffer to read into.
* @count: Number of bytes to read.
*/
int
fd_read(unsigned int fd, void *buf, size_t count)
{
char *kbuf = NULL;
struct filedesc *filedes;
struct sio_txn sio;
scret_t retval = 0;
if (count > SSIZE_MAX) {
retval = -EINVAL;
goto done;
}
filedes = fd_get(fd);
kbuf = dynalloc(count);
if (kbuf == NULL) {
retval = -ENOMEM;
goto done;
}
if (filedes == NULL) {
retval = -EBADF;
goto done;
}
if (filedes->is_dir) {
retval = -EISDIR;
goto done;
}
sio.len = count;
sio.buf = kbuf;
sio.offset = filedes->offset;
if ((count = vfs_vop_read(filedes->vp, &sio)) < 0) {
retval = -EIO;
goto done;
}
if (copyout(kbuf, buf, count) < 0) {
retval = -EFAULT;
goto done;
}
retval = count;
done:
if (kbuf != NULL) {
dynfree(kbuf);
}
return retval;
}
/*
* Open a file and get a file descriptor
* number.
*
* @pathname: Path of file to open.
* @flags: Flags to use.
*
* TODO: Use of flags.
*/
int
fd_open(const char *pathname, int flags)
{
int error;
struct filedesc *filedes;
struct nameidata nd;
nd.path = pathname;
nd.flags = 0;
if ((error = namei(&nd)) < 0) {
return error;
}
if ((error = fd_alloc(&filedes)) != 0) {
vfs_release_vnode(nd.vp);
return error;
}
filedes->vp = nd.vp;
return filedes->fdno;
}
/*
* Duplicate a file descriptor. New file descriptor
* points to the same vnode.
*/
int
fd_dup(int fd)
{
int error;
struct filedesc *new_desc, *tmp;
tmp = fd_get(fd);
if (tmp == NULL)
return -EBADF;
if ((error = fd_alloc(&new_desc)) != 0)
return error;
/* Ref that vnode before we point to it */
vfs_vref(tmp->vp);
new_desc->vp = tmp->vp;
return new_desc->fdno;
}
|