mirror of
https://gitlab.freedesktop.org/cairo/cairo.git
synced 2026-05-17 03:08:08 +02:00
8fbf50d31d
This is necessary to avoid many portability problems as cairoint.h includes config.h. Without a test, we will regress again, hence add it. The inclusion idiom for cairo now is: #include "cairoint.h" #include "cairo-something.h" #include "cairo-anotherthing-private.h" #include <some-library.h> #include <other-library/other-file.h> Moreover, some standard headers files are included from cairoint.h and need not be included again.
73 lines
2.2 KiB
C
73 lines
2.2 KiB
C
/*
|
|
* Copyright © 2006 Joonas Pihlaja
|
|
*
|
|
* Permission to use, copy, modify, distribute, and sell this software and its
|
|
* documentation for any purpose is hereby granted without fee, provided that
|
|
* the above copyright notice appear in all copies and that both that copyright
|
|
* notice and this permission notice appear in supporting documentation, and
|
|
* that the name of the copyright holders not be used in advertising or
|
|
* publicity pertaining to distribution of the software without specific,
|
|
* written prior permission. The copyright holders make no representations
|
|
* about the suitability of this software for any purpose. It is provided "as
|
|
* is" without express or implied warranty.
|
|
*
|
|
* THE COPYRIGHT HOLDERS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
|
|
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
|
|
* EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY SPECIAL, INDIRECT OR
|
|
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
|
|
* DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
|
|
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
|
|
* OF THIS SOFTWARE.
|
|
*/
|
|
|
|
#include "cairoint.h"
|
|
|
|
#include "cairo-freelist-private.h"
|
|
|
|
void
|
|
_cairo_freelist_init (cairo_freelist_t *freelist, unsigned nodesize)
|
|
{
|
|
memset (freelist, 0, sizeof(cairo_freelist_t));
|
|
freelist->nodesize = nodesize;
|
|
}
|
|
|
|
void
|
|
_cairo_freelist_fini (cairo_freelist_t *freelist)
|
|
{
|
|
cairo_freelist_node_t *node = freelist->first_free_node;
|
|
while (node) {
|
|
cairo_freelist_node_t *next = node->next;
|
|
free (node);
|
|
node = next;
|
|
}
|
|
}
|
|
|
|
void *
|
|
_cairo_freelist_alloc (cairo_freelist_t *freelist)
|
|
{
|
|
if (freelist->first_free_node) {
|
|
cairo_freelist_node_t *node = freelist->first_free_node;
|
|
freelist->first_free_node = node->next;
|
|
return (void*)node;
|
|
}
|
|
return malloc (freelist->nodesize);
|
|
}
|
|
|
|
void *
|
|
_cairo_freelist_calloc (cairo_freelist_t *freelist)
|
|
{
|
|
void *node = _cairo_freelist_alloc (freelist);
|
|
if (node)
|
|
memset (node, 0, freelist->nodesize);
|
|
return node;
|
|
}
|
|
|
|
void
|
|
_cairo_freelist_free (cairo_freelist_t *freelist, void *voidnode)
|
|
{
|
|
cairo_freelist_node_t *node = voidnode;
|
|
if (node) {
|
|
node->next = freelist->first_free_node;
|
|
freelist->first_free_node = node;
|
|
}
|
|
}
|