ASM

How many branches in a loop can be predicted successfully ?
What is a branch ? Classic sense like a tree: if (True) then <- node/evaluation/condition. /\ / \ / \ / \ / \ / \ True Branch False Branch (does not exist) Since there is only one ... 6 May 2008 23:24

begginer question
On 3 maio, 17:11, Robert Redelmeier <red...(a)ev1.net.invalid> wrote: Prime Mover <eple...(a)hotmail.com> wrote in part: You asked about what type of numbers I want. Well, let's start with integers only. Assuming 32 bit unsigned, the code Frank posted is good: mov eax, 7 mov ecx, 4 a... 6 May 2008 23:24

Skybuck presents alternative division method, to be benchmarked ;)
The search is easily optimized if leading zero count instruction is available: vBiggerDivisor := 1 shl 32-LeadingZeroCount; vShifter := 1 shl 32-LeadingZeroCount; vAnder := $FFFFFFFF shr LeadingZeroCount; No more while vTemp > 0 loop necessary. Interesting. Now I go look for a leading zero count replace... 24 Apr 2008 11:50

Skybuck presents Faster Div 7
function SimulatedDiv7( Content : longword ) : longword; inline; var vEightDivisions : longword; begin result := 0; // latency 1 while Content > 7 do // latency 1 + latency 1 = latency 2 begin vEightDivisions := (Content shr 3); // latency 1 + latency 1 = latency 2 Content := (Content and 7) + vEight... 25 Apr 2008 02:10

delete bytes
almas wrote: Hi everybody. Now, my aim is to kill bytes 21h to 2Fh. I found a solution : un first i change them into ~ Next step destroy thooses bytes. Note : if i just have ONE ascii in range 21h-2Fh ; i keep it If i find after such ascii an other one, i just keep one. It can be first or ... 24 Apr 2008 14:15

delete bytes
Hi everybody. Now, my aim is to kill bytes 21h to 2Fh. I found a solution : un first i change them into ~ Next step destroy thooses bytes. Note : if i just have ONE ascii in range 21h-2Fh ; i keep it If i find after such ascii an other one, i just keep one. It can be first or the last, i do not care. Wolf... 23 Apr 2008 04:20

[OT] information
>Campers People are correct in being paranoid of the us xgovernmentx being totally out of control. The NxSxA/FxBxI even have a locked secret court located within the main Justicex Departmentx building that only governmentx employees can visit. It has never turned down a request, and doesn't even need suspic... 22 Apr 2008 11:36

Merit of callee-saved register
Hi, I've a general question about calling conventions and the use of registers across calls. In a book I found this: "For a variable whose range of appearance spans many procedure calls, the use of a callee-saved register is advantageous, because saving and restoring once at the procedure entry and exit respecti... 22 Apr 2008 18:01

OT: Has anyone seen Miss Liberty?
There are plenty of alternatives to a) sending our proprietary code over the unprotected Internet b) disclosing our code to a third party The answer to a) is: don't do it. Get MD/SOO permission to use a courier. The answer to b) is: o Isolated the bug(s) to the smallest ... 21 Apr 2008 23:44

OT: Has anyone seen Miss Liberty?
interoperability of the various cryptography products. Noone has clamored for crackable crypto to be the driving force behind such a standard. It's a very silly thing for them to assert. * "Clinton's Encryption Plan Fits Law and Market" * Letters to the Editor, Mickey Kantor, U.S. Secretary of Commerce, ... 21 Apr 2008 23:44