1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
|
/*
* Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Kungliga Tekniska
* Högskolan and its contributors.
*
* 4. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <xfs/xfs_locl.h>
#include <xfs/xfs_deb.h>
#include <xfs/xfs_fs.h>
#include <xfs/xfs_message.h>
#include <xfs/xfs_msg_locl.h>
#include <xfs/xfs_syscalls.h>
#include <xfs/xfs_vfsops.h>
#include <xfs/xfs_vnodeops.h>
RCSID("$Id: xfs_message.c,v 1.4 1999/04/30 01:59:00 art Exp $");
int
xfs_message_installroot(int fd,
struct xfs_message_installroot * message,
u_int size,
struct proc *p)
{
int error = 0;
XFSDEB(XDEBMSG, ("xfs_message_installroot\n"));
if (xfs[fd].root != NULL) {
printf("XFS PANIC WARNING! xfs_message_installroot: called again!\n");
error = EBUSY;
} else {
error = new_xfs_node(&xfs[fd], &message->node, &xfs[fd].root, p);
if (error)
return error;
xfs[fd].root->vn->v_flag |= VROOT;
}
return error;
}
int
xfs_message_installnode(int fd,
struct xfs_message_installnode * message,
u_int size,
struct proc *p)
{
int error = 0;
struct xfs_node *n, *dp;
XFSDEB(XDEBMSG, ("xfs_message_installnode\n"));
dp = xfs_node_find(&xfs[fd], &message->parent_handle);
if (dp) {
struct vnode *t_vnode = XNODE_TO_VNODE(dp);
xfs_do_vget (t_vnode, LK_INTERLOCK|LK_SHARED, p);
error = new_xfs_node(&xfs[fd], &message->node, &n, p);
if (error) {
vrele (t_vnode);
return error;
}
xfs_dnlc_enter_name(t_vnode,
message->name,
XNODE_TO_VNODE(n));
vrele(XNODE_TO_VNODE(n));
vput (t_vnode);
} else {
printf("XFS PANIC WARNING! xfs_message_installnode: no parent\n");
error = ENOENT;
}
XFSDEB(XDEBMSG, ("return: xfs_message_installnode: %d\n", error));
return error;
}
int
xfs_message_installattr(int fd,
struct xfs_message_installattr * message,
u_int size,
struct proc *p)
{
int error = 0;
struct xfs_node *t;
t = xfs_node_find(&xfs[fd], &message->node.handle);
if (t != 0) {
t->tokens = message->node.tokens;
xfs_attr2vattr(&message->node.attr, &t->attr);
#ifdef HAVE_KERNEL_VNODE_PAGER_SETSIZE
vnode_pager_setsize(XNODE_TO_VNODE(t), t->attr.va_size);
#endif
bcopy(message->node.id, t->id, sizeof(t->id));
bcopy(message->node.rights, t->rights, sizeof(t->rights));
t->anonrights = message->node.anonrights;
} else {
printf("XFS PANIC WARNING! xfs_message_installattr: no node!\n");
error = ENOENT;
}
return error;
}
int
xfs_message_installdata(int fd,
struct xfs_message_installdata * message,
u_int size,
struct proc *p)
{
struct xfs_node *t;
int error = 0;
XFSDEB(XDEBMSG, ("xfs_message_installdata\n"));
t = xfs_node_find(&xfs[fd], &message->node.handle);
if (t != NULL) {
struct xfs_fh_args *fh_args = (struct xfs_fh_args *)&message->cache_handle;
struct vnode *vp;
struct vnode *t_vnode = XNODE_TO_VNODE(t);
XFSDEB(XDEBMSG, ("cache_name = '%s'\n", message->cache_name));
XFSDEB(XDEBMSG, ("fileno = %ld, gen = %ld\n",
SCARG(fh_args, fileid),
SCARG(fh_args, gen)));
xfs_do_vget (t_vnode, LK_INTERLOCK|LK_SHARED, p);
error = xfs_fhlookup (p,
SCARG(fh_args,fsid),
SCARG(fh_args,fileid),
SCARG(fh_args,gen),
&vp);
if (error != 0) {
#ifdef __osf__
struct nameidata *ndp = &u.u_nd;
#else
struct nameidata nd;
struct nameidata *ndp = &nd;
#endif
XFSDEB(XDEBMSG,
("xfs_message_installdata: fhlookup failed: %d, "
"opening by name\n", error));
NDINIT(ndp, LOOKUP, FOLLOW, UIO_SYSSPACE,
message->cache_name, p);
error = namei(ndp);
vp = ndp->ni_vp;
}
if (error == 0) {
xfs_vfs_unlock(vp, p);
if (DATA_FROM_XNODE(t))
vrele(DATA_FROM_XNODE(t));
DATA_FROM_XNODE(t) = vp;
XFSDEB(XDEBMSG, ("xfs_message_installdata: t = %p;"
" tokens = %x\n",
t, message->node.tokens));
t->tokens = message->node.tokens;
xfs_attr2vattr(&message->node.attr, &t->attr);
#ifdef HAVE_KERNEL_VNODE_PAGER_SETSIZE
vnode_pager_setsize(XNODE_TO_VNODE(t), t->attr.va_size);
#endif
if (XNODE_TO_VNODE(t)->v_type == VDIR
&& (message->flag & XFS_INVALID_DNLC))
cache_purge (XNODE_TO_VNODE(t));
bcopy(message->node.id, t->id, sizeof(t->id));
bcopy(message->node.rights, t->rights, sizeof(t->rights));
t->anonrights = message->node.anonrights;
} else {
printf("XFS PANIC WARNING! xfs_message_installdata failed!\n");
printf("Reason: lookup failed on cache file '%s', error = %d\n",
message->cache_name, error);
}
vput (t_vnode);
} else {
printf("XFS PANIC WARNING! xfs_message_installdata failed\n");
printf("Reason: No node to install the data into!\n");
error = ENOENT;
}
return error;
}
int
xfs_message_invalidnode(int fd,
struct xfs_message_invalidnode * message,
u_int size,
struct proc *p)
{
int error = 0;
struct xfs_node *t;
XFSDEB(XDEBMSG, ("xfs_message_invalidnode\n"));
t = xfs_node_find(&xfs[fd], &message->handle);
if (t != 0) {
/* XXX Really need to put back dirty data first. */
if (DATA_FROM_XNODE(t)) {
vrele(DATA_FROM_XNODE(t));
DATA_FROM_XNODE(t) = (struct vnode *) 0;
}
XFS_TOKEN_CLEAR(t, ~0,
XFS_OPEN_MASK | XFS_ATTR_MASK |
XFS_DATA_MASK | XFS_LOCK_MASK);
cache_purge(XNODE_TO_VNODE(t));
} else {
printf("XFS PANIC WARNING! xfs_message_invalidnode: no node!\n");
error = ENOENT;
}
return error;
}
int
xfs_message_updatefid(int fd,
struct xfs_message_updatefid * message,
u_int size,
struct proc *p)
{
int error = 0;
struct xfs_node *t;
XFSDEB(XDEBMSG, ("xfs_message_updatefid\n"));
t = xfs_node_find (&xfs[fd], &message->old_handle);
if (t != NULL) {
t->handle = message->new_handle;
} else {
printf ("XFS PANIC WARNING! xfs_message_updatefid: no node!\n");
error = ENOENT;
}
return error;
}
|
