Something went wrong. Try again.
A privacy-first, self-hosted, fully open source personal knowledge management software, written in typescript and golang. (PERSONAL FORK)
Something went wrong. Try again.
Go
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340// SiYuan - Refactor your thinking// Copyright (c) 2020-present, b3log.org//// This program is free software: you can redistribute it and/or modify// it under the terms of the GNU Affero General Public License as published by// the Free Software Foundation, either version 3 of the License, or// (at your option) any later version.//// This program is distributed in the hope that it will be useful,// but WITHOUT ANY WARRANTY; without even the implied warranty of// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the// GNU Affero General Public License for more details.//// You should have received a copy of the GNU Affero General Public License// along with this program. If not, see <https://www.gnu.org/licenses/>.
package model
import ( "errors" "fmt" "io/fs" "os" "path" "path/filepath" "strings" "time"
"github.com/88250/lute" "github.com/88250/lute/ast" "github.com/88250/lute/parse" "github.com/siyuan-note/dataparser" "github.com/siyuan-note/filelock" "github.com/siyuan-note/logging" "github.com/siyuan-note/siyuan/kernel/av" "github.com/siyuan-note/siyuan/kernel/filesys" "github.com/siyuan-note/siyuan/kernel/search" "github.com/siyuan-note/siyuan/kernel/sql" "github.com/siyuan-note/siyuan/kernel/task" "github.com/siyuan-note/siyuan/kernel/treenode" "github.com/siyuan-note/siyuan/kernel/util" "golang.org/x/time/rate")
func resetTree(tree *parse.Tree, titleSuffix string, removeAvBinding bool) { tree.ID = ast.NewNodeID() tree.Root.ID = tree.ID title := tree.Root.IALAttr("title") if "" != titleSuffix { if t, parseErr := time.Parse("20060102150405", util.TimeFromID(tree.ID)); nil == parseErr { titleSuffix += " " + t.Format("2006-01-02 15:04:05") } else { titleSuffix = "Duplicated " + time.Now().Format("2006-01-02 15:04:05") } titleSuffix = "(" + titleSuffix + ")" titleSuffix = " " + titleSuffix if Conf.language(16) == title { titleSuffix = "" } } tree.Root.SetIALAttr("id", tree.ID) tree.Root.SetIALAttr("title", title+titleSuffix) tree.Root.RemoveIALAttr("scroll") p := path.Join(path.Dir(tree.Path), tree.ID) + ".sy" tree.Path = p tree.HPath = tree.HPath + " " + titleSuffix
// 收集所有引用 refIDs := map[string]string{} ast.Walk(tree.Root, func(n *ast.Node, entering bool) ast.WalkStatus { if !entering || !treenode.IsBlockRef(n) { return ast.WalkContinue } defID, _, _ := treenode.GetBlockRef(n) if "" == defID { return ast.WalkContinue } refIDs[defID] = "1" return ast.WalkContinue })
// 重置块 ID ast.Walk(tree.Root, func(n *ast.Node, entering bool) ast.WalkStatus { if !entering || ast.NodeDocument == n.Type { return ast.WalkContinue } if n.IsBlock() && "" != n.ID { newID := ast.NewNodeID() if "1" == refIDs[n.ID] { // 如果是文档自身的内部引用 refIDs[n.ID] = newID } n.ID = newID n.SetIALAttr("id", n.ID) } return ast.WalkContinue })
// 重置内部引用 ast.Walk(tree.Root, func(n *ast.Node, entering bool) ast.WalkStatus { if !entering || !treenode.IsBlockRef(n) { return ast.WalkContinue } defID, _, _ := treenode.GetBlockRef(n) if "" == defID { return ast.WalkContinue } if "1" != refIDs[defID] { if ast.NodeTextMark == n.Type { n.TextMarkBlockRefID = refIDs[defID] } } return ast.WalkContinue })
var attrViewIDs []string // 绑定镜像数据库 ast.Walk(tree.Root, func(n *ast.Node, entering bool) ast.WalkStatus { if !entering { return ast.WalkContinue }
if ast.NodeAttributeView == n.Type { av.UpsertBlockRel(n.AttributeViewID, n.ID) attrViewIDs = append(attrViewIDs, n.AttributeViewID) } return ast.WalkContinue })
if removeAvBinding { // 清空文档绑定的数据库 tree.Root.RemoveIALAttr(av.NodeAttrNameAvs) }}
func pagedPaths(localPath string, pageSize int) (ret map[int][]string) { ret = map[int][]string{} page := 1 filelock.Walk(localPath, func(path string, d fs.DirEntry, err error) error { if nil != err || nil == d { return nil }
if d.IsDir() { if strings.HasPrefix(d.Name(), ".") { return filepath.SkipDir } return nil }
if !strings.HasSuffix(d.Name(), ".sy") { return nil }
ret[page] = append(ret[page], path) if pageSize <= len(ret[page]) { page++ } return nil }) return}
func loadTree(localPath string, luteEngine *lute.Lute) (ret *parse.Tree, err error) { data, err := filelock.ReadFile(localPath) if err != nil { logging.LogErrorf("get data [path=%s] failed: %s", localPath, err) return }
ret, err = dataparser.ParseJSONWithoutFix(data, luteEngine.ParseOptions) if err != nil { logging.LogErrorf("parse json to tree [%s] failed: %s", localPath, err) return } return}
var ( ErrBoxNotFound = errors.New("notebook not found") ErrBlockNotFound = errors.New("block not found") ErrTreeNotFound = errors.New("tree not found") ErrIndexing = errors.New("indexing") ErrBoxUnindexed = errors.New("notebook unindexed") ErrInvalidID = errors.New("invalid id"))
func LoadTreeByBlockIDWithReindex(id string) (ret *parse.Tree, err error) { if "" == id { logging.LogWarnf("block id is empty") return nil, ErrTreeNotFound }
bt := treenode.GetBlockTree(id) if nil == bt { if task.ContainIndexTask() { err = ErrIndexing return }
// 尝试从文件系统加载并建立索引 err = indexTreeInFilesystem(id) bt = treenode.GetBlockTree(id) if nil == bt { if "dev" == util.Mode { logging.LogWarnf("block tree not found [id=%s], stack: [%s]", id, logging.ShortStack()) } return } }
luteEngine := util.NewLute() ret, err = filesys.LoadTree(bt.BoxID, bt.Path, luteEngine) return}
func LoadTreeByBlockID(id string) (ret *parse.Tree, err error) { if !ast.IsNodeIDPattern(id) { stack := logging.ShortStack() logging.LogErrorf("block id is invalid [id=%s], stack: [%s]", id, stack) return nil, ErrTreeNotFound }
bt := treenode.GetBlockTree(id) if nil == bt { if task.ContainIndexTask() { err = ErrIndexing return }
stack := logging.ShortStack() if !strings.Contains(stack, "BuildBlockBreadcrumb") { if "dev" == util.Mode { logging.LogWarnf("block tree not found [id=%s], stack: [%s]", id, stack) } } return nil, ErrTreeNotFound }
ret, err = loadTreeByBlockTree(bt) return}
func loadTreeByBlockTree(bt *treenode.BlockTree) (ret *parse.Tree, err error) { luteEngine := util.NewLute() ret, err = filesys.LoadTree(bt.BoxID, bt.Path, luteEngine) return}
var searchTreeLimiter = rate.NewLimiter(rate.Every(3*time.Second), 1)
func indexTreeInFilesystem(blockID string) error { if !searchTreeLimiter.Allow() { return ErrIndexing }
msdID := util.PushMsg(Conf.language(45), 7000) defer util.PushClearMsg(msdID)
logging.LogWarnf("searching tree on filesystem [id=%s]", blockID)
unindexedTreePath := findUnindexedTreePathInAllBoxes(blockID) if "" == unindexedTreePath { logging.LogInfof("tree not found on filesystem [id=%s]", blockID) return ErrTreeNotFound }
boxID := strings.TrimPrefix(unindexedTreePath, util.DataDir) boxID = boxID[1:] boxID = boxID[:strings.Index(boxID, string(os.PathSeparator))] unindexedTreePath = strings.TrimPrefix(unindexedTreePath, util.DataDir) unindexedTreePath = strings.TrimPrefix(unindexedTreePath, string(os.PathSeparator)) unindexedTreePath = strings.TrimPrefix(unindexedTreePath, boxID) unindexedTreePath = filepath.ToSlash(unindexedTreePath) if nil == Conf.Box(boxID) { for _, b := range Conf.GetClosedBoxes() { if b.ID == boxID { logging.LogInfof("box [%s] is closed", boxID) util.PushErrMsg(fmt.Sprintf(Conf.language(197), b.Name), 7000) return ErrBoxUnindexed } }
logging.LogInfof("box [%s] not found", boxID) // 如果笔记本不存在则不处理 https://github.com/siyuan-note/siyuan/issues/11149 return ErrTreeNotFound }
tree, err := filesys.LoadTree(boxID, unindexedTreePath, util.NewLute()) if err != nil { logging.LogErrorf("load tree [%s] failed: %s", unindexedTreePath, err) return err }
treenode.UpsertBlockTree(tree) sql.IndexTreeQueue(tree) logging.LogInfof("reindexed tree by filesystem [blockID=%s]", blockID) return nil}
func loadParentTree(tree *parse.Tree) (ret *parse.Tree) { if nil == tree { return }
boxDir := filepath.Join(util.DataDir, tree.Box) parentDir := path.Dir(tree.Path) if parentDir == boxDir || parentDir == "/" { return }
luteEngine := lute.New() parentPath := parentDir + ".sy" ret, _ = filesys.LoadTree(tree.Box, parentPath, luteEngine) return}
func findUnindexedTreePathInAllBoxes(id string) (ret string) { boxes := Conf.GetBoxes() for _, box := range boxes { root := filepath.Join(util.DataDir, box.ID) paths := search.FindAllMatchedPaths(root, []string{id}) var rootIDs []string rootIDPaths := map[string]string{} for _, p := range paths { rootID := util.GetTreeID(p) rootIDs = append(rootIDs, rootID) rootIDPaths[rootID] = p }
result := treenode.ExistBlockTrees(rootIDs) for rootID, exist := range result { if !exist { return rootIDPaths[rootID] } } } return}