upsert.go 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509
  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. stmt = fmt.Sprintf(BlocksFTSCaseInsensitiveInsert, strings.Join(valueStrings, ","))
  113. if err = prepareExecInsertTx(tx, stmt, valueArgs); nil != err {
  114. return
  115. }
  116. return
  117. }
  118. func insertAttributes(tx *sql.Tx, attributes []*Attribute) (err error) {
  119. if 1 > len(attributes) {
  120. return
  121. }
  122. var bulk []*Attribute
  123. for _, attr := range attributes {
  124. bulk = append(bulk, attr)
  125. if 512 > len(bulk) {
  126. continue
  127. }
  128. if err = insertAttribute0(tx, bulk); nil != err {
  129. return
  130. }
  131. bulk = []*Attribute{}
  132. }
  133. if 0 < len(bulk) {
  134. if err = insertAttribute0(tx, bulk); nil != err {
  135. return
  136. }
  137. }
  138. return
  139. }
  140. func insertAttribute0(tx *sql.Tx, bulk []*Attribute) (err error) {
  141. if 1 > len(bulk) {
  142. return
  143. }
  144. valueStrings := make([]string, 0, len(bulk))
  145. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(AttributesPlaceholder, "?"))
  146. for _, attr := range bulk {
  147. valueStrings = append(valueStrings, AttributesPlaceholder)
  148. valueArgs = append(valueArgs, attr.ID)
  149. valueArgs = append(valueArgs, attr.Name)
  150. valueArgs = append(valueArgs, attr.Value)
  151. valueArgs = append(valueArgs, attr.Type)
  152. valueArgs = append(valueArgs, attr.BlockID)
  153. valueArgs = append(valueArgs, attr.RootID)
  154. valueArgs = append(valueArgs, attr.Box)
  155. valueArgs = append(valueArgs, attr.Path)
  156. }
  157. stmt := fmt.Sprintf("INSERT INTO attributes (id, name, value, type, block_id, root_id, box, path) VALUES %s", strings.Join(valueStrings, ","))
  158. err = prepareExecInsertTx(tx, stmt, valueArgs)
  159. return
  160. }
  161. func insertAssets(tx *sql.Tx, assets []*Asset) (err error) {
  162. if 1 > len(assets) {
  163. return
  164. }
  165. var bulk []*Asset
  166. for _, asset := range assets {
  167. bulk = append(bulk, asset)
  168. if 512 > len(bulk) {
  169. continue
  170. }
  171. if err = insertAsset0(tx, bulk); nil != err {
  172. return
  173. }
  174. bulk = []*Asset{}
  175. }
  176. if 0 < len(bulk) {
  177. if err = insertAsset0(tx, bulk); nil != err {
  178. return
  179. }
  180. }
  181. return
  182. }
  183. func insertAsset0(tx *sql.Tx, bulk []*Asset) (err error) {
  184. if 1 > len(bulk) {
  185. return
  186. }
  187. valueStrings := make([]string, 0, len(bulk))
  188. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(AssetsPlaceholder, "?"))
  189. for _, asset := range bulk {
  190. valueStrings = append(valueStrings, AssetsPlaceholder)
  191. valueArgs = append(valueArgs, asset.ID)
  192. valueArgs = append(valueArgs, asset.BlockID)
  193. valueArgs = append(valueArgs, asset.RootID)
  194. valueArgs = append(valueArgs, asset.Box)
  195. valueArgs = append(valueArgs, asset.DocPath)
  196. valueArgs = append(valueArgs, asset.Path)
  197. valueArgs = append(valueArgs, asset.Name)
  198. valueArgs = append(valueArgs, asset.Title)
  199. valueArgs = append(valueArgs, asset.Hash)
  200. }
  201. stmt := fmt.Sprintf("INSERT INTO assets (id, block_id, root_id, box, docpath, path, name, title, hash) VALUES %s", strings.Join(valueStrings, ","))
  202. err = prepareExecInsertTx(tx, stmt, valueArgs)
  203. return
  204. }
  205. func insertSpans(tx *sql.Tx, spans []*Span) (err error) {
  206. if 1 > len(spans) {
  207. return
  208. }
  209. var bulk []*Span
  210. for _, span := range spans {
  211. bulk = append(bulk, span)
  212. if 512 > len(bulk) {
  213. continue
  214. }
  215. if err = insertSpans0(tx, bulk); nil != err {
  216. return
  217. }
  218. bulk = []*Span{}
  219. }
  220. if 0 < len(bulk) {
  221. if err = insertSpans0(tx, bulk); nil != err {
  222. return
  223. }
  224. }
  225. return
  226. }
  227. func insertSpans0(tx *sql.Tx, bulk []*Span) (err error) {
  228. if 1 > len(bulk) {
  229. return
  230. }
  231. valueStrings := make([]string, 0, len(bulk))
  232. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(SpansPlaceholder, "?"))
  233. for _, span := range bulk {
  234. valueStrings = append(valueStrings, SpansPlaceholder)
  235. valueArgs = append(valueArgs, span.ID)
  236. valueArgs = append(valueArgs, span.BlockID)
  237. valueArgs = append(valueArgs, span.RootID)
  238. valueArgs = append(valueArgs, span.Box)
  239. valueArgs = append(valueArgs, span.Path)
  240. valueArgs = append(valueArgs, span.Content)
  241. valueArgs = append(valueArgs, span.Markdown)
  242. valueArgs = append(valueArgs, span.Type)
  243. valueArgs = append(valueArgs, span.IAL)
  244. }
  245. stmt := fmt.Sprintf(SpansInsert, strings.Join(valueStrings, ","))
  246. err = prepareExecInsertTx(tx, stmt, valueArgs)
  247. return
  248. }
  249. func insertRefs(tx *sql.Tx, refs []*Ref) (err error) {
  250. if 1 > len(refs) {
  251. return
  252. }
  253. var bulk []*Ref
  254. for _, ref := range refs {
  255. bulk = append(bulk, ref)
  256. if 512 > len(bulk) {
  257. continue
  258. }
  259. if err = insertRefs0(tx, bulk); nil != err {
  260. return
  261. }
  262. bulk = []*Ref{}
  263. }
  264. if 0 < len(bulk) {
  265. if err = insertRefs0(tx, bulk); nil != err {
  266. return
  267. }
  268. }
  269. return
  270. }
  271. func insertRefs0(tx *sql.Tx, bulk []*Ref) (err error) {
  272. if 1 > len(bulk) {
  273. return
  274. }
  275. valueStrings := make([]string, 0, len(bulk))
  276. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(RefsPlaceholder, "?"))
  277. for _, ref := range bulk {
  278. valueStrings = append(valueStrings, RefsPlaceholder)
  279. valueArgs = append(valueArgs, ref.ID)
  280. valueArgs = append(valueArgs, ref.DefBlockID)
  281. valueArgs = append(valueArgs, ref.DefBlockParentID)
  282. valueArgs = append(valueArgs, ref.DefBlockRootID)
  283. valueArgs = append(valueArgs, ref.DefBlockPath)
  284. valueArgs = append(valueArgs, ref.BlockID)
  285. valueArgs = append(valueArgs, ref.RootID)
  286. valueArgs = append(valueArgs, ref.Box)
  287. valueArgs = append(valueArgs, ref.Path)
  288. valueArgs = append(valueArgs, ref.Content)
  289. valueArgs = append(valueArgs, ref.Markdown)
  290. valueArgs = append(valueArgs, ref.Type)
  291. putRefCache(ref)
  292. }
  293. 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, ","))
  294. err = prepareExecInsertTx(tx, stmt, valueArgs)
  295. return
  296. }
  297. func insertFileAnnotationRefs(tx *sql.Tx, refs []*FileAnnotationRef) (err error) {
  298. if 1 > len(refs) {
  299. return
  300. }
  301. var bulk []*FileAnnotationRef
  302. for _, ref := range refs {
  303. bulk = append(bulk, ref)
  304. if 512 > len(bulk) {
  305. continue
  306. }
  307. if err = insertFileAnnotationRefs0(tx, bulk); nil != err {
  308. return
  309. }
  310. bulk = []*FileAnnotationRef{}
  311. }
  312. if 0 < len(bulk) {
  313. if err = insertFileAnnotationRefs0(tx, bulk); nil != err {
  314. return
  315. }
  316. }
  317. return
  318. }
  319. func insertFileAnnotationRefs0(tx *sql.Tx, bulk []*FileAnnotationRef) (err error) {
  320. if 1 > len(bulk) {
  321. return
  322. }
  323. valueStrings := make([]string, 0, len(bulk))
  324. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(FileAnnotationRefsPlaceholder, "?"))
  325. for _, ref := range bulk {
  326. valueStrings = append(valueStrings, FileAnnotationRefsPlaceholder)
  327. valueArgs = append(valueArgs, ref.ID)
  328. valueArgs = append(valueArgs, ref.FilePath)
  329. valueArgs = append(valueArgs, ref.AnnotationID)
  330. valueArgs = append(valueArgs, ref.BlockID)
  331. valueArgs = append(valueArgs, ref.RootID)
  332. valueArgs = append(valueArgs, ref.Box)
  333. valueArgs = append(valueArgs, ref.Path)
  334. valueArgs = append(valueArgs, ref.Content)
  335. valueArgs = append(valueArgs, ref.Type)
  336. }
  337. 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, ","))
  338. err = prepareExecInsertTx(tx, stmt, valueArgs)
  339. return
  340. }
  341. func insertBlocksSpans(tx *sql.Tx, tree *parse.Tree) (err error) {
  342. blocks, spans, assets, attributes := fromTree(tree.Root, tree)
  343. if err = insertBlocks(tx, blocks); nil != err {
  344. return
  345. }
  346. if err = insertSpans(tx, spans); nil != err {
  347. return
  348. }
  349. if err = insertAssets(tx, assets); nil != err {
  350. return
  351. }
  352. if err = insertAttributes(tx, attributes); nil != err {
  353. return
  354. }
  355. return
  356. }
  357. func insertRef(tx *sql.Tx, tree *parse.Tree) (err error) {
  358. refs, fileAnnotationRefs := refsFromTree(tree)
  359. if err = insertRefs(tx, refs); nil != err {
  360. return
  361. }
  362. if err = insertFileAnnotationRefs(tx, fileAnnotationRefs); nil != err {
  363. return
  364. }
  365. return err
  366. }
  367. func upsertTree(tx *sql.Tx, tree *parse.Tree) (err error) {
  368. oldBlockHashes := queryBlockHashes(tree.ID)
  369. blocks, spans, assets, attributes := fromTree(tree.Root, tree)
  370. newBlockHashes := map[string]string{}
  371. for _, block := range blocks {
  372. newBlockHashes[block.ID] = block.Hash
  373. }
  374. unChanges := hashset.New()
  375. var toRemoves []string
  376. for id, hash := range oldBlockHashes {
  377. if newHash, ok := newBlockHashes[id]; ok {
  378. if newHash == hash {
  379. unChanges.Add(id)
  380. }
  381. } else {
  382. toRemoves = append(toRemoves, id)
  383. }
  384. }
  385. tmp := blocks[:0]
  386. for _, b := range blocks {
  387. if !unChanges.Contains(b.ID) {
  388. tmp = append(tmp, b)
  389. }
  390. }
  391. blocks = tmp
  392. for _, b := range blocks {
  393. toRemoves = append(toRemoves, b.ID)
  394. }
  395. deleteBlocksByIDs(tx, toRemoves)
  396. if err = deleteSpansByPathTx(tx, tree.Box, tree.Path); nil != err {
  397. return
  398. }
  399. if err = deleteAssetsByPathTx(tx, tree.Box, tree.Path); nil != err {
  400. return
  401. }
  402. if err = deleteAttributesByPathTx(tx, tree.Box, tree.Path); nil != err {
  403. return
  404. }
  405. if err = deleteRefsByPathTx(tx, tree.Box, tree.Path); nil != err {
  406. return
  407. }
  408. if err = deleteFileAnnotationRefsByPathTx(tx, tree.Box, tree.Path); nil != err {
  409. return
  410. }
  411. if err = insertBlocks(tx, blocks); nil != err {
  412. return
  413. }
  414. anchors := map[string]string{}
  415. var refIDs []string
  416. for _, block := range blocks {
  417. if "" != block.Content {
  418. // content 不为空的话说明是定值,不需要解析引用内容
  419. continue
  420. }
  421. subTree := parse.Parse("", []byte(block.Markdown), luteEngine.ParseOptions)
  422. if nil == subTree {
  423. logging.LogErrorf("parse temp block [%s] failed: %s", block.ID, err)
  424. continue
  425. }
  426. if 0 < len(treenode.GetLegacyDynamicBlockRefDefIDs(subTree.Root)) {
  427. refIDs = append(refIDs, block.ID)
  428. }
  429. }
  430. // 先删除再插入会快很多
  431. refBlocks := GetBlocks(refIDs)
  432. for _, refBlock := range refBlocks {
  433. blockContent := ResolveRefContent(refBlock, &anchors)
  434. refBlock.Content = blockContent
  435. }
  436. deleteBlocksByIDs(tx, refIDs)
  437. insertBlocks(tx, refBlocks)
  438. refs, fileAnnotationRefs := refsFromTree(tree)
  439. if err = insertRefs(tx, refs); nil != err {
  440. return
  441. }
  442. if err = insertFileAnnotationRefs(tx, fileAnnotationRefs); nil != err {
  443. return
  444. }
  445. if 0 < len(spans) {
  446. // 移除文档标签,否则会重复添加 https://github.com/siyuan-note/siyuan/issues/3723
  447. if err = deleteSpansByRootID(tx, tree.Root.ID); nil != err {
  448. return
  449. }
  450. if err = insertSpans(tx, spans); nil != err {
  451. return
  452. }
  453. }
  454. if err = insertAssets(tx, assets); nil != err {
  455. return
  456. }
  457. if err = insertAttributes(tx, attributes); nil != err {
  458. return
  459. }
  460. return err
  461. }