blob: 597ec7fad41fa9d23da0747934efd5cae6bfd577 [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 Veillardc9484202001-10-24 12:35:52 +00002<html>
3<head>
Daniel Veillarde1662542002-08-28 11:50:59 +00004<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
Daniel Veillardc332dab2002-03-29 14:08:27 +00005<link rel="SHORTCUT ICON" href="/favicon.ico">
Daniel Veillardc9484202001-10-24 12:35:52 +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 }
Daniel Veillardc9484202001-10-24 12:35:52 +000013--></style>
14<title>A real example</title>
15</head>
16<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">
Daniel Veillard8f40f1e2002-08-28 21:18:45 +000019<a href="http://www.gnome.org/"><img src="gnome2.png" alt="Gnome2 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><div align="left"><a href="http://xmlsoft.org/"><img src="Libxml2-Logo-180x168.gif" alt="Made with Libxml2 Logo"></a></div>
Daniel Veillardc9484202001-10-24 12:35:52 +000020</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>A real example</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>
Daniel Veillard594cf0b2001-10-25 08:09:12 +000027<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">
Daniel Veillardc9484202001-10-24 12:35:52 +000029<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 Veillardc9484202001-10-24 12:35:52 +000031<li><a href="index.html">Home</a></li>
Daniel Veillardc9484202001-10-24 12:35:52 +000032<li><a href="intro.html">Introduction</a></li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000033<li><a href="FAQ.html">FAQ</a></li>
Daniel Veillardc9484202001-10-24 12:35:52 +000034<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 Veillardc9484202001-10-24 12:35:52 +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>
Daniel Veillardc9484202001-10-24 12:35:52 +000043<li><a href="tree.html">The tree output</a></li>
44<li><a href="interface.html">The SAX interface</a></li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000045<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>
Daniel Veillardc9484202001-10-24 12:35:52 +000051<li><a href="entities.html">Entities or no entities</a></li>
52<li><a href="namespaces.html">Namespaces</a></li>
Daniel Veillardb8cfbd12001-10-25 10:53:28 +000053<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 Veillardc9484202001-10-24 12:35:52 +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>
Daniel Veillardfc59c092002-06-05 14:48:26 +000058<li><a href="tutorial/index.html">Tutorial</a></li>
Daniel Veillard594cf0b2001-10-25 08:09:12 +000059<li>
60<a href="xml.html">flat page</a>, <a href="site.xsl">stylesheet</a>
61</li>
Daniel Veillardc9484202001-10-24 12:35:52 +000062</ul></td></tr>
Daniel Veillard594cf0b2001-10-25 08:09:12 +000063</table>
64<table width="100%" border="0" cellspacing="1" cellpadding="3">
Daniel Veillard3bf65be2002-01-23 12:36:34 +000065<tr><td colspan="1" bgcolor="#eecfa1" align="center"><center><b>API Indexes</b></center></td></tr>
66<tr><td bgcolor="#fffacd"><ul>
Daniel Veillardf8592562002-01-23 17:58:17 +000067<li><a href="APIchunk0.html">Alphabetic</a></li>
Daniel Veillard3bf65be2002-01-23 12:36:34 +000068<li><a href="APIconstructors.html">Constructors</a></li>
69<li><a href="APIfunctions.html">Functions/Types</a></li>
70<li><a href="APIfiles.html">Modules</a></li>
71<li><a href="APIsymbols.html">Symbols</a></li>
72</ul></td></tr>
73</table>
74<table width="100%" border="0" cellspacing="1" cellpadding="3">
Daniel Veillard594cf0b2001-10-25 08:09:12 +000075<tr><td colspan="1" bgcolor="#eecfa1" align="center"><center><b>Related links</b></center></td></tr>
Daniel Veillard8acca112002-01-21 09:52:27 +000076<tr><td bgcolor="#fffacd"><ul>
Daniel Veillard594cf0b2001-10-25 08:09:12 +000077<li><a href="http://mail.gnome.org/archives/xml/">Mail archive</a></li>
78<li><a href="http://xmlsoft.org/XSLT/">XSLT libxslt</a></li>
Daniel Veillard4a859202002-01-08 11:49:22 +000079<li><a href="http://phd.cs.unibo.it/gdome2/">DOM gdome2</a></li>
Daniel Veillard2d347fa2002-03-17 10:34:11 +000080<li><a href="http://www.aleksey.com/xmlsec/">XML-DSig xmlsec</a></li>
Daniel Veillard594cf0b2001-10-25 08:09:12 +000081<li><a href="ftp://xmlsoft.org/">FTP</a></li>
82<li><a href="http://www.fh-frankfurt.de/~igor/projects/libxml/">Windows binaries</a></li>
Daniel Veillarddb9dfd92001-11-26 17:25:02 +000083<li><a href="http://garypennington.net/libxml2/">Solaris binaries</a></li>
Daniel Veillardcb7543b2002-09-09 10:54:06 +000084<li><a href="http://www.zveno.com/open_source/libxml2xslt.html">MacOsX binaries</a></li>
Daniel Veillarde6d8e202002-05-02 06:11:10 +000085<li><a href="http://sourceforge.net/projects/libxml2-pas/">Pascal bindings</a></li>
Daniel Veillard2d347fa2002-03-17 10:34:11 +000086<li><a href="http://bugzilla.gnome.org/buglist.cgi?product=libxml&amp;product=libxml2">Bug Tracker</a></li>
Daniel Veillard594cf0b2001-10-25 08:09:12 +000087</ul></td></tr>
88</table>
89</td></tr></table></td>
Daniel Veillardc9484202001-10-24 12:35:52 +000090<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">
91<p>Here is a real size example, where the actual content of the application
92data is not kept in the DOM tree but uses internal structures. It is based on
93a proposal to keep a database of jobs related to Gnome, with an XML based
94storage structure. Here is an <a href="gjobs.xml">XML encoded jobs
95base</a>:</p>
96<pre>&lt;?xml version=&quot;1.0&quot;?&gt;
97&lt;gjob:Helping xmlns:gjob=&quot;http://www.gnome.org/some-location&quot;&gt;
98 &lt;gjob:Jobs&gt;
99
100 &lt;gjob:Job&gt;
101 &lt;gjob:Project ID=&quot;3&quot;/&gt;
102 &lt;gjob:Application&gt;GBackup&lt;/gjob:Application&gt;
103 &lt;gjob:Category&gt;Development&lt;/gjob:Category&gt;
104
105 &lt;gjob:Update&gt;
106 &lt;gjob:Status&gt;Open&lt;/gjob:Status&gt;
107 &lt;gjob:Modified&gt;Mon, 07 Jun 1999 20:27:45 -0400 MET DST&lt;/gjob:Modified&gt;
108 &lt;gjob:Salary&gt;USD 0.00&lt;/gjob:Salary&gt;
109 &lt;/gjob:Update&gt;
110
111 &lt;gjob:Developers&gt;
112 &lt;gjob:Developer&gt;
113 &lt;/gjob:Developer&gt;
114 &lt;/gjob:Developers&gt;
115
116 &lt;gjob:Contact&gt;
117 &lt;gjob:Person&gt;Nathan Clemons&lt;/gjob:Person&gt;
118 &lt;gjob:Email&gt;nathan@windsofstorm.net&lt;/gjob:Email&gt;
119 &lt;gjob:Company&gt;
120 &lt;/gjob:Company&gt;
121 &lt;gjob:Organisation&gt;
122 &lt;/gjob:Organisation&gt;
123 &lt;gjob:Webpage&gt;
124 &lt;/gjob:Webpage&gt;
125 &lt;gjob:Snailmail&gt;
126 &lt;/gjob:Snailmail&gt;
127 &lt;gjob:Phone&gt;
128 &lt;/gjob:Phone&gt;
129 &lt;/gjob:Contact&gt;
130
131 &lt;gjob:Requirements&gt;
132 The program should be released as free software, under the GPL.
133 &lt;/gjob:Requirements&gt;
134
135 &lt;gjob:Skills&gt;
136 &lt;/gjob:Skills&gt;
137
138 &lt;gjob:Details&gt;
139 A GNOME based system that will allow a superuser to configure
140 compressed and uncompressed files and/or file systems to be backed
141 up with a supported media in the system. This should be able to
142 perform via find commands generating a list of files that are passed
143 to tar, dd, cpio, cp, gzip, etc., to be directed to the tape machine
144 or via operations performed on the filesystem itself. Email
145 notification and GUI status display very important.
146 &lt;/gjob:Details&gt;
147
148 &lt;/gjob:Job&gt;
149
150 &lt;/gjob:Jobs&gt;
151&lt;/gjob:Helping&gt;</pre>
152<p>While loading the XML file into an internal DOM tree is a matter of
Daniel Veillard63d83142002-05-20 06:51:05 +0000153calling only a couple of functions, browsing the tree to gather the data and
Daniel Veillardc9484202001-10-24 12:35:52 +0000154generate the internal structures is harder, and more error prone.</p>
155<p>The suggested principle is to be tolerant with respect to the input
156structure. For example, the ordering of the attributes is not significant,
157the XML specification is clear about it. It's also usually a good idea not to
158depend on the order of the children of a given node, unless it really makes
159things harder. Here is some code to parse the information for a person:</p>
160<pre>/*
161 * A person record
162 */
163typedef struct person {
164 char *name;
165 char *email;
166 char *company;
167 char *organisation;
168 char *smail;
169 char *webPage;
170 char *phone;
171} person, *personPtr;
172
173/*
174 * And the code needed to parse it
175 */
176personPtr parsePerson(xmlDocPtr doc, xmlNsPtr ns, xmlNodePtr cur) {
177 personPtr ret = NULL;
178
179DEBUG(&quot;parsePerson\n&quot;);
180 /*
181 * allocate the struct
182 */
183 ret = (personPtr) malloc(sizeof(person));
184 if (ret == NULL) {
185 fprintf(stderr,&quot;out of memory\n&quot;);
186 return(NULL);
187 }
188 memset(ret, 0, sizeof(person));
189
190 /* We don't care what the top level element name is */
191 cur = cur-&gt;xmlChildrenNode;
192 while (cur != NULL) {
193 if ((!strcmp(cur-&gt;name, &quot;Person&quot;)) &amp;&amp; (cur-&gt;ns == ns))
194 ret-&gt;name = xmlNodeListGetString(doc, cur-&gt;xmlChildrenNode, 1);
195 if ((!strcmp(cur-&gt;name, &quot;Email&quot;)) &amp;&amp; (cur-&gt;ns == ns))
196 ret-&gt;email = xmlNodeListGetString(doc, cur-&gt;xmlChildrenNode, 1);
197 cur = cur-&gt;next;
198 }
199
200 return(ret);
201}</pre>
202<p>Here are a couple of things to notice:</p>
203<ul>
204<li>Usually a recursive parsing style is the more convenient one: XML data
Daniel Veillard63d83142002-05-20 06:51:05 +0000205 is by nature subject to repetitive constructs and usually exhibits highly
206 structured patterns.</li>
Daniel Veillard0b28e882002-07-24 23:47:05 +0000207 <li>The two arguments of type <em>xmlDocPtr</em> and <em>xmlNsPtr</em>,
Daniel Veillardc9484202001-10-24 12:35:52 +0000208 i.e. the pointer to the global XML document and the namespace reserved to
209 the application. Document wide information are needed for example to
210 decode entities and it's a good coding practice to define a namespace for
211 your application set of data and test that the element and attributes
212 you're analyzing actually pertains to your application space. This is
213 done by a simple equality test (cur-&gt;ns == ns).</li>
Daniel Veillard0b28e882002-07-24 23:47:05 +0000214 <li>To retrieve text and attributes value, you can use the function
Daniel Veillardc9484202001-10-24 12:35:52 +0000215 <em>xmlNodeListGetString</em> to gather all the text and entity reference
216 nodes generated by the DOM output and produce an single text string.</li>
217</ul>
218<p>Here is another piece of code used to parse another level of the
219structure:</p>
220<pre>#include &lt;libxml/tree.h&gt;
221/*
222 * a Description for a Job
223 */
224typedef struct job {
225 char *projectID;
226 char *application;
227 char *category;
228 personPtr contact;
229 int nbDevelopers;
230 personPtr developers[100]; /* using dynamic alloc is left as an exercise */
231} job, *jobPtr;
232
233/*
234 * And the code needed to parse it
235 */
236jobPtr parseJob(xmlDocPtr doc, xmlNsPtr ns, xmlNodePtr cur) {
237 jobPtr ret = NULL;
238
239DEBUG(&quot;parseJob\n&quot;);
240 /*
241 * allocate the struct
242 */
243 ret = (jobPtr) malloc(sizeof(job));
244 if (ret == NULL) {
245 fprintf(stderr,&quot;out of memory\n&quot;);
246 return(NULL);
247 }
248 memset(ret, 0, sizeof(job));
249
250 /* We don't care what the top level element name is */
251 cur = cur-&gt;xmlChildrenNode;
252 while (cur != NULL) {
253
254 if ((!strcmp(cur-&gt;name, &quot;Project&quot;)) &amp;&amp; (cur-&gt;ns == ns)) {
255 ret-&gt;projectID = xmlGetProp(cur, &quot;ID&quot;);
256 if (ret-&gt;projectID == NULL) {
257 fprintf(stderr, &quot;Project has no ID\n&quot;);
258 }
259 }
260 if ((!strcmp(cur-&gt;name, &quot;Application&quot;)) &amp;&amp; (cur-&gt;ns == ns))
261 ret-&gt;application = xmlNodeListGetString(doc, cur-&gt;xmlChildrenNode, 1);
262 if ((!strcmp(cur-&gt;name, &quot;Category&quot;)) &amp;&amp; (cur-&gt;ns == ns))
263 ret-&gt;category = xmlNodeListGetString(doc, cur-&gt;xmlChildrenNode, 1);
264 if ((!strcmp(cur-&gt;name, &quot;Contact&quot;)) &amp;&amp; (cur-&gt;ns == ns))
265 ret-&gt;contact = parsePerson(doc, ns, cur);
266 cur = cur-&gt;next;
267 }
268
269 return(ret);
270}</pre>
271<p>Once you are used to it, writing this kind of code is quite simple, but
Daniel Veillard63d83142002-05-20 06:51:05 +0000272boring. Ultimately, it could be possible to write stubbers taking either C
Daniel Veillardc9484202001-10-24 12:35:52 +0000273data structure definitions, a set of XML examples or an XML DTD and produce
274the code needed to import and export the content between C data and XML
275storage. This is left as an exercise to the reader :-)</p>
276<p>Feel free to use <a href="example/gjobread.c">the code for the full C
277parsing example</a> as a template, it is also available with Makefile in the
278Gnome CVS base under gnome-xml/example</p>
Daniel Veillard3f4c40f2002-02-13 09:19:28 +0000279<p><a href="bugs.html">Daniel Veillard</a></p>
Daniel Veillardc9484202001-10-24 12:35:52 +0000280</td></tr></table></td></tr></table></td></tr></table></td>
281</tr></table></td></tr></table>
282</body>
283</html>