Can you code?

[method]

'coz I'm pretty fucking sick of working on PeerGuardian and I don't think any changes I make will do it any justice, even logrithmic seaches.

If anybody out there can code a freeware firewall application that doesn't suck up all the CPU or can create an Active-X component that can be called from VC++, VB, etc. - Let me know... you'd get full credit and a load of traffic wherever you want it to go.

Basically, when it comes to firewall stuff, my coding doesn't cut the mustard...

I either find a coder that can do it or I open source PeerGuardian and tell all the emule users to re-code it themselves!

Thanks!!

[riderx]

There's got to be some gpl'd firewall modules out there. imho something like PeerGuardian can only benefit from being open-source

maybe u can help zab?
right now if u know of someone that can help u should post back here.
bye

[SUprEMeBeiNg]

if it was open soure the RIAA would make it void

[zab]

I either find a coder that can do it or I open source PeerGuardian and tell all the emule users to re-code it themselves!

Thanks!!

There's got to be some gpl'd firewall modules out there. imho something like PeerGuardian can only benefit from being open-source

[Spirit of '76]

hi zab nice to see you :gj

[zab]

if it was open soure the RIAA would make it void

and how does that happen?

[zab]

maybe u can help zab?
right now if u know of someone that can help u should post back here.
bye

from what he explains there's either a bug or he's using an inefficient algorithm; if its just a matter of filtering connections from a large list of ips there are several ways to do it (and no, logarithmic search is not the optimal one, if its the kind of flat namespace search I'm thinking of)

If you have the ips resolved you can try simple masking, if you haven't resolved them then keeping the list of ips in a trie can do it. Or you can just look at the code of ipchains/iptables or another open-source firewall implementation.

Again, I think peerguardian should be open-source and if you release it under gpl or bsd license you'll get many volounteers (myself inlcuded).

[stealthspy]

No offense, but I've loved the database much more than the program.

[shellreef]

(and no, logarithmic search is not the optimal one, if its the kind of flat namespace search I'm thinking of)

Logarithmic search is in fact the most optimal best-case, but the non-search hash algorithm would offer the best performance, at the cost of more memory. With only 32 bits of data, collisions shouldn't occur, resulting in O(1) (constant-time performance).

Again, I think peerguardian should be open-source and if you release it under gpl or bsd license you'll get many volounteers (myself inlcuded).

I agree.

[baghdad_steve15]

if it was open soure the RIAA would make it void

It seems that you haven't heard of CVS.


I think its a great Idea to open it up. Maybe someone can port it to linux.