-{-| Loading data from external sources
+{-| Generic data loader
-This module holds the common code for loading the cluster state from external sources.
+This module holds the common code for parsing the input data after it
+has been loaded from external sources.
+
+-}
+
+{-
+
+Copyright (C) 2009 Google Inc.
+
+This program is free software; you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation; either version 2 of the License, or
+(at your option) any later version.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software
+Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+02110-1301, USA.
-}
, checkData
, assignIndices
, lookupNode
- , swapPairs
+ , lookupInstance
+ , stripSuffix
+ , RqType(..)
+ , Request(..)
) where
+import Control.Monad (foldM)
+import Data.Function (on)
import Data.List
import Data.Maybe (fromJust)
import Text.Printf (printf)
import Ganeti.HTools.Types
+-- * Types
--- | Swap a list of @(a, b)@ into @(b, a)@
-swapPairs :: [(a, b)] -> [(b, a)]
-swapPairs = map (\ (a, b) -> (b, a))
+{-| The request type.
--- | Lookups a node into an assoc list
-lookupNode :: (Monad m) => NameAssoc -> String -> String -> m Int
+This type denotes what request we got from Ganeti and also holds
+request-specific fields.
+
+-}
+data RqType
+ = Allocate Instance.Instance Int -- ^ A new instance allocation
+ | Relocate Idx Int [Ndx] -- ^ Move an instance to a new
+ -- secondary node
+ deriving (Show)
+
+-- | A complete request, as received from Ganeti.
+data Request = Request RqType Node.List Instance.List String
+ deriving (Show)
+
+-- * Functions
+
+-- | Lookups a node into an assoc list.
+lookupNode :: (Monad m) => [(String, Ndx)] -> String -> String -> m Ndx
lookupNode ktn inst node =
case lookup node ktn of
Nothing -> fail $ "Unknown node '" ++ node ++ "' for instance " ++ inst
Just idx -> return idx
+-- | Lookups an instance into an assoc list.
+lookupInstance :: (Monad m) => [(String, Idx)] -> String -> m Idx
+lookupInstance kti inst =
+ case lookup inst kti of
+ Nothing -> fail $ "Unknown instance '" ++ inst ++ "'"
+ Just idx -> return idx
+
+-- | Given a list of elements (and their names), assign indices to them.
assignIndices :: (Element a) =>
[(String, a)]
-> (NameAssoc, [(Int, a)])
unzip . map (\ (idx, (k, v)) -> ((k, idx), (idx, setIdx v idx)))
. zip [0..]
--- | For each instance, add its index to its primary and secondary nodes
-fixNodes :: [(Int, Node.Node)]
- -> [(Int, Instance.Instance)]
- -> [(Int, Node.Node)]
-fixNodes nl il =
- foldl' (\accu (idx, inst) ->
- let
- assocEqual = (\ (i, _) (j, _) -> i == j)
- pdx = Instance.pnode inst
- sdx = Instance.snode inst
- pold = fromJust $ lookup pdx accu
- pnew = Node.setPri pold idx
- ac1 = deleteBy assocEqual (pdx, pold) accu
- ac2 = (pdx, pnew):ac1
- in
- if sdx /= Node.noSecondary then
- let
- sold = fromJust $ lookup sdx accu
- snew = Node.setSec sold idx
- ac3 = deleteBy assocEqual (sdx, sold) ac2
- ac4 = (sdx, snew):ac3
- in ac4
- else
- ac2
- ) nl il
-
--- | Compute the longest common suffix of a NameList list that
--- | starts with a dot
-longestDomain :: NameList -> String
-longestDomain [] = ""
-longestDomain ((_,x):xs) =
+-- | Assoc element comparator
+assocEqual :: (Eq a) => (a, b) -> (a, b) -> Bool
+assocEqual = (==) `on` fst
+
+-- | For each instance, add its index to its primary and secondary nodes.
+fixNodes :: [(Ndx, Node.Node)]
+ -> Instance.Instance
+ -> [(Ndx, Node.Node)]
+fixNodes accu inst =
let
- onlyStrings = snd $ unzip xs
+ pdx = Instance.pNode inst
+ sdx = Instance.sNode inst
+ pold = fromJust $ lookup pdx accu
+ pnew = Node.setPri pold inst
+ ac1 = deleteBy assocEqual (pdx, pold) accu
+ ac2 = (pdx, pnew):ac1
in
- foldr (\ suffix accu -> if all (isSuffixOf suffix) onlyStrings
+ if sdx /= Node.noSecondary
+ then let sold = fromJust $ lookup sdx accu
+ snew = Node.setSec sold inst
+ ac3 = deleteBy assocEqual (sdx, sold) ac2
+ in (sdx, snew):ac3
+ else ac2
+
+-- | Compute the longest common suffix of a list of strings that
+-- | starts with a dot.
+longestDomain :: [String] -> String
+longestDomain [] = ""
+longestDomain (x:xs) =
+ foldr (\ suffix accu -> if all (isSuffixOf suffix) xs
then suffix
else accu)
"" $ filter (isPrefixOf ".") (tails x)
--- | Remove tails from the (Int, String) lists
-stripSuffix :: String -> NameList -> NameList
-stripSuffix suffix lst =
- let sflen = length suffix in
- map (\ (key, name) -> (key, take ((length name) - sflen) name)) lst
-
-{-| Initializer function that loads the data from a node and list file
- and massages it into the correct format. -}
-mergeData :: ([(String, Int)], Node.AssocList,
- [(String, Int)], Instance.AssocList) -- ^ Data from either
- -- Text.loadData
- -- or Rapi.loadData
- -> Result (NodeList, InstanceList, String, NameList, NameList)
-mergeData (ktn, nl, kti, il) = do
- let
- nl2 = fixNodes nl il
- il3 = Container.fromAssocList il
- nl3 = Container.fromAssocList
- (map (\ (k, v) -> (k, Node.buildPeers v il3 (length nl2))) nl2)
- xtn = swapPairs ktn
- xti = swapPairs kti
- common_suffix = longestDomain (xti ++ xtn)
- stn = stripSuffix common_suffix xtn
- sti = stripSuffix common_suffix xti
- return (nl3, il3, common_suffix, stn, sti)
-
--- | Check cluster data for consistency
-checkData :: NodeList -> InstanceList -> NameList -> NameList
- -> ([String], NodeList)
-checkData nl il ktn _ =
+-- | Remove tail suffix from a string.
+stripSuffix :: Int -> String -> String
+stripSuffix sflen name = take (length name - sflen) name
+
+-- | Initializer function that loads the data from a node and instance
+-- list and massages it into the correct format.
+mergeData :: [(String, DynUtil)] -- ^ Instance utilisation data
+ -> (Node.AssocList,
+ Instance.AssocList) -- ^ Data from either Text.loadData
+ -- or Rapi.loadData
+ -> Result (Node.List, Instance.List, String)
+mergeData um (nl, il) = do
+ let il2 = Container.fromAssocList il
+ il3 <- foldM (\im (name, n_util) -> do
+ idx <- Container.findByName im name
+ let inst = Container.find idx im
+ new_i = inst { Instance.util = n_util }
+ return $ Container.add idx new_i im
+ ) il2 um
+ let nl2 = foldl' fixNodes nl (Container.elems il3)
+ let nl3 = Container.fromAssocList
+ (map (\ (k, v) -> (k, Node.buildPeers v il3)) nl2)
+ node_names = map Node.name $ Container.elems nl3
+ inst_names = map Instance.name $ Container.elems il3
+ common_suffix = longestDomain (node_names ++ inst_names)
+ csl = length common_suffix
+ snl = Container.map (\n -> setName n (stripSuffix csl $ nameOf n)) nl3
+ sil = Container.map (\i -> setName i (stripSuffix csl $ nameOf i)) il3
+ return (snl, sil, common_suffix)
+
+-- | Checks the cluster data for consistency.
+checkData :: Node.List -> Instance.List
+ -> ([String], Node.List)
+checkData nl il =
Container.mapAccum
(\ msgs node ->
- let nname = fromJust $ lookup (Node.idx node) ktn
- nilst = map (flip Container.find $ il) (Node.plist node)
+ let nname = Node.name node
+ nilst = map (flip Container.find il) (Node.pList node)
dilst = filter (not . Instance.running) nilst
adj_mem = sum . map Instance.mem $ dilst
- delta_mem = (truncate $ Node.t_mem node)
- - (Node.n_mem node)
- - (Node.f_mem node)
- - (nodeImem node il)
+ delta_mem = truncate (Node.tMem node)
+ - Node.nMem node
+ - Node.fMem node
+ - nodeImem node il
+ adj_mem
- delta_dsk = (truncate $ Node.t_dsk node)
- - (Node.f_dsk node)
- - (nodeIdsk node il)
+ delta_dsk = truncate (Node.tDsk node)
+ - Node.fDsk node
+ - nodeIdsk node il
newn = Node.setFmem (Node.setXmem node delta_mem)
- (Node.f_mem node - adj_mem)
- umsg1 = if delta_mem > 512 || delta_dsk > 1024
- then [printf "node %s is missing %d MB ram \
- \and %d GB disk"
- nname delta_mem (delta_dsk `div` 1024)]
- else []
+ (Node.fMem node - adj_mem)
+ umsg1 = [printf "node %s is missing %d MB ram \
+ \and %d GB disk"
+ nname delta_mem (delta_dsk `div` 1024) |
+ delta_mem > 512 || delta_dsk > 1024]::[String]
in (msgs ++ umsg1, newn)
) [] nl
-- | Compute the amount of memory used by primary instances on a node.
-nodeImem :: Node.Node -> InstanceList -> Int
+nodeImem :: Node.Node -> Instance.List -> Int
nodeImem node il =
- let rfind = flip Container.find $ il
- in sum . map Instance.mem .
- map rfind $ Node.plist node
+ let rfind = flip Container.find il
+ in sum . map (Instance.mem . rfind)
+ $ Node.pList node
-- | Compute the amount of disk used by instances on a node (either primary
-- or secondary).
-nodeIdsk :: Node.Node -> InstanceList -> Int
+nodeIdsk :: Node.Node -> Instance.List -> Int
nodeIdsk node il =
- let rfind = flip Container.find $ il
- in sum . map Instance.dsk .
- map rfind $ (Node.plist node) ++ (Node.slist node)
+ let rfind = flip Container.find il
+ in sum . map (Instance.dsk . rfind)
+ $ Node.pList node ++ Node.sList node
projects / ganeti-local / blobdiff