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