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#endif
38
39#include <cctype>
40#include <cerrno>
41#include <cmath>
42#include <cstdio>
43#include <cstdlib>
44#include <cstring>
45#include <string>
46
47#include "base/misc.hh"
48#include "base/str.hh"
49#include "base/types.hh"
50
51using namespace std;
52
53string
54__get_hostname()
55{
56 char host[256];
57 if (gethostname(host, sizeof host) == -1)
58 warn("could not get host name!");
59 return host;
60}
61
62string &
63hostname()
64{
65 static string hostname = __get_hostname();
66 return hostname;
67}
68
69uint64_t
70procInfo(const char *filename, const char *target)
71{
72 int done = 0;
73 char line[80];
74 char format[80];
75 long usage;
76
77 FILE *fp = fopen(filename, "r");
78
79 while (fp && !feof(fp) && !done) {
80 if (fgets(line, 80, fp)) {
81 if (startswith(line, target)) {
82 snprintf(format, sizeof(format), "%s %%ld", target);
83 sscanf(line, format, &usage);
84
85 fclose(fp);
86 return usage ;
87 }
88 }
89 }
90
91 if (fp)
92 fclose(fp);
93
94 return 0;
95}
96
97uint64_t
98memUsage()
99{
100// For the Mach-based Darwin kernel, use the task_info of the self task
101#ifdef __APPLE__
102 struct task_basic_info t_info;
103 mach_msg_type_number_t t_info_count = TASK_BASIC_INFO_COUNT;
104
105 if (KERN_SUCCESS != task_info(mach_task_self(),
106 TASK_BASIC_INFO, (task_info_t)&t_info,
107 &t_info_count)) {
108 return 0;
109 }
110
111 // Mimic Darwin's implementation of top and subtract
112 // SHARED_REGION_SIZE from the tasks virtual size to account for the
113 // shared memory submap that is incorporated into every process.
114 return (t_info.virtual_size - SHARED_REGION_SIZE) / 1024;
115#else
116 // Linux implementation
117 return procInfo("/proc/self/status", "VmSize:");
118#endif
119}