Hi everyone, I've just written up a new segment on the Wiki about how jump tables work. Since I want to look at implementing my binary search option, I thought I'd document what already exists;
http://wiki.freepascal.org/Case_Compiler_Optimization The "Jump Table" section is what I've added. Can people check to see that I've got it correct? I had to go back and edit it a few times because I got the AT&T and Intel operand ordering mixed up! Gareth aka. Kit
_______________________________________________ fpc-devel maillist - [email protected] http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-devel
