import Prelude hiding (length)
import Data.ByteString.Lazy (ByteString)
import qualified Data.Text as T (unpack)
+import Data.List as L (union)
import Data.List.Split
import Data.Char
-import Data.Map as M (Map, lookup, delete, size)
+import Data.Map as M (Map, lookup, delete, size, union)
import Data.Vector (toList,(!),length)
import Control.Applicative ((<$>), (<*>), empty)
import Data.Aeson
+class Mergeable a where
+ merge :: a -> a -> a -- bias towads second arg
+
+instance Ord k => Mergeable (Map k a) where
+ merge mx my = M.union my mx
+
+-- instance Mergeable String where
+-- merge _ b = b
+
+instance Mergeable Value where
+ merge _ b = b
+
+instance Mergeable a => Mergeable (Maybe a) where
+ merge (Just x) (Just y) = Just (merge x y)
+ merge Nothing (Just y) = Just y
+ merge (Just x) Nothing = Just x
+ merge Nothing Nothing = Nothing
+
+instance Eq a => Mergeable [a] where
+ merge xs ys = L.union xs ys
+
data NmcRRService = NmcRRService
{ srvName :: String
, srvProto :: String
- , srvW1 :: Int
- , srvW2 :: Int
+ , srvPrio :: Int
+ , srvWeight :: Int
, srvPort :: Int
, srvHost :: String
} deriving (Show, Eq)
else empty
parseJSON _ = empty
+instance Mergeable NmcRRService where
+ merge _ b = b
+
data NmcRRI2p = NmcRRI2p
{ i2pDestination :: String
, i2pName :: String
<*> o .: "b32"
parseJSON _ = empty
+instance Mergeable NmcRRI2p where
+ merge _ b = b
+
data NmcDom = NmcDom { domService :: Maybe [NmcRRService]
, domIp :: Maybe [String]
, domIp6 :: Maybe [String]
<*> o .:? "ds"
parseJSON _ = empty
+instance Mergeable NmcDom where
+ merge sub dom = dom { domService = mergelm domService
+ , domIp = mergelm domIp
+ , domIp6 = mergelm domIp6
+ , domTor = choose domTor
+ , domI2p = mergelm domI2p
+ , domFreenet = choose domFreenet
+ , domAlias = choose domAlias
+ , domTranslate = choose domTranslate
+ , domEmail = choose domEmail
+ , domLoc = choose domLoc
+ , domInfo = mergelm domInfo
+ , domNs = mergelm domNs
+ , domDelegate = mergelm domDelegate
+ , domImport = choose domImport
+ , domMap = mergelm domMap
+ , domFingerprint = mergelm domFingerprint
+ , domTls = mergelm domTls
+ , domDs = mergelm domDs
+ }
+ where
+ mergelm x = merge (x sub) (x dom)
+-- Because it is not possible to define instance of merge for Strings,
+-- we have to treat string elements separately, otherwise strings are
+-- 'unioned' along with the rest of lists. Ugly, but alternatives are worse.
+ choose field = case field dom of
+ Nothing -> field sub
+ Just x -> Just x
+
+
emptyNmcDom = NmcDom Nothing Nothing Nothing Nothing Nothing Nothing
Nothing Nothing Nothing Nothing Nothing Nothing
Nothing Nothing Nothing Nothing Nothing Nothing
--- FIXME -- I hope there exists a better way to merge records!
-mergeNmcDom :: NmcDom -> NmcDom -> NmcDom
-mergeNmcDom sub dom = dom { domService = choose domService
- , domIp = choose domIp
- , domIp6 = choose domIp6
- , domTor = choose domTor
- , domI2p = choose domI2p
- , domFreenet = choose domFreenet
- , domAlias = choose domAlias
- , domTranslate = choose domTranslate
- , domEmail = choose domEmail
- , domLoc = choose domLoc
- , domInfo = choose domInfo
- , domNs = choose domNs
- , domDelegate = choose domDelegate
- , domImport = choose domImport
- , domMap = choose domMap
- , domFingerprint = choose domFingerprint
- , domTls = choose domTls
- , domDs = choose domDs
- }
- where
- choose :: (NmcDom -> Maybe a) -> Maybe a
- choose field = case field dom of
- Nothing -> field sub
- Just x -> Just x
-
-- | Perform query and return error string or parsed domain object
queryNmcDom ::
(String -> IO (Either String ByteString)) -- ^ query operation action
-- imported objects are processed recursively until there are none.
mergeImport ::
(String -> IO (Either String ByteString)) -- ^ query operation action
+ -> Int -- ^ recursion counter
-> NmcDom -- ^ base domain
-> IO (Either String NmcDom) -- ^ result with merged import
-mergeImport queryOp base = do
+mergeImport queryOp depth base = do
let
mbase = mergeSelf base
base' = mbase {domImport = Nothing}
-- print base
- case domImport mbase of
+ if depth <= 0 then return $ Left "Nesting of imports is too deep"
+ else case domImport mbase of
Nothing -> return $ Right base'
Just key -> do
sub <- queryNmcDom queryOp key
case sub of
Left e -> return $ Left e
- Right sub' -> mergeImport queryOp $ sub' `mergeNmcDom` base'
+ Right sub' -> mergeImport queryOp (depth - 1) $ sub' `merge` base'
-- | If there is an element in the map with key "", merge the contents
-- and remove this element. Do this recursively.
Just map' ->
case M.lookup "" map' of
Nothing -> base'
- Just sub -> (mergeSelf sub) `mergeNmcDom` base'
+ Just sub -> (mergeSelf sub) `merge` 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
-- | Presence of some elements require removal of some others
normalizeDom :: NmcDom -> NmcDom
-normalizeDom dom = foldr id dom [ translateNormalizer
- -- , nsNormalizer -- FIXME retrun this
+normalizeDom dom = foldr id dom [ srvNormalizer
+ , translateNormalizer
+ , nsNormalizer
]
where
nsNormalizer dom = case domNs dom of
translateNormalizer dom = case domTranslate dom of
Nothing -> dom
Just tr -> dom { domMap = Nothing }
+ srvNormalizer dom = dom { domService = Nothing }
-- | 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 base
+ base' <- mergeImport 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'