FlagIncludedChunksPlugin.js 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. /*
  2. MIT License http://www.opensource.org/licenses/mit-license.php
  3. Author Tobias Koppers @sokra
  4. */
  5. "use strict";
  6. const { compareIds } = require("../util/comparators");
  7. /** @typedef {import("../Chunk")} Chunk */
  8. /** @typedef {import("../Chunk").ChunkId} ChunkId */
  9. /** @typedef {import("../Compiler")} Compiler */
  10. /** @typedef {import("../Module")} Module */
  11. const PLUGIN_NAME = "FlagIncludedChunksPlugin";
  12. class FlagIncludedChunksPlugin {
  13. /**
  14. * Apply the plugin
  15. * @param {Compiler} compiler the compiler instance
  16. * @returns {void}
  17. */
  18. apply(compiler) {
  19. compiler.hooks.compilation.tap(PLUGIN_NAME, compilation => {
  20. compilation.hooks.optimizeChunkIds.tap(PLUGIN_NAME, chunks => {
  21. const chunkGraph = compilation.chunkGraph;
  22. // prepare two bit integers for each module
  23. // 2^31 is the max number represented as SMI in v8
  24. // we want the bits distributed this way:
  25. // the bit 2^31 is pretty rar and only one module should get it
  26. // so it has a probability of 1 / modulesCount
  27. // the first bit (2^0) is the easiest and every module could get it
  28. // if it doesn't get a better bit
  29. // from bit 2^n to 2^(n+1) there is a probability of p
  30. // so 1 / modulesCount == p^31
  31. // <=> p = sqrt31(1 / modulesCount)
  32. // so we use a modulo of 1 / sqrt31(1 / modulesCount)
  33. /** @type {WeakMap<Module, number>} */
  34. const moduleBits = new WeakMap();
  35. const modulesCount = compilation.modules.size;
  36. // precalculate the modulo values for each bit
  37. const modulo = 1 / (1 / modulesCount) ** (1 / 31);
  38. const modulos = Array.from({ length: 31 }, (x, i) => (modulo ** i) | 0);
  39. // iterate all modules to generate bit values
  40. let i = 0;
  41. for (const module of compilation.modules) {
  42. let bit = 30;
  43. while (i % modulos[bit] !== 0) {
  44. bit--;
  45. }
  46. moduleBits.set(module, 1 << bit);
  47. i++;
  48. }
  49. // iterate all chunks to generate bitmaps
  50. /** @type {WeakMap<Chunk, number>} */
  51. const chunkModulesHash = new WeakMap();
  52. for (const chunk of chunks) {
  53. let hash = 0;
  54. for (const module of chunkGraph.getChunkModulesIterable(chunk)) {
  55. hash |= /** @type {number} */ (moduleBits.get(module));
  56. }
  57. chunkModulesHash.set(chunk, hash);
  58. }
  59. for (const chunkA of chunks) {
  60. const chunkAHash =
  61. /** @type {number} */
  62. (chunkModulesHash.get(chunkA));
  63. const chunkAModulesCount = chunkGraph.getNumberOfChunkModules(chunkA);
  64. if (chunkAModulesCount === 0) continue;
  65. let bestModule;
  66. for (const module of chunkGraph.getChunkModulesIterable(chunkA)) {
  67. if (
  68. bestModule === undefined ||
  69. chunkGraph.getNumberOfModuleChunks(bestModule) >
  70. chunkGraph.getNumberOfModuleChunks(module)
  71. )
  72. bestModule = module;
  73. }
  74. loopB: for (const chunkB of chunkGraph.getModuleChunksIterable(
  75. /** @type {Module} */ (bestModule)
  76. )) {
  77. // as we iterate the same iterables twice
  78. // skip if we find ourselves
  79. if (chunkA === chunkB) continue;
  80. const chunkBModulesCount =
  81. chunkGraph.getNumberOfChunkModules(chunkB);
  82. // ids for empty chunks are not included
  83. if (chunkBModulesCount === 0) continue;
  84. // instead of swapping A and B just bail
  85. // as we loop twice the current A will be B and B then A
  86. if (chunkAModulesCount > chunkBModulesCount) continue;
  87. // is chunkA in chunkB?
  88. // we do a cheap check for the hash value
  89. const chunkBHash =
  90. /** @type {number} */
  91. (chunkModulesHash.get(chunkB));
  92. if ((chunkBHash & chunkAHash) !== chunkAHash) continue;
  93. // compare all modules
  94. for (const m of chunkGraph.getChunkModulesIterable(chunkA)) {
  95. if (!chunkGraph.isModuleInChunk(m, chunkB)) continue loopB;
  96. }
  97. /** @type {ChunkId[]} */
  98. (chunkB.ids).push(/** @type {ChunkId} */ (chunkA.id));
  99. // https://github.com/webpack/webpack/issues/18837
  100. /** @type {ChunkId[]} */
  101. (chunkB.ids).sort(compareIds);
  102. }
  103. }
  104. });
  105. });
  106. }
  107. }
  108. module.exports = FlagIncludedChunksPlugin;