list.c revision 355b4669e025ff377602b6fc7caaf30dbc218371
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2003 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*LINTLIBRARY*/
#include <stdlib.h>
#include <stdarg.h>
#include <errno.h>
static int __list_increment = 16;
int
{
int count;
return (-1);
}
sizeof (void *));
}
}
return (0);
}
/*
* list_concatenate() takes in two NULL terminated lists of items (type **)
* and creates a new list with items from list2 appended on the end of
* the list of items from list1. The result is a list (type **). If
* there is a failure, -1 is returned.
*/
int
{
void **list1;
int size1 = 0,
size2 = 0,
new_size = 0;
return (-1);
}
/* list1 + list2 padded to a multiple of _list_increment */
!= NULL) {
int count = 0;
}
return (0);
}
/*
* list_locate() iterates through the list passed in and uses the comparison
* routine and element passed in to find an element in the list. It
* returns the first element matched, or NULL if none exists
*/
void *
{
int current = 0;
return (NULL);
}
void
{
int i, last;
return;
;
--last;
/*
* This doesn't preserve order, and doesn't shrink the allocation if we
* go below % __list_increment == 0. <shrug>
*/
break;
}
}
}