blob: 2ba3993271139b7d0dc12718bdc2d144bc039e2e [file] [log] [blame]
Daniel Veillard43d3f612001-11-10 11:57:23 +00001<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/1999/REC-html401-19991224/loose.dtd">
Daniel Veillard189446d2000-10-13 10:23:06 +00002<html>
3<head>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +00004<meta content="text/html; charset=ISO-8859-1" http-equiv="Content-Type">
Daniel Veillardc332dab2002-03-29 14:08:27 +00005<link rel="SHORTCUT ICON" href="/favicon.ico">
Daniel Veillardb8cfbd12001-10-25 10:53:28 +00006<style type="text/css"><!--
Daniel Veillard373a4752002-02-21 14:46:29 +00007TD {font-family: Verdana,Arial,Helvetica}
8BODY {font-family: Verdana,Arial,Helvetica; margin-top: 2em; margin-left: 0em; margin-right: 0em}
9H1 {font-family: Verdana,Arial,Helvetica}
10H2 {font-family: Verdana,Arial,Helvetica}
11H3 {font-family: Verdana,Arial,Helvetica}
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000012A:link, A:visited, A:active { text-decoration: underline }
13--></style>
14<title>Memory Management</title>
Daniel Veillard189446d2000-10-13 10:23:06 +000015</head>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000016<body bgcolor="#8b7765" text="#000000" link="#000000" vlink="#000000">
17<table border="0" width="100%" cellpadding="5" cellspacing="0" align="center"><tr>
18<td width="180">
19<a href="http://www.gnome.org/"><img src="smallfootonly.gif" alt="Gnome Logo"></a><a href="http://www.w3.org/Status"><img src="w3c.png" alt="W3C Logo"></a><a href="http://www.redhat.com/"><img src="redhat.gif" alt="Red Hat Logo"></a>
20</td>
21<td><table border="0" width="90%" cellpadding="2" cellspacing="0" align="center" bgcolor="#000000"><tr><td><table width="100%" border="0" cellspacing="1" cellpadding="3" bgcolor="#fffacd"><tr><td align="center">
22<h1>The XML C library for Gnome</h1>
23<h2>Memory Management</h2>
24</td></tr></table></td></tr></table></td>
25</tr></table>
26<table border="0" cellpadding="4" cellspacing="0" width="100%" align="center"><tr><td bgcolor="#8b7765"><table border="0" cellspacing="0" cellpadding="2" width="100%"><tr>
27<td valign="top" width="200" bgcolor="#8b7765"><table border="0" cellspacing="0" cellpadding="1" width="100%" bgcolor="#000000"><tr><td>
28<table width="100%" border="0" cellspacing="1" cellpadding="3">
29<tr><td colspan="1" bgcolor="#eecfa1" align="center"><center><b>Main Menu</b></center></td></tr>
Daniel Veillard8acca112002-01-21 09:52:27 +000030<tr><td bgcolor="#fffacd"><ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000031<li><a href="index.html">Home</a></li>
32<li><a href="intro.html">Introduction</a></li>
33<li><a href="FAQ.html">FAQ</a></li>
34<li><a href="docs.html">Documentation</a></li>
35<li><a href="bugs.html">Reporting bugs and getting help</a></li>
36<li><a href="help.html">How to help</a></li>
37<li><a href="downloads.html">Downloads</a></li>
38<li><a href="news.html">News</a></li>
Daniel Veillard7b602b42002-01-08 13:26:00 +000039<li><a href="XMLinfo.html">XML</a></li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000040<li><a href="XSLT.html">XSLT</a></li>
Daniel Veillard6dbcaf82002-02-20 14:37:47 +000041<li><a href="python.html">Python and bindings</a></li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000042<li><a href="architecture.html">libxml architecture</a></li>
43<li><a href="tree.html">The tree output</a></li>
44<li><a href="interface.html">The SAX interface</a></li>
45<li><a href="xmldtd.html">Validation &amp; DTDs</a></li>
46<li><a href="xmlmem.html">Memory Management</a></li>
47<li><a href="encoding.html">Encodings support</a></li>
48<li><a href="xmlio.html">I/O Interfaces</a></li>
49<li><a href="catalog.html">Catalog support</a></li>
50<li><a href="library.html">The parser interfaces</a></li>
51<li><a href="entities.html">Entities or no entities</a></li>
52<li><a href="namespaces.html">Namespaces</a></li>
53<li><a href="upgrade.html">Upgrading 1.x code</a></li>
Daniel Veillard52dcab32001-10-30 12:51:17 +000054<li><a href="threads.html">Thread safety</a></li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000055<li><a href="DOM.html">DOM Principles</a></li>
56<li><a href="example.html">A real example</a></li>
57<li><a href="contribs.html">Contributions</a></li>
58<li>
59<a href="xml.html">flat page</a>, <a href="site.xsl">stylesheet</a>
60</li>
61</ul></td></tr>
62</table>
63<table width="100%" border="0" cellspacing="1" cellpadding="3">
Daniel Veillard3bf65be2002-01-23 12:36:34 +000064<tr><td colspan="1" bgcolor="#eecfa1" align="center"><center><b>API Indexes</b></center></td></tr>
65<tr><td bgcolor="#fffacd"><ul>
Daniel Veillardf8592562002-01-23 17:58:17 +000066<li><a href="APIchunk0.html">Alphabetic</a></li>
Daniel Veillard3bf65be2002-01-23 12:36:34 +000067<li><a href="APIconstructors.html">Constructors</a></li>
68<li><a href="APIfunctions.html">Functions/Types</a></li>
69<li><a href="APIfiles.html">Modules</a></li>
70<li><a href="APIsymbols.html">Symbols</a></li>
71</ul></td></tr>
72</table>
73<table width="100%" border="0" cellspacing="1" cellpadding="3">
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000074<tr><td colspan="1" bgcolor="#eecfa1" align="center"><center><b>Related links</b></center></td></tr>
Daniel Veillard8acca112002-01-21 09:52:27 +000075<tr><td bgcolor="#fffacd"><ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000076<li><a href="http://mail.gnome.org/archives/xml/">Mail archive</a></li>
77<li><a href="http://xmlsoft.org/XSLT/">XSLT libxslt</a></li>
Daniel Veillard4a859202002-01-08 11:49:22 +000078<li><a href="http://phd.cs.unibo.it/gdome2/">DOM gdome2</a></li>
Daniel Veillard2d347fa2002-03-17 10:34:11 +000079<li><a href="http://www.aleksey.com/xmlsec/">XML-DSig xmlsec</a></li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000080<li><a href="ftp://xmlsoft.org/">FTP</a></li>
81<li><a href="http://www.fh-frankfurt.de/~igor/projects/libxml/">Windows binaries</a></li>
Daniel Veillarddb9dfd92001-11-26 17:25:02 +000082<li><a href="http://garypennington.net/libxml2/">Solaris binaries</a></li>
Daniel Veillard2d347fa2002-03-17 10:34:11 +000083<li><a href="http://bugzilla.gnome.org/buglist.cgi?product=libxml&amp;product=libxml2">Bug Tracker</a></li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000084</ul></td></tr>
85</table>
86</td></tr></table></td>
87<td valign="top" bgcolor="#8b7765"><table border="0" cellspacing="0" cellpadding="1" width="100%"><tr><td><table border="0" cellspacing="0" cellpadding="1" width="100%" bgcolor="#000000"><tr><td><table border="0" cellpadding="3" cellspacing="1" width="100%"><tr><td bgcolor="#fffacd">
Daniel Veillard189446d2000-10-13 10:23:06 +000088<p>Table of Content:</p>
89<ol>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000090<li><a href="#General3">General overview</a></li>
Daniel Veillard9c466822001-10-25 12:03:39 +000091<li><a href="#setting">Setting libxml set of memory routines</a></li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000092<li><a href="#cleanup">Cleaning up after parsing</a></li>
93<li><a href="#Debugging">Debugging routines</a></li>
94<li><a href="#General4">General memory requirements</a></li>
Daniel Veillard189446d2000-10-13 10:23:06 +000095</ol>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000096<h3><a name="General3">General overview</a></h3>
97<p>The module <code><a href="http://xmlsoft.org/html/libxml-xmlmemory.html">xmlmemory.h</a></code>
Daniel Veillard189446d2000-10-13 10:23:06 +000098provides the interfaces to the libxml memory system:</p>
99<ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000100<li>libxml does not use the libc memory allocator directly but xmlFree(),
Daniel Veillard189446d2000-10-13 10:23:06 +0000101 xmlMalloc() and xmlRealloc()</li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000102<li>those routines can be reallocated to a specific set of routine, by
Daniel Veillard189446d2000-10-13 10:23:06 +0000103 default the libc ones i.e. free(), malloc() and realloc()</li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000104<li>the xmlmemory.c module includes a set of debugging routine</li>
Daniel Veillard189446d2000-10-13 10:23:06 +0000105</ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000106<h3><a name="setting">Setting libxml set of memory routines</a></h3>
Daniel Veillard189446d2000-10-13 10:23:06 +0000107<p>It is sometimes useful to not use the default memory allocator, either for
108debugging, analysis or to implement a specific behaviour on memory management
109(like on embedded systems). Two function calls are available to do so:</p>
110<ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000111<li>
Daniel Veillardaf43f632002-03-08 15:05:20 +0000112<a href="http://xmlsoft.org/html/libxml-xmlmemory.html">xmlMemGet
113 ()</a> which return the current set of functions in use by the parser</li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000114<li>
115<a href="http://xmlsoft.org/html/libxml-xmlmemory.html">xmlMemSetup()</a>
Daniel Veillardaf43f632002-03-08 15:05:20 +0000116 which allow to set up a new set of memory allocation functions</li>
Daniel Veillard189446d2000-10-13 10:23:06 +0000117</ul>
Daniel Veillard189446d2000-10-13 10:23:06 +0000118<p>Of course a call to xmlMemSetup() should probably be done before calling
119any other libxml routines (unless you are sure your allocations routines are
120compatibles).</p>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000121<h3><a name="cleanup">Cleaning up after parsing</a></h3>
Daniel Veillard189446d2000-10-13 10:23:06 +0000122<p>Libxml is not stateless, there is a few set of memory structures needing
123allocation before the parser is fully functionnal (some encoding structures
124for example). This also mean that once parsing is finished there is a tiny
125amount of memory (a few hundred bytes) which can be recollected if you don't
126reuse the parser immediately:</p>
127<ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000128<li>
129<a href="http://xmlsoft.org/html/libxml-parser.html">xmlCleanupParser
Daniel Veillardaf43f632002-03-08 15:05:20 +0000130 ()</a> is a centralized routine to free the parsing states. Note that it
131 won't deallocate any produced tree if any (use the xmlFreeDoc() and
132 related routines for this).</li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000133<li>
134<a href="http://xmlsoft.org/html/libxml-parser.html">xmlInitParser
Daniel Veillardaf43f632002-03-08 15:05:20 +0000135 ()</a> is the dual routine allowing to preallocate the parsing state
136 which can be useful for example to avoid initialization reentrancy
137 problems when using libxml in multithreaded applications</li>
Daniel Veillard189446d2000-10-13 10:23:06 +0000138</ul>
Daniel Veillard189446d2000-10-13 10:23:06 +0000139<p>Generally xmlCleanupParser() is safe, if needed the state will be rebuild
140at the next invocation of parser routines, but be careful of the consequences
141in multithreaded applications.</p>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000142<h3><a name="Debugging">Debugging routines</a></h3>
143<p>When configured using --with-mem-debug flag (off by default), libxml uses
144a set of memory allocation debugging routineskeeping track of all allocated
Daniel Veillard189446d2000-10-13 10:23:06 +0000145blocks and the location in the code where the routine was called. A couple of
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000146other debugging routines allow to dump the memory allocated infos to a file
147or call a specific routine when a given block number is allocated:</p>
Daniel Veillard189446d2000-10-13 10:23:06 +0000148<ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000149<li>
150<a href="http://xmlsoft.org/html/libxml-xmlmemory.html">xmlMallocLoc()</a><a href="http://xmlsoft.org/html/libxml-xmlmemory.html">xmlReallocLoc()</a>
151 and <a href="http://xmlsoft.org/html/libxml-xmlmemory.html">xmlMemStrdupLoc()</a>
Daniel Veillard189446d2000-10-13 10:23:06 +0000152 are the memory debugging replacement allocation routines</li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000153<li>
154<a href="http://xmlsoft.org/html/libxml-xmlmemory.html">xmlMemoryDump
Daniel Veillardaf43f632002-03-08 15:05:20 +0000155 ()</a> dumps all the informations about the allocated memory block lefts
156 in the <code>.memdump</code> file</li>
Daniel Veillard189446d2000-10-13 10:23:06 +0000157</ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000158<p>When developping libxml memory debug is enabled, the tests programs call
159xmlMemoryDump () and the &quot;make test&quot; regression tests will check for any
Daniel Veillard189446d2000-10-13 10:23:06 +0000160memory leak during the full regression test sequence, this helps a lot
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000161ensuring that libxml does not leak memory and bullet proof memory
162allocations use (some libc implementations are known to be far too permissive
163resulting in major portability problems!).</p>
Daniel Veillard189446d2000-10-13 10:23:06 +0000164<p>If the .memdump reports a leak, it displays the allocation function and
165also tries to give some informations about the content and structure of the
166allocated blocks left. This is sufficient in most cases to find the culprit,
167but not always. Assuming the allocation problem is reproductible, it is
168possible to find more easilly:</p>
169<ol>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000170<li>write down the block number xxxx not allocated</li>
Daniel Veillarda8a89fe2002-04-12 21:03:34 +0000171<li>export the environement variable XML_MEM_BREAKPOINT=xxxx , the easiest
172 when using GDB is to simply give the command
173 <p><code>set environment XML_MEM_BREAKPOINT xxxx</code></p>
174<p>before running the program.</p>
175</li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000176<li>run the program under a debugger and set a breakpoint on
Daniel Veillard189446d2000-10-13 10:23:06 +0000177 xmlMallocBreakpoint() a specific function called when this precise block
178 is allocated</li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000179<li>when the breakpoint is reached you can then do a fine analysis of the
Daniel Veillard189446d2000-10-13 10:23:06 +0000180 allocation an step to see the condition resulting in the missing
181 deallocation.</li>
182</ol>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000183<p>I used to use a commercial tool to debug libxml memory problems but after
184noticing that it was not detecting memory leaks that simple mechanism was
Daniel Veillarda8a89fe2002-04-12 21:03:34 +0000185used and proved extremely efficient until now. Lately I have also used <a href="http://developer.kde.org/~sewardj/">valgrind</a> with quite some
186success, it is tied to the i386 architecture since it works by emulating the
187processor and instruction set, it is slow but extremely efficient, i.e. it
188spot memory usage errors in a very precise way.</p>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000189<h3><a name="General4">General memory requirements</a></h3>
190<p>How much libxml memory require ? It's hard to tell in average it depends
191of a number of things:</p>
Daniel Veillard189446d2000-10-13 10:23:06 +0000192<ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000193<li>the parser itself should work in a fixed amout of memory, except for
Daniel Veillard189446d2000-10-13 10:23:06 +0000194 information maintained about the stacks of names and entities locations.
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000195 The I/O and encoding handlers will probably account for a few KBytes.
196 This is true for both the XML and HTML parser (though the HTML parser
197 need more state).</li>
198<li>If you are generating the DOM tree then memory requirements will grow
Daniel Veillard189446d2000-10-13 10:23:06 +0000199 nearly lineary with the size of the data. In general for a balanced
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000200 textual document the internal memory requirement is about 4 times the
201 size of the UTF8 serialization of this document (exmple the XML-1.0
Daniel Veillard189446d2000-10-13 10:23:06 +0000202 recommendation is a bit more of 150KBytes and takes 650KBytes of main
203 memory when parsed). Validation will add a amount of memory required for
204 maintaining the external Dtd state which should be linear with the
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000205 complexity of the content model defined by the Dtd</li>
206<li>If you don't care about the advanced features of libxml like
207 validation, DOM, XPath or XPointer, but really need to work fixed memory
208 requirements, then the SAX interface should be used.</li>
Daniel Veillard189446d2000-10-13 10:23:06 +0000209</ul>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000210<p>
Daniel Veillard3f4c40f2002-02-13 09:19:28 +0000211<p><a href="bugs.html">Daniel Veillard</a></p>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +0000212</td></tr></table></td></tr></table></td></tr></table></td>
213</tr></table></td></tr></table>
Daniel Veillard189446d2000-10-13 10:23:06 +0000214</body>
215</html>