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 27 matching lines...) Expand all Loading... |
38 | 38 |
39 namespace v8 { | 39 namespace v8 { |
40 namespace internal { | 40 namespace internal { |
41 | 41 |
42 // ----------------------------------------------------------------------- | 42 // ----------------------------------------------------------------------- |
43 // StubCache implementation. | 43 // StubCache implementation. |
44 | 44 |
45 | 45 |
46 StubCache::StubCache(Isolate* isolate) : isolate_(isolate) { | 46 StubCache::StubCache(Isolate* isolate) : isolate_(isolate) { |
47 ASSERT(isolate == Isolate::Current()); | 47 ASSERT(isolate == Isolate::Current()); |
48 memset(primary_, 0, sizeof(primary_[0]) * StubCache::kPrimaryTableSize); | |
49 memset(secondary_, 0, sizeof(secondary_[0]) * StubCache::kSecondaryTableSize); | |
50 } | 48 } |
51 | 49 |
52 | 50 |
53 void StubCache::Initialize(bool create_heap_objects) { | 51 void StubCache::Initialize() { |
54 ASSERT(IsPowerOf2(kPrimaryTableSize)); | 52 ASSERT(IsPowerOf2(kPrimaryTableSize)); |
55 ASSERT(IsPowerOf2(kSecondaryTableSize)); | 53 ASSERT(IsPowerOf2(kSecondaryTableSize)); |
56 if (create_heap_objects) { | 54 Clear(); |
57 HandleScope scope; | |
58 Code* empty = isolate_->builtins()->builtin(Builtins::kIllegal); | |
59 for (int i = 0; i < kPrimaryTableSize; i++) { | |
60 primary_[i].key = heap()->empty_string(); | |
61 primary_[i].value = empty; | |
62 } | |
63 for (int j = 0; j < kSecondaryTableSize; j++) { | |
64 secondary_[j].key = heap()->empty_string(); | |
65 secondary_[j].value = empty; | |
66 } | |
67 } | |
68 } | 55 } |
69 | 56 |
70 | 57 |
71 Code* StubCache::Set(String* name, Map* map, Code* code) { | 58 Code* StubCache::Set(String* name, Map* map, Code* code) { |
72 // Get the flags from the code. | 59 // Get the flags from the code. |
73 Code::Flags flags = Code::RemoveTypeFromFlags(code->flags()); | 60 Code::Flags flags = Code::RemoveTypeFromFlags(code->flags()); |
74 | 61 |
75 // Validate that the name does not move on scavenge, and that we | 62 // Validate that the name does not move on scavenge, and that we |
76 // can use identity checks instead of string equality checks. | 63 // can use identity checks instead of string equality checks. |
77 ASSERT(!heap()->InNewSpace(name)); | 64 ASSERT(!heap()->InNewSpace(name)); |
(...skipping 1455 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1533 Handle<FunctionTemplateInfo>( | 1520 Handle<FunctionTemplateInfo>( |
1534 FunctionTemplateInfo::cast(signature->receiver())); | 1521 FunctionTemplateInfo::cast(signature->receiver())); |
1535 } | 1522 } |
1536 } | 1523 } |
1537 | 1524 |
1538 is_simple_api_call_ = true; | 1525 is_simple_api_call_ = true; |
1539 } | 1526 } |
1540 | 1527 |
1541 | 1528 |
1542 } } // namespace v8::internal | 1529 } } // namespace v8::internal |
OLD | NEW |