Updating hierarchical DAG representations through a bottom up method
    1.
    发明授权
    Updating hierarchical DAG representations through a bottom up method 失效
    通过自下而上的方法更新分层DAG表示

    公开(公告)号:US5790416A

    公开(公告)日:1998-08-04

    申请号:US529772

    申请日:1995-09-18

    IPC分类号: G06F17/50 H01L21/70 H01L23/50

    CPC分类号: G06F17/5045 H01L2924/0002

    摘要: A process and implementing computer system (13) for updating circuit representations in a hierarchical Directed Acyclic Graph (DAG) format (400-410) based upon changes made to the primitive components of the circuit in a flat representation (201-213) includes performing a depth first search (505) on the hierarchical representation of the circuit beginning at the root level (501) for a given path. At each lower level, each child instance is visited (505) and if there is any change in any attribute between the hierarchical and flat representations (509), the component in the hierarchical representation which needs to be changed is copied (807) and connected to the children components of the original hierarchical representation. Changes in the attributes of the children components are made in the copied component (809). If the new component already exists in the hierarchy 811, then that component is deleted (817), otherwise the copied component is returned (813), and changes are passed upwardly to the root level (815) where the previous DAG may be replaced with the copied and updated DAG which includes changes in the attributes of components of a corresponding flat circuit representation.

    摘要翻译: 基于在平面表示(201-213)中对电路的原始分量进行的改变,用于以分级定向非循环图(DAG)格式(400-410)更新电路表示的处理和实现计算机系统(13)包括执行 关于从给定路径的根级(501)开始的电路的分层表示的深度第一搜索(505)。 在每个较低级别,每个子实例被访问(505),并且如果分层和平面表示(509)之间的任何属性有任何改变,则需要改变的分层表示中的组件被复制(807)并被连接 对原始分层表示的子组件。 在复制的组件(809)中进行子组件属性的更改。 如果新组件已经存在于层次结构811中,那么该组件被删除(817),否则返回复制的组件(813),并将更改向上传递到根级别(815),其中先前的DAG可以被替换为 复制和更新的DAG,其包括对应平面电路表示的组件的属性的改变。