| 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 11 matching lines...) Expand all Loading... |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include "v8.h" | 28 #include "v8.h" |
| 29 | 29 |
| 30 #include "api.h" | 30 #include "api.h" |
| 31 #include "arguments.h" | 31 #include "arguments.h" |
| 32 #include "ast.h" |
| 32 #include "code-stubs.h" | 33 #include "code-stubs.h" |
| 33 #include "gdb-jit.h" | 34 #include "gdb-jit.h" |
| 34 #include "ic-inl.h" | 35 #include "ic-inl.h" |
| 35 #include "stub-cache.h" | 36 #include "stub-cache.h" |
| 36 #include "vm-state-inl.h" | 37 #include "vm-state-inl.h" |
| 37 | 38 |
| 38 namespace v8 { | 39 namespace v8 { |
| 39 namespace internal { | 40 namespace internal { |
| 40 | 41 |
| 41 // ----------------------------------------------------------------------- | 42 // ----------------------------------------------------------------------- |
| (...skipping 1112 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1154 Builtins::kIllegal); | 1155 Builtins::kIllegal); |
| 1155 } | 1156 } |
| 1156 for (int j = 0; j < kSecondaryTableSize; j++) { | 1157 for (int j = 0; j < kSecondaryTableSize; j++) { |
| 1157 secondary_[j].key = heap()->empty_string(); | 1158 secondary_[j].key = heap()->empty_string(); |
| 1158 secondary_[j].value = isolate_->builtins()->builtin( | 1159 secondary_[j].value = isolate_->builtins()->builtin( |
| 1159 Builtins::kIllegal); | 1160 Builtins::kIllegal); |
| 1160 } | 1161 } |
| 1161 } | 1162 } |
| 1162 | 1163 |
| 1163 | 1164 |
| 1164 void StubCache::CollectMatchingMaps(ZoneMapList* types, | 1165 void StubCache::CollectMatchingMaps(SmallMapList* types, |
| 1165 String* name, | 1166 String* name, |
| 1166 Code::Flags flags) { | 1167 Code::Flags flags) { |
| 1167 for (int i = 0; i < kPrimaryTableSize; i++) { | 1168 for (int i = 0; i < kPrimaryTableSize; i++) { |
| 1168 if (primary_[i].key == name) { | 1169 if (primary_[i].key == name) { |
| 1169 Map* map = primary_[i].value->FindFirstMap(); | 1170 Map* map = primary_[i].value->FindFirstMap(); |
| 1170 // Map can be NULL, if the stub is constant function call | 1171 // Map can be NULL, if the stub is constant function call |
| 1171 // with a primitive receiver. | 1172 // with a primitive receiver. |
| 1172 if (map == NULL) continue; | 1173 if (map == NULL) continue; |
| 1173 | 1174 |
| 1174 int offset = PrimaryOffset(name, flags, map); | 1175 int offset = PrimaryOffset(name, flags, map); |
| (...skipping 710 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1885 expected_receiver_type_ = | 1886 expected_receiver_type_ = |
| 1886 FunctionTemplateInfo::cast(signature->receiver()); | 1887 FunctionTemplateInfo::cast(signature->receiver()); |
| 1887 } | 1888 } |
| 1888 } | 1889 } |
| 1889 | 1890 |
| 1890 is_simple_api_call_ = true; | 1891 is_simple_api_call_ = true; |
| 1891 } | 1892 } |
| 1892 | 1893 |
| 1893 | 1894 |
| 1894 } } // namespace v8::internal | 1895 } } // namespace v8::internal |
| OLD | NEW |