Merge branch 'dev_processGraph' of https://github.com/alicevision/meshroom into dev_processGraph

meshroom/core/graph.py

@@ -12,6 +12,7 @@ import uuid
 from collections import defaultdict
 from enum import Enum  # available by default in python3. For python2: "pip install enum34"
 from pprint import pprint
+import logging
 
 from . import stats
 from . import desc
@@ -450,19 +451,18 @@ class Node(BaseObject):
                 self.status.returnCode = self._subprocess.returncode
 
             if self._subprocess.returncode != 0:
-                logContent = ''
                 with open(self.logFile(), 'r') as logF:
                     logContent = ''.join(logF.readlines())
                 self.upgradeStatusTo(Status.ERROR)
                 raise RuntimeError('Error on node "{}":\nLog:\n{}'.format(self.name, logContent))
-        except:
+        except Exception:
             self.upgradeStatusTo(Status.ERROR)
             raise
         finally:
             elapsedTime = time.time() - startTime
             print(' - elapsed time:', elapsedTime)
             self._subprocess = None
-            # ask and wait for the stats thread to terminate
+            # ask and wait for the stats thread to stop
             statThread.stopRequest()
             statThread.join()
 
@@ -594,20 +594,25 @@ class Graph(BaseObject):
         return [edge for edge in self.edges if edge.src == attribute]
 
     def removeNode(self, nodeName):
+        """
+        Remove the node identified by 'nodeName' from the graph
+        and return in and out edges removed by this operation in two dicts {dstAttr.fullName(), srcAttr.fullName()}
+        """
         node = self.node(nodeName)
         self._nodes.pop(nodeName)
 
-        edges = {}
+        inEdges = {}
+        outEdges = {}
         for attr in node._attributes:
             for edge in self.outEdges(attr):
                 self.edges.remove(edge)
-                edges[edge.dst.fullName()] = edge.src.fullName()
+                outEdges[edge.dst.fullName()] = edge.src.fullName()
             if attr in self.edges.keys():
                 edge = self.edges.pop(attr)
-                edges[edge.dst.fullName()] = edge.src.fullName()
+                inEdges[edge.dst.fullName()] = edge.src.fullName()
 
         self.updateInternals()
-        return edges
+        return inEdges, outEdges
 
     @Slot(str, result=Node)
     def addNewNode(self, nodeType, **kwargs):
@@ -793,6 +798,14 @@ class Graph(BaseObject):
         """ Request graph execution to be stopped """
         self.stopExecutionRequested.emit()
 
+    def submittedNodes(self):
+        """ Return the list of submitted nodes inside this Graph """
+        return [node for node in self.nodes if node.isAlreadySubmitted()]
+
+    def clearSubmittedNodes(self):
+        """ Reset the status of already submitted nodes to Status.NONE """
+        [node.upgradeStatusTo(Status.NONE) for node in self.submittedNodes()]
+
     @property
     def nodes(self):
         return self._nodes
@@ -848,8 +861,13 @@ def execute(graph, toNodes=None, force=False):
         node.beginSequence()
 
     for i, node in enumerate(nodes):
-        print('\n[{i}/{N}] {nodeName}'.format(i=i+1, N=len(nodes), nodeName=node.nodeType()))
-        node.process()
+        try:
+            print('\n[{i}/{N}] {nodeName}'.format(i=i + 1, N=len(nodes), nodeName=node.nodeType))
+            node.process()
+        except Exception as e:
+            logging.error("Error on node computation: {}".format(e))
+            graph.clearSubmittedNodes()
+            return
 
     for node in nodes:
         node.endSequence()