RemoveParentModulesPlugin.js 2.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
  1. /*
  2. MIT License http://www.opensource.org/licenses/mit-license.php
  3. Author Tobias Koppers @sokra
  4. */
  5. "use strict";
  6. function chunkContainsModule(chunk, module) {
  7. const chunks = module.chunks;
  8. const modules = chunk.modules;
  9. if(chunks.length < modules.length) {
  10. return chunks.indexOf(chunk) >= 0;
  11. } else {
  12. return modules.indexOf(module) >= 0;
  13. }
  14. }
  15. function hasModule(chunk, module, checkedChunks) {
  16. if(chunkContainsModule(chunk, module)) return [chunk];
  17. if(chunk.parents.length === 0) return false;
  18. return allHaveModule(chunk.parents.filter((c) => {
  19. return checkedChunks.indexOf(c) < 0;
  20. }), module, checkedChunks);
  21. }
  22. function allHaveModule(someChunks, module, checkedChunks) {
  23. if(!checkedChunks) checkedChunks = [];
  24. var chunks = [];
  25. for(var i = 0; i < someChunks.length; i++) {
  26. checkedChunks.push(someChunks[i]);
  27. var subChunks = hasModule(someChunks[i], module, checkedChunks);
  28. if(!subChunks) return false;
  29. for(var index = 0; index < subChunks.length; index++) {
  30. var item = subChunks[index];
  31. if(!chunks.length || chunks.indexOf(item) < 0) {
  32. chunks.push(item);
  33. }
  34. }
  35. }
  36. return chunks;
  37. }
  38. function debugIds(chunks) {
  39. var list = [];
  40. for(var i = 0; i < chunks.length; i++) {
  41. var debugId = chunks[i].debugId;
  42. if(typeof debugId !== "number") {
  43. return "no";
  44. }
  45. list.push(debugId);
  46. }
  47. list.sort();
  48. return list.join(",");
  49. }
  50. class RemoveParentModulesPlugin {
  51. apply(compiler) {
  52. compiler.plugin("compilation", (compilation) => {
  53. compilation.plugin(["optimize-chunks-basic", "optimize-extracted-chunks-basic"], (chunks) => {
  54. for(var index = 0; index < chunks.length; index++) {
  55. var chunk = chunks[index];
  56. if(chunk.parents.length === 0) continue;
  57. // TODO consider Map when performance has improved https://gist.github.com/sokra/b36098368da7b8f6792fd7c85fca6311
  58. var cache = Object.create(null);
  59. var modules = chunk.modules.slice();
  60. for(var i = 0; i < modules.length; i++) {
  61. var module = modules[i];
  62. var dId = debugIds(module.chunks);
  63. var parentChunksWithModule;
  64. if((dId in cache) && dId !== "no") {
  65. parentChunksWithModule = cache[dId];
  66. } else {
  67. parentChunksWithModule = cache[dId] = allHaveModule(chunk.parents, module);
  68. }
  69. if(parentChunksWithModule) {
  70. module.rewriteChunkInReasons(chunk, parentChunksWithModule);
  71. chunk.removeModule(module);
  72. }
  73. }
  74. }
  75. });
  76. });
  77. }
  78. }
  79. module.exports = RemoveParentModulesPlugin;