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 176 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
187 void OS::WcsCpy(Vector<wchar_t> dest, const wchar_t* src) { | 187 void OS::WcsCpy(Vector<wchar_t> dest, const wchar_t* src) { |
188 wcscpy(dest.start(), src); | 188 wcscpy(dest.start(), src); |
189 } | 189 } |
190 | 190 |
191 | 191 |
192 char *OS::StrDup(const char* str) { | 192 char *OS::StrDup(const char* str) { |
193 return strdup(str); | 193 return strdup(str); |
194 } | 194 } |
195 | 195 |
196 | 196 |
197 double OS::nan_value() { return NAN; } | 197 double OS::nan_value() { |
| 198 return NAN; |
| 199 } |
| 200 |
| 201 |
| 202 int OS::ActivationFrameAlignment() { |
| 203 // No constraint on Linux. |
| 204 return 0; |
| 205 } |
| 206 |
198 | 207 |
199 // We keep the lowest and highest addresses mapped as a quick way of | 208 // We keep the lowest and highest addresses mapped as a quick way of |
200 // determining that pointers are outside the heap (used mostly in assertions | 209 // determining that pointers are outside the heap (used mostly in assertions |
201 // and verification). The estimate is conservative, ie, not all addresses in | 210 // and verification). The estimate is conservative, ie, not all addresses in |
202 // 'allocated' space are actually allocated to our heap. The range is | 211 // 'allocated' space are actually allocated to our heap. The range is |
203 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 212 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
204 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); | 213 static void* lowest_ever_allocated = reinterpret_cast<void*>(-1); |
205 static void* highest_ever_allocated = reinterpret_cast<void*>(0); | 214 static void* highest_ever_allocated = reinterpret_cast<void*>(0); |
206 | 215 |
207 | 216 |
(...skipping 469 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
677 } | 686 } |
678 | 687 |
679 // This sampler is no longer the active sampler. | 688 // This sampler is no longer the active sampler. |
680 active_sampler_ = NULL; | 689 active_sampler_ = NULL; |
681 active_ = false; | 690 active_ = false; |
682 } | 691 } |
683 | 692 |
684 #endif // ENABLE_LOGGING_AND_PROFILING | 693 #endif // ENABLE_LOGGING_AND_PROFILING |
685 | 694 |
686 } } // namespace v8::internal | 695 } } // namespace v8::internal |
OLD | NEW |