| 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 75 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 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, ie, not all addresses in |
| (...skipping 781 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 |