| 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 172 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 183 return n; | 183 return n; |
| 184 } | 184 } |
| 185 } | 185 } |
| 186 | 186 |
| 187 | 187 |
| 188 void OS::StrNCpy(Vector<char> dest, const char* src, size_t n) { | 188 void OS::StrNCpy(Vector<char> dest, const char* src, size_t n) { |
| 189 strncpy(dest.start(), src, n); | 189 strncpy(dest.start(), src, n); |
| 190 } | 190 } |
| 191 | 191 |
| 192 | 192 |
| 193 void OS::WcsCpy(Vector<wchar_t> dest, const wchar_t* src) { | |
| 194 wcscpy(dest.start(), src); | |
| 195 } | |
| 196 | |
| 197 | |
| 198 char *OS::StrDup(const char* str) { | 193 char *OS::StrDup(const char* str) { |
| 199 return strdup(str); | 194 return strdup(str); |
| 200 } | 195 } |
| 201 | 196 |
| 202 | 197 |
| 203 // We keep the lowest and highest addresses mapped as a quick way of | 198 // We keep the lowest and highest addresses mapped as a quick way of |
| 204 // determining that pointers are outside the heap (used mostly in assertions | 199 // determining that pointers are outside the heap (used mostly in assertions |
| 205 // and verification). The estimate is conservative, ie, not all addresses in | 200 // and verification). The estimate is conservative, ie, not all addresses in |
| 206 // 'allocated' space are actually allocated to our heap. The range is | 201 // 'allocated' space are actually allocated to our heap. The range is |
| 207 // [lowest, highest), inclusive on the low and and exclusive on the high end. | 202 // [lowest, highest), inclusive on the low and and exclusive on the high end. |
| (...skipping 435 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 643 } | 638 } |
| 644 | 639 |
| 645 // This sampler is no longer the active sampler. | 640 // This sampler is no longer the active sampler. |
| 646 active_sampler_ = NULL; | 641 active_sampler_ = NULL; |
| 647 active_ = false; | 642 active_ = false; |
| 648 } | 643 } |
| 649 | 644 |
| 650 #endif // ENABLE_LOGGING_AND_PROFILING | 645 #endif // ENABLE_LOGGING_AND_PROFILING |
| 651 | 646 |
| 652 } } // namespace v8::internal | 647 } } // namespace v8::internal |
| OLD | NEW |