source: mainline/uspace/srv/vfs/vfs_register.c@ daf59d1

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since daf59d1 was 3e6a98c5, checked in by Jiri Svoboda <jiri@…>, 13 years ago

Standards-compliant boolean type.

  • Property mode set to 100644
File size: 8.6 KB
RevLine 
[62da45a]1/*
2 * Copyright (c) 2008 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 * @{
[8dc72b64]31 */
[62da45a]32
33/**
[8dc72b64]34 * @file vfs_register.c
[62da45a]35 * @brief
36 */
37
38#include <ipc/services.h>
39#include <async.h>
40#include <fibril.h>
[df908b3]41#include <fibril_synch.h>
[62da45a]42#include <errno.h>
43#include <stdio.h>
44#include <stdlib.h>
[19f857a]45#include <str.h>
[62da45a]46#include <ctype.h>
[3e6a98c5]47#include <stdbool.h>
[d9c8c81]48#include <adt/list.h>
[62da45a]49#include <as.h>
50#include <assert.h>
51#include <atomic.h>
52#include "vfs.h"
53
[b72efe8]54FIBRIL_CONDVAR_INITIALIZE(fs_list_cv);
55FIBRIL_MUTEX_INITIALIZE(fs_list_lock);
56LIST_INITIALIZE(fs_list);
[62da45a]57
58atomic_t fs_handle_next = {
59 .count = 1
60};
61
62/** Verify the VFS info structure.
63 *
[79ae36dd]64 * @param info Info structure to be verified.
65 *
66 * @return Non-zero if the info structure is sane, zero otherwise.
[62da45a]67 *
68 */
69static bool vfs_info_sane(vfs_info_t *info)
70{
71 int i;
[79ae36dd]72
[62da45a]73 /*
74 * Check if the name is non-empty and is composed solely of ASCII
75 * characters [a-z]+[a-z0-9_-]*.
76 */
77 if (!islower(info->name[0])) {
78 dprintf("The name doesn't start with a lowercase character.\n");
79 return false;
80 }
[79ae36dd]81
[62da45a]82 for (i = 1; i < FS_NAME_MAXLEN; i++) {
83 if (!(islower(info->name[i]) || isdigit(info->name[i])) &&
84 (info->name[i] != '-') && (info->name[i] != '_')) {
85 if (info->name[i] == '\0') {
86 break;
87 } else {
88 dprintf("The name contains illegal "
89 "characters.\n");
90 return false;
91 }
92 }
93 }
[79ae36dd]94
[62da45a]95 /*
96 * This check is not redundant. It ensures that the name is
97 * NULL-terminated, even if FS_NAME_MAXLEN characters are used.
98 */
99 if (info->name[i] != '\0') {
100 dprintf("The name is not properly NULL-terminated.\n");
101 return false;
102 }
103
104 return true;
105}
106
107/** VFS_REGISTER protocol function.
108 *
[79ae36dd]109 * @param rid Hash of the call with the request.
110 * @param request Call structure with the request.
111 *
[62da45a]112 */
113void vfs_register(ipc_callid_t rid, ipc_call_t *request)
114{
115 dprintf("Processing VFS_REGISTER request received from %p.\n",
116 request->in_phone_hash);
117
[b4cbef1]118 vfs_info_t *vfs_info;
[eda925a]119 int rc = async_data_write_accept((void **) &vfs_info, false,
120 sizeof(vfs_info_t), sizeof(vfs_info_t), 0, NULL);
[62da45a]121
[b4cbef1]122 if (rc != EOK) {
123 dprintf("Failed to deliver the VFS info into our AS, rc=%d.\n",
124 rc);
[ffa2c8ef]125 async_answer_0(rid, rc);
[62da45a]126 return;
127 }
[b4cbef1]128
[62da45a]129 /*
130 * Allocate and initialize a buffer for the fs_info structure.
131 */
[b4cbef1]132 fs_info_t *fs_info = (fs_info_t *) malloc(sizeof(fs_info_t));
[62da45a]133 if (!fs_info) {
134 dprintf("Could not allocate memory for FS info.\n");
[ffa2c8ef]135 async_answer_0(rid, ENOMEM);
[62da45a]136 return;
137 }
[b4cbef1]138
[62da45a]139 link_initialize(&fs_info->fs_link);
[b4cbef1]140 fs_info->vfs_info = *vfs_info;
141 free(vfs_info);
142
[62da45a]143 dprintf("VFS info delivered.\n");
[b4cbef1]144
[62da45a]145 if (!vfs_info_sane(&fs_info->vfs_info)) {
146 free(fs_info);
[ffa2c8ef]147 async_answer_0(rid, EINVAL);
[62da45a]148 return;
149 }
[b4cbef1]150
[b72efe8]151 fibril_mutex_lock(&fs_list_lock);
[b4cbef1]152
[62da45a]153 /*
154 * Check for duplicit registrations.
155 */
[4979403]156 if (fs_name_to_handle(fs_info->vfs_info.instance,
[286286c]157 fs_info->vfs_info.name, false)) {
[62da45a]158 /*
159 * We already register a fs like this.
160 */
161 dprintf("FS is already registered.\n");
[b72efe8]162 fibril_mutex_unlock(&fs_list_lock);
[62da45a]163 free(fs_info);
[ffa2c8ef]164 async_answer_0(rid, EEXISTS);
[62da45a]165 return;
166 }
[b4cbef1]167
[62da45a]168 /*
169 * Add fs_info to the list of registered FS's.
170 */
171 dprintf("Inserting FS into the list of registered file systems.\n");
[b72efe8]172 list_append(&fs_info->fs_link, &fs_list);
[07deef5]173
[62da45a]174 /*
175 * Now we want the client to send us the IPC_M_CONNECT_TO_ME call so
176 * that a callback connection is created and we have a phone through
177 * which to forward VFS requests to it.
178 */
[79ae36dd]179 fs_info->sess = async_callback_receive(EXCHANGE_PARALLEL);
180 if (!fs_info->sess) {
181 dprintf("Callback connection expected\n");
[62da45a]182 list_remove(&fs_info->fs_link);
[b72efe8]183 fibril_mutex_unlock(&fs_list_lock);
[62da45a]184 free(fs_info);
[ffa2c8ef]185 async_answer_0(rid, EINVAL);
[62da45a]186 return;
187 }
[c1c0184]188
[62da45a]189 dprintf("Callback connection to FS created.\n");
[b4cbef1]190
[62da45a]191 /*
192 * The client will want us to send him the address space area with PLB.
193 */
[b4cbef1]194
195 size_t size;
[79ae36dd]196 ipc_callid_t callid;
[0da4e41]197 if (!async_share_in_receive(&callid, &size)) {
[228e490]198 dprintf("Unexpected call, method = %d\n", IPC_GET_IMETHOD(call));
[62da45a]199 list_remove(&fs_info->fs_link);
[b72efe8]200 fibril_mutex_unlock(&fs_list_lock);
[79ae36dd]201 async_hangup(fs_info->sess);
[62da45a]202 free(fs_info);
[ffa2c8ef]203 async_answer_0(callid, EINVAL);
204 async_answer_0(rid, EINVAL);
[62da45a]205 return;
206 }
207
208 /*
209 * We can only send the client address space area PLB_SIZE bytes long.
210 */
211 if (size != PLB_SIZE) {
212 dprintf("Client suggests wrong size of PFB, size = %d\n", size);
213 list_remove(&fs_info->fs_link);
[b72efe8]214 fibril_mutex_unlock(&fs_list_lock);
[79ae36dd]215 async_hangup(fs_info->sess);
[62da45a]216 free(fs_info);
[ffa2c8ef]217 async_answer_0(callid, EINVAL);
218 async_answer_0(rid, EINVAL);
[62da45a]219 return;
220 }
[b4cbef1]221
[62da45a]222 /*
223 * Commit to read-only sharing the PLB with the client.
224 */
[0da4e41]225 (void) async_share_in_finalize(callid, plb,
[62da45a]226 AS_AREA_READ | AS_AREA_CACHEABLE);
[b4cbef1]227
[62da45a]228 dprintf("Sharing PLB.\n");
[b4cbef1]229
[62da45a]230 /*
231 * That was it. The FS has been registered.
232 * In reply to the VFS_REGISTER request, we assign the client file
233 * system a global file system handle.
234 */
[f2ec8c8]235 fs_info->fs_handle = (fs_handle_t) atomic_postinc(&fs_handle_next);
[ffa2c8ef]236 async_answer_1(rid, EOK, (sysarg_t) fs_info->fs_handle);
[62da45a]237
[b72efe8]238 fibril_condvar_broadcast(&fs_list_cv);
239 fibril_mutex_unlock(&fs_list_lock);
[62da45a]240
241 dprintf("\"%.*s\" filesystem successfully registered, handle=%d.\n",
242 FS_NAME_MAXLEN, fs_info->vfs_info.name, fs_info->fs_handle);
243}
244
[79ae36dd]245/** Begin an exchange for a given file system handle
[62da45a]246 *
[79ae36dd]247 * @param handle File system handle.
248 *
249 * @return Exchange for a multi-call request.
250 * @return NULL if no such file exists.
[62da45a]251 *
252 */
[79ae36dd]253async_exch_t *vfs_exchange_grab(fs_handle_t handle)
[62da45a]254{
255 /*
[79ae36dd]256 * For now, we don't try to be very clever and very fast.
[b72efe8]257 * We simply lookup the session in fs_list and
[79ae36dd]258 * begin an exchange.
[62da45a]259 */
[b72efe8]260 fibril_mutex_lock(&fs_list_lock);
[79ae36dd]261
[b72efe8]262 list_foreach(fs_list, cur) {
[79ae36dd]263 fs_info_t *fs = list_get_instance(cur, fs_info_t, fs_link);
264
[62da45a]265 if (fs->fs_handle == handle) {
[b72efe8]266 fibril_mutex_unlock(&fs_list_lock);
[79ae36dd]267
268 assert(fs->sess);
269 async_exch_t *exch = async_exchange_begin(fs->sess);
270
271 assert(exch);
272 return exch;
[62da45a]273 }
274 }
[79ae36dd]275
[b72efe8]276 fibril_mutex_unlock(&fs_list_lock);
[79ae36dd]277
278 return NULL;
[62da45a]279}
280
[79ae36dd]281/** End VFS server exchange.
282 *
283 * @param exch VFS server exchange.
[62da45a]284 *
285 */
[79ae36dd]286void vfs_exchange_release(async_exch_t *exch)
[62da45a]287{
[79ae36dd]288 async_exchange_end(exch);
[62da45a]289}
290
291/** Convert file system name to its handle.
292 *
[79ae36dd]293 * @param name File system name.
294 * @param lock If true, the function will lock and unlock the
[b72efe8]295 * fs_list_lock.
[79ae36dd]296 *
297 * @return File system handle or zero if file system not found.
[62da45a]298 *
299 */
[4979403]300fs_handle_t fs_name_to_handle(unsigned int instance, char *name, bool lock)
[62da45a]301{
302 int handle = 0;
303
304 if (lock)
[b72efe8]305 fibril_mutex_lock(&fs_list_lock);
[79ae36dd]306
[b72efe8]307 list_foreach(fs_list, cur) {
[62da45a]308 fs_info_t *fs = list_get_instance(cur, fs_info_t, fs_link);
[4979403]309 if (str_cmp(fs->vfs_info.name, name) == 0 &&
[286286c]310 instance == fs->vfs_info.instance) {
[62da45a]311 handle = fs->fs_handle;
312 break;
313 }
314 }
[79ae36dd]315
[62da45a]316 if (lock)
[b72efe8]317 fibril_mutex_unlock(&fs_list_lock);
[79ae36dd]318
[62da45a]319 return handle;
320}
321
[f07f6b2]322/** Find the VFS info structure.
323 *
[79ae36dd]324 * @param handle FS handle for which the VFS info structure is sought.
325 *
326 * @return VFS info structure on success or NULL otherwise.
327 *
[f07f6b2]328 */
329vfs_info_t *fs_handle_to_info(fs_handle_t handle)
330{
331 vfs_info_t *info = NULL;
[79ae36dd]332
[b72efe8]333 fibril_mutex_lock(&fs_list_lock);
334 list_foreach(fs_list, cur) {
[f07f6b2]335 fs_info_t *fs = list_get_instance(cur, fs_info_t, fs_link);
336 if (fs->fs_handle == handle) {
337 info = &fs->vfs_info;
338 break;
339 }
340 }
[b72efe8]341 fibril_mutex_unlock(&fs_list_lock);
[79ae36dd]342
[f07f6b2]343 return info;
344}
345
[62da45a]346/**
347 * @}
[79ae36dd]348 */
Note: See TracBrowser for help on using the repository browser.