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
|
/* $OpenBSD: rthread_np.c,v 1.12 2014/07/01 03:32:18 guenther Exp $ */
/*
* Copyright (c) 2004,2005 Ted Unangst <tedu@openbsd.org>
* Copyright (c) 2005 Otto Moerbeek <otto@openbsd.org>
* All Rights Reserved.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/param.h>
#include <sys/time.h>
#include <sys/lock.h>
#include <sys/resource.h>
#include <sys/queue.h>
#include <sys/sysctl.h>
#include <inttypes.h>
#include <errno.h>
#include <pthread.h>
#include <pthread_np.h>
#include <stddef.h>
#include <string.h>
#include <unistd.h>
#include <uvm/uvm_extern.h>
#include <machine/spinlock.h>
#include "rthread.h"
void
pthread_set_name_np(pthread_t thread, const char *name)
{
strlcpy(thread->name, name, sizeof(thread->name));
}
int
pthread_main_np(void)
{
return (!_threads_ready || (pthread_self()->flags & THREAD_ORIGINAL)
? 1 : 0);
}
/*
* Return stack info from the given thread. Based upon the solaris
* thr_stksegment function. Note that the returned ss_sp member is the
* *top* of the allocated stack area, unlike in sigaltstack() where
* it's the bottom. You'll have to ask Sun what they were thinking...
*
* This function taken from the uthread library, with the following
* license:
* PUBLIC DOMAIN: No Rights Reserved. Marco S Hyman <marc@snafu.org> */
int
pthread_stackseg_np(pthread_t thread, stack_t *sinfo)
{
if (thread->stack) {
#ifdef MACHINE_STACK_GROWS_UP
sinfo->ss_sp = thread->stack->base;
#else
sinfo->ss_sp = thread->stack->base + thread->stack->len;
#endif
sinfo->ss_size = thread->stack->len;
if (thread->stack->guardsize != 1)
sinfo->ss_size -= thread->stack->guardsize;
sinfo->ss_flags = 0;
return (0);
} else if (thread->flags & THREAD_INITIAL_STACK) {
static struct _ps_strings _ps;
static struct rlimit rl;
static int gotself;
if (gotself == 0) {
int mib[2];
size_t len;
if (getrlimit(RLIMIT_STACK, &rl) != 0)
return (EAGAIN);
mib[0] = CTL_VM;
mib[1] = VM_PSSTRINGS;
len = sizeof(_ps);
if (sysctl(mib, 2, &_ps, &len, NULL, 0) != 0)
return (EAGAIN);
gotself = 1;
}
/*
* Provides a rough estimation of stack bounds. Caller
* likely wants to know for the purpose of inspecting call
* frames, but VM_PSSTRINGS points to process arguments...
*/
#ifdef MACHINE_STACK_GROWS_UP
sinfo->ss_sp = _ps.val;
#else
sinfo->ss_sp = (void *)ROUND_TO_PAGE((uintptr_t)_ps.val);
#endif
sinfo->ss_size = (size_t)rl.rlim_cur;
sinfo->ss_flags = 0;
return (0);
}
return (EAGAIN);
}
|
