• 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
        • Name-database
          • Vl-namedb
          • Vl-namedb-plain-name
          • Vl-namedb-pset-fix
          • Vl-namedb-plain-names
          • Vl-namedb-indexed-name
          • Vl-namedb-pmap-fix
          • Vl-unlike-any-prefix-p
          • Vl-namedb-pmap-okp
          • Vl-namedb-allnames
          • Vl-starting-namedb
          • Vl-pgenstr-highest
          • Vl-namedb-pset-okp
          • Vl-pgenstr-p
          • Vl-pgenstr->val
          • Vl-free-namedb
          • Vl-namedb-plain-name-quiet
          • Vl-pgenstr-highest-of-alist-keys
          • Vl-pgenstr
          • Vl-empty-namedb
          • Vl-namedb-nameset
          • Vl-unlike-any-prefix-p-of-alist-keys
          • Vl-namedb-prefixmap
        • Vl-gc
        • Make-lookup-alist
        • Symbol-list-names
        • Html-encoding
        • Nats-from
        • Redundant-mergesort
        • Longest-common-prefix
        • Vl-edition-p
        • Nat-listp
        • Vl-plural-p
        • Vl-remove-keys
        • Sum-nats
        • Vl-maybe-nat-listp
        • Url-encoding
        • Fast-memberp
        • Vl-string-keys-p
        • Max-nats
        • Longest-common-prefix-list
        • Character-list-listp
        • Vl-string-list-values-p
        • Vl-character-list-list-values-p
        • Remove-from-alist
        • Prefix-of-eachp
        • Vl-maybe-string-listp
        • Pos-listp
        • Vl-string-values-p
        • String-list-listp
        • True-list-listp
        • Symbol-list-listp
        • Explode-list
        • All-have-len
        • Min-nats
        • Debuggable-and
        • Vl-starname
        • Remove-equal-without-guard
        • String-fix
        • Longer-than-p
        • Clean-alist
        • Anyp
        • Or*
        • Fast-alist-free-each-alist-val
        • And*
        • Not*
        • Free-list-of-fast-alists
        • *nls*
      • Loader
      • Transforms
      • Lint
      • Mlib
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Vwsim
    • Fgl
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Name-database

Vl-namedb-indexed-name

(vl-namedb-indexed-name prefix db) constructs a fresh name that looks like prefix_n for some natural number n.

Signature

(vl-namedb-indexed-name prefix db) → (mv fresh-name new-db)

Arguments

prefix — Guard (stringp prefix).

db — Guard (vl-namedb-p db).

Definitions and Theorems

Function: vl-namedb-indexed-name

(defun vl-namedb-indexed-name (prefix db)
  (declare (xargs :guard (and (stringp prefix)
                              (vl-namedb-p db))))
  (let ((__function__ 'vl-namedb-indexed-name))
    (declare (ignorable __function__))
    (b* ((prefix (string-fix prefix))
         (names (vl-namedb->names db))
         (pmap (vl-namedb->pmap db))
         (pset (vl-namedb->pset db))
         (lookup (hons-get prefix pmap))
         (maxidx (if lookup (cdr lookup)
                   (vl-pgenstr-highest-of-alist-keys prefix names)))
         (newidx (+ maxidx 1))
         (newname (vl-pgenstr prefix newidx))
         (names (hons-acons newname t names))
         (pmap (hons-acons prefix newidx pmap))
         (pset (if lookup pset
                 (hons-acons prefix t pset)))
         (db (change-vl-namedb db
                               :names names
                               :pmap pmap
                               :pset pset)))
      (mv newname db))))

Theorem: stringp-of-vl-namedb-indexed-name

(defthm stringp-of-vl-namedb-indexed-name
  (stringp (mv-nth 0 (vl-namedb-indexed-name prefix db)))
  :rule-classes :type-prescription)

Theorem: vl-namedb-p-of-vl-namedb-indexed-name

(defthm vl-namedb-p-of-vl-namedb-indexed-name
  (vl-namedb-p (mv-nth 1 (vl-namedb-indexed-name prefix db))))

Theorem: vl-namedb-allnames-of-vl-namedb-indexed-name

(defthm vl-namedb-allnames-of-vl-namedb-indexed-name
 (equal
  (vl-namedb-allnames (mv-nth 1 (vl-namedb-indexed-name prefix db)))
  (cons (mv-nth 0 (vl-namedb-indexed-name prefix db))
        (vl-namedb-allnames db))))

Theorem: vl-namedb->names-of-vl-namedb-indexed-name

(defthm vl-namedb->names-of-vl-namedb-indexed-name
  (vl-namedb->names (mv-nth 1 (vl-namedb-indexed-name prefix db))))

Theorem: vl-namedb-indexed-name-is-fresh

(defthm vl-namedb-indexed-name-is-fresh
  (b* (((mv fresh-name ?new-db)
        (vl-namedb-indexed-name prefix db)))
    (not (member-equal fresh-name (vl-namedb-allnames db)))))

Theorem: vl-namedb-indexed-name-of-str-fix-prefix

(defthm vl-namedb-indexed-name-of-str-fix-prefix
  (equal (vl-namedb-indexed-name (str-fix prefix)
                                 db)
         (vl-namedb-indexed-name prefix db)))

Theorem: vl-namedb-indexed-name-streqv-congruence-on-prefix

(defthm vl-namedb-indexed-name-streqv-congruence-on-prefix
  (implies (streqv prefix prefix-equiv)
           (equal (vl-namedb-indexed-name prefix db)
                  (vl-namedb-indexed-name prefix-equiv db)))
  :rule-classes :congruence)

Theorem: vl-namedb-indexed-name-of-vl-namedb-fix-db

(defthm vl-namedb-indexed-name-of-vl-namedb-fix-db
  (equal (vl-namedb-indexed-name prefix (vl-namedb-fix db))
         (vl-namedb-indexed-name prefix db)))

Theorem: vl-namedb-indexed-name-vl-namedb-equiv-congruence-on-db

(defthm vl-namedb-indexed-name-vl-namedb-equiv-congruence-on-db
  (implies (vl-namedb-equiv db db-equiv)
           (equal (vl-namedb-indexed-name prefix db)
                  (vl-namedb-indexed-name prefix db-equiv)))
  :rule-classes :congruence)