broccoli-rollup/src/rollup-helper.ts

A broccoli plugin that uses rollup.js on its input

import { InputOptions, OutputOptions, rollup, RollupCache } from 'rollup';
import Dependencies from './dependencies';
import { heimdall } from './heimdall';
import {
  Operation,
  syncFiles,
  Tree,
  treeFromEntries,
  treeFromPath,
} from './utils';

export default class RollupHelper {
  private dependencies: Dependencies;
  private digests = new Map<string, string>();
  private lastBuildStale = true;
  private lastBuildTree = undefined as Tree | undefined;
  private cache = undefined as RollupCache | undefined;
  private lastOutputTree = undefined as Tree | undefined;

  constructor(
    public inputPath: string,
    public buildPath: string,
    public outputPath: string,
    public inputOptions: InputOptions,
    public outputOptions: OutputOptions[],
    public shouldCache: boolean,
  ) {
    this.dependencies = new Dependencies(buildPath);
  }

  public async build() {
    const inputTree = this.syncInput();

    // no changes
    if (inputTree === undefined) {
      return;
    }

    const originalWorkingDir = process.cwd();
    try {
      process.chdir(this.buildPath);

      const outputTree = await this.rollup(inputTree);
      this.syncOutput(outputTree);
    } finally {
      process.chdir(originalWorkingDir);
    }
  }

  private syncInput(): Tree | undefined {
    const token = heimdall.start('syncInput');
    try {
      const inputPath = this.inputPath;
      const buildPath = this.buildPath;

      const inputTree = treeFromPath(inputPath);

      const lastBuildTree = this.lastBuildTree;

      let inputChanges: Operation[] | undefined;
      if (lastBuildTree !== undefined) {
        inputChanges = lastBuildTree.calculatePatch(inputTree);

        if (!this.dependencies.shouldBuild(inputChanges)) {
          return;
        }
      }

      if (inputChanges === undefined || this.lastBuildStale) {
        // need to use current state of buildPath
        inputChanges = treeFromPath(buildPath).calculatePatch(inputTree);
      }

      syncFiles(inputPath, buildPath, inputChanges);

      return inputTree;
    } finally {
      token.stop();
    }
  }

  private async rollup(inputTree: Tree) {
    const token = heimdall.start('rollup');
    try {
      const options = this.inputOptions;
      options.cache = this.cache;

      const build = await rollup(options);

      if (this.shouldCache) {
        this.cache = build.cache;
      }

      for (const outputOptions of this.outputOptions) {
        await build.write(outputOptions);
      }

      const buildTree = treeFromPath(this.buildPath);
      const outputTree = calculateOutputTree(inputTree, buildTree);

      // used to check input on next build
      this.dependencies.add(build);
      this.lastBuildTree = buildTree;
      this.lastBuildStale = false;

      return outputTree;
    } catch (e) {
      this.lastBuildStale = true;
      throw e;
    } finally {
      token.stop();
    }
  }

  private syncOutput(outputTree: Tree) {
    const token = heimdall.start('syncOutput');
    try {
      let lastOutputTree = this.lastOutputTree;
      if (lastOutputTree === undefined) {
        lastOutputTree = treeFromPath(this.outputPath);
      }
      const outputChanges = lastOutputTree.calculatePatch(outputTree);
      syncFiles(this.buildPath, this.outputPath, outputChanges, this.digests);
      this.lastOutputTree = outputTree;
    } catch (e) {
      this.lastOutputTree = undefined;
      throw e;
    } finally {
      token.stop();
    }
  }
}

function calculateOutputTree(inputTree: Tree, buildTree: Tree): Tree {
  const buildDiff = inputTree.calculatePatch(buildTree);
  const outputEntries = buildDiff
    .filter(change => change[0] === 'create')
    .map(change => change[2]!);

  return treeFromEntries(outputEntries, {
    sortAndExpand: true,
  });
}