OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 110 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
121 time_t tv = time(NULL); | 121 time_t tv = time(NULL); |
122 struct tm* t = localtime(&tv); | 122 struct tm* t = localtime(&tv); |
123 // tm_gmtoff includes any daylight savings offset, so subtract it. | 123 // tm_gmtoff includes any daylight savings offset, so subtract it. |
124 return static_cast<double>(t->tm_gmtoff * msPerSecond - | 124 return static_cast<double>(t->tm_gmtoff * msPerSecond - |
125 (t->tm_isdst > 0 ? 3600 * msPerSecond : 0)); | 125 (t->tm_isdst > 0 ? 3600 * msPerSecond : 0)); |
126 } | 126 } |
127 | 127 |
128 | 128 |
129 // We keep the lowest and highest addresses mapped as a quick way of | 129 // We keep the lowest and highest addresses mapped as a quick way of |
130 // determining that pointers are outside the heap (used mostly in assertions | 130 // determining that pointers are outside the heap (used mostly in assertions |
131 // and verification). The estimate is conservative, ie, not all addresses in | 131 // and verification). The estimate is conservative, i.e., not all addresses in |
132 // 'allocated' space are actually allocated to our heap. The range is | 132 // 'allocated' space are actually allocated to our heap. The range is |
133 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 133 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
134 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); | 134 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); |
135 static void* highest_ever_allocated = reinterpret_cast<void*>(0); | 135 static void* highest_ever_allocated = reinterpret_cast<void*>(0); |
136 | 136 |
137 | 137 |
138 static void UpdateAllocatedSpaceLimits(void* address, int size) { | 138 static void UpdateAllocatedSpaceLimits(void* address, int size) { |
139 ASSERT(limit_mutex != NULL); | 139 ASSERT(limit_mutex != NULL); |
140 ScopedLock lock(limit_mutex); | 140 ScopedLock lock(limit_mutex); |
141 | 141 |
(...skipping 731 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
873 | 873 |
874 | 874 |
875 void Sampler::Stop() { | 875 void Sampler::Stop() { |
876 ASSERT(IsActive()); | 876 ASSERT(IsActive()); |
877 SignalSender::RemoveActiveSampler(this); | 877 SignalSender::RemoveActiveSampler(this); |
878 SetActive(false); | 878 SetActive(false); |
879 } | 879 } |
880 | 880 |
881 | 881 |
882 } } // namespace v8::internal | 882 } } // namespace v8::internal |
OLD | NEW |