| 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 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 88 // determining that pointers are outside the heap (used mostly in assertions | 88 // determining that pointers are outside the heap (used mostly in assertions |
| 89 // and verification). The estimate is conservative, i.e., not all addresses in | 89 // and verification). The estimate is conservative, i.e., not all addresses in |
| 90 // 'allocated' space are actually allocated to our heap. The range is | 90 // 'allocated' space are actually allocated to our heap. The range is |
| 91 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 91 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
| 92 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); | 92 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); |
| 93 static void* highest_ever_allocated = reinterpret_cast<void*>(0); | 93 static void* highest_ever_allocated = reinterpret_cast<void*>(0); |
| 94 | 94 |
| 95 | 95 |
| 96 static void UpdateAllocatedSpaceLimits(void* address, int size) { | 96 static void UpdateAllocatedSpaceLimits(void* address, int size) { |
| 97 ASSERT(limit_mutex != NULL); | 97 ASSERT(limit_mutex != NULL); |
| 98 ScopedLock lock(limit_mutex); | 98 LockGuard<Mutex> lock_guard(limit_mutex); |
| 99 | 99 |
| 100 lowest_ever_allocated = Min(lowest_ever_allocated, address); | 100 lowest_ever_allocated = Min(lowest_ever_allocated, address); |
| 101 highest_ever_allocated = | 101 highest_ever_allocated = |
| 102 Max(highest_ever_allocated, | 102 Max(highest_ever_allocated, |
| 103 reinterpret_cast<void*>(reinterpret_cast<char*>(address) + size)); | 103 reinterpret_cast<void*>(reinterpret_cast<char*>(address) + size)); |
| 104 } | 104 } |
| 105 | 105 |
| 106 | 106 |
| 107 bool OS::IsOutsideAllocatedSpace(void* address) { | 107 bool OS::IsOutsideAllocatedSpace(void* address) { |
| 108 return address < lowest_ever_allocated || address >= highest_ever_allocated; | 108 return address < lowest_ever_allocated || address >= highest_ever_allocated; |
| (...skipping 320 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 429 | 429 |
| 430 | 430 |
| 431 void OS::SetUp() { | 431 void OS::SetUp() { |
| 432 // Seed the random number generator. | 432 // Seed the random number generator. |
| 433 // Convert the current time to a 64-bit integer first, before converting it | 433 // Convert the current time to a 64-bit integer first, before converting it |
| 434 // to an unsigned. Going directly can cause an overflow and the seed to be | 434 // to an unsigned. Going directly can cause an overflow and the seed to be |
| 435 // set to all ones. The seed will be identical for different instances that | 435 // set to all ones. The seed will be identical for different instances that |
| 436 // call this setup code within the same millisecond. | 436 // call this setup code within the same millisecond. |
| 437 uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis()); | 437 uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis()); |
| 438 srandom(static_cast<unsigned int>(seed)); | 438 srandom(static_cast<unsigned int>(seed)); |
| 439 limit_mutex = CreateMutex(); | 439 limit_mutex = new Mutex(); |
| 440 } | 440 } |
| 441 | 441 |
| 442 | 442 |
| 443 void OS::TearDown() { | 443 void OS::TearDown() { |
| 444 delete limit_mutex; | 444 delete limit_mutex; |
| 445 } | 445 } |
| 446 | 446 |
| 447 | 447 |
| 448 } } // namespace v8::internal | 448 } } // namespace v8::internal |
| OLD | NEW |