|
|
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * The contents of this file constitute Original Code as defined in and
7: * are subject to the Apple Public Source License Version 1.1 (the
8: * "License"). You may not use this file except in compliance with the
9: * License. Please obtain a copy of the License at
10: * http://www.apple.com/publicsource and read it before using this file.
11: *
12: * This Original Code and all software distributed under the License are
13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17: * License for the specific language governing rights and limitations
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /*-
23: * Copyright (c) 1989, 1993
24: * The Regents of the University of California. All rights reserved.
25: *
26: * Redistribution and use in source and binary forms, with or without
27: * modification, are permitted provided that the following conditions
28: * are met:
29: * 1. Redistributions of source code must retain the above copyright
30: * notice, this list of conditions and the following disclaimer.
31: * 2. Redistributions in binary form must reproduce the above copyright
32: * notice, this list of conditions and the following disclaimer in the
33: * documentation and/or other materials provided with the distribution.
34: * 3. All advertising materials mentioning features or use of this software
35: * must display the following acknowledgement:
36: * This product includes software developed by the University of
37: * California, Berkeley and its contributors.
38: * 4. Neither the name of the University nor the names of its contributors
39: * may be used to endorse or promote products derived from this software
40: * without specific prior written permission.
41: *
42: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
43: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
44: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
45: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
46: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
47: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
48: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
49: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
50: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
51: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52: * SUCH DAMAGE.
53: *
54: * @(#)kvm.h 8.1 (Berkeley) 6/2/93
55: */
56:
57: #ifndef _KVM_H_
58: #define _KVM_H_
59:
60: /* Default version symbol. */
61: #define VRS_SYM "_version"
62: #define VRS_KEY "VERSION"
63:
64: #include <nlist.h>
65: #include <sys/cdefs.h>
66:
67: __BEGIN_DECLS
68:
69: typedef struct __kvm kvm_t;
70:
71: struct kinfo_proc;
72: int kvm_close __P((kvm_t *));
73: char **kvm_getargv __P((kvm_t *, const struct kinfo_proc *, int));
74: char **kvm_getenvv __P((kvm_t *, const struct kinfo_proc *, int));
75: char *kvm_geterr __P((kvm_t *));
76: int kvm_getloadavg __P((kvm_t *, double [], int));
77: char *kvm_getfiles __P((kvm_t *, int, int, int *));
78: struct kinfo_proc *
79: kvm_getprocs __P((kvm_t *, int, int, int *));
80: int kvm_nlist __P((kvm_t *, struct nlist *));
81: kvm_t *kvm_open
82: __P((const char *, const char *, const char *, int, const char *));
83: kvm_t *kvm_openfiles
84: __P((const char *, const char *, const char *, int, char *));
85: int kvm_read __P((kvm_t *, unsigned long, void *, unsigned int));
86: int kvm_write __P((kvm_t *, unsigned long, const void *, unsigned int));
87:
88: __END_DECLS
89:
90: #endif /* !_KVM_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.