* Implement method FlowManager::reconcileFlows()
Note: for simplicity, we don't compare the old and the new paths,
because it is error-prone.
Instead, we delete all old flow entries, and add the new flow entries,
even if some of those entries haven't changed.
In the future we should perform the appropriate comparison.
* Change addAndMaintainShortestPathFlow() to return the computed
(shortest) flow path.
diff --git a/src/main/java/net/floodlightcontroller/flowcache/IFlowService.java b/src/main/java/net/floodlightcontroller/flowcache/IFlowService.java
index 45cdde0..b6df1e2 100644
--- a/src/main/java/net/floodlightcontroller/flowcache/IFlowService.java
+++ b/src/main/java/net/floodlightcontroller/flowcache/IFlowService.java
@@ -86,7 +86,7 @@
/**
* Add and maintain a shortest-path flow.
*
- * NOTE: The Flow Path does NOT contain all flow entries.
+ * NOTE: The Flow Path argument does NOT contain all flow entries.
* Instead, it contains a single dummy flow entry that is used to
* store the matching condition(s).
* That entry is replaced by the appropriate entries from the
@@ -94,9 +94,7 @@
*
* @param flowPath the Flow Path with the endpoints and the match
* conditions to install.
- * @param flowId the return-by-reference Flow ID as assigned internally.
- * @return true on success, otherwise false.
+ * @return the added shortest-path flow on success, otherwise null.
*/
- public boolean addAndMaintainShortestPathFlow(FlowPath flowPath,
- FlowId flowId);
+ public FlowPath addAndMaintainShortestPathFlow(FlowPath flowPath);
}