lwres_gabn.c revision 15a44745412679c30a6d022733925af70a38b715
/*
* Copyright (C) 2000 Internet Software Consortium.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM
* DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL
* INTERNET SOFTWARE CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT,
* INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING
* FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
* NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
* WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/* $Id: lwres_gabn.c,v 1.23 2000/07/27 09:53:50 tale Exp $ */
#include <config.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <lwres/lwbuffer.h>
#include <lwres/lwpacket.h>
#include "context_p.h"
#include "assert_p.h"
static void
{
unsigned int i, x;
unsigned char mask[LWRES_ADDR_MAXLEN];
unsigned char sortaddr[LWRES_ADDR_MAXLEN];
unsigned char listaddr[LWRES_ADDR_MAXLEN];
unsigned int length;
/*
* If there is no sortlist, we're done.
*/
if (confdata->sortlistnxt == 0) {
return;
}
for (i = 0 ; i < confdata->sortlistnxt ; i++) {
for (x = 0 ; x < length ; x++)
goto next;
for (x = 0 ; x < length ; x++)
}
next:
}
}
/*
* Get everything that doesn't match any sortlist lines.
*/
}
}
{
unsigned char *buf;
int ret;
return (LWRES_R_NOMEMORY);
pkt->authlength = 0;
if (ret != LWRES_R_SUCCESS) {
return (ret);
}
/*
* Flags.
*/
/*
* Address types we'll accept.
*/
/*
* Put the length and the data. We know this will fit because we
* just checked for it.
*/
lwres_buffer_putuint8(b, 0); /* trailing NUL */
INSIST(LWRES_BUFFER_AVAILABLECOUNT(b) == 0);
return (LWRES_R_SUCCESS);
}
{
unsigned char *buf;
int ret;
int x;
/* naliases, naddrs */
/* real name encoding */
/* each alias */
/* each address */
x = 0;
x++;
}
return (LWRES_R_NOMEMORY);
pkt->authlength = 0;
if (ret != LWRES_R_SUCCESS) {
return (ret);
}
/*
* Check space needed here.
*/
/* Flags. */
/* encode naliases and naddrs */
/* encode the real name */
lwres_buffer_putuint8(b, 0);
/* encode the aliases */
datalen);
lwres_buffer_putuint8(b, 0);
}
/* encode the addresses */
}
INSIST(LWRES_BUFFER_AVAILABLECOUNT(b) == 0);
return (LWRES_R_SUCCESS);
}
{
int ret;
char *name;
return (LWRES_R_FAILURE);
return (LWRES_R_UNEXPECTEDEND);
flags = lwres_buffer_getuint32(b);
/*
* Pull off the name itself
*/
if (ret != LWRES_R_SUCCESS)
return (ret);
if (LWRES_BUFFER_REMAINING(b) != 0)
return (LWRES_R_TRAILINGDATA);
return (LWRES_R_NOMEMORY);
return (LWRES_R_SUCCESS);
}
{
unsigned int x;
return (LWRES_R_FAILURE);
/*
* Pull off the name itself
*/
return (LWRES_R_UNEXPECTEDEND);
flags = lwres_buffer_getuint32(b);
naddrs = lwres_buffer_getuint16(b);
return (LWRES_R_NOMEMORY);
if (naliases > 0) {
goto out;
}
goto out;
}
}
for (x = 0 ; x < naddrs ; x++) {
goto out;
}
}
/*
* Now, pull off the real name.
*/
if (ret != LWRES_R_SUCCESS)
goto out;
/*
* Parse off the aliases.
*/
if (ret != LWRES_R_SUCCESS)
goto out;
}
/*
* Pull off the addresses. We already strung the linked list
* up above.
*/
if (ret != LWRES_R_SUCCESS)
goto out;
}
if (LWRES_BUFFER_REMAINING(b) != 0) {
goto out;
}
/*
* Do the sortlist thing here. After this is done, "addrlist"
* must NOT be used again, since it will be very very bogus.
*/
return (LWRES_R_SUCCESS);
out:
sizeof(lwres_uint16_t) * naliases);
}
}
return (ret);
}
void
{
}
void
{
}
}
}