Skip to content

An open-source, privacy-first, self-hosted knowledge workspace where humans and AI agents work together 开源、隐私优先、自托管的知识工作空间,让人与智能体在此协作

14.8 KB
Raw Blame
// SiYuan - https://github.com/siyuan-note/siyuan
// Copyright (c) 2020-present, b3log.org
// SPDX-License-Identifier: AGPL-3.0-or-later

package model

import (
	"encoding/json"
	"errors"
	"fmt"
	"os"
	"path/filepath"
	"reflect"
	"slices"

	"github.com/88250/lute/ast"
	"github.com/88250/lute/parse"
	"github.com/siyuan-note/filelock"
	"github.com/siyuan-note/siyuan/kernel/av"
	"github.com/siyuan-note/siyuan/kernel/cache"
	"github.com/siyuan-note/siyuan/kernel/treenode"
	"github.com/siyuan-note/siyuan/kernel/util"
)

func boundAttributeViewHistoryPath(historyDir, boxID, avID string) string {
	return filepath.Join(historyDir, boxID, "storage", "av", avID+".json")
}

func readBoundAttributeViewHistory(filename, boxID, avID string) (*av.AttributeView, error) {
	data, err := filelock.ReadFile(filename)
	if err != nil {
		return nil, err
	}
	if boxID != "" {
		if !util.IsCiphertext(data) {
			return nil, errors.New("encrypted database history is plaintext")
		}
		data, err = av.DecryptAVData(boxID, avID, data)
		if err != nil {
			return nil, err
		}
	} else if util.IsCiphertext(data) {
		return nil, errors.New("encrypted database history has no notebook context")
	}
	view, err := av.ParseAttributeViewData(avID, data)
	if err != nil {
		return nil, err
	}
	if view.ID != avID {
		return nil, errors.New("database history ID does not match its filename")
	}
	for _, kv := range view.KeyValues {
		if kv == nil || kv.Key == nil {
			return nil, errors.New("database history contains an invalid field")
		}
		for _, value := range kv.Values {
			if value == nil {
				return nil, errors.New("database history contains an invalid value")
			}
		}
	}
	if view.GetBlockKeyValues() == nil {
		return nil, errors.New("database history has no primary field")
	}
	for _, layout := range view.Views {
		if layout == nil {
			return nil, errors.New("database history contains an invalid view")
		}
		for _, group := range layout.Groups {
			if group == nil {
				return nil, errors.New("database history contains an invalid group")
			}
		}
	}
	return view, nil
}

// 内嵌数据库也先认证历史,并与绑定条目恢复一起纳入失败回滚。
func (tx *Transaction) restoreEmbeddedAttributeViewHistory(filename, boxID, avID string) error {
	historical, err := readBoundAttributeViewHistory(filename, boxID, avID)
	if err != nil {
		if boxID == "" && os.IsNotExist(err) {
			return nil
		}
		return err
	}
	current, err := tx.readAttributeViewForMutation(avID, "", boxID)
	if errors.Is(err, av.ErrViewNotFound) {
		cache.RemoveAVDataInBox(avID, boxID)
		if tx.attributeViewRollback.createdViews == nil {
			tx.attributeViewRollback.createdViews = map[string]string{}
		}
		tx.attributeViewRollback.createdViews[boxID+"/"+avID] = boundAttributeViewHistoryPath(util.DataDir, boxID, avID)
		current, err = av.NewAttributeView(avID), nil
	}
	if err != nil {
		return err
	}
	return tx.saveAttributeViewFieldChanges(&attributeViewFieldsSnapshot{boxID: boxID},
		map[string]*av.AttributeView{avID: current}, map[string]*av.AttributeView{avID: historical})
}

// 普通笔记本的数据库定义存放在全局目录,恢复笔记本时同时恢复内嵌数据库和缺失绑定条目。
func (tx *Transaction) restoreNotebookAttributeViewHistory(historyPath, boxID string) error {
	historyDir := filepath.Dir(historyPath)
	if !filelock.IsExist(filepath.Join(historyDir, "storage", "av")) {
		return nil
	}
	data, err := filelock.ReadFile(filepath.Join(historyPath, ".siyuan", "conf.json"))
	if err != nil {
		return err
	}
	var boxConf struct {
		Encrypted bool `json:"encrypted"`
	}
	if err = json.Unmarshal(data, &boxConf); err != nil {
		return err
	}
	if boxConf.Encrypted {
		return nil
	}
	pages, err := pagedPathsWithError(historyPath, 32)
	if err != nil {
		return err
	}
	combined := &parse.Tree{Box: boxID, Root: &ast.Node{Type: ast.NodeDocument}}
	for _, paths := range pages {
		for _, filename := range paths {
			data, readErr := filelock.ReadFile(filename)
			if readErr != nil {
				return readErr
			}
			tree, parseErr := loadTreeByData0(data)
			if parseErr != nil {
				return parseErr
			}
			tree.Box = boxID
			combined.Root.AppendChild(tree.Root)
			for _, node := range tree.Root.ChildrenByType(ast.NodeAttributeView) {
				if _, readErr := tx.readAttributeViewForMutation(node.AttributeViewID, "", ""); readErr == nil {
					continue
				} else if !errors.Is(readErr, av.ErrViewNotFound) {
					return readErr
				}
				if err = tx.restoreEmbeddedAttributeViewHistory(boundAttributeViewHistoryPath(historyDir, "", node.AttributeViewID), "", node.AttributeViewID); err != nil {
					return err
				}
			}
		}
	}
	return tx.restoreBoundAttributeViewHistory(combined, historyDir)
}

// 删除文档前备份内嵌和绑定的数据库,沿用现有历史格式与加密路径,保留同一批删除的早期快照。
func backupBoundAttributeViewHistory(tree *parse.Tree, historyDir string) error {
	bound := map[string]map[string]struct{}{}
	collectDeletedAttributeViewBlocks(tree.Root, true, bound)
	for _, node := range tree.Root.ChildrenByType(ast.NodeAttributeView) {
		bound[node.AttributeViewID] = nil
	}
	boxID := ""
	if IsEncryptedBox(tree.Box) {
		boxID = tree.Box
	}
	// 单向关联的值存放在引用方数据库,删除前与绑定数据库一起保留快照。
	for _, id := range sortedAttributeViewFieldKeys(bound) {
		if len(bound[id]) == 0 {
			continue
		}
		source, _ := av.FindAttributeViewPathInBox(id, boxID)
		if source == "" {
			continue
		}
		view, err := readBoundAttributeViewHistory(source, boxID, id)
		if err != nil {
			return err
		}
		for _, relatedID := range deletedAttributeViewRelationIDs(view) {
			if relatedID != "" {
				if _, exists := bound[relatedID]; !exists {
					bound[relatedID] = nil
				}
			}
		}
	}
	for _, id := range sortedAttributeViewFieldKeys(bound) {
		source, _ := av.FindAttributeViewPathInBox(id, boxID)
		if source == "" {
			continue
		}
		if _, err := readBoundAttributeViewHistory(source, boxID, id); err != nil {
			return err
		}
		dest := boundAttributeViewHistoryPath(historyDir, boxID, id)
		if _, err := os.Stat(dest); err == nil {
			if _, err = readBoundAttributeViewHistory(dest, boxID, id); err != nil {
				return err
			}
			continue
		} else if !os.IsNotExist(err) {
			return err
		}
		if err := filelock.Copy(source, dest); err != nil {
			return err
		}
	}
	return nil
}

// 文档回滚只合并该文档缺失的条目,不覆盖数据库中其他条目的后续编辑。
func (tx *Transaction) restoreBoundAttributeViewHistory(tree *parse.Tree, historyDir string) error {
	bound := map[string]map[string]struct{}{}
	collectDeletedAttributeViewBlocks(tree.Root, true, bound)
	boxID := ""
	if IsEncryptedBox(tree.Box) {
		boxID = tree.Box
	}
	before, after := map[string]*av.AttributeView{}, map[string]*av.AttributeView{}
	load := func(id string) (*av.AttributeView, error) {
		if after[id] != nil {
			return after[id], nil
		}
		current, err := tx.readAttributeViewForMutation(id, "", boxID)
		if err != nil {
			return nil, err
		}
		copy, err := cloneAttributeViewForFieldMutation(current)
		if err != nil {
			return nil, err
		}
		before[id], after[id] = current, copy
		return copy, nil
	}
	restoredItems := map[string][]string{}
	restoredBindings := false
	for _, id := range sortedAttributeViewFieldKeys(bound) {
		historical, err := readBoundAttributeViewHistory(boundAttributeViewHistoryPath(historyDir, boxID, id), boxID, id)
		if os.IsNotExist(err) {
			// 早期文档历史可能没有绑定数据库快照,保留原有文档回滚能力。
			continue
		}
		if err != nil {
			return err
		}
		current, err := load(id)
		if err != nil {
			return err
		}
		var itemIDs []string
		for _, primary := range historical.GetBlockKeyValues().Values {
			if primary.IsDetached || primary.Block == nil {
				continue
			}
			if _, exists := bound[id][primary.Block.ID]; !exists {
				continue
			}
			if existing := current.GetBlockValueByBoundID(primary.Block.ID); existing != nil {
				// 内嵌数据库整份恢复后条目已存在,仍需恢复删除期间被清理的外部关联。
				key := boxID + "/" + id
				original := tx.attributeViewRollback.views[key]
				_, created := tx.attributeViewRollback.createdViews[key]
				if created || original != nil && original.GetBlockValue(existing.BlockID) == nil {
					restoredItems[id] = append(restoredItems[id], existing.BlockID)
				}
				continue
			}
			if existing := current.GetBlockValue(primary.BlockID); existing != nil {
				if !canRestoreListConversionBinding(tree, primary, existing) {
					return fmt.Errorf("database entry [%s] has a different binding", primary.BlockID)
				}
				block := primary.Clone().Block
				block.Created, block.Updated = existing.Block.Created, existing.Block.Updated
				existing.Block = block
				restoredBindings = true
				continue
			}
			itemIDs = append(itemIDs, primary.BlockID)
		}
		if len(itemIDs) == 0 {
			continue
		}
		for _, kv := range historical.KeyValues {
			for _, value := range kv.Values {
				if !slices.Contains(itemIDs, value.BlockID) {
					continue
				}
				field, err := current.GetKeyValues(kv.Key.ID)
				if err != nil || field.Key.Type != kv.Key.Type || !reflect.DeepEqual(field.Key.Relation, kv.Key.Relation) {
					return fmt.Errorf("database field [%s] changed since document deletion", kv.Key.ID)
				}
				if field.GetValue(value.BlockID) == nil {
					field.Values = append(field.Values, value.Clone())
				} else if field.Key.Type == av.KeyTypeRelation {
					// 删除整篇文档会清理保留字段中的关联 ID,恢复条目时从历史还原关联值。
					for i, currentValue := range field.Values {
						if currentValue.BlockID == value.BlockID {
							field.Values[i] = value.Clone()
							break
						}
					}
				}
			}
		}
		for _, view := range current.Views {
			if old := historical.GetView(view.ID); old != nil {
				view.ItemIDs = restoreAttributeViewItemOrder(view.ItemIDs, old.ItemIDs, itemIDs)
				for _, group := range view.Groups {
					if oldGroup := old.GetGroupByID(group.ID); oldGroup != nil {
						group.GroupItemIDs = restoreAttributeViewItemOrder(group.GroupItemIDs, oldGroup.GroupItemIDs, itemIDs)
					}
				}
			}
		}
		for _, itemID := range itemIDs {
			if covers := historical.CardCoverPositions[itemID]; covers != nil {
				if current.CardCoverPositions == nil {
					current.CardCoverPositions = map[string]map[string]*av.CardCoverPosition{}
				}
				current.CardCoverPositions[itemID] = covers
			}
		}
		restoredItems[id] = append(restoredItems[id], itemIDs...)
	}
	// 先合并所有主键,再恢复双向关联,允许同一文档内的条目互相关联。
	for id, itemIDs := range restoredItems {
		for _, kv := range after[id].KeyValues {
			relation := kv.Key.Relation
			if relation == nil || !relation.IsTwoWay {
				continue
			}
			for _, value := range kv.Values {
				if !slices.Contains(itemIDs, value.BlockID) || value.Relation == nil || len(value.Relation.BlockIDs) == 0 {
					continue
				}
				dest, err := load(relation.AvID)
				if err != nil {
					return err
				}
				back, err := dest.GetKeyValues(relation.BackKeyID)
				if err != nil || back.Key.Relation == nil || !back.Key.Relation.IsTwoWay ||
					back.Key.Relation.AvID != id || back.Key.Relation.BackKeyID != kv.Key.ID {
					return errors.New("database back relation changed since document deletion")
				}
				for _, targetID := range value.Relation.BlockIDs {
					if dest.GetBlockValue(targetID) == nil {
						return fmt.Errorf("related database entry [%s] is missing", targetID)
					}
					backValue := back.GetValue(targetID)
					if backValue == nil {
						backValue = &av.Value{ID: ast.NewNodeID(), KeyID: back.Key.ID, BlockID: targetID,
							Type: av.KeyTypeRelation, Relation: &av.ValueRelation{}}
						back.Values = append(back.Values, backValue)
					}
					if backValue.Relation == nil {
						return errors.New("database back relation value is invalid")
					}
					if !slices.Contains(backValue.Relation.BlockIDs, value.BlockID) {
						backValue.Relation.BlockIDs = append(backValue.Relation.BlockIDs, value.BlockID)
					}
				}
			}
		}
	}
	// 只合并指向本次恢复条目的历史关联,保留引用方其他条目的后续编辑。
	for id, itemIDs := range restoredItems {
		for _, sourceID := range av.GetSrcAvIDs(id) {
			historical, err := readBoundAttributeViewHistory(boundAttributeViewHistoryPath(historyDir, boxID, sourceID), boxID, sourceID)
			if os.IsNotExist(err) {
				continue
			}
			if err != nil {
				return err
			}
			source, err := load(sourceID)
			if err != nil {
				return err
			}
			for _, oldField := range historical.KeyValues {
				if oldField.Key.Type != av.KeyTypeRelation || oldField.Key.Relation == nil || oldField.Key.Relation.AvID != id {
					continue
				}
				field, fieldErr := source.GetKeyValues(oldField.Key.ID)
				if fieldErr != nil || field.Key.Type != av.KeyTypeRelation || !reflect.DeepEqual(field.Key.Relation, oldField.Key.Relation) {
					continue
				}
				for _, oldValue := range oldField.Values {
					if oldValue.Relation == nil || source.GetBlockValue(oldValue.BlockID) == nil {
						continue
					}
					var missing []string
					value := field.GetValue(oldValue.BlockID)
					if value != nil && value.Relation == nil {
						return errors.New("database relation value is invalid")
					}
					for _, targetID := range oldValue.Relation.BlockIDs {
						if slices.Contains(itemIDs, targetID) && (value == nil || !slices.Contains(value.Relation.BlockIDs, targetID)) {
							missing = append(missing, targetID)
						}
					}
					if len(missing) == 0 {
						continue
					}
					if value == nil {
						value = oldValue.Clone()
						value.Relation.BlockIDs = nil
						field.Values = append(field.Values, value)
					}
					value.Relation.BlockIDs = restoreAttributeViewItemOrder(value.Relation.BlockIDs, oldValue.Relation.BlockIDs, missing)
					value.Relation.Contents = nil
				}
			}
		}
	}
	if len(restoredItems) == 0 && !restoredBindings {
		return nil
	}
	for _, view := range after {
		regenAttrViewGroups(view)
	}
	return tx.saveAttributeViewFieldChanges(&attributeViewFieldsSnapshot{boxID: boxID}, before, after)
}

// 仅将同一条目从历史列表的首块还原到外壳,不覆盖无关换绑或后续字段编辑。
func canRestoreListConversionBinding(tree *parse.Tree, historical, current *av.Value) bool {
	if current.IsDetached || current.Block == nil || historical.ID != current.ID || historical.KeyID != current.KeyID {
		return false
	}
	source := treenode.GetNodeInTree(tree, historical.Block.ID)
	if source == nil {
		return false
	}
	if source.Type == ast.NodeList {
		items := listConversionItems(source)
		if len(items) != 1 {
			return false
		}
		source = items[0]
	}
	if source.Type != ast.NodeListItem {
		return false
	}
	first := firstListConversionBlock(source)
	if first == nil || first.ID != current.Block.ID {
		return false
	}
	currentTree, err := LoadTreeByBlockID(first.ID)
	if err != nil || currentTree.ID != tree.ID || currentTree.Box != tree.Box {
		return false
	}
	return treenode.GetNodeInTree(currentTree, historical.Block.ID) == nil
}