b40ce4165d
Note ALL MODULES MUST BE RECOMPILED make the kernel aware that there are smaller units of scheduling than the process. (but only allow one thread per process at this time). This is functionally equivalent to teh previousl -current except that there is a thread associated with each process. Sorry john! (your next MFC will be a doosie!) Reviewed by: peter@freebsd.org, dillon@freebsd.org X-MFC after: ha ha ha ha
158 lines
6.2 KiB
C
158 lines
6.2 KiB
C
/*
|
|
* Copyright (c) 1993 Jan-Simon Pendry
|
|
* Copyright (c) 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Jan-Simon Pendry.
|
|
*
|
|
* 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 University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University 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 REGENTS 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 REGENTS 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.
|
|
*
|
|
* @(#)procfs.h 8.9 (Berkeley) 5/14/95
|
|
*
|
|
* From:
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
/*
|
|
* The different types of node in a procfs filesystem
|
|
*/
|
|
typedef enum {
|
|
Proot, /* the filesystem root */
|
|
Pcurproc, /* symbolic link for curproc */
|
|
Pproc, /* a process-specific sub-directory */
|
|
Pfile, /* the executable file */
|
|
Pmem, /* the process's memory image */
|
|
Pregs, /* the process's register set */
|
|
Pfpregs, /* the process's FP register set */
|
|
Pdbregs, /* the process's debug register set */
|
|
Pctl, /* process control */
|
|
Pstatus, /* process status */
|
|
Pnote, /* process notifier */
|
|
Pnotepg, /* process group notifier */
|
|
Pmap, /* memory map */
|
|
Ptype, /* executable type */
|
|
Pcmdline, /* command line */
|
|
Prlimit /* resource limits */
|
|
} pfstype;
|
|
|
|
/*
|
|
* 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 */
|
|
pfstype pfs_type; /* type of procfs node */
|
|
pid_t pfs_pid; /* associated process */
|
|
u_short pfs_mode; /* mode bits for stat() */
|
|
u_long pfs_flags; /* open flags */
|
|
u_long pfs_fileno; /* unique file id */
|
|
pid_t pfs_lockowner; /* pfs lock owner */
|
|
};
|
|
|
|
#define PROCFS_NOTELEN 64 /* max length of a note (/proc/$pid/note) */
|
|
#define PROCFS_CTLLEN 8 /* max length of a ctl msg (/proc/$pid/ctl */
|
|
#define PROCFS_NAMELEN 8 /* max length of a filename component */
|
|
|
|
/*
|
|
* Kernel stuff follows
|
|
*/
|
|
#ifdef _KERNEL
|
|
#define CNEQ(cnp, s, len) \
|
|
((cnp)->cn_namelen == (len) && \
|
|
(bcmp((s), (cnp)->cn_nameptr, (len)) == 0))
|
|
|
|
#define PROCFS_FILENO(pid, type) \
|
|
(((type) < Pproc) ? \
|
|
((type) + 2) : \
|
|
((((pid)+1) << 4) + ((int) (type))))
|
|
|
|
/*
|
|
* Convert between pfsnode vnode
|
|
*/
|
|
#define VTOPFS(vp) ((struct pfsnode *)(vp)->v_data)
|
|
#define PFSTOV(pfs) ((pfs)->pfs_vnode)
|
|
|
|
typedef struct vfs_namemap vfs_namemap_t;
|
|
struct vfs_namemap {
|
|
const char *nm_name;
|
|
int nm_val;
|
|
};
|
|
|
|
int vfs_getuserstr __P((struct uio *, char *, int *));
|
|
vfs_namemap_t *vfs_findname __P((vfs_namemap_t *, char *, int));
|
|
|
|
/* <machine/reg.h> */
|
|
struct reg;
|
|
struct fpreg;
|
|
struct dbreg;
|
|
|
|
#define PFIND(pid) (pfind(pid))
|
|
|
|
void procfs_exit __P((struct proc *));
|
|
int procfs_freevp __P((struct vnode *));
|
|
int procfs_allocvp __P((struct mount *, struct vnode **, long, pfstype));
|
|
struct vnode *procfs_findtextvp __P((struct proc *));
|
|
int procfs_sstep __P((struct thread *));
|
|
void procfs_fix_sstep __P((struct thread *));
|
|
int procfs_read_regs __P((struct thread *, struct reg *));
|
|
int procfs_write_regs __P((struct thread *, struct reg *));
|
|
int procfs_read_fpregs __P((struct thread *, struct fpreg *));
|
|
int procfs_write_fpregs __P((struct thread *, struct fpreg *));
|
|
int procfs_read_dbregs __P((struct thread *, struct dbreg *));
|
|
int procfs_write_dbregs __P((struct thread *, struct dbreg *));
|
|
int procfs_donote __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_doregs __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_dofpregs __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_dodbregs __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_domem __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_doctl __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_dostatus __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_domap __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_dotype __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_docmdline __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
int procfs_dorlimit __P((struct proc *, struct proc *, struct pfsnode *pfsp, struct uio *uio));
|
|
|
|
/* functions to check whether or not files should be displayed */
|
|
int procfs_validfile __P((struct thread *));
|
|
int procfs_validfpregs __P((struct thread *));
|
|
int procfs_validregs __P((struct thread *));
|
|
int procfs_validdbregs __P((struct thread *));
|
|
int procfs_validmap __P((struct thread *));
|
|
int procfs_validtype __P((struct thread *));
|
|
|
|
#define PROCFS_LOCKED 0x01
|
|
#define PROCFS_WANT 0x02
|
|
|
|
extern vop_t **procfs_vnodeop_p;
|
|
|
|
int procfs_root __P((struct mount *, struct vnode **));
|
|
int procfs_rw __P((struct vop_read_args *));
|
|
#endif /* _KERNEL */
|