source: mainline/uspace/srv/vfs/vfs_file.c@ 319f4fb

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 319f4fb was 1e4cada, checked in by Martin Decky <martin@…>, 16 years ago

rename fibril_sync.[ch] to fibril_synch.[ch]

  • Property mode set to 100644
File size: 5.4 KB
Line 
1/*
2 * Copyright (c) 2007 Jakub Jermar
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/** @addtogroup fs
30 * @{
31 */
32
33/**
34 * @file vfs_file.c
35 * @brief Various operations on files have their home in this file.
36 */
37
38#include <errno.h>
39#include <stdlib.h>
40#include <string.h>
41#include <assert.h>
42#include <bool.h>
43#include <fibril.h>
44#include <fibril_synch.h>
45#include "vfs.h"
46
47/**
48 * This is a per-connection table of open files.
49 * Our assumption is that each client opens only one connection and therefore
50 * there is one table of open files per task. However, this may not be the case
51 * and the client can open more connections to VFS. In that case, there will be
52 * several tables and several file handle name spaces per task. Besides of this,
53 * the functionality will stay unchanged. So unless the client knows what it is
54 * doing, it should open one connection to VFS only.
55 *
56 * Allocation of the open files table is deferred until the client makes the
57 * first VFS_OPEN operation.
58 *
59 * This resource being per-connection and, in the first place, per-fibril, we
60 * don't need to protect it by a mutex.
61 */
62fibril_local vfs_file_t **files = NULL;
63
64/** Initialize the table of open files. */
65bool vfs_files_init(void)
66{
67 if (!files) {
68 files = malloc(MAX_OPEN_FILES * sizeof(vfs_file_t *));
69 if (!files)
70 return false;
71 memset(files, 0, MAX_OPEN_FILES * sizeof(vfs_file_t *));
72 }
73 return true;
74}
75
76/** Allocate a file descriptor.
77 *
78 * @param desc If true, look for an available file descriptor
79 * in a descending order.
80 *
81 * @return First available file descriptor or a negative error
82 * code.
83 */
84int vfs_fd_alloc(bool desc)
85{
86 if (!vfs_files_init())
87 return ENOMEM;
88
89 unsigned int i;
90 if (desc)
91 i = MAX_OPEN_FILES - 1;
92 else
93 i = 0;
94
95 while (true) {
96 if (!files[i]) {
97 files[i] = (vfs_file_t *) malloc(sizeof(vfs_file_t));
98 if (!files[i])
99 return ENOMEM;
100
101 memset(files[i], 0, sizeof(vfs_file_t));
102 fibril_mutex_initialize(&files[i]->lock);
103 vfs_file_addref(files[i]);
104 return (int) i;
105 }
106
107 if (desc) {
108 if (i == 0)
109 break;
110
111 i--;
112 } else {
113 if (i == MAX_OPEN_FILES - 1)
114 break;
115
116 i++;
117 }
118 }
119
120 return EMFILE;
121}
122
123/** Release file descriptor.
124 *
125 * @param fd File descriptor being released.
126 *
127 * @return EOK on success or EBADF if fd is an invalid file
128 * descriptor.
129 */
130int vfs_fd_free(int fd)
131{
132 if (!vfs_files_init())
133 return ENOMEM;
134
135 if ((fd < 0) || (fd >= MAX_OPEN_FILES) || (files[fd] == NULL))
136 return EBADF;
137
138 vfs_file_delref(files[fd]);
139 files[fd] = NULL;
140
141 return EOK;
142}
143
144/** Assign a file to a file descriptor.
145 *
146 * @param file File to assign.
147 * @param fd File descriptor to assign to.
148 *
149 * @return EOK on success or EINVAL if fd is an invalid or already
150 * used file descriptor.
151 *
152 */
153int vfs_fd_assign(vfs_file_t *file, int fd)
154{
155 if (!vfs_files_init())
156 return ENOMEM;
157
158 if ((fd < 0) || (fd >= MAX_OPEN_FILES) || (files[fd] != NULL))
159 return EINVAL;
160
161 files[fd] = file;
162 vfs_file_addref(files[fd]);
163
164 return EOK;
165}
166
167/** Increment reference count of VFS file structure.
168 *
169 * @param file File structure that will have reference count
170 * incremented.
171 */
172void vfs_file_addref(vfs_file_t *file)
173{
174 /*
175 * File structures are per-connection, so no-one, except the current
176 * fibril, should have a reference to them. This is the reason we don't
177 * do any synchronization here.
178 */
179 file->refcnt++;
180}
181
182/** Decrement reference count of VFS file structure.
183 *
184 * @param file File structure that will have reference count
185 * decremented.
186 */
187void vfs_file_delref(vfs_file_t *file)
188{
189 if (file->refcnt-- == 1) {
190 /*
191 * Lost the last reference to a file, need to drop our reference
192 * to the underlying VFS node.
193 */
194 vfs_node_delref(file->node);
195 free(file);
196 }
197}
198
199/** Find VFS file structure for a given file descriptor.
200 *
201 * @param fd File descriptor.
202 *
203 * @return VFS file structure corresponding to fd.
204 */
205vfs_file_t *vfs_file_get(int fd)
206{
207 if (!vfs_files_init())
208 return NULL;
209
210 if ((fd >= 0) && (fd < MAX_OPEN_FILES))
211 return files[fd];
212
213 return NULL;
214}
215
216/**
217 * @}
218 */
Note: See TracBrowser for help on using the repository browser.