Rev 2543 | Rev 2560 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2543 | Rev 2552 | ||
---|---|---|---|
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 service 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> |
44 | #include <string.h> |
45 | #include <as.h> |
45 | #include <as.h> |
46 | #include <libadt/list.h> |
46 | #include <libadt/list.h> |
- | 47 | #include <atomic.h> |
|
47 | #include "vfs.h" |
48 | #include "vfs.h" |
48 | 49 | ||
49 | #define dprintf(...) printf(__VA_ARGS__) |
50 | #define dprintf(...) printf(__VA_ARGS__) |
50 | 51 | ||
51 | static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall) |
52 | static void vfs_connection(ipc_callid_t iid, ipc_call_t *icall) |
52 | { |
53 | { |
53 | bool keep_on_going = 1; |
54 | bool keep_on_going = 1; |
54 | 55 | ||
55 | printf("Connection opened from %p\n", icall->in_phone_hash); |
56 | printf("Connection opened from %p\n", icall->in_phone_hash); |
56 | 57 | ||
57 | /* |
58 | /* |
58 | * The connection was opened via the IPC_CONNECT_ME_TO call. |
59 | * The connection was opened via the IPC_CONNECT_ME_TO call. |
59 | * This call needs to be answered. |
60 | * This call needs to be answered. |
60 | */ |
61 | */ |
61 | ipc_answer_fast(iid, EOK, 0, 0); |
62 | ipc_answer_fast(iid, EOK, 0, 0); |
62 | 63 | ||
63 | /* |
64 | /* |
64 | * Here we enter the main connection fibril loop. |
65 | * 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 | * 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 | * 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 | * 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 | * 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 | * 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. |
71 | * number of requests per connection or due to the client timing out. |
71 | */ |
72 | */ |
72 | 73 | ||
73 | while (keep_on_going) { |
74 | while (keep_on_going) { |
74 | ipc_callid_t callid; |
75 | ipc_callid_t callid; |
75 | ipc_call_t call; |
76 | ipc_call_t call; |
76 | 77 | ||
77 | callid = async_get_call(&call); |
78 | callid = async_get_call(&call); |
78 | 79 | ||
79 | printf("Received call, method=%d\n", IPC_GET_METHOD(call)); |
80 | printf("Received call, method=%d\n", IPC_GET_METHOD(call)); |
80 | 81 | ||
81 | switch (IPC_GET_METHOD(call)) { |
82 | switch (IPC_GET_METHOD(call)) { |
82 | case IPC_M_PHONE_HUNGUP: |
83 | case IPC_M_PHONE_HUNGUP: |
83 | keep_on_going = false; |
84 | keep_on_going = false; |
84 | break; |
85 | break; |
85 | case VFS_REGISTER: |
86 | case VFS_REGISTER: |
86 | vfs_register(callid, &call); |
87 | vfs_register(callid, &call); |
87 | keep_on_going = false; |
88 | keep_on_going = false; |
88 | break; |
89 | break; |
89 | case VFS_MOUNT: |
90 | case VFS_MOUNT: |
90 | case VFS_UNMOUNT: |
91 | case VFS_UNMOUNT: |
91 | case VFS_OPEN: |
92 | case VFS_OPEN: |
92 | case VFS_CREATE: |
93 | case VFS_CREATE: |
93 | case VFS_CLOSE: |
94 | case VFS_CLOSE: |
94 | case VFS_READ: |
95 | case VFS_READ: |
95 | case VFS_WRITE: |
96 | case VFS_WRITE: |
96 | case VFS_SEEK: |
97 | case VFS_SEEK: |
97 | default: |
98 | default: |
98 | ipc_answer_fast(callid, ENOTSUP, 0, 0); |
99 | ipc_answer_fast(callid, ENOTSUP, 0, 0); |
99 | break; |
100 | break; |
100 | } |
101 | } |
101 | } |
102 | } |
102 | 103 | ||
103 | /* TODO: cleanup after the client */ |
104 | /* TODO: cleanup after the client */ |
104 | 105 | ||
105 | } |
106 | } |
106 | 107 | ||
107 | int main(int argc, char **argv) |
108 | int main(int argc, char **argv) |
108 | { |
109 | { |
109 | ipcarg_t phonead; |
110 | ipcarg_t phonead; |
110 | 111 | ||
111 | printf("VFS: HelenOS VFS server\n"); |
112 | printf("VFS: HelenOS VFS server\n"); |
112 | 113 | ||
113 | /* |
114 | /* |
114 | * Initialize the list of registered file systems. |
115 | * Initialize the list of registered file systems. |
115 | */ |
116 | */ |
116 | list_initialize(&fs_head); |
117 | list_initialize(&fs_head); |
117 | 118 | ||
118 | /* |
119 | /* |
119 | * Allocate and initialize the Path Lookup Buffer. |
120 | * Allocate and initialize the Path Lookup Buffer. |
120 | */ |
121 | */ |
121 | list_initialize(&plb_head); |
122 | list_initialize(&plb_head); |
122 | plb = as_get_mappable_page(PLB_SIZE); |
123 | plb = as_get_mappable_page(PLB_SIZE); |
123 | if (!plb) { |
124 | if (!plb) { |
124 | printf("Cannot allocate a mappable piece of address space\n"); |
125 | printf("Cannot allocate a mappable piece of address space\n"); |
125 | return ENOMEM; |
126 | return ENOMEM; |
126 | } |
127 | } |
127 | if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE | |
128 | if (as_area_create(plb, PLB_SIZE, AS_AREA_READ | AS_AREA_WRITE | |
128 | AS_AREA_CACHEABLE) != plb) { |
129 | AS_AREA_CACHEABLE) != plb) { |
129 | printf("Cannot create address space area.\n"); |
130 | printf("Cannot create address space area.\n"); |
130 | return ENOMEM; |
131 | return ENOMEM; |
131 | } |
132 | } |
132 | memset(plb, 0, PLB_SIZE); |
133 | memset(plb, 0, PLB_SIZE); |
133 | 134 | ||
134 | /* |
135 | /* |
135 | * Set a connectio handling function/fibril. |
136 | * Set a connectio handling function/fibril. |
136 | */ |
137 | */ |
137 | async_set_client_connection(vfs_connection); |
138 | async_set_client_connection(vfs_connection); |
138 | 139 | ||
139 | /* |
140 | /* |
140 | * Register at the naming service. |
141 | * Register at the naming service. |
141 | */ |
142 | */ |
142 | ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, &phonead); |
143 | ipc_connect_to_me(PHONE_NS, SERVICE_VFS, 0, &phonead); |
143 | 144 | ||
144 | /* |
145 | /* |
145 | * Start accepting connections. |
146 | * Start accepting connections. |
146 | */ |
147 | */ |
147 | async_manager(); |
148 | async_manager(); |
148 | return 0; |
149 | return 0; |
149 | } |
150 | } |
150 | 151 | ||
151 | /** |
152 | /** |
152 | * @} |
153 | * @} |
153 | */ |
154 | */ |
154 | 155 |