Lines Matching refs:top
61 // particular frame. Needs to know the top of the handler chain.
125 // frame code that computes the caller state to access the top
155 void StackFrameIterator::Reset(ThreadLocalTop* top) {
158 ExitFrame::GetStateForFramePointer(Isolate::c_entry_fp(top), &state);
159 handler_ = StackHandler::FromAddress(Isolate::handler(top));
164 void StackFrameIterator::Reset(ThreadLocalTop* top, wasm::StackMemory* stack) {
172 handler_ = StackHandler::FromAddress(Isolate::handler(top));
337 // Check if top stack frame is a bytecode handler stub frame.
362 ThreadLocalTop* top = isolate->thread_local_top();
387 } else if (IsValidTop(top)) {
388 type = ExitFrame::GetStateForFramePointer(Isolate::c_entry_fp(top), &state);
397 // If the current PC is in a bytecode handler, the top stack frame isn't
398 // the bytecode handler's frame and the top of stack or link register is a
459 bool SafeStackFrameIterator::IsValidTop(ThreadLocalTop* top) const {
460 Address c_entry_fp = Isolate::c_entry_fp(top);
463 Address handler = Isolate::handler(top);
465 // Check that there are no js frames on top of the native frames.
545 // top of them. In that case the scope corresponds to the first EXIT
546 // frame beneath it. There may be other EXIT frames on top of the
1781 // in the deoptimization translation are ordered bottom-to-top.
1911 // in the deoptimization translation are ordered bottom-to-top.
2211 // indicating how many values should be scanned from the top.
2227 // value indicating how many values should be scanned from the top.
2383 accumulator->Add(" // expression stack (top to bottom)\n");
2548 // the top of the reconstructed stack and popping it in
2604 // top of the reconstructed stack and popping it in