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>
Thu, 24 Jul 2014 01:58:45 +0000 (02:58 +0100)
commit220a115d87fbaf82ac953052fa7458cee6e33ae2
treef633ae302f2a1b80605524040433155678bc51de
parente719af5942771e36ca8ae4d41d2dd5dbf14b71c0
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