/***********************************************************************
* *
* This software is part of the ast package *
* Copyright (c) 1985-2011 AT&T Intellectual Property *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Intellectual Property *
* *
* A copy of the License is available at *
* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
* *
* Information and Software Systems Research *
* AT&T Research *
* Florham Park NJ *
* *
* Glenn Fowler <gsf@research.att.com> *
* David Korn <dgk@research.att.com> *
* Phong Vo <kpv@research.att.com> *
* *
***********************************************************************/
#pragma prototyped
#if _PACKAGE_ast
#include <ast.h>
#else
#include <stdint.h>
#endif
#include <ctype.h>
#include <ip6.h>
/*
* convert string to ipv6 network byte order ip address
* with optional prefix bits
* pointer to first unused char placed in *e, even on error
* return 0:ok <0:error
*/
int
{
register unsigned char* b = addr;
register unsigned char* x = b + IP6ADDR;
register unsigned char* z;
register int c;
register uint32_t a;
if (!lex[0])
{
for (c = 0; c < sizeof(lex); ++c)
lex['0'] = 0;
}
while (isspace(*s))
s++;
z = 0;
a = 0;
if (*s)
for (;;)
{
switch (c = lex[*((unsigned char*)s++)])
{
case END:
case PFX:
if ((x - b) < 2)
break;
*b++ = a>>8;
*b++ = a;
break;
case COL:
if ((x - b) < 2)
break;
*b++ = a>>8;
*b++ = a;
a = 0;
if (*s == ':')
{
if (z)
{
s--;
break;
}
z = b;
if ((c = lex[*((unsigned char*)++s)]) >= 16)
{
s++;
break;
}
}
continue;
case DOT:
if (b >= x)
{
s--;
break;
}
*b++ = ((a >> 8) & 0xf) * 100 + ((a >> 4) & 0xf) * 10 + (a & 0xf);
a = 0;
for (;;)
{
switch (c = lex[*((unsigned char*)s++)])
{
case COL:
case END:
case PFX:
if (b < x)
*b++ = a;
a = 0;
break;
case DOT:
if (b >= x)
break;
*b++ = a;
a = 0;
continue;
default:
a = (a * 10) + c;
continue;
}
break;
}
if (c == COL)
{
if (*s == ':')
{
if (z)
{
s--;
break;
}
z = b;
if ((c = lex[*((unsigned char*)++s)]) >= 16)
{
s++;
break;
}
}
continue;
}
break;
default:
a = (a << 4) | c;
continue;
}
break;
}
if (b == addr)
c = END + 1;
else
{
if (z)
{
while (b > z)
*--x = *--b;
while (x > z)
*--x = 0;
}
else
while (b < x)
*b++ = 0;
if (bits)
{
a = 0;
if (c == PFX)
while ((c = lex[*((unsigned char*)s++)]) < 10)
a = a * 10 + c;
*bits = a;
}
}
if (e)
*e = (char*)(s - 1);
return c == END ? 0 : -1;
}