vm/opto/graphKit.cpp

132 // until they have been handed to gvn.transform.
680   outer_map->set_control(kit->gvn().transform( new IfTrueNode(iff) ));
681   inner_map->set_control(kit->gvn().transform( new IfFalseNode(iff) ));
713   gvn().set_type_bottom(mem);
722   gvn().set_type_bottom(clonemap);
1467   gvn().set_type_bottom(mergemem);
2121       // the call, dstore_rounding does gvn.transform
2302     // dstore_rounding() does gvn.transform
2348 // gvn to   opt_test    |   |
2572 static IfNode* gen_subtype_check_compare(Node* ctrl, Node* in1, Node* in2, BoolTest::mask test, float p, PhaseGVN* gvn, BasicType bt) {
2579   gvn->transform(cmp);
2580   Node* bol = gvn->transform(new BoolNode(cmp, test));
2582   gvn->transform(iff);
2583   if (!bol->is_Con()) gvn->record_for_igvn(iff);
2596 Node* Phase::gen_subtype_check(Node* subklass, Node* superklass, Node** ctrl, MergeMemNode* mem, PhaseGVN* gvn) {
2597   Compile* C = gvn->C;
2609   if (gvn->type(superklass)->singleton()) {
2610     ciKlass* superk = gvn->type(superklass)->is_klassptr()->klass();
2611     ciKlass* subk   = gvn->type(subklass)->is_klassptr()->klass();
2626         *ctrl = gvn->C->top();
2634         IfNode* iff = gen_subtype_check_compare(*ctrl, subklass, superklass, BoolTest::eq, PROB_STATIC_FREQUENT, gvn, T_ADDRESS);
2635         *ctrl = gvn->transform(new IfTrueNode(iff));
2636         return gvn->transform(new IfFalseNode(iff));
2650   Node *p1 = gvn->transform(new AddPNode(superklass, superklass, gvn->MakeConX(in_bytes(Klass::super_check_offset_offset()))));
2651   Node* m = mem->memory_at(C->get_alias_index(gvn->type(p1)->is_ptr()));
2652   Node *chk_off = gvn->transform(new LoadINode(NULL, m, p1, gvn->type(p1)->is_ptr(), TypeInt::INT, MemNode::unordered));
2654   bool might_be_cache = (gvn->find_int_con(chk_off, cacheoff_con) == cacheoff_con);
2664   chk_off_X = gvn->transform(new ConvI2LNode(chk_off_X));
2666   Node *p2 = gvn->transform(new AddPNode(subklass,subklass,chk_off_X));
2670   m = mem->memory_at(C->get_alias_index(gvn->type(p2)->is_ptr()));
2672   Node *nkls = gvn->transform(LoadKlassNode::make(*gvn, NULL, kmem, p2, gvn->type(p2)->is_ptr(), TypeKlassPtr::OBJECT_OR_NULL));
2681   IfNode *iff1 = gen_subtype_check_compare(*ctrl, superklass, nkls, BoolTest::eq, PROB_LIKELY(0.83f), gvn, T_ADDRESS);
2682   Node *iftrue1 = gvn->transform( new IfTrueNode (iff1));
2683   *ctrl = gvn->transform(new IfFalseNode(iff1));
2697   gvn->record_for_igvn(r_ok_subtype);
2699   gvn->record_for_igvn(r_not_subtype);
2708   Node *cacheoff = gvn->intcon(cacheoff_con);
2709   IfNode *iff2 = gen_subtype_check_compare(*ctrl, chk_off, cacheoff, BoolTest::ne, PROB_LIKELY(0.63f), gvn, T_INT);
2710   r_not_subtype->init_req(1, gvn->transform(new IfTrueNode (iff2)));
2711   *ctrl = gvn->transform(new IfFalseNode(iff2));
2716   IfNode *iff3 = gen_subtype_check_compare(*ctrl, subklass, superklass, BoolTest::eq, PROB_LIKELY(0.36f), gvn, T_ADDRESS);
2717   r_ok_subtype->init_req(2, gvn->transform(new IfTrueNode(iff3)));
2718   *ctrl = gvn->transform(new IfFalseNode(iff3));
2741   Node* psc = gvn->transform(
2744   IfNode *iff4 = gen_subtype_check_compare(*ctrl, psc, gvn->zerocon(T_OBJECT), BoolTest::ne, PROB_FAIR, gvn, T_ADDRESS);
2745   r_not_subtype->init_req(2, gvn->transform(new IfTrueNode (iff4)));
2746   r_ok_subtype ->init_req(3, gvn->transform(new IfFalseNode(iff4)));
2749   *ctrl = gvn->transform(r_ok_subtype);
2750   return gvn->transform(r_not_subtype);
4480   gvn().set_type(head, Type::CONTROL);
4485   gvn().set_type(i_byte, TypeInt::INT);
4490   gvn().set_type(i_char, TypeInt::INT);
4494   gvn().set_type(mem, Type::MEMORY);