CPYPT, CPYMT, CPYET

Memory Copy, reads and writes unprivileged. These instructions perform a memory copy. The prologue, main, and epilogue instructions are expected to be run in succession and to appear consecutively in memory: CPYPT, then CPYMT, and then CPYET.

CPYPT performs some preconditioning of the arguments suitable for using the CPYMT instruction, and performs an implementation defined amount of the memory copy. CPYMT performs an implementation defined amount of the memory copy. CPYET performs the last part of the memory copy.

For CPYPT, the following saturation logic is applied:

If Xn<63:55> != 000000000, the copy size Xn is saturated to 0x007FFFFFFFFFFFFF.

After that saturation logic is applied, the direction of the memory copy is based on the following algorithm:

If (Xs > Xd) && (Xd + saturated Xn) > Xs, then direction = forward

Elsif (Xs < Xd) && (Xs + saturated Xn) > Xd, then direction = backward

Else direction = implementation defined choice between forward and backward.

The architecture supports two algorithms for the memory copy: option A and option B. Which algorithm is used is implementation defined.

After execution of CPYPT, option A (which results in encoding PSTATE.C = 0):

• PSTATE.{N,Z,V} are set to {0,0,0}.
• If the copy is in the forward direction, then:
  • Xs holds the original Xs + saturated Xn.
  • Xd holds the original Xd + saturated Xn.
  • Xn holds -1* saturated Xn + an implementation defined number of bytes copied.
• If the copy is in the backward direction, then:
  • Xs and Xd are unchanged.
  • Xn holds the saturated value of Xn - an implementation defined number of bytes copied.

After execution of CPYPT, option B (which results in encoding PSTATE.C = 1):

• If the copy is in the forward direction, then:
  • Xs holds the original Xs + an implementation defined number of bytes copied.
  • Xd holds the original Xd + an implementation defined number of bytes copied.
  • Xn holds the saturated Xn - an implementation defined number of bytes copied.
  • PSTATE.{N,Z,V} are set to {0,0,0}.
• If the copy is in the backward direction, then:
  • Xs holds the original Xs + saturated Xn - an implementation defined number of bytes copied.
  • Xd holds the original Xd + saturated Xn - an implementation defined number of bytes copied.
  • Xn holds the saturated Xn - an implementation defined number of bytes copied.
  • PSTATE.{N,Z,V} are set to {1,0,0}.

For CPYMT, option A (encoded by PSTATE.C = 0), the format of the arguments is:

• Xn is treated as a signed 64-bit number.
• If the copy is in the forward direction (Xn is a negative number), then:
  • Xn holds -1* the number of bytes remaining to be copied in the memory copy in total.
  • Xs holds the lowest address that the copy is copied from -Xn.
  • Xd holds the lowest address that the copy is made to -Xn.
  • At the end of the instruction, the value of Xn is written back with -1* the number of bytes remaining to be copied in the memory copy in total.
• If the copy is in the backward direction (Xn is a positive number), then:
  • Xn holds the number of bytes remaining to be copied in the memory copy in total.
  • Xs holds the highest address that the copy is copied from -Xn+1.
  • Xd holds the highest address that the copy is copied to -Xn+1.
  • At the end of the instruction, the value of Xn is written back with the number of bytes remaining to be copied in the memory copy in total.

For CPYMT, option B (encoded by PSTATE.C = 1), the format of the arguments is:

• Xn holds the number of bytes to be copied in the memory copy in total.
• If the copy is in the forward direction (PSTATE.N == 0), then:
  • Xs holds the lowest address that the copy is copied from.
  • Xd holds the lowest address that the copy is copied to.
  • At the end of the instruction:
    • the value of Xn is written back with the number of bytes remaining to be copied in the memory copy in total.
    • the value of Xs is written back with the lowest address that has not been copied from.
    • the value of Xd is written back with the lowest address that has not been copied to.
• If the copy is in the backward direction (PSTATE.N == 1), then:
  • Xs holds the highest address that the copy is copied from +1.
  • Xd holds the highest address that the copy is copied to +1.
  • At the end of the instruction:
    • the value of Xn is written back with the number of bytes remaining to be copied in the memory copy in total.
    • the value of Xs is written back with the highest address that has not been copied from +1.
    • the value of Xd is written back with the highest address that has not been copied to +1.

For CPYET, option A (encoded by PSTATE.C = 0), the format of the arguments is:

• Xn is treated as a signed 64-bit number.
• If the copy is in the forward direction (Xn is a negative number), then:
  • Xn holds -1* the number of bytes remaining to be copied in the memory copy in total.
  • Xs holds the lowest address that the copy is copied from -Xn.
  • Xd holds the lowest address that the copy is made to -Xn.
  • At the end of the instruction, the value of Xn is written back with 0.
• If the copy is in the backward direction (Xn is a positive number), then:
  • Xn holds the number of bytes remaining to be copied in the memory copy in total.
  • Xs holds the highest address that the copy is copied from -Xn+1.
  • Xd holds the highest address that the copy is copied to -Xn+1.
  • At the end of the instruction, the value of Xn is written back with 0.

For CPYET, option B (encoded by PSTATE.C = 1), the format of the arguments is:

• Xn holds the number of bytes to be copied in the memory copy in total.
• If the copy is in the forward direction (PSTATE.N == 0), then:
  • Xs holds the lowest address that the copy is copied from.
  • Xd holds the lowest address that the copy is copied to.
  • At the end of the instruction:
    • the value of Xn is written back with 0.
    • the value of Xs is written back with the lowest address that has not been copied from.
    • the value of Xd is written back with the lowest address that has not been copied to.
• If the copy is in the backward direction (PSTATE.N == 1), then:
  • Xs holds the highest address that the copy is copied from +1.
  • Xd holds the highest address that the copy is copied to +1.
  • At the end of the instruction:
    • the value of Xn is written back with 0.
    • the value of Xs is written back with the highest address that has not been copied from +1.
    • the value of Xd is written back with the highest address that has not been copied to +1.

Integer
(FEAT_MOPS)

if !HaveFeatMOPS() || sz != '00' then UNDEFINED; integer d = UInt(Rd); integer s = UInt(Rs); integer n = UInt(Rn); bits(4) options = op2; boolean rnontemporal = options<3> == '1'; boolean wnontemporal = options<2> == '1'; MOPSStage stage; case op1 of when '00' stage = MOPSStage_Prologue; when '01' stage = MOPSStage_Main; when '10' stage = MOPSStage_Epilogue; otherwise SEE "Memory Copy and Memory Set"; CheckMOPSEnabled(); if s == n || s == d || n == d || d == 31 || s == 31 || n == 31 then Constraint c = ConstrainUnpredictable(Unpredictable_MOPSOVERLAP31); assert c IN {Constraint_UNDEF, Constraint_NOP}; case c of when Constraint_UNDEF UNDEFINED; when Constraint_NOP EndOfInstruction();

Assembler Symbols