kern_fileassoc.c revision 1.8 1 1.8 blymn /* $NetBSD: kern_fileassoc.c,v 1.8 2006/08/20 10:38:23 blymn Exp $ */
2 1.1 elad
3 1.1 elad /*-
4 1.1 elad * Copyright (c) 2006 Elad Efrat <elad (at) NetBSD.org>
5 1.1 elad * All rights reserved.
6 1.1 elad *
7 1.1 elad * Redistribution and use in source and binary forms, with or without
8 1.1 elad * modification, are permitted provided that the following conditions
9 1.1 elad * are met:
10 1.1 elad * 1. Redistributions of source code must retain the above copyright
11 1.1 elad * notice, this list of conditions and the following disclaimer.
12 1.1 elad * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 elad * notice, this list of conditions and the following disclaimer in the
14 1.1 elad * documentation and/or other materials provided with the distribution.
15 1.1 elad * 3. All advertising materials mentioning features or use of this software
16 1.1 elad * must display the following acknowledgement:
17 1.1 elad * This product includes software developed by Elad Efrat.
18 1.1 elad * 4. The name of the author may not be used to endorse or promote products
19 1.1 elad * derived from this software without specific prior written permission.
20 1.1 elad *
21 1.1 elad * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
22 1.1 elad * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
23 1.1 elad * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
24 1.1 elad * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
25 1.1 elad * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
26 1.1 elad * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 1.1 elad * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 1.1 elad * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 1.1 elad * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
30 1.1 elad * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 1.1 elad */
32 1.1 elad
33 1.7 xtraeme #include <sys/cdefs.h>
34 1.8 blymn __KERNEL_RCSID(0, "$NetBSD: kern_fileassoc.c,v 1.8 2006/08/20 10:38:23 blymn Exp $");
35 1.7 xtraeme
36 1.1 elad #include <sys/param.h>
37 1.1 elad #include <sys/mount.h>
38 1.1 elad #include <sys/queue.h>
39 1.1 elad #include <sys/malloc.h>
40 1.1 elad #include <sys/vnode.h>
41 1.1 elad #include <sys/namei.h>
42 1.1 elad #include <sys/exec.h>
43 1.1 elad #include <sys/proc.h>
44 1.1 elad #include <sys/inttypes.h>
45 1.1 elad #include <sys/errno.h>
46 1.1 elad #include <sys/fileassoc.h>
47 1.3 elad #include <sys/hash.h>
48 1.1 elad
49 1.3 elad /*
50 1.3 elad * Hook entry.
51 1.3 elad * Includes the hook name for identification and private hook clear callback.
52 1.3 elad */
53 1.3 elad struct fileassoc_hook {
54 1.3 elad const char *hook_name; /* Hook name. */
55 1.3 elad fileassoc_cleanup_cb_t hook_cleanup_cb; /* Hook clear callback. */
56 1.3 elad };
57 1.3 elad
58 1.3 elad /* An entry in the per-device hash table. */
59 1.3 elad struct fileassoc_hash_entry {
60 1.3 elad ino_t fileid; /* File id. */
61 1.3 elad void *hooks[FILEASSOC_NHOOKS]; /* Hooks. */
62 1.3 elad LIST_ENTRY(fileassoc_hash_entry) entries; /* List pointer. */
63 1.3 elad };
64 1.3 elad
65 1.3 elad LIST_HEAD(fileassoc_hashhead, fileassoc_hash_entry);
66 1.3 elad
67 1.3 elad struct fileassoc_table {
68 1.3 elad struct fileassoc_hashhead *hash_tbl;
69 1.3 elad size_t hash_size; /* Number of slots. */
70 1.3 elad struct mount *tbl_mntpt;
71 1.3 elad u_long hash_mask;
72 1.3 elad void *tables[FILEASSOC_NHOOKS];
73 1.3 elad LIST_ENTRY(fileassoc_table) hash_list; /* List pointer. */
74 1.3 elad };
75 1.8 blymn
76 1.4 cube struct fileassoc_hook fileassoc_hooks[FILEASSOC_NHOOKS];
77 1.4 cube int fileassoc_nhooks;
78 1.4 cube
79 1.1 elad /* Global list of hash tables, one per device. */
80 1.1 elad LIST_HEAD(, fileassoc_table) fileassoc_tables;
81 1.8 blymn
82 1.1 elad /*
83 1.1 elad * Hashing function: Takes a number modulus the mask to give back
84 1.1 elad * an index into the hash table.
85 1.1 elad */
86 1.1 elad #define FILEASSOC_HASH(tbl, fileid) \
87 1.1 elad (hash32_buf(&(fileid), sizeof((fileid)), HASH32_BUF_INIT) \
88 1.1 elad & ((tbl)->hash_mask))
89 1.1 elad
90 1.1 elad /*
91 1.1 elad * Initialize the fileassoc subsystem.
92 1.1 elad */
93 1.1 elad void
94 1.1 elad fileassoc_init(void)
95 1.1 elad {
96 1.1 elad memset(fileassoc_hooks, 0, sizeof(fileassoc_hooks));
97 1.1 elad fileassoc_nhooks = 0;
98 1.1 elad }
99 1.1 elad
100 1.1 elad /*
101 1.1 elad * Register a new hook.
102 1.1 elad */
103 1.1 elad fileassoc_t
104 1.1 elad fileassoc_register(const char *name, fileassoc_cleanup_cb_t cleanup_cb)
105 1.1 elad {
106 1.1 elad int i;
107 1.1 elad
108 1.1 elad if (fileassoc_nhooks >= FILEASSOC_NHOOKS)
109 1.1 elad return (-1);
110 1.1 elad
111 1.1 elad for (i = 0; i < FILEASSOC_NHOOKS; i++)
112 1.1 elad if (fileassoc_hooks[i].hook_name == NULL)
113 1.1 elad break;
114 1.1 elad
115 1.1 elad fileassoc_hooks[i].hook_name = name;
116 1.1 elad fileassoc_hooks[i].hook_cleanup_cb = cleanup_cb;
117 1.1 elad
118 1.1 elad fileassoc_nhooks++;
119 1.1 elad
120 1.1 elad return (i);
121 1.1 elad }
122 1.1 elad
123 1.1 elad /*
124 1.1 elad * Deregister a hook.
125 1.1 elad */
126 1.1 elad int
127 1.1 elad fileassoc_deregister(fileassoc_t id)
128 1.1 elad {
129 1.1 elad if (id < 0 || id >= FILEASSOC_NHOOKS)
130 1.1 elad return (EINVAL);
131 1.1 elad
132 1.1 elad fileassoc_hooks[id].hook_name = NULL;
133 1.1 elad fileassoc_hooks[id].hook_cleanup_cb = NULL;
134 1.1 elad
135 1.1 elad fileassoc_nhooks--;
136 1.1 elad
137 1.1 elad return (0);
138 1.1 elad }
139 1.1 elad
140 1.1 elad /*
141 1.1 elad * Get the hash table for the specified device.
142 1.1 elad */
143 1.3 elad static struct fileassoc_table *
144 1.1 elad fileassoc_table_lookup(struct mount *mp)
145 1.1 elad {
146 1.1 elad struct fileassoc_table *tbl;
147 1.1 elad
148 1.1 elad LIST_FOREACH(tbl, &fileassoc_tables, hash_list) {
149 1.1 elad if (tbl->tbl_mntpt == mp)
150 1.1 elad return (tbl);
151 1.1 elad }
152 1.1 elad
153 1.1 elad return (NULL);
154 1.1 elad }
155 1.1 elad
156 1.1 elad /*
157 1.8 blymn * Perform a lookup on a hash table. If hint is non-zero then use the value
158 1.8 blymn * of the hint as the identifier instead of performing a lookup for the
159 1.8 blymn * fileid.
160 1.1 elad */
161 1.3 elad static struct fileassoc_hash_entry *
162 1.8 blymn fileassoc_file_lookup(struct vnode *vp, uint64_t hint)
163 1.1 elad {
164 1.1 elad struct fileassoc_table *tbl;
165 1.1 elad struct fileassoc_hashhead *tble;
166 1.1 elad struct fileassoc_hash_entry *e;
167 1.1 elad struct vattr va;
168 1.1 elad size_t indx;
169 1.8 blymn uint64_t th;
170 1.1 elad int error;
171 1.1 elad
172 1.8 blymn if (hint == 0) {
173 1.8 blymn error = VOP_GETATTR(vp, &va, curlwp->l_cred, curlwp);
174 1.8 blymn if (error)
175 1.8 blymn return (NULL);
176 1.8 blymn th = va.va_fileid;
177 1.8 blymn } else
178 1.8 blymn th = hint;
179 1.1 elad
180 1.1 elad tbl = fileassoc_table_lookup(vp->v_mount);
181 1.1 elad if (tbl == NULL)
182 1.1 elad return (NULL);
183 1.1 elad
184 1.1 elad /*
185 1.1 elad * XXX: We should NOT rely on fileid here!
186 1.1 elad */
187 1.8 blymn indx = FILEASSOC_HASH(tbl, th);
188 1.1 elad tble = &(tbl->hash_tbl[indx & ((tbl)->hash_mask)]);
189 1.1 elad
190 1.1 elad LIST_FOREACH(e, tble, entries) {
191 1.8 blymn if ((e != NULL) && (e->fileid == th))
192 1.1 elad return (e);
193 1.1 elad }
194 1.1 elad
195 1.1 elad return (NULL);
196 1.1 elad }
197 1.1 elad
198 1.1 elad /*
199 1.1 elad * Return hook data associated with a vnode.
200 1.1 elad */
201 1.1 elad void *
202 1.1 elad fileassoc_lookup(struct vnode *vp, fileassoc_t id)
203 1.1 elad {
204 1.8 blymn return fileassoc_lookup_hint(vp, id, 0);
205 1.8 blymn }
206 1.8 blymn
207 1.8 blymn /*
208 1.8 blymn * Return hook data associated with a vnode, use hint to look for file
209 1.8 blymn * instead of performing an implicit VOP_GETATTR() on the vnode.
210 1.8 blymn */
211 1.8 blymn void *
212 1.8 blymn fileassoc_lookup_hint(struct vnode *vp, fileassoc_t id, uint64_t hint)
213 1.8 blymn {
214 1.1 elad struct fileassoc_hash_entry *mhe;
215 1.1 elad
216 1.8 blymn mhe = fileassoc_file_lookup(vp, hint);
217 1.8 blymn
218 1.1 elad if (mhe == NULL)
219 1.1 elad return (NULL);
220 1.1 elad
221 1.1 elad return (mhe->hooks[id]);
222 1.1 elad }
223 1.1 elad
224 1.1 elad /*
225 1.1 elad * Create a new fileassoc table.
226 1.1 elad */
227 1.1 elad int
228 1.1 elad fileassoc_table_add(struct mount *mp, size_t size)
229 1.1 elad {
230 1.1 elad struct fileassoc_table *tbl;
231 1.1 elad
232 1.1 elad /* Check for existing table for device. */
233 1.1 elad if (fileassoc_table_lookup(mp) != NULL)
234 1.1 elad return (EEXIST);
235 1.1 elad
236 1.1 elad /* Allocate and initialize a Veriexec hash table. */
237 1.1 elad tbl = malloc(sizeof(*tbl), M_TEMP, M_WAITOK | M_ZERO);
238 1.1 elad tbl->hash_size = size;
239 1.1 elad tbl->tbl_mntpt = mp;
240 1.1 elad tbl->hash_tbl = hashinit(size, HASH_LIST, M_TEMP,
241 1.1 elad M_WAITOK | M_ZERO, &tbl->hash_mask);
242 1.1 elad
243 1.1 elad LIST_INSERT_HEAD(&fileassoc_tables, tbl, hash_list);
244 1.1 elad
245 1.1 elad return (0);
246 1.1 elad }
247 1.1 elad
248 1.1 elad /*
249 1.1 elad * Delete a table.
250 1.1 elad */
251 1.1 elad int
252 1.1 elad fileassoc_table_delete(struct mount *mp)
253 1.1 elad {
254 1.1 elad struct fileassoc_table *tbl;
255 1.1 elad struct fileassoc_hashhead *hh;
256 1.1 elad u_long i;
257 1.1 elad int j;
258 1.1 elad
259 1.1 elad tbl = fileassoc_table_lookup(mp);
260 1.1 elad if (tbl == NULL)
261 1.1 elad return (EEXIST);
262 1.1 elad
263 1.1 elad /* Remove all entries from the table and lists */
264 1.1 elad hh = tbl->hash_tbl;
265 1.1 elad for (i = 0; i < tbl->hash_size; i++) {
266 1.1 elad struct fileassoc_hash_entry *mhe;
267 1.1 elad
268 1.1 elad while (LIST_FIRST(&hh[i]) != NULL) {
269 1.1 elad mhe = LIST_FIRST(&hh[i]);
270 1.1 elad LIST_REMOVE(mhe, entries);
271 1.1 elad
272 1.1 elad for (j = 0; j < fileassoc_nhooks; j++)
273 1.1 elad if (fileassoc_hooks[j].hook_cleanup_cb != NULL)
274 1.2 elad (fileassoc_hooks[j].hook_cleanup_cb)
275 1.2 elad (mhe->hooks[j],
276 1.2 elad FILEASSOC_CLEANUP_FILE);
277 1.1 elad
278 1.1 elad free(mhe, M_TEMP);
279 1.1 elad }
280 1.1 elad }
281 1.1 elad
282 1.1 elad for (j = 0; j < fileassoc_nhooks; j++)
283 1.1 elad if (fileassoc_hooks[j].hook_cleanup_cb != NULL)
284 1.2 elad (fileassoc_hooks[j].hook_cleanup_cb)(tbl->tables[j],
285 1.2 elad FILEASSOC_CLEANUP_TABLE);
286 1.1 elad
287 1.1 elad /* Remove hash table and sysctl node */
288 1.1 elad hashdone(tbl->hash_tbl, M_TEMP);
289 1.1 elad LIST_REMOVE(tbl, hash_list);
290 1.1 elad
291 1.1 elad return (0);
292 1.1 elad }
293 1.1 elad
294 1.1 elad /*
295 1.6 christos * Run a callback for each hook entry in a table.
296 1.6 christos */
297 1.6 christos int
298 1.6 christos fileassoc_table_run(struct mount *mp, fileassoc_t id, fileassoc_cb_t cb)
299 1.6 christos {
300 1.6 christos struct fileassoc_table *tbl;
301 1.6 christos struct fileassoc_hashhead *hh;
302 1.6 christos u_long i;
303 1.6 christos
304 1.6 christos tbl = fileassoc_table_lookup(mp);
305 1.6 christos if (tbl == NULL)
306 1.6 christos return (EEXIST);
307 1.6 christos
308 1.6 christos hh = tbl->hash_tbl;
309 1.6 christos for (i = 0; i < tbl->hash_size; i++) {
310 1.6 christos struct fileassoc_hash_entry *mhe;
311 1.6 christos
312 1.6 christos LIST_FOREACH(mhe, &hh[i], entries) {
313 1.6 christos if (mhe->hooks[id] != NULL)
314 1.6 christos cb(mhe->hooks[id]);
315 1.6 christos }
316 1.6 christos }
317 1.6 christos
318 1.6 christos return (0);
319 1.6 christos }
320 1.6 christos
321 1.6 christos /*
322 1.1 elad * Clear a table for a given hook.
323 1.1 elad */
324 1.1 elad int
325 1.1 elad fileassoc_table_clear(struct mount *mp, fileassoc_t id)
326 1.1 elad {
327 1.1 elad struct fileassoc_table *tbl;
328 1.1 elad struct fileassoc_hashhead *hh;
329 1.1 elad fileassoc_cleanup_cb_t cleanup_cb;
330 1.1 elad u_long i;
331 1.1 elad
332 1.1 elad tbl = fileassoc_table_lookup(mp);
333 1.1 elad if (tbl == NULL)
334 1.1 elad return (EEXIST);
335 1.1 elad
336 1.1 elad cleanup_cb = fileassoc_hooks[id].hook_cleanup_cb;
337 1.1 elad
338 1.1 elad hh = tbl->hash_tbl;
339 1.1 elad for (i = 0; i < tbl->hash_size; i++) {
340 1.1 elad struct fileassoc_hash_entry *mhe;
341 1.1 elad
342 1.1 elad LIST_FOREACH(mhe, &hh[i], entries) {
343 1.1 elad if ((mhe->hooks[id] != NULL) && cleanup_cb != NULL)
344 1.2 elad cleanup_cb(mhe->hooks[id],
345 1.2 elad FILEASSOC_CLEANUP_FILE);
346 1.1 elad
347 1.1 elad mhe->hooks[id] = NULL;
348 1.1 elad }
349 1.1 elad }
350 1.1 elad
351 1.1 elad if ((tbl->tables[id] != NULL) && cleanup_cb != NULL)
352 1.1 elad cleanup_cb(tbl->tables[id], FILEASSOC_CLEANUP_TABLE);
353 1.1 elad
354 1.1 elad tbl->tables[id] = NULL;
355 1.1 elad
356 1.1 elad return (0);
357 1.1 elad }
358 1.1 elad
359 1.1 elad /*
360 1.1 elad * Add hook-specific data on a fileassoc table.
361 1.1 elad */
362 1.1 elad int
363 1.1 elad fileassoc_tabledata_add(struct mount *mp, fileassoc_t id, void *data)
364 1.1 elad {
365 1.1 elad struct fileassoc_table *tbl;
366 1.1 elad
367 1.1 elad tbl = fileassoc_table_lookup(mp);
368 1.1 elad if (tbl == NULL)
369 1.1 elad return (EFAULT);
370 1.1 elad
371 1.1 elad tbl->tables[id] = data;
372 1.1 elad
373 1.1 elad return (0);
374 1.1 elad }
375 1.1 elad
376 1.1 elad /*
377 1.1 elad * Clear hook-specific data on a fileassoc table.
378 1.1 elad */
379 1.1 elad int
380 1.1 elad fileassoc_tabledata_clear(struct mount *mp, fileassoc_t id)
381 1.1 elad {
382 1.1 elad struct fileassoc_table *tbl;
383 1.1 elad
384 1.1 elad tbl = fileassoc_table_lookup(mp);
385 1.1 elad if (tbl == NULL)
386 1.1 elad return (EFAULT);
387 1.1 elad
388 1.1 elad tbl->tables[id] = NULL;
389 1.1 elad
390 1.1 elad return (0);
391 1.1 elad }
392 1.1 elad
393 1.1 elad /*
394 1.1 elad * Retrieve hook-specific data from a fileassoc table.
395 1.1 elad */
396 1.1 elad void *
397 1.1 elad fileassoc_tabledata_lookup(struct mount *mp, fileassoc_t id)
398 1.1 elad {
399 1.1 elad struct fileassoc_table *tbl;
400 1.1 elad
401 1.1 elad tbl = fileassoc_table_lookup(mp);
402 1.1 elad if (tbl == NULL)
403 1.1 elad return (NULL);
404 1.1 elad
405 1.1 elad return (tbl->tables[id]);
406 1.1 elad }
407 1.1 elad
408 1.1 elad /*
409 1.1 elad * Add a file entry to a table.
410 1.1 elad */
411 1.3 elad static struct fileassoc_hash_entry *
412 1.8 blymn fileassoc_file_add(struct vnode *vp, uint64_t hint)
413 1.1 elad {
414 1.1 elad struct fileassoc_table *tbl;
415 1.1 elad struct fileassoc_hashhead *vhh;
416 1.1 elad struct fileassoc_hash_entry *e;
417 1.1 elad struct vattr va;
418 1.1 elad size_t indx;
419 1.8 blymn uint64_t id;
420 1.1 elad int error;
421 1.1 elad
422 1.8 blymn if (hint == 0) {
423 1.8 blymn error = VOP_GETATTR(vp, &va, curlwp->l_cred, curlwp);
424 1.8 blymn if (error)
425 1.8 blymn return (NULL);
426 1.8 blymn /*
427 1.8 blymn * XXX: We should NOT rely on fileid here!
428 1.8 blymn */
429 1.8 blymn id = va.va_fileid;
430 1.8 blymn } else
431 1.8 blymn id = hint;
432 1.1 elad
433 1.8 blymn e = fileassoc_file_lookup(vp, id);
434 1.1 elad if (e != NULL)
435 1.1 elad return (e);
436 1.1 elad
437 1.1 elad tbl = fileassoc_table_lookup(vp->v_mount);
438 1.1 elad if (tbl == NULL)
439 1.1 elad return (NULL);
440 1.1 elad
441 1.8 blymn indx = FILEASSOC_HASH(tbl, id);
442 1.1 elad vhh = &(tbl->hash_tbl[indx & ((tbl)->hash_mask)]);
443 1.1 elad
444 1.1 elad e = malloc(sizeof(*e), M_TEMP, M_WAITOK | M_ZERO);
445 1.8 blymn e->fileid = id;
446 1.1 elad LIST_INSERT_HEAD(vhh, e, entries);
447 1.1 elad
448 1.1 elad return (e);
449 1.1 elad }
450 1.1 elad
451 1.1 elad /*
452 1.1 elad * Delete a file entry from a table.
453 1.1 elad */
454 1.1 elad int
455 1.1 elad fileassoc_file_delete(struct vnode *vp)
456 1.1 elad {
457 1.1 elad struct fileassoc_hash_entry *mhe;
458 1.1 elad int i;
459 1.1 elad
460 1.8 blymn mhe = fileassoc_file_lookup(vp, 0);
461 1.1 elad if (mhe == NULL)
462 1.1 elad return (ENOENT);
463 1.1 elad
464 1.1 elad LIST_REMOVE(mhe, entries);
465 1.1 elad
466 1.1 elad for (i = 0; i < fileassoc_nhooks; i++)
467 1.1 elad if (fileassoc_hooks[i].hook_cleanup_cb != NULL)
468 1.1 elad (fileassoc_hooks[i].hook_cleanup_cb)(mhe->hooks[i],
469 1.1 elad FILEASSOC_CLEANUP_FILE);
470 1.1 elad
471 1.1 elad free(mhe, M_TEMP);
472 1.1 elad
473 1.1 elad return (0);
474 1.1 elad }
475 1.1 elad
476 1.1 elad /*
477 1.8 blymn * Add a hook to a vnode using the given hint.
478 1.1 elad */
479 1.1 elad int
480 1.8 blymn fileassoc_add_hint(struct vnode *vp, fileassoc_t id, void *data, uint64_t hint)
481 1.1 elad {
482 1.1 elad struct fileassoc_hash_entry *e;
483 1.1 elad
484 1.8 blymn e = fileassoc_file_lookup(vp, hint);
485 1.1 elad if (e == NULL) {
486 1.8 blymn e = fileassoc_file_add(vp, hint);
487 1.1 elad if (e == NULL)
488 1.1 elad return (ENOTDIR);
489 1.1 elad }
490 1.1 elad
491 1.1 elad if (e->hooks[id] != NULL)
492 1.1 elad return (EEXIST);
493 1.1 elad
494 1.1 elad e->hooks[id] = data;
495 1.1 elad
496 1.1 elad return (0);
497 1.1 elad }
498 1.1 elad
499 1.1 elad /*
500 1.8 blymn * Add a hook to a vnode.
501 1.8 blymn */
502 1.8 blymn int
503 1.8 blymn fileassoc_add(struct vnode *vp, fileassoc_t id, void *data)
504 1.8 blymn {
505 1.8 blymn return fileassoc_add_hint(vp, id, data, 0);
506 1.8 blymn }
507 1.8 blymn
508 1.8 blymn /*
509 1.1 elad * Clear a hook from a vnode.
510 1.1 elad */
511 1.1 elad int
512 1.1 elad fileassoc_clear(struct vnode *vp, fileassoc_t id)
513 1.1 elad {
514 1.1 elad struct fileassoc_hash_entry *mhe;
515 1.1 elad fileassoc_cleanup_cb_t cleanup_cb;
516 1.1 elad
517 1.8 blymn mhe = fileassoc_file_lookup(vp, 0);
518 1.1 elad if (mhe == NULL)
519 1.1 elad return (ENOENT);
520 1.1 elad
521 1.1 elad cleanup_cb = fileassoc_hooks[id].hook_cleanup_cb;
522 1.1 elad if ((mhe->hooks[id] != NULL) && cleanup_cb != NULL)
523 1.1 elad cleanup_cb(mhe->hooks[id], FILEASSOC_CLEANUP_FILE);
524 1.1 elad
525 1.1 elad mhe->hooks[id] = NULL;
526 1.1 elad
527 1.1 elad return (0);
528 1.1 elad }
529