Conflicts:
	src/Makefile.am
	src/libknot/rdata.c
	src/libknot/rrset.c
	src/libknot/util/descriptor.h
	src/libknot/zone/zone-contents.c
	src/zcompile/parser-descriptor.c

- No need for block number now
- Added similar function, but works only on one RR.

- Added better test for next_dname_pointer.
- Small fixes and tweaks here and there
- Disabled tests for knot_rrset_rdata_compare - function is not written yet and is not trivial
- to_wire test still failing, needs a bigger rewrite

Conflicts:
	src/tests/libknot/libknot/rrset_tests.c

refs #2027 @3h

refs #2137

refs #2137

refs #2137

refs @2138

Coverity scan #981011 (Resource leak)

Coverity scan #970911 (Unchecked return value)

- Add missing descriptors.
- Extend descriptor structure with type name.
- Add conversion functions num<->str for types and classes.

refs @2138

Conflicts:

	src/common/descriptor_new.c
	src/common/descriptor_new.h

The attribute is assigned nowhere and is always zero.

- Add missing descriptors.
- Extend descriptor structure with type name.
- Add conversion functions num<->str for types and classes.

refs @2138

Reason is - we rarely get more than a few different RR
types in a node (usually <4). So it makes not much sense
to build an expensive AVL tree and allocate other stuff.
Worst case is O(n) (but probably less) which is OK for this
scenario. If we bothered to order the array on insertion,
we could get O(logN) with binary search then - no extra memory
costs.