1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
/**************************************************************************
*
* Copyright 2010-2011 VMware, Inc.
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*
**************************************************************************/
#include <assert.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/time.h>
#include <pthread.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <signal.h>
#ifdef __APPLE__
#include <mach-o/dyld.h>
#endif
#include "os.hpp"
namespace OS {
static pthread_mutex_t
mutex = PTHREAD_MUTEX_INITIALIZER;
void
AcquireMutex(void)
{
pthread_mutex_lock(&mutex);
}
void
ReleaseMutex(void)
{
pthread_mutex_unlock(&mutex);
}
bool
GetProcessName(char *str, size_t size)
{
char szProcessPath[PATH_MAX + 1];
char *lpProcessName;
// http://stackoverflow.com/questions/1023306/finding-current-executables-path-without-proc-self-exe
#ifdef __APPLE__
uint32_t len = sizeof szProcessPath;
if (_NSGetExecutablePath(szProcessPath, &len) != 0) {
*str = 0;
return false;
}
#else
ssize_t len;
len = readlink("/proc/self/exe", szProcessPath, sizeof(szProcessPath) - 1);
if (len == -1) {
// /proc/self/exe is not available on setuid processes, so fallback to
// /proc/self/cmdline.
int fd = open("/proc/self/cmdline", O_RDONLY);
if (fd >= 0) {
len = read(fd, szProcessPath, sizeof(szProcessPath) - 1);
close(fd);
}
}
if (len <= 0) {
snprintf(str, size, "%i", (int)getpid());
return true;
}
#endif
szProcessPath[len] = 0;
lpProcessName = strrchr(szProcessPath, '/');
lpProcessName = lpProcessName ? lpProcessName + 1 : szProcessPath;
strncpy(str, lpProcessName, size);
if (size)
str[size - 1] = 0;
return true;
}
bool
GetCurrentDir(char *str, size_t size)
{
char *ret;
ret = getcwd(str, size);
str[size - 1] = 0;
return ret ? true : false;
}
void
DebugMessage(const char *format, ...)
{
va_list ap;
va_start(ap, format);
fflush(stdout);
vfprintf(stderr, format, ap);
va_end(ap);
}
long long GetTime(void)
{
struct timeval tv;
gettimeofday(&tv, NULL);
return tv.tv_usec + tv.tv_sec*1000000LL;
}
void
Abort(void)
{
exit(0);
}
static void (*gCallback)(void) = NULL;
#define NUM_SIGNALS 16
struct sigaction old_actions[NUM_SIGNALS];
/*
* See also:
* - http://sourceware.org/git/?p=glibc.git;a=blob;f=debug/segfault.c
* - http://ggi.cvs.sourceforge.net/viewvc/ggi/ggi-core/libgg/gg/cleanup.c?view=markup
*/
static void signal_handler(int sig, siginfo_t *info, void *context)
{
static int recursion_count = 0;
fprintf(stderr, "signal_handler: sig = %i\n", sig);
if (recursion_count) {
fprintf(stderr, "recursion with sig %i\n", sig);
} else {
if (gCallback) {
++recursion_count;
gCallback();
--recursion_count;
}
}
struct sigaction *old_action;
if (sig >= NUM_SIGNALS) {
/* This should never happen */
fprintf(stderr, "Unexpected signal %i\n", sig);
raise(SIGKILL);
}
old_action = &old_actions[sig];
if (old_action->sa_flags & SA_SIGINFO) {
// Handler is in sa_sigaction
old_action->sa_sigaction(sig, info, context);
} else {
if (old_action->sa_handler == SIG_DFL) {
fprintf(stderr, "taking default action for signal %i\n", sig);
#if 1
struct sigaction dfl_action;
dfl_action.sa_handler = SIG_DFL;
sigemptyset (&dfl_action.sa_mask);
dfl_action.sa_flags = 0;
sigaction(sig, &dfl_action, NULL);
raise(sig);
#else
raise(SIGKILL);
#endif
} else if (old_action->sa_handler == SIG_IGN) {
/* ignore */
} else {
/* dispatch to handler */
old_action->sa_handler(sig);
}
}
}
void
SetExceptionCallback(void (*callback)(void))
{
assert(!gCallback);
if (!gCallback) {
gCallback = callback;
struct sigaction new_action;
new_action.sa_sigaction = signal_handler;
sigemptyset(&new_action.sa_mask);
new_action.sa_flags = SA_SIGINFO | SA_RESTART;
for (int sig = 1; sig < NUM_SIGNALS; ++sig) {
// SIGKILL and SIGSTOP can't be handled
if (sig != SIGKILL && sig != SIGSTOP) {
if (sigaction(sig, NULL, &old_actions[sig]) >= 0) {
sigaction(sig, &new_action, NULL);
}
}
}
}
}
void
ResetExceptionCallback(void)
{
gCallback = NULL;
}
} /* namespace OS */
|
