[asterisk-dev] Asterisk 1.6 peer matching working differently

Tilghman Lesher tilghman at mail.jeffandtilghman.com
Thu May 1 08:23:33 CDT 2008

On Wednesday 30 April 2008 15:27:33 Simon Perreault wrote:
> On Wednesday 30 April 2008 16:05:51 Johansson Olle E wrote:
> > With the new code in svn trunk (not 1.6.0) we will match any peer by
> > using hatches.
> Do you mean hashes? If not, then WTF are hatches?


> > We can't really say which one.
> What? It just picks one at random?
> Are you using the usual list-per-hash-bucket data structure? If so, then
> won't the returned peer just be the first matching one in the list from the
> corresponding hash bucket? And doesn't the order of the list follow the
> order of insertion? And if so, where's the problem? ;)

Yes, but since there's more than one hash bucket, the order that results are
returned are not obvious to the user.  While algorithmically predictable,
the casual observer will see them to be somewhat random (though the order
is predictably the same every time).


More information about the asterisk-dev mailing list