commit | b1eb94f9c4186bab641c047b58209c7fb78ed144 | [log] [tgz] |
---|---|---|
author | Holger Hans Peter Freyther <zecke@selfish.org> | Mon May 02 16:20:32 2011 +0200 |
committer | Holger Hans Peter Freyther <zecke@selfish.org> | Mon May 02 19:19:15 2011 +0200 |
tree | 70adcb379404ac4484f0d8fbc3e8f2e0100436c4 | |
parent | 914ff1988a88793943608bb596230b3ab0265138 [diff] |
nat: Rewrite the paging handling. The current code tries to find _one_ bsc for a paging message and then continues. The new code will try to find multiple BSCs for each LAC. This is done in preparation of having two BSCs handle the same LAC. This code right now is O(m*n) but it will be worse once paging groups are landed. The code to test the function was reduced to just test the lac lookup code as the other part can not be tested in a standalone setup anymore.