Additionals reverse tree

the tree is like a key-value database, with the key being a domain name of a record which is an additional for a record in the zone while the name might be not in the zone; the value is a deduplicated dynarray of pointers to zone nodes, for which it actually is an additional

whenever in an incremental update a record is changed/added with the name of an additional, all the listed nodes must be re-adjusted (re-discovered additionals

previously, we always re-discovered additionals for whole zone

changed milestone to %2.9

added performance label

added 2 commits

• 45dc0cd8 - adjusting: implemented reverse tree for looking up additionals changed in update
• a231354e - additionals_tree: using deduplicated dynarray for storing pointers in nodes

Compare with previous version

added 1 commit

• e56e3055 - fixup

Compare with previous version

added 1 commit

• 5be8b302 - dynarray: fixup

Compare with previous version

added 1 commit

• 2c61983c - fixup3

Compare with previous version

added 1 commit

• 1daf72d9 - adjust: more effective rdataset iteration

Compare with previous version

added 21 commits

• 1daf72d9...62e3c574 - 17 commits from branch master
• 6b088b2b - bugfix: don't incremental adjust when original zone not adjusted previously
• 217e70fa - adjusting: implemented reverse tree for looking up additionals changed in update
• cb8d6cd3 - additionals_tree: using deduplicated dynarray for storing pointers in nodes
• 4f43ba80 - adjust: more effective rdataset iteration

Compare with previous version

merged

mentioned in commit 99b53edf