cortex/NodeManager/NodeManager.cpp

153 	// used to walk connections
154 	vector<Connection>		connections;
159 	// walk input connections
160 	origin->getInputConnections(connections);
161 	for(uint32 n = 0; n < connections.size(); ++n) {
163 		if(!connections[n].isValid())
166 //		PRINT(("# source: %ld\n", connections[n].sourceNode()));
170 			connections[n].sourceNode(),
199 	// walk output connections
200 	connections.clear();
201 	origin->getOutputConnections(connections);
202 	for(uint32 n = 0; n < connections.size(); ++n) {
203 //		PRINT(("# dest: %ld\n", connections[n].destinationNode()));
205 		if(!connections[n].isValid())
210 			connections[n].destinationNode(),
356 	// deallocate all connections; disconnect internal nodes
618 	vector<Connection> connections;
620 	// walk input connections
621 	origin->getInputConnections(connections);
622 	for(uint32 n = 0; n < connections.size(); ++n) {
624 		if(!connections[n].isValid())
628 		if(connections[n].sourceNode() == target)
634 			connections[n].sourceNode(),
646 	// walk output connections
647 	connections.clear();
648 	origin->getOutputConnections(connections);
649 	for(uint32 n = 0; n < connections.size(); ++n) {
651 		if(!connections[n].isValid())
655 		if(connections[n].destinationNode() == target)
661 			connections[n].destinationNode(),
685 //   search of all known connections is performed.  Only
967 //   methods to assure that the nodes and connections you set up
1193 		//   connections involving a file-interface node aren't removed
1915 	//   for now (indexed by service-thread port) and figure the connections
1996 		// populate current connections from each node in the set
2134 	// (and any straggler connections)
2173 		// find & remove any 'stuck' connections; notify any observers
2174 		// that the connections have been removed
2196 		// +++++ don't notify if no stuck connections were found
2299 	// walk the listed connections