Lines Matching defs:out
980 void Object::ShortPrint(FILE* out) {
984 accumulator.OutputToFile(out);
997 void Smi::SmiPrint(FILE* out) {
998 PrintF(out, "%d", value());
1738 void HeapNumber::HeapNumberPrint(FILE* out) {
1739 PrintF(out, "%.16g", Number());
6404 // If we only want own properties we bail out after the first
10121 void JSFunction::PrintName(FILE* out) {
10123 PrintF(out, "%s", name.get());
11142 void Code::PrintDeoptLocation(FILE* out, int bailout_id) {
11156 PrintF(out, " %s\n", last_comment);
11192 void DeoptimizationInputData::DeoptimizationInputDataPrint(FILE* out) {
11195 PrintF(out, "Deoptimization Input Data (deopt points = %d)\n", deopt_count);
11198 PrintF(out, "%6s %6s %6s %6s %12s\n", "index", "ast id", "argc", "pc",
11201 PrintF(out, "%6d %6d %6d %6d",
11208 PrintF(out, "\n");
11219 PrintF(out, " %s {frame count=%d, js frame count=%d}\n",
11227 PrintF(out, "%24s %s ", "", Translation::StringFor(opcode));
11238 PrintF(out, "{ast_id=%d, function=", ast_id);
11241 JSFunction::cast(function)->PrintName(out);
11243 PrintF(out, "<self>");
11245 PrintF(out, ", height=%u}", height);
11251 PrintF(out, "{kind=%d}", stub_kind);
11261 PrintF(out, "{function=");
11262 function->PrintName(out);
11263 PrintF(out, ", height=%u}", height);
11272 PrintF(out, "{function=");
11273 function->PrintName(out);
11274 PrintF(out, "}");
11280 PrintF(out, "{input=%s}", converter.NameOfCPURegister(reg_code));
11286 PrintF(out, "{input=%s}", converter.NameOfCPURegister(reg_code));
11292 PrintF(out, "{input=%s (unsigned)}",
11299 PrintF(out, "{input=%s}",
11306 PrintF(out, "{input=%d}", input_slot_index);
11312 PrintF(out, "{input=%d}", input_slot_index);
11318 PrintF(out, "{input=%d (unsigned)}", input_slot_index);
11324 PrintF(out, "{input=%d}", input_slot_index);
11330 PrintF(out, "{literal_id=%u}", literal_index);
11336 PrintF(out, "{object_index=%d}", object_index);
11343 PrintF(out, "{length=%d}", args_length);
11347 PrintF(out, "\n");
11353 void DeoptimizationOutputData::DeoptimizationOutputDataPrint(FILE* out) {
11354 PrintF(out, "Deoptimization Output Data (deopt points = %d)\n",
11358 PrintF(out, "%6s %8s %s\n", "ast id", "pc", "state");
11361 PrintF(out, "%6d %8d %s\n",
11396 void Code::PrintExtraICState(FILE* out, Kind kind, ExtraICState extra) {
11397 PrintF(out, "extra_ic_state = ");
11408 PrintF(out, "%s\n", name);
11410 PrintF(out, "%d\n", extra);
11415 void Code::Disassemble(const char* name, FILE* out) {
11416 PrintF(out, "kind = %s\n", Kind2String(kind()));
11418 PrintF(out, "major_key = %s\n",
11422 PrintF(out, "ic_state = %s\n", ICState2String(ic_state()));
11423 PrintExtraICState(out, kind(), extra_ic_state());
11425 PrintF(out, "type = %s\n", StubType2String(type()));
11433 PrintF(out, "compare_state = %s*%s -> %s\n",
11437 PrintF(out, "compare_operation = %s\n", Token::Name(op));
11441 PrintF(out, "name = %s\n", name);
11444 PrintF(out, "stack_slots = %d\n", stack_slots());
11447 PrintF(out, "Instructions (size = %d)\n", instruction_size());
11448 Disassembler::Decode(out, this);
11449 PrintF(out, "\n");
11454 data->DeoptimizationOutputDataPrint(out);
11458 data->DeoptimizationInputDataPrint(out);
11460 PrintF(out, "\n");
11464 PrintF(out, "Safepoints (size = %u)\n", table.size());
11467 PrintF(out, "%p %4d ", (instruction_start() + pc_offset), pc_offset);
11468 table.PrintEntry(i, out);
11469 PrintF(out, " (sp -> fp)");
11472 PrintF(out, " %6d", entry.deoptimization_index());
11474 PrintF(out, " <none>");
11477 PrintF(out, " argc: %d", entry.argument_count());
11479 PrintF(out, "\n");
11481 PrintF(out, "\n");
11490 PrintF(out, "Back edges (size = %u)\n", back_edges.length());
11491 PrintF(out, "ast_id pc_offset loop_depth\n");
11494 PrintF(out, "%6d %9u %10u\n", back_edges.ast_id(i).ToInt(),
11499 PrintF(out, "\n");
11503 TypeFeedbackInfo::cast(type_feedback_info())->TypeFeedbackInfoPrint(out);
11504 PrintF(out, "\n");
11509 PrintF(out, "RelocInfo (size = %d)\n", relocation_size());
11511 it.rinfo()->Print(GetIsolate(), out);
11513 PrintF(out, "\n");
13561 void Dictionary<Derived, Shape, Key>::Print(FILE* out) {
13566 PrintF(out, " ");
13568 String::cast(k)->StringPrint(out);
13570 k->ShortPrint(out);
13572 PrintF(out, ": ");
13573 ValueAt(i)->ShortPrint(out);
13574 PrintF(out, "\n");
14365 // 1. Move the check if the key is unique out of the loop.
14764 // Bail out and do the sorting of undefineds and array holes in JS.
14765 // Also bail out if the element is not supposed to be moved.
16034 // Don't need to grow if we can simply clear out deleted entries instead.
