| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 337 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 348 ASSERT(thread->stack_is_cooked()); | 348 ASSERT(thread->stack_is_cooked()); |
| 349 for (StackFrameIterator it(thread); !it.done(); it.Advance()) { | 349 for (StackFrameIterator it(thread); !it.done(); it.Advance()) { |
| 350 it.frame()->Uncook(); | 350 it.frame()->Uncook(); |
| 351 } | 351 } |
| 352 thread->set_stack_is_cooked(false); | 352 thread->set_stack_is_cooked(false); |
| 353 } | 353 } |
| 354 | 354 |
| 355 | 355 |
| 356 void StackFrame::Cook() { | 356 void StackFrame::Cook() { |
| 357 Code* code = this->code(); | 357 Code* code = this->code(); |
| 358 ASSERT(code->IsCode()); |
| 358 for (StackHandlerIterator it(this, top_handler()); !it.done(); it.Advance()) { | 359 for (StackHandlerIterator it(this, top_handler()); !it.done(); it.Advance()) { |
| 359 it.handler()->Cook(code); | 360 it.handler()->Cook(code); |
| 360 } | 361 } |
| 362 printf("Cook %p (%d)\n", (void*)(pc()), code->kind()); |
| 361 ASSERT(code->contains(pc())); | 363 ASSERT(code->contains(pc())); |
| 362 set_pc(AddressFrom<Address>(pc() - code->instruction_start())); | 364 set_pc(AddressFrom<Address>(pc() - code->instruction_start())); |
| 363 } | 365 } |
| 364 | 366 |
| 365 | 367 |
| 366 void StackFrame::Uncook() { | 368 void StackFrame::Uncook() { |
| 367 Code* code = this->code(); | 369 Code* code = this->code(); |
| 370 ASSERT(code->IsCode()); |
| 368 for (StackHandlerIterator it(this, top_handler()); !it.done(); it.Advance()) { | 371 for (StackHandlerIterator it(this, top_handler()); !it.done(); it.Advance()) { |
| 369 it.handler()->Uncook(code); | 372 it.handler()->Uncook(code); |
| 370 } | 373 } |
| 371 set_pc(code->instruction_start() + OffsetFrom(pc())); | 374 set_pc(code->instruction_start() + OffsetFrom(pc())); |
| 375 printf("Uncook %p (%d)\n", (void*)(pc()), code->kind()); |
| 372 ASSERT(code->contains(pc())); | 376 ASSERT(code->contains(pc())); |
| 373 } | 377 } |
| 374 | 378 |
| 375 | 379 |
| 376 StackFrame::Type StackFrame::GetCallerState(State* state) const { | 380 StackFrame::Type StackFrame::GetCallerState(State* state) const { |
| 377 ComputeCallerState(state); | 381 ComputeCallerState(state); |
| 378 return ComputeType(state); | 382 return ComputeType(state); |
| 379 } | 383 } |
| 380 | 384 |
| 381 | 385 |
| (...skipping 366 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 748 reg_code[i++] = r; | 752 reg_code[i++] = r; |
| 749 | 753 |
| 750 ASSERT(i == kNumJSCallerSaved); | 754 ASSERT(i == kNumJSCallerSaved); |
| 751 } | 755 } |
| 752 ASSERT(0 <= n && n < kNumJSCallerSaved); | 756 ASSERT(0 <= n && n < kNumJSCallerSaved); |
| 753 return reg_code[n]; | 757 return reg_code[n]; |
| 754 } | 758 } |
| 755 | 759 |
| 756 | 760 |
| 757 } } // namespace v8::internal | 761 } } // namespace v8::internal |
| OLD | NEW |