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 180 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
191 !(x == 0 && (y != 0 && isfinite(y)))) { | 191 !(x == 0 && (y != 0 && isfinite(y)))) { |
192 x = fmod(x, y); | 192 x = fmod(x, y); |
193 } | 193 } |
194 return x; | 194 return x; |
195 } | 195 } |
196 | 196 |
197 #endif // _WIN64 | 197 #endif // _WIN64 |
198 | 198 |
199 // ---------------------------------------------------------------------------- | 199 // ---------------------------------------------------------------------------- |
200 // The Time class represents time on win32. A timestamp is represented as | 200 // The Time class represents time on win32. A timestamp is represented as |
201 // a 64-bit integer in 100 nano-seconds since January 1, 1601 (UTC). JavaScript | 201 // a 64-bit integer in 100 nanoseconds since January 1, 1601 (UTC). JavaScript |
202 // timestamps are represented as a doubles in milliseconds since 00:00:00 UTC, | 202 // timestamps are represented as a doubles in milliseconds since 00:00:00 UTC, |
203 // January 1, 1970. | 203 // January 1, 1970. |
204 | 204 |
205 class Time { | 205 class Time { |
206 public: | 206 public: |
207 // Constructors. | 207 // Constructors. |
208 Time(); | 208 Time(); |
209 explicit Time(double jstime); | 209 explicit Time(double jstime); |
210 Time(int year, int mon, int day, int hour, int min, int sec); | 210 Time(int year, int mon, int day, int hour, int min, int sec); |
211 | 211 |
(...skipping 557 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
769 if (n + 1 > buffer_size) // count for trailing '\0' | 769 if (n + 1 > buffer_size) // count for trailing '\0' |
770 n = _TRUNCATE; | 770 n = _TRUNCATE; |
771 int result = strncpy_s(dest.start(), dest.length(), src, n); | 771 int result = strncpy_s(dest.start(), dest.length(), src, n); |
772 USE(result); | 772 USE(result); |
773 ASSERT(result == 0 || (n == _TRUNCATE && result == STRUNCATE)); | 773 ASSERT(result == 0 || (n == _TRUNCATE && result == STRUNCATE)); |
774 } | 774 } |
775 | 775 |
776 | 776 |
777 // We keep the lowest and highest addresses mapped as a quick way of | 777 // We keep the lowest and highest addresses mapped as a quick way of |
778 // determining that pointers are outside the heap (used mostly in assertions | 778 // determining that pointers are outside the heap (used mostly in assertions |
779 // and verification). The estimate is conservative, ie, not all addresses in | 779 // and verification). The estimate is conservative, i.e., not all addresses in |
780 // 'allocated' space are actually allocated to our heap. The range is | 780 // 'allocated' space are actually allocated to our heap. The range is |
781 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 781 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
782 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); | 782 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); |
783 static void* highest_ever_allocated = reinterpret_cast<void*>(0); | 783 static void* highest_ever_allocated = reinterpret_cast<void*>(0); |
784 | 784 |
785 | 785 |
786 static void UpdateAllocatedSpaceLimits(void* address, int size) { | 786 static void UpdateAllocatedSpaceLimits(void* address, int size) { |
787 ASSERT(limit_mutex != NULL); | 787 ASSERT(limit_mutex != NULL); |
788 ScopedLock lock(limit_mutex); | 788 ScopedLock lock(limit_mutex); |
789 | 789 |
(...skipping 1248 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2038 | 2038 |
2039 | 2039 |
2040 void Sampler::Stop() { | 2040 void Sampler::Stop() { |
2041 ASSERT(IsActive()); | 2041 ASSERT(IsActive()); |
2042 SamplerThread::RemoveActiveSampler(this); | 2042 SamplerThread::RemoveActiveSampler(this); |
2043 SetActive(false); | 2043 SetActive(false); |
2044 } | 2044 } |
2045 | 2045 |
2046 | 2046 |
2047 } } // namespace v8::internal | 2047 } } // namespace v8::internal |
OLD | NEW |