OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // modification, are permitted provided that the following conditions are | 3 // found in the LICENSE file. |
4 // met: | |
5 // | |
6 // * Redistributions of source code must retain the above copyright | |
7 // notice, this list of conditions and the following disclaimer. | |
8 // * Redistributions in binary form must reproduce the above | |
9 // copyright notice, this list of conditions and the following | |
10 // disclaimer in the documentation and/or other materials provided | |
11 // with the distribution. | |
12 // * Neither the name of Google Inc. nor the names of its | |
13 // contributors may be used to endorse or promote products derived | |
14 // from this software without specific prior written permission. | |
15 // | |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
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. | |
27 | 4 |
28 #include "v8.h" | 5 #include "property.h" |
| 6 |
| 7 #include "handles-inl.h" |
29 | 8 |
30 namespace v8 { | 9 namespace v8 { |
31 namespace internal { | 10 namespace internal { |
32 | 11 |
33 | |
34 void LookupResult::Iterate(ObjectVisitor* visitor) { | 12 void LookupResult::Iterate(ObjectVisitor* visitor) { |
35 LookupResult* current = this; // Could be NULL. | 13 LookupResult* current = this; // Could be NULL. |
36 while (current != NULL) { | 14 while (current != NULL) { |
37 visitor->VisitPointer(BitCast<Object**>(¤t->holder_)); | 15 visitor->VisitPointer(BitCast<Object**>(¤t->holder_)); |
38 visitor->VisitPointer(BitCast<Object**>(¤t->transition_)); | 16 visitor->VisitPointer(BitCast<Object**>(¤t->transition_)); |
39 current = current->next_; | 17 current = current->next_; |
40 } | 18 } |
41 } | 19 } |
42 | 20 |
43 | 21 |
(...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
107 } | 85 } |
108 } | 86 } |
109 | 87 |
110 | 88 |
111 void Descriptor::Print(FILE* out) { | 89 void Descriptor::Print(FILE* out) { |
112 PrintF(out, "Descriptor "); | 90 PrintF(out, "Descriptor "); |
113 GetKey()->ShortPrint(out); | 91 GetKey()->ShortPrint(out); |
114 PrintF(out, " @ "); | 92 PrintF(out, " @ "); |
115 GetValue()->ShortPrint(out); | 93 GetValue()->ShortPrint(out); |
116 } | 94 } |
117 | |
118 | |
119 #endif | 95 #endif |
120 | 96 |
121 | |
122 } } // namespace v8::internal | 97 } } // namespace v8::internal |
OLD | NEW |