ftlist.h File Reference

#include <ft2build.h>

Include dependency graph for ftlist.h:

Go to the source code of this file.

Typedefs
typedef FT_Error(*	FT_List_Iterator) (FT_ListNode node, void *user)
typedef void(*	FT_List_Destructor) (FT_Memory memory, void *data, void *user)

Functions
FT_BEGIN_HEADER	FT_List_Find (FT_List list, void *data)
	FT_List_Add (FT_List list, FT_ListNode node)
	FT_List_Insert (FT_List list, FT_ListNode node)
	FT_List_Remove (FT_List list, FT_ListNode node)
	FT_List_Up (FT_List list, FT_ListNode node)
	FT_List_Iterate (FT_List list, FT_List_Iterator iterator, void *user)
	FT_List_Finalize (FT_List list, FT_List_Destructor destroy, FT_Memory memory, void *user)

Typedef Documentation

FT_List_Destructor

typedef void(* FT_List_Destructor) (FT_Memory memory, void *data, void *user)

Definition at line 233 of file ftlist.h.

FT_List_Iterator

typedef FT_Error(* FT_List_Iterator) (FT_ListNode node, void *user)

Definition at line 185 of file ftlist.h.

Function Documentation

FT_List_Add()

FT_List_Add	(	FT_List	list,
		FT_ListNode	node
	)

Definition at line 269 of file ftutil.c.

  {
    FT_ListNode  before;
 
 
    if ( !list || !node )
      return;
 
    before = list->tail;
 
    node->next = NULL;
    node->prev = before;
 
    if ( before )
      before->next = node;
    else
      list->head = node;
 
    list->tail = node;
  }

Referenced by ft_add_renderer(), FT_New_Size(), ft_open_face_internal(), and load_truetype_glyph().

FT_List_Finalize()

FT_List_Finalize	(	FT_List	list,
		FT_List_Destructor	destroy,
		FT_Memory	memory,
		void *	user
	)

Definition at line 413 of file ftutil.c.

  {
    FT_ListNode  cur;
 
 
    if ( !list || !memory )
      return;
 
    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 = NULL;
    list->tail = NULL;
  }

Referenced by Destroy_Driver(), destroy_face(), and tt_loader_done().

FT_List_Find()

FT_BEGIN_HEADER FT_List_Find	(	FT_List	list,
		void *	data
	)

Definition at line 244 of file ftutil.c.

  {
    FT_ListNode  cur;
 
 
    if ( !list )
      return NULL;
 
    cur = list->head;
    while ( cur )
    {
      if ( cur->data == data )
        return cur;
 
      cur = cur->next;
    }
 
    return NULL;
  }

Referenced by FT_Done_Face(), FT_Done_Size(), ft_remove_renderer(), FT_Set_Renderer(), load_truetype_glyph(), and T42_Size_Done().

FT_List_Insert()

FT_List_Insert	(	FT_List	list,
		FT_ListNode	node
	)

Definition at line 295 of file ftutil.c.

  {
    FT_ListNode  after;
 
 
    if ( !list || !node )
      return;
 
    after = list->head;
 
    node->next = after;
    node->prev = NULL;
 
    if ( !after )
      list->tail = node;
    else
      after->prev = node;
 
    list->head = node;
  }

FT_List_Iterate()

FT_List_Iterate	(	FT_List	list,
		FT_List_Iterator	iterator,
		void *	user
	)

Definition at line 381 of file ftutil.c.

  {
    FT_ListNode  cur;
    FT_Error     error = FT_Err_Ok;
 
 
    if ( !list || !iterator )
      return FT_THROW( Invalid_Argument );
 
    cur = list->head;
 
    while ( cur )
    {
      FT_ListNode  next = cur->next;
 
 
      error = iterator( cur, user );
      if ( error )
        break;
 
      cur = next;
    }
 
    return error;
  }

FT_List_Remove()

FT_List_Remove	(	FT_List	list,
		FT_ListNode	node
	)

Definition at line 321 of file ftutil.c.

  {
    FT_ListNode  before, after;
 
 
    if ( !list || !node )
      return;
 
    before = node->prev;
    after  = node->next;
 
    if ( before )
      before->next = after;
    else
      list->head = after;
 
    if ( after )
      after->prev = before;
    else
      list->tail = before;
  }

Referenced by FT_Done_Face(), FT_Done_Size(), and ft_remove_renderer().

FT_List_Up()

FT_List_Up	(	FT_List	list,
		FT_ListNode	node
	)

Definition at line 348 of file ftutil.c.

  {
    FT_ListNode  before, after;
 
 
    if ( !list || !node )
      return;
 
    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       = NULL;
    node->next       = list->head;
    list->head->prev = node;
    list->head       = node;
  }

Referenced by FT_Set_Renderer().