• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
      • Warnings
      • Primitives
      • Use-set
      • Syntax
      • Getting-started
      • Utilities
      • Loader
      • Transforms
        • Expression-sizing
        • Occform
        • Oprewrite
        • Expand-functions
        • Delayredux
        • Unparameterization
        • Caseelim
        • Split
        • Selresolve
        • Weirdint-elim
        • Vl-delta
        • Replicate-insts
        • Rangeresolve
        • Propagate
        • Clean-selects
        • Clean-params
        • Blankargs
        • Inline-mods
        • Expr-simp
        • Trunc
        • Always-top
        • Gatesplit
        • Gate-elim
        • Expression-optimization
          • Vl-modulelist-optimize
          • Vl-op-optimize
          • Vl-expr-optimize
            • Vl-exprlist-optimize
          • Vl-plainarglist-optimize
          • Vl-namedarglist-optimize
          • Vl-gateinstlist-optimize
          • Vl-modinstlist-optimize
          • Vl-assignlist-optimize
          • Vl-arguments-optimize
          • Vl-plainarg-optimize
          • Vl-namedarg-optimize
          • Vl-gateinst-optimize
          • Vl-assign-optimize
          • Vl-modinst-optimize
          • Vl-module-optimize
          • Vl-design-optimize
        • Elim-supplies
        • Wildelim
        • Drop-blankports
        • Clean-warnings
        • Addinstnames
        • Custom-transform-hooks
        • Annotate
        • Latchcode
        • Elim-unused-vars
        • Problem-modules
      • Lint
      • Mlib
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Fgl
    • Vwsim
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Expression-optimization

Vl-expr-optimize

Optimize sub-expressions throughout an expression.

Signature

(vl-expr-optimize x ss) → (mv changedp new-x)

Arguments

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

ss — Guard (vl-scopestack-p ss).

Returns

changedp — Type (booleanp changedp).

new-x — Type (vl-expr-p new-x).

The use of changedp is only to avoid re-consing expressions that aren't being optimized.

Theorem: return-type-of-vl-expr-optimize.changedp

(defthm return-type-of-vl-expr-optimize.changedp
  (b* (((mv ?changedp ?new-x)
        (vl-expr-optimize x ss)))
    (booleanp changedp))
  :rule-classes :type-prescription)

Theorem: return-type-of-vl-expr-optimize.new-x

(defthm return-type-of-vl-expr-optimize.new-x
  (b* (((mv ?changedp ?new-x)
        (vl-expr-optimize x ss)))
    (vl-expr-p new-x))
  :rule-classes :rewrite)

Theorem: return-type-of-vl-exprlist-optimize.changedp

(defthm return-type-of-vl-exprlist-optimize.changedp
  (b* (((mv ?changedp ?new-x)
        (vl-exprlist-optimize x ss)))
    (booleanp changedp))
  :rule-classes :type-prescription)

Theorem: return-type-of-vl-exprlist-optimize.new-x

(defthm return-type-of-vl-exprlist-optimize.new-x
  (b* (((mv ?changedp ?new-x)
        (vl-exprlist-optimize x ss)))
    (and (vl-exprlist-p new-x)
         (equal (len new-x) (len x))))
  :rule-classes :rewrite)

Theorem: vl-expr-optimize-of-vl-expr-fix-x

(defthm vl-expr-optimize-of-vl-expr-fix-x
  (equal (vl-expr-optimize (vl-expr-fix x) ss)
         (vl-expr-optimize x ss)))

Theorem: vl-expr-optimize-of-vl-scopestack-fix-ss

(defthm vl-expr-optimize-of-vl-scopestack-fix-ss
  (equal (vl-expr-optimize x (vl-scopestack-fix ss))
         (vl-expr-optimize x ss)))

Theorem: vl-exprlist-optimize-of-vl-exprlist-fix-x

(defthm vl-exprlist-optimize-of-vl-exprlist-fix-x
  (equal (vl-exprlist-optimize (vl-exprlist-fix x)
                               ss)
         (vl-exprlist-optimize x ss)))

Theorem: vl-exprlist-optimize-of-vl-scopestack-fix-ss

(defthm vl-exprlist-optimize-of-vl-scopestack-fix-ss
  (equal (vl-exprlist-optimize x (vl-scopestack-fix ss))
         (vl-exprlist-optimize x ss)))

Theorem: vl-expr-optimize-vl-expr-equiv-congruence-on-x

(defthm vl-expr-optimize-vl-expr-equiv-congruence-on-x
  (implies (vl-expr-equiv x x-equiv)
           (equal (vl-expr-optimize x ss)
                  (vl-expr-optimize x-equiv ss)))
  :rule-classes :congruence)

Theorem: vl-expr-optimize-vl-scopestack-equiv-congruence-on-ss

(defthm vl-expr-optimize-vl-scopestack-equiv-congruence-on-ss
  (implies (vl-scopestack-equiv ss ss-equiv)
           (equal (vl-expr-optimize x ss)
                  (vl-expr-optimize x ss-equiv)))
  :rule-classes :congruence)

Theorem: vl-exprlist-optimize-vl-exprlist-equiv-congruence-on-x

(defthm vl-exprlist-optimize-vl-exprlist-equiv-congruence-on-x
  (implies (vl-exprlist-equiv x x-equiv)
           (equal (vl-exprlist-optimize x ss)
                  (vl-exprlist-optimize x-equiv ss)))
  :rule-classes :congruence)

Theorem: vl-exprlist-optimize-vl-scopestack-equiv-congruence-on-ss

(defthm vl-exprlist-optimize-vl-scopestack-equiv-congruence-on-ss
  (implies (vl-scopestack-equiv ss ss-equiv)
           (equal (vl-exprlist-optimize x ss)
                  (vl-exprlist-optimize x ss-equiv)))
  :rule-classes :congruence)

Subtopics

Vl-exprlist-optimize