xref: /minix3/lib/libpuffs/pnode.c (revision c9ea9e7af84fcba485b32ccd2c85edb945b1f323)
1 /*	$NetBSD: pnode.c,v 1.13 2012/08/16 09:25:43 manu Exp $	*/
2 
3 /*
4  * Copyright (c) 2006 Antti Kantee.  All Rights Reserved.
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  * 1. Redistributions of source code must retain the above copyright
10  *    notice, this list of conditions and the following disclaimer.
11  * 2. Redistributions in binary form must reproduce the above copyright
12  *    notice, this list of conditions and the following disclaimer in the
13  *    documentation and/or other materials provided with the distribution.
14  *
15  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
16  * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
17  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
18  * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
21  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25  * SUCH DAMAGE.
26  */
27 
28 #include <sys/cdefs.h>
29 #if !defined(lint)
30 __RCSID("$NetBSD: pnode.c,v 1.13 2012/08/16 09:25:43 manu Exp $");
31 #endif /* !lint */
32 
33 #include <sys/types.h>
34 
35 #include <assert.h>
36 #include <puffs.h>
37 #include <stdlib.h>
38 #include <stdio.h>
39 #include <string.h>
40 
41 #include "puffs_priv.h"
42 #if defined(__minix)
43 #include <minix/type.h>
44 #include "proto.h"
45 #endif /* defined(__minix) */
46 
47 /*
48  * Well, you're probably wondering why this isn't optimized.
49  * The reason is simple: my available time is not optimized for
50  * size ... so please be patient ;)
51  */
52 struct puffs_node *
53 puffs_pn_new(struct puffs_usermount *pu, void *privdata)
54 {
55 	struct puffs_node *pn;
56 
57 	pn = calloc(1, sizeof(struct puffs_node));
58 	if (pn == NULL)
59 		return NULL;
60 
61 	pn->pn_data = privdata;
62 	pn->pn_mnt = pu;
63 	puffs_vattr_null(&pn->pn_va);
64 
65 	LIST_INSERT_HEAD(&pu->pu_pnodelst, pn, pn_entries);
66 
67 	pu->pu_flags |= PUFFS_FLAG_PNCOOKIE;
68 
69 	return pn;
70 }
71 
72 void
73 puffs_pn_remove(struct puffs_node *pn)
74 {
75 	struct puffs_usermount *pu = pn->pn_mnt;
76 	assert(pu != NULL);
77 
78 	LIST_REMOVE(pn, pn_entries);
79 	pn->pn_flags |= PUFFS_NODE_REMOVED;
80 	if (pn->pn_count != 0) {
81 		/* XXX FS removes this pn from the list to prevent further
82 		 * lookups from finding node after remove/rm/rename op.
83 		 * But VFS still uses it, i.e. pnode is still open, and
84 		 * will put it later. Keep it in separate list to do reclaim
85 		 * in fs_put().
86 		 */
87 		LIST_INSERT_HEAD(&pu->pu_pnode_removed_lst, pn, pn_entries);
88 	}
89 }
90 
91 void
92 puffs_pn_put(struct puffs_node *pn)
93 {
94 	struct puffs_usermount *pu = pn->pn_mnt;
95 
96 	pu->pu_pathfree(pu, &pn->pn_po);
97 	if ((pn->pn_flags & PUFFS_NODE_REMOVED) == 0)
98 		LIST_REMOVE(pn, pn_entries);
99 	free(pn);
100 }
101 
102 /* walk list, rv can be used either to halt or to return a value
103  * XXX (MINIX note): if fn is 0, then arg is ino_t and we search
104  * node with ino_t. TODO: modify docs.
105  */
106 void *
107 puffs_pn_nodewalk(struct puffs_usermount *pu, puffs_nodewalk_fn fn, void *arg)
108 {
109 	struct puffs_node *pn_cur, *pn_next;
110 	void *rv;
111 
112 	pn_cur = LIST_FIRST(&pu->pu_pnodelst);
113 	while (pn_cur) {
114 		pn_next = LIST_NEXT(pn_cur, pn_entries);
115 		if (fn) {
116 			rv = fn(pu, pn_cur, arg);
117 			if (rv)
118 				return rv;
119 		} else {
120 			if (pn_cur->pn_va.va_fileid == *((ino_t*) arg))
121 				return pn_cur;
122 		}
123 		pn_cur = pn_next;
124 	}
125 
126 	return NULL;
127 }
128 
129 struct vattr *
130 puffs_pn_getvap(struct puffs_node *pn)
131 {
132 
133 	return &pn->pn_va;
134 }
135 
136 void *
137 puffs_pn_getpriv(struct puffs_node *pn)
138 {
139 
140 	return pn->pn_data;
141 }
142 
143 void
144 puffs_pn_setpriv(struct puffs_node *pn, void *priv)
145 {
146 
147 	pn->pn_data = priv;
148 }
149 
150 struct puffs_pathobj *
151 puffs_pn_getpo(struct puffs_node *pn)
152 {
153 
154 	return &pn->pn_po;
155 }
156 
157 struct puffs_usermount *
158 puffs_pn_getmnt(struct puffs_node *pn)
159 {
160 
161 	return pn->pn_mnt;
162 }
163 
164 /* convenience / shortcut */
165 void *
166 puffs_pn_getmntspecific(struct puffs_node *pn)
167 {
168 
169 	return pn->pn_mnt->pu_privdata;
170 }
171 
172 /*
173  * newnode parameters
174  */
175 void
176 puffs_newinfo_setcookie(struct puffs_newinfo *pni, puffs_cookie_t cookie)
177 {
178 
179 	*pni->pni_cookie = cookie;
180 }
181 
182 void
183 puffs_newinfo_setvtype(struct puffs_newinfo *pni, enum vtype vt)
184 {
185 
186 	*pni->pni_vtype = vt;
187 }
188 
189 void
190 puffs_newinfo_setsize(struct puffs_newinfo *pni, voff_t size)
191 {
192 
193 	*pni->pni_size = size;
194 }
195 
196 void
197 puffs_newinfo_setrdev(struct puffs_newinfo *pni, dev_t rdev)
198 {
199 
200 	*pni->pni_rdev = rdev;
201 }
202 
203 void
204 puffs_newinfo_setva(struct puffs_newinfo *pni, struct vattr *va)
205 {
206 
207 	(void)memcpy(pni->pni_va, va, sizeof(struct vattr));
208 }
209 
210 void
211 puffs_newinfo_setvattl(struct puffs_newinfo *pni, struct timespec *va_ttl)
212 {
213 
214 	pni->pni_va_ttl->tv_sec = va_ttl->tv_sec;
215 	pni->pni_va_ttl->tv_nsec = va_ttl->tv_nsec;
216 }
217 
218 void
219 puffs_newinfo_setcnttl(struct puffs_newinfo *pni, struct timespec *cn_ttl)
220 {
221 
222 	pni->pni_cn_ttl->tv_sec = cn_ttl->tv_sec;
223 	pni->pni_cn_ttl->tv_nsec = cn_ttl->tv_nsec;
224 }
225 
226