1/*
2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Authors: Nathan Binkert
29 */
30
31#include <unistd.h>
32
33#ifdef __APPLE__
34#include <mach/mach_init.h>
35#include <mach/shared_region.h>
36#include <mach/task.h>
| 1/*
2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Authors: Nathan Binkert
29 */
30
31#include <unistd.h>
32
33#ifdef __APPLE__
34#include <mach/mach_init.h>
35#include <mach/shared_region.h>
36#include <mach/task.h>
|
| 37
|
37#endif
38
| 38#endif
39
|
| 40#include "base/hostinfo.hh"
41
|
39#include <cctype>
40#include <cerrno>
41#include <cmath>
42#include <cstdio>
43#include <cstdlib>
44#include <cstring>
45#include <string>
46
| 42#include <cctype>
43#include <cerrno>
44#include <cmath>
45#include <cstdio>
46#include <cstdlib>
47#include <cstring>
48#include <string>
49
|
47#include "base/hostinfo.hh"
| |
48#include "base/misc.hh"
49#include "base/str.hh"
50#include "base/types.hh"
51
52using namespace std;
53
54string
55__get_hostname()
56{
57 char host[256];
58 if (gethostname(host, sizeof host) == -1)
59 warn("could not get host name!");
60 return host;
61}
62
63string &
64hostname()
65{
66 static string hostname = __get_hostname();
67 return hostname;
68}
69
70uint64_t
71procInfo(const char *filename, const char *target)
72{
73 int done = 0;
74 char line[80];
75 char format[80];
76 long usage;
77
78 FILE *fp = fopen(filename, "r");
79
80 while (fp && !feof(fp) && !done) {
81 if (fgets(line, 80, fp)) {
82 if (startswith(line, target)) {
83 snprintf(format, sizeof(format), "%s %%ld", target);
84 sscanf(line, format, &usage);
85
86 fclose(fp);
87 return usage ;
88 }
89 }
90 }
91
92 if (fp)
93 fclose(fp);
94
95 return 0;
96}
97
98uint64_t
99memUsage()
100{
101// For the Mach-based Darwin kernel, use the task_info of the self task
102#ifdef __APPLE__
103 struct task_basic_info t_info;
104 mach_msg_type_number_t t_info_count = TASK_BASIC_INFO_COUNT;
105
106 if (KERN_SUCCESS != task_info(mach_task_self(),
107 TASK_BASIC_INFO, (task_info_t)&t_info,
108 &t_info_count)) {
109 return 0;
110 }
111
112 // Mimic Darwin's implementation of top and subtract
113 // SHARED_REGION_SIZE from the tasks virtual size to account for the
114 // shared memory submap that is incorporated into every process.
115 return (t_info.virtual_size - SHARED_REGION_SIZE) / 1024;
116#else
117 // Linux implementation
118 return procInfo("/proc/self/status", "VmSize:");
119#endif
120}
| 50#include "base/misc.hh"
51#include "base/str.hh"
52#include "base/types.hh"
53
54using namespace std;
55
56string
57__get_hostname()
58{
59 char host[256];
60 if (gethostname(host, sizeof host) == -1)
61 warn("could not get host name!");
62 return host;
63}
64
65string &
66hostname()
67{
68 static string hostname = __get_hostname();
69 return hostname;
70}
71
72uint64_t
73procInfo(const char *filename, const char *target)
74{
75 int done = 0;
76 char line[80];
77 char format[80];
78 long usage;
79
80 FILE *fp = fopen(filename, "r");
81
82 while (fp && !feof(fp) && !done) {
83 if (fgets(line, 80, fp)) {
84 if (startswith(line, target)) {
85 snprintf(format, sizeof(format), "%s %%ld", target);
86 sscanf(line, format, &usage);
87
88 fclose(fp);
89 return usage ;
90 }
91 }
92 }
93
94 if (fp)
95 fclose(fp);
96
97 return 0;
98}
99
100uint64_t
101memUsage()
102{
103// For the Mach-based Darwin kernel, use the task_info of the self task
104#ifdef __APPLE__
105 struct task_basic_info t_info;
106 mach_msg_type_number_t t_info_count = TASK_BASIC_INFO_COUNT;
107
108 if (KERN_SUCCESS != task_info(mach_task_self(),
109 TASK_BASIC_INFO, (task_info_t)&t_info,
110 &t_info_count)) {
111 return 0;
112 }
113
114 // Mimic Darwin's implementation of top and subtract
115 // SHARED_REGION_SIZE from the tasks virtual size to account for the
116 // shared memory submap that is incorporated into every process.
117 return (t_info.virtual_size - SHARED_REGION_SIZE) / 1024;
118#else
119 // Linux implementation
120 return procInfo("/proc/self/status", "VmSize:");
121#endif
122}
|