Update the |X86ISA|::|UNKNOWNBITS| field of a call-gate-descriptor-attributesbits bit structure.
(!call-gate-descriptor-attributesbits->unknownbits unknownbits x) → new-x
Function:
(defun !call-gate-descriptor-attributesbits->unknownbits$inline (unknownbits x) (declare (xargs :guard (and (8bits-p unknownbits) (call-gate-descriptor-attributesbits-p x)))) (mbe :logic (b* ((unknownbits (mbe :logic (8bits-fix unknownbits) :exec unknownbits)) (x (call-gate-descriptor-attributesbits-fix x))) (part-install unknownbits x :width 8 :low 8)) :exec (the (unsigned-byte 16) (logior (the (unsigned-byte 16) (logand (the (unsigned-byte 16) x) (the (signed-byte 17) -65281))) (the (unsigned-byte 16) (ash (the (unsigned-byte 8) unknownbits) 8))))))
Theorem:
(defthm call-gate-descriptor-attributesbits-p-of-!call-gate-descriptor-attributesbits->unknownbits (b* ((new-x (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits x))) (call-gate-descriptor-attributesbits-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm !call-gate-descriptor-attributesbits->unknownbits$inline-of-8bits-fix-unknownbits (equal (!call-gate-descriptor-attributesbits->unknownbits$inline (8bits-fix unknownbits) x) (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits x)))
Theorem:
(defthm !call-gate-descriptor-attributesbits->unknownbits$inline-8bits-equiv-congruence-on-unknownbits (implies (8bits-equiv unknownbits unknownbits-equiv) (equal (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits x) (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits-equiv x))) :rule-classes :congruence)
Theorem:
(defthm !call-gate-descriptor-attributesbits->unknownbits$inline-of-call-gate-descriptor-attributesbits-fix-x (equal (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits (call-gate-descriptor-attributesbits-fix x)) (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits x)))
Theorem:
(defthm !call-gate-descriptor-attributesbits->unknownbits$inline-call-gate-descriptor-attributesbits-equiv-congruence-on-x (implies (call-gate-descriptor-attributesbits-equiv x x-equiv) (equal (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits x) (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits x-equiv))) :rule-classes :congruence)
Theorem:
(defthm !call-gate-descriptor-attributesbits->unknownbits-is-call-gate-descriptor-attributesbits (equal (!call-gate-descriptor-attributesbits->unknownbits unknownbits x) (change-call-gate-descriptor-attributesbits x :unknownbits unknownbits)))
Theorem:
(defthm call-gate-descriptor-attributesbits->unknownbits-of-!call-gate-descriptor-attributesbits->unknownbits (b* ((?new-x (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits x))) (equal (call-gate-descriptor-attributesbits->unknownbits new-x) (8bits-fix unknownbits))))
Theorem:
(defthm !call-gate-descriptor-attributesbits->unknownbits-equiv-under-mask (b* ((?new-x (!call-gate-descriptor-attributesbits->unknownbits$inline unknownbits x))) (call-gate-descriptor-attributesbits-equiv-under-mask new-x x 255)))