procfs.h revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1993 The Regents of the University of California.
3 1.1 cgd * Copyright (c) 1993 Jan-Simon Pendry
4 1.1 cgd * All rights reserved.
5 1.1 cgd *
6 1.1 cgd * This code is derived from software contributed to Berkeley by
7 1.1 cgd * Jan-Simon Pendry.
8 1.1 cgd *
9 1.1 cgd * Redistribution and use in source and binary forms, with or without
10 1.1 cgd * modification, are permitted provided that the following conditions
11 1.1 cgd * are met:
12 1.1 cgd * 1. Redistributions of source code must retain the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer.
14 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 cgd * notice, this list of conditions and the following disclaimer in the
16 1.1 cgd * documentation and/or other materials provided with the distribution.
17 1.1 cgd * 3. All advertising materials mentioning features or use of this software
18 1.1 cgd * must display the following acknowledgement:
19 1.1 cgd * This product includes software developed by the University of
20 1.1 cgd * California, Berkeley and its contributors.
21 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
22 1.1 cgd * may be used to endorse or promote products derived from this software
23 1.1 cgd * without specific prior written permission.
24 1.1 cgd *
25 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 1.1 cgd * SUCH DAMAGE.
36 1.1 cgd *
37 1.1 cgd * From:
38 1.1 cgd * Id: procfs.h,v 4.1 1993/12/17 10:47:45 jsp Rel
39 1.1 cgd *
40 1.2 cgd * $Id: procfs.h,v 1.2 1994/01/05 11:08:07 cgd Exp $
41 1.1 cgd */
42 1.1 cgd
43 1.1 cgd /*
44 1.1 cgd * The different types of node in a procfs filesystem
45 1.1 cgd */
46 1.1 cgd typedef enum {
47 1.1 cgd Proot, /* the filesystem root */
48 1.1 cgd Pproc, /* a process-specific sub-directory */
49 1.1 cgd Pfile, /* the executable file */
50 1.1 cgd Pmem, /* the process's memory image */
51 1.1 cgd Pregs, /* the process's register set */
52 1.1 cgd Pctl, /* process control */
53 1.1 cgd Pstatus, /* process status */
54 1.1 cgd Pnote, /* process notifier */
55 1.1 cgd Pnotepg /* process group notifier */
56 1.1 cgd } pfstype;
57 1.1 cgd
58 1.1 cgd /*
59 1.1 cgd * control data for the proc file system.
60 1.1 cgd */
61 1.1 cgd struct pfsnode {
62 1.1 cgd struct pfsnode *pfs_next; /* next on list */
63 1.1 cgd struct vnode *pfs_vnode; /* vnode associated with this pfsnode */
64 1.1 cgd pfstype pfs_type; /* type of procfs node */
65 1.1 cgd pid_t pfs_pid; /* associated process */
66 1.1 cgd u_short pfs_mode; /* mode bits for stat() */
67 1.1 cgd u_long pfs_flags; /* open flags */
68 1.1 cgd u_long pfs_fileno; /* unique file id */
69 1.1 cgd };
70 1.1 cgd
71 1.1 cgd #define PROCFS_NOTELEN 64 /* max length of a note (/proc/$pid/note) */
72 1.1 cgd #define PROCFS_CTLLEN 8 /* max length of a ctl msg (/proc/$pid/ctl */
73 1.1 cgd
74 1.1 cgd /*
75 1.1 cgd * Kernel stuff follows
76 1.1 cgd */
77 1.1 cgd #ifdef KERNEL
78 1.1 cgd
79 1.1 cgd #define NDEQ(ndp, s, len) \
80 1.1 cgd ((ndp)->ni_namelen == (len) && \
81 1.1 cgd (bcmp((s), (ndp)->ni_ptr, (len)) == 0))
82 1.1 cgd
83 1.1 cgd /*
84 1.1 cgd * Format of a directory entry in /proc, ...
85 1.1 cgd * This must map onto struct dirent (see <dirent.h>)
86 1.1 cgd */
87 1.1 cgd #define PROCFS_NAMELEN 8
88 1.1 cgd struct pfsdent {
89 1.1 cgd u_long d_fileno;
90 1.1 cgd u_short d_reclen;
91 1.1 cgd u_short d_namlen;
92 1.1 cgd char d_name[PROCFS_NAMELEN];
93 1.1 cgd };
94 1.1 cgd #define UIO_MX sizeof(struct pfsdent)
95 1.1 cgd #define PROCFS_FILENO(pid, type) \
96 1.1 cgd (((type) == Proot) ? \
97 1.1 cgd 2 : \
98 1.1 cgd ((((pid)+1) << 3) + ((int) (type))))
99 1.1 cgd
100 1.1 cgd /*
101 1.1 cgd * Convert between pfsnode vnode
102 1.1 cgd */
103 1.1 cgd #define VTOPFS(vp) ((struct pfsnode *)(vp)->v_data)
104 1.1 cgd #define PFSTOV(pfs) ((pfs)->pfs_vnode)
105 1.1 cgd
106 1.1 cgd typedef struct vfs_namemap vfs_namemap_t;
107 1.1 cgd struct vfs_namemap {
108 1.1 cgd const char *nm_name;
109 1.1 cgd int nm_val;
110 1.1 cgd };
111 1.1 cgd
112 1.1 cgd extern int vfs_getuserstr __P((struct uio *, char *, int *));
113 1.1 cgd extern vfs_namemap_t *vfs_findname __P((vfs_namemap_t *, char *, int));
114 1.1 cgd
115 1.1 cgd struct reg;
116 1.1 cgd
117 1.1 cgd #define PFIND(pid) ((pid) ? pfind(pid) : &proc0)
118 1.1 cgd extern int procfs_freevp __P((struct vnode *));
119 1.1 cgd extern int procfs_allocvp __P((struct mount *, struct vnode **, long, pfstype));
120 1.1 cgd extern struct vnode *procfs_findtextvp __P((struct proc *));
121 1.1 cgd extern int procfs_sstep __P((struct proc *));
122 1.1 cgd extern int procfs_read_regs __P((struct proc *, struct reg *));
123 1.1 cgd extern int procfs_write_regs __P((struct proc *, struct reg *));
124 1.1 cgd extern int procfs_donote __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
125 1.1 cgd extern int procfs_doregs __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
126 1.1 cgd extern int procfs_domem __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
127 1.1 cgd extern int procfs_doctl __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
128 1.1 cgd extern int procfs_dostatus __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
129 1.1 cgd extern int procfs_rw __P((struct vnode *, struct uio *, int, struct ucred *));
130 1.1 cgd
131 1.1 cgd #define PROCFS_LOCKED 0x01
132 1.1 cgd #define PROCFS_WANT 0x02
133 1.1 cgd
134 1.1 cgd extern struct vnodeops procfs_vnodeops;
135 1.1 cgd extern struct vfsops procfs_vfsops;
136 1.1 cgd
137 1.1 cgd /*
138 1.1 cgd * Prototypes for procfs vnode ops
139 1.1 cgd */
140 1.1 cgd int procfs_badop(); /* varargs */
141 1.1 cgd int procfs_rw __P((
142 1.1 cgd struct vnode *vp,
143 1.1 cgd struct uio *uio,
144 1.1 cgd int ioflag,
145 1.1 cgd struct ucred *cred));
146 1.1 cgd int procfs_lookup __P((
147 1.1 cgd struct vnode *vp,
148 1.1 cgd struct nameidata *ndp,
149 1.1 cgd struct proc *p));
150 1.1 cgd #define procfs_create ((int (*) __P(( \
151 1.1 cgd struct nameidata *ndp, \
152 1.1 cgd struct vattr *vap, \
153 1.1 cgd struct proc *p))) procfs_badop)
154 1.1 cgd #define procfs_mknod ((int (*) __P(( \
155 1.1 cgd struct nameidata *ndp, \
156 1.1 cgd struct vattr *vap, \
157 1.1 cgd struct ucred *cred, \
158 1.1 cgd struct proc *p))) procfs_badop)
159 1.1 cgd int procfs_open __P((
160 1.1 cgd struct vnode *vp,
161 1.1 cgd int mode,
162 1.1 cgd struct ucred *cred,
163 1.1 cgd struct proc *p));
164 1.1 cgd int procfs_close __P((
165 1.1 cgd struct vnode *vp,
166 1.1 cgd int fflag,
167 1.1 cgd struct ucred *cred,
168 1.1 cgd struct proc *p));
169 1.1 cgd int procfs_access __P((
170 1.1 cgd struct vnode *vp,
171 1.1 cgd int mode,
172 1.1 cgd struct ucred *cred,
173 1.1 cgd struct proc *p));
174 1.1 cgd int procfs_getattr __P((
175 1.1 cgd struct vnode *vp,
176 1.1 cgd struct vattr *vap,
177 1.1 cgd struct ucred *cred,
178 1.1 cgd struct proc *p));
179 1.1 cgd int procfs_setattr __P((
180 1.1 cgd struct vnode *vp,
181 1.1 cgd struct vattr *vap,
182 1.1 cgd struct ucred *cred,
183 1.1 cgd struct proc *p));
184 1.1 cgd #define procfs_read procfs_rw
185 1.1 cgd #define procfs_write procfs_rw
186 1.1 cgd int procfs_ioctl __P((
187 1.1 cgd struct vnode *vp,
188 1.1 cgd int command,
189 1.1 cgd caddr_t data,
190 1.1 cgd int fflag,
191 1.1 cgd struct ucred *cred,
192 1.1 cgd struct proc *p));
193 1.1 cgd #define procfs_select ((int (*) __P(( \
194 1.1 cgd struct vnode *vp, \
195 1.1 cgd int which, \
196 1.1 cgd int fflags, \
197 1.1 cgd struct ucred *cred, \
198 1.1 cgd struct proc *p))) procfs_badop)
199 1.1 cgd #define procfs_mmap ((int (*) __P(( \
200 1.1 cgd struct vnode *vp, \
201 1.1 cgd int fflags, \
202 1.1 cgd struct ucred *cred, \
203 1.1 cgd struct proc *p))) procfs_badop)
204 1.1 cgd #define procfs_fsync ((int (*) __P(( \
205 1.1 cgd struct vnode *vp, \
206 1.1 cgd int fflags, \
207 1.1 cgd struct ucred *cred, \
208 1.1 cgd int waitfor, \
209 1.1 cgd struct proc *p))) procfs_badop)
210 1.1 cgd #define procfs_seek ((int (*) __P(( \
211 1.1 cgd struct vnode *vp, \
212 1.1 cgd off_t oldoff, \
213 1.1 cgd off_t newoff, \
214 1.1 cgd struct ucred *cred))) procfs_badop)
215 1.1 cgd #define procfs_remove ((int (*) __P(( \
216 1.1 cgd struct nameidata *ndp, \
217 1.1 cgd struct proc *p))) procfs_badop)
218 1.1 cgd #define procfs_link ((int (*) __P(( \
219 1.1 cgd struct vnode *vp, \
220 1.1 cgd struct nameidata *ndp, \
221 1.1 cgd struct proc *p))) procfs_badop)
222 1.1 cgd #define procfs_rename ((int (*) __P(( \
223 1.1 cgd struct nameidata *fndp, \
224 1.1 cgd struct nameidata *tdnp, \
225 1.1 cgd struct proc *p))) procfs_badop)
226 1.1 cgd #define procfs_mkdir ((int (*) __P(( \
227 1.1 cgd struct nameidata *ndp, \
228 1.1 cgd struct vattr *vap, \
229 1.1 cgd struct proc *p))) procfs_badop)
230 1.1 cgd #define procfs_rmdir ((int (*) __P(( \
231 1.1 cgd struct nameidata *ndp, \
232 1.1 cgd struct proc *p))) procfs_badop)
233 1.1 cgd #define procfs_symlink ((int (*) __P(( \
234 1.1 cgd struct nameidata *ndp, \
235 1.1 cgd struct vattr *vap, \
236 1.1 cgd char *target, \
237 1.1 cgd struct proc *p))) procfs_badop)
238 1.1 cgd int procfs_readdir __P((
239 1.1 cgd struct vnode *vp,
240 1.1 cgd struct uio *uio,
241 1.1 cgd struct ucred *cred,
242 1.1 cgd int *eofflagp,
243 1.1 cgd u_int *cookies,
244 1.1 cgd int ncookies));
245 1.1 cgd #define procfs_readlink ((int (*) __P(( \
246 1.1 cgd struct vnode *vp, \
247 1.1 cgd struct uio *uio, \
248 1.1 cgd struct ucred *cred))) procfs_badop)
249 1.1 cgd int procfs_abortop __P((
250 1.1 cgd struct nameidata *ndp));
251 1.1 cgd int procfs_inactive __P((
252 1.1 cgd struct vnode *vp,
253 1.1 cgd struct proc *p));
254 1.1 cgd int procfs_reclaim __P((
255 1.1 cgd struct vnode *vp));
256 1.1 cgd #define procfs_lock ((int (*) __P(( \
257 1.1 cgd struct vnode *vp))) nullop)
258 1.1 cgd #define procfs_unlock ((int (*) __P(( \
259 1.1 cgd struct vnode *vp))) nullop)
260 1.1 cgd int procfs_bmap __P((
261 1.1 cgd struct vnode *vp,
262 1.1 cgd daddr_t bn,
263 1.1 cgd struct vnode **vpp,
264 1.1 cgd daddr_t *bnp));
265 1.1 cgd #define procfs_strategy ((int (*) __P(( \
266 1.1 cgd struct buf *bp))) procfs_badop)
267 1.1 cgd int procfs_print __P((
268 1.1 cgd struct vnode *vp));
269 1.1 cgd #define procfs_islocked ((int (*) __P(( \
270 1.1 cgd struct vnode *vp))) nullop)
271 1.1 cgd #define procfs_advlock ((int (*) __P(( \
272 1.1 cgd struct vnode *vp, \
273 1.1 cgd caddr_t id, \
274 1.1 cgd int op, \
275 1.1 cgd struct flock *fl, \
276 1.1 cgd int flags))) procfs_badop)
277 1.1 cgd
278 1.1 cgd #endif /* KERNEL */
279