(vl-pp-gatedelay x &key (ps 'ps)) → ps
Function:
(defun vl-pp-gatedelay-fn (x ps) (declare (xargs :stobjs (ps))) (declare (xargs :guard (vl-gatedelay-p x))) (let ((__function__ 'vl-pp-gatedelay)) (declare (ignorable __function__)) (b* (((vl-gatedelay x) x)) (cond ((and (hide (equal x.rise x.fall)) (hide (equal x.fall x.high)) (vl-expr-resolved-p x.rise) (<= 0 (vl-resolved->val x.rise))) (vl-ps-seq (vl-print "#") (vl-ps-span "vl_int" (vl-print-nat (vl-resolved->val x.rise))))) ((and (hide (equal x.rise x.fall)) (hide (equal x.fall x.high))) (vl-ps-seq (vl-print "#(") (vl-pp-expr x.rise) (vl-print ")"))) (x.high (vl-ps-seq (vl-print "#(") (vl-pp-expr x.rise) (vl-println? ", ") (vl-pp-expr x.fall) (vl-println? ", ") (vl-pp-expr x.high) (vl-println? ")"))) (t (vl-ps-seq (vl-print "#(") (vl-pp-expr x.rise) (vl-println? ", ") (vl-pp-expr x.fall) (vl-println? ")")))))))
Theorem:
(defthm vl-pp-gatedelay-fn-of-vl-gatedelay-fix-x (equal (vl-pp-gatedelay-fn (vl-gatedelay-fix x) ps) (vl-pp-gatedelay-fn x ps)))
Theorem:
(defthm vl-pp-gatedelay-fn-vl-gatedelay-equiv-congruence-on-x (implies (vl-gatedelay-equiv x x-equiv) (equal (vl-pp-gatedelay-fn x ps) (vl-pp-gatedelay-fn x-equiv ps))) :rule-classes :congruence)