Hi,
during implementing bit-string label support in "ipv6calc" I run (for
me) into a problem and found no example.
Every example shows prefix lengths in 4 bit boundaries :-(
Printing prefices:
1) "Standard":
3ffe:ffff:0123:4567:89ab:cdef:0011:2233/64
-> \[x3ffeffff01234567/64]
2) Now what about:
3ffe:ffff:0123:4567:89ab:cdef:0011:2233/63
-> \[x3ffeffff01234566/63] ?
or
3ffe:ffff:0123:4567:89ab:cdef:0011:2233/65
-> \[x3ffeffff012345678/65] ?
Is this ok, keeping most significant bits aligned?
Printing suffices:
3) "Standard":
3ffe:ffff:0123:4567:89ab:cdef:0011:2233/64
-> \[x89abcdef00112233/64]
4) Now what about:
3ffe:ffff:0123:4567:89ab:cdef:0011:2233/63
-> \[x189abcdef00112233/65] ?
or
3ffe:ffff:0123:4567:89ab:cdef:0011:2233/65
-> \[x09abcdef00112233/63]
Is this ok, keeping now least significant bits aligned?
If both to "yes", this isn't a unique representation because who
decides when to use which bits.
Major question:
from which position are the bits are counted and displayed aligned?
>From the left one or from the right one?
Has anyone a definition or examples available?
Looks like either suffices or prefixes have to be shifted bitwise in
displaying resulting in not easy recogniced values afterwards.
RFC 2874 doesn't really help me, perhaps because of my less English
knowlegde...
Peter
--------------------------------------------------------------------
IETF IPng Working Group Mailing List
IPng Home Page: http://playground.sun.com/ipng
FTP archive: ftp://playground.sun.com/pub/ipng
Direct all administrative requests to [EMAIL PROTECTED]
--------------------------------------------------------------------
