| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 75 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 86 // determining that pointers are outside the heap (used mostly in assertions | 86 // determining that pointers are outside the heap (used mostly in assertions |
| 87 // and verification). The estimate is conservative, i.e., not all addresses in | 87 // and verification). The estimate is conservative, i.e., not all addresses in |
| 88 // 'allocated' space are actually allocated to our heap. The range is | 88 // 'allocated' space are actually allocated to our heap. The range is |
| 89 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 89 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
| 90 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); | 90 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); |
| 91 static void* highest_ever_allocated = reinterpret_cast<void*>(0); | 91 static void* highest_ever_allocated = reinterpret_cast<void*>(0); |
| 92 | 92 |
| 93 | 93 |
| 94 static void UpdateAllocatedSpaceLimits(void* address, int size) { | 94 static void UpdateAllocatedSpaceLimits(void* address, int size) { |
| 95 ASSERT(limit_mutex != NULL); | 95 ASSERT(limit_mutex != NULL); |
| 96 ScopedLock lock(limit_mutex); | 96 LockGuard<Mutex> lock(limit_mutex); |
| 97 | 97 |
| 98 lowest_ever_allocated = Min(lowest_ever_allocated, address); | 98 lowest_ever_allocated = Min(lowest_ever_allocated, address); |
| 99 highest_ever_allocated = | 99 highest_ever_allocated = |
| 100 Max(highest_ever_allocated, | 100 Max(highest_ever_allocated, |
| 101 reinterpret_cast<void*>(reinterpret_cast<char*>(address) + size)); | 101 reinterpret_cast<void*>(reinterpret_cast<char*>(address) + size)); |
| 102 } | 102 } |
| 103 | 103 |
| 104 | 104 |
| 105 bool OS::IsOutsideAllocatedSpace(void* address) { | 105 bool OS::IsOutsideAllocatedSpace(void* address) { |
| 106 return address < lowest_ever_allocated || address >= highest_ever_allocated; | 106 return address < lowest_ever_allocated || address >= highest_ever_allocated; |
| (...skipping 388 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 495 | 495 |
| 496 Semaphore* OS::CreateSemaphore(int count) { | 496 Semaphore* OS::CreateSemaphore(int count) { |
| 497 return new OpenBSDSemaphore(count); | 497 return new OpenBSDSemaphore(count); |
| 498 } | 498 } |
| 499 | 499 |
| 500 | 500 |
| 501 void OS::SetUp() { | 501 void OS::SetUp() { |
| 502 // Seed the random number generator. We preserve microsecond resolution. | 502 // Seed the random number generator. We preserve microsecond resolution. |
| 503 uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis()) ^ (getpid() << 16); | 503 uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis()) ^ (getpid() << 16); |
| 504 srandom(static_cast<unsigned int>(seed)); | 504 srandom(static_cast<unsigned int>(seed)); |
| 505 limit_mutex = CreateMutex(); | 505 limit_mutex = new Mutex(); |
| 506 } | 506 } |
| 507 | 507 |
| 508 | 508 |
| 509 void OS::TearDown() { | 509 void OS::TearDown() { |
| 510 delete limit_mutex; | 510 delete limit_mutex; |
| 511 } | 511 } |
| 512 | 512 |
| 513 | 513 |
| 514 } } // namespace v8::internal | 514 } } // namespace v8::internal |
| OLD | NEW |