Good explanation! Hacker's Delight by Warren is a great book that explains a lot of these low-level tricks https://www.amazon.com/Hackers-Delight-2nd-Henry-Warren/dp/0321842685 …. Also you may be interested in my slides entitled "Compiler Optimizations for Reverse Engineers"https://www.msreverseengineering.com/blog/2014/6/23/compiler-optimizations-for-reverse-engineers …
-
-
-
Hey! Actually I've already read your awesome presentation today, thanks! I will certainly order this book.
I also written this for my own documentation and to understand it better;)
Kraj razgovora
Novi razgovor -
-
-
You might want to see the resulting code of different compilers and options, with
@CompileExplore at http://gcc.godbolt.org (thanks again@mattgodbolt ) -
I cover this particular optimisation in my CppCon talk, I think. There's a bunch of them (if not the CppCon talk, it'll be one of the others...)
- Još 6 drugih odgovora
Novi razgovor -
-
-
Indeed, interesting use of "Unsigned Multiply" to get the address. This is a common optimization on the compiler, for example to make a multiplication: mov ax, 2 ; ax = 2 mov cx, 10 ; cx = 10 mul cx ; ax = ax * cx -> ax = 20
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
-
-
I'm curious, what rootkit do u mean... It will be interesting to take a look at your analysis.
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
-
-
Pure gold right here!
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
-
-
Pretty common optimization scheme
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.
) I saw this weird compiler optimization.
I thought I'll start documenting compiler optimizations for reverse engineers. Read my first article in the series: