Searched refs:lr2 (Results 1 - 5 of 5) sorted by relevance
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | coalesce.cpp | 240 uint lr2 = _phc.Find(n2); local 241 if( lr1 != lr2 && // Different live ranges already AND 242 !_phc._ifg->test_edge_sq( lr1, lr2 ) ) { // Do not interfere 244 LRG *lrg2 = &_phc.lrgs(lr2); 261 if( lr1 > lr2 ) { 262 uint tmp = lr1; lr1 = lr2; lr2 = tmp; 266 // Union lr2 into lr1 271 _phc._ifg->Union( lr1, lr2 ); 607 void PhaseConservativeCoalesce::union_helper( Node *lr1_node, Node *lr2_node, uint lr1, uint lr2, Nod argument 712 update_ifg(uint lr1, uint lr2, IndexSet *n_lr1, IndexSet *n_lr2) argument 760 uint lr2 = _phc.Find(src_def ); local [all...] |
H A D | coalesce.hpp | 109 void union_helper( Node *lr1_node, Node *lr2_node, uint lr1, uint lr2, Node *src_def, Node *dst_copy, Node *src_copy, Block *b, uint bindex ); 111 uint compute_separating_interferences(Node *dst_copy, Node *src_copy, Block *b, uint bindex, RegMask &rm, uint rm_size, uint reg_degree, uint lr1, uint lr2); 113 void update_ifg(uint lr1, uint lr2, IndexSet *n_lr1, IndexSet *n_lr2);
|
H A D | indexSet.cpp | 203 uint IndexSet::lrg_union(uint lr1, uint lr2, argument 208 IndexSet *two = ifg->neighbors(lr2); 210 LRG &lrg2 = ifg->lrgs(lr2);
|
H A D | indexSet.hpp | 320 uint lrg_union(uint lr1, uint lr2,
|
H A D | reg_split.cpp | 1358 uint lr2 = Find(n1->in(twoidx)); 1359 if( lr1 < lr2 ) 1361 else if( lr1 > lr2 )
|
Completed in 41 milliseconds