Lines Matching refs:idx
288 uint idx;
290 while ((idx = elements.next()) != 0) {
291 assert( idx != i, "Must have empty diagonal");
292 assert( pc->Find_const(idx) == idx, "Must not need Find" );
293 assert( _adjs[idx].member(i), "IFG not square" );
294 assert( !(*_yanked)[idx], "No yanked neighbors" );
295 assert( last < idx, "not sorted increasing");
296 last = idx;
357 uint idx = n->is_Copy();
358 if( idx ) liveout->remove( n2lidx(n->in(idx)) );
376 uint idx;
377 if( n->is_Mach() && (idx = n->as_Mach()->two_adr()) ) {
399 uint lidx = n2lidx(n->in(idx));
662 uint idx = n->is_Copy();
663 if( idx ) {
664 uint x = n2lidx(n->in(idx));