| 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 13 matching lines...) Expand all Loading... |
| 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 namespace v8 { | 30 namespace v8 { |
| 31 namespace internal { | 31 namespace internal { |
| 32 | 32 |
| 33 | 33 |
| 34 void LookupResult::Iterate(ObjectVisitor* visitor) { |
| 35 LookupResult* current = this; // Could be NULL. |
| 36 while (current != NULL) { |
| 37 visitor->VisitPointer(BitCast<Object**>(¤t->holder_)); |
| 38 current = current->next_; |
| 39 } |
| 40 } |
| 41 |
| 42 |
| 34 #ifdef OBJECT_PRINT | 43 #ifdef OBJECT_PRINT |
| 35 void LookupResult::Print(FILE* out) { | 44 void LookupResult::Print(FILE* out) { |
| 36 if (!IsFound()) { | 45 if (!IsFound()) { |
| 37 PrintF(out, "Not Found\n"); | 46 PrintF(out, "Not Found\n"); |
| 38 return; | 47 return; |
| 39 } | 48 } |
| 40 | 49 |
| 41 PrintF(out, "LookupResult:\n"); | 50 PrintF(out, "LookupResult:\n"); |
| 42 PrintF(out, " -cacheable = %s\n", IsCacheable() ? "true" : "false"); | 51 PrintF(out, " -cacheable = %s\n", IsCacheable() ? "true" : "false"); |
| 43 PrintF(out, " -attributes = %x\n", GetAttributes()); | 52 PrintF(out, " -attributes = %x\n", GetAttributes()); |
| (...skipping 52 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 96 PrintF(out, " @ "); | 105 PrintF(out, " @ "); |
| 97 GetValue()->ShortPrint(out); | 106 GetValue()->ShortPrint(out); |
| 98 PrintF(out, " %d\n", GetDetails().index()); | 107 PrintF(out, " %d\n", GetDetails().index()); |
| 99 } | 108 } |
| 100 | 109 |
| 101 | 110 |
| 102 #endif | 111 #endif |
| 103 | 112 |
| 104 | 113 |
| 105 } } // namespace v8::internal | 114 } } // namespace v8::internal |
| OLD | NEW |