• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Community
  • 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
          • Vl-replicated-instnames
            • Vl-bad-replicate-names
            • Vl-preferred-replicate-names
          • Vl-modulelist-replicate
          • Argument-partitioning
          • Vl-replicate-gateinst
          • Vl-replicate-gateinstlist
          • Vl-module-port-widths
          • Vl-replicate-modinst
          • Vl-replicate-arguments
          • Vl-replicate-orig-instnames
          • Vl-assemble-modinsts
          • Vl-module-replicate
          • Vl-replicate-modinstlist
          • Vl-modinst-origname/idx
          • Vl-modinst-origname
          • Vl-gateinst-origname/idx
          • Vl-gateinst-origname
          • Vl-gateinst-origidx
          • Vl-modinst-origidx
          • Vl-design-replicate
          • Vl-some-modinst-array-p
          • Vl-some-gateinst-array-p
        • Rangeresolve
        • Propagate
        • Clean-selects
        • Clean-params
        • Blankargs
        • Inline-mods
        • Expr-simp
        • Trunc
        • Always-top
        • Gatesplit
        • Gate-elim
        • Expression-optimization
        • 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

• Vl-replicated-instnames

Vl-bad-replicate-names

Fallback names in case our preferred names aren't available. Only called if there is a name conflict that prevents us from using good names.

Signature

(vl-bad-replicate-names n basename nf) → (mv names nf)

Arguments

n — Guard (natp n).

basename — Guard (stringp basename).

nf — Guard (vl-namefactory-p nf).

Returns

names — Type (string-listp names).

nf — Type (vl-namefactory-p nf).

Definitions and Theorems

Function: vl-bad-replicate-names

(defun vl-bad-replicate-names (n basename nf)
  (declare (xargs :guard (and (natp n)
                              (stringp basename)
                              (vl-namefactory-p nf))))
  (let ((__function__ 'vl-bad-replicate-names))
    (declare (ignorable __function__))
    (b* (((when (zp n))
          (mv nil (vl-namefactory-fix nf)))
         ((mv name nf)
          (vl-namefactory-indexed-name basename nf))
         ((mv others nf)
          (vl-bad-replicate-names (- n 1)
                                  basename nf)))
      (mv (cons name others) nf))))

Theorem: string-listp-of-vl-bad-replicate-names.names

(defthm string-listp-of-vl-bad-replicate-names.names
  (b* (((mv ?names ?nf)
        (vl-bad-replicate-names n basename nf)))
    (string-listp names))
  :rule-classes :rewrite)

Theorem: vl-namefactory-p-of-vl-bad-replicate-names.nf

(defthm vl-namefactory-p-of-vl-bad-replicate-names.nf
  (b* (((mv ?names ?nf)
        (vl-bad-replicate-names n basename nf)))
    (vl-namefactory-p nf))
  :rule-classes :rewrite)

Theorem: len-of-vl-bad-replicate-names

(defthm len-of-vl-bad-replicate-names
  (equal (len (mv-nth 0
                      (vl-bad-replicate-names n basename nf)))
         (nfix n)))

Theorem: vl-bad-replicate-names-of-nfix-n

(defthm vl-bad-replicate-names-of-nfix-n
  (equal (vl-bad-replicate-names (nfix n)
                                 basename nf)
         (vl-bad-replicate-names n basename nf)))

Theorem: vl-bad-replicate-names-nat-equiv-congruence-on-n

(defthm vl-bad-replicate-names-nat-equiv-congruence-on-n
  (implies (acl2::nat-equiv n n-equiv)
           (equal (vl-bad-replicate-names n basename nf)
                  (vl-bad-replicate-names n-equiv basename nf)))
  :rule-classes :congruence)

Theorem: vl-bad-replicate-names-of-str-fix-basename

(defthm vl-bad-replicate-names-of-str-fix-basename
  (equal (vl-bad-replicate-names n (str-fix basename)
                                 nf)
         (vl-bad-replicate-names n basename nf)))

Theorem: vl-bad-replicate-names-streqv-congruence-on-basename

(defthm vl-bad-replicate-names-streqv-congruence-on-basename
  (implies (streqv basename basename-equiv)
           (equal (vl-bad-replicate-names n basename nf)
                  (vl-bad-replicate-names n basename-equiv nf)))
  :rule-classes :congruence)

Theorem: vl-bad-replicate-names-of-vl-namefactory-fix-nf

(defthm vl-bad-replicate-names-of-vl-namefactory-fix-nf
  (equal (vl-bad-replicate-names n basename (vl-namefactory-fix nf))
         (vl-bad-replicate-names n basename nf)))

Theorem: vl-bad-replicate-names-vl-namefactory-equiv-congruence-on-nf

(defthm vl-bad-replicate-names-vl-namefactory-equiv-congruence-on-nf
  (implies (vl-namefactory-equiv nf nf-equiv)
           (equal (vl-bad-replicate-names n basename nf)
                  (vl-bad-replicate-names n basename nf-equiv)))
  :rule-classes :congruence)