Lines Matching defs:code
6 // * Redistributions of source code must retain the above copyright
116 // frame code that computes the caller state to access the top
368 Code* StackFrame::GetSafepointData(Isolate* isolate,
376 entry->safepoint_entry = entry->code->GetSafepointEntry(pc);
379 ASSERT(entry->safepoint_entry.Equals(entry->code->GetSafepointEntry(pc)));
382 // Fill in the results and return the code.
383 Code* code = entry->code;
385 *stack_slots = code->stack_slots();
386 return code;
398 Code* holder) {
402 Object* code = holder;
403 v->VisitPointer(&code);
404 if (code != holder) {
405 holder = reinterpret_cast<Code*>(code);
428 Code::Kind kind = GetContainingCode(isolate, *(state->pc_address))->kind();
429 ASSERT(kind == Code::FUNCTION || kind == Code::OPTIMIZED_FUNCTION);
430 return (kind == Code::OPTIMIZED_FUNCTION) ? OPTIMIZED : JAVA_SCRIPT;
443 Code* EntryFrame::unchecked_code() const {
466 Code* EntryConstructFrame::unchecked_code() const {
477 Code* ExitFrame::unchecked_code() const {
478 return reinterpret_cast<Code*>(code_slot());
578 Code* code = StackFrame::GetSafepointData(
635 IteratePc(v, pc_address(), code);
649 Code* JavaScriptFrame::unchecked_code() const {
677 Code* code_pointer = LookupCode();
695 if (code_->kind() == Code::FUNCTION) PrintF(" NON-OPT");
696 if (code_->kind() == Code::OPTIMIZED_FUNCTION) PrintF(" OPT");
765 Code* code = function->shared()->code();
767 DeoptimizationOutputData::cast(code->deoptimization_data());
772 FullCodeGenerator::PcField::decode(entry) + Code::kHeaderSize;
775 FrameSummary summary(receiver, function, code, pc_offset, is_constructor);
790 Code* code = opt_function->code();
792 // The code object may have been replaced by lazy deoptimization. Fall
794 // code object.
795 if (!code->contains(pc())) {
796 code = isolate()->pc_to_code_cache()->GcSafeFindCodeForPc(pc());
798 ASSERT(code != NULL);
799 ASSERT(code->kind() == Code::OPTIMIZED_FUNCTION);
801 SafepointEntry safepoint_entry = code->GetSafepointEntry(pc());
805 return DeoptimizationInputData::cast(code->deoptimization_data());
854 Code* ArgumentsAdaptorFrame::unchecked_code() const {
860 Code* InternalFrame::unchecked_code() const {
862 Object* code = Memory::Object_at(fp() + offset);
863 ASSERT(code != NULL);
864 return reinterpret_cast<Code*>(code);
884 Code* code = NULL;
886 accumulator->PrintFunction(function, receiver, &code);
900 if (code != NULL && code->kind() == Code::FUNCTION &&
901 pc >= code->instruction_start() && pc < code->instruction_end()) {
902 int source_pos = code->SourcePosition(pc);
917 // Get scope information for nicer output, if possible. If code is
1002 if (FLAG_max_stack_trace_source_length != 0 && code != NULL) {
1112 Code* PcToCodeCache::GcSafeCastToCode(HeapObject* object, Address pc) {
1113 Code* code = reinterpret_cast<Code*>(object);
1114 ASSERT(code != NULL && code->contains(pc));
1115 return code;
1119 Code* PcToCodeCache::GcSafeFindCodeForPc(Address pc) {
1149 ASSERT(entry->code == GcSafeFindCodeForPc(pc));
1151 // Because this code may be interrupted by a profiling signal that
1152 // also queries the cache, we cannot update pc before the code has
1154 // the code has been computed.
1155 entry->code = GcSafeFindCodeForPc(pc);
