		Search-engine friendly clone of the ACL2 documentation.

Cr0bits

Cr0bits->res1

Access the |X86ISA|::|RES1| field of a cr0bits bit structure.

Signature
(cr0bits->res1 x) → res1
Arguments: x — Guard (cr0bits-p x).
Returns: res1 — Type (10bits-p res1).

Definitions and Theorems

Function: cr0bits->res1$inline

(defun cr0bits->res1$inline (x)
 (declare (xargs :guard (cr0bits-p x)))
 (mbe
    :logic
    (let ((x (cr0bits-fix x)))
      (part-select x :low 6 :width 10))
    :exec (the (unsigned-byte 10)
               (logand (the (unsigned-byte 10) 1023)
                       (the (unsigned-byte 26)
                            (ash (the (unsigned-byte 32) x) -6))))))

Theorem: 10bits-p-of-cr0bits->res1

(defthm 10bits-p-of-cr0bits->res1
  (b* ((res1 (cr0bits->res1$inline x)))
    (10bits-p res1))
  :rule-classes :rewrite)

Theorem: cr0bits->res1$inline-of-cr0bits-fix-x

(defthm cr0bits->res1$inline-of-cr0bits-fix-x
  (equal (cr0bits->res1$inline (cr0bits-fix x))
         (cr0bits->res1$inline x)))

Theorem: cr0bits->res1$inline-cr0bits-equiv-congruence-on-x

(defthm cr0bits->res1$inline-cr0bits-equiv-congruence-on-x
  (implies (cr0bits-equiv x x-equiv)
           (equal (cr0bits->res1$inline x)
                  (cr0bits->res1$inline x-equiv)))
  :rule-classes :congruence)

Theorem: cr0bits->res1-of-cr0bits

(defthm cr0bits->res1-of-cr0bits
 (equal
    (cr0bits->res1 (cr0bits pe mp em
                            ts et ne res1 wp res2 am res3 nw cd pg))
    (10bits-fix res1)))

Theorem: cr0bits->res1-of-write-with-mask

(defthm cr0bits->res1-of-write-with-mask
 (implies
  (and
    (fty::bitstruct-read-over-write-hyps x cr0bits-equiv-under-mask)
    (cr0bits-equiv-under-mask x y fty::mask)
    (equal (logand (lognot fty::mask) 65472)
           0))
  (equal (cr0bits->res1 x)
         (cr0bits->res1 y))))