Update the |X86ISA|::|VIF| field of a rflagsbits bit structure.
(!rflagsbits->vif vif x) → new-x
Function:
(defun !rflagsbits->vif$inline (vif x) (declare (xargs :guard (and (bitp vif) (rflagsbits-p x)))) (mbe :logic (b* ((vif (mbe :logic (bfix vif) :exec vif)) (x (rflagsbits-fix x))) (part-install vif x :width 1 :low 19)) :exec (the (unsigned-byte 32) (logior (the (unsigned-byte 32) (logand (the (unsigned-byte 32) x) (the (signed-byte 21) -524289))) (the (unsigned-byte 20) (ash (the (unsigned-byte 1) vif) 19))))))
Theorem:
(defthm rflagsbits-p-of-!rflagsbits->vif (b* ((new-x (!rflagsbits->vif$inline vif x))) (rflagsbits-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm !rflagsbits->vif$inline-of-bfix-vif (equal (!rflagsbits->vif$inline (bfix vif) x) (!rflagsbits->vif$inline vif x)))
Theorem:
(defthm !rflagsbits->vif$inline-bit-equiv-congruence-on-vif (implies (bit-equiv vif vif-equiv) (equal (!rflagsbits->vif$inline vif x) (!rflagsbits->vif$inline vif-equiv x))) :rule-classes :congruence)
Theorem:
(defthm !rflagsbits->vif$inline-of-rflagsbits-fix-x (equal (!rflagsbits->vif$inline vif (rflagsbits-fix x)) (!rflagsbits->vif$inline vif x)))
Theorem:
(defthm !rflagsbits->vif$inline-rflagsbits-equiv-congruence-on-x (implies (rflagsbits-equiv x x-equiv) (equal (!rflagsbits->vif$inline vif x) (!rflagsbits->vif$inline vif x-equiv))) :rule-classes :congruence)
Theorem:
(defthm !rflagsbits->vif-is-rflagsbits (equal (!rflagsbits->vif vif x) (change-rflagsbits x :vif vif)))
Theorem:
(defthm rflagsbits->vif-of-!rflagsbits->vif (b* ((?new-x (!rflagsbits->vif$inline vif x))) (equal (rflagsbits->vif new-x) (bfix vif))))
Theorem:
(defthm !rflagsbits->vif-equiv-under-mask (b* ((?new-x (!rflagsbits->vif$inline vif x))) (rflagsbits-equiv-under-mask new-x x -524289)))