Rev 2760 | Rev 2770 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2760 | Rev 2763 | ||
---|---|---|---|
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 libfs |
29 | /** @addtogroup libfs |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** |
32 | /** |
33 | * @file |
33 | * @file |
34 | * Glue code which is commonod to all FS implementations. |
34 | * Glue code which is commonod to all FS implementations. |
35 | */ |
35 | */ |
36 | 36 | ||
37 | #include "libfs.h" |
37 | #include "libfs.h" |
38 | #include "../../srv/vfs/vfs.h" |
38 | #include "../../srv/vfs/vfs.h" |
39 | #include <errno.h> |
39 | #include <errno.h> |
40 | #include <async.h> |
40 | #include <async.h> |
41 | #include <ipc/ipc.h> |
41 | #include <ipc/ipc.h> |
42 | #include <as.h> |
42 | #include <as.h> |
43 | #include <assert.h> |
43 | #include <assert.h> |
44 | #include <dirent.h> |
44 | #include <dirent.h> |
45 | 45 | ||
46 | /** Register file system server. |
46 | /** Register file system server. |
47 | * |
47 | * |
48 | * This function abstracts away the tedious registration protocol from |
48 | * This function abstracts away the tedious registration protocol from |
49 | * file system implementations and lets them to reuse this registration glue |
49 | * file system implementations and lets them to reuse this registration glue |
50 | * code. |
50 | * code. |
51 | * |
51 | * |
52 | * @param vfs_phone Open phone for communication with VFS. |
52 | * @param vfs_phone Open phone for communication with VFS. |
53 | * @param reg File system registration structure. It will be |
53 | * @param reg File system registration structure. It will be |
54 | * initialized by this function. |
54 | * initialized by this function. |
55 | * @param info VFS info structure supplied by the file system |
55 | * @param info VFS info structure supplied by the file system |
56 | * implementation. |
56 | * implementation. |
57 | * @param conn Connection fibril for handling all calls originating in |
57 | * @param conn Connection fibril for handling all calls originating in |
58 | * VFS. |
58 | * VFS. |
59 | * |
59 | * |
60 | * @return EOK on success or a non-zero error code on errror. |
60 | * @return EOK on success or a non-zero error code on errror. |
61 | */ |
61 | */ |
62 | int fs_register(int vfs_phone, fs_reg_t *reg, vfs_info_t *info, |
62 | int fs_register(int vfs_phone, fs_reg_t *reg, vfs_info_t *info, |
63 | async_client_conn_t conn) |
63 | async_client_conn_t conn) |
64 | { |
64 | { |
65 | /* |
65 | /* |
66 | * Tell VFS that we are here and want to get registered. |
66 | * Tell VFS that we are here and want to get registered. |
67 | * We use the async framework because VFS will answer the request |
67 | * We use the async framework because VFS will answer the request |
68 | * out-of-order, when it knows that the operation succeeded or failed. |
68 | * out-of-order, when it knows that the operation succeeded or failed. |
69 | */ |
69 | */ |
70 | ipc_call_t answer; |
70 | ipc_call_t answer; |
71 | aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer); |
71 | aid_t req = async_send_0(vfs_phone, VFS_REGISTER, &answer); |
72 | 72 | ||
73 | /* |
73 | /* |
74 | * Send our VFS info structure to VFS. |
74 | * Send our VFS info structure to VFS. |
75 | */ |
75 | */ |
76 | int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info)); |
76 | int rc = ipc_data_write_start(vfs_phone, info, sizeof(*info)); |
77 | if (rc != EOK) { |
77 | if (rc != EOK) { |
78 | async_wait_for(req, NULL); |
78 | async_wait_for(req, NULL); |
79 | return rc; |
79 | return rc; |
80 | } |
80 | } |
81 | 81 | ||
82 | /* |
82 | /* |
83 | * Ask VFS for callback connection. |
83 | * Ask VFS for callback connection. |
84 | */ |
84 | */ |
85 | ipc_connect_to_me(vfs_phone, 0, 0, 0, ®->vfs_phonehash); |
85 | ipc_connect_to_me(vfs_phone, 0, 0, 0, ®->vfs_phonehash); |
86 | 86 | ||
87 | /* |
87 | /* |
88 | * Allocate piece of address space for PLB. |
88 | * Allocate piece of address space for PLB. |
89 | */ |
89 | */ |
90 | reg->plb_ro = as_get_mappable_page(PLB_SIZE); |
90 | reg->plb_ro = as_get_mappable_page(PLB_SIZE); |
91 | if (!reg->plb_ro) { |
91 | if (!reg->plb_ro) { |
92 | async_wait_for(req, NULL); |
92 | async_wait_for(req, NULL); |
93 | return ENOMEM; |
93 | return ENOMEM; |
94 | } |
94 | } |
95 | 95 | ||
96 | /* |
96 | /* |
97 | * Request sharing the Path Lookup Buffer with VFS. |
97 | * Request sharing the Path Lookup Buffer with VFS. |
98 | */ |
98 | */ |
99 | rc = ipc_share_in_start_0_0(vfs_phone, reg->plb_ro, PLB_SIZE); |
99 | rc = ipc_share_in_start_0_0(vfs_phone, reg->plb_ro, PLB_SIZE); |
100 | if (rc) { |
100 | if (rc) { |
101 | async_wait_for(req, NULL); |
101 | async_wait_for(req, NULL); |
102 | return rc; |
102 | return rc; |
103 | } |
103 | } |
104 | 104 | ||
105 | /* |
105 | /* |
106 | * Pick up the answer for the request to the VFS_REQUEST call. |
106 | * Pick up the answer for the request to the VFS_REQUEST call. |
107 | */ |
107 | */ |
108 | async_wait_for(req, NULL); |
108 | async_wait_for(req, NULL); |
109 | reg->fs_handle = (int) IPC_GET_ARG1(answer); |
109 | reg->fs_handle = (int) IPC_GET_ARG1(answer); |
110 | 110 | ||
111 | /* |
111 | /* |
112 | * Create a connection fibril to handle the callback connection. |
112 | * Create a connection fibril to handle the callback connection. |
113 | */ |
113 | */ |
114 | async_new_connection(reg->vfs_phonehash, 0, NULL, conn); |
114 | async_new_connection(reg->vfs_phonehash, 0, NULL, conn); |
115 | 115 | ||
116 | /* |
116 | /* |
117 | * Tell the async framework that other connections are to be handled by |
117 | * Tell the async framework that other connections are to be handled by |
118 | * the same connection fibril as well. |
118 | * the same connection fibril as well. |
119 | */ |
119 | */ |
120 | async_set_client_connection(conn); |
120 | async_set_client_connection(conn); |
121 | 121 | ||
122 | return IPC_GET_RETVAL(answer); |
122 | return IPC_GET_RETVAL(answer); |
123 | } |
123 | } |
124 | 124 | ||
125 | /** Lookup VFS triplet by name in the file system name space. |
125 | /** Lookup VFS triplet by name in the file system name space. |
126 | * |
126 | * |
127 | * The path passed in the PLB must be in the canonical file system path format |
127 | * The path passed in the PLB must be in the canonical file system path format |
128 | * as returned by the canonify() function. |
128 | * as returned by the canonify() function. |
129 | * |
129 | * |
130 | * @param ops libfs operations structure with function pointers to |
130 | * @param ops libfs operations structure with function pointers to |
131 | * file system implementation |
131 | * file system implementation |
132 | * @param fs_handle File system handle of the file system where to perform |
132 | * @param fs_handle File system handle of the file system where to perform |
133 | * the lookup. |
133 | * the lookup. |
134 | * @param rid Request ID of the VFS_LOOKUP request. |
134 | * @param rid Request ID of the VFS_LOOKUP request. |
135 | * @param request VFS_LOOKUP request data itself. |
135 | * @param request VFS_LOOKUP request data itself. |
136 | */ |
136 | */ |
137 | void libfs_lookup(libfs_ops_t *ops, int fs_handle, ipc_callid_t rid, |
137 | void libfs_lookup(libfs_ops_t *ops, int fs_handle, ipc_callid_t rid, |
138 | ipc_call_t *request) |
138 | ipc_call_t *request) |
139 | { |
139 | { |
140 | unsigned next = IPC_GET_ARG1(*request); |
140 | unsigned next = IPC_GET_ARG1(*request); |
141 | unsigned last = IPC_GET_ARG2(*request); |
141 | unsigned last = IPC_GET_ARG2(*request); |
142 | int dev_handle = IPC_GET_ARG3(*request); |
142 | int dev_handle = IPC_GET_ARG3(*request); |
143 | int lflag = IPC_GET_ARG4(*request); |
143 | int lflag = IPC_GET_ARG4(*request); |
- | 144 | int index = IPC_GET_ARG5(*request); /* when L_LINK specified */ |
|
144 | 145 | ||
145 | if (last < next) |
146 | if (last < next) |
146 | last += PLB_SIZE; |
147 | last += PLB_SIZE; |
147 | 148 | ||
148 | void *par = NULL; |
149 | void *par = NULL; |
149 | void *cur = ops->root_get(); |
150 | void *cur = ops->root_get(); |
150 | void *tmp = ops->child_get(cur); |
151 | void *tmp = ops->child_get(cur); |
151 | 152 | ||
152 | if (ops->plb_get_char(next) == '/') |
153 | if (ops->plb_get_char(next) == '/') |
153 | next++; /* eat slash */ |
154 | next++; /* eat slash */ |
154 | 155 | ||
155 | char component[NAME_MAX + 1]; |
156 | char component[NAME_MAX + 1]; |
156 | int len = 0; |
157 | int len = 0; |
157 | while (tmp && next <= last) { |
158 | while (tmp && next <= last) { |
158 | 159 | ||
159 | /* collect the component */ |
160 | /* collect the component */ |
160 | if (ops->plb_get_char(next) != '/') { |
161 | if (ops->plb_get_char(next) != '/') { |
161 | if (len + 1 == NAME_MAX) { |
162 | if (len + 1 == NAME_MAX) { |
162 | /* comopnent length overflow */ |
163 | /* comopnent length overflow */ |
163 | ipc_answer_0(rid, ENAMETOOLONG); |
164 | ipc_answer_0(rid, ENAMETOOLONG); |
164 | return; |
165 | return; |
165 | } |
166 | } |
166 | component[len++] = ops->plb_get_char(next); |
167 | component[len++] = ops->plb_get_char(next); |
167 | next++; /* process next character */ |
168 | next++; /* process next character */ |
168 | if (next <= last) |
169 | if (next <= last) |
169 | continue; |
170 | continue; |
170 | } |
171 | } |
171 | 172 | ||
172 | assert(len); |
173 | assert(len); |
173 | component[len] = '\0'; |
174 | component[len] = '\0'; |
174 | next++; /* eat slash */ |
175 | next++; /* eat slash */ |
175 | len = 0; |
176 | len = 0; |
176 | 177 | ||
177 | /* match the component */ |
178 | /* match the component */ |
178 | while (tmp && !ops->match(cur, tmp, component)) |
179 | while (tmp && !ops->match(cur, tmp, component)) |
179 | tmp = ops->sibling_get(tmp); |
180 | tmp = ops->sibling_get(tmp); |
180 | 181 | ||
181 | /* handle miss: match amongst siblings */ |
182 | /* handle miss: match amongst siblings */ |
182 | if (!tmp) { |
183 | if (!tmp) { |
- | 184 | if (next <= last) { |
|
- | 185 | /* there are unprocessed components */ |
|
- | 186 | ipc_answer_0(rid, ENOENT); |
|
- | 187 | return; |
|
- | 188 | } |
|
- | 189 | /* miss in the last component */ |
|
183 | if ((next > last) && (lflag & L_CREATE)) { |
190 | if (lflag & (L_CREATE | L_LINK)) { |
184 | /* no components left and L_CREATE specified */ |
191 | /* request to create a new link */ |
185 | if (!ops->is_directory(cur)) { |
192 | if (!ops->is_directory(cur)) { |
186 | ipc_answer_0(rid, ENOTDIR); |
193 | ipc_answer_0(rid, ENOTDIR); |
187 | return; |
194 | return; |
188 | } |
195 | } |
- | 196 | void *nodep; |
|
- | 197 | if (lflag & L_CREATE) |
|
189 | void *nodep = ops->create(lflag); |
198 | nodep = ops->create(lflag); |
- | 199 | else |
|
- | 200 | nodep = ops->node_get(fs_handle, |
|
- | 201 | dev_handle, index); |
|
190 | if (nodep) { |
202 | if (nodep) { |
191 | if (!ops->link(cur, nodep, component)) { |
203 | if (!ops->link(cur, nodep, component)) { |
- | 204 | if (lflag & L_CREATE) |
|
192 | ops->destroy(nodep); |
205 | ops->destroy(nodep); |
193 | ipc_answer_0(rid, ENOSPC); |
206 | ipc_answer_0(rid, ENOSPC); |
194 | } else { |
207 | } else { |
195 | ipc_answer_5(rid, EOK, |
208 | ipc_answer_5(rid, EOK, |
196 | fs_handle, dev_handle, |
209 | fs_handle, dev_handle, |
197 | ops->index_get(nodep), 0, |
210 | ops->index_get(nodep), |
- | 211 | ops->size_get(nodep), |
|
198 | ops->lnkcnt_get(nodep)); |
212 | ops->lnkcnt_get(nodep)); |
199 | } |
213 | } |
200 | } else { |
214 | } else { |
201 | ipc_answer_0(rid, ENOSPC); |
215 | ipc_answer_0(rid, ENOSPC); |
202 | } |
216 | } |
203 | return; |
217 | return; |
- | 218 | } else if (lflag & L_PARENT) { |
|
- | 219 | /* return parent */ |
|
- | 220 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, |
|
- | 221 | ops->index_get(cur), ops->size_get(cur), |
|
- | 222 | ops->lnkcnt_get(cur)); |
|
204 | } |
223 | } |
205 | ipc_answer_0(rid, ENOENT); |
224 | ipc_answer_0(rid, ENOENT); |
206 | return; |
225 | return; |
207 | } |
226 | } |
208 | 227 | ||
209 | /* descend one level */ |
228 | /* descend one level */ |
210 | par = cur; |
229 | par = cur; |
211 | cur = tmp; |
230 | cur = tmp; |
212 | tmp = ops->child_get(tmp); |
231 | tmp = ops->child_get(tmp); |
213 | } |
232 | } |
214 | 233 | ||
215 | /* handle miss: excessive components */ |
234 | /* handle miss: excessive components */ |
216 | if (!tmp && next <= last) { |
235 | if (!tmp && next <= last) { |
217 | if (lflag & L_CREATE) { |
236 | if (lflag & (L_CREATE | L_LINK)) { |
218 | if (!ops->is_directory(cur)) { |
237 | if (!ops->is_directory(cur)) { |
219 | ipc_answer_0(rid, ENOTDIR); |
238 | ipc_answer_0(rid, ENOTDIR); |
220 | return; |
239 | return; |
221 | } |
240 | } |
222 | 241 | ||
223 | /* collect next component */ |
242 | /* collect next component */ |
224 | while (next <= last) { |
243 | while (next <= last) { |
225 | if (ops->plb_get_char(next) == '/') { |
244 | if (ops->plb_get_char(next) == '/') { |
226 | /* more than one component */ |
245 | /* more than one component */ |
227 | ipc_answer_0(rid, ENOENT); |
246 | ipc_answer_0(rid, ENOENT); |
228 | return; |
247 | return; |
229 | } |
248 | } |
230 | if (len + 1 == NAME_MAX) { |
249 | if (len + 1 == NAME_MAX) { |
231 | /* component length overflow */ |
250 | /* component length overflow */ |
232 | ipc_answer_0(rid, ENAMETOOLONG); |
251 | ipc_answer_0(rid, ENAMETOOLONG); |
233 | return; |
252 | return; |
234 | } |
253 | } |
235 | component[len++] = ops->plb_get_char(next); |
254 | component[len++] = ops->plb_get_char(next); |
236 | next++; /* process next character */ |
255 | next++; /* process next character */ |
237 | } |
256 | } |
238 | assert(len); |
257 | assert(len); |
239 | component[len] = '\0'; |
258 | component[len] = '\0'; |
240 | len = 0; |
259 | len = 0; |
241 | 260 | ||
- | 261 | void *nodep; |
|
- | 262 | if (lflag & L_CREATE) |
|
242 | void *nodep = ops->create(lflag); |
263 | nodep = ops->create(lflag); |
- | 264 | else |
|
- | 265 | nodep = ops->node_get(fs_handle, dev_handle, |
|
- | 266 | index); |
|
243 | if (nodep) { |
267 | if (nodep) { |
244 | if (!ops->link(cur, nodep, component)) { |
268 | if (!ops->link(cur, nodep, component)) { |
- | 269 | if (lflag & L_CREATE) |
|
245 | ops->destroy(nodep); |
270 | ops->destroy(nodep); |
246 | ipc_answer_0(rid, ENOSPC); |
271 | ipc_answer_0(rid, ENOSPC); |
247 | } else { |
272 | } else { |
248 | ipc_answer_5(rid, EOK, |
273 | ipc_answer_5(rid, EOK, |
249 | fs_handle, dev_handle, |
274 | fs_handle, dev_handle, |
250 | ops->index_get(nodep), 0, |
275 | ops->index_get(nodep), |
- | 276 | ops->size_get(nodep), |
|
251 | ops->lnkcnt_get(nodep)); |
277 | ops->lnkcnt_get(nodep)); |
252 | } |
278 | } |
253 | } else { |
279 | } else { |
254 | ipc_answer_0(rid, ENOSPC); |
280 | ipc_answer_0(rid, ENOSPC); |
255 | } |
281 | } |
256 | return; |
282 | return; |
257 | } |
283 | } |
258 | ipc_answer_0(rid, ENOENT); |
284 | ipc_answer_0(rid, ENOENT); |
259 | return; |
285 | return; |
260 | } |
286 | } |
261 | 287 | ||
262 | /* handle hit */ |
288 | /* handle hit */ |
263 | if (lflag & L_DESTROY) { |
289 | if (lflag & L_PARENT) { |
- | 290 | cur = par; |
|
- | 291 | if (!cur) { |
|
- | 292 | ipc_answer_0(rid, ENOENT); |
|
- | 293 | return; |
|
- | 294 | } |
|
- | 295 | } |
|
- | 296 | if (lflag & L_UNLINK) { |
|
264 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
297 | unsigned old_lnkcnt = ops->lnkcnt_get(cur); |
265 | int res = ops->unlink(par, cur); |
298 | int res = ops->unlink(par, cur); |
266 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
299 | ipc_answer_5(rid, (ipcarg_t)res, fs_handle, dev_handle, |
267 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
300 | ops->index_get(cur), ops->size_get(cur), old_lnkcnt); |
268 | return; |
301 | return; |
269 | } |
302 | } |
270 | if ((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) { |
303 | if (((lflag & (L_CREATE | L_EXCLUSIVE)) == (L_CREATE | L_EXCLUSIVE)) || |
- | 304 | (lflag & L_LINK)) { |
|
271 | ipc_answer_0(rid, EEXIST); |
305 | ipc_answer_0(rid, EEXIST); |
272 | return; |
306 | return; |
273 | } |
307 | } |
274 | if ((lflag & L_FILE) && (ops->is_directory(cur))) { |
308 | if ((lflag & L_FILE) && (ops->is_directory(cur))) { |
275 | ipc_answer_0(rid, EISDIR); |
309 | ipc_answer_0(rid, EISDIR); |
276 | return; |
310 | return; |
277 | } |
311 | } |
278 | if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) { |
312 | if ((lflag & L_DIRECTORY) && (ops->is_file(cur))) { |
279 | ipc_answer_0(rid, ENOTDIR); |
313 | ipc_answer_0(rid, ENOTDIR); |
280 | return; |
314 | return; |
281 | } |
315 | } |
282 | 316 | ||
283 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur), |
317 | ipc_answer_5(rid, EOK, fs_handle, dev_handle, ops->index_get(cur), |
284 | ops->size_get(cur), ops->lnkcnt_get(cur)); |
318 | ops->size_get(cur), ops->lnkcnt_get(cur)); |
285 | } |
319 | } |
286 | 320 | ||
287 | /** @} |
321 | /** @} |
288 | */ |
322 | */ |
289 | 323 |