reverse parsing: Clearer algorithm
authorIan Jackson <ijackson@chiark.greenend.org.uk>
Thu, 24 Jul 2014 00:02:54 +0000 (01:02 +0100)
committerIan Jackson <ijackson@chiark.greenend.org.uk>
Mon, 13 Oct 2014 00:27:19 +0000 (01:27 +0100)
commita9fb9c21586684482fa259332f46c4453f510ddf
treedf7bc97d0f6c09bae7d7521db49dfe43e1cdd11c
parent4e6c13dfc90a09f8e4ff176df2db6c66a4a37567
reverse parsing: Clearer algorithm

We used to have a kind of open-coded coroutine arrangement for parsing
reverse domains.  This is complicated and confusing.

Instead, when "parsing" the labels, simply stash their locations and
lengths.  Then, at the end, we have all of the information needed to
check, parse and process the whole domain.

Signed-off-by: Ian Jackson <ijackson@chiark.greenend.org.uk>
src/addrfam.c
src/internal.h