Example: 0xAABBCCDD
will turn into 0xDDCCBBAA
My program crashes, due to Access Violation exception right in the first XOR operation.
It seems like there's a better naive solution, using shifting or rotating, but anyways, here's the code:
;; #########################################################################
.486
.model flat, stdcall
option casemap :none ; case sensitive
;; #########################################################################
include \masm32\include\masm32.inc
include \masm32\include\kernel32.inc
includelib \masm32\lib\kernel32.lib
includelib \masm32\lib\masm32.lib
.code
;; The following program will flip the sequence of the bytes in the eax
;; example : 0xAABBCCDD will turn into 0xDDCCBBAA
start:
MOV eax, 0AABBCCDDh
XOR BYTE PTR [eax], al ;; Swap first byte and last byte
XOR al, BYTE PTR [eax]
XOR BYTE PTR [eax], al
XOR BYTE PTR [eax+1], ah ;; Swap 2nd byte of eax and 3rd byte
XOR ah, BYTE PTR [eax+1]
XOR BYTE PTR [eax+1], ah
end_prog:
;;Exit the program, eax is the exit code
push eax
call ExitProcess
END start
What am I doing wrong here? Is there any better solution for this?
Why not simply:
I am not sure what you are trying to do in your program, but can say what the CPU actually tries to do (but can't and that is why crashes):
This one:
Tries to compute an xor operation of the value in the register AL (byte sized) and a value of the byte in memory at address 0AABBCCDDh (the content of EAX register). As long as on this address there is no any memory allocated by the OS, the program crashes with GPF.
The proper byte swapping without using bswap is the following (Thanks to X.J):
An alternative solution, using the
rol
instruction only:I believe, in most cases, this will be ever so slightly faster than using the
xchg
instruction, although I see no reason not to simply usebswap
, which is cleaner and likely faster.How 'bout...
Would that not do what is wanted in one register? I see X.J has already posted that (rotate left, rotate right - same result) Gotta be quick to beat you guys! :)