procfs.h revision 1.48 1 1.48 agc /* $NetBSD: procfs.h,v 1.48 2003/08/07 16:32:41 agc Exp $ */
2 1.11 cgd
3 1.1 cgd /*
4 1.9 mycroft * Copyright (c) 1993
5 1.9 mycroft * The Regents of the University of California. All rights reserved.
6 1.48 agc *
7 1.48 agc * This code is derived from software contributed to Berkeley by
8 1.48 agc * Jan-Simon Pendry.
9 1.48 agc *
10 1.48 agc * Redistribution and use in source and binary forms, with or without
11 1.48 agc * modification, are permitted provided that the following conditions
12 1.48 agc * are met:
13 1.48 agc * 1. Redistributions of source code must retain the above copyright
14 1.48 agc * notice, this list of conditions and the following disclaimer.
15 1.48 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.48 agc * notice, this list of conditions and the following disclaimer in the
17 1.48 agc * documentation and/or other materials provided with the distribution.
18 1.48 agc * 3. Neither the name of the University nor the names of its contributors
19 1.48 agc * may be used to endorse or promote products derived from this software
20 1.48 agc * without specific prior written permission.
21 1.48 agc *
22 1.48 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.48 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.48 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.48 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.48 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.48 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.48 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.48 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.48 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.48 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.48 agc * SUCH DAMAGE.
33 1.48 agc *
34 1.48 agc * @(#)procfs.h 8.9 (Berkeley) 5/14/95
35 1.48 agc */
36 1.48 agc
37 1.48 agc /*
38 1.48 agc * Copyright (c) 1993 Jan-Simon Pendry
39 1.1 cgd *
40 1.1 cgd * This code is derived from software contributed to Berkeley by
41 1.1 cgd * Jan-Simon Pendry.
42 1.1 cgd *
43 1.1 cgd * Redistribution and use in source and binary forms, with or without
44 1.1 cgd * modification, are permitted provided that the following conditions
45 1.1 cgd * are met:
46 1.1 cgd * 1. Redistributions of source code must retain the above copyright
47 1.1 cgd * notice, this list of conditions and the following disclaimer.
48 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
49 1.1 cgd * notice, this list of conditions and the following disclaimer in the
50 1.1 cgd * documentation and/or other materials provided with the distribution.
51 1.1 cgd * 3. All advertising materials mentioning features or use of this software
52 1.1 cgd * must display the following acknowledgement:
53 1.1 cgd * This product includes software developed by the University of
54 1.1 cgd * California, Berkeley and its contributors.
55 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
56 1.1 cgd * may be used to endorse or promote products derived from this software
57 1.1 cgd * without specific prior written permission.
58 1.1 cgd *
59 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 1.1 cgd * SUCH DAMAGE.
70 1.1 cgd *
71 1.21 fvdl * @(#)procfs.h 8.9 (Berkeley) 5/14/95
72 1.1 cgd */
73 1.1 cgd
74 1.36 thorpej /* This also pulls in __HAVE_PROCFS_MACHDEP */
75 1.36 thorpej #include <sys/ptrace.h>
76 1.36 thorpej
77 1.1 cgd /*
78 1.1 cgd * The different types of node in a procfs filesystem
79 1.1 cgd */
80 1.1 cgd typedef enum {
81 1.1 cgd Proot, /* the filesystem root */
82 1.9 mycroft Pcurproc, /* symbolic link for curproc */
83 1.27 thorpej Pself, /* like curproc, but this is the Linux name */
84 1.1 cgd Pproc, /* a process-specific sub-directory */
85 1.1 cgd Pfile, /* the executable file */
86 1.1 cgd Pmem, /* the process's memory image */
87 1.1 cgd Pregs, /* the process's register set */
88 1.9 mycroft Pfpregs, /* the process's FP register set */
89 1.1 cgd Pctl, /* process control */
90 1.44 christos Pstat, /* process status (if -o linux) */
91 1.1 cgd Pstatus, /* process status */
92 1.1 cgd Pnote, /* process notifier */
93 1.23 msaitoh Pnotepg, /* process group notifier */
94 1.24 christos Pmap, /* memory map */
95 1.31 fvdl Pcmdline, /* process command line args */
96 1.31 fvdl Pmeminfo, /* system memory info (if -o linux) */
97 1.34 fvdl Pcpuinfo, /* CPU info (if -o linux) */
98 1.34 fvdl Pmaps, /* memory map, Linux style (if -o linux) */
99 1.39 christos Pfd, /* a directory containing the processes open fd's */
100 1.41 jrf Puptime, /* elapsed time since (if -o linux) */
101 1.36 thorpej #ifdef __HAVE_PROCFS_MACHDEP
102 1.36 thorpej PROCFS_MACHDEP_NODE_TYPES
103 1.36 thorpej #endif
104 1.1 cgd } pfstype;
105 1.1 cgd
106 1.1 cgd /*
107 1.1 cgd * control data for the proc file system.
108 1.1 cgd */
109 1.1 cgd struct pfsnode {
110 1.28 fvdl LIST_ENTRY(pfsnode) pfs_hash; /* hash chain */
111 1.1 cgd struct vnode *pfs_vnode; /* vnode associated with this pfsnode */
112 1.1 cgd pfstype pfs_type; /* type of procfs node */
113 1.1 cgd pid_t pfs_pid; /* associated process */
114 1.39 christos int pfs_fd; /* associated fd if not -1 */
115 1.18 mycroft mode_t pfs_mode; /* mode bits for stat() */
116 1.1 cgd u_long pfs_flags; /* open flags */
117 1.1 cgd u_long pfs_fileno; /* unique file id */
118 1.1 cgd };
119 1.1 cgd
120 1.9 mycroft #define PROCFS_NOTELEN 64 /* max length of a note (/proc/$pid/note) */
121 1.1 cgd #define PROCFS_CTLLEN 8 /* max length of a ctl msg (/proc/$pid/ctl */
122 1.1 cgd
123 1.31 fvdl struct procfs_args {
124 1.31 fvdl int version;
125 1.31 fvdl int flags;
126 1.31 fvdl };
127 1.31 fvdl
128 1.31 fvdl #define PROCFS_ARGSVERSION 1
129 1.31 fvdl
130 1.31 fvdl #define PROCFSMNT_LINUXCOMPAT 0x01
131 1.38 christos
132 1.38 christos #define PROCFSMNT_BITS "\177\20" \
133 1.38 christos "b\00linuxcompat"
134 1.31 fvdl
135 1.1 cgd /*
136 1.1 cgd * Kernel stuff follows
137 1.1 cgd */
138 1.13 briggs #ifdef _KERNEL
139 1.9 mycroft #define CNEQ(cnp, s, len) \
140 1.9 mycroft ((cnp)->cn_namelen == (len) && \
141 1.22 perry (memcmp((s), (cnp)->cn_nameptr, (len)) == 0))
142 1.1 cgd
143 1.14 mycroft #define UIO_MX 32
144 1.14 mycroft
145 1.39 christos #define PROCFS_FILENO(pid, type, fd) \
146 1.39 christos (((type) < Pproc) ? ((type) + 2) : \
147 1.43 jdolecek (((fd) == -1) ? ((((pid)+1) << 5) + ((int) (type))) : \
148 1.43 jdolecek ((((pid)+1) << 16) | ((fd) << 5) | ((int) (type)))))
149 1.1 cgd
150 1.28 fvdl struct procfsmount {
151 1.28 fvdl void *pmnt_exechook;
152 1.31 fvdl int pmnt_flags;
153 1.28 fvdl };
154 1.28 fvdl
155 1.28 fvdl #define VFSTOPROC(mp) ((struct procfsmount *)(mp)->mnt_data)
156 1.28 fvdl
157 1.1 cgd /*
158 1.1 cgd * Convert between pfsnode vnode
159 1.1 cgd */
160 1.1 cgd #define VTOPFS(vp) ((struct pfsnode *)(vp)->v_data)
161 1.1 cgd #define PFSTOV(pfs) ((pfs)->pfs_vnode)
162 1.1 cgd
163 1.9 mycroft typedef struct vfs_namemap vfs_namemap_t;
164 1.9 mycroft struct vfs_namemap {
165 1.1 cgd const char *nm_name;
166 1.1 cgd int nm_val;
167 1.1 cgd };
168 1.1 cgd
169 1.9 mycroft int vfs_getuserstr __P((struct uio *, char *, int *));
170 1.32 jdolecek const vfs_namemap_t *vfs_findname __P((const vfs_namemap_t *, const char *, int));
171 1.1 cgd
172 1.1 cgd #define PFIND(pid) ((pid) ? pfind(pid) : &proc0)
173 1.9 mycroft int procfs_freevp __P((struct vnode *));
174 1.39 christos int procfs_allocvp __P((struct mount *, struct vnode **, pid_t, pfstype, int));
175 1.47 fvdl int procfs_donote __P((struct proc *, struct proc *, struct pfsnode *,
176 1.24 christos struct uio *));
177 1.47 fvdl int procfs_doregs __P((struct proc *, struct lwp *, struct pfsnode *,
178 1.24 christos struct uio *));
179 1.47 fvdl int procfs_dofpregs __P((struct proc *, struct lwp *, struct pfsnode *,
180 1.24 christos struct uio *));
181 1.47 fvdl int procfs_domem __P((struct proc *, struct proc *, struct pfsnode *,
182 1.24 christos struct uio *));
183 1.47 fvdl int procfs_doctl __P((struct proc *, struct lwp *, struct pfsnode *,
184 1.44 christos struct uio *));
185 1.47 fvdl int procfs_do_pid_stat __P((struct proc *, struct lwp *, struct pfsnode *,
186 1.24 christos struct uio *));
187 1.47 fvdl int procfs_dostatus __P((struct proc *, struct lwp *, struct pfsnode *,
188 1.24 christos struct uio *));
189 1.47 fvdl int procfs_domap __P((struct proc *, struct proc *, struct pfsnode *,
190 1.34 fvdl struct uio *, int));
191 1.47 fvdl int procfs_docmdline __P((struct proc *, struct proc *, struct pfsnode *,
192 1.24 christos struct uio *));
193 1.47 fvdl int procfs_domeminfo __P((struct proc *, struct proc *, struct pfsnode *,
194 1.31 fvdl struct uio *));
195 1.47 fvdl int procfs_docpuinfo __P((struct proc *, struct proc *, struct pfsnode *,
196 1.31 fvdl struct uio *));
197 1.47 fvdl int procfs_dofd __P((struct proc *, struct proc *, struct pfsnode *,
198 1.41 jrf struct uio *));
199 1.47 fvdl int procfs_douptime __P((struct proc *, struct proc *, struct pfsnode *,
200 1.39 christos struct uio *));
201 1.19 thorpej
202 1.47 fvdl void procfs_revoke_vnodes __P((struct proc *, void *));
203 1.28 fvdl void procfs_hashinit __P((void));
204 1.35 chs void procfs_hashreinit __P((void));
205 1.29 jdolecek void procfs_hashdone __P((void));
206 1.42 jdolecek int procfs_getfp __P((struct pfsnode *, struct proc **, struct file **));
207 1.8 cgd
208 1.8 cgd /* functions to check whether or not files should be displayed */
209 1.47 fvdl int procfs_validfile __P((struct proc *, struct mount *));
210 1.47 fvdl int procfs_validfpregs __P((struct proc *, struct mount *));
211 1.47 fvdl int procfs_validregs __P((struct proc *, struct mount *));
212 1.47 fvdl int procfs_validmap __P((struct proc *, struct mount *));
213 1.17 christos
214 1.17 christos int procfs_rw __P((void *));
215 1.31 fvdl
216 1.31 fvdl int procfs_getcpuinfstr __P((char *, int *));
217 1.1 cgd
218 1.1 cgd #define PROCFS_LOCKED 0x01
219 1.1 cgd #define PROCFS_WANT 0x02
220 1.1 cgd
221 1.16 christos extern int (**procfs_vnodeop_p) __P((void *));
222 1.1 cgd extern struct vfsops procfs_vfsops;
223 1.1 cgd
224 1.46 thorpej int procfs_root __P((struct mount *, struct vnode **));
225 1.36 thorpej
226 1.36 thorpej #ifdef __HAVE_PROCFS_MACHDEP
227 1.36 thorpej struct vattr;
228 1.36 thorpej
229 1.36 thorpej void procfs_machdep_allocvp(struct vnode *);
230 1.47 fvdl int procfs_machdep_rw(struct proc *, struct lwp *, struct pfsnode *,
231 1.36 thorpej struct uio *);
232 1.36 thorpej int procfs_machdep_getattr(struct vnode *, struct vattr *, struct proc *);
233 1.36 thorpej #endif
234 1.16 christos
235 1.13 briggs #endif /* _KERNEL */
236