pnode.c revision 1.6 1 1.6 pooka /* $NetBSD: pnode.c,v 1.6 2007/06/06 01:55:01 pooka Exp $ */
2 1.1 pooka
3 1.1 pooka /*
4 1.1 pooka * Copyright (c) 2006 Antti Kantee. All Rights Reserved.
5 1.1 pooka *
6 1.1 pooka * Redistribution and use in source and binary forms, with or without
7 1.1 pooka * modification, are permitted provided that the following conditions
8 1.1 pooka * are met:
9 1.1 pooka * 1. Redistributions of source code must retain the above copyright
10 1.1 pooka * notice, this list of conditions and the following disclaimer.
11 1.1 pooka * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 pooka * notice, this list of conditions and the following disclaimer in the
13 1.1 pooka * documentation and/or other materials provided with the distribution.
14 1.1 pooka *
15 1.1 pooka * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
16 1.1 pooka * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
17 1.1 pooka * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
18 1.1 pooka * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 1.1 pooka * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 1.1 pooka * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
21 1.1 pooka * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 1.1 pooka * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 1.1 pooka * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 1.1 pooka * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25 1.1 pooka * SUCH DAMAGE.
26 1.1 pooka */
27 1.1 pooka
28 1.1 pooka #include <sys/cdefs.h>
29 1.1 pooka #if !defined(lint)
30 1.6 pooka __RCSID("$NetBSD: pnode.c,v 1.6 2007/06/06 01:55:01 pooka Exp $");
31 1.1 pooka #endif /* !lint */
32 1.1 pooka
33 1.1 pooka #include <sys/types.h>
34 1.1 pooka
35 1.1 pooka #include <assert.h>
36 1.1 pooka #include <puffs.h>
37 1.1 pooka #include <stdlib.h>
38 1.1 pooka #include <stdio.h>
39 1.1 pooka #include <string.h>
40 1.1 pooka
41 1.1 pooka #include "puffs_priv.h"
42 1.1 pooka
43 1.1 pooka /*
44 1.1 pooka * Well, you're probably wondering why this isn't optimized.
45 1.1 pooka * The reason is simple: my available time is not optimized for
46 1.1 pooka * size ... so please be patient ;)
47 1.1 pooka */
48 1.1 pooka struct puffs_node *
49 1.1 pooka puffs_pn_new(struct puffs_usermount *pu, void *privdata)
50 1.1 pooka {
51 1.1 pooka struct puffs_node *pn;
52 1.1 pooka
53 1.1 pooka pn = calloc(1, sizeof(struct puffs_node));
54 1.1 pooka if (pn == NULL)
55 1.1 pooka return NULL;
56 1.1 pooka
57 1.3 pooka pn->pn_data = privdata;
58 1.1 pooka pn->pn_mnt = pu;
59 1.1 pooka puffs_vattr_null(&pn->pn_va);
60 1.1 pooka
61 1.1 pooka LIST_INSERT_HEAD(&pu->pu_pnodelst, pn, pn_entries);
62 1.1 pooka
63 1.1 pooka return pn;
64 1.1 pooka }
65 1.1 pooka
66 1.1 pooka void
67 1.1 pooka puffs_pn_put(struct puffs_node *pn)
68 1.1 pooka {
69 1.3 pooka struct puffs_usermount *pu = pn->pn_mnt;
70 1.1 pooka
71 1.3 pooka pu->pu_pathfree(pu, &pn->pn_po);
72 1.1 pooka LIST_REMOVE(pn, pn_entries);
73 1.1 pooka free(pn);
74 1.1 pooka }
75 1.2 pooka
76 1.2 pooka /* walk list, rv can be used either to halt or to return a value */
77 1.2 pooka void *
78 1.3 pooka puffs_pn_nodewalk(struct puffs_usermount *pu, puffs_nodewalk_fn fn, void *arg)
79 1.2 pooka {
80 1.2 pooka struct puffs_node *pn_cur, *pn_next;
81 1.2 pooka void *rv;
82 1.2 pooka
83 1.2 pooka pn_cur = LIST_FIRST(&pu->pu_pnodelst);
84 1.2 pooka while (pn_cur) {
85 1.2 pooka pn_next = LIST_NEXT(pn_cur, pn_entries);
86 1.3 pooka rv = fn(pu, pn_cur, arg);
87 1.2 pooka if (rv)
88 1.2 pooka return rv;
89 1.2 pooka pn_cur = pn_next;
90 1.2 pooka }
91 1.2 pooka
92 1.2 pooka return NULL;
93 1.2 pooka }
94 1.5 pooka
95 1.5 pooka /* convenience / shortcut */
96 1.5 pooka void *
97 1.5 pooka puffs_pn_getmntspecific(struct puffs_node *pn)
98 1.5 pooka {
99 1.5 pooka
100 1.5 pooka return pn->pn_mnt->pu_privdata;
101 1.5 pooka }
102