ares_parse_srv_reply.c revision a3b55a024b03321be969a892cb0992bad14266af
/*
SSSD
Async resolver - SRV records parsing
Authors:
Jakub Hrozek <jhrozek@redhat.com>
Copyright (C) Red Hat, Inc 2009
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/*
* This code is based on other c-ares parsing licensed as follows:
* Copyright 1998 by the Massachusetts Institute of Technology.
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
*/
#include <netdb.h>
#include <stdlib.h>
#include <string.h>
#include "ares.h"
/* this drags in some private macros c-ares uses */
#include "ares_dns.h"
#include "ares_data.h"
#include "ares_parse_srv_reply.h"
struct ares_srv_reply **srv_out)
{
long len;
struct ares_srv_reply *srv_curr;
/* Set *srv_out to NULL for all failure cases. */
/* Give up if abuf doesn't have room for a header. */
return ARES_EBADRESP;
/* Fetch the question and answer count from the header. */
if (qdcount != 1)
return ARES_EBADRESP;
if (ancount == 0)
return ARES_ENODATA;
/* Expand the name from the question, and skip past the question. */
if (status != ARES_SUCCESS)
return status;
{
return ARES_EBADRESP;
}
/* Examine each answer resource record (RR) in turn. */
for (i = 0; i < (int) ancount; i++)
{
/* Decode the RR up to the data field. */
if (status != ARES_SUCCESS)
{
break;
}
{
break;
}
/* Check if we are really looking at a SRV record */
{
/* parse the SRV record itself */
if (rr_len < 6)
{
break;
}
/* Allocate storage for this SRV answer appending it to the list */
if (!srv_curr)
{
break;
}
if (srv_last)
{
}
else
{
}
vptr += sizeof(const unsigned short);
vptr += sizeof(const unsigned short);
vptr += sizeof(const unsigned short);
if (status != ARES_SUCCESS)
break;
}
/* Don't lose memory in the next iteration */
/* Move on to the next record */
}
if (hostname)
if (rr_name)
/* clean up on error */
if (status != ARES_SUCCESS)
{
if (srv_head)
return status;
}
/* everything looks fine, return the data */
return ARES_SUCCESS;
}