* b. Iterate through each of the peer_nets/nis to decide
* the best peer/local_ni pair to use
*/
+ shortest_distance = INT_MAX;
+ best_credits = INT_MIN;
list_for_each_entry(peer_net, &peer->lp_peer_nets, lpn_on_peer_list) {
if (!lnet_is_peer_net_healthy_locked(peer_net))
continue;
* 2. NI available credits
* 3. Round Robin
*/
- shortest_distance = INT_MAX;
- best_credits = INT_MIN;
ni = NULL;
while ((ni = lnet_get_next_ni_locked(local_net, ni))) {
int ni_credits;