Skip to content
DenseChip
Learn
PracticeCode labInterview

DenseChip

Navigate

Menu

LearnPracticeCode labInterview

Tools

All toolsSV editorCode repoResume
DenseChip

Practice, courses, and chip-design tools in one focused workspace.

LearnPracticeCode labInterviewToolsLearning paths

© 2026 DenseChip

AboutContactPrivacyTerms
Skip to lesson

Course contents

  • Logic Synthesis Glossary
  • Logic Synthesis Cheatsheet
  • Synthesis Foundations14
  • Logic Optimisation and Mapping20
  • Constraints and Timing15
  • Sequential, FSM and Memory19
  • Datapath Synthesis14
  • Area, Power and Test14
  • Verification, ECO and Handoff15
    • Equivalence Checking
    • Incremental Compile and ECO
      • Re-run or Patch
      • Logic Cone Isolation
      • ECO Netlist Edits
      • Hierarchy and dont_touch
      • Equivalence and QoR Regression
    • Physical-Aware Synthesis and Handoff
  • Flows and Debugging15
  • Interview and Judgment11
Loading lesson

‹Incremental Compile and ECO
  1. Topics
  2. Logic Synthesis
  3. Verification, ECO and Handoff
  4. Incremental Compile and ECO
  5. Re-run or Patch

Part 7 · Verification, ECO and Handoff · Intermediate

Re-run or Patch

When a late change needs a full re-run and when a small ECO patch is enough.

On this page

    Three ways to absorb a change

    A full re-run repeats synthesis and optimisation for the whole design. Incremental compile repeats it for the affected cone only, and an ECO patch edits the netlist directly.

    The three differ in scope and cost. The table below fixes the vocabulary used in this topic.

    Method

    Scope

    Typical cost

    Use when

    Full re-run

    Whole design re-synthesised

    Highest

    The change escapes one cone, or spare cells are exhausted.

    Incremental compile

    Affected cone re-optimised

    Middle

    RTL edits are local but need fresh optimisation.

    ECO patch

    Named cells rewired in place

    Lowest

    A late change fits one cone and spare cells remain.

    A worked decision

    Times below are stated EXAMPLE parameters, not tool defaults. They compare one late change handled each way.

    Diagram
    EXAMPLE parameters (not tool defaults): full re-run 6 h, incremental compile 1.5 h, ECO patch with proof 0.5 h
    one late change as ECO: 0.5 h against 6 h for a full re-run, saving 6 - 0.5 = 5.5 h
    three late changes as ECO: 3 x 0.5 h = 1.5 h against 6 h, saving 6 - 1.5 = 4.5 h
    rule used here: patch while the change fits one cone and spares remain, else re-run

    Common mistakes

    Common pitfall

    Patching a change that reaches past the selected cone leaves endpoints un-updated. The missed loads keep stale logic, and the failure shows up far from the edit.

    Interview

    Likely probes: choosing between the three paths.

    • Cost order is ECO patch, then incremental compile, then full re-run.

    • The cone test decides: one cone fits a patch, many cones need a re-run.

    • The spare test decides late changes: no spares means no patch.

    Check yourself A late functional change touches outputs in two disjoint cones, and each cone has spares. Does one ECO patch fit?

    No. One patch covers one cone, so this change needs two patches or a re-run, each followed by proof.

    Check yourself An ECO patch is quicker than a re-run. Why is the proof step not optional?

    Speed changes nothing about correctness. Without re-proof the patched netlist is unverified.

    Related topics

    • Logic Cone Isolation

    • Equivalence Checking

    Previous

    104 / 139

    Next: Logic Cone Isolation

    Up next

    Up nextLogic Cone Isolation

    Sign in to save progress

    Practice this lessonReport an error

    See also

    • ECO Netlist Edits
    • Hierarchy and dont_touch
    • Equivalence and QoR Regression