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
|
/*
* Copyright (c) 1993 Paul Kranenburg
* 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 Paul Kranenburg.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software withough specific prior written permission
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*
* $Id: pfsnode.h,v 1.1 1993/12/12 12:26:39 davidg Exp $
*/
/*
* This structure defines the control data for the proc file system.
*/
struct pfsnode {
struct pfsnode *pfs_next; /* next on list */
struct vnode *pfs_vnode; /* vnode associated with this pfsnode */
pid_t pfs_pid; /* associated process */
u_short pfs_mode; /* mode bits for stat() */
uid_t pfs_uid; /* process' owner */
gid_t pfs_gid; /* process' group */
u_long pfs_vflags; /* chflags() flags */
u_long pfs_flags; /* open flags */
struct vmspace *pfs_vs;
};
struct pfsnode *pfshead;
/*
* Format of a directory entry in /proc
*/
struct pfsdent {
unsigned long d_fileno;
unsigned short d_reclen;
unsigned short d_namlen;
char d_nam[8];
};
#define PFSDENTSIZE (sizeof(struct direct) - MAXNAMELEN + 8)
#ifndef DIRBLKSIZ
#define DIRBLKSIZ DEV_BSIZE
#endif
#ifdef DEBUG
int pfs_debug;
#endif
/*
* Convert between pfsnode pointers and vnode pointers
*/
#define VTOPFS(vp) ((struct pfsnode *)(vp)->v_data)
#define PFSTOV(pfsp) ((pfsp)->pfs_vnode)
/*
* Prototypes for PFS operations on vnodes.
*/
int pfs_badop();
int pfs_doio();
int pfs_lookup __P(( \
struct vnode *vp, \
struct nameidata *ndp, \
struct proc *p));
#define pfs_create ((int (*) __P(( \
struct nameidata *ndp, \
struct vattr *vap, \
struct proc *p))) pfs_badop)
#define pfs_mknod ((int (*) __P(( \
struct nameidata *ndp, \
struct vattr *vap, \
struct ucred *cred, \
struct proc *p))) pfs_badop)
int pfs_open __P((
struct vnode *vp,
int mode,
struct ucred *cred,
struct proc *p));
int pfs_close __P((
struct vnode *vp,
int fflag,
struct ucred *cred,
struct proc *p));
int pfs_access __P((
struct vnode *vp,
int mode,
struct ucred *cred,
struct proc *p));
int pfs_getattr __P((
struct vnode *vp,
struct vattr *vap,
struct ucred *cred,
struct proc *p));
int pfs_setattr __P((
struct vnode *vp,
struct vattr *vap,
struct ucred *cred,
struct proc *p));
#define pfs_read ((int (*) __P(( \
struct vnode *vp, \
struct uio *uio, \
int ioflag, \
struct ucred *cred))) pfs_doio)
#define pfs_write ((int (*) __P(( \
struct vnode *vp, \
struct uio *uio, \
int ioflag, \
struct ucred *cred))) pfs_doio)
int pfs_ioctl __P((
struct vnode *vp,
int command,
caddr_t data,
int fflag,
struct ucred *cred,
struct proc *p));
#define pfs_select ((int (*) __P(( \
struct vnode *vp, \
int which, \
int fflags, \
struct ucred *cred, \
struct proc *p))) pfs_badop)
#define pfs_mmap ((int (*) __P(( \
struct vnode *vp, \
int fflags, \
struct ucred *cred, \
struct proc *p))) pfs_badop)
#define pfs_fsync ((int (*) __P(( \
struct vnode *vp, \
int fflags, \
struct ucred *cred, \
int waitfor, \
struct proc *p))) pfs_badop)
#define pfs_seek ((int (*) __P(( \
struct vnode *vp, \
off_t oldoff, \
off_t newoff, \
struct ucred *cred))) pfs_badop)
#define pfs_remove ((int (*) __P(( \
struct nameidata *ndp, \
struct proc *p))) pfs_badop)
#define pfs_link ((int (*) __P(( \
struct vnode *vp, \
struct nameidata *ndp, \
struct proc *p))) pfs_badop)
#define pfs_rename ((int (*) __P(( \
struct nameidata *fndp, \
struct nameidata *tdnp, \
struct proc *p))) pfs_badop)
#define pfs_mkdir ((int (*) __P(( \
struct nameidata *ndp, \
struct vattr *vap, \
struct proc *p))) pfs_badop)
#define pfs_rmdir ((int (*) __P(( \
struct nameidata *ndp, \
struct proc *p))) pfs_badop)
#define pfs_symlink ((int (*) __P(( \
struct nameidata *ndp, \
struct vattr *vap, \
char *target, \
struct proc *p))) pfs_badop)
int pfs_readdir __P((
struct vnode *vp,
struct uio *uio,
struct ucred *cred,
int *eofflagp));
#define pfs_readlink ((int (*) __P(( \
struct vnode *vp, \
struct uio *uio, \
struct ucred *cred))) pfs_badop)
#define pfs_abortop ((int (*) __P(( \
struct nameidata *ndp))) pfs_badop)
int pfs_inactive __P((
struct vnode *vp,
struct proc *p));
int pfs_reclaim __P((
struct vnode *vp));
#define pfs_lock ((int (*) __P(( \
struct vnode *vp))) nullop)
#define pfs_unlock ((int (*) __P(( \
struct vnode *vp))) nullop)
int pfs_bmap __P((
struct vnode *vp,
daddr_t bn,
struct vnode **vpp,
daddr_t *bnp));
int pfs_strategy __P((
struct buf *bp));
void pfs_print __P((
struct vnode *vp));
#define pfs_islocked ((int (*) __P(( \
struct vnode *vp))) nullop)
#define pfs_advlock ((int (*) __P(( \
struct vnode *vp, \
caddr_t id, \
int op, \
struct flock *fl, \
int flags))) pfs_badop)
|
