cortex/NodeManager/NodeGroup.cpp

65 // free the group, including all nodes within it
196 	// add it
256 	// the manager lock applies to it
275 	// remove it
441 // +++++ if a previously-set start position was deferred, it won't be
457 //   it must take effect retroactively (if it's before the current
505 //				for(node_set::iterator it = m_cycleNodes.begin();
506 //					it != m_cycleNodes.end(); ++it) {
507 //					(*it)->_scheduleCycle(m_cycleBoundary);
524 //   position, it's ignored.
526 // +++++ if a previously-set end position was deferred, it won't be
670 //   Special case: if the run mode is B_OFFLINE, it will be
964 // changes, it must pass that information on via this method
996 	// remove & replace ref (positions it properly)
1008 	// +++++ zat it?
1011 // when a NodeRef receives notification that it has been stopped,
1012 // but is labeled as still running, it must call this method.
1027 		for(node_set::iterator it = m_nodes.begin();
1028 			it != m_nodes.end(); ++it) {
1029 			if((*it)->isRunning()) {
1067 	// +++++ currently, if an error is encountered it's ignored.
1084 	for(node_set::iterator it = m_nodes.begin();
1085 		it != m_nodes.end(); ++it) {
1086 		(*it)->_preroll(m_startPosition);
1099 //// functor: calculates latency of each node it's handed, caching
1100 //// the largest one found; includes initial latency if nodes report it.
1195 	for(node_set::iterator it = m_nodes.begin();
1196 		it != m_nodes.end(); ++it) {
1197 		err = (*it)->_seekStopped(m_startPosition);
1203 				name(), (*it)->name(), m_startPosition,
1222 	for(node_set::iterator it = m_nodes.begin();
1223 		it != m_nodes.end(); ++it) {
1224 		err = (*it)->_start(when);
1230 				name(), (*it)->name(), when,
1332 		node_set::iterator it = m_nodes.begin();
1333 		it != m_nodes.end(); ++it) {
1335 		status_t e = (*it)->_roll(
1461 		// the thread got the message; wait for it to quit
1470 	// it's up to the thread to close its port
1527 	// make sure it's not already there
1537 	node_set::iterator it;
1538 	for(it = m_cycleNodes.begin();
1539 		it != m_cycleNodes.end(); ++it) {
1540 		if(ref->m_latency > (*it)->m_latency) {
1541 			m_cycleNodes.insert(it, ref);
1547 	if(it == m_cycleNodes.end())
1548 		m_cycleNodes.insert(it, ref);
1556 	node_set::iterator it = find(
1560 	ASSERT(it != m_cycleNodes.end());
1561 	m_cycleNodes.erase(it);
1598 		// *** wait until it's time to queue the next cycle, or until
1627 		// block until message arrives or it's time to wake up
1702 	for(node_set::iterator it = m_cycleNodes.begin();
1703 		it != m_cycleNodes.end(); ++it) {
1704 		err = (*it)->_seek(
1711 				(*it)->name(), strerror(err)));