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 194 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
205 return strndup(str, n); | 205 return strndup(str, n); |
206 } | 206 } |
207 | 207 |
208 | 208 |
209 double OS::nan_value() { | 209 double OS::nan_value() { |
210 return NAN; | 210 return NAN; |
211 } | 211 } |
212 | 212 |
213 | 213 |
214 int OS::ActivationFrameAlignment() { | 214 int OS::ActivationFrameAlignment() { |
215 // No constraint on Linux. | 215 // Floating point code runs faster if the stack is 8-byte aligned. |
216 return 0; | 216 return 8; |
217 } | 217 } |
218 | 218 |
219 | 219 |
220 // We keep the lowest and highest addresses mapped as a quick way of | 220 // We keep the lowest and highest addresses mapped as a quick way of |
221 // determining that pointers are outside the heap (used mostly in assertions | 221 // determining that pointers are outside the heap (used mostly in assertions |
222 // and verification). The estimate is conservative, ie, not all addresses in | 222 // and verification). The estimate is conservative, ie, not all addresses in |
223 // 'allocated' space are actually allocated to our heap. The range is | 223 // 'allocated' space are actually allocated to our heap. The range is |
224 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 224 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
225 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); | 225 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); |
226 static void* highest_ever_allocated = reinterpret_cast<void*>(0); | 226 static void* highest_ever_allocated = reinterpret_cast<void*>(0); |
(...skipping 627 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
854 } | 854 } |
855 | 855 |
856 // This sampler is no longer the active sampler. | 856 // This sampler is no longer the active sampler. |
857 active_sampler_ = NULL; | 857 active_sampler_ = NULL; |
858 active_ = false; | 858 active_ = false; |
859 } | 859 } |
860 | 860 |
861 #endif // ENABLE_LOGGING_AND_PROFILING | 861 #endif // ENABLE_LOGGING_AND_PROFILING |
862 | 862 |
863 } } // namespace v8::internal | 863 } } // namespace v8::internal |
OLD | NEW |