-
Website
http://phildawes.net/blog/ -
Original page
http://www.phildawes.net/blog/2008/09/12/searching-arrays-in-x86-assembler-with-a-bloom-filter-pt-3/ -
Subscribe
All Comments -
Community
-
Top Commenters
-
danja
4 comments · 4 points
-
phildawes
5 comments · 1 points
-
Dominic Sayers
1 comment · 1 points
-
David W.
2 comments · 1 points
-
ryantm
1 comment · 1 points
-
-
Popular Threads
-
Phil Dawes Stuff >> Idea for a global interpreter lock optimized for low contention
2 weeks ago · 3 comments
-
Phil Dawes Stuff >> Hand-coding multi-platform assembler using Factor compiler intrinsics
1 month ago · 1 comment
-
Phil Dawes Stuff >> Idea for a global interpreter lock optimized for low contention
But why bother? bt r,r and bt r,i are only 1 uop on a Core2. Check the instruction timings here: http://www.agner.org/optimize/
Use mov (%eax,%edi,4), %edi and drop the shl $0x2, %edi.
> Hi Phil,
>
> I couldn't post a comment on your blog for some reason so I'm posting
> this to the list instead.
>
> The seq>hash word you write already exists in the sets vocabulary, its
> called unique.
>
> And (prepare-filter) looks nicer if you use fry:
>
> : (prepare-filter) ( filter seq -- )
> '[ 1048576 mod _ set-bit ] each ;
>
> Slava