>

>

>Memory does not seem to be released when I free the

list nodes I've allocated

>

NAME="GENERATOR"

CONTENT="Modular DocBook HTML Stylesheet Version 1.79">

REL="HOME"

TITLE="GTK+ FAQ"

HREF="book1.html">

REL="UP"

TITLE="About GLib"

HREF="c866.html">

REL="PREVIOUS"

TITLE="How can I use the doubly linked lists?"

HREF="x885.html">

REL="NEXT"

TITLE="Why use g_print, g_malloc, g_strdup and fellow glib

functions?"

HREF="x899.html">

>

CLASS="SECT1"

BGCOLOR="#FFFFFF"

TEXT="#000000"

LINK="#0000FF"

VLINK="#840084"

ALINK="#0000FF"

>

CLASS="NAVHEADER"

>

SUMMARY="Header navigation table"

WIDTH="100%"

BORDER="0"

CELLPADDING="0"

CELLSPACING="0"

>

>

COLSPAN="3"

ALIGN="center"

>GTK+ FAQ

>

>

>

WIDTH="10%"

ALIGN="left"

VALIGN="bottom"

>

HREF="x885.html"

ACCESSKEY="P"

><<< Previous

>

>

WIDTH="80%"

ALIGN="center"

VALIGN="bottom"

>About GLib

>

WIDTH="10%"

ALIGN="right"

VALIGN="bottom"

>

HREF="x899.html"

ACCESSKEY="N"

>Next >>>

>

>

>

>

ALIGN="LEFT"

WIDTH="100%">

>

CLASS="SECT1"

>

CLASS="SECT1"

>

NAME="AEN892"

>Memory does not seem to be released when I free the

list nodes I've allocated

>

>

>GLib tries to be "intelligent" on this special issue: it

assumes that you are likely to reuse the objects, so caches

the allocated memory. If you do not want to use this behavior,

you'll probably want to set up a special allocator.

>

>To quote Tim Janik:

>

>

CLASS="QUOTE"

>"If you have a certain portion of code that uses *lots*

of GLists or GNodes, and you know you'd better want to release

all of them after a short while, you'd want to use a

GAllocator. Pushing an allocator into g_list will make all

subsequent glist operations private to that allocator's memory

pool (and thus you have to take care to pop the allocator

again, before making any external calls): "

>

>

BORDER="0"

BGCOLOR="#E0E0E0"

WIDTH="100%"

>

>

>

CLASS="PROGRAMLISTING"

>GAllocator *allocator;

GList *list = NULL;

guint i;

/* set a new allocation pool for GList nodes */

allocator = g_allocator_new ("list heap", 1024);

g_list_push_allocator (allocator);

/* do some list operations */

for (i = 0; i < 4096; i++)

  list = g_list_prepend (list, NULL);

list = g_list_reverse (list);

/* beware to pop allocator befor calling external functions */

g_list_pop_allocator ();

gtk_label_set_text (GTK_LABEL (some_label), "some text");

/* and set our private glist pool again */

g_list_push_allocator (allocator);

/* do some list operations */

g_list_free (list);

list = NULL;

for (i = 0; i < 4096; i++)

  list = g_list_prepend (list, NULL);

/* and back out (while freeing all of the list nodes in our pool) */

g_list_pop_allocator ();

g_allocator_free (allocator);

>

>

>

>

>

CLASS="NAVFOOTER"

>

ALIGN="LEFT"

WIDTH="100%">

SUMMARY="Footer navigation table"

WIDTH="100%"

BORDER="0"

CELLPADDING="0"

CELLSPACING="0"

>

>

WIDTH="33%"

ALIGN="left"

VALIGN="top"

>

HREF="x885.html"

ACCESSKEY="P"

><<< Previous

>

>

WIDTH="34%"

ALIGN="center"

VALIGN="top"

>

HREF="book1.html"

ACCESSKEY="H"

>Home

>

>

WIDTH="33%"

ALIGN="right"

VALIGN="top"

>

HREF="x899.html"

ACCESSKEY="N"

>Next >>>

>

>

>

>

WIDTH="33%"

ALIGN="left"

VALIGN="top"

>How can I use the doubly linked lists?

>

WIDTH="34%"

ALIGN="center"

VALIGN="top"

>

HREF="c866.html"

ACCESSKEY="U"

>Up

>

>

WIDTH="33%"

ALIGN="right"

VALIGN="top"

>Why use g_print, g_malloc, g_strdup and fellow glib

functions?

>

>

>

>

>

>