write optimization

docs/devlog.md

@@ -2,6 +2,8 @@
 
 ## 2023-03-24
 
+проверка: wip95
+
 TODO: storage-reliable-write
   Надёжную процедуру записи блока.
 

hbs2-peer/app/RefLog.hs

@@ -128,7 +128,7 @@ reflogWorker conf adapter = do
 
   sto <- getStorage
 
-  q <- liftIO newTQueueIO
+  pQ <- liftIO newTQueueIO
 
   let reflogTimeout puk h = do
         -- FIXME: fix-time-hardcode-again
@@ -139,7 +139,7 @@ reflogWorker conf adapter = do
         signed <- verifyRefLogUpdate tran
         when signed do
 
-          liftIO $ atomically $ writeTQueue q (reflog, [tran])
+          liftIO $ atomically $ writeTQueue pQ (reflog, [tran])
 
           -- FIXME: fix-this-copypaste
           let bss = view refLogUpdData tran
@@ -157,7 +157,7 @@ reflogWorker conf adapter = do
   subscribe @e RefLogUpdateEvKey $ \(RefLogUpdateEvData (reflog,v)) -> do
     trace $ "reflog worker.got refupdate" <+> pretty (AsBase58 reflog)
     liftIO $ reflogUpdate reflog Nothing v
-    liftIO $ atomically $ writeTQueue q (reflog, [v])
+    liftIO $ atomically $ writeTQueue pQ (reflog, [v])
 
 
   reflogMon <- liftIO $ newTVarIO (mempty :: HashSet (Hash HbSync))
@@ -234,7 +234,7 @@ reflogWorker conf adapter = do
           -- TODO: reflog-process-period-to-config
           pause @'Seconds 10
 
-          els <- liftIO $ atomically $ flushTQueue q
+          els <- liftIO $ atomically $ flushTQueue pQ
 
           let byRef = HashMap.fromListWith (<>) els
 
@@ -242,13 +242,18 @@ reflogWorker conf adapter = do
             let reflogkey = RefLogKey r
             h' <- liftIO $! getRef sto (RefLogKey r)
 
-            hashes <- liftIO $ readHashesFromBlock sto h'
+            hashes <- liftIO $ readHashesFromBlock sto h' <&> HashSet.fromList
 
             -- save new transaction, must be idempotent
-            newHashes <- liftIO $ mapM (putBlock sto . serialise) x <&> catMaybes <&> fmap HashRef
+            newHashes <- liftIO $ mapM (putBlock sto . serialise) x <&> catMaybes
+                                                                    <&> fmap HashRef
+                                                                    <&> HashSet.fromList
 
+            let already = newHashes `HashSet.isSubsetOf` hashes
+
+            unless already do
               -- TODO: needs-very-fast-sort-and-dedupe
-            let hashesNew = HashSet.fromList (hashes <> newHashes) & HashSet.toList
+              let hashesNew = (hashes <> newHashes) & HashSet.toList
 
               -- FIXME: remove-chunk-num-hardcode
               let pt = toPTree (MaxSize 256) (MaxNum 256) hashesNew

hbs2-storage-simple/lib/HBS2/Storage/Simple.hs

@@ -274,6 +274,8 @@ simplePutBlockLazy doWait s lbs = do
 
   stop <- atomically $ TV.readTVar ( s ^. storageStopWriting )
 
+  size <- simpleBlockExists s hash <&> fromMaybe 0
+
   if stop then do
     pure Nothing
 
@@ -281,7 +283,8 @@ simplePutBlockLazy doWait s lbs = do
 
     waits <- TBQ.newTBQueueIO 1 :: IO (TBQueue Bool)
 
-    let action = do
+    let action | size > 0 = atomically $ TBQ.writeTBQueue waits True
+               | otherwise = do
           catch (LBS.writeFile fn lbs)
                 (\(_ :: IOError) -> atomically $ TBQ.writeTBQueue waits False)