Skip to content
Snippets Groups Projects
Commit 97936d51 authored by Iustin Pop's avatar Iustin Pop
Browse files

htools: rename an internal constant


'emptySolution' is fine while we have only one Solution type
(AllocSolution), but in the future we'll introduce another one and
thus we should rename it.

Signed-off-by: default avatarIustin Pop <iustin@google.com>
Reviewed-by: default avatarGuido Trotter <ultrotter@google.com>
parent 1f4ae205
No related branches found
No related tags found
No related merge requests found
...@@ -113,9 +113,9 @@ type AllocResult = (FailStats, Node.List, Instance.List, ...@@ -113,9 +113,9 @@ type AllocResult = (FailStats, Node.List, Instance.List,
type AllocNodes = Either [Ndx] [(Ndx, Ndx)] type AllocNodes = Either [Ndx] [(Ndx, Ndx)]
-- | The empty solution we start with when computing allocations. -- | The empty solution we start with when computing allocations.
emptySolution :: AllocSolution emptyAllocSolution :: AllocSolution
emptySolution = AllocSolution { asFailures = [], asAllocs = 0 emptyAllocSolution = AllocSolution { asFailures = [], asAllocs = 0
, asSolutions = [], asLog = [] } , asSolutions = [], asLog = [] }
-- | The complete state for the balancing solution. -- | The complete state for the balancing solution.
data Table = Table Node.List Instance.List Score [Placement] data Table = Table Node.List Instance.List Score [Placement]
...@@ -665,7 +665,7 @@ tryAlloc :: (Monad m) => ...@@ -665,7 +665,7 @@ tryAlloc :: (Monad m) =>
tryAlloc nl _ inst (Right ok_pairs) = tryAlloc nl _ inst (Right ok_pairs) =
let sols = foldl' (\cstate (p, s) -> let sols = foldl' (\cstate (p, s) ->
concatAllocs cstate $ allocateOnPair nl inst p s concatAllocs cstate $ allocateOnPair nl inst p s
) emptySolution ok_pairs ) emptyAllocSolution ok_pairs
in if null ok_pairs -- means we have just one node in if null ok_pairs -- means we have just one node
then fail "Not enough online nodes" then fail "Not enough online nodes"
...@@ -674,7 +674,7 @@ tryAlloc nl _ inst (Right ok_pairs) = ...@@ -674,7 +674,7 @@ tryAlloc nl _ inst (Right ok_pairs) =
tryAlloc nl _ inst (Left all_nodes) = tryAlloc nl _ inst (Left all_nodes) =
let sols = foldl' (\cstate -> let sols = foldl' (\cstate ->
concatAllocs cstate . allocateOnSingle nl inst concatAllocs cstate . allocateOnSingle nl inst
) emptySolution all_nodes ) emptyAllocSolution all_nodes
in if null all_nodes in if null all_nodes
then fail "No online nodes" then fail "No online nodes"
else return $ annotateSolution sols else return $ annotateSolution sols
...@@ -758,7 +758,7 @@ tryReloc nl il xid 1 ex_idx = ...@@ -758,7 +758,7 @@ tryReloc nl il xid 1 ex_idx =
return (mnl, i, [Container.find x mnl], return (mnl, i, [Container.find x mnl],
compCV mnl) compCV mnl)
in concatAllocs cstate em in concatAllocs cstate em
) emptySolution valid_idxes ) emptyAllocSolution valid_idxes
in return sols1 in return sols1
tryReloc _ _ _ reqn _ = fail $ "Unsupported number of relocation \ tryReloc _ _ _ reqn _ = fail $ "Unsupported number of relocation \
...@@ -819,7 +819,7 @@ tryEvac :: (Monad m) => ...@@ -819,7 +819,7 @@ tryEvac :: (Monad m) =>
-> [Ndx] -- ^ Restricted nodes (the ones being evacuated) -> [Ndx] -- ^ Restricted nodes (the ones being evacuated)
-> m AllocSolution -- ^ Solution list -> m AllocSolution -- ^ Solution list
tryEvac nl il idxs ex_ndx = do tryEvac nl il idxs ex_ndx = do
(_, sol) <- foldM (evacInstance ex_ndx il) (nl, emptySolution) idxs (_, sol) <- foldM (evacInstance ex_ndx il) (nl, emptyAllocSolution) idxs
return sol return sol
-- | Multi-group evacuation of a list of nodes. -- | Multi-group evacuation of a list of nodes.
...@@ -836,7 +836,7 @@ tryMGEvac _ nl il ex_ndx = ...@@ -836,7 +836,7 @@ tryMGEvac _ nl il ex_ndx =
in do in do
results <- mapM (\(_, (gnl, gil, idxs)) -> tryEvac gnl gil idxs ex_ndx) results <- mapM (\(_, (gnl, gil, idxs)) -> tryEvac gnl gil idxs ex_ndx)
all_insts' all_insts'
let sol = foldl' sumAllocs emptySolution results let sol = foldl' sumAllocs emptyAllocSolution results
return $ annotateSolution sol return $ annotateSolution sol
-- | Recursively place instances on the cluster until we're out of space. -- | Recursively place instances on the cluster until we're out of space.
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment