|
1 |
| -{-# LANGUAGE OverloadedStrings #-} |
2 |
| -{-# LANGUAGE RecordWildCards #-} |
3 | 1 | {-# LANGUAGE TemplateHaskell #-}
|
4 |
| -module Stack.Dot where |
5 |
| - |
| 2 | +{-# LANGUAGE TupleSections #-} |
| 3 | +{-# LANGUAGE FlexibleContexts #-} |
| 4 | +{-# LANGUAGE OverloadedStrings #-} |
| 5 | +module Stack.Dot (dot |
| 6 | + ,DotOpts(..) |
| 7 | + ,dotOptsParser |
| 8 | + ,resolveDependencies |
| 9 | + ,printGraph |
| 10 | + ) where |
6 | 11 |
|
7 |
| -import Control.Monad (when) |
| 12 | +import Control.Monad (void) |
8 | 13 | import Control.Monad.Catch (MonadCatch)
|
9 |
| -import Control.Monad.IO.Class (MonadIO) |
| 14 | +import Control.Monad.IO.Class |
10 | 15 | import Control.Monad.Logger (MonadLogger, logInfo)
|
11 | 16 | import Control.Monad.Reader (MonadReader)
|
| 17 | +import Control.Monad.Trans.Control (MonadBaseControl) |
12 | 18 | import qualified Data.Foldable as F
|
13 |
| -import Data.Monoid ((<>)) |
| 19 | +import qualified Data.HashSet as HashSet |
| 20 | +import Data.Map (Map) |
14 | 21 | import qualified Data.Map as Map
|
| 22 | +import Data.Monoid ((<>)) |
| 23 | +import Data.Set (Set) |
15 | 24 | import qualified Data.Set as Set
|
16 |
| -import qualified Data.Text as T |
| 25 | +import Data.Text (Text) |
| 26 | +import qualified Data.Text as Text |
| 27 | +import qualified Data.Traversable as T |
| 28 | +import Network.HTTP.Client.Conduit (HasHttpManager) |
| 29 | +import Options.Applicative |
| 30 | +import Options.Applicative.Builder.Extra (boolFlags) |
| 31 | +import Stack.Build (withLoadPackage) |
17 | 32 | import Stack.Build.Source
|
18 | 33 | import Stack.Build.Types
|
| 34 | +import Stack.Constants |
19 | 35 | import Stack.Package
|
20 | 36 | import Stack.Types
|
21 | 37 |
|
| 38 | +-- | Options record for `stack dot` |
| 39 | +data DotOpts = DotOpts |
| 40 | + { dotIncludeExternal :: Bool |
| 41 | + -- ^ Include external dependencies |
| 42 | + , dotIncludeBase :: Bool |
| 43 | + -- ^ Include dependencies on base |
| 44 | + , dotDependencyDepth :: Maybe Int |
| 45 | + -- ^ Limit the depth of dependency resolution to (Just n) or continue until fixpoint |
| 46 | + } |
| 47 | + |
| 48 | +-- | Parser for arguments to `stack dot` |
| 49 | +dotOptsParser :: Parser DotOpts |
| 50 | +dotOptsParser = DotOpts <$> includeExternal <*> includeBase <*> depthLimit |
| 51 | + where includeExternal = boolFlags False |
| 52 | + "external" |
| 53 | + "inclusion of external dependencies" |
| 54 | + idm |
| 55 | + includeBase = boolFlags True |
| 56 | + "include-base" |
| 57 | + "inclusion of dependencies on base" |
| 58 | + idm |
| 59 | + depthLimit = |
| 60 | + optional (option auto |
| 61 | + (long "depth" <> |
| 62 | + metavar "DEPTH" <> |
| 63 | + help ("Limit the depth of dependency resolution " <> |
| 64 | + "(Default: No limit)"))) |
| 65 | + |
| 66 | +-- | Visualize the project's dependencies as a graphviz graph |
| 67 | +dot :: (HasEnvConfig env |
| 68 | + ,HasHttpManager env |
| 69 | + ,MonadBaseControl IO m |
| 70 | + ,MonadCatch m |
| 71 | + ,MonadIO m |
| 72 | + ,MonadLogger m |
| 73 | + ,MonadReader env m |
| 74 | + ) |
| 75 | + => DotOpts |
| 76 | + -> m () |
| 77 | +dot dotOpts = do |
| 78 | + (locals,_,_) <- loadLocals defaultBuildOpts Map.empty |
| 79 | + (_,_,_,sourceMap) <- loadSourceMap defaultBuildOpts |
| 80 | + let graph = Map.fromList (localDependencies dotOpts locals) |
| 81 | + menv <- getMinimalEnvOverride |
| 82 | + resultGraph <- withLoadPackage menv (\loader -> do |
| 83 | + let depLoader = createDepLoader sourceMap (fmap3 packageAllDeps loader) |
| 84 | + liftIO $ resolveDependencies (dotDependencyDepth dotOpts) graph depLoader) |
| 85 | + printGraph dotOpts locals (if dotIncludeBase dotOpts |
| 86 | + then resultGraph |
| 87 | + else filterOutDepsOnBase resultGraph) |
| 88 | + where filterOutDepsOnBase = Map.filterWithKey (\k _ -> show k /= "base") . |
| 89 | + fmap (Set.filter ((/= "base") . show)) |
| 90 | + -- fmap a function over the result of a function with 3 arguments |
| 91 | + fmap3 :: Functor f => (d -> e) -> (a -> b -> c -> f d) -> (a -> b -> c -> f e) |
| 92 | + fmap3 f g a b c = f <$> g a b c |
| 93 | + |
| 94 | +-- | Resolve the dependency graph up to (Just depth) or until fixpoint is reached |
| 95 | +resolveDependencies :: (Applicative m, Monad m) |
| 96 | + => Maybe Int |
| 97 | + -> Map PackageName (Set PackageName) |
| 98 | + -> (PackageName -> m (Set PackageName)) |
| 99 | + -> m (Map PackageName (Set PackageName)) |
| 100 | +resolveDependencies (Just 0) graph _ = return graph |
| 101 | +resolveDependencies limit graph loadPackageDeps = do |
| 102 | + let values = Set.unions (Map.elems graph) |
| 103 | + keys = Map.keysSet graph |
| 104 | + next = Set.difference values keys |
| 105 | + if Set.null next |
| 106 | + then return graph |
| 107 | + else do |
| 108 | + x <- T.traverse (\name -> (name,) <$> loadPackageDeps name) (F.toList next) |
| 109 | + resolveDependencies (subtract 1 <$> limit) |
| 110 | + (Map.unionWith Set.union graph (Map.fromList x)) |
| 111 | + loadPackageDeps |
| 112 | + |
| 113 | +-- | Given a SourceMap and a dependency loader, load the set of dependencies for a package |
| 114 | +createDepLoader :: Applicative m |
| 115 | + => Map PackageName PackageSource |
| 116 | + -> (PackageName -> Version -> Map FlagName Bool -> m (Set PackageName)) |
| 117 | + -> PackageName |
| 118 | + -> m (Set PackageName) |
| 119 | +createDepLoader sourceMap loadPackageDeps pkgName = |
| 120 | + case Map.lookup pkgName sourceMap of |
| 121 | + Just (PSLocal lp) -> pure (packageAllDeps (lpPackage lp)) |
| 122 | + Just (PSUpstream version _ flags) -> loadPackageDeps pkgName version flags |
| 123 | + Nothing -> pure Set.empty |
| 124 | + |
| 125 | +-- | Resolve the direct (depth 0) external dependencies of the given local packages |
| 126 | +localDependencies :: DotOpts -> [LocalPackage] -> [(PackageName,Set PackageName)] |
| 127 | +localDependencies dotOpts locals = map (\lp -> (packageName (lpPackage lp), deps lp)) locals |
| 128 | + where deps lp = if dotIncludeExternal dotOpts |
| 129 | + then Set.delete (lpName lp) (packageAllDeps (lpPackage lp)) |
| 130 | + else Set.intersection localNames (packageAllDeps (lpPackage lp)) |
| 131 | + lpName lp = packageName (lpPackage lp) |
| 132 | + localNames = Set.fromList $ map (packageName . lpPackage) locals |
| 133 | + |
| 134 | +-- | Print a graphviz graph of the edges in the Map and highlight the given local packages |
| 135 | +printGraph :: (Applicative m, MonadLogger m) |
| 136 | + => DotOpts |
| 137 | + -> [LocalPackage] |
| 138 | + -> Map PackageName (Set PackageName) |
| 139 | + -> m () |
| 140 | +printGraph dotOpts locals graph = do |
| 141 | + $logInfo "strict digraph deps {" |
| 142 | + printLocalNodes dotOpts locals |
| 143 | + printLeaves graph |
| 144 | + void (Map.traverseWithKey printEdges graph) |
| 145 | + $logInfo "}" |
| 146 | + |
| 147 | +-- | Print the local nodes with a different style depending on options |
| 148 | +printLocalNodes :: (F.Foldable t, MonadLogger m) |
| 149 | + => DotOpts |
| 150 | + -> t LocalPackage |
| 151 | + -> m () |
| 152 | +printLocalNodes dotOpts locals = $logInfo (Text.intercalate "\n" lpNodes) |
| 153 | + where applyStyle :: Text -> Text |
| 154 | + applyStyle n = if dotIncludeExternal dotOpts |
| 155 | + then n <> " [style=dashed];" |
| 156 | + else n <> " [style=solid];" |
| 157 | + lpNodes :: [Text] |
| 158 | + lpNodes = map (applyStyle . nodeName . packageName . lpPackage) (F.toList locals) |
| 159 | + |
| 160 | +-- | Print nodes without dependencies |
| 161 | +printLeaves :: (Applicative m, MonadLogger m) => Map PackageName (Set PackageName) -> m () |
| 162 | +printLeaves = F.traverse_ printLeaf . Map.keysSet . Map.filter Set.null |
| 163 | + |
| 164 | +-- | `printDedges p ps` prints an edge from p to every ps |
| 165 | +printEdges :: (Applicative m, MonadLogger m) => PackageName -> Set PackageName -> m () |
| 166 | +printEdges package deps = F.for_ deps (printEdge package) |
| 167 | + |
| 168 | +-- | Print an edge between the two package names |
| 169 | +printEdge :: MonadLogger m => PackageName -> PackageName -> m () |
| 170 | +printEdge from to = $logInfo (Text.concat [ nodeName from, " -> ", nodeName to, ";"]) |
| 171 | + |
22 | 172 | -- | Convert a package name to a graph node name.
|
23 |
| -nodeName :: PackageName -> T.Text |
24 |
| -nodeName name = "\"" <> T.pack (packageNameString name) <> "\"" |
25 |
| - |
26 |
| -dot :: (MonadReader env m, HasBuildConfig env, MonadIO m, MonadLogger m, MonadCatch m,HasEnvConfig env) |
27 |
| - => m () |
28 |
| -dot = do |
29 |
| - (locals, _names, _idents) <- loadLocals |
30 |
| - defaultBuildOpts |
31 |
| - Map.empty |
32 |
| - let localNames = Set.fromList $ map (packageName . lpPackage) locals |
33 |
| - |
34 |
| - $logInfo "digraph deps {" |
35 |
| - $logInfo "splines=polyline;" |
36 |
| - |
37 |
| - F.forM_ locals $ \lp -> do |
38 |
| - let deps = Set.intersection localNames $ packageAllDeps $ lpPackage lp |
39 |
| - F.forM_ deps $ \dep -> |
40 |
| - $logInfo $ T.concat |
41 |
| - [ nodeName $ packageName $ lpPackage lp |
42 |
| - , " -> " |
43 |
| - , nodeName dep |
44 |
| - , ";" |
45 |
| - ] |
46 |
| - when (Set.null deps) $ |
47 |
| - $logInfo $ T.concat |
48 |
| - [ "{rank=max; " |
49 |
| - , nodeName $ packageName $ lpPackage lp |
50 |
| - , "}" |
51 |
| - ] |
52 |
| - |
53 |
| - $logInfo "}" |
| 173 | +nodeName :: PackageName -> Text |
| 174 | +nodeName name = "\"" <> Text.pack (packageNameString name) <> "\"" |
| 175 | + |
| 176 | +-- | Print a node with no dependencies |
| 177 | +printLeaf :: MonadLogger m => PackageName -> m () |
| 178 | +printLeaf package = $logInfo . Text.concat $ |
| 179 | + if isWiredIn package |
| 180 | + then ["{rank=max; ", nodeName package, " [shape=box]; };"] |
| 181 | + else ["{rank=max; ", nodeName package, "; };"] |
| 182 | + |
| 183 | +-- | Check if the package is wired in (shipped with) ghc |
| 184 | +isWiredIn :: PackageName -> Bool |
| 185 | +isWiredIn = (`HashSet.member` wiredInPackages) |
0 commit comments