2012-01-20 16:17:08 +00:00
|
|
|
// Copyright 2012 the V8 project authors. All rights reserved.
|
2008-11-21 10:06:29 +00:00
|
|
|
// 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.
|
|
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived
|
|
|
|
// from this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// 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.
|
|
|
|
|
2009-03-24 06:32:00 +00:00
|
|
|
// Platform specific code for FreeBSD goes here. For the POSIX comaptible parts
|
|
|
|
// the implementation is in platform-posix.cc.
|
2008-11-21 10:06:29 +00:00
|
|
|
|
|
|
|
#include <pthread.h>
|
|
|
|
#include <semaphore.h>
|
|
|
|
#include <signal.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/resource.h>
|
2009-02-24 13:32:01 +00:00
|
|
|
#include <sys/types.h>
|
2008-11-21 10:06:29 +00:00
|
|
|
#include <sys/ucontext.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
#include <sys/types.h> // mmap & munmap
|
|
|
|
#include <sys/mman.h> // mmap & munmap
|
|
|
|
#include <sys/stat.h> // open
|
|
|
|
#include <sys/fcntl.h> // open
|
|
|
|
#include <unistd.h> // getpagesize
|
2011-03-16 11:15:43 +00:00
|
|
|
// If you don't have execinfo.h then you need devel/libexecinfo from ports.
|
2008-11-21 10:06:29 +00:00
|
|
|
#include <execinfo.h> // backtrace, backtrace_symbols
|
|
|
|
#include <strings.h> // index
|
|
|
|
#include <errno.h>
|
|
|
|
#include <stdarg.h>
|
|
|
|
#include <limits.h>
|
|
|
|
|
|
|
|
#undef MAP_TYPE
|
|
|
|
|
|
|
|
#include "v8.h"
|
2011-05-08 14:50:09 +00:00
|
|
|
#include "v8threads.h"
|
2008-11-21 10:06:29 +00:00
|
|
|
|
2012-03-30 14:30:46 +00:00
|
|
|
#include "platform-posix.h"
|
2008-11-21 10:06:29 +00:00
|
|
|
#include "platform.h"
|
2010-12-07 11:31:57 +00:00
|
|
|
#include "vm-state-inl.h"
|
2008-11-21 10:06:29 +00:00
|
|
|
|
|
|
|
|
2009-05-25 10:05:56 +00:00
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
2008-11-21 10:06:29 +00:00
|
|
|
|
|
|
|
// 0 is never a valid thread id on FreeBSD since tids and pids share a
|
|
|
|
// name space and pid 0 is used to kill the group (see man 2 kill).
|
|
|
|
static const pthread_t kNoThread = (pthread_t) 0;
|
|
|
|
|
|
|
|
|
|
|
|
double ceiling(double x) {
|
|
|
|
// Correct as on OS X
|
|
|
|
if (-1.0 < x && x < 0.0) {
|
|
|
|
return -0.0;
|
|
|
|
} else {
|
|
|
|
return ceil(x);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-03-29 06:18:16 +00:00
|
|
|
static Mutex* limit_mutex = NULL;
|
|
|
|
|
|
|
|
|
2012-03-30 14:30:46 +00:00
|
|
|
void OS::PostSetUp() {
|
2012-04-05 14:10:39 +00:00
|
|
|
POSIXPostSetUp();
|
2012-03-30 14:30:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-05-27 06:38:53 +00:00
|
|
|
void OS::ReleaseStore(volatile AtomicWord* ptr, AtomicWord value) {
|
|
|
|
__asm__ __volatile__("" : : : "memory");
|
|
|
|
*ptr = value;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-11-13 12:32:57 +00:00
|
|
|
uint64_t OS::CpuFeaturesImpliedByPlatform() {
|
|
|
|
return 0; // FreeBSD runs on anything.
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
int OS::ActivationFrameAlignment() {
|
|
|
|
// 16 byte alignment on FreeBSD
|
|
|
|
return 16;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-01-25 12:37:31 +00:00
|
|
|
const char* OS::LocalTimezone(double time) {
|
2013-04-19 13:26:47 +00:00
|
|
|
if (std::isnan(time)) return "";
|
2010-01-25 12:37:31 +00:00
|
|
|
time_t tv = static_cast<time_t>(floor(time/msPerSecond));
|
|
|
|
struct tm* t = localtime(&tv);
|
|
|
|
if (NULL == t) return "";
|
|
|
|
return t->tm_zone;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
double OS::LocalTimeOffset() {
|
|
|
|
time_t tv = time(NULL);
|
|
|
|
struct tm* t = localtime(&tv);
|
|
|
|
// tm_gmtoff includes any daylight savings offset, so subtract it.
|
|
|
|
return static_cast<double>(t->tm_gmtoff * msPerSecond -
|
|
|
|
(t->tm_isdst > 0 ? 3600 * msPerSecond : 0));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
// We keep the lowest and highest addresses mapped as a quick way of
|
|
|
|
// determining that pointers are outside the heap (used mostly in assertions
|
2012-01-16 12:38:59 +00:00
|
|
|
// and verification). The estimate is conservative, i.e., not all addresses in
|
2008-11-21 10:06:29 +00:00
|
|
|
// 'allocated' space are actually allocated to our heap. The range is
|
|
|
|
// [lowest, highest), inclusive on the low and and exclusive on the high end.
|
|
|
|
static void* lowest_ever_allocated = reinterpret_cast<void*>(-1);
|
|
|
|
static void* highest_ever_allocated = reinterpret_cast<void*>(0);
|
|
|
|
|
|
|
|
|
|
|
|
static void UpdateAllocatedSpaceLimits(void* address, int size) {
|
2011-03-29 06:18:16 +00:00
|
|
|
ASSERT(limit_mutex != NULL);
|
|
|
|
ScopedLock lock(limit_mutex);
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
lowest_ever_allocated = Min(lowest_ever_allocated, address);
|
|
|
|
highest_ever_allocated =
|
|
|
|
Max(highest_ever_allocated,
|
|
|
|
reinterpret_cast<void*>(reinterpret_cast<char*>(address) + size));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool OS::IsOutsideAllocatedSpace(void* address) {
|
|
|
|
return address < lowest_ever_allocated || address >= highest_ever_allocated;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
size_t OS::AllocateAlignment() {
|
|
|
|
return getpagesize();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void* OS::Allocate(const size_t requested,
|
|
|
|
size_t* allocated,
|
|
|
|
bool executable) {
|
|
|
|
const size_t msize = RoundUp(requested, getpagesize());
|
|
|
|
int prot = PROT_READ | PROT_WRITE | (executable ? PROT_EXEC : 0);
|
|
|
|
void* mbase = mmap(NULL, msize, prot, MAP_PRIVATE | MAP_ANON, -1, 0);
|
|
|
|
|
|
|
|
if (mbase == MAP_FAILED) {
|
2011-03-18 20:35:07 +00:00
|
|
|
LOG(ISOLATE, StringEvent("OS::Allocate", "mmap failed"));
|
2008-11-21 10:06:29 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
*allocated = msize;
|
|
|
|
UpdateAllocatedSpaceLimits(mbase, msize);
|
|
|
|
return mbase;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void OS::Free(void* buf, const size_t length) {
|
|
|
|
// TODO(1240712): munmap has a return value which is ignored here.
|
2009-09-09 07:51:51 +00:00
|
|
|
int result = munmap(buf, length);
|
|
|
|
USE(result);
|
|
|
|
ASSERT(result == 0);
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void OS::Sleep(int milliseconds) {
|
|
|
|
unsigned int ms = static_cast<unsigned int>(milliseconds);
|
|
|
|
usleep(1000 * ms);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-02-15 12:38:59 +00:00
|
|
|
int OS::NumberOfCores() {
|
|
|
|
return sysconf(_SC_NPROCESSORS_ONLN);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
void OS::Abort() {
|
|
|
|
// Redirect to std abort to signal abnormal program termination.
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void OS::DebugBreak() {
|
2010-08-17 07:17:20 +00:00
|
|
|
#if (defined(__arm__) || defined(__thumb__))
|
2008-11-21 10:06:29 +00:00
|
|
|
asm("bkpt 0");
|
|
|
|
#else
|
|
|
|
asm("int $3");
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-12-17 10:50:19 +00:00
|
|
|
void OS::DumpBacktrace() {
|
|
|
|
void* trace[100];
|
|
|
|
int size = backtrace(trace, ARRAY_SIZE(trace));
|
|
|
|
char** symbols = backtrace_symbols(trace, size);
|
|
|
|
fprintf(stderr, "\n==== C stack trace ===============================\n\n");
|
|
|
|
if (size == 0) {
|
|
|
|
fprintf(stderr, "(empty)\n");
|
|
|
|
} else if (symbols == NULL) {
|
|
|
|
fprintf(stderr, "(no symbols)\n");
|
|
|
|
} else {
|
|
|
|
for (int i = 1; i < size; ++i) {
|
|
|
|
fprintf(stderr, "%2d: ", i);
|
|
|
|
char mangled[201];
|
|
|
|
if (sscanf(symbols[i], "%*[^(]%*[(]%200[^)+]", mangled) == 1) { // NOLINT
|
|
|
|
fprintf(stderr, "%s\n", mangled);
|
|
|
|
} else {
|
|
|
|
fprintf(stderr, "??\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fflush(stderr);
|
|
|
|
free(symbols);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
class PosixMemoryMappedFile : public OS::MemoryMappedFile {
|
|
|
|
public:
|
|
|
|
PosixMemoryMappedFile(FILE* file, void* memory, int size)
|
|
|
|
: file_(file), memory_(memory), size_(size) { }
|
|
|
|
virtual ~PosixMemoryMappedFile();
|
|
|
|
virtual void* memory() { return memory_; }
|
2011-01-19 14:28:15 +00:00
|
|
|
virtual int size() { return size_; }
|
2008-11-21 10:06:29 +00:00
|
|
|
private:
|
|
|
|
FILE* file_;
|
|
|
|
void* memory_;
|
|
|
|
int size_;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2011-01-19 14:28:15 +00:00
|
|
|
OS::MemoryMappedFile* OS::MemoryMappedFile::open(const char* name) {
|
2011-02-21 17:17:26 +00:00
|
|
|
FILE* file = fopen(name, "r+");
|
2011-01-19 14:28:15 +00:00
|
|
|
if (file == NULL) return NULL;
|
|
|
|
|
|
|
|
fseek(file, 0, SEEK_END);
|
|
|
|
int size = ftell(file);
|
|
|
|
|
|
|
|
void* memory =
|
|
|
|
mmap(0, size, PROT_READ | PROT_WRITE, MAP_SHARED, fileno(file), 0);
|
|
|
|
return new PosixMemoryMappedFile(file, memory, size);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
OS::MemoryMappedFile* OS::MemoryMappedFile::create(const char* name, int size,
|
|
|
|
void* initial) {
|
|
|
|
FILE* file = fopen(name, "w+");
|
|
|
|
if (file == NULL) return NULL;
|
|
|
|
int result = fwrite(initial, size, 1, file);
|
|
|
|
if (result < 1) {
|
|
|
|
fclose(file);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
void* memory =
|
|
|
|
mmap(0, size, PROT_READ | PROT_WRITE, MAP_SHARED, fileno(file), 0);
|
|
|
|
return new PosixMemoryMappedFile(file, memory, size);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
PosixMemoryMappedFile::~PosixMemoryMappedFile() {
|
|
|
|
if (memory_) munmap(memory_, size_);
|
|
|
|
fclose(file_);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static unsigned StringToLong(char* buffer) {
|
|
|
|
return static_cast<unsigned>(strtol(buffer, NULL, 16)); // NOLINT
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void OS::LogSharedLibraryAddresses() {
|
|
|
|
static const int MAP_LENGTH = 1024;
|
|
|
|
int fd = open("/proc/self/maps", O_RDONLY);
|
|
|
|
if (fd < 0) return;
|
|
|
|
while (true) {
|
|
|
|
char addr_buffer[11];
|
|
|
|
addr_buffer[0] = '0';
|
|
|
|
addr_buffer[1] = 'x';
|
|
|
|
addr_buffer[10] = 0;
|
|
|
|
int result = read(fd, addr_buffer + 2, 8);
|
|
|
|
if (result < 8) break;
|
|
|
|
unsigned start = StringToLong(addr_buffer);
|
|
|
|
result = read(fd, addr_buffer + 2, 1);
|
|
|
|
if (result < 1) break;
|
|
|
|
if (addr_buffer[2] != '-') break;
|
|
|
|
result = read(fd, addr_buffer + 2, 8);
|
|
|
|
if (result < 8) break;
|
|
|
|
unsigned end = StringToLong(addr_buffer);
|
|
|
|
char buffer[MAP_LENGTH];
|
|
|
|
int bytes_read = -1;
|
|
|
|
do {
|
|
|
|
bytes_read++;
|
|
|
|
if (bytes_read >= MAP_LENGTH - 1)
|
|
|
|
break;
|
|
|
|
result = read(fd, buffer + bytes_read, 1);
|
|
|
|
if (result < 1) break;
|
|
|
|
} while (buffer[bytes_read] != '\n');
|
|
|
|
buffer[bytes_read] = 0;
|
|
|
|
// Ignore mappings that are not executable.
|
|
|
|
if (buffer[3] != 'x') continue;
|
|
|
|
char* start_of_path = index(buffer, '/');
|
|
|
|
// There may be no filename in this line. Skip to next.
|
|
|
|
if (start_of_path == NULL) continue;
|
|
|
|
buffer[bytes_read] = 0;
|
2011-03-29 06:18:16 +00:00
|
|
|
LOG(i::Isolate::Current(), SharedLibraryEvent(start_of_path, start, end));
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
close(fd);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-10-19 16:45:11 +00:00
|
|
|
void OS::SignalCodeMovingGC() {
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-04-16 21:01:05 +00:00
|
|
|
int OS::StackWalk(Vector<OS::StackFrame> frames) {
|
|
|
|
int frames_size = frames.length();
|
2010-05-05 12:25:58 +00:00
|
|
|
ScopedVector<void*> addresses(frames_size);
|
2008-11-21 10:06:29 +00:00
|
|
|
|
2010-05-05 12:25:58 +00:00
|
|
|
int frames_count = backtrace(addresses.start(), frames_size);
|
2008-11-21 10:06:29 +00:00
|
|
|
|
2010-05-25 18:50:31 +00:00
|
|
|
char** symbols = backtrace_symbols(addresses.start(), frames_count);
|
2008-11-21 10:06:29 +00:00
|
|
|
if (symbols == NULL) {
|
|
|
|
return kStackWalkError;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (int i = 0; i < frames_count; i++) {
|
|
|
|
frames[i].address = addresses[i];
|
|
|
|
// Format a text representation of the frame based on the information
|
|
|
|
// available.
|
|
|
|
SNPrintF(MutableCStrVector(frames[i].text, kStackWalkMaxTextLen),
|
|
|
|
"%s",
|
|
|
|
symbols[i]);
|
|
|
|
// Make sure line termination is in place.
|
|
|
|
frames[i].text[kStackWalkMaxTextLen - 1] = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
free(symbols);
|
|
|
|
|
|
|
|
return frames_count;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Constants used for mmap.
|
|
|
|
static const int kMmapFd = -1;
|
|
|
|
static const int kMmapFdOffset = 0;
|
|
|
|
|
2013-04-12 11:10:19 +00:00
|
|
|
|
2011-11-03 08:33:06 +00:00
|
|
|
VirtualMemory::VirtualMemory() : address_(NULL), size_(0) { }
|
2008-11-21 10:06:29 +00:00
|
|
|
|
2013-04-12 11:10:19 +00:00
|
|
|
|
|
|
|
VirtualMemory::VirtualMemory(size_t size)
|
|
|
|
: address_(ReserveRegion(size)), size_(size) { }
|
2008-11-21 10:06:29 +00:00
|
|
|
|
|
|
|
|
2011-11-03 08:33:06 +00:00
|
|
|
VirtualMemory::VirtualMemory(size_t size, size_t alignment)
|
|
|
|
: address_(NULL), size_(0) {
|
|
|
|
ASSERT(IsAligned(alignment, static_cast<intptr_t>(OS::AllocateAlignment())));
|
|
|
|
size_t request_size = RoundUp(size + alignment,
|
|
|
|
static_cast<intptr_t>(OS::AllocateAlignment()));
|
|
|
|
void* reservation = mmap(OS::GetRandomMmapAddr(),
|
|
|
|
request_size,
|
|
|
|
PROT_NONE,
|
|
|
|
MAP_PRIVATE | MAP_ANON | MAP_NORESERVE,
|
|
|
|
kMmapFd,
|
|
|
|
kMmapFdOffset);
|
|
|
|
if (reservation == MAP_FAILED) return;
|
|
|
|
|
|
|
|
Address base = static_cast<Address>(reservation);
|
|
|
|
Address aligned_base = RoundUp(base, alignment);
|
|
|
|
ASSERT_LE(base, aligned_base);
|
|
|
|
|
|
|
|
// Unmap extra memory reserved before and after the desired block.
|
|
|
|
if (aligned_base != base) {
|
|
|
|
size_t prefix_size = static_cast<size_t>(aligned_base - base);
|
|
|
|
OS::Free(base, prefix_size);
|
|
|
|
request_size -= prefix_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t aligned_size = RoundUp(size, OS::AllocateAlignment());
|
|
|
|
ASSERT_LE(aligned_size, request_size);
|
|
|
|
|
|
|
|
if (aligned_size != request_size) {
|
|
|
|
size_t suffix_size = request_size - aligned_size;
|
|
|
|
OS::Free(aligned_base + aligned_size, suffix_size);
|
|
|
|
request_size -= suffix_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
ASSERT(aligned_size == request_size);
|
|
|
|
|
|
|
|
address_ = static_cast<void*>(aligned_base);
|
|
|
|
size_ = aligned_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
VirtualMemory::~VirtualMemory() {
|
|
|
|
if (IsReserved()) {
|
2011-11-03 08:33:06 +00:00
|
|
|
bool result = ReleaseRegion(address(), size());
|
|
|
|
ASSERT(result);
|
|
|
|
USE(result);
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool VirtualMemory::IsReserved() {
|
2011-11-03 08:33:06 +00:00
|
|
|
return address_ != NULL;
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-11-03 08:33:06 +00:00
|
|
|
void VirtualMemory::Reset() {
|
|
|
|
address_ = NULL;
|
|
|
|
size_ = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool VirtualMemory::Commit(void* address, size_t size, bool is_executable) {
|
|
|
|
return CommitRegion(address, size, is_executable);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool VirtualMemory::Uncommit(void* address, size_t size) {
|
|
|
|
return UncommitRegion(address, size);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-02-23 12:11:24 +00:00
|
|
|
bool VirtualMemory::Guard(void* address) {
|
|
|
|
OS::Guard(address, OS::CommitPageSize());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-11-03 08:33:06 +00:00
|
|
|
void* VirtualMemory::ReserveRegion(size_t size) {
|
|
|
|
void* result = mmap(OS::GetRandomMmapAddr(),
|
|
|
|
size,
|
|
|
|
PROT_NONE,
|
|
|
|
MAP_PRIVATE | MAP_ANON | MAP_NORESERVE,
|
|
|
|
kMmapFd,
|
|
|
|
kMmapFdOffset);
|
|
|
|
|
|
|
|
if (result == MAP_FAILED) return NULL;
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool VirtualMemory::CommitRegion(void* base, size_t size, bool is_executable) {
|
|
|
|
int prot = PROT_READ | PROT_WRITE | (is_executable ? PROT_EXEC : 0);
|
|
|
|
if (MAP_FAILED == mmap(base,
|
|
|
|
size,
|
|
|
|
prot,
|
2008-11-21 10:06:29 +00:00
|
|
|
MAP_PRIVATE | MAP_ANON | MAP_FIXED,
|
2011-11-03 08:33:06 +00:00
|
|
|
kMmapFd,
|
|
|
|
kMmapFdOffset)) {
|
2008-11-21 10:06:29 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2011-11-03 08:33:06 +00:00
|
|
|
UpdateAllocatedSpaceLimits(base, size);
|
2008-11-21 10:06:29 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-11-03 08:33:06 +00:00
|
|
|
bool VirtualMemory::UncommitRegion(void* base, size_t size) {
|
|
|
|
return mmap(base,
|
|
|
|
size,
|
|
|
|
PROT_NONE,
|
2009-09-09 07:51:51 +00:00
|
|
|
MAP_PRIVATE | MAP_ANON | MAP_NORESERVE | MAP_FIXED,
|
2011-11-03 08:33:06 +00:00
|
|
|
kMmapFd,
|
|
|
|
kMmapFdOffset) != MAP_FAILED;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool VirtualMemory::ReleaseRegion(void* base, size_t size) {
|
|
|
|
return munmap(base, size) == 0;
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-10-22 16:33:10 +00:00
|
|
|
bool VirtualMemory::HasLazyCommits() {
|
|
|
|
// TODO(alph): implement for the platform.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-04-11 23:46:22 +00:00
|
|
|
class Thread::PlatformData : public Malloced {
|
2008-11-21 10:06:29 +00:00
|
|
|
public:
|
|
|
|
pthread_t thread_; // Thread handle for pthread.
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2011-06-10 09:54:04 +00:00
|
|
|
Thread::Thread(const Options& options)
|
2011-04-11 23:46:22 +00:00
|
|
|
: data_(new PlatformData),
|
2013-04-10 09:47:44 +00:00
|
|
|
stack_size_(options.stack_size()),
|
|
|
|
start_semaphore_(NULL) {
|
2012-01-24 15:48:16 +00:00
|
|
|
set_name(options.name());
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Thread::~Thread() {
|
2011-04-11 23:46:22 +00:00
|
|
|
delete data_;
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void* ThreadEntry(void* arg) {
|
|
|
|
Thread* thread = reinterpret_cast<Thread*>(arg);
|
|
|
|
// This is also initialized by the first argument to pthread_create() but we
|
|
|
|
// don't know which thread will run first (the original thread or the new
|
|
|
|
// one) so we initialize it here too.
|
2011-05-08 14:50:09 +00:00
|
|
|
thread->data()->thread_ = pthread_self();
|
|
|
|
ASSERT(thread->data()->thread_ != kNoThread);
|
2013-04-10 09:47:44 +00:00
|
|
|
thread->NotifyStartedAndRun();
|
2008-11-21 10:06:29 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-01-04 09:09:50 +00:00
|
|
|
void Thread::set_name(const char* name) {
|
|
|
|
strncpy(name_, name, sizeof(name_));
|
|
|
|
name_[sizeof(name_) - 1] = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
void Thread::Start() {
|
2011-03-21 15:04:17 +00:00
|
|
|
pthread_attr_t* attr_ptr = NULL;
|
|
|
|
pthread_attr_t attr;
|
|
|
|
if (stack_size_ > 0) {
|
|
|
|
pthread_attr_init(&attr);
|
|
|
|
pthread_attr_setstacksize(&attr, static_cast<size_t>(stack_size_));
|
|
|
|
attr_ptr = &attr;
|
|
|
|
}
|
2011-05-08 14:50:09 +00:00
|
|
|
pthread_create(&data_->thread_, attr_ptr, ThreadEntry, this);
|
|
|
|
ASSERT(data_->thread_ != kNoThread);
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Thread::Join() {
|
2011-05-08 14:50:09 +00:00
|
|
|
pthread_join(data_->thread_, NULL);
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Thread::LocalStorageKey Thread::CreateThreadLocalKey() {
|
|
|
|
pthread_key_t key;
|
|
|
|
int result = pthread_key_create(&key, NULL);
|
|
|
|
USE(result);
|
|
|
|
ASSERT(result == 0);
|
|
|
|
return static_cast<LocalStorageKey>(key);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Thread::DeleteThreadLocalKey(LocalStorageKey key) {
|
|
|
|
pthread_key_t pthread_key = static_cast<pthread_key_t>(key);
|
|
|
|
int result = pthread_key_delete(pthread_key);
|
|
|
|
USE(result);
|
|
|
|
ASSERT(result == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void* Thread::GetThreadLocal(LocalStorageKey key) {
|
|
|
|
pthread_key_t pthread_key = static_cast<pthread_key_t>(key);
|
|
|
|
return pthread_getspecific(pthread_key);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Thread::SetThreadLocal(LocalStorageKey key, void* value) {
|
|
|
|
pthread_key_t pthread_key = static_cast<pthread_key_t>(key);
|
|
|
|
pthread_setspecific(pthread_key, value);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Thread::YieldCPU() {
|
|
|
|
sched_yield();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
class FreeBSDMutex : public Mutex {
|
|
|
|
public:
|
|
|
|
FreeBSDMutex() {
|
|
|
|
pthread_mutexattr_t attrs;
|
|
|
|
int result = pthread_mutexattr_init(&attrs);
|
|
|
|
ASSERT(result == 0);
|
|
|
|
result = pthread_mutexattr_settype(&attrs, PTHREAD_MUTEX_RECURSIVE);
|
|
|
|
ASSERT(result == 0);
|
|
|
|
result = pthread_mutex_init(&mutex_, &attrs);
|
|
|
|
ASSERT(result == 0);
|
2012-05-15 09:21:49 +00:00
|
|
|
USE(result);
|
2008-11-21 10:06:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
virtual ~FreeBSDMutex() { pthread_mutex_destroy(&mutex_); }
|
|
|
|
|
|
|
|
virtual int Lock() {
|
|
|
|
int result = pthread_mutex_lock(&mutex_);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual int Unlock() {
|
|
|
|
int result = pthread_mutex_unlock(&mutex_);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2011-03-16 11:15:43 +00:00
|
|
|
virtual bool TryLock() {
|
|
|
|
int result = pthread_mutex_trylock(&mutex_);
|
|
|
|
// Return false if the lock is busy and locking failed.
|
|
|
|
if (result == EBUSY) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
ASSERT(result == 0); // Verify no other errors.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
private:
|
|
|
|
pthread_mutex_t mutex_; // Pthread mutex for POSIX platforms.
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
Mutex* OS::CreateMutex() {
|
|
|
|
return new FreeBSDMutex();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
class FreeBSDSemaphore : public Semaphore {
|
|
|
|
public:
|
|
|
|
explicit FreeBSDSemaphore(int count) { sem_init(&sem_, 0, count); }
|
|
|
|
virtual ~FreeBSDSemaphore() { sem_destroy(&sem_); }
|
|
|
|
|
|
|
|
virtual void Wait();
|
2009-03-18 09:04:24 +00:00
|
|
|
virtual bool Wait(int timeout);
|
2008-11-21 10:06:29 +00:00
|
|
|
virtual void Signal() { sem_post(&sem_); }
|
|
|
|
private:
|
|
|
|
sem_t sem_;
|
|
|
|
};
|
|
|
|
|
2009-03-18 09:04:24 +00:00
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
void FreeBSDSemaphore::Wait() {
|
|
|
|
while (true) {
|
|
|
|
int result = sem_wait(&sem_);
|
|
|
|
if (result == 0) return; // Successfully got semaphore.
|
|
|
|
CHECK(result == -1 && errno == EINTR); // Signal caused spurious wakeup.
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-03-18 09:04:24 +00:00
|
|
|
|
|
|
|
bool FreeBSDSemaphore::Wait(int timeout) {
|
|
|
|
const long kOneSecondMicros = 1000000; // NOLINT
|
|
|
|
|
|
|
|
// Split timeout into second and nanosecond parts.
|
2009-04-17 00:56:52 +00:00
|
|
|
struct timeval delta;
|
|
|
|
delta.tv_usec = timeout % kOneSecondMicros;
|
|
|
|
delta.tv_sec = timeout / kOneSecondMicros;
|
2009-03-18 09:04:24 +00:00
|
|
|
|
2009-04-17 00:56:52 +00:00
|
|
|
struct timeval current_time;
|
|
|
|
// Get the current time.
|
|
|
|
if (gettimeofday(¤t_time, NULL) == -1) {
|
2009-03-18 09:04:24 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-04-17 00:56:52 +00:00
|
|
|
// Calculate time for end of timeout.
|
|
|
|
struct timeval end_time;
|
|
|
|
timeradd(¤t_time, &delta, &end_time);
|
2009-03-18 09:04:24 +00:00
|
|
|
|
2009-04-17 00:56:52 +00:00
|
|
|
struct timespec ts;
|
|
|
|
TIMEVAL_TO_TIMESPEC(&end_time, &ts);
|
2009-03-18 09:04:24 +00:00
|
|
|
while (true) {
|
|
|
|
int result = sem_timedwait(&sem_, &ts);
|
|
|
|
if (result == 0) return true; // Successfully got semaphore.
|
|
|
|
if (result == -1 && errno == ETIMEDOUT) return false; // Timeout.
|
|
|
|
CHECK(result == -1 && errno == EINTR); // Signal caused spurious wakeup.
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
Semaphore* OS::CreateSemaphore(int count) {
|
|
|
|
return new FreeBSDSemaphore(count);
|
|
|
|
}
|
|
|
|
|
2009-02-24 13:32:01 +00:00
|
|
|
|
2012-04-05 14:10:39 +00:00
|
|
|
void OS::SetUp() {
|
|
|
|
// Seed the random number generator.
|
|
|
|
// Convert the current time to a 64-bit integer first, before converting it
|
|
|
|
// to an unsigned. Going directly can cause an overflow and the seed to be
|
|
|
|
// set to all ones. The seed will be identical for different instances that
|
|
|
|
// call this setup code within the same millisecond.
|
|
|
|
uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis());
|
|
|
|
srandom(static_cast<unsigned int>(seed));
|
|
|
|
limit_mutex = CreateMutex();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-04-13 14:08:31 +00:00
|
|
|
void OS::TearDown() {
|
|
|
|
delete limit_mutex;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-11-21 10:06:29 +00:00
|
|
|
} } // namespace v8::internal
|