opensm/opensm/osm_ucast_dfsssp.c

125 	uint8_t status;		/* node status in cycle search to avoid recursive function */
127 	struct cdg_node *pre;	/* to save the path in cycle detection algorithm */
624 /* search for a edge in the cdg which should be removed to break a cycle */
625 static cdg_link_t *get_weakest_link_in_cycle(cdg_node_t * cycle)
627 	cdg_node_t *current = cycle, *node_with_weakest_link = NULL;
657 		/* if complete cycle is traversed */
658 		if (current == cycle) {
680 /* search for nodes in the cdg not yet reached in the cycle search process;
722 /* make a DFS on the cdg to check for a cycle */
726 	cdg_node_t *cycle = NULL;
740 				cycle = link->node;
777 	return cycle;
806 	   sources can't be part of a cycle -> skip this channel
958 	   sources can't be part of a cycle -> skip this channel
996 					/* may happen if the link is missing (thru cycle detect algorithm) */
999 				/* may happen if the link is missing (thru cycle detect algorithm or last_channel==channel_head (dummy channel)) */
1303 			/* if there is a Hca connected -> count and cycle */
1587 		/* if no route goes thru this switch -> cycle */
1736 		   then cycle
1813 		/* if no route goes thru this switch -> cycle */
1889 	cdg_node_t **cdg = NULL, *start_here = NULL, *cycle = NULL;
2048 			cycle =
2052 			if (cycle) {
2055 				/* calc weakest link n cycle */
2056 				weakest_link = get_weakest_link_in_cycle(cycle);
2143 			start_here = cycle;
2147 	/* test the last avail cdg for a cycle;
2152 		cycle =
2155 		if (cycle) {
2174 	/* optimal balancing virtual lanes, under condition: no additional cycle checks;
2512 			/* add weights for calculated routes to adjust the weights for the next cycle */