Access the |X86ISA|::|DPL| field of a code-segment-descriptor-attributesbits bit structure.
(code-segment-descriptor-attributesbits->dpl x) → dpl
Function:
(defun code-segment-descriptor-attributesbits->dpl$inline (x) (declare (xargs :guard (code-segment-descriptor-attributesbits-p x))) (mbe :logic (let ((x (code-segment-descriptor-attributesbits-fix x))) (part-select x :low 5 :width 2)) :exec (the (unsigned-byte 2) (logand (the (unsigned-byte 2) 3) (the (unsigned-byte 11) (ash (the (unsigned-byte 16) x) -5))))))
Theorem:
(defthm 2bits-p-of-code-segment-descriptor-attributesbits->dpl (b* ((dpl (code-segment-descriptor-attributesbits->dpl$inline x))) (2bits-p dpl)) :rule-classes :rewrite)
Theorem:
(defthm code-segment-descriptor-attributesbits->dpl$inline-of-code-segment-descriptor-attributesbits-fix-x (equal (code-segment-descriptor-attributesbits->dpl$inline (code-segment-descriptor-attributesbits-fix x)) (code-segment-descriptor-attributesbits->dpl$inline x)))
Theorem:
(defthm code-segment-descriptor-attributesbits->dpl$inline-code-segment-descriptor-attributesbits-equiv-congruence-on-x (implies (code-segment-descriptor-attributesbits-equiv x x-equiv) (equal (code-segment-descriptor-attributesbits->dpl$inline x) (code-segment-descriptor-attributesbits->dpl$inline x-equiv))) :rule-classes :congruence)
Theorem:
(defthm code-segment-descriptor-attributesbits->dpl-of-code-segment-descriptor-attributesbits (equal (code-segment-descriptor-attributesbits->dpl (code-segment-descriptor-attributesbits a r c msb-of-type s dpl p avl l d g unknownbits)) (2bits-fix dpl)))
Theorem:
(defthm code-segment-descriptor-attributesbits->dpl-of-write-with-mask (implies (and (fty::bitstruct-read-over-write-hyps x code-segment-descriptor-attributesbits-equiv-under-mask) (code-segment-descriptor-attributesbits-equiv-under-mask x y fty::mask) (equal (logand (lognot fty::mask) 96) 0)) (equal (code-segment-descriptor-attributesbits->dpl x) (code-segment-descriptor-attributesbits->dpl y))))