		Search-engine friendly clone of the ACL2 documentation.

Xcr0bits

!xcr0bits->tiledata-state

Update the |X86ISA|::|TILEDATA-STATE| field of a xcr0bits bit structure.

Signature
(!xcr0bits->tiledata-state tiledata-state x) → new-x
Arguments: tiledata-state — Guard (bitp tiledata-state).; x — Guard (xcr0bits-p x).
Returns: new-x — Type (xcr0bits-p new-x).

Definitions and Theorems

Function: !xcr0bits->tiledata-state$inline

(defun !xcr0bits->tiledata-state$inline (tiledata-state x)
  (declare (xargs :guard (and (bitp tiledata-state)
                              (xcr0bits-p x))))
  (mbe :logic
       (b* ((tiledata-state (mbe :logic (bfix tiledata-state)
                                 :exec tiledata-state))
            (x (xcr0bits-fix x)))
         (part-install tiledata-state x
                       :width 1
                       :low 18))
       :exec
       (the (unsigned-byte 64)
            (logior (the (unsigned-byte 64)
                         (logand (the (unsigned-byte 64) x)
                                 (the (signed-byte 20) -262145)))
                    (the (unsigned-byte 19)
                         (ash (the (unsigned-byte 1) tiledata-state)
                              18))))))

Theorem: xcr0bits-p-of-!xcr0bits->tiledata-state

(defthm xcr0bits-p-of-!xcr0bits->tiledata-state
  (b* ((new-x (!xcr0bits->tiledata-state$inline tiledata-state x)))
    (xcr0bits-p new-x))
  :rule-classes :rewrite)

Theorem: !xcr0bits->tiledata-state$inline-of-bfix-tiledata-state

(defthm !xcr0bits->tiledata-state$inline-of-bfix-tiledata-state
  (equal (!xcr0bits->tiledata-state$inline (bfix tiledata-state)
                                           x)
         (!xcr0bits->tiledata-state$inline tiledata-state x)))

Theorem: !xcr0bits->tiledata-state$inline-bit-equiv-congruence-on-tiledata-state

(defthm
 !xcr0bits->tiledata-state$inline-bit-equiv-congruence-on-tiledata-state
 (implies
  (bit-equiv tiledata-state tiledata-state-equiv)
  (equal (!xcr0bits->tiledata-state$inline tiledata-state x)
         (!xcr0bits->tiledata-state$inline tiledata-state-equiv x)))
 :rule-classes :congruence)

Theorem: !xcr0bits->tiledata-state$inline-of-xcr0bits-fix-x

(defthm !xcr0bits->tiledata-state$inline-of-xcr0bits-fix-x
 (equal
  (!xcr0bits->tiledata-state$inline tiledata-state (xcr0bits-fix x))
  (!xcr0bits->tiledata-state$inline tiledata-state x)))

Theorem: !xcr0bits->tiledata-state$inline-xcr0bits-equiv-congruence-on-x

(defthm
    !xcr0bits->tiledata-state$inline-xcr0bits-equiv-congruence-on-x
 (implies
  (xcr0bits-equiv x x-equiv)
  (equal (!xcr0bits->tiledata-state$inline tiledata-state x)
         (!xcr0bits->tiledata-state$inline tiledata-state x-equiv)))
 :rule-classes :congruence)

Theorem: !xcr0bits->tiledata-state-is-xcr0bits

(defthm !xcr0bits->tiledata-state-is-xcr0bits
  (equal (!xcr0bits->tiledata-state tiledata-state x)
         (change-xcr0bits x
                          :tiledata-state tiledata-state)))

Theorem: xcr0bits->tiledata-state-of-!xcr0bits->tiledata-state

(defthm xcr0bits->tiledata-state-of-!xcr0bits->tiledata-state
  (b* ((?new-x (!xcr0bits->tiledata-state$inline tiledata-state x)))
    (equal (xcr0bits->tiledata-state new-x)
           (bfix tiledata-state))))

Theorem: !xcr0bits->tiledata-state-equiv-under-mask

(defthm !xcr0bits->tiledata-state-equiv-under-mask
  (b* ((?new-x (!xcr0bits->tiledata-state$inline tiledata-state x)))
    (xcr0bits-equiv-under-mask new-x x -262145)))