| 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 69 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 80 // determining that pointers are outside the heap (used mostly in assertions | 80 // determining that pointers are outside the heap (used mostly in assertions |
| 81 // and verification). The estimate is conservative, i.e., not all addresses in | 81 // and verification). The estimate is conservative, i.e., not all addresses in |
| 82 // 'allocated' space are actually allocated to our heap. The range is | 82 // 'allocated' space are actually allocated to our heap. The range is |
| 83 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 83 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
| 84 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); | 84 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); |
| 85 static void* highest_ever_allocated = reinterpret_cast<void*>(0); | 85 static void* highest_ever_allocated = reinterpret_cast<void*>(0); |
| 86 | 86 |
| 87 | 87 |
| 88 static void UpdateAllocatedSpaceLimits(void* address, int size) { | 88 static void UpdateAllocatedSpaceLimits(void* address, int size) { |
| 89 ASSERT(limit_mutex != NULL); | 89 ASSERT(limit_mutex != NULL); |
| 90 ScopedLock lock(limit_mutex); | 90 LockGuard<Mutex> lock_guard(limit_mutex); |
| 91 | 91 |
| 92 lowest_ever_allocated = Min(lowest_ever_allocated, address); | 92 lowest_ever_allocated = Min(lowest_ever_allocated, address); |
| 93 highest_ever_allocated = | 93 highest_ever_allocated = |
| 94 Max(highest_ever_allocated, | 94 Max(highest_ever_allocated, |
| 95 reinterpret_cast<void*>(reinterpret_cast<char*>(address) + size)); | 95 reinterpret_cast<void*>(reinterpret_cast<char*>(address) + size)); |
| 96 } | 96 } |
| 97 | 97 |
| 98 | 98 |
| 99 bool OS::IsOutsideAllocatedSpace(void* address) { | 99 bool OS::IsOutsideAllocatedSpace(void* address) { |
| 100 return address < lowest_ever_allocated || address >= highest_ever_allocated; | 100 return address < lowest_ever_allocated || address >= highest_ever_allocated; |
| (...skipping 363 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 464 | 464 |
| 465 | 465 |
| 466 void OS::SetUp() { | 466 void OS::SetUp() { |
| 467 // Seed the random number generator. | 467 // Seed the random number generator. |
| 468 // Convert the current time to a 64-bit integer first, before converting it | 468 // Convert the current time to a 64-bit integer first, before converting it |
| 469 // to an unsigned. Going directly can cause an overflow and the seed to be | 469 // to an unsigned. Going directly can cause an overflow and the seed to be |
| 470 // set to all ones. The seed will be identical for different instances that | 470 // set to all ones. The seed will be identical for different instances that |
| 471 // call this setup code within the same millisecond. | 471 // call this setup code within the same millisecond. |
| 472 uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis()); | 472 uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis()); |
| 473 srandom(static_cast<unsigned int>(seed)); | 473 srandom(static_cast<unsigned int>(seed)); |
| 474 limit_mutex = CreateMutex(); | 474 limit_mutex = new Mutex(); |
| 475 } | 475 } |
| 476 | 476 |
| 477 | 477 |
| 478 void OS::TearDown() { | 478 void OS::TearDown() { |
| 479 delete limit_mutex; | 479 delete limit_mutex; |
| 480 } | 480 } |
| 481 | 481 |
| 482 | 482 |
| 483 } } // namespace v8::internal | 483 } } // namespace v8::internal |
| OLD | NEW |