Lines Matching refs:node
44 const char *IdealGraphPrinter::NODE_ELEMENT = "node";
398 // Output node
405 Node *node = n;
407 node->_in_dump_cnt++;
408 print_prop(NODE_NAME_PROPERTY, (const char *)node->Name());
409 const Type *t = node->bottom_type();
411 print_prop("idx", node->_idx);
413 print_prop("debug_idx", node->_debug_idx);
417 Block *block = C->cfg()->_bbs[node->_idx];
425 const jushort flags = node->flags();
455 if (C->matcher()->is_shared(node)) {
460 if (C->matcher()->is_dontcare(node)) {
467 Node* old = C->matcher()->find_old_node(node);
474 if (node->is_Proj()) {
475 print_prop("con", (int)node->as_Proj()->_con);
478 if (node->is_Mach()) {
479 print_prop("idealOpcode", (const char *)NodeClassNames[node->as_Mach()->ideal_Opcode()]);
485 node->dump_spec(&s2);
500 MemNode::dump_adr_type(node, node->adr_type(), &s2);
506 if (node->is_block_proj()) {
510 if (node->is_block_start()) {
515 if (strcmp(node->Name(), "Parm") == 0 && node->as_Proj()->_con >= TypeFunc::Parms) {
516 int index = node->as_Proj()->_con - TypeFunc::Parms;
523 } else if (strcmp(node->Name(), "IfTrue") == 0) {
525 } else if (strcmp(node->Name(), "IfFalse") == 0) {
527 } else if ((node->is_Con() && node->is_Type()) || node->is_Proj()) {
576 if (node->is_SafePoint()) {
577 caller = node->as_SafePoint()->jvms();
579 Node_Notes* notes = C->node_notes_at(node->_idx);
604 if (node->debug_orig() != NULL) {
607 Node* dorig = node->debug_orig();
617 _chaitin->dump_register(node, buffer);
619 print_prop("lrg", _chaitin->n2lidx(node));
622 node->_in_dump_cnt--;
677 void IdealGraphPrinter::print(Compile* compile, const char *name, Node *node, int level, bool clear_nodes) {
693 walk_nodes(node, false, &temp_set);
697 walk_nodes(node, true, &temp_set);