• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
    • Vwsim
    • Fgl
    • Vl
      • Syntax
      • Loader
      • Warnings
      • Getting-started
      • Utilities
      • Printer
      • Kit
      • Mlib
        • Scopestack
        • Hid-tools
        • Filtering-by-name
        • Vl-interface-mocktype
        • Stripping-functions
        • Genblob
        • Expr-tools
        • Extract-vl-types
        • Hierarchy
          • Vl-design-toplevel
          • Vl-remove-unnecessary-elements
          • Vl-necessary-elements-transitive
          • Vl-interfacelist-everinstanced
          • Vl-dependent-elements-transitive
          • Vl-necessary-elements-direct
          • Vl-modulelist-everinstanced
          • Vl-dependent-elements-direct
          • Vl-design-deporder-modules
          • Vl-design-check-complete
          • Vl-design-upgraph
          • Immdeps
            • Immdeps-main
            • Vl-immdeps
            • Immdeps-top
              • Vl-immdepgraph-merge
              • Vl-interface-immdeps*
              • Vl-module-immdeps*
              • Vl-paramdecllist-immdeps*
              • Vl-interfacelist-immdeps*
              • Vl-vardecllist-immdeps*
              • Vl-typedeflist-immdeps*
              • Vl-taskdecllist-immdeps*
              • Vl-taskdecl-immdeps*
              • Vl-programlist-immdeps*
              • Vl-paramdecl-immdeps*
              • Vl-packagelist-immdeps*
              • Vl-package-immdeps*
              • Vl-fundecllist-immdeps*
              • Vl-vardecl-immdeps*
              • Vl-typedef-immdeps*
              • Vl-modulelist-immdeps*
              • Vl-fundecl-immdeps*
              • Vl-configlist-immdeps*
              • Vl-classlist-immdeps*
              • Vl-udplist-immdeps*
              • Vl-program-immdeps*
              • Vl-config-immdeps*
              • Vl-udp-immdeps*
              • Vl-design-immdeps
              • Vl-class-immdeps*
            • Vl-immdepgraph
            • Vl-depgraph
          • Vl-design-downgraph
          • Vl-collect-dependencies
          • Vl-hierarchy-free
        • Range-tools
        • Finding-by-name
        • Stmt-tools
        • Modnamespace
        • Flat-warnings
        • Reordering-by-name
        • Datatype-tools
        • Syscalls
        • Allexprs
        • Lvalues
        • Port-tools
      • Transforms
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Immdeps-top

Vl-design-immdeps

Construct the immediate dependency graph for a design.

Signature

(vl-design-immdeps x) → graph

Arguments

x — Guard (vl-design-p x).

Returns

graph — Type (vl-immdepgraph-p graph).

Note that this is a very expensive operation that has to crawl through the entire design and do many name lookups.

Definitions and Theorems

Function: vl-design-immdeps

(defun vl-design-immdeps (x)
 (declare (xargs :guard (vl-design-p x)))
 (let ((__function__ 'vl-design-immdeps))
  (declare (ignorable __function__))
  (b*
   (((vl-design x))
    (ss (vl-scopestack-init x))
    (graph
     (time$
         (b* ((graph (make-vl-immdepgraph))
              (graph (vl-modulelist-immdeps* x.mods graph))
              (graph (vl-udplist-immdeps* x.udps graph))
              (graph (vl-interfacelist-immdeps* x.interfaces graph))
              (graph (vl-programlist-immdeps* x.programs graph))
              (graph (vl-classlist-immdeps* x.classes graph))
              (graph (vl-packagelist-immdeps* x.packages graph))
              (graph (vl-configlist-immdeps* x.configs graph))
              (graph (vl-vardecllist-immdeps* x.vardecls graph))
              (graph (vl-taskdecllist-immdeps* x.taskdecls graph))
              (graph (vl-fundecllist-immdeps* x.fundecls graph))
              (graph (vl-paramdecllist-immdeps* x.paramdecls graph))
              (graph (vl-typedeflist-immdeps* x.typedefs graph)))
           graph)
         :msg "; vl-design-immdeps crawl: ~st sec, ~sa bytes.~%"
         :mintime 1/2))
    (- (vl-scopestacks-free))
    ((vl-immdepgraph graph))
    (-
     (or
       (uniquep (alist-keys graph.deps))
       (raise "Design elements are not unique?  Name clash for ~&0."
              (duplicated-members (alist-keys graph.deps)))))
    (final-deps
       (time$ (depgraph::mergesort-alist-values graph.deps)
              :msg "; vl-design-immdeps sort: ~st sec, ~sa bytes.~%"
              :mintime 1/2)))
   (change-vl-immdepgraph graph
                          :deps final-deps))))

Theorem: vl-immdepgraph-p-of-vl-design-immdeps

(defthm vl-immdepgraph-p-of-vl-design-immdeps
  (b* ((graph (vl-design-immdeps x)))
    (vl-immdepgraph-p graph))
  :rule-classes :rewrite)

Theorem: alist-values-are-sets-p-of-vl-design-immdeps

(defthm alist-values-are-sets-p-of-vl-design-immdeps
  (b* (((vl-immdepgraph graph)
        (vl-design-immdeps x)))
    (depgraph::alist-values-are-sets-p graph.deps)))

Theorem: vl-design-immdeps-of-vl-design-fix-x

(defthm vl-design-immdeps-of-vl-design-fix-x
  (equal (vl-design-immdeps (vl-design-fix x))
         (vl-design-immdeps x)))

Theorem: vl-design-immdeps-vl-design-equiv-congruence-on-x

(defthm vl-design-immdeps-vl-design-equiv-congruence-on-x
  (implies (vl-design-equiv x x-equiv)
           (equal (vl-design-immdeps x)
                  (vl-design-immdeps x-equiv)))
  :rule-classes :congruence)