Rev 2927 | Rev 3150 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 2927 | Rev 3009 | ||
|---|---|---|---|
| 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_triplet_t rootfs = { |
65 | vfs_triplet_t rootfs = { |
| 66 | .fs_handle = 0, |
66 | .fs_handle = 0, |
| 67 | .dev_handle = 0, |
67 | .dev_handle = 0, |
| 68 | .index = 0, |
68 | .index = 0, |
| 69 | }; |
69 | }; |
| 70 | 70 | ||
| 71 | static int |
71 | static int |
| 72 | lookup_root(fs_handle_t fs_handle, dev_handle_t dev_handle, |
72 | lookup_root(fs_handle_t fs_handle, dev_handle_t dev_handle, |
| 73 | vfs_lookup_res_t *result) |
73 | vfs_lookup_res_t *result) |
| 74 | { |
74 | { |
| 75 | vfs_pair_t altroot = { |
75 | vfs_pair_t altroot = { |
| 76 | .fs_handle = fs_handle, |
76 | .fs_handle = fs_handle, |
| 77 | .dev_handle = dev_handle, |
77 | .dev_handle = dev_handle, |
| 78 | }; |
78 | }; |
| 79 | 79 | ||
| 80 | return vfs_lookup_internal("/", L_DIRECTORY, result, &altroot); |
80 | return vfs_lookup_internal("/", L_DIRECTORY, result, &altroot); |
| 81 | } |
81 | } |
| 82 | 82 | ||
| 83 | void vfs_mount(ipc_callid_t rid, ipc_call_t *request) |
83 | void vfs_mount(ipc_callid_t rid, ipc_call_t *request) |
| 84 | { |
84 | { |
| 85 | dev_handle_t dev_handle; |
85 | dev_handle_t dev_handle; |
| 86 | vfs_node_t *mp_node = NULL; |
86 | vfs_node_t *mp_node = NULL; |
| - | 87 | int rc; |
|
| - | 88 | int phone; |
|
| 87 | 89 | ||
| 88 | /* |
90 | /* |
| 89 | * We expect the library to do the device-name to device-handle |
91 | * We expect the library to do the device-name to device-handle |
| 90 | * translation for us, thus the device handle will arrive as ARG1 |
92 | * translation for us, thus the device handle will arrive as ARG1 |
| 91 | * in the request. |
93 | * in the request. |
| 92 | */ |
94 | */ |
| 93 | dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
95 | dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
| 94 | 96 | ||
| 95 | /* |
97 | /* |
| 96 | * For now, don't make use of ARG2 and ARG3, but they can be used to |
98 | * For now, don't make use of ARG2 and ARG3, but they can be used to |
| 97 | * carry mount options in the future. |
99 | * carry mount options in the future. |
| 98 | */ |
100 | */ |
| 99 | 101 | ||
| 100 | ipc_callid_t callid; |
102 | ipc_callid_t callid; |
| 101 | size_t size; |
103 | size_t size; |
| 102 | 104 | ||
| 103 | /* |
105 | /* |
| 104 | * Now, we expect the client to send us data with the name of the file |
106 | * Now, we expect the client to send us data with the name of the file |
| 105 | * system. |
107 | * system. |
| 106 | */ |
108 | */ |
| 107 | if (!ipc_data_write_receive(&callid, &size)) { |
109 | if (!ipc_data_write_receive(&callid, &size)) { |
| 108 | ipc_answer_0(callid, EINVAL); |
110 | ipc_answer_0(callid, EINVAL); |
| 109 | ipc_answer_0(rid, EINVAL); |
111 | ipc_answer_0(rid, EINVAL); |
| 110 | return; |
112 | return; |
| 111 | } |
113 | } |
| 112 | 114 | ||
| 113 | /* |
115 | /* |
| 114 | * Don't receive more than is necessary for storing a full file system |
116 | * Don't receive more than is necessary for storing a full file system |
| 115 | * name. |
117 | * name. |
| 116 | */ |
118 | */ |
| 117 | if (size < 1 || size > FS_NAME_MAXLEN) { |
119 | if (size < 1 || size > FS_NAME_MAXLEN) { |
| 118 | ipc_answer_0(callid, EINVAL); |
120 | ipc_answer_0(callid, EINVAL); |
| 119 | ipc_answer_0(rid, EINVAL); |
121 | ipc_answer_0(rid, EINVAL); |
| 120 | return; |
122 | return; |
| 121 | } |
123 | } |
| 122 | 124 | ||
| 123 | /* Deliver the file system name. */ |
125 | /* Deliver the file system name. */ |
| 124 | char fs_name[FS_NAME_MAXLEN + 1]; |
126 | char fs_name[FS_NAME_MAXLEN + 1]; |
| 125 | (void) ipc_data_write_finalize(callid, fs_name, size); |
127 | (void) ipc_data_write_finalize(callid, fs_name, size); |
| 126 | fs_name[size] = '\0'; |
128 | fs_name[size] = '\0'; |
| 127 | 129 | ||
| 128 | /* |
130 | /* |
| 129 | * Check if we know a file system with the same name as is in fs_name. |
131 | * Check if we know a file system with the same name as is in fs_name. |
| 130 | * This will also give us its file system handle. |
132 | * This will also give us its file system handle. |
| 131 | */ |
133 | */ |
| 132 | fs_handle_t fs_handle = fs_name_to_handle(fs_name, true); |
134 | fs_handle_t fs_handle = fs_name_to_handle(fs_name, true); |
| 133 | if (!fs_handle) { |
135 | if (!fs_handle) { |
| 134 | ipc_answer_0(rid, ENOENT); |
136 | ipc_answer_0(rid, ENOENT); |
| 135 | return; |
137 | return; |
| 136 | } |
138 | } |
| 137 | 139 | ||
| 138 | /* Now, we want the client to send us the mount point. */ |
140 | /* Now, we want the client to send us the mount point. */ |
| 139 | if (!ipc_data_write_receive(&callid, &size)) { |
141 | if (!ipc_data_write_receive(&callid, &size)) { |
| 140 | ipc_answer_0(callid, EINVAL); |
142 | ipc_answer_0(callid, EINVAL); |
| 141 | ipc_answer_0(rid, EINVAL); |
143 | ipc_answer_0(rid, EINVAL); |
| 142 | return; |
144 | return; |
| 143 | } |
145 | } |
| 144 | 146 | ||
| 145 | /* Check whether size is reasonable wrt. the mount point. */ |
147 | /* Check whether size is reasonable wrt. the mount point. */ |
| 146 | if (size < 1 || size > MAX_PATH_LEN) { |
148 | if (size < 1 || size > MAX_PATH_LEN) { |
| 147 | ipc_answer_0(callid, EINVAL); |
149 | ipc_answer_0(callid, EINVAL); |
| 148 | ipc_answer_0(rid, EINVAL); |
150 | ipc_answer_0(rid, EINVAL); |
| 149 | return; |
151 | return; |
| 150 | } |
152 | } |
| 151 | /* Allocate buffer for the mount point data being received. */ |
153 | /* Allocate buffer for the mount point data being received. */ |
| 152 | uint8_t *buf; |
154 | uint8_t *buf; |
| 153 | buf = malloc(size + 1); |
155 | buf = malloc(size + 1); |
| 154 | if (!buf) { |
156 | if (!buf) { |
| 155 | ipc_answer_0(callid, ENOMEM); |
157 | ipc_answer_0(callid, ENOMEM); |
| 156 | ipc_answer_0(rid, ENOMEM); |
158 | ipc_answer_0(rid, ENOMEM); |
| 157 | return; |
159 | return; |
| 158 | } |
160 | } |
| 159 | 161 | ||
| 160 | /* Deliver the mount point. */ |
162 | /* Deliver the mount point. */ |
| 161 | (void) ipc_data_write_finalize(callid, buf, size); |
163 | (void) ipc_data_write_finalize(callid, buf, size); |
| 162 | buf[size] = '\0'; |
164 | buf[size] = '\0'; |
| 163 | 165 | ||
| 164 | /* |
166 | /* |
| 165 | * Lookup the root node of the filesystem being mounted. |
167 | * Lookup the root node of the filesystem being mounted. |
| 166 | * In this case, we don't need to take the namespace_futex as the root |
168 | * In this case, we don't need to take the namespace_futex as the root |
| 167 | * node cannot be removed. However, we do take a reference to it so |
169 | * node cannot be removed. However, we do take a reference to it so |
| 168 | * that we can track how many times it has been mounted. |
170 | * that we can track how many times it has been mounted. |
| 169 | */ |
171 | */ |
| 170 | int rc; |
- | |
| 171 | vfs_lookup_res_t mr_res; |
172 | vfs_lookup_res_t mr_res; |
| 172 | rc = lookup_root(fs_handle, dev_handle, &mr_res); |
173 | rc = lookup_root(fs_handle, dev_handle, &mr_res); |
| 173 | if (rc != EOK) { |
174 | if (rc != EOK) { |
| 174 | free(buf); |
175 | free(buf); |
| 175 | ipc_answer_0(rid, rc); |
176 | ipc_answer_0(rid, rc); |
| 176 | return; |
177 | return; |
| 177 | } |
178 | } |
| 178 | vfs_node_t *mr_node = vfs_node_get(&mr_res); |
179 | vfs_node_t *mr_node = vfs_node_get(&mr_res); |
| 179 | if (!mr_node) { |
180 | if (!mr_node) { |
| 180 | free(buf); |
181 | free(buf); |
| 181 | ipc_answer_0(rid, ENOMEM); |
182 | ipc_answer_0(rid, ENOMEM); |
| 182 | return; |
183 | return; |
| 183 | } |
184 | } |
| 184 | 185 | ||
| 185 | /* Finally, we need to resolve the path to the mountpoint. */ |
186 | /* Finally, we need to resolve the path to the mountpoint. */ |
| 186 | vfs_lookup_res_t mp_res; |
187 | vfs_lookup_res_t mp_res; |
| 187 | futex_down(&rootfs_futex); |
188 | futex_down(&rootfs_futex); |
| 188 | if (rootfs.fs_handle) { |
189 | if (rootfs.fs_handle) { |
| 189 | /* We already have the root FS. */ |
190 | /* We already have the root FS. */ |
| 190 | rwlock_write_lock(&namespace_rwlock); |
191 | rwlock_write_lock(&namespace_rwlock); |
| 191 | if ((size == 1) && (buf[0] == '/')) { |
192 | if ((size == 1) && (buf[0] == '/')) { |
| 192 | /* Trying to mount root FS over root FS */ |
193 | /* Trying to mount root FS over root FS */ |
| 193 | rwlock_write_unlock(&namespace_rwlock); |
194 | rwlock_write_unlock(&namespace_rwlock); |
| 194 | futex_up(&rootfs_futex); |
195 | futex_up(&rootfs_futex); |
| 195 | vfs_node_put(mr_node); |
196 | vfs_node_put(mr_node); |
| 196 | free(buf); |
197 | free(buf); |
| 197 | ipc_answer_0(rid, EBUSY); |
198 | ipc_answer_0(rid, EBUSY); |
| 198 | return; |
199 | return; |
| 199 | } |
200 | } |
| 200 | rc = vfs_lookup_internal(buf, L_DIRECTORY, &mp_res, NULL); |
201 | rc = vfs_lookup_internal(buf, L_DIRECTORY, &mp_res, NULL); |
| 201 | if (rc != EOK) { |
202 | if (rc != EOK) { |
| 202 | /* The lookup failed for some reason. */ |
203 | /* The lookup failed for some reason. */ |
| 203 | rwlock_write_unlock(&namespace_rwlock); |
204 | rwlock_write_unlock(&namespace_rwlock); |
| 204 | futex_up(&rootfs_futex); |
205 | futex_up(&rootfs_futex); |
| 205 | vfs_node_put(mr_node); /* failed -> drop reference */ |
206 | vfs_node_put(mr_node); /* failed -> drop reference */ |
| 206 | free(buf); |
207 | free(buf); |
| 207 | ipc_answer_0(rid, rc); |
208 | ipc_answer_0(rid, rc); |
| 208 | return; |
209 | return; |
| 209 | } |
210 | } |
| 210 | mp_node = vfs_node_get(&mp_res); |
211 | mp_node = vfs_node_get(&mp_res); |
| 211 | if (!mp_node) { |
212 | if (!mp_node) { |
| 212 | rwlock_write_unlock(&namespace_rwlock); |
213 | rwlock_write_unlock(&namespace_rwlock); |
| 213 | futex_up(&rootfs_futex); |
214 | futex_up(&rootfs_futex); |
| 214 | vfs_node_put(mr_node); /* failed -> drop reference */ |
215 | vfs_node_put(mr_node); /* failed -> drop reference */ |
| 215 | free(buf); |
216 | free(buf); |
| 216 | ipc_answer_0(rid, ENOMEM); |
217 | ipc_answer_0(rid, ENOMEM); |
| 217 | return; |
218 | return; |
| 218 | } |
219 | } |
| 219 | /* |
220 | /* |
| 220 | * Now we hold a reference to mp_node. |
221 | * Now we hold a reference to mp_node. |
| 221 | * It will be dropped upon the corresponding VFS_UNMOUNT. |
222 | * It will be dropped upon the corresponding VFS_UNMOUNT. |
| 222 | * This prevents the mount point from being deleted. |
223 | * This prevents the mount point from being deleted. |
| 223 | */ |
224 | */ |
| 224 | rwlock_write_unlock(&namespace_rwlock); |
225 | rwlock_write_unlock(&namespace_rwlock); |
| 225 | } else { |
226 | } else { |
| 226 | /* We still don't have the root file system mounted. */ |
227 | /* We still don't have the root file system mounted. */ |
| 227 | if ((size == 1) && (buf[0] == '/')) { |
228 | if ((size == 1) && (buf[0] == '/')) { |
| - | 229 | /* |
|
| 228 | /* For this simple, but important case, we are done. */ |
230 | * For this simple, but important case, |
| 229 | rootfs = mr_res.triplet; |
231 | * we are almost done. |
| 230 | futex_up(&rootfs_futex); |
232 | */ |
| 231 | free(buf); |
233 | free(buf); |
| - | 234 | ||
| - | 235 | /* Inform the mount point about the root mount. */ |
|
| - | 236 | phone = vfs_grab_phone(mr_res.triplet.fs_handle); |
|
| - | 237 | rc = async_req_5_0(phone, VFS_MOUNT, |
|
| - | 238 | (ipcarg_t) mr_res.triplet.dev_handle, |
|
| - | 239 | (ipcarg_t) mr_res.triplet.index, |
|
| - | 240 | (ipcarg_t) mr_res.triplet.fs_handle, |
|
| - | 241 | (ipcarg_t) mr_res.triplet.dev_handle, |
|
| - | 242 | (ipcarg_t) mr_res.triplet.index); |
|
| - | 243 | vfs_release_phone(phone); |
|
| - | 244 | ||
| - | 245 | if (rc == EOK) |
|
| - | 246 | rootfs = mr_res.triplet; |
|
| - | 247 | else |
|
| - | 248 | vfs_node_put(mr_node); |
|
| - | 249 | ||
| - | 250 | futex_up(&rootfs_futex); |
|
| 232 | ipc_answer_0(rid, EOK); |
251 | ipc_answer_0(rid, rc); |
| 233 | return; |
252 | return; |
| 234 | } else { |
253 | } else { |
| 235 | /* |
254 | /* |
| 236 | * We can't resolve this without the root filesystem |
255 | * We can't resolve this without the root filesystem |
| 237 | * being mounted first. |
256 | * being mounted first. |
| 238 | */ |
257 | */ |
| 239 | futex_up(&rootfs_futex); |
258 | futex_up(&rootfs_futex); |
| 240 | free(buf); |
259 | free(buf); |
| 241 | vfs_node_put(mr_node); /* failed -> drop reference */ |
260 | vfs_node_put(mr_node); /* failed -> drop reference */ |
| 242 | ipc_answer_0(rid, ENOENT); |
261 | ipc_answer_0(rid, ENOENT); |
| 243 | return; |
262 | return; |
| 244 | } |
263 | } |
| 245 | } |
264 | } |
| 246 | futex_up(&rootfs_futex); |
265 | futex_up(&rootfs_futex); |
| 247 | 266 | ||
| 248 | free(buf); /* The buffer is not needed anymore. */ |
267 | free(buf); /* The buffer is not needed anymore. */ |
| 249 | 268 | ||
| 250 | /* |
269 | /* |
| 251 | * At this point, we have all necessary pieces: file system and device |
270 | * At this point, we have all necessary pieces: file system and device |
| 252 | * handles, and we know the mount point VFS node and also the root node |
271 | * handles, and we know the mount point VFS node and also the root node |
| 253 | * of the file system being mounted. |
272 | * of the file system being mounted. |
| 254 | */ |
273 | */ |
| 255 | 274 | ||
| - | 275 | /** |
|
| - | 276 | * @todo |
|
| - | 277 | * Add more IPC parameters so that we can send mount mode/flags. |
|
| - | 278 | */ |
|
| 256 | int phone = vfs_grab_phone(mp_res.triplet.fs_handle); |
279 | phone = vfs_grab_phone(mp_res.triplet.fs_handle); |
| 257 | /* Later we can use ARG3 to pass mode/flags. */ |
- | |
| 258 | aid_t req1 = async_send_3(phone, VFS_MOUNT, |
280 | rc = async_req_5_0(phone, VFS_MOUNT, |
| 259 | (ipcarg_t) mp_res.triplet.dev_handle, |
281 | (ipcarg_t) mp_res.triplet.dev_handle, |
| 260 | (ipcarg_t) mp_res.triplet.index, 0, NULL); |
282 | (ipcarg_t) mp_res.triplet.index, |
| 261 | /* The second call uses the same method. */ |
- | |
| 262 | aid_t req2 = async_send_3(phone, VFS_MOUNT, |
- | |
| 263 | (ipcarg_t) mr_res.triplet.fs_handle, |
283 | (ipcarg_t) mr_res.triplet.fs_handle, |
| 264 | (ipcarg_t) mr_res.triplet.dev_handle, |
284 | (ipcarg_t) mr_res.triplet.dev_handle, |
| 265 | (ipcarg_t) mr_res.triplet.index, NULL); |
285 | (ipcarg_t) mr_res.triplet.index); |
| 266 | vfs_release_phone(phone); |
286 | vfs_release_phone(phone); |
| 267 | 287 | ||
| 268 | ipcarg_t rc1; |
- | |
| 269 | ipcarg_t rc2; |
- | |
| 270 | async_wait_for(req1, &rc1); |
- | |
| 271 | async_wait_for(req2, &rc2); |
- | |
| 272 | - | ||
| 273 | if ((rc1 != EOK) || (rc2 != EOK)) { |
288 | if (rc != EOK) { |
| 274 | /* Mount failed, drop references to mr_node and mp_node. */ |
289 | /* Mount failed, drop references to mr_node and mp_node. */ |
| 275 | vfs_node_put(mr_node); |
290 | vfs_node_put(mr_node); |
| 276 | if (mp_node) |
291 | if (mp_node) |
| 277 | vfs_node_put(mp_node); |
292 | vfs_node_put(mp_node); |
| 278 | } |
293 | } |
| 279 | 294 | ||
| 280 | if (rc2 == EOK) |
- | |
| 281 | ipc_answer_0(rid, rc1); |
295 | ipc_answer_0(rid, rc); |
| 282 | else if (rc1 == EOK) |
- | |
| 283 | ipc_answer_0(rid, rc2); |
- | |
| 284 | else |
- | |
| 285 | ipc_answer_0(rid, rc1); |
- | |
| 286 | } |
296 | } |
| 287 | 297 | ||
| 288 | void vfs_open(ipc_callid_t rid, ipc_call_t *request) |
298 | void vfs_open(ipc_callid_t rid, ipc_call_t *request) |
| 289 | { |
299 | { |
| 290 | if (!vfs_files_init()) { |
300 | if (!vfs_files_init()) { |
| 291 | ipc_answer_0(rid, ENOMEM); |
301 | ipc_answer_0(rid, ENOMEM); |
| 292 | return; |
302 | return; |
| 293 | } |
303 | } |
| 294 | 304 | ||
| 295 | /* |
305 | /* |
| 296 | * The POSIX interface is open(path, oflag, mode). |
306 | * The POSIX interface is open(path, oflag, mode). |
| 297 | * We can receive oflags and mode along with the VFS_OPEN call; the path |
307 | * We can receive oflags and mode along with the VFS_OPEN call; the path |
| 298 | * will need to arrive in another call. |
308 | * will need to arrive in another call. |
| 299 | * |
309 | * |
| 300 | * We also receive one private, non-POSIX set of flags called lflag |
310 | * We also receive one private, non-POSIX set of flags called lflag |
| 301 | * used to pass information to vfs_lookup_internal(). |
311 | * used to pass information to vfs_lookup_internal(). |
| 302 | */ |
312 | */ |
| 303 | int lflag = IPC_GET_ARG1(*request); |
313 | int lflag = IPC_GET_ARG1(*request); |
| 304 | int oflag = IPC_GET_ARG2(*request); |
314 | int oflag = IPC_GET_ARG2(*request); |
| 305 | int mode = IPC_GET_ARG3(*request); |
315 | int mode = IPC_GET_ARG3(*request); |
| 306 | size_t len; |
316 | size_t len; |
| 307 | 317 | ||
| 308 | if (oflag & O_CREAT) |
318 | if (oflag & O_CREAT) |
| 309 | lflag |= L_CREATE; |
319 | lflag |= L_CREATE; |
| 310 | if (oflag & O_EXCL) |
320 | if (oflag & O_EXCL) |
| 311 | lflag |= L_EXCLUSIVE; |
321 | lflag |= L_EXCLUSIVE; |
| 312 | 322 | ||
| 313 | ipc_callid_t callid; |
323 | ipc_callid_t callid; |
| 314 | 324 | ||
| 315 | if (!ipc_data_write_receive(&callid, &len)) { |
325 | if (!ipc_data_write_receive(&callid, &len)) { |
| 316 | ipc_answer_0(callid, EINVAL); |
326 | ipc_answer_0(callid, EINVAL); |
| 317 | ipc_answer_0(rid, EINVAL); |
327 | ipc_answer_0(rid, EINVAL); |
| 318 | return; |
328 | return; |
| 319 | } |
329 | } |
| 320 | char *path = malloc(len + 1); |
330 | char *path = malloc(len + 1); |
| 321 | if (!path) { |
331 | if (!path) { |
| 322 | ipc_answer_0(callid, ENOMEM); |
332 | ipc_answer_0(callid, ENOMEM); |
| 323 | ipc_answer_0(rid, ENOMEM); |
333 | ipc_answer_0(rid, ENOMEM); |
| 324 | return; |
334 | return; |
| 325 | } |
335 | } |
| 326 | int rc; |
336 | int rc; |
| 327 | if ((rc = ipc_data_write_finalize(callid, path, len))) { |
337 | if ((rc = ipc_data_write_finalize(callid, path, len))) { |
| 328 | ipc_answer_0(rid, rc); |
338 | ipc_answer_0(rid, rc); |
| 329 | free(path); |
339 | free(path); |
| 330 | return; |
340 | return; |
| 331 | } |
341 | } |
| 332 | path[len] = '\0'; |
342 | path[len] = '\0'; |
| 333 | 343 | ||
| 334 | /* |
344 | /* |
| 335 | * Avoid the race condition in which the file can be deleted before we |
345 | * Avoid the race condition in which the file can be deleted before we |
| 336 | * find/create-and-lock the VFS node corresponding to the looked-up |
346 | * find/create-and-lock the VFS node corresponding to the looked-up |
| 337 | * triplet. |
347 | * triplet. |
| 338 | */ |
348 | */ |
| 339 | if (lflag & L_CREATE) |
349 | if (lflag & L_CREATE) |
| 340 | rwlock_write_lock(&namespace_rwlock); |
350 | rwlock_write_lock(&namespace_rwlock); |
| 341 | else |
351 | else |
| 342 | rwlock_read_lock(&namespace_rwlock); |
352 | rwlock_read_lock(&namespace_rwlock); |
| 343 | 353 | ||
| 344 | /* The path is now populated and we can call vfs_lookup_internal(). */ |
354 | /* The path is now populated and we can call vfs_lookup_internal(). */ |
| 345 | vfs_lookup_res_t lr; |
355 | vfs_lookup_res_t lr; |
| 346 | rc = vfs_lookup_internal(path, lflag, &lr, NULL); |
356 | rc = vfs_lookup_internal(path, lflag, &lr, NULL); |
| 347 | if (rc) { |
357 | if (rc) { |
| 348 | if (lflag & L_CREATE) |
358 | if (lflag & L_CREATE) |
| 349 | rwlock_write_unlock(&namespace_rwlock); |
359 | rwlock_write_unlock(&namespace_rwlock); |
| 350 | else |
360 | else |
| 351 | rwlock_read_unlock(&namespace_rwlock); |
361 | rwlock_read_unlock(&namespace_rwlock); |
| 352 | ipc_answer_0(rid, rc); |
362 | ipc_answer_0(rid, rc); |
| 353 | free(path); |
363 | free(path); |
| 354 | return; |
364 | return; |
| 355 | } |
365 | } |
| 356 | 366 | ||
| 357 | /* Path is no longer needed. */ |
367 | /* Path is no longer needed. */ |
| 358 | free(path); |
368 | free(path); |
| 359 | 369 | ||
| 360 | vfs_node_t *node = vfs_node_get(&lr); |
370 | vfs_node_t *node = vfs_node_get(&lr); |
| 361 | if (lflag & L_CREATE) |
371 | if (lflag & L_CREATE) |
| 362 | rwlock_write_unlock(&namespace_rwlock); |
372 | rwlock_write_unlock(&namespace_rwlock); |
| 363 | else |
373 | else |
| 364 | rwlock_read_unlock(&namespace_rwlock); |
374 | rwlock_read_unlock(&namespace_rwlock); |
| 365 | 375 | ||
| 366 | /* Truncate the file if requested and if necessary. */ |
376 | /* Truncate the file if requested and if necessary. */ |
| 367 | if (oflag & O_TRUNC) { |
377 | if (oflag & O_TRUNC) { |
| 368 | rwlock_write_lock(&node->contents_rwlock); |
378 | rwlock_write_lock(&node->contents_rwlock); |
| 369 | if (node->size) { |
379 | if (node->size) { |
| 370 | rc = vfs_truncate_internal(node->fs_handle, |
380 | rc = vfs_truncate_internal(node->fs_handle, |
| 371 | node->dev_handle, node->index, 0); |
381 | node->dev_handle, node->index, 0); |
| 372 | if (rc) { |
382 | if (rc) { |
| 373 | rwlock_write_unlock(&node->contents_rwlock); |
383 | rwlock_write_unlock(&node->contents_rwlock); |
| 374 | vfs_node_put(node); |
384 | vfs_node_put(node); |
| 375 | ipc_answer_0(rid, rc); |
385 | ipc_answer_0(rid, rc); |
| 376 | return; |
386 | return; |
| 377 | } |
387 | } |
| 378 | node->size = 0; |
388 | node->size = 0; |
| 379 | } |
389 | } |
| 380 | rwlock_write_unlock(&node->contents_rwlock); |
390 | rwlock_write_unlock(&node->contents_rwlock); |
| 381 | } |
391 | } |
| 382 | 392 | ||
| 383 | /* |
393 | /* |
| 384 | * Get ourselves a file descriptor and the corresponding vfs_file_t |
394 | * Get ourselves a file descriptor and the corresponding vfs_file_t |
| 385 | * structure. |
395 | * structure. |
| 386 | */ |
396 | */ |
| 387 | int fd = vfs_fd_alloc(); |
397 | int fd = vfs_fd_alloc(); |
| 388 | if (fd < 0) { |
398 | if (fd < 0) { |
| 389 | vfs_node_put(node); |
399 | vfs_node_put(node); |
| 390 | ipc_answer_0(rid, fd); |
400 | ipc_answer_0(rid, fd); |
| 391 | return; |
401 | return; |
| 392 | } |
402 | } |
| 393 | vfs_file_t *file = vfs_file_get(fd); |
403 | vfs_file_t *file = vfs_file_get(fd); |
| 394 | file->node = node; |
404 | file->node = node; |
| 395 | if (oflag & O_APPEND) |
405 | if (oflag & O_APPEND) |
| 396 | file->append = true; |
406 | file->append = true; |
| 397 | 407 | ||
| 398 | /* |
408 | /* |
| 399 | * The following increase in reference count is for the fact that the |
409 | * The following increase in reference count is for the fact that the |
| 400 | * file is being opened and that a file structure is pointing to it. |
410 | * file is being opened and that a file structure is pointing to it. |
| 401 | * It is necessary so that the file will not disappear when |
411 | * It is necessary so that the file will not disappear when |
| 402 | * vfs_node_put() is called. The reference will be dropped by the |
412 | * vfs_node_put() is called. The reference will be dropped by the |
| 403 | * respective VFS_CLOSE. |
413 | * respective VFS_CLOSE. |
| 404 | */ |
414 | */ |
| 405 | vfs_node_addref(node); |
415 | vfs_node_addref(node); |
| 406 | vfs_node_put(node); |
416 | vfs_node_put(node); |
| 407 | 417 | ||
| 408 | /* Success! Return the new file descriptor to the client. */ |
418 | /* Success! Return the new file descriptor to the client. */ |
| 409 | ipc_answer_1(rid, EOK, fd); |
419 | ipc_answer_1(rid, EOK, fd); |
| 410 | } |
420 | } |
| 411 | 421 | ||
| 412 | void vfs_close(ipc_callid_t rid, ipc_call_t *request) |
422 | void vfs_close(ipc_callid_t rid, ipc_call_t *request) |
| 413 | { |
423 | { |
| 414 | int fd = IPC_GET_ARG1(*request); |
424 | int fd = IPC_GET_ARG1(*request); |
| 415 | if (fd >= MAX_OPEN_FILES) { |
425 | if (fd >= MAX_OPEN_FILES) { |
| 416 | ipc_answer_0(rid, EBADF); |
426 | ipc_answer_0(rid, EBADF); |
| 417 | return; |
427 | return; |
| 418 | } |
428 | } |
| 419 | vfs_fd_free(fd); |
429 | vfs_fd_free(fd); |
| 420 | ipc_answer_0(rid, EOK); |
430 | ipc_answer_0(rid, EOK); |
| 421 | } |
431 | } |
| 422 | 432 | ||
| 423 | static void vfs_rdwr(ipc_callid_t rid, ipc_call_t *request, bool read) |
433 | static void vfs_rdwr(ipc_callid_t rid, ipc_call_t *request, bool read) |
| 424 | { |
434 | { |
| 425 | 435 | ||
| 426 | /* |
436 | /* |
| 427 | * The following code strongly depends on the fact that the files data |
437 | * The following code strongly depends on the fact that the files data |
| 428 | * structure can be only accessed by a single fibril and all file |
438 | * structure can be only accessed by a single fibril and all file |
| 429 | * operations are serialized (i.e. the reads and writes cannot |
439 | * operations are serialized (i.e. the reads and writes cannot |
| 430 | * interleave and a file cannot be closed while it is being read). |
440 | * interleave and a file cannot be closed while it is being read). |
| 431 | * |
441 | * |
| 432 | * Additional synchronization needs to be added once the table of |
442 | * Additional synchronization needs to be added once the table of |
| 433 | * open files supports parallel access! |
443 | * open files supports parallel access! |
| 434 | */ |
444 | */ |
| 435 | 445 | ||
| 436 | int fd = IPC_GET_ARG1(*request); |
446 | int fd = IPC_GET_ARG1(*request); |
| 437 | 447 | ||
| 438 | /* Lookup the file structure corresponding to the file descriptor. */ |
448 | /* Lookup the file structure corresponding to the file descriptor. */ |
| 439 | vfs_file_t *file = vfs_file_get(fd); |
449 | vfs_file_t *file = vfs_file_get(fd); |
| 440 | if (!file) { |
450 | if (!file) { |
| 441 | ipc_answer_0(rid, ENOENT); |
451 | ipc_answer_0(rid, ENOENT); |
| 442 | return; |
452 | return; |
| 443 | } |
453 | } |
| 444 | 454 | ||
| 445 | /* |
455 | /* |
| 446 | * Now we need to receive a call with client's |
456 | * Now we need to receive a call with client's |
| 447 | * IPC_M_DATA_READ/IPC_M_DATA_WRITE request. |
457 | * IPC_M_DATA_READ/IPC_M_DATA_WRITE request. |
| 448 | */ |
458 | */ |
| 449 | ipc_callid_t callid; |
459 | ipc_callid_t callid; |
| 450 | int res; |
460 | int res; |
| 451 | if (read) |
461 | if (read) |
| 452 | res = ipc_data_read_receive(&callid, NULL); |
462 | res = ipc_data_read_receive(&callid, NULL); |
| 453 | else |
463 | else |
| 454 | res = ipc_data_write_receive(&callid, NULL); |
464 | res = ipc_data_write_receive(&callid, NULL); |
| 455 | if (!res) { |
465 | if (!res) { |
| 456 | ipc_answer_0(callid, EINVAL); |
466 | ipc_answer_0(callid, EINVAL); |
| 457 | ipc_answer_0(rid, EINVAL); |
467 | ipc_answer_0(rid, EINVAL); |
| 458 | return; |
468 | return; |
| 459 | } |
469 | } |
| 460 | 470 | ||
| 461 | /* |
471 | /* |
| 462 | * Lock the open file structure so that no other thread can manipulate |
472 | * Lock the open file structure so that no other thread can manipulate |
| 463 | * the same open file at a time. |
473 | * the same open file at a time. |
| 464 | */ |
474 | */ |
| 465 | futex_down(&file->lock); |
475 | futex_down(&file->lock); |
| 466 | 476 | ||
| 467 | /* |
477 | /* |
| 468 | * Lock the file's node so that no other client can read/write to it at |
478 | * Lock the file's node so that no other client can read/write to it at |
| 469 | * the same time. |
479 | * the same time. |
| 470 | */ |
480 | */ |
| 471 | if (read) |
481 | if (read) |
| 472 | rwlock_read_lock(&file->node->contents_rwlock); |
482 | rwlock_read_lock(&file->node->contents_rwlock); |
| 473 | else |
483 | else |
| 474 | rwlock_write_lock(&file->node->contents_rwlock); |
484 | rwlock_write_lock(&file->node->contents_rwlock); |
| 475 | 485 | ||
| 476 | int fs_phone = vfs_grab_phone(file->node->fs_handle); |
486 | int fs_phone = vfs_grab_phone(file->node->fs_handle); |
| 477 | 487 | ||
| 478 | /* Make a VFS_READ/VFS_WRITE request at the destination FS server. */ |
488 | /* Make a VFS_READ/VFS_WRITE request at the destination FS server. */ |
| 479 | aid_t msg; |
489 | aid_t msg; |
| 480 | ipc_call_t answer; |
490 | ipc_call_t answer; |
| 481 | if (!read && file->append) |
491 | if (!read && file->append) |
| 482 | file->pos = file->node->size; |
492 | file->pos = file->node->size; |
| 483 | msg = async_send_3(fs_phone, IPC_GET_METHOD(*request), |
493 | msg = async_send_3(fs_phone, IPC_GET_METHOD(*request), |
| 484 | file->node->dev_handle, file->node->index, file->pos, &answer); |
494 | file->node->dev_handle, file->node->index, file->pos, &answer); |
| 485 | 495 | ||
| 486 | /* |
496 | /* |
| 487 | * Forward the IPC_M_DATA_READ/IPC_M_DATA_WRITE request to the |
497 | * Forward the IPC_M_DATA_READ/IPC_M_DATA_WRITE request to the |
| 488 | * destination FS server. The call will be routed as if sent by |
498 | * destination FS server. The call will be routed as if sent by |
| 489 | * ourselves. Note that call arguments are immutable in this case so we |
499 | * ourselves. Note that call arguments are immutable in this case so we |
| 490 | * don't have to bother. |
500 | * don't have to bother. |
| 491 | */ |
501 | */ |
| 492 | ipc_forward_fast(callid, fs_phone, 0, 0, 0, IPC_FF_ROUTE_FROM_ME); |
502 | ipc_forward_fast(callid, fs_phone, 0, 0, 0, IPC_FF_ROUTE_FROM_ME); |
| 493 | 503 | ||
| 494 | vfs_release_phone(fs_phone); |
504 | vfs_release_phone(fs_phone); |
| 495 | 505 | ||
| 496 | /* Wait for reply from the FS server. */ |
506 | /* Wait for reply from the FS server. */ |
| 497 | ipcarg_t rc; |
507 | ipcarg_t rc; |
| 498 | async_wait_for(msg, &rc); |
508 | async_wait_for(msg, &rc); |
| 499 | size_t bytes = IPC_GET_ARG1(answer); |
509 | size_t bytes = IPC_GET_ARG1(answer); |
| 500 | 510 | ||
| 501 | /* Unlock the VFS node. */ |
511 | /* Unlock the VFS node. */ |
| 502 | if (read) |
512 | if (read) |
| 503 | rwlock_read_unlock(&file->node->contents_rwlock); |
513 | rwlock_read_unlock(&file->node->contents_rwlock); |
| 504 | else { |
514 | else { |
| 505 | /* Update the cached version of node's size. */ |
515 | /* Update the cached version of node's size. */ |
| 506 | if (rc == EOK) |
516 | if (rc == EOK) |
| 507 | file->node->size = IPC_GET_ARG2(answer); |
517 | file->node->size = IPC_GET_ARG2(answer); |
| 508 | rwlock_write_unlock(&file->node->contents_rwlock); |
518 | rwlock_write_unlock(&file->node->contents_rwlock); |
| 509 | } |
519 | } |
| 510 | 520 | ||
| 511 | /* Update the position pointer and unlock the open file. */ |
521 | /* Update the position pointer and unlock the open file. */ |
| 512 | if (rc == EOK) |
522 | if (rc == EOK) |
| 513 | file->pos += bytes; |
523 | file->pos += bytes; |
| 514 | futex_up(&file->lock); |
524 | futex_up(&file->lock); |
| 515 | 525 | ||
| 516 | /* |
526 | /* |
| 517 | * FS server's reply is the final result of the whole operation we |
527 | * FS server's reply is the final result of the whole operation we |
| 518 | * return to the client. |
528 | * return to the client. |
| 519 | */ |
529 | */ |
| 520 | ipc_answer_1(rid, rc, bytes); |
530 | ipc_answer_1(rid, rc, bytes); |
| 521 | } |
531 | } |
| 522 | 532 | ||
| 523 | void vfs_read(ipc_callid_t rid, ipc_call_t *request) |
533 | void vfs_read(ipc_callid_t rid, ipc_call_t *request) |
| 524 | { |
534 | { |
| 525 | vfs_rdwr(rid, request, true); |
535 | vfs_rdwr(rid, request, true); |
| 526 | } |
536 | } |
| 527 | 537 | ||
| 528 | void vfs_write(ipc_callid_t rid, ipc_call_t *request) |
538 | void vfs_write(ipc_callid_t rid, ipc_call_t *request) |
| 529 | { |
539 | { |
| 530 | vfs_rdwr(rid, request, false); |
540 | vfs_rdwr(rid, request, false); |
| 531 | } |
541 | } |
| 532 | 542 | ||
| 533 | void vfs_seek(ipc_callid_t rid, ipc_call_t *request) |
543 | void vfs_seek(ipc_callid_t rid, ipc_call_t *request) |
| 534 | { |
544 | { |
| 535 | int fd = (int) IPC_GET_ARG1(*request); |
545 | int fd = (int) IPC_GET_ARG1(*request); |
| 536 | off_t off = (off_t) IPC_GET_ARG2(*request); |
546 | off_t off = (off_t) IPC_GET_ARG2(*request); |
| 537 | int whence = (int) IPC_GET_ARG3(*request); |
547 | int whence = (int) IPC_GET_ARG3(*request); |
| 538 | 548 | ||
| 539 | 549 | ||
| 540 | /* Lookup the file structure corresponding to the file descriptor. */ |
550 | /* Lookup the file structure corresponding to the file descriptor. */ |
| 541 | vfs_file_t *file = vfs_file_get(fd); |
551 | vfs_file_t *file = vfs_file_get(fd); |
| 542 | if (!file) { |
552 | if (!file) { |
| 543 | ipc_answer_0(rid, ENOENT); |
553 | ipc_answer_0(rid, ENOENT); |
| 544 | return; |
554 | return; |
| 545 | } |
555 | } |
| 546 | 556 | ||
| 547 | off_t newpos; |
557 | off_t newpos; |
| 548 | futex_down(&file->lock); |
558 | futex_down(&file->lock); |
| 549 | if (whence == SEEK_SET) { |
559 | if (whence == SEEK_SET) { |
| 550 | file->pos = off; |
560 | file->pos = off; |
| 551 | futex_up(&file->lock); |
561 | futex_up(&file->lock); |
| 552 | ipc_answer_1(rid, EOK, off); |
562 | ipc_answer_1(rid, EOK, off); |
| 553 | return; |
563 | return; |
| 554 | } |
564 | } |
| 555 | if (whence == SEEK_CUR) { |
565 | if (whence == SEEK_CUR) { |
| 556 | if (file->pos + off < file->pos) { |
566 | if (file->pos + off < file->pos) { |
| 557 | futex_up(&file->lock); |
567 | futex_up(&file->lock); |
| 558 | ipc_answer_0(rid, EOVERFLOW); |
568 | ipc_answer_0(rid, EOVERFLOW); |
| 559 | return; |
569 | return; |
| 560 | } |
570 | } |
| 561 | file->pos += off; |
571 | file->pos += off; |
| 562 | newpos = file->pos; |
572 | newpos = file->pos; |
| 563 | futex_up(&file->lock); |
573 | futex_up(&file->lock); |
| 564 | ipc_answer_1(rid, EOK, newpos); |
574 | ipc_answer_1(rid, EOK, newpos); |
| 565 | return; |
575 | return; |
| 566 | } |
576 | } |
| 567 | if (whence == SEEK_END) { |
577 | if (whence == SEEK_END) { |
| 568 | rwlock_read_lock(&file->node->contents_rwlock); |
578 | rwlock_read_lock(&file->node->contents_rwlock); |
| 569 | size_t size = file->node->size; |
579 | size_t size = file->node->size; |
| 570 | rwlock_read_unlock(&file->node->contents_rwlock); |
580 | rwlock_read_unlock(&file->node->contents_rwlock); |
| 571 | if (size + off < size) { |
581 | if (size + off < size) { |
| 572 | futex_up(&file->lock); |
582 | futex_up(&file->lock); |
| 573 | ipc_answer_0(rid, EOVERFLOW); |
583 | ipc_answer_0(rid, EOVERFLOW); |
| 574 | return; |
584 | return; |
| 575 | } |
585 | } |
| 576 | newpos = size + off; |
586 | newpos = size + off; |
| 577 | futex_up(&file->lock); |
587 | futex_up(&file->lock); |
| 578 | ipc_answer_1(rid, EOK, newpos); |
588 | ipc_answer_1(rid, EOK, newpos); |
| 579 | return; |
589 | return; |
| 580 | } |
590 | } |
| 581 | futex_up(&file->lock); |
591 | futex_up(&file->lock); |
| 582 | ipc_answer_0(rid, EINVAL); |
592 | ipc_answer_0(rid, EINVAL); |
| 583 | } |
593 | } |
| 584 | 594 | ||
| 585 | int |
595 | int |
| 586 | vfs_truncate_internal(fs_handle_t fs_handle, dev_handle_t dev_handle, |
596 | vfs_truncate_internal(fs_handle_t fs_handle, dev_handle_t dev_handle, |
| 587 | fs_index_t index, size_t size) |
597 | fs_index_t index, size_t size) |
| 588 | { |
598 | { |
| 589 | ipcarg_t rc; |
599 | ipcarg_t rc; |
| 590 | int fs_phone; |
600 | int fs_phone; |
| 591 | 601 | ||
| 592 | fs_phone = vfs_grab_phone(fs_handle); |
602 | fs_phone = vfs_grab_phone(fs_handle); |
| 593 | rc = async_req_3_0(fs_phone, VFS_TRUNCATE, (ipcarg_t)dev_handle, |
603 | rc = async_req_3_0(fs_phone, VFS_TRUNCATE, (ipcarg_t)dev_handle, |
| 594 | (ipcarg_t)index, (ipcarg_t)size); |
604 | (ipcarg_t)index, (ipcarg_t)size); |
| 595 | vfs_release_phone(fs_phone); |
605 | vfs_release_phone(fs_phone); |
| 596 | return (int)rc; |
606 | return (int)rc; |
| 597 | } |
607 | } |
| 598 | 608 | ||
| 599 | void vfs_truncate(ipc_callid_t rid, ipc_call_t *request) |
609 | void vfs_truncate(ipc_callid_t rid, ipc_call_t *request) |
| 600 | { |
610 | { |
| 601 | int fd = IPC_GET_ARG1(*request); |
611 | int fd = IPC_GET_ARG1(*request); |
| 602 | size_t size = IPC_GET_ARG2(*request); |
612 | size_t size = IPC_GET_ARG2(*request); |
| 603 | int rc; |
613 | int rc; |
| 604 | 614 | ||
| 605 | vfs_file_t *file = vfs_file_get(fd); |
615 | vfs_file_t *file = vfs_file_get(fd); |
| 606 | if (!file) { |
616 | if (!file) { |
| 607 | ipc_answer_0(rid, ENOENT); |
617 | ipc_answer_0(rid, ENOENT); |
| 608 | return; |
618 | return; |
| 609 | } |
619 | } |
| 610 | futex_down(&file->lock); |
620 | futex_down(&file->lock); |
| 611 | 621 | ||
| 612 | rwlock_write_lock(&file->node->contents_rwlock); |
622 | rwlock_write_lock(&file->node->contents_rwlock); |
| 613 | rc = vfs_truncate_internal(file->node->fs_handle, |
623 | rc = vfs_truncate_internal(file->node->fs_handle, |
| 614 | file->node->dev_handle, file->node->index, size); |
624 | file->node->dev_handle, file->node->index, size); |
| 615 | if (rc == EOK) |
625 | if (rc == EOK) |
| 616 | file->node->size = size; |
626 | file->node->size = size; |
| 617 | rwlock_write_unlock(&file->node->contents_rwlock); |
627 | rwlock_write_unlock(&file->node->contents_rwlock); |
| 618 | 628 | ||
| 619 | futex_up(&file->lock); |
629 | futex_up(&file->lock); |
| 620 | ipc_answer_0(rid, (ipcarg_t)rc); |
630 | ipc_answer_0(rid, (ipcarg_t)rc); |
| 621 | } |
631 | } |
| 622 | 632 | ||
| 623 | void vfs_mkdir(ipc_callid_t rid, ipc_call_t *request) |
633 | void vfs_mkdir(ipc_callid_t rid, ipc_call_t *request) |
| 624 | { |
634 | { |
| 625 | int mode = IPC_GET_ARG1(*request); |
635 | int mode = IPC_GET_ARG1(*request); |
| 626 | 636 | ||
| 627 | size_t len; |
637 | size_t len; |
| 628 | ipc_callid_t callid; |
638 | ipc_callid_t callid; |
| 629 | 639 | ||
| 630 | if (!ipc_data_write_receive(&callid, &len)) { |
640 | if (!ipc_data_write_receive(&callid, &len)) { |
| 631 | ipc_answer_0(callid, EINVAL); |
641 | ipc_answer_0(callid, EINVAL); |
| 632 | ipc_answer_0(rid, EINVAL); |
642 | ipc_answer_0(rid, EINVAL); |
| 633 | return; |
643 | return; |
| 634 | } |
644 | } |
| 635 | char *path = malloc(len + 1); |
645 | char *path = malloc(len + 1); |
| 636 | if (!path) { |
646 | if (!path) { |
| 637 | ipc_answer_0(callid, ENOMEM); |
647 | ipc_answer_0(callid, ENOMEM); |
| 638 | ipc_answer_0(rid, ENOMEM); |
648 | ipc_answer_0(rid, ENOMEM); |
| 639 | return; |
649 | return; |
| 640 | } |
650 | } |
| 641 | int rc; |
651 | int rc; |
| 642 | if ((rc = ipc_data_write_finalize(callid, path, len))) { |
652 | if ((rc = ipc_data_write_finalize(callid, path, len))) { |
| 643 | ipc_answer_0(rid, rc); |
653 | ipc_answer_0(rid, rc); |
| 644 | free(path); |
654 | free(path); |
| 645 | return; |
655 | return; |
| 646 | } |
656 | } |
| 647 | path[len] = '\0'; |
657 | path[len] = '\0'; |
| 648 | 658 | ||
| 649 | rwlock_write_lock(&namespace_rwlock); |
659 | rwlock_write_lock(&namespace_rwlock); |
| 650 | int lflag = L_DIRECTORY | L_CREATE | L_EXCLUSIVE; |
660 | int lflag = L_DIRECTORY | L_CREATE | L_EXCLUSIVE; |
| 651 | rc = vfs_lookup_internal(path, lflag, NULL, NULL); |
661 | rc = vfs_lookup_internal(path, lflag, NULL, NULL); |
| 652 | rwlock_write_unlock(&namespace_rwlock); |
662 | rwlock_write_unlock(&namespace_rwlock); |
| 653 | free(path); |
663 | free(path); |
| 654 | ipc_answer_0(rid, rc); |
664 | ipc_answer_0(rid, rc); |
| 655 | } |
665 | } |
| 656 | 666 | ||
| 657 | void vfs_unlink(ipc_callid_t rid, ipc_call_t *request) |
667 | void vfs_unlink(ipc_callid_t rid, ipc_call_t *request) |
| 658 | { |
668 | { |
| 659 | int lflag = IPC_GET_ARG1(*request); |
669 | int lflag = IPC_GET_ARG1(*request); |
| 660 | 670 | ||
| 661 | size_t len; |
671 | size_t len; |
| 662 | ipc_callid_t callid; |
672 | ipc_callid_t callid; |
| 663 | 673 | ||
| 664 | if (!ipc_data_write_receive(&callid, &len)) { |
674 | if (!ipc_data_write_receive(&callid, &len)) { |
| 665 | ipc_answer_0(callid, EINVAL); |
675 | ipc_answer_0(callid, EINVAL); |
| 666 | ipc_answer_0(rid, EINVAL); |
676 | ipc_answer_0(rid, EINVAL); |
| 667 | return; |
677 | return; |
| 668 | } |
678 | } |
| 669 | char *path = malloc(len + 1); |
679 | char *path = malloc(len + 1); |
| 670 | if (!path) { |
680 | if (!path) { |
| 671 | ipc_answer_0(callid, ENOMEM); |
681 | ipc_answer_0(callid, ENOMEM); |
| 672 | ipc_answer_0(rid, ENOMEM); |
682 | ipc_answer_0(rid, ENOMEM); |
| 673 | return; |
683 | return; |
| 674 | } |
684 | } |
| 675 | int rc; |
685 | int rc; |
| 676 | if ((rc = ipc_data_write_finalize(callid, path, len))) { |
686 | if ((rc = ipc_data_write_finalize(callid, path, len))) { |
| 677 | ipc_answer_0(rid, rc); |
687 | ipc_answer_0(rid, rc); |
| 678 | free(path); |
688 | free(path); |
| 679 | return; |
689 | return; |
| 680 | } |
690 | } |
| 681 | path[len] = '\0'; |
691 | path[len] = '\0'; |
| 682 | 692 | ||
| 683 | rwlock_write_lock(&namespace_rwlock); |
693 | rwlock_write_lock(&namespace_rwlock); |
| 684 | lflag &= L_DIRECTORY; /* sanitize lflag */ |
694 | lflag &= L_DIRECTORY; /* sanitize lflag */ |
| 685 | vfs_lookup_res_t lr; |
695 | vfs_lookup_res_t lr; |
| 686 | rc = vfs_lookup_internal(path, lflag | L_UNLINK, &lr, NULL); |
696 | rc = vfs_lookup_internal(path, lflag | L_UNLINK, &lr, NULL); |
| 687 | free(path); |
697 | free(path); |
| 688 | if (rc != EOK) { |
698 | if (rc != EOK) { |
| 689 | rwlock_write_unlock(&namespace_rwlock); |
699 | rwlock_write_unlock(&namespace_rwlock); |
| 690 | ipc_answer_0(rid, rc); |
700 | ipc_answer_0(rid, rc); |
| 691 | return; |
701 | return; |
| 692 | } |
702 | } |
| 693 | 703 | ||
| 694 | /* |
704 | /* |
| 695 | * The name has already been unlinked by vfs_lookup_internal(). |
705 | * The name has already been unlinked by vfs_lookup_internal(). |
| 696 | * We have to get and put the VFS node to ensure that it is |
706 | * We have to get and put the VFS node to ensure that it is |
| 697 | * VFS_DESTROY'ed after the last reference to it is dropped. |
707 | * VFS_DESTROY'ed after the last reference to it is dropped. |
| 698 | */ |
708 | */ |
| 699 | vfs_node_t *node = vfs_node_get(&lr); |
709 | vfs_node_t *node = vfs_node_get(&lr); |
| 700 | futex_down(&nodes_futex); |
710 | futex_down(&nodes_futex); |
| 701 | node->lnkcnt--; |
711 | node->lnkcnt--; |
| 702 | futex_up(&nodes_futex); |
712 | futex_up(&nodes_futex); |
| 703 | rwlock_write_unlock(&namespace_rwlock); |
713 | rwlock_write_unlock(&namespace_rwlock); |
| 704 | vfs_node_put(node); |
714 | vfs_node_put(node); |
| 705 | ipc_answer_0(rid, EOK); |
715 | ipc_answer_0(rid, EOK); |
| 706 | } |
716 | } |
| 707 | 717 | ||
| 708 | void vfs_rename(ipc_callid_t rid, ipc_call_t *request) |
718 | void vfs_rename(ipc_callid_t rid, ipc_call_t *request) |
| 709 | { |
719 | { |
| 710 | size_t len; |
720 | size_t len; |
| 711 | ipc_callid_t callid; |
721 | ipc_callid_t callid; |
| 712 | int rc; |
722 | int rc; |
| 713 | 723 | ||
| 714 | /* Retrieve the old path. */ |
724 | /* Retrieve the old path. */ |
| 715 | if (!ipc_data_write_receive(&callid, &len)) { |
725 | if (!ipc_data_write_receive(&callid, &len)) { |
| 716 | ipc_answer_0(callid, EINVAL); |
726 | ipc_answer_0(callid, EINVAL); |
| 717 | ipc_answer_0(rid, EINVAL); |
727 | ipc_answer_0(rid, EINVAL); |
| 718 | return; |
728 | return; |
| 719 | } |
729 | } |
| 720 | char *old = malloc(len + 1); |
730 | char *old = malloc(len + 1); |
| 721 | if (!old) { |
731 | if (!old) { |
| 722 | ipc_answer_0(callid, ENOMEM); |
732 | ipc_answer_0(callid, ENOMEM); |
| 723 | ipc_answer_0(rid, ENOMEM); |
733 | ipc_answer_0(rid, ENOMEM); |
| 724 | return; |
734 | return; |
| 725 | } |
735 | } |
| 726 | if ((rc = ipc_data_write_finalize(callid, old, len))) { |
736 | if ((rc = ipc_data_write_finalize(callid, old, len))) { |
| 727 | ipc_answer_0(rid, rc); |
737 | ipc_answer_0(rid, rc); |
| 728 | free(old); |
738 | free(old); |
| 729 | return; |
739 | return; |
| 730 | } |
740 | } |
| 731 | old[len] = '\0'; |
741 | old[len] = '\0'; |
| 732 | 742 | ||
| 733 | /* Retrieve the new path. */ |
743 | /* Retrieve the new path. */ |
| 734 | if (!ipc_data_write_receive(&callid, &len)) { |
744 | if (!ipc_data_write_receive(&callid, &len)) { |
| 735 | ipc_answer_0(callid, EINVAL); |
745 | ipc_answer_0(callid, EINVAL); |
| 736 | ipc_answer_0(rid, EINVAL); |
746 | ipc_answer_0(rid, EINVAL); |
| 737 | free(old); |
747 | free(old); |
| 738 | return; |
748 | return; |
| 739 | } |
749 | } |
| 740 | char *new = malloc(len + 1); |
750 | char *new = malloc(len + 1); |
| 741 | if (!new) { |
751 | if (!new) { |
| 742 | ipc_answer_0(callid, ENOMEM); |
752 | ipc_answer_0(callid, ENOMEM); |
| 743 | ipc_answer_0(rid, ENOMEM); |
753 | ipc_answer_0(rid, ENOMEM); |
| 744 | free(old); |
754 | free(old); |
| 745 | return; |
755 | return; |
| 746 | } |
756 | } |
| 747 | if ((rc = ipc_data_write_finalize(callid, new, len))) { |
757 | if ((rc = ipc_data_write_finalize(callid, new, len))) { |
| 748 | ipc_answer_0(rid, rc); |
758 | ipc_answer_0(rid, rc); |
| 749 | free(old); |
759 | free(old); |
| 750 | free(new); |
760 | free(new); |
| 751 | return; |
761 | return; |
| 752 | } |
762 | } |
| 753 | new[len] = '\0'; |
763 | new[len] = '\0'; |
| 754 | 764 | ||
| 755 | char *oldc = canonify(old, &len); |
765 | char *oldc = canonify(old, &len); |
| 756 | char *newc = canonify(new, NULL); |
766 | char *newc = canonify(new, NULL); |
| 757 | if (!oldc || !newc) { |
767 | if (!oldc || !newc) { |
| 758 | ipc_answer_0(rid, EINVAL); |
768 | ipc_answer_0(rid, EINVAL); |
| 759 | free(old); |
769 | free(old); |
| 760 | free(new); |
770 | free(new); |
| 761 | return; |
771 | return; |
| 762 | } |
772 | } |
| 763 | if (!strncmp(newc, oldc, len)) { |
773 | if (!strncmp(newc, oldc, len)) { |
| 764 | /* oldc is a prefix of newc */ |
774 | /* oldc is a prefix of newc */ |
| 765 | ipc_answer_0(rid, EINVAL); |
775 | ipc_answer_0(rid, EINVAL); |
| 766 | free(old); |
776 | free(old); |
| 767 | free(new); |
777 | free(new); |
| 768 | return; |
778 | return; |
| 769 | } |
779 | } |
| 770 | 780 | ||
| 771 | vfs_lookup_res_t old_lr; |
781 | vfs_lookup_res_t old_lr; |
| 772 | vfs_lookup_res_t new_lr; |
782 | vfs_lookup_res_t new_lr; |
| 773 | vfs_lookup_res_t new_par_lr; |
783 | vfs_lookup_res_t new_par_lr; |
| 774 | rwlock_write_lock(&namespace_rwlock); |
784 | rwlock_write_lock(&namespace_rwlock); |
| 775 | /* Lookup the node belonging to the old file name. */ |
785 | /* Lookup the node belonging to the old file name. */ |
| 776 | rc = vfs_lookup_internal(oldc, L_NONE, &old_lr, NULL); |
786 | rc = vfs_lookup_internal(oldc, L_NONE, &old_lr, NULL); |
| 777 | if (rc != EOK) { |
787 | if (rc != EOK) { |
| 778 | rwlock_write_unlock(&namespace_rwlock); |
788 | rwlock_write_unlock(&namespace_rwlock); |
| 779 | ipc_answer_0(rid, rc); |
789 | ipc_answer_0(rid, rc); |
| 780 | free(old); |
790 | free(old); |
| 781 | free(new); |
791 | free(new); |
| 782 | return; |
792 | return; |
| 783 | } |
793 | } |
| 784 | vfs_node_t *old_node = vfs_node_get(&old_lr); |
794 | vfs_node_t *old_node = vfs_node_get(&old_lr); |
| 785 | if (!old_node) { |
795 | if (!old_node) { |
| 786 | rwlock_write_unlock(&namespace_rwlock); |
796 | rwlock_write_unlock(&namespace_rwlock); |
| 787 | ipc_answer_0(rid, ENOMEM); |
797 | ipc_answer_0(rid, ENOMEM); |
| 788 | free(old); |
798 | free(old); |
| 789 | free(new); |
799 | free(new); |
| 790 | return; |
800 | return; |
| 791 | } |
801 | } |
| 792 | /* Lookup parent of the new file name. */ |
802 | /* Lookup parent of the new file name. */ |
| 793 | rc = vfs_lookup_internal(newc, L_PARENT, &new_par_lr, NULL); |
803 | rc = vfs_lookup_internal(newc, L_PARENT, &new_par_lr, NULL); |
| 794 | if (rc != EOK) { |
804 | if (rc != EOK) { |
| 795 | rwlock_write_unlock(&namespace_rwlock); |
805 | rwlock_write_unlock(&namespace_rwlock); |
| 796 | ipc_answer_0(rid, rc); |
806 | ipc_answer_0(rid, rc); |
| 797 | free(old); |
807 | free(old); |
| 798 | free(new); |
808 | free(new); |
| 799 | return; |
809 | return; |
| 800 | } |
810 | } |
| 801 | /* Check whether linking to the same file system instance. */ |
811 | /* Check whether linking to the same file system instance. */ |
| 802 | if ((old_node->fs_handle != new_par_lr.triplet.fs_handle) || |
812 | if ((old_node->fs_handle != new_par_lr.triplet.fs_handle) || |
| 803 | (old_node->dev_handle != new_par_lr.triplet.dev_handle)) { |
813 | (old_node->dev_handle != new_par_lr.triplet.dev_handle)) { |
| 804 | rwlock_write_unlock(&namespace_rwlock); |
814 | rwlock_write_unlock(&namespace_rwlock); |
| 805 | ipc_answer_0(rid, EXDEV); /* different file systems */ |
815 | ipc_answer_0(rid, EXDEV); /* different file systems */ |
| 806 | free(old); |
816 | free(old); |
| 807 | free(new); |
817 | free(new); |
| 808 | return; |
818 | return; |
| 809 | } |
819 | } |
| 810 | /* Destroy the old link for the new name. */ |
820 | /* Destroy the old link for the new name. */ |
| 811 | vfs_node_t *new_node = NULL; |
821 | vfs_node_t *new_node = NULL; |
| 812 | rc = vfs_lookup_internal(newc, L_UNLINK, &new_lr, NULL); |
822 | rc = vfs_lookup_internal(newc, L_UNLINK, &new_lr, NULL); |
| 813 | switch (rc) { |
823 | switch (rc) { |
| 814 | case ENOENT: |
824 | case ENOENT: |
| 815 | /* simply not in our way */ |
825 | /* simply not in our way */ |
| 816 | break; |
826 | break; |
| 817 | case EOK: |
827 | case EOK: |
| 818 | new_node = vfs_node_get(&new_lr); |
828 | new_node = vfs_node_get(&new_lr); |
| 819 | if (!new_node) { |
829 | if (!new_node) { |
| 820 | rwlock_write_unlock(&namespace_rwlock); |
830 | rwlock_write_unlock(&namespace_rwlock); |
| 821 | ipc_answer_0(rid, ENOMEM); |
831 | ipc_answer_0(rid, ENOMEM); |
| 822 | free(old); |
832 | free(old); |
| 823 | free(new); |
833 | free(new); |
| 824 | return; |
834 | return; |
| 825 | } |
835 | } |
| 826 | futex_down(&nodes_futex); |
836 | futex_down(&nodes_futex); |
| 827 | new_node->lnkcnt--; |
837 | new_node->lnkcnt--; |
| 828 | futex_up(&nodes_futex); |
838 | futex_up(&nodes_futex); |
| 829 | break; |
839 | break; |
| 830 | default: |
840 | default: |
| 831 | rwlock_write_unlock(&namespace_rwlock); |
841 | rwlock_write_unlock(&namespace_rwlock); |
| 832 | ipc_answer_0(rid, ENOTEMPTY); |
842 | ipc_answer_0(rid, ENOTEMPTY); |
| 833 | free(old); |
843 | free(old); |
| 834 | free(new); |
844 | free(new); |
| 835 | return; |
845 | return; |
| 836 | } |
846 | } |
| 837 | /* Create the new link for the new name. */ |
847 | /* Create the new link for the new name. */ |
| 838 | rc = vfs_lookup_internal(newc, L_LINK, NULL, NULL, old_node->index); |
848 | rc = vfs_lookup_internal(newc, L_LINK, NULL, NULL, old_node->index); |
| 839 | if (rc != EOK) { |
849 | if (rc != EOK) { |
| 840 | rwlock_write_unlock(&namespace_rwlock); |
850 | rwlock_write_unlock(&namespace_rwlock); |
| 841 | if (new_node) |
851 | if (new_node) |
| 842 | vfs_node_put(new_node); |
852 | vfs_node_put(new_node); |
| 843 | ipc_answer_0(rid, rc); |
853 | ipc_answer_0(rid, rc); |
| 844 | free(old); |
854 | free(old); |
| 845 | free(new); |
855 | free(new); |
| 846 | return; |
856 | return; |
| 847 | } |
857 | } |
| 848 | futex_down(&nodes_futex); |
858 | futex_down(&nodes_futex); |
| 849 | old_node->lnkcnt++; |
859 | old_node->lnkcnt++; |
| 850 | futex_up(&nodes_futex); |
860 | futex_up(&nodes_futex); |
| 851 | /* Destroy the link for the old name. */ |
861 | /* Destroy the link for the old name. */ |
| 852 | rc = vfs_lookup_internal(oldc, L_UNLINK, NULL, NULL); |
862 | rc = vfs_lookup_internal(oldc, L_UNLINK, NULL, NULL); |
| 853 | if (rc != EOK) { |
863 | if (rc != EOK) { |
| 854 | rwlock_write_unlock(&namespace_rwlock); |
864 | rwlock_write_unlock(&namespace_rwlock); |
| 855 | vfs_node_put(old_node); |
865 | vfs_node_put(old_node); |
| 856 | if (new_node) |
866 | if (new_node) |
| 857 | vfs_node_put(new_node); |
867 | vfs_node_put(new_node); |
| 858 | ipc_answer_0(rid, rc); |
868 | ipc_answer_0(rid, rc); |
| 859 | free(old); |
869 | free(old); |
| 860 | free(new); |
870 | free(new); |
| 861 | return; |
871 | return; |
| 862 | } |
872 | } |
| 863 | futex_down(&nodes_futex); |
873 | futex_down(&nodes_futex); |
| 864 | old_node->lnkcnt--; |
874 | old_node->lnkcnt--; |
| 865 | futex_up(&nodes_futex); |
875 | futex_up(&nodes_futex); |
| 866 | rwlock_write_unlock(&namespace_rwlock); |
876 | rwlock_write_unlock(&namespace_rwlock); |
| 867 | vfs_node_put(old_node); |
877 | vfs_node_put(old_node); |
| 868 | if (new_node) |
878 | if (new_node) |
| 869 | vfs_node_put(new_node); |
879 | vfs_node_put(new_node); |
| 870 | free(old); |
880 | free(old); |
| 871 | free(new); |
881 | free(new); |
| 872 | ipc_answer_0(rid, EOK); |
882 | ipc_answer_0(rid, EOK); |
| 873 | } |
883 | } |
| 874 | 884 | ||
| 875 | /** |
885 | /** |
| 876 | * @} |
886 | * @} |
| 877 | */ |
887 | */ |
| 878 | 888 | ||