upsert.go 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512
  1. // SiYuan - Build Your Eternal Digital Garden
  2. // Copyright (c) 2020-present, b3log.org
  3. //
  4. // This program is free software: you can redistribute it and/or modify
  5. // it under the terms of the GNU Affero General Public License as published by
  6. // the Free Software Foundation, either version 3 of the License, or
  7. // (at your option) any later version.
  8. //
  9. // This program is distributed in the hope that it will be useful,
  10. // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. // GNU Affero General Public License for more details.
  13. //
  14. // You should have received a copy of the GNU Affero General Public License
  15. // along with this program. If not, see <https://www.gnu.org/licenses/>.
  16. package sql
  17. import (
  18. "database/sql"
  19. "fmt"
  20. "strings"
  21. "github.com/88250/lute/parse"
  22. "github.com/emirpasic/gods/sets/hashset"
  23. "github.com/siyuan-note/logging"
  24. "github.com/siyuan-note/siyuan/kernel/treenode"
  25. "github.com/siyuan-note/siyuan/kernel/util"
  26. )
  27. var luteEngine = util.NewLute()
  28. func init() {
  29. luteEngine.RenderOptions.KramdownBlockIAL = false // 数据库 markdown 字段为标准 md,但是要保留 span block ial
  30. }
  31. func InsertBlocksSpans(tx *sql.Tx, tree *parse.Tree) (err error) {
  32. if err = insertBlocksSpans(tx, tree); nil != err {
  33. logging.LogErrorf("insert tree [%s] into database failed: %s", tree.Box+tree.Path, err)
  34. }
  35. return
  36. }
  37. func InsertRefs(tx *sql.Tx, tree *parse.Tree) {
  38. if err := insertRef(tx, tree); nil != err {
  39. logging.LogErrorf("insert refs tree [%s] into database failed: %s", tree.Box+tree.Path, err)
  40. }
  41. }
  42. const (
  43. BlocksInsert = "INSERT INTO blocks (id, parent_id, root_id, hash, box, path, hpath, name, alias, memo, tag, content, fcontent, markdown, length, type, subtype, ial, sort, created, updated) VALUES %s"
  44. BlocksFTSInsert = "INSERT INTO blocks_fts (id, parent_id, root_id, hash, box, path, hpath, name, alias, memo, tag, content, fcontent, markdown, length, type, subtype, ial, sort, created, updated) VALUES %s"
  45. BlocksFTSCaseInsensitiveInsert = "INSERT INTO blocks_fts_case_insensitive (id, parent_id, root_id, hash, box, path, hpath, name, alias, memo, tag, content, fcontent, markdown, length, type, subtype, ial, sort, created, updated) VALUES %s"
  46. BlocksPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)"
  47. SpansInsert = "INSERT INTO spans (id, block_id, root_id, box, path, content, markdown, type, ial) VALUES %s"
  48. SpansPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?)"
  49. AssetsPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?)"
  50. AttributesPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?)"
  51. RefsPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)"
  52. FileAnnotationRefsPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?)"
  53. )
  54. func insertBlocks(tx *sql.Tx, blocks []*Block) (err error) {
  55. if 1 > len(blocks) {
  56. return
  57. }
  58. var bulk []*Block
  59. for _, block := range blocks {
  60. bulk = append(bulk, block)
  61. if 512 > len(bulk) {
  62. continue
  63. }
  64. if err = insertBlocks0(tx, bulk); nil != err {
  65. return
  66. }
  67. bulk = []*Block{}
  68. }
  69. if 0 < len(bulk) {
  70. if err = insertBlocks0(tx, bulk); nil != err {
  71. return
  72. }
  73. }
  74. return
  75. }
  76. func insertBlocks0(tx *sql.Tx, bulk []*Block) (err error) {
  77. valueStrings := make([]string, 0, len(bulk))
  78. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(BlocksPlaceholder, "?"))
  79. for _, b := range bulk {
  80. valueStrings = append(valueStrings, BlocksPlaceholder)
  81. valueArgs = append(valueArgs, b.ID)
  82. valueArgs = append(valueArgs, b.ParentID)
  83. valueArgs = append(valueArgs, b.RootID)
  84. valueArgs = append(valueArgs, b.Hash)
  85. valueArgs = append(valueArgs, b.Box)
  86. valueArgs = append(valueArgs, b.Path)
  87. valueArgs = append(valueArgs, b.HPath)
  88. valueArgs = append(valueArgs, b.Name)
  89. valueArgs = append(valueArgs, b.Alias)
  90. valueArgs = append(valueArgs, b.Memo)
  91. valueArgs = append(valueArgs, b.Tag)
  92. valueArgs = append(valueArgs, b.Content)
  93. valueArgs = append(valueArgs, b.FContent)
  94. valueArgs = append(valueArgs, b.Markdown)
  95. valueArgs = append(valueArgs, b.Length)
  96. valueArgs = append(valueArgs, b.Type)
  97. valueArgs = append(valueArgs, b.SubType)
  98. valueArgs = append(valueArgs, b.IAL)
  99. valueArgs = append(valueArgs, b.Sort)
  100. valueArgs = append(valueArgs, b.Created)
  101. valueArgs = append(valueArgs, b.Updated)
  102. putBlockCache(b)
  103. }
  104. stmt := fmt.Sprintf(BlocksInsert, strings.Join(valueStrings, ","))
  105. if err = prepareExecInsertTx(tx, stmt, valueArgs); nil != err {
  106. return
  107. }
  108. stmt = fmt.Sprintf(BlocksFTSInsert, strings.Join(valueStrings, ","))
  109. if err = prepareExecInsertTx(tx, stmt, valueArgs); nil != err {
  110. return
  111. }
  112. if !caseSensitive {
  113. stmt = fmt.Sprintf(BlocksFTSCaseInsensitiveInsert, strings.Join(valueStrings, ","))
  114. if err = prepareExecInsertTx(tx, stmt, valueArgs); nil != err {
  115. return
  116. }
  117. }
  118. return
  119. }
  120. func insertAttributes(tx *sql.Tx, attributes []*Attribute) (err error) {
  121. if 1 > len(attributes) {
  122. return
  123. }
  124. var bulk []*Attribute
  125. for _, attr := range attributes {
  126. bulk = append(bulk, attr)
  127. if 512 > len(bulk) {
  128. continue
  129. }
  130. if err = insertAttribute0(tx, bulk); nil != err {
  131. return
  132. }
  133. bulk = []*Attribute{}
  134. }
  135. if 0 < len(bulk) {
  136. if err = insertAttribute0(tx, bulk); nil != err {
  137. return
  138. }
  139. }
  140. return
  141. }
  142. func insertAttribute0(tx *sql.Tx, bulk []*Attribute) (err error) {
  143. if 1 > len(bulk) {
  144. return
  145. }
  146. valueStrings := make([]string, 0, len(bulk))
  147. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(AttributesPlaceholder, "?"))
  148. for _, attr := range bulk {
  149. valueStrings = append(valueStrings, AttributesPlaceholder)
  150. valueArgs = append(valueArgs, attr.ID)
  151. valueArgs = append(valueArgs, attr.Name)
  152. valueArgs = append(valueArgs, attr.Value)
  153. valueArgs = append(valueArgs, attr.Type)
  154. valueArgs = append(valueArgs, attr.BlockID)
  155. valueArgs = append(valueArgs, attr.RootID)
  156. valueArgs = append(valueArgs, attr.Box)
  157. valueArgs = append(valueArgs, attr.Path)
  158. }
  159. stmt := fmt.Sprintf("INSERT INTO attributes (id, name, value, type, block_id, root_id, box, path) VALUES %s", strings.Join(valueStrings, ","))
  160. err = prepareExecInsertTx(tx, stmt, valueArgs)
  161. return
  162. }
  163. func insertAssets(tx *sql.Tx, assets []*Asset) (err error) {
  164. if 1 > len(assets) {
  165. return
  166. }
  167. var bulk []*Asset
  168. for _, asset := range assets {
  169. bulk = append(bulk, asset)
  170. if 512 > len(bulk) {
  171. continue
  172. }
  173. if err = insertAsset0(tx, bulk); nil != err {
  174. return
  175. }
  176. bulk = []*Asset{}
  177. }
  178. if 0 < len(bulk) {
  179. if err = insertAsset0(tx, bulk); nil != err {
  180. return
  181. }
  182. }
  183. return
  184. }
  185. func insertAsset0(tx *sql.Tx, bulk []*Asset) (err error) {
  186. if 1 > len(bulk) {
  187. return
  188. }
  189. valueStrings := make([]string, 0, len(bulk))
  190. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(AssetsPlaceholder, "?"))
  191. for _, asset := range bulk {
  192. valueStrings = append(valueStrings, AssetsPlaceholder)
  193. valueArgs = append(valueArgs, asset.ID)
  194. valueArgs = append(valueArgs, asset.BlockID)
  195. valueArgs = append(valueArgs, asset.RootID)
  196. valueArgs = append(valueArgs, asset.Box)
  197. valueArgs = append(valueArgs, asset.DocPath)
  198. valueArgs = append(valueArgs, asset.Path)
  199. valueArgs = append(valueArgs, asset.Name)
  200. valueArgs = append(valueArgs, asset.Title)
  201. valueArgs = append(valueArgs, asset.Hash)
  202. }
  203. stmt := fmt.Sprintf("INSERT INTO assets (id, block_id, root_id, box, docpath, path, name, title, hash) VALUES %s", strings.Join(valueStrings, ","))
  204. err = prepareExecInsertTx(tx, stmt, valueArgs)
  205. return
  206. }
  207. func insertSpans(tx *sql.Tx, spans []*Span) (err error) {
  208. if 1 > len(spans) {
  209. return
  210. }
  211. var bulk []*Span
  212. for _, span := range spans {
  213. bulk = append(bulk, span)
  214. if 512 > len(bulk) {
  215. continue
  216. }
  217. if err = insertSpans0(tx, bulk); nil != err {
  218. return
  219. }
  220. bulk = []*Span{}
  221. }
  222. if 0 < len(bulk) {
  223. if err = insertSpans0(tx, bulk); nil != err {
  224. return
  225. }
  226. }
  227. return
  228. }
  229. func insertSpans0(tx *sql.Tx, bulk []*Span) (err error) {
  230. if 1 > len(bulk) {
  231. return
  232. }
  233. valueStrings := make([]string, 0, len(bulk))
  234. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(SpansPlaceholder, "?"))
  235. for _, span := range bulk {
  236. valueStrings = append(valueStrings, SpansPlaceholder)
  237. valueArgs = append(valueArgs, span.ID)
  238. valueArgs = append(valueArgs, span.BlockID)
  239. valueArgs = append(valueArgs, span.RootID)
  240. valueArgs = append(valueArgs, span.Box)
  241. valueArgs = append(valueArgs, span.Path)
  242. valueArgs = append(valueArgs, span.Content)
  243. valueArgs = append(valueArgs, span.Markdown)
  244. valueArgs = append(valueArgs, span.Type)
  245. valueArgs = append(valueArgs, span.IAL)
  246. }
  247. stmt := fmt.Sprintf(SpansInsert, strings.Join(valueStrings, ","))
  248. err = prepareExecInsertTx(tx, stmt, valueArgs)
  249. return
  250. }
  251. func insertRefs(tx *sql.Tx, refs []*Ref) (err error) {
  252. if 1 > len(refs) {
  253. return
  254. }
  255. var bulk []*Ref
  256. for _, ref := range refs {
  257. bulk = append(bulk, ref)
  258. if 512 > len(bulk) {
  259. continue
  260. }
  261. if err = insertRefs0(tx, bulk); nil != err {
  262. return
  263. }
  264. bulk = []*Ref{}
  265. }
  266. if 0 < len(bulk) {
  267. if err = insertRefs0(tx, bulk); nil != err {
  268. return
  269. }
  270. }
  271. return
  272. }
  273. func insertRefs0(tx *sql.Tx, bulk []*Ref) (err error) {
  274. if 1 > len(bulk) {
  275. return
  276. }
  277. valueStrings := make([]string, 0, len(bulk))
  278. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(RefsPlaceholder, "?"))
  279. for _, ref := range bulk {
  280. valueStrings = append(valueStrings, RefsPlaceholder)
  281. valueArgs = append(valueArgs, ref.ID)
  282. valueArgs = append(valueArgs, ref.DefBlockID)
  283. valueArgs = append(valueArgs, ref.DefBlockParentID)
  284. valueArgs = append(valueArgs, ref.DefBlockRootID)
  285. valueArgs = append(valueArgs, ref.DefBlockPath)
  286. valueArgs = append(valueArgs, ref.BlockID)
  287. valueArgs = append(valueArgs, ref.RootID)
  288. valueArgs = append(valueArgs, ref.Box)
  289. valueArgs = append(valueArgs, ref.Path)
  290. valueArgs = append(valueArgs, ref.Content)
  291. valueArgs = append(valueArgs, ref.Markdown)
  292. valueArgs = append(valueArgs, ref.Type)
  293. putRefCache(ref)
  294. }
  295. stmt := fmt.Sprintf("INSERT INTO refs (id, def_block_id, def_block_parent_id, def_block_root_id, def_block_path, block_id, root_id, box, path, content, markdown, type) VALUES %s", strings.Join(valueStrings, ","))
  296. err = prepareExecInsertTx(tx, stmt, valueArgs)
  297. return
  298. }
  299. func insertFileAnnotationRefs(tx *sql.Tx, refs []*FileAnnotationRef) (err error) {
  300. if 1 > len(refs) {
  301. return
  302. }
  303. var bulk []*FileAnnotationRef
  304. for _, ref := range refs {
  305. bulk = append(bulk, ref)
  306. if 512 > len(bulk) {
  307. continue
  308. }
  309. if err = insertFileAnnotationRefs0(tx, bulk); nil != err {
  310. return
  311. }
  312. bulk = []*FileAnnotationRef{}
  313. }
  314. if 0 < len(bulk) {
  315. if err = insertFileAnnotationRefs0(tx, bulk); nil != err {
  316. return
  317. }
  318. }
  319. return
  320. }
  321. func insertFileAnnotationRefs0(tx *sql.Tx, bulk []*FileAnnotationRef) (err error) {
  322. if 1 > len(bulk) {
  323. return
  324. }
  325. valueStrings := make([]string, 0, len(bulk))
  326. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(FileAnnotationRefsPlaceholder, "?"))
  327. for _, ref := range bulk {
  328. valueStrings = append(valueStrings, FileAnnotationRefsPlaceholder)
  329. valueArgs = append(valueArgs, ref.ID)
  330. valueArgs = append(valueArgs, ref.FilePath)
  331. valueArgs = append(valueArgs, ref.AnnotationID)
  332. valueArgs = append(valueArgs, ref.BlockID)
  333. valueArgs = append(valueArgs, ref.RootID)
  334. valueArgs = append(valueArgs, ref.Box)
  335. valueArgs = append(valueArgs, ref.Path)
  336. valueArgs = append(valueArgs, ref.Content)
  337. valueArgs = append(valueArgs, ref.Type)
  338. }
  339. stmt := fmt.Sprintf("INSERT INTO file_annotation_refs (id, file_path, annotation_id, block_id, root_id, box, path, content, type) VALUES %s", strings.Join(valueStrings, ","))
  340. err = prepareExecInsertTx(tx, stmt, valueArgs)
  341. return
  342. }
  343. func insertBlocksSpans(tx *sql.Tx, tree *parse.Tree) (err error) {
  344. blocks, spans, assets, attributes := fromTree(tree.Root, tree)
  345. if err = insertBlocks(tx, blocks); nil != err {
  346. return
  347. }
  348. if err = insertSpans(tx, spans); nil != err {
  349. return
  350. }
  351. if err = insertAssets(tx, assets); nil != err {
  352. return
  353. }
  354. if err = insertAttributes(tx, attributes); nil != err {
  355. return
  356. }
  357. return
  358. }
  359. func insertRef(tx *sql.Tx, tree *parse.Tree) (err error) {
  360. refs, fileAnnotationRefs := refsFromTree(tree)
  361. if err = insertRefs(tx, refs); nil != err {
  362. return
  363. }
  364. if err = insertFileAnnotationRefs(tx, fileAnnotationRefs); nil != err {
  365. return
  366. }
  367. return err
  368. }
  369. func upsertTree(tx *sql.Tx, tree *parse.Tree) (err error) {
  370. oldBlockHashes := queryBlockHashes(tree.ID)
  371. blocks, spans, assets, attributes := fromTree(tree.Root, tree)
  372. newBlockHashes := map[string]string{}
  373. for _, block := range blocks {
  374. newBlockHashes[block.ID] = block.Hash
  375. }
  376. unChanges := hashset.New()
  377. var toRemoves []string
  378. for id, hash := range oldBlockHashes {
  379. if newHash, ok := newBlockHashes[id]; ok {
  380. if newHash == hash {
  381. unChanges.Add(id)
  382. }
  383. } else {
  384. toRemoves = append(toRemoves, id)
  385. }
  386. }
  387. tmp := blocks[:0]
  388. for _, b := range blocks {
  389. if !unChanges.Contains(b.ID) {
  390. tmp = append(tmp, b)
  391. }
  392. }
  393. blocks = tmp
  394. for _, b := range blocks {
  395. toRemoves = append(toRemoves, b.ID)
  396. }
  397. deleteBlocksByIDs(tx, toRemoves)
  398. if err = deleteSpansByPathTx(tx, tree.Box, tree.Path); nil != err {
  399. return
  400. }
  401. if err = deleteAssetsByPathTx(tx, tree.Box, tree.Path); nil != err {
  402. return
  403. }
  404. if err = deleteAttributesByPathTx(tx, tree.Box, tree.Path); nil != err {
  405. return
  406. }
  407. if err = deleteRefsByPathTx(tx, tree.Box, tree.Path); nil != err {
  408. return
  409. }
  410. if err = deleteFileAnnotationRefsByPathTx(tx, tree.Box, tree.Path); nil != err {
  411. return
  412. }
  413. if err = insertBlocks(tx, blocks); nil != err {
  414. return
  415. }
  416. anchors := map[string]string{}
  417. var refIDs []string
  418. for _, block := range blocks {
  419. if "" != block.Content {
  420. // content 不为空的话说明是定值,不需要解析引用内容
  421. continue
  422. }
  423. subTree := parse.Parse("", []byte(block.Markdown), luteEngine.ParseOptions)
  424. if nil == subTree {
  425. logging.LogErrorf("parse temp block [%s] failed: %s", block.ID, err)
  426. continue
  427. }
  428. if 0 < len(treenode.GetLegacyDynamicBlockRefDefIDs(subTree.Root)) {
  429. refIDs = append(refIDs, block.ID)
  430. }
  431. }
  432. // 先删除再插入会快很多
  433. refBlocks := GetBlocks(refIDs)
  434. for _, refBlock := range refBlocks {
  435. blockContent := ResolveRefContent(refBlock, &anchors)
  436. refBlock.Content = blockContent
  437. }
  438. deleteBlocksByIDs(tx, refIDs)
  439. insertBlocks(tx, refBlocks)
  440. refs, fileAnnotationRefs := refsFromTree(tree)
  441. if err = insertRefs(tx, refs); nil != err {
  442. return
  443. }
  444. if err = insertFileAnnotationRefs(tx, fileAnnotationRefs); nil != err {
  445. return
  446. }
  447. if 0 < len(spans) {
  448. // 移除文档标签,否则会重复添加 https://github.com/siyuan-note/siyuan/issues/3723
  449. if err = deleteSpansByRootID(tx, tree.Root.ID); nil != err {
  450. return
  451. }
  452. if err = insertSpans(tx, spans); nil != err {
  453. return
  454. }
  455. }
  456. if err = insertAssets(tx, assets); nil != err {
  457. return
  458. }
  459. if err = insertAttributes(tx, attributes); nil != err {
  460. return
  461. }
  462. return err
  463. }