| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 68 extern char** backtrace_symbols(void* const*, int) | 68 extern char** backtrace_symbols(void* const*, int) |
| 69 __attribute__((weak_import)); | 69 __attribute__((weak_import)); |
| 70 extern void backtrace_symbols_fd(void* const*, int, int) | 70 extern void backtrace_symbols_fd(void* const*, int, int) |
| 71 __attribute__((weak_import)); | 71 __attribute__((weak_import)); |
| 72 } | 72 } |
| 73 | 73 |
| 74 | 74 |
| 75 namespace v8 { | 75 namespace v8 { |
| 76 namespace internal { | 76 namespace internal { |
| 77 | 77 |
| 78 // 0 is never a valid thread id on MacOSX since a ptread_t is | 78 // 0 is never a valid thread id on MacOSX since a pthread_t is |
| 79 // a pointer. | 79 // a pointer. |
| 80 static const pthread_t kNoThread = (pthread_t) 0; | 80 static const pthread_t kNoThread = (pthread_t) 0; |
| 81 | 81 |
| 82 | 82 |
| 83 double ceiling(double x) { | 83 double ceiling(double x) { |
| 84 // Correct Mac OS X Leopard 'ceil' behavior. | 84 // Correct Mac OS X Leopard 'ceil' behavior. |
| 85 if (-1.0 < x && x < 0.0) { | 85 if (-1.0 < x && x < 0.0) { |
| 86 return -0.0; | 86 return -0.0; |
| 87 } else { | 87 } else { |
| 88 return ceil(x); | 88 return ceil(x); |
| 89 } | 89 } |
| 90 } | 90 } |
| 91 | 91 |
| 92 | 92 |
| 93 static Mutex* limit_mutex = NULL; | 93 static Mutex* limit_mutex = NULL; |
| 94 | 94 |
| 95 | 95 |
| 96 void OS::SetUp() { | 96 void OS::SetUp() { |
| 97 // Seed the random number generator. We preserve microsecond resolution. | 97 // Seed the random number generator. We preserve microsecond resolution. |
| 98 uint64_t seed = Ticks() ^ (getpid() << 16); | 98 uint64_t seed = Ticks() ^ (getpid() << 16); |
| 99 srandom(static_cast<unsigned int>(seed)); | 99 srandom(static_cast<unsigned int>(seed)); |
| 100 limit_mutex = CreateMutex(); | 100 limit_mutex = CreateMutex(); |
| 101 } | 101 } |
| 102 | 102 |
| 103 | 103 |
| 104 // We keep the lowest and highest addresses mapped as a quick way of | 104 // We keep the lowest and highest addresses mapped as a quick way of |
| 105 // determining that pointers are outside the heap (used mostly in assertions | 105 // determining that pointers are outside the heap (used mostly in assertions |
| 106 // and verification). The estimate is conservative, ie, not all addresses in | 106 // and verification). The estimate is conservative, i.e., not all addresses in |
| 107 // 'allocated' space are actually allocated to our heap. The range is | 107 // 'allocated' space are actually allocated to our heap. The range is |
| 108 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 108 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
| 109 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); | 109 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); |
| 110 static void* highest_ever_allocated = reinterpret_cast<void*>(0); | 110 static void* highest_ever_allocated = reinterpret_cast<void*>(0); |
| 111 | 111 |
| 112 | 112 |
| 113 static void UpdateAllocatedSpaceLimits(void* address, int size) { | 113 static void UpdateAllocatedSpaceLimits(void* address, int size) { |
| 114 ASSERT(limit_mutex != NULL); | 114 ASSERT(limit_mutex != NULL); |
| 115 ScopedLock lock(limit_mutex); | 115 ScopedLock lock(limit_mutex); |
| 116 | 116 |
| (...skipping 771 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 888 | 888 |
| 889 | 889 |
| 890 void Sampler::Stop() { | 890 void Sampler::Stop() { |
| 891 ASSERT(IsActive()); | 891 ASSERT(IsActive()); |
| 892 SamplerThread::RemoveActiveSampler(this); | 892 SamplerThread::RemoveActiveSampler(this); |
| 893 SetActive(false); | 893 SetActive(false); |
| 894 } | 894 } |
| 895 | 895 |
| 896 | 896 |
| 897 } } // namespace v8::internal | 897 } } // namespace v8::internal |
| OLD | NEW |