OLD | NEW |
---|---|
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 411 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
422 #endif // V8_INTERPRETED_REGEXP | 422 #endif // V8_INTERPRETED_REGEXP |
423 // Keyed lookup cache. | 423 // Keyed lookup cache. |
424 Add(ExternalReference::keyed_lookup_cache_keys(isolate).address(), | 424 Add(ExternalReference::keyed_lookup_cache_keys(isolate).address(), |
425 UNCLASSIFIED, | 425 UNCLASSIFIED, |
426 28, | 426 28, |
427 "KeyedLookupCache::keys()"); | 427 "KeyedLookupCache::keys()"); |
428 Add(ExternalReference::keyed_lookup_cache_field_offsets(isolate).address(), | 428 Add(ExternalReference::keyed_lookup_cache_field_offsets(isolate).address(), |
429 UNCLASSIFIED, | 429 UNCLASSIFIED, |
430 29, | 430 29, |
431 "KeyedLookupCache::field_offsets()"); | 431 "KeyedLookupCache::field_offsets()"); |
432 Add(ExternalReference::transcendental_cache_array_address(isolate).address(), | |
433 UNCLASSIFIED, | |
434 30, | |
435 "TranscendentalCache::caches()"); | |
436 Add(ExternalReference::handle_scope_next_address(isolate).address(), | 432 Add(ExternalReference::handle_scope_next_address(isolate).address(), |
437 UNCLASSIFIED, | 433 UNCLASSIFIED, |
438 31, | 434 31, |
Yang
2013/12/13 13:35:39
Do we want to change the numbers here now that 30
Sven Panne
2013/12/13 13:59:50
I think there is no need to do so. Furthermore, I'
| |
439 "HandleScope::next"); | 435 "HandleScope::next"); |
440 Add(ExternalReference::handle_scope_limit_address(isolate).address(), | 436 Add(ExternalReference::handle_scope_limit_address(isolate).address(), |
441 UNCLASSIFIED, | 437 UNCLASSIFIED, |
442 32, | 438 32, |
443 "HandleScope::limit"); | 439 "HandleScope::limit"); |
444 Add(ExternalReference::handle_scope_level_address(isolate).address(), | 440 Add(ExternalReference::handle_scope_level_address(isolate).address(), |
445 UNCLASSIFIED, | 441 UNCLASSIFIED, |
446 33, | 442 33, |
447 "HandleScope::level"); | 443 "HandleScope::level"); |
448 Add(ExternalReference::new_deoptimizer_function(isolate).address(), | 444 Add(ExternalReference::new_deoptimizer_function(isolate).address(), |
(...skipping 1412 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
1861 | 1857 |
1862 bool SnapshotByteSource::AtEOF() { | 1858 bool SnapshotByteSource::AtEOF() { |
1863 if (0u + length_ - position_ > 2 * sizeof(uint32_t)) return false; | 1859 if (0u + length_ - position_ > 2 * sizeof(uint32_t)) return false; |
1864 for (int x = position_; x < length_; x++) { | 1860 for (int x = position_; x < length_; x++) { |
1865 if (data_[x] != SerializerDeserializer::nop()) return false; | 1861 if (data_[x] != SerializerDeserializer::nop()) return false; |
1866 } | 1862 } |
1867 return true; | 1863 return true; |
1868 } | 1864 } |
1869 | 1865 |
1870 } } // namespace v8::internal | 1866 } } // namespace v8::internal |
OLD | NEW |