(vl-ss-find-range name ss) → (mv successp maybe-range)
Function:
(defun vl-ss-find-range (name ss) (declare (xargs :guard (and (stringp name) (vl-scopestack-p ss)))) (let ((__function__ 'vl-ss-find-range)) (declare (ignorable __function__)) (b* ((find (vl-scopestack-find-item name ss)) ((unless (and find (eq (tag find) :vl-vardecl) (vl-simplevar-p find))) (mv nil nil))) (mv t (vl-simplevar->range find)))))
Theorem:
(defthm vl-maybe-range-p-of-vl-ss-find-range.maybe-range (b* (((mv ?successp ?maybe-range) (vl-ss-find-range name ss))) (vl-maybe-range-p maybe-range)) :rule-classes :rewrite)
Theorem:
(defthm vl-range-p-of-vl-ss-find-range (b* (((mv ?successp ?maybe-range) (vl-ss-find-range name ss))) (iff (vl-range-p maybe-range) maybe-range)) :rule-classes :rewrite)
Theorem:
(defthm vl-ss-find-range-of-str-fix-name (equal (vl-ss-find-range (str-fix name) ss) (vl-ss-find-range name ss)))
Theorem:
(defthm vl-ss-find-range-streqv-congruence-on-name (implies (streqv name name-equiv) (equal (vl-ss-find-range name ss) (vl-ss-find-range name-equiv ss))) :rule-classes :congruence)
Theorem:
(defthm vl-ss-find-range-of-vl-scopestack-fix-ss (equal (vl-ss-find-range name (vl-scopestack-fix ss)) (vl-ss-find-range name ss)))
Theorem:
(defthm vl-ss-find-range-vl-scopestack-equiv-congruence-on-ss (implies (vl-scopestack-equiv ss ss-equiv) (equal (vl-ss-find-range name ss) (vl-ss-find-range name ss-equiv))) :rule-classes :congruence)