4 ms·

This is embarrassing, but... I'm totally stuck on puzzle #2 (Sydney) since the cmp doesn't seem to match up with what's in memory, and I bet that the puzzles wo

This is embarrassing, but... I'm totally stuck on puzzle #2 (Sydney) since the cmp doesn't seem to match up with what's in memory, and I bet that the puzzles won't get any easier from here! Is there a good resource, trove of documentation, or excellent book for those of us who would love to learn how to do this stuff? The tutorial great, but it was definitely pretty basic.

somethingnew 13y ago
Me too! I must be missing something...
- toong 13y ago
  Hint: http://en.wikipedia.org/wiki/Endianness http://en.wikipedia.org/wiki/Endianness
  - Ellipsis753 13y ago
    Thank you. I came to this thread for this.
  - pythoniclifter 13y ago
    Not sure if anyone is still checking comments or not. I'm completely new to reverse engineering, ASM, etc. Looking at the cmp statements I tried the changing the endienness of the address being compared, but I still am not seeing that address. For example, when looking at 'cmp #0x3866, 0x0(r15)', to me this means add 0 to the value of r15 and look up the value at that address and compare that to the value at memory address 0x3866. So I'm changing the endienness of 0x3866 to 0x6683. Is this the correct thought process? Thanks.
    - barrym 13y ago
      http://mspgcc.sourceforge.net/manual/x147.html http://mspgcc.sourceforge.net/manual/x147.html helped me with this.
    - irv 13y ago
      It's been a long time since i've written any asm, but I just did this. You're almost correct; 0x3866 contains 2 pieces of information, 38 and 66. so you should end up with 0x6638