list.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/*
* 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 2005 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* Routines for manipulating linked lists
*/
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include "list.h"
#include "memory.h"
struct list {
void *l_data;
};
/* Add an element to a list */
void
{
}
/* Add an element to a sorted list */
void
{
break;
}
}
/*ARGSUSED2*/
static int
{
}
void *
void *private)
{
void *led;
if (!cmp)
cmp = list_defcmp;
return (led);
}
}
return (NULL);
}
void
{
while (list) {
}
}
/*
* This iterator is specifically designed to tolerate the deletion of the
* node being iterated over.
*/
int
{
int cumrc = 0;
int cbrc;
while (list) {
return (cbrc);
}
return (cumrc);
}
/*ARGSUSED*/
static int
{
return (1);
}
int
{
}
int
{
}
void *
{
}
return (NULL);
}
void *
{
}
void
{
continue;
else
}
/*
* Merges two sorted lists. Equal nodes (as determined by cmp) are retained.
*/
void
{
return;
}
/* Insert at beginning */
} else {
}
} else {
/* Add the rest to the end of list1 */
}
}
}
}