Searched refs:hash_find_insert (Results 1 - 8 of 8) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A DphaseX.hpp71 Node *hash_find_insert(Node*);// If not in table insert else return found node
352 Node *hash_find_insert(Node *n){ return _table.hash_find_insert(n); } function in class:NodeHash::PhaseValues
H A Dloopopts.cpp1109 Node *hit1 = _igvn.hash_find_insert(phi1);
1117 Node *hit2 = _igvn.hash_find_insert(phi2);
1184 Node *hit1 = _igvn.hash_find_insert(phi1);
1192 Node *hit2 = _igvn.hash_find_insert(phi2);
1289 _igvn.hash_find_insert(nnn);
1465 Node *hit = _igvn.hash_find_insert(phi);
1482 Node *hit = _igvn.hash_find_insert(use);
2024 Node *hit = _igvn.hash_find_insert(phi);
H A DphaseX.cpp129 //------------------------------hash_find_insert-------------------------------
132 Node *NodeHash::hash_find_insert( Node *n ) { function in class:NodeHash
603 ConNode* k = (ConNode*)hash_find_insert(x); // Value numbering
726 i = hash_find_insert(k); // Insert if new
1130 i = hash_find_insert(k); // Check for pre-existing node
1275 hash_find_insert(use);
H A Dsplit_if.cpp279 // previously (the hash_find_insert below would always hit) so we can
292 Node *t = _igvn.hash_find_insert(phi_post);
H A Difnode.cpp1111 Node *prior = igvn->hash_find_insert(iff);
H A Dcfgnode.cpp680 gvn->hash_find_insert(phi);
H A Dcompile.cpp312 initial_gvn()->hash_find_insert(use);
H A Dloopnode.cpp1218 Node *p2 = igvn.hash_find_insert(p); // Look for a CSE

Completed in 83 milliseconds