Lines Matching refs:ii
1891 Node *ii = in(i);
1895 if (ii == top) {
1898 if (ii->is_MergeMem()) {
1899 MergeMemNode* n = ii->as_MergeMem();
1917 Node *ii = in(i);
1918 if (ii->is_MergeMem()) {
1919 MergeMemNode* n = ii->as_MergeMem();
1932 if (new_mem != ii) {
1967 Node *ii = in(i);
1968 if (ii->is_MergeMem()) {
1969 MergeMemNode* n = ii->as_MergeMem();
2017 Node *ii = in(i);
2018 Node *new_in = MemNode::optimize_memory_chain(ii, at, NULL, phase);
2019 if (ii != new_in ) {
2034 Node *ii = in(i);
2035 if (ii->is_DecodeNarrowPtr() && ii->bottom_type() == bottom_type()) {
2037 if (ii->in(1)->bottom_type() != Type::TOP) {
2039 is_decodeN = ii->is_DecodeN();
2041 } else if (!ii->is_Phi()) {
2058 Node *ii = in(i);
2060 if (ii->is_DecodeNarrowPtr()) {
2061 assert(ii->bottom_type() == bottom_type(), "sanity");
2062 new_ii = ii->in(1);
2064 assert(ii->is_Phi(), "sanity");
2065 if (ii->as_Phi() == this) {
2069 new_ii = new EncodePNode(ii, narrow_t);
2071 new_ii = new EncodePKlassNode(ii, narrow_t);