rdataset.c revision 70e5a7403f0e0a3bd292b8287c5fed5772c15270
596f89167fd3225ea0866a5dc79bdd54c7aafdb6Tinderbox User * Copyright (C) 2004-2007 Internet Systems Consortium, Inc. ("ISC")
21635968f7663163ce914f238fd99e40fdff07a1Tinderbox User * Copyright (C) 1999-2003 Internet Software Consortium.
0c27b3fe77ac1d5094ba3521e8142d9e7973133fMark Andrews * Permission to use, copy, modify, and/or distribute this software for any
0c27b3fe77ac1d5094ba3521e8142d9e7973133fMark Andrews * purpose with or without fee is hereby granted, provided that the above
21635968f7663163ce914f238fd99e40fdff07a1Tinderbox User * copyright notice and this permission notice appear in all copies.
470af54b4ec7ab38ad10a5bd22a0a20664838c99Evan Hunt * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
470af54b4ec7ab38ad10a5bd22a0a20664838c99Evan Hunt * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
470af54b4ec7ab38ad10a5bd22a0a20664838c99Evan Hunt * AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
470af54b4ec7ab38ad10a5bd22a0a20664838c99Evan Hunt * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
470af54b4ec7ab38ad10a5bd22a0a20664838c99Evan Hunt * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
470af54b4ec7ab38ad10a5bd22a0a20664838c99Evan Hunt * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
2baa66562a2f119edffded961d3391f87ff98ec0Ondřej Surý * PERFORMANCE OF THIS SOFTWARE.
470af54b4ec7ab38ad10a5bd22a0a20664838c99Evan Hunt/* $Id: rdataset.c,v 1.79 2007/06/19 23:47:16 tbox Exp $ */
#include <config.h>
#include <stdlib.h>
return (ISC_TRUE);
return (ISC_FALSE);
static isc_result_t
return (ISC_R_NOMORE);
REQUIRE(0);
REQUIRE(0);
NULL,
NULL,
NULL,
NULL,
struct towire_sort {
int key;
static isc_result_t
isc_region_t r;
unsigned int headlen;
count = 0;
unsigned int ncache_opts = 0;
countp));
return (ISC_R_SUCCESS);
return (result);
if (shuffle) {
goto cleanup;
for (i = 0; i < count; i++) {
for (i = 0; i < count; i++) {
for (i = 0; i < count; i++) {
if (j == count)
added = 0;
goto rollback;
if (!question)
goto rollback;
if (!question) {
if (shuffle)
goto rollback;
added++;
if (shuffle) {
if (i == count)
goto rollback;
goto cleanup;
goto cleanup;
*countp = 0;
return (result);
const void *order_arg,
unsigned int options,
unsigned int *countp)
const void *order_arg,
unsigned int options,
unsigned int *countp,
void **state)
unsigned int options,
unsigned int *countp)
return (result);
return (result);
return (ISC_R_SUCCESS);
return (ISC_R_NOTIMPLEMENTED);
return (ISC_R_NOTIMPLEMENTED);
return (ISC_R_FAILURE);
return (ISC_R_FAILURE);
return (ISC_R_FAILURE);