ContentCacheManager.js 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447
  1. /**
  2. * ContentCacheManager - maintains a cache of stream hashes from a PDF file
  3. */
  4. import { callbackify } from 'node:util'
  5. import fs from 'node:fs'
  6. import crypto from 'node:crypto'
  7. import Path from 'node:path'
  8. import Settings from '@overleaf/settings'
  9. import OError from '@overleaf/o-error'
  10. import pLimit from 'p-limit'
  11. import XrefParser from './XrefParser.js'
  12. import {
  13. QueueLimitReachedError,
  14. TimedOutError,
  15. NoXrefTableError,
  16. } from './Errors.js'
  17. import workerpool from 'workerpool'
  18. import Metrics from '@overleaf/metrics'
  19. const { parseXrefTable } = XrefParser
  20. /**
  21. * @type {import('workerpool').WorkerPool}
  22. */
  23. let WORKER_POOL
  24. // NOTE: Check for main thread to avoid recursive start of pool.
  25. if (Settings.pdfCachingEnableWorkerPool && workerpool.isMainThread) {
  26. WORKER_POOL = workerpool.pool(
  27. Path.join(import.meta.dirname, 'ContentCacheWorker.js'),
  28. {
  29. // Cap number of worker threads.
  30. maxWorkers: Settings.pdfCachingWorkerPoolSize,
  31. // Warmup workers.
  32. minWorkers: Settings.pdfCachingWorkerPoolSize,
  33. // Limit queue back-log
  34. maxQueueSize: Settings.pdfCachingWorkerPoolBackLogLimit,
  35. }
  36. )
  37. setInterval(() => {
  38. const {
  39. totalWorkers,
  40. busyWorkers,
  41. idleWorkers,
  42. pendingTasks,
  43. activeTasks,
  44. } = WORKER_POOL.stats()
  45. Metrics.gauge('pdf_caching_total_workers', totalWorkers)
  46. Metrics.gauge('pdf_caching_busy_workers', busyWorkers)
  47. Metrics.gauge('pdf_caching_idle_workers', idleWorkers)
  48. Metrics.gauge('pdf_caching_pending_tasks', pendingTasks)
  49. Metrics.gauge('pdf_caching_active_tasks', activeTasks)
  50. }, 15 * 1000)
  51. }
  52. /**
  53. *
  54. * @param {String} contentDir path to directory where content hash files are cached
  55. * @param {String} filePath the pdf file to scan for streams
  56. * @param {number} pdfSize the pdf size
  57. * @param {number} pdfCachingMinChunkSize per request threshold
  58. * @param {number} compileTime
  59. */
  60. async function update({
  61. contentDir,
  62. filePath,
  63. pdfSize,
  64. pdfCachingMinChunkSize,
  65. compileTime,
  66. }) {
  67. if (pdfSize < pdfCachingMinChunkSize) {
  68. return {
  69. contentRanges: [],
  70. newContentRanges: [],
  71. reclaimedSpace: 0,
  72. startXRefTable: undefined,
  73. }
  74. }
  75. if (Settings.pdfCachingEnableWorkerPool) {
  76. return await updateOtherEventLoop({
  77. contentDir,
  78. filePath,
  79. pdfSize,
  80. pdfCachingMinChunkSize,
  81. compileTime,
  82. })
  83. } else {
  84. return await updateSameEventLoop({
  85. contentDir,
  86. filePath,
  87. pdfSize,
  88. pdfCachingMinChunkSize,
  89. compileTime,
  90. })
  91. }
  92. }
  93. /**
  94. *
  95. * @param {String} contentDir path to directory where content hash files are cached
  96. * @param {String} filePath the pdf file to scan for streams
  97. * @param {number} pdfSize the pdf size
  98. * @param {number} pdfCachingMinChunkSize per request threshold
  99. * @param {number} compileTime
  100. */
  101. async function updateOtherEventLoop({
  102. contentDir,
  103. filePath,
  104. pdfSize,
  105. pdfCachingMinChunkSize,
  106. compileTime,
  107. }) {
  108. const workerLatencyInMs = 100
  109. // Prefer getting the timeout error from the worker vs timing out the worker.
  110. const timeout = getMaxOverhead(compileTime) + workerLatencyInMs
  111. try {
  112. return await WORKER_POOL.exec('updateSameEventLoop', [
  113. {
  114. contentDir,
  115. filePath,
  116. pdfSize,
  117. pdfCachingMinChunkSize,
  118. compileTime,
  119. },
  120. ]).timeout(timeout)
  121. } catch (e) {
  122. if (e instanceof workerpool.Promise.TimeoutError) {
  123. throw new TimedOutError('context-lost-in-worker', { timeout })
  124. }
  125. if (e.message?.includes?.('Max queue size of ')) {
  126. throw new QueueLimitReachedError()
  127. }
  128. if (e.message?.includes?.('xref')) {
  129. throw new NoXrefTableError(e.message)
  130. }
  131. throw e
  132. }
  133. }
  134. /**
  135. *
  136. * @param {String} contentDir path to directory where content hash files are cached
  137. * @param {String} filePath the pdf file to scan for streams
  138. * @param {number} pdfSize the pdf size
  139. * @param {number} pdfCachingMinChunkSize per request threshold
  140. * @param {number} compileTime
  141. */
  142. async function updateSameEventLoop({
  143. contentDir,
  144. filePath,
  145. pdfSize,
  146. pdfCachingMinChunkSize,
  147. compileTime,
  148. }) {
  149. const checkDeadline = getDeadlineChecker(compileTime)
  150. // keep track of hashes expire old ones when they reach a generation > N.
  151. const tracker = await HashFileTracker.from(contentDir)
  152. tracker.updateAge()
  153. checkDeadline('after init HashFileTracker')
  154. const [reclaimedSpace, overheadDeleteStaleHashes] =
  155. await tracker.deleteStaleHashes(5)
  156. checkDeadline('after delete stale hashes')
  157. const { xRefEntries, startXRefTable } = await parseXrefTable(
  158. filePath,
  159. pdfSize
  160. )
  161. xRefEntries.sort((a, b) => {
  162. return a.offset - b.offset
  163. })
  164. xRefEntries.forEach((obj, idx) => {
  165. obj.idx = idx
  166. })
  167. checkDeadline('after parsing')
  168. const uncompressedObjects = []
  169. for (const object of xRefEntries) {
  170. if (!object.uncompressed) {
  171. continue
  172. }
  173. const nextObject = xRefEntries[object.idx + 1]
  174. if (!nextObject) {
  175. // Ignore this possible edge case.
  176. // The last object should be part of the xRef table.
  177. continue
  178. } else {
  179. object.endOffset = nextObject.offset
  180. }
  181. const size = object.endOffset - object.offset
  182. object.size = size
  183. if (size < pdfCachingMinChunkSize) {
  184. continue
  185. }
  186. uncompressedObjects.push({ object, idx: uncompressedObjects.length })
  187. }
  188. checkDeadline('after finding uncompressed')
  189. let timedOutErr = null
  190. const contentRanges = []
  191. const newContentRanges = []
  192. const handle = await fs.promises.open(filePath)
  193. try {
  194. for (const { object, idx } of uncompressedObjects) {
  195. let buffer = Buffer.alloc(object.size, 0)
  196. const { bytesRead } = await handle.read(
  197. buffer,
  198. 0,
  199. object.size,
  200. object.offset
  201. )
  202. checkDeadline('after read ' + idx)
  203. if (bytesRead !== object.size) {
  204. throw new OError('could not read full chunk', {
  205. object,
  206. bytesRead,
  207. })
  208. }
  209. const idxObj = buffer.indexOf('obj')
  210. if (idxObj > 100) {
  211. throw new OError('objectId is too large', {
  212. object,
  213. idxObj,
  214. })
  215. }
  216. const objectIdRaw = buffer.subarray(0, idxObj)
  217. buffer = buffer.subarray(objectIdRaw.byteLength)
  218. const hash = pdfStreamHash(buffer)
  219. checkDeadline('after hash ' + idx)
  220. const range = {
  221. objectId: objectIdRaw.toString(),
  222. start: object.offset + objectIdRaw.byteLength,
  223. end: object.endOffset,
  224. hash,
  225. }
  226. if (tracker.has(range.hash)) {
  227. // Optimization: Skip writing of already seen hashes.
  228. tracker.track(range)
  229. contentRanges.push(range)
  230. continue
  231. }
  232. await writePdfStream(contentDir, hash, buffer)
  233. tracker.track(range)
  234. contentRanges.push(range)
  235. newContentRanges.push(range)
  236. checkDeadline('after write ' + idx)
  237. }
  238. } catch (err) {
  239. if (err instanceof TimedOutError) {
  240. // Let the frontend use ranges that were processed so far.
  241. timedOutErr = err
  242. } else {
  243. throw err
  244. }
  245. } finally {
  246. await handle.close()
  247. // Flush from both success and failure code path. This allows the next
  248. // cycle to complete faster as it can use the already written ranges.
  249. await tracker.flush()
  250. }
  251. return {
  252. contentRanges,
  253. newContentRanges,
  254. reclaimedSpace,
  255. startXRefTable,
  256. overheadDeleteStaleHashes,
  257. timedOutErr,
  258. }
  259. }
  260. function getStatePath(contentDir) {
  261. return Path.join(contentDir, '.state.v0.json')
  262. }
  263. class HashFileTracker {
  264. constructor(contentDir, { hashAge = [], hashSize = [] }) {
  265. this.contentDir = contentDir
  266. this.hashAge = new Map(hashAge)
  267. this.hashSize = new Map(hashSize)
  268. }
  269. static async from(contentDir) {
  270. const statePath = getStatePath(contentDir)
  271. let state = {}
  272. try {
  273. const blob = await fs.promises.readFile(statePath)
  274. state = JSON.parse(blob)
  275. } catch (e) {}
  276. return new HashFileTracker(contentDir, state)
  277. }
  278. has(hash) {
  279. return this.hashAge.has(hash)
  280. }
  281. track(range) {
  282. if (!this.hashSize.has(range.hash)) {
  283. this.hashSize.set(range.hash, range.end - range.start)
  284. }
  285. this.hashAge.set(range.hash, 0)
  286. }
  287. updateAge() {
  288. for (const [hash, age] of this.hashAge) {
  289. this.hashAge.set(hash, age + 1)
  290. }
  291. return this
  292. }
  293. findStale(maxAge) {
  294. const stale = []
  295. for (const [hash, age] of this.hashAge) {
  296. if (age > maxAge) {
  297. stale.push(hash)
  298. }
  299. }
  300. return stale
  301. }
  302. async flush() {
  303. const statePath = getStatePath(this.contentDir)
  304. const blob = JSON.stringify({
  305. hashAge: Array.from(this.hashAge.entries()),
  306. hashSize: Array.from(this.hashSize.entries()),
  307. })
  308. const atomicWrite = statePath + '~'
  309. try {
  310. await fs.promises.writeFile(atomicWrite, blob)
  311. } catch (err) {
  312. try {
  313. await fs.promises.unlink(atomicWrite)
  314. } catch (e) {}
  315. throw err
  316. }
  317. try {
  318. await fs.promises.rename(atomicWrite, statePath)
  319. } catch (err) {
  320. try {
  321. await fs.promises.unlink(atomicWrite)
  322. } catch (e) {}
  323. throw err
  324. }
  325. }
  326. async deleteStaleHashes(n) {
  327. const t0 = Date.now()
  328. // delete any hash file older than N generations
  329. const hashes = this.findStale(n)
  330. let reclaimedSpace = 0
  331. if (hashes.length === 0) {
  332. return [reclaimedSpace, Date.now() - t0]
  333. }
  334. await promiseMapWithLimit(10, hashes, async hash => {
  335. try {
  336. await fs.promises.unlink(Path.join(this.contentDir, hash))
  337. } catch (err) {
  338. if (err?.code === 'ENOENT') {
  339. // Ignore already deleted entries. The previous cleanup cycle may have
  340. // been killed halfway through the deletion process, or before we
  341. // flushed the state to disk.
  342. } else {
  343. throw err
  344. }
  345. }
  346. this.hashAge.delete(hash)
  347. reclaimedSpace += this.hashSize.get(hash)
  348. this.hashSize.delete(hash)
  349. })
  350. return [reclaimedSpace, Date.now() - t0]
  351. }
  352. }
  353. function pdfStreamHash(buffer) {
  354. const hash = crypto.createHash('sha256')
  355. hash.update(buffer)
  356. return hash.digest('hex')
  357. }
  358. async function writePdfStream(dir, hash, buffer) {
  359. const filename = Path.join(dir, hash)
  360. const atomicWriteFilename = filename + '~'
  361. try {
  362. await fs.promises.writeFile(atomicWriteFilename, buffer)
  363. await fs.promises.rename(atomicWriteFilename, filename)
  364. } catch (err) {
  365. try {
  366. await fs.promises.unlink(atomicWriteFilename)
  367. } catch (_) {
  368. throw err
  369. }
  370. }
  371. }
  372. function getMaxOverhead(compileTime) {
  373. return Math.min(
  374. // Adding 10s to a 40s compile time is OK.
  375. // Adding 1s to a 3s compile time is OK.
  376. Math.max(compileTime / 4, 1000),
  377. // Adding 30s to a 120s compile time is not OK, limit to 10s.
  378. Settings.pdfCachingMaxProcessingTime
  379. )
  380. }
  381. function getDeadlineChecker(compileTime) {
  382. const timeout = getMaxOverhead(compileTime)
  383. const deadline = Date.now() + timeout
  384. let lastStage = { stage: 'start', now: Date.now() }
  385. let completedStages = 0
  386. return function (stage) {
  387. const now = Date.now()
  388. if (now > deadline) {
  389. throw new TimedOutError(stage, {
  390. timeout,
  391. completedStages,
  392. lastStage: lastStage.stage,
  393. diffToLastStage: now - lastStage.now,
  394. })
  395. }
  396. completedStages++
  397. lastStage = { stage, now }
  398. }
  399. }
  400. function promiseMapWithLimit(concurrency, array, fn) {
  401. const limit = pLimit(concurrency)
  402. return Promise.all(array.map(x => limit(() => fn(x))))
  403. }
  404. export default {
  405. HASH_REGEX: /^[0-9a-f]{64}$/,
  406. update: callbackify(update),
  407. promises: {
  408. update,
  409. updateSameEventLoop,
  410. },
  411. }