Cross Reference: /openjdk7/hotspot/src/share/vm/opto/cfgnode.cpp

Lines Matching refs:TOP
50     if( !n ) continue;          // Missing inputs are TOP
54   return Type::TOP;             // All paths dead?  Then so are we
446   // Remove TOP or NULL input paths. If only 1 input path remains, this Region
470       if( phase->type(n) == Type::TOP ) {
471         set_req(i, NULL);       // Ignore TOP inputs
563         // During IGVN phase such region will be subsumed by TOP node
564         // so region's phis will have TOP as control node.
807       if (in == NULL || igvn->type(in) == Type::TOP)
848     } else if (n->bottom_type() == Type::TOP
849                || (n->is_Mem() && n->in(MemNode::Address)->bottom_type() == Type::TOP)) {
886     return in(1) ? phase->type(in(1)) : Type::TOP;
890   if( phase->type_or_null(r) == Type::TOP )  // Dead code?
891     return Type::TOP;
903       if( lo && hi ) {            // Dying loops might have TOP here
934   const Type *t = Type::TOP;        // Merged type starting value
994       { assert(ft == Type::TOP, ""); } // Canonical empty value
1171     if (rc == NULL || phase->type(rc) == Type::TOP)
1177     if (un == NULL || un == this || phase->type(un) == Type::TOP) {
1439     if( phase->type(n) == Type::TOP ) return NULL;
1453     if( phase->type(n) == Type::TOP ) return NULL;
1599   if( phase->type_or_null(r) == Type::TOP ) // Dead code?
1618     if (rc == NULL || phase->type(rc) == Type::TOP) {
1641       return NULL;              // Identity will return TOP
1715         // to stop further optimizations for this phi. Identity will return TOP.
1826             // compress paths and change unreachable cycles to TOP
1942         if (ii->in(1)->bottom_type() != Type::TOP) {
2060   return Type::TOP;             // All paths dead?  Then so are we
2093   if( phase->type(in(0)) == Type::TOP ) return Type::TOP;
2107         f[CatchProjNode::fall_through_index] = Type::TOP;
2113           f[CatchProjNode::fall_through_index] = Type::TOP;
2179   if( phase->type(in(1)) == Type::TOP ) return in(1);
2180   if( phase->type(in(0)) == Type::TOP ) return in(0);
2195   if (!in(0) || in(0)->is_top()) return Type::TOP;