7 ms·
> Would text based software even be usable with this? I just wrote a quick C program to find the primes less than 100000 and compiled it with gcc and movcc. I
by schoen 5y ago
> Would text based software even be usable with this?
I just wrote a quick C program to find the primes less than 100000 and compiled it with gcc and movcc. I wouldn't say it's, you know, fast, but I'm impressed at how it does finish in an amount of time that I was willing to wait.
$ time ./primes.gcc | wc -l
9592
real 0m0.035s
user 0m0.031s
sys 0m0.012s
$ time ./primes.movcc | wc -l
9592
real 0m10.511s
user 0m8.289s
sys 0m2.228s
It looks like the reason that it spent so much time in syscalls is that it somehow uses signals for control flow. (I'm not quite sure how that works.)
- eadler 5y agomovccc uses a faulting mov instruction to complete the execution loop. without this a jmp is required for infinite execution. see https://github.com/xoreaxeaxeax/movfuscator/blob/master/movfuscator/movfuscator.c#L868 https://github.com/xoreaxeaxeax/movfuscator/blob/master/movf... and https://github.com/xoreaxeaxeax/movfuscator/blob/master/movfuscator/movfuscator.c#L2400 https://github.com/xoreaxeaxeax/movfuscator/blob/master/movf...
- diydsp 5y agoCould that tbeoretically be replaced with a conditional move to recoup?