"use strict"; /*--------------------------------------------------------------------------------------------- * Copyright (c) Microsoft Corporation. All rights reserved. * Licensed under the MIT License. See License.txt in the project root for license information. *--------------------------------------------------------------------------------------------*/ Object.defineProperty(exports, "__esModule", { value: true }); exports.bundle = void 0; const fs = require("fs"); const path = require("path"); const vm = require("vm"); /** * Bundle `entryPoints` given config `config`. */ function bundle(entryPoints, config, callback) { const entryPointsMap = {}; entryPoints.forEach((module) => { if (entryPointsMap[module.name]) { throw new Error(`Cannot have two entry points with the same name '${module.name}'`); } entryPointsMap[module.name] = module; }); const allMentionedModulesMap = {}; entryPoints.forEach((module) => { allMentionedModulesMap[module.name] = true; module.include?.forEach(function (includedModule) { allMentionedModulesMap[includedModule] = true; }); module.exclude?.forEach(function (excludedModule) { allMentionedModulesMap[excludedModule] = true; }); }); const code = require('fs').readFileSync(path.join(__dirname, '../../src/vs/loader.js')); const r = vm.runInThisContext('(function(require, module, exports) { ' + code + '\n});'); const loaderModule = { exports: {} }; r.call({}, require, loaderModule, loaderModule.exports); const loader = loaderModule.exports; config.isBuild = true; config.paths = config.paths || {}; if (!config.paths['vs/nls']) { config.paths['vs/nls'] = 'out-build/vs/nls.build'; } if (!config.paths['vs/css']) { config.paths['vs/css'] = 'out-build/vs/css.build'; } loader.config(config); loader(['require'], (localRequire) => { const resolvePath = (path) => { const r = localRequire.toUrl(path); if (!/\.js/.test(r)) { return r + '.js'; } return r; }; for (const moduleId in entryPointsMap) { const entryPoint = entryPointsMap[moduleId]; if (entryPoint.append) { entryPoint.append = entryPoint.append.map(resolvePath); } if (entryPoint.prepend) { entryPoint.prepend = entryPoint.prepend.map(resolvePath); } } }); loader(Object.keys(allMentionedModulesMap), () => { const modules = loader.getBuildInfo(); const partialResult = emitEntryPoints(modules, entryPointsMap); const cssInlinedResources = loader('vs/css').getInlinedResources(); callback(null, { files: partialResult.files, cssInlinedResources: cssInlinedResources, bundleData: partialResult.bundleData }); }, (err) => callback(err, null)); } exports.bundle = bundle; function emitEntryPoints(modules, entryPoints) { const modulesMap = {}; modules.forEach((m) => { modulesMap[m.id] = m; }); const modulesGraph = {}; modules.forEach((m) => { modulesGraph[m.id] = m.dependencies; }); const sortedModules = topologicalSort(modulesGraph); let result = []; const usedPlugins = {}; const bundleData = { graph: modulesGraph, bundles: {} }; Object.keys(entryPoints).forEach((moduleToBundle) => { const info = entryPoints[moduleToBundle]; const rootNodes = [moduleToBundle].concat(info.include || []); const allDependencies = visit(rootNodes, modulesGraph); const excludes = ['require', 'exports', 'module'].concat(info.exclude || []); excludes.forEach((excludeRoot) => { const allExcludes = visit([excludeRoot], modulesGraph); Object.keys(allExcludes).forEach((exclude) => { delete allDependencies[exclude]; }); }); const includedModules = sortedModules.filter((module) => { return allDependencies[module]; }); bundleData.bundles[moduleToBundle] = includedModules; const res = emitEntryPoint(modulesMap, modulesGraph, moduleToBundle, includedModules, info.prepend || [], info.append || [], info.dest); result = result.concat(res.files); for (const pluginName in res.usedPlugins) { usedPlugins[pluginName] = usedPlugins[pluginName] || res.usedPlugins[pluginName]; } }); Object.keys(usedPlugins).forEach((pluginName) => { const plugin = usedPlugins[pluginName]; if (typeof plugin.finishBuild === 'function') { const write = (filename, contents) => { result.push({ dest: filename, sources: [{ path: null, contents: contents }] }); }; plugin.finishBuild(write); } }); return { // TODO@TS 2.1.2 files: extractStrings(removeDuplicateTSBoilerplate(result)), bundleData: bundleData }; } function extractStrings(destFiles) { const parseDefineCall = (moduleMatch, depsMatch) => { const module = moduleMatch.replace(/^"|"$/g, ''); let deps = depsMatch.split(','); deps = deps.map((dep) => { dep = dep.trim(); dep = dep.replace(/^"|"$/g, ''); dep = dep.replace(/^'|'$/g, ''); let prefix = null; let _path = null; const pieces = dep.split('!'); if (pieces.length > 1) { prefix = pieces[0] + '!'; _path = pieces[1]; } else { prefix = ''; _path = pieces[0]; } if (/^\.\//.test(_path) || /^\.\.\//.test(_path)) { const res = path.join(path.dirname(module), _path).replace(/\\/g, '/'); return prefix + res; } return prefix + _path; }); return { module: module, deps: deps }; }; destFiles.forEach((destFile) => { if (!/\.js$/.test(destFile.dest)) { return; } if (/\.nls\.js$/.test(destFile.dest)) { return; } // Do one pass to record the usage counts for each module id const useCounts = {}; destFile.sources.forEach((source) => { const matches = source.contents.match(/define\(("[^"]+"),\s*\[(((, )?("|')[^"']+("|'))+)\]/); if (!matches) { return; } const defineCall = parseDefineCall(matches[1], matches[2]); useCounts[defineCall.module] = (useCounts[defineCall.module] || 0) + 1; defineCall.deps.forEach((dep) => { useCounts[dep] = (useCounts[dep] || 0) + 1; }); }); const sortedByUseModules = Object.keys(useCounts); sortedByUseModules.sort((a, b) => { return useCounts[b] - useCounts[a]; }); const replacementMap = {}; sortedByUseModules.forEach((module, index) => { replacementMap[module] = index; }); destFile.sources.forEach((source) => { source.contents = source.contents.replace(/define\(("[^"]+"),\s*\[(((, )?("|')[^"']+("|'))+)\]/, (_, moduleMatch, depsMatch) => { const defineCall = parseDefineCall(moduleMatch, depsMatch); return `define(__m[${replacementMap[defineCall.module]}/*${defineCall.module}*/], __M([${defineCall.deps.map(dep => replacementMap[dep] + '/*' + dep + '*/').join(',')}])`; }); }); destFile.sources.unshift({ path: null, contents: [ '(function() {', `var __m = ${JSON.stringify(sortedByUseModules)};`, `var __M = function(deps) {`, ` var result = [];`, ` for (var i = 0, len = deps.length; i < len; i++) {`, ` result[i] = __m[deps[i]];`, ` }`, ` return result;`, `};` ].join('\n') }); destFile.sources.push({ path: null, contents: '}).call(this);' }); }); return destFiles; } function removeDuplicateTSBoilerplate(destFiles) { // Taken from typescript compiler => emitFiles const BOILERPLATE = [ { start: /^var __extends/, end: /^}\)\(\);$/ }, { start: /^var __assign/, end: /^};$/ }, { start: /^var __decorate/, end: /^};$/ }, { start: /^var __metadata/, end: /^};$/ }, { start: /^var __param/, end: /^};$/ }, { start: /^var __awaiter/, end: /^};$/ }, { start: /^var __generator/, end: /^};$/ }, ]; destFiles.forEach((destFile) => { const SEEN_BOILERPLATE = []; destFile.sources.forEach((source) => { const lines = source.contents.split(/\r\n|\n|\r/); const newLines = []; let IS_REMOVING_BOILERPLATE = false, END_BOILERPLATE; for (let i = 0; i < lines.length; i++) { const line = lines[i]; if (IS_REMOVING_BOILERPLATE) { newLines.push(''); if (END_BOILERPLATE.test(line)) { IS_REMOVING_BOILERPLATE = false; } } else { for (let j = 0; j < BOILERPLATE.length; j++) { const boilerplate = BOILERPLATE[j]; if (boilerplate.start.test(line)) { if (SEEN_BOILERPLATE[j]) { IS_REMOVING_BOILERPLATE = true; END_BOILERPLATE = boilerplate.end; } else { SEEN_BOILERPLATE[j] = true; } } } if (IS_REMOVING_BOILERPLATE) { newLines.push(''); } else { newLines.push(line); } } } source.contents = newLines.join('\n'); }); }); return destFiles; } function emitEntryPoint(modulesMap, deps, entryPoint, includedModules, prepend, append, dest) { if (!dest) { dest = entryPoint + '.js'; } const mainResult = { sources: [], dest: dest }, results = [mainResult]; const usedPlugins = {}; const getLoaderPlugin = (pluginName) => { if (!usedPlugins[pluginName]) { usedPlugins[pluginName] = modulesMap[pluginName].exports; } return usedPlugins[pluginName]; }; includedModules.forEach((c) => { const bangIndex = c.indexOf('!'); if (bangIndex >= 0) { const pluginName = c.substr(0, bangIndex); const plugin = getLoaderPlugin(pluginName); mainResult.sources.push(emitPlugin(entryPoint, plugin, pluginName, c.substr(bangIndex + 1))); return; } const module = modulesMap[c]; if (module.path === 'empty:') { return; } const contents = readFileAndRemoveBOM(module.path); if (module.shim) { mainResult.sources.push(emitShimmedModule(c, deps[c], module.shim, module.path, contents)); } else if (module.defineLocation) { mainResult.sources.push(emitNamedModule(c, module.defineLocation, module.path, contents)); } else { const moduleCopy = { id: module.id, path: module.path, defineLocation: module.defineLocation, dependencies: module.dependencies }; throw new Error(`Cannot bundle module '${module.id}' for entry point '${entryPoint}' because it has no shim and it lacks a defineLocation: ${JSON.stringify(moduleCopy)}`); } }); Object.keys(usedPlugins).forEach((pluginName) => { const plugin = usedPlugins[pluginName]; if (typeof plugin.writeFile === 'function') { const req = (() => { throw new Error('no-no!'); }); req.toUrl = something => something; const write = (filename, contents) => { results.push({ dest: filename, sources: [{ path: null, contents: contents }] }); }; plugin.writeFile(pluginName, entryPoint, req, write, {}); } }); const toIFile = (path) => { const contents = readFileAndRemoveBOM(path); return { path: path, contents: contents }; }; const toPrepend = (prepend || []).map(toIFile); const toAppend = (append || []).map(toIFile); mainResult.sources = toPrepend.concat(mainResult.sources).concat(toAppend); return { files: results, usedPlugins: usedPlugins }; } function readFileAndRemoveBOM(path) { const BOM_CHAR_CODE = 65279; let contents = fs.readFileSync(path, 'utf8'); // Remove BOM if (contents.charCodeAt(0) === BOM_CHAR_CODE) { contents = contents.substring(1); } return contents; } function emitPlugin(entryPoint, plugin, pluginName, moduleName) { let result = ''; if (typeof plugin.write === 'function') { const write = ((what) => { result += what; }); write.getEntryPoint = () => { return entryPoint; }; write.asModule = (moduleId, code) => { code = code.replace(/^define\(/, 'define("' + moduleId + '",'); result += code; }; plugin.write(pluginName, moduleName, write); } return { path: null, contents: result }; } function emitNamedModule(moduleId, defineCallPosition, path, contents) { // `defineCallPosition` is the position in code: |define() const defineCallOffset = positionToOffset(contents, defineCallPosition.line, defineCallPosition.col); // `parensOffset` is the position in code: define|() const parensOffset = contents.indexOf('(', defineCallOffset); const insertStr = '"' + moduleId + '", '; return { path: path, contents: contents.substr(0, parensOffset + 1) + insertStr + contents.substr(parensOffset + 1) }; } function emitShimmedModule(moduleId, myDeps, factory, path, contents) { const strDeps = (myDeps.length > 0 ? '"' + myDeps.join('", "') + '"' : ''); const strDefine = 'define("' + moduleId + '", [' + strDeps + '], ' + factory + ');'; return { path: path, contents: contents + '\n;\n' + strDefine }; } /** * Convert a position (line:col) to (offset) in string `str` */ function positionToOffset(str, desiredLine, desiredCol) { if (desiredLine === 1) { return desiredCol - 1; } let line = 1; let lastNewLineOffset = -1; do { if (desiredLine === line) { return lastNewLineOffset + 1 + desiredCol - 1; } lastNewLineOffset = str.indexOf('\n', lastNewLineOffset + 1); line++; } while (lastNewLineOffset >= 0); return -1; } /** * Return a set of reachable nodes in `graph` starting from `rootNodes` */ function visit(rootNodes, graph) { const result = {}; const queue = rootNodes; rootNodes.forEach((node) => { result[node] = true; }); while (queue.length > 0) { const el = queue.shift(); const myEdges = graph[el] || []; myEdges.forEach((toNode) => { if (!result[toNode]) { result[toNode] = true; queue.push(toNode); } }); } return result; } /** * Perform a topological sort on `graph` */ function topologicalSort(graph) { const allNodes = {}, outgoingEdgeCount = {}, inverseEdges = {}; Object.keys(graph).forEach((fromNode) => { allNodes[fromNode] = true; outgoingEdgeCount[fromNode] = graph[fromNode].length; graph[fromNode].forEach((toNode) => { allNodes[toNode] = true; outgoingEdgeCount[toNode] = outgoingEdgeCount[toNode] || 0; inverseEdges[toNode] = inverseEdges[toNode] || []; inverseEdges[toNode].push(fromNode); }); }); // https://en.wikipedia.org/wiki/Topological_sorting const S = [], L = []; Object.keys(allNodes).forEach((node) => { if (outgoingEdgeCount[node] === 0) { delete outgoingEdgeCount[node]; S.push(node); } }); while (S.length > 0) { // Ensure the exact same order all the time with the same inputs S.sort(); const n = S.shift(); L.push(n); const myInverseEdges = inverseEdges[n] || []; myInverseEdges.forEach((m) => { outgoingEdgeCount[m]--; if (outgoingEdgeCount[m] === 0) { delete outgoingEdgeCount[m]; S.push(m); } }); } if (Object.keys(outgoingEdgeCount).length > 0) { throw new Error('Cannot do topological sort on cyclic graph, remaining nodes: ' + Object.keys(outgoingEdgeCount)); } return L; }