| 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 1004 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1015 | 1015 |
| 1016 // Iterate over all roots. Stack frames may have pointer into original code, | 1016 // Iterate over all roots. Stack frames may have pointer into original code, |
| 1017 // so temporary replace the pointers with offset numbers | 1017 // so temporary replace the pointers with offset numbers |
| 1018 // in prologue/epilogue. | 1018 // in prologue/epilogue. |
| 1019 { | 1019 { |
| 1020 HEAP->IterateStrongRoots(&visitor, VISIT_ALL); | 1020 HEAP->IterateStrongRoots(&visitor, VISIT_ALL); |
| 1021 } | 1021 } |
| 1022 | 1022 |
| 1023 // Now iterate over all pointers of all objects, including code_target | 1023 // Now iterate over all pointers of all objects, including code_target |
| 1024 // implicit pointers. | 1024 // implicit pointers. |
| 1025 for (HeapObject* obj = iterator.Next(); obj != NULL; obj = iterator.Next()) { | 1025 for (HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next()) { |
| 1026 obj->Iterate(&visitor); | 1026 obj->Iterate(&visitor); |
| 1027 } | 1027 } |
| 1028 | 1028 |
| 1029 visitor.Replace(substitution); | 1029 visitor.Replace(substitution); |
| 1030 } | 1030 } |
| 1031 | 1031 |
| 1032 | 1032 |
| 1033 // Check whether the code is natural function code (not a lazy-compile stub | 1033 // Check whether the code is natural function code (not a lazy-compile stub |
| 1034 // code). | 1034 // code). |
| 1035 static bool IsJSFunctionCode(Code* code) { | 1035 static bool IsJSFunctionCode(Code* code) { |
| (...skipping 751 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1787 | 1787 |
| 1788 bool LiveEditFunctionTracker::IsActive(Isolate* isolate) { | 1788 bool LiveEditFunctionTracker::IsActive(Isolate* isolate) { |
| 1789 return false; | 1789 return false; |
| 1790 } | 1790 } |
| 1791 | 1791 |
| 1792 #endif // ENABLE_DEBUGGER_SUPPORT | 1792 #endif // ENABLE_DEBUGGER_SUPPORT |
| 1793 | 1793 |
| 1794 | 1794 |
| 1795 | 1795 |
| 1796 } } // namespace v8::internal | 1796 } } // namespace v8::internal |
| OLD | NEW |