Update the |X86ISA|::|G| field of a code-segment-descriptor-attributesbits bit structure.
(!code-segment-descriptor-attributesbits->g g x) → new-x
Function:
(defun !code-segment-descriptor-attributesbits->g$inline (g x) (declare (xargs :guard (and (bitp g) (code-segment-descriptor-attributesbits-p x)))) (mbe :logic (b* ((g (mbe :logic (bfix g) :exec g)) (x (code-segment-descriptor-attributesbits-fix x))) (part-install g x :width 1 :low 11)) :exec (the (unsigned-byte 16) (logior (the (unsigned-byte 16) (logand (the (unsigned-byte 16) x) (the (signed-byte 13) -2049))) (the (unsigned-byte 12) (ash (the (unsigned-byte 1) g) 11))))))
Theorem:
(defthm code-segment-descriptor-attributesbits-p-of-!code-segment-descriptor-attributesbits->g (b* ((new-x (!code-segment-descriptor-attributesbits->g$inline g x))) (code-segment-descriptor-attributesbits-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm !code-segment-descriptor-attributesbits->g$inline-of-bfix-g (equal (!code-segment-descriptor-attributesbits->g$inline (bfix g) x) (!code-segment-descriptor-attributesbits->g$inline g x)))
Theorem:
(defthm !code-segment-descriptor-attributesbits->g$inline-bit-equiv-congruence-on-g (implies (bit-equiv g g-equiv) (equal (!code-segment-descriptor-attributesbits->g$inline g x) (!code-segment-descriptor-attributesbits->g$inline g-equiv x))) :rule-classes :congruence)
Theorem:
(defthm !code-segment-descriptor-attributesbits->g$inline-of-code-segment-descriptor-attributesbits-fix-x (equal (!code-segment-descriptor-attributesbits->g$inline g (code-segment-descriptor-attributesbits-fix x)) (!code-segment-descriptor-attributesbits->g$inline g x)))
Theorem:
(defthm !code-segment-descriptor-attributesbits->g$inline-code-segment-descriptor-attributesbits-equiv-congruence-on-x (implies (code-segment-descriptor-attributesbits-equiv x x-equiv) (equal (!code-segment-descriptor-attributesbits->g$inline g x) (!code-segment-descriptor-attributesbits->g$inline g x-equiv))) :rule-classes :congruence)
Theorem:
(defthm !code-segment-descriptor-attributesbits->g-is-code-segment-descriptor-attributesbits (equal (!code-segment-descriptor-attributesbits->g g x) (change-code-segment-descriptor-attributesbits x :g g)))
Theorem:
(defthm code-segment-descriptor-attributesbits->g-of-!code-segment-descriptor-attributesbits->g (b* ((?new-x (!code-segment-descriptor-attributesbits->g$inline g x))) (equal (code-segment-descriptor-attributesbits->g new-x) (bfix g))))
Theorem:
(defthm !code-segment-descriptor-attributesbits->g-equiv-under-mask (b* ((?new-x (!code-segment-descriptor-attributesbits->g$inline g x))) (code-segment-descriptor-attributesbits-equiv-under-mask new-x x -2049)))