Revision 9cf4267a

b/Ganeti/HTools/Loader.hs
96 96
      nl2 = fixNodes nl il
97 97
      il3 = Container.fromAssocList il
98 98
      nl3 = Container.fromAssocList
99
            (map (\ (k, v) -> (k, Node.buildPeers v il3 (length nl2))) nl2)
99
            (map (\ (k, v) -> (k, Node.buildPeers v il3)) nl2)
100 100
      node_names = map Node.name $ Container.elems nl3
101 101
      inst_names = map Instance.name $ Container.elems il3
102 102
      common_suffix = longestDomain (node_names ++ inst_names)
b/Ganeti/HTools/Node.hs
148 148
computeMaxRes new_peers = PeerMap.maxElem new_peers
149 149

  
150 150
-- | Builds the peer map for a given node.
151
buildPeers :: Node -> Instance.List -> Int -> Node
152
buildPeers t il num_nodes =
151
buildPeers :: Node -> Instance.List -> Node
152
buildPeers t il =
153 153
    let mdata = map
154 154
                (\i_idx -> let inst = Container.find i_idx il
155 155
                           in (Instance.pnode inst, Instance.mem inst))
b/Ganeti/HTools/QC.hs
41 41
      dsk_t <- arbitrary
42 42
      dsk_f <- choose (0, dsk_t)
43 43
      offl <- arbitrary
44
      npeers <- choose (0, 100)
45 44
      let n = Node.create name (fromIntegral mem_t) mem_n mem_f
46 45
              (fromIntegral dsk_t) dsk_f offl
47
          n' = Node.buildPeers n Container.empty npeers
46
          n' = Node.buildPeers n Container.empty
48 47
      return n'
49 48

  
50 49
-- | Make sure add is idempotent

Also available in: Unified diff