(vl-pp-rhs x &key (ps 'ps)) → ps
Function:
(defun vl-pp-rhs-fn (x ps) (declare (xargs :stobjs (ps))) (declare (xargs :guard (vl-rhs-p x))) (let ((__function__ 'vl-pp-rhs)) (declare (ignorable __function__)) (vl-rhs-case x :vl-rhsexpr (vl-pp-expr x.guts) :vl-rhsnew (vl-ps-seq (vl-ps-span "vl_key" (vl-print-str "new ")) (if x.arrsize (vl-ps-seq (vl-print "[") (vl-pp-expr x.arrsize) (vl-print "]")) ps) (if (consp x.args) (vl-ps-seq (vl-print "(") (vl-pp-exprlist x.args) (vl-print ")")) ps)))))
Theorem:
(defthm vl-pp-rhs-fn-of-vl-rhs-fix-x (equal (vl-pp-rhs-fn (vl-rhs-fix x) ps) (vl-pp-rhs-fn x ps)))
Theorem:
(defthm vl-pp-rhs-fn-vl-rhs-equiv-congruence-on-x (implies (vl-rhs-equiv x x-equiv) (equal (vl-pp-rhs-fn x ps) (vl-pp-rhs-fn x-equiv ps))) :rule-classes :congruence)