Lines Matching defs:next
898 while((lidx = elements.next()) != 0) {
980 while ((neighbor = elements.next()) != 0) {
1023 while ((datum = elements.next()) != 0) {
1038 while ((neighbor = elements.next()) != 0) {
1052 uint next = n->_next;
1053 if( prev ) lrgs(prev)._next = next;
1054 else _hi_degree = next;
1055 lrgs(next)._prev = prev;
1080 // in -Xcomp of Java2Demo). So just choose this guy to simplify next.
1119 uint next = lo_lrg->_next;
1120 if( prev ) lrgs(prev)._next = next;
1121 else _hi_degree = next;
1122 lrgs(next)._prev = prev;
1174 while ((datum = elements.next()) != 0) {
1254 // Pull next LRG from the simplified list - in reverse order of removal
1279 // has to move into the next free stack chunk.
1289 while ((neighbor = elements.next()) != 0) {
1340 // Bump register mask up to next stack chunk
1689 while ((neighbor = elements.next()) != 0) {
1841 while ((i = elements.next()) != 0) {