xref: /minix3/lib/libpuffs/pnode.c (revision eda6f5931d42c77e1480347b1fc3eef2f8d33806)
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 
43 /*
44  * Well, you're probably wondering why this isn't optimized.
45  * The reason is simple: my available time is not optimized for
46  * size ... so please be patient ;)
47  */
48 struct puffs_node *
49 puffs_pn_new(struct puffs_usermount *pu, void *privdata)
50 {
51 	struct puffs_node *pn;
52 
53 	pn = calloc(1, sizeof(struct puffs_node));
54 	if (pn == NULL)
55 		return NULL;
56 
57 	pn->pn_data = privdata;
58 	pn->pn_mnt = pu;
59 	puffs_vattr_null(&pn->pn_va);
60 
61 	LIST_INSERT_HEAD(&pu->pu_pnodelst, pn, pn_entries);
62 
63 	pu->pu_flags |= PUFFS_FLAG_PNCOOKIE;
64 
65 	return pn;
66 }
67 
68 void
69 puffs_pn_remove(struct puffs_node *pn)
70 {
71 	struct puffs_usermount *pu = pn->pn_mnt;
72 	assert(pu != NULL);
73 
74 	LIST_REMOVE(pn, pn_entries);
75 	pn->pn_flags |= PUFFS_NODE_REMOVED;
76 	if (pn->pn_count != 0) {
77 		/* XXX FS removes this pn from the list to prevent further
78 		 * lookups from finding node after remove/rm/rename op.
79 		 * But VFS still uses it, i.e. pnode is still open, and
80 		 * will put it later. Keep it in separate list to do reclaim
81 		 * in fs_put().
82 		 */
83 		LIST_INSERT_HEAD(&pu->pu_pnode_removed_lst, pn, pn_entries);
84 	}
85 }
86 
87 void
88 puffs_pn_put(struct puffs_node *pn)
89 {
90 	struct puffs_usermount *pu = pn->pn_mnt;
91 
92 	pu->pu_pathfree(pu, &pn->pn_po);
93 	if ((pn->pn_flags & PUFFS_NODE_REMOVED) == 0)
94 		LIST_REMOVE(pn, pn_entries);
95 	free(pn);
96 }
97 
98 /* walk list, rv can be used either to halt or to return a value
99  * XXX (MINIX note): if fn is 0, then arg is ino_t and we search
100  * node with ino_t. TODO: modify docs.
101  */
102 void *
103 puffs_pn_nodewalk(struct puffs_usermount *pu, puffs_nodewalk_fn fn, void *arg)
104 {
105 	struct puffs_node *pn_cur, *pn_next;
106 	void *rv;
107 
108 	pn_cur = LIST_FIRST(&pu->pu_pnodelst);
109 	while (pn_cur) {
110 		pn_next = LIST_NEXT(pn_cur, pn_entries);
111 		if (fn) {
112 			rv = fn(pu, pn_cur, arg);
113 			if (rv)
114 				return rv;
115 		} else {
116 			if (pn_cur->pn_va.va_fileid == *((ino_t*) arg))
117 				return pn_cur;
118 		}
119 		pn_cur = pn_next;
120 	}
121 
122 	return NULL;
123 }
124 
125 struct vattr *
126 puffs_pn_getvap(struct puffs_node *pn)
127 {
128 
129 	return &pn->pn_va;
130 }
131 
132 void *
133 puffs_pn_getpriv(struct puffs_node *pn)
134 {
135 
136 	return pn->pn_data;
137 }
138 
139 void
140 puffs_pn_setpriv(struct puffs_node *pn, void *priv)
141 {
142 
143 	pn->pn_data = priv;
144 }
145 
146 struct puffs_pathobj *
147 puffs_pn_getpo(struct puffs_node *pn)
148 {
149 
150 	return &pn->pn_po;
151 }
152 
153 struct puffs_usermount *
154 puffs_pn_getmnt(struct puffs_node *pn)
155 {
156 
157 	return pn->pn_mnt;
158 }
159 
160 /* convenience / shortcut */
161 void *
162 puffs_pn_getmntspecific(struct puffs_node *pn)
163 {
164 
165 	return pn->pn_mnt->pu_privdata;
166 }
167 
168 /*
169  * newnode parameters
170  */
171 void
172 puffs_newinfo_setcookie(struct puffs_newinfo *pni, puffs_cookie_t cookie)
173 {
174 
175 	*pni->pni_cookie = cookie;
176 }
177 
178 void
179 puffs_newinfo_setvtype(struct puffs_newinfo *pni, enum vtype vt)
180 {
181 
182 	*pni->pni_vtype = vt;
183 }
184 
185 void
186 puffs_newinfo_setsize(struct puffs_newinfo *pni, voff_t size)
187 {
188 
189 	*pni->pni_size = size;
190 }
191 
192 void
193 puffs_newinfo_setrdev(struct puffs_newinfo *pni, dev_t rdev)
194 {
195 
196 	*pni->pni_rdev = rdev;
197 }
198 
199 void
200 puffs_newinfo_setva(struct puffs_newinfo *pni, struct vattr *va)
201 {
202 
203 	(void)memcpy(pni->pni_va, va, sizeof(struct vattr));
204 }
205 
206 void
207 puffs_newinfo_setvattl(struct puffs_newinfo *pni, struct timespec *va_ttl)
208 {
209 
210 	pni->pni_va_ttl->tv_sec = va_ttl->tv_sec;
211 	pni->pni_va_ttl->tv_nsec = va_ttl->tv_nsec;
212 }
213 
214 void
215 puffs_newinfo_setcnttl(struct puffs_newinfo *pni, struct timespec *cn_ttl)
216 {
217 
218 	pni->pni_cn_ttl->tv_sec = cn_ttl->tv_sec;
219 	pni->pni_cn_ttl->tv_nsec = cn_ttl->tv_nsec;
220 }
221 
222