-}
-module Ganeti.HTools.Types
- where
+{-
-import qualified Ganeti.HTools.Container as Container
-import qualified Ganeti.HTools.Instance as Instance
-import qualified Ganeti.HTools.Node as Node
+Copyright (C) 2009 Google Inc.
-type NodeList = Container.Container Node.Node
-type InstanceList = Container.Container Instance.Instance
+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.
--- | The type used to hold idx-to-name mappings
-type NameList = [(Int, String)]
+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.
--- | The type used to hold name-to-idx mappings
-type NameAssoc = [(String, Int)]
+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.
-type IdxNode = [(Int, Node.Node)]
-type IdxInstance = [(Int, Instance.Instance)]
+-}
-{-
+module Ganeti.HTools.Types
+ ( Idx
+ , Ndx
+ , NameAssoc
+ , Score
+ , Weight
+ , RSpec(..)
+ , DynUtil(..)
+ , zeroUtil
+ , baseUtil
+ , addUtil
+ , subUtil
+ , Placement
+ , IMove(..)
+ , MoveJob
+ , JobSet
+ , Result(..)
+ , Element(..)
+ , FailMode(..)
+ , FailStats
+ , OpResult(..)
+ , connTimeout
+ , queryTimeout
+ ) where
+
+-- | The instance index type.
+type Idx = Int
+
+-- | The node index type.
+type Ndx = Int
+
+-- | The type used to hold name-to-idx mappings.
+type NameAssoc = [(String, Int)]
+
+-- | A separate name for the cluster score type.
+type Score = Double
+
+-- | A separate name for a weight metric.
+type Weight = Double
+
+-- | The resource spec type.
+data RSpec = RSpec
+ { rspecCpu :: Int -- ^ Requested VCPUs
+ , rspecMem :: Int -- ^ Requested memory
+ , rspecDsk :: Int -- ^ Requested disk
+ } deriving (Show, Eq)
+
+-- | The dynamic resource specs of a machine (i.e. load or load
+-- capacity, as opposed to size).
+data DynUtil = DynUtil
+ { cpuWeight :: Weight -- ^ Standardised CPU usage
+ , memWeight :: Weight -- ^ Standardised memory load
+ , dskWeight :: Weight -- ^ Standardised disk I\/O usage
+ , netWeight :: Weight -- ^ Standardised network usage
+ } deriving (Show)
+
+-- | Initial empty utilisation
+zeroUtil :: DynUtil
+zeroUtil = DynUtil { cpuWeight = 0, memWeight = 0
+ , dskWeight = 0, netWeight = 0 }
+
+baseUtil :: DynUtil
+baseUtil = DynUtil { cpuWeight = 1, memWeight = 1
+ , dskWeight = 1, netWeight = 1 }
+
+addUtil :: DynUtil -> DynUtil -> DynUtil
+addUtil (DynUtil a1 a2 a3 a4) (DynUtil b1 b2 b3 b4) =
+ DynUtil (a1+b1) (a2+b2) (a3+b3) (a4+b4)
+
+subUtil :: DynUtil -> DynUtil -> DynUtil
+subUtil (DynUtil a1 a2 a3 a4) (DynUtil b1 b2 b3 b4) =
+ DynUtil (a1-b1) (a2-b2) (a3-b3) (a4-b4)
+
+-- | The description of an instance placement. It contains the
+-- instance index, the new primary and secondary node, the move being
+-- performed and the score of the cluster after the move.
+type Placement = (Idx, Ndx, Ndx, IMove, Score)
+
+-- | An instance move definition
+data IMove = Failover -- ^ Failover the instance (f)
+ | ReplacePrimary Ndx -- ^ Replace primary (f, r:np, f)
+ | ReplaceSecondary Ndx -- ^ Replace secondary (r:ns)
+ | ReplaceAndFailover Ndx -- ^ Replace secondary, failover (r:np, f)
+ | FailoverAndReplace Ndx -- ^ Failover, replace secondary (f, r:ns)
+ deriving (Show)
+
+-- | Formatted solution output for one move (involved nodes and
+-- commands
+type MoveJob = ([Ndx], Idx, IMove, [String])
+
+-- | A list of command elements
+type JobSet = [MoveJob]
+
+-- | Connection timeout (when using non-file methods).
+connTimeout :: Int
+connTimeout = 15
+
+-- | The default timeout for queries (when using non-file methods).
+queryTimeout :: Int
+queryTimeout = 60
+
+{-|
This is similar to the JSON library Result type - *very* similar, but
we want to use it in multiple places, so we abstract it into a
mini-library here
-}
-
data Result a
= Bad String
| Ok a
return = Ok
fail = Bad
--- | A generic class for nodes and instances
+-- | Reason for an operation's falure
+data FailMode = FailMem -- ^ Failed due to not enough RAM
+ | FailDisk -- ^ Failed due to not enough disk
+ | FailCPU -- ^ Failed due to not enough CPU capacity
+ | FailN1 -- ^ Failed due to not passing N1 checks
+ | FailTags -- ^ Failed due to tag exclusion
+ deriving (Eq, Enum, Bounded, Show)
+
+-- | List with failure statistics
+type FailStats = [(FailMode, Int)]
+
+-- | Either-like data-type customized for our failure modes
+data OpResult a = OpFail FailMode -- ^ Failed operation
+ | OpGood a -- ^ Success operation
+
+instance Monad OpResult where
+ (OpGood x) >>= fn = fn x
+ (OpFail y) >>= _ = OpFail y
+ return = OpGood
+
+-- | A generic class for items that have updateable names and indices.
class Element a where
- name :: a -> String
- idx :: a -> Int
+ -- | Returns the name of the element
+ nameOf :: a -> String
+ -- | Returns the index of the element
+ idxOf :: a -> Int
+ -- | Updates the name of the element
setName :: a -> String -> a
+ -- | Updates the index of the element
setIdx :: a -> Int -> a
-
--- Let's make nodes elements of the cluster
-instance Element Node.Node where
- name = Node.name
- idx = Node.idx
- setName = Node.setName
- setIdx = Node.setIdx
-
--- And instances too
-instance Element Instance.Instance where
- name = Instance.name
- idx = Instance.idx
- setName = Instance.setName
- setIdx = Instance.setIdx
-
--- | Compute the name of an element in a container
-cNameOf :: (Element a) => Container.Container a -> Container.Key -> String
-cNameOf c k = name $ Container.find k c
-
--- | Compute the maximum name length in an Element Container
-cMaxNamelen :: (Element a) => Container.Container a -> Int
-cMaxNamelen = maximum . map (length . name) . Container.elems
-
--- | Find an element by name in a Container; this is a very slow function
-findByName :: (Element a, Monad m) =>
- Container.Container a -> String -> m Container.Key
-findByName c n =
- let all_elems = Container.elems c
- result = filter ((== n) . name) all_elems
- nems = length result
- in
- if nems /= 1 then
- fail $ "Wrong number of elems (" ++ (show nems) ++
- ") found with name " ++ n
- else
- return $ idx $ head result
projects / ganeti-local / blobdiff