Searched defs:LCA (Results 1 - 4 of 4) sorted by relevance
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | klass.cpp | 89 // Find LCA in class hierarchy 90 Klass *Klass::LCA( Klass *k2 ) { function in class:Klass
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | block.hpp | 137 uint _dom_depth; // Depth in dominator tree for fast LCA 150 Block* dom_lca(Block* that); // Compute LCA in dominator tree. 176 // Mark and visited bits for an LCA calculation in insert_anti_dependences. 372 Block* insert_anti_dependences(Block* LCA, Node* load, bool verify = false); 373 void verify_anti_dependences(Block* LCA, Node* load) { argument 374 assert(LCA == _bbs[load->_idx], "should already be scheduled"); 375 insert_anti_dependences(LCA, load, true); 430 Block* hoist_to_cheaper_block(Block* LCA, Block* early, Node* self);
|
H A D | gcm.cpp | 290 // LCA is a current notion of LCA, to be raised above 'this'. 291 // As a convenient boundary condition, return 'this' if LCA is NULL. 292 // Find the LCA of those two nodes. 293 Block* Block::dom_lca(Block* LCA) { argument 294 if (LCA == NULL || LCA == this) return this; 297 while (anc->_dom_depth > LCA->_dom_depth) 298 anc = anc->_idom; // Walk up till anc is as high as LCA 300 while (LCA 316 raise_LCA_above_use(Block* LCA, Node* use, Node* def, Block_Array &bbs) argument 345 raise_LCA_above_marks(Block* LCA, node_idx_t mark, Block* early, Block_Array &bbs) argument 447 insert_anti_dependences(Block* LCA, Node* load, bool verify) argument 1013 hoist_to_cheaper_block(Block* LCA, Block* early, Node* self) argument 1172 Block *LCA = NULL; local [all...] |
H A D | loopnode.cpp | 3115 // Pair-wise LCA 3117 if( !n1 ) return n2; // Handle NULL original LCA 3120 // find LCA of all uses 3162 Node *LCA = NULL; local 3165 LCA = dom_lca( LCA, region->in(i) ); 3167 return LCA; 3170 bool PhaseIdealLoop::verify_dominance(Node* n, Node* use, Node* LCA, Node* early) { argument 3174 // Make sure that there's a dominance path from use to LCA 3176 while (d != LCA) { 3195 Node *LCA = NULL; local 3225 Node* LCA = compute_lca_of_uses(n, early); local 3492 Node *LCA = get_late_ctrl( n, early ); local 3563 dump_bad_graph(const char* msg, Node* n, Node* early, Node* LCA) argument [all...] |
Completed in 62 milliseconds