Update bundled freetype to 2.6.1

third_party/freetype/src/base/ftutil.c

 /***************************************************************************/
 /*                                                                         */
 /*  ftutil.c                                                               */
 /*                                                                         */
 /*    FreeType utility file for memory and list management (body).         */
 /*                                                                         */
-/*  Copyright 2002, 2004-2007, 2013 by                                     */
+/*  Copyright 2002-2015 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.                                        */
 /*                                                                         */
 /***************************************************************************/
 
@@ skipping 155 matching lines @@
   }
 
 
   FT_BASE_DEF( FT_Pointer )
   ft_mem_dup( FT_Memory    memory,
               const void*  address,
               FT_ULong     size,
               FT_Error    *p_error )
   {
     FT_Error    error;
-    FT_Pointer  p = ft_mem_qalloc( memory, size, &error );
+    FT_Pointer  p = ft_mem_qalloc( memory, (FT_Long)size, &error );
 
 
     if ( !error && address )
       ft_memcpy( p, address, size );
 
     *p_error = error;
     return p;
   }
 
 
@@ skipping 74 matching lines @@
                FT_ListNode  node )
   {
     FT_ListNode  before;
 
 
     if ( !list || !node )
       return;
 
     before = list->tail;
 
-    node->next = 0;
+    node->next = NULL;
     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;
 
 
     if ( !list || !node )
       return;
 
     after = list->head;
 
     node->next = after;
-    node->prev = 0;
+    node->prev = NULL;
 
     if ( !after )
       list->tail = node;
     else
       after->prev = node;
 
     list->head = node;
   }
 
 
@@ skipping 43 matching lines @@
     if ( !before )
       return;
 
     before->next = after;
 
     if ( after )
       after->prev = before;
     else
       list->tail = before;
 
-    node->prev       = 0;
+    node->prev       = NULL;
     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,
@@ skipping 46 matching lines @@
       void*        data = cur->data;
 
 
       if ( destroy )
         destroy( memory, data, user );
 
       FT_FREE( cur );
       cur = next;
     }
 
-    list->head = 0;
-    list->tail = 0;
+    list->head = NULL;
+    list->tail = NULL;
   }
 
 
 /* END */