Rev 2542 | Rev 2552 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
2518 | jermar | 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.c |
||
2542 | jermar | 35 | * @brief VFS service for HelenOS. |
2518 | jermar | 36 | */ |
37 | |||
2520 | jermar | 38 | #include <ipc/ipc.h> |
39 | #include <ipc/services.h> |
||
40 | #include <async.h> |
||
41 | #include <errno.h> |
||
2532 | jermar | 42 | #include <stdio.h> |
2523 | jermar | 43 | #include <bool.h> |
2542 | jermar | 44 | #include <string.h> |
45 | #include <as.h> |
||
2526 | jermar | 46 | #include <libadt/list.h> |
2520 | jermar | 47 | #include "vfs.h" |
48 | |||
2532 | jermar | 49 | #define dprintf(...) printf(__VA_ARGS__) |
50 | |||
2520 | jermar | 51 | static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall) |
52 | { |
||
2523 | jermar | 53 | bool keep_on_going = 1; |
2520 | jermar | 54 | |
2532 | jermar | 55 | printf("Connection opened from %p\n", icall->in_phone_hash); |
56 | |||
2520 | jermar | 57 | /* |
58 | * The connection was opened via the IPC_CONNECT_ME_TO call. |
||
59 | * This call needs to be answered. |
||
60 | */ |
||
2523 | jermar | 61 | ipc_answer_fast(iid, EOK, 0, 0); |
2520 | jermar | 62 | |
63 | /* |
||
2523 | jermar | 64 | * Here we enter the main connection fibril loop. |
65 | * The logic behind this loop and the protocol is that we'd like to keep |
||
66 | * each connection open for a while before we close it. The benefit of |
||
67 | * this is that the client doesn't have to establish a new connection |
||
68 | * upon each request. On the other hand, the client must be ready to |
||
69 | * re-establish a connection if we hang it up due to reaching of maximum |
||
70 | * number of requests per connection or due to the client timing out. |
||
2520 | jermar | 71 | */ |
2523 | jermar | 72 | |
73 | while (keep_on_going) { |
||
74 | ipc_callid_t callid; |
||
75 | ipc_call_t call; |
||
76 | |||
77 | callid = async_get_call(&call); |
||
2532 | jermar | 78 | |
79 | printf("Received call, method=%d\n", IPC_GET_METHOD(call)); |
||
2523 | jermar | 80 | |
81 | switch (IPC_GET_METHOD(call)) { |
||
82 | case IPC_M_PHONE_HUNGUP: |
||
83 | keep_on_going = false; |
||
84 | break; |
||
85 | case VFS_REGISTER: |
||
86 | vfs_register(callid, &call); |
||
87 | keep_on_going = false; |
||
88 | break; |
||
89 | case VFS_MOUNT: |
||
90 | case VFS_UNMOUNT: |
||
91 | case VFS_OPEN: |
||
92 | case VFS_CREATE: |
||
93 | case VFS_CLOSE: |
||
94 | case VFS_READ: |
||
95 | case VFS_WRITE: |
||
96 | case VFS_SEEK: |
||
97 | default: |
||
98 | ipc_answer_fast(callid, ENOTSUP, 0, 0); |
||
99 | break; |
||
100 | } |
||
2520 | jermar | 101 | } |
2523 | jermar | 102 | |
103 | /* TODO: cleanup after the client */ |
||
104 | |||
2520 | jermar | 105 | } |
106 | |||
2518 | jermar | 107 | int main(int argc, char **argv) |
108 | { |
||
2520 | jermar | 109 | ipcarg_t phonead; |
110 | |||
2532 | jermar | 111 | printf("VFS: HelenOS VFS server\n"); |
112 | |||
2542 | jermar | 113 | /* |
114 | * Initialize the list of registered file systems. |
||
115 | */ |
||
2526 | jermar | 116 | list_initialize(&fs_head); |
2542 | jermar | 117 | |
118 | /* |
||
119 | * Allocate and initialize the Path Lookup Buffer. |
||
120 | */ |
||
121 | list_initialize(&plb_head); |
||
122 | plb = as_get_mappable_page(PLB_SIZE); |
||
2543 | jermar | 123 | if (!plb) { |
124 | printf("Cannot allocate a mappable piece of address space\n"); |
||
125 | return ENOMEM; |
||
126 | } |
||
127 | if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE | |
||
128 | AS_AREA_CACHEABLE) != plb) { |
||
129 | printf("Cannot create address space area.\n"); |
||
130 | return ENOMEM; |
||
131 | } |
||
132 | memset(plb, 0, PLB_SIZE); |
||
2542 | jermar | 133 | |
134 | /* |
||
135 | * Set a connectio handling function/fibril. |
||
136 | */ |
||
2520 | jermar | 137 | async_set_client_connection(vfs_connection); |
2542 | jermar | 138 | |
139 | /* |
||
140 | * Register at the naming service. |
||
141 | */ |
||
2520 | jermar | 142 | ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, &phonead); |
2542 | jermar | 143 | |
144 | /* |
||
145 | * Start accepting connections. |
||
146 | */ |
||
2520 | jermar | 147 | async_manager(); |
2518 | jermar | 148 | return 0; |
149 | } |
||
150 | |||
151 | /** |
||
152 | * @} |
||
153 | */ |