source: mainline/uspace/srv/vfs/vfs_register.c@ 508b0df1

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 508b0df1 was 508b0df1, checked in by Jiří Zárevúcky <jiri.zarevucky@…>, 7 years ago

Remove uspace <atomic.h>, use <stdatomic.h> instead

  • Property mode set to 100644
File size: 9.5 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
[b1834a01]29/** @addtogroup vfs
[62da45a]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>
[508b0df1]51#include <stdatomic.h>
[b14d9f9]52#include <vfs/vfs.h>
[62da45a]53#include "vfs.h"
54
[b72efe8]55FIBRIL_CONDVAR_INITIALIZE(fs_list_cv);
56FIBRIL_MUTEX_INITIALIZE(fs_list_lock);
57LIST_INITIALIZE(fs_list);
[62da45a]58
[508b0df1]59static atomic_int fs_handle_next = 1;
[62da45a]60
61/** Verify the VFS info structure.
62 *
[79ae36dd]63 * @param info Info structure to be verified.
64 *
65 * @return Non-zero if the info structure is sane, zero otherwise.
[62da45a]66 *
67 */
68static bool vfs_info_sane(vfs_info_t *info)
69{
70 int i;
[a35b458]71
[62da45a]72 /*
73 * Check if the name is non-empty and is composed solely of ASCII
74 * characters [a-z]+[a-z0-9_-]*.
75 */
76 if (!islower(info->name[0])) {
77 dprintf("The name doesn't start with a lowercase character.\n");
78 return false;
79 }
[a35b458]80
[62da45a]81 for (i = 1; i < FS_NAME_MAXLEN; i++) {
82 if (!(islower(info->name[i]) || isdigit(info->name[i])) &&
83 (info->name[i] != '-') && (info->name[i] != '_')) {
84 if (info->name[i] == '\0') {
85 break;
86 } else {
87 dprintf("The name contains illegal "
88 "characters.\n");
89 return false;
90 }
91 }
92 }
[a35b458]93
[62da45a]94 /*
95 * This check is not redundant. It ensures that the name is
96 * NULL-terminated, even if FS_NAME_MAXLEN characters are used.
97 */
98 if (info->name[i] != '\0') {
[1b20da0]99 dprintf("The name is not properly NULL-terminated.\n");
[62da45a]100 return false;
101 }
[a35b458]102
[62da45a]103 return true;
104}
105
106/** VFS_REGISTER protocol function.
107 *
[984a9ba]108 * @param req Call structure with the request.
[79ae36dd]109 *
[62da45a]110 */
[984a9ba]111void vfs_register(ipc_call_t *req)
[62da45a]112{
[d9e68d0]113 dprintf("Processing VFS_REGISTER request received from %zx.\n",
[984a9ba]114 req->in_phone_hash);
[a35b458]115
[b4cbef1]116 vfs_info_t *vfs_info;
[b7fd2a0]117 errno_t rc = async_data_write_accept((void **) &vfs_info, false,
[eda925a]118 sizeof(vfs_info_t), sizeof(vfs_info_t), 0, NULL);
[a35b458]119
[b4cbef1]120 if (rc != EOK) {
121 dprintf("Failed to deliver the VFS info into our AS, rc=%d.\n",
122 rc);
[984a9ba]123 async_answer_0(req, rc);
[62da45a]124 return;
125 }
[a35b458]126
[62da45a]127 /*
128 * Allocate and initialize a buffer for the fs_info structure.
129 */
[b4cbef1]130 fs_info_t *fs_info = (fs_info_t *) malloc(sizeof(fs_info_t));
[62da45a]131 if (!fs_info) {
132 dprintf("Could not allocate memory for FS info.\n");
[984a9ba]133 async_answer_0(req, ENOMEM);
[62da45a]134 return;
135 }
[a35b458]136
[62da45a]137 link_initialize(&fs_info->fs_link);
[b4cbef1]138 fs_info->vfs_info = *vfs_info;
139 free(vfs_info);
[a35b458]140
[62da45a]141 dprintf("VFS info delivered.\n");
[a35b458]142
[62da45a]143 if (!vfs_info_sane(&fs_info->vfs_info)) {
144 free(fs_info);
[984a9ba]145 async_answer_0(req, EINVAL);
[62da45a]146 return;
147 }
[a35b458]148
[b72efe8]149 fibril_mutex_lock(&fs_list_lock);
[a35b458]150
[62da45a]151 /*
152 * Check for duplicit registrations.
153 */
[4979403]154 if (fs_name_to_handle(fs_info->vfs_info.instance,
[286286c]155 fs_info->vfs_info.name, false)) {
[62da45a]156 /*
157 * We already register a fs like this.
158 */
159 dprintf("FS is already registered.\n");
[b72efe8]160 fibril_mutex_unlock(&fs_list_lock);
[62da45a]161 free(fs_info);
[984a9ba]162 async_answer_0(req, EEXIST);
[62da45a]163 return;
164 }
[a35b458]165
[62da45a]166 /*
167 * Add fs_info to the list of registered FS's.
168 */
169 dprintf("Inserting FS into the list of registered file systems.\n");
[b72efe8]170 list_append(&fs_info->fs_link, &fs_list);
[a35b458]171
[62da45a]172 /*
173 * Now we want the client to send us the IPC_M_CONNECT_TO_ME call so
174 * that a callback connection is created and we have a phone through
175 * which to forward VFS requests to it.
176 */
[79ae36dd]177 fs_info->sess = async_callback_receive(EXCHANGE_PARALLEL);
178 if (!fs_info->sess) {
179 dprintf("Callback connection expected\n");
[62da45a]180 list_remove(&fs_info->fs_link);
[b72efe8]181 fibril_mutex_unlock(&fs_list_lock);
[62da45a]182 free(fs_info);
[984a9ba]183 async_answer_0(req, EINVAL);
[62da45a]184 return;
185 }
[a35b458]186
[9b1baac]187 /* FIXME: Work around problem with callback sessions */
188 async_sess_args_set(fs_info->sess, INTERFACE_VFS_DRIVER_CB, 0, 0);
189
[62da45a]190 dprintf("Callback connection to FS created.\n");
[a35b458]191
[62da45a]192 /*
193 * The client will want us to send him the address space area with PLB.
194 */
[a35b458]195
[984a9ba]196 ipc_call_t call;
[b4cbef1]197 size_t size;
[984a9ba]198 if (!async_share_in_receive(&call, &size)) {
[d9e68d0]199 dprintf("Unexpected call\n");
[62da45a]200 list_remove(&fs_info->fs_link);
[b72efe8]201 fibril_mutex_unlock(&fs_list_lock);
[79ae36dd]202 async_hangup(fs_info->sess);
[62da45a]203 free(fs_info);
[984a9ba]204 async_answer_0(&call, EINVAL);
205 async_answer_0(req, EINVAL);
[62da45a]206 return;
207 }
[a35b458]208
[62da45a]209 /*
210 * We can only send the client address space area PLB_SIZE bytes long.
211 */
212 if (size != PLB_SIZE) {
[d9e68d0]213 dprintf("Client suggests wrong size of PFB, size = %zu\n", size);
[62da45a]214 list_remove(&fs_info->fs_link);
[b72efe8]215 fibril_mutex_unlock(&fs_list_lock);
[79ae36dd]216 async_hangup(fs_info->sess);
[62da45a]217 free(fs_info);
[984a9ba]218 async_answer_0(&call, EINVAL);
219 async_answer_0(req, EINVAL);
[62da45a]220 return;
221 }
[a35b458]222
[62da45a]223 /*
224 * Commit to read-only sharing the PLB with the client.
225 */
[984a9ba]226 (void) async_share_in_finalize(&call, plb,
[62da45a]227 AS_AREA_READ | AS_AREA_CACHEABLE);
[a35b458]228
[62da45a]229 dprintf("Sharing PLB.\n");
[a35b458]230
[62da45a]231 /*
232 * That was it. The FS has been registered.
233 * In reply to the VFS_REGISTER request, we assign the client file
234 * system a global file system handle.
235 */
[508b0df1]236 fs_info->fs_handle = atomic_fetch_add(&fs_handle_next, 1);
[984a9ba]237 async_answer_1(req, EOK, (sysarg_t) fs_info->fs_handle);
[a35b458]238
[b72efe8]239 fibril_condvar_broadcast(&fs_list_cv);
240 fibril_mutex_unlock(&fs_list_lock);
[a35b458]241
[62da45a]242 dprintf("\"%.*s\" filesystem successfully registered, handle=%d.\n",
243 FS_NAME_MAXLEN, fs_info->vfs_info.name, fs_info->fs_handle);
244}
245
[79ae36dd]246/** Begin an exchange for a given file system handle
[62da45a]247 *
[79ae36dd]248 * @param handle File system handle.
249 *
250 * @return Exchange for a multi-call request.
251 * @return NULL if no such file exists.
[62da45a]252 *
253 */
[79ae36dd]254async_exch_t *vfs_exchange_grab(fs_handle_t handle)
[62da45a]255{
256 /*
[79ae36dd]257 * For now, we don't try to be very clever and very fast.
[b72efe8]258 * We simply lookup the session in fs_list and
[79ae36dd]259 * begin an exchange.
[62da45a]260 */
[b72efe8]261 fibril_mutex_lock(&fs_list_lock);
[a35b458]262
[feeac0d]263 list_foreach(fs_list, fs_link, fs_info_t, fs) {
[62da45a]264 if (fs->fs_handle == handle) {
[b72efe8]265 fibril_mutex_unlock(&fs_list_lock);
[a35b458]266
[79ae36dd]267 assert(fs->sess);
268 async_exch_t *exch = async_exchange_begin(fs->sess);
[a35b458]269
[79ae36dd]270 assert(exch);
271 return exch;
[62da45a]272 }
273 }
[a35b458]274
[b72efe8]275 fibril_mutex_unlock(&fs_list_lock);
[a35b458]276
[79ae36dd]277 return NULL;
[62da45a]278}
279
[79ae36dd]280/** End VFS server exchange.
281 *
282 * @param exch VFS server exchange.
[62da45a]283 *
284 */
[79ae36dd]285void vfs_exchange_release(async_exch_t *exch)
[62da45a]286{
[79ae36dd]287 async_exchange_end(exch);
[62da45a]288}
289
290/** Convert file system name to its handle.
291 *
[79ae36dd]292 * @param name File system name.
293 * @param lock If true, the function will lock and unlock the
[b72efe8]294 * fs_list_lock.
[79ae36dd]295 *
296 * @return File system handle or zero if file system not found.
[62da45a]297 *
298 */
[0d35511]299fs_handle_t fs_name_to_handle(unsigned int instance, const char *name, bool lock)
[62da45a]300{
301 int handle = 0;
[a35b458]302
[62da45a]303 if (lock)
[b72efe8]304 fibril_mutex_lock(&fs_list_lock);
[a35b458]305
[feeac0d]306 list_foreach(fs_list, fs_link, fs_info_t, fs) {
[4979403]307 if (str_cmp(fs->vfs_info.name, name) == 0 &&
[286286c]308 instance == fs->vfs_info.instance) {
[62da45a]309 handle = fs->fs_handle;
310 break;
311 }
312 }
[a35b458]313
[62da45a]314 if (lock)
[b72efe8]315 fibril_mutex_unlock(&fs_list_lock);
[a35b458]316
[62da45a]317 return handle;
318}
319
[f07f6b2]320/** Find the VFS info structure.
321 *
[79ae36dd]322 * @param handle FS handle for which the VFS info structure is sought.
323 *
324 * @return VFS info structure on success or NULL otherwise.
325 *
[f07f6b2]326 */
327vfs_info_t *fs_handle_to_info(fs_handle_t handle)
328{
329 vfs_info_t *info = NULL;
[a35b458]330
[b72efe8]331 fibril_mutex_lock(&fs_list_lock);
[feeac0d]332 list_foreach(fs_list, fs_link, fs_info_t, fs) {
[1b20da0]333 if (fs->fs_handle == handle) {
[f07f6b2]334 info = &fs->vfs_info;
335 break;
336 }
337 }
[b72efe8]338 fibril_mutex_unlock(&fs_list_lock);
[a35b458]339
[f07f6b2]340 return info;
341}
342
[b14d9f9]343/** Get list of file system types.
344 *
345 * @param fstypes Place to store list of file system types. Free using
346 * vfs_fstypes_free().
347 *
[cde999a]348 * @return EOK on success or an error code
[b14d9f9]349 */
[b7fd2a0]350errno_t vfs_get_fstypes(vfs_fstypes_t *fstypes)
[b14d9f9]351{
352 size_t size;
353 size_t count;
354 size_t l;
355
356 fibril_mutex_lock(&fs_list_lock);
[a35b458]357
[b14d9f9]358 size = 0;
359 count = 0;
360 list_foreach(fs_list, fs_link, fs_info_t, fs) {
361 size += str_size(fs->vfs_info.name) + 1;
362 count++;
363 }
[a35b458]364
[b14d9f9]365 if (size == 0)
366 size = 1;
[a35b458]367
[b14d9f9]368 fstypes->buf = calloc(1, size);
369 if (fstypes->buf == NULL) {
370 fibril_mutex_unlock(&fs_list_lock);
371 return ENOMEM;
372 }
[a35b458]373
[b14d9f9]374 fstypes->fstypes = calloc(sizeof(char *), count);
375 if (fstypes->fstypes == NULL) {
376 free(fstypes->buf);
377 fstypes->buf = NULL;
378 fibril_mutex_unlock(&fs_list_lock);
379 return ENOMEM;
380 }
[a35b458]381
[b14d9f9]382 fstypes->size = size;
[a35b458]383
[3bacee1]384 size = 0;
385 count = 0;
[b14d9f9]386 list_foreach(fs_list, fs_link, fs_info_t, fs) {
387 l = str_size(fs->vfs_info.name) + 1;
388 memcpy(fstypes->buf + size, fs->vfs_info.name, l);
389 fstypes->fstypes[count] = &fstypes->buf[size];
390 size += l;
391 count++;
392 }
393
394 fibril_mutex_unlock(&fs_list_lock);
395 return EOK;
396}
397
[62da45a]398/**
399 * @}
[79ae36dd]400 */
Note: See TracBrowser for help on using the repository browser.