adjusting: implemented reverse tree for looking up additionals changed in update
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 list_t of pointers to zone nodes, for which it actually is an addiitonal 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
Showing
- Knot.files 2 additions, 0 deletionsKnot.files
- src/knot/Makefile.inc 2 additions, 0 deletionssrc/knot/Makefile.inc
- src/knot/zone/adds_tree.c 232 additions, 0 deletionssrc/knot/zone/adds_tree.c
- src/knot/zone/adds_tree.h 107 additions, 0 deletionssrc/knot/zone/adds_tree.h
- src/knot/zone/adjust.c 28 additions, 10 deletionssrc/knot/zone/adjust.c
- src/knot/zone/contents.c 3 additions, 0 deletionssrc/knot/zone/contents.c
- src/knot/zone/contents.h 2 additions, 0 deletionssrc/knot/zone/contents.h
- src/knot/zone/node.c 1 addition, 4 deletionssrc/knot/zone/node.c
- src/knot/zone/node.h 9 additions, 0 deletionssrc/knot/zone/node.h
- tests-extra/tests/ddns/basic/test.py 20 additions, 0 deletionstests-extra/tests/ddns/basic/test.py
Please register or sign in to comment