1 # -*- coding: utf-8 -*-
2 ##############################################################################
4 # OpenERP, Open Source Management Solution
5 # Copyright (C) 2004-2009 Tiny SPRL (<http://tiny.be>).
6 # Copyright (C) 2010-2011 OpenERP s.a. (<http://openerp.com>).
8 # This program is free software: you can redistribute it and/or modify
9 # it under the terms of the GNU Affero General Public License as
10 # published by the Free Software Foundation, either version 3 of the
11 # License, or (at your option) any later version.
13 # This program is distributed in the hope that it will be useful,
14 # but WITHOUT ANY WARRANTY; without even the implied warranty of
15 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 # GNU Affero General Public License for more details.
18 # You should have received a copy of the GNU Affero General Public License
19 # along with this program. If not, see <http://www.gnu.org/licenses/>.
21 ##############################################################################
23 """ Modules dependency graph. """
26 from os.path import join as opj
32 import openerp.osv as osv
33 import openerp.tools as tools
34 import openerp.tools.osutil as osutil
35 from openerp.tools.safe_eval import safe_eval as eval
36 import openerp.pooler as pooler
37 from openerp.tools.translate import _
39 import openerp.netsvc as netsvc
42 import openerp.release as release
46 from zipfile import PyZipFile, ZIP_DEFLATED
47 from cStringIO import StringIO
51 logger = netsvc.Logger()
55 """ Modules dependency graph.
57 The graph is a mapping from module name to Nodes.
61 def add_node(self, name, info):
62 max_depth, father = 0, None
63 for n in [Node(x, self, None) for x in info['depends']]:
64 if n.depth >= max_depth:
68 return father.add_child(name, info)
70 return Node(name, self, info)
72 def update_from_db(self, cr):
75 # update the graph with values from the database (if exist)
76 ## First, we set the default values for each package in graph
77 additional_data = dict.fromkeys(self.keys(), {'id': 0, 'state': 'uninstalled', 'dbdemo': False, 'installed_version': None})
78 ## Then we get the values from the database
79 cr.execute('SELECT name, id, state, demo AS dbdemo, latest_version AS installed_version'
80 ' FROM ir_module_module'
81 ' WHERE name IN %s',(tuple(additional_data),)
84 ## and we update the default values with values from the database
85 additional_data.update(dict([(x.pop('name'), x) for x in cr.dictfetchall()]))
87 for package in self.values():
88 for k, v in additional_data[package.name].items():
89 setattr(package, k, v)
91 def add_module(self, cr, module, force_demo=False):
92 self.add_modules(cr, [module], force_demo)
94 def add_modules(self, cr, module_list, force_demo=False):
97 for module in module_list:
100 UPDATE ir_module_module
104 # This will raise an exception if no/unreadable descriptor file.
105 # NOTE The call to load_information_from_description_file is already
106 # done by db.initialize, so it is possible to not do it again here.
107 info = openerp.modules.module.load_information_from_description_file(module)
108 if info and info['installable']:
109 packages.append((module, info)) # TODO directly a dict, like in get_modules_with_version
111 logger.notifyChannel('init', netsvc.LOG_WARNING, 'module %s: not installable, skipped' % (module))
113 dependencies = dict([(p, info['depends']) for p, info in packages])
114 current, later = set([p for p, info in packages]), set()
116 while packages and current > later:
117 package, info = packages[0]
118 deps = info['depends']
120 # if all dependencies of 'package' are already in the graph, add 'package' in the graph
121 if reduce(lambda x, y: x and y in self, deps, True):
122 if not package in current:
126 current.remove(package)
127 node = self.add_node(package, info)
131 packages.append((package, info))
134 self.update_from_db(cr)
136 for package in later:
137 unmet_deps = filter(lambda p: p not in self, dependencies[package])
138 logger.notifyChannel('init', netsvc.LOG_ERROR, 'module %s: Unmet dependencies: %s' % (package, ', '.join(unmet_deps)))
140 result = len(self) - len_graph
141 if result != len(module_list):
142 logger.notifyChannel('init', netsvc.LOG_WARNING, 'Not all modules have loaded.')
148 done = set(self.keys())
150 level_modules = sorted((name, module) for name, module in self.items() if module.depth==level)
151 for name, module in level_modules:
157 class Singleton(object):
158 def __new__(cls, name, graph, info):
162 inst = object.__new__(cls)
169 class Node(Singleton):
170 """ One module in the modules dependency graph.
172 Node acts as a per-module singleton. A node is constructed via
173 Graph.add_module() or Graph.add_modules(). Some of its fields are from
174 ir_module_module (setted by Graph.update_from_db()).
178 def __init__(self, name, graph, info):
180 if not hasattr(self, 'children'):
182 if not hasattr(self, 'depth'):
185 def add_child(self, name, info):
186 node = Node(name, self.graph, info)
187 node.depth = self.depth + 1
188 if node not in self.children:
189 self.children.append(node)
190 self.children.sort(lambda x, y: cmp(x.name, y.name))
193 def __setattr__(self, name, value):
194 super(Singleton, self).__setattr__(name, value)
196 for child in self.children:
197 setattr(child, name, value + 1)
200 return itertools.chain(iter(self.children), *map(iter, self.children))
203 return self._pprint()
205 def _pprint(self, depth=0):
206 s = '%s\n' % self.name
207 for c in self.children:
208 s += '%s`-> %s' % (' ' * depth, c._pprint(depth+1))
212 # vim:expandtab:smartindent:tabstop=4:softtabstop=4:shiftwidth=4: