2012-07-23 03:16:56 +00:00
|
|
|
{- git-annex assistant remotes needing scanning
|
|
|
|
-
|
2015-01-21 16:50:09 +00:00
|
|
|
- Copyright 2012 Joey Hess <id@joeyh.name>
|
2012-07-23 03:16:56 +00:00
|
|
|
-
|
|
|
|
- Licensed under the GNU GPL version 3 or higher.
|
|
|
|
-}
|
|
|
|
|
|
|
|
module Assistant.ScanRemotes where
|
|
|
|
|
2012-10-29 23:14:30 +00:00
|
|
|
import Assistant.Common
|
|
|
|
import Assistant.Types.ScanRemotes
|
2012-08-23 17:41:38 +00:00
|
|
|
import qualified Types.Remote as Remote
|
2012-07-23 03:16:56 +00:00
|
|
|
|
2012-08-23 17:41:38 +00:00
|
|
|
import Data.Function
|
2012-07-23 03:16:56 +00:00
|
|
|
import Control.Concurrent.STM
|
2014-01-07 18:55:06 +00:00
|
|
|
import qualified Data.Map as M
|
2012-07-23 03:16:56 +00:00
|
|
|
|
scan multiple remotes in one pass
The expensive transfer scan now scans a whole set of remotes in one pass.
So at startup, or when network comes up, it will run only once.
Note that this can result in transfers from/to higher cost remotes being
queued before other transfers of other content from/to lower cost remotes.
Before, low cost remotes were scanned first and all their transfers came
first. When multiple transfers are queued for a key, the lower cost ones
are still queued first. However, this could result in transfers from slow
remotes running for a long time while transfers of other data from faster
remotes waits.
I expect to make the transfer queue smarter about ordering
and/or make it allow multiple transfers at a time, which should eliminate
this annoyance. (Also, it was already possible to get into that situation,
for example if the network was up, lots of transfers from slow remotes
might be queued, and then a disk is mounted and its faster transfers have
to wait.)
Also note that this means I don't need to improve the code in
Assistant.Sync that currently checks if any of the reconnected remotes
have diverged, and if so, queues scans of all of them. That had been very
innefficient, but now doesn't matter.
2012-08-26 18:01:43 +00:00
|
|
|
{- Blocks until there is a remote or remotes that need to be scanned.
|
|
|
|
-
|
|
|
|
- The list has higher priority remotes listed first. -}
|
2012-10-29 23:14:30 +00:00
|
|
|
getScanRemote :: Assistant [(Remote, ScanInfo)]
|
|
|
|
getScanRemote = do
|
|
|
|
v <- getAssistant scanRemoteMap
|
|
|
|
liftIO $ atomically $
|
|
|
|
reverse . sortBy (compare `on` scanPriority . snd) . M.toList
|
|
|
|
<$> takeTMVar v
|
scan multiple remotes in one pass
The expensive transfer scan now scans a whole set of remotes in one pass.
So at startup, or when network comes up, it will run only once.
Note that this can result in transfers from/to higher cost remotes being
queued before other transfers of other content from/to lower cost remotes.
Before, low cost remotes were scanned first and all their transfers came
first. When multiple transfers are queued for a key, the lower cost ones
are still queued first. However, this could result in transfers from slow
remotes running for a long time while transfers of other data from faster
remotes waits.
I expect to make the transfer queue smarter about ordering
and/or make it allow multiple transfers at a time, which should eliminate
this annoyance. (Also, it was already possible to get into that situation,
for example if the network was up, lots of transfers from slow remotes
might be queued, and then a disk is mounted and its faster transfers have
to wait.)
Also note that this means I don't need to improve the code in
Assistant.Sync that currently checks if any of the reconnected remotes
have diverged, and if so, queues scans of all of them. That had been very
innefficient, but now doesn't matter.
2012-08-26 18:01:43 +00:00
|
|
|
|
|
|
|
{- Adds new remotes that need scanning. -}
|
2012-10-29 23:14:30 +00:00
|
|
|
addScanRemotes :: Bool -> [Remote] -> Assistant ()
|
|
|
|
addScanRemotes _ [] = noop
|
|
|
|
addScanRemotes full rs = do
|
|
|
|
v <- getAssistant scanRemoteMap
|
|
|
|
liftIO $ atomically $ do
|
|
|
|
m <- fromMaybe M.empty <$> tryTakeTMVar v
|
|
|
|
putTMVar v $ M.unionWith merge (M.fromList $ zip rs (map info rs)) m
|
2012-10-31 06:34:03 +00:00
|
|
|
where
|
|
|
|
info r = ScanInfo (-1 * Remote.cost r) full
|
|
|
|
merge x y = ScanInfo
|
|
|
|
{ scanPriority = max (scanPriority x) (scanPriority y)
|
|
|
|
, fullScan = fullScan x || fullScan y
|
|
|
|
}
|