Lines Matching defs:neighbor
974 // allowed registers, then put that neighbor on the low degree
979 uint neighbor;
980 while ((neighbor = elements.next()) != 0) {
981 LRG *n = &lrgs(neighbor);
982 assert( _ifg->effective_degree(neighbor) == n->degree(), "" );
986 assert(!(*_ifg->_yanked)[neighbor],"Cannot move to lo degree twice");
989 lo_no_copy = neighbor;
1032 // allowed registers, then put that neighbor on the low degree
1037 uint neighbor;
1038 while ((neighbor = elements.next()) != 0) {
1039 LRG *n = &lrgs(neighbor);
1042 assert( _ifg->effective_degree(neighbor) == n->degree(), "" );
1049 assert(!(*_ifg->_yanked)[neighbor],"Cannot move to lo degree twice");
1057 _lo_degree = neighbor;
1169 // Choose a color which is both legal and already taken by a neighbor
1283 // Remove neighbor colors
1288 uint neighbor;
1289 while ((neighbor = elements.next()) != 0) {
1290 // Note that neighbor might be a spill_reg. In this case, exclusion
1292 // space. Also, if neighbor is in a different chunk, this exclusion
1296 LRG &nlrg = lrgs(neighbor);
1310 tty->print(" intersected L%d ", neighbor);
1688 uint neighbor;
1689 while ((neighbor = elements.next()) != 0) {
1692 Node *derived = lrgs(neighbor)._def;