ContentCacheManager.js 11 KB

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