webpack/lib/optimize/MinChunkSizePlugin.js

95 lines
2.9 KiB
JavaScript
Raw Normal View History

2013-02-11 17:52:19 +08:00
/*
MIT License http://www.opensource.org/licenses/mit-license.php
Author Tobias Koppers @sokra
*/
2018-07-30 23:08:51 +08:00
"use strict";
const validateOptions = require("schema-utils");
const schema = require("../../schemas/plugins/optimize/MinChunkSizePlugin.json");
const { STAGE_ADVANCED } = require("../OptimizationStages");
2017-10-28 05:23:38 +08:00
/** @typedef {import("../Chunk")} Chunk */
/** @typedef {import("../Compiler")} Compiler */
class MinChunkSizePlugin {
constructor(options) {
validateOptions(schema, options, "Min Chunk Size Plugin");
this.options = options;
}
2013-02-11 17:52:19 +08:00
/**
* @param {Compiler} compiler webpack compiler
* @returns {void}
*/
apply(compiler) {
const options = this.options;
const minChunkSize = options.minChunkSize;
2018-02-25 09:00:20 +08:00
compiler.hooks.compilation.tap("MinChunkSizePlugin", compilation => {
compilation.hooks.optimizeChunks.tap(
/** @type {TODO} */ ({
name: "MinChunkSizePlugin",
stage: STAGE_ADVANCED
}),
2018-02-25 09:00:20 +08:00
chunks => {
const chunkGraph = compilation.chunkGraph;
2018-02-25 09:00:20 +08:00
const equalOptions = {
chunkOverhead: 1,
entryChunkMultiplicator: 1
};
2013-06-18 00:55:11 +08:00
2018-02-25 09:00:20 +08:00
const sortedSizeFilteredExtendedPairCombinations = chunks
.reduce((/** @type {[Chunk, Chunk][]} */ combinations, a, idx) => {
2018-02-25 09:00:20 +08:00
// create combination pairs
for (let i = 0; i < idx; i++) {
const b = chunks[i];
combinations.push([b, a]);
}
return combinations;
}, [])
.filter(pair => {
// check if one of the chunks sizes is smaller than the minChunkSize
const p0SmallerThanMinChunkSize =
chunkGraph.getChunkSize(pair[0], equalOptions) < minChunkSize;
2018-02-25 09:00:20 +08:00
const p1SmallerThanMinChunkSize =
chunkGraph.getChunkSize(pair[1], equalOptions) < minChunkSize;
if (!p0SmallerThanMinChunkSize && !p1SmallerThanMinChunkSize)
return false;
// filter pairs that can NOT be integrated!
return chunkGraph.canChunksBeIntegrated(pair[0], pair[1]);
2018-02-25 09:00:20 +08:00
})
.map(pair => {
// extend combination pairs with size and integrated size
const a = chunkGraph.getChunkSize(pair[0], options);
const b = chunkGraph.getChunkSize(pair[1], options);
const ab = chunkGraph.getIntegratedChunksSize(
pair[0],
pair[1],
options
);
/** @type {[number, number, Chunk, Chunk]} */
const extendedPair = [a + b - ab, ab, pair[0], pair[1]];
return extendedPair;
2018-02-25 09:00:20 +08:00
})
.sort((a, b) => {
// sadly javascript does an inplace sort here
// sort by size
const diff = b[0] - a[0];
if (diff !== 0) return diff;
return a[1] - b[1];
});
2013-06-18 00:55:11 +08:00
2018-02-25 09:00:20 +08:00
if (sortedSizeFilteredExtendedPairCombinations.length === 0) return;
2018-02-25 09:00:20 +08:00
const pair = sortedSizeFilteredExtendedPairCombinations[0];
2013-06-18 00:55:11 +08:00
chunkGraph.integrateChunks(pair[2], pair[3]);
2018-02-25 09:00:20 +08:00
chunks.splice(chunks.indexOf(pair[3]), 1);
return true;
}
);
2013-02-11 17:52:19 +08:00
});
}
}
module.exports = MinChunkSizePlugin;