WebSVN – HelenOS – Diff – /trunk/uspace/srv/vfs/vfs_ops.c


/*
 * Copyright (c) 2008 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - 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.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
 */
 
/** @addtogroup fs
 * @{
 */
 
/**
 * @file    vfs_ops.c
 * @brief   Operations that VFS offers to its clients.
 */
 
#include "vfs.h"
#include <ipc/ipc.h>
#include <async.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <bool.h>
#include <futex.h>
#include <rwlock.h>
#include <libadt/list.h>
#include <unistd.h>
#include <ctype.h>
#include <fcntl.h>
#include <assert.h>
#include <vfs/canonify.h>
 
/* Forward declarations of static functions. */
static int vfs_truncate_internal(fs_handle_t, dev_handle_t, fs_index_t, size_t);
 
/**
 * This rwlock prevents the race between a triplet-to-VFS-node resolution and a
 * concurrent VFS operation which modifies the file system namespace.
 */
RWLOCK_INITIALIZE(namespace_rwlock);
 
futex_t rootfs_futex = FUTEX_INITIALIZER;
vfs_pair_t rootfs = {
    .fs_handle = 0,
    .dev_handle = 0
};
 
void vfs_mount(ipc_callid_t rid, ipc_call_t *request)
{
    dev_handle_t dev_handle;
    vfs_node_t *mp_node = NULL;
    ipc_callid_t callid;
    ipc_call_t data;
    int rc;
    int phone;
    size_t size;
 
    /*
     * We expect the library to do the device-name to device-handle
     * translation for us, thus the device handle will arrive as ARG1
     * in the request.
     */
    dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
 
    /*
     * For now, don't make use of ARG2 and ARG3, but they can be used to
     * carry mount options in the future.
     */
 
 
 
 
    /*
     * Now, we expect the client to send us data with the name of the file
     * system.
     */
    if (!ipc_data_write_receive(&callid, &size)) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
 
    /*
     * Don't receive more than is necessary for storing a full file system
     * name.
     */
    if (size < 1 || size > FS_NAME_MAXLEN) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
 
    /* Deliver the file system name. */
    char fs_name[FS_NAME_MAXLEN + 1];
    (void) ipc_data_write_finalize(callid, fs_name, size);
    fs_name[size] = '\0';
   
    /*
     * Wait for IPC_M_PING so that we can return an error if we don't know
     * fs_name.
     */
    callid = async_get_call(&data);
    if (IPC_GET_METHOD(data) != IPC_M_PING) {
        ipc_answer_0(callid, ENOTSUP);
        ipc_answer_0(rid, ENOTSUP);
        return;
    }
 
    /*
     * Check if we know a file system with the same name as is in fs_name.
     * This will also give us its file system handle.
     */
    fs_handle_t fs_handle = fs_name_to_handle(fs_name, true);
    if (!fs_handle) {
        ipc_answer_0(callid, ENOENT);
        ipc_answer_0(rid, ENOENT);
        return;
    }
 
    /* Acknowledge that we know fs_name. */
    ipc_answer_0(callid, EOK);
 
    /* Now, we want the client to send us the mount point. */
    if (!ipc_data_write_receive(&callid, &size)) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
 
    /* Check whether size is reasonable wrt. the mount point. */
    if (size < 1 || size > MAX_PATH_LEN) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
    /* Allocate buffer for the mount point data being received. */
    uint8_t *buf;
    buf = malloc(size + 1);
    if (!buf) {
        ipc_answer_0(callid, ENOMEM);
        ipc_answer_0(rid, ENOMEM);
        return;
    }
 
    /* Deliver the mount point. */
    (void) ipc_data_write_finalize(callid, buf, size);
    buf[size] = '\0';
 
    /* Resolve the path to the mountpoint. */
    vfs_lookup_res_t mp_res;
    futex_down(&rootfs_futex);
    if (rootfs.fs_handle) {
        /* We already have the root FS. */
        rwlock_write_lock(&namespace_rwlock);
        if ((size == 1) && (buf[0] == '/')) {
            /* Trying to mount root FS over root FS */
            rwlock_write_unlock(&namespace_rwlock);
            futex_up(&rootfs_futex);
            free(buf);
            ipc_answer_0(rid, EBUSY);
            return;
        }
        rc = vfs_lookup_internal(buf, L_DIRECTORY, &mp_res, NULL);
        if (rc != EOK) {
            /* The lookup failed for some reason. */
            rwlock_write_unlock(&namespace_rwlock);
            futex_up(&rootfs_futex);
            free(buf);
            ipc_answer_0(rid, rc);
            return;
        }
        mp_node = vfs_node_get(&mp_res);
        if (!mp_node) {
            rwlock_write_unlock(&namespace_rwlock);
            futex_up(&rootfs_futex);
            free(buf);
            ipc_answer_0(rid, ENOMEM);
            return;
        }
        /*
         * Now we hold a reference to mp_node.
         * It will be dropped upon the corresponding VFS_UNMOUNT.
         * This prevents the mount point from being deleted.
         */
        rwlock_write_unlock(&namespace_rwlock);
    } else {
        /* We still don't have the root file system mounted. */
        if ((size == 1) && (buf[0] == '/')) {
            /*
             * For this simple, but important case,
             * we are almost done.
             */
            free(buf);
           
            /* Tell the mountee that it is being mounted. */
            phone = vfs_grab_phone(fs_handle);
            rc = async_req_1_0(phone, VFS_MOUNTED,
                (ipcarg_t) dev_handle);
            vfs_release_phone(phone);
 
            if (rc == EOK) {
                rootfs.fs_handle = fs_handle;
                rootfs.dev_handle = dev_handle;
            }
 
            futex_up(&rootfs_futex);
            ipc_answer_0(rid, rc);
            return;
        } else {
            /*
             * We can't resolve this without the root filesystem
             * being mounted first.
             */
            futex_up(&rootfs_futex);
            free(buf);
            ipc_answer_0(rid, ENOENT);
            return;
        }
    }
    futex_up(&rootfs_futex);
   
    free(buf);  /* The buffer is not needed anymore. */
   
    /*
     * At this point, we have all necessary pieces: file system and device
     * handles, and we know the mount point VFS node.
     */
 
    phone = vfs_grab_phone(mp_res.triplet.fs_handle);
    rc = async_req_4_0(phone, VFS_MOUNT,
        (ipcarg_t) mp_res.triplet.dev_handle,
        (ipcarg_t) mp_res.triplet.index,
        (ipcarg_t) fs_handle,
        (ipcarg_t) dev_handle);
    vfs_release_phone(phone);
 
    if (rc != EOK) {
        /* Mount failed, drop reference to mp_node. */
        if (mp_node)
            vfs_node_put(mp_node);
    }
   
    ipc_answer_0(rid, rc);
}
 
void vfs_open(ipc_callid_t rid, ipc_call_t *request)
{
    if (!vfs_files_init()) {
        ipc_answer_0(rid, ENOMEM);
        return;
    }
 
    /*
     * The POSIX interface is open(path, oflag, mode).
     * We can receive oflags and mode along with the VFS_OPEN call; the path
     * will need to arrive in another call.
     *
     * We also receive one private, non-POSIX set of flags called lflag
     * used to pass information to vfs_lookup_internal().
     */
    int lflag = IPC_GET_ARG1(*request);
    int oflag = IPC_GET_ARG2(*request);
    int mode = IPC_GET_ARG3(*request);
    size_t len;
 
    if (oflag & O_CREAT)
        lflag |= L_CREATE;
    if (oflag & O_EXCL)
        lflag |= L_EXCLUSIVE;
 
    ipc_callid_t callid;
 
    if (!ipc_data_write_receive(&callid, &len)) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
    char *path = malloc(len + 1);
    if (!path) {
        ipc_answer_0(callid, ENOMEM);
        ipc_answer_0(rid, ENOMEM);
        return;
    }
    int rc;
    if ((rc = ipc_data_write_finalize(callid, path, len))) {
        ipc_answer_0(rid, rc);
        free(path);
        return;
    }
    path[len] = '\0';
   
    /*
     * Avoid the race condition in which the file can be deleted before we
     * find/create-and-lock the VFS node corresponding to the looked-up
     * triplet.
     */
    if (lflag & L_CREATE)
        rwlock_write_lock(&namespace_rwlock);
    else
        rwlock_read_lock(&namespace_rwlock);
 
    /* The path is now populated and we can call vfs_lookup_internal(). */
    vfs_lookup_res_t lr;
    rc = vfs_lookup_internal(path, lflag, &lr, NULL);
    if (rc) {
        if (lflag & L_CREATE)
            rwlock_write_unlock(&namespace_rwlock);
        else
            rwlock_read_unlock(&namespace_rwlock);
        ipc_answer_0(rid, rc);
        free(path);
        return;
    }
 
    /* Path is no longer needed. */
    free(path);
 
    vfs_node_t *node = vfs_node_get(&lr);
    if (lflag & L_CREATE)
        rwlock_write_unlock(&namespace_rwlock);
    else
        rwlock_read_unlock(&namespace_rwlock);
 
    /* Truncate the file if requested and if necessary. */
    if (oflag & O_TRUNC) {
        rwlock_write_lock(&node->contents_rwlock);
        if (node->size) {
            rc = vfs_truncate_internal(node->fs_handle,
                node->dev_handle, node->index, 0);
            if (rc) {
                rwlock_write_unlock(&node->contents_rwlock);
                vfs_node_put(node);
                ipc_answer_0(rid, rc);
                return;
            }
            node->size = 0;
        }
        rwlock_write_unlock(&node->contents_rwlock);
    }
 
    /*
     * Get ourselves a file descriptor and the corresponding vfs_file_t
     * structure.
     */
    int fd = vfs_fd_alloc();
    if (fd < 0) {
        vfs_node_put(node);
        ipc_answer_0(rid, fd);
        return;
    }
    vfs_file_t *file = vfs_file_get(fd);
    file->node = node;
    if (oflag & O_APPEND)
        file->append = true;
 
    /*
     * The following increase in reference count is for the fact that the
     * file is being opened and that a file structure is pointing to it.
     * It is necessary so that the file will not disappear when
     * vfs_node_put() is called. The reference will be dropped by the
     * respective VFS_CLOSE.
     */
    vfs_node_addref(node);
    vfs_node_put(node);
 
    /* Success! Return the new file descriptor to the client. */
    ipc_answer_1(rid, EOK, fd);
}
 
void vfs_close(ipc_callid_t rid, ipc_call_t *request)
{
    int fd = IPC_GET_ARG1(*request);
    int rc = vfs_fd_free(fd);
    ipc_answer_0(rid, rc);
}
 
static void vfs_rdwr(ipc_callid_t rid, ipc_call_t *request, bool read)
{
 
    /*
     * The following code strongly depends on the fact that the files data
     * structure can be only accessed by a single fibril and all file
     * operations are serialized (i.e. the reads and writes cannot
     * interleave and a file cannot be closed while it is being read).
     *
     * Additional synchronization needs to be added once the table of
     * open files supports parallel access!
     */
 
    int fd = IPC_GET_ARG1(*request);
   
    /* Lookup the file structure corresponding to the file descriptor. */
    vfs_file_t *file = vfs_file_get(fd);
    if (!file) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
   
    /*
     * Now we need to receive a call with client's
     * IPC_M_DATA_READ/IPC_M_DATA_WRITE request.
     */
    ipc_callid_t callid;
    int res;
    if (read)
        res = ipc_data_read_receive(&callid, NULL);
    else
        res = ipc_data_write_receive(&callid, NULL);
    if (!res) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
   
    /*
     * Lock the open file structure so that no other thread can manipulate
     * the same open file at a time.
     */
    futex_down(&file->lock);
   
    /*
     * Lock the file's node so that no other client can read/write to it at
     * the same time.
     */
    if (read)
        rwlock_read_lock(&file->node->contents_rwlock);
    else
        rwlock_write_lock(&file->node->contents_rwlock);
   
    int fs_phone = vfs_grab_phone(file->node->fs_handle);  
   
    /* Make a VFS_READ/VFS_WRITE request at the destination FS server. */
    aid_t msg;
    ipc_call_t answer;
    if (!read && file->append)
        file->pos = file->node->size;
    msg = async_send_3(fs_phone, IPC_GET_METHOD(*request),
        file->node->dev_handle, file->node->index, file->pos, &answer);
   
    /*
     * Forward the IPC_M_DATA_READ/IPC_M_DATA_WRITE request to the
     * destination FS server. The call will be routed as if sent by
     * ourselves. Note that call arguments are immutable in this case so we
     * don't have to bother.
     */
    ipc_forward_fast(callid, fs_phone, 0, 0, 0, IPC_FF_ROUTE_FROM_ME);
   
    vfs_release_phone(fs_phone);
   
    /* Wait for reply from the FS server. */
    ipcarg_t rc;
    async_wait_for(msg, &rc);
    size_t bytes = IPC_GET_ARG1(answer);
   
    /* Unlock the VFS node. */
    if (read)
        rwlock_read_unlock(&file->node->contents_rwlock);
    else {
        /* Update the cached version of node's size. */
        if (rc == EOK)
            file->node->size = IPC_GET_ARG2(answer);
        rwlock_write_unlock(&file->node->contents_rwlock);
    }
   
    /* Update the position pointer and unlock the open file. */
    if (rc == EOK)
        file->pos += bytes;
    futex_up(&file->lock);
   
    /*
     * FS server's reply is the final result of the whole operation we
     * return to the client.
     */
    ipc_answer_1(rid, rc, bytes);
}
 
void vfs_read(ipc_callid_t rid, ipc_call_t *request)
{
    vfs_rdwr(rid, request, true);
}
 
void vfs_write(ipc_callid_t rid, ipc_call_t *request)
{
    vfs_rdwr(rid, request, false);
}
 
void vfs_seek(ipc_callid_t rid, ipc_call_t *request)
{
    int fd = (int) IPC_GET_ARG1(*request);
    off_t off = (off_t) IPC_GET_ARG2(*request);
    int whence = (int) IPC_GET_ARG3(*request);
 
 
    /* Lookup the file structure corresponding to the file descriptor. */
    vfs_file_t *file = vfs_file_get(fd);
    if (!file) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
 
    off_t newpos;
    futex_down(&file->lock);
    if (whence == SEEK_SET) {
        file->pos = off;
        futex_up(&file->lock);
        ipc_answer_1(rid, EOK, off);
        return;
    }
    if (whence == SEEK_CUR) {
        if (file->pos + off < file->pos) {
            futex_up(&file->lock);
            ipc_answer_0(rid, EOVERFLOW);
            return;
        }
        file->pos += off;
        newpos = file->pos;
        futex_up(&file->lock);
        ipc_answer_1(rid, EOK, newpos);
        return;
    }
    if (whence == SEEK_END) {
        rwlock_read_lock(&file->node->contents_rwlock);
        size_t size = file->node->size;
        rwlock_read_unlock(&file->node->contents_rwlock);
        if (size + off < size) {
            futex_up(&file->lock);
            ipc_answer_0(rid, EOVERFLOW);
            return;
        }
        newpos = size + off;
        futex_up(&file->lock);
        ipc_answer_1(rid, EOK, newpos);
        return;
    }
    futex_up(&file->lock);
    ipc_answer_0(rid, EINVAL);
}
 
int
vfs_truncate_internal(fs_handle_t fs_handle, dev_handle_t dev_handle,
    fs_index_t index, size_t size)
{
    ipcarg_t rc;
    int fs_phone;
   
    fs_phone = vfs_grab_phone(fs_handle);
    rc = async_req_3_0(fs_phone, VFS_TRUNCATE, (ipcarg_t)dev_handle,
        (ipcarg_t)index, (ipcarg_t)size);
    vfs_release_phone(fs_phone);
    return (int)rc;
}
 
void vfs_truncate(ipc_callid_t rid, ipc_call_t *request)
{
    int fd = IPC_GET_ARG1(*request);
    size_t size = IPC_GET_ARG2(*request);
    int rc;
 
    vfs_file_t *file = vfs_file_get(fd);
    if (!file) {
        ipc_answer_0(rid, ENOENT);
        return;
    }
    futex_down(&file->lock);
 
    rwlock_write_lock(&file->node->contents_rwlock);
    rc = vfs_truncate_internal(file->node->fs_handle,
        file->node->dev_handle, file->node->index, size);
    if (rc == EOK)
        file->node->size = size;
    rwlock_write_unlock(&file->node->contents_rwlock);
 
    futex_up(&file->lock);
    ipc_answer_0(rid, (ipcarg_t)rc);
}
 
void vfs_mkdir(ipc_callid_t rid, ipc_call_t *request)
{
    int mode = IPC_GET_ARG1(*request);
 
    size_t len;
    ipc_callid_t callid;
 
    if (!ipc_data_write_receive(&callid, &len)) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
    char *path = malloc(len + 1);
    if (!path) {
        ipc_answer_0(callid, ENOMEM);
        ipc_answer_0(rid, ENOMEM);
        return;
    }
    int rc;
    if ((rc = ipc_data_write_finalize(callid, path, len))) {
        ipc_answer_0(rid, rc);
        free(path);
        return;
    }
    path[len] = '\0';
   
    rwlock_write_lock(&namespace_rwlock);
    int lflag = L_DIRECTORY | L_CREATE | L_EXCLUSIVE;
    rc = vfs_lookup_internal(path, lflag, NULL, NULL);
    rwlock_write_unlock(&namespace_rwlock);
    free(path);
    ipc_answer_0(rid, rc);
}
 
void vfs_unlink(ipc_callid_t rid, ipc_call_t *request)
{
    int lflag = IPC_GET_ARG1(*request);
 
    size_t len;
    ipc_callid_t callid;
 
    if (!ipc_data_write_receive(&callid, &len)) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
    char *path = malloc(len + 1);
    if (!path) {
        ipc_answer_0(callid, ENOMEM);
        ipc_answer_0(rid, ENOMEM);
        return;
    }
    int rc;
    if ((rc = ipc_data_write_finalize(callid, path, len))) {
        ipc_answer_0(rid, rc);
        free(path);
        return;
    }
    path[len] = '\0';
   
    rwlock_write_lock(&namespace_rwlock);
    lflag &= L_DIRECTORY;   /* sanitize lflag */
    vfs_lookup_res_t lr;
    rc = vfs_lookup_internal(path, lflag | L_UNLINK, &lr, NULL);
    free(path);
    if (rc != EOK) {
        rwlock_write_unlock(&namespace_rwlock);
        ipc_answer_0(rid, rc);
        return;
    }
 
    /*
     * The name has already been unlinked by vfs_lookup_internal().
     * We have to get and put the VFS node to ensure that it is
     * VFS_DESTROY'ed after the last reference to it is dropped.
     */
    vfs_node_t *node = vfs_node_get(&lr);
    futex_down(&nodes_futex);
    node->lnkcnt--;
    futex_up(&nodes_futex);
    rwlock_write_unlock(&namespace_rwlock);
    vfs_node_put(node);
    ipc_answer_0(rid, EOK);
}
 
void vfs_rename(ipc_callid_t rid, ipc_call_t *request)
{
    size_t len;
    ipc_callid_t callid;
    int rc;
 
    /* Retrieve the old path. */
    if (!ipc_data_write_receive(&callid, &len)) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        return;
    }
    char *old = malloc(len + 1);
    if (!old) {
        ipc_answer_0(callid, ENOMEM);
        ipc_answer_0(rid, ENOMEM);
        return;
    }
    if ((rc = ipc_data_write_finalize(callid, old, len))) {
        ipc_answer_0(rid, rc);
        free(old);
        return;
    }
    old[len] = '\0';
   
    /* Retrieve the new path. */
    if (!ipc_data_write_receive(&callid, &len)) {
        ipc_answer_0(callid, EINVAL);
        ipc_answer_0(rid, EINVAL);
        free(old);
        return;
    }
    char *new = malloc(len + 1);
    if (!new) {
        ipc_answer_0(callid, ENOMEM);
        ipc_answer_0(rid, ENOMEM);
        free(old);
        return;
    }
    if ((rc = ipc_data_write_finalize(callid, new, len))) {
        ipc_answer_0(rid, rc);
        free(old);
        free(new);
        return;
    }
    new[len] = '\0';
 
    char *oldc = canonify(old, &len);
    char *newc = canonify(new, NULL);
    if (!oldc || !newc) {
        ipc_answer_0(rid, EINVAL);
        free(old);
        free(new);
        return;
    }
    if (!strncmp(newc, oldc, len)) {
        /* oldc is a prefix of newc */
        ipc_answer_0(rid, EINVAL);
        free(old);
        free(new);
        return;
    }
   
    vfs_lookup_res_t old_lr;
    vfs_lookup_res_t new_lr;
    vfs_lookup_res_t new_par_lr;
    rwlock_write_lock(&namespace_rwlock);
    /* Lookup the node belonging to the old file name. */
    rc = vfs_lookup_internal(oldc, L_NONE, &old_lr, NULL);
    if (rc != EOK) {
        rwlock_write_unlock(&namespace_rwlock);
        ipc_answer_0(rid, rc);
        free(old);
        free(new);
        return;
    }
    vfs_node_t *old_node = vfs_node_get(&old_lr);
    if (!old_node) {
        rwlock_write_unlock(&namespace_rwlock);
        ipc_answer_0(rid, ENOMEM);
        free(old);
        free(new);
        return;
    }
    /* Lookup parent of the new file name. */
    rc = vfs_lookup_internal(newc, L_PARENT, &new_par_lr, NULL);
    if (rc != EOK) {
        rwlock_write_unlock(&namespace_rwlock);
        ipc_answer_0(rid, rc);
        free(old);
        free(new);
        return;
    }
    /* Check whether linking to the same file system instance. */
    if ((old_node->fs_handle != new_par_lr.triplet.fs_handle) ||
        (old_node->dev_handle != new_par_lr.triplet.dev_handle)) {
        rwlock_write_unlock(&namespace_rwlock);
        ipc_answer_0(rid, EXDEV);   /* different file systems */
        free(old);
        free(new);
        return;
    }
    /* Destroy the old link for the new name. */
    vfs_node_t *new_node = NULL;
    rc = vfs_lookup_internal(newc, L_UNLINK, &new_lr, NULL);
    switch (rc) {
    case ENOENT:
        /* simply not in our way */
        break;
    case EOK:
        new_node = vfs_node_get(&new_lr);
        if (!new_node) {
            rwlock_write_unlock(&namespace_rwlock);
            ipc_answer_0(rid, ENOMEM);
            free(old);
            free(new);
            return;
        }
        futex_down(&nodes_futex);
        new_node->lnkcnt--;
        futex_up(&nodes_futex);
        break;
    default:
        rwlock_write_unlock(&namespace_rwlock);
        ipc_answer_0(rid, ENOTEMPTY);
        free(old);
        free(new);
        return;
    }
    /* Create the new link for the new name. */
    rc = vfs_lookup_internal(newc, L_LINK, NULL, NULL, old_node->index);
    if (rc != EOK) {
        rwlock_write_unlock(&namespace_rwlock);
        if (new_node)
            vfs_node_put(new_node);
        ipc_answer_0(rid, rc);
        free(old);
        free(new);
        return;
    }
    futex_down(&nodes_futex);
    old_node->lnkcnt++;
    futex_up(&nodes_futex);
    /* Destroy the link for the old name. */
    rc = vfs_lookup_internal(oldc, L_UNLINK, NULL, NULL);
    if (rc != EOK) {
        rwlock_write_unlock(&namespace_rwlock);
        vfs_node_put(old_node);
        if (new_node)
            vfs_node_put(new_node);
        ipc_answer_0(rid, rc);
        free(old);
        free(new);
        return;
    }
    futex_down(&nodes_futex);
    old_node->lnkcnt--;
    futex_up(&nodes_futex);
    rwlock_write_unlock(&namespace_rwlock);
    vfs_node_put(old_node);
    if (new_node)
        vfs_node_put(new_node);
    free(old);
    free(new);
    ipc_answer_0(rid, EOK);
}
 
/**
 * @}
 */
 

Rev 3215	Rev 3255
1	/*	1	/*
2	* Copyright (c) 2008 Jakub Jermar	2	* Copyright (c) 2008 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	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	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.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	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	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	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	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	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	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.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	/** @addtogroup fs	29	/** @addtogroup fs
30	* @{	30	* @{
31	*/	31	*/
32		32
33	/**	33	/**
34	* @file vfs_ops.c	34	* @file vfs_ops.c
35	* @brief Operations that VFS offers to its clients.	35	* @brief Operations that VFS offers to its clients.
36	*/	36	*/
37		37
38	#include "vfs.h"	38	#include "vfs.h"
39	#include <ipc/ipc.h>	39	#include <ipc/ipc.h>
40	#include <async.h>	40	#include <async.h>
41	#include <errno.h>	41	#include <errno.h>
42	#include <stdio.h>	42	#include <stdio.h>
43	#include <stdlib.h>	43	#include <stdlib.h>
44	#include <string.h>	44	#include <string.h>
45	#include <bool.h>	45	#include <bool.h>
46	#include <futex.h>	46	#include <futex.h>
47	#include <rwlock.h>	47	#include <rwlock.h>
48	#include <libadt/list.h>	48	#include <libadt/list.h>
49	#include <unistd.h>	49	#include <unistd.h>
50	#include <ctype.h>	50	#include <ctype.h>
51	#include <fcntl.h>	51	#include <fcntl.h>
52	#include <assert.h>	52	#include <assert.h>
53	#include <vfs/canonify.h>	53	#include <vfs/canonify.h>
54		54
55	/* Forward declarations of static functions. */	55	/* Forward declarations of static functions. */
56	static int vfs_truncate_internal(fs_handle_t, dev_handle_t, fs_index_t, size_t);	56	static int vfs_truncate_internal(fs_handle_t, dev_handle_t, fs_index_t, size_t);
57		57
58	/**	58	/**
59	* This rwlock prevents the race between a triplet-to-VFS-node resolution and a	59	* This rwlock prevents the race between a triplet-to-VFS-node resolution and a
60	* concurrent VFS operation which modifies the file system namespace.	60	* concurrent VFS operation which modifies the file system namespace.
61	*/	61	*/
62	RWLOCK_INITIALIZE(namespace_rwlock);	62	RWLOCK_INITIALIZE(namespace_rwlock);
63		63
64	futex_t rootfs_futex = FUTEX_INITIALIZER;	64	futex_t rootfs_futex = FUTEX_INITIALIZER;
65	vfs_pair_t rootfs = {	65	vfs_pair_t rootfs = {
66	.fs_handle = 0,	66	.fs_handle = 0,
67	.dev_handle = 0	67	.dev_handle = 0
68	};	68	};
69		69
70	void vfs_mount(ipc_callid_t rid, ipc_call_t *request)	70	void vfs_mount(ipc_callid_t rid, ipc_call_t *request)
71	{	71	{
72	dev_handle_t dev_handle;	72	dev_handle_t dev_handle;
73	vfs_node_t *mp_node = NULL;	73	vfs_node_t *mp_node = NULL;
-		74	ipc_callid_t callid;
-		75	ipc_call_t data;
74	int rc;	76	int rc;
75	int phone;	77	int phone;
-		78	size_t size;
76		79
77	/*	80	/*
78	* We expect the library to do the device-name to device-handle	81	* We expect the library to do the device-name to device-handle
79	* translation for us, thus the device handle will arrive as ARG1	82	* translation for us, thus the device handle will arrive as ARG1
80	* in the request.	83	* in the request.
81	*/	84	*/
82	dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);	85	dev_handle = (dev_handle_t)IPC_GET_ARG1(*request);
83		86
84	/*	87	/*
85	* For now, don't make use of ARG2 and ARG3, but they can be used to	88	* For now, don't make use of ARG2 and ARG3, but they can be used to
86	* carry mount options in the future.	89	* carry mount options in the future.
87	*/	90	*/
88		91
89	ipc_callid_t callid;	-
90	size_t size;	-
91		-
92	/*	92	/*
93	* Now, we expect the client to send us data with the name of the file	93	* Now, we expect the client to send us data with the name of the file
94	* system.	94	* system.
95	*/	95	*/
96	if (!ipc_data_write_receive(&callid, &size)) {	96	if (!ipc_data_write_receive(&callid, &size)) {
97	ipc_answer_0(callid, EINVAL);	97	ipc_answer_0(callid, EINVAL);
98	ipc_answer_0(rid, EINVAL);	98	ipc_answer_0(rid, EINVAL);
99	return;	99	return;
100	}	100	}
101		101
102	/*	102	/*
103	* Don't receive more than is necessary for storing a full file system	103	* Don't receive more than is necessary for storing a full file system
104	* name.	104	* name.
105	*/	105	*/
106	if (size < 1 \|\| size > FS_NAME_MAXLEN) {	106	if (size < 1 \|\| size > FS_NAME_MAXLEN) {
107	ipc_answer_0(callid, EINVAL);	107	ipc_answer_0(callid, EINVAL);
108	ipc_answer_0(rid, EINVAL);	108	ipc_answer_0(rid, EINVAL);
109	return;	109	return;
110	}	110	}
111		111
112	/* Deliver the file system name. */	112	/* Deliver the file system name. */
113	char fs_name[FS_NAME_MAXLEN + 1];	113	char fs_name[FS_NAME_MAXLEN + 1];
114	(void) ipc_data_write_finalize(callid, fs_name, size);	114	(void) ipc_data_write_finalize(callid, fs_name, size);
115	fs_name[size] = '\0';	115	fs_name[size] = '\0';
116		116
117	/*	117	/*
-		118	* Wait for IPC_M_PING so that we can return an error if we don't know
-		119	* fs_name.
-		120	*/
-		121	callid = async_get_call(&data);
-		122	if (IPC_GET_METHOD(data) != IPC_M_PING) {
-		123	ipc_answer_0(callid, ENOTSUP);
-		124	ipc_answer_0(rid, ENOTSUP);
-		125	return;
-		126	}
-		127
-		128	/*
118	* Check if we know a file system with the same name as is in fs_name.	129	* Check if we know a file system with the same name as is in fs_name.
119	* This will also give us its file system handle.	130	* This will also give us its file system handle.
120	*/	131	*/
121	fs_handle_t fs_handle = fs_name_to_handle(fs_name, true);	132	fs_handle_t fs_handle = fs_name_to_handle(fs_name, true);
122	if (!fs_handle) {	133	if (!fs_handle) {
-		134	ipc_answer_0(callid, ENOENT);
123	ipc_answer_0(rid, ENOENT);	135	ipc_answer_0(rid, ENOENT);
124	return;	136	return;
125	}	137	}
126		138
-		139	/* Acknowledge that we know fs_name. */
-		140	ipc_answer_0(callid, EOK);
-		141
127	/* Now, we want the client to send us the mount point. */	142	/* Now, we want the client to send us the mount point. */
128	if (!ipc_data_write_receive(&callid, &size)) {	143	if (!ipc_data_write_receive(&callid, &size)) {
129	ipc_answer_0(callid, EINVAL);	144	ipc_answer_0(callid, EINVAL);
130	ipc_answer_0(rid, EINVAL);	145	ipc_answer_0(rid, EINVAL);
131	return;	146	return;
132	}	147	}
133		148
134	/* Check whether size is reasonable wrt. the mount point. */	149	/* Check whether size is reasonable wrt. the mount point. */
135	if (size < 1 \|\| size > MAX_PATH_LEN) {	150	if (size < 1 \|\| size > MAX_PATH_LEN) {
136	ipc_answer_0(callid, EINVAL);	151	ipc_answer_0(callid, EINVAL);
137	ipc_answer_0(rid, EINVAL);	152	ipc_answer_0(rid, EINVAL);
138	return;	153	return;
139	}	154	}
140	/* Allocate buffer for the mount point data being received. */	155	/* Allocate buffer for the mount point data being received. */
141	uint8_t *buf;	156	uint8_t *buf;
142	buf = malloc(size + 1);	157	buf = malloc(size + 1);
143	if (!buf) {	158	if (!buf) {
144	ipc_answer_0(callid, ENOMEM);	159	ipc_answer_0(callid, ENOMEM);
145	ipc_answer_0(rid, ENOMEM);	160	ipc_answer_0(rid, ENOMEM);
146	return;	161	return;
147	}	162	}
148		163
149	/* Deliver the mount point. */	164	/* Deliver the mount point. */
150	(void) ipc_data_write_finalize(callid, buf, size);	165	(void) ipc_data_write_finalize(callid, buf, size);
151	buf[size] = '\0';	166	buf[size] = '\0';
152		167
153	/* Resolve the path to the mountpoint. */	168	/* Resolve the path to the mountpoint. */
154	vfs_lookup_res_t mp_res;	169	vfs_lookup_res_t mp_res;
155	futex_down(&rootfs_futex);	170	futex_down(&rootfs_futex);
156	if (rootfs.fs_handle) {	171	if (rootfs.fs_handle) {
157	/* We already have the root FS. */	172	/* We already have the root FS. */
158	rwlock_write_lock(&namespace_rwlock);	173	rwlock_write_lock(&namespace_rwlock);
159	if ((size == 1) && (buf[0] == '/')) {	174	if ((size == 1) && (buf[0] == '/')) {
160	/* Trying to mount root FS over root FS */	175	/* Trying to mount root FS over root FS */
161	rwlock_write_unlock(&namespace_rwlock);	176	rwlock_write_unlock(&namespace_rwlock);
162	futex_up(&rootfs_futex);	177	futex_up(&rootfs_futex);
163	free(buf);	178	free(buf);
164	ipc_answer_0(rid, EBUSY);	179	ipc_answer_0(rid, EBUSY);
165	return;	180	return;
166	}	181	}
167	rc = vfs_lookup_internal(buf, L_DIRECTORY, &mp_res, NULL);	182	rc = vfs_lookup_internal(buf, L_DIRECTORY, &mp_res, NULL);
168	if (rc != EOK) {	183	if (rc != EOK) {
169	/* The lookup failed for some reason. */	184	/* The lookup failed for some reason. */
170	rwlock_write_unlock(&namespace_rwlock);	185	rwlock_write_unlock(&namespace_rwlock);
171	futex_up(&rootfs_futex);	186	futex_up(&rootfs_futex);
172	free(buf);	187	free(buf);
173	ipc_answer_0(rid, rc);	188	ipc_answer_0(rid, rc);
174	return;	189	return;
175	}	190	}
176	mp_node = vfs_node_get(&mp_res);	191	mp_node = vfs_node_get(&mp_res);
177	if (!mp_node) {	192	if (!mp_node) {
178	rwlock_write_unlock(&namespace_rwlock);	193	rwlock_write_unlock(&namespace_rwlock);
179	futex_up(&rootfs_futex);	194	futex_up(&rootfs_futex);
180	free(buf);	195	free(buf);
181	ipc_answer_0(rid, ENOMEM);	196	ipc_answer_0(rid, ENOMEM);
182	return;	197	return;
183	}	198	}
184	/*	199	/*
185	* Now we hold a reference to mp_node.	200	* Now we hold a reference to mp_node.
186	* It will be dropped upon the corresponding VFS_UNMOUNT.	201	* It will be dropped upon the corresponding VFS_UNMOUNT.
187	* This prevents the mount point from being deleted.	202	* This prevents the mount point from being deleted.
188	*/	203	*/
189	rwlock_write_unlock(&namespace_rwlock);	204	rwlock_write_unlock(&namespace_rwlock);
190	} else {	205	} else {
191	/* We still don't have the root file system mounted. */	206	/* We still don't have the root file system mounted. */
192	if ((size == 1) && (buf[0] == '/')) {	207	if ((size == 1) && (buf[0] == '/')) {
193	/*	208	/*
194	* For this simple, but important case,	209	* For this simple, but important case,
195	* we are almost done.	210	* we are almost done.
196	*/	211	*/
197	free(buf);	212	free(buf);
198		213
199	/* Tell the mountee that it is being mounted. */	214	/* Tell the mountee that it is being mounted. */
200	phone = vfs_grab_phone(fs_handle);	215	phone = vfs_grab_phone(fs_handle);
201	rc = async_req_1_0(phone, VFS_MOUNTED,	216	rc = async_req_1_0(phone, VFS_MOUNTED,
202	(ipcarg_t) dev_handle);	217	(ipcarg_t) dev_handle);
203	vfs_release_phone(phone);	218	vfs_release_phone(phone);
204		219
205	if (rc == EOK) {	220	if (rc == EOK) {
206	rootfs.fs_handle = fs_handle;	221	rootfs.fs_handle = fs_handle;
207	rootfs.dev_handle = dev_handle;	222	rootfs.dev_handle = dev_handle;
208	}	223	}
209		224
210	futex_up(&rootfs_futex);	225	futex_up(&rootfs_futex);
211	ipc_answer_0(rid, rc);	226	ipc_answer_0(rid, rc);
212	return;	227	return;
213	} else {	228	} else {
214	/*	229	/*
215	* We can't resolve this without the root filesystem	230	* We can't resolve this without the root filesystem
216	* being mounted first.	231	* being mounted first.
217	*/	232	*/
218	futex_up(&rootfs_futex);	233	futex_up(&rootfs_futex);
219	free(buf);	234	free(buf);
220	ipc_answer_0(rid, ENOENT);	235	ipc_answer_0(rid, ENOENT);
221	return;	236	return;
222	}	237	}
223	}	238	}
224	futex_up(&rootfs_futex);	239	futex_up(&rootfs_futex);
225		240
226	free(buf); /* The buffer is not needed anymore. */	241	free(buf); /* The buffer is not needed anymore. */
227		242
228	/*	243	/*
229	* At this point, we have all necessary pieces: file system and device	244	* At this point, we have all necessary pieces: file system and device
230	* handles, and we know the mount point VFS node.	245	* handles, and we know the mount point VFS node.
231	*/	246	*/
232		247
233	phone = vfs_grab_phone(mp_res.triplet.fs_handle);	248	phone = vfs_grab_phone(mp_res.triplet.fs_handle);
234	rc = async_req_4_0(phone, VFS_MOUNT,	249	rc = async_req_4_0(phone, VFS_MOUNT,
235	(ipcarg_t) mp_res.triplet.dev_handle,	250	(ipcarg_t) mp_res.triplet.dev_handle,
236	(ipcarg_t) mp_res.triplet.index,	251	(ipcarg_t) mp_res.triplet.index,
237	(ipcarg_t) fs_handle,	252	(ipcarg_t) fs_handle,
238	(ipcarg_t) dev_handle);	253	(ipcarg_t) dev_handle);
239	vfs_release_phone(phone);	254	vfs_release_phone(phone);
240		255
241	if (rc != EOK) {	256	if (rc != EOK) {
242	/* Mount failed, drop reference to mp_node. */	257	/* Mount failed, drop reference to mp_node. */
243	if (mp_node)	258	if (mp_node)
244	vfs_node_put(mp_node);	259	vfs_node_put(mp_node);
245	}	260	}
246		261
247	ipc_answer_0(rid, rc);	262	ipc_answer_0(rid, rc);
248	}	263	}
249		264
250	void vfs_open(ipc_callid_t rid, ipc_call_t *request)	265	void vfs_open(ipc_callid_t rid, ipc_call_t *request)
251	{	266	{
252	if (!vfs_files_init()) {	267	if (!vfs_files_init()) {
253	ipc_answer_0(rid, ENOMEM);	268	ipc_answer_0(rid, ENOMEM);
254	return;	269	return;
255	}	270	}
256		271
257	/*	272	/*
258	* The POSIX interface is open(path, oflag, mode).	273	* The POSIX interface is open(path, oflag, mode).
259	* We can receive oflags and mode along with the VFS_OPEN call; the path	274	* We can receive oflags and mode along with the VFS_OPEN call; the path
260	* will need to arrive in another call.	275	* will need to arrive in another call.
261	*	276	*
262	* We also receive one private, non-POSIX set of flags called lflag	277	* We also receive one private, non-POSIX set of flags called lflag
263	* used to pass information to vfs_lookup_internal().	278	* used to pass information to vfs_lookup_internal().
264	*/	279	*/
265	int lflag = IPC_GET_ARG1(*request);	280	int lflag = IPC_GET_ARG1(*request);
266	int oflag = IPC_GET_ARG2(*request);	281	int oflag = IPC_GET_ARG2(*request);
267	int mode = IPC_GET_ARG3(*request);	282	int mode = IPC_GET_ARG3(*request);
268	size_t len;	283	size_t len;
269		284
270	if (oflag & O_CREAT)	285	if (oflag & O_CREAT)
271	lflag \|= L_CREATE;	286	lflag \|= L_CREATE;
272	if (oflag & O_EXCL)	287	if (oflag & O_EXCL)
273	lflag \|= L_EXCLUSIVE;	288	lflag \|= L_EXCLUSIVE;
274		289
275	ipc_callid_t callid;	290	ipc_callid_t callid;
276		291
277	if (!ipc_data_write_receive(&callid, &len)) {	292	if (!ipc_data_write_receive(&callid, &len)) {
278	ipc_answer_0(callid, EINVAL);	293	ipc_answer_0(callid, EINVAL);
279	ipc_answer_0(rid, EINVAL);	294	ipc_answer_0(rid, EINVAL);
280	return;	295	return;
281	}	296	}
282	char *path = malloc(len + 1);	297	char *path = malloc(len + 1);
283	if (!path) {	298	if (!path) {
284	ipc_answer_0(callid, ENOMEM);	299	ipc_answer_0(callid, ENOMEM);
285	ipc_answer_0(rid, ENOMEM);	300	ipc_answer_0(rid, ENOMEM);
286	return;	301	return;
287	}	302	}
288	int rc;	303	int rc;
289	if ((rc = ipc_data_write_finalize(callid, path, len))) {	304	if ((rc = ipc_data_write_finalize(callid, path, len))) {
290	ipc_answer_0(rid, rc);	305	ipc_answer_0(rid, rc);
291	free(path);	306	free(path);
292	return;	307	return;
293	}	308	}
294	path[len] = '\0';	309	path[len] = '\0';
295		310
296	/*	311	/*
297	* Avoid the race condition in which the file can be deleted before we	312	* Avoid the race condition in which the file can be deleted before we
298	* find/create-and-lock the VFS node corresponding to the looked-up	313	* find/create-and-lock the VFS node corresponding to the looked-up
299	* triplet.	314	* triplet.
300	*/	315	*/
301	if (lflag & L_CREATE)	316	if (lflag & L_CREATE)
302	rwlock_write_lock(&namespace_rwlock);	317	rwlock_write_lock(&namespace_rwlock);
303	else	318	else
304	rwlock_read_lock(&namespace_rwlock);	319	rwlock_read_lock(&namespace_rwlock);
305		320
306	/* The path is now populated and we can call vfs_lookup_internal(). */	321	/* The path is now populated and we can call vfs_lookup_internal(). */
307	vfs_lookup_res_t lr;	322	vfs_lookup_res_t lr;
308	rc = vfs_lookup_internal(path, lflag, &lr, NULL);	323	rc = vfs_lookup_internal(path, lflag, &lr, NULL);
309	if (rc) {	324	if (rc) {
310	if (lflag & L_CREATE)	325	if (lflag & L_CREATE)
311	rwlock_write_unlock(&namespace_rwlock);	326	rwlock_write_unlock(&namespace_rwlock);
312	else	327	else
313	rwlock_read_unlock(&namespace_rwlock);	328	rwlock_read_unlock(&namespace_rwlock);
314	ipc_answer_0(rid, rc);	329	ipc_answer_0(rid, rc);
315	free(path);	330	free(path);
316	return;	331	return;
317	}	332	}
318		333
319	/* Path is no longer needed. */	334	/* Path is no longer needed. */
320	free(path);	335	free(path);
321		336
322	vfs_node_t *node = vfs_node_get(&lr);	337	vfs_node_t *node = vfs_node_get(&lr);
323	if (lflag & L_CREATE)	338	if (lflag & L_CREATE)
324	rwlock_write_unlock(&namespace_rwlock);	339	rwlock_write_unlock(&namespace_rwlock);
325	else	340	else
326	rwlock_read_unlock(&namespace_rwlock);	341	rwlock_read_unlock(&namespace_rwlock);
327		342
328	/* Truncate the file if requested and if necessary. */	343	/* Truncate the file if requested and if necessary. */
329	if (oflag & O_TRUNC) {	344	if (oflag & O_TRUNC) {
330	rwlock_write_lock(&node->contents_rwlock);	345	rwlock_write_lock(&node->contents_rwlock);
331	if (node->size) {	346	if (node->size) {
332	rc = vfs_truncate_internal(node->fs_handle,	347	rc = vfs_truncate_internal(node->fs_handle,
333	node->dev_handle, node->index, 0);	348	node->dev_handle, node->index, 0);
334	if (rc) {	349	if (rc) {
335	rwlock_write_unlock(&node->contents_rwlock);	350	rwlock_write_unlock(&node->contents_rwlock);
336	vfs_node_put(node);	351	vfs_node_put(node);
337	ipc_answer_0(rid, rc);	352	ipc_answer_0(rid, rc);
338	return;	353	return;
339	}	354	}
340	node->size = 0;	355	node->size = 0;
341	}	356	}
342	rwlock_write_unlock(&node->contents_rwlock);	357	rwlock_write_unlock(&node->contents_rwlock);
343	}	358	}
344		359
345	/*	360	/*
346	* Get ourselves a file descriptor and the corresponding vfs_file_t	361	* Get ourselves a file descriptor and the corresponding vfs_file_t
347	* structure.	362	* structure.
348	*/	363	*/
349	int fd = vfs_fd_alloc();	364	int fd = vfs_fd_alloc();
350	if (fd < 0) {	365	if (fd < 0) {
351	vfs_node_put(node);	366	vfs_node_put(node);
352	ipc_answer_0(rid, fd);	367	ipc_answer_0(rid, fd);
353	return;	368	return;
354	}	369	}
355	vfs_file_t *file = vfs_file_get(fd);	370	vfs_file_t *file = vfs_file_get(fd);
356	file->node = node;	371	file->node = node;
357	if (oflag & O_APPEND)	372	if (oflag & O_APPEND)
358	file->append = true;	373	file->append = true;
359		374
360	/*	375	/*
361	* The following increase in reference count is for the fact that the	376	* The following increase in reference count is for the fact that the
362	* file is being opened and that a file structure is pointing to it.	377	* file is being opened and that a file structure is pointing to it.
363	* It is necessary so that the file will not disappear when	378	* It is necessary so that the file will not disappear when
364	* vfs_node_put() is called. The reference will be dropped by the	379	* vfs_node_put() is called. The reference will be dropped by the
365	* respective VFS_CLOSE.	380	* respective VFS_CLOSE.
366	*/	381	*/
367	vfs_node_addref(node);	382	vfs_node_addref(node);
368	vfs_node_put(node);	383	vfs_node_put(node);
369		384
370	/* Success! Return the new file descriptor to the client. */	385	/* Success! Return the new file descriptor to the client. */
371	ipc_answer_1(rid, EOK, fd);	386	ipc_answer_1(rid, EOK, fd);
372	}	387	}
373		388
374	void vfs_close(ipc_callid_t rid, ipc_call_t *request)	389	void vfs_close(ipc_callid_t rid, ipc_call_t *request)
375	{	390	{
376	int fd = IPC_GET_ARG1(*request);	391	int fd = IPC_GET_ARG1(*request);
377	int rc = vfs_fd_free(fd);	392	int rc = vfs_fd_free(fd);
378	ipc_answer_0(rid, rc);	393	ipc_answer_0(rid, rc);
379	}	394	}
380		395
381	static void vfs_rdwr(ipc_callid_t rid, ipc_call_t *request, bool read)	396	static void vfs_rdwr(ipc_callid_t rid, ipc_call_t *request, bool read)
382	{	397	{
383		398
384	/*	399	/*
385	* The following code strongly depends on the fact that the files data	400	* The following code strongly depends on the fact that the files data
386	* structure can be only accessed by a single fibril and all file	401	* structure can be only accessed by a single fibril and all file
387	* operations are serialized (i.e. the reads and writes cannot	402	* operations are serialized (i.e. the reads and writes cannot
388	* interleave and a file cannot be closed while it is being read).	403	* interleave and a file cannot be closed while it is being read).
389	*	404	*
390	* Additional synchronization needs to be added once the table of	405	* Additional synchronization needs to be added once the table of
391	* open files supports parallel access!	406	* open files supports parallel access!
392	*/	407	*/
393		408
394	int fd = IPC_GET_ARG1(*request);	409	int fd = IPC_GET_ARG1(*request);
395		410
396	/* Lookup the file structure corresponding to the file descriptor. */	411	/* Lookup the file structure corresponding to the file descriptor. */
397	vfs_file_t *file = vfs_file_get(fd);	412	vfs_file_t *file = vfs_file_get(fd);
398	if (!file) {	413	if (!file) {
399	ipc_answer_0(rid, ENOENT);	414	ipc_answer_0(rid, ENOENT);
400	return;	415	return;
401	}	416	}
402		417
403	/*	418	/*
404	* Now we need to receive a call with client's	419	* Now we need to receive a call with client's
405	* IPC_M_DATA_READ/IPC_M_DATA_WRITE request.	420	* IPC_M_DATA_READ/IPC_M_DATA_WRITE request.
406	*/	421	*/
407	ipc_callid_t callid;	422	ipc_callid_t callid;
408	int res;	423	int res;
409	if (read)	424	if (read)
410	res = ipc_data_read_receive(&callid, NULL);	425	res = ipc_data_read_receive(&callid, NULL);
411	else	426	else
412	res = ipc_data_write_receive(&callid, NULL);	427	res = ipc_data_write_receive(&callid, NULL);
413	if (!res) {	428	if (!res) {
414	ipc_answer_0(callid, EINVAL);	429	ipc_answer_0(callid, EINVAL);
415	ipc_answer_0(rid, EINVAL);	430	ipc_answer_0(rid, EINVAL);
416	return;	431	return;
417	}	432	}
418		433
419	/*	434	/*
420	* Lock the open file structure so that no other thread can manipulate	435	* Lock the open file structure so that no other thread can manipulate
421	* the same open file at a time.	436	* the same open file at a time.
422	*/	437	*/
423	futex_down(&file->lock);	438	futex_down(&file->lock);
424		439
425	/*	440	/*
426	* Lock the file's node so that no other client can read/write to it at	441	* Lock the file's node so that no other client can read/write to it at
427	* the same time.	442	* the same time.
428	*/	443	*/
429	if (read)	444	if (read)
430	rwlock_read_lock(&file->node->contents_rwlock);	445	rwlock_read_lock(&file->node->contents_rwlock);
431	else	446	else
432	rwlock_write_lock(&file->node->contents_rwlock);	447	rwlock_write_lock(&file->node->contents_rwlock);
433		448
434	int fs_phone = vfs_grab_phone(file->node->fs_handle);	449	int fs_phone = vfs_grab_phone(file->node->fs_handle);
435		450
436	/* Make a VFS_READ/VFS_WRITE request at the destination FS server. */	451	/* Make a VFS_READ/VFS_WRITE request at the destination FS server. */
437	aid_t msg;	452	aid_t msg;
438	ipc_call_t answer;	453	ipc_call_t answer;
439	if (!read && file->append)	454	if (!read && file->append)
440	file->pos = file->node->size;	455	file->pos = file->node->size;
441	msg = async_send_3(fs_phone, IPC_GET_METHOD(*request),	456	msg = async_send_3(fs_phone, IPC_GET_METHOD(*request),
442	file->node->dev_handle, file->node->index, file->pos, &answer);	457	file->node->dev_handle, file->node->index, file->pos, &answer);
443		458
444	/*	459	/*
445	* Forward the IPC_M_DATA_READ/IPC_M_DATA_WRITE request to the	460	* Forward the IPC_M_DATA_READ/IPC_M_DATA_WRITE request to the
446	* destination FS server. The call will be routed as if sent by	461	* destination FS server. The call will be routed as if sent by
447	* ourselves. Note that call arguments are immutable in this case so we	462	* ourselves. Note that call arguments are immutable in this case so we
448	* don't have to bother.	463	* don't have to bother.
449	*/	464	*/
450	ipc_forward_fast(callid, fs_phone, 0, 0, 0, IPC_FF_ROUTE_FROM_ME);	465	ipc_forward_fast(callid, fs_phone, 0, 0, 0, IPC_FF_ROUTE_FROM_ME);
451		466
452	vfs_release_phone(fs_phone);	467	vfs_release_phone(fs_phone);
453		468
454	/* Wait for reply from the FS server. */	469	/* Wait for reply from the FS server. */
455	ipcarg_t rc;	470	ipcarg_t rc;
456	async_wait_for(msg, &rc);	471	async_wait_for(msg, &rc);
457	size_t bytes = IPC_GET_ARG1(answer);	472	size_t bytes = IPC_GET_ARG1(answer);
458		473
459	/* Unlock the VFS node. */	474	/* Unlock the VFS node. */
460	if (read)	475	if (read)
461	rwlock_read_unlock(&file->node->contents_rwlock);	476	rwlock_read_unlock(&file->node->contents_rwlock);
462	else {	477	else {
463	/* Update the cached version of node's size. */	478	/* Update the cached version of node's size. */
464	if (rc == EOK)	479	if (rc == EOK)
465	file->node->size = IPC_GET_ARG2(answer);	480	file->node->size = IPC_GET_ARG2(answer);
466	rwlock_write_unlock(&file->node->contents_rwlock);	481	rwlock_write_unlock(&file->node->contents_rwlock);
467	}	482	}
468		483
469	/* Update the position pointer and unlock the open file. */	484	/* Update the position pointer and unlock the open file. */
470	if (rc == EOK)	485	if (rc == EOK)
471	file->pos += bytes;	486	file->pos += bytes;
472	futex_up(&file->lock);	487	futex_up(&file->lock);
473		488
474	/*	489	/*
475	* FS server's reply is the final result of the whole operation we	490	* FS server's reply is the final result of the whole operation we
476	* return to the client.	491	* return to the client.
477	*/	492	*/
478	ipc_answer_1(rid, rc, bytes);	493	ipc_answer_1(rid, rc, bytes);
479	}	494	}
480		495
481	void vfs_read(ipc_callid_t rid, ipc_call_t *request)	496	void vfs_read(ipc_callid_t rid, ipc_call_t *request)
482	{	497	{

Subversion Repositories HelenOS

(root)/trunk/uspace/srv/vfs/vfs_ops.c @ 3352 – Rev 3215 → 3255