import Prelude hiding (lookup)
import Data.ByteString.Lazy (ByteString)
-import Data.Map (lookup, delete, size)
+import Data.Text.Lazy (splitOn, pack, unpack)
+import Data.Map.Lazy (empty, lookup, delete, size, singleton
+ , foldrWithKey, insert, insertWith)
import Control.Monad (foldM)
import Data.Aeson (decode)
Nothing -> return $ Left $ "Unparseable value: " ++ (show str)
Just dom -> return $ Right dom
--- | Try to fetch "import" object and merge it into the base domain
--- Original "import" element is removed, but new imports from the
--- imported objects are processed recursively until there are none.
-mergeImport ::
+-- | Try to fetch "delegate" or "import" object and merge them into the
+-- base domain. Original "import" element is removed, but newly
+-- merged data may contain new "import" or "delegate", so the objects
+-- that are about to be merged are processed recursively until there
+-- are no more "import" and "deletage" attributes (or the depth gauge
+-- reaches zero).
+mergeIncl ::
(String -> IO (Either String ByteString)) -- ^ query operation action
-> Int -- ^ recursion counter
-> NmcDom -- ^ base domain
-> IO (Either String NmcDom) -- ^ result with merged import
-mergeImport queryOp depth base = do
+mergeIncl queryOp depth base = do
let
- mbase = mergeSelf base
- base' = mbase {domImport = Nothing}
+ mbase = (expandSrv . splitSubdoms . mergeSelf) base
+ base' = mbase {domDelegate = Nothing, domImport = Nothing}
-- print base
if depth <= 0 then return $ Left "Nesting of imports is too deep"
- else case domImport mbase of
- Nothing -> return $ Right base'
- Just keys -> foldM mergeImport1 (Right base') keys
- where
- mergeImport1 (Left err) _ = return $ Left err
- mergeImport1 (Right acc) key = do
- sub <- queryNmcDom queryOp key
- case sub of
- Left err -> return $ Left err
- Right sub' -> mergeImport queryOp (depth - 1) $
- sub' `mergeNmcDom` acc
+ else case ((domDelegate mbase), (domImport mbase)) of
+ (Nothing, Nothing ) -> return $ Right base'
+ (Nothing, Just keys) -> foldM mergeIncl1 (Right base') keys
+ (Just key, _ ) -> mergeIncl1 (Right emptyNmcDom) key
+ where
+ mergeIncl1 (Left err) _ = return $ Left err -- can never happen
+ mergeIncl1 (Right acc) key = do
+ sub <- queryNmcDom queryOp key
+ case sub of
+ Left err -> return $ Left err
+ Right sub' -> mergeIncl queryOp (depth - 1) $ sub' `mergeNmcDom` acc
-- | If there is an element in the map with key "", merge the contents
-- and remove this element. Do this recursively.
Just sub -> (mergeSelf sub) `mergeNmcDom` base'
-- recursion depth limited by the size of the record
--- | SRV case - remove everyting and filter SRV records
-normalizeSrv :: String -> String -> NmcDom -> NmcDom
-normalizeSrv serv proto dom =
- emptyNmcDom {domService = fmap (filter needed) (domService dom)}
- where
- needed r = srvName r == serv && srvProto r == proto
+-- | replace Service with Srv down in the Map
+expandSrv :: NmcDom -> NmcDom
+expandSrv base =
+ let
+ base' = base { domService = Nothing }
+ in
+ case domService base of
+ Nothing -> base'
+ Just sl -> foldr addSrvMx base' sl
+ where
+ addSrvMx sr acc = sub1 `mergeNmcDom` acc
+ where
+ sub1 = emptyNmcDom { domMap = Just (singleton proto sub2)
+ , domMx = maybemx}
+ sub2 = emptyNmcDom { domMap = Just (singleton srvid sub3) }
+ sub3 = emptyNmcDom { domSrv = Just [srvStr] }
+ proto = "_" ++ (srvProto sr)
+ srvid = "_" ++ (srvName sr)
+ srvStr = (show (srvPrio sr)) ++ " "
+ ++ (show (srvWeight sr)) ++ " "
+ ++ (show (srvPort sr)) ++ " "
+ ++ (srvHost sr)
+ maybemx =
+ if srvName sr == "smtp"
+ && srvProto sr == "tcp"
+ && srvPort sr == 25
+ then Just [(show (srvPrio sr)) ++ " " ++ (srvHost sr)]
+ else Nothing
+-- | Convert map elements of the form "subN...sub2.sub1.dom.bit"
+-- into nested map and merge it
+splitSubdoms :: NmcDom -> NmcDom
+splitSubdoms base =
+ let
+ base' = base { domMap = Nothing }
+ in
+ case domMap base of
+ Nothing -> base'
+ Just sdmap -> (emptyNmcDom { domMap = Just sdmap' }) `mergeNmcDom` base'
+ where
+ sdmap' = foldrWithKey stow empty sdmap
+ stow fqdn sdom acc = insertWith mergeNmcDom fqdn' sdom' acc
+ where
+ (fqdn', sdom') =
+ nest (map unpack (splitOn (pack ".") (pack fqdn)), sdom)
+ nest ([], v) = (fqdn, v) -- can split result be empty?
+ nest ([k], v) = (k, v)
+ nest (k:ks, v) =
+ nest (ks, emptyNmcDom { domMap = Just (singleton k v) })
+
-- | Presence of some elements require removal of some others
normalizeDom :: NmcDom -> NmcDom
-normalizeDom dom = foldr id dom [ srvNormalizer
- , translateNormalizer
+normalizeDom dom = foldr id dom [ translateNormalizer
, nsNormalizer
]
where
translateNormalizer dom = case domTranslate dom of
Nothing -> dom
Just tr -> dom { domMap = Nothing }
- srvNormalizer dom = dom { domService = Nothing, domMx = makemx }
- where
- makemx = case domService dom of
- Nothing -> Nothing
- Just svl -> Just $ map makerec (filter needed svl)
- where
- needed sr = srvName sr == "smtp"
- && srvProto sr == "tcp"
- && srvPort sr == 25
- makerec sr = (show (srvPrio sr)) ++ " " ++ (srvHost sr)
-- | Merge imports and Selfs and follow the maps tree to get dom
descendNmcDom ::
-> NmcDom -- ^ base domain
-> IO (Either String NmcDom) -- ^ fully processed result
descendNmcDom queryOp subdom base = do
- base' <- mergeImport queryOp 10 base
+ base' <- mergeIncl queryOp 10 base
case subdom of
[] -> return $ fmap normalizeDom base'
- -- A hack to handle SRV records: don't descend if ["_prot","_serv"]
- [('_':p),('_':s)] -> return $ fmap (normalizeSrv s p) base'
d:ds ->
case base' of
Left err -> return base'
projects / pdns-pipe-nmc.git / blobdiff