mirror of
https://github.com/transmission/transmission
synced 2024-12-26 09:37:56 +00:00
138 lines
2.8 KiB
C
138 lines
2.8 KiB
C
/*
|
|
* This file Copyright (C) 2007 Charles Kerr <charles@rebelbase.com>
|
|
*
|
|
* This file is licensed by the GPL version 2. Works owned by the
|
|
* Transmission project are granted a special exemption to clause 2(b)
|
|
* so that the bulk of its code can remain under the MIT license.
|
|
* This exemption does not extend to derived works not owned by
|
|
* the Transmission project.
|
|
*
|
|
* $Id$
|
|
*/
|
|
|
|
#include "transmission.h"
|
|
#include "list.h"
|
|
#include "utils.h"
|
|
|
|
static tr_list_t*
|
|
node_alloc( void )
|
|
{
|
|
return tr_new0( tr_list_t, 1 );
|
|
}
|
|
|
|
static void
|
|
node_free( tr_list_t* node )
|
|
{
|
|
tr_free( node );
|
|
}
|
|
|
|
/***
|
|
****
|
|
***/
|
|
|
|
void
|
|
tr_list_free( tr_list_t** list )
|
|
{
|
|
while( *list )
|
|
{
|
|
tr_list_t * node = *list;
|
|
*list = (*list)->next;
|
|
node_free( node );
|
|
}
|
|
}
|
|
|
|
void
|
|
tr_list_prepend( tr_list_t ** list, void * data )
|
|
{
|
|
tr_list_t * node = node_alloc ();
|
|
node->data = data;
|
|
node->next = *list;
|
|
if( *list )
|
|
(*list)->prev = node;
|
|
*list = node;
|
|
}
|
|
|
|
void
|
|
tr_list_append( tr_list_t ** list, void * data )
|
|
{
|
|
tr_list_t * node = node_alloc( );
|
|
node->data = data;
|
|
if( !*list )
|
|
*list = node;
|
|
else {
|
|
tr_list_t * l = *list;
|
|
while( l->next )
|
|
l = l->next;
|
|
l->next = node;
|
|
node->prev = l;
|
|
}
|
|
}
|
|
|
|
void
|
|
tr_list_insert_sorted( tr_list_t ** list,
|
|
void * data,
|
|
int compare(const void*,const void*) )
|
|
{
|
|
/* find l, the node that we'll insert this data before */
|
|
tr_list_t * l;
|
|
for( l=*list; l!=NULL; l=l->next ) {
|
|
const int c = (compare)( data, l->data );
|
|
if( c <= 0 )
|
|
break;
|
|
}
|
|
|
|
if( l == NULL)
|
|
tr_list_append( list, data );
|
|
else if( l == *list )
|
|
tr_list_prepend( list, data );
|
|
else {
|
|
tr_list_t * node = node_alloc( );
|
|
node->data = data;
|
|
if( l->prev ) { node->prev = l->prev; node->prev->next = node; }
|
|
node->next = l;
|
|
l->prev = node;
|
|
}
|
|
}
|
|
|
|
|
|
tr_list_t*
|
|
tr_list_find_data ( tr_list_t * list, const void * data )
|
|
{
|
|
for(; list; list=list->next )
|
|
if( list->data == data )
|
|
return list;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
void
|
|
tr_list_remove_data ( tr_list_t ** list, const void * data )
|
|
{
|
|
tr_list_t * node = tr_list_find_data( *list, data );
|
|
tr_list_t * prev = node ? node->prev : NULL;
|
|
tr_list_t * next = node ? node->next : NULL;
|
|
if( prev ) prev->next = next;
|
|
if( next ) next->prev = prev;
|
|
if( *list == node ) *list = next;
|
|
node_free( node );
|
|
}
|
|
|
|
tr_list_t*
|
|
tr_list_find ( tr_list_t * list , const void * b, TrListCompareFunc func )
|
|
{
|
|
for( ; list; list=list->next )
|
|
if( !func( list->data, b ) )
|
|
return list;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
void
|
|
tr_list_foreach( tr_list_t * list, TrListForeachFunc func )
|
|
{
|
|
while( list )
|
|
{
|
|
func( list->data );
|
|
list = list->next;
|
|
}
|
|
}
|