4 # Copyright (C) 2007 Google Inc.
6 # This program is free software; you can redistribute it and/or modify
7 # it under the terms of the GNU General Public License as published by
8 # the Free Software Foundation; either version 2 of the License, or
9 # (at your option) any later version.
11 # This program is distributed in the hope that it will be useful, but
12 # WITHOUT ANY WARRANTY; without even the implied warranty of
13 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 # General Public License for more details.
16 # You should have received a copy of the GNU General Public License
17 # along with this program; if not, write to the Free Software
18 # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
37 """Loads the passed configuration file.
44 cfg = yaml.load(f.read())
52 if len(cfg['nodes']) < 1:
53 raise qa_error.Error("Need at least one node")
54 if len(cfg['instances']) < 1:
55 raise qa_error.Error("Need at least one instance")
58 def get(name, default=None):
59 return cfg.get(name, default)
62 def TestEnabled(test):
63 """Returns True if the given test is enabled."""
64 return cfg.get('tests', {}).get(test, False)
68 return cfg['nodes'][0]
71 def AcquireInstance():
72 """Returns an instance which isn't in use.
75 # Filter out unwanted instances
76 tmp_flt = lambda inst: not inst.get('_used', False)
77 instances = filter(tmp_flt, cfg['instances'])
80 if len(instances) == 0:
81 raise qa_error.OutOfInstancesError("No instances left")
88 def ReleaseInstance(inst):
92 def AcquireNode(exclude=None):
93 """Returns the least used node.
96 master = GetMasterNode()
98 # Filter out unwanted nodes
99 # TODO: Maybe combine filters
101 nodes = cfg['nodes'][:]
102 elif isinstance(exclude, (list, tuple)):
103 nodes = filter(lambda node: node not in exclude, cfg['nodes'])
105 nodes = filter(lambda node: node != exclude, cfg['nodes'])
107 tmp_flt = lambda node: node.get('_added', False) or node == master
108 nodes = filter(tmp_flt, nodes)
112 raise qa_error.OutOfNodesError("No nodes left")
114 # Get node with least number of uses
116 result = cmp(a.get('_count', 0), b.get('_count', 0))
118 result = cmp(a['primary'], b['primary'])
121 nodes.sort(cmp=compare)
124 node['_count'] = node.get('_count', 0) + 1
128 def ReleaseNode(node):
129 node['_count'] = node.get('_count', 0) - 1