![]() | ![]() |
  |
![]() ![]() ![]() Next: VIS-V: Verification Up: No Title Previous: VIS
VIS-F: Front EndVIS-F is the front end. It provides an in-memory representation of BLIF-MV. This hierarchical representation can be traversed and manipulated. VIS-F consists of the following packages:
When a BLIF-MV file is parsed, a directed acyclic graph of models is created by the io package, corresponding to the hierarchy given in the file. The DAG is then transformed by io into a tree by creating separate nodes for each instantiation of a model. Traversal and manipulation of the hierarchy takes place on the tree, and not the DAG, using routines provided by hrc. The Hrc_Node_t data structure provides a lookup table for applications (e.g., VIS-V and VIS-S) to store data associated with a node in the hierarchy. In this manner, VIS-F can remain independent of VIS-V and VIS-S.
Tom Shiple Fri May 10 17:12:12 PDT 1996 |
Contact |
©2002-2018 U.C. Regents |