• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Debugging
  • Projects
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
      • Warnings
      • Primitives
      • Use-set
      • Syntax
      • Getting-started
      • Utilities
      • Loader
      • Transforms
      • Lint
      • Mlib
        • Scopestack
        • Filtering-by-name
        • Vl-namefactory
        • Substitution
        • Allexprs
        • Hid-tools
        • Vl-consteval
        • Range-tools
        • Lvalexprs
        • Hierarchy
        • Finding-by-name
        • Expr-tools
        • Expr-slicing
        • Stripping-functions
        • Stmt-tools
        • Modnamespace
          • Vl-find-moduleitem
          • Vl-make-moditem-alist
          • Vl-module->modnamespace
          • Vl-moditem
          • Vl-fast-find-moduleitem
          • Vl-moditem-alist
          • Vl-moditemlist
        • Vl-parse-expr-from-str
        • Welltyped
        • Reordering-by-name
        • Flat-warnings
        • Genblob
        • Expr-building
        • Datatype-tools
        • Syscalls
        • Relocate
        • Expr-cleaning
        • Namemangle
        • Caremask
        • Port-tools
        • Lvalues
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Vwsim
    • Fgl
    • Vl
    • Svl
    • X86isa
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Modnamespace

Vl-make-moditem-alist

Legacy -- Use scopestack instead. Main routine for building an fast alist for looking up module items.

Signature

(vl-make-moditem-alist x) → *

Arguments

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

Note that the order the alist is constructed in is particularly important: we want it to agree, completely, with the naive vl-find-moduleitem. The alist can be constructed in a one pass, using our fast-finding-by-name functions.

Definitions and Theorems

Function: vl-make-moditem-alist

(defun vl-make-moditem-alist (x)
  (declare (xargs :guard (vl-module-p x)))
  (let ((__function__ 'vl-make-moditem-alist))
    (declare (ignorable __function__))
    (b* (((vl-module x) x)
         (acc (vl-gateinstlist-alist x.gateinsts nil))
         (acc (vl-modinstlist-alist x.modinsts acc))
         (acc (vl-taskdecllist-alist x.taskdecls acc))
         (acc (vl-fundecllist-alist x.fundecls acc))
         (acc (vl-paramdecllist-alist x.paramdecls acc))
         (acc (vl-vardecllist-alist x.vardecls acc)))
      (make-fast-alist acc))))

Theorem: vl-moditem-alist-p-of-vl-make-moditem-alist

(defthm vl-moditem-alist-p-of-vl-make-moditem-alist
  (vl-moditem-alist-p (vl-make-moditem-alist x)))

Theorem: hons-assoc-equal-of-vl-make-moditem-alist

(defthm hons-assoc-equal-of-vl-make-moditem-alist
  (implies (force (stringp name))
           (equal (hons-assoc-equal name (vl-make-moditem-alist x))
                  (if (vl-find-moduleitem name x)
                      (cons name (vl-find-moduleitem name x))
                    nil))))

Theorem: vl-make-moditem-alist-of-vl-module-fix-x

(defthm vl-make-moditem-alist-of-vl-module-fix-x
  (equal (vl-make-moditem-alist (vl-module-fix x))
         (vl-make-moditem-alist x)))

Theorem: vl-make-moditem-alist-vl-module-equiv-congruence-on-x

(defthm vl-make-moditem-alist-vl-module-equiv-congruence-on-x
  (implies (vl-module-equiv x x-equiv)
           (equal (vl-make-moditem-alist x)
                  (vl-make-moditem-alist x-equiv)))
  :rule-classes :congruence)