upsert.go 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480
  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. "bytes"
  19. "crypto/sha256"
  20. "database/sql"
  21. "fmt"
  22. "github.com/siyuan-note/siyuan/kernel/filesys"
  23. "strings"
  24. "github.com/88250/lute/parse"
  25. "github.com/emirpasic/gods/sets/hashset"
  26. "github.com/siyuan-note/eventbus"
  27. "github.com/siyuan-note/siyuan/kernel/util"
  28. )
  29. var luteEngine = util.NewLute()
  30. func init() {
  31. luteEngine.RenderOptions.KramdownBlockIAL = false // 数据库 markdown 字段为标准 md,但是要保留 span block ial
  32. }
  33. const (
  34. 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"
  35. 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"
  36. 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"
  37. BlocksPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)"
  38. SpansInsert = "INSERT INTO spans (id, block_id, root_id, box, path, content, markdown, type, ial) VALUES %s"
  39. SpansPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?)"
  40. AssetsPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?)"
  41. AttributesPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?)"
  42. RefsPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)"
  43. FileAnnotationRefsPlaceholder = "(?, ?, ?, ?, ?, ?, ?, ?, ?)"
  44. )
  45. func insertBlocks(tx *sql.Tx, blocks []*Block, context map[string]interface{}) (err error) {
  46. if 1 > len(blocks) {
  47. return
  48. }
  49. var bulk []*Block
  50. for _, block := range blocks {
  51. bulk = append(bulk, block)
  52. if 512 > len(bulk) {
  53. continue
  54. }
  55. if err = insertBlocks0(tx, bulk, context); nil != err {
  56. return
  57. }
  58. bulk = []*Block{}
  59. }
  60. if 0 < len(bulk) {
  61. if err = insertBlocks0(tx, bulk, context); nil != err {
  62. return
  63. }
  64. }
  65. return
  66. }
  67. func insertBlocks0(tx *sql.Tx, bulk []*Block, context map[string]interface{}) (err error) {
  68. valueStrings := make([]string, 0, len(bulk))
  69. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(BlocksPlaceholder, "?"))
  70. hashBuf := bytes.Buffer{}
  71. for _, b := range bulk {
  72. valueStrings = append(valueStrings, BlocksPlaceholder)
  73. valueArgs = append(valueArgs, b.ID)
  74. valueArgs = append(valueArgs, b.ParentID)
  75. valueArgs = append(valueArgs, b.RootID)
  76. valueArgs = append(valueArgs, b.Hash)
  77. valueArgs = append(valueArgs, b.Box)
  78. valueArgs = append(valueArgs, b.Path)
  79. valueArgs = append(valueArgs, b.HPath)
  80. valueArgs = append(valueArgs, b.Name)
  81. valueArgs = append(valueArgs, b.Alias)
  82. valueArgs = append(valueArgs, b.Memo)
  83. valueArgs = append(valueArgs, b.Tag)
  84. valueArgs = append(valueArgs, b.Content)
  85. valueArgs = append(valueArgs, b.FContent)
  86. valueArgs = append(valueArgs, b.Markdown)
  87. valueArgs = append(valueArgs, b.Length)
  88. valueArgs = append(valueArgs, b.Type)
  89. valueArgs = append(valueArgs, b.SubType)
  90. valueArgs = append(valueArgs, b.IAL)
  91. valueArgs = append(valueArgs, b.Sort)
  92. valueArgs = append(valueArgs, b.Created)
  93. valueArgs = append(valueArgs, b.Updated)
  94. putBlockCache(b)
  95. hashBuf.WriteString(b.Hash)
  96. }
  97. stmt := fmt.Sprintf(BlocksInsert, strings.Join(valueStrings, ","))
  98. if err = prepareExecInsertTx(tx, stmt, valueArgs); nil != err {
  99. return
  100. }
  101. hashBuf.WriteString("blocks")
  102. evtHash := fmt.Sprintf("%x", sha256.Sum256(hashBuf.Bytes()))[:7]
  103. eventbus.Publish(eventbus.EvtSQLInsertBlocks, context, len(bulk), evtHash)
  104. stmt = fmt.Sprintf(BlocksFTSInsert, strings.Join(valueStrings, ","))
  105. if err = prepareExecInsertTx(tx, stmt, valueArgs); nil != err {
  106. return
  107. }
  108. if !caseSensitive {
  109. stmt = fmt.Sprintf(BlocksFTSCaseInsensitiveInsert, strings.Join(valueStrings, ","))
  110. if err = prepareExecInsertTx(tx, stmt, valueArgs); nil != err {
  111. return
  112. }
  113. }
  114. hashBuf.WriteString("fts")
  115. evtHash = fmt.Sprintf("%x", sha256.Sum256(hashBuf.Bytes()))[:7]
  116. eventbus.Publish(eventbus.EvtSQLInsertBlocksFTS, context, len(bulk), evtHash)
  117. return
  118. }
  119. func insertAttributes(tx *sql.Tx, attributes []*Attribute) (err error) {
  120. if 1 > len(attributes) {
  121. return
  122. }
  123. var bulk []*Attribute
  124. for _, attr := range attributes {
  125. bulk = append(bulk, attr)
  126. if 512 > len(bulk) {
  127. continue
  128. }
  129. if err = insertAttribute0(tx, bulk); nil != err {
  130. return
  131. }
  132. bulk = []*Attribute{}
  133. }
  134. if 0 < len(bulk) {
  135. if err = insertAttribute0(tx, bulk); nil != err {
  136. return
  137. }
  138. }
  139. return
  140. }
  141. func insertAttribute0(tx *sql.Tx, bulk []*Attribute) (err error) {
  142. if 1 > len(bulk) {
  143. return
  144. }
  145. valueStrings := make([]string, 0, len(bulk))
  146. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(AttributesPlaceholder, "?"))
  147. for _, attr := range bulk {
  148. valueStrings = append(valueStrings, AttributesPlaceholder)
  149. valueArgs = append(valueArgs, attr.ID)
  150. valueArgs = append(valueArgs, attr.Name)
  151. valueArgs = append(valueArgs, attr.Value)
  152. valueArgs = append(valueArgs, attr.Type)
  153. valueArgs = append(valueArgs, attr.BlockID)
  154. valueArgs = append(valueArgs, attr.RootID)
  155. valueArgs = append(valueArgs, attr.Box)
  156. valueArgs = append(valueArgs, attr.Path)
  157. }
  158. stmt := fmt.Sprintf("INSERT INTO attributes (id, name, value, type, block_id, root_id, box, path) VALUES %s", strings.Join(valueStrings, ","))
  159. err = prepareExecInsertTx(tx, stmt, valueArgs)
  160. return
  161. }
  162. func insertAssets(tx *sql.Tx, assets []*Asset) (err error) {
  163. if 1 > len(assets) {
  164. return
  165. }
  166. var bulk []*Asset
  167. for _, asset := range assets {
  168. bulk = append(bulk, asset)
  169. if 512 > len(bulk) {
  170. continue
  171. }
  172. if err = insertAsset0(tx, bulk); nil != err {
  173. return
  174. }
  175. bulk = []*Asset{}
  176. }
  177. if 0 < len(bulk) {
  178. if err = insertAsset0(tx, bulk); nil != err {
  179. return
  180. }
  181. }
  182. return
  183. }
  184. func insertAsset0(tx *sql.Tx, bulk []*Asset) (err error) {
  185. if 1 > len(bulk) {
  186. return
  187. }
  188. valueStrings := make([]string, 0, len(bulk))
  189. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(AssetsPlaceholder, "?"))
  190. for _, asset := range bulk {
  191. valueStrings = append(valueStrings, AssetsPlaceholder)
  192. valueArgs = append(valueArgs, asset.ID)
  193. valueArgs = append(valueArgs, asset.BlockID)
  194. valueArgs = append(valueArgs, asset.RootID)
  195. valueArgs = append(valueArgs, asset.Box)
  196. valueArgs = append(valueArgs, asset.DocPath)
  197. valueArgs = append(valueArgs, asset.Path)
  198. valueArgs = append(valueArgs, asset.Name)
  199. valueArgs = append(valueArgs, asset.Title)
  200. valueArgs = append(valueArgs, asset.Hash)
  201. }
  202. stmt := fmt.Sprintf("INSERT INTO assets (id, block_id, root_id, box, docpath, path, name, title, hash) VALUES %s", strings.Join(valueStrings, ","))
  203. err = prepareExecInsertTx(tx, stmt, valueArgs)
  204. return
  205. }
  206. func insertSpans(tx *sql.Tx, spans []*Span) (err error) {
  207. if 1 > len(spans) {
  208. return
  209. }
  210. var bulk []*Span
  211. for _, span := range spans {
  212. bulk = append(bulk, span)
  213. if 512 > len(bulk) {
  214. continue
  215. }
  216. if err = insertSpans0(tx, bulk); nil != err {
  217. return
  218. }
  219. bulk = []*Span{}
  220. }
  221. if 0 < len(bulk) {
  222. if err = insertSpans0(tx, bulk); nil != err {
  223. return
  224. }
  225. }
  226. return
  227. }
  228. func insertSpans0(tx *sql.Tx, bulk []*Span) (err error) {
  229. if 1 > len(bulk) {
  230. return
  231. }
  232. valueStrings := make([]string, 0, len(bulk))
  233. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(SpansPlaceholder, "?"))
  234. for _, span := range bulk {
  235. valueStrings = append(valueStrings, SpansPlaceholder)
  236. valueArgs = append(valueArgs, span.ID)
  237. valueArgs = append(valueArgs, span.BlockID)
  238. valueArgs = append(valueArgs, span.RootID)
  239. valueArgs = append(valueArgs, span.Box)
  240. valueArgs = append(valueArgs, span.Path)
  241. valueArgs = append(valueArgs, span.Content)
  242. valueArgs = append(valueArgs, span.Markdown)
  243. valueArgs = append(valueArgs, span.Type)
  244. valueArgs = append(valueArgs, span.IAL)
  245. }
  246. stmt := fmt.Sprintf(SpansInsert, strings.Join(valueStrings, ","))
  247. err = prepareExecInsertTx(tx, stmt, valueArgs)
  248. return
  249. }
  250. func insertBlockRefs(tx *sql.Tx, refs []*Ref) (err error) {
  251. if 1 > len(refs) {
  252. return
  253. }
  254. var bulk []*Ref
  255. for _, ref := range refs {
  256. bulk = append(bulk, ref)
  257. if 512 > len(bulk) {
  258. continue
  259. }
  260. if err = insertRefs0(tx, bulk); nil != err {
  261. return
  262. }
  263. bulk = []*Ref{}
  264. }
  265. if 0 < len(bulk) {
  266. if err = insertRefs0(tx, bulk); nil != err {
  267. return
  268. }
  269. }
  270. return
  271. }
  272. func insertRefs0(tx *sql.Tx, bulk []*Ref) (err error) {
  273. if 1 > len(bulk) {
  274. return
  275. }
  276. valueStrings := make([]string, 0, len(bulk))
  277. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(RefsPlaceholder, "?"))
  278. for _, ref := range bulk {
  279. valueStrings = append(valueStrings, RefsPlaceholder)
  280. valueArgs = append(valueArgs, ref.ID)
  281. valueArgs = append(valueArgs, ref.DefBlockID)
  282. valueArgs = append(valueArgs, ref.DefBlockParentID)
  283. valueArgs = append(valueArgs, ref.DefBlockRootID)
  284. valueArgs = append(valueArgs, ref.DefBlockPath)
  285. valueArgs = append(valueArgs, ref.BlockID)
  286. valueArgs = append(valueArgs, ref.RootID)
  287. valueArgs = append(valueArgs, ref.Box)
  288. valueArgs = append(valueArgs, ref.Path)
  289. valueArgs = append(valueArgs, ref.Content)
  290. valueArgs = append(valueArgs, ref.Markdown)
  291. valueArgs = append(valueArgs, ref.Type)
  292. putRefCache(ref)
  293. }
  294. 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, ","))
  295. err = prepareExecInsertTx(tx, stmt, valueArgs)
  296. return
  297. }
  298. func insertFileAnnotationRefs(tx *sql.Tx, refs []*FileAnnotationRef) (err error) {
  299. if 1 > len(refs) {
  300. return
  301. }
  302. var bulk []*FileAnnotationRef
  303. for _, ref := range refs {
  304. bulk = append(bulk, ref)
  305. if 512 > len(bulk) {
  306. continue
  307. }
  308. if err = insertFileAnnotationRefs0(tx, bulk); nil != err {
  309. return
  310. }
  311. bulk = []*FileAnnotationRef{}
  312. }
  313. if 0 < len(bulk) {
  314. if err = insertFileAnnotationRefs0(tx, bulk); nil != err {
  315. return
  316. }
  317. }
  318. return
  319. }
  320. func insertFileAnnotationRefs0(tx *sql.Tx, bulk []*FileAnnotationRef) (err error) {
  321. if 1 > len(bulk) {
  322. return
  323. }
  324. valueStrings := make([]string, 0, len(bulk))
  325. valueArgs := make([]interface{}, 0, len(bulk)*strings.Count(FileAnnotationRefsPlaceholder, "?"))
  326. for _, ref := range bulk {
  327. valueStrings = append(valueStrings, FileAnnotationRefsPlaceholder)
  328. valueArgs = append(valueArgs, ref.ID)
  329. valueArgs = append(valueArgs, ref.FilePath)
  330. valueArgs = append(valueArgs, ref.AnnotationID)
  331. valueArgs = append(valueArgs, ref.BlockID)
  332. valueArgs = append(valueArgs, ref.RootID)
  333. valueArgs = append(valueArgs, ref.Box)
  334. valueArgs = append(valueArgs, ref.Path)
  335. valueArgs = append(valueArgs, ref.Content)
  336. valueArgs = append(valueArgs, ref.Type)
  337. }
  338. 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, ","))
  339. err = prepareExecInsertTx(tx, stmt, valueArgs)
  340. return
  341. }
  342. func insertRefs(tx *sql.Tx, tree *parse.Tree) (err error) {
  343. refs, fileAnnotationRefs := refsFromTree(tree)
  344. if err = insertBlockRefs(tx, refs); nil != err {
  345. return
  346. }
  347. if err = insertFileAnnotationRefs(tx, fileAnnotationRefs); nil != err {
  348. return
  349. }
  350. return err
  351. }
  352. func indexTree(tx *sql.Tx, box, p string, context map[string]interface{}) (err error) {
  353. tree, err := filesys.LoadTree(box, p, luteEngine)
  354. if nil != err {
  355. return
  356. }
  357. err = upsertTree(tx, tree, context)
  358. return
  359. }
  360. func upsertTree(tx *sql.Tx, tree *parse.Tree, context map[string]interface{}) (err error) {
  361. oldBlockHashes := queryBlockHashes(tree.ID)
  362. blocks, spans, assets, attributes := fromTree(tree.Root, tree)
  363. newBlockHashes := map[string]string{}
  364. for _, block := range blocks {
  365. newBlockHashes[block.ID] = block.Hash
  366. }
  367. unChanges := hashset.New()
  368. var toRemoves []string
  369. for id, hash := range oldBlockHashes {
  370. if newHash, ok := newBlockHashes[id]; ok {
  371. if newHash == hash {
  372. unChanges.Add(id)
  373. }
  374. } else {
  375. toRemoves = append(toRemoves, id)
  376. }
  377. }
  378. tmp := blocks[:0]
  379. for _, b := range blocks {
  380. if !unChanges.Contains(b.ID) {
  381. tmp = append(tmp, b)
  382. }
  383. }
  384. blocks = tmp
  385. for _, b := range blocks {
  386. toRemoves = append(toRemoves, b.ID)
  387. }
  388. deleteBlocksByIDs(tx, toRemoves)
  389. if err = deleteSpansByPathTx(tx, tree.Box, tree.Path); nil != err {
  390. return
  391. }
  392. if err = deleteAssetsByPathTx(tx, tree.Box, tree.Path); nil != err {
  393. return
  394. }
  395. if err = deleteAttributesByPathTx(tx, tree.Box, tree.Path); nil != err {
  396. return
  397. }
  398. if err = deleteRefsByPathTx(tx, tree.Box, tree.Path); nil != err {
  399. return
  400. }
  401. if err = deleteFileAnnotationRefsByPathTx(tx, tree.Box, tree.Path); nil != err {
  402. return
  403. }
  404. if err = insertBlocks(tx, blocks, context); nil != err {
  405. return
  406. }
  407. refs, fileAnnotationRefs := refsFromTree(tree)
  408. if err = insertBlockRefs(tx, refs); nil != err {
  409. return
  410. }
  411. if err = insertFileAnnotationRefs(tx, fileAnnotationRefs); nil != err {
  412. return
  413. }
  414. if 0 < len(spans) {
  415. // 移除文档标签,否则会重复添加 https://github.com/siyuan-note/siyuan/issues/3723
  416. if err = deleteSpansByRootID(tx, tree.Root.ID); nil != err {
  417. return
  418. }
  419. if err = insertSpans(tx, spans); nil != err {
  420. return
  421. }
  422. }
  423. if err = insertAssets(tx, assets); nil != err {
  424. return
  425. }
  426. if err = insertAttributes(tx, attributes); nil != err {
  427. return
  428. }
  429. return err
  430. }