opensm/opensm/osm_ucast_dfsssp.c

304 /* returns current minimum and removes it from heap */
547 	cdg_node_t *current = *root;
549 	if (!current) {
550 		current = new_node;
551 		*root = current;
555 	while (current) {
556 		if (new_node->channelID < current->channelID) {
557 			if (current->left) {
558 				current = current->left;
560 				current->left = new_node;
561 				new_node->parent = current;
564 		} else if (new_node->channelID > current->channelID) {
565 			if (current->right) {
566 				current = current->right;
568 				current->right = new_node;
569 				new_node->parent = current;
572 		} else if (new_node->channelID == current->channelID) {
598 	cdg_node_t *current = *root;
600 	while (current) {
601 		if (current->left) {
602 			current = current->left;
603 		} else if (current->right) {
604 			current = current->right;
606 			if (current->parent == NULL) {
607 				cdg_node_dealloc(current);
611 			if (current->parent->left == current) {
612 				current = current->parent;
613 				cdg_node_dealloc(current->left);
614 				current->left = NULL;
615 			} else if (current->parent->right == current) {
616 				current = current->parent;
617 				cdg_node_dealloc(current->right);
618 				current->right = NULL;
627 	cdg_node_t *current = cycle, *node_with_weakest_link = NULL;
630 	link = current->linklist;
634 			node_with_weakest_link = current;
635 			current = link->node;
642 		current->status = UNKNOWN;
643 		link = current->linklist;
650 					node_with_weakest_link = current;
652 				current = link->node;
658 		if (current == cycle) {
659 			current->status = UNKNOWN;
685 	cdg_node_t *current = root, *res = NULL;
687 	while (current) {
688 		current->visited = 1;
689 		if (current->status == UNKNOWN) {
690 			res = current;
693 		if (current->left && !current->left->visited) {
694 			current = current->left;
695 		} else if (current->right && !current->right->visited) {
696 			current = current->right;
698 			if (current->left)
699 				current->left->visited = 0;
700 			if (current->right)
701 				current->right->visited = 0;
702 			if (current->parent == NULL)
705 				current = current->parent;
710 	while (current) {
711 		current->visited = 0;
712 		if (current->left)
713 			current->left->visited = 0;
714 		if (current->right)
715 			current->right->visited = 0;
716 		current = current->parent;
727 	cdg_node_t *current = start_node, *next_node = NULL, *tmp = NULL;
730 	while (current) {
731 		current->status = GRAY;
732 		link = current->linklist;
746 			next_node->pre = current;
747 			current = next_node;
750 			current->status = BLACK;
753 			link = current->linklist;
763 			if (current->pre) {
764 				tmp = current;
765 				current = current->pre;
769 				current = get_next_cdg_node(cdg);
770 				if (!current)
1431 	vertex_t *current = NULL;
1540 	current = heap_getmin(heap);
1541 	while (current) {
1542 		current->state = DISCOVERED;
1543 		if (current->used_link)	/* increment the number of hops to the source for each new node */
1544 			current->hops =
1545 			    adj_list[current->used_link->from].hops + 1;
1548 		for (link = current->links; link != NULL; link = link->next) {
1550 			    && (current->distance + link->weight <
1554 				    current->distance + link->weight;
1559 		current = heap_getmin(heap);
1706    from the previous dijsktra step for the current mlid
2101 					/* remove path from current cdg / vl */
2848 	/* we initialize with the current time to achieve a 'good' randomized