kern_fileassoc.c revision 1.10 1 1.10 blymn /* $NetBSD: kern_fileassoc.c,v 1.10 2006/09/08 13:57:38 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.10 blymn __KERNEL_RCSID(0, "$NetBSD: kern_fileassoc.c,v 1.10 2006/09/08 13:57:38 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.9 blymn #include <sys/fstypes.h>
49 1.9 blymn
50 1.9 blymn static struct fileassoc_hash_entry *
51 1.9 blymn fileassoc_file_lookup(struct vnode *, fhandle_t *);
52 1.9 blymn static struct fileassoc_hash_entry *
53 1.9 blymn fileassoc_file_add(struct vnode *, fhandle_t *);
54 1.1 elad
55 1.3 elad /*
56 1.3 elad * Hook entry.
57 1.3 elad * Includes the hook name for identification and private hook clear callback.
58 1.3 elad */
59 1.3 elad struct fileassoc_hook {
60 1.3 elad const char *hook_name; /* Hook name. */
61 1.3 elad fileassoc_cleanup_cb_t hook_cleanup_cb; /* Hook clear callback. */
62 1.3 elad };
63 1.3 elad
64 1.3 elad /* An entry in the per-device hash table. */
65 1.3 elad struct fileassoc_hash_entry {
66 1.9 blymn fhandle_t *handle; /* File handle */
67 1.3 elad void *hooks[FILEASSOC_NHOOKS]; /* Hooks. */
68 1.3 elad LIST_ENTRY(fileassoc_hash_entry) entries; /* List pointer. */
69 1.3 elad };
70 1.3 elad
71 1.3 elad LIST_HEAD(fileassoc_hashhead, fileassoc_hash_entry);
72 1.3 elad
73 1.3 elad struct fileassoc_table {
74 1.3 elad struct fileassoc_hashhead *hash_tbl;
75 1.3 elad size_t hash_size; /* Number of slots. */
76 1.3 elad struct mount *tbl_mntpt;
77 1.3 elad u_long hash_mask;
78 1.3 elad void *tables[FILEASSOC_NHOOKS];
79 1.3 elad LIST_ENTRY(fileassoc_table) hash_list; /* List pointer. */
80 1.3 elad };
81 1.8 blymn
82 1.4 cube struct fileassoc_hook fileassoc_hooks[FILEASSOC_NHOOKS];
83 1.4 cube int fileassoc_nhooks;
84 1.4 cube
85 1.1 elad /* Global list of hash tables, one per device. */
86 1.1 elad LIST_HEAD(, fileassoc_table) fileassoc_tables;
87 1.8 blymn
88 1.1 elad /*
89 1.9 blymn * Hashing function: Takes a number modulus the mask to give back an
90 1.9 blymn * index into the hash table.
91 1.1 elad */
92 1.9 blymn #define FILEASSOC_HASH(tbl, handle) \
93 1.10 blymn (hash32_buf((handle), FHANDLE_SIZE(handle), HASH32_BUF_INIT) \
94 1.1 elad & ((tbl)->hash_mask))
95 1.1 elad
96 1.1 elad /*
97 1.1 elad * Initialize the fileassoc subsystem.
98 1.1 elad */
99 1.1 elad void
100 1.1 elad fileassoc_init(void)
101 1.1 elad {
102 1.1 elad memset(fileassoc_hooks, 0, sizeof(fileassoc_hooks));
103 1.1 elad fileassoc_nhooks = 0;
104 1.1 elad }
105 1.1 elad
106 1.1 elad /*
107 1.1 elad * Register a new hook.
108 1.1 elad */
109 1.1 elad fileassoc_t
110 1.1 elad fileassoc_register(const char *name, fileassoc_cleanup_cb_t cleanup_cb)
111 1.1 elad {
112 1.1 elad int i;
113 1.1 elad
114 1.1 elad if (fileassoc_nhooks >= FILEASSOC_NHOOKS)
115 1.1 elad return (-1);
116 1.1 elad
117 1.1 elad for (i = 0; i < FILEASSOC_NHOOKS; i++)
118 1.1 elad if (fileassoc_hooks[i].hook_name == NULL)
119 1.1 elad break;
120 1.1 elad
121 1.1 elad fileassoc_hooks[i].hook_name = name;
122 1.1 elad fileassoc_hooks[i].hook_cleanup_cb = cleanup_cb;
123 1.1 elad
124 1.1 elad fileassoc_nhooks++;
125 1.1 elad
126 1.1 elad return (i);
127 1.1 elad }
128 1.1 elad
129 1.1 elad /*
130 1.1 elad * Deregister a hook.
131 1.1 elad */
132 1.1 elad int
133 1.1 elad fileassoc_deregister(fileassoc_t id)
134 1.1 elad {
135 1.1 elad if (id < 0 || id >= FILEASSOC_NHOOKS)
136 1.1 elad return (EINVAL);
137 1.1 elad
138 1.1 elad fileassoc_hooks[id].hook_name = NULL;
139 1.1 elad fileassoc_hooks[id].hook_cleanup_cb = NULL;
140 1.1 elad
141 1.1 elad fileassoc_nhooks--;
142 1.1 elad
143 1.1 elad return (0);
144 1.1 elad }
145 1.1 elad
146 1.1 elad /*
147 1.1 elad * Get the hash table for the specified device.
148 1.1 elad */
149 1.3 elad static struct fileassoc_table *
150 1.1 elad fileassoc_table_lookup(struct mount *mp)
151 1.1 elad {
152 1.1 elad struct fileassoc_table *tbl;
153 1.1 elad
154 1.1 elad LIST_FOREACH(tbl, &fileassoc_tables, hash_list) {
155 1.1 elad if (tbl->tbl_mntpt == mp)
156 1.1 elad return (tbl);
157 1.1 elad }
158 1.1 elad
159 1.1 elad return (NULL);
160 1.1 elad }
161 1.1 elad
162 1.1 elad /*
163 1.8 blymn * Perform a lookup on a hash table. If hint is non-zero then use the value
164 1.8 blymn * of the hint as the identifier instead of performing a lookup for the
165 1.8 blymn * fileid.
166 1.1 elad */
167 1.3 elad static struct fileassoc_hash_entry *
168 1.9 blymn fileassoc_file_lookup(struct vnode *vp, fhandle_t *hint)
169 1.1 elad {
170 1.1 elad struct fileassoc_table *tbl;
171 1.1 elad struct fileassoc_hashhead *tble;
172 1.1 elad struct fileassoc_hash_entry *e;
173 1.1 elad size_t indx;
174 1.9 blymn fhandle_t *th;
175 1.1 elad int error;
176 1.1 elad
177 1.9 blymn if (hint == NULL) {
178 1.9 blymn error = vfs_composefh_alloc(vp, &th);
179 1.8 blymn if (error)
180 1.8 blymn return (NULL);
181 1.8 blymn } else
182 1.8 blymn th = hint;
183 1.1 elad
184 1.1 elad tbl = fileassoc_table_lookup(vp->v_mount);
185 1.10 blymn if (tbl == NULL) {
186 1.10 blymn if (hint == NULL)
187 1.10 blymn vfs_composefh_free(th);
188 1.10 blymn
189 1.1 elad return (NULL);
190 1.10 blymn }
191 1.1 elad
192 1.8 blymn indx = FILEASSOC_HASH(tbl, th);
193 1.9 blymn tble = &(tbl->hash_tbl[indx]);
194 1.1 elad
195 1.1 elad LIST_FOREACH(e, tble, entries) {
196 1.9 blymn if ((e != NULL) &&
197 1.10 blymn ((FHANDLE_FILEID(e->handle)->fid_len ==
198 1.10 blymn FHANDLE_FILEID(th)->fid_len)) &&
199 1.9 blymn (memcmp(FHANDLE_FILEID(e->handle), FHANDLE_FILEID(th),
200 1.9 blymn (FHANDLE_FILEID(th))->fid_len) == 0))
201 1.1 elad return (e);
202 1.1 elad }
203 1.1 elad
204 1.10 blymn if (hint == NULL)
205 1.10 blymn vfs_composefh_free(th);
206 1.10 blymn
207 1.1 elad return (NULL);
208 1.1 elad }
209 1.1 elad
210 1.1 elad /*
211 1.1 elad * Return hook data associated with a vnode.
212 1.1 elad */
213 1.1 elad void *
214 1.1 elad fileassoc_lookup(struct vnode *vp, fileassoc_t id)
215 1.1 elad {
216 1.9 blymn struct fileassoc_hash_entry *mhe;
217 1.8 blymn
218 1.9 blymn mhe = fileassoc_file_lookup(vp, NULL);
219 1.9 blymn if (mhe == NULL)
220 1.9 blymn return (NULL);
221 1.1 elad
222 1.9 blymn return (mhe->hooks[id]);
223 1.1 elad }
224 1.1 elad
225 1.1 elad /*
226 1.1 elad * Create a new fileassoc table.
227 1.1 elad */
228 1.1 elad int
229 1.1 elad fileassoc_table_add(struct mount *mp, size_t size)
230 1.1 elad {
231 1.1 elad struct fileassoc_table *tbl;
232 1.1 elad
233 1.1 elad /* Check for existing table for device. */
234 1.1 elad if (fileassoc_table_lookup(mp) != NULL)
235 1.1 elad return (EEXIST);
236 1.1 elad
237 1.1 elad /* Allocate and initialize a Veriexec hash table. */
238 1.1 elad tbl = malloc(sizeof(*tbl), M_TEMP, M_WAITOK | M_ZERO);
239 1.1 elad tbl->hash_size = size;
240 1.1 elad tbl->tbl_mntpt = mp;
241 1.1 elad tbl->hash_tbl = hashinit(size, HASH_LIST, M_TEMP,
242 1.1 elad M_WAITOK | M_ZERO, &tbl->hash_mask);
243 1.1 elad
244 1.1 elad LIST_INSERT_HEAD(&fileassoc_tables, tbl, hash_list);
245 1.1 elad
246 1.1 elad return (0);
247 1.1 elad }
248 1.1 elad
249 1.1 elad /*
250 1.1 elad * Delete a table.
251 1.1 elad */
252 1.1 elad int
253 1.1 elad fileassoc_table_delete(struct mount *mp)
254 1.1 elad {
255 1.1 elad struct fileassoc_table *tbl;
256 1.1 elad struct fileassoc_hashhead *hh;
257 1.1 elad u_long i;
258 1.1 elad int j;
259 1.1 elad
260 1.1 elad tbl = fileassoc_table_lookup(mp);
261 1.1 elad if (tbl == NULL)
262 1.1 elad return (EEXIST);
263 1.1 elad
264 1.1 elad /* Remove all entries from the table and lists */
265 1.1 elad hh = tbl->hash_tbl;
266 1.1 elad for (i = 0; i < tbl->hash_size; i++) {
267 1.1 elad struct fileassoc_hash_entry *mhe;
268 1.1 elad
269 1.1 elad while (LIST_FIRST(&hh[i]) != NULL) {
270 1.1 elad mhe = LIST_FIRST(&hh[i]);
271 1.1 elad LIST_REMOVE(mhe, entries);
272 1.1 elad
273 1.1 elad for (j = 0; j < fileassoc_nhooks; j++)
274 1.1 elad if (fileassoc_hooks[j].hook_cleanup_cb != NULL)
275 1.2 elad (fileassoc_hooks[j].hook_cleanup_cb)
276 1.2 elad (mhe->hooks[j],
277 1.2 elad FILEASSOC_CLEANUP_FILE);
278 1.1 elad
279 1.10 blymn vfs_composefh_free(mhe->handle);
280 1.1 elad free(mhe, M_TEMP);
281 1.1 elad }
282 1.1 elad }
283 1.1 elad
284 1.1 elad for (j = 0; j < fileassoc_nhooks; j++)
285 1.1 elad if (fileassoc_hooks[j].hook_cleanup_cb != NULL)
286 1.2 elad (fileassoc_hooks[j].hook_cleanup_cb)(tbl->tables[j],
287 1.2 elad FILEASSOC_CLEANUP_TABLE);
288 1.1 elad
289 1.1 elad /* Remove hash table and sysctl node */
290 1.1 elad hashdone(tbl->hash_tbl, M_TEMP);
291 1.1 elad LIST_REMOVE(tbl, hash_list);
292 1.1 elad
293 1.1 elad return (0);
294 1.1 elad }
295 1.1 elad
296 1.1 elad /*
297 1.6 christos * Run a callback for each hook entry in a table.
298 1.6 christos */
299 1.6 christos int
300 1.6 christos fileassoc_table_run(struct mount *mp, fileassoc_t id, fileassoc_cb_t cb)
301 1.6 christos {
302 1.6 christos struct fileassoc_table *tbl;
303 1.6 christos struct fileassoc_hashhead *hh;
304 1.6 christos u_long i;
305 1.6 christos
306 1.6 christos tbl = fileassoc_table_lookup(mp);
307 1.6 christos if (tbl == NULL)
308 1.6 christos return (EEXIST);
309 1.6 christos
310 1.6 christos hh = tbl->hash_tbl;
311 1.6 christos for (i = 0; i < tbl->hash_size; i++) {
312 1.6 christos struct fileassoc_hash_entry *mhe;
313 1.6 christos
314 1.6 christos LIST_FOREACH(mhe, &hh[i], entries) {
315 1.6 christos if (mhe->hooks[id] != NULL)
316 1.6 christos cb(mhe->hooks[id]);
317 1.6 christos }
318 1.6 christos }
319 1.6 christos
320 1.6 christos return (0);
321 1.6 christos }
322 1.6 christos
323 1.6 christos /*
324 1.1 elad * Clear a table for a given hook.
325 1.1 elad */
326 1.1 elad int
327 1.1 elad fileassoc_table_clear(struct mount *mp, fileassoc_t id)
328 1.1 elad {
329 1.1 elad struct fileassoc_table *tbl;
330 1.1 elad struct fileassoc_hashhead *hh;
331 1.1 elad fileassoc_cleanup_cb_t cleanup_cb;
332 1.1 elad u_long i;
333 1.1 elad
334 1.1 elad tbl = fileassoc_table_lookup(mp);
335 1.1 elad if (tbl == NULL)
336 1.1 elad return (EEXIST);
337 1.1 elad
338 1.1 elad cleanup_cb = fileassoc_hooks[id].hook_cleanup_cb;
339 1.1 elad
340 1.1 elad hh = tbl->hash_tbl;
341 1.1 elad for (i = 0; i < tbl->hash_size; i++) {
342 1.1 elad struct fileassoc_hash_entry *mhe;
343 1.1 elad
344 1.1 elad LIST_FOREACH(mhe, &hh[i], entries) {
345 1.1 elad if ((mhe->hooks[id] != NULL) && cleanup_cb != NULL)
346 1.2 elad cleanup_cb(mhe->hooks[id],
347 1.2 elad FILEASSOC_CLEANUP_FILE);
348 1.1 elad
349 1.1 elad mhe->hooks[id] = NULL;
350 1.1 elad }
351 1.1 elad }
352 1.1 elad
353 1.1 elad if ((tbl->tables[id] != NULL) && cleanup_cb != NULL)
354 1.1 elad cleanup_cb(tbl->tables[id], FILEASSOC_CLEANUP_TABLE);
355 1.1 elad
356 1.1 elad tbl->tables[id] = NULL;
357 1.1 elad
358 1.1 elad return (0);
359 1.1 elad }
360 1.1 elad
361 1.1 elad /*
362 1.1 elad * Add hook-specific data on a fileassoc table.
363 1.1 elad */
364 1.1 elad int
365 1.1 elad fileassoc_tabledata_add(struct mount *mp, fileassoc_t id, void *data)
366 1.1 elad {
367 1.1 elad struct fileassoc_table *tbl;
368 1.1 elad
369 1.1 elad tbl = fileassoc_table_lookup(mp);
370 1.1 elad if (tbl == NULL)
371 1.1 elad return (EFAULT);
372 1.1 elad
373 1.1 elad tbl->tables[id] = data;
374 1.1 elad
375 1.1 elad return (0);
376 1.1 elad }
377 1.1 elad
378 1.1 elad /*
379 1.1 elad * Clear hook-specific data on a fileassoc table.
380 1.1 elad */
381 1.1 elad int
382 1.1 elad fileassoc_tabledata_clear(struct mount *mp, fileassoc_t id)
383 1.1 elad {
384 1.1 elad struct fileassoc_table *tbl;
385 1.1 elad
386 1.1 elad tbl = fileassoc_table_lookup(mp);
387 1.1 elad if (tbl == NULL)
388 1.1 elad return (EFAULT);
389 1.1 elad
390 1.1 elad tbl->tables[id] = NULL;
391 1.1 elad
392 1.1 elad return (0);
393 1.1 elad }
394 1.1 elad
395 1.1 elad /*
396 1.1 elad * Retrieve hook-specific data from a fileassoc table.
397 1.1 elad */
398 1.1 elad void *
399 1.1 elad fileassoc_tabledata_lookup(struct mount *mp, fileassoc_t id)
400 1.1 elad {
401 1.1 elad struct fileassoc_table *tbl;
402 1.1 elad
403 1.1 elad tbl = fileassoc_table_lookup(mp);
404 1.1 elad if (tbl == NULL)
405 1.1 elad return (NULL);
406 1.1 elad
407 1.1 elad return (tbl->tables[id]);
408 1.1 elad }
409 1.1 elad
410 1.1 elad /*
411 1.1 elad * Add a file entry to a table.
412 1.1 elad */
413 1.3 elad static struct fileassoc_hash_entry *
414 1.9 blymn fileassoc_file_add(struct vnode *vp, fhandle_t *hint)
415 1.1 elad {
416 1.1 elad struct fileassoc_table *tbl;
417 1.1 elad struct fileassoc_hashhead *vhh;
418 1.1 elad struct fileassoc_hash_entry *e;
419 1.1 elad size_t indx;
420 1.9 blymn fhandle_t *th;
421 1.1 elad int error;
422 1.1 elad
423 1.8 blymn if (hint == 0) {
424 1.9 blymn error = vfs_composefh_alloc(vp, &th);
425 1.8 blymn if (error)
426 1.8 blymn return (NULL);
427 1.8 blymn } else
428 1.9 blymn th = hint;
429 1.1 elad
430 1.9 blymn e = fileassoc_file_lookup(vp, th);
431 1.10 blymn if (e != NULL) {
432 1.10 blymn if (hint == NULL)
433 1.10 blymn vfs_composefh_free(th);
434 1.10 blymn
435 1.1 elad return (e);
436 1.10 blymn }
437 1.1 elad
438 1.1 elad tbl = fileassoc_table_lookup(vp->v_mount);
439 1.10 blymn if (tbl == NULL) {
440 1.10 blymn if (hint == NULL)
441 1.10 blymn vfs_composefh_free(th);
442 1.10 blymn
443 1.1 elad return (NULL);
444 1.10 blymn }
445 1.1 elad
446 1.9 blymn indx = FILEASSOC_HASH(tbl, th);
447 1.9 blymn vhh = &(tbl->hash_tbl[indx]);
448 1.1 elad
449 1.1 elad e = malloc(sizeof(*e), M_TEMP, M_WAITOK | M_ZERO);
450 1.9 blymn e->handle = th;
451 1.1 elad LIST_INSERT_HEAD(vhh, e, entries);
452 1.1 elad
453 1.1 elad return (e);
454 1.1 elad }
455 1.1 elad
456 1.1 elad /*
457 1.1 elad * Delete a file entry from a table.
458 1.1 elad */
459 1.1 elad int
460 1.1 elad fileassoc_file_delete(struct vnode *vp)
461 1.1 elad {
462 1.1 elad struct fileassoc_hash_entry *mhe;
463 1.1 elad int i;
464 1.1 elad
465 1.9 blymn mhe = fileassoc_file_lookup(vp, NULL);
466 1.1 elad if (mhe == NULL)
467 1.1 elad return (ENOENT);
468 1.1 elad
469 1.1 elad LIST_REMOVE(mhe, entries);
470 1.1 elad
471 1.1 elad for (i = 0; i < fileassoc_nhooks; i++)
472 1.1 elad if (fileassoc_hooks[i].hook_cleanup_cb != NULL)
473 1.1 elad (fileassoc_hooks[i].hook_cleanup_cb)(mhe->hooks[i],
474 1.1 elad FILEASSOC_CLEANUP_FILE);
475 1.1 elad
476 1.1 elad free(mhe, M_TEMP);
477 1.1 elad
478 1.1 elad return (0);
479 1.1 elad }
480 1.1 elad
481 1.1 elad /*
482 1.9 blymn * Add a hook to a vnode.
483 1.1 elad */
484 1.1 elad int
485 1.9 blymn fileassoc_add(struct vnode *vp, fileassoc_t id, void *data)
486 1.1 elad {
487 1.1 elad struct fileassoc_hash_entry *e;
488 1.1 elad
489 1.9 blymn e = fileassoc_file_lookup(vp, NULL);
490 1.1 elad if (e == NULL) {
491 1.9 blymn e = fileassoc_file_add(vp, NULL);
492 1.1 elad if (e == NULL)
493 1.1 elad return (ENOTDIR);
494 1.1 elad }
495 1.1 elad
496 1.1 elad if (e->hooks[id] != NULL)
497 1.1 elad return (EEXIST);
498 1.1 elad
499 1.1 elad e->hooks[id] = data;
500 1.1 elad
501 1.1 elad return (0);
502 1.1 elad }
503 1.1 elad
504 1.1 elad /*
505 1.1 elad * Clear a hook from a vnode.
506 1.1 elad */
507 1.1 elad int
508 1.1 elad fileassoc_clear(struct vnode *vp, fileassoc_t id)
509 1.1 elad {
510 1.1 elad struct fileassoc_hash_entry *mhe;
511 1.1 elad fileassoc_cleanup_cb_t cleanup_cb;
512 1.1 elad
513 1.9 blymn mhe = fileassoc_file_lookup(vp, NULL);
514 1.1 elad if (mhe == NULL)
515 1.1 elad return (ENOENT);
516 1.1 elad
517 1.1 elad cleanup_cb = fileassoc_hooks[id].hook_cleanup_cb;
518 1.1 elad if ((mhe->hooks[id] != NULL) && cleanup_cb != NULL)
519 1.1 elad cleanup_cb(mhe->hooks[id], FILEASSOC_CLEANUP_FILE);
520 1.1 elad
521 1.1 elad mhe->hooks[id] = NULL;
522 1.1 elad
523 1.1 elad return (0);
524 1.1 elad }
525