Extend an alist by binding the names of vl-modinsts to their definitions.
(vl-modinstlist-alist x acc) → alist
This can be used as an alternative to vl-find-modinst when you need to perform a lot of lookups.
Function:
(defun vl-modinstlist-alist (x acc) (declare (xargs :guard (vl-modinstlist-p x))) (let ((__function__ 'vl-modinstlist-alist)) (declare (ignorable __function__)) (b* (((when (atom x)) acc) (name (hons-copy (vl-modinst->instname (car x)))) ((when (stringp name)) (cons (cons name (vl-modinst-fix (car x))) (vl-modinstlist-alist (cdr x) acc)))) (vl-modinstlist-alist (cdr x) acc))))
Theorem:
(defthm return-type-of-vl-modinstlist-alist (b* ((alist (vl-modinstlist-alist x acc))) (equal (vl-modinst-alist-p alist) (vl-modinst-alist-p acc))) :rule-classes :rewrite)
Theorem:
(defthm lookup-in-vl-modinstlist-alist-acc-elim (implies (syntaxp (not (equal acc ''nil))) (equal (hons-assoc-equal name (vl-modinstlist-alist x acc)) (or (hons-assoc-equal name (vl-modinstlist-alist x nil)) (hons-assoc-equal name acc)))))
Theorem:
(defthm lookup-in-vl-modinstlist-alist-fast (implies (stringp name) (equal (hons-assoc-equal name (vl-modinstlist-alist x nil)) (let ((val (vl-find-modinst name x))) (and val (cons name val))))))
Theorem:
(defthm vl-modinstlist-alist-of-vl-modinstlist-fix-x (equal (vl-modinstlist-alist (vl-modinstlist-fix x) acc) (vl-modinstlist-alist x acc)))
Theorem:
(defthm vl-modinstlist-alist-vl-modinstlist-equiv-congruence-on-x (implies (vl-modinstlist-equiv x x-equiv) (equal (vl-modinstlist-alist x acc) (vl-modinstlist-alist x-equiv acc))) :rule-classes :congruence)