- 02 Dec, 2020 1 commit
-
-
Michael Tremer authored
Signed-off-by:Michael Tremer <michael.tremer@ipfire.org>
-
- 01 Dec, 2020 1 commit
-
-
Michael Tremer authored
We used to simply take the first element from the stack after we have split a network. That is wrong because it is not passing through any filters and no further subnet checks. It could have therefore been that the tree was not entirely flat. Reported-by:
Arne Fitzenreiter <arne_f@ipfire.org> Signed-off-by:
-
- 27 Nov, 2020 5 commits
-
-
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
This cannot happen and generated a compiler warning Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by:
-
- 26 Nov, 2020 4 commits
-
-
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
The list was otherwise not sorted Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by:
-
- 25 Nov, 2020 14 commits
-
-
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
When we check the result for any overlaps, we can cut this short by walking through both lists from start to end and remember the last network that we checked. The next one will by definition be strictly greater and therefore we do not need to check anything before this any more. Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Everything is encoded in IPv6 anyways... Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
The list was unfortunately halved in size every time an element was taken from it, which was great for performance, but shortened the result substantially. Signed-off-by: -
Michael Tremer authored
Signed-off-by:
-
- 24 Nov, 2020 11 commits
-
-
Michael Tremer authored
This is helpful because very often we walk through a list in order and are most interested in the last element. Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
This is now being done immediately instead of creating a new list which is being merged later. Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
When finish splitting networks into many parts, we have a list of subnets with the excluded subnets and merge them together first and put them on the stack again. This is slower than pushing it all onto the stack first and then popping the first element. Signed-off-by: -
Michael Tremer authored
Since the list is always sorted, there is no point in sorting it again... Signed-off-by: -
Michael Tremer authored
The list is now organised so that it is always ordered. This allows us to find if a network is on the list a lot quicker using binary search as well as inserting a new network at the right place. This will benefit loc_network_exclude with very large networks. Signed-off-by:
-
- 20 Nov, 2020 4 commits
-
-
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
There is no point in checking different address families with each other and we do not need to compare addresses when the prefix of the subnet does not fit into the network to check. Signed-off-by: -
Michael Tremer authored
Signed-off-by: -
Michael Tremer authored
This function used to create a network list which always had exactly two elements. Since splitting a network in half always returns two parts, we can simply return them as a pointer. This improves returning the network tree by about 17%. Signed-off-by:
-
