Add some more spinner.update() calls in possibly time consuming loops.
authorZac Medico <zmedico@gentoo.org>
Fri, 25 Apr 2008 03:18:56 +0000 (03:18 -0000)
committerZac Medico <zmedico@gentoo.org>
Fri, 25 Apr 2008 03:18:56 +0000 (03:18 -0000)
(trunk r9968)

svn path=/main/branches/2.1.2/; revision=9969

bin/emerge

index 38c64c70a70e75d6c7459f685c6c25af67d2af16..a52d714072e1a17ebbc54007d508902cafefa173 100755 (executable)
@@ -1981,6 +1981,7 @@ class depgraph(object):
        def _create_graph(self, allow_unsatisfied=False):
                dep_stack = self._dep_stack
                while dep_stack:
+                       self.spinner.update()
                        dep = dep_stack.pop()
                        if isinstance(dep, Package):
                                if not self._add_pkg_deps(dep,
@@ -3268,6 +3269,7 @@ class depgraph(object):
                                del blocker_cache
 
                for blocker in self.blocker_parents.keys():
+                       self.spinner.update()
                        mytype, myroot, mydep = blocker
                        initial_db = self.trees[myroot]["vartree"].dbapi
                        final_db = self.mydbapi[myroot]
@@ -3441,6 +3443,7 @@ class depgraph(object):
                        for node in mygraph.root_nodes():
                                if not isinstance(node, Package) or \
                                        node.installed or node.onlydeps:
+                                       self.spinner.update()
                                        mygraph.remove(node)
                                        removed_something = True
                        if not removed_something:
@@ -3519,6 +3522,7 @@ class depgraph(object):
                # unresolved blockers or circular dependencies.
 
                while not mygraph.empty():
+                       self.spinner.update()
                        selected_nodes = None
                        ignore_priority = None
                        if prefer_asap and asap_nodes: