Effective address for a load or store instruction [ISA:2.6].
We read an unsigned
Function:
(defun eff-addr (rs1 imm stat feat) (declare (xargs :guard (and (ubyte5p rs1) (ubyte12p imm) (statp stat) (featp feat)))) (declare (xargs :guard (stat-validp stat feat))) (let ((__function__ 'eff-addr)) (declare (ignorable __function__)) (b* ((base (read-xreg-unsigned (ubyte5-fix rs1) stat feat)) (offset (loghead (feat->xlen feat) (logext 12 (ubyte12-fix imm))))) (+ base offset))))
Theorem:
(defthm integerp-of-eff-addr (b* ((addr (eff-addr rs1 imm stat feat))) (integerp addr)) :rule-classes :rewrite)
Theorem:
(defthm eff-addr-of-ubyte5-fix-rs1 (equal (eff-addr (ubyte5-fix rs1) imm stat feat) (eff-addr rs1 imm stat feat)))
Theorem:
(defthm eff-addr-ubyte5-equiv-congruence-on-rs1 (implies (ubyte5-equiv rs1 rs1-equiv) (equal (eff-addr rs1 imm stat feat) (eff-addr rs1-equiv imm stat feat))) :rule-classes :congruence)
Theorem:
(defthm eff-addr-of-ubyte12-fix-imm (equal (eff-addr rs1 (ubyte12-fix imm) stat feat) (eff-addr rs1 imm stat feat)))
Theorem:
(defthm eff-addr-ubyte12-equiv-congruence-on-imm (implies (acl2::ubyte12-equiv imm imm-equiv) (equal (eff-addr rs1 imm stat feat) (eff-addr rs1 imm-equiv stat feat))) :rule-classes :congruence)
Theorem:
(defthm eff-addr-of-stat-fix-stat (equal (eff-addr rs1 imm (stat-fix stat) feat) (eff-addr rs1 imm stat feat)))
Theorem:
(defthm eff-addr-stat-equiv-congruence-on-stat (implies (stat-equiv stat stat-equiv) (equal (eff-addr rs1 imm stat feat) (eff-addr rs1 imm stat-equiv feat))) :rule-classes :congruence)
Theorem:
(defthm eff-addr-of-feat-fix-feat (equal (eff-addr rs1 imm stat (feat-fix feat)) (eff-addr rs1 imm stat feat)))
Theorem:
(defthm eff-addr-feat-equiv-congruence-on-feat (implies (feat-equiv feat feat-equiv) (equal (eff-addr rs1 imm stat feat) (eff-addr rs1 imm stat feat-equiv))) :rule-classes :congruence)