| 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 92 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 103 // determining that pointers are outside the heap (used mostly in assertions | 103 // determining that pointers are outside the heap (used mostly in assertions |
| 104 // and verification). The estimate is conservative, i.e., not all addresses in | 104 // and verification). The estimate is conservative, i.e., not all addresses in |
| 105 // 'allocated' space are actually allocated to our heap. The range is | 105 // 'allocated' space are actually allocated to our heap. The range is |
| 106 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 106 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
| 107 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); | 107 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); |
| 108 static void* highest_ever_allocated = reinterpret_cast<void*>(0); | 108 static void* highest_ever_allocated = reinterpret_cast<void*>(0); |
| 109 | 109 |
| 110 | 110 |
| 111 static void UpdateAllocatedSpaceLimits(void* address, int size) { | 111 static void UpdateAllocatedSpaceLimits(void* address, int size) { |
| 112 ASSERT(limit_mutex != NULL); | 112 ASSERT(limit_mutex != NULL); |
| 113 ScopedLock lock(limit_mutex); | 113 LockGuard<Mutex> lock_guard(limit_mutex); |
| 114 | 114 |
| 115 lowest_ever_allocated = Min(lowest_ever_allocated, address); | 115 lowest_ever_allocated = Min(lowest_ever_allocated, address); |
| 116 highest_ever_allocated = | 116 highest_ever_allocated = |
| 117 Max(highest_ever_allocated, | 117 Max(highest_ever_allocated, |
| 118 reinterpret_cast<void*>(reinterpret_cast<char*>(address) + size)); | 118 reinterpret_cast<void*>(reinterpret_cast<char*>(address) + size)); |
| 119 } | 119 } |
| 120 | 120 |
| 121 | 121 |
| 122 bool OS::IsOutsideAllocatedSpace(void* address) { | 122 bool OS::IsOutsideAllocatedSpace(void* address) { |
| 123 return address < lowest_ever_allocated || address >= highest_ever_allocated; | 123 return address < lowest_ever_allocated || address >= highest_ever_allocated; |
| (...skipping 348 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 472 | 472 |
| 473 | 473 |
| 474 void OS::SetUp() { | 474 void OS::SetUp() { |
| 475 // Seed the random number generator. | 475 // Seed the random number generator. |
| 476 // Convert the current time to a 64-bit integer first, before converting it | 476 // Convert the current time to a 64-bit integer first, before converting it |
| 477 // to an unsigned. Going directly will cause an overflow and the seed to be | 477 // to an unsigned. Going directly will cause an overflow and the seed to be |
| 478 // set to all ones. The seed will be identical for different instances that | 478 // set to all ones. The seed will be identical for different instances that |
| 479 // call this setup code within the same millisecond. | 479 // call this setup code within the same millisecond. |
| 480 uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis()); | 480 uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis()); |
| 481 srandom(static_cast<unsigned int>(seed)); | 481 srandom(static_cast<unsigned int>(seed)); |
| 482 limit_mutex = CreateMutex(); | 482 limit_mutex = new Mutex(); |
| 483 } | 483 } |
| 484 | 484 |
| 485 | 485 |
| 486 void OS::TearDown() { | 486 void OS::TearDown() { |
| 487 delete limit_mutex; | 487 delete limit_mutex; |
| 488 } | 488 } |
| 489 | 489 |
| 490 | 490 |
| 491 } } // namespace v8::internal | 491 } } // namespace v8::internal |
| OLD | NEW |