First commit XiUOS

fs/shared/src/Makefile

@@ -0,0 +1,4 @@
+SRC_FILES := poll.c select.c iot-vfs.c
+
+
+include $(KERNEL_ROOT)/compiler.mk

fs/shared/src/poll.c

@@ -0,0 +1,198 @@
+/*
+* Copyright (c) 2020 AIIT XUOS Lab
+* XiUOS is licensed under Mulan PSL v2.
+* You can use this software according to the terms and conditions of the Mulan PSL v2.
+* You may obtain a copy of Mulan PSL v2 at:
+*        http://license.coscl.org.cn/MulanPSL2
+* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
+* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
+* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
+* See the Mulan PSL v2 for more details.
+*/
+#include <stdint.h>
+#include <xs_poll.h>
+#include <device.h>
+#include <xiuos.h>
+#include <iot-vfs.h>
+#include <iot-vfs_posix.h>
+
+
+void PollAdd(WaitQueueType *wq, pollreqType *req)
+{
+    if (req && req->_proc && wq)
+        req->_proc(wq, req);
+}
+
+
+struct rt_poll_node;
+
+struct rt_poll_table
+{
+    pollreqType req;
+    uint32 triggered; 
+    KTaskDescriptorType polling_thread;
+    struct rt_poll_node *nodes;
+};
+
+struct rt_poll_node
+{
+    struct WaitqueueNode wqn;
+    struct rt_poll_table *pt;
+    struct rt_poll_node *next;
+};
+
+static int WqueuePollWake(struct WaitqueueNode *wait, void *key)
+{
+    struct rt_poll_node *pn;
+
+    if (key && !((x_ubase)key & wait->key))
+        return -1;
+
+    pn =CONTAINER_OF(wait, struct rt_poll_node, wqn);
+    pn->pt->triggered = 1;
+
+    return 0;
+}
+
+static void _poll_add(WaitQueueType *wq, pollreqType *req)
+{
+    struct rt_poll_table *pt;
+    struct rt_poll_node *node;
+
+    node = (struct rt_poll_node *)x_malloc(sizeof(struct rt_poll_node));
+    if (node == NONE)
+        return;
+
+    pt =CONTAINER_OF(req, struct rt_poll_table, req);
+
+    node->wqn.key = req->_key;
+    InitDoubleLinkList(&(node->wqn.list));
+    node->wqn.polling_task = pt->polling_thread;
+    node->wqn.cb = WqueuePollWake;
+    node->next = pt->nodes;
+    node->pt = pt;
+    pt->nodes = node;
+    WqueueAdd(wq, &node->wqn);
+}
+
+
+
+static int PollWaitTimeout(struct rt_poll_table *pt, int msec)
+{
+    int32 timeout;
+    int ret = 0;
+    struct TaskDescriptor *thread;
+    x_base level;
+
+    thread = pt->polling_thread;
+
+    timeout = CalculteTickFromTimeMs(msec);
+
+    level = CriticalAreaLock();
+
+    if (timeout != 0 && !pt->triggered) {
+        SuspendKTask(thread->id.id);
+        if (timeout > 0)
+            KTaskSetDelay(thread,timeout);
+
+        CriticalAreaUnLock(level);
+
+        DO_KTASK_ASSIGN;
+
+        level = CriticalAreaLock();
+    }
+
+    ret = !pt->triggered;
+    CriticalAreaUnLock(level);
+
+    return ret;
+}
+
+static int DoPollFd(struct pollfd *pollfd, pollreqType *req)
+{
+    int mask = 0;
+    int fd;
+
+    fd = pollfd->fd;
+
+    if (fd >= 0) {
+        struct FileDescriptor *fdp = GetFileDescriptor(fd);
+        mask = POLLNVAL;
+
+        if (fdp) {
+            mask = POLLMASK_DEFAULT;
+            if (fdp->mntp->fs->poll) {
+                req->_key = pollfd->events | POLLERR | POLLHUP;
+
+                mask = fdp->mntp->fs->poll(fdp, req);
+            }
+            /* Mask out unneeded events. */
+            mask &= pollfd->events | POLLERR | POLLHUP;
+        }
+    }
+    pollfd->revents = mask;
+
+    return mask;
+}
+
+static int PollDo(struct pollfd *fds, NfdsType nfds, struct rt_poll_table *pt, int msec)
+{
+    int num;
+    int istimeout = 0;
+    int n;
+    struct pollfd *pf;
+
+    if (msec == 0) {
+        pt->req._proc = NONE;
+        istimeout = 1;
+    }
+
+    while (1) {
+        pf = fds;
+        num = 0;
+
+        for (n = 0; n < nfds; n ++) {
+            if (DoPollFd(pf, &pt->req)) {
+                num ++;
+                pt->req._proc = NONE;
+            }
+            pf ++;
+        }
+
+        pt->req._proc = NONE;
+
+        if (num || istimeout)
+            break;
+
+        if (PollWaitTimeout(pt, msec))
+            istimeout = 1;
+    }
+
+    return num;
+}
+
+
+int poll(struct pollfd *fds, NfdsType nfds, int timeout)
+{
+    int num;
+    struct rt_poll_table table;
+    struct rt_poll_node *node, *temp;
+
+    table.req._proc = _poll_add;
+    table.triggered = 0;
+    table.nodes = NULL;
+    table.polling_thread = GetKTaskDescriptor();
+
+    num = PollDo(fds, nfds, &table, timeout);
+
+    node = table.nodes;
+    while (node) {
+        temp = node;
+        node= node->next;
+        WqueueRemove(&temp->wqn);
+        x_free(temp);
+    }
+
+    return num;
+}
+

fs/shared/src/select.c

@@ -0,0 +1,182 @@
+/*
+ * Copyright (c) 2006-2018, RT-Thread Development Team
+ *
+ * SPDX-License-Identifier: Apache-2.0
+ *
+ * Change Logs:
+ * Date           Author       Notes
+ * 2016-12-28     Bernard      first version
+ */
+
+#include <iot-vfs.h>
+#include <iot-vfs_posix.h>
+#include <xs_poll.h>
+#include <vfs_select.h>
+
+#ifdef LIB_POSIX
+
+static void fdszero(fd_set *set, int nfds)
+{
+    fd_mask *m;
+    int n;
+
+    /*
+      The 'sizeof(fd_set)' of the system space may differ from user space,
+      so the actual size of the 'fd_set' is determined here with the parameter 'nfds'
+    */
+    m = (fd_mask *)set;
+    for (n = 0; n < nfds; n += (sizeof(fd_mask) * 8))
+    {
+        memset(m, 0, sizeof(fd_mask));
+        m ++;
+    }
+}
+
+int select(int nfds, fd_set *readfds, fd_set *writefds, fd_set *exceptfds, struct timeval *timeout)
+{
+    int fd;
+    int npfds;
+    int msec;
+    int ndx;
+    int ret;
+    struct pollfd *pollset = NONE;
+
+    /* How many pollfd structures do we need to allocate? */
+    for (fd = 0, npfds = 0; fd < nfds; fd++)
+    {
+        /* Check if any monitor operation is requested on this fd */
+        if ((readfds   && FD_ISSET(fd, readfds))  ||
+            (writefds  && FD_ISSET(fd, writefds)) ||
+            (exceptfds && FD_ISSET(fd, exceptfds)))
+        {
+            npfds++;
+        }
+    }
+
+    /* Allocate the descriptor list for poll() */
+    if (npfds > 0)
+    {
+        pollset = (struct pollfd *)x_calloc(npfds, sizeof(struct pollfd));
+        if (!pollset)
+        {
+            return -1;
+        }
+    }
+
+    /* Initialize the descriptor list for poll() */
+    for (fd = 0, ndx = 0; fd < nfds; fd++)
+    {
+        int incr = 0;
+
+        /* The readfs set holds the set of FDs that the caller can be assured
+         * of reading from without blocking.  Note that POLLHUP is included as
+         * a read-able condition.  POLLHUP will be reported at the end-of-file
+         * or when a connection is lost.  In either case, the read() can then
+         * be performed without blocking.
+         */
+
+        if (readfds && FD_ISSET(fd, readfds))
+        {
+            pollset[ndx].fd         = fd;
+            pollset[ndx].events |= POLLIN;
+            incr = 1;
+        }
+
+        if (writefds && FD_ISSET(fd, writefds))
+        {
+            pollset[ndx].fd      = fd;
+            pollset[ndx].events |= POLLOUT;
+            incr = 1;
+        }
+
+        if (exceptfds && FD_ISSET(fd, exceptfds))
+        {
+            pollset[ndx].fd = fd;
+            incr = 1;
+        }
+
+        ndx += incr;
+    }
+
+    CHECK(ndx == npfds);
+
+    /* Convert the timeout to milliseconds */
+    if (timeout)
+    {
+        msec = timeout->tv_sec * 1000 + timeout->tv_usec / 1000;
+    }
+    else
+    {
+        msec = -1;
+    }
+
+    /* Then let poll do all of the real work. */
+
+    ret = poll(pollset, npfds, msec);
+
+    /* Now set up the return values */
+    if (readfds)
+    {
+        fdszero(readfds, nfds);
+    }
+
+    if (writefds)
+    {
+        fdszero(writefds, nfds);
+    }
+
+    if (exceptfds)
+    {
+        fdszero(exceptfds, nfds);
+    }
+
+    /* Convert the poll descriptor list back into selects 3 bitsets */
+
+    if (ret > 0)
+    {
+        ret = 0;
+        for (ndx = 0; ndx < npfds; ndx++)
+        {
+            /* Check for read conditions.  Note that POLLHUP is included as a
+             * read condition.  POLLHUP will be reported when no more data will
+             * be available (such as when a connection is lost).  In either
+             * case, the read() can then be performed without blocking.
+             */
+
+            if (readfds)
+            {
+                if (pollset[ndx].revents & (POLLIN | POLLHUP))
+                {
+                    FD_SET(pollset[ndx].fd, readfds);
+                    ret++;
+                }
+            }
+
+            /* Check for write conditions */
+            if (writefds)
+            {
+                if (pollset[ndx].revents & POLLOUT)
+                {
+                    FD_SET(pollset[ndx].fd, writefds);
+                    ret++;
+                }
+            }
+
+            /* Check for exceptions */
+            if (exceptfds)
+            {
+                if (pollset[ndx].revents & POLLERR)
+                {
+                    FD_SET(pollset[ndx].fd, exceptfds);
+                    ret++;
+                }
+            }
+        }
+    }
+
+    if (pollset) x_free(pollset);
+
+    return ret;
+}
+
+#endif