Method placeNodes

deps/v8/tools/turbolizer/src/graph-layout.ts:192–229

(rankSets: Array<Array<GraphNode>>, showTypes: boolean)

  }

  private placeNodes(rankSets: Array<Array<GraphNode>>, showTypes: boolean): void {
    // Iterate backwards from highest to lowest rank, placing nodes so that they
    // spread out from the "center" as much as possible while still being
    // compact and not overlapping live input lines.
    rankSets.reverse().forEach((rankSet: Array<GraphNode>) => {
      for (const node of rankSet) {
        this.layoutOccupation.clearOutputs(node, showTypes);
      }

      this.traceOccupation("After clearing outputs");

      let placedCount = 0;
      rankSet = rankSet.sort((a: GraphNode, b: GraphNode) => a.compare(b));
      for (const node of rankSet) {
        if (node.visible) {
          node.x = this.layoutOccupation.occupy(node);
          this.trace(`Node ${node.id} is placed between [${node.x}, ${node.x + node.getWidth()})`);
          const staggeredFlooredI = Math.floor(placedCount++ % 3);
          const delta = C.MINIMUM_EDGE_SEPARATION * staggeredFlooredI;
          node.outputApproach += delta;
        } else {
          node.x = 0;
        }
      }

      this.traceOccupation("Before clearing nodes");

      this.layoutOccupation.clearOccupied();

      this.traceOccupation("After clearing nodes");

      for (const node of rankSet) {
        this.layoutOccupation.occupyInputs(node, showTypes);
      }

      this.traceOccupation("After occupying inputs and determining bounding box");
    });
  }

  private calculateBackEdgeNumbers(): void {
    this.graph.maxBackEdgeNumber = 0;