root / Ganeti / HTools / Node.hs @ a46f34d7
History | View | Annotate | Download (16.4 kB)
1 | e4f08c46 | Iustin Pop | {-| Module describing a node. |
---|---|---|---|
2 | e4f08c46 | Iustin Pop | |
3 | e4f08c46 | Iustin Pop | All updates are functional (copy-based) and return a new node with |
4 | e4f08c46 | Iustin Pop | updated value. |
5 | e4f08c46 | Iustin Pop | -} |
6 | e4f08c46 | Iustin Pop | |
7 | e2fa2baf | Iustin Pop | {- |
8 | e2fa2baf | Iustin Pop | |
9 | e2fa2baf | Iustin Pop | Copyright (C) 2009 Google Inc. |
10 | e2fa2baf | Iustin Pop | |
11 | e2fa2baf | Iustin Pop | This program is free software; you can redistribute it and/or modify |
12 | e2fa2baf | Iustin Pop | it under the terms of the GNU General Public License as published by |
13 | e2fa2baf | Iustin Pop | the Free Software Foundation; either version 2 of the License, or |
14 | e2fa2baf | Iustin Pop | (at your option) any later version. |
15 | e2fa2baf | Iustin Pop | |
16 | e2fa2baf | Iustin Pop | This program is distributed in the hope that it will be useful, but |
17 | e2fa2baf | Iustin Pop | WITHOUT ANY WARRANTY; without even the implied warranty of |
18 | e2fa2baf | Iustin Pop | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
19 | e2fa2baf | Iustin Pop | General Public License for more details. |
20 | e2fa2baf | Iustin Pop | |
21 | e2fa2baf | Iustin Pop | You should have received a copy of the GNU General Public License |
22 | e2fa2baf | Iustin Pop | along with this program; if not, write to the Free Software |
23 | e2fa2baf | Iustin Pop | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
24 | e2fa2baf | Iustin Pop | 02110-1301, USA. |
25 | e2fa2baf | Iustin Pop | |
26 | e2fa2baf | Iustin Pop | -} |
27 | e2fa2baf | Iustin Pop | |
28 | 669d7e3d | Iustin Pop | module Ganeti.HTools.Node |
29 | aa8d2e71 | Iustin Pop | ( Node(..) |
30 | 262a08a2 | Iustin Pop | , List |
31 | e4f08c46 | Iustin Pop | -- * Constructor |
32 | e4f08c46 | Iustin Pop | , create |
33 | e4f08c46 | Iustin Pop | -- ** Finalization after data loading |
34 | e4f08c46 | Iustin Pop | , buildPeers |
35 | e4f08c46 | Iustin Pop | , setIdx |
36 | 497e30a1 | Iustin Pop | , setName |
37 | c2c1ef0c | Iustin Pop | , setOffline |
38 | 8c5b0a0d | Iustin Pop | , setXmem |
39 | 53f00b20 | Iustin Pop | , setFmem |
40 | 9188aeef | Iustin Pop | , setPri |
41 | 9188aeef | Iustin Pop | , setSec |
42 | 844eff86 | Iustin Pop | , setMdsk |
43 | 844eff86 | Iustin Pop | , setMcpu |
44 | e4f08c46 | Iustin Pop | -- * Instance (re)location |
45 | e4f08c46 | Iustin Pop | , removePri |
46 | e4f08c46 | Iustin Pop | , removeSec |
47 | e4f08c46 | Iustin Pop | , addPri |
48 | e4f08c46 | Iustin Pop | , addSec |
49 | fe3d6f02 | Iustin Pop | -- * Stats |
50 | fe3d6f02 | Iustin Pop | , availDisk |
51 | 1e4b5230 | Iustin Pop | , conflictingPrimaries |
52 | e4f08c46 | Iustin Pop | -- * Formatting |
53 | 76354e11 | Iustin Pop | , defaultFields |
54 | 76354e11 | Iustin Pop | , showHeader |
55 | 76354e11 | Iustin Pop | , showField |
56 | e4f08c46 | Iustin Pop | , list |
57 | 040afc35 | Iustin Pop | -- * Misc stuff |
58 | 040afc35 | Iustin Pop | , AssocList |
59 | 1fe81531 | Iustin Pop | , AllocElement |
60 | 040afc35 | Iustin Pop | , noSecondary |
61 | e4f08c46 | Iustin Pop | ) where |
62 | e4f08c46 | Iustin Pop | |
63 | e4f08c46 | Iustin Pop | import Data.List |
64 | 5f0b9579 | Iustin Pop | import qualified Data.Map as Map |
65 | 1e4b5230 | Iustin Pop | import qualified Data.Foldable as Foldable |
66 | e4f08c46 | Iustin Pop | import Text.Printf (printf) |
67 | e4f08c46 | Iustin Pop | |
68 | 669d7e3d | Iustin Pop | import qualified Ganeti.HTools.Container as Container |
69 | 669d7e3d | Iustin Pop | import qualified Ganeti.HTools.Instance as Instance |
70 | 12e6776a | Iustin Pop | import qualified Ganeti.HTools.PeerMap as P |
71 | e4f08c46 | Iustin Pop | |
72 | 262a08a2 | Iustin Pop | import qualified Ganeti.HTools.Types as T |
73 | 262a08a2 | Iustin Pop | |
74 | 9188aeef | Iustin Pop | -- * Type declarations |
75 | 9188aeef | Iustin Pop | |
76 | 5f0b9579 | Iustin Pop | -- | The tag map type |
77 | 5f0b9579 | Iustin Pop | type TagMap = Map.Map String Int |
78 | 5f0b9579 | Iustin Pop | |
79 | 9188aeef | Iustin Pop | -- | The node type. |
80 | 12e6776a | Iustin Pop | data Node = Node |
81 | 12e6776a | Iustin Pop | { name :: String -- ^ The node name |
82 | 12e6776a | Iustin Pop | , tMem :: Double -- ^ Total memory (MiB) |
83 | 12e6776a | Iustin Pop | , nMem :: Int -- ^ Node memory (MiB) |
84 | 12e6776a | Iustin Pop | , fMem :: Int -- ^ Free memory (MiB) |
85 | 12e6776a | Iustin Pop | , xMem :: Int -- ^ Unaccounted memory (MiB) |
86 | 12e6776a | Iustin Pop | , tDsk :: Double -- ^ Total disk space (MiB) |
87 | 12e6776a | Iustin Pop | , fDsk :: Int -- ^ Free disk space (MiB) |
88 | 12e6776a | Iustin Pop | , tCpu :: Double -- ^ Total CPU count |
89 | 12e6776a | Iustin Pop | , uCpu :: Int -- ^ Used VCPU count |
90 | 12e6776a | Iustin Pop | , pList :: [T.Idx] -- ^ List of primary instance indices |
91 | 12e6776a | Iustin Pop | , sList :: [T.Idx] -- ^ List of secondary instance indices |
92 | 12e6776a | Iustin Pop | , idx :: T.Ndx -- ^ Internal index for book-keeping |
93 | 12e6776a | Iustin Pop | , peers :: P.PeerMap -- ^ Pnode to instance mapping |
94 | 12e6776a | Iustin Pop | , failN1 :: Bool -- ^ Whether the node has failed n1 |
95 | 12e6776a | Iustin Pop | , rMem :: Int -- ^ Maximum memory needed for failover by |
96 | 12e6776a | Iustin Pop | -- primaries of this node |
97 | 12e6776a | Iustin Pop | , pMem :: Double -- ^ Percent of free memory |
98 | 12e6776a | Iustin Pop | , pDsk :: Double -- ^ Percent of free disk |
99 | 12e6776a | Iustin Pop | , pRem :: Double -- ^ Percent of reserved memory |
100 | 12e6776a | Iustin Pop | , pCpu :: Double -- ^ Ratio of virtual to physical CPUs |
101 | 12e6776a | Iustin Pop | , mDsk :: Double -- ^ Minimum free disk ratio |
102 | 12e6776a | Iustin Pop | , mCpu :: Double -- ^ Max ratio of virt-to-phys CPUs |
103 | 12e6776a | Iustin Pop | , loDsk :: Int -- ^ Autocomputed from mDsk low disk |
104 | 12e6776a | Iustin Pop | -- threshold |
105 | 12e6776a | Iustin Pop | , hiCpu :: Int -- ^ Autocomputed from mCpu high cpu |
106 | 12e6776a | Iustin Pop | -- threshold |
107 | 12e6776a | Iustin Pop | , offline :: Bool -- ^ Whether the node should not be used |
108 | 12e6776a | Iustin Pop | -- for allocations and skipped from score |
109 | 12e6776a | Iustin Pop | -- computations |
110 | 12e6776a | Iustin Pop | , utilPool :: T.DynUtil -- ^ Total utilisation capacity |
111 | 12e6776a | Iustin Pop | , utilLoad :: T.DynUtil -- ^ Sum of instance utilisation |
112 | 5f0b9579 | Iustin Pop | , pTags :: TagMap -- ^ Map of primary instance tags and their count |
113 | 12e6776a | Iustin Pop | } deriving (Show) |
114 | e4f08c46 | Iustin Pop | |
115 | 262a08a2 | Iustin Pop | instance T.Element Node where |
116 | 262a08a2 | Iustin Pop | nameOf = name |
117 | 262a08a2 | Iustin Pop | idxOf = idx |
118 | 262a08a2 | Iustin Pop | setName = setName |
119 | 262a08a2 | Iustin Pop | setIdx = setIdx |
120 | 262a08a2 | Iustin Pop | |
121 | 9188aeef | Iustin Pop | -- | A simple name for the int, node association list. |
122 | 608efcce | Iustin Pop | type AssocList = [(T.Ndx, Node)] |
123 | 040afc35 | Iustin Pop | |
124 | 9188aeef | Iustin Pop | -- | A simple name for a node map. |
125 | 262a08a2 | Iustin Pop | type List = Container.Container Node |
126 | 262a08a2 | Iustin Pop | |
127 | 1fe81531 | Iustin Pop | -- | A simple name for an allocation element (here just for logistic |
128 | 1fe81531 | Iustin Pop | -- reasons) |
129 | 1fe81531 | Iustin Pop | type AllocElement = (List, Instance.Instance, [Node]) |
130 | 1fe81531 | Iustin Pop | |
131 | 9188aeef | Iustin Pop | -- | Constant node index for a non-moveable instance. |
132 | 608efcce | Iustin Pop | noSecondary :: T.Ndx |
133 | 040afc35 | Iustin Pop | noSecondary = -1 |
134 | 040afc35 | Iustin Pop | |
135 | 18b6444b | Iustin Pop | -- | No limit value |
136 | 18b6444b | Iustin Pop | noLimit :: Double |
137 | 18b6444b | Iustin Pop | noLimit = -1 |
138 | 18b6444b | Iustin Pop | |
139 | 836533fa | Iustin Pop | -- | No limit int value |
140 | 836533fa | Iustin Pop | noLimitInt :: Int |
141 | 836533fa | Iustin Pop | noLimitInt = -1 |
142 | 836533fa | Iustin Pop | |
143 | 5f0b9579 | Iustin Pop | -- * Helper functions |
144 | 5f0b9579 | Iustin Pop | |
145 | 5f0b9579 | Iustin Pop | -- | Add a tag to a tagmap |
146 | 5f0b9579 | Iustin Pop | addTag :: TagMap -> String -> TagMap |
147 | 5f0b9579 | Iustin Pop | addTag t s = Map.insertWith (+) s 1 t |
148 | 5f0b9579 | Iustin Pop | |
149 | 5f0b9579 | Iustin Pop | -- | Add multiple tags |
150 | 5f0b9579 | Iustin Pop | addTags :: TagMap -> [String] -> TagMap |
151 | 5f0b9579 | Iustin Pop | addTags = foldl' addTag |
152 | 5f0b9579 | Iustin Pop | |
153 | 5f0b9579 | Iustin Pop | -- | Adjust or delete a tag from a tagmap |
154 | 5f0b9579 | Iustin Pop | delTag :: TagMap -> String -> TagMap |
155 | 5f0b9579 | Iustin Pop | delTag t s = Map.update (\v -> if v > 1 |
156 | 5f0b9579 | Iustin Pop | then Just (v-1) |
157 | 5f0b9579 | Iustin Pop | else Nothing) |
158 | 5f0b9579 | Iustin Pop | s t |
159 | 5f0b9579 | Iustin Pop | |
160 | 5f0b9579 | Iustin Pop | -- | Remove multiple tags |
161 | 5f0b9579 | Iustin Pop | delTags :: TagMap -> [String] -> TagMap |
162 | 5f0b9579 | Iustin Pop | delTags = foldl' delTag |
163 | 5f0b9579 | Iustin Pop | |
164 | 5f0b9579 | Iustin Pop | -- | Check if we can add a list of tags to a tagmap |
165 | 5f0b9579 | Iustin Pop | rejectAddTags :: TagMap -> [String] -> Bool |
166 | 5182e970 | Iustin Pop | rejectAddTags t = any (`Map.member` t) |
167 | 5f0b9579 | Iustin Pop | |
168 | 1e4b5230 | Iustin Pop | -- | Check how many primary instances have conflicting tags. The |
169 | 1e4b5230 | Iustin Pop | -- algorithm to compute this is to sum the count of all tags, then |
170 | 1e4b5230 | Iustin Pop | -- subtract the size of the tag map (since each tag has at least one, |
171 | 1e4b5230 | Iustin Pop | -- non-conflicting instance); this is equivalent to summing the |
172 | 1e4b5230 | Iustin Pop | -- values in the tag map minus one. |
173 | 1e4b5230 | Iustin Pop | conflictingPrimaries :: Node -> Int |
174 | 1e4b5230 | Iustin Pop | conflictingPrimaries (Node { pTags = t }) = Foldable.sum t - Map.size t |
175 | 1e4b5230 | Iustin Pop | |
176 | 9188aeef | Iustin Pop | -- * Initialization functions |
177 | e4f08c46 | Iustin Pop | |
178 | 9188aeef | Iustin Pop | -- | Create a new node. |
179 | 9188aeef | Iustin Pop | -- |
180 | 9188aeef | Iustin Pop | -- The index and the peers maps are empty, and will be need to be |
181 | 9188aeef | Iustin Pop | -- update later via the 'setIdx' and 'buildPeers' functions. |
182 | 1a82215d | Iustin Pop | create :: String -> Double -> Int -> Int -> Double |
183 | 1a82215d | Iustin Pop | -> Int -> Double -> Bool -> Node |
184 | 2727257a | Iustin Pop | create name_init mem_t_init mem_n_init mem_f_init |
185 | 1a82215d | Iustin Pop | dsk_t_init dsk_f_init cpu_t_init offline_init = |
186 | 2180829f | Iustin Pop | Node { name = name_init |
187 | 2180829f | Iustin Pop | , tMem = mem_t_init |
188 | 2180829f | Iustin Pop | , nMem = mem_n_init |
189 | 2180829f | Iustin Pop | , fMem = mem_f_init |
190 | 2180829f | Iustin Pop | , tDsk = dsk_t_init |
191 | 2180829f | Iustin Pop | , fDsk = dsk_f_init |
192 | 2180829f | Iustin Pop | , tCpu = cpu_t_init |
193 | 2180829f | Iustin Pop | , uCpu = 0 |
194 | 2180829f | Iustin Pop | , pList = [] |
195 | 2180829f | Iustin Pop | , sList = [] |
196 | 2180829f | Iustin Pop | , failN1 = True |
197 | 2180829f | Iustin Pop | , idx = -1 |
198 | 12e6776a | Iustin Pop | , peers = P.empty |
199 | 2180829f | Iustin Pop | , rMem = 0 |
200 | 2180829f | Iustin Pop | , pMem = fromIntegral mem_f_init / mem_t_init |
201 | 2180829f | Iustin Pop | , pDsk = fromIntegral dsk_f_init / dsk_t_init |
202 | 2180829f | Iustin Pop | , pRem = 0 |
203 | 2180829f | Iustin Pop | , pCpu = 0 |
204 | 2180829f | Iustin Pop | , offline = offline_init |
205 | 2180829f | Iustin Pop | , xMem = 0 |
206 | 2180829f | Iustin Pop | , mDsk = noLimit |
207 | 2180829f | Iustin Pop | , mCpu = noLimit |
208 | 2180829f | Iustin Pop | , loDsk = noLimitInt |
209 | 2180829f | Iustin Pop | , hiCpu = noLimitInt |
210 | ee9724b9 | Iustin Pop | , utilPool = T.baseUtil |
211 | 2180829f | Iustin Pop | , utilLoad = T.zeroUtil |
212 | 5f0b9579 | Iustin Pop | , pTags = Map.empty |
213 | 2180829f | Iustin Pop | } |
214 | e4f08c46 | Iustin Pop | |
215 | e4f08c46 | Iustin Pop | -- | Changes the index. |
216 | 9188aeef | Iustin Pop | -- |
217 | e4f08c46 | Iustin Pop | -- This is used only during the building of the data structures. |
218 | 608efcce | Iustin Pop | setIdx :: Node -> T.Ndx -> Node |
219 | e4f08c46 | Iustin Pop | setIdx t i = t {idx = i} |
220 | e4f08c46 | Iustin Pop | |
221 | 9188aeef | Iustin Pop | -- | Changes the name. |
222 | 9188aeef | Iustin Pop | -- |
223 | 497e30a1 | Iustin Pop | -- This is used only during the building of the data structures. |
224 | 9188aeef | Iustin Pop | setName :: Node -> String -> Node |
225 | 497e30a1 | Iustin Pop | setName t s = t {name = s} |
226 | 497e30a1 | Iustin Pop | |
227 | 9188aeef | Iustin Pop | -- | Sets the offline attribute. |
228 | c2c1ef0c | Iustin Pop | setOffline :: Node -> Bool -> Node |
229 | c2c1ef0c | Iustin Pop | setOffline t val = t { offline = val } |
230 | c2c1ef0c | Iustin Pop | |
231 | 9188aeef | Iustin Pop | -- | Sets the unnaccounted memory. |
232 | 8c5b0a0d | Iustin Pop | setXmem :: Node -> Int -> Node |
233 | 2060348b | Iustin Pop | setXmem t val = t { xMem = val } |
234 | 8c5b0a0d | Iustin Pop | |
235 | 844eff86 | Iustin Pop | -- | Sets the max disk usage ratio |
236 | 844eff86 | Iustin Pop | setMdsk :: Node -> Double -> Node |
237 | 2060348b | Iustin Pop | setMdsk t val = t { mDsk = val, |
238 | 2060348b | Iustin Pop | loDsk = if val == noLimit |
239 | 836533fa | Iustin Pop | then noLimitInt |
240 | 2060348b | Iustin Pop | else floor (val * tDsk t) } |
241 | 844eff86 | Iustin Pop | |
242 | 844eff86 | Iustin Pop | -- | Sets the max cpu usage ratio |
243 | 844eff86 | Iustin Pop | setMcpu :: Node -> Double -> Node |
244 | 2060348b | Iustin Pop | setMcpu t val = t { mCpu = val, hiCpu = floor (val * tCpu t) } |
245 | 844eff86 | Iustin Pop | |
246 | e4f08c46 | Iustin Pop | -- | Computes the maximum reserved memory for peers from a peer map. |
247 | 12e6776a | Iustin Pop | computeMaxRes :: P.PeerMap -> P.Elem |
248 | 12e6776a | Iustin Pop | computeMaxRes = P.maxElem |
249 | e4f08c46 | Iustin Pop | |
250 | e4f08c46 | Iustin Pop | -- | Builds the peer map for a given node. |
251 | 9cf4267a | Iustin Pop | buildPeers :: Node -> Instance.List -> Node |
252 | 9cf4267a | Iustin Pop | buildPeers t il = |
253 | e4f08c46 | Iustin Pop | let mdata = map |
254 | e4f08c46 | Iustin Pop | (\i_idx -> let inst = Container.find i_idx il |
255 | 2060348b | Iustin Pop | in (Instance.pNode inst, Instance.mem inst)) |
256 | 2060348b | Iustin Pop | (sList t) |
257 | 12e6776a | Iustin Pop | pmap = P.accumArray (+) mdata |
258 | e4f08c46 | Iustin Pop | new_rmem = computeMaxRes pmap |
259 | 2060348b | Iustin Pop | new_failN1 = fMem t <= new_rmem |
260 | 2060348b | Iustin Pop | new_prem = fromIntegral new_rmem / tMem t |
261 | 2060348b | Iustin Pop | in t {peers=pmap, failN1 = new_failN1, rMem = new_rmem, pRem = new_prem} |
262 | e4f08c46 | Iustin Pop | |
263 | a488a217 | Iustin Pop | -- | Assigns an instance to a node as primary and update the used VCPU |
264 | 5f0b9579 | Iustin Pop | -- count, utilisation data and tags map. |
265 | a488a217 | Iustin Pop | setPri :: Node -> Instance.Instance -> Node |
266 | aa8d2e71 | Iustin Pop | setPri t inst = t { pList = Instance.idx inst:pList t |
267 | a488a217 | Iustin Pop | , uCpu = new_count |
268 | aa8d2e71 | Iustin Pop | , pCpu = fromIntegral new_count / tCpu t |
269 | aa8d2e71 | Iustin Pop | , utilLoad = utilLoad t `T.addUtil` Instance.util inst |
270 | 5f0b9579 | Iustin Pop | , pTags = addTags (pTags t) (Instance.tags inst) |
271 | aa8d2e71 | Iustin Pop | } |
272 | a488a217 | Iustin Pop | where new_count = uCpu t + Instance.vcpus inst |
273 | 9188aeef | Iustin Pop | |
274 | 9188aeef | Iustin Pop | -- | Assigns an instance to a node as secondary without other updates. |
275 | a488a217 | Iustin Pop | setSec :: Node -> Instance.Instance -> Node |
276 | aa8d2e71 | Iustin Pop | setSec t inst = t { sList = Instance.idx inst:sList t |
277 | aa8d2e71 | Iustin Pop | , utilLoad = old_load { T.dskWeight = T.dskWeight old_load + |
278 | aa8d2e71 | Iustin Pop | T.dskWeight (Instance.util inst) } |
279 | aa8d2e71 | Iustin Pop | } |
280 | aa8d2e71 | Iustin Pop | where old_load = utilLoad t |
281 | 1a82215d | Iustin Pop | |
282 | 9188aeef | Iustin Pop | -- * Update functions |
283 | 9188aeef | Iustin Pop | |
284 | 9188aeef | Iustin Pop | -- | Sets the free memory. |
285 | 9188aeef | Iustin Pop | setFmem :: Node -> Int -> Node |
286 | 9188aeef | Iustin Pop | setFmem t new_mem = |
287 | 2060348b | Iustin Pop | let new_n1 = new_mem <= rMem t |
288 | 2060348b | Iustin Pop | new_mp = fromIntegral new_mem / tMem t |
289 | bbd8efd2 | Iustin Pop | in t { fMem = new_mem, failN1 = new_n1, pMem = new_mp } |
290 | 9188aeef | Iustin Pop | |
291 | e4f08c46 | Iustin Pop | -- | Removes a primary instance. |
292 | e4f08c46 | Iustin Pop | removePri :: Node -> Instance.Instance -> Node |
293 | e4f08c46 | Iustin Pop | removePri t inst = |
294 | e4f08c46 | Iustin Pop | let iname = Instance.idx inst |
295 | 2060348b | Iustin Pop | new_plist = delete iname (pList t) |
296 | 2060348b | Iustin Pop | new_mem = fMem t + Instance.mem inst |
297 | 2060348b | Iustin Pop | new_dsk = fDsk t + Instance.dsk inst |
298 | 2060348b | Iustin Pop | new_mp = fromIntegral new_mem / tMem t |
299 | 2060348b | Iustin Pop | new_dp = fromIntegral new_dsk / tDsk t |
300 | 2060348b | Iustin Pop | new_failn1 = new_mem <= rMem t |
301 | 2060348b | Iustin Pop | new_ucpu = uCpu t - Instance.vcpus inst |
302 | 2060348b | Iustin Pop | new_rcpu = fromIntegral new_ucpu / tCpu t |
303 | aa8d2e71 | Iustin Pop | new_load = utilLoad t `T.subUtil` Instance.util inst |
304 | bbd8efd2 | Iustin Pop | in t { pList = new_plist, fMem = new_mem, fDsk = new_dsk |
305 | bbd8efd2 | Iustin Pop | , failN1 = new_failn1, pMem = new_mp, pDsk = new_dp |
306 | 5f0b9579 | Iustin Pop | , uCpu = new_ucpu, pCpu = new_rcpu, utilLoad = new_load |
307 | 5f0b9579 | Iustin Pop | , pTags = delTags (pTags t) (Instance.tags inst) } |
308 | e4f08c46 | Iustin Pop | |
309 | e4f08c46 | Iustin Pop | -- | Removes a secondary instance. |
310 | e4f08c46 | Iustin Pop | removeSec :: Node -> Instance.Instance -> Node |
311 | e4f08c46 | Iustin Pop | removeSec t inst = |
312 | e4f08c46 | Iustin Pop | let iname = Instance.idx inst |
313 | 2060348b | Iustin Pop | pnode = Instance.pNode inst |
314 | 2060348b | Iustin Pop | new_slist = delete iname (sList t) |
315 | 2060348b | Iustin Pop | new_dsk = fDsk t + Instance.dsk inst |
316 | e4f08c46 | Iustin Pop | old_peers = peers t |
317 | 12e6776a | Iustin Pop | old_peem = P.find pnode old_peers |
318 | 9f6dcdea | Iustin Pop | new_peem = old_peem - Instance.mem inst |
319 | 12e6776a | Iustin Pop | new_peers = P.add pnode new_peem old_peers |
320 | 2060348b | Iustin Pop | old_rmem = rMem t |
321 | bbd8efd2 | Iustin Pop | new_rmem = if old_peem < old_rmem |
322 | bbd8efd2 | Iustin Pop | then old_rmem |
323 | bbd8efd2 | Iustin Pop | else computeMaxRes new_peers |
324 | 2060348b | Iustin Pop | new_prem = fromIntegral new_rmem / tMem t |
325 | 2060348b | Iustin Pop | new_failn1 = fMem t <= new_rmem |
326 | 2060348b | Iustin Pop | new_dp = fromIntegral new_dsk / tDsk t |
327 | aa8d2e71 | Iustin Pop | old_load = utilLoad t |
328 | aa8d2e71 | Iustin Pop | new_load = old_load { T.dskWeight = T.dskWeight old_load - |
329 | aa8d2e71 | Iustin Pop | T.dskWeight (Instance.util inst) } |
330 | bbd8efd2 | Iustin Pop | in t { sList = new_slist, fDsk = new_dsk, peers = new_peers |
331 | bbd8efd2 | Iustin Pop | , failN1 = new_failn1, rMem = new_rmem, pDsk = new_dp |
332 | bbd8efd2 | Iustin Pop | , pRem = new_prem, utilLoad = new_load } |
333 | e4f08c46 | Iustin Pop | |
334 | e4f08c46 | Iustin Pop | -- | Adds a primary instance. |
335 | f2280553 | Iustin Pop | addPri :: Node -> Instance.Instance -> T.OpResult Node |
336 | e4f08c46 | Iustin Pop | addPri t inst = |
337 | e4f08c46 | Iustin Pop | let iname = Instance.idx inst |
338 | 2060348b | Iustin Pop | new_mem = fMem t - Instance.mem inst |
339 | 2060348b | Iustin Pop | new_dsk = fDsk t - Instance.dsk inst |
340 | 2060348b | Iustin Pop | new_failn1 = new_mem <= rMem t |
341 | 2060348b | Iustin Pop | new_ucpu = uCpu t + Instance.vcpus inst |
342 | 2060348b | Iustin Pop | new_pcpu = fromIntegral new_ucpu / tCpu t |
343 | 2060348b | Iustin Pop | new_dp = fromIntegral new_dsk / tDsk t |
344 | 2060348b | Iustin Pop | l_cpu = mCpu t |
345 | aa8d2e71 | Iustin Pop | new_load = utilLoad t `T.addUtil` Instance.util inst |
346 | 5f0b9579 | Iustin Pop | inst_tags = Instance.tags inst |
347 | 5f0b9579 | Iustin Pop | old_tags = pTags t |
348 | a4a6e623 | Iustin Pop | in case () of |
349 | a4a6e623 | Iustin Pop | _ | new_mem <= 0 -> T.OpFail T.FailMem |
350 | a4a6e623 | Iustin Pop | | new_dsk <= 0 || mDsk t > new_dp -> T.OpFail T.FailDisk |
351 | a4a6e623 | Iustin Pop | | new_failn1 && not (failN1 t) -> T.OpFail T.FailMem |
352 | a4a6e623 | Iustin Pop | | l_cpu >= 0 && l_cpu < new_pcpu -> T.OpFail T.FailCPU |
353 | a4a6e623 | Iustin Pop | | rejectAddTags old_tags inst_tags -> T.OpFail T.FailTags |
354 | a4a6e623 | Iustin Pop | | otherwise -> |
355 | a4a6e623 | Iustin Pop | let new_plist = iname:pList t |
356 | a4a6e623 | Iustin Pop | new_mp = fromIntegral new_mem / tMem t |
357 | a4a6e623 | Iustin Pop | r = t { pList = new_plist, fMem = new_mem, fDsk = new_dsk |
358 | a4a6e623 | Iustin Pop | , failN1 = new_failn1, pMem = new_mp, pDsk = new_dp |
359 | a4a6e623 | Iustin Pop | , uCpu = new_ucpu, pCpu = new_pcpu |
360 | a4a6e623 | Iustin Pop | , utilLoad = new_load |
361 | a4a6e623 | Iustin Pop | , pTags = addTags old_tags inst_tags } |
362 | a4a6e623 | Iustin Pop | in T.OpGood r |
363 | e4f08c46 | Iustin Pop | |
364 | e4f08c46 | Iustin Pop | -- | Adds a secondary instance. |
365 | f2280553 | Iustin Pop | addSec :: Node -> Instance.Instance -> T.Ndx -> T.OpResult Node |
366 | e4f08c46 | Iustin Pop | addSec t inst pdx = |
367 | e4f08c46 | Iustin Pop | let iname = Instance.idx inst |
368 | e4f08c46 | Iustin Pop | old_peers = peers t |
369 | 2060348b | Iustin Pop | old_mem = fMem t |
370 | 2060348b | Iustin Pop | new_dsk = fDsk t - Instance.dsk inst |
371 | 12e6776a | Iustin Pop | new_peem = P.find pdx old_peers + Instance.mem inst |
372 | 12e6776a | Iustin Pop | new_peers = P.add pdx new_peem old_peers |
373 | 2060348b | Iustin Pop | new_rmem = max (rMem t) new_peem |
374 | 2060348b | Iustin Pop | new_prem = fromIntegral new_rmem / tMem t |
375 | c43c3354 | Iustin Pop | new_failn1 = old_mem <= new_rmem |
376 | 2060348b | Iustin Pop | new_dp = fromIntegral new_dsk / tDsk t |
377 | aa8d2e71 | Iustin Pop | old_load = utilLoad t |
378 | aa8d2e71 | Iustin Pop | new_load = old_load { T.dskWeight = T.dskWeight old_load + |
379 | aa8d2e71 | Iustin Pop | T.dskWeight (Instance.util inst) } |
380 | a4a6e623 | Iustin Pop | in case () of |
381 | a4a6e623 | Iustin Pop | _ | new_dsk <= 0 || mDsk t > new_dp -> T.OpFail T.FailDisk |
382 | 146b37eb | Iustin Pop | | Instance.mem inst >= old_mem -> T.OpFail T.FailMem |
383 | a4a6e623 | Iustin Pop | | new_failn1 && not (failN1 t) -> T.OpFail T.FailMem |
384 | a4a6e623 | Iustin Pop | | otherwise -> |
385 | a4a6e623 | Iustin Pop | let new_slist = iname:sList t |
386 | a4a6e623 | Iustin Pop | r = t { sList = new_slist, fDsk = new_dsk |
387 | a4a6e623 | Iustin Pop | , peers = new_peers, failN1 = new_failn1 |
388 | a4a6e623 | Iustin Pop | , rMem = new_rmem, pDsk = new_dp |
389 | a4a6e623 | Iustin Pop | , pRem = new_prem, utilLoad = new_load } |
390 | a4a6e623 | Iustin Pop | in T.OpGood r |
391 | e4f08c46 | Iustin Pop | |
392 | fe3d6f02 | Iustin Pop | -- * Stats functions |
393 | fe3d6f02 | Iustin Pop | |
394 | fe3d6f02 | Iustin Pop | -- | Computes the amount of available disk on a given node |
395 | fe3d6f02 | Iustin Pop | availDisk :: Node -> Int |
396 | fe3d6f02 | Iustin Pop | availDisk t = |
397 | 2060348b | Iustin Pop | let _f = fDsk t |
398 | 2060348b | Iustin Pop | _l = loDsk t |
399 | fe3d6f02 | Iustin Pop | in |
400 | fe3d6f02 | Iustin Pop | if _l == noLimitInt |
401 | fe3d6f02 | Iustin Pop | then _f |
402 | fe3d6f02 | Iustin Pop | else if _f < _l |
403 | fe3d6f02 | Iustin Pop | then 0 |
404 | fe3d6f02 | Iustin Pop | else _f - _l |
405 | fe3d6f02 | Iustin Pop | |
406 | 9188aeef | Iustin Pop | -- * Display functions |
407 | 01f6a5d2 | Iustin Pop | |
408 | c5f7412e | Iustin Pop | showField :: Node -> String -> String |
409 | c5f7412e | Iustin Pop | showField t field = |
410 | c5f7412e | Iustin Pop | case field of |
411 | c5f7412e | Iustin Pop | "name" -> name t |
412 | c5f7412e | Iustin Pop | "status" -> if offline t then "-" |
413 | c5f7412e | Iustin Pop | else if failN1 t then "*" else " " |
414 | c5f7412e | Iustin Pop | "tmem" -> printf "%5.0f" $ tMem t |
415 | c5f7412e | Iustin Pop | "nmem" -> printf "%5d" $ nMem t |
416 | c5f7412e | Iustin Pop | "xmem" -> printf "%5d" $ xMem t |
417 | c5f7412e | Iustin Pop | "fmem" -> printf "%5d" $ fMem t |
418 | c5f7412e | Iustin Pop | "imem" -> printf "%5d" imem |
419 | c5f7412e | Iustin Pop | "rmem" -> printf "%5d" $ rMem t |
420 | 76354e11 | Iustin Pop | "amem" -> printf "%5d" $ fMem t - rMem t |
421 | c5f7412e | Iustin Pop | "tdsk" -> printf "%5.0f" $ tDsk t / 1024 |
422 | c5f7412e | Iustin Pop | "fdsk" -> printf "%5d" $ fDsk t `div` 1024 |
423 | c5f7412e | Iustin Pop | "tcpu" -> printf "%4.0f" $ tCpu t |
424 | c5f7412e | Iustin Pop | "ucpu" -> printf "%4d" $ uCpu t |
425 | c5f7412e | Iustin Pop | "plist" -> printf "%3d" $ length (pList t) |
426 | c5f7412e | Iustin Pop | "slist" -> printf "%3d" $ length (sList t) |
427 | c5f7412e | Iustin Pop | "pfmem" -> printf "%6.4f" $ pMem t |
428 | c5f7412e | Iustin Pop | "pfdsk" -> printf "%6.4f" $ pDsk t |
429 | c5f7412e | Iustin Pop | "rcpu" -> printf "%5.2f" $ pCpu t |
430 | c5f7412e | Iustin Pop | "cload" -> printf "%5.3f" uC |
431 | c5f7412e | Iustin Pop | "mload" -> printf "%5.3f" uM |
432 | c5f7412e | Iustin Pop | "dload" -> printf "%5.3f" uD |
433 | c5f7412e | Iustin Pop | "nload" -> printf "%5.3f" uN |
434 | b2999982 | Iustin Pop | "ptags" -> intercalate "," . map (\(k, v) -> printf "%s=%d" k v) . |
435 | b2999982 | Iustin Pop | Map.toList $ pTags t |
436 | c5f7412e | Iustin Pop | _ -> printf "<unknown field>" |
437 | c5f7412e | Iustin Pop | where |
438 | c5f7412e | Iustin Pop | T.DynUtil { T.cpuWeight = uC, T.memWeight = uM, |
439 | c5f7412e | Iustin Pop | T.dskWeight = uD, T.netWeight = uN } = utilLoad t |
440 | c5f7412e | Iustin Pop | imem = truncate (tMem t) - nMem t - xMem t - fMem t |
441 | c5f7412e | Iustin Pop | |
442 | 76354e11 | Iustin Pop | -- | Returns the header and numeric propery of a field |
443 | 76354e11 | Iustin Pop | showHeader :: String -> (String, Bool) |
444 | 76354e11 | Iustin Pop | showHeader field = |
445 | 76354e11 | Iustin Pop | case field of |
446 | 76354e11 | Iustin Pop | "name" -> ("Name", False) |
447 | 76354e11 | Iustin Pop | "status" -> ("F", False) |
448 | 76354e11 | Iustin Pop | "tmem" -> ("t_mem", True) |
449 | 76354e11 | Iustin Pop | "nmem" -> ("n_mem", True) |
450 | 76354e11 | Iustin Pop | "xmem" -> ("x_mem", True) |
451 | 76354e11 | Iustin Pop | "fmem" -> ("f_mem", True) |
452 | 76354e11 | Iustin Pop | "imem" -> ("i_mem", True) |
453 | 76354e11 | Iustin Pop | "rmem" -> ("r_mem", True) |
454 | 76354e11 | Iustin Pop | "amem" -> ("a_mem", True) |
455 | 76354e11 | Iustin Pop | "tdsk" -> ("t_dsk", True) |
456 | 76354e11 | Iustin Pop | "fdsk" -> ("f_dsk", True) |
457 | 76354e11 | Iustin Pop | "tcpu" -> ("pcpu", True) |
458 | 76354e11 | Iustin Pop | "ucpu" -> ("vcpu", True) |
459 | 76354e11 | Iustin Pop | "plist" -> ("pri", True) |
460 | 76354e11 | Iustin Pop | "slist" -> ("sec", True) |
461 | 76354e11 | Iustin Pop | "pfmem" -> ("p_fmem", True) |
462 | 76354e11 | Iustin Pop | "pfdsk" -> ("p_fdsk", True) |
463 | 76354e11 | Iustin Pop | "rcpu" -> ("r_cpu", True) |
464 | 76354e11 | Iustin Pop | "cload" -> ("lCpu", True) |
465 | 76354e11 | Iustin Pop | "mload" -> ("lMem", True) |
466 | 76354e11 | Iustin Pop | "dload" -> ("lDsk", True) |
467 | 76354e11 | Iustin Pop | "nload" -> ("lNet", True) |
468 | b2999982 | Iustin Pop | "ptags" -> ("PrimaryTags", False) |
469 | 76354e11 | Iustin Pop | _ -> ("<unknown field>", False) |
470 | c5f7412e | Iustin Pop | |
471 | e4f08c46 | Iustin Pop | -- | String converter for the node list functionality. |
472 | 76354e11 | Iustin Pop | list :: [String] -> Node -> [String] |
473 | 76354e11 | Iustin Pop | list fields t = map (showField t) fields |
474 | 76354e11 | Iustin Pop | |
475 | 76354e11 | Iustin Pop | |
476 | 76354e11 | Iustin Pop | defaultFields :: [String] |
477 | 76354e11 | Iustin Pop | defaultFields = |
478 | 76354e11 | Iustin Pop | [ "status", "name", "tmem", "nmem", "imem", "xmem", "fmem" |
479 | 76354e11 | Iustin Pop | , "rmem", "tdsk", "fdsk", "tcpu", "ucpu", "plist", "slist" |
480 | 76354e11 | Iustin Pop | , "pfmem", "pfdsk", "rcpu" |
481 | 76354e11 | Iustin Pop | , "cload", "mload", "dload", "nload" ] |