		Search-engine friendly clone of the ACL2 documentation.

Semantics

Exec-remu

Semanics of the REMU instruction [ISA:12.2].

Signature
(exec-remu rd rs1 rs2 stat feat) → new-stat
Arguments: rd — Guard (ubyte5p rd).; rs1 — Guard (ubyte5p rs1).; rs2 — Guard (ubyte5p rs2).; stat — Guard (statp stat).; feat — Guard (featp feat).
Returns: new-stat — Type (statp new-stat).

We read two unsigned XLEN-bit integers from rs1 and rs2. We calculate the remainder of the first by the second, based on division towards 0; if the divisor is 0, the result is the dividend (see Table 11 in [ISA:12.2]). We write the result to rd. We increment the program counter.

Definitions and Theorems

Function: exec-remu

(defun exec-remu (rd rs1 rs2 stat feat)
  (declare (xargs :guard (and (ubyte5p rd)
                              (ubyte5p rs1)
                              (ubyte5p rs2)
                              (statp stat)
                              (featp feat))))
  (declare (xargs :guard (and (feat-mp feat)
                              (stat-validp stat feat)
                              (< (lnfix rd) (feat->xnum feat))
                              (< (lnfix rs1) (feat->xnum feat))
                              (< (lnfix rs2) (feat->xnum feat)))))
  (let ((__function__ 'exec-remu))
    (declare (ignorable __function__))
    (b* ((rs1-operand (read-xreg-unsigned (ubyte5-fix rs1)
                                          stat feat))
         (rs2-operand (read-xreg-unsigned (ubyte5-fix rs2)
                                          stat feat))
         (result (if (= rs2-operand 0)
                     rs1-operand
                   (rem rs1-operand rs2-operand)))
         (stat (write-xreg (ubyte5-fix rd)
                           result stat feat))
         (stat (inc4-pc stat feat)))
      stat)))

Theorem: statp-of-exec-remu

(defthm statp-of-exec-remu
  (b* ((new-stat (exec-remu rd rs1 rs2 stat feat)))
    (statp new-stat))
  :rule-classes :rewrite)

Theorem: stat-validp-of-exec-remu

(defthm stat-validp-of-exec-remu
  (implies (and (stat-validp stat feat)
                (< (lnfix rd) (feat->xnum feat)))
           (b* ((?new-stat (exec-remu rd rs1 rs2 stat feat)))
             (stat-validp new-stat feat))))

Theorem: exec-remu-of-ubyte5-fix-rd

(defthm exec-remu-of-ubyte5-fix-rd
  (equal (exec-remu (ubyte5-fix rd)
                    rs1 rs2 stat feat)
         (exec-remu rd rs1 rs2 stat feat)))

Theorem: exec-remu-ubyte5-equiv-congruence-on-rd

(defthm exec-remu-ubyte5-equiv-congruence-on-rd
  (implies (ubyte5-equiv rd rd-equiv)
           (equal (exec-remu rd rs1 rs2 stat feat)
                  (exec-remu rd-equiv rs1 rs2 stat feat)))
  :rule-classes :congruence)

Theorem: exec-remu-of-ubyte5-fix-rs1

(defthm exec-remu-of-ubyte5-fix-rs1
  (equal (exec-remu rd (ubyte5-fix rs1)
                    rs2 stat feat)
         (exec-remu rd rs1 rs2 stat feat)))

Theorem: exec-remu-ubyte5-equiv-congruence-on-rs1

(defthm exec-remu-ubyte5-equiv-congruence-on-rs1
  (implies (ubyte5-equiv rs1 rs1-equiv)
           (equal (exec-remu rd rs1 rs2 stat feat)
                  (exec-remu rd rs1-equiv rs2 stat feat)))
  :rule-classes :congruence)

Theorem: exec-remu-of-ubyte5-fix-rs2

(defthm exec-remu-of-ubyte5-fix-rs2
  (equal (exec-remu rd rs1 (ubyte5-fix rs2)
                    stat feat)
         (exec-remu rd rs1 rs2 stat feat)))

Theorem: exec-remu-ubyte5-equiv-congruence-on-rs2

(defthm exec-remu-ubyte5-equiv-congruence-on-rs2
  (implies (ubyte5-equiv rs2 rs2-equiv)
           (equal (exec-remu rd rs1 rs2 stat feat)
                  (exec-remu rd rs1 rs2-equiv stat feat)))
  :rule-classes :congruence)

Theorem: exec-remu-of-stat-fix-stat

(defthm exec-remu-of-stat-fix-stat
  (equal (exec-remu rd rs1 rs2 (stat-fix stat)
                    feat)
         (exec-remu rd rs1 rs2 stat feat)))

Theorem: exec-remu-stat-equiv-congruence-on-stat

(defthm exec-remu-stat-equiv-congruence-on-stat
  (implies (stat-equiv stat stat-equiv)
           (equal (exec-remu rd rs1 rs2 stat feat)
                  (exec-remu rd rs1 rs2 stat-equiv feat)))
  :rule-classes :congruence)

Theorem: exec-remu-of-feat-fix-feat

(defthm exec-remu-of-feat-fix-feat
  (equal (exec-remu rd rs1 rs2 stat (feat-fix feat))
         (exec-remu rd rs1 rs2 stat feat)))

Theorem: exec-remu-feat-equiv-congruence-on-feat

(defthm exec-remu-feat-equiv-congruence-on-feat
  (implies (feat-equiv feat feat-equiv)
           (equal (exec-remu rd rs1 rs2 stat feat)
                  (exec-remu rd rs1 rs2 stat feat-equiv)))
  :rule-classes :congruence)