🎨 自动校验数据库索引 https://github.com/siyuan-note/siyuan/issues/7016

kernel/model/transaction.go

@@ -1253,10 +1253,9 @@ func autoFixIndex() {
 		})
 
 		size := len(paths)
-		for i, p := range paths {
-			if nil == treenode.GetBlockTreeRootByPath(box.ID, p) {
-				reindexTreeByPath(box.ID, p, i, size)
-			}
+		missingPaths := treenode.GetNotExistPaths(box.ID, paths)
+		for i, p := range missingPaths {
+			reindexTreeByPath(box.ID, p, i, size)
 		}
 	}
 

kernel/treenode/blocktree.go

@@ -116,6 +116,27 @@ func CeilBlockCount(count int) int {
 	return 10000*100 + 1
 }
 
+func GetNotExistPaths(boxID string, paths []string) (ret []string) {
+	blockTreesLock.Lock()
+	defer blockTreesLock.Unlock()
+
+	pathsMap := map[string]bool{}
+	for _, path := range paths {
+		pathsMap[path] = true
+	}
+
+	for _, blockTree := range blockTrees {
+		if blockTree.BoxID != boxID {
+			continue
+		}
+
+		if !pathsMap[blockTree.Path] {
+			ret = append(ret, blockTree.Path)
+		}
+	}
+	return
+}
+
 func GetBlockTreeRootByPath(boxID, path string) *BlockTree {
 	blockTreesLock.Lock()
 	defer blockTreesLock.Unlock()