2013-02-12 17:40:24 +01:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2008 The Android Open Source Project
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* * Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
|
|
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
|
|
|
|
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
|
|
|
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
|
|
|
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <pthread.h>
|
|
|
|
|
2014-08-26 02:26:50 +02:00
|
|
|
#include <inttypes.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <sys/resource.h>
|
2014-10-09 23:01:47 +02:00
|
|
|
#include <unistd.h>
|
2014-08-26 02:26:50 +02:00
|
|
|
|
|
|
|
#include "private/bionic_string_utils.h"
|
|
|
|
#include "private/ErrnoRestorer.h"
|
|
|
|
#include "private/libc_logging.h"
|
2013-02-12 17:40:24 +01:00
|
|
|
#include "pthread_internal.h"
|
|
|
|
|
|
|
|
int pthread_attr_init(pthread_attr_t* attr) {
|
2013-02-13 01:36:04 +01:00
|
|
|
attr->flags = 0;
|
|
|
|
attr->stack_base = NULL;
|
2013-09-14 01:34:43 +02:00
|
|
|
attr->stack_size = PTHREAD_STACK_SIZE_DEFAULT;
|
2013-02-13 01:36:04 +01:00
|
|
|
attr->guard_size = PAGE_SIZE;
|
|
|
|
attr->sched_policy = SCHED_NORMAL;
|
|
|
|
attr->sched_priority = 0;
|
2013-02-12 17:40:24 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_attr_destroy(pthread_attr_t* attr) {
|
|
|
|
memset(attr, 0x42, sizeof(pthread_attr_t));
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_attr_setdetachstate(pthread_attr_t* attr, int state) {
|
|
|
|
if (state == PTHREAD_CREATE_DETACHED) {
|
|
|
|
attr->flags |= PTHREAD_ATTR_FLAG_DETACHED;
|
|
|
|
} else if (state == PTHREAD_CREATE_JOINABLE) {
|
|
|
|
attr->flags &= ~PTHREAD_ATTR_FLAG_DETACHED;
|
|
|
|
} else {
|
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-10-30 22:40:09 +01:00
|
|
|
int pthread_attr_getdetachstate(const pthread_attr_t* attr, int* state) {
|
2013-02-12 17:40:24 +01:00
|
|
|
*state = (attr->flags & PTHREAD_ATTR_FLAG_DETACHED) ? PTHREAD_CREATE_DETACHED : PTHREAD_CREATE_JOINABLE;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_attr_setschedpolicy(pthread_attr_t* attr, int policy) {
|
|
|
|
attr->sched_policy = policy;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-10-30 22:40:09 +01:00
|
|
|
int pthread_attr_getschedpolicy(const pthread_attr_t* attr, int* policy) {
|
2013-02-12 17:40:24 +01:00
|
|
|
*policy = attr->sched_policy;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-10-30 22:40:09 +01:00
|
|
|
int pthread_attr_setschedparam(pthread_attr_t* attr, const sched_param* param) {
|
2013-02-12 17:40:24 +01:00
|
|
|
attr->sched_priority = param->sched_priority;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-10-30 22:40:09 +01:00
|
|
|
int pthread_attr_getschedparam(const pthread_attr_t* attr, sched_param* param) {
|
2013-02-12 17:40:24 +01:00
|
|
|
param->sched_priority = attr->sched_priority;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_attr_setstacksize(pthread_attr_t* attr, size_t stack_size) {
|
2013-07-15 23:51:07 +02:00
|
|
|
if (stack_size < PTHREAD_STACK_MIN) {
|
2013-02-12 17:40:24 +01:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
attr->stack_size = stack_size;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-10-30 22:40:09 +01:00
|
|
|
int pthread_attr_getstacksize(const pthread_attr_t* attr, size_t* stack_size) {
|
2014-08-26 02:26:50 +02:00
|
|
|
void* unused;
|
|
|
|
return pthread_attr_getstack(attr, &unused, stack_size);
|
2013-02-12 17:40:24 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_attr_setstack(pthread_attr_t* attr, void* stack_base, size_t stack_size) {
|
|
|
|
if ((stack_size & (PAGE_SIZE - 1) || stack_size < PTHREAD_STACK_MIN)) {
|
|
|
|
return EINVAL;
|
|
|
|
}
|
2013-10-02 02:25:28 +02:00
|
|
|
if (reinterpret_cast<uintptr_t>(stack_base) & (PAGE_SIZE - 1)) {
|
2013-02-12 17:40:24 +01:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
attr->stack_base = stack_base;
|
|
|
|
attr->stack_size = stack_size;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-09-11 07:31:36 +02:00
|
|
|
static uintptr_t __get_main_stack_startstack() {
|
|
|
|
FILE* fp = fopen("/proc/self/stat", "re");
|
|
|
|
if (fp == nullptr) {
|
|
|
|
__libc_fatal("couldn't open /proc/self/stat: %s", strerror(errno));
|
|
|
|
}
|
|
|
|
|
|
|
|
char line[BUFSIZ];
|
|
|
|
if (fgets(line, sizeof(line), fp) == nullptr) {
|
|
|
|
__libc_fatal("couldn't read /proc/self/stat: %s", strerror(errno));
|
|
|
|
}
|
|
|
|
|
|
|
|
fclose(fp);
|
|
|
|
|
|
|
|
// See man 5 proc. There's no reason comm can't contain ' ' or ')',
|
|
|
|
// so we search backwards for the end of it. We're looking for this field:
|
|
|
|
//
|
|
|
|
// startstack %lu (28) The address of the start (i.e., bottom) of the stack.
|
|
|
|
uintptr_t startstack = 0;
|
|
|
|
const char* end_of_comm = strrchr(line, ')');
|
|
|
|
if (sscanf(end_of_comm + 1, " %*c "
|
|
|
|
"%*d %*d %*d %*d %*d "
|
|
|
|
"%*u %*u %*u %*u %*u %*u %*u "
|
|
|
|
"%*d %*d %*d %*d %*d %*d "
|
|
|
|
"%*u %*u %*d %*u %*u %*u %" SCNuPTR, &startstack) != 1) {
|
|
|
|
__libc_fatal("couldn't parse /proc/self/stat");
|
|
|
|
}
|
|
|
|
|
|
|
|
return startstack;
|
|
|
|
}
|
|
|
|
|
2014-08-26 02:26:50 +02:00
|
|
|
static int __pthread_attr_getstack_main_thread(void** stack_base, size_t* stack_size) {
|
|
|
|
ErrnoRestorer errno_restorer;
|
|
|
|
|
2014-08-28 00:32:01 +02:00
|
|
|
rlimit stack_limit;
|
|
|
|
if (getrlimit(RLIMIT_STACK, &stack_limit) == -1) {
|
|
|
|
return errno;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the current RLIMIT_STACK is RLIM_INFINITY, only admit to an 8MiB stack for sanity's sake.
|
|
|
|
if (stack_limit.rlim_cur == RLIM_INFINITY) {
|
|
|
|
stack_limit.rlim_cur = 8 * 1024 * 1024;
|
|
|
|
}
|
|
|
|
|
2015-09-11 07:31:36 +02:00
|
|
|
// Ask the kernel where our main thread's stack started.
|
|
|
|
uintptr_t startstack = __get_main_stack_startstack();
|
|
|
|
|
|
|
|
// Hunt for the region that contains that address.
|
|
|
|
FILE* fp = fopen("/proc/self/maps", "re");
|
|
|
|
if (fp == nullptr) {
|
|
|
|
__libc_fatal("couldn't open /proc/self/maps");
|
2014-08-26 02:26:50 +02:00
|
|
|
}
|
|
|
|
char line[BUFSIZ];
|
|
|
|
while (fgets(line, sizeof(line), fp) != NULL) {
|
2015-09-11 07:31:36 +02:00
|
|
|
uintptr_t lo, hi;
|
|
|
|
if (sscanf(line, "%" SCNxPTR "-%" SCNxPTR, &lo, &hi) == 2) {
|
|
|
|
if (lo <= startstack && startstack <= hi) {
|
2014-08-28 00:32:01 +02:00
|
|
|
*stack_size = stack_limit.rlim_cur;
|
|
|
|
*stack_base = reinterpret_cast<void*>(hi - *stack_size);
|
2014-08-26 02:26:50 +02:00
|
|
|
fclose(fp);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2015-09-11 07:31:36 +02:00
|
|
|
__libc_fatal("Stack not found in /proc/self/maps");
|
2014-08-26 02:26:50 +02:00
|
|
|
}
|
|
|
|
|
2013-10-30 22:40:09 +01:00
|
|
|
int pthread_attr_getstack(const pthread_attr_t* attr, void** stack_base, size_t* stack_size) {
|
2013-02-12 17:40:24 +01:00
|
|
|
*stack_base = attr->stack_base;
|
|
|
|
*stack_size = attr->stack_size;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_attr_setguardsize(pthread_attr_t* attr, size_t guard_size) {
|
|
|
|
attr->guard_size = guard_size;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-10-30 22:40:09 +01:00
|
|
|
int pthread_attr_getguardsize(const pthread_attr_t* attr, size_t* guard_size) {
|
2013-02-12 17:40:24 +01:00
|
|
|
*guard_size = attr->guard_size;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-08-26 02:26:50 +02:00
|
|
|
int pthread_getattr_np(pthread_t t, pthread_attr_t* attr) {
|
2015-03-06 22:48:58 +01:00
|
|
|
pthread_internal_t* thread = reinterpret_cast<pthread_internal_t*>(t);
|
|
|
|
*attr = thread->attr;
|
2015-03-07 02:23:53 +01:00
|
|
|
// We prefer reading join_state here to setting thread->attr.flags in pthread_detach.
|
|
|
|
// Because data race exists in the latter case.
|
|
|
|
if (atomic_load(&thread->join_state) == THREAD_DETACHED) {
|
|
|
|
attr->flags |= PTHREAD_ATTR_FLAG_DETACHED;
|
|
|
|
}
|
2015-03-06 22:48:58 +01:00
|
|
|
// The main thread's stack information is not stored in thread->attr, and we need to
|
|
|
|
// collect that at runtime.
|
|
|
|
if (thread->tid == getpid()) {
|
|
|
|
return __pthread_attr_getstack_main_thread(&attr->stack_base, &attr->stack_size);
|
|
|
|
}
|
2013-02-12 17:40:24 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-10-30 22:40:09 +01:00
|
|
|
int pthread_attr_setscope(pthread_attr_t*, int scope) {
|
2013-02-12 17:40:24 +01:00
|
|
|
if (scope == PTHREAD_SCOPE_SYSTEM) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (scope == PTHREAD_SCOPE_PROCESS) {
|
|
|
|
return ENOTSUP;
|
|
|
|
}
|
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
2013-10-30 22:40:09 +01:00
|
|
|
int pthread_attr_getscope(const pthread_attr_t*, int* scope) {
|
|
|
|
*scope = PTHREAD_SCOPE_SYSTEM;
|
|
|
|
return 0;
|
2013-02-12 17:40:24 +01:00
|
|
|
}
|