module Ganeti.HTools.Node
( Node(..)
, List
, create
, buildPeers
, setIdx
, setName
, setOffline
, setXmem
, setFmem
, setPri
, setSec
, setMdsk
, setMcpu
, removePri
, removeSec
, addPri
, addSec
, availDisk
, conflictingPrimaries
, defaultFields
, showHeader
, showField
, list
, AssocList
, AllocElement
, noSecondary
, noLimitInt
) where
import Data.List
import qualified Data.Map as Map
import qualified Data.Foldable as Foldable
import Text.Printf (printf)
import qualified Ganeti.HTools.Container as Container
import qualified Ganeti.HTools.Instance as Instance
import qualified Ganeti.HTools.PeerMap as P
import qualified Ganeti.HTools.Types as T
type TagMap = Map.Map String Int
data Node = Node
{ name :: String
, tMem :: Double
, nMem :: Int
, fMem :: Int
, xMem :: Int
, tDsk :: Double
, fDsk :: Int
, tCpu :: Double
, uCpu :: Int
, pList :: [T.Idx]
, sList :: [T.Idx]
, idx :: T.Ndx
, peers :: P.PeerMap
, failN1 :: Bool
, rMem :: Int
, pMem :: Double
, pDsk :: Double
, pRem :: Double
, pCpu :: Double
, mDsk :: Double
, mCpu :: Double
, loDsk :: Int
, hiCpu :: Int
, offline :: Bool
, utilPool :: T.DynUtil
, utilLoad :: T.DynUtil
, pTags :: TagMap
} deriving (Show)
instance T.Element Node where
nameOf = name
idxOf = idx
setName = setName
setIdx = setIdx
type AssocList = [(T.Ndx, Node)]
type List = Container.Container Node
type AllocElement = (List, Instance.Instance, [Node])
noSecondary :: T.Ndx
noSecondary = 1
noLimit :: Double
noLimit = 1
noLimitInt :: Int
noLimitInt = 1
addTag :: TagMap -> String -> TagMap
addTag t s = Map.insertWith (+) s 1 t
addTags :: TagMap -> [String] -> TagMap
addTags = foldl' addTag
delTag :: TagMap -> String -> TagMap
delTag t s = Map.update (\v -> if v > 1
then Just (v1)
else Nothing)
s t
delTags :: TagMap -> [String] -> TagMap
delTags = foldl' delTag
rejectAddTags :: TagMap -> [String] -> Bool
rejectAddTags t = any (`Map.member` t)
conflictingPrimaries :: Node -> Int
conflictingPrimaries (Node { pTags = t }) = Foldable.sum t Map.size t
create :: String -> Double -> Int -> Int -> Double
-> Int -> Double -> Bool -> Node
create name_init mem_t_init mem_n_init mem_f_init
dsk_t_init dsk_f_init cpu_t_init offline_init =
Node { name = name_init
, tMem = mem_t_init
, nMem = mem_n_init
, fMem = mem_f_init
, tDsk = dsk_t_init
, fDsk = dsk_f_init
, tCpu = cpu_t_init
, uCpu = 0
, pList = []
, sList = []
, failN1 = True
, idx = 1
, peers = P.empty
, rMem = 0
, pMem = fromIntegral mem_f_init / mem_t_init
, pDsk = fromIntegral dsk_f_init / dsk_t_init
, pRem = 0
, pCpu = 0
, offline = offline_init
, xMem = 0
, mDsk = noLimit
, mCpu = noLimit
, loDsk = noLimitInt
, hiCpu = noLimitInt
, utilPool = T.baseUtil
, utilLoad = T.zeroUtil
, pTags = Map.empty
}
setIdx :: Node -> T.Ndx -> Node
setIdx t i = t {idx = i}
setName :: Node -> String -> Node
setName t s = t {name = s}
setOffline :: Node -> Bool -> Node
setOffline t val = t { offline = val }
setXmem :: Node -> Int -> Node
setXmem t val = t { xMem = val }
setMdsk :: Node -> Double -> Node
setMdsk t val = t { mDsk = val,
loDsk = if val == noLimit
then noLimitInt
else floor (val * tDsk t) }
setMcpu :: Node -> Double -> Node
setMcpu t val = t { mCpu = val, hiCpu = hcpu }
where new_hcpu = floor (val * tCpu t)::Int
hcpu = if new_hcpu < 0
then noLimitInt
else new_hcpu
computeMaxRes :: P.PeerMap -> P.Elem
computeMaxRes = P.maxElem
buildPeers :: Node -> Instance.List -> Node
buildPeers t il =
let mdata = map
(\i_idx -> let inst = Container.find i_idx il
in (Instance.pNode inst, Instance.mem inst))
(sList t)
pmap = P.accumArray (+) mdata
new_rmem = computeMaxRes pmap
new_failN1 = fMem t <= new_rmem
new_prem = fromIntegral new_rmem / tMem t
in t {peers=pmap, failN1 = new_failN1, rMem = new_rmem, pRem = new_prem}
setPri :: Node -> Instance.Instance -> Node
setPri t inst = t { pList = Instance.idx inst:pList t
, uCpu = new_count
, pCpu = fromIntegral new_count / tCpu t
, utilLoad = utilLoad t `T.addUtil` Instance.util inst
, pTags = addTags (pTags t) (Instance.tags inst)
}
where new_count = uCpu t + Instance.vcpus inst
setSec :: Node -> Instance.Instance -> Node
setSec t inst = t { sList = Instance.idx inst:sList t
, utilLoad = old_load { T.dskWeight = T.dskWeight old_load +
T.dskWeight (Instance.util inst) }
}
where old_load = utilLoad t
setFmem :: Node -> Int -> Node
setFmem t new_mem =
let new_n1 = new_mem <= rMem t
new_mp = fromIntegral new_mem / tMem t
in t { fMem = new_mem, failN1 = new_n1, pMem = new_mp }
removePri :: Node -> Instance.Instance -> Node
removePri t inst =
let iname = Instance.idx inst
new_plist = delete iname (pList t)
new_mem = fMem t + Instance.mem inst
new_dsk = fDsk t + Instance.dsk inst
new_mp = fromIntegral new_mem / tMem t
new_dp = fromIntegral new_dsk / tDsk t
new_failn1 = new_mem <= rMem t
new_ucpu = uCpu t Instance.vcpus inst
new_rcpu = fromIntegral new_ucpu / tCpu t
new_load = utilLoad t `T.subUtil` Instance.util inst
in t { pList = new_plist, fMem = new_mem, fDsk = new_dsk
, failN1 = new_failn1, pMem = new_mp, pDsk = new_dp
, uCpu = new_ucpu, pCpu = new_rcpu, utilLoad = new_load
, pTags = delTags (pTags t) (Instance.tags inst) }
removeSec :: Node -> Instance.Instance -> Node
removeSec t inst =
let iname = Instance.idx inst
pnode = Instance.pNode inst
new_slist = delete iname (sList t)
new_dsk = fDsk t + Instance.dsk inst
old_peers = peers t
old_peem = P.find pnode old_peers
new_peem = old_peem Instance.mem inst
new_peers = P.add pnode new_peem old_peers
old_rmem = rMem t
new_rmem = if old_peem < old_rmem
then old_rmem
else computeMaxRes new_peers
new_prem = fromIntegral new_rmem / tMem t
new_failn1 = fMem t <= new_rmem
new_dp = fromIntegral new_dsk / tDsk t
old_load = utilLoad t
new_load = old_load { T.dskWeight = T.dskWeight old_load
T.dskWeight (Instance.util inst) }
in t { sList = new_slist, fDsk = new_dsk, peers = new_peers
, failN1 = new_failn1, rMem = new_rmem, pDsk = new_dp
, pRem = new_prem, utilLoad = new_load }
addPri :: Node -> Instance.Instance -> T.OpResult Node
addPri t inst =
let iname = Instance.idx inst
new_mem = fMem t Instance.mem inst
new_dsk = fDsk t Instance.dsk inst
new_failn1 = new_mem <= rMem t
new_ucpu = uCpu t + Instance.vcpus inst
new_pcpu = fromIntegral new_ucpu / tCpu t
new_dp = fromIntegral new_dsk / tDsk t
l_cpu = mCpu t
new_load = utilLoad t `T.addUtil` Instance.util inst
inst_tags = Instance.tags inst
old_tags = pTags t
in case () of
_ | new_mem <= 0 -> T.OpFail T.FailMem
| new_dsk <= 0 || mDsk t > new_dp -> T.OpFail T.FailDisk
| new_failn1 && not (failN1 t) -> T.OpFail T.FailMem
| l_cpu >= 0 && l_cpu < new_pcpu -> T.OpFail T.FailCPU
| rejectAddTags old_tags inst_tags -> T.OpFail T.FailTags
| otherwise ->
let new_plist = iname:pList t
new_mp = fromIntegral new_mem / tMem t
r = t { pList = new_plist, fMem = new_mem, fDsk = new_dsk
, failN1 = new_failn1, pMem = new_mp, pDsk = new_dp
, uCpu = new_ucpu, pCpu = new_pcpu
, utilLoad = new_load
, pTags = addTags old_tags inst_tags }
in T.OpGood r
addSec :: Node -> Instance.Instance -> T.Ndx -> T.OpResult Node
addSec t inst pdx =
let iname = Instance.idx inst
old_peers = peers t
old_mem = fMem t
new_dsk = fDsk t Instance.dsk inst
new_peem = P.find pdx old_peers + Instance.mem inst
new_peers = P.add pdx new_peem old_peers
new_rmem = max (rMem t) new_peem
new_prem = fromIntegral new_rmem / tMem t
new_failn1 = old_mem <= new_rmem
new_dp = fromIntegral new_dsk / tDsk t
old_load = utilLoad t
new_load = old_load { T.dskWeight = T.dskWeight old_load +
T.dskWeight (Instance.util inst) }
in case () of
_ | new_dsk <= 0 || mDsk t > new_dp -> T.OpFail T.FailDisk
| Instance.mem inst >= old_mem -> T.OpFail T.FailMem
| new_failn1 && not (failN1 t) -> T.OpFail T.FailMem
| otherwise ->
let new_slist = iname:sList t
r = t { sList = new_slist, fDsk = new_dsk
, peers = new_peers, failN1 = new_failn1
, rMem = new_rmem, pDsk = new_dp
, pRem = new_prem, utilLoad = new_load }
in T.OpGood r
availDisk :: Node -> Int
availDisk t =
let _f = fDsk t
_l = loDsk t
in
if _l == noLimitInt
then _f
else if _f < _l
then 0
else _f _l
showField :: Node -> String -> String
showField t field =
case field of
"name" -> name t
"status" -> if offline t then "-"
else if failN1 t then "*" else " "
"tmem" -> printf "%5.0f" $ tMem t
"nmem" -> printf "%5d" $ nMem t
"xmem" -> printf "%5d" $ xMem t
"fmem" -> printf "%5d" $ fMem t
"imem" -> printf "%5d" imem
"rmem" -> printf "%5d" $ rMem t
"amem" -> printf "%5d" $ fMem t rMem t
"tdsk" -> printf "%5.0f" $ tDsk t / 1024
"fdsk" -> printf "%5d" $ fDsk t `div` 1024
"tcpu" -> printf "%4.0f" $ tCpu t
"ucpu" -> printf "%4d" $ uCpu t
"plist" -> printf "%3d" $ length (pList t)
"slist" -> printf "%3d" $ length (sList t)
"pfmem" -> printf "%6.4f" $ pMem t
"pfdsk" -> printf "%6.4f" $ pDsk t
"rcpu" -> printf "%5.2f" $ pCpu t
"cload" -> printf "%5.3f" uC
"mload" -> printf "%5.3f" uM
"dload" -> printf "%5.3f" uD
"nload" -> printf "%5.3f" uN
"ptags" -> intercalate "," . map (\(k, v) -> printf "%s=%d" k v) .
Map.toList $ pTags t
_ -> printf "<unknown field>"
where
T.DynUtil { T.cpuWeight = uC, T.memWeight = uM,
T.dskWeight = uD, T.netWeight = uN } = utilLoad t
imem = truncate (tMem t) nMem t xMem t fMem t
showHeader :: String -> (String, Bool)
showHeader field =
case field of
"name" -> ("Name", False)
"status" -> ("F", False)
"tmem" -> ("t_mem", True)
"nmem" -> ("n_mem", True)
"xmem" -> ("x_mem", True)
"fmem" -> ("f_mem", True)
"imem" -> ("i_mem", True)
"rmem" -> ("r_mem", True)
"amem" -> ("a_mem", True)
"tdsk" -> ("t_dsk", True)
"fdsk" -> ("f_dsk", True)
"tcpu" -> ("pcpu", True)
"ucpu" -> ("vcpu", True)
"plist" -> ("pri", True)
"slist" -> ("sec", True)
"pfmem" -> ("p_fmem", True)
"pfdsk" -> ("p_fdsk", True)
"rcpu" -> ("r_cpu", True)
"cload" -> ("lCpu", True)
"mload" -> ("lMem", True)
"dload" -> ("lDsk", True)
"nload" -> ("lNet", True)
"ptags" -> ("PrimaryTags", False)
_ -> ("<unknown field>", False)
list :: [String] -> Node -> [String]
list fields t = map (showField t) fields
defaultFields :: [String]
defaultFields =
[ "status", "name", "tmem", "nmem", "imem", "xmem", "fmem"
, "rmem", "tdsk", "fdsk", "tcpu", "ucpu", "plist", "slist"
, "pfmem", "pfdsk", "rcpu"
, "cload", "mload", "dload", "nload" ]