218 lines
5.2 KiB
C
218 lines
5.2 KiB
C
/***************************************************************************/
|
|
/* */
|
|
/* ftlist.c */
|
|
/* */
|
|
/* Generic list support for FreeType (body). */
|
|
/* */
|
|
/* Copyright 1996-2001, 2002 by */
|
|
/* David Turner, Robert Wilhelm, and Werner Lemberg. */
|
|
/* */
|
|
/* This file is part of the FreeType project, and may only be used, */
|
|
/* modified, and distributed under the terms of the FreeType project */
|
|
/* license, LICENSE.TXT. By continuing to use, modify, or distribute */
|
|
/* this file you indicate that you have read the license and */
|
|
/* understand and accept it fully. */
|
|
/* */
|
|
/***************************************************************************/
|
|
|
|
/*************************************************************************/
|
|
/* */
|
|
/* This file implements functions relative to list processing. Its */
|
|
/* data structures are defined in `freetype/internal/ftlist.h'. */
|
|
/* */
|
|
/*************************************************************************/
|
|
|
|
|
|
#include <ft2build.h>
|
|
#include FT_LIST_H
|
|
#include FT_INTERNAL_DEBUG_H
|
|
#include FT_INTERNAL_OBJECTS_H
|
|
|
|
|
|
/*************************************************************************/
|
|
/* */
|
|
/* The macro FT_COMPONENT is used in trace mode. It is an implicit */
|
|
/* parameter of the FT_TRACE() and FT_ERROR() macros, used to print/log */
|
|
/* messages during execution. */
|
|
/* */
|
|
#undef FT_COMPONENT
|
|
#define FT_COMPONENT trace_list
|
|
|
|
|
|
/* documentation is in ftlist.h */
|
|
|
|
FT_EXPORT_DEF( FT_ListNode )
|
|
FT_List_Find( FT_List list,
|
|
void* data )
|
|
{
|
|
FT_ListNode cur;
|
|
|
|
|
|
cur = list->head;
|
|
while ( cur )
|
|
{
|
|
if ( cur->data == data )
|
|
return cur;
|
|
|
|
cur = cur->next;
|
|
}
|
|
|
|
return (FT_ListNode)0;
|
|
}
|
|
|
|
|
|
/* documentation is in ftlist.h */
|
|
|
|
FT_EXPORT_DEF( void )
|
|
FT_List_Add( FT_List list,
|
|
FT_ListNode node )
|
|
{
|
|
FT_ListNode before = list->tail;
|
|
|
|
|
|
node->next = 0;
|
|
node->prev = before;
|
|
|
|
if ( before )
|
|
before->next = node;
|
|
else
|
|
list->head = node;
|
|
|
|
list->tail = node;
|
|
}
|
|
|
|
|
|
/* documentation is in ftlist.h */
|
|
|
|
FT_EXPORT_DEF( void )
|
|
FT_List_Insert( FT_List list,
|
|
FT_ListNode node )
|
|
{
|
|
FT_ListNode after = list->head;
|
|
|
|
|
|
node->next = after;
|
|
node->prev = 0;
|
|
|
|
if ( !after )
|
|
list->tail = node;
|
|
else
|
|
after->prev = node;
|
|
|
|
list->head = node;
|
|
}
|
|
|
|
|
|
/* documentation is in ftlist.h */
|
|
|
|
FT_EXPORT_DEF( void )
|
|
FT_List_Remove( FT_List list,
|
|
FT_ListNode node )
|
|
{
|
|
FT_ListNode before, after;
|
|
|
|
|
|
before = node->prev;
|
|
after = node->next;
|
|
|
|
if ( before )
|
|
before->next = after;
|
|
else
|
|
list->head = after;
|
|
|
|
if ( after )
|
|
after->prev = before;
|
|
else
|
|
list->tail = before;
|
|
}
|
|
|
|
|
|
/* documentation is in ftlist.h */
|
|
|
|
FT_EXPORT_DEF( void )
|
|
FT_List_Up( FT_List list,
|
|
FT_ListNode node )
|
|
{
|
|
FT_ListNode before, after;
|
|
|
|
|
|
before = node->prev;
|
|
after = node->next;
|
|
|
|
/* check whether we are already on top of the list */
|
|
if ( !before )
|
|
return;
|
|
|
|
before->next = after;
|
|
|
|
if ( after )
|
|
after->prev = before;
|
|
else
|
|
list->tail = before;
|
|
|
|
node->prev = 0;
|
|
node->next = list->head;
|
|
list->head->prev = node;
|
|
list->head = node;
|
|
}
|
|
|
|
|
|
/* documentation is in ftlist.h */
|
|
|
|
FT_EXPORT_DEF( FT_Error )
|
|
FT_List_Iterate( FT_List list,
|
|
FT_List_Iterator iterator,
|
|
void* user )
|
|
{
|
|
FT_ListNode cur = list->head;
|
|
FT_Error error = FT_Err_Ok;
|
|
|
|
|
|
while ( cur )
|
|
{
|
|
FT_ListNode next = cur->next;
|
|
|
|
|
|
error = iterator( cur, user );
|
|
if ( error )
|
|
break;
|
|
|
|
cur = next;
|
|
}
|
|
|
|
return error;
|
|
}
|
|
|
|
|
|
/* documentation is in ftlist.h */
|
|
|
|
FT_EXPORT_DEF( void )
|
|
FT_List_Finalize( FT_List list,
|
|
FT_List_Destructor destroy,
|
|
FT_Memory memory,
|
|
void* user )
|
|
{
|
|
FT_ListNode cur;
|
|
|
|
|
|
cur = list->head;
|
|
while ( cur )
|
|
{
|
|
FT_ListNode next = cur->next;
|
|
void* data = cur->data;
|
|
|
|
|
|
if ( destroy )
|
|
destroy( memory, data, user );
|
|
|
|
FT_FREE( cur );
|
|
cur = next;
|
|
}
|
|
|
|
list->head = 0;
|
|
list->tail = 0;
|
|
}
|
|
|
|
|
|
/* END */
|