| 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 857 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 868 int jsframe_count = it.Next(); | 868 int jsframe_count = it.Next(); |
| 869 | 869 |
| 870 // We create the summary in reverse order because the frames | 870 // We create the summary in reverse order because the frames |
| 871 // in the deoptimization translation are ordered bottom-to-top. | 871 // in the deoptimization translation are ordered bottom-to-top. |
| 872 bool is_constructor = IsConstructor(); | 872 bool is_constructor = IsConstructor(); |
| 873 int i = jsframe_count; | 873 int i = jsframe_count; |
| 874 while (i > 0) { | 874 while (i > 0) { |
| 875 opcode = static_cast<Translation::Opcode>(it.Next()); | 875 opcode = static_cast<Translation::Opcode>(it.Next()); |
| 876 if (opcode == Translation::JS_FRAME) { | 876 if (opcode == Translation::JS_FRAME) { |
| 877 i--; | 877 i--; |
| 878 int ast_id = it.Next(); | 878 BailoutId ast_id = BailoutId(it.Next()); |
| 879 JSFunction* function = LiteralAt(literal_array, it.Next()); | 879 JSFunction* function = LiteralAt(literal_array, it.Next()); |
| 880 it.Next(); // Skip height. | 880 it.Next(); // Skip height. |
| 881 | 881 |
| 882 // The translation commands are ordered and the receiver is always | 882 // The translation commands are ordered and the receiver is always |
| 883 // at the first position. Since we are always at a call when we need | 883 // at the first position. Since we are always at a call when we need |
| 884 // to construct a stack trace, the receiver is always in a stack slot. | 884 // to construct a stack trace, the receiver is always in a stack slot. |
| 885 opcode = static_cast<Translation::Opcode>(it.Next()); | 885 opcode = static_cast<Translation::Opcode>(it.Next()); |
| 886 ASSERT(opcode == Translation::STACK_SLOT || | 886 ASSERT(opcode == Translation::STACK_SLOT || |
| 887 opcode == Translation::LITERAL); | 887 opcode == Translation::LITERAL); |
| 888 int index = it.Next(); | 888 int index = it.Next(); |
| (...skipping 547 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1436 ZoneList<StackFrame*> list(10, zone); | 1436 ZoneList<StackFrame*> list(10, zone); |
| 1437 for (StackFrameIterator it; !it.done(); it.Advance()) { | 1437 for (StackFrameIterator it; !it.done(); it.Advance()) { |
| 1438 StackFrame* frame = AllocateFrameCopy(it.frame(), zone); | 1438 StackFrame* frame = AllocateFrameCopy(it.frame(), zone); |
| 1439 list.Add(frame, zone); | 1439 list.Add(frame, zone); |
| 1440 } | 1440 } |
| 1441 return list.ToVector(); | 1441 return list.ToVector(); |
| 1442 } | 1442 } |
| 1443 | 1443 |
| 1444 | 1444 |
| 1445 } } // namespace v8::internal | 1445 } } // namespace v8::internal |
| OLD | NEW |